Package com.fasterxml.jackson.databind.util.internal
This package contains an implementation of a bounded
ConcurrentMap data structure.
This package is intended only for use internally by Jackson libraries and has missing features compared to the full http://code.google.com/p/concurrentlinkedhashmap/ implementation.
The PrivateMaxEntriesMap
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.
-
Interface Summary Interface Description Linked<T extends Linked<T>> An element that is linked on theDeque. -
Class Summary Class Description LinkedDeque<E extends Linked<E>> Linked list implementation of theDequeinterface where the link pointers are tightly integrated with the element.PrivateMaxEntriesMap<K,V> A hash table supporting full concurrency of retrievals, adjustable expected concurrency for updates, and a maximum capacity to bound the map by.PrivateMaxEntriesMap.Builder<K,V> A builder that createsPrivateMaxEntriesMapinstances.PrivateMaxEntriesMap.Node<K,V> A node contains the key, the weighted value, and the linkage pointers on the page-replacement algorithm's data structures.PrivateMaxEntriesMap.SerializationProxy<K,V> A proxy that is serialized instead of the map.PrivateMaxEntriesMap.WeightedValue<V> A value, its weight, and the entry's status. -
Enum Summary Enum Description PrivateMaxEntriesMap.DrainStatus The draining status of the buffers.