prefix-trie 0.9.0

Prefix trie (tree) datastructure (both a set and a map) that provides exact and longest-prefix matches.
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

use super::*;

fn check_iter(
    left: Entries,
    right: Entries,
    left_root: Option<TestPrefix>,
    right_root: Option<TestPrefix>,
) -> bool {
    let (left_map, left_reference) = build_map(left);
    let (right_map, right_reference) = build_map(right);
    let empty_left = PrefixMap::new();
    let empty_right = PrefixMap::new();
    let want = expected_covering_union(&left_reference, &right_reference, left_root, right_root);
    let got = view_or_empty(&left_map, &empty_left, left_root)
        .covering_union(view_or_empty(&right_map, &empty_right, right_root))
        .into_iter()
        .map(|(prefix, item)| (prefix, norm_covering_union(item)))
        .collect::<Vec<_>>();
    got == want
}

fn check_lpm(
    left: Entries,
    right: Entries,
    left_root: Option<TestPrefix>,
    right_root: Option<TestPrefix>,
    query: TestPrefix,
) -> bool {
    let (left_map, left_reference) = build_map(left);
    let (right_map, right_reference) = build_map(right);
    let empty_left = PrefixMap::new();
    let empty_right = PrefixMap::new();
    let entries = expected_covering_union(&left_reference, &right_reference, left_root, right_root);
    let want = lpm_in_view(&entries, &query);
    let got = view_or_empty(&left_map, &empty_left, left_root)
        .covering_union(view_or_empty(&right_map, &empty_right, right_root))
        .find_lpm_value(&query)
        .map(|(prefix, item)| (prefix, norm_covering_union(item)));
    got == want
}

macro_rules! root_root {
    ($iter:ident, $iter_fn:ident, $lpm:ident, $lpm_fn:ident) => {
        qc!($iter, $iter_fn);
        fn $iter_fn((left, right): (Entries, Entries)) -> bool {
            check_iter(left, right, None, None)
        }

        qc!($lpm, $lpm_fn);
        fn $lpm_fn((left, right, query): (Entries, Entries, TestPrefix)) -> bool {
            check_lpm(left, right, None, None, query)
        }
    };
}

macro_rules! root_sub {
    ($iter:ident, $iter_fn:ident, $lpm:ident, $lpm_fn:ident) => {
        qc!($iter, $iter_fn);
        fn $iter_fn((left, right, right_root): (Entries, Entries, TestPrefix)) -> bool {
            check_iter(left, right, None, Some(right_root))
        }

        qc!($lpm, $lpm_fn);
        fn $lpm_fn(
            (left, right, right_root, query): (Entries, Entries, TestPrefix, TestPrefix),
        ) -> bool {
            check_lpm(left, right, None, Some(right_root), query)
        }
    };
}

macro_rules! sub_root {
    ($iter:ident, $iter_fn:ident, $lpm:ident, $lpm_fn:ident) => {
        qc!($iter, $iter_fn);
        fn $iter_fn((left, right, left_root): (Entries, Entries, TestPrefix)) -> bool {
            check_iter(left, right, Some(left_root), None)
        }

        qc!($lpm, $lpm_fn);
        fn $lpm_fn(
            (left, right, left_root, query): (Entries, Entries, TestPrefix, TestPrefix),
        ) -> bool {
            check_lpm(left, right, Some(left_root), None, query)
        }
    };
}

macro_rules! sub_sub {
    ($iter:ident, $iter_fn:ident, $lpm:ident, $lpm_fn:ident) => {
        qc!($iter, $iter_fn);
        fn $iter_fn(
            (left, right, left_root, right_root): (Entries, Entries, TestPrefix, TestPrefix),
        ) -> bool {
            check_iter(left, right, Some(left_root), Some(right_root))
        }

        qc!($lpm, $lpm_fn);
        fn $lpm_fn(
            (left, right, left_root, right_root, query): (
                Entries,
                Entries,
                TestPrefix,
                TestPrefix,
                TestPrefix,
            ),
        ) -> bool {
            check_lpm(left, right, Some(left_root), Some(right_root), query)
        }
    };
}

root_root!(
    covering_union_root_root_iter,
    _covering_union_root_root_iter,
    covering_union_root_root_lpm,
    _covering_union_root_root_lpm
);
root_sub!(
    covering_union_root_sub_iter,
    _covering_union_root_sub_iter,
    covering_union_root_sub_lpm,
    _covering_union_root_sub_lpm
);
sub_root!(
    covering_union_sub_root_iter,
    _covering_union_sub_root_iter,
    covering_union_sub_root_lpm,
    _covering_union_sub_root_lpm
);
sub_sub!(
    covering_union_sub_sub_iter,
    _covering_union_sub_sub_iter,
    covering_union_sub_sub_lpm,
    _covering_union_sub_sub_lpm
);