Struct datafrog::FilterAnti

pub struct FilterAnti<'leap, Key, Val, Tuple, Func>where
    Key: Ord + 'leap,
    Val: Ord + 'leap,
    Tuple: Ord,
    Func: Fn(&Tuple) -> (Key, Val),{ /* private fields */ }

Wraps a Relation as a leaper.

Implementations

impl<'leap, Key, Val, Tuple, Func> FilterAnti<'leap, Key, Val, Tuple, Func>where
    Key: Ord + 'leap,
    Val: Ord + 'leap,
    Tuple: Ord,
    Func: Fn(&Tuple) -> (Key, Val),

pub fn from(relation: &'leap Relation<(Key, Val)>, key_func: Func) -> Self

Constructs a FilterAnti from a relation and key and value function.

Trait Implementations

impl<'leap, Key: Ord, Val: Ord + 'leap, Val2, Tuple: Ord, Func> Leaper<'leap, Tuple, Val2> for FilterAnti<'leap, Key, Val, Tuple, Func>where
    Key: Ord + 'leap,
    Val: Ord + 'leap,
    Tuple: Ord,
    Func: Fn(&Tuple) -> (Key, Val),

fn count(&mut self, prefix: &Tuple) -> usize

Estimates the number of proposed values.

fn propose(&mut self, _prefix: &Tuple, _values: &mut Vec<&'leap Val2>)

Populates values with proposed values.

fn intersect(&mut self, _prefix: &Tuple, _values: &mut Vec<&'leap Val2>)

Restricts values to proposed values.

impl<'leap, Key, Val, Tuple, Func> Leapers<'leap, Tuple, ()> for FilterAnti<'leap, Key, Val, Tuple, Func>where
    Key: Ord + 'leap,
    Val: Ord + 'leap,
    Tuple: Ord,
    Func: Fn(&Tuple) -> (Key, Val),

fn for_each_count(&mut self, tuple: &Tuple, op: impl FnMut(usize, usize))

Internal method:

fn propose(&mut self, _: &Tuple, min_index: usize, values: &mut Vec<&'leap ()>)

Internal method:

fn intersect(&mut self, _: &Tuple, min_index: usize, values: &mut Vec<&'leap ()>)

Internal method: