Struct ProofTrieNodeV2 

pub struct ProofTrieNodeV2 {
    pub path: Nibbles,
    pub node: TrieNodeV2,
    pub masks: Option<BranchNodeMasks>,
}

Carries all information needed by a sparse trie to reveal a particular node.

Fields

path: Nibbles

Path of the node.

node: TrieNodeV2

The node itself.

masks: Option<BranchNodeMasks>

Tree and hash masks for the node, if known. Both masks are always set together (from database branch nodes).

Implementations

impl ProofTrieNodeV2

pub fn empty() -> ProofTrieNodeV2

Creates an empty ProofTrieNodeV2 with an empty root node. Useful as a placeholder when taking a node out of a slice via core::mem::replace.

pub fn from_sorted_trie_nodes( iter: impl IntoIterator<Item = (Nibbles, TrieNode, Option<BranchNodeMasks>)>, ) -> Vec<ProofTrieNodeV2>

Converts an iterator of (path, TrieNode, masks) tuples into Vec<ProofTrieNodeV2>, merging extension nodes into their child branch nodes.

The input must be sorted in depth-first order (children before parents) for extension merging to work correctly.

Trait Implementations

impl Clone for ProofTrieNodeV2

fn clone(&self) -> ProofTrieNodeV2

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofTrieNodeV2

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

Formats the value using the given formatter.

impl Eq for ProofTrieNodeV2

impl PartialEq for ProofTrieNodeV2

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ProofTrieNodeV2

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