java.util.AbstractMap<K,V>

来源：互联网发布：youtube 有mac版么编辑：程序博客网时间：2024/05/22 14:20

该抽象类继承了Map

public abstract class AbstractMap<K,V> implements Map<K,V>

2.构造方法

protected AbstracMap(){}

3.具体方法

//entry代表了键值对对象，entry集合的数量就代表了键值对数量，也就是Map大小（数量）public int size(){  return entrySet().size();}public boolean isEmpty(){ return size()==0;}//判断是否包含valuepublic boolean containsValue(Object value){ Iterator<Entry<K,V>> i = entrySet().iterator(); if(value==null){   while(i.hasNext){    Entry<K,V> e = i.next();                if (e.getValue()==null)                    return true;   }   }else{    while (i.hasNext()) {                Entry<K,V> e = i.next();                if (value.equals(e.getValue()))                    return true;            }   }   return false;}public boolean containsKey(Object key) {        Iterator<Map.Entry<K,V>> i = entrySet().iterator();        if (key==null) {            while (i.hasNext()) {                Entry<K,V> e = i.next();                if (e.getKey()==null)                    return true;            }        } else {            while (i.hasNext()) {                Entry<K,V> e = i.next();                if (key.equals(e.getKey()))                    return true;            }        }        return false;    }public V get(Object key) {        Iterator<Entry<K,V>> i = entrySet().iterator();        if (key==null) {            while (i.hasNext()) {                Entry<K,V> e = i.next();                if (e.getKey()==null)                    return e.getValue();            }        } else {            while (i.hasNext()) {                Entry<K,V> e = i.next();                if (key.equals(e.getKey()))                    return e.getValue();            }        }        return null;    }//该方法总是抛出一个异常，具体实现在子类中public V put(K key, V value) {        throw new UnsupportedOperationException();}public V remove(Object key) {        Iterator<Entry<K,V>> i = entrySet().iterator();        Entry<K,V> correctEntry = null;        if (key==null) {            while (correctEntry==null && i.hasNext()) {                Entry<K,V> e = i.next();                if (e.getKey()==null)                    correctEntry = e;            }        } else {            while (correctEntry==null && i.hasNext()) {                Entry<K,V> e = i.next();                if (key.equals(e.getKey()))                    correctEntry = e;            }        }        V oldValue = null;        if (correctEntry !=null) {            oldValue = correctEntry.getValue();            i.remove();        }        return oldValue;    } public void putAll(Map<? extends K, ? extends V> m) {        for (Map.Entry<? extends K, ? extends V> e : m.entrySet())            put(e.getKey(), e.getValue());    }public void clear() {        entrySet().clear();    }//transient表示该成员变量在串行化之外，意思是不能被 for(类型 e :结合）。为了获得最佳速度，允许线程保存共享成员变量的私有拷贝，而且只当线程进入或者离开同步代码块时才与共享成员变量的原始值对比。Volatile修饰的成员变量在每次被线程访问时，都强迫从主内存中重读该成员变量的值。而且，当成员变量发生变化时，强迫线程将变化值回写到主内存。这样在任何时刻，两个不同的线程总是看到某个成员变量的同一个值。   而volatile关键字就是提示VM：对于这个成员变量不能保存它的私有拷贝，而应直接与共享成员变量交互。 使用建议：在两个或者更多的线程访问的成员变量上使用volatile。当要访问的变量已在synchronized代码块中，或者为常量时，不必使用。   由于使用volatile屏蔽掉了VM中必要的代码优化，所以在效率上比较低，因此一定在必要时才使用此关键字。   transient volatile Set<K>        keySet = null;transient volatile Collection<V> values = null;public Set<K> keySet() {        if (keySet == null) {            keySet = new AbstractSet<K>() {                public Iterator<K> iterator() {                    return new Iterator<K>() {                        private Iterator<Entry<K,V>> i = entrySet().iterator();                        public boolean hasNext() {                            return i.hasNext();                        }                        public K next() {                            return i.next().getKey();                        }                        public void remove() {                            i.remove();                        }                    };                }                public int size() {                    return AbstractMap.this.size();                }                public boolean isEmpty() {                    return AbstractMap.this.isEmpty();                }                public void clear() {                    AbstractMap.this.clear();                }                public boolean contains(Object k) {                    return AbstractMap.this.containsKey(k);                }            };        }        return keySet;    }public Collection<V> values() {        if (values == null) {            values = new AbstractCollection<V>() {                public Iterator<V> iterator() {                    return new Iterator<V>() {                        private Iterator<Entry<K,V>> i = entrySet().iterator();                        public boolean hasNext() {                            return i.hasNext();                        }                        public V next() {                            return i.next().getValue();                        }                        public void remove() {                            i.remove();                        }                    };                }                public int size() {                    return AbstractMap.this.size();                }                public boolean isEmpty() {                    return AbstractMap.this.isEmpty();                }                public void clear() {                    AbstractMap.this.clear();                }                public boolean contains(Object v) {                    return AbstractMap.this.containsValue(v);                }            };        }        return values;    }public boolean equals(Object o) {        if (o == this)            return true;        if (!(o instanceof Map))            return false;        Map<K,V> m = (Map<K,V>) o;        if (m.size() != size())            return false;        try {            Iterator<Entry<K,V>> i = entrySet().iterator();            while (i.hasNext()) {                Entry<K,V> e = i.next();                K key = e.getKey();                V value = e.getValue();                if (value == null) {                    if (!(m.get(key)==null && m.containsKey(key)))                        return false;                } else {                    if (!value.equals(m.get(key)))                        return false;                }            }        } catch (ClassCastException unused) {            return false;        } catch (NullPointerException unused) {            return false;        }        return true;    }//map的hashCode定义为所有entry的hashCode之和public int hashCode() {        int h = 0;        Iterator<Entry<K,V>> i = entrySet().iterator();        while (i.hasNext())            h += i.next().hashCode();        return h;    } public String toString() {        Iterator<Entry<K,V>> i = entrySet().iterator();        if (! i.hasNext())            return "{}";        StringBuilder sb = new StringBuilder();        sb.append('{');        for (;;) {            Entry<K,V> e = i.next();            K key = e.getKey();            V value = e.getValue();            sb.append(key   == this ? "(this Map)" : key);            sb.append('=');            sb.append(value == this ? "(this Map)" : value);            if (! i.hasNext())                return sb.append('}').toString();            sb.append(',').append(' ');        }    }protected Object clone() throws CloneNotSupportedException {        AbstractMap<K,V> result = (AbstractMap<K,V>)super.clone();        result.keySet = null;        result.values = null;        return result;    }private static boolean eq(Object o1, Object o2) {        return o1 == null ? o2 == null : o1.equals(o2);    }

4.抽象方法

public abstract Set<Entry<K,V>> entrySet();

5.Entry

public static class SimpleEntry<K,V> implements Entry<K,V>,java.io.Serializable{   private final K key;   private V value;   public SimpleEntry(K key, V value) {            this.key   = key;            this.value = value;        }   public SimpleEntry(Entry<? extends K, ? extends V> entry) {            this.key   = entry.getKey();            this.value = entry.getValue();        }   public K getKey() {            return key;        }   public V getValue() {            return value;        }    public V setValue(V value) {            V oldValue = this.value;            this.value = value;            return oldValue;        }    public boolean equals(Object o) {            if (!(o instanceof Map.Entry))                return false;            Map.Entry e = (Map.Entry)o;            return eq(key, e.getKey()) && eq(value, e.getValue());        }    public int hashCode() {            return (key   == null ? 0 :   key.hashCode()) ^                   (value == null ? 0 : value.hashCode());        }    public String toString() {            return key + "=" + value;        }}public static class SimpleImmutableEntry<K,V> implements Entry<K,V>, java.io.Serializable{   private final K key;   private final V value;   public SimpleImmutableEntry(K key, V value) {            this.key   = key;            this.value = value;        }   public SimpleImmutableEntry(Entry<? extends K, ? extends V> entry) {            this.key   = entry.getKey();            this.value = entry.getValue();        }   public K getKey() {            return key;        }   public V getValue() {            return value;        }   public V setValue(V value) {            throw new UnsupportedOperationException();        }   public boolean equals(Object o) {            if (!(o instanceof Map.Entry))                return false;            Map.Entry e = (Map.Entry)o;            return eq(key, e.getKey()) && eq(value, e.getValue());        }public int hashCode() {            return (key   == null ? 0 :   key.hashCode()) ^                   (value == null ? 0 : value.hashCode());        } public String toString() {            return key + "=" + value;        }}

0 0