qwt 0.4.0

Rust implementation of Quad Wavelet Tree
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
148
149
150
151
152
153
154
155
156
157
158
159

use super::*;
use crate::perf_and_test_utils::{gen_strictly_increasing_sequence, negate_vector};

/// Tests rank1 op by querying every position of a bit set to 1 in the binary vector
/// and the next position.
pub fn test_rank1(ds: &RSNarrow, bv: &BitVector) {
    for (rank, pos) in bv.ones().enumerate() {
        let result = ds.rank1(pos);
        assert_eq!(result, Some(rank));
        let result = ds.rank1(pos + 1);
        dbg!(pos + 1, rank);
        assert_eq!(result, Some(rank + 1));
    }
    let result = ds.rank1(bv.len() + 1);
    assert_eq!(result, None);
}

// Empty bit vector
#[test]
fn test_empty() {
    let bv = BitVector::default();
    let rs = RSNarrow::new(bv);

    assert_eq!(rs.rank1(0), None);
    assert_eq!(rs.rank1(100), None);
}

// Tests a bit vector where the last bit of l2 is set
#[test]
fn test_l2_bound() {
    let vv: Vec<usize> = vec![0, 12, 33, 42, 55, 61, 62, 63, 128, 129, 254, 511];
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    test_rank1(&rs, &rs.bv);
}

#[test]
fn test_n() {
    let vv: Vec<usize> = vec![0, 12, 33, 42, 55, 61, 62, 63];
    let bv: BitVector = vv.iter().copied().collect();

    let rs = RSNarrow::new(bv);

    assert_eq!(rs.rank1(64), Some(8));
}

// Tests a bit vector where the last bit of l1 is set
#[test]
fn test_l1_bound() {
    let vv: Vec<usize> = vec![0, 12, 33, 42, 55, 61, 62, 63, 128, 129, 254, 512 * 128 - 1];
    let bv: BitVector = vv.iter().copied().collect();

    let rs = RSNarrow::new(bv);

    test_rank1(&rs, &rs.bv);
}

// Tests a random bit vector of size 1<<20. This gives 16 blocks in l1.
#[test]
fn test_large_random() {
    let vv = gen_strictly_increasing_sequence(1024 * 4, 1 << 20);
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    test_rank1(&rs, &rs.bv);
}

#[test]
fn test_select1() {
    let vv: Vec<usize> = vec![3, 5, 8, 128, 129, 513];
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    println!("{:?}", rs.bv);
    println!("{:?}", rs.block_rank_pairs);

    let i = 5;
    let selected = rs.select1(i).unwrap();
    println!("select1({}) = {}", i, selected);

    let j = selected;
    println!("rank1({}) = {}", j, rs.rank1(j).unwrap());
}

#[test]
fn test_select0() {
    let vv: Vec<usize> = vec![0, 5, 8, 128, 129, 513];
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    println!("{:?}", rs.bv);
    println!("{:?}", rs.block_rank_pairs);

    let i = 0;
    let selected = rs.select0(i).unwrap();
    println!("select0({}) = {}", i, selected);

    let j = selected;
    println!("rank0({}) = {}", j, rs.rank0(j).unwrap());
}

#[test]
fn test_select0_big() {
    let vv: Vec<usize> = vec![
        3, 5, 8, 128, 129, 513, 1000, 1024, 1025, 4096, 7500, 7600, 7630, 7680, 8000, 8001, 10000,
    ];
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    let zeros_vector = negate_vector(&vv);

    for (i, &el) in zeros_vector.iter().enumerate() {
        // println!("SELECTING {}", i);
        let selected = rs.select0(i);
        assert_eq!(selected, Some(el));
    }
}

#[test]
fn test_select1_big() {
    let vv: Vec<usize> = vec![
        3, 5, 8, 128, 129, 513, 1000, 1024, 1025, 4096, 7500, 7600, 7630, 7680, 8000, 8001, 10000,
    ];
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    for (i, &el) in vv.iter().enumerate() {
        // println!("SELECTING {}", i);
        let selected = rs.select1(i);
        assert_eq!(selected, Some(el));
    }
}

#[test]
fn test_random_select1() {
    let vv: Vec<usize> = gen_strictly_increasing_sequence(10000, 1 << 20);
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    for (i, &el) in vv.iter().enumerate() {
        let selected = rs.select1(i);
        assert_eq!(selected, Some(el));
    }
}

#[test]
fn test_random_select0() {
    let vv: Vec<usize> = gen_strictly_increasing_sequence(10000, 1 << 20);
    let bv: BitVector = vv.iter().copied().collect();
    let rs = RSNarrow::new(bv);

    let zeros_vector = negate_vector(&vv);

    for (i, &el) in zeros_vector.iter().enumerate() {
        let selected = rs.select0(i);
        assert_eq!(selected, Some(el));
    }
}