Uses of Interface
com.carrotsearch.hppc.Preallocable
Packages that use Preallocable
-
Uses of Preallocable in com.carrotsearch.hppc
Classes in com.carrotsearch.hppc that implement PreallocableModifier and TypeClassDescriptionclass
An array-backedByteDeque
.class
An array-backed list of bytes.class
A hash map ofbyte
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asByteByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofbyte
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asByteCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofbyte
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asByteDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofbyte
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asByteFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set ofbyte
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map ofbyte
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asByteIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofbyte
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asByteLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ByteObjectHashMap<VType>
A hash map ofbyte
toObject
, implemented using open addressing with linear probing for collision resolution.class
ByteObjectScatterMap<VType>
Same asByteObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asByteHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofbyte
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asByteShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofByteArrayList
adding stack-related utility methods.class
An array-backedCharDeque
.class
An array-backed list of chars.class
A hash map ofchar
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asCharByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofchar
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asCharCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofchar
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asCharDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofchar
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asCharFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set ofchar
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map ofchar
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asCharIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofchar
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asCharLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
CharObjectHashMap<VType>
A hash map ofchar
toObject
, implemented using open addressing with linear probing for collision resolution.class
CharObjectScatterMap<VType>
Same asCharObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asCharHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofchar
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asCharShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofCharArrayList
adding stack-related utility methods.class
An array-backedDoubleDeque
.class
An array-backed list of doubles.class
A hash map ofdouble
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofdouble
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofdouble
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofdouble
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set ofdouble
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map ofdouble
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofdouble
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
DoubleObjectHashMap<VType>
A hash map ofdouble
toObject
, implemented using open addressing with linear probing for collision resolution.class
DoubleObjectScatterMap<VType>
Same asDoubleObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asDoubleHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofdouble
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asDoubleShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofDoubleArrayList
adding stack-related utility methods.class
An array-backedFloatDeque
.class
An array-backed list of floats.class
A hash map offloat
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map offloat
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map offloat
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map offloat
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set offloat
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map offloat
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map offloat
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
FloatObjectHashMap<VType>
A hash map offloat
toObject
, implemented using open addressing with linear probing for collision resolution.class
FloatObjectScatterMap<VType>
Same asFloatObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asFloatHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map offloat
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asFloatShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofFloatArrayList
adding stack-related utility methods.class
An array-backedIntDeque
.class
An array-backed list of ints.class
A hash map ofint
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asIntByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofint
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asIntCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofint
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asIntDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofint
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asIntFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set ofint
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map ofint
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asIntIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofint
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asIntLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
IntObjectHashMap<VType>
A hash map ofint
toObject
, implemented using open addressing with linear probing for collision resolution.class
IntObjectScatterMap<VType>
Same asIntObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asIntHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofint
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asIntShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofIntArrayList
adding stack-related utility methods.class
An array-backedLongDeque
.class
An array-backed list of longs.class
A hash map oflong
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asLongByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map oflong
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asLongCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map oflong
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asLongDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map oflong
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asLongFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set oflong
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map oflong
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asLongIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map oflong
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asLongLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
LongObjectHashMap<VType>
A hash map oflong
toObject
, implemented using open addressing with linear probing for collision resolution.class
LongObjectScatterMap<VType>
Same asLongObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asLongHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map oflong
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asLongShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofLongArrayList
adding stack-related utility methods.class
ObjectArrayDeque<KType>
An array-backedObjectDeque
.class
ObjectArrayList<KType>
An array-backed list of Objects.class
ObjectByteHashMap<KType>
A hash map ofObject
tobyte
, implemented using open addressing with linear probing for collision resolution.class
ObjectByteIdentityHashMap<KType>
An identity hash map ofObject
tobyte
.class
ObjectByteScatterMap<KType>
Same asObjectByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectCharHashMap<KType>
A hash map ofObject
tochar
, implemented using open addressing with linear probing for collision resolution.class
ObjectCharIdentityHashMap<KType>
An identity hash map ofObject
tochar
.class
ObjectCharScatterMap<KType>
Same asObjectCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectDoubleHashMap<KType>
A hash map ofObject
todouble
, implemented using open addressing with linear probing for collision resolution.class
ObjectDoubleIdentityHashMap<KType>
An identity hash map ofObject
todouble
.class
ObjectDoubleScatterMap<KType>
Same asObjectDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectFloatHashMap<KType>
A hash map ofObject
tofloat
, implemented using open addressing with linear probing for collision resolution.class
ObjectFloatIdentityHashMap<KType>
An identity hash map ofObject
tofloat
.class
ObjectFloatScatterMap<KType>
Same asObjectFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectHashSet<KType>
A hash set ofObject
s, implemented using using open addressing with linear probing for collision resolution.class
ObjectIdentityHashSet<KType>
A reference-equality (identity) hash set.class
ObjectIntHashMap<KType>
A hash map ofObject
toint
, implemented using open addressing with linear probing for collision resolution.class
ObjectIntIdentityHashMap<KType>
An identity hash map ofObject
toint
.class
ObjectIntScatterMap<KType>
Same asObjectIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectLongHashMap<KType>
A hash map ofObject
tolong
, implemented using open addressing with linear probing for collision resolution.class
ObjectLongIdentityHashMap<KType>
An identity hash map ofObject
tolong
.class
ObjectLongScatterMap<KType>
Same asObjectLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectObjectHashMap<KType,
VType> A hash map ofObject
toObject
, implemented using open addressing with linear probing for collision resolution.class
ObjectObjectIdentityHashMap<KType,
VType> An identity hash map ofObject
toObject
.class
ObjectObjectScatterMap<KType,
VType> Same asObjectObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectScatterSet<KType>
Same asObjectHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectShortHashMap<KType>
A hash map ofObject
toshort
, implemented using open addressing with linear probing for collision resolution.class
ObjectShortIdentityHashMap<KType>
An identity hash map ofObject
toshort
.class
ObjectShortScatterMap<KType>
Same asObjectShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ObjectStack<KType>
A subclass ofObjectArrayList
adding stack-related utility methods.class
An array-backedShortDeque
.class
An array-backed list of shorts.class
A hash map ofshort
tobyte
, implemented using open addressing with linear probing for collision resolution.class
Same asShortByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofshort
tochar
, implemented using open addressing with linear probing for collision resolution.class
Same asShortCharHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofshort
todouble
, implemented using open addressing with linear probing for collision resolution.class
Same asShortDoubleHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofshort
tofloat
, implemented using open addressing with linear probing for collision resolution.class
Same asShortFloatHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash set ofshort
s, implemented using using open addressing with linear probing for collision resolution.class
A hash map ofshort
toint
, implemented using open addressing with linear probing for collision resolution.class
Same asShortIntHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofshort
tolong
, implemented using open addressing with linear probing for collision resolution.class
Same asShortLongHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
ShortObjectHashMap<VType>
A hash map ofshort
toObject
, implemented using open addressing with linear probing for collision resolution.class
ShortObjectScatterMap<VType>
Same asShortObjectHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
Same asShortHashSet
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A hash map ofshort
toshort
, implemented using open addressing with linear probing for collision resolution.class
Same asShortShortHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.class
A subclass ofShortArrayList
adding stack-related utility methods.