net.sf.extjwnl.util.cache
Class LRUCache<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
net.sf.extjwnl.util.cache.LRUCache<K,V>
- All Implemented Interfaces:
- Serializable, Cloneable, Map<K,V>, Cache<K,V>
public class LRUCache<K,V>
- extends LinkedHashMap<K,V>
- implements Cache<K,V>
A fixed-capacity Cache
that stores the most recently used elements. Once the cache reaches
capacity, the least recently used elements will be removed.
- Author:
- John Didion , Aliaksandr Autayeu
- See Also:
- Serialized Form
Constructor Summary |
LRUCache(int capacity)
|
Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
LRUCache
public LRUCache(int capacity)
- Parameters:
capacity
- the maximum number of elements that can be contained in the cache.
isFull
public boolean isFull()
removeEldestEntry
protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
- Overrides:
removeEldestEntry
in class LinkedHashMap<K,V>
setCapacity
public int setCapacity(int capacity)
- Description copied from interface:
Cache
- Set the maximum number of elements the cache can hold.
- Specified by:
setCapacity
in interface Cache<K,V>
- Parameters:
capacity
- capacity
- Returns:
- new capacity
getCapacity
public int getCapacity()
- Description copied from interface:
Cache
- Returns the maximum number of elements the cache can hold.
- Specified by:
getCapacity
in interface Cache<K,V>
- Returns:
- the maximum number of elements the cache can hold
getSize
public int getSize()
- Description copied from interface:
Cache
- Returns the current size of the cache.
- Specified by:
getSize
in interface Cache<K,V>
- Returns:
- size
Copyright © 2011. All Rights Reserved.