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 TypeClassDescriptionclassAn array-backedByteDeque.classAn array-backed list of bytes.classA hash map ofbytetobyte, implemented using open addressing with linear probing for collision resolution.classSame asByteByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofbytetochar, implemented using open addressing with linear probing for collision resolution.classSame asByteCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofbytetodouble, implemented using open addressing with linear probing for collision resolution.classSame asByteDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofbytetofloat, implemented using open addressing with linear probing for collision resolution.classSame asByteFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofbytes, implemented using using open addressing with linear probing for collision resolution.classA hash map ofbytetoint, implemented using open addressing with linear probing for collision resolution.classSame asByteIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofbytetolong, implemented using open addressing with linear probing for collision resolution.classSame asByteLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classByteObjectHashMap<VType>A hash map ofbytetoObject, implemented using open addressing with linear probing for collision resolution.classByteObjectScatterMap<VType>Same asByteObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asByteHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofbytetoshort, implemented using open addressing with linear probing for collision resolution.classSame asByteShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofByteArrayListadding stack-related utility methods.classAn array-backedCharDeque.classAn array-backed list of chars.classA hash map ofchartobyte, implemented using open addressing with linear probing for collision resolution.classSame asCharByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofchartochar, implemented using open addressing with linear probing for collision resolution.classSame asCharCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofchartodouble, implemented using open addressing with linear probing for collision resolution.classSame asCharDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofchartofloat, implemented using open addressing with linear probing for collision resolution.classSame asCharFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofchars, implemented using using open addressing with linear probing for collision resolution.classA hash map ofchartoint, implemented using open addressing with linear probing for collision resolution.classSame asCharIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofchartolong, implemented using open addressing with linear probing for collision resolution.classSame asCharLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classCharObjectHashMap<VType>A hash map ofchartoObject, implemented using open addressing with linear probing for collision resolution.classCharObjectScatterMap<VType>Same asCharObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asCharHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofchartoshort, implemented using open addressing with linear probing for collision resolution.classSame asCharShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofCharArrayListadding stack-related utility methods.classAn array-backedDoubleDeque.classAn array-backed list of doubles.classA hash map ofdoubletobyte, implemented using open addressing with linear probing for collision resolution.classSame asDoubleByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofdoubletochar, implemented using open addressing with linear probing for collision resolution.classSame asDoubleCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofdoubletodouble, implemented using open addressing with linear probing for collision resolution.classSame asDoubleDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofdoubletofloat, implemented using open addressing with linear probing for collision resolution.classSame asDoubleFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofdoubles, implemented using using open addressing with linear probing for collision resolution.classA hash map ofdoubletoint, implemented using open addressing with linear probing for collision resolution.classSame asDoubleIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofdoubletolong, implemented using open addressing with linear probing for collision resolution.classSame asDoubleLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classDoubleObjectHashMap<VType>A hash map ofdoubletoObject, implemented using open addressing with linear probing for collision resolution.classDoubleObjectScatterMap<VType>Same asDoubleObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asDoubleHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofdoubletoshort, implemented using open addressing with linear probing for collision resolution.classSame asDoubleShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofDoubleArrayListadding stack-related utility methods.classAn array-backedFloatDeque.classAn array-backed list of floats.classA hash map offloattobyte, implemented using open addressing with linear probing for collision resolution.classSame asFloatByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map offloattochar, implemented using open addressing with linear probing for collision resolution.classSame asFloatCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map offloattodouble, implemented using open addressing with linear probing for collision resolution.classSame asFloatDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map offloattofloat, implemented using open addressing with linear probing for collision resolution.classSame asFloatFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set offloats, implemented using using open addressing with linear probing for collision resolution.classA hash map offloattoint, implemented using open addressing with linear probing for collision resolution.classSame asFloatIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map offloattolong, implemented using open addressing with linear probing for collision resolution.classSame asFloatLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classFloatObjectHashMap<VType>A hash map offloattoObject, implemented using open addressing with linear probing for collision resolution.classFloatObjectScatterMap<VType>Same asFloatObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asFloatHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map offloattoshort, implemented using open addressing with linear probing for collision resolution.classSame asFloatShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofFloatArrayListadding stack-related utility methods.classAn array-backedIntDeque.classAn array-backed list of ints.classA hash map ofinttobyte, implemented using open addressing with linear probing for collision resolution.classSame asIntByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofinttochar, implemented using open addressing with linear probing for collision resolution.classSame asIntCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofinttodouble, implemented using open addressing with linear probing for collision resolution.classSame asIntDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofinttofloat, implemented using open addressing with linear probing for collision resolution.classSame asIntFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofints, implemented using using open addressing with linear probing for collision resolution.classA hash map ofinttoint, implemented using open addressing with linear probing for collision resolution.classSame asIntIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofinttolong, implemented using open addressing with linear probing for collision resolution.classSame asIntLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classIntObjectHashMap<VType>A hash map ofinttoObject, implemented using open addressing with linear probing for collision resolution.classIntObjectScatterMap<VType>Same asIntObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asIntHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofinttoshort, implemented using open addressing with linear probing for collision resolution.classSame asIntShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofIntArrayListadding stack-related utility methods.classAn array-backedLongDeque.classAn array-backed list of longs.classA hash map oflongtobyte, implemented using open addressing with linear probing for collision resolution.classSame asLongByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map oflongtochar, implemented using open addressing with linear probing for collision resolution.classSame asLongCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map oflongtodouble, implemented using open addressing with linear probing for collision resolution.classSame asLongDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map oflongtofloat, implemented using open addressing with linear probing for collision resolution.classSame asLongFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set oflongs, implemented using using open addressing with linear probing for collision resolution.classA hash map oflongtoint, implemented using open addressing with linear probing for collision resolution.classSame asLongIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map oflongtolong, implemented using open addressing with linear probing for collision resolution.classSame asLongLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classLongObjectHashMap<VType>A hash map oflongtoObject, implemented using open addressing with linear probing for collision resolution.classLongObjectScatterMap<VType>Same asLongObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asLongHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map oflongtoshort, implemented using open addressing with linear probing for collision resolution.classSame asLongShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofLongArrayListadding stack-related utility methods.classObjectArrayDeque<KType>An array-backedObjectDeque.classObjectArrayList<KType>An array-backed list of Objects.classObjectByteHashMap<KType>A hash map ofObjecttobyte, implemented using open addressing with linear probing for collision resolution.classObjectByteIdentityHashMap<KType>An identity hash map ofObjecttobyte.classObjectByteScatterMap<KType>Same asObjectByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectCharHashMap<KType>A hash map ofObjecttochar, implemented using open addressing with linear probing for collision resolution.classObjectCharIdentityHashMap<KType>An identity hash map ofObjecttochar.classObjectCharScatterMap<KType>Same asObjectCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectDoubleHashMap<KType>A hash map ofObjecttodouble, implemented using open addressing with linear probing for collision resolution.classObjectDoubleIdentityHashMap<KType>An identity hash map ofObjecttodouble.classObjectDoubleScatterMap<KType>Same asObjectDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectFloatHashMap<KType>A hash map ofObjecttofloat, implemented using open addressing with linear probing for collision resolution.classObjectFloatIdentityHashMap<KType>An identity hash map ofObjecttofloat.classObjectFloatScatterMap<KType>Same asObjectFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectHashSet<KType>A hash set ofObjects, implemented using using open addressing with linear probing for collision resolution.classObjectIdentityHashSet<KType>A reference-equality (identity) hash set.classObjectIntHashMap<KType>A hash map ofObjecttoint, implemented using open addressing with linear probing for collision resolution.classObjectIntIdentityHashMap<KType>An identity hash map ofObjecttoint.classObjectIntScatterMap<KType>Same asObjectIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectLongHashMap<KType>A hash map ofObjecttolong, implemented using open addressing with linear probing for collision resolution.classObjectLongIdentityHashMap<KType>An identity hash map ofObjecttolong.classObjectLongScatterMap<KType>Same asObjectLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectObjectHashMap<KType,VType> A hash map ofObjecttoObject, implemented using open addressing with linear probing for collision resolution.classObjectObjectIdentityHashMap<KType,VType> An identity hash map ofObjecttoObject.classObjectObjectScatterMap<KType,VType> Same asObjectObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectScatterSet<KType>Same asObjectHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectShortHashMap<KType>A hash map ofObjecttoshort, implemented using open addressing with linear probing for collision resolution.classObjectShortIdentityHashMap<KType>An identity hash map ofObjecttoshort.classObjectShortScatterMap<KType>Same asObjectShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectStack<KType>A subclass ofObjectArrayListadding stack-related utility methods.classAn array-backedShortDeque.classAn array-backed list of shorts.classA hash map ofshorttobyte, implemented using open addressing with linear probing for collision resolution.classSame asShortByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofshorttochar, implemented using open addressing with linear probing for collision resolution.classSame asShortCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofshorttodouble, implemented using open addressing with linear probing for collision resolution.classSame asShortDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofshorttofloat, implemented using open addressing with linear probing for collision resolution.classSame asShortFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofshorts, implemented using using open addressing with linear probing for collision resolution.classA hash map ofshorttoint, implemented using open addressing with linear probing for collision resolution.classSame asShortIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofshorttolong, implemented using open addressing with linear probing for collision resolution.classSame asShortLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classShortObjectHashMap<VType>A hash map ofshorttoObject, implemented using open addressing with linear probing for collision resolution.classShortObjectScatterMap<VType>Same asShortObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asShortHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash map ofshorttoshort, implemented using open addressing with linear probing for collision resolution.classSame asShortShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofShortArrayListadding stack-related utility methods.