lib-wc 0.2.0

Will's Programming Toolbox
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

#[cfg(test)]
mod tests {
    use std::collections::BTreeMap;

    /// Range queries are useful for finding all the keys in the map within a given range.
    /// B-Trees are able to process this efficiently because they are sorted.
    #[test]
    fn range_query() {
        let mut map: BTreeMap<usize, usize> = BTreeMap::new();

        for i in 0..100 {
            map.insert(i, i);
        }

        let range = 10..20;

        let mut iter = map.range(range);

        for i in 10..20 {
            assert_eq!(iter.next(), Some((&i, &i)));
        }
    }

    #[test]
    fn insert() {
        let mut t: BTreeMap<usize, usize> = BTreeMap::new();
        assert_eq!(false, t.contains_key(&1));
        t.insert(1, 2);
        assert_eq!(true, t.contains_key(&1));
    }

    #[test]
    fn btree_five() {
        let mut t: BTreeMap<usize, usize> = BTreeMap::new();
        t.insert(1, 2);
        t.insert(2, 3);
        t.insert(3, 4);
        t.insert(4, 5);
        t.insert(5, 6);
        assert_eq!(Some(&2), t.get(&1));
        assert_eq!(Some(&3), t.get(&2));
        assert_eq!(Some(&4), t.get(&3));
        assert_eq!(Some(&5), t.get(&4));
        assert_eq!(Some(&6), t.get(&5));
    }

    #[test]
    fn btree_min() {
        let mut t: BTreeMap<usize, usize> = BTreeMap::new();
        t.insert(1, 2);
        t.insert(2, 3);
        t.insert(3, 4);
        t.insert(4, 5);
        t.insert(5, 6);
        assert_eq!(Some((&1, &2)), t.first_key_value());
    }

    #[test]
    fn btree_max() {
        let mut t: BTreeMap<usize, usize> = BTreeMap::new();
        t.insert(1, 2);
        t.insert(2, 3);
        t.insert(3, 4);
        t.insert(4, 5);
        t.insert(5, 6);
        assert_eq!(Some((&5, &6)), t.last_key_value());
    }
}