Struct TrieTestHarness 

pub struct TrieTestHarness { /* private fields */ }

Available on crate features test-utils only.

General-purpose test harness for storage trie tests.

Manages a base storage dataset, computes expected roots via StorageRoot, and generates V2 proofs via StorageProofCalculator using mock cursors.

Implementations

impl TrieTestHarness

pub fn new(storage: BTreeMap<B256, U256>) -> Self

Creates a new test harness from a map of hashed storage slots to values.

pub fn get_root_with_updates( &self, changeset: &BTreeMap<B256, U256>, ) -> (B256, StorageTrieUpdates)

Computes the storage root and trie updates after applying the given changeset on top of the current base storage.

Builds a HashedPostStateCursorFactory overlay, derives a prefix set from the changeset keys, and passes both into StorageRoot::new_hashed.

pub fn apply_changeset(&mut self, changeset: BTreeMap<B256, U256>)

Merges changeset into the base storage (zero values remove entries) and rebuilds the harness from scratch with the resulting storage.

pub const fn hashed_address(&self) -> B256

Returns the hashed address used for all storage trie operations.

pub const fn storage(&self) -> &BTreeMap<B256, U256>

Returns a reference to the base storage dataset.

pub const fn original_root(&self) -> B256

Returns the expected storage root.

pub const fn storage_trie_updates(&self) -> &StorageTrieUpdates

Returns a reference to the storage trie updates.

pub fn set_trie_nodes( &mut self, trie_nodes: BTreeMap<Nibbles, BranchNodeCompact>, )

Replaces the trie cursor factory with one backed by the given trie nodes.

pub fn trie_cursor_factory(&self) -> MockTrieCursorFactory

Returns a clone of the mock trie cursor factory.

pub fn hashed_cursor_factory(&self) -> MockHashedCursorFactory

Returns a clone of the mock hashed cursor factory.

pub fn root_node(&self) -> ProofTrieNodeV2

Obtains the root node of the storage trie via StorageProofCalculator.

pub fn proof_v2( &self, targets: &mut [ProofV2Target], ) -> (Vec<ProofTrieNodeV2>, Option<B256>)

Generates storage proofs for the given targets using StorageProofCalculator.

Also computes and returns the root hash (if the proof contains a root node) by reusing the calculator after the proof call.

pub fn minimize_trie_updates(&self, updates: &mut StorageTrieUpdates)

Removes all entries from updates that are redundant with the starting storage trie updates.

A storage node is redundant if it exists in the starting set with the same value. A removed node is redundant if it was already absent from the starting set.

Trait Implementations

impl Debug for TrieTestHarness

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

Formats the value using the given formatter.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 200 bytes