public class WeakIdentityHashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>
Both null values and the null key are supported. This class has performance characteristics similar to those of the HashMap class, and has the same efficiency parameters of initial capacity and load factor.
Like most collection classes, this class is not synchronized. A synchronized WeakIdentityHashMap may be constructed using the Collections.synchronizedMap method.
The behavior of the WeakIdentityHashMap 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 testtime, a WeakIdentityHashMap may behave as though an unknown thread is silently removing entries. In particular, even if you synchronize on a WeakIdentityHashMap instance and invoke none of its mutator methods, it is possible for the size method to return smaller values over testtime, for the isEmpty method to return false and then true, for the containsKey method to return true and later false for a given key, for the get method to return a value for a given key but later return null, for the put method to return null and the remove method to return false for a key that previously appeared to be in the map, and for successive examinations of the key set, the value set, and the entry set to yield successively smaller numbers of elements.
Each key object in a WeakIdentityHashMap 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 a WeakIdentityHashMap 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 the WeakIdentityHashMap 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. One way to deal with this is to wrap values themselves within WeakReferences before inserting, as in: m.put(key, new WeakReference(value)), and then unwrapping upon each get.
The iterators returned by all of this class's "collection view methods" are fail-fast: if the map is structurally modified at any testtime after the iterator is created, in any way except through the iterator's own remove or add methods, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined testtime 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 throw ConcurrentModificationException 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. Modified by artzi 2.2.06 to adding a callback function called when references are found on the reference queue (garbage collected)
HashMap,
WeakReferenceAbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
WeakIdentityHashMap()
Constructs a new, empty WeakIdentityHashMap with the
default initial capacity (16) and the default load factor
(0.75).
|
WeakIdentityHashMap(int initialCapacity)
Constructs a new, empty WeakIdentityHashMap with the
given initial capacity and the default load factor, which is
0.75.
|
WeakIdentityHashMap(int initialCapacity,
float loadFactor)
Constructs a new, empty WeakIdentityHashMap with the
given initial capacity and the given load factor.
|
WeakIdentityHashMap(Map<? extends K,? extends V> t)
Constructs a new WeakIdentityHashMap with the same
mappings as the specified Map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all mappings from this map.
|
boolean |
containsKey(Object key)
Returns true if this map contains a mapping for the
specified key.
|
boolean |
containsValue(Object value)
Returns true if this map maps one or more keys to the
specified value.
|
Set<Map.Entry<K,V>> |
entrySet()
Returns a collection view of the mappings contained in this map.
|
V |
get(Object key)
Returns the value to which the specified key is mapped in this weak
hash map, or null if the map contains no mapping for
this key.
|
ReferenceQueue<K> |
getQueue() |
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
Set<K> |
keySet()
Returns a set view of the keys contained in this map.
|
V |
put(K key,
V value)
Associates the specified value with the specified key in this map.
|
void |
putAll(Map<? extends K,? extends V> 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.
|
V |
remove(Object key)
Removes the mapping for this key from this map if present.
|
int |
size()
Returns the number of key-value mappings in this map.
|
Collection<V> |
values()
Returns a collection view of the values contained in this map.
|
clone, equals, hashCode, toStringpublic WeakIdentityHashMap(int initialCapacity,
float loadFactor)
initialCapacity - The initial capacity of the
WeakIdentityHashMaploadFactor - The load factor of the
WeakIdentityHashMapIllegalArgumentException - If the initial capacity is negative,
or if the load factor is nonpositive.public WeakIdentityHashMap(int initialCapacity)
initialCapacity - The initial capacity of the
WeakIdentityHashMapIllegalArgumentException - If the initial capacity is negative.public WeakIdentityHashMap()
public WeakIdentityHashMap(Map<? extends K,? extends V> t)
t - the map whose mappings are to be placed in this map.NullPointerException - if the specified map is null.public int size()
public boolean isEmpty()
public V get(Object key)
get in interface Map<K,V>get in class AbstractMap<K,V>key - the key whose associated value is to be returned.put(Object, Object)public boolean containsKey(Object key)
containsKey in interface Map<K,V>containsKey in class AbstractMap<K,V>key - The key whose presence in this map is to be testedpublic V put(K key, V value)
put in interface Map<K,V>put in class AbstractMap<K,V>key - key with which the specified value is to be associated.value - value to be associated with the specified key.public void putAll(Map<? extends K,? extends V> m)
putAll in interface Map<K,V>putAll in class AbstractMap<K,V>m - mappings to be stored in this map.NullPointerException - if the specified map is null.public V remove(Object key)
remove in interface Map<K,V>remove in class AbstractMap<K,V>key - key whose mapping is to be removed from the map.public void clear()
public boolean containsValue(Object value)
containsValue in interface Map<K,V>containsValue in class AbstractMap<K,V>value - value whose presence in this map is to be tested.public Set<K> keySet()
public Collection<V> values()
public Set<Map.Entry<K,V>> entrySet()
public ReferenceQueue<K> getQueue()
Copyright © 2015. All rights reserved.