| AbstractEntry<TypeK,TypeV> |
A simple implementation of Map.Entry.
|
| ConcurrentAutoTable |
An auto-resizing table of longs, supporting low-contention CAS
operations.
|
| ConcurrentAutoTable.CAT |
|
| NonBlockingHashMap<TypeK,TypeV> |
A lock-free alternate implementation of ConcurrentHashMap
with better scaling properties and generally lower costs to mutate the Map.
|
| NonBlockingHashMap.CHM<TypeK,TypeV> |
|
| NonBlockingHashMap.Prime |
|
| NonBlockingHashMapLong<TypeV> |
A lock-free alternate implementation of ConcurrentHashMap
with primitive long keys, better scaling properties and
generally lower costs.
|
| NonBlockingHashMapLong.CHM |
|
| NonBlockingHashMapLong.Prime |
|
| NonBlockingHashSet<E> |
|
| NonBlockingIdentityHashMap<TypeK,TypeV> |
A lock-free alternate implementation of ConcurrentHashMap
with better scaling properties and generally lower costs to mutate the Map.
|
| NonBlockingIdentityHashMap.CHM<TypeK,TypeV> |
|
| NonBlockingIdentityHashMap.Prime |
|
| NonBlockingSetInt |
A multi-threaded bit-vector set, implemented as an array of primitive
longs.
|
| NonBlockingSetInt.NBSI |
|