Uses of Interface
com.carrotsearch.hppc.Preallocable

Packages that use Preallocable
Package
Description
 
  • Uses of Preallocable in com.carrotsearch.hppc

    Classes in com.carrotsearch.hppc that implement Preallocable
    Modifier and Type
    Class
    Description
    class 
    An array-backed ByteDeque.
    class 
    An array-backed list of bytes.
    class 
    A hash map of byte to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of bytes, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of byte to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as ByteHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of byte to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ByteShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of ByteArrayList adding stack-related utility methods.
    class 
    An array-backed CharDeque.
    class 
    An array-backed list of chars.
    class 
    A hash map of char to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of chars, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of char to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as CharHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of char to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as CharShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of CharArrayList adding stack-related utility methods.
    class 
    An array-backed DoubleDeque.
    class 
    An array-backed list of doubles.
    class 
    A hash map of double to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of doubles, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of double to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as DoubleHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of double to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as DoubleShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of DoubleArrayList adding stack-related utility methods.
    class 
    An array-backed FloatDeque.
    class 
    An array-backed list of floats.
    class 
    A hash map of float to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of floats, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of float to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as FloatHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of float to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as FloatShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of FloatArrayList adding stack-related utility methods.
    class 
    An array-backed IntDeque.
    class 
    An array-backed list of ints.
    class 
    A hash map of int to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of ints, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of int to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as IntHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of int to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as IntShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of IntArrayList adding stack-related utility methods.
    class 
    An array-backed LongDeque.
    class 
    An array-backed list of longs.
    class 
    A hash map of long to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of longs, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of long to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as LongHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of long to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as LongShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of LongArrayList adding stack-related utility methods.
    class 
    An array-backed ObjectDeque.
    class 
    An array-backed list of Objects.
    class 
    A hash map of Object to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to byte.
    class 
    Same as ObjectByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of Object to char, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to char.
    class 
    Same as ObjectCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of Object to double, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to double.
    class 
    Same as ObjectDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of Object to float, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to float.
    class 
    Same as ObjectFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of Objects, implemented using using open addressing with linear probing for collision resolution.
    class 
    A reference-equality (identity) hash set.
    class 
    A hash map of Object to int, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to int.
    class 
    Same as ObjectIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of Object to long, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to long.
    class 
    Same as ObjectLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    ObjectObjectHashMap<KType,VType>
    A hash map of Object to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to Object.
    class 
    Same as ObjectObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as ObjectHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of Object to short, implemented using open addressing with linear probing for collision resolution.
    class 
    An identity hash map of Object to short.
    class 
    Same as ObjectShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of ObjectArrayList adding stack-related utility methods.
    class 
    An array-backed ShortDeque.
    class 
    An array-backed list of shorts.
    class 
    A hash map of short to byte, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortByteHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to char, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortCharHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to double, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to float, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortFloatHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash set of shorts, implemented using using open addressing with linear probing for collision resolution.
    class 
    A hash map of short to int, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortIntHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to long, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortLongHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to Object, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortObjectHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    Same as ShortHashSet but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A hash map of short to short, implemented using open addressing with linear probing for collision resolution.
    class 
    Same as ShortShortHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.
    class 
    A subclass of ShortArrayList adding stack-related utility methods.