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
use hash_db::{HashDBRef, Hasher};
use crate::rstd::boxed::Box;
use super::triedb::TrieDB;
use super::{Result, DBValue, Trie, TrieItem, TrieIterator, Query, TrieLayout, CError, TrieHash};
pub struct SecTrieDB<'db, L>
where
L: TrieLayout,
{
raw: TrieDB<'db, L>
}
impl<'db, L> SecTrieDB<'db, L>
where
L: TrieLayout,
{
pub fn new(
db: &'db dyn HashDBRef<L::Hash, DBValue>,
root: &'db TrieHash<L>,
) -> Result<Self, TrieHash<L>, CError<L>> {
Ok(SecTrieDB { raw: TrieDB::new(db, root)? })
}
pub fn raw(&self) -> &TrieDB<L> {
&self.raw
}
pub fn raw_mut(&mut self) -> &mut TrieDB<'db, L> {
&mut self.raw
}
}
impl<'db, L> Trie<L> for SecTrieDB<'db, L>
where
L: TrieLayout,
{
fn root(&self) -> &TrieHash<L> { self.raw.root() }
fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>> {
self.raw.contains(L::Hash::hash(key).as_ref())
}
fn get_with<'a, 'key, Q: Query<L::Hash>>(
&'a self,
key: &'key [u8],
query: Q,
) -> Result<Option<Q::Item>, TrieHash<L>, CError<L>>
where 'a: 'key
{
self.raw.get_with(L::Hash::hash(key).as_ref(), query)
}
fn iter<'a>(&'a self) -> Result<
Box<dyn TrieIterator<L, Item = TrieItem<TrieHash<L>, CError<L>>> + 'a>,
TrieHash<L>,
CError<L>
> {
TrieDB::iter(&self.raw)
}
}