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
use astro_format::IntoBytes;
use super::RadixTree;
impl<K, V> RadixTree<K, V>
where
K: Eq + std::hash::Hash + Clone + std::cmp::Ord + IntoBytes + std::fmt::Debug,
V: Clone + IntoBytes + std::fmt::Debug,
{
pub fn search<I>(&self, key: I) -> Option<&V>
where
I: IntoIterator<Item = K>,
{
let mut current_node_hash_opt = Some(&self.root);
let mut key_parts = key.into_iter().peekable();
while let Some(current_node_hash) = current_node_hash_opt {
let current_key_part_opt = key_parts.next();
if let Some(node) = self.nodes.get(current_node_hash) {
if node.key.is_empty() {
if key_parts.peek().is_none() {
return node.value.as_ref();
} else {
if let Some(current_key_part) = current_key_part_opt {
if let Some(next_node_hash) = node.children.get(¤t_key_part) {
current_node_hash_opt = Some(next_node_hash);
continue;
} else {
return None;
}
} else {
return None;
}
}
} else {
let mut node_key_iter = node.key.iter().peekable();
if current_key_part_opt.as_ref() != node_key_iter.next() {
return None;
}
while let Some(node_key_part) = node_key_iter.next() {
if Some(node_key_part) != key_parts.peek() {
return None
} else {
key_parts.next();
}
}
if let Some(next_key_part) = key_parts.peek() {
if let Some(next_node_hash) = node.children.get(&next_key_part) {
current_node_hash_opt = Some(next_node_hash);
key_parts.next();
} else {
return None;
}
} else {
return node.value.as_ref();
}
}
} else {
return None;
}
}
None
}
}