Home » openjdk-7 » java » util » [javadoc | source]
java.util
abstract class: AbstractHashMap [javadoc | source]
java.lang.Object
   java.util.AbstractMap<K, V>
      java.util.AbstractHashMap

All Implemented Interfaces:
    Map

Implementation of Map interface based on a hash table. [Sun docs]
Fields inherited from java.util.AbstractMap:
keySet,  values
Constructor:
 public AbstractHashMap() 
 public AbstractHashMap(int ignored) 
 public AbstractHashMap(Map<? extends K, ? extends V> toBeCopied) 
 public AbstractHashMap(int ignored,
    float alsoIgnored) 
Method from java.util.AbstractHashMap Summary:
clear,   clone,   containsKey,   containsValue,   entrySet,   equals,   get,   getHashCode,   put,   remove,   size
Methods from java.util.AbstractMap:
clear,   clone,   containsKey,   containsValue,   entrySet,   equals,   get,   hashCode,   isEmpty,   keySet,   put,   putAll,   remove,   size,   toString,   values
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from java.util.AbstractHashMap Detail:
 public  void clear() 
 abstract public Object clone()
 public boolean containsKey(Object key) 
 public boolean containsValue(Object value) 
 public Set<K, V> entrySet() 
 abstract protected boolean equals(Object value1,
    Object value2)
    Subclasses must override to return a whether or not two keys or values are equal.
 public V get(Object key) 
 abstract protected int getHashCode(Object key)
    Subclasses must override to return a hash code for a given key. The key is guaranteed to be non-null and not a String.
 public V put(K key,
    V value) 
 public V remove(Object key) 
 public int size()