com.force.i18n.commons.util.collection

Class LruCache<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<K,V>

com.force.i18n.commons.util.collection.LruCache<K,V>

All Implemented Interfaces:

Serializable, Cloneable, Map<K,V>

@Beta
public class LruCache<K,V>
extends LinkedHashMap<K,V>

A basic implementation of a size-capped cache based on LinkedHashMap The eviction policy can be access order or insertion order. Beta class. Classes under com.force.i18n.commons package will be moved into a dedicated project.

Author:

fhossain

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 capacity) Uses access order for the eviction policy.
LruCache(int capacity, boolean accessOrder)
LruCache(int capacity, int initialCapacity)
LruCache(int capacity, int initialCapacity, boolean accessOrder)

Method Summary

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

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

LruCache

public LruCache(int capacity)

Uses access order for the eviction policy.

Parameters:

capacity - max capacity of the cache.

LruCache

public LruCache(int capacity,
                int initialCapacity)

LruCache

public LruCache(int capacity,
                boolean accessOrder)

LruCache

public LruCache(int capacity,
                int initialCapacity,
                boolean accessOrder)

Method Detail

removeEldestEntry

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

Overrides:

removeEldestEntry in class LinkedHashMap<K,V>

getCapacity

public int getCapacity()