Class AbstractCache<K,V>
- java.lang.Object
-
- com.google.common.cache.AbstractCache<K,V>
-
- All Implemented Interfaces:
Cache<K,V>
- Direct Known Subclasses:
AbstractLoadingCache
,CompositeDataStoreCache
,FileCache
@Beta @GwtCompatible public abstract class AbstractCache<K,V> extends java.lang.Object implements Cache<K,V>
This class provides a skeletal implementation of theCache
interface to minimize the effort required to implement this interface.To implement a cache, the programmer needs only to extend this class and provide an implementation for the
put(K, V)
andCache.getIfPresent(java.lang.Object)
methods.getAllPresent(java.lang.Iterable<?>)
is implemented in terms ofCache.getIfPresent(java.lang.Object)
;putAll(java.util.Map<? extends K, ? extends V>)
is implemented in terms ofput(K, V)
,invalidateAll(Iterable)
is implemented in terms ofinvalidate(java.lang.Object)
. The methodcleanUp()
is a no-op. All other methods throw anUnsupportedOperationException
.- Since:
- 10.0
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
AbstractCache.SimpleStatsCounter
A thread-safeAbstractCache.StatsCounter
implementation for use byCache
implementors.static interface
AbstractCache.StatsCounter
Accumulates statistics during the operation of aCache
for presentation byCache.stats()
.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.concurrent.ConcurrentMap<K,V>
asMap()
Returns a view of the entries stored in this cache as a thread-safe map.void
cleanUp()
Performs any pending maintenance operations needed by the cache.V
get(K key, java.util.concurrent.Callable<? extends V> valueLoader)
Returns the value associated withkey
in this cache, obtaining that value fromvalueLoader
if necessary.ImmutableMap<K,V>
getAllPresent(java.lang.Iterable<?> keys)
This implementation ofgetAllPresent
lacks any insight into the internal cache data structure, and is thus forced to return the query keys instead of the cached keys.void
invalidate(java.lang.Object key)
Discards any cached value for keykey
.void
invalidateAll()
Discards all entries in the cache.void
invalidateAll(java.lang.Iterable<?> keys)
Discards any cached values for keyskeys
.void
put(K key, V value)
Associatesvalue
withkey
in this cache.void
putAll(java.util.Map<? extends K,? extends V> m)
Copies all of the mappings from the specified map to the cache.long
size()
Returns the approximate number of entries in this cache.CacheStats
stats()
Returns a current snapshot of this cache's cumulative statistics.-
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Methods inherited from interface com.google.common.cache.Cache
getIfPresent
-
-
-
-
Method Detail
-
get
public V get(K key, java.util.concurrent.Callable<? extends V> valueLoader) throws java.util.concurrent.ExecutionException
Description copied from interface:Cache
Returns the value associated withkey
in this cache, obtaining that value fromvalueLoader
if necessary. No observable state associated with this cache is modified until loading completes. This method provides a simple substitute for the conventional "if cached, return; otherwise create, cache and return" pattern.Warning: as with
CacheLoader.load(K)
,valueLoader
must not returnnull
; it may either return a non-null value or throw an exception.
-
getAllPresent
public ImmutableMap<K,V> getAllPresent(java.lang.Iterable<?> keys)
This implementation ofgetAllPresent
lacks any insight into the internal cache data structure, and is thus forced to return the query keys instead of the cached keys. This is only possible with an unsafe cast which requireskeys
to actually be of typeK
. Returns a map of the values associated withkeys
in this cache. The returned map will only contain entries which are already present in the cache.- Specified by:
getAllPresent
in interfaceCache<K,V>
- Since:
- 11.0
-
put
public void put(K key, V value)
Description copied from interface:Cache
Associatesvalue
withkey
in this cache. If the cache previously contained a value associated withkey
, the old value is replaced byvalue
.Prefer
Cache.get(Object, Callable)
when using the conventional "if cached, return; otherwise create, cache and return" pattern.
-
putAll
public void putAll(java.util.Map<? extends K,? extends V> m)
Description copied from interface:Cache
Copies all of the mappings from the specified map to the cache. The effect of this call is equivalent to that of callingput(k, v)
on this map once for each mapping from keyk
to valuev
in the specified map. The behavior of this operation is undefined if the specified map is modified while the operation is in progress.
-
cleanUp
public void cleanUp()
Description copied from interface:Cache
Performs any pending maintenance operations needed by the cache. Exactly which activities are performed -- if any -- is implementation-dependent.
-
size
public long size()
Description copied from interface:Cache
Returns the approximate number of entries in this cache.
-
invalidate
public void invalidate(java.lang.Object key)
Description copied from interface:Cache
Discards any cached value for keykey
.- Specified by:
invalidate
in interfaceCache<K,V>
-
invalidateAll
public void invalidateAll(java.lang.Iterable<?> keys)
Description copied from interface:Cache
Discards any cached values for keyskeys
.- Specified by:
invalidateAll
in interfaceCache<K,V>
- Since:
- 11.0
-
invalidateAll
public void invalidateAll()
Description copied from interface:Cache
Discards all entries in the cache.- Specified by:
invalidateAll
in interfaceCache<K,V>
-
stats
public CacheStats stats()
Description copied from interface:Cache
Returns a current snapshot of this cache's cumulative statistics. All stats are initialized to zero, and are monotonically increasing over the lifetime of the cache.
-
-