Struct CompiledGroup 

pub(super) struct CompiledGroup {
    pub driver: Driver,
    pub terms: Vec<CTerm>,
    pub driver_term: Option<CTerm>,
    pub driver_exact: bool,
}

Fields

driver: Driver

terms: Vec<CTerm>

Residual matchers (cost-ordered); the driver’s own condition is fully checked by the sweep and removed from here.

driver_term: Option<CTerm>

The term the driver was built from (None for FullScan/MatchAll). The sweep never reads it — it exists so cached-query refinement can re-evaluate the complete group per candidate (exec::refine), so subsumption sees every condition (subsume.rs), and so the exec can verify it per candidate when the sweep was a superset (below).

driver_exact: bool

False when the source term is case-exact: the folded sweep then over-approximates and driver_term must be verified per candidate.

Implementations

impl CompiledGroup

pub(super) fn all_terms(&self) -> impl Iterator<Item = &CTerm>

Every condition of this AND group: the driver’s source term (most selective, so first) followed by the cost-ordered residuals.

pub(super) fn residual_terms(&self) -> impl Iterator<Item = &CTerm>

The conditions the sweep did not fully check: the residuals, plus the driver’s source term when the sweep was a folded superset.