@Generated(date="2023-04-24T17:14:49+0800",
value="KTypeVTypeScatterMap.java")
public class DoubleIntScatterMap
extends DoubleIntHashMap
DoubleIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
Note: read about important differences between hash and scatter sets.
DoubleIntHashMap.KeysContainerassigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values| Constructor and Description |
|---|
DoubleIntScatterMap()
New instance with sane defaults.
|
DoubleIntScatterMap(int expectedElements)
New instance with sane defaults.
|
DoubleIntScatterMap(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
| Modifier and Type | Method and Description |
|---|---|
static DoubleIntScatterMap |
from(double[] keys,
int[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
|
protected int |
hashKey(double key)
Returns a hash code for the given key.
|
addTo, allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equalElements, equals, forEach, forEach, get, getOrDefault, hashCode, indexExists, indexGet, indexInsert, indexOf, indexReplace, isEmpty, iterator, keys, put, putAll, putAll, putIfAbsent, putOrAdd, rehash, release, remove, removeAll, removeAll, removeAll, shiftConflictingKeys, size, toString, values, verifyLoadFactor, visualizeKeyDistributionpublic DoubleIntScatterMap()
public DoubleIntScatterMap(int expectedElements)
public DoubleIntScatterMap(int expectedElements,
double loadFactor)
protected int hashKey(double key)
DoubleIntHashMapThe default implementation mixes the hash of the key with DoubleIntHashMap.keyMixer
to differentiate hash order of keys between hash containers. Helps
alleviate problems resulting from linear conflict resolution in open
addressing.
The output from this function should evenly distribute keys across the entire integer range.
hashKey in class DoubleIntHashMappublic static DoubleIntScatterMap from(double[] keys, int[] values)