Uses of Package
org.agrona.collections
Packages that use org.agrona.collections
Package
Description
Collections classes that support primitive types and tend to be cache friendly.
Counters for indicating status and telemetry which can be put in shared memory for live inspection.
-
Classes in org.agrona.collections used by org.agrona.collectionsClassDescriptionMap that takes two part int key and associates with an object.Handler for a map entryCreates a new value based upon keys.Creates a new value based upon keys.An open-addressing with linear probing hash map specialised for primitive key and value pairs.Base iterator implementation.Iterator over entries which supports access to unboxed keys and values.Set of entries which supports optionally cached iterators to avoid allocation.Iterator over keys which supports access to unboxed keys via
Int2IntHashMap.KeyIterator.nextValue()
.Set of keys which supports optional cached iterators to avoid allocation.Collection of values which supports optionally cached iterators to avoid allocation.Iterator over values which supports access to unboxed values.A cache implementation specialised for int keys using open addressing to probe a set of fixed size.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which supports access to unboxed keys viaInt2ObjectCache.EntryIterator.getIntKey()
.Set of entries which supports cached iterator to avoid allocation.Iterator over keys which supports access to unboxed keys viaInt2ObjectCache.KeyIterator.nextInt()
.A key set implementation which supports cached iterator to avoid allocation.Collection of values which supports cached iterator to avoid allocation.An iterator over values.Map
implementation specialised for int keys using open addressing and linear probing for cache efficient access.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which supports access to unboxed keys viaInt2ObjectHashMap.EntryIterator.getIntKey()
.Set of entries which supports access via an optionally cached iterator to avoid allocation.Iterator over keys which supports access to unboxed keys viaInt2ObjectHashMap.KeyIterator.nextInt()
.Set of keys which supports optionally cached iterators to avoid allocation.Collection of values which supports optionally cached iterators to avoid allocation.Iterator over values.AList
implementation that stores int values with the ability to not have them boxed.SpecialisedIterator
from which the value can be retrieved without boxing viaIntArrayQueue.IntIterator.nextValue()
.Open-addressing with linear-probing expandable hash set.Iterator which supports unboxed access to the values viaIntHashSet.IntIterator.nextValue()
.Primitive specialisation of a BiConsumer for a pair of ints.Primitive specialisation of a BiFunction for a pair of ints.Primitive specialisation of a BiPredicate for a pair of ints.This is an (int, Object) primitive specialisation of a BiConsumer.This is an (int, Object) -> Object primitive specialisation of a BiFunction.This is an (int, Object) primitive specialisation of a BiPredicate.An open-addressing with linear probing hash map specialised for primitive key and value pairs.Base iterator implementation.Iterator over entries which supports access to unboxed keys and values.Set of entries which supports optionally cached iterators to avoid allocation.Iterator over keys which supports access to unboxed keys viaLong2LongHashMap.KeyIterator.nextValue()
.Set of keys which supports optional cached iterators to avoid allocation.Collection of values which supports optionally cached iterators to avoid allocation.Iterator over values which supports access to unboxed values.A cache implementation specialised for long keys using open addressing to probe a set of fixed size.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which supports access to unboxed keys viaLong2ObjectCache.EntryIterator.getLongKey()
.Set of entries which supports cached iterator to avoid allocation.Iterator over keys which supports access to unboxed keys viaLong2ObjectCache.KeyIterator.nextLong()
.A key set implementation which supports cached iterator to avoid allocation.Collection of values which supports cached iterator to avoid allocation.An iterator over values.Map
implementation specialised for long keys using open addressing and linear probing for cache efficient access.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which supports access to unboxed keys viaLong2ObjectHashMap.EntryIterator.getLongKey()
.Set of entries which supports access via an optionally cached iterator to avoid allocation.Iterator over keys which supports access to unboxed keys viaLong2ObjectHashMap.KeyIterator.nextLong()
.Set of keys which supports optionally cached iterators to avoid allocation.Collection of values which supports optionally cached iterators to avoid allocation.Iterator over values.AList
implementation that stores long values with the ability to not have them boxed.SpecialisedIterator
from which the value can be retrieved without boxing viaLongArrayQueue.LongIterator.nextValue()
.Open-addressing with linear-probing expandable hash set.Iterator which supports unboxed access to the values viaLongHashSet.LongIterator.nextValue()
.Primitive specialisation of a BiConsumer for a pair of longs.Primitive specialisation of a BiFunction for a pair of longs.Primitive specialisation of a BiPredicate for a pair of longs.This is an (long, Object) primitive specialisation of a BiConsumer.This is an (long, Object) -> Object primitive specialisation of a BiFunction.This is an (long, Object) primitive specialisation of a BiPredicate.Holder for an int value that is mutable.Holder for a long value that is mutable.Sentinel value used in collections supporting null value references.Map
implementation specialised for int values using open addressing and linear probing for cache efficient access.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which can provide unboxed access and optionally avoid allocation.Set of entries which can optionally cache iterators to avoid allocation.Iterator over keys.Set of keys that can optionally cache iterators to avoid allocation.Collection of values which can optionally cache iterators to avoid allocation.Iterator over values providing unboxed access viaObject2IntHashMap.ValueIterator.nextInt()
.Map
implementation specialised for long values using open addressing and linear probing for cache efficient access.Base iterator implementation that contains basic logic of traversing the element in the backing array.Iterator over entries which can provide unboxed access and optionally avoid allocation.Set of entries which can optionally cache iterators to avoid allocation.Iterator over keys.Set of keys that can optionally cache iterators to avoid allocation.Collection of values which can optionally cache iterators to avoid allocation.Iterator over values providing unboxed access viaObject2LongHashMap.ValueIterator.nextLong()
.An open-addressing with linear probing hash map, same algorithm asInt2IntHashMap
.Base iterator impl.An iterator over entries.An entry set implementation.An iterator over keys.A key set implementation.A collection of values.An iterator over values.Open-addressing with linear-probing expandable hash set.Iterator over the set which can be optionally cached to avoid allocation.This is an (Object, int) -> int primitive specialisation of a BiFunction.This is an (Object, long) -> long primitive specialisation of a BiFunction.This is an (Object, i) primitive specialisation of a BiConsumer.This is an (Object, int) primitive specialisation of a BiPredicate.This is an (Object, i) primitive specialisation of a BiConsumer.This is an (Object, long) primitive specialisation of a BiPredicate.A stateful reusable iterator. -
Classes in org.agrona.collections used by org.agrona.concurrent.statusClassDescriptionA
List
implementation that stores int values with the ability to not have them boxed.This is an (int, Object) primitive specialisation of a BiConsumer.