dbx-core 0.2.2

High-performance file-based database engine with 5-Tier Hybrid Storage
Documentation 
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

//! In-memory WOS backend using BTreeMap
//!
//! Provides fast O(log n) operations with proven stability

use crate::error::DbxResult;
use crate::storage::StorageBackend;
use std::collections::{BTreeMap, HashMap};
use std::ops::RangeBounds;
use std::sync::RwLock;

/// In-memory WOS backend using BTreeMap
pub struct InMemoryWosBackend {
    #[allow(clippy::type_complexity)]
    tables: RwLock<HashMap<String, BTreeMap<Vec<u8>, Vec<u8>>>>,
}

impl InMemoryWosBackend {
    /// Create a new in-memory WOS backend
    pub fn new() -> Self {
        Self {
            tables: RwLock::new(HashMap::new()),
        }
    }
}

impl Default for InMemoryWosBackend {
    fn default() -> Self {
        Self::new()
    }
}

impl StorageBackend for InMemoryWosBackend {
    fn insert(&self, table: &str, key: &[u8], value: &[u8]) -> DbxResult<()> {
        let mut tables = self.tables.write().unwrap();
        tables
            .entry(table.to_string())
            .or_default()
            .insert(key.to_vec(), value.to_vec());
        Ok(())
    }

    fn get(&self, table: &str, key: &[u8]) -> DbxResult<Option<Vec<u8>>> {
        let tables = self.tables.read().unwrap();
        Ok(tables.get(table).and_then(|map| map.get(key).cloned()))
    }

    fn delete(&self, table: &str, key: &[u8]) -> DbxResult<bool> {
        let mut tables = self.tables.write().unwrap();
        if let Some(map) = tables.get_mut(table) {
            Ok(map.remove(key).is_some())
        } else {
            Ok(false)
        }
    }

    fn scan<R: RangeBounds<Vec<u8>> + Clone>(
        &self,
        table: &str,
        range: R,
    ) -> DbxResult<Vec<(Vec<u8>, Vec<u8>)>> {
        let tables = self.tables.read().unwrap();
        if let Some(map) = tables.get(table) {
            Ok(map
                .range(range)
                .map(|(k, v)| (k.clone(), v.clone()))
                .collect())
        } else {
            Ok(Vec::new())
        }
    }

    fn scan_one<R: RangeBounds<Vec<u8>> + Clone>(
        &self,
        table: &str,
        range: R,
    ) -> DbxResult<Option<(Vec<u8>, Vec<u8>)>> {
        let tables = self.tables.read().unwrap();
        if let Some(map) = tables.get(table) {
            Ok(map.range(range).map(|(k, v)| (k.clone(), v.clone())).next())
        } else {
            Ok(None)
        }
    }

    fn flush(&self) -> DbxResult<()> {
        // No-op for in-memory backend
        Ok(())
    }

    fn count(&self, table: &str) -> DbxResult<usize> {
        let tables = self.tables.read().unwrap();
        Ok(tables.get(table).map(|m| m.len()).unwrap_or(0))
    }

    fn table_names(&self) -> DbxResult<Vec<String>> {
        let tables = self.tables.read().unwrap();
        Ok(tables.keys().cloned().collect())
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_insert_and_get() {
        let backend = InMemoryWosBackend::new();
        backend.insert("test", b"key1", b"value1").unwrap();

        let result = backend.get("test", b"key1").unwrap();
        assert_eq!(result, Some(b"value1".to_vec()));
    }

    #[test]
    fn test_delete() {
        let backend = InMemoryWosBackend::new();
        backend.insert("test", b"key1", b"value1").unwrap();

        assert!(backend.delete("test", b"key1").unwrap());
        assert_eq!(backend.get("test", b"key1").unwrap(), None);
    }

    #[test]
    fn test_scan() {
        let backend = InMemoryWosBackend::new();
        backend.insert("test", b"key1", b"value1").unwrap();
        backend.insert("test", b"key2", b"value2").unwrap();
        backend.insert("test", b"key3", b"value3").unwrap();

        let results = backend
            .scan("test", b"key1".to_vec()..b"key3".to_vec())
            .unwrap();
        assert_eq!(results.len(), 2);
    }

    #[test]
    fn test_count() {
        let backend = InMemoryWosBackend::new();
        backend.insert("test", b"key1", b"value1").unwrap();
        backend.insert("test", b"key2", b"value2").unwrap();

        assert_eq!(backend.count("test").unwrap(), 2);
    }
}