| ConcurrentLongHashMap.EntryProcessor |
|
| ConcurrentLongHashSet |
Concurrent hash set for primitive longs
Provides similar methods as a ConcurrentSet<Long> but since it's an open hash map with linear probing, no node
allocations are required to store the values.
|
| ConcurrentLongHashSet.ConsumerLong |
|
| ConcurrentSet |
A ConcurrentSet
|
| LinkedList |
|
| LinkedListImpl |
A linked list implementation which allows multiple iterators to exist at the same time on the queue, and which see any
elements added or removed from the queue either directly or via iterators.
|
| LinkedListImpl.Node |
|
| LinkedListIterator |
A LinkedListIterator
This iterator allows the last element to be repeated in the next call to hasNext or next
|
| LongHashSet |
A hash set implementation of Set<Long> that uses open addressing values.
|
| LongHashSet.LongIterator |
Iterator which supports unboxed access to values.
|
| NodeStore |
This interface is meant to encapsulate the usage of HashMap<ListID, LongObjectHashMap<ElementType>>
The implementation should store the node in such way that you can access it through NodeStore.getNode(String, long) |
| PriorityLinkedList |
|
| RepeatableIterator |
|
| ResettableIterator |
|
| TypedProperties |
Property Value Conversion.
|
| TypedProperties.StringValue |
|
| TypedProperties.StringValue.ByteBufStringValuePool |
|
| TypedProperties.TypedPropertiesDecoderPools |
|