Struct tetsy_trie_db::sectriedb::SecTrieDB

pub struct SecTrieDB<'db, L> where
    L: TrieLayout,  { /* fields omitted */ }

A Trie implementation which hashes keys and uses a generic HashDB backing database.

Use it as a Trie trait object. You can use raw() to get the backing TrieDB object.

Implementations

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>>

Create a new trie with the backing database db and empty root

Initialise to the state entailed by the genesis block. This guarantees the trie is built correctly. Returns an error if root does not exist.

pub fn raw(&self) -> &TrieDB<'_, L>

Get a reference to the underlying raw TrieDB struct.

pub fn raw_mut(&mut self) -> &mut TrieDB<'db, L>

Get a mutable reference to the underlying raw TrieDB struct.

Trait Implementations

impl<'db, L> Trie<L> for SecTrieDB<'db, L> where
    L: TrieLayout, 

fn root(&self) -> &TrieHash<L>

Return the root of the trie.

fn contains(&self, key: &[u8]) -> Result<bool, TrieHash<L>, CError<L>>

Does the trie contain a given key?

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, 

Search for the key with the given query parameter. See the docs of the Query trait for more details.

fn iter<'a>(
    &'a self
) -> Result<Box<dyn TrieIterator<L, Item = TrieItem<'_, TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>

Returns a depth-first iterator over the elements of trie.

fn is_empty(&self) -> bool

Is the trie empty?

fn get<'a, 'key>(
    &'a self,
    key: &'key [u8]
) -> Result<Option<DBValue>, TrieHash<L>, CError<L>> where
    'a: 'key, 

What is the value of the given key in this trie?