public class IdentityHashMap<K, V>
- Object
- AbstractMap<K, V>
- IdentityHashMap
ImplementsMap<K, V>
IdentityHashMap is a variant on HashMap which tests equality by reference instead of equality by value. Basically, keys and values are compared for equality by checking if their references are equal rather than by calling the “equals” function.
Note: This class intentionally violates the general contract of Map’s on comparing objects by their equals method.
IdentityHashMap uses open addressing (linear probing in particular) for collision resolution. This is different from HashMap which uses Chaining.
Like HashMap, IdentityHashMap is not thread safe, so access by multiple threads must be synchronized by an external mechanism such as Collections.synchronizedMap.
Constructors
public IdentityHashMap() | Creates an IdentityHashMap with default expected maximum size. |
public IdentityHashMap(int maxSize) | Creates an IdentityHashMap with the specified maximum size parameter. |
public IdentityHashMap(Map<? extends K, ? extends V> map) | Creates an IdentityHashMap using the given map as initial values. |
Methods
public void clear() | Removes all elements from this map, leaving it empty. |
public boolean containsKey(Object key) | Returns whether this map contains the specified key. |
public boolean containsValue(Object value) | Returns whether this map contains the specified value. |
public V get(Object key) | Returns the value of the mapping with the specified key. |
public V put(K key, V value) | Maps the specified key to the specified value. |
public void putAll(Map<? extends K, ? extends V> map) | Copies all the mappings in the specified map to this map. |
public V remove(Object key) | Removes the mapping with the specified key from this map. |
public Set<Map.Entry<K, V>> entrySet() | Returns a set containing all of the mappings in this map. |
public Set<K> keySet() | Returns a set of the keys contained in this map. |
public Collection<V> values() | Returns a collection of the values contained in this map. |
public boolean equals(Object object) | Compares this map with other objects. |
public boolean isEmpty() | Returns whether this IdentityHashMap has no elements. |
public int size() | Returns the number of mappings in this IdentityHashMap. |
Inherited nested types
Inherited methods
From AbstractMap
Constructor details
IdentityHashMap
public IdentityHashMap()IdentityHashMap
public IdentityHashMap(int maxSize)Parameters
maxSizeint- The estimated maximum number of entries that will be put in this map.
IdentityHashMap
public IdentityHashMap(Map<? extends K, ? extends V> map)Parameters
mapMap<? extends K, ? extends V>- A map of (key,value) pairs to copy into the IdentityHashMap.
Method details
clear
public void clear()Throws
UnsupportedOperationException- if removing from this map is not supported.
See also
containsKey
public boolean containsKey(Object key)Parameters
keyObject- the key to search for.
Returns
true if this map contains the specified key,
false otherwise.containsValue
public boolean containsValue(Object value)Parameters
valueObject- the value to search for.
Returns
true if this map contains the specified value,
false otherwise.get
public V get(Object key)Parameters
keyObject- the key.
Returns
put
public V put(K key, V value)Parameters
keyK- the key.
valueV- the value.
Returns
null if there was no such mapping.putAll
public void putAll(Map<? extends K, ? extends V> map)Parameters
mapMap<? extends K, ? extends V>- the map to copy mappings from.
Throws
NullPointerException- if
mapisnull. UnsupportedOperationException- if adding to this map is not supported.
ClassCastException- if the class of a key or value is inappropriate for this map.
IllegalArgumentException- if a key or value cannot be added to this map.
remove
public V remove(Object key)Parameters
keyObject- the key of the mapping to remove.
Returns
null if no mapping
for the specified key was found.entrySet
public Set<Map.Entry<K, V>> entrySet()Map.Entry. As the set is backed by this map,
changes in one will be reflected in the other.Returns
keySet
public Set<K> keySet()Returns
values
public Collection<V> values()Returns a collection of the values contained in this map. The collection is backed by this map so changes to one are reflected by the other. The collection supports remove, removeAll, retainAll and clear operations, and it does not support add or addAll operations.
This method returns a collection which is the subclass of
AbstractCollection. The iterator method of this subclass returns a
“wrapper object” over the iterator of map’s entrySet(). The size
method wraps the map’s size method and the contains method wraps
the map’s containsValue method.
The collection is created when this method is called for the first time and returned in response to all subsequent calls. This method may return different collections when multiple concurrent calls occur, since no synchronization is performed.
Returns
equals
public boolean equals(Object object)Parameters
objectObject- the object to compare to.
Returns
isEmpty
public boolean isEmpty()Returns
true if this IdentityHashMap has no elements,
false otherwise.See also
size
public int size()