Struct DocBitset 

pub struct DocBitset { /* private fields */ }

Compact bitset indexed by doc_id. O(1) lookup, ~2.25 MB for 18M docs.

Built from posting lists or predicate scans. Used by BMP filtered queries for fast per-slot predicate evaluation (~2ns per lookup vs ~30-40ns for a fast-field closure).

Implementations

impl DocBitset

pub fn new(num_docs: u32) -> Self

Create an empty bitset for num_docs documents.

pub fn set(&mut self, doc_id: u32)

Set bit for doc_id.

pub fn contains(&self, doc_id: u32) -> bool

Test if doc_id is in the bitset.

pub fn count(&self) -> u32

Number of set bits (matching docs).

pub fn from_predicate(num_docs: u32, pred: &dyn Fn(DocId) -> bool) -> Self

Build bitset from a predicate by scanning all docs. O(N).

pub fn union_with(&mut self, other: &DocBitset)

In-place OR (union): self |= other.

pub fn intersect_with(&mut self, other: &DocBitset)

In-place AND (intersection): self &= other.

pub fn subtract(&mut self, other: &DocBitset)

In-place ANDNOT (subtract): self &= !other.