Struct trie_db::TrieBuilder

pub struct TrieBuilder<'a, H, HO, V, DB> {
    pub root: Option<HO>,
    // some fields omitted
}

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

Implementations

impl<'a, H, HO, V, DB> TrieBuilder<'a, H, HO, V, DB>

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

Trait Implementations

impl<'a, H: Hasher, V, DB: HashDB<H, V>> ProcessEncodedNode<<H as Hasher>::Out> for TrieBuilder<'a, H, <H as Hasher>::Out, V, DB>

fn process(
    &mut self,
    prefix: Prefix<'_>,
    encoded_node: Vec<u8>,
    is_root: bool
) -> ChildReference<<H as Hasher>::Out>

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