@Generated(date="2015-05-05T11:00:03+0200", value="KTypeVTypeScatterMap.java") public class DoubleDoubleScatterMap extends DoubleDoubleHashMap
DoubleDoubleHashMap
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.
DoubleDoubleHashMap.KeysContainer
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
Constructor and Description |
---|
DoubleDoubleScatterMap()
New instance with sane defaults.
|
DoubleDoubleScatterMap(int expectedElements)
New instance with sane defaults.
|
DoubleDoubleScatterMap(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
Modifier and Type | Method and Description |
---|---|
protected int |
hashKey(double key)
Returns a hash code for the given key.
|
addTo, allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equalElements, equals, forEach, forEach, from, 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
public DoubleDoubleScatterMap()
public DoubleDoubleScatterMap(int expectedElements)
public DoubleDoubleScatterMap(int expectedElements, double loadFactor)
protected int hashKey(double key)
DoubleDoubleHashMap
The default implementation mixes the hash of the key with DoubleDoubleHashMap.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 DoubleDoubleHashMap
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.