Package org.apache.lucene.internal.hppc
Class LongHashSet
java.lang.Object
org.apache.lucene.internal.hppc.LongHashSet
- All Implemented Interfaces:
Cloneable,Iterable<LongCursor>,Accountable
A hash set of
longs, implemented using open addressing with linear probing for
collision resolution.
Mostly forked and trimmed from com.carrotsearch.hppc.LongHashSet
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 ClassesModifier and TypeClassDescriptionprotected final classAn iterator implementation foriterator(). -
Field Summary
FieldsModifier and TypeFieldDescriptionprotected intThe number of stored keys (assigned key slots), excluding the special "empty" key, if any.protected booleanSpecial treatment for the "empty slot" key marker.protected intSeed used to ensure the hash iteration order is different from an iteration to another.long[]The hash array holding keys.protected doubleThe load factor forkeys.protected intMask for slot scans inkeys.protected intFields inherited from interface org.apache.lucene.util.Accountable
NULL_ACCOUNTABLE -
Constructor Summary
ConstructorsConstructorDescriptionNew instance with sane defaults.LongHashSet(int expectedElements) New instance with sane defaults.LongHashSet(int expectedElements, double loadFactor) New instance with the provided defaults.LongHashSet(LongHashSet set) New instance copying elements from another set. -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(long key) final intaddAll(long... elements) Adds all elements from the given list (vararg) to this set.intaddAll(Iterable<? extends LongCursor> iterable) Adds all elements from the given iterable to this set.intaddAll(LongHashSet set) Adds all elements from the given set to this set.protected voidallocateBuffers(int arraySize) Allocate new internal buffers.protected voidallocateThenInsertThenRehash(int slot, long pendingKey) This method is invoked when there is a new key to be inserted into the buffer but there is not enough empty slots to do so.voidclear()clone()booleancontains(long key) voidensureCapacity(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.booleanstatic LongHashSetfrom(long... elements) Create a set from a variable number of arguments or an array oflong.inthashCode()protected inthashKey(long key) Returns a hash code for the given key.booleanindexExists(int index) longindexGet(int index) Returns the exact value of the existing key.voidindexInsert(int index, long key) Inserts a key for an index that is not present in the set.intindexOf(long key) Returns a logical "index" of a given key that can be used to speed up follow-up logic in certain scenarios (conditional logic).voidindexRemove(int index) Removes a key at an index previously acquired fromindexOf(long).longindexReplace(int index, long equivalentKey) Replaces the existing equivalent key with the given one and returns any previous value stored for that key.booleanisEmpty()iterator()protected intProvides the next iteration seed used to build the iteration starting slot and offset increment.longReturn the memory usage of this object in bytes.protected voidrehash(long[] fromKeys) Rehash from old buffers to new buffers.voidrelease()booleanremove(long key) An alias for the (preferred)removeAll(org.apache.lucene.internal.hppc.LongHashSet).intremoveAll(LongHashSet other) Removes all keys present in a given container.protected voidshiftConflictingKeys(int gapSlot) Shift all the slot-conflicting keys allocated to (and including)slot.intsize()long[]toArray()protected doubleverifyLoadFactor(double loadFactor) Validate load factor range and return it.Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface org.apache.lucene.util.Accountable
getChildResourcesMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
keys
public long[] keysThe hash array holding keys. -
assigned
protected int assignedThe number of stored keys (assigned key slots), excluding the special "empty" key, if any.- See Also:
-
mask
protected int maskMask for slot scans inkeys. -
resizeAt
protected int resizeAt -
hasEmptyKey
protected boolean hasEmptyKeySpecial treatment for the "empty slot" key marker. -
loadFactor
protected double loadFactorThe load factor forkeys. -
iterationSeed
protected int iterationSeedSeed used to ensure the hash iteration order is different from an iteration to another.
-
-
Constructor Details
-
LongHashSet
public LongHashSet()New instance with sane defaults. -
LongHashSet
public LongHashSet(int expectedElements) New instance with sane defaults.- Parameters:
expectedElements- The expected number of elements guaranteed not to cause a rehash (inclusive).
-
LongHashSet
public LongHashSet(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).
-
LongHashSet
New instance copying elements from another set.
-
-
Method Details
-
add
public boolean add(long key) -
addAll
public final int addAll(long... elements) Adds all elements from the given list (vararg) to this set.- Returns:
- Returns the number of elements actually added as a result of this call (not previously present in the set).
-
addAll
Adds all elements from the given set to this set.- Returns:
- Returns the number of elements actually added as a result of this call (not previously present in the set).
-
addAll
Adds all elements from the given iterable to this set.- Returns:
- Returns the number of elements actually added as a result of this call (not previously present in the set).
-
toArray
public long[] toArray() -
remove
public boolean remove(long key) An alias for the (preferred)removeAll(org.apache.lucene.internal.hppc.LongHashSet). -
removeAll
Removes all keys present in a given container.- Returns:
- Returns the number of elements actually removed as a result of this call.
-
contains
public boolean contains(long key) -
clear
public void clear() -
release
public void release() -
isEmpty
public boolean isEmpty() -
ensureCapacity
public void ensureCapacity(int expectedElements) Ensure this container can hold at least the given number of elements without resizing its buffers.- Parameters:
expectedElements- The total number of elements, inclusive.
-
size
public int size() -
hashCode
public int hashCode() -
equals
-
clone
-
iterator
- Specified by:
iteratorin interfaceIterable<LongCursor>
-
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
-
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. -
from
Create a set from a variable number of arguments or an array oflong. The elements are copied from the argument to the internal buffer. -
hashKey
protected int hashKey(long key) Returns a hash code for the given key.The output from this function should evenly distribute keys across the entire integer range.
-
indexOf
public int indexOf(long key) Returns a logical "index" of a given key that can be used to speed up follow-up logic in certain scenarios (conditional logic).The semantics of "indexes" are not strictly defined. Indexes may (and typically won't be) contiguous.
The index is valid only between modifications (it will not be affected by read-only operations).
- Parameters:
key- The key to locate in the set.- Returns:
- A non-negative value of the logical "index" of the key in the set or a negative value if the key did not exist.
- See Also:
-
indexExists
public boolean indexExists(int index) - Parameters:
index- The index of a given key, as returned fromindexOf(long).- Returns:
- Returns
trueif the index corresponds to an existing key or false otherwise. This is equivalent to checking whether the index is a positive value (existing keys) or a negative value (non-existing keys). - See Also:
-
indexGet
public long indexGet(int index) Returns the exact value of the existing key. This method makes sense for sets of objects which define custom key-equality relationship.- Parameters:
index- The index of an existing key.- Returns:
- Returns the equivalent key currently stored in the set.
- Throws:
AssertionError- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
indexReplace
public long indexReplace(int index, long equivalentKey) Replaces the existing equivalent key with the given one and returns any previous value stored for that key.- Parameters:
index- The index of an existing key.equivalentKey- The key to put in the set as a replacement. Must be equivalent to the key currently stored at the provided index.- Returns:
- Returns the previous key stored in the set.
- Throws:
AssertionError- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
indexInsert
public void indexInsert(int index, long key) Inserts a key for an index that is not present in the set. This method may help in avoiding double recalculation of the key's hash.- Parameters:
index- The index of a previously non-existing key, as returned fromindexOf(long).- Throws:
AssertionError- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
indexRemove
public void indexRemove(int index) Removes a key at an index previously acquired fromindexOf(long).- Parameters:
index- The index of the key to remove, as returned fromindexOf(long).- Throws:
AssertionError- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
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(long[] fromKeys) 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, long pendingKey) This method is invoked when there is a new key to be inserted into the buffer 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 allocated to (and including)slot.
-