public class ConcurrentCache<T> extends ConcurrentHashMap<Object,T> implements Cache<T>
ConcurrentCache interface is used to represent a
cache that will store key value pairs. This implementation is
backed by a ConcurrentHashMap for best performance.ConcurrentHashMap.KeySetView<K,V>AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
ConcurrentCache()
Constructor for the
ConcurrentCache object. |
| Modifier and Type | Method and Description |
|---|---|
void |
cache(Object key,
T value)
This method is used to insert a key value mapping in to the
cache.
|
boolean |
contains(Object key)
This is used to determine whether the specified key exists
with in the cache.
|
T |
fetch(Object key)
This method is used to get the value from the cache that is
mapped to the specified key.
|
T |
take(Object key)
This is used to exclusively take the value mapped to the
specified key from the cache.
|
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, elements, entrySet, equals, forEach, forEach, forEach, forEachEntry, forEachEntry, forEachKey, forEachKey, forEachValue, forEachValue, get, getOrDefault, hashCode, isEmpty, keys, keySet, keySet, mappingCount, merge, newKeySet, newKeySet, put, putAll, putIfAbsent, reduce, reduceEntries, reduceEntries, reduceEntriesToDouble, reduceEntriesToInt, reduceEntriesToLong, reduceKeys, reduceKeys, reduceKeysToDouble, reduceKeysToInt, reduceKeysToLong, reduceToDouble, reduceToInt, reduceToLong, reduceValues, reduceValues, reduceValuesToDouble, reduceValuesToInt, reduceValuesToLong, remove, remove, replace, replace, replaceAll, search, searchEntries, searchKeys, searchValues, size, toString, valuesclonepublic ConcurrentCache()
ConcurrentCache object. This
is an implementation of a cache that uses the conventional
concurrent hash map from the Java collections API.public void cache(Object key, T value)
public T take(Object key)
public T fetch(Object key)