Uses of Package
com.carrotsearch.hppc
Packages that use com.carrotsearch.hppc
-
Classes in com.carrotsearch.hppc used by com.carrotsearch.hppcClassDescriptionCommon superclass for collections.Common superclass for collections.Common superclass for collections.Common superclass for collections.Common superclass for collections.Simplifies the implementation of iterators a bit.Common superclass for collections.Common superclass for collections.Common superclass for collections.Resizing (growth) strategy for array-backed buffers.An "open" BitSet implementation that allows direct access to the array of words storing the bits.An iterator to iterate over set bits in an BitSet.An array-backed
ByteDeque
.An array-backed list of bytes.An associative container from keys to (one or possibly more) values.A hash map ofbyte
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofbyte
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingbyte
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofbyte
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofbyte
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofbyte
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofbyte
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofbyte
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofbyte
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asByteHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofbyte
s.An associative container from keys to (one or possibly more) values.A hash map ofbyte
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asByteShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofByteArrayList
adding stack-related utility methods.An array-backedCharDeque
.An array-backed list of chars.An associative container from keys to (one or possibly more) values.A hash map ofchar
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofchar
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingchar
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofchar
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofchar
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofchar
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofchar
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofchar
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofchar
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asCharHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofchar
s.An associative container from keys to (one or possibly more) values.A hash map ofchar
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asCharShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofCharArrayList
adding stack-related utility methods.An array-backedDoubleDeque
.An array-backed list of doubles.An associative container from keys to (one or possibly more) values.A hash map ofdouble
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofdouble
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingdouble
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofdouble
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofdouble
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofdouble
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofdouble
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofdouble
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofdouble
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asDoubleHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofdouble
s.An associative container from keys to (one or possibly more) values.A hash map ofdouble
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asDoubleShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofDoubleArrayList
adding stack-related utility methods.An array-backedFloatDeque
.An array-backed list of floats.An associative container from keys to (one or possibly more) values.A hash map offloat
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map offloat
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingfloat
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map offloat
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map offloat
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set offloat
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map offloat
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map offloat
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map offloat
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asFloatHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set offloat
s.An associative container from keys to (one or possibly more) values.A hash map offloat
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asFloatShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofFloatArrayList
adding stack-related utility methods.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.An array-backedIntDeque
.An array-backed list of ints.An associative container from keys to (one or possibly more) values.A hash map ofint
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofint
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingint
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofint
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofint
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofint
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofint
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofint
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofint
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Anything that implements value-equality function as replaced by theIntrinsics.EqualityFunction.equals(java.lang.Object, java.lang.Object)
intrinsic.Same asIntHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofint
s.An associative container from keys to (one or possibly more) values.A hash map ofint
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asIntShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofIntArrayList
adding stack-related utility methods.An array-backedLongDeque
.An array-backed list of longs.An associative container from keys to (one or possibly more) values.A hash map oflong
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map oflong
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdinglong
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map oflong
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map oflong
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set oflong
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map oflong
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map oflong
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map oflong
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asLongHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set oflong
s.An associative container from keys to (one or possibly more) values.A hash map oflong
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asLongShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofLongArrayList
adding stack-related utility methods.An array-backedObjectDeque
.An array-backed list of Objects.An associative container from keys to (one or possibly more) values.A hash map ofObject
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
tobyte
.An associative container with unique binding from keys to a single value.Same asObjectByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofObject
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
tochar
.An associative container with unique binding from keys to a single value.Same asObjectCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingObject
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofObject
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
todouble
.An associative container with unique binding from keys to a single value.Same asObjectDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofObject
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
tofloat
.An associative container with unique binding from keys to a single value.Same asObjectFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofObject
s, implemented using using open addressing with linear probing for collision resolution.A reference-equality (identity) hash set.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofObject
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
toint
.An associative container with unique binding from keys to a single value.Same asObjectIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofObject
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
tolong
.An associative container with unique binding from keys to a single value.Same asObjectLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofObject
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
toObject
.An associative container with unique binding from keys to a single value.Same asObjectObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asObjectHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofObject
s.An associative container from keys to (one or possibly more) values.A hash map ofObject
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An identity hash map ofObject
toshort
.An associative container with unique binding from keys to a single value.Same asObjectShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofObjectArrayList
adding stack-related utility methods.Anything that can preallocate buffers given prior knowledge of the number of stored elements.Randomized hash order.An array-backedShortDeque
.An array-backed list of shorts.An associative container from keys to (one or possibly more) values.A hash map ofshort
tobyte
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofshort
tochar
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements (difference and intersection).A generic container holdingshort
s.A linear collection that supports element insertion and removal at both ends.An associative container from keys to (one or possibly more) values.A hash map ofshort
todouble
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofshort
tofloat
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A hash set ofshort
s, implemented using using open addressing with linear probing for collision resolution.An indexed container provides random access to elements based on anindex
.An associative container from keys to (one or possibly more) values.A hash map ofshort
toint
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or possibly more) values.A hash map ofshort
tolong
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Marker interface for containers that can check if they contain a given object in at least timeO(log n)
and ideally in amortized constant timeO(1)
.An associative container from keys to (one or possibly more) values.A hash map ofshort
toObject
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Same asShortHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A set ofshort
s.An associative container from keys to (one or possibly more) values.A hash map ofshort
toshort
, implemented using open addressing with linear probing for collision resolution.A view of the keys inside this hash map.An associative container with unique binding from keys to a single value.Same asShortShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.A subclass ofShortArrayList
adding stack-related utility methods.Suppresses forbidden-API checks.