Package com.carrotsearch.hppc
Class ObjectObjectIdentityHashMap<KType,VType>
- java.lang.Object
-
- com.carrotsearch.hppc.ObjectObjectHashMap<KType,VType>
-
- com.carrotsearch.hppc.ObjectObjectIdentityHashMap<KType,VType>
-
- All Implemented Interfaces:
ObjectObjectAssociativeContainer<KType,VType>
,ObjectObjectMap<KType,VType>
,Preallocable
,java.lang.Cloneable
,java.lang.Iterable<ObjectObjectCursor<KType,VType>>
@Generated(date="2021-05-28T03:45:42+0000", value="KTypeVTypeIdentityHashMap.java") public class ObjectObjectIdentityHashMap<KType,VType> extends ObjectObjectHashMap<KType,VType>
An identity hash map ofObject
toObject
.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class com.carrotsearch.hppc.ObjectObjectHashMap
ObjectObjectHashMap.KeysContainer
-
-
Field Summary
-
Fields inherited from class com.carrotsearch.hppc.ObjectObjectHashMap
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
-
-
Constructor Summary
Constructors Constructor Description ObjectObjectIdentityHashMap()
New instance with sane defaults.ObjectObjectIdentityHashMap(int expectedElements)
New instance with sane defaults.ObjectObjectIdentityHashMap(int expectedElements, double loadFactor)
New instance with sane defaults.ObjectObjectIdentityHashMap(int expectedElements, double loadFactor, HashOrderMixingStrategy orderMixer)
New instance with the provided defaults.ObjectObjectIdentityHashMap(ObjectObjectAssociativeContainer<? extends KType,? extends VType> container)
Create a hash map from all key-value pairs of another container.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description protected boolean
equalElements(ObjectObjectHashMap<?,?> other)
Return true if all keys of some other container exist in this container.boolean
equals(java.lang.Object v1, java.lang.Object v2)
static <KType,VType>
ObjectObjectIdentityHashMap<KType,VType>from(KType[] keys, VType[] 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 class com.carrotsearch.hppc.ObjectObjectHashMap
allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equals, forEach, get, getOrDefault, hashCode, indexExists, indexGet, indexInsert, indexOf, indexReplace, isEmpty, iterator, keys, put, putAll, putAll, putIfAbsent, rehash, release, remove, removeAll, removeAll, removeAll, shiftConflictingKeys, size, toString, values, verifyLoadFactor, visualizeKeyDistribution
-
-
-
-
Constructor Detail
-
ObjectObjectIdentityHashMap
public ObjectObjectIdentityHashMap()
New instance with sane defaults.
-
ObjectObjectIdentityHashMap
public ObjectObjectIdentityHashMap(int expectedElements)
New instance with sane defaults.- Parameters:
expectedElements
- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
ObjectObjectIdentityHashMap
public ObjectObjectIdentityHashMap(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 byObjectObjectHashMap.verifyLoadFactor(double)
.
-
ObjectObjectIdentityHashMap
public ObjectObjectIdentityHashMap(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 byObjectObjectHashMap.verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. SeeHashOrderMixing
for predefined implementations. Use constant mixers only if you understand the potential consequences.
-
ObjectObjectIdentityHashMap
public ObjectObjectIdentityHashMap(ObjectObjectAssociativeContainer<? extends KType,? extends VType> 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:ObjectObjectHashMap
Returns a hash code for the given key.The default implementation mixes the hash of the key with
ObjectObjectHashMap.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 classObjectObjectHashMap<KType,VType>
-
equals
public boolean equals(java.lang.Object v1, java.lang.Object v2)
- Overrides:
equals
in classObjectObjectHashMap<KType,VType>
-
equalElements
protected boolean equalElements(ObjectObjectHashMap<?,?> other)
Description copied from class:ObjectObjectHashMap
Return true if all keys of some other container exist in this container. Equality comparison is performed with this object'sObjectObjectHashMap.equals(Object, Object)
method. Values are compared usingObject.equals(Object)
method.- Overrides:
equalElements
in classObjectObjectHashMap<KType,VType>
-
from
public static <KType,VType> ObjectObjectIdentityHashMap<KType,VType> from(KType[] keys, VType[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
-
-