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
use std::marker::PhantomData;
use borsh::{BorshDeserialize, BorshSerialize};
use crate::collections::append_slice;
use crate::env;
const ERR_ELEMENT_SERIALIZATION: &[u8] = b"Cannot serialize element with Borsh";
#[derive(BorshSerialize, BorshDeserialize)]
pub struct LookupSet<T> {
element_prefix: Vec<u8>,
#[borsh_skip]
el: PhantomData<T>,
}
impl<T> LookupSet<T> {
pub fn new(element_prefix: Vec<u8>) -> Self {
Self { element_prefix, el: PhantomData }
}
fn raw_element_to_storage_key(&self, element_raw: &[u8]) -> Vec<u8> {
append_slice(&self.element_prefix, element_raw)
}
fn contains_raw(&self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_has_key(&storage_key)
}
pub fn insert_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
!env::storage_write(&storage_key, b"")
}
pub fn remove_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_remove(&storage_key)
}
}
impl<T> LookupSet<T>
where
T: BorshSerialize,
{
fn serialize_element(element: &T) -> Vec<u8> {
match element.try_to_vec() {
Ok(x) => x,
Err(_) => env::panic(ERR_ELEMENT_SERIALIZATION),
}
}
pub fn contains(&self, element: &T) -> bool {
self.contains_raw(&Self::serialize_element(element))
}
pub fn remove(&mut self, element: &T) -> bool {
self.remove_raw(&Self::serialize_element(element))
}
pub fn insert(&mut self, element: &T) -> bool {
self.insert_raw(&Self::serialize_element(element))
}
pub fn extend<IT: IntoIterator<Item = T>>(&mut self, iter: IT) {
for el in iter {
self.insert(&el);
}
}
}
#[cfg(not(target_arch = "wasm32"))]
#[cfg(test)]
mod tests {
use crate::collections::LookupSet;
use crate::test_utils::test_env;
use rand::seq::SliceRandom;
use rand::{Rng, SeedableRng};
use std::collections::HashSet;
#[test]
pub fn test_insert() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(0);
for _ in 0..500 {
let key = rng.gen::<u64>();
set.insert(&key);
}
}
#[test]
pub fn test_insert_remove() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(1);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_remove_last_reinsert() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let key1 = 1u64;
set.insert(&key1);
let key2 = 2u64;
set.insert(&key2);
let actual = set.remove(&key2);
assert!(actual);
let actual_reinsert = set.insert(&key2);
assert!(actual_reinsert);
}
#[test]
pub fn test_insert_override_remove() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(2);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in &keys {
assert!(!set.insert(key));
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_contains_non_existent() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(3);
let mut set_tmp = HashSet::new();
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
set_tmp.insert(key);
set.insert(&key);
}
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
assert_eq!(set.contains(&key), set_tmp.contains(&key));
}
}
#[test]
pub fn test_extend() {
test_env::setup();
let mut set = LookupSet::new(b"s".to_vec());
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(4);
let mut keys = HashSet::new();
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.insert(key);
set.insert(&key);
}
for _ in 0..10 {
let mut tmp = vec![];
for _ in 0..=(rng.gen::<u64>() % 20 + 1) {
let key = rng.gen::<u64>();
tmp.push(key);
}
keys.extend(tmp.iter().cloned());
set.extend(tmp.iter().cloned());
}
for key in keys {
assert!(set.contains(&key));
}
}
}