Newer
Older
#[cfg(feature = "std")]
use serde::{Deserialize, Serialize};
use sp_runtime::RuntimeDebug;
use sp_std::prelude::*;
#[cfg_attr(feature = "std", derive(Serialize, Deserialize))]
#[derive(RuntimeDebug, PartialEq, Eq, Encode, Decode, Default)]
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
impl<T: Ord> OrderedSet<T> {
pub fn new() -> Self {
Self(Vec::new())
}
pub fn from(mut v: Vec<T>) -> Self {
v.sort();
v.dedup();
Self::from_sorted_set(v)
}
/// Assume v is sorted and contain unique elements
pub fn from_sorted_set(v: Vec<T>) -> Self {
Self(v)
}
pub fn insert(&mut self, value: T) -> bool {
match self.0.binary_search(&value) {
Ok(_) => false,
Err(loc) => {
self.0.insert(loc, value);
true
}
}
}
pub fn remove(&mut self, value: &T) -> bool {
match self.0.binary_search(&value) {
Ok(loc) => {
self.0.remove(loc);
true
}
Err(_) => false,
}
}
pub fn contains(&self, value: &T) -> bool {
self.0.binary_search(&value).is_ok()
}
pub fn clear(&mut self) {
self.0.clear();
}
}
impl<T: Ord> From<Vec<T>> for OrderedSet<T> {
fn from(v: Vec<T>) -> Self {
Self::from(v)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn from() {
let v = vec![4, 2, 3, 4, 3, 1];
let set: OrderedSet<i32> = v.into();
assert_eq!(set, OrderedSet::from(vec![1, 2, 3, 4]));
}
#[test]
fn insert() {
let mut set: OrderedSet<i32> = OrderedSet::new();
assert_eq!(set, OrderedSet::from(vec![]));
assert_eq!(set.insert(1), true);
assert_eq!(set, OrderedSet::from(vec![1]));
assert_eq!(set.insert(5), true);
assert_eq!(set, OrderedSet::from(vec![1, 5]));
assert_eq!(set.insert(3), true);
assert_eq!(set, OrderedSet::from(vec![1, 3, 5]));
assert_eq!(set.insert(3), false);
assert_eq!(set, OrderedSet::from(vec![1, 3, 5]));
}
#[test]
fn remove() {
let mut set: OrderedSet<i32> = OrderedSet::from(vec![1, 2, 3, 4]);
assert_eq!(set.remove(&5), false);
assert_eq!(set, OrderedSet::from(vec![1, 2, 3, 4]));
assert_eq!(set.remove(&1), true);
assert_eq!(set, OrderedSet::from(vec![2, 3, 4]));
assert_eq!(set.remove(&3), true);
assert_eq!(set, OrderedSet::from(vec![2, 4]));
assert_eq!(set.remove(&3), false);
assert_eq!(set, OrderedSet::from(vec![2, 4]));
assert_eq!(set.remove(&4), true);
assert_eq!(set, OrderedSet::from(vec![2]));
assert_eq!(set.remove(&2), true);
assert_eq!(set, OrderedSet::from(vec![]));
assert_eq!(set.remove(&2), false);
assert_eq!(set, OrderedSet::from(vec![]));
}
#[test]
fn contains() {
let set: OrderedSet<i32> = OrderedSet::from(vec![1, 2, 3, 4]);
assert_eq!(set.contains(&5), false);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&3), true);
}
#[test]
fn clear() {
let mut set: OrderedSet<i32> = OrderedSet::from(vec![1, 2, 3, 4]);
set.clear();
assert_eq!(set, OrderedSet::new());
}
}