Package com.carrotsearch.hppc
Class ObjectIntIdentityHashMap<KType>
java.lang.Object
com.carrotsearch.hppc.ObjectIntHashMap<KType>
com.carrotsearch.hppc.ObjectIntIdentityHashMap<KType>
- All Implemented Interfaces:
ObjectIntAssociativeContainer<KType>
,ObjectIntMap<KType>
,Preallocable
,Cloneable
,Iterable<ObjectIntCursor<KType>>
@Generated(date="2023-10-26T04:33:09+0000",
value="KTypeVTypeIdentityHashMap.java")
public class ObjectIntIdentityHashMap<KType>
extends ObjectIntHashMap<KType>
An identity hash map of
Object
to int
.-
Nested Class Summary
Nested classes/interfaces inherited from class com.carrotsearch.hppc.ObjectIntHashMap
ObjectIntHashMap.KeysContainer
-
Field Summary
Fields inherited from class com.carrotsearch.hppc.ObjectIntHashMap
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
-
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.ObjectIntIdentityHashMap
(int expectedElements) New instance with sane defaults.ObjectIntIdentityHashMap
(int expectedElements, double loadFactor) New instance with sane defaults.ObjectIntIdentityHashMap
(int expectedElements, double loadFactor, HashOrderMixingStrategy orderMixer) New instance with the provided defaults.ObjectIntIdentityHashMap
(ObjectIntAssociativeContainer<? extends KType> container) Create a hash map from all key-value pairs of another container. -
Method Summary
Methods inherited from class com.carrotsearch.hppc.ObjectIntHashMap
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
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Constructor Details
-
ObjectIntIdentityHashMap
public ObjectIntIdentityHashMap()New instance with sane defaults. -
ObjectIntIdentityHashMap
public ObjectIntIdentityHashMap(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
ObjectIntIdentityHashMap
public ObjectIntIdentityHashMap(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 byObjectIntHashMap.verifyLoadFactor(double)
.
-
ObjectIntIdentityHashMap
public ObjectIntIdentityHashMap(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 byObjectIntHashMap.verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. SeeHashOrderMixing
for predefined implementations. Use constant mixers only if you understand the potential consequences.
-
ObjectIntIdentityHashMap
Create a hash map from all key-value pairs of another container.
-
-
Method Details
-
hashKey
Description copied from class:ObjectIntHashMap
Returns a hash code for the given key.The default implementation mixes the hash of the key with
ObjectIntHashMap.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 classObjectIntHashMap<KType>
-
equals
- Overrides:
equals
in classObjectIntHashMap<KType>
-
from
Creates a hash map from two index-aligned arrays of key-value pairs.
-