| java.util.WeakHashMap
| WeakHashMap | | public class WeakHashMap extends AbstractMap implements Map<K, V>(Code) | | WeakHashMap is an implementation of Map with keys which are WeakReferences.
The key/value mapping is removed when the key is no longer referenced. All
optional operations are supported, adding and removing. Keys and values can
be any objects.
since:
1.2
See Also: HashMap
See Also: WeakReference |
| Inner Class :class HashIterator implements Iterator<R> | |
| Constructor Summary | |
| public | WeakHashMap()
Constructs a new empty instance of WeakHashMap. | | public | WeakHashMap(int capacity)
Constructs a new instance of WeakHashMap with the specified capacity. | | public | WeakHashMap(int capacity, float loadFactor)
Constructs a new instance of WeakHashMap with the specified capacity and
load factor. | | public | WeakHashMap(Map<? extends K, ? extends V> map)
Constructs a new instance of HashMap containing the mappings from the
specified Map. |
| Method Summary | |
| public void | clear()
Removes all mappings from this WeakHashMap, leaving it empty. | | public boolean | containsKey(Object key)
Searches this WeakHashMap for the specified key. | | public boolean | containsValue(Object value)
Searches this WeakHashMap for the specified value, and returns true, if
at least one entry has this object as its value. | | public Set<Map.Entry<K, V>> | entrySet()
Answers a Set of the mappings contained in this WeakHashMap. | | public V | get(Object key)
Answers the value of the mapping with the specified key. | | Entry<K, V> | getEntry(Object key)
| | public boolean | isEmpty()
Answers if this WeakHashMap has no elements, a size of zero. | | public Set<K> | keySet()
Answers a Set of the keys contained in this WeakHashMap. | | void | poll()
| | 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 given map to this map. | | public V | remove(Object key)
Removes a mapping with the specified key from this WeakHashMap. | | void | removeEntry(Entry<K, V> toRemove)
| | public int | size()
Answers the number of mappings in this WeakHashMap. | | public Collection<V> | values()
Answers a Collection of the values contained in this WeakHashMap. |
| elementCount | | int elementCount(Code) | | |
| elementData | | Entry<K, V>[] elementData(Code) | | |
| modCount | | volatile int modCount(Code) | | |
| WeakHashMap | | public WeakHashMap()(Code) | | Constructs a new empty instance of WeakHashMap.
|
| WeakHashMap | | public WeakHashMap(int capacity)(Code) | | Constructs a new instance of WeakHashMap with the specified capacity.
Parameters:
capacity - the initial capacity of this WeakHashMap
exception:
IllegalArgumentException - when the capacity is less than zero |
| WeakHashMap | | public WeakHashMap(int capacity, float loadFactor)(Code) | | Constructs a new instance of WeakHashMap with the specified capacity and
load factor.
Parameters:
capacity - the initial capacity
Parameters:
loadFactor - the initial load factor
exception:
IllegalArgumentException - when the capacity is less than zero or the load factor isless or equal to zero |
| WeakHashMap | | public WeakHashMap(Map<? extends K, ? extends V> map)(Code) | | Constructs a new instance of HashMap containing the mappings from the
specified Map.
Parameters:
map - the mappings to add |
| containsKey | | public boolean containsKey(Object key)(Code) | | Searches this WeakHashMap for the specified key.
Parameters:
key - the object to search for true if key is a key of this WeakHashMap, falseotherwise |
| containsValue | | public boolean containsValue(Object value)(Code) | | Searches this WeakHashMap for the specified value, and returns true, if
at least one entry has this object as its value.
Parameters:
value - the object to search for true if value is a value in this WeakHashMap,false otherwise |
| entrySet | | public Set<Map.Entry<K, V>> entrySet()(Code) | | Answers a Set of the mappings contained in this WeakHashMap. Each element
in the set is a Map.Entry. The set is backed by this WeakHashMap so
changes to one are reflected by the other. The set does not support
adding.
a Set of the mappings |
| get | | public V get(Object key)(Code) | | Answers the value of the mapping with the specified key.
Parameters:
key - the key the value of the mapping with the specified key |
| isEmpty | | public boolean isEmpty()(Code) | | Answers if this WeakHashMap has no elements, a size of zero.
true if this HashMap has no elements, false otherwise
See Also: WeakHashMap.size |
| keySet | | public Set<K> keySet()(Code) | | Answers a Set of the keys contained in this WeakHashMap. The set is
backed by this WeakHashMap so changes to one are reflected by the other.
The set does not support adding.
a Set of the keys |
| put | | public V put(K key, V value)(Code) | | Maps the specified key to the specified value.
Parameters:
key - the key
Parameters:
value - the value the value of any previous mapping with the specified key or nullif there was no mapping |
| putAll | | public void putAll(Map<? extends K, ? extends V> map)(Code) | | Copies all the mappings in the given map to this map. These mappings will
replace all mappings that this map had for any of the keys currently in
the given map.
Parameters:
map - the Map to copy mappings from
throws:
NullPointerException - if the given map is null |
| remove | | public V remove(Object key)(Code) | | Removes a mapping with the specified key from this WeakHashMap.
Parameters:
key - the key of the mapping to remove the value of the removed mapping or null if key is not a key inthis WeakHashMap |
| removeEntry | | void removeEntry(Entry<K, V> toRemove)(Code) | | |
| size | | public int size()(Code) | | Answers the number of mappings in this WeakHashMap.
the number of mappings in this WeakHashMap |
| values | | public Collection<V> values()(Code) | | Answers a Collection of the values contained in this WeakHashMap. The
collection is backed by this WeakHashMap so changes to one are reflected
by the other. The collection does not support adding.
a Collection of the values |
|
|