Struct Compressed Segment Tree &nbsp; Copy item path

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

Examples found in repository ?

crates/library_checker/src/data_structure/point_add_rectangle_sum.rs (line 30)

14pub fn point_add_rectangle_sum(reader: impl Read, mut writer: impl Write) {
15    let s = read_all_unchecked(reader);
16    let mut scanner = Scanner::new(&s);
17    scan!(scanner, n, q, xyw: [(u32, u32, u64); n], queries: [Query; q]);
18    let points: Vec<_> = xyw
19        .iter()
20        .map(|&(x, y, _)| (x, (y,)))
21        .chain(queries.iter().filter_map(|&query| {
22            if let Query::Add { x, y, .. } = query {
23                Some((x, (y,)))
24            } else {
25                None
26            }
27        }))
28        .collect();
29
30    let mut seg = CompressedSegmentTree2d::<AdditiveOperation<u64>, _, _>::new(&points);
31    for &(x, y, w) in &xyw {
32        seg.update(&(x, (y,)), &w);
33    }
34
35    for query in queries {
36        match query {
37            Query::Add { x, y, w } => {
38                seg.update(&(x, (y,)), &w);
39            }
40            Query::Sum { l, d, r, u } => {
41                let ans = seg.fold(&(l..r, (d..u,)));
42                writeln!(writer, "{}", ans).ok();
43            }
44        }
45    }
46}

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>,

Examples found in repository ?

crates/library_checker/src/data_structure/point_add_rectangle_sum.rs (line 41)

14pub fn point_add_rectangle_sum(reader: impl Read, mut writer: impl Write) {
15    let s = read_all_unchecked(reader);
16    let mut scanner = Scanner::new(&s);
17    scan!(scanner, n, q, xyw: [(u32, u32, u64); n], queries: [Query; q]);
18    let points: Vec<_> = xyw
19        .iter()
20        .map(|&(x, y, _)| (x, (y,)))
21        .chain(queries.iter().filter_map(|&query| {
22            if let Query::Add { x, y, .. } = query {
23                Some((x, (y,)))
24            } else {
25                None
26            }
27        }))
28        .collect();
29
30    let mut seg = CompressedSegmentTree2d::<AdditiveOperation<u64>, _, _>::new(&points);
31    for &(x, y, w) in &xyw {
32        seg.update(&(x, (y,)), &w);
33    }
34
35    for query in queries {
36        match query {
37            Query::Add { x, y, w } => {
38                seg.update(&(x, (y,)), &w);
39            }
40            Query::Sum { l, d, r, u } => {
41                let ans = seg.fold(&(l..r, (d..u,)));
42                writeln!(writer, "{}", ans).ok();
43            }
44        }
45    }
46}

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

Examples found in repository ?

crates/library_checker/src/data_structure/point_add_rectangle_sum.rs (line 32)

14pub fn point_add_rectangle_sum(reader: impl Read, mut writer: impl Write) {
15    let s = read_all_unchecked(reader);
16    let mut scanner = Scanner::new(&s);
17    scan!(scanner, n, q, xyw: [(u32, u32, u64); n], queries: [Query; q]);
18    let points: Vec<_> = xyw
19        .iter()
20        .map(|&(x, y, _)| (x, (y,)))
21        .chain(queries.iter().filter_map(|&query| {
22            if let Query::Add { x, y, .. } = query {
23                Some((x, (y,)))
24            } else {
25                None
26            }
27        }))
28        .collect();
29
30    let mut seg = CompressedSegmentTree2d::<AdditiveOperation<u64>, _, _>::new(&points);
31    for &(x, y, w) in &xyw {
32        seg.update(&(x, (y,)), &w);
33    }
34
35    for query in queries {
36        match query {
37            Query::Add { x, y, w } => {
38                seg.update(&(x, (y,)), &w);
39            }
40            Query::Sum { l, d, r, u } => {
41                let ans = seg.fold(&(l..r, (d..u,)));
42                writeln!(writer, "{}", ans).ok();
43            }
44        }
45    }
46}

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. Read more

1.0.0 · Source§

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

Performs copy-assignment from source. Read more

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. Read more

impl<M, X, Inner> Default for CompressedSegmentTree<M, X, Inner>
where M: Monoid,

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

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

impl<M, X, Inner> RefUnwindSafe for CompressedSegmentTree<M, X, Inner>
where X: RefUnwindSafe, Inner: RefUnwindSafe,

impl<M, X, Inner> Send for CompressedSegmentTree<M, X, Inner>
where X: Send, Inner: Send,

impl<M, X, Inner> Sync for CompressedSegmentTree<M, X, Inner>
where X: Sync, Inner: Sync,

impl<M, X, Inner> Unpin for CompressedSegmentTree<M, X, Inner>
where X: Unpin, Inner: Unpin,

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

impl<M, X, Inner> UnwindSafe for CompressedSegmentTree<M, X, Inner>
where X: UnwindSafe, Inner: UnwindSafe,

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> CloneToUninit for T
where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)

Performs copy-assignment from self to dest. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

type Owned = T

The resulting type after obtaining ownership.

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

impl<T, U> TryInto for T
where U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.