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
use super::*;
#[derive(Default, Clone, Debug, PartialEq, Serialize, Deserialize)]
pub struct VecSet<T> {
inner: Vec<T>,
}
impl<T> VecSet<T>
where
T: Ord + Eq,
{
pub fn insert(&mut self, item: T) -> bool {
if let Err(insert_idx) = self.inner.binary_search(&item) {
self.inner.insert(insert_idx, item);
true
} else {
false
}
}
pub fn remove(&mut self, item: &T) -> Option<T> {
if let Ok(at) = self.inner.binary_search(item) {
Some(self.inner.remove(at))
} else {
None
}
}
pub fn contains(&self, item: &T) -> bool {
self.inner.binary_search(item).is_ok()
}
pub fn peek_first(&self) -> Option<&T> {
self.inner.first()
}
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
pub fn len(&self) -> usize {
self.inner.len()
}
pub fn get(&self, idx: usize) -> Option<&T> {
self.inner.get(idx)
}
pub fn clear(&mut self) {
self.inner.clear()
}
pub fn iter(&self) -> impl Iterator<Item = &T> {
self.inner.iter()
}
}