Struct TreeRowFilter 

pub struct TreeRowFilter<K: ItemKey, T> { /* private fields */ }

A reusable sort + tree-aware filter over a Vec<TreeRow<K, T>>. Build it once, apply it to each freshly-sourced row stream (e.g. inside a TreeDataSlice::set_source closure). See the module docs.

Implementations

impl<K: ItemKey, T: 'static> TreeRowFilter<K, T>

pub fn new() -> Self

An identity transform (no filter, no sort). Chain filter / sort to configure it.

pub fn filter_mode(self, mode: TreeFilterMode) -> Self

Set the filter strategy (how ancestors/descendants of a match are kept). Defaults to TreeFilterMode::default().

pub fn filter(self, pred: impl Fn(&T) -> bool + 'static) -> Self

Set the match predicate over the row item. A row “matches” when pred returns true; the filter_mode decides what else stays visible. With no predicate every row is kept.

pub fn sort(self, cmp: impl Fn(&T, &T) -> Ordering + 'static) -> Self

Sort siblings (ascending) by a comparator on the row item. Parent/child structure is preserved — only the order within each parent changes.

pub fn sort_desc(self, cmp: impl Fn(&T, &T) -> Ordering + 'static) -> Self

Sort siblings (descending) by a comparator on the row item.

pub fn apply(&self, rows: Vec<TreeRow<K, T>>) -> Vec<TreeRow<K, T>>

Apply the filter + sort to an indent-ordered row stream, returning a new indent-ordered stream. O(n log n) for the sort, O(n) otherwise.

Trait Implementations

impl<K: ItemKey, T: 'static> Default for TreeRowFilter<K, T>

fn default() -> Self

Returns the “default value” for a type.