Struct BitsetWorklist 

pub struct BitsetWorklist { /* private fields */ }

A simple bitset worklist — O(1) insert/membership, O(words) scan for next.

Sized once (to the constraint count) and reused as scratch across an entire search — the kernel’s Kernel (and the propagate_with/solve_with_given root calls) own one instance and every candidate-value attempt calls clear()/fill_full() (an O(words) sweep, no allocation) instead of constructing a fresh Vec<u64> per call (Pass-1 propagation audit, P2-2).

Implementations

impl BitsetWorklist

pub fn new(capacity: usize) -> Self