ucar.nc2.util

Class HashMapLRU

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap

ucar.nc2.util.HashMapLRU

All Implemented Interfaces:

Serializable, Cloneable, Map

public class HashMapLRU
extends LinkedHashMap

A HashMap that removes the oldest member when it exceeds the maximum number of entries.

Author:

caron

See Also:

LinkedHashMap, Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class java.util.AbstractMap

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

Constructor Summary

Constructors

Constructor and Description
HashMapLRU(int initialCapacity, int max_entries) Constructor.

Method Summary

Methods

Modifier and Type	Method and Description
protected boolean	removeEldestEntry(Map.Entry eldest)

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

Constructor Detail

HashMapLRU

public HashMapLRU(int initialCapacity,
          int max_entries)

Constructor.

Parameters:

initialCapacity - start with this size

max_entries - dont exceed this number of entries.

Method Detail

removeEldestEntry

protected boolean removeEldestEntry(Map.Entry eldest)

Overrides:

removeEldestEntry in class LinkedHashMap