Class ReferenceIdentityMap
- java.lang.Object
-
- java.util.AbstractMap
-
- org.apache.commons.collections.map.AbstractHashedMap
-
- org.apache.commons.collections.map.AbstractReferenceMap
-
- org.apache.commons.collections.map.ReferenceIdentityMap
-
- All Implemented Interfaces:
Serializable
,Map
,IterableMap
public class ReferenceIdentityMap extends AbstractReferenceMap implements Serializable
AMap
implementation that allows mappings to be removed by the garbage collector and matches keys and values based on==
notequals()
.When you construct a
ReferenceIdentityMap
, 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 default constructor uses hard keys and soft values, providing a memory-sensitive cache.
This map is similar to
ReferenceMap
. It differs in that keys and values in this class are compared using==
.This map will violate the detail of various Map and map view contracts. As a general rule, don't compare this map to other maps.
This
Map
implementation does not allow null elements. Attempting to add a null key or value to the map will raise aNullPointerException
.This implementation is not synchronized. You can use
Collections.synchronizedMap(java.util.Map<K, V>)
to provide synchronized access to aReferenceIdentityMap
. Remember that synchronization will not stop the garbage collecter removing entries.All the available iterators can be reset back to the start by casting to
ResettableIterator
and callingreset()
.Note that ReferenceIdentityMap is not synchronized and is not thread-safe. If you wish to use this map from multiple threads concurrently, you must use appropriate synchronization. The simplest approach is to wrap this map using
Collections.synchronizedMap(java.util.Map<K, V>)
. This class may throw exceptions when accessed by concurrent threads without synchronization.- Since:
- Commons Collections 3.0 (previously in main package v2.1)
- Version:
- $Revision: 646777 $ $Date: 2008-04-10 14:33:15 +0200 (Thu, 10 Apr 2008) $
- Author:
- Stephen Colebourne
- See Also:
Reference
, Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.apache.commons.collections.map.AbstractReferenceMap
AbstractReferenceMap.ReferenceEntry
-
Nested classes/interfaces inherited from class org.apache.commons.collections.map.AbstractHashedMap
AbstractHashedMap.EntrySet, AbstractHashedMap.EntrySetIterator, AbstractHashedMap.HashEntry, AbstractHashedMap.HashIterator, AbstractHashedMap.HashMapIterator, AbstractHashedMap.KeySet, AbstractHashedMap.KeySetIterator, AbstractHashedMap.Values, AbstractHashedMap.ValuesIterator
-
Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>
-
-
Field Summary
-
Fields inherited from class org.apache.commons.collections.map.AbstractReferenceMap
HARD, keyType, purgeValues, SOFT, valueType, WEAK
-
Fields inherited from class org.apache.commons.collections.map.AbstractHashedMap
data, DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR, DEFAULT_THRESHOLD, entrySet, GETKEY_INVALID, GETVALUE_INVALID, keySet, loadFactor, MAXIMUM_CAPACITY, modCount, NO_NEXT_ENTRY, NO_PREVIOUS_ENTRY, NULL, REMOVE_INVALID, SETVALUE_INVALID, size, threshold, values
-
-
Constructor Summary
Constructors Constructor Description ReferenceIdentityMap()
Constructs a newReferenceIdentityMap
that will use hard references to keys and soft references to values.ReferenceIdentityMap(int keyType, int valueType)
Constructs a newReferenceIdentityMap
that will use the specified types of references.ReferenceIdentityMap(int keyType, int valueType, boolean purgeValues)
Constructs a newReferenceIdentityMap
that will use the specified types of references.ReferenceIdentityMap(int keyType, int valueType, int capacity, float loadFactor)
Constructs a newReferenceIdentityMap
with the specified reference types, load factor and initial capacity.ReferenceIdentityMap(int keyType, int valueType, int capacity, float loadFactor, boolean purgeValues)
Constructs a newReferenceIdentityMap
with the specified reference types, load factor and initial capacity.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected int
hash(Object key)
Gets the hash code for the key specified.protected int
hashEntry(Object key, Object value)
Gets the hash code for a MapEntry.protected boolean
isEqualKey(Object key1, Object key2)
Compares two keys for equals.protected boolean
isEqualValue(Object value1, Object value2)
Compares two values for equals.-
Methods inherited from class org.apache.commons.collections.map.AbstractReferenceMap
clear, containsKey, containsValue, createEntry, createEntrySetIterator, createKeySetIterator, createValuesIterator, doReadObject, doWriteObject, entrySet, get, getEntry, init, isEmpty, keySet, mapIterator, purge, purge, purgeBeforeRead, purgeBeforeWrite, put, remove, size, values
-
Methods inherited from class org.apache.commons.collections.map.AbstractHashedMap
addEntry, addMapping, calculateNewCapacity, calculateThreshold, checkCapacity, clone, convertKey, destroyEntry, ensureCapacity, entryHashCode, entryKey, entryNext, entryValue, equals, hashCode, hashIndex, putAll, removeEntry, removeMapping, reuseEntry, toString, updateEntry
-
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
-
-
-
-
Constructor Detail
-
ReferenceIdentityMap
public ReferenceIdentityMap()
Constructs a newReferenceIdentityMap
that will use hard references to keys and soft references to values.
-
ReferenceIdentityMap
public ReferenceIdentityMap(int keyType, int valueType)
Constructs a newReferenceIdentityMap
that will use the specified types of references.- Parameters:
keyType
- the type of reference to use for keys; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
valueType
- the type of reference to use for values; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
-
ReferenceIdentityMap
public ReferenceIdentityMap(int keyType, int valueType, boolean purgeValues)
Constructs a newReferenceIdentityMap
that will use the specified types of references.- Parameters:
keyType
- the type of reference to use for keys; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
valueType
- the type of reference to use for values; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
purgeValues
- should the value be automatically purged when the key is garbage collected
-
ReferenceIdentityMap
public ReferenceIdentityMap(int keyType, int valueType, int capacity, float loadFactor)
Constructs a newReferenceIdentityMap
with the specified reference types, load factor and initial capacity.- Parameters:
keyType
- the type of reference to use for keys; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
valueType
- the type of reference to use for values; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
capacity
- the initial capacity for the maploadFactor
- the load factor for the map
-
ReferenceIdentityMap
public ReferenceIdentityMap(int keyType, int valueType, int capacity, float loadFactor, boolean purgeValues)
Constructs a newReferenceIdentityMap
with the specified reference types, load factor and initial capacity.- Parameters:
keyType
- the type of reference to use for keys; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
valueType
- the type of reference to use for values; must beAbstractReferenceMap.HARD
,AbstractReferenceMap.SOFT
,AbstractReferenceMap.WEAK
capacity
- the initial capacity for the maploadFactor
- the load factor for the mappurgeValues
- should the value be automatically purged when the key is garbage collected
-
-
Method Detail
-
hash
protected int hash(Object key)
Gets the hash code for the key specified.This implementation uses the identity hash code.
- Overrides:
hash
in classAbstractHashedMap
- Parameters:
key
- the key to get a hash code for- Returns:
- the hash code
-
hashEntry
protected int hashEntry(Object key, Object value)
Gets the hash code for a MapEntry.This implementation uses the identity hash code.
- Overrides:
hashEntry
in classAbstractReferenceMap
- Parameters:
key
- the key to get a hash code for, may be nullvalue
- the value to get a hash code for, may be null- Returns:
- the hash code, as per the MapEntry specification
-
isEqualKey
protected boolean isEqualKey(Object key1, Object key2)
Compares two keys for equals.This implementation converts the key from the entry to a real reference before comparison and uses
==
.- Overrides:
isEqualKey
in classAbstractReferenceMap
- Parameters:
key1
- the first key to compare passed in from outsidekey2
- the second key extracted from the entry viaentry.key
- Returns:
- true if equal by identity
-
isEqualValue
protected boolean isEqualValue(Object value1, Object value2)
Compares two values for equals.This implementation uses
==
.- Overrides:
isEqualValue
in classAbstractHashedMap
- Parameters:
value1
- the first value to compare passed in from outsidevalue2
- the second value extracted from the entry viagetValue()
- Returns:
- true if equal by identity
-
-