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

pub struct Segtree {
    pub size: usize,
    inf: i64,
    pub(crate) node: Vec<i64>,
}

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

    fn merge(
        &mut self,
        i: usize,
    ) {
        self.node[i] = self.node[i << 1].min(self.node[i << 1 | 1]);
    }

    pub fn new(
        inf: i64,
        size: usize,
    ) -> Self {
        assert!(size > 0);

        let node = vec![inf; size.next_power_of_two() << 1];

        Self { inf, size, node }
    }

    pub fn set(
        &mut self,
        mut i: usize,
        x: i64,
    ) {
        assert!(i < self.size);

        i += self.n();

        self.node[i] = x;

        while i > 1 {
            i >>= 1;

            self.merge(i);
        }
    }

    pub fn fold(
        &self,
        mut l: usize,
        mut r: usize,
    ) -> i64 {
        assert!(l <= r && r <= self.size);

        let mut vl = self.inf;

        let mut vr = self.inf;

        let n = self.n();

        l += n;

        r += n;

        while l < r {
            if l & 1 == 1 {
                vl = vl.min(self.node[l]);

                l += 1;
            }

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

                vr = self.node[r].min(vr);
            }

            l >>= 1;

            r >>= 1;
        }

        vl.min(vr)
    }
}

use std::ops::*;

impl Index<usize> for Segtree {
    type Output = i64;

    fn index(
        &self,
        i: usize,
    ) -> &Self::Output {
        &self.node[i + self.n()]
    }
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}