avltriee 0.77.2

Customized version of AVLTree library.Process the same value in the third branch. One data is immovable from one row, and positional relationships such as left, right, and parent are all referenced by row numbers. No search is required for value reference by specifying a row.
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

use std::collections::HashSet;

use avltriee::{AvltrieeSearch, AvltrieeUpdate};

#[cfg(test)]
const TEST_LENGTH: u32 = 100;
const TEST_VALUE_RANGE_MIN: i64 = 0;
const TEST_VALUE_RANGE_MAX: i64 = 50;

#[test]
fn test_iter() {
    use avltriee::Avltriee;
    use rand::distributions::{Distribution, Uniform};

    let mut t = Avltriee::new();

    let mut rng = rand::thread_rng();
    let die = Uniform::from(TEST_VALUE_RANGE_MIN..=TEST_VALUE_RANGE_MAX);

    for i in 1..=TEST_LENGTH {
        let num = die.sample(&mut rng);
        println!("update:{} {}", i, num);
        t.update(i.try_into().unwrap(), &num);
    }

    let mut deleted: HashSet<u32> = HashSet::new();
    let a = Uniform::from(1..=TEST_LENGTH);
    for _ in 1..=TEST_LENGTH {
        let i = a.sample(&mut rng);
        println!("delete:{}", i);
        deleted.insert(i);
        t.delete(i.try_into().unwrap());
    }

    let mut c = 0;
    for i in t.iter() {
        c += 1;
        println!("{}:{}:{}", c, i, unsafe { t.value_unchecked(i) });
    }
    println!("{}", c);
    assert_eq!(c, TEST_LENGTH as usize - deleted.len());
}

#[test]
fn test_desc_iter() {
    use avltriee::Avltriee;
    use rand::distributions::{Distribution, Uniform};

    let mut t = Avltriee::new();

    let mut rng = rand::thread_rng();
    let die = Uniform::from(TEST_VALUE_RANGE_MIN..=TEST_VALUE_RANGE_MAX);

    for i in 1..=TEST_LENGTH {
        let num = die.sample(&mut rng);
        println!("update:{}", i);
        t.update(i.try_into().unwrap(), &num);
    }

    for i in t.desc_iter() {
        println!("{}:{}", i, unsafe { t.value_unchecked(i) });
    }
}

#[test]
fn test_iter_by_search() {
    use avltriee::Avltriee;
    use rand::distributions::{Distribution, Uniform};

    let len = 10;
    let mut t = Avltriee::new();

    let mut rng = rand::thread_rng();
    let die = Uniform::from(0..=20);

    for i in 1..=len {
        let num = die.sample(&mut rng);
        println!("update:{}", num);
        t.update(i.try_into().unwrap(), &num);
    }

    println!("iter_by(5)");
    for i in t.iter_by(&5) {
        println!("{}:{}", i, unsafe { t.value_unchecked(i) });
    }
    println!("iter_range(3-5)");
    for i in t.iter_range(&3, &5) {
        println!("{}:{}", i, unsafe { t.value_unchecked(i) });
    }

    println!("iter_from(5)");
    for i in t.iter_from(&5) {
        println!("{}:{}", i, unsafe { t.value_unchecked(i) });
    }
    println!("iter_to(5)");
    for i in t.iter_to(&5) {
        println!("{}:{}", i, unsafe { t.value_unchecked(i) });
    }
}

#[test]
fn test_insert_10000() {
    use avltriee::Avltriee;

    const TEST_LENGTH: u32 = 1000000;

    let mut t = Avltriee::new();

    for i in 1..=TEST_LENGTH {
        t.insert(&i);
    }

    println!("OK:{}", 1000000);
}