pub struct SecTrieDB<'db, L> where
L: TrieLayout, { /* private fields */ }Expand description
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
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.
Trait Implementations
Does the trie contain a given key?
Search for the key with the given query parameter. See the docs of the Query
trait for more details. Read more
Returns a depth-first iterator over the elements of trie.
fn key_iter<'a>(
&'a self
) -> Result<Box<dyn TrieIterator<L, Item = TrieKeyItem<'_, TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>
fn key_iter<'a>(
&'a self
) -> Result<Box<dyn TrieIterator<L, Item = TrieKeyItem<'_, TrieHash<L>, CError<L>>> + 'a>, TrieHash<L>, CError<L>>
Returns a depth-first iterator over the keys of elemets of trie.