ethexe-db 2.0.0-pre.1

Database abstractions and implementations for ethexe
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

// Copyright (C) Gear Technologies Inc.
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0

use crate::{CASDatabase, KVDatabase};
use dashmap::DashMap;
use gprimitives::H256;
use std::sync::Arc;

#[derive(Debug, Default, Clone)]
pub struct MemDb {
    // TODO: using Vec as key is not optimal, consider using to use another data structure.
    inner: Arc<DashMap<Vec<u8>, Vec<u8>>>,
}

impl CASDatabase for MemDb {
    fn clone_boxed(&self) -> Box<dyn CASDatabase> {
        Box::new(self.clone())
    }

    fn read(&self, hash: H256) -> Option<Vec<u8>> {
        let key = hash.as_bytes();
        self.inner.get(key).map(|v| v.value().clone())
    }

    fn contains(&self, hash: H256) -> bool {
        self.inner.contains_key(hash.as_bytes())
    }

    fn write(&self, data: &[u8]) -> H256 {
        let hash = crate::hash(data);
        self.inner.insert(hash.as_bytes().to_vec(), data.to_vec());
        hash
    }
}

impl KVDatabase for MemDb {
    fn clone_boxed(&self) -> Box<dyn KVDatabase> {
        Box::new(self.clone())
    }

    fn get(&self, key: &[u8]) -> Option<Vec<u8>> {
        self.inner.get(&key.to_vec()).map(|v| v.value().clone())
    }

    unsafe fn take(&self, key: &[u8]) -> Option<Vec<u8>> {
        self.inner.remove(&key.to_vec()).map(|(_, value)| value)
    }

    unsafe fn delete(&self, key: &[u8]) {
        self.inner.remove(&key.to_vec());
    }

    fn contains(&self, key: &[u8]) -> bool {
        self.inner.contains_key(key)
    }

    fn put(&self, key: &[u8], value: Vec<u8>) {
        self.inner.insert(key.to_vec(), value);
    }

    fn iter_prefix<'a>(
        &'a self,
        prefix: &'a [u8],
    ) -> Box<dyn Iterator<Item = (Vec<u8>, Vec<u8>)> + 'a> {
        Box::new(
            self.inner
                .iter()
                .filter(move |refs| refs.key().starts_with(prefix))
                .map(|refs| (refs.key().clone(), refs.value().clone())),
        )
    }

    fn is_empty(&self) -> bool {
        self.inner.is_empty()
    }
}

// TODO: Join tests for MemDb and RocksDb, making general tests for dyn CASDatabase.
#[cfg(test)]
mod tests {
    use super::*;
    use crate::tests;

    #[test]
    fn is_cloneable() {
        tests::is_cloneable(MemDb::default());
    }

    #[test]
    fn cas_read_write() {
        tests::cas_read_write(MemDb::default());
    }

    #[test]
    fn kv_read_write() {
        tests::kv_read_write(MemDb::default());
    }

    #[test]
    fn kv_iter_prefix() {
        tests::kv_iter_prefix(MemDb::default());
    }

    #[test]
    fn cas_multi_thread() {
        tests::cas_multi_thread(MemDb::default());
    }

    #[test]
    fn kv_multi_thread() {
        tests::kv_multi_thread(MemDb::default());
    }
}