Struct InclusionProof 

pub struct InclusionProof {
    pub leaf_index: u64,
    pub tree_size: u64,
    pub audit_path: Vec<[u8; 32]>,
}

An inclusion proof: the siblings along the path from a leaf to the Merkle root, innermost first.

Fields

leaf_index: u64

Leaf index the proof refers to.

tree_size: u64

Tree size at the time the proof was generated.

audit_path: Vec<[u8; 32]>

Merkle audit path (siblings, innermost first).

Trait Implementations

impl Clone for InclusionProof

fn clone(&self) -> InclusionProof

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InclusionProof

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

Formats the value using the given formatter.

impl PartialEq for InclusionProof

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for InclusionProof

impl StructuralPartialEq for InclusionProof