com.im.df.util
Class CachingMap<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
com.im.df.util.CachingMap<K,V>
- All Implemented Interfaces:
- Serializable, Cloneable, Map<K,V>
public class CachingMap<K,V>
- extends LinkedHashMap<K,V>
The map that acts as LRU cache. The cache is kept to a maximum size by removing the eldest entries when the list size
exceeds the value of cache size (see CachingMap(int)). Eldest entries are those least recently
accessed.
- See Also:
- Serialized Form
| Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
CachingMap
public CachingMap(int cacheSize)
- Parameters:
cacheSize - maximum number of entries allowed in this cache
removeEldestEntry
protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
- Overrides:
removeEldestEntry in class LinkedHashMap<K,V>
getCacheSize
public int getCacheSize()
setCacheSize
public void setCacheSize(int cacheSize)
setPermanentItemKey
public void setPermanentItemKey(K key)