Struct StorageRoot

pub struct StorageRoot<T, H> {
    pub trie_cursor_factory: T,
    pub hashed_cursor_factory: H,
    pub hashed_address: FixedBytes<32>,
    pub prefix_set: PrefixSet,
    /* private fields */
}

Available on crate feature trie only.

StorageRoot is used to compute the root node of an account storage trie.

Fields

trie_cursor_factory: T

A reference to the database transaction.

hashed_cursor_factory: H

The factory for hashed cursors.

hashed_address: FixedBytes<32>

The hashed address of an account.

prefix_set: PrefixSet

The set of storage slot prefixes that have changed.

Implementations

impl<T, H> StorageRoot<T, H>

pub fn new( trie_cursor_factory: T, hashed_cursor_factory: H, address: Address, prefix_set: PrefixSet, metrics: TrieRootMetrics, ) -> StorageRoot<T, H>

Creates a new storage root calculator given a raw address.

pub const fn new_hashed( trie_cursor_factory: T, hashed_cursor_factory: H, hashed_address: FixedBytes<32>, prefix_set: PrefixSet, metrics: TrieRootMetrics, ) -> StorageRoot<T, H>

Creates a new storage root calculator given a hashed address.

pub fn with_prefix_set(self, prefix_set: PrefixSet) -> StorageRoot<T, H>

Set the changed prefixes.

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

Set the hashed cursor factory.

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

Set the trie cursor factory.

impl<T, H> StorageRoot<T, H>

where T: TrieCursorFactory, H: HashedCursorFactory,

pub fn root_with_updates( self, ) -> Result<(FixedBytes<32>, usize, StorageTrieUpdates), StorageRootError>

Walks the hashed storage table entries for a given address and calculates the storage root.

Returns

The storage root and storage trie updates for a given address.

pub fn root(self) -> Result<FixedBytes<32>, StorageRootError>

Walks the hashed storage table entries for a given address and calculates the storage root.

Returns

The storage root.

pub fn calculate( self, retain_updates: bool, ) -> Result<(FixedBytes<32>, usize, StorageTrieUpdates), StorageRootError>

Walks the hashed storage table entries for a given address and calculates the storage root.

Returns

The storage root, number of walked entries and trie updates for a given address if requested.

Trait Implementations

impl<'a, TX> DatabaseStorageRoot<'a, TX> for StorageRoot<DatabaseTrieCursorFactory<'a, TX>, DatabaseHashedCursorFactory<'a, TX>>

where TX: DbTx,

fn from_tx( tx: &'a TX, address: Address, ) -> StorageRoot<DatabaseTrieCursorFactory<'a, TX>, DatabaseHashedCursorFactory<'a, TX>>

Create a new storage root calculator from database transaction and raw address.

fn from_tx_hashed( tx: &'a TX, hashed_address: FixedBytes<32>, ) -> StorageRoot<DatabaseTrieCursorFactory<'a, TX>, DatabaseHashedCursorFactory<'a, TX>>

Create a new storage root calculator from database transaction and hashed address.

fn overlay_root( tx: &'a TX, address: Address, hashed_storage: HashedStorage, ) -> Result<FixedBytes<32>, StorageRootError>

Calculates the storage root for this HashedStorage and returns it.

impl<T, H> Debug for StorageRoot<T, H>

where T: Debug, H: Debug,

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

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.