[][src]Struct competitive_programming_rs::data_structure::segment_tree::SegmentTree

pub struct SegmentTree<T, F> { /* fields omitted */ }

Segment Tree for range queries

Methods

impl<T: Copy, F> SegmentTree<T, F> where
    F: Fn(T, T) -> T, 
[src]

pub fn new(size: usize, initial_value: T, f: F) -> SegmentTree<T, F>[src]

pub fn update(&mut self, k: usize, value: T)[src]

pub fn query(&self, a: usize, b: usize) -> T[src]

Get the minimum value in the array in the range [a, b)

Panics

Panics if a >= b.

Auto Trait Implementations

impl<T, F> Send for SegmentTree<T, F> where
    F: Send,
    T: Send

impl<T, F> Sync for SegmentTree<T, F> where
    F: Sync,
    T: Sync

Blanket Implementations

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T> From for T[src]

impl<T, U> TryFrom for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> BorrowMut for T where
    T: ?Sized
[src]