Package org.apache.activemq.artemis.utils.collections

package org.apache.activemq.artemis.utils.collections

Related Packages

Package	Description
org.apache.activemq.artemis.utils

Class	Description
ArrayResettableIterator<E>	Provides an Array Iterator that is able to reset, allowing you to iterate over the full array.
ConcurrentAppendOnlyChunkedList<E>	This collection is a concurrent append-only list that grows in chunks.
ConcurrentHashSet<E>	A ConcurrentHashSet.
ConcurrentLongHashMap<V>	Map from long to an Object.
ConcurrentLongHashMap.EntryProcessor<V>
ConcurrentLongHashSet	Concurrent hash set for primitive longs
ConcurrentLongHashSet.ConsumerLong
ConcurrentSet<E>	A ConcurrentSet
EmptyList<E>
IterableStream
LinkedList<E>
LinkedListImpl<E>	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<E>
LinkedListIterator<E>	A LinkedListIterator
LongHashSet	A hash set implementation of Set<Long> that uses open addressing values.
MaxSizeMap<K,V>
MultiIterator<E>	Provides an Iterator that works over multiple underlying iterators.
MultiResettableIterator<E>	Extends MultiIterator, adding the ability if the underlying iterators are resettable, then its self can reset.
NodeStore<E>	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)
NodeStoreFactory<E>
NoOpMap<K,V>	This class implements a Map, but actually doesnt store anything, it is similar in idea to an EmptyMap, but where mutation methods simply do a no op rather than UnsupportedOperationException as with EmptyMap.
PriorityCollection<E extends PriorityAware>	This class's purpose is to hold the the different collections used for each priority level.
PriorityCollection.PriorityHolder<E>
PriorityLinkedList<E>	A type of linked list which maintains items according to a priority and allows adding and removing of elements at both ends, and peeking.
PriorityLinkedListImpl<E>	A priority linked list implementation
RepeatableIterator<E>
RepeatableIteratorWrapper<E>
ResettableIterator<E>
SingletonIterator<E>
SparseArrayLinkedList<E>	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.
TypedProperties	Property Value Conversion.
TypedProperties.StringValue
TypedProperties.StringValue.ByteBufStringValuePool
TypedProperties.TypedPropertiesDecoderPools
TypedProperties.TypedPropertiesStringSimpleStringPools
UpdatableIterator<E>