Struct LazySegmentTreeMap

pub struct LazySegmentTreeMap<M>
where
    M: MonoidAction,
    M::Act: PartialEq,
{ /* private fields */ }

Implementations

impl<M> LazySegmentTreeMap<M>

where M: MonoidAction, M::Act: PartialEq,

pub fn new(n: usize) -> Self

pub fn update<R>(&mut self, range: R, x: M::Act)

where R: RangeBounds<usize>,

pub fn fold<R>(&mut self, range: R) -> M::Agg

where R: RangeBounds<usize>,

Examples found in repository

crates/competitive/src/data_structure/lazy_segment_tree_map.rs (line 175)

    pub fn get(&mut self, k: usize) -> M::Agg {
        self.fold(k..k + 1)
    }
    pub fn fold_all(&mut self) -> M::Agg {
        self.fold(0..self.n)
    }

pub fn set(&mut self, k: usize, x: M::Agg)

pub fn get(&mut self, k: usize) -> M::Agg

pub fn fold_all(&mut self) -> M::Agg

pub fn position_acc<R, P>(&mut self, range: R, p: P) -> Option<usize>

where R: RangeBounds<usize>, P: Fn(&M::Agg) -> bool,

Returns the first index that satisfies a accumlative predicate.

pub fn rposition_acc<R, P>(&mut self, range: R, p: P) -> Option<usize>

where R: RangeBounds<usize>, P: Fn(&M::Agg) -> bool,

Returns the last index that satisfies a accumlative predicate.

Trait Implementations

impl<M> Clone for LazySegmentTreeMap<M>

where M: MonoidAction, M::Act: PartialEq,

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<M> Debug for LazySegmentTreeMap<M>

where M: MonoidAction, M::Agg: Debug, M::Act: PartialEq + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.