org.apache.commons.jcs.auxiliary.disk.block

Class BlockDiskKeyStore.LRUMapCountLimited

java.lang.Object

org.apache.commons.jcs.utils.struct.AbstractLRUMap<K,V>

org.apache.commons.jcs.utils.struct.LRUMap<K,int[]>

org.apache.commons.jcs.auxiliary.disk.block.BlockDiskKeyStore.LRUMapCountLimited

All Implemented Interfaces:

Map<K,int[]>

Enclosing class:

BlockDiskKeyStore<K>

public class BlockDiskKeyStore.LRUMapCountLimited
extends LRUMap<K,int[]>

Class for recycling and lru. This implements the LRU overflow callback, so we can mark the blocks as free.

Nested Class Summary

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Field Summary

Fields

Modifier and Type	Field and Description
static String	TAG tag tells us which map we are working on.

Constructor Summary

Constructors

Constructor and Description
LRUMapCountLimited(int maxKeySize)

Method Summary

Modifier and Type	Method and Description
protected void	processRemovedLRU(K key, int[] value) This is called when the may key size is reached.

Methods inherited from class org.apache.commons.jcs.utils.struct.LRUMap

getMaxCounter, shouldRemove

Methods inherited from class org.apache.commons.jcs.utils.struct.AbstractLRUMap

clear, containsKey, containsValue, dumpCacheEntries, dumpMap, entrySet, get, getChunkSize, getQuiet, getStatistics, isEmpty, keySet, put, putAll, remove, setChunkSize, size, values, verifyCache, verifyCache

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll

Field Detail

TAG

public static final String TAG

tag tells us which map we are working on.

See Also:

Constant Field Values

Constructor Detail

LRUMapCountLimited

public LRUMapCountLimited(int maxKeySize)

Method Detail

processRemovedLRU

protected void processRemovedLRU(K key,
                                 int[] value)

This is called when the may key size is reached. The least recently used item will be passed here. We will store the position and size of the spot on disk in the recycle bin.

Overrides:

processRemovedLRU in class AbstractLRUMap<K,int[]>

Parameters:

key -

value -