Struct CompressedSegmentTree 

pub struct CompressedSegmentTree<M, X, Inner>
where
    M: Monoid,
{
    compress: Vec<X>,
    segs: Vec<Inner>,
    _marker: PhantomData<fn() -> M>,
}

Fields

compress: Vec<X>

segs: Vec<Inner>

_marker: PhantomData<fn() -> M>

Implementations

impl<M, T1> CompressedSegmentTree<M, T1, Tag<M>>

where M: Monoid, T1: Clone + Ord,

pub fn new(points: &[(T1,)]) -> Self

fn from_iter<'a, Iter>(points: Iter) -> Self

where T1: 'a, Iter: IntoIterator<Item = &'a (T1,)> + Clone,

pub fn fold<Q1>(&self, range: &(Q1,)) -> M::T

where Q1: RangeBounds<T1>,

pub fn update(&mut self, key: &(T1,), x: &M::T)

impl<M, T1, T2> CompressedSegmentTree<M, T1, CompressedSegmentTree<M, T2, Tag<M>>>

where M: Monoid, T1: Clone + Ord, T2: Clone + Ord,

pub fn new(points: &[(T1, (T2,))]) -> Self

fn from_iter<'a, Iter>(points: Iter) -> Self

where T1: 'a, T2: 'a, Iter: IntoIterator<Item = &'a (T1, (T2,))> + Clone,

pub fn fold<Q1, Q2>(&self, range: &(Q1, (Q2,))) -> M::T

where Q1: RangeBounds<T1>, Q2: RangeBounds<T2>,

pub fn update(&mut self, key: &(T1, (T2,)), x: &M::T)

impl<M, T1, T2, T3> CompressedSegmentTree<M, T1, CompressedSegmentTree<M, T2, CompressedSegmentTree<M, T3, Tag<M>>>>

where M: Monoid, T1: Clone + Ord, T2: Clone + Ord, T3: Clone + Ord,

pub fn new(points: &[(T1, (T2, (T3,)))]) -> Self

fn from_iter<'a, Iter>(points: Iter) -> Self

where T1: 'a, T2: 'a, T3: 'a, Iter: IntoIterator<Item = &'a (T1, (T2, (T3,)))> + Clone,

pub fn fold<Q1, Q2, Q3>(&self, range: &(Q1, (Q2, (Q3,)))) -> M::T

where Q1: RangeBounds<T1>, Q2: RangeBounds<T2>, Q3: RangeBounds<T3>,

pub fn update(&mut self, key: &(T1, (T2, (T3,))), x: &M::T)

impl<M, T1, T2, T3, T4> CompressedSegmentTree<M, T1, CompressedSegmentTree<M, T2, CompressedSegmentTree<M, T3, CompressedSegmentTree<M, T4, Tag<M>>>>>

where M: Monoid, T1: Clone + Ord, T2: Clone + Ord, T3: Clone + Ord, T4: Clone + Ord,

pub fn new(points: &[(T1, (T2, (T3, (T4,))))]) -> Self

fn from_iter<'a, Iter>(points: Iter) -> Self

where T1: 'a, T2: 'a, T3: 'a, T4: 'a, Iter: IntoIterator<Item = &'a (T1, (T2, (T3, (T4,))))> + Clone,

pub fn fold<Q1, Q2, Q3, Q4>(&self, range: &(Q1, (Q2, (Q3, (Q4,))))) -> M::T

where Q1: RangeBounds<T1>, Q2: RangeBounds<T2>, Q3: RangeBounds<T3>, Q4: RangeBounds<T4>,

pub fn update(&mut self, key: &(T1, (T2, (T3, (T4,)))), x: &M::T)

Trait Implementations

impl<M, X, Inner> Clone for CompressedSegmentTree<M, X, Inner>

where M: Monoid, X: Clone, Inner: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<M, X, Inner> Debug for CompressedSegmentTree<M, X, Inner>

where M: Monoid, X: Debug, Inner: Debug,

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

Formats the value using the given formatter.

impl<M, X, Inner> Default for CompressedSegmentTree<M, X, Inner>

where M: Monoid,

fn default() -> Self

Returns the “default value” for a type.