Class LruCache<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<K,V>

org.junit.platform.commons.util.LruCache<K,V>

Type Parameters:

K - the type of keys maintained by this cache

V - the type of values maintained by this cache

All Implemented Interfaces:

Serializable, Cloneable, Map<K,V>, SequencedMap<K,V>

@API(status=INTERNAL,
     since="1.6")
public class LruCache<K,V>
extends LinkedHashMap<K,V>

A simple LRU cache with a maximum size.

This class is not thread-safe.

Since:

1.6

See Also:

• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class AbstractMap

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

Constructor Summary

Constructors

Constructor	Description
LruCache(int maxSize)	Create a new LRU cache that maintains at most the supplied number of entries.

Method Summary

Modifier and Type	Method	Description
protected boolean	removeEldestEntry(Map.Entry<K,V> eldest)

Methods inherited from class LinkedHashMap

clear, containsValue, entrySet, forEach, get, getOrDefault, keySet, newLinkedHashMap, putFirst, putLast, replaceAll, reversed, sequencedEntrySet, sequencedKeySet, sequencedValues, values

Methods inherited from class HashMap

clone, compute, computeIfAbsent, computeIfPresent, containsKey, isEmpty, merge, newHashMap, put, putAll, putIfAbsent, remove, remove, replace, replace, size

Methods inherited from class AbstractMap

equals, hashCode, toString

Methods inherited from class Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Map

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

Methods inherited from interface SequencedMap

firstEntry, lastEntry, pollFirstEntry, pollLastEntry

Constructor Details

LruCache

public LruCache(int maxSize)

Create a new LRU cache that maintains at most the supplied number of entries.

For optimal use of the internal data structures, you should pick a number that's one below a power of two since this is based on a HashMap and the eldest entry will be evicted after adding the entry that increases the size to be above maxSize.

Method Details

removeEldestEntry

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

Overrides:

removeEldestEntry in class LinkedHashMap<K,V>