vebtrees 0.1.0

A Rust implementation of Van Emde Boas trees
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

use vebtree::VEBTree;

use std::time::{Instant, Duration};



#[test]
fn test_contains_correctness(){
    for j in 0..16 {
        let mut test_tree = VEBTree::new(16);
        for i in 0..j {
            test_tree.insert(i);
        }
        for i in 0..j {
            assert!(test_tree.contains(i));
        }
        for i in j..16 {
            assert!(!test_tree.contains(i));
        }
    }
}

#[test]
fn test_search_correctness(){
    for i in 0..16 {
        let mut test_tree = VEBTree::new(16);
        for j in 0..i {
            test_tree.insert(j);
        }
        for j in 0..i {
            println!("{:?}", test_tree.contains(j));
            assert_eq!(test_tree.search(j),Some(j));
        }
    }
}

#[test]
fn test_insert_and_delete_correctness(){
    let mut test_tree = VEBTree::new(16);
    let mut reference_tree = VEBTree::new(16);
    for i in 0..16 {
        test_tree.insert(i);
    }
    for i in 0..16 {
        test_tree.delete(i);
    }
    assert_eq!(test_tree, reference_tree);
}

#[test]
fn test_insert_and_delete_correctness_odd(){
    for i in 17..32 {
        println!("{}", i);
        let mut test_tree = VEBTree::new(i);
        let mut reference_tree = VEBTree::new(i);
        for j in 0..i {
            test_tree.insert(j);
        }
        for j in 0..i {
            test_tree.delete(j);
        }
        assert_eq!(test_tree, reference_tree);
    }
}
#[test]
fn test_minimum_correctness(){
    let mut test_tree = VEBTree::new(16);
    for i in (0..16).rev() {
        test_tree.insert(i);
        assert_eq!(test_tree.minimum(), Some(i));
    }
    for i in 0..15 {
        test_tree.delete(i);
        assert_eq!(test_tree.minimum(), Some(i+1));
    }
    for i in 0..16 {
        test_tree.insert(i);
    }
    for i in 0..16 {
        if i % 2 == 0 {
            test_tree.delete(i);
        } else {
            assert_eq!(test_tree.minimum(), Some(i));
            test_tree.delete(i);
        }
    }
}

#[test]
fn test_maximum_correctness(){
    let mut test_tree = VEBTree::new(16);
    for i in 0..16 {
        test_tree.insert(i);
        assert_eq!(test_tree.maximum(), Some(i));
    }
    for i in (0..16).rev() {
        assert_eq!(test_tree.maximum(), Some(i));
        test_tree.delete(i);
    }
}

#[test]
fn test_findnext_correctness(){
    let mut test_tree = VEBTree::new(16);
    for i in 0..16 {
        if i % 3 == 0 {
            test_tree.insert(i);
        }
    }
    for i in 0..13 {
        if i % 3 == 0 {
            assert_eq!(test_tree.findnext(i), Some(i+3));
        }
    }
}

#[test]
fn test_findprev_correctness(){
    let mut test_tree = VEBTree::new(16);
    for i in 0..16 {
        if i % 3 == 0 {
            test_tree.insert(i);
        }
    }
    for i in 3..16 {
        if i % 3 == 0 {
            assert_eq!(test_tree.findprev(i), Some(i-3));
        }
    }
}