Function trie_db::trie_visit

pub fn trie_visit<T, I, A, B, F>(input: I, callback: &mut F)where
    T: TrieLayout,
    I: IntoIterator<Item = (A, B)>,
    A: AsRef<[u8]> + Ord,
    B: AsRef<[u8]>,
    F: ProcessEncodedNode<TrieHash<T>>,

Function visiting trie from key value inputs with a ProccessEncodedNode callback. This is the main entry point of this module. Calls to each node occurs ordered by byte key value but with longest keys first (from node to branch to root), this differs from standard byte array ordering a bit.