Struct SeekByRaccCond 

struct SeekByRaccCond<F, T>
where
    T: LazyMapMonoid,
{
    acc: T::Agg,
    f: F,
    _marker: PhantomData<fn() -> T>,
}

Fields

acc: T::Agg

f: F

_marker: PhantomData<fn() -> T>

Implementations

impl<F, T> SeekByRaccCond<F, T>

where T: LazyMapMonoid,

fn new(f: F) -> Self

Examples found in repository

crates/competitive/src/data_structure/splay_tree/sequence.rs (line 413)

    pub fn rposition_acc<R, F>(&mut self, range: R, f: F) -> Option<usize>
    where
        R: RangeBounds<usize>,
        F: FnMut(&T::Agg) -> bool,
    {
        let mut range = self.range(range);
        let ord = range.root_mut().splay_by(SeekByRaccCond::new(f));
        if !matches!(ord, Some(Ordering::Equal)) {
            return None;
        }
        let front_size = range.front().size();
        let left_size = range.root().left_size();
        Some(front_size + left_size)
    }

Trait Implementations

impl<F, T> SplaySeeker for SeekByRaccCond<F, T>

where F: FnMut(&T::Agg) -> bool, T: LazyMapMonoid,

type S = LazyAggSplay<T>

fn splay_seek(&mut self, node: NodeRef<Immut<'_>, Self::S>) -> Ordering