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