java.util
public class: WeakHashMap [javadoc |
source]
java.lang.Object
java.util.AbstractMap<K, V>
java.util.WeakHashMap
All Implemented Interfaces:
Map
Direct Known Subclasses:
ClassValueMap, WeakKeyValueMap
Hash table based implementation of the
Map interface, with
weak keys.
An entry in a
WeakHashMap 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 other
Map
implementations.
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 WeakHashMap may be constructed using the
Collections.synchronizedMap
method.
This class is intended primarily for use with key objects whose
equals 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 a
WeakHashMap at some later time and be surprised that its entry
has been removed. This class will work perfectly well with key objects
whose equals methods are not based upon object identity, such
as String instances. With such recreatable key objects,
however, the automatic removal of WeakHashMap entries whose
keys have been discarded may prove to be confusing.
The behavior of the WeakHashMap 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, a
WeakHashMap may behave as though an unknown thread is silently
removing entries. In particular, even if you synchronize on a
WeakHashMap instance and invoke none of its mutator methods, it
is possible for the size method to return smaller values over
time, 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 collection, and
the entry set to yield successively smaller numbers of elements.
Each key object in a WeakHashMap 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
WeakHashMap 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 WeakHashMap 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 the iterator method of the collections
returned by all of this class's "collection view methods" are
fail-fast: if the map is structurally modified at any time after the
iterator is created, in any way except through the iterator's own
remove method, 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 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
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.
| Field Summary |
|---|
| Entry<K, V>[] | table | The table, resized as necessary. Length MUST Always be a power of two. |
| int | modCount | The number of times this WeakHashMap has been structurally modified.
Structural modifications are those that change the number of
mappings in the map or otherwise modify its internal structure
(e.g., rehash). This field is used to make iterators on
Collection-views of the map fail-fast. |
| Method from java.util.WeakHashMap Summary: |
|---|
|
clear, containsKey, containsValue, entrySet, get, getEntry, isEmpty, keySet, put, putAll, remove, removeMapping, resize, size, unmaskNull, values |
| 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.WeakHashMap Detail: |
|---|
 public void clear() {
// clear out ref queue. We don't need to expunge entries
// since table is getting cleared.
while (queue.poll() != null)
;
modCount++;
Arrays.fill(table, null);
size = 0;
// Allocation of array may have caused GC, which may have caused
// additional entries to go stale. Removing these entries from the
// reference queue will make them eligible for reclamation.
while (queue.poll() != null)
;
}
Removes all of the mappings from this map.
The map will be empty after this call returns. |
public boolean containsKey(Object key) {
return getEntry(key) != null;
} Returns true if this map contains a mapping for the
specified key. |
public boolean containsValue(Object value) {
if (value==null)
return containsNullValue();
Entry< K,V >[] tab = getTable();
for (int i = tab.length; i-- > 0;)
for (Entry< K,V > e = tab[i]; e != null; e = e.next)
if (value.equals(e.value))
return true;
return false;
} Returns true if this map maps one or more keys to the
specified value. |
public Set<K, V> entrySet() {
Set< Map.Entry< K,V > > es = entrySet;
return es != null ? es : (entrySet = new EntrySet());
} Returns a Set 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 own remove operation, or through the
setValue 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 the Iterator.remove,
Set.remove, removeAll, retainAll and
clear operations. It does not support the
add or addAll operations. |
public V get(Object key) {
Object k = maskNull(key);
int h = HashMap.hash(k.hashCode());
Entry< K,V >[] tab = getTable();
int index = indexFor(h, tab.length);
Entry< K,V > e = tab[index];
while (e != null) {
if (e.hash == h && eq(k, e.get()))
return e.value;
e = e.next;
}
return null;
} Returns the value to which the specified key is mapped,
or {@code null} if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key
{@code k} to a value {@code v} such that {@code (key==null ? k==null :
key.equals(k))}, then this method returns {@code v}; otherwise
it returns {@code null}. (There can be at most one such mapping.)
A return value of {@code null} does not necessarily
indicate that the map contains no mapping for the key; it's also
possible that the map explicitly maps the key to {@code null}.
The containsKey operation may be used to
distinguish these two cases. |
Entry<K, V> getEntry(Object key) {
Object k = maskNull(key);
int h = HashMap.hash(k.hashCode());
Entry< K,V >[] tab = getTable();
int index = indexFor(h, tab.length);
Entry< K,V > e = tab[index];
while (e != null && !(e.hash == h && eq(k, e.get())))
e = e.next;
return e;
} Returns the entry associated with the specified key in this map.
Returns null if the map contains no mapping for this key. |
public boolean isEmpty() {
return size() == 0;
} Returns true 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. |
public Set<K> keySet() {
Set< K > ks = keySet;
return (ks != null ? ks : (keySet = new KeySet()));
} Returns a Set 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 own remove operation), the results of
the iteration are undefined. The set supports element removal,
which removes the corresponding mapping from the map, via the
Iterator.remove, Set.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations. |
public V put(K key,
V value) {
Object k = maskNull(key);
int h = HashMap.hash(k.hashCode());
Entry< K,V >[] tab = getTable();
int i = indexFor(h, tab.length);
for (Entry< K,V > e = tab[i]; e != null; e = e.next) {
if (h == e.hash && eq(k, e.get())) {
V oldValue = e.value;
if (value != oldValue)
e.value = value;
return oldValue;
}
}
modCount++;
Entry< K,V > e = tab[i];
tab[i] = new Entry< >(k, value, queue, h, e);
if (++size >= threshold)
resize(tab.length * 2);
return null;
} 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. |
public void putAll(Map<? extends K, ? extends V> m) {
int numKeysToBeAdded = m.size();
if (numKeysToBeAdded == 0)
return;
/*
* Expand the map if the map if the number of mappings to be added
* is greater than or equal to threshold. This is conservative; the
* obvious condition is (m.size() + size) >= threshold, but this
* condition could result in a map with twice the appropriate capacity,
* if the keys to be added overlap with the keys already in this map.
* By using the conservative calculation, we subject ourself
* to at most one extra resize.
*/
if (numKeysToBeAdded > threshold) {
int targetCapacity = (int)(numKeysToBeAdded / loadFactor + 1);
if (targetCapacity > MAXIMUM_CAPACITY)
targetCapacity = MAXIMUM_CAPACITY;
int newCapacity = table.length;
while (newCapacity < targetCapacity)
newCapacity < < = 1;
if (newCapacity > table.length)
resize(newCapacity);
}
for (Map.Entry< ? extends K, ? extends V > e : m.entrySet())
put(e.getKey(), e.getValue());
} 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. |
public V remove(Object key) {
Object k = maskNull(key);
int h = HashMap.hash(k.hashCode());
Entry< K,V >[] tab = getTable();
int i = indexFor(h, tab.length);
Entry< K,V > prev = tab[i];
Entry< K,V > e = prev;
while (e != null) {
Entry< K,V > next = e.next;
if (h == e.hash && eq(k, e.get())) {
modCount++;
size--;
if (prev == e)
tab[i] = next;
else
prev.next = next;
return e.value;
}
prev = e;
e = next;
}
return null;
} Removes the mapping for a key from this weak hash map if it is present.
More formally, if this map contains a mapping from key k to
value v 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,
or null if the map contained no mapping for the key. A
return value of null does not necessarily indicate
that the map contained no mapping for the key; it's also possible
that the map explicitly mapped the key to null.
The map will not contain a mapping for the specified key once the
call returns. |
boolean removeMapping(Object o) {
if (!(o instanceof Map.Entry))
return false;
Entry< K,V >[] tab = getTable();
Map.Entry< ?,? > entry = (Map.Entry< ?,? >)o;
Object k = maskNull(entry.getKey());
int h = HashMap.hash(k.hashCode());
int i = indexFor(h, tab.length);
Entry< K,V > prev = tab[i];
Entry< K,V > e = prev;
while (e != null) {
Entry< K,V > next = e.next;
if (h == e.hash && e.equals(entry)) {
modCount++;
size--;
if (prev == e)
tab[i] = next;
else
prev.next = next;
return true;
}
prev = e;
e = next;
}
return false;
} Special version of remove needed by Entry set |
void resize(int newCapacity) {
Entry< K,V >[] oldTable = getTable();
int oldCapacity = oldTable.length;
if (oldCapacity == MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return;
}
Entry< K,V >[] newTable = newTable(newCapacity);
transfer(oldTable, newTable);
table = newTable;
/*
* If ignoring null elements and processing ref queue caused massive
* shrinkage, then restore old table. This should be rare, but avoids
* unbounded expansion of garbage-filled tables.
*/
if (size >= threshold / 2) {
threshold = (int)(newCapacity * loadFactor);
} else {
expungeStaleEntries();
transfer(newTable, oldTable);
table = oldTable;
}
} Rehashes the contents of this map into a new array with a
larger capacity. This method is called automatically when the
number of keys in this map reaches its threshold.
If current capacity is MAXIMUM_CAPACITY, this method does not
resize the map, but sets threshold to Integer.MAX_VALUE.
This has the effect of preventing future calls. |
public int size() {
if (size == 0)
return 0;
expungeStaleEntries();
return 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. |
static Object unmaskNull(Object key) {
return (key == NULL_KEY) ? null : key;
} Returns internal representation of null key back to caller as null. |
public Collection<V> values() {
Collection< V > vs = values;
return (vs != null) ? vs : (values = new Values());
} Returns a Collection 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 own remove operation),
the results of the iteration are undefined. The collection
supports element removal, which removes the corresponding
mapping from the map, via the Iterator.remove,
Collection.remove, removeAll,
retainAll and clear operations. It does not
support the add or addAll operations. |