treez 1.6.0

A collection of useful data structures.
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

use std::mem;
use std::ops::Add;
use std::ops::Sub;

pub struct TreePrefix<V>
where
    V: Add<Output = V> + Sub<Output = V> + Default + Clone,
{
    _buf: Vec<V>,
}

impl<V> TreePrefix<V>
where
    V: Add<Output = V> + Sub<Output = V> + Default + Clone,
{
    pub fn init(num: usize) -> TreePrefix<V> {
        TreePrefix {
            _buf: vec![Default::default(); num + 1],
        }
    }
    pub fn add(&mut self, index: usize, val: V) {
        assert!(index < self._buf.len());
        let mut i = index;
        while i < self._buf.len() {
            let v = self._buf[i].clone();
            self._buf[i] = v + val.clone();
            i += self.lsb(i + 1);
        }
    }
    pub fn set(&mut self, index: usize, val: V) {
        assert!(index < self._buf.len());
        let v = self.get(index);
        self.add(index, val - v);
    }
    pub fn get(&self, index: usize) -> V {
        assert!(index < self._buf.len());
        self.get_interval(index, index + 1)
    }
    pub fn get_interval(&self, index: usize, index_end: usize) -> V {
        assert!(index < self._buf.len());
        assert!(index_end < self._buf.len());

        let mut s = Default::default();
        let mut i = index_end;
        let mut j = index;
        if j > i {
            mem::swap(&mut i, &mut j);
        }
        while i > j {
            // println!("i:{}", i );
            s = s + self._buf[i - 1].clone();
            i = i - self.lsb(i);
        }
        while j > i {
            // println!("j:{}", j );
            s = s - self._buf[j - 1].clone();
            j = j - self.lsb(j);
        }
        s
    }
    pub fn get_interval_start(&self, index: usize) -> V {
        let mut i = index;
        let mut s = Default::default();
        while i > 0 {
            s = s + self._buf[i - 1].clone();
            i = i - self.lsb(i);
        }
        s
    }
    pub fn get_len(&mut self) -> usize {
        self._buf.len() - 1
    }
    fn lsb(&self, v: usize) -> usize {
        let a = !v + 1;
        let b = a & v;
        // println!( "v: {:0>8b}, a: {:0>8b}, b:{:0>8b}", v, a, b );
        b
    }
}

#[test]
fn prefix() {
    let mut t: TreePrefix<isize> = TreePrefix::init(16);
    assert_eq!(t.get_interval(0, 15), 0isize);
    t.set(0, 5);
    assert_eq!(t.get_interval(0, 16), 5isize);
    assert_eq!(t.get_interval(0, 1), 5isize);
    t.set(1, 7);
    assert_eq!(t.get_interval(0, 16), 12isize);
    assert_eq!(t.get_interval(0, 1), 5isize);
    assert_eq!(t.get_interval(1, 2), 7isize);
    assert_eq!(t.get_interval(0, 2), 12isize);
    t.set(10, 4);
    assert_eq!(t.get_interval(0, 16), 16isize);
    assert_eq!(t.get_interval(10, 11), 4isize);
    assert_eq!(t.get_interval(1, 11), 11isize);

    t.set(1, 9);
    assert_eq!(t.get_interval(1, 2), 9isize);
    assert_eq!(t.get_interval(1, 11), 13isize);

    assert_eq!(t.get_interval_start(2), 14isize);
    assert_eq!(t.get_interval_start(11), 18isize);

    t.add(0, 1);
    assert_eq!(t.get_interval_start(2), 15isize);
    assert_eq!(t.get_interval_start(11), 19isize);
}