com.eignex.kumulant/stat/sketch/BloomFilterResult

BloomFilterResult

@Serializable

@SerialName(value = "BloomFilterResult")

data class BloomFilterResult(val bits: Int, val hashes: Int, val words: LongArray, val totalSeen: Long, val hasher: HasherRef = HasherRef.SplitMix64) : HasObservationCount(source)

Bloom-filter snapshot. words is the bitset packed as bits / 64 longs; merging two snapshots requires identical bits and hashes.

Constructors

BloomFilterResult

constructor(bits: Int, hashes: Int, words: LongArray, totalSeen: Long, hasher: HasherRef = HasherRef.SplitMix64)(source)

Properties

bits

val bits: Int(source)

Total bitset size in bits.

hasher

val hasher: HasherRef(source)

Reference to the LongHasher that produced the bitset; resolved by contains.

hashes

val hashes: Int(source)

Number of hash functions probed per membership query.

totalSeen

val totalSeen: Long(source)

Number of update(value) calls absorbed; informational.

totalWeights

open override val totalWeights: Double(source)

Cumulative weight of observations folded into this result.

words

val words: LongArray(source)

Packed bitset (bits / 64 longs); mergeable via word-wise OR.

isEmpty

open val isEmpty: Boolean

True when no observation has been folded in, so every other field is a placeholder.

Functions

equals

open operator override fun equals(other: Any?): Boolean(source)

hashCode

open override fun hashCode(): Int(source)

toString

open override fun toString(): String(source)

contains

fun BloomFilterResult.contains(value: Long): Boolean

True iff every bit set during an update(value) is still set in words. Re-derives the bit positions with the same LongHasher the filter used (resolved by name via Hashers), so a custom hasher must be registered before querying.