Uses of Class
com.carrotsearch.hppc.IntByteHashMap
Packages that use IntByteHashMap
-
Uses of IntByteHashMap in com.carrotsearch.hppc
Subclasses of IntByteHashMap in com.carrotsearch.hppcModifier and TypeClassDescriptionclass
Same asIntByteHashMap
but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.Fields in com.carrotsearch.hppc declared as IntByteHashMapModifier and TypeFieldDescriptionprivate final IntByteHashMap
IntByteHashMap.KeysContainer.owner
private final IntByteHashMap
IntByteHashMap.ValuesContainer.owner
Methods in com.carrotsearch.hppc that return IntByteHashMapModifier and TypeMethodDescriptionIntByteHashMap.clone()
static IntByteHashMap
IntByteHashMap.from
(int[] keys, byte[] values) Creates a hash map from two index-aligned arrays of key-value pairs.Methods in com.carrotsearch.hppc with parameters of type IntByteHashMapModifier and TypeMethodDescriptionprotected boolean
IntByteHashMap.equalElements
(IntByteHashMap other) Return true if all keys of some other container exist in this container.