Struct SqrtDecomposition

pub struct SqrtDecomposition<G: Monoid> { /* private fields */ }

Implementations

impl<G: Monoid> SqrtDecomposition<G>

where G::T: Clone,

pub fn size(&self) -> usize

pub fn interval(&self) -> usize

pub fn new(g: G, size: usize) -> Self

pub fn set(&mut self, i: usize, x: G::T)

pub fn fold(&self, l: usize, r: usize) -> G::T

pub fn max_right<F>(&self, is_ok: F, l: usize) -> usize

where F: Fn(&G::T) -> bool,

pub fn min_left<F>(&self, is_ok: F, r: usize) -> usize

where F: Fn(&G::T) -> bool,

Trait Implementations

impl<G: Monoid> From<(G, &[<G as Monoid>::T])> for SqrtDecomposition<G>

where G::T: Clone,

fn from(p: (G, &[G::T])) -> Self

Converts to this type from the input type.

impl<G: Monoid> Index<usize> for SqrtDecomposition<G>

type Output = <G as Monoid>::T

The returned type after indexing.

fn index(&self, i: usize) -> &Self::Output

Performs the indexing (container[index]) operation.