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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
//! AVL tree.
use crate::node::AvlNode;
use crate::traits::TreeElem;
/// AVL tree.
pub struct AvlTree<T> {
/// Root node.
pub root: Option<AvlNode<T>>,
}
impl<T: TreeElem> AvlTree<T> {
/// Create an empty AVL tree.
pub fn new() -> Self {
let root = None;
Self { root }
}
/// Push `value` and return the rank and the number of duplication of it.
pub fn push(&mut self, value: T) -> (usize, usize) {
match &mut self.root {
Some(r) => {
let (n_ledu, _) = r.push_child(value);
n_ledu
}
None => {
self.root = Some(AvlNode::new(value));
(0, 0)
}
}
}
/// Determine if `value` exists.
pub fn isin(&self, value: T) -> bool {
match match &self.root {
Some(r) => r.search(value),
None => None,
} {
Some(_) => true,
None => false,
}
}
/// Count the number of `value`.
pub fn count(&self, value: T) -> usize {
match match &self.root {
Some(r) => r.search(value),
None => None,
} {
Some(dup) => dup + 1,
None => 0,
}
}
/// Remove `value` from the tree and return the result.
///
/// If `value` is a duplicate, return and remove only one.
pub fn remove(&mut self, value: T) -> Result<(), ()> {
match &mut self.root {
Some(r) => {
if r.value == value {
if r.n_ledu.1 > 0 {
r.n_ledu.1 -= 1;
Ok(())
} else {
let res = match (&r.left, &r.right) {
(Some(nl), Some(nr)) => {
let n_m = if r.diff >= 0 {
nl.lock().unwrap().max_child()
} else {
nr.lock().unwrap().min_child()
};
r.value = n_m;
r.n_ledu.1 = r.search(n_m).unwrap();
match r.remove_child(n_m) {
Ok(_) => {}
Err(()) => panic!(),
}
Ok(None)
}
(Some(nl), None) => {
let nl_lock = nl.lock().unwrap();
r.value = nl_lock.value;
r.diff = nl_lock.diff;
r.n_ledu = nl_lock.n_ledu;
Ok(Some((nl_lock.left.clone(), nl_lock.right.clone())))
}
(None, Some(nr)) => {
let nr_lock = nr.lock().unwrap();
r.value = nr_lock.value;
r.diff = nr_lock.diff;
r.n_ledu = nr_lock.n_ledu;
Ok(Some((nr_lock.left.clone(), nr_lock.right.clone())))
}
(None, None) => {
Err(())
}
};
match res {
Ok(Some((nl_op, nr_op))) => {
r.left = nl_op;
r.right = nr_op;
}
Ok(None) => {}
Err(()) => {
self.root = None;
}
}
Ok(())
}
} else {
let res = r.remove_child(value);
match res {
Ok(_) => Ok(()),
Err(()) => Err(()),
}
}
}
None => Err(())
}
}
/// Return the maximum value in the tree.
pub fn max(&self) -> Option<T> {
match &self.root {
Some(r) => Some(r.max_child()),
None => None,
}
}
/// Return and remove the maximum value.
///
/// If the maximum value is a duplicate, return and remove only one.
pub fn pop_max(&mut self) -> Option<T> {
match &mut self.root {
Some(r) => {
let res = match &r.right {
Some(_) => true,
None => false,
};
if res {
let (value, _) = r.pop_max_child().unwrap();
Some(value)
} else {
let ret_value = r.value;
if r.n_ledu.1 > 0 {
r.n_ledu.1 -= 1;
} else {
let op = match &r.left {
Some(node) => {
let n = node.lock().unwrap();
Some((n.value, n.diff, n.n_ledu, n.left.clone(), n.right.clone()))
}
None => None,
};
match op {
Some((value, diff, n_ledu, left, right)) => {
r.value = value;
r.diff = diff;
r.n_ledu = n_ledu;
r.left = left;
r.right = right;
}
None => { self.root = None; }
}
}
Some(ret_value)
}
}
None => None,
}
}
/// Return the maximum value and the number of duplication of it, then remove its node.
pub fn pop_max_all(&mut self) -> Option<(T, usize)> {
match &mut self.root {
Some(r) => {
let res = match &r.right {
Some(_) => true,
None => false,
};
if res {
let (value, _) = r.pop_max_all_child().unwrap();
Some(value)
} else {
let ret_value = (r.value, r.n_ledu.1);
let op = match &r.left {
Some(node) => {
let n = node.lock().unwrap();
Some((n.value, n.diff, n.n_ledu, n.left.clone(), n.right.clone()))
}
None => None,
};
match op {
Some((value, diff, n_ledu, left, right)) => {
r.value = value;
r.diff = diff;
r.n_ledu = n_ledu;
r.left = left;
r.right = right;
}
None => { self.root = None; }
}
Some(ret_value)
}
}
None => None,
}
}
/// Return the maximum value in the tree.
pub fn min(&self) -> Option<T> {
match &self.root {
Some(r) => Some(r.min_child()),
None => None,
}
}
/// Return and remove the maximum value.
///
/// If the maximum value is a duplicate, return and remove only one.
pub fn pop_min(&mut self) -> Option<T> {
match &mut self.root {
Some(r) => {
let res = match &r.left {
Some(_) => true,
None => false,
};
if res {
let (value, _) = r.pop_min_child().unwrap();
Some(value)
} else {
let ret_value = r.value;
if r.n_ledu.1 > 0 {
r.n_ledu.1 -= 1;
} else {
let op = match &r.right {
Some(node) => {
let n = node.lock().unwrap();
Some((n.value, n.diff, n.n_ledu, n.left.clone(), n.right.clone()))
}
None => None,
};
match op {
Some((value, diff, n_ledu, left, right)) => {
r.value = value;
r.diff = diff;
r.n_ledu = n_ledu;
r.left = left;
r.right = right;
}
None => { self.root = None; }
}
}
Some(ret_value)
}
}
None => None,
}
}
/// Return the maximum value and the number of duplication of it, then remove its node.
pub fn pop_min_all(&mut self) -> Option<(T, usize)> {
match &mut self.root {
Some(r) => {
let res = match &r.left {
Some(_) => true,
None => false,
};
if res {
let (value, _) = r.pop_min_all_child().unwrap();
Some(value)
} else {
let ret_value = (r.value, r.n_ledu.1);
let op = match &r.right {
Some(node) => {
let n = node.lock().unwrap();
Some((n.value, n.diff, n.n_ledu, n.left.clone(), n.right.clone()))
}
None => None,
};
match op {
Some((value, diff, n_ledu, left, right)) => {
r.value = value;
r.diff = diff;
r.n_ledu = n_ledu;
r.left = left;
r.right = right;
}
None => { self.root = None; }
}
Some(ret_value)
}
}
None => None,
}
}
/// Return the number of elements.
pub fn len(&self) -> usize {
match &self.root {
Some(r) => r.len_child_and_self(),
None => 0,
}
}
/// Return the maximum height of the tree.
pub fn height(&self) -> usize {
match &self.root {
Some(r) => r.height_child(),
None => 0,
}
}
}