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
use crate::common::*;
pub struct UniquifyOrd<U, A>
where
A: Ord + Clone,
{
inner: U,
set: BTreeSet<A>,
}
impl<U, A> UniquifyOrd<U, A>
where
A: Ord + Clone,
{
pub fn get(&self) -> &U {
&self.inner
}
pub fn into_inner(self) -> U {
self.inner
}
}
impl<U, A> FromIterator<A> for UniquifyOrd<U, A>
where
U: FromIterator<A>,
A: Ord + Clone,
{
fn from_iter<T: IntoIterator<Item = A>>(iter: T) -> Self {
let mut set = BTreeSet::new();
let inner: U = iter
.into_iter()
.filter_map(|item| set.insert(item.clone()).then(|| item))
.collect();
Self { inner, set }
}
}
impl<U, A> Extend<A> for UniquifyOrd<U, A>
where
U: Extend<A>,
A: Ord + Clone,
{
fn extend<T: IntoIterator<Item = A>>(&mut self, iter: T) {
let Self { inner, set } = self;
let iter = iter
.into_iter()
.filter_map(|item| set.insert(item.clone()).then(|| item));
inner.extend(iter);
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn uniquify_hash_test() {
let unique: UniquifyOrd<Vec<_>, _> = vec![1, 2, 3].into_iter().collect();
assert_eq!(unique.into_inner(), vec![1, 2, 3]);
let unique: UniquifyOrd<Vec<_>, _> = vec![1, 2, 2, 3, 3].into_iter().collect();
assert_eq!(unique.into_inner(), vec![1, 2, 3]);
let mut unique: UniquifyOrd<Vec<_>, _> = vec![1, 2, 3].into_iter().collect();
unique.extend(vec![4]);
assert_eq!(unique.get(), &vec![1, 2, 3, 4]);
unique.extend(vec![4]);
assert_eq!(unique.get(), &vec![1, 2, 3, 4]);
}
}