dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147

use std::ops::*;

use crate::bit_length_with_count_leading_zeros_usize::*;

pub struct DualSegtree<T> {
    node: Vec<T>,
    size: usize,
}

impl<T: Clone + Add<Output = T> + From<i32>> DualSegtree<T> {
    pub fn new(size: usize) -> Self {
        assert!(size > 0);

        let n = size.next_power_of_two();

        let node = vec![0.into(); n << 1];

        Self { node, size }
    }

    pub fn size(&self) -> usize {
        self.size
    }

    fn n(&self) -> usize {
        self.node.len() >> 1
    }

    fn height(&self) -> usize {
        bit_length(self.n())
    }

    fn operate_node(
        &mut self,
        i: usize,
        x: T,
    ) {
        self.node[i] = self.node[i].clone() + x;
    }

    fn propagate(
        &mut self,
        i: usize,
    ) {
        self.operate_node(i << 1, self.node[i].clone());

        self.operate_node(i << 1 | 1, self.node[i].clone());

        self.node[i] = 0.into();
    }

    fn pull(
        &mut self,
        i: usize,
    ) {
        for j in (1..self.height()).rev() {
            self.propagate(i >> j);
        }
    }

    pub fn get(
        &mut self,
        mut i: usize,
    ) -> &mut T {
        assert!(i < self.size());

        i += self.n();

        self.pull(i);

        &mut self.node[i]
    }

    pub fn operate(
        &mut self,
        mut l: usize,
        mut r: usize,
        x: T,
    ) {
        assert!(l <= r && r <= self.size());

        let n = self.n();

        l += n;

        r += n;

        self.pull(l >> l.trailing_zeros());

        self.pull((r >> r.trailing_zeros()) - 1);

        while l < r {
            if l & 1 == 1 {
                self.operate_node(l, x.clone());

                l += 1;
            }

            if r & 1 == 1 {
                r -= 1;

                self.operate_node(r, x.clone());
            }

            l >>= 1;

            r >>= 1;
        }
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let n = 5;

        let mut seg = DualSegtree::<i64>::new(n);

        seg.operate(1, 3, 1);

        assert_eq!(seg.get(0), &0);

        assert_eq!(seg.get(1), &1);

        assert_eq!(seg.get(1), &1);

        assert_eq!(seg.get(0), &0);

        assert_eq!(seg.get(0), &0);

        *seg.get(0) = -1;

        seg.operate(0, 2, -1);

        assert_eq!(seg.get(0), &-2);

        assert_eq!(seg.get(1), &0);

        assert_eq!(seg.get(2), &1);
    }
}