net.thevpc.nuts.runtime.standalone.util.collections

Class LRUMap<A,B>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<A,B>

net.thevpc.nuts.runtime.standalone.util.collections.LRUMap<A,B>

All Implemented Interfaces:

Serializable, Cloneable, Map<A,B>

public class LRUMap<A,B>
extends LinkedHashMap<A,B>

Created by vpc on 6/1/14.

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
LRUMap(int maxEntries)

Method Summary

Modifier and Type	Method and Description
protected boolean	removeEldestEntry(Map.Entry<A,B> eldest) Returns true if this LruCache has more entries than the maximum specified when it was created.
void	resize(int maxEntries)

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

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

compute, computeIfAbsent, computeIfPresent, containsKey, equals, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, size

Constructor Detail

LRUMap

public LRUMap(int maxEntries)

Method Detail

removeEldestEntry

protected boolean removeEldestEntry(Map.Entry<A,B> eldest)

Returns true if this LruCache has more entries than the maximum specified when it was created.

This method does not modify the underlying Map; it relies on the implementation of LinkedHashMap to do that, but that behavior is documented in the JavaDoc for LinkedHashMap.

Overrides:

removeEldestEntry in class LinkedHashMap<A,B>

Parameters:

eldest - the Entry in question; this implementation doesn't care what it is, since the implementation is only dependent on the size of the cache

Returns:

true if the oldest

See Also:

LinkedHashMap.removeEldestEntry(Map.Entry)

resize

public void resize(int maxEntries)