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