Execute every indexable leaf through one logical Boolean query engine.
Candidate sets are consumed atomically within explicit budgets, which keeps
the public cursor compact and deterministic. A budget overflow fails
explicitly; it never returns a partial logical result.
Execute every indexable leaf through one logical Boolean query engine.
Candidate sets are consumed atomically within explicit budgets, which keeps the public cursor compact and deterministic. A budget overflow fails explicitly; it never returns a partial logical result.