Struct competitive_programming_rs::data_structure::segment_tree::SegmentTree2d

pub struct SegmentTree2d<T, Op> { /* fields omitted */ }

Implementations

impl<T, Op> SegmentTree2d<T, Op> where
    T: Copy,
    Op: Fn(T, T) -> T + Copy, 

pub fn new(h: usize, w: usize, op: Op) -> Self

pub fn update(&mut self, i: usize, j: usize, value: T)

pub fn query(&self, r: Range<usize>, c: Range<usize>) -> Option<T>