Package com.googlecode.concurrentlinkedhashmap
ConcurrentMap
data structure.
Weigher
is a simple interface
for determining how many units of capacity an entry consumes. Depending on
which concrete Weigher class is used, an entry may consume a different amount
of space within the cache. The
Weighers
class provides
utility methods for obtaining the most common kinds of implementations.
EvictionListener
provides the
ability to be notified when an entry is evicted from the map. An eviction
occurs when the entry was automatically removed due to the map exceeding a
capacity threshold. It is not called when an entry was explicitly removed.
The ConcurrentLinkedHashMap
class supplies an efficient, scalable, thread-safe, bounded map. As with the
Java Collections Framework the "Concurrent" prefix is used to
indicate that the map is not governed by a single exclusion lock. The
concurrency characteristics are those provided by the
ConcurrentHashMap
implementation that is
available at runtime.
- See Also:
-
ClassDescriptionA hash table supporting full concurrency of retrievals, adjustable expected concurrency for updates, and a maximum capacity to bound the map by.A weigher that enforces that the weight falls within a valid range.A builder that creates
ConcurrentLinkedHashMap
instances.A listener that ignores all notifications.A queue that discards all additions and is always empty.The draining status of the buffers.A proxy that is serialized instead of the map.An operation that can be lazily applied to the page replacement policy.A value, its weight, and the entry's status.EntryWeigher<K,V> A class that can determine the weight of an entry.EvictionListener<K,V> A listener registered for notification when an entry is evicted.An element that is linked on theDeque
.LinkedDeque<E extends Linked<E>>Linked list implementation of theDeque
interface where the link pointers are tightly integrated with the element.Weigher<V>A class that can determine the weight of a value.A common set ofWeigher
andEntryWeigher
implementations.