java.util.concurrent.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 com.
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.
| Modifier and Type | Interface and Description |
|---|---|
| pack-priv interface |
| Modifier and Type | Class and Description |
|---|---|
| pack-priv class | LinkedDeque<
the type of elements held in this collection E extends LinkedLinked list implementation of the |
| public class | PrivateMaxEntriesMap<
the type of keys maintained by this map K, the type of mapped values V>A hash table supporting full concurrency of retrievals, adjustable expected concurrency for updates, and a maximum capacity to bound the map by. |