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
use crate::map::Iter;
use crate::map::TrieMap;
use std::borrow::Borrow;
use std::hash::Hash;
pub struct TrieSet<T, A = u8> (TrieMap<T, T, A>);
impl<A: Clone + Eq + Hash, T: AsRef<[A]> + Clone> TrieSet<T, A> {
pub fn new() -> Self {
Self::default()
}
pub fn clear(&mut self) {
let TrieSet (this) = self;
this.clear();
}
pub fn contains<S: AsRef<[A]> + ?Sized>(&self, elem: &S) -> bool
where T: Borrow<S> {
let TrieSet (this) = self;
this.contains(elem)
}
pub fn insert(&mut self, elem: T) -> bool {
let TrieSet (this) = self;
this.insert(&elem.clone(), elem).is_none()
}
pub fn is_empty(&self) -> bool {
let TrieSet (this) = self;
this.is_empty()
}
pub fn iter(&self) -> Iter<&T> {
let TrieSet (this) = self;
this.iter()
}
pub fn iter_prefix<S: AsRef<[A]> + ?Sized>(&self, prefix: &S) -> Iter<&T>
where T: Borrow<S> {
let TrieSet (this) = self;
this.iter_prefix(prefix)
}
pub fn len(&self) -> usize {
let TrieSet (this) = self;
this.len()
}
}
impl<T, A: Clone + Eq + Hash> Default for TrieSet<T, A> {
fn default() -> Self {
TrieSet (TrieMap::default())
}
}