Struct ExactRowSet 

pub struct ExactRowSet { /* private fields */ }

Exact, byte-bounded row-key set that can outlive one physical operator.

Recursive fixpoint evaluation needs duplicate state to survive across multiple executions of its recursive term. Distinct deliberately resets its state on every open, so this small public carrier exposes the same collision-safe memory-to-disk migration without coupling the engine to the on-disk format.

Implementations

impl ExactRowSet

pub fn new(work_mem_bytes: usize) -> Self

pub fn with_spill_directory( work_mem_bytes: usize, directory: impl Into<PathBuf>, ) -> Self

pub fn insert_row( &mut self, row: &ResultRow, schema: &[String], ) -> ExecResult<bool>

Insert the positional values from row in schema order. Returns true only for the first exact occurrence.

pub fn contains_row( &mut self, row: &ResultRow, schema: &[String], ) -> ExecResult<bool>

pub fn insert_values(&mut self, values: &[Value]) -> ExecResult<bool>

Insert an already-positional SQL value key without constructing a named row. The binary encoding is the same collision-safe, cross-numeric representation used by physical DISTINCT.

pub fn contains_values(&mut self, values: &[Value]) -> ExecResult<bool>

Probe an already-positional SQL value key without constructing a named row. Disk-backed sets perform an exact full-key comparison.

pub fn insert_physical( &mut self, row: &PhysicalRow, schema: &RowSchema, ) -> ExecResult<bool>

Insert a physical row directly in logical schema order without constructing a named row or cloning its values.

pub fn contains_physical( &mut self, row: &PhysicalRow, schema: &RowSchema, ) -> ExecResult<bool>

Probe a physical row directly in logical schema order without constructing a named row or cloning its values.

pub fn has_spilled(&self) -> bool

pub fn in_memory_key_bytes(&self) -> usize