Package com.carrotsearch.hppc

Class ObjectByteIdentityHashMap<KType>

java.lang.Object

com.carrotsearch.hppc.ObjectByteHashMap<KType>

com.carrotsearch.hppc.ObjectByteIdentityHashMap<KType>

All Implemented Interfaces:

ObjectByteAssociativeContainer<KType>, ObjectByteMap<KType>, Preallocable, java.lang.Iterable<KType>

@Generated(date="2018-05-21T11:30:40+0200",
           value="KTypeVTypeIdentityHashMap.java")
public class ObjectByteIdentityHashMap<KType>
extends ObjectByteHashMap<KType>

An identity hash map of Object to byte.

Nested Class Summary

Nested classes/interfaces inherited from class com.carrotsearch.hppc.ObjectByteHashMap

ObjectByteHashMap.KeysContainer

Field Summary

Fields inherited from class com.carrotsearch.hppc.ObjectByteHashMap

assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values

Constructor Summary

Constructors

Constructor	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.

Method Summary

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from class com.carrotsearch.hppc.ObjectByteHashMap

addTo, allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equalElements, equals, 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, visualizeKeyDistribution

Constructor Detail

ObjectByteIdentityHashMap

public ObjectByteIdentityHashMap()

New instance with sane defaults.

ObjectByteIdentityHashMap

public ObjectByteIdentityHashMap(int expectedElements)

New instance with sane defaults.

Parameters:

expectedElements - The expected number of elements guaranteed not to cause buffer expansion (inclusive).

ObjectByteIdentityHashMap

public ObjectByteIdentityHashMap(int expectedElements,
                                 double loadFactor)

New instance with sane defaults.

Parameters:

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).

ObjectByteIdentityHashMap

public ObjectByteIdentityHashMap(int expectedElements,
                                 double loadFactor,
                                 HashOrderMixingStrategy orderMixer)

New instance with the provided defaults.

Parameters:

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.

ObjectByteIdentityHashMap

public ObjectByteIdentityHashMap(ObjectByteAssociativeContainer<? extends KType> container)

Create a hash map from all key-value pairs of another container.

Method Detail

hashKey

public int hashKey(KType key)

Description copied from class: ObjectByteHashMap

Returns a hash code for the given key.

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.

Overrides:

hashKey in class ObjectByteHashMap<KType>

equals

public boolean equals(java.lang.Object v1,
                      java.lang.Object v2)

Overrides:

equals in class ObjectByteHashMap<KType>

from

public static <KType> ObjectByteIdentityHashMap<KType> from(KType[] keys,
                                                            byte[] values)

Creates a hash map from two index-aligned arrays of key-value pairs.