com.att.nsa.apiClient.http

Class EntityLruCache<V>

java.lang.Object

java.util.AbstractMap<K,V>

java.util.HashMap<K,V>

java.util.LinkedHashMap<String,V>

com.att.nsa.apiClient.http.EntityLruCache<V>

All Implemented Interfaces:

Serializable, Cloneable, Map<String,V>

public class EntityLruCache<V>
extends LinkedHashMap<String,V>

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
EntityLruCache(int maxSize, long maxObjCacheTime, TimeUnit maxObjCacheTimeUnit)

Method Summary

Modifier and Type	Method and Description
void	clear() Remove all (key, value) pairs from the cache.
boolean	containsKey(Object key)
V	get(Object key) Get the value for the key if it exists in the cache.
double	getHitRatio()
V	put(String key, V value) Add the (key, value) pair to the cache if there is enough space.
protected boolean	removeEldestEntry(Map.Entry<String,V> eldest)
int	size()

Methods inherited from class java.util.LinkedHashMap

containsValue, entrySet, forEach, getOrDefault, keySet, replaceAll, values

Methods inherited from class java.util.HashMap

clone, compute, computeIfAbsent, computeIfPresent, isEmpty, merge, putAll, putIfAbsent, remove, remove, replace, replace

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, equals, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, remove, replace, replace

Constructor Detail

EntityLruCache

public EntityLruCache(int maxSize,
                      long maxObjCacheTime,
                      TimeUnit maxObjCacheTimeUnit)

Method Detail

getHitRatio

public double getHitRatio()

Returns:

the ratio of cache hits to misses.

clear

public void clear()

Remove all (key, value) pairs from the cache.

Specified by:

clear in interface Map<String,V>

Overrides:

clear in class LinkedHashMap<String,V>

put

public V put(String key,
             V value)

Add the (key, value) pair to the cache if there is enough space. If there is not enough space, evict the least recently used (key, value) pair in the cache before adding this (key, value) pair.

Specified by:

put in interface Map<String,V>

Overrides:

put in class HashMap<String,V>

Parameters:

key -

value -

Returns:

the previous value, or null

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map<String,V>

Overrides:

containsKey in class HashMap<String,V>

get

public V get(Object key)

Get the value for the key if it exists in the cache. If the key does not exist in the cache, return null.

Specified by:

get in interface Map<String,V>

Overrides:

get in class LinkedHashMap<String,V>

Parameters:

key -

size

public int size()

Specified by:

size in interface Map<String,V>

Overrides:

size in class HashMap<String,V>

removeEldestEntry

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

Overrides:

removeEldestEntry in class LinkedHashMap<String,V>