Class AbstractReferenceMap
- java.lang.Object
-
- java.util.AbstractMap
-
- org.apache.commons.collections.map.AbstractHashedMap
-
- org.apache.commons.collections.map.AbstractReferenceMap
-
- All Implemented Interfaces:
java.util.Map,IterableMap
- Direct Known Subclasses:
ReferenceIdentityMap,ReferenceMap
public abstract class AbstractReferenceMap extends AbstractHashedMap
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
ReferenceEntryclass 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
Mapimplementation 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
ResettableIteratorand callingreset().This implementation is not synchronized. You can use
Collections.synchronizedMap(java.util.Map<K, V>)to provide synchronized access to aReferenceMap.- Since:
- Commons Collections 3.1 (extracted from ReferenceMap in 3.0)
- Version:
- $Revision: 646777 $ $Date: 2008-04-10 14:33:15 +0200 (Thu, 10 Apr 2008) $
- Author:
- Paul Jack, Stephen Colebourne
- See Also:
Reference
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description protected static classAbstractReferenceMap.ReferenceEntryA MapEntry implementation for the map.-
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
-
-
Field Summary
Fields Modifier and Type Field Description static intHARDConstant indicating that hard references should be usedprotected intkeyTypeThe reference type for keys.protected booleanpurgeValuesShould the value be automatically purged when the associated key has been collected?static intSOFTConstant indicating that soft references should be usedprotected intvalueTypeThe reference type for values.static intWEAKConstant indicating that weak references should be used-
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 Modifier Constructor Description protectedAbstractReferenceMap()Constructor used during deserialization.protectedAbstractReferenceMap(int keyType, int valueType, int capacity, float loadFactor, boolean purgeValues)Constructs a new empty map with the specified reference types, load factor and initial capacity.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidclear()Clears this map.booleancontainsKey(java.lang.Object key)Checks whether the map contains the specified key.booleancontainsValue(java.lang.Object value)Checks whether the map contains the specified value.protected AbstractHashedMap.HashEntrycreateEntry(AbstractHashedMap.HashEntry next, int hashCode, java.lang.Object key, java.lang.Object value)Creates a ReferenceEntry instead of a HashEntry.protected java.util.IteratorcreateEntrySetIterator()Creates an entry set iterator.protected java.util.IteratorcreateKeySetIterator()Creates an key set iterator.protected java.util.IteratorcreateValuesIterator()Creates an values iterator.protected voiddoReadObject(java.io.ObjectInputStream in)Replaces the superclassm method to read the state of this class.protected voiddoWriteObject(java.io.ObjectOutputStream out)Replaces the superclass method to store the state of this class.java.util.SetentrySet()Returns a set view of this map's entries.java.lang.Objectget(java.lang.Object key)Gets the value mapped to the key specified.protected AbstractHashedMap.HashEntrygetEntry(java.lang.Object key)Gets the entry mapped to the key specified.protected inthashEntry(java.lang.Object key, java.lang.Object value)Gets the hash code for a MapEntry.protected voidinit()Initialise this subclass during construction, cloning or deserialization.booleanisEmpty()Checks whether the map is currently empty.protected booleanisEqualKey(java.lang.Object key1, java.lang.Object key2)Compares two keys, in internal converted form, to see if they are equal.java.util.SetkeySet()Returns a set view of this map's keys.MapIteratormapIterator()Gets a MapIterator over the reference map.protected voidpurge()Purges stale mappings from this map.protected voidpurge(java.lang.ref.Reference ref)Purges the specified reference.protected voidpurgeBeforeRead()Purges stale mappings from this map before read operations.protected voidpurgeBeforeWrite()Purges stale mappings from this map before write operations.java.lang.Objectput(java.lang.Object key, java.lang.Object value)Puts a key-value mapping into this map.java.lang.Objectremove(java.lang.Object key)Removes the specified mapping from this map.intsize()Gets the size of the map.java.util.Collectionvalues()Returns a collection view of this map's 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, hash, hashCode, hashIndex, isEqualValue, putAll, removeEntry, removeMapping, reuseEntry, toString, updateEntry
-
-
-
-
Field Detail
-
HARD
public static final int HARD
Constant indicating that hard references should be used- See Also:
- Constant Field Values
-
SOFT
public static final int SOFT
Constant indicating that soft references should be used- See Also:
- Constant Field Values
-
WEAK
public static final int WEAK
Constant indicating that weak references should be used- See Also:
- Constant Field Values
-
keyType
protected int keyType
The reference type for keys. Must be HARD, SOFT, WEAK.
-
valueType
protected int valueType
The reference type for values. Must be HARD, SOFT, WEAK.
-
purgeValues
protected boolean purgeValues
Should the value be automatically purged when the associated key has been collected?
-
-
Constructor Detail
-
AbstractReferenceMap
protected AbstractReferenceMap()
Constructor used during deserialization.
-
AbstractReferenceMap
protected AbstractReferenceMap(int keyType, int valueType, int capacity, float loadFactor, boolean purgeValues)Constructs a new empty map with the specified reference types, load factor and initial capacity.- Parameters:
keyType- the type of reference to use for keys; must beHARD,SOFT,WEAKvalueType- the type of reference to use for values; must beHARD,SOFT,WEAKcapacity- 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
-
init
protected void init()
Initialise this subclass during construction, cloning or deserialization.- Overrides:
initin classAbstractHashedMap
-
size
public int size()
Gets the size of the map.- Specified by:
sizein interfacejava.util.Map- Overrides:
sizein classAbstractHashedMap- Returns:
- the size
-
isEmpty
public boolean isEmpty()
Checks whether the map is currently empty.- Specified by:
isEmptyin interfacejava.util.Map- Overrides:
isEmptyin classAbstractHashedMap- Returns:
- true if the map is currently size zero
-
containsKey
public boolean containsKey(java.lang.Object key)
Checks whether the map contains the specified key.- Specified by:
containsKeyin interfacejava.util.Map- Overrides:
containsKeyin classAbstractHashedMap- Parameters:
key- the key to search for- Returns:
- true if the map contains the key
-
containsValue
public boolean containsValue(java.lang.Object value)
Checks whether the map contains the specified value.- Specified by:
containsValuein interfacejava.util.Map- Overrides:
containsValuein classAbstractHashedMap- Parameters:
value- the value to search for- Returns:
- true if the map contains the value
-
get
public java.lang.Object get(java.lang.Object key)
Gets the value mapped to the key specified.- Specified by:
getin interfacejava.util.Map- Overrides:
getin classAbstractHashedMap- Parameters:
key- the key- Returns:
- the mapped value, null if no match
-
put
public java.lang.Object put(java.lang.Object key, java.lang.Object value)Puts a key-value mapping into this map. Neither the key nor the value may be null.- Specified by:
putin interfacejava.util.Map- Overrides:
putin classAbstractHashedMap- 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
-
remove
public java.lang.Object remove(java.lang.Object key)
Removes the specified mapping from this map.- Specified by:
removein interfacejava.util.Map- Overrides:
removein classAbstractHashedMap- Parameters:
key- the mapping to remove- Returns:
- the value mapped to the removed key, null if key not in map
-
clear
public void clear()
Clears this map.- Specified by:
clearin interfacejava.util.Map- Overrides:
clearin classAbstractHashedMap
-
mapIterator
public MapIterator mapIterator()
Gets a MapIterator over the reference map. The iterator only returns valid key/value pairs.- Specified by:
mapIteratorin interfaceIterableMap- Overrides:
mapIteratorin classAbstractHashedMap- Returns:
- a map iterator
-
entrySet
public java.util.Set entrySet()
Returns a set view of this map's entries. An iterator returned entry is valid untilnext()is called again. ThesetValue()method on thetoArrayentries has no effect.- Specified by:
entrySetin interfacejava.util.Map- Overrides:
entrySetin classAbstractHashedMap- Returns:
- a set view of this map's entries
-
keySet
public java.util.Set keySet()
Returns a set view of this map's keys.- Specified by:
keySetin interfacejava.util.Map- Overrides:
keySetin classAbstractHashedMap- Returns:
- a set view of this map's keys
-
values
public java.util.Collection values()
Returns a collection view of this map's values.- Specified by:
valuesin interfacejava.util.Map- Overrides:
valuesin classAbstractHashedMap- Returns:
- a set view of this map's values
-
purgeBeforeRead
protected void purgeBeforeRead()
Purges stale mappings from this map before read operations.This implementation calls
purge()to maintain a consistent state.
-
purgeBeforeWrite
protected void purgeBeforeWrite()
Purges stale mappings from this map before write operations.This implementation calls
purge()to maintain a consistent state.
-
purge
protected void purge()
Purges stale mappings from this map.Note that this method is not synchronized! Special care must be taken if, for instance, you want stale mappings to be removed on a periodic basis by some background thread.
-
purge
protected void purge(java.lang.ref.Reference ref)
Purges the specified reference.- Parameters:
ref- the reference to purge
-
getEntry
protected AbstractHashedMap.HashEntry getEntry(java.lang.Object key)
Gets the entry mapped to the key specified.- Overrides:
getEntryin classAbstractHashedMap- Parameters:
key- the key- Returns:
- the entry, null if no match
-
hashEntry
protected int hashEntry(java.lang.Object key, java.lang.Object value)Gets the hash code for a MapEntry. Subclasses can override this, for example to use the identityHashCode.- 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(java.lang.Object key1, java.lang.Object key2)Compares two keys, in internal converted form, to see if they are equal.This implementation converts the key from the entry to a real reference before comparison.
- Overrides:
isEqualKeyin classAbstractHashedMap- Parameters:
key1- the first key to compare passed in from outsidekey2- the second key extracted from the entry viaentry.key- Returns:
- true if equal
-
createEntry
protected AbstractHashedMap.HashEntry createEntry(AbstractHashedMap.HashEntry next, int hashCode, java.lang.Object key, java.lang.Object value)
Creates a ReferenceEntry instead of a HashEntry.- Overrides:
createEntryin classAbstractHashedMap- Parameters:
next- the next entry in sequencehashCode- the hash code to usekey- the key to storevalue- the value to store- Returns:
- the newly created entry
-
createEntrySetIterator
protected java.util.Iterator createEntrySetIterator()
Creates an entry set iterator.- Overrides:
createEntrySetIteratorin classAbstractHashedMap- Returns:
- the entrySet iterator
-
createKeySetIterator
protected java.util.Iterator createKeySetIterator()
Creates an key set iterator.- Overrides:
createKeySetIteratorin classAbstractHashedMap- Returns:
- the keySet iterator
-
createValuesIterator
protected java.util.Iterator createValuesIterator()
Creates an values iterator.- Overrides:
createValuesIteratorin classAbstractHashedMap- Returns:
- the values iterator
-
doWriteObject
protected void doWriteObject(java.io.ObjectOutputStream out) throws java.io.IOExceptionReplaces the superclass method to store the state of this class.Serialization is not one of the JDK's nicest topics. Normal serialization will initialise the superclass before the subclass. Sometimes however, this isn't what you want, as in this case the
put()method on read can be affected by subclass state.The solution adopted here is to serialize the state data of this class in this protected method. This method must be called by the
writeObject()of the first serializable subclass.Subclasses may override if they have a specific field that must be present on read before this implementation will work. Generally, the read determines what must be serialized here, if anything.
- Overrides:
doWriteObjectin classAbstractHashedMap- Parameters:
out- the output stream- Throws:
java.io.IOException
-
doReadObject
protected void doReadObject(java.io.ObjectInputStream in) throws java.io.IOException, java.lang.ClassNotFoundExceptionReplaces the superclassm method to read the state of this class.Serialization is not one of the JDK's nicest topics. Normal serialization will initialise the superclass before the subclass. Sometimes however, this isn't what you want, as in this case the
put()method on read can be affected by subclass state.The solution adopted here is to deserialize the state data of this class in this protected method. This method must be called by the
readObject()of the first serializable subclass.Subclasses may override if the subclass has a specific field that must be present before
put()orcalculateThreshold()will work correctly.- Overrides:
doReadObjectin classAbstractHashedMap- Parameters:
in- the input stream- Throws:
java.io.IOExceptionjava.lang.ClassNotFoundException
-
-