edu.umd.cs.findbugs.util
Class MapCache<K,V>
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<K,V>
edu.umd.cs.findbugs.util.MapCache<K,V>
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable, java.util.Map<K,V>
- Direct Known Subclasses:
- ProfilingMapCache
public class MapCache<K,V>
- extends java.util.LinkedHashMap<K,V>
Provide a HashMap that can only grow to a specified maximum capacity,
with entries discarded using a LRU policy to keep the size of the HashMap
within that bound.
- Author:
- pugh
- 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> |
Constructor Summary |
MapCache(int maxCapacity)
Create a new MapCache |
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 |
MapCache
public MapCache(int maxCapacity)
- Create a new MapCache
- Parameters:
maxCapacity
- - maximum number of entries in the map
removeEldestEntry
protected boolean removeEldestEntry(java.util.Map.Entry<K,V> eldest)
- Overrides:
removeEldestEntry
in class java.util.LinkedHashMap<K,V>
FindBugs™ is licenced under the LGPL. Copyright © 2006 University of Maryland.