Struct TrieUpdatesSortedRef 

pub struct TrieUpdatesSortedRef<'a> {
    pub account_nodes: Vec<(&'a Nibbles, &'a BranchNodeCompact)>,
    pub removed_nodes: BTreeSet<&'a Nibbles>,
    pub storage_tries: BTreeMap<FixedBytes<32>, StorageTrieUpdatesSortedRef<'a>>,
}

Sorted trie updates reference used for serializing trie to file.

Fields

account_nodes: Vec<(&'a Nibbles, &'a BranchNodeCompact)>

Sorted collection of updated state nodes with corresponding paths.

removed_nodes: BTreeSet<&'a Nibbles>

The set of removed state node keys.

storage_tries: BTreeMap<FixedBytes<32>, StorageTrieUpdatesSortedRef<'a>>

Storage tries stored by hashed address of the account the trie belongs to.

Trait Implementations

impl<'a> Clone for TrieUpdatesSortedRef<'a>

fn clone(&self) -> TrieUpdatesSortedRef<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for TrieUpdatesSortedRef<'a>

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

Formats the value using the given formatter.

impl<'a> Default for TrieUpdatesSortedRef<'a>

fn default() -> TrieUpdatesSortedRef<'a>

Returns the “default value” for a type.

impl<'a> Eq for TrieUpdatesSortedRef<'a>

impl<'a> PartialEq for TrieUpdatesSortedRef<'a>

fn eq(&self, other: &TrieUpdatesSortedRef<'a>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<'a> Serialize for TrieUpdatesSortedRef<'a>

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<'a> StructuralPartialEq for TrieUpdatesSortedRef<'a>

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