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

use crate::storage::Storage;
use dashmap::DashMap;
use std::hash::Hash;

#[derive(Clone, Debug)]
pub struct MemStorage<K, V>
where
    K: Clone + Eq + Hash,
    V: Clone,
{
    table: DashMap<K, V>,
}

impl<K, V> Storage for MemStorage<K, V>
where
    K: Clone + Eq + Hash,
    V: Clone,
{
    type K = K;
    type V = V;

    fn new() -> Self {
        Self {
            table: DashMap::new(),
        }
    }

    fn get(&self, addr: &K) -> Option<V> {
        self.table.get(addr).map(|v| v.value().clone())
    }

    fn set(&self, addr: &K, value: V) -> Option<V> {
        self.table.insert(addr.clone(), value)
    }

    fn len(&self) -> usize {
        self.table.len()
    }

    fn is_empty(&self) -> bool {
        self.table.len() == 0
    }

    fn get_or_set(&self, addr: &Self::K, default: Self::V) -> Self::V {
        self.table
            .entry(addr.clone())
            .or_insert(default)
            .value()
            .clone()
    }

    fn keys(&self) -> Vec<Self::K> {
        self.table.clone().into_iter().map(|(k, _v)| k).collect()
    }

    fn values(&self) -> Vec<Self::V> {
        self.table.clone().into_iter().map(|(_k, v)| v).collect()
    }

    fn items(&self) -> Vec<(Self::K, Self::V)> {
        self.table
            .clone()
            .into_iter()
            .map(|(k, v)| (k, v))
            .collect()
    }

    fn remove(&self, addr: &Self::K) -> Option<(Self::K, Self::V)> {
        match self.get(addr) {
            Some(_) => self.table.remove(addr),
            None => None,
        }
    }
}