Struct PredicateBytecode 

pub struct PredicateBytecode { /* private fields */ }

Implementations

impl PredicateBytecode

pub fn ops(&self) -> &[PredicateOp]

Read-only view of the lowered op sequence. Useful for tests and for the optional optimizer pass landing in v2.2.

pub fn lower(predicate: &DExpr, base: &DataFrame) -> Option<Self>

Lower a DExpr predicate to bytecode. Returns None if the predicate shape is not supported by the columnar fast path (caller falls through to row-wise evaluation, exactly as the AST-walk path did).

pub fn interpret_sparse( &self, base: &DataFrame, existing_indices: &[usize], nrows: usize, ) -> BitMask

Sparse-aware interpretation (v2.2). Evaluates the predicate over only the rows listed in existing_indices (must be ascending and a subset of 0..nrows). Result bits are set exclusively for indices in the input set, so no final AND with existing_mask is needed — the caller has effectively pre-applied it via index materialization.

Bit-identical to interpret(base, &existing_mask) whenever existing_indices == existing_mask.iter_set().collect(). The win is amortizing per-Cmp cost from O(nrows) to O(|existing_indices|), which is meaningful when the parent selection has already narrowed the row set substantially (typical for chained .filter(...).filter(...)).

Caller is responsible for the density decision (see should_use_sparse_path). Below that threshold, the random-access gather here beats the sequential column scan in interpret.

pub fn evaluate_to_selection( &self, base: &DataFrame, nrows: usize, ) -> AdaptiveSelection

Interpret the bytecode against base, AND-merging the result with existing_mask. Result is bit-identical to AST-walk on every shape lower accepts. Evaluate the predicate without ANDing into an existing mask, classifying the result as an AdaptiveSelection. Used by the v3 Phase 3 production wiring path: when the existing selection is already a Hybrid (mid-band density, large nrows), we want the fresh predicate result to also be classified so the downstream existing.intersect(fresh) call can route through Phase 3’s per-chunk dispatch instead of materialising-and-AND.

Bit-equivalent to interpret followed by AdaptiveSelection:: from_predicate_result(...), but skips the per-call existing-mask AND so the classification reflects the predicate’s own selectivity.

pub fn interpret(&self, base: &DataFrame, existing_mask: &BitMask) -> BitMask

Trait Implementations

impl Clone for PredicateBytecode

fn clone(&self) -> PredicateBytecode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PredicateBytecode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.