Skip navigation links
oracle.adf.share.common.rc.util.impl
Class LRUReferenceMap<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
oracle.adf.share.common.rc.util.impl.LRUReferenceMap<K,V>
- Type Parameters:
K
-
V
-
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, java.util.Map<K,V>
-
public class LRUReferenceMap<K,V>
- extends java.util.LinkedHashMap<K,V>
This map restricts it's maximum size to be within the capacity passed to the constructor based on removing the least recently used entries. If Reference values are used, null referent's will be removed before considering the LRU on the capacity. Iterators are access ordered.
- See Also:
- Serialized Form
Nested classes/interfaces inherited from class java.util.AbstractMap |
java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V> |
Methods inherited from class java.util.LinkedHashMap |
clear, containsValue, get |
Methods inherited from class java.util.HashMap |
clone, containsKey, entrySet, isEmpty, keySet, put, putAll, remove, size, values |
Methods inherited from class java.util.AbstractMap |
equals, hashCode, toString |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
LRUReferenceMap
public LRUReferenceMap()
LRUReferenceMap
public LRUReferenceMap(int capacity)
removeEldestEntry
protected boolean removeEldestEntry(java.util.Map.Entry<K,V> eldest)
-
- Overrides:
removeEldestEntry
in class java.util.LinkedHashMap<K,V>
Skip navigation links
Copyright © 1997, 2012, Oracle. All rights reserved.