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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
use std::collections::BTreeMap;
use astro_format::IntoBytes;
use super::{RadixTree, RadixNode};
impl<K, V> RadixTree<K, V>
where
K: Eq + std::hash::Hash + Clone + std::cmp::Ord + IntoBytes,
V: Clone + IntoBytes,
{
pub fn insert<I>(&mut self, key: I, value: V)
where I: IntoIterator<Item = K>, {
let mut current_node_hash = self.root;
if self.root == [0;32] {
let key_vec: Vec<K> = key.into_iter().collect();
let new_node = RadixNode {
children: BTreeMap::new(),
key: key_vec,
value: Some(value.clone()),
};
let new_node_hash = new_node.hash();
self.nodes.insert(new_node_hash, new_node);
self.root = new_node_hash
} else {
let mut key_iter = key.into_iter().peekable();
while let Some(k) = key_iter.next() {
let current_node_key_opt = match self.nodes.get(¤t_node_hash) {
Some(current_node) => Some(current_node.key.clone()),
None => None,
};
if let Some(current_node_key) = current_node_key_opt {
if key_iter.peek().is_none() {
if let Some(current_node) = self.nodes.get_mut(¤t_node_hash) {
current_node.value = Some(value);
self.rehash(¤t_node_hash);
}
return;
} else {
let mut split_position = 0;
let mut matched = true;
let mut current_node_key_iter = current_node_key.iter();
if Some(&k) != current_node_key_iter.next() {
matched = false;
} else {
split_position += 1;
}
while let Some(ck) = current_node_key_iter.next() {
if let Some(next_key_part) = key_iter.peek() {
if next_key_part == ck {
key_iter.next();
} else {
matched = false;
break;
}
split_position += 1;
} else {
matched = false;
break;
}
}
if matched {
if let Some(current_node) = self.nodes.get_mut(¤t_node_hash) {
current_node.value = Some(value);
}
self.rehash(¤t_node_hash);
return;
} else if split_position != 0 {
match self.split_node(current_node_hash, split_position) {
Ok((left_node_hash, _right_node_hash)) => {
current_node_hash = left_node_hash;
let child_key = key_iter.next().unwrap();
let mut new_node_key = vec![];
if key_iter.peek().is_some() {
while let Some(key_part) = key_iter.next() {
new_node_key.push(key_part);
}
};
let new_node = RadixNode {
children: BTreeMap::new(),
key: new_node_key,
value: Some(value.clone()),
};
let new_node_hash = new_node.hash();
self.nodes.insert(new_node_hash, new_node);
if let Some(left_node) = self.nodes.get_mut(&left_node_hash) {
left_node.children.insert(child_key, new_node_hash);
}
self.parents.insert(new_node_hash, current_node_hash);
self.rehash(¤t_node_hash);
},
Err(e) => {
eprintln!("{}", e);
return;
}
}
} else {
let mut new_node_key = vec![];
if key_iter.peek().is_some() {
while let Some(key_part) = key_iter.next() {
new_node_key.push(key_part);
}
};
let new_node = RadixNode {
children: BTreeMap::new(),
key: new_node_key,
value: Some(value.clone()),
};
let new_node_hash = new_node.hash();
self.nodes.insert(new_node_hash, new_node);
if let Some(current_node) = self.nodes.get_mut(¤t_node_hash) {
current_node.children.insert(k, new_node_hash);
}
self.parents.insert(new_node_hash, current_node_hash);
self.rehash(¤t_node_hash);
}
}
}
}
}
}
}