Package tools.jackson.databind.util.internal

package tools.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.

See Also:

• http://code.google.com/p/concurrentlinkedhashmap/

Related Packages

Package	Description
tools.jackson.databind.util	Utility classes for Mapper package.

Class	Description
Linked<T extends Linked<T>>	An element that is linked on the Deque.
LinkedDeque<E extends Linked<E>>	Linked list implementation of the Deque interface 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 creates PrivateMaxEntriesMap instances.
PrivateMaxEntriesMap.DrainStatus	The draining status of the buffers.
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.
UnreflectHandleSupplier	Lazy memoized holder for MethodHandles.