Module java.base
Package java.util

Class WeakHashMap<K,V>

java.lang.Object
java.util.AbstractMap<K,V>
java.util.WeakHashMap<K,V>
Type Parameters:
K - the type of keys maintained by this map
V - the type of mapped values
All Implemented Interfaces:
Map<K,V>
public classWeakHashMap<K,V>extendsAbstractMap<K,V>implementsMap<K,V>
Hash table based implementation of theMap interface, withweak keys. An entry in aWeakHashMap will automatically be removed when its key is no longer in ordinary use. More precisely, the presence of a mapping for a given key will not prevent the key from being discarded by the garbage collector, that is, made finalizable, finalized, and then reclaimed. When a key has been discarded its entry is effectively removed from the map, so this class behaves somewhat differently from otherMap implementations.

Both null values and the null key are supported. This class has performance characteristics similar to those of theHashMap class, and has the same efficiency parameters ofinitial capacity andload factor.

Like most collection classes, this class is not synchronized. A synchronizedWeakHashMap may be constructed using theCollections.synchronizedMap method.

This class is intended primarily for use with key objects whoseequals methods test for object identity using the== operator. Once such a key is discarded it can never be recreated, so it is impossible to do a lookup of that key in aWeakHashMap at some later time and be surprised that its entry has been removed. This class will work perfectly well with key objects whoseequals methods are not based upon object identity, such asString instances. With such recreatable key objects, however, the automatic removal ofWeakHashMap entries whose keys have been discarded may prove to be confusing.

The behavior of theWeakHashMap class depends in part upon the actions of the garbage collector, so several familiar (though not required)Map invariants do not hold for this class. Because the garbage collector may discard keys at any time, aWeakHashMap may behave as though an unknown thread is silently removing entries. In particular, even if you synchronize on aWeakHashMap instance and invoke none of its mutator methods, it is possible for thesize method to return smaller values over time, for theisEmpty method to returnfalse and thentrue, for thecontainsKey method to returntrue and laterfalse for a given key, for theget method to return a value for a given key but later returnnull, for theput method to returnnull and theremove method to returnfalse for a key that previously appeared to be in the map, and for successive examinations of the key set, the value collection, and the entry set to yield successively smaller numbers of elements.

Each key object in aWeakHashMap is stored indirectly as the referent of a weak reference. Therefore a key will automatically be removed only after the weak references to it, both inside and outside of the map, have been cleared by the garbage collector.

Implementation note: The value objects in aWeakHashMap are held by ordinary strong references. Thus care should be taken to ensure that value objects do not strongly refer to their own keys, either directly or indirectly, since that will prevent the keys from being discarded. Note that a value object may refer indirectly to its key via theWeakHashMap itself; that is, a value object may strongly refer to some other key object whose associated value object, in turn, strongly refers to the key of the first value object. If the values in the map do not rely on the map holding strong references to them, one way to deal with this is to wrap values themselves withinWeakReferences before inserting, as in:m.put(key, new WeakReference(value)), and then unwrapping upon eachget.

The iterators returned by theiterator method of the collections returned by all of this class's "collection view methods" arefail-fast: if the map is structurally modified at any time after the iterator is created, in any way except through the iterator's ownremove method, the iterator will throw aConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.

Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throwConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness:the fail-fast behavior of iterators should be used only to detect bugs.

This class is a member of the Java Collections Framework.

Since:
1.2
See Also:

  • Constructor Details

    • WeakHashMap

      public WeakHashMap(int initialCapacity, float loadFactor)
      Constructs a new, emptyWeakHashMap with the given initial capacity and the given load factor.
      Parameters:
      initialCapacity - The initial capacity of theWeakHashMap
      loadFactor - The load factor of theWeakHashMap
      Throws:
      IllegalArgumentException - if the initial capacity is negative, or if the load factor is nonpositive.

    • WeakHashMap

      public WeakHashMap(int initialCapacity)
      Constructs a new, emptyWeakHashMap with the given initial capacity and the default load factor (0.75).
      Parameters:
      initialCapacity - The initial capacity of theWeakHashMap
      Throws:
      IllegalArgumentException - if the initial capacity is negative

    • WeakHashMap

      public WeakHashMap()
      Constructs a new, emptyWeakHashMap with the default initial capacity (16) and load factor (0.75).

    • WeakHashMap

      public WeakHashMap(Map<? extendsK,? extendsV> m)
      Constructs a newWeakHashMap with the same mappings as the specified map. TheWeakHashMap is created with the default load factor (0.75) and an initial capacity sufficient to hold the mappings in the specified map.
      Parameters:
      m - the map whose mappings are to be placed in this map
      Throws:
      NullPointerException - if the specified map is null
      Since:
      1.3

  • Method Details

    • size

      public int size()
      Returns the number of key-value mappings in this map. This result is a snapshot, and may not reflect unprocessed entries that will be removed before next attempted access because they are no longer referenced.
      Specified by:
      size in interface Map<K,V>
      Overrides:
      size in class AbstractMap<K,V>
      Returns:
      the number of key-value mappings in this map

    • isEmpty

      public boolean isEmpty()
      Returnstrue if this map contains no key-value mappings. This result is a snapshot, and may not reflect unprocessed entries that will be removed before next attempted access because they are no longer referenced.
      Specified by:
      isEmpty in interface Map<K,V>
      Overrides:
      isEmpty in class AbstractMap<K,V>
      Returns:
      true if this map contains no key-value mappings

    • get

      public V get(Object key)
      Returns the value to which the specified key is mapped, ornull if this map contains no mapping for the key.

      More formally, if this map contains a mapping from a keyk to a valuev such thatObjects.equals(key, k), then this method returnsv; otherwise it returnsnull. (There can be at most one such mapping.)

      A return value ofnull does notnecessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key tonull. ThecontainsKey operation may be used to distinguish these two cases.

      Specified by:
      get in interface Map<K,V>
      Overrides:
      get in class AbstractMap<K,V>
      Parameters:
      key - the key whose associated value is to be returned
      Returns:
      the value to which the specified key is mapped, ornull if this map contains no mapping for the key
      See Also:

    • containsKey

      public boolean containsKey(Object key)
      Returnstrue if this map contains a mapping for the specified key.
      Specified by:
      containsKey in interface Map<K,V>
      Overrides:
      containsKey in class AbstractMap<K,V>
      Parameters:
      key - The key whose presence in this map is to be tested
      Returns:
      true if there is a mapping forkey;false otherwise

    • put

      public V put(K key,V value)
      Associates the specified value with the specified key in this map. If the map previously contained a mapping for this key, the old value is replaced.
      Specified by:
      put in interface Map<K,V>
      Overrides:
      put in class AbstractMap<K,V>
      Parameters:
      key - key with which the specified value is to be associated.
      value - value to be associated with the specified key.
      Returns:
      the previous value associated withkey, ornull if there was no mapping forkey. (Anull return can also indicate that the map previously associatednull withkey.)

    • putAll

      public void putAll(Map<? extendsK,? extendsV> m)
      Copies all of the mappings from the specified map to this map. These mappings will replace any mappings that this map had for any of the keys currently in the specified map.
      Specified by:
      putAll in interface Map<K,V>
      Overrides:
      putAll in class AbstractMap<K,V>
      Parameters:
      m - mappings to be stored in this map.
      Throws:
      NullPointerException - if the specified map is null.

    • remove

      public V remove(Object key)
      Removes the mapping for a key from this weak hash map if it is present. More formally, if this map contains a mapping from keyk to valuev such that(key==null ? k==null : key.equals(k)), that mapping is removed. (The map can contain at most one such mapping.)

      Returns the value to which this map previously associated the key, ornull if the map contained no mapping for the key. A return value ofnull does notnecessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key tonull.

      The map will not contain a mapping for the specified key once the call returns.

      Specified by:
      remove in interface Map<K,V>
      Overrides:
      remove in class AbstractMap<K,V>
      Parameters:
      key - key whose mapping is to be removed from the map
      Returns:
      the previous value associated withkey, ornull if there was no mapping forkey

    • clear

      public void clear()
      Removes all of the mappings from this map. The map will be empty after this call returns.
      Specified by:
      clear in interface Map<K,V>
      Overrides:
      clear in class AbstractMap<K,V>

    • containsValue

      public boolean containsValue(Object value)
      Returnstrue if this map maps one or more keys to the specified value.
      Specified by:
      containsValue in interface Map<K,V>
      Overrides:
      containsValue in class AbstractMap<K,V>
      Parameters:
      value - value whose presence in this map is to be tested
      Returns:
      true if this map maps one or more keys to the specified value

    • keySet

      public Set<K> keySet()
      Returns aSet view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's ownremove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via theIterator.remove,Set.remove,removeAll,retainAll, andclear operations. It does not support theadd oraddAll operations.
      Specified by:
      keySet in interface Map<K,V>
      Overrides:
      keySet in class AbstractMap<K,V>
      Returns:
      a set view of the keys contained in this map

    • values

      public Collection<V> values()
      Returns aCollection view of the values contained in this map. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's ownremove operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via theIterator.remove,Collection.remove,removeAll,retainAll andclear operations. It does not support theadd oraddAll operations.
      Specified by:
      values in interface Map<K,V>
      Overrides:
      values in class AbstractMap<K,V>
      Returns:
      a collection view of the values contained in this map

    • entrySet

      public Set<Map.Entry<K,V>> entrySet()
      Returns aSet view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's ownremove operation, or through thesetValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via theIterator.remove,Set.remove,removeAll,retainAll andclear operations. It does not support theadd oraddAll operations.
      Specified by:
      entrySet in interface Map<K,V>
      Returns:
      a set view of the mappings contained in this map