@Generated(date="2023-04-24T17:14:49+0800",
value="KTypeVTypeScatterMap.java")
public class ByteByteScatterMap
extends ByteByteHashMap
ByteByteHashMap 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.
ByteByteHashMap.KeysContainerassigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values| Constructor and Description |
|---|
ByteByteScatterMap()
New instance with sane defaults.
|
ByteByteScatterMap(int expectedElements)
New instance with sane defaults.
|
ByteByteScatterMap(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
| Modifier and Type | Method and Description |
|---|---|
static ByteByteScatterMap |
from(byte[] keys,
byte[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
|
protected int |
hashKey(byte 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 ByteByteScatterMap()
public ByteByteScatterMap(int expectedElements)
public ByteByteScatterMap(int expectedElements,
double loadFactor)
protected int hashKey(byte key)
ByteByteHashMapThe default implementation mixes the hash of the key with ByteByteHashMap.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 ByteByteHashMappublic static ByteByteScatterMap from(byte[] keys, byte[] values)