Struct StorageTrieUpdatesSortedRef 

pub struct StorageTrieUpdatesSortedRef<'a> {
    pub storage_nodes: BTreeMap<&'a Nibbles, &'a BranchNodeCompact>,
    pub removed_nodes: BTreeSet<&'a Nibbles>,
}

Sorted storage trie updates reference used for serializing to file.

Fields

storage_nodes: BTreeMap<&'a Nibbles, &'a BranchNodeCompact>

Sorted collection of updated storage nodes with corresponding paths.

removed_nodes: BTreeSet<&'a Nibbles>

The set of removed storage node keys.

Trait Implementations

impl<'a> Clone for StorageTrieUpdatesSortedRef<'a>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for StorageTrieUpdatesSortedRef<'a>

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

Formats the value using the given formatter.

impl<'a> Default for StorageTrieUpdatesSortedRef<'a>

fn default() -> Self

Returns the “default value” for a type.

impl<'a> Eq for StorageTrieUpdatesSortedRef<'a>

impl<'a> PartialEq for StorageTrieUpdatesSortedRef<'a>

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

Equality operator ==.

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

Inequality operator !=.

impl<'a> Serialize for StorageTrieUpdatesSortedRef<'a>

Available on crate features serde only.

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a> StructuralPartialEq for StorageTrieUpdatesSortedRef<'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: 48 bytes