K - Type of a key.V - Type of a value.public class LRUCache<K,V> extends LinkedHashMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
LRUCache(int cacheSize)
Constructs a new instance of LRU cache.
|
LRUCache(int cacheSize,
LRUCacheExpirationListener<V> expirationLsnr)
Constructs a new instance of LRU cache.
|
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
removeEldestEntry(Map.Entry<K,V> eldest) |
clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, replaceAll, valuesclone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, sizeequals, hashCode, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, sizepublic LRUCache(int cacheSize)
cacheSize - Cache size.public LRUCache(int cacheSize,
LRUCacheExpirationListener<V> expirationLsnr)
cacheSize - Cache size.expirationLsnr - Expiration listener.protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
removeEldestEntry in class LinkedHashMap<K,V>
GridGain In-Memory Computing Platform : ver. 8.9.26 Release Date : October 16 2025