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 type
V - the value type
All Implemented Interfaces:
Serializable, Cloneable, Map<K,V>, SequencedMap<K,V>
Direct Known Subclasses:
LayoutCache

public class FixedSizeHashMap<K,V> extends 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:
  • Constructor Details

    • FixedSizeHashMap

      public FixedSizeHashMap(int maxSize)
    • FixedSizeHashMap

      public FixedSizeHashMap(int initialSize, int maxSize)
  • Method Details