Struct StorageTrieUpdates 

pub struct StorageTrieUpdates {
    pub storage_nodes: HashMap<Nibbles, BranchNodeCompact, DefaultHashBuilder>,
    pub removed_nodes: HashSet<Nibbles, DefaultHashBuilder>,
}

Trie updates for storage trie of a single account.

Fields

storage_nodes: HashMap<Nibbles, BranchNodeCompact, DefaultHashBuilder>

Collection of updated storage trie nodes.

removed_nodes: HashSet<Nibbles, DefaultHashBuilder>

Collection of removed storage trie nodes.

Implementations

impl StorageTrieUpdates

pub fn new( updates: impl IntoIterator<Item = (Nibbles, BranchNodeCompact)>, ) -> StorageTrieUpdates

Available on crate feature test-utils only.

Creates storage trie updates from the provided nodes.

impl StorageTrieUpdates

pub fn len(&self) -> usize

Returns the length of updated nodes.

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

Returns reference to updated storage nodes.

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

Returns reference to removed storage nodes.

pub fn is_empty(&self) -> bool

Returns true if storage updates are empty.

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

Extends storage trie updates.

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

Extends storage trie updates.

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

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

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

This is invoked from TrieUpdates::extend_from_sorted for each account.

pub fn finalize( &mut self, hash_builder: HashBuilder, removed_keys: HashSet<Nibbles, DefaultHashBuilder>, )

Finalize storage trie updates for by taking updates from walker and hash builder.

pub fn into_sorted(self) -> StorageTrieUpdatesSorted

Convert storage trie updates into StorageTrieUpdatesSorted.

pub fn clone_into_sorted(&self) -> StorageTrieUpdatesSorted

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) -> StorageTrieUpdatesSortedRef<'_>

Allocates sorted collections borrowing the storage updates as StorageTrieUpdatesSortedRef.

Trait Implementations

impl Clone for StorageTrieUpdates

fn clone(&self) -> StorageTrieUpdates

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StorageTrieUpdates

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

Formats the value using the given formatter.

impl Default for StorageTrieUpdates

fn default() -> StorageTrieUpdates

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for StorageTrieUpdates

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

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

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for StorageTrieUpdates

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

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

Converts to this type from the input type.

impl<'a> From<StorageTrieUpdates<'a>> for StorageTrieUpdates

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

Converts to this type from the input type.

impl From<StorageTrieUpdatesSorted> for StorageTrieUpdates

fn from(sorted: StorageTrieUpdatesSorted) -> StorageTrieUpdates

Converts to this type from the input type.

impl PartialEq for StorageTrieUpdates

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for StorageTrieUpdates

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<StorageTrieUpdates> for StorageTrieUpdates<'_>

fn serialize_as<S>( source: &StorageTrieUpdates, 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 StorageTrieUpdates

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