Uses of Package
com.github.benmanes.caffeine.cache
Packages that use com.github.benmanes.caffeine.cache
-
Classes in com.github.benmanes.caffeine.cache used by com.github.benmanes.caffeine.cacheClassDescriptionThis class provides a skeletal implementation of the
LinkedDeque
interface to minimize the effort required to implement this interface.A linked deque implementation used to represent an access-order queue.An element that is linked on theDeque
.Computes or retrieves values asynchronously, based on a key, for use in populating aAsyncLoadingCache
.A semi-persistent mapping from keys to values.Enforces a memory layout to avoid false sharing by padding the write count.Enforces a memory layout to avoid false sharing by padding the read count.Enforces a memory layout to avoid false sharing by padding the drain status.An in-memory cache implementation that supports full concurrency of retrievals, a high expected concurrency for updates, and multiple ways to bound the cache.A reusable task that performs the maintenance work; used to avoid wrapping by ForkJoinPool.A multiple-producer / single-consumer buffer that rejects new elements if it is full or fails spuriously due to contention.A semi-persistent mapping from keys to values.Computes or retrieves values, based on a key, for use in populating aLoadingCache
orAsyncLoadingCache
.Communicates the write or deletion of a value, based on a key, to an external resource.A builder ofAsyncLoadingCache
,LoadingCache
, andCache
instances having a combination of the following features: automatic loading of entries into the cache, optionally asynchronously size-based eviction when a maximum is exceeded based on frequency and recency time-based expiration of entries, measured since last access or last write asynchronously refresh when the first stale request for an entry occurs keys automatically wrapped in weak references values automatically wrapped in weak or soft references writes propagated to an external resource notification of evicted (or otherwise removed) entries accumulation of cache access statisticsA specification of aCaffeine
builder configuration.A probabilistic multiset for estimating the popularity of an element within a time window.A linked list extension of theDeque
interface where the link pointers are tightly integrated with the element.A semi-persistent mapping from keys to values.This class provides a skeletal implementation of theAsyncLoadingCache
interface to minimize the effort required to implement aLocalCache
.An in-memory cache providing thread safety and atomicity guarantees.This class provides a skeletal implementation of theLoadingCache
interface to minimize the effort required to implement aLocalCache
.This class provides a skeletal implementation of theCache
interface to minimize the effort required to implement aLocalCache
.An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks of the initial size.An entry in the cache containing the key, value, weight, access, and write metadata.WARNING: GENERATED CODE A factory for cache nodes optimized for a particular configuration.A non-fair lock using AQS state to represent if the lock is held.An access point for inspecting and performing low-level operations based on the cache's runtime characteristics.The low-level operations for a cache with a size-based eviction policy.The low-level operations for a cache with a expiration policy.A weak or soft reference that includes the entry's key reference.The value in a cache that holds values softly.The key in a cache that holds keys weakly.The value in a cache that holds values weakly.The reason why a cached entry was removed.An object that can receive a notification when an entry is removed from a cache.Serializes the configuration of the cache, reconsitituting it as aCache
,LoadingCache
, orAsyncLoadingCache
usingCaffeine
upon deserialization.A base class providing the mechanics for supporting dynamic striping of bounded buffers.A time source that returns a time value representing the number of nanoseconds elapsed since some fixed but arbitrary point in time.An in-memory cache that has no capabilities for bounding the map.An adapter to safely externalize the entry spliterator.Calculates the weights of cache entries.A linked deque implementation used to represent a write-order queue.An element that is linked on theDeque
.