@Generated(date="2015-05-05T11:00:01+0200", value="KTypeVTypeIdentityHashMap.java") public class ObjectObjectIdentityHashMap<KType,VType> extends ObjectObjectHashMap<KType,VType>
Object
to Object
.ObjectObjectHashMap.KeysContainer
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
Constructor and 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.
|
Modifier and Type | Method and 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> |
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.
|
allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equals, forEach, 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
public ObjectObjectIdentityHashMap()
public ObjectObjectIdentityHashMap(int expectedElements)
expectedElements
- The expected number of elements guaranteed not to cause buffer
expansion (inclusive).public ObjectObjectIdentityHashMap(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 ObjectObjectHashMap.verifyLoadFactor(double)
.public ObjectObjectIdentityHashMap(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 ObjectObjectHashMap.verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. See HashOrderMixing
for predefined
implementations. Use constant mixers only if you understand the potential
consequences.public ObjectObjectIdentityHashMap(ObjectObjectAssociativeContainer<? extends KType,? extends VType> container)
public int hashKey(KType key)
ObjectObjectHashMap
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.
hashKey
in class ObjectObjectHashMap<KType,VType>
public boolean equals(java.lang.Object v1, java.lang.Object v2)
equals
in class ObjectObjectHashMap<KType,VType>
protected boolean equalElements(ObjectObjectHashMap<?,?> other)
ObjectObjectHashMap
ObjectObjectHashMap.equals(Object, Object)
method.
Values are compared using Object.equals(Object)
method.equalElements
in class ObjectObjectHashMap<KType,VType>
public static <KType,VType> ObjectObjectIdentityHashMap<KType,VType> from(KType[] keys, VType[] values)
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.