See: Description
| Interface | Description |
|---|---|
| EconomicMap<K,V> |
Memory efficient map data structure that dynamically changes its representation depending on the
number of entries and is specially optimized for small number of entries.
|
| EconomicSet<E> |
Memory efficient set data structure.
|
| MapCursor<K,V> |
Cursor to iterate over a mutable map.
|
| UnmodifiableEconomicMap<K,V> |
Unmodifiable memory efficient map.
|
| UnmodifiableEconomicSet<E> |
Unmodifiable memory efficient set data structure.
|
| UnmodifiableMapCursor<K,V> |
Cursor to iterate over a map without changing its contents.
|
| Class | Description |
|---|---|
| EconomicMapUtil |
Utility methods for the
EconomicMap. |
| EconomicMapWrap<K,V> |
Wraps an existing
Map as an EconomicMap. |
| Equivalence |
Strategy for comparing two objects.
|
| LockFreePool<T> |
Concurrent lock-free pool data structure.
|
| LockFreePrefixTree |
Thread-safe and lock-free prefix-tree implementation in which keys are sequences of 64-bit
values, and the values are 64-bit values.
|
| LockFreePrefixTree.Allocator |
Policy for allocating objects of the lock-free prefix tree.
|
| LockFreePrefixTree.HeapAllocator |
Allocator that allocates objects directly on the managed heap.
|
| LockFreePrefixTree.Node | |
| LockFreePrefixTree.ObjectPoolingAllocator |
Allocator that internally maintains several pools of preallocated objects, and allocates
objects from those pools.
|
| Pair<L,R> |
Utility class representing a pair of values.
|
| SeqLockPrefixTree |
Thread-safe prefix-tree implementation in which keys are sequences of 64-bit values, and the
values are 64-bit values.
|
| SeqLockPrefixTree.Node |
EconomicMap,
EconomicSet