Struct competitive_library::structure::segment_tree::SegmentTree

pub struct SegmentTree<M> where
    M: Monoid,  { /* fields omitted */ }

Implementations

impl<M: Monoid> SegmentTree<M>

pub fn new(n: usize) -> SegmentTree<M>

impl<M: Monoid> SegmentTree<M>

pub fn query(&self, l: usize, r: usize) -> M::T

pub fn set(&mut self, p: usize, x: M::T)

pub fn get(&self, i: usize) -> M::T

pub fn max_right<F>(&self, l: usize, f: F) -> usize where
    F: Fn(&M::T) -> bool, 

pub fn min_left<F>(&self, r: usize, f: F) -> usize where
    F: Fn(&M::T) -> bool, 

Trait Implementations

impl<M: Monoid> From<Vec<<M as Monoid>::T, Global>> for SegmentTree<M>

fn from(v: Vec<M::T>) -> Self

Performs the conversion.