@Generated(date="2015-05-07T09:33:03+0200", value="KTypeVTypeIdentityHashMap.java") public class ObjectIntIdentityHashMap<KType> extends ObjectIntHashMap<KType>
Object to
int.
ObjectIntHashMap.KeysContainer assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values| Constructor and Description |
|---|
ObjectIntIdentityHashMap()
New 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
New instance with the provided defaults.
|
ObjectIntIdentityHashMap(ObjectIntAssociativeContainer
Create a hash map from all key-value pairs of another container.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object
|
static <KType> ObjectIntIdentityHashMap |
from(KType[] keys, int[] 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.
|
addTo, allocateBuffers, allocateThenInsertThenRehash, clear, clone, containsKey, ensureCapacity, equalElements, equals, forEach, 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, visualizeKeyDistributionfinalize, getClass, notify, notifyAll, wait, wait, waitforEach, spliteratorpublic ObjectIntIdentityHashMap()
public ObjectIntIdentityHashMap(int expectedElements)
expectedElements - The expected number of elements guaranteed not to cause buffer expansion (inclusive).
public ObjectIntIdentityHashMap(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
ObjectIntHashMap.verifyLoadFactor(double) .
public ObjectIntIdentityHashMap(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
ObjectIntHashMap.verifyLoadFactor(double) .
orderMixer - Hash key order mixing strategy. See
HashOrderMixing for predefined implementations. Use constant mixers only if you understand the potential consequences.
public ObjectIntIdentityHashMap(ObjectIntAssociativeContainer<? extends KType> container)
public int hashKey(KType key)
ObjectIntHashMap
The default implementation mixes the hash of the key with ObjectIntHashMap 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.
public static <KType> ObjectIntIdentityHashMap<KType> from(KType[] keys, int[] values)