core/org.gnit.lucenekmp.util/SparseFixedBitSet

SparseFixedBitSet

class SparseFixedBitSet(length: Int) : BitSet

A bit set that only stores longs that have at least one bit which is set. The way it works is that the space of bits is divided into blocks of 4096 bits, which is 64 longs. Then for each block, we have:

a long[] which stores the non-zero longs for that block
a long so that bit i being set means that the i-th long of the block is non-null, and its offset in the array of longs is the number of one bits on the right of the i-th bit.

Constructors

SparseFixedBitSet

constructor(length: Int)

Types

Companion

object Companion

Properties

bits

val bits: Array<LongArray?>

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).

indices

val indices: LongArray

length

val length: Int

nonZeroLongCount

var nonZeroLongCount: Int

ramBytesUsed

var ramBytesUsed: Long

Functions

applyMask

open fun applyMask(bitSet: FixedBitSet, offset: Int)

Apply this Bits instance to the given FixedBitSet, which starts at the given offset.

approximateCardinality

open override fun approximateCardinality(): Int

Return an approximation of the cardinality of this set. Some implementations may trade accuracy for speed if they have the ability to estimate the cardinality of the set without iterating over all the data. The default implementation returns .cardinality.

cardinality

open override fun cardinality(): Int

Return the number of bits that are set. NOTE: this method is likely to run in linear time

clear

open override fun clear()

Clear all the bits of the set.

open override fun clear(i: Int)

Clear the bit at index i.

open override fun clear(from: Int, to: Int)

Clears a range of bits.

get