com.pervasive.datarush.util

Class LruCache<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<K,V>

com.pervasive.datarush.util.LruCache<K,V>

Type Parameters:

K - the key type

V - the value type

All Implemented Interfaces:

Serializable, Cloneable, Map<K,V>

public final class LruCache<K,V>
extends LinkedHashMap<K,V>

Simple LRUCache implementation based off of linked hash map

See Also:

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
LruCache(int maxEntries) Create an LRU cache with the given max number of entries

Method Summary

Methods

Modifier and Type	Method and Description
protected boolean	removeEldestEntry(Map.Entry<K,V> eldest) Returns true if the size exceeds the max number of entries

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

LruCache

public LruCache(int maxEntries)

Create an LRU cache with the given max number of entries

Parameters:

maxEntries - the max number of entries

Method Detail

removeEldestEntry

protected boolean removeEldestEntry(Map.Entry<K,V> eldest)

Returns true if the size exceeds the max number of entries

Overrides:

removeEldestEntry in class LinkedHashMap<K,V>