Uses of Package
com.carrotsearch.hppc

Packages that use com.carrotsearch.hppc

Package	Description
com.carrotsearch.hppc

Classes in com.carrotsearch.hppc used by com.carrotsearch.hppc

Class and Description
AbstractIterator Simplifies the implementation of iterators a bit.
ArraySizingStrategy Resizing (growth) strategy for array-backed buffers.
BitSet An "open" BitSet implementation that allows direct access to the array of words storing the bits.
BitSetIterator An iterator to iterate over set bits in an BitSet.
BufferAllocationException
ByteArrayDeque An array-backed ByteDeque.
ByteArrayList An array-backed list of bytes.
ByteByteAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteByteHashMap A hash map of byte to byte, implemented using open addressing with linear probing for collision resolution.
ByteByteHashMap.KeysContainer A view of the keys inside this hash map.
ByteByteMap An associative container with unique binding from keys to a single value.
ByteByteScatterMap Same as ByteByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteCharAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteCharHashMap A hash map of byte to char, implemented using open addressing with linear probing for collision resolution.
ByteCharHashMap.KeysContainer A view of the keys inside this hash map.
ByteCharMap An associative container with unique binding from keys to a single value.
ByteCharScatterMap Same as ByteCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
ByteContainer A generic container holding bytes.
ByteDeque A linear collection that supports element insertion and removal at both ends.
ByteDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteDoubleHashMap A hash map of byte to double, implemented using open addressing with linear probing for collision resolution.
ByteDoubleHashMap.KeysContainer A view of the keys inside this hash map.
ByteDoubleMap An associative container with unique binding from keys to a single value.
ByteDoubleScatterMap Same as ByteDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteFloatHashMap A hash map of byte to float, implemented using open addressing with linear probing for collision resolution.
ByteFloatHashMap.KeysContainer A view of the keys inside this hash map.
ByteFloatMap An associative container with unique binding from keys to a single value.
ByteFloatScatterMap Same as ByteFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteHashSet A hash set of bytes, implemented using using open addressing with linear probing for collision resolution.
ByteIndexedContainer An indexed container provides random access to elements based on an index.
ByteIntAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteIntHashMap A hash map of byte to int, implemented using open addressing with linear probing for collision resolution.
ByteIntHashMap.KeysContainer A view of the keys inside this hash map.
ByteIntMap An associative container with unique binding from keys to a single value.
ByteIntScatterMap Same as ByteIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteLongAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteLongHashMap A hash map of byte to long, implemented using open addressing with linear probing for collision resolution.
ByteLongHashMap.KeysContainer A view of the keys inside this hash map.
ByteLongMap An associative container with unique binding from keys to a single value.
ByteLongScatterMap Same as ByteLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ByteObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteObjectHashMap A hash map of byte to Object, implemented using open addressing with linear probing for collision resolution.
ByteObjectHashMap.KeysContainer A view of the keys inside this hash map.
ByteObjectMap An associative container with unique binding from keys to a single value.
ByteObjectScatterMap Same as ByteObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteScatterSet Same as ByteHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteSet A set of bytes.
ByteShortAssociativeContainer An associative container from keys to (one or possibly more) values.
ByteShortHashMap A hash map of byte to short, implemented using open addressing with linear probing for collision resolution.
ByteShortHashMap.KeysContainer A view of the keys inside this hash map.
ByteShortMap An associative container with unique binding from keys to a single value.
ByteShortScatterMap Same as ByteShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ByteStack A subclass of ByteArrayList adding stack-related utility methods.
CharArrayDeque An array-backed CharDeque.
CharArrayList An array-backed list of chars.
CharByteAssociativeContainer An associative container from keys to (one or possibly more) values.
CharByteHashMap A hash map of char to byte, implemented using open addressing with linear probing for collision resolution.
CharByteHashMap.KeysContainer A view of the keys inside this hash map.
CharByteMap An associative container with unique binding from keys to a single value.
CharByteScatterMap Same as CharByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharCharAssociativeContainer An associative container from keys to (one or possibly more) values.
CharCharHashMap A hash map of char to char, implemented using open addressing with linear probing for collision resolution.
CharCharHashMap.KeysContainer A view of the keys inside this hash map.
CharCharMap An associative container with unique binding from keys to a single value.
CharCharScatterMap Same as CharCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
CharContainer A generic container holding chars.
CharDeque A linear collection that supports element insertion and removal at both ends.
CharDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
CharDoubleHashMap A hash map of char to double, implemented using open addressing with linear probing for collision resolution.
CharDoubleHashMap.KeysContainer A view of the keys inside this hash map.
CharDoubleMap An associative container with unique binding from keys to a single value.
CharDoubleScatterMap Same as CharDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
CharFloatHashMap A hash map of char to float, implemented using open addressing with linear probing for collision resolution.
CharFloatHashMap.KeysContainer A view of the keys inside this hash map.
CharFloatMap An associative container with unique binding from keys to a single value.
CharFloatScatterMap Same as CharFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharHashSet A hash set of chars, implemented using using open addressing with linear probing for collision resolution.
CharIndexedContainer An indexed container provides random access to elements based on an index.
CharIntAssociativeContainer An associative container from keys to (one or possibly more) values.
CharIntHashMap A hash map of char to int, implemented using open addressing with linear probing for collision resolution.
CharIntHashMap.KeysContainer A view of the keys inside this hash map.
CharIntMap An associative container with unique binding from keys to a single value.
CharIntScatterMap Same as CharIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharLongAssociativeContainer An associative container from keys to (one or possibly more) values.
CharLongHashMap A hash map of char to long, implemented using open addressing with linear probing for collision resolution.
CharLongHashMap.KeysContainer A view of the keys inside this hash map.
CharLongMap An associative container with unique binding from keys to a single value.
CharLongScatterMap Same as CharLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
CharObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
CharObjectHashMap A hash map of char to Object, implemented using open addressing with linear probing for collision resolution.
CharObjectHashMap.KeysContainer A view of the keys inside this hash map.
CharObjectMap An associative container with unique binding from keys to a single value.
CharObjectScatterMap Same as CharObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharScatterSet Same as CharHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharSet A set of chars.
CharShortAssociativeContainer An associative container from keys to (one or possibly more) values.
CharShortHashMap A hash map of char to short, implemented using open addressing with linear probing for collision resolution.
CharShortHashMap.KeysContainer A view of the keys inside this hash map.
CharShortMap An associative container with unique binding from keys to a single value.
CharShortScatterMap Same as CharShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
CharStack A subclass of CharArrayList adding stack-related utility methods.
DoubleArrayDeque An array-backed DoubleDeque.
DoubleArrayList An array-backed list of doubles.
DoubleByteAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleByteHashMap A hash map of double to byte, implemented using open addressing with linear probing for collision resolution.
DoubleByteHashMap.KeysContainer A view of the keys inside this hash map.
DoubleByteMap An associative container with unique binding from keys to a single value.
DoubleByteScatterMap Same as DoubleByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleCharAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleCharHashMap A hash map of double to char, implemented using open addressing with linear probing for collision resolution.
DoubleCharHashMap.KeysContainer A view of the keys inside this hash map.
DoubleCharMap An associative container with unique binding from keys to a single value.
DoubleCharScatterMap Same as DoubleCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
DoubleContainer A generic container holding doubles.
DoubleDeque A linear collection that supports element insertion and removal at both ends.
DoubleDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleDoubleHashMap A hash map of double to double, implemented using open addressing with linear probing for collision resolution.
DoubleDoubleHashMap.KeysContainer A view of the keys inside this hash map.
DoubleDoubleMap An associative container with unique binding from keys to a single value.
DoubleDoubleScatterMap Same as DoubleDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleFloatHashMap A hash map of double to float, implemented using open addressing with linear probing for collision resolution.
DoubleFloatHashMap.KeysContainer A view of the keys inside this hash map.
DoubleFloatMap An associative container with unique binding from keys to a single value.
DoubleFloatScatterMap Same as DoubleFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleHashSet A hash set of doubles, implemented using using open addressing with linear probing for collision resolution.
DoubleIndexedContainer An indexed container provides random access to elements based on an index.
DoubleIntAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleIntHashMap A hash map of double to int, implemented using open addressing with linear probing for collision resolution.
DoubleIntHashMap.KeysContainer A view of the keys inside this hash map.
DoubleIntMap An associative container with unique binding from keys to a single value.
DoubleIntScatterMap Same as DoubleIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleLongAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleLongHashMap A hash map of double to long, implemented using open addressing with linear probing for collision resolution.
DoubleLongHashMap.KeysContainer A view of the keys inside this hash map.
DoubleLongMap An associative container with unique binding from keys to a single value.
DoubleLongScatterMap Same as DoubleLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
DoubleObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleObjectHashMap A hash map of double to Object, implemented using open addressing with linear probing for collision resolution.
DoubleObjectHashMap.KeysContainer A view of the keys inside this hash map.
DoubleObjectMap An associative container with unique binding from keys to a single value.
DoubleObjectScatterMap Same as DoubleObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleScatterSet Same as DoubleHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleSet A set of doubles.
DoubleShortAssociativeContainer An associative container from keys to (one or possibly more) values.
DoubleShortHashMap A hash map of double to short, implemented using open addressing with linear probing for collision resolution.
DoubleShortHashMap.KeysContainer A view of the keys inside this hash map.
DoubleShortMap An associative container with unique binding from keys to a single value.
DoubleShortScatterMap Same as DoubleShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
DoubleStack A subclass of DoubleArrayList adding stack-related utility methods.
FloatArrayDeque An array-backed FloatDeque.
FloatArrayList An array-backed list of floats.
FloatByteAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatByteHashMap A hash map of float to byte, implemented using open addressing with linear probing for collision resolution.
FloatByteHashMap.KeysContainer A view of the keys inside this hash map.
FloatByteMap An associative container with unique binding from keys to a single value.
FloatByteScatterMap Same as FloatByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatCharAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatCharHashMap A hash map of float to char, implemented using open addressing with linear probing for collision resolution.
FloatCharHashMap.KeysContainer A view of the keys inside this hash map.
FloatCharMap An associative container with unique binding from keys to a single value.
FloatCharScatterMap Same as FloatCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
FloatContainer A generic container holding floats.
FloatDeque A linear collection that supports element insertion and removal at both ends.
FloatDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatDoubleHashMap A hash map of float to double, implemented using open addressing with linear probing for collision resolution.
FloatDoubleHashMap.KeysContainer A view of the keys inside this hash map.
FloatDoubleMap An associative container with unique binding from keys to a single value.
FloatDoubleScatterMap Same as FloatDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatFloatHashMap A hash map of float to float, implemented using open addressing with linear probing for collision resolution.
FloatFloatHashMap.KeysContainer A view of the keys inside this hash map.
FloatFloatMap An associative container with unique binding from keys to a single value.
FloatFloatScatterMap Same as FloatFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatHashSet A hash set of floats, implemented using using open addressing with linear probing for collision resolution.
FloatIndexedContainer An indexed container provides random access to elements based on an index.
FloatIntAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatIntHashMap A hash map of float to int, implemented using open addressing with linear probing for collision resolution.
FloatIntHashMap.KeysContainer A view of the keys inside this hash map.
FloatIntMap An associative container with unique binding from keys to a single value.
FloatIntScatterMap Same as FloatIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatLongAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatLongHashMap A hash map of float to long, implemented using open addressing with linear probing for collision resolution.
FloatLongHashMap.KeysContainer A view of the keys inside this hash map.
FloatLongMap An associative container with unique binding from keys to a single value.
FloatLongScatterMap Same as FloatLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
FloatObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatObjectHashMap A hash map of float to Object, implemented using open addressing with linear probing for collision resolution.
FloatObjectHashMap.KeysContainer A view of the keys inside this hash map.
FloatObjectMap An associative container with unique binding from keys to a single value.
FloatObjectScatterMap Same as FloatObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatScatterSet Same as FloatHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatSet A set of floats.
FloatShortAssociativeContainer An associative container from keys to (one or possibly more) values.
FloatShortHashMap A hash map of float to short, implemented using open addressing with linear probing for collision resolution.
FloatShortHashMap.KeysContainer A view of the keys inside this hash map.
FloatShortMap An associative container with unique binding from keys to a single value.
FloatShortScatterMap Same as FloatShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
FloatStack A subclass of FloatArrayList adding stack-related utility methods.
HashOrderMixing.Strategy
HashOrderMixingStrategy Hash order mixing strategy implementations should provide an, ideally, random integer that is later XORed with the hash of a given key before the slot lookup in associative arrays.
IntArrayDeque An array-backed IntDeque.
IntArrayList An array-backed list of ints.
IntByteAssociativeContainer An associative container from keys to (one or possibly more) values.
IntByteHashMap A hash map of int to byte, implemented using open addressing with linear probing for collision resolution.
IntByteHashMap.KeysContainer A view of the keys inside this hash map.
IntByteMap An associative container with unique binding from keys to a single value.
IntByteScatterMap Same as IntByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntCharAssociativeContainer An associative container from keys to (one or possibly more) values.
IntCharHashMap A hash map of int to char, implemented using open addressing with linear probing for collision resolution.
IntCharHashMap.KeysContainer A view of the keys inside this hash map.
IntCharMap An associative container with unique binding from keys to a single value.
IntCharScatterMap Same as IntCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
IntContainer A generic container holding ints.
IntDeque A linear collection that supports element insertion and removal at both ends.
IntDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
IntDoubleHashMap A hash map of int to double, implemented using open addressing with linear probing for collision resolution.
IntDoubleHashMap.KeysContainer A view of the keys inside this hash map.
IntDoubleMap An associative container with unique binding from keys to a single value.
IntDoubleScatterMap Same as IntDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
IntFloatHashMap A hash map of int to float, implemented using open addressing with linear probing for collision resolution.
IntFloatHashMap.KeysContainer A view of the keys inside this hash map.
IntFloatMap An associative container with unique binding from keys to a single value.
IntFloatScatterMap Same as IntFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntHashSet A hash set of ints, implemented using using open addressing with linear probing for collision resolution.
IntIndexedContainer An indexed container provides random access to elements based on an index.
IntIntAssociativeContainer An associative container from keys to (one or possibly more) values.
IntIntHashMap A hash map of int to int, implemented using open addressing with linear probing for collision resolution.
IntIntHashMap.KeysContainer A view of the keys inside this hash map.
IntIntMap An associative container with unique binding from keys to a single value.
IntIntScatterMap Same as IntIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntLongAssociativeContainer An associative container from keys to (one or possibly more) values.
IntLongHashMap A hash map of int to long, implemented using open addressing with linear probing for collision resolution.
IntLongHashMap.KeysContainer A view of the keys inside this hash map.
IntLongMap An associative container with unique binding from keys to a single value.
IntLongScatterMap Same as IntLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
IntObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
IntObjectHashMap A hash map of int to Object, implemented using open addressing with linear probing for collision resolution.
IntObjectHashMap.KeysContainer A view of the keys inside this hash map.
IntObjectMap An associative container with unique binding from keys to a single value.
IntObjectScatterMap Same as IntObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
Intrinsics.EqualityFunction Anything that implements value-equality function as replaced by the Intrinsics.EqualityFunction.equals(java.lang.Object, java.lang.Object) intrinsic.
IntScatterSet Same as IntHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntSet A set of ints.
IntShortAssociativeContainer An associative container from keys to (one or possibly more) values.
IntShortHashMap A hash map of int to short, implemented using open addressing with linear probing for collision resolution.
IntShortHashMap.KeysContainer A view of the keys inside this hash map.
IntShortMap An associative container with unique binding from keys to a single value.
IntShortScatterMap Same as IntShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
IntStack A subclass of IntArrayList adding stack-related utility methods.
LongArrayDeque An array-backed LongDeque.
LongArrayList An array-backed list of longs.
LongByteAssociativeContainer An associative container from keys to (one or possibly more) values.
LongByteHashMap A hash map of long to byte, implemented using open addressing with linear probing for collision resolution.
LongByteHashMap.KeysContainer A view of the keys inside this hash map.
LongByteMap An associative container with unique binding from keys to a single value.
LongByteScatterMap Same as LongByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongCharAssociativeContainer An associative container from keys to (one or possibly more) values.
LongCharHashMap A hash map of long to char, implemented using open addressing with linear probing for collision resolution.
LongCharHashMap.KeysContainer A view of the keys inside this hash map.
LongCharMap An associative container with unique binding from keys to a single value.
LongCharScatterMap Same as LongCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
LongContainer A generic container holding longs.
LongDeque A linear collection that supports element insertion and removal at both ends.
LongDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
LongDoubleHashMap A hash map of long to double, implemented using open addressing with linear probing for collision resolution.
LongDoubleHashMap.KeysContainer A view of the keys inside this hash map.
LongDoubleMap An associative container with unique binding from keys to a single value.
LongDoubleScatterMap Same as LongDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
LongFloatHashMap A hash map of long to float, implemented using open addressing with linear probing for collision resolution.
LongFloatHashMap.KeysContainer A view of the keys inside this hash map.
LongFloatMap An associative container with unique binding from keys to a single value.
LongFloatScatterMap Same as LongFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongHashSet A hash set of longs, implemented using using open addressing with linear probing for collision resolution.
LongIndexedContainer An indexed container provides random access to elements based on an index.
LongIntAssociativeContainer An associative container from keys to (one or possibly more) values.
LongIntHashMap A hash map of long to int, implemented using open addressing with linear probing for collision resolution.
LongIntHashMap.KeysContainer A view of the keys inside this hash map.
LongIntMap An associative container with unique binding from keys to a single value.
LongIntScatterMap Same as LongIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongLongAssociativeContainer An associative container from keys to (one or possibly more) values.
LongLongHashMap A hash map of long to long, implemented using open addressing with linear probing for collision resolution.
LongLongHashMap.KeysContainer A view of the keys inside this hash map.
LongLongMap An associative container with unique binding from keys to a single value.
LongLongScatterMap Same as LongLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
LongObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
LongObjectHashMap A hash map of long to Object, implemented using open addressing with linear probing for collision resolution.
LongObjectHashMap.KeysContainer A view of the keys inside this hash map.
LongObjectMap An associative container with unique binding from keys to a single value.
LongObjectScatterMap Same as LongObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongScatterSet Same as LongHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongSet A set of longs.
LongShortAssociativeContainer An associative container from keys to (one or possibly more) values.
LongShortHashMap A hash map of long to short, implemented using open addressing with linear probing for collision resolution.
LongShortHashMap.KeysContainer A view of the keys inside this hash map.
LongShortMap An associative container with unique binding from keys to a single value.
LongShortScatterMap Same as LongShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
LongStack A subclass of LongArrayList adding stack-related utility methods.
ObjectArrayDeque An array-backed ObjectDeque.
ObjectArrayList An array-backed list of Objects.
ObjectByteAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectByteHashMap A hash map of Object to byte, implemented using open addressing with linear probing for collision resolution.
ObjectByteHashMap.KeysContainer A view of the keys inside this hash map.
ObjectByteIdentityHashMap An identity hash map of Object to byte.
ObjectByteMap An associative container with unique binding from keys to a single value.
ObjectByteScatterMap Same as ObjectByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectCharAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectCharHashMap A hash map of Object to char, implemented using open addressing with linear probing for collision resolution.
ObjectCharHashMap.KeysContainer A view of the keys inside this hash map.
ObjectCharIdentityHashMap An identity hash map of Object to char.
ObjectCharMap An associative container with unique binding from keys to a single value.
ObjectCharScatterMap Same as ObjectCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
ObjectContainer A generic container holding Objects.
ObjectDeque A linear collection that supports element insertion and removal at both ends.
ObjectDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectDoubleHashMap A hash map of Object to double, implemented using open addressing with linear probing for collision resolution.
ObjectDoubleHashMap.KeysContainer A view of the keys inside this hash map.
ObjectDoubleIdentityHashMap An identity hash map of Object to double.
ObjectDoubleMap An associative container with unique binding from keys to a single value.
ObjectDoubleScatterMap Same as ObjectDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectFloatHashMap A hash map of Object to float, implemented using open addressing with linear probing for collision resolution.
ObjectFloatHashMap.KeysContainer A view of the keys inside this hash map.
ObjectFloatIdentityHashMap An identity hash map of Object to float.
ObjectFloatMap An associative container with unique binding from keys to a single value.
ObjectFloatScatterMap Same as ObjectFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectHashSet A hash set of Objects, implemented using using open addressing with linear probing for collision resolution.
ObjectIdentityHashSet A reference-equality (identity) hash set.
ObjectIndexedContainer An indexed container provides random access to elements based on an index.
ObjectIntAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectIntHashMap A hash map of Object to int, implemented using open addressing with linear probing for collision resolution.
ObjectIntHashMap.KeysContainer A view of the keys inside this hash map.
ObjectIntIdentityHashMap An identity hash map of Object to int.
ObjectIntMap An associative container with unique binding from keys to a single value.
ObjectIntScatterMap Same as ObjectIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectLongAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectLongHashMap A hash map of Object to long, implemented using open addressing with linear probing for collision resolution.
ObjectLongHashMap.KeysContainer A view of the keys inside this hash map.
ObjectLongIdentityHashMap An identity hash map of Object to long.
ObjectLongMap An associative container with unique binding from keys to a single value.
ObjectLongScatterMap Same as ObjectLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ObjectObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectObjectHashMap A hash map of Object to Object, implemented using open addressing with linear probing for collision resolution.
ObjectObjectHashMap.KeysContainer A view of the keys inside this hash map.
ObjectObjectIdentityHashMap An identity hash map of Object to Object.
ObjectObjectMap An associative container with unique binding from keys to a single value.
ObjectObjectScatterMap Same as ObjectObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectScatterSet Same as ObjectHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectSet A set of Objects.
ObjectShortAssociativeContainer An associative container from keys to (one or possibly more) values.
ObjectShortHashMap A hash map of Object to short, implemented using open addressing with linear probing for collision resolution.
ObjectShortHashMap.KeysContainer A view of the keys inside this hash map.
ObjectShortIdentityHashMap An identity hash map of Object to short.
ObjectShortMap An associative container with unique binding from keys to a single value.
ObjectShortScatterMap Same as ObjectShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectStack A subclass of ObjectArrayList adding stack-related utility methods.
Preallocable Anything that can preallocate buffers given prior knowledge of the number of stored elements.
RandomizedHashOrderMixer Randomized hash order.
ShortArrayDeque An array-backed ShortDeque.
ShortArrayList An array-backed list of shorts.
ShortByteAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortByteHashMap A hash map of short to byte, implemented using open addressing with linear probing for collision resolution.
ShortByteHashMap.KeysContainer A view of the keys inside this hash map.
ShortByteMap An associative container with unique binding from keys to a single value.
ShortByteScatterMap Same as ShortByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortCharAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortCharHashMap A hash map of short to char, implemented using open addressing with linear probing for collision resolution.
ShortCharHashMap.KeysContainer A view of the keys inside this hash map.
ShortCharMap An associative container with unique binding from keys to a single value.
ShortCharScatterMap Same as ShortCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortCollection A collection allows basic, efficient operations on sets of elements (difference and intersection).
ShortContainer A generic container holding shorts.
ShortDeque A linear collection that supports element insertion and removal at both ends.
ShortDoubleAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortDoubleHashMap A hash map of short to double, implemented using open addressing with linear probing for collision resolution.
ShortDoubleHashMap.KeysContainer A view of the keys inside this hash map.
ShortDoubleMap An associative container with unique binding from keys to a single value.
ShortDoubleScatterMap Same as ShortDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortFloatAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortFloatHashMap A hash map of short to float, implemented using open addressing with linear probing for collision resolution.
ShortFloatHashMap.KeysContainer A view of the keys inside this hash map.
ShortFloatMap An associative container with unique binding from keys to a single value.
ShortFloatScatterMap Same as ShortFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortHashSet A hash set of shorts, implemented using using open addressing with linear probing for collision resolution.
ShortIndexedContainer An indexed container provides random access to elements based on an index.
ShortIntAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortIntHashMap A hash map of short to int, implemented using open addressing with linear probing for collision resolution.
ShortIntHashMap.KeysContainer A view of the keys inside this hash map.
ShortIntMap An associative container with unique binding from keys to a single value.
ShortIntScatterMap Same as ShortIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortLongAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortLongHashMap A hash map of short to long, implemented using open addressing with linear probing for collision resolution.
ShortLongHashMap.KeysContainer A view of the keys inside this hash map.
ShortLongMap An associative container with unique binding from keys to a single value.
ShortLongScatterMap Same as ShortLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortLookupContainer Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ShortObjectAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortObjectHashMap A hash map of short to Object, implemented using open addressing with linear probing for collision resolution.
ShortObjectHashMap.KeysContainer A view of the keys inside this hash map.
ShortObjectMap An associative container with unique binding from keys to a single value.
ShortObjectScatterMap Same as ShortObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortScatterSet Same as ShortHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortSet A set of shorts.
ShortShortAssociativeContainer An associative container from keys to (one or possibly more) values.
ShortShortHashMap A hash map of short to short, implemented using open addressing with linear probing for collision resolution.
ShortShortHashMap.KeysContainer A view of the keys inside this hash map.
ShortShortMap An associative container with unique binding from keys to a single value.
ShortShortScatterMap Same as ShortShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ShortStack A subclass of ShortArrayList adding stack-related utility methods.
SuppressForbidden Suppresses forbidden-API checks.