public class LimitedLinkedHashMap<K,V> extends LinkedHashMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| 构造器和说明 |
|---|
LimitedLinkedHashMap(int maxCapacity) |
LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder) |
LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder,
int initialCapacity) |
LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder,
int initialCapacity,
float loadFactor) |
| 限定符和类型 | 方法和说明 |
|---|---|
int |
getMaxCapacity() |
protected boolean |
removeEldestEntry(Map.Entry<K,V> eldest) |
void |
setMaxCapacity(int maxCapacity) |
clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, replaceAll, valuesclone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, sizeequals, hashCode, toStringcompute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, sizepublic LimitedLinkedHashMap(int maxCapacity)
public LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder)
public LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder,
int initialCapacity)
public LimitedLinkedHashMap(int maxCapacity,
boolean accessOrder,
int initialCapacity,
float loadFactor)
public int getMaxCapacity()
public void setMaxCapacity(int maxCapacity)
protected boolean removeEldestEntry(Map.Entry<K,V> eldest)
removeEldestEntry 在类中 LinkedHashMap<K,V>Copyright © 2025 fossc. All rights reserved.