See: Description
Interface | Description |
---|---|
BiInt2ObjectMap.EntryConsumer<V> |
Handler for a map entry
|
BiInt2ObjectMap.EntryFunction<V> |
Creates a new value based upon keys.
|
IntIntConsumer |
This is an (int, int) primitive specialisation of a BiConsumer
|
IntObjConsumer<T> |
This is an (int, Object) primitive specialisation of a BiConsumer.
|
LongLongConsumer |
This is an (long, long) primitive specialisation of a BiConsumer
|
Class | Description |
---|---|
ArrayListUtil |
Utility functions for working with
ArrayList s. |
ArrayUtil |
Utility class for operating on arrays as if they were collections.
|
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 |
A open-addressing with linear probing hash map specialised for primitive key and counter pairs.
|
Int2IntHashMap |
A open addressing with linear probing hash map specialised for primitive key and value pairs.
|
Int2NullableObjectHashMap<V> |
Variation of
Int2ObjectHashMap that allows null 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 |
A
List 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 |
A open-addressing with linear probing hash map specialised for primitive key and counter pairs.
|
Long2LongHashMap |
A open addressing with linear probing hash map specialised for primitive key and value pairs.
|
Long2NullableObjectHashMap<V> |
Variation of
Long2ObjectHashMap that allows null 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 |
A
List 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 an 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.
|
Object2IntHashMap<K> |
Map implementation specialised for int values using open addressing and
linear probing for cache efficient access. |
Object2LongHashMap<K> |
Map implementation specialised for long values using open addressing and
linear probing for cache efficient access. |
Object2NullableObjectHashMap<K,V> |
Variation of
Object2ObjectHashMap that allows null values. |
Object2ObjectHashMap<K,V> |
A open addressing with linear probing hash map, same algorithm as
Int2IntHashMap . |
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.
|
Copyright © 2014-2020 Real Logic Limited. All Rights Reserved.