core/org.gnit.lucenekmp.internal.hppc/IntHashSet

IntHashSet

class IntHashSet @JvmOverloads constructor(expectedElements: Int, loadFactor: Double = DEFAULT_LOAD_FACTOR.toDouble()) : Iterable<IntCursor?> , Accountable, Cloneable<IntHashSet>

A hash set of ints, implemented using open addressing with linear probing for collision resolution.

Mostly forked and trimmed from com.carrotsearch.hppc.IntHashSet

github: https://github.com/carrotsearch/hppc release 0.10.0

Constructors

IntHashSet

@JvmOverloads

constructor(expectedElements: Int, loadFactor: Double = DEFAULT_LOAD_FACTOR.toDouble())

constructor()

New instance with sane defaults.

constructor(set: IntHashSet)

New instance copying elements from another set.

constructor(collection: MutableCollection<Int>)

New instance copying elements from another collection.

Types

Companion

object Companion

Properties

childResources

open val childResources: MutableCollection<Accountable>

Returns nested resources of this class. The result should be a point-in-time snapshot (to avoid race conditions).

isEmpty

val isEmpty: Boolean

keys

var keys: IntArray?

The hash array holding keys.

Functions

add

fun add(key: Int): Boolean

addAll

fun addAll(iterable: Iterable<out IntCursor>): Int

Adds all elements from the given iterable to this set.

fun addAll(collection: MutableCollection<Int>): Int

fun addAll(set: IntHashSet): Int

Adds all elements from the given set to this set.

fun addAll(vararg elements: Int): Int

Adds all elements from the given list (vararg) to this set.

clear

fun clear()

clone

open override fun clone(): IntHashSet

contains

fun contains(key: Int): Boolean

ensureCapacity

fun ensureCapacity(expectedElements: Int)

Ensure this container can hold at least the given number of elements without resizing its buffers.

equals

open operator override fun equals(obj: Any?): Boolean

hashCode

open override fun hashCode(): Int

indexExists

fun indexExists(index: Int): Boolean

indexGet

fun indexGet(index: Int): Int

Returns the exact value of the existing key. This method makes sense for sets of objects which define custom key-equality relationship.

indexInsert

fun indexInsert(index: Int, key: Int)

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.

indexOf

fun indexOf(key: Int): Int

Returns a logical "index" of a given key that can be used to speed up follow-up logic in certain scenarios (conditional logic).

indexRemove

fun indexRemove(index: Int)

Removes a key at an index previously acquired from .indexOf.

indexReplace

fun indexReplace(index: Int, equivalentKey: Int): Int

Replaces the existing equivalent key with the given one and returns any previous value stored for that key.

iterator

open operator override fun iterator(): MutableIterator<IntCursor?>

ramBytesUsed

open override fun ramBytesUsed(): Long

Return the memory usage of this object in bytes. Negative values are illegal.

release

fun release()

remove

fun remove(key: Int): Boolean

An alias for the (preferred) .removeAll.

removeAll

fun removeAll(other: IntHashSet): Int

Removes all keys present in a given container.

size

fun size(): Int

toArray

fun toArray(): IntArray