at.tuwien.ifs.somtoolbox.util
Class LeastRecentlyUsedCache<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
at.tuwien.ifs.somtoolbox.util.LeastRecentlyUsedCache<K,V>
- All Implemented Interfaces:
- Serializable, Cloneable, Map<K,V>
public class LeastRecentlyUsedCache<K,V>
- extends LinkedHashMap<K,V>
A least-recently-used LRU cache, based on LinkedHashMap
. This cache can hold a fixed maximum number of
elements; if a new element is added, and the cache is full, the least recently used entry is removed.
- Version:
- $Id: LeastRecentlyUsedCache.java 3587 2010-05-21 10:35:33Z mayer $
- Author:
- Rudolf Mayer
- See Also:
- Serialized Form
Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
serialVersionUID
private static final long serialVersionUID
- See Also:
- Constant Field Values
cacheSize
private int cacheSize
LeastRecentlyUsedCache
public LeastRecentlyUsedCache(int size)
- Creates a new least-recently-used cache.
- Parameters:
size
- the maximum number of entries that will be kept in this cache.
removeEldestEntry
protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
- Overrides:
removeEldestEntry
in class LinkedHashMap<K,V>