Struct TrieUpdates 

pub struct TrieUpdates {
    pub account_nodes: HashMap<Nibbles, BranchNodeCompact, DefaultHashBuilder>,
    pub removed_nodes: HashSet<Nibbles, DefaultHashBuilder>,
    pub storage_tries: HashMap<FixedBytes<32>, StorageTrieUpdates, FbBuildHasher<32>>,
}

The aggregation of trie updates.

Fields

account_nodes: HashMap<Nibbles, BranchNodeCompact, DefaultHashBuilder>

Collection of updated intermediate account nodes indexed by full path.

removed_nodes: HashSet<Nibbles, DefaultHashBuilder>

Collection of removed intermediate account nodes indexed by full path.

storage_tries: HashMap<FixedBytes<32>, StorageTrieUpdates, FbBuildHasher<32>>

Collection of updated storage tries indexed by the hashed address.

Implementations

impl TrieUpdates

pub fn with_capacity(account_nodes: usize, storage_tries: usize) -> TrieUpdates

Creates a new TrieUpdates with pre-allocated capacity.

pub fn is_empty(&self) -> bool

Returns true if the updates are empty.

pub const fn account_nodes_ref( &self, ) -> &HashMap<Nibbles, BranchNodeCompact, DefaultHashBuilder>

Returns reference to updated account nodes.

pub const fn removed_nodes_ref(&self) -> &HashSet<Nibbles, DefaultHashBuilder>

Returns a reference to removed account nodes.

pub const fn storage_tries_ref( &self, ) -> &HashMap<FixedBytes<32>, StorageTrieUpdates, FbBuildHasher<32>>

Returns a reference to updated storage tries.

pub fn extend(&mut self, other: TrieUpdates)

Extends the trie updates.

pub fn extend_ref(&mut self, other: &TrieUpdates)

Extends the trie updates.

Slightly less efficient than Self::extend, but preferred to extend(other.clone()).

pub fn extend_from_sorted(&mut self, sorted: &TrieUpdatesSorted)

Extend trie updates with sorted data, converting directly into the unsorted HashMap representation. This is more efficient than first converting to TrieUpdates and then extending, as it avoids creating intermediate HashMap allocations.

This top-level helper merges account nodes and delegates each account’s storage trie to StorageTrieUpdates::extend_from_sorted.

pub fn insert_storage_updates( &mut self, hashed_address: FixedBytes<32>, storage_updates: StorageTrieUpdates, )

Insert storage updates for a given hashed address.

pub fn finalize( &mut self, hash_builder: HashBuilder, removed_keys: HashSet<Nibbles, DefaultHashBuilder>, destroyed_storage_trie_nodes: HashMap<FixedBytes<32>, Vec<Nibbles>, FbBuildHasher<32>>, )

Finalize state trie updates.

pub fn into_sorted(self) -> TrieUpdatesSorted

Converts trie updates into TrieUpdatesSorted.

pub fn clone_into_sorted(&self) -> TrieUpdatesSorted

Creates a sorted copy without consuming self. More efficient than .clone().into_sorted() as it avoids cloning HashMap metadata.

pub fn to_sorted_ref(&self) -> TrieUpdatesSortedRef<'_>

Allocates sorted collections borrowing the trie updates as TrieUpdatesSortedRef.

pub fn clear(&mut self)

Clears the nodes and storage trie maps in this TrieUpdates.

Trait Implementations

impl Clone for TrieUpdates

fn clone(&self) -> TrieUpdates

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TrieUpdates

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

Formats the value using the given formatter.

impl Default for TrieUpdates

fn default() -> TrieUpdates

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TrieUpdates

fn deserialize<__D>( __deserializer: __D, ) -> Result<TrieUpdates, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'de> DeserializeAs<'de, TrieUpdates> for TrieUpdates<'de>

fn deserialize_as<D>( deserializer: D, ) -> Result<TrieUpdates, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for TrieUpdates

impl<'a> From<&'a TrieUpdates> for TrieUpdates<'a>

fn from(value: &'a TrieUpdates) -> TrieUpdates<'a>

Converts to this type from the input type.

impl<'a> From<TrieUpdates<'a>> for TrieUpdates

fn from(value: TrieUpdates<'a>) -> TrieUpdates

Converts to this type from the input type.

impl From<TrieUpdatesSorted> for TrieUpdates

fn from(sorted: TrieUpdatesSorted) -> TrieUpdates

Converts to this type from the input type.

impl PartialEq for TrieUpdates

fn eq(&self, other: &TrieUpdates) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for TrieUpdates

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SerializeAs<TrieUpdates> for TrieUpdates<'_>

fn serialize_as<S>( source: &TrieUpdates, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TrieUpdates

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: 120 bytes