Uses of Class
com.carrotsearch.hppc.IntDoubleHashMap

Packages that use IntDoubleHashMap

Package	Description
com.carrotsearch.hppc

Uses of IntDoubleHashMap in com.carrotsearch.hppc

Subclasses of IntDoubleHashMap in com.carrotsearch.hppc

Modifier and Type	Class	Description
class	IntDoubleScatterMap	Same as IntDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.

Fields in com.carrotsearch.hppc declared as IntDoubleHashMap

Modifier and Type	Field	Description
private IntDoubleHashMap	IntDoubleHashMap.KeysContainer.owner
private IntDoubleHashMap	IntDoubleHashMap.ValuesContainer.owner

Methods in com.carrotsearch.hppc that return IntDoubleHashMap

Modifier and Type	Method	Description
IntDoubleHashMap	IntDoubleHashMap.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 IntDoubleHashMap

Modifier and Type	Method	Description
protected boolean	IntDoubleHashMap.equalElements(IntDoubleHashMap other)	Return true if all keys of some other container exist in this container.