Package ghidra.util.datastruct
Class FixedSizeHashMap<K,V>
- java.lang.Object
 - 
- java.util.AbstractMap<K,V>
 - 
- java.util.HashMap<K,V>
 - 
- java.util.LinkedHashMap<K,V>
 - 
- ghidra.util.datastruct.FixedSizeHashMap<K,V>
 
 
 
 
 
- 
- Type Parameters:
 K- the key typeV- the value type
- All Implemented Interfaces:
 java.io.Serializable,java.lang.Cloneable,java.util.Map<K,V>
- Direct Known Subclasses:
 LayoutCache
public class FixedSizeHashMap<K,V> extends java.util.LinkedHashMap<K,V>A simple implementation of a LRU map that will throw away entries that exceed the given maximum size.If you would like a LRU based upon access-order, then use the
LRUMap.- See Also:
 - Serialized Form
 
 
- 
- 
Constructor Summary
Constructors Constructor Description FixedSizeHashMap(int maxSize)FixedSizeHashMap(int initialSize, int maxSize) 
- 
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected booleanremoveEldestEntry(java.util.Map.Entry<K,V> eldest)- 
Methods inherited from class java.util.LinkedHashMap
clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, replaceAll, values 
- 
Methods inherited from class java.util.HashMap
clone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, size 
 - 
 
 -