Trait trie_db::ProcessEncodedNode

pub trait ProcessEncodedNode<HO> {
    fn process(
        &mut self, 
        prefix: Prefix<'_>, 
        encoded_node: Vec<u8>, 
        is_root: bool
    ) -> ChildReference<HO>;
}

Visitor trait to implement when using trie_visit.

Required methods

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

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

Note that the returned value can change depending on implementation, but usually it should be the Hash of encoded node. This is not something direcly related to encoding but is here for optimisation purpose (builder hash_db does return this value).

Loading content...

Implementors

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>

impl<H: Hasher> ProcessEncodedNode<<H as Hasher>::Out> for TrieRoot<H, <H as Hasher>::Out>

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

impl<H: Hasher> ProcessEncodedNode<<H as Hasher>::Out> for TrieRootPrint<H, <H as Hasher>::Out>

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

impl<H: Hasher> ProcessEncodedNode<<H as Hasher>::Out> for TrieRootUnhashed<H>

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

Loading content...