Package org.apache.lucene.internal.hppc
Class IntDoubleHashMap
- java.lang.Object
-
- org.apache.lucene.internal.hppc.IntDoubleHashMap
-
- All Implemented Interfaces:
Cloneable,Iterable<IntDoubleHashMap.IntDoubleCursor>,Accountable
public class IntDoubleHashMap extends Object implements Iterable<IntDoubleHashMap.IntDoubleCursor>, Accountable, Cloneable
A hash map ofinttodouble, implemented using open addressing with linear probing for collision resolution.Mostly forked and trimmed from com.carrotsearch.hppc.IntDoubleHashMap
github: https://github.com/carrotsearch/hppc release 0.10.0
- NOTE: This API is for internal purposes only and might change in incompatible ways in the next release.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static classIntDoubleHashMap.IntDoubleCursorForked from HPPC, holding int index,key and valueclassIntDoubleHashMap.KeysContainerA view of the keys inside this hash map.classIntDoubleHashMap.ValuesContainerA view over the set of values of this map.
-
Field Summary
Fields Modifier and Type Field Description protected intassignedThe number of stored keys (assigned key slots), excluding the special "empty" key, if any (usesize()instead).protected booleanhasEmptyKeySpecial treatment for the "empty slot" key marker.protected intiterationSeedSeed used to ensure the hash iteration order is different from an iteration to another.int[]keysThe array holding keys.protected doubleloadFactorThe load factor forkeys.protected intmaskMask for slot scans inkeys.protected intresizeAtdouble[]valuesThe array holding values.-
Fields inherited from interface org.apache.lucene.util.Accountable
NULL_ACCOUNTABLE
-
-
Constructor Summary
Constructors Constructor Description IntDoubleHashMap()New instance with sane defaults.IntDoubleHashMap(int expectedElements)New instance with sane defaults.IntDoubleHashMap(int expectedElements, double loadFactor)New instance with the provided defaults.IntDoubleHashMap(IntDoubleHashMap map)Create a hash map from all key-value pairs of another map.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description doubleaddTo(int key, double incrementValue)AddsincrementValueto any existing value for the givenkeyor insertsincrementValueifkeydid not previously exist.protected voidallocateBuffers(int arraySize)Allocate new internal buffers.protected voidallocateThenInsertThenRehash(int slot, int pendingKey, double pendingValue)This method is invoked when there is a new key/ value pair to be inserted into the buffers but there is not enough empty slots to do so.voidclear()IntDoubleHashMapclone()booleancontainsKey(int key)voidensureCapacity(int expectedElements)Ensure this container can hold at least the given number of keys (entries) without resizing its buffers.protected booleanequalElements(IntDoubleHashMap other)Return true if all keys of some other container exist in this container.booleanequals(Object obj)static IntDoubleHashMapfrom(int[] keys, double[] values)Creates a hash map from two index-aligned arrays of key-value pairs.doubleget(int key)doublegetOrDefault(int key, double defaultValue)inthashCode()protected inthashKey(int key)Returns a hash code for the given key.booleanindexExists(int index)doubleindexGet(int index)voidindexInsert(int index, int key, double value)intindexOf(int key)doubleindexRemove(int index)doubleindexReplace(int index, double newValue)booleanisEmpty()Iterator<IntDoubleHashMap.IntDoubleCursor>iterator()IntDoubleHashMap.KeysContainerkeys()Returns a specialized view of the keys of this associated container.protected intnextIterationSeed()Provides the next iteration seed used to build the iteration starting slot and offset increment.doubleput(int key, double value)intputAll(Iterable<? extends IntDoubleHashMap.IntDoubleCursor> iterable)booleanputIfAbsent(int key, double value)Trove-inspired API method.doubleputOrAdd(int key, double putValue, double incrementValue)Ifkeyexists,putValueis inserted into the map, otherwise any existing value is incremented byadditionValue.longramBytesUsed()Return the memory usage of this object in bytes.protected voidrehash(int[] fromKeys, double[] fromValues)Rehash from old buffers to new buffers.voidrelease()doubleremove(int key)protected voidshiftConflictingKeys(int gapSlot)Shift all the slot-conflicting keys and values allocated to (and including)slot.intsize()StringtoString()Convert the contents of this map to a human-friendly string.IntDoubleHashMap.ValuesContainervalues()protected doubleverifyLoadFactor(double loadFactor)Validate load factor range and return it.-
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.apache.lucene.util.Accountable
getChildResources
-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
-
-
-
Field Detail
-
keys
public int[] keys
The array holding keys.
-
values
public double[] values
The array holding values.
-
assigned
protected int assigned
The number of stored keys (assigned key slots), excluding the special "empty" key, if any (usesize()instead).- See Also:
size()
-
mask
protected int mask
Mask for slot scans inkeys.
-
resizeAt
protected int resizeAt
-
hasEmptyKey
protected boolean hasEmptyKey
Special treatment for the "empty slot" key marker.
-
loadFactor
protected double loadFactor
The load factor forkeys.
-
iterationSeed
protected int iterationSeed
Seed used to ensure the hash iteration order is different from an iteration to another.
-
-
Constructor Detail
-
IntDoubleHashMap
public IntDoubleHashMap()
New instance with sane defaults.
-
IntDoubleHashMap
public IntDoubleHashMap(int expectedElements)
New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause buffer expansion (inclusive).
-
IntDoubleHashMap
public IntDoubleHashMap(int expectedElements, double loadFactor)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 byverifyLoadFactor(double).
-
IntDoubleHashMap
public IntDoubleHashMap(IntDoubleHashMap map)
Create a hash map from all key-value pairs of another map.
-
-
Method Detail
-
put
public double put(int key, double value)
-
putAll
public int putAll(Iterable<? extends IntDoubleHashMap.IntDoubleCursor> iterable)
-
putIfAbsent
public boolean putIfAbsent(int key, double value)Trove-inspired API method. An equivalent of the following code:if (!map.containsKey(key)) map.put(value);
- Parameters:
key- The key of the value to check.value- The value to put ifkeydoes not exist.- Returns:
trueifkeydid not exist andvaluewas placed in the map.
-
putOrAdd
public double putOrAdd(int key, double putValue, double incrementValue)Ifkeyexists,putValueis inserted into the map, otherwise any existing value is incremented byadditionValue.- Parameters:
key- The key of the value to adjust.putValue- The value to put ifkeydoes not exist.incrementValue- The value to add to the existing value ifkeyexists.- Returns:
- Returns the current value associated with
key(after changes).
-
addTo
public double addTo(int key, double incrementValue)AddsincrementValueto any existing value for the givenkeyor insertsincrementValueifkeydid not previously exist.- Parameters:
key- The key of the value to adjust.incrementValue- The value to put or add to the existing value ifkeyexists.- Returns:
- Returns the current value associated with
key(after changes).
-
remove
public double remove(int key)
-
get
public double get(int key)
-
getOrDefault
public double getOrDefault(int key, double defaultValue)
-
containsKey
public boolean containsKey(int key)
-
indexOf
public int indexOf(int key)
-
indexExists
public boolean indexExists(int index)
-
indexGet
public double indexGet(int index)
-
indexReplace
public double indexReplace(int index, double newValue)
-
indexInsert
public void indexInsert(int index, int key, double value)
-
indexRemove
public double indexRemove(int index)
-
clear
public void clear()
-
release
public void release()
-
size
public int size()
-
isEmpty
public boolean isEmpty()
-
equalElements
protected boolean equalElements(IntDoubleHashMap other)
Return true if all keys of some other container exist in this container.
-
ensureCapacity
public void ensureCapacity(int expectedElements)
Ensure this container can hold at least the given number of keys (entries) without resizing its buffers.- Parameters:
expectedElements- The total number of keys, inclusive.
-
nextIterationSeed
protected int nextIterationSeed()
Provides the next iteration seed used to build the iteration starting slot and offset increment. This method does not need to be synchronized, what matters is that each thread gets a sequence of varying seeds.
-
ramBytesUsed
public long ramBytesUsed()
Description copied from interface:AccountableReturn the memory usage of this object in bytes. Negative values are illegal.- Specified by:
ramBytesUsedin interfaceAccountable
-
iterator
public Iterator<IntDoubleHashMap.IntDoubleCursor> iterator()
- Specified by:
iteratorin interfaceIterable<IntDoubleHashMap.IntDoubleCursor>
-
keys
public IntDoubleHashMap.KeysContainer keys()
Returns a specialized view of the keys of this associated container.
-
values
public IntDoubleHashMap.ValuesContainer values()
- Returns:
- Returns a container with all values stored in this map.
-
clone
public IntDoubleHashMap clone()
-
toString
public String toString()
Convert the contents of this map to a human-friendly string.
-
from
public static IntDoubleHashMap from(int[] keys, double[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
-
hashKey
protected int hashKey(int key)
Returns a hash code for the given key.The output from this function should evenly distribute keys across the entire integer range.
-
verifyLoadFactor
protected double verifyLoadFactor(double loadFactor)
Validate load factor range and return it. Override and suppress if you need insane load factors.
-
rehash
protected void rehash(int[] fromKeys, double[] fromValues)Rehash from old buffers to new buffers.
-
allocateBuffers
protected void allocateBuffers(int arraySize)
Allocate new internal buffers. This method attempts to allocate and assign internal buffers atomically (either allocations succeed or not).
-
allocateThenInsertThenRehash
protected void allocateThenInsertThenRehash(int slot, int pendingKey, double pendingValue)This method is invoked when there is a new key/ value pair to be inserted into the buffers but there is not enough empty slots to do so.New buffers are allocated. If this succeeds, we know we can proceed with rehashing so we assign the pending element to the previous buffer (possibly violating the invariant of having at least one empty slot) and rehash all keys, substituting new buffers at the end.
-
shiftConflictingKeys
protected void shiftConflictingKeys(int gapSlot)
Shift all the slot-conflicting keys and values allocated to (and including)slot.
-
-