|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.h2.mvstore.cache.CacheLongKeyLIRS<V>
V
- the value typepublic class CacheLongKeyLIRS<V>
A scan resistant cache that uses keys of type long. It is meant to cache objects that are relatively costly to acquire, for example file content.
This implementation is multi-threading safe and supports concurrent access. Null keys or null values are not allowed. The map fill factor is at most 75%.
Each entry is assigned a distinct memory size, and the cache will try to use at most the specified amount of memory. The memory unit is not relevant, however it is suggested to use bytes as the unit.
This class implements an approximation of the the LIRS replacement algorithm invented by Xiaodong Zhang and Song Jiang as described in http://www.cse.ohio-state.edu/~zhang/lirs-sigmetrics-02.html with a few smaller changes: An additional queue for non-resident entries is used, to prevent unbound memory usage. The maximum size of this queue is at most the size of the rest of the stack. About 6.25% of the mapped entries are cold.
Internally, the cache is split into a number of segments, and each segment is an individual LIRS cache.
Accessed entries are only moved to the top of the stack if at least a number of other entries have been moved to the front (1% by default). Write access and moving entries to the top of the stack is synchronized per segment.
Constructor Summary | |
---|---|
CacheLongKeyLIRS(int maxEntries)
Create a new cache with the given number of entries, and the default settings (an average size of 1 per entry, 16 segments, and stack move distance equals to the maximum number of entries divided by 100). |
|
CacheLongKeyLIRS(long maxMemory,
int averageMemory,
int segmentCount,
int stackMoveDistance)
Create a new cache with the given memory size. |
Method Summary | |
---|---|
void |
clear()
Remove all entries. |
boolean |
containsKey(long key)
Check whether there is a resident entry for the given key. |
boolean |
containsValue(java.lang.Object value)
Check whether the given value is stored. |
java.util.Set<java.util.Map.Entry<java.lang.Long,V>> |
entrySet()
Get the entry set for all resident entries. |
V |
get(long key)
Get the value for the given key if the entry is cached. |
int |
getAverageMemory()
Get the average memory used per entry. |
java.util.Map<java.lang.Long,V> |
getMap()
Convert this cache to a map. |
long |
getMaxMemory()
Get the maximum memory to use. |
int |
getMemory(long key)
Get the memory used for the given key. |
long |
getUsedMemory()
Get the currently used memory. |
boolean |
isEmpty()
Check whether the cache is empty. |
java.util.List<java.lang.Long> |
keys(boolean cold,
boolean nonResident)
Get the list of keys. |
java.util.Set<java.lang.Long> |
keySet()
Get the set of keys for resident entries. |
V |
peek(long key)
Get the value for the given key if the entry is cached. |
V |
put(long key,
V value)
Add an entry to the cache using the average memory size. |
V |
put(long key,
V value,
int memory)
Add an entry to the cache. |
void |
putAll(java.util.Map<java.lang.Long,? extends V> m)
Add all elements of the map to this cache. |
V |
remove(long key)
Remove an entry. |
void |
setAverageMemory(int averageMemory)
Set the average memory used per entry. |
void |
setMaxMemory(long maxMemory)
Set the maximum memory this cache should use. |
int |
size()
Get the number of resident entries. |
int |
sizeHot()
Get the number of hot entries in the cache. |
int |
sizeMapArray()
Get the length of the internal map array. |
int |
sizeNonResident()
Get the number of non-resident entries in the cache. |
protected int |
sizeOf(V value)
Get the size of the given value. |
java.util.List<V> |
values()
Get the values for all resident entries. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public CacheLongKeyLIRS(int maxEntries)
maxEntries
- the maximum number of entriespublic CacheLongKeyLIRS(long maxMemory, int averageMemory, int segmentCount, int stackMoveDistance)
maxMemory
- the maximum memory to use (1 or larger)averageMemory
- the average memory (1 or larger)segmentCount
- the number of cache segments (must be a power of 2)stackMoveDistance
- how many other item are to be moved to the top
of the stack before the current item is movedMethod Detail |
---|
public void clear()
public boolean containsKey(long key)
key
- the key (may not be null)
public V peek(long key)
key
- the key (may not be null)
public V put(long key, V value)
key
- the key (may not be null)value
- the value (may not be null)
public V put(long key, V value, int memory)
key
- the key (may not be null)value
- the value (may not be null)memory
- the memory used for the given entry
protected int sizeOf(V value)
value
- the value
public V remove(long key)
key
- the key (may not be null)
public int getMemory(long key)
key
- the key (may not be null)
public V get(long key)
key
- the key (may not be null)
public long getUsedMemory()
public void setMaxMemory(long maxMemory)
maxMemory
- the maximum size (1 or larger)public void setAverageMemory(int averageMemory)
averageMemory
- the average memory used (1 or larger)public int getAverageMemory()
public long getMaxMemory()
public java.util.Set<java.util.Map.Entry<java.lang.Long,V>> entrySet()
public java.util.Set<java.lang.Long> keySet()
public int sizeNonResident()
public int sizeMapArray()
public int sizeHot()
public int size()
public java.util.List<java.lang.Long> keys(boolean cold, boolean nonResident)
cold
- if true, only keys for the cold entries are returnednonResident
- true for non-resident entries
public java.util.List<V> values()
public boolean isEmpty()
public boolean containsValue(java.lang.Object value)
value
- the value
public java.util.Map<java.lang.Long,V> getMap()
public void putAll(java.util.Map<java.lang.Long,? extends V> m)
m
- the map
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |