@Generated(date="2015-05-05T11:00:01+0200", value="KTypeVTypeIdentityHashMap.java") public class ObjectShortIdentityHashMap<KType> extends ObjectShortHashMap<KType>
Object
to short
.ObjectShortHashMap.KeysContainer
assigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt, values
Constructor and Description |
---|
ObjectShortIdentityHashMap()
New instance with sane defaults.
|
ObjectShortIdentityHashMap(int expectedElements)
New instance with sane defaults.
|
ObjectShortIdentityHashMap(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
ObjectShortIdentityHashMap(int expectedElements,
double loadFactor,
HashOrderMixingStrategy orderMixer)
New instance with the provided defaults.
|
ObjectShortIdentityHashMap(ObjectShortAssociativeContainer<? extends KType> container)
Create a hash map from all key-value pairs of another container.
|
Modifier and Type | Method and Description |
---|---|
boolean |
equals(java.lang.Object v1,
java.lang.Object v2) |
static <KType> ObjectShortIdentityHashMap<KType> |
from(KType[] keys,
short[] 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
public ObjectShortIdentityHashMap()
public ObjectShortIdentityHashMap(int expectedElements)
expectedElements
- The expected number of elements guaranteed not to cause buffer
expansion (inclusive).public ObjectShortIdentityHashMap(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 ObjectShortHashMap.verifyLoadFactor(double)
.public ObjectShortIdentityHashMap(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 ObjectShortHashMap.verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. See HashOrderMixing
for predefined
implementations. Use constant mixers only if you understand the potential
consequences.public ObjectShortIdentityHashMap(ObjectShortAssociativeContainer<? extends KType> container)
public int hashKey(KType key)
ObjectShortHashMap
The default implementation mixes the hash of the key with ObjectShortHashMap.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 ObjectShortHashMap<KType>
public boolean equals(java.lang.Object v1, java.lang.Object v2)
equals
in class ObjectShortHashMap<KType>
public static <KType> ObjectShortIdentityHashMap<KType> from(KType[] keys, short[] values)
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.