Struct trie_db::TrieBuilder

pub struct TrieBuilder<'a, T: TrieLayout, DB> {
    pub root: Option<TrieHash<T>>,
    /* private fields */
}

Get trie root and insert visited node in a hash_db. As for all ProcessEncodedNode implementation, it is only for full trie parsing (not existing trie).

Fields

root: Option<TrieHash<T>>

Implementations

impl<'a, T: TrieLayout, DB> TrieBuilder<'a, T, DB>

pub fn new(db: &'a mut DB) -> Self

Trait Implementations

impl<'a, T, DB> ProcessEncodedNode<<<T as TrieLayout>::Hash as Hasher>::Out> for TrieBuilder<'a, T, DB>

where T: TrieLayout, DB: HashDB<T::Hash, DBValue>,

fn process( &mut self, prefix: Prefix<'_>, encoded_node: Vec<u8>, is_root: bool, ) -> ChildReference<TrieHash<T>>

Function call with prefix, encoded value and a boolean indicating if the node is the root for each node of the trie.

fn process_inner_hashed_value( &mut self, prefix: Prefix<'_>, value: &[u8], ) -> TrieHash<T>

Callback for hashed value in encoded node.