Struct TrieNodeIter 

pub struct TrieNodeIter<C, H: HashedCursor, K> {
    pub walker: TrieWalker<C, K>,
    pub hashed_cursor: H,
    /* private fields */
}

Iterates over trie nodes for hash building.

This iterator depends on the ordering guarantees of TrieCursor, and additionally uses hashed cursor lookups when operating on storage tries.

Fields

walker: TrieWalker<C, K>

The walker over intermediate nodes.

hashed_cursor: H

The cursor for the hashed entries.

Implementations

impl<C, H: HashedCursor, K> TrieNodeIter<C, H, K>

where H::Value: Clone, K: AsRef<AddedRemovedKeys>,

pub fn state_trie(walker: TrieWalker<C, K>, hashed_cursor: H) -> Self

Creates a new TrieNodeIter for the state trie.

pub fn storage_trie(walker: TrieWalker<C, K>, hashed_cursor: H) -> Self

Creates a new TrieNodeIter for the storage trie.

pub const fn with_last_hashed_key(self, previous_hashed_key: B256) -> Self

Sets the last iterated hashed key and returns the modified TrieNodeIter. This is used to resume iteration from the last checkpoint.

impl<C, H, K> TrieNodeIter<C, H, K>

where C: TrieCursor, H: HashedCursor, H::Value: Clone, K: AsRef<AddedRemovedKeys>,

pub fn try_next( &mut self, ) -> Result<Option<TrieElement<<H as HashedCursor>::Value>>, DatabaseError>

Return the next trie node to be added to the hash builder.

Returns the nodes using this algorithm:

1. Return the current intermediate branch node if it hasn’t been updated.
2. Advance the trie walker to the next intermediate branch node and retrieve next unprocessed key.
3. Reposition the hashed cursor on the next unprocessed key.
4. Return every hashed entry up to the key of the current intermediate branch node.
5. Repeat.

NOTE: The iteration will start from the key of the previous hashed entry if it was supplied.

Trait Implementations

impl<C: Debug, H: Debug + HashedCursor, K: Debug> Debug for TrieNodeIter<C, H, K>

where H::Value: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.