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
use std::hash::Hash;
use dashmap::DashMap;
#[derive(Clone, Debug, Default)]
pub struct MemStorage<K, V>
where
K: Copy + Eq + Hash,
V: Clone,
{
table: DashMap<K, V>,
}
impl<K, V> MemStorage<K, V>
where
K: Copy + Eq + Hash,
V: Clone,
{
pub fn new() -> Self {
Self {
table: DashMap::default(),
}
}
pub fn get(&self, addr: &K) -> Option<V> {
self.table.get(addr).map(|v| v.value().clone())
}
pub fn set(&self, addr: &K, value: V) -> Option<V> {
self.table.insert(*addr, value)
}
pub fn len(&self) -> usize {
self.table.len()
}
pub fn is_empty(&self) -> bool {
self.table.len() == 0
}
pub fn get_or_set(&self, addr: &K, default: V) -> V {
self.table.entry(*addr).or_insert(default).value().clone()
}
pub fn keys(&self) -> Vec<K> {
self.table.clone().into_iter().map(|(k, _v)| k).collect()
}
pub fn values(&self) -> Vec<V> {
self.table.clone().into_iter().map(|(_k, v)| v).collect()
}
pub fn items(&self) -> Vec<(K, V)> {
self.table
.clone()
.into_iter()
.map(|(k, v)| (k, v))
.collect()
}
pub fn remove(&self, addr: &K) -> Option<(K, V)> {
match self.get(addr) {
Some(_) => self.table.remove(addr),
None => None,
}
}
}
#[cfg(test)]
mod tests {
use web3::types::Address;
use super::*;
use crate::ecc::SecretKey;
#[test]
fn memstorage_basic_interface_should_work() {
let store = MemStorage::<Address, String>::new();
let addr = SecretKey::random().address();
assert!(store.get(&addr).is_none());
let v0 = store.set(&addr, "value 1".into());
assert!(v0.is_none());
let v1 = store.set(&addr, "value 2".into());
assert_eq!(v1, Some("value 1".into()));
let v2 = store.get(&addr);
assert_eq!(v2, Some("value 2".into()));
}
}