BiInt2ObjectMap |
Map that takes two part int key and associates with an object.
|
BiInt2ObjectMap.EntryConsumer |
Handler for a map entry.
|
BiInt2ObjectMap.EntryFunction |
Creates a new value based upon keys.
|
BiInt2ObjectMap.EntryRemap |
Creates a new value based upon keys.
|
Int2IntHashMap |
An open-addressing with linear probing hash map specialised for primitive key and value pairs.
|
Int2IntHashMap.AbstractIterator |
Base iterator implementation.
|
Int2IntHashMap.EntryIterator |
Iterator over entries which supports access to unboxed keys and values.
|
Int2IntHashMap.EntrySet |
Set of entries which supports optionally cached iterators to avoid allocation.
|
Int2IntHashMap.KeyIterator |
|
Int2IntHashMap.KeySet |
Set of keys which supports optional cached iterators to avoid allocation.
|
Int2IntHashMap.ValueCollection |
Collection of values which supports optionally cached iterators to avoid allocation.
|
Int2IntHashMap.ValueIterator |
Iterator over values which supports access to unboxed values.
|
Int2ObjectCache |
A cache implementation specialised for int keys using open addressing to probe a set of fixed size.
|
Int2ObjectCache.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Int2ObjectCache.EntryIterator |
|
Int2ObjectCache.EntrySet |
Set of entries which supports cached iterator to avoid allocation.
|
Int2ObjectCache.KeyIterator |
|
Int2ObjectCache.KeySet |
A key set implementation which supports cached iterator to avoid allocation.
|
Int2ObjectCache.ValueCollection |
Collection of values which supports cached iterator to avoid allocation.
|
Int2ObjectCache.ValueIterator |
An iterator over values.
|
Int2ObjectHashMap |
Map implementation specialised for int keys using open addressing and
linear probing for cache efficient access.
|
Int2ObjectHashMap.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Int2ObjectHashMap.EntryIterator |
|
Int2ObjectHashMap.EntrySet |
Set of entries which supports access via an optionally cached iterator to avoid allocation.
|
Int2ObjectHashMap.KeyIterator |
|
Int2ObjectHashMap.KeySet |
Set of keys which supports optionally cached iterators to avoid allocation.
|
Int2ObjectHashMap.ValueCollection |
Collection of values which supports optionally cached iterators to avoid allocation.
|
Int2ObjectHashMap.ValueIterator |
Iterator over values.
|
IntArrayList |
A List implementation that stores int values with the ability to not have them boxed.
|
IntArrayQueue.IntIterator |
|
IntHashSet |
Open-addressing with linear-probing expandable hash set.
|
IntHashSet.IntIterator |
|
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 |
This is an (int, Object) primitive specialisation of a BiConsumer.
|
IntObjectToObjectFunction |
This is an (int, Object) -> Object primitive specialisation of a BiFunction.
|
IntObjPredicate |
This is an (int, Object) primitive specialisation of a BiPredicate.
|
Long2LongHashMap |
An open-addressing with linear probing hash map specialised for primitive key and value pairs.
|
Long2LongHashMap.AbstractIterator |
Base iterator implementation.
|
Long2LongHashMap.EntryIterator |
Iterator over entries which supports access to unboxed keys and values.
|
Long2LongHashMap.EntrySet |
Set of entries which supports optionally cached iterators to avoid allocation.
|
Long2LongHashMap.KeyIterator |
|
Long2LongHashMap.KeySet |
Set of keys which supports optional cached iterators to avoid allocation.
|
Long2LongHashMap.ValueCollection |
Collection of values which supports optionally cached iterators to avoid allocation.
|
Long2LongHashMap.ValueIterator |
Iterator over values which supports access to unboxed values.
|
Long2ObjectCache |
A cache implementation specialised for long keys using open addressing to probe a set of fixed size.
|
Long2ObjectCache.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Long2ObjectCache.EntryIterator |
|
Long2ObjectCache.EntrySet |
Set of entries which supports cached iterator to avoid allocation.
|
Long2ObjectCache.KeyIterator |
|
Long2ObjectCache.KeySet |
A key set implementation which supports cached iterator to avoid allocation.
|
Long2ObjectCache.ValueCollection |
Collection of values which supports cached iterator to avoid allocation.
|
Long2ObjectCache.ValueIterator |
An iterator over values.
|
Long2ObjectHashMap |
Map implementation specialised for long keys using open addressing and
linear probing for cache efficient access.
|
Long2ObjectHashMap.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Long2ObjectHashMap.EntryIterator |
|
Long2ObjectHashMap.EntrySet |
Set of entries which supports access via an optionally cached iterator to avoid allocation.
|
Long2ObjectHashMap.KeyIterator |
|
Long2ObjectHashMap.KeySet |
Set of keys which supports optionally cached iterators to avoid allocation.
|
Long2ObjectHashMap.ValueCollection |
Collection of values which supports optionally cached iterators to avoid allocation.
|
Long2ObjectHashMap.ValueIterator |
Iterator over values.
|
LongArrayList |
A List implementation that stores long values with the ability to not have them boxed.
|
LongArrayQueue.LongIterator |
|
LongHashSet |
Open-addressing with linear-probing expandable hash set.
|
LongHashSet.LongIterator |
|
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 |
This is an (long, Object) primitive specialisation of a BiConsumer.
|
LongObjectToObjectFunction |
This is an (long, Object) -> Object primitive specialisation of a BiFunction.
|
LongObjPredicate |
This is an (long, Object) primitive specialisation of a BiPredicate.
|
MutableInteger |
Holder for an int value that is mutable.
|
MutableLong |
Holder for a long value that is mutable.
|
NullReference |
Sentinel value used in collections supporting null value references.
|
Object2IntHashMap |
Map implementation specialised for int values using open addressing and
linear probing for cache efficient access.
|
Object2IntHashMap.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Object2IntHashMap.EntryIterator |
Iterator over entries which can provide unboxed access and optionally avoid allocation.
|
Object2IntHashMap.EntrySet |
Set of entries which can optionally cache iterators to avoid allocation.
|
Object2IntHashMap.KeyIterator |
Iterator over keys.
|
Object2IntHashMap.KeySet |
Set of keys that can optionally cache iterators to avoid allocation.
|
Object2IntHashMap.ValueCollection |
Collection of values which can optionally cache iterators to avoid allocation.
|
Object2IntHashMap.ValueIterator |
|
Object2LongHashMap |
Map implementation specialised for long values using open addressing and
linear probing for cache efficient access.
|
Object2LongHashMap.AbstractIterator |
Base iterator implementation that contains basic logic of traversing the element in the backing array.
|
Object2LongHashMap.EntryIterator |
Iterator over entries which can provide unboxed access and optionally avoid allocation.
|
Object2LongHashMap.EntrySet |
Set of entries which can optionally cache iterators to avoid allocation.
|
Object2LongHashMap.KeyIterator |
Iterator over keys.
|
Object2LongHashMap.KeySet |
Set of keys that can optionally cache iterators to avoid allocation.
|
Object2LongHashMap.ValueCollection |
Collection of values which can optionally cache iterators to avoid allocation.
|
Object2LongHashMap.ValueIterator |
|
Object2ObjectHashMap |
An open-addressing with linear probing hash map, same algorithm as Int2IntHashMap .
|
Object2ObjectHashMap.AbstractIterator |
Base iterator impl.
|
Object2ObjectHashMap.EntryIterator |
An iterator over entries.
|
Object2ObjectHashMap.EntrySet |
An entry set implementation.
|
Object2ObjectHashMap.KeyIterator |
An iterator over keys.
|
Object2ObjectHashMap.KeySet |
A key set implementation.
|
Object2ObjectHashMap.ValueCollection |
A collection of values.
|
Object2ObjectHashMap.ValueIterator |
An iterator over values.
|
ObjectHashSet |
Open-addressing with linear-probing expandable hash set.
|
ObjectHashSet.ObjectIterator |
Iterator over the set which can be optionally cached to avoid allocation.
|
ObjectIntToIntFunction |
This is an (Object, int) -> int primitive specialisation of a BiFunction.
|
ObjectLongToLongFunction |
This is an (Object, long) -> long primitive specialisation of a BiFunction.
|
ObjIntConsumer |
This is an (Object, i) primitive specialisation of a BiConsumer.
|
ObjIntPredicate |
This is an (Object, int) primitive specialisation of a BiPredicate.
|
ObjLongConsumer |
This is an (Object, i) primitive specialisation of a BiConsumer.
|
ObjLongPredicate |
This is an (Object, long) primitive specialisation of a BiPredicate.
|
UnmodifiableCollectionView.ReusableIterator |
A stateful reusable iterator.
|