Struct SeekByRaccCond 

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

Fields

acc: L::Agg

f: F

_marker: PhantomData<fn() -> (Spec, L)>

Implementations

impl<Spec, L, F> SeekByRaccCond<Spec, L, F>

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

pub fn new(f: F) -> Self

Examples found in repository

crates/competitive/src/data_structure/treap.rs (line 451)

    pub fn find_by_racc_cond<F>(&mut self, f: F) -> Option<BstNodeId<TreapSpec<M, L>>>
    where
        F: FnMut(&L::Agg) -> bool,
    {
        let split = Split::new(
            &mut self.root,
            SeekByRaccCond::<TreapSpec<M, L>, L, F>::new(f),
            true,
        );
        let node = split.left()?.rightmost()?;
        self.node_id_manager.registerd_node_id(node)
    }

Trait Implementations

impl<Spec, L, F> BstSeeker for SeekByRaccCond<Spec, L, F>

where Spec: BstSpec<Data: BstDataAccess<LazyMap, Value = LazyMapElement<L>>>, L: LazyMapMonoid, F: FnMut(&L::Agg) -> bool,

type Spec = Spec

fn bst_seek(&mut self, node: BstImmutRef<'_, Self::Spec>) -> Ordering