Class AbstractDoubleLinkedListMemoryCache<K,V>

java.lang.Object
org.apache.commons.jcs3.engine.memory.AbstractMemoryCache<K,V>
org.apache.commons.jcs3.engine.memory.AbstractDoubleLinkedListMemoryCache<K,V>
All Implemented Interfaces:
IMemoryCache<K,V>
Direct Known Subclasses:
FIFOMemoryCache, LRUMemoryCache, MRUMemoryCache

public abstract class AbstractDoubleLinkedListMemoryCache<K,V> extends AbstractMemoryCache<K,V>
This class contains methods that are common to memory caches using the double linked list, such as the LRU, MRU, FIFO, and LIFO caches.

Children can control the expiration algorithm by controlling the update and get. The last item in the list will be the one removed when the list fills. For instance LRU should more items to the front as they are used. FIFO should simply add new items to the front of the list.