Class AbstractReferenceMap<K,V>
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- org.apache.commons.collections4.map.AbstractHashedMap<K,V>
-
- org.apache.commons.collections4.map.AbstractReferenceMap<K,V>
-
- Type Parameters:
K
- the type of the keys in this mapV
- the type of the values in this map
- All Implemented Interfaces:
java.util.Map<K,V>
,Get<K,V>
,IterableGet<K,V>
,IterableMap<K,V>
,Put<K,V>
- Direct Known Subclasses:
ReferenceIdentityMap
,ReferenceMap
public abstract class AbstractReferenceMap<K,V> extends AbstractHashedMap<K,V>
An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.This class implements all the features necessary for a subclass reference hash-based map. Key-value entries are stored in instances of the
ReferenceEntry
class which can be overridden and replaced. The iterators can similarly be replaced, without the need to replace the KeySet, EntrySet and Values view classes.Overridable methods are provided to change the default hashing behaviour, and to change how entries are added to and removed from the map. Hopefully, all you need for unusual subclasses is here.
When you construct an
AbstractReferenceMap
, you can specify what kind of references are used to store the map's keys and values. If non-hard references are used, then the garbage collector can remove mappings if a key or value becomes unreachable, or if the JVM's memory is running low. For information on how the different reference types behave, seeReference
.Different types of references can be specified for keys and values. The keys can be configured to be weak but the values hard, in which case this class will behave like a
WeakHashMap
. However, you can also specify hard keys and weak values, or any other combination. The default constructor uses hard keys and soft values, providing a memory-sensitive cache.This
Map
implementation does not allow null elements. Attempting to add a null key or value to the map will raise aNullPointerException
.All the available iterators can be reset back to the start by casting to
ResettableIterator
and callingreset()
.This implementation is not synchronized. You can use
Collections.synchronizedMap(java.util.Map<K, V>)
to provide synchronized access to aReferenceMap
.- Since:
- 3.1 (extracted from ReferenceMap in 3.0)
- See Also:
Reference
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
AbstractReferenceMap.ReferenceStrength
Reference type enum.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
Clears this map.boolean
containsKey(java.lang.Object key)
Checks whether the map contains the specified key.boolean
containsValue(java.lang.Object value)
Checks whether the map contains the specified value.java.util.Set<java.util.Map.Entry<K,V>>
entrySet()
Returns a set view of this map's entries.V
get(java.lang.Object key)
Gets the value mapped to the key specified.boolean
isEmpty()
Checks whether the map is currently empty.java.util.Set<K>
keySet()
Returns a set view of this map's keys.MapIterator<K,V>
mapIterator()
Gets a MapIterator over the reference map.V
put(K key, V value)
Puts a key-value mapping into this map.V
remove(java.lang.Object key)
Removes the specified mapping from this map.int
size()
Gets the size of the map.java.util.Collection<V>
values()
Returns a collection view of this map's values.-
Methods inherited from class org.apache.commons.collections4.map.AbstractHashedMap
equals, hashCode, putAll, toString
-
-
-
-
Method Detail
-
size
public int size()
Gets the size of the map.
-
isEmpty
public boolean isEmpty()
Checks whether the map is currently empty.
-
containsKey
public boolean containsKey(java.lang.Object key)
Checks whether the map contains the specified key.- Specified by:
containsKey
in interfaceGet<K,V>
- Specified by:
containsKey
in interfacejava.util.Map<K,V>
- Overrides:
containsKey
in classAbstractHashedMap<K,V>
- Parameters:
key
- the key to search for- Returns:
- true if the map contains the key
- See Also:
Map.containsKey(Object)
-
containsValue
public boolean containsValue(java.lang.Object value)
Checks whether the map contains the specified value.- Specified by:
containsValue
in interfaceGet<K,V>
- Specified by:
containsValue
in interfacejava.util.Map<K,V>
- Overrides:
containsValue
in classAbstractHashedMap<K,V>
- Parameters:
value
- the value to search for- Returns:
- true if the map contains the value
- See Also:
Map.containsValue(Object)
-
get
public V get(java.lang.Object key)
Gets the value mapped to the key specified.
-
put
public V put(K key, V value)
Puts a key-value mapping into this map. Neither the key nor the value may be null.- Specified by:
put
in interfacejava.util.Map<K,V>
- Specified by:
put
in interfacePut<K,V>
- Overrides:
put
in classAbstractHashedMap<K,V>
- Parameters:
key
- the key to add, must not be nullvalue
- the value to add, must not be null- Returns:
- the value previously mapped to this key, null if none
- Throws:
java.lang.NullPointerException
- if either the key or value is null- See Also:
Map.put(Object, Object)
-
remove
public V remove(java.lang.Object key)
Removes the specified mapping from this map.
-
clear
public void clear()
Clears this map.
-
mapIterator
public MapIterator<K,V> mapIterator()
Gets a MapIterator over the reference map. The iterator only returns valid key/value pairs.- Specified by:
mapIterator
in interfaceIterableGet<K,V>
- Overrides:
mapIterator
in classAbstractHashedMap<K,V>
- Returns:
- a map iterator
-
entrySet
public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
Returns a set view of this map's entries. An iterator returned entry is valid untilnext()
is called again. ThesetValue()
method on thetoArray
entries has no effect.
-
keySet
public java.util.Set<K> keySet()
Returns a set view of this map's keys.
-
values
public java.util.Collection<V> values()
Returns a collection view of this map's values.
-
-