public class NLRUMapImpl<K,V> extends LinkedHashMap<K,V> implements NLRUMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
NLRUMapImpl(int maxEntries) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
removeEldestEntry(Map.Entry<K,V> eldest)
Returns
true if this LruCache has more entries than
the maximum specified when it was created. |
void |
resize(int maxEntries) |
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, waitclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesprotected boolean removeEldestEntry(Map.Entry<K,V> eldest)
true if this LruCache has more entries than
the maximum specified when it was created.
Map; it
relies on the implementation of LinkedHashMap to do that,
but that behavior is documented in the JavaDoc for
LinkedHashMap.
removeEldestEntry in class LinkedHashMap<K,V>eldest - the Entry in question; this implementation
doesn't care what It's, since the implementation is only dependent on
the size of the cachetrue if the oldestLinkedHashMap.removeEldestEntry(Map.Entry)Copyright © 2026 vpc open source initiative. All rights reserved.