Package com.carrotsearch.hppc

package com.carrotsearch.hppc

Related Packages

Package	Description
com.carrotsearch.hppc.cursors
com.carrotsearch.hppc.generator
com.carrotsearch.hppc.predicates
com.carrotsearch.hppc.procedures
com.carrotsearch.hppc.sorting

Class	Description
AbstractByteCollection	Common superclass for collections.
AbstractCharCollection	Common superclass for collections.
AbstractDoubleCollection	Common superclass for collections.
AbstractFloatCollection	Common superclass for collections.
AbstractIntCollection	Common superclass for collections.
AbstractIterator<E>	Simplifies the implementation of iterators a bit.
AbstractLongCollection	Common superclass for collections.
AbstractObjectCollection<KType>	Common superclass for collections.
AbstractShortCollection	Common superclass for collections.
Accountable	Anything that could be accounted for memory usage Partly forked from Lucene tag releases/lucene-solr/8.5.1
ArraySizingStrategy	Resizing (growth) strategy for array-backed buffers.
BitMixer	Bit mixing utilities.
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.
BitUtil	A variety of high efficiency bit twiddling routines.
BoundedProportionalArraySizingStrategy	Array resizing proportional to the current buffer size, optionally kept within the given minimum and maximum growth limits.
BufferAllocationException
ByteArrayDeque	An array-backed ByteDeque.
ByteArrayList	An array-backed list of bytes.
ByteArrayList.ValueIterator	An iterator implementation for ByteArrayList.iterator().
ByteBufferVisualizer	Reused buffer visualization routines.
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.
ByteIndexedContainer	An indexed container provides random access to elements based on an index.
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).
ByteStack	A subclass of ByteArrayList adding stack-related utility methods.
CharArrayDeque	An array-backed CharDeque.
CharArrayList	An array-backed list of chars.
CharArrayList.ValueIterator	An iterator implementation for CharArrayList.iterator().
CharBufferVisualizer	Reused buffer visualization routines.
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.
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.
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.
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.
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.
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.
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<VType>	An associative container from keys to (one or possibly more) values.
CharObjectHashMap<VType>	A hash map of char to Object, implemented using open addressing with linear probing for collision resolution.
CharObjectMap<VType>	An associative container with unique binding from keys to a single value.
CharObjectScatterMap<VType>	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.
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.
Containers	Constants used as defaults in containers.
DoubleArrayDeque	An array-backed DoubleDeque.
DoubleArrayList	An array-backed list of doubles.
DoubleArrayList.ValueIterator	An iterator implementation for DoubleArrayList.iterator().
DoubleBufferVisualizer	Reused buffer visualization routines.
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.
DoubleIndexedContainer	An indexed container provides random access to elements based on an index.
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).
DoubleStack	A subclass of DoubleArrayList adding stack-related utility methods.
FloatArrayDeque	An array-backed FloatDeque.
FloatArrayList	An array-backed list of floats.
FloatArrayList.ValueIterator	An iterator implementation for FloatArrayList.iterator().
FloatBufferVisualizer	Reused buffer visualization routines.
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.
FloatIndexedContainer	An indexed container provides random access to elements based on an index.
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).
FloatStack	A subclass of FloatArrayList adding stack-related utility methods.
Generated
HashContainers
HashOrderMixing	Factory methods to acquire the most common types of HashOrderMixingStrategy.
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.
IntArrayList.ValueIterator	An iterator implementation for IntArrayList.iterator().
IntBufferVisualizer	Reused buffer visualization routines.
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.
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.
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.
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.
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.
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.
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<VType>	An associative container from keys to (one or possibly more) values.
IntObjectHashMap<VType>	A hash map of int to Object, implemented using open addressing with linear probing for collision resolution.
IntObjectMap<VType>	An associative container with unique binding from keys to a single value.
IntObjectScatterMap<VType>	Same as IntObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
Intrinsics	Intrinsic methods that are fully functional for the source templates (generic) and are replaced with low-level corresponding equivalents for the generated primitive types.
Intrinsics.EqualityFunction	Anything that implements value-equality function as replaced by the Intrinsics.EqualityFunction.equals(java.lang.Object, java.lang.Object) intrinsic.
Intrinsics.KeyHasher<T>	Anything that distributes keys by their hash value.
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.
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.
LongArrayList.ValueIterator	An iterator implementation for LongArrayList.iterator().
LongBufferVisualizer	Reused buffer visualization routines.
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.
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.
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.
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.
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.
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.
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<VType>	An associative container from keys to (one or possibly more) values.
LongObjectHashMap<VType>	A hash map of long to Object, implemented using open addressing with linear probing for collision resolution.
LongObjectMap<VType>	An associative container with unique binding from keys to a single value.
LongObjectScatterMap<VType>	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.
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<KType>	An array-backed ObjectDeque.
ObjectArrayList<KType>	An array-backed list of Objects.
ObjectArrayList.ValueIterator<KType>	An iterator implementation for ObjectArrayList.iterator().
ObjectBufferVisualizer<KType>	Reused buffer visualization routines.
ObjectByteAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectByteHashMap<KType>	A hash map of Object to byte, implemented using open addressing with linear probing for collision resolution.
ObjectByteIdentityHashMap<KType>	An identity hash map of Object to byte.
ObjectByteMap<KType>	An associative container with unique binding from keys to a single value.
ObjectByteScatterMap<KType>	Same as ObjectByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectCharAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectCharHashMap<KType>	A hash map of Object to char, implemented using open addressing with linear probing for collision resolution.
ObjectCharIdentityHashMap<KType>	An identity hash map of Object to char.
ObjectCharMap<KType>	An associative container with unique binding from keys to a single value.
ObjectCharScatterMap<KType>	Same as ObjectCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectCollection<KType>	A collection allows basic, efficient operations on sets of elements (difference and intersection).
ObjectContainer<KType>	A generic container holding Objects.
ObjectDeque<KType>	A linear collection that supports element insertion and removal at both ends.
ObjectDoubleAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectDoubleHashMap<KType>	A hash map of Object to double, implemented using open addressing with linear probing for collision resolution.
ObjectDoubleIdentityHashMap<KType>	An identity hash map of Object to double.
ObjectDoubleMap<KType>	An associative container with unique binding from keys to a single value.
ObjectDoubleScatterMap<KType>	Same as ObjectDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectFloatAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectFloatHashMap<KType>	A hash map of Object to float, implemented using open addressing with linear probing for collision resolution.
ObjectFloatIdentityHashMap<KType>	An identity hash map of Object to float.
ObjectFloatMap<KType>	An associative container with unique binding from keys to a single value.
ObjectFloatScatterMap<KType>	Same as ObjectFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectHashSet<KType>	A hash set of Objects, implemented using using open addressing with linear probing for collision resolution.
ObjectIdentityHashSet<KType>	A reference-equality (identity) hash set.
ObjectIndexedContainer<KType>	An indexed container provides random access to elements based on an index.
ObjectIntAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectIntHashMap<KType>	A hash map of Object to int, implemented using open addressing with linear probing for collision resolution.
ObjectIntIdentityHashMap<KType>	An identity hash map of Object to int.
ObjectIntMap<KType>	An associative container with unique binding from keys to a single value.
ObjectIntScatterMap<KType>	Same as ObjectIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectLongAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectLongHashMap<KType>	A hash map of Object to long, implemented using open addressing with linear probing for collision resolution.
ObjectLongIdentityHashMap<KType>	An identity hash map of Object to long.
ObjectLongMap<KType>	An associative container with unique binding from keys to a single value.
ObjectLongScatterMap<KType>	Same as ObjectLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectLookupContainer<KType>	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<KType,VType>	An associative container from keys to (one or possibly more) values.
ObjectObjectHashMap<KType,VType>	A hash map of Object to Object, implemented using open addressing with linear probing for collision resolution.
ObjectObjectIdentityHashMap<KType,VType>	An identity hash map of Object to Object.
ObjectObjectMap<KType,VType>	An associative container with unique binding from keys to a single value.
ObjectObjectScatterMap<KType,VType>	Same as ObjectObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectScatterSet<KType>	Same as ObjectHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectSet<KType>	A set of Objects.
ObjectShortAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectShortHashMap<KType>	A hash map of Object to short, implemented using open addressing with linear probing for collision resolution.
ObjectShortIdentityHashMap<KType>	An identity hash map of Object to short.
ObjectShortMap<KType>	An associative container with unique binding from keys to a single value.
ObjectShortScatterMap<KType>	Same as ObjectShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
ObjectStack<KType>	A subclass of ObjectArrayList adding stack-related utility methods.
Preallocable	Anything that can preallocate buffers given prior knowledge of the number of stored elements.
RamUsageEstimator	Helper class that helps estimate memory usage Mostly forked from Lucene tag releases/lucene-solr/8.5.1
RandomizedHashOrderMixer	Randomized hash order.
ShortArrayDeque	An array-backed ShortDeque.
ShortArrayList	An array-backed list of shorts.
ShortArrayList.ValueIterator	An iterator implementation for ShortArrayList.iterator().
ShortBufferVisualizer	Reused buffer visualization routines.
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.
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.
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.
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.
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.
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.
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<VType>	An associative container from keys to (one or possibly more) values.
ShortObjectHashMap<VType>	A hash map of short to Object, implemented using open addressing with linear probing for collision resolution.
ShortObjectMap<VType>	An associative container with unique binding from keys to a single value.
ShortObjectScatterMap<VType>	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.
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.
XorShift128P	A fast pseudo-random number generator.