org.prorefactor.util
Class Cache<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
org.prorefactor.util.Cache<K,V>
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, java.util.Map<K,V>
public class Cache<K,V>
- extends java.util.LinkedHashMap<K,V>
Extends LinkedHashMap to provide a "recently used" cache of a specified size.
There's a good chance you will want to wrap this to be thread-safe:
Map m = Collections.synchronizedMap(new Cache(...));
- See Also:
- Serialized Form
Constructor Summary |
Cache(int capacity)
|
Methods inherited from class java.util.LinkedHashMap |
clear, containsValue, get |
Methods inherited from class java.util.HashMap |
clone, containsKey, entrySet, isEmpty, keySet, put, putAll, remove, size, values |
Methods inherited from class java.util.AbstractMap |
equals, hashCode, toString |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
Cache
public Cache(int capacity)
removeEldestEntry
protected boolean removeEldestEntry(java.util.Map.Entry eldest)
- Overrides:
removeEldestEntry
in class java.util.LinkedHashMap<K,V>
Copyright © 2008 Joanju Software. All Rights Reserved.