public class LRUMap
extends java.lang.Object
implements java.util.Map
Children can implement the processRemovedLRU method if they want to handle the removal of the lest recently used item.
This class was abstracted out of the LRU Memory cache. Put, remove, and get should be thread safe. It uses a hashtable and our own double linked list.
Locking is done on the instance.
| Modifier and Type | Field and Description |
|---|---|
protected java.util.Map |
map
Map where items are stored by key.
|
| Constructor and Description |
|---|
LRUMap()
This creates an unbounded version.
|
LRUMap(int maxObjects)
This sets the size limit.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
This removes all the items.
|
boolean |
containsKey(java.lang.Object key)
Returns true if the map contains an element for the supplied key.
|
boolean |
containsValue(java.lang.Object value)
This is an expensive operation that determines if the object supplied is mapped to any key.
|
void |
dumpCacheEntries()
Dump the cache entries from first to list for debugging.
|
void |
dumpMap()
Dump the cache map for debugging.
|
java.util.Set |
entrySet()
This returns a set of entries.
|
java.lang.Object |
get(java.lang.Object key) |
int |
getChunkSize() |
java.lang.Object |
getQuiet(java.lang.Object key)
This gets an element out of the map without adjusting it's posisiton in the LRU.
|
IStats |
getStatistics() |
boolean |
isEmpty()
Returns true if the map is empty.
|
java.util.Set |
keySet() |
protected void |
processRemovedLRU(java.lang.Object key,
java.lang.Object value)
This is called when an item is removed from the LRU.
|
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value) |
void |
putAll(java.util.Map source) |
java.lang.Object |
remove(java.lang.Object key) |
void |
setChunkSize(int chunkSize)
The chunk size is the number of items to remove when the max is reached.
|
int |
size()
This simply returned the number of elements in the map.
|
java.util.Collection |
values() |
protected void |
verifyCache()
Checks to see if all the items that should be in the cache are.
|
protected void |
verifyCache(java.lang.Object key)
Logs an error is an element that should be in the cache is not.
|
public LRUMap()
public LRUMap(int maxObjects)
maxObjects - public int size()
size in interface java.util.MapMap.size()public void clear()
clear in interface java.util.MapMap.clear()public boolean isEmpty()
isEmpty in interface java.util.MapMap.isEmpty()public boolean containsKey(java.lang.Object key)
containsKey in interface java.util.MapMap.containsKey(java.lang.Object)public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.MapMap.containsValue(java.lang.Object)public java.util.Collection values()
values in interface java.util.Mappublic void putAll(java.util.Map source)
putAll in interface java.util.Mapsource - public java.lang.Object get(java.lang.Object key)
get in interface java.util.Mapkey - public java.lang.Object getQuiet(java.lang.Object key)
key - public java.lang.Object remove(java.lang.Object key)
remove in interface java.util.Mapkey - public java.lang.Object put(java.lang.Object key,
java.lang.Object value)
put in interface java.util.Mapkey - value - public void dumpCacheEntries()
public void dumpMap()
protected void verifyCache()
protected void verifyCache(java.lang.Object key)
key - protected void processRemovedLRU(java.lang.Object key,
java.lang.Object value)
Children can implement this method for special behavior.
key - value - public void setChunkSize(int chunkSize)
chunkSize - The chunkSize to set.public int getChunkSize()
public IStats getStatistics()
public java.util.Set entrySet()
TODO we should return out own set wrapper, so we can avoid the extra object creation if it isn't necessary.
entrySet in interface java.util.MapMap.entrySet()public java.util.Set keySet()
keySet in interface java.util.MapCopyright © 2002-2013 Apache Software Foundation. All Rights Reserved.