ubt 0.4.2

Unified Binary Tree implementation based on EIP-7864
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159

//! UBT adapter implementing TestableDatabase trait.

use crate::simulation::workload::{KeyValueEntries, TestableDatabase};
use std::collections::BTreeMap;
use std::convert::Infallible;
use ubt::{Blake3Hasher, TreeKey, UnifiedBinaryTree, B256};

/// UBT database wrapper for simulation testing.
pub struct UbtDatabase {
    tree: UnifiedBinaryTree<Blake3Hasher>,
    entries: BTreeMap<[u8; 32], [u8; 32]>,
    incremental_mode: bool,
}

impl TestableDatabase for UbtDatabase {
    type Error = Infallible;

    fn create() -> Self {
        Self {
            tree: UnifiedBinaryTree::new(),
            entries: BTreeMap::new(),
            incremental_mode: false,
        }
    }

    fn insert(&mut self, key: [u8; 32], value: [u8; 32]) -> Result<(), Self::Error> {
        let tree_key = TreeKey::from_bytes(B256::from(key));
        let b256_value = B256::from(value);
        self.tree.insert(tree_key, b256_value);
        self.entries.insert(key, value);
        Ok(())
    }

    fn get(&self, key: [u8; 32]) -> Result<Option<[u8; 32]>, Self::Error> {
        let tree_key = TreeKey::from_bytes(B256::from(key));
        let result = self.tree.get(&tree_key).map(|b256| b256.0);
        Ok(result)
    }

    fn delete(&mut self, key: [u8; 32]) -> Result<bool, Self::Error> {
        let tree_key = TreeKey::from_bytes(B256::from(key));
        let existed = self.tree.get(&tree_key).is_some();
        if existed {
            self.tree.insert(tree_key, B256::ZERO);
            self.entries.remove(&key);
        }
        Ok(existed)
    }

    fn sync(&mut self) -> Result<[u8; 32], Self::Error> {
        let root = self.tree.root_hash().expect("tree depth within bounds");
        Ok(root.0)
    }

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

    fn scan_all(&self) -> Result<KeyValueEntries, Self::Error> {
        let entries: KeyValueEntries = self.entries.iter().map(|(k, v)| (*k, *v)).collect();
        Ok(entries)
    }

    fn enable_incremental_mode(&mut self) {
        if !self.incremental_mode {
            self.tree.enable_incremental_mode();
            // Prime the cache
            let _ = self.tree.root_hash().expect("tree depth within bounds");
            self.incremental_mode = true;
        }
    }

    fn disable_incremental_mode(&mut self) {
        if self.incremental_mode {
            self.tree.disable_incremental_mode();
            self.incremental_mode = false;
        }
    }

    fn is_incremental_mode(&self) -> bool {
        self.incremental_mode
    }

    fn clear_caches(&mut self) {
        // Disable and re-enable to clear internal caches
        let was_incremental = self.incremental_mode;
        if was_incremental {
            self.tree.disable_incremental_mode();
        }
        // Force a rebuild to clear any cached state
        let _ = self.tree.root_hash().expect("tree depth within bounds");
        if was_incremental {
            self.tree.enable_incremental_mode();
            let _ = self.tree.root_hash().expect("tree depth within bounds");
        }
    }

    fn force_full_rebuild(&mut self) -> Result<[u8; 32], Self::Error> {
        // Temporarily disable incremental mode to force full rebuild
        let was_incremental = self.incremental_mode;
        if was_incremental {
            self.tree.disable_incremental_mode();
        }
        let root = self.tree.root_hash().expect("tree depth within bounds");
        if was_incremental {
            self.tree.enable_incremental_mode();
            let _ = self.tree.root_hash().expect("tree depth within bounds"); // Re-prime cache
        }
        Ok(root.0)
    }
}

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

    #[test]
    fn test_ubt_adapter_basic() {
        let mut db = UbtDatabase::create();

        let key = [1u8; 32];
        let value = [42u8; 32];

        db.insert(key, value).unwrap();
        assert_eq!(db.get(key).unwrap(), Some(value));
        assert_eq!(db.count(), 1);

        let root = db.sync().unwrap();
        assert_ne!(root, [0u8; 32]);
    }

    #[test]
    fn test_ubt_adapter_delete() {
        let mut db = UbtDatabase::create();

        let key = [1u8; 32];
        let value = [42u8; 32];

        db.insert(key, value).unwrap();
        assert!(db.delete(key).unwrap());
        assert!(!db.delete(key).unwrap());
    }

    #[test]
    fn test_ubt_adapter_scan() {
        let mut db = UbtDatabase::create();

        let key1 = [1u8; 32];
        let key2 = [2u8; 32];
        let value = [42u8; 32];

        db.insert(key1, value).unwrap();
        db.insert(key2, value).unwrap();

        let entries = db.scan_all().unwrap();
        assert_eq!(entries.len(), 2);
        assert!(entries[0].0 < entries[1].0);
    }
}