public class LRUMap extends AbstractLinkedMap implements BoundedMap, Serializable, Cloneable
Map implementation with a fixed maximum size which removes
the least recently used entry if an entry is added when full.
The least recently used algorithm works on the get and put operations only. Iteration of any kind, including setting the value by iteration, does not change the order. Queries such as containsKey and containsValue or access via views also do not change the order.
The map implements OrderedMap and entries may be queried using
the bidirectional OrderedMapIterator. The order returned is
least recently used to most recently used. Iterators from map views can
also be cast to OrderedIterator if required.
All the available iterators can be reset back to the start by casting to
ResettableIterator and calling reset().
Note that LRUMap 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(Map). This class may throw
NullPointerException's when accessed by concurrent threads.
AbstractLinkedMap.EntrySetIterator, AbstractLinkedMap.KeySetIterator, AbstractLinkedMap.LinkEntry, AbstractLinkedMap.LinkIterator, AbstractLinkedMap.LinkMapIterator, AbstractLinkedMap.ValuesIteratorAbstractHashedMap.EntrySet, AbstractHashedMap.HashEntry, AbstractHashedMap.HashIterator, AbstractHashedMap.HashMapIterator, AbstractHashedMap.KeySet, AbstractHashedMap.ValuesAbstractMap.SimpleEntry, AbstractMap.SimpleImmutableEntry| Modifier and Type | Field and Description |
|---|---|
protected static int |
DEFAULT_MAX_SIZE
Default maximum size
|
headerdata, 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 and Description |
|---|
LRUMap()
Constructs a new empty map with a maximum size of 100.
|
LRUMap(int maxSize)
Constructs a new, empty map with the specified maximum size.
|
LRUMap(int maxSize,
boolean scanUntilRemovable)
Constructs a new, empty map with the specified maximum size.
|
LRUMap(int maxSize,
float loadFactor)
Constructs a new, empty map with the specified initial capacity and
load factor.
|
LRUMap(int maxSize,
float loadFactor,
boolean scanUntilRemovable)
Constructs a new, empty map with the specified initial capacity and
load factor.
|
LRUMap(Map map)
Constructor copying elements from another map.
|
LRUMap(Map map,
boolean scanUntilRemovable)
Constructor copying elements from another map.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
addMapping(int hashIndex,
int hashCode,
Object key,
Object value)
Adds a new key-value mapping into this map.
|
Object |
clone()
Clones the map without cloning the keys or values.
|
protected void |
doReadObject(ObjectInputStream in)
Reads the data necessary for
put() to work in the superclass. |
protected void |
doWriteObject(ObjectOutputStream out)
Writes the data necessary for
put() to work in deserialization. |
Object |
get(Object key)
Gets the value mapped to the key specified.
|
boolean |
isFull()
Returns true if this map is full and no new mappings can be added.
|
boolean |
isScanUntilRemovable()
Whether this LRUMap will scan until a removable entry is found when the
map is full.
|
int |
maxSize()
Gets the maximum size of the map (the bound).
|
protected void |
moveToMRU(AbstractLinkedMap.LinkEntry entry)
Moves an entry to the MRU position at the end of the list.
|
protected boolean |
removeLRU(AbstractLinkedMap.LinkEntry entry)
Subclass method to control removal of the least recently used entry from the map.
|
protected void |
reuseMapping(AbstractLinkedMap.LinkEntry entry,
int hashIndex,
int hashCode,
Object key,
Object value)
Reuses an entry by removing it and moving it to a new place in the map.
|
protected void |
updateEntry(AbstractHashedMap.HashEntry entry,
Object newValue)
Updates an existing key-value mapping.
|
addEntry, clear, containsValue, createEntry, createEntrySetIterator, createKeySetIterator, createValuesIterator, entryAfter, entryBefore, firstKey, getEntry, init, lastKey, mapIterator, nextKey, orderedMapIterator, previousKey, removeEntrycalculateNewCapacity, calculateThreshold, checkCapacity, containsKey, convertKey, destroyEntry, ensureCapacity, entryHashCode, entryKey, entryNext, entrySet, entryValue, equals, getEntry, hash, hashCode, hashIndex, isEmpty, isEqualKey, isEqualValue, keySet, put, putAll, remove, removeMapping, reuseEntry, size, toString, valuesprotected static final int DEFAULT_MAX_SIZE
public LRUMap()
public LRUMap(int maxSize)
maxSize - the maximum size of the mapIllegalArgumentException - if the maximum size is less than onepublic LRUMap(int maxSize,
boolean scanUntilRemovable)
maxSize - the maximum size of the mapscanUntilRemovable - scan until a removeable entry is found, default falseIllegalArgumentException - if the maximum size is less than onepublic LRUMap(int maxSize,
float loadFactor)
maxSize - the maximum size of the map, -1 for no limit,loadFactor - the load factorIllegalArgumentException - if the maximum size is less than oneIllegalArgumentException - if the load factor is less than zeropublic LRUMap(int maxSize,
float loadFactor,
boolean scanUntilRemovable)
maxSize - the maximum size of the map, -1 for no limit,loadFactor - the load factorscanUntilRemovable - scan until a removeable entry is found, default falseIllegalArgumentException - if the maximum size is less than oneIllegalArgumentException - if the load factor is less than zeropublic LRUMap(Map map)
The maximum size is set from the map's size.
map - the map to copyNullPointerException - if the map is nullIllegalArgumentException - if the map is emptypublic LRUMap(Map map, boolean scanUntilRemovable)
map - the map to copyscanUntilRemovable - scan until a removeable entry is found, default falseNullPointerException - if the map is nullIllegalArgumentException - if the map is emptypublic Object get(Object key)
This operation changes the position of the key in the map to the most recently used position (first).
get in interface Mapget in class AbstractHashedMapkey - the keyprotected void moveToMRU(AbstractLinkedMap.LinkEntry entry)
This implementation moves the updated entry to the end of the list.
entry - the entry to updateprotected void updateEntry(AbstractHashedMap.HashEntry entry, Object newValue)
This implementation moves the updated entry to the top of the list
using moveToMRU(AbstractLinkedMap.LinkEntry).
updateEntry in class AbstractHashedMapentry - the entry to updatenewValue - the new value to storeprotected void addMapping(int hashIndex,
int hashCode,
Object key,
Object value)
This implementation checks the LRU size and determines whether to
discard an entry or not using removeLRU(AbstractLinkedMap.LinkEntry).
From Commons Collections 3.1 this method uses isFull() rather
than accessing size and maxSize directly.
It also handles the scanUntilRemovable functionality.
addMapping in class AbstractHashedMaphashIndex - the index into the data array to store athashCode - the hash code of the key to addkey - the key to addvalue - the value to addprotected void reuseMapping(AbstractLinkedMap.LinkEntry entry, int hashIndex, int hashCode, Object key, Object value)
This method uses AbstractLinkedMap.removeEntry(org.apache.commons.collections.map.AbstractHashedMap.HashEntry, int, org.apache.commons.collections.map.AbstractHashedMap.HashEntry), AbstractHashedMap.reuseEntry(org.apache.commons.collections.map.AbstractHashedMap.HashEntry, int, int, java.lang.Object, java.lang.Object) and AbstractLinkedMap.addEntry(org.apache.commons.collections.map.AbstractHashedMap.HashEntry, int).
entry - the entry to reusehashIndex - the index into the data array to store athashCode - the hash code of the key to addkey - the key to addvalue - the value to addprotected boolean removeLRU(AbstractLinkedMap.LinkEntry entry)
This method exists for subclasses to override. A subclass may wish to provide cleanup of resources when an entry is removed. For example:
protected boolean removeLRU(LinkEntry entry) {
releaseResources(entry.getValue()); // release resources held by entry
return true; // actually delete entry
}
Alternatively, a subclass may choose to not remove the entry or selectively keep certain LRU entries. For example:
protected boolean removeLRU(LinkEntry entry) {
if (entry.getKey().toString().startsWith("System.")) {
return false; // entry not removed from LRUMap
} else {
return true; // actually delete entry
}
}
The effect of returning false is dependent on the scanUntilRemovable flag.
If the flag is true, the next LRU entry will be passed to this method and so on
until one returns false and is removed, or every entry in the map has been passed.
If the scanUntilRemovable flag is false, the map will exceed the maximum size.
NOTE: Commons Collections 3.0 passed the wrong entry to this method. This is fixed in version 3.1 onwards.
entry - the entry to be removedpublic boolean isFull()
isFull in interface BoundedMaptrue if the map is fullpublic int maxSize()
maxSize in interface BoundedMappublic boolean isScanUntilRemovable()
public Object clone()
clone in class AbstractHashedMapprotected void doWriteObject(ObjectOutputStream out) throws IOException
put() to work in deserialization.doWriteObject in class AbstractHashedMapout - the output streamIOExceptionprotected void doReadObject(ObjectInputStream in) throws IOException, ClassNotFoundException
put() to work in the superclass.doReadObject in class AbstractHashedMapin - the input streamIOExceptionClassNotFoundExceptionCopyright © 2001–2015 The Apache Software Foundation. All rights reserved.