| Class and Description |
|---|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| SparseArrayLinkedList
This list share the same motivation and structure of https://en.wikipedia.org/wiki/Unrolled_linked_list:
it's a linked list of arrays/chunks of
T.Differently from an UnrolledLinkedList this list doesn't optimize addition and removal to achieve a balanced
utilization among chunks ie a chunk is removed only if empty and chunks can't be merged. |
| Class and Description |
|---|
| ConcurrentLongHashMap
Map from long to an Object.
|
| 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.
|
| SparseArrayLinkedList
This list share the same motivation and structure of https://en.wikipedia.org/wiki/Unrolled_linked_list:
it's a linked list of arrays/chunks of
T.Differently from an UnrolledLinkedList this list doesn't optimize addition and removal to achieve a balanced
utilization among chunks ie a chunk is removed only if empty and chunks can't be merged. |
| Class and Description |
|---|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| LinkedListImpl.Node |
| LinkedListIterator
A LinkedListIterator
This iterator allows the last element to be repeated in the next call to hasNext or next
|
| Class and Description |
|---|
| ConcurrentLongHashMap
Map from long to an Object.
|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| SparseArrayLinkedList
This list share the same motivation and structure of https://en.wikipedia.org/wiki/Unrolled_linked_list:
it's a linked list of arrays/chunks of
T.Differently from an UnrolledLinkedList this list doesn't optimize addition and removal to achieve a balanced
utilization among chunks ie a chunk is removed only if empty and chunks can't be merged. |
| Class and Description |
|---|
| LinkedListIterator
A LinkedListIterator
This iterator allows the last element to be repeated in the next call to hasNext or next
|
| Class and Description |
|---|
| LinkedListImpl.Node |
| LinkedListIterator
A LinkedListIterator
This iterator allows the last element to be repeated in the next call to hasNext or next
|
| RepeatableIterator |
| ResettableIterator |
| Class and Description |
|---|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| SparseArrayLinkedList
This list share the same motivation and structure of https://en.wikipedia.org/wiki/Unrolled_linked_list:
it's a linked list of arrays/chunks of
T.Differently from an UnrolledLinkedList this list doesn't optimize addition and removal to achieve a balanced
utilization among chunks ie a chunk is removed only if empty and chunks can't be merged. |
| Class and Description |
|---|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| TypedProperties
Property Value Conversion.
|
| Class and Description |
|---|
| 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.
|
| PriorityLinkedList
A type of linked list which maintains items according to a priority
and allows adding and removing of elements at both ends, and peeking.
Only PriorityLinkedList.size() and PriorityLinkedList.isEmpty() are safe to be called concurrently. |
| RepeatableIterator |
| ResettableIterator |
| TypedProperties.StringValue |
| TypedProperties.StringValue.ByteBufStringValuePool |
| TypedProperties.TypedPropertiesDecoderPools |
Copyright © 2025 JBoss by Red Hat. All rights reserved.