Package com.fasterxml.jackson.databind.util.internal

This package contains an implementation of a bounded ConcurrentMap data structure.

See: Description

Class Summary

Class	Description
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.

Package com.fasterxml.jackson.databind.util.internal Description

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/