Package org.agrona.collections
Collections classes that support primitive types and tend to be cache friendly.
-
Interface Summary Interface Description BiInt2ObjectMap.EntryConsumer<V> Handler for a map entry.BiInt2ObjectMap.EntryFunction<V> Creates a new value based upon keys.BiInt2ObjectMap.EntryRemap<V,V1> Creates a new value based upon keys.IntIntConsumer Primitive specialisation of a BiConsumer for a pair of ints.IntIntFunction Primitive specialisation of a BiFunction for a pair of ints.IntIntPredicate Primitive specialisation of a BiPredicate for a pair of ints.IntObjConsumer<T> This is an (int, Object) primitive specialisation of a BiConsumer.IntObjectToObjectFunction<T,R> This is an (int, Object) -> Object primitive specialisation of a BiFunction.IntObjPredicate<T> This is an (int, Object) primitive specialisation of a BiPredicate.LongLongConsumer Primitive specialisation of a BiConsumer for a pair of longs.LongLongFunction Primitive specialisation of a BiFunction for a pair of longs.LongLongPredicate Primitive specialisation of a BiPredicate for a pair of longs.LongObjConsumer<T> This is an (long, Object) primitive specialisation of a BiConsumer.LongObjectToObjectFunction<T,R> This is an (long, Object) -> Object primitive specialisation of a BiFunction.LongObjPredicate<T> This is an (long, Object) primitive specialisation of a BiPredicate.ObjectIntToIntFunction<T> This is an (Object, int) -> int primitive specialisation of a BiFunction.ObjectLongToLongFunction<T> This is an (Object, long) -> long primitive specialisation of a BiFunction.ObjIntConsumer<T> This is an (Object, i) primitive specialisation of a BiConsumer.ObjIntPredicate<T> This is an (Object, int) primitive specialisation of a BiPredicate.ObjLongConsumer<T> This is an (Object, i) primitive specialisation of a BiConsumer.ObjLongPredicate<T> This is an (Object, long) primitive specialisation of a BiPredicate. -
Class Summary Class Description ArrayListUtil Utility functions for working withArrayList
s.ArrayUtil Utility class for operating on arrays as if they were collections.BiInt2NullableObjectMap<V> Variation ofBiInt2ObjectMap
that allowsnull
values.BiInt2ObjectMap<V> Map that takes two part int key and associates with an object.CollectionUtil Utility functions for collection objects.Hashing Hashing functions for applying to integers.Int2IntCounterMap An open-addressing with linear probing hash map specialised for primitive key and counter pairs.Int2IntHashMap An open-addressing with linear probing hash map specialised for primitive key and value pairs.Int2NullableObjectHashMap<V> Variation ofInt2ObjectHashMap
that allowsnull
values.Int2ObjectCache<V> A cache implementation specialised for int keys using open addressing to probe a set of fixed size.Int2ObjectHashMap<V> Map
implementation specialised for int keys using open addressing and linear probing for cache efficient access.IntArrayList AList
implementation that stores int values with the ability to not have them boxed.IntArrayQueue Queue of ints which stores the elements without boxing.IntHashSet Open-addressing with linear-probing expandable hash set.IntLruCache<E> A fixed capacity cache of int keyed values that evicts the least-recently-used element when it runs out of space.Long2LongCounterMap An open-addressing with linear probing hash map specialised for primitive key and counter pairs.Long2LongHashMap An open-addressing with linear probing hash map specialised for primitive key and value pairs.Long2NullableObjectHashMap<V> Variation ofLong2ObjectHashMap
that allowsnull
values.Long2ObjectCache<V> A cache implementation specialised for long keys using open addressing to probe a set of fixed size.Long2ObjectHashMap<V> Map
implementation specialised for long keys using open addressing and linear probing for cache efficient access.LongArrayList AList
implementation that stores long values with the ability to not have them boxed.LongArrayQueue Queue of longs which stores the elements without boxing.LongHashSet Open-addressing with linear-probing expandable hash set.LongLruCache<E> A fixed capacity cache of long keyed values that evicts the least-recently-used element when it runs out of space.MutableBoolean Mutable boolean valid that is useful for capturing a value when using lambdas or collections.MutableInteger Holder for an int value that is mutable.MutableLong Holder for a long value that is mutable.MutableReference<T> Mutable reference that is useful for capturing an object reference when using lambdas.NullReference Sentinel value used in collections supporting null value references.Object2IntCounterMap<K> An open-addressing with linear probing hash map specialised for object and primitive counter pairs.Object2IntHashMap<K> Map
implementation specialised for int values using open addressing and linear probing for cache efficient access.Object2LongCounterMap<K> An open-addressing with linear probing hash map specialised for object and primitive counter pairs.Object2LongHashMap<K> Map
implementation specialised for long values using open addressing and linear probing for cache efficient access.Object2NullableObjectHashMap<K,V> Variation ofObject2ObjectHashMap
that allowsnull
values.Object2ObjectHashMap<K,V> An open-addressing with linear probing hash map, same algorithm asInt2IntHashMap
.ObjectHashSet<T> Open-addressing with linear-probing expandable hash set.UnmodifiableCollectionView<V,E> An unmodifiable view of a collection that maps each element in an underlying collection into a view.