@Generated(date="2015-05-05T11:00:01+0200", value="KTypeVTypeIdentityHashMap.java") public class ObjectByteIdentityHashMap<KType> extends ObjectByteHashMap<KType>
Object
to byte
.ObjectByteHashMap.KeysContainer
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
Constructor and Description |
---|
ObjectByteIdentityHashMap()
New instance with sane defaults.
|
ObjectByteIdentityHashMap(int expectedElements)
New instance with sane defaults.
|
ObjectByteIdentityHashMap(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
ObjectByteIdentityHashMap(int expectedElements,
double loadFactor,
HashOrderMixingStrategy orderMixer)
New instance with the provided defaults.
|
ObjectByteIdentityHashMap(ObjectByteAssociativeContainer<? extends KType> container)
Create a hash map from all key-value pairs of another container.
|
Modifier and Type | Method and Description |
---|---|
boolean |
equals(java.lang.Object v1,
java.lang.Object v2) |
static <KType> ObjectByteIdentityHashMap<KType> |
from(KType[] keys,
byte[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
|
int |
hashKey(KType 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
public ObjectByteIdentityHashMap()
public ObjectByteIdentityHashMap(int expectedElements)
expectedElements
- The expected number of elements guaranteed not to cause buffer
expansion (inclusive).public ObjectByteIdentityHashMap(int expectedElements, double loadFactor)
expectedElements
- The expected number of elements guaranteed not to cause buffer
expansion (inclusive).loadFactor
- The load factor for internal buffers. Insane load factors (zero, full capacity)
are rejected by ObjectByteHashMap.verifyLoadFactor(double)
.public ObjectByteIdentityHashMap(int expectedElements, double loadFactor, HashOrderMixingStrategy orderMixer)
expectedElements
- The expected number of elements guaranteed not to cause a rehash (inclusive).loadFactor
- The load factor for internal buffers. Insane load factors (zero, full capacity)
are rejected by ObjectByteHashMap.verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. See HashOrderMixing
for predefined
implementations. Use constant mixers only if you understand the potential
consequences.public ObjectByteIdentityHashMap(ObjectByteAssociativeContainer<? extends KType> container)
public int hashKey(KType key)
ObjectByteHashMap
The default implementation mixes the hash of the key with ObjectByteHashMap.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 ObjectByteHashMap<KType>
public boolean equals(java.lang.Object v1, java.lang.Object v2)
equals
in class ObjectByteHashMap<KType>
public static <KType> ObjectByteIdentityHashMap<KType> from(KType[] keys, byte[] values)
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.