Save This Page
Home » commons-collections-3.2.1-src » org.apache.commons » collections » map » [javadoc | source]
org.apache.commons.collections.map
public class: ReferenceMap [javadoc | source]
java.lang.Object
   java.util.AbstractMap
      org.apache.commons.collections.map.AbstractHashedMap
         org.apache.commons.collections.map.AbstractReferenceMap
            org.apache.commons.collections.map.ReferenceMap

All Implemented Interfaces:
    Serializable, IterableMap, Map

A Map implementation that allows mappings to be removed by the garbage collector.

When you construct a ReferenceMap, 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, see Reference .

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 is similar to ReferenceIdentityMap . It differs in that keys and values in this class are compared using equals().

This Map implementation does not allow null elements. Attempting to add a null key or value to the map will raise a NullPointerException.

This implementation is not synchronized. You can use java.util.Collections#synchronizedMap to provide synchronized access to a ReferenceMap. 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 calling reset().

Note that ReferenceMap 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 java.util.Collections#synchronizedMap . This class may throw exceptions when accessed by concurrent threads without synchronization.

NOTE: As from Commons Collections 3.1 this map extends AbstractReferenceMap (previously it extended AbstractMap). As a result, the implementation is now extensible and provides a MapIterator.

Fields inherited from org.apache.commons.collections.map.AbstractReferenceMap:
HARD,  SOFT,  WEAK,  keyType,  valueType,  purgeValues
Fields inherited from org.apache.commons.collections.map.AbstractHashedMap:
NO_NEXT_ENTRY,  NO_PREVIOUS_ENTRY,  REMOVE_INVALID,  GETKEY_INVALID,  GETVALUE_INVALID,  SETVALUE_INVALID,  DEFAULT_CAPACITY,  DEFAULT_THRESHOLD,  DEFAULT_LOAD_FACTOR,  MAXIMUM_CAPACITY,  NULL,  loadFactor,  size,  data,  threshold,  modCount,  entrySet,  keySet,  values
Constructor:
 public ReferenceMap() 
 public ReferenceMap(int keyType,
    int valueType) 
 public ReferenceMap(int keyType,
    int valueType,
    boolean purgeValues) 
 public ReferenceMap(int keyType,
    int valueType,
    int capacity,
    float loadFactor) 
 public ReferenceMap(int keyType,
    int valueType,
    int capacity,
    float loadFactor,
    boolean purgeValues) 
Methods from org.apache.commons.collections.map.AbstractReferenceMap:
clear,   containsKey,   containsValue,   createEntry,   createEntrySetIterator,   createKeySetIterator,   createValuesIterator,   doReadObject,   doWriteObject,   entrySet,   get,   getEntry,   hashEntry,   init,   isEmpty,   isEqualKey,   keySet,   mapIterator,   purge,   purge,   purgeBeforeRead,   purgeBeforeWrite,   put,   remove,   size,   values
Methods from org.apache.commons.collections.map.AbstractHashedMap:
addEntry,   addMapping,   calculateNewCapacity,   calculateThreshold,   checkCapacity,   clear,   clone,   containsKey,   containsValue,   convertKey,   createEntry,   createEntrySetIterator,   createKeySetIterator,   createValuesIterator,   destroyEntry,   doReadObject,   doWriteObject,   ensureCapacity,   entryHashCode,   entryKey,   entryNext,   entrySet,   entryValue,   equals,   get,   getEntry,   hash,   hashCode,   hashIndex,   init,   isEmpty,   isEqualKey,   isEqualValue,   keySet,   mapIterator,   put,   putAll,   remove,   removeEntry,   removeMapping,   reuseEntry,   size,   toString,   updateEntry,   values
Methods from java.util.AbstractMap:
clear,   containsKey,   containsValue,   entrySet,   equals,   get,   hashCode,   isEmpty,   keySet,   put,   putAll,   remove,   size,   toString,   values
Methods from java.lang.Object:
equals,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait