K - V - public class LruHashMap<K,V> extends LinkedHashMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
LruHashMap(int maxCapacity) |
LruHashMap(int initialCapacity,
int maxCapacity) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
Map<K,V> |
cloneEntry() |
V |
get(Object key) |
int |
getMaxCapacity() |
V |
put(K key,
V value) |
V |
remove(Object key) |
protected boolean |
removeEldestEntry(Map.Entry<K,V> eldest) |
void |
setMaxCapacity(int maxCapacity) |
containsValue, entrySet, forEach, getOrDefault, keySet, replaceAll, valuesclone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, sizeequals, hashCode, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, sizepublic LruHashMap(int maxCapacity)
public LruHashMap(int initialCapacity,
int maxCapacity)
public int getMaxCapacity()
public void setMaxCapacity(int maxCapacity)
protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
removeEldestEntry in class LinkedHashMap<K,V>public void clear()
Copyright © 2021. All rights reserved.