Struct StateRoot 

pub struct StateRoot<T, H> {
    pub trie_cursor_factory: T,
    pub hashed_cursor_factory: H,
    pub prefix_sets: TriePrefixSets,
    /* private fields */
}

StateRoot is used to compute the root node of a state trie.

Fields

trie_cursor_factory: T

The factory for trie cursors.

hashed_cursor_factory: H

The factory for hashed cursors.

prefix_sets: TriePrefixSets

A set of prefix sets that have changed.

Implementations

impl<T, H> StateRoot<T, H>

pub fn new(trie_cursor_factory: T, hashed_cursor_factory: H) -> Self

Creates StateRoot with trie_cursor_factory and hashed_cursor_factory. All other parameters are set to reasonable defaults.

The cursors created by given factories are then used to walk through the accounts and calculate the state root value with.

pub fn with_prefix_sets(self, prefix_sets: TriePrefixSets) -> Self

Set the prefix sets.

pub const fn with_walk_all_changed_branch_children(self, enabled: bool) -> Self

Configures the state root walker to visit all children of changed branch paths.

When updates are retained, also removes stored descendants hidden by a changed branch’s tree mask. Regenerated branch updates take precedence over these deletions.

pub const fn with_threshold(self, threshold: u64) -> Self

Set the threshold.

pub const fn with_no_threshold(self) -> Self

Set the threshold to maximum value so that intermediate progress is not returned.

pub fn with_intermediate_state( self, state: Option<IntermediateStateRootState>, ) -> Self

Set the previously recorded intermediate state.

pub fn with_hashed_cursor_factory<HF>( self, hashed_cursor_factory: HF, ) -> StateRoot<T, HF>

Set the hashed cursor factory.

pub fn with_trie_cursor_factory<TF>( self, trie_cursor_factory: TF, ) -> StateRoot<TF, H>

Set the trie cursor factory.

impl<T, H> StateRoot<T, H>

where T: TrieCursorFactory, H: HashedCursorFactory,

pub fn root_with_updates(self) -> Result<(B256, TrieUpdates), StateRootError>

Walks the intermediate nodes of existing state trie (if any) and hashed entries. Feeds the nodes into the hash builder. Collects the updates in the process.

Ignores the threshold.

Returns

The state root and the trie updates.

pub fn root(self) -> Result<B256, StateRootError>

Walks the intermediate nodes of existing state trie (if any) and hashed entries. Feeds the nodes into the hash builder.

Returns

The state root hash.

pub fn root_with_progress(self) -> Result<StateRootProgress, StateRootError>

Walks the intermediate nodes of existing state trie (if any) and hashed entries. Feeds the nodes into the hash builder. Collects the updates in the process.

Returns

The intermediate progress of state root computation.

Trait Implementations

impl<T: Debug, H: Debug> Debug for StateRoot<T, H>

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.