org.apache.flink.table.runtime.util

类 LRUMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<K,V>

org.apache.flink.table.runtime.util.LRUMap<K,V>

所有已实现的接口:

Serializable, Cloneable, Map<K,V>

public class LRUMap<K,V>
extends LinkedHashMap<K,V>

An LRU cache, based on LinkedHashMap.

This cache has a fixed maximum number of elements (cacheSize). If the cache is full and another entry is added, the LRU (least recently used) entry is dropped.

Note: This class is not thread-safe.

另请参阅:

序列化表格

嵌套类概要

嵌套类

限定符和类型	类和说明
static interface	LRUMap.RemovalListener<K,V> An object that can receive a notification when an entry is removed from a LRUMap.

从类继承的嵌套类/接口 java.util.AbstractMap

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

构造器概要

构造器

构造器和说明
LRUMap(int cacheSize)
LRUMap(int cacheSize, LRUMap.RemovalListener<K,V> removalListener)

方法概要

限定符和类型	方法和说明
protected boolean	removeEldestEntry(Map.Entry<K,V> eldest)

从类继承的方法 java.util.LinkedHashMap

clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, replaceAll, values

从类继承的方法 java.util.HashMap

clone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, size

从类继承的方法 java.util.AbstractMap

equals, hashCode, toString

从类继承的方法 java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

从接口继承的方法 java.util.Map

compute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, size

构造器详细资料

LRUMap

public LRUMap(int cacheSize)

LRUMap

public LRUMap(int cacheSize,
              LRUMap.RemovalListener<K,V> removalListener)

方法详细资料

removeEldestEntry

protected boolean removeEldestEntry(Map.Entry<K,V> eldest)

覆盖:

removeEldestEntry 在类中 LinkedHashMap<K,V>