Struct CrackIndex 

pub struct CrackIndex { /* private fields */ }

Adaptive crack index for progressive column partitioning.

Maintains a permutation of row indices and a sorted set of crack points. Each filter operation partitions the relevant region around the predicate pivot, progressively sorting the column across repeated queries.

Only works with numeric columns (values convertible to f64).

Example

let mut crack = CrackIndex::new(column.len());
let gt5 = crack.filter_gt(&column, 5.0);  // partitions around 5.0
let gt3 = crack.filter_gt(&column, 3.0);  // refines: only re-scans [0, 5.0] region

Implementations

impl CrackIndex

pub fn new(len: usize) -> Self

Create a new crack index for a column of len rows.

pub fn num_cracks(&self) -> usize

Number of crack points recorded so far.

pub fn filter_gt(&mut self, column: &Column, value: f64) -> Vec<usize>

Return row indices where column[row] > value.

pub fn filter_lte(&mut self, column: &Column, value: f64) -> Vec<usize>

Return row indices where column[row] <= value.

pub fn filter_gte(&mut self, column: &Column, value: f64) -> Vec<usize>

Return row indices where column[row] >= value.

pub fn filter_lt(&mut self, column: &Column, value: f64) -> Vec<usize>

Return row indices where column[row] < value.

pub fn filter_eq(&mut self, column: &Column, value: f64) -> Vec<usize>

Return row indices where column[row] == value.