Top Description Fields Constructors Methods
com.carrotsearch.hppc

public Class ObjectIntIdentityHashMap<KType>

extends ObjectIntHashMap<KType>
Class Inheritance
Annotations
@Generated:KTypeVTypeIdentityHashMap.java
date:2024-06-04T15:20:16+0200
Static Imports
com.carrotsearch.hppc.Containers.*, com.carrotsearch.hppc.HashContainers.*

An identity hash map of Object to int.

Field Summary

Inherited from com.carrotsearch.hppc.ObjectIntHashMap:
assignedhasEmptyKeyiterationSeedkeysloadFactormaskresizeAtvalues

Constructor Summary

AccessConstructor and Description
public
ObjectIntIdentityHashMap()

New instance with sane defaults.

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

New instance with sane defaults.

public
ObjectIntIdentityHashMap(int
The expected number of elements guaranteed not to cause a rehash (inclusive).
expectedElements
,
double
The load factor for internal buffers. Insane load factors (zero, full capacity) are rejected by verifyLoadFactor(double).
loadFactor
)

New instance with the provided defaults.

public
ObjectIntIdentityHashMap(ObjectIntAssociativeContainer<? extends KType> container)

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

Method Summary

Modifier and TypeMethod and Description
public boolean
public static <KType> ObjectIntIdentityHashMap<KType>
from(KType[] keys, int[] values)

Hides com.carrotsearch.hppc.ObjectIntHashMap.from.

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

public int
hashKey(KType key)

Overrides com.carrotsearch.hppc.ObjectIntHashMap.hashKey.

Returns a hash code for the given key.

Inherited from com.carrotsearch.hppc.ObjectIntHashMap:
addToallocateBuffersallocateThenInsertThenRehashclearclonecontainsKeyensureCapacityequalElementsequalsforEachforEachgetgetOrDefaulthashCodeindexExistsindexGetindexInsertindexOfindexRemoveindexReplaceisEmptyiteratorkeysnextIterationSeedputputAllputAllputOrAddramBytesAllocatedramBytesUsedrehashreleaseremoveremoveAllremoveAllremoveAllshiftConflictingKeyssizetoStringvaluesverifyLoadFactorvisualizeKeyDistribution

Constructor Detail

ObjectIntIdentityHashMapback to summary
public ObjectIntIdentityHashMap()

New instance with sane defaults.

ObjectIntIdentityHashMapback to summary
public ObjectIntIdentityHashMap(int expectedElements)

New instance with sane defaults.

Parameters
expectedElements:int

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

ObjectIntIdentityHashMapback to summary
public ObjectIntIdentityHashMap(int expectedElements, double loadFactor)

New instance with the provided defaults.

Parameters
expectedElements:int

The expected number of elements guaranteed not to cause a rehash (inclusive).

loadFactor:double

The load factor for internal buffers. Insane load factors (zero, full capacity) are rejected by verifyLoadFactor(double).

ObjectIntIdentityHashMapback to summary
public ObjectIntIdentityHashMap(ObjectIntAssociativeContainer<? extends KType> container)

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

Method Detail

equalsback to summary
public boolean equals(Object v1, Object v2)

Overrides com.carrotsearch.hppc.ObjectIntHashMap.equals.

Annotations
@Override
fromback to summary
public static <KType> ObjectIntIdentityHashMap<KType> from(KType[] keys, int[] values)

Hides com.carrotsearch.hppc.ObjectIntHashMap.from.

Doc from com.carrotsearch.hppc.ObjectIntHashMap.from.

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

Annotations
@SuppressWarnings:unchecked
hashKeyback to summary
public int hashKey(KType key)

Overrides com.carrotsearch.hppc.ObjectIntHashMap.hashKey.

Doc from com.carrotsearch.hppc.ObjectIntHashMap.hashKey.

Returns a hash code for the given key.

The output from this function should evenly distribute keys across the entire integer range.

Annotations
@Override