pub struct NonMembershipProof<H: Hasher> {
    pub label: NodeLabel,
    pub longest_prefix: NodeLabel,
    pub longest_prefix_children: [Node<H>; 2],
    pub longest_prefix_membership_proof: MembershipProof<H>,
}
Expand description

Merkle Patricia proof of non-membership for a NodeLabel in the tree at a given epoch.

Fields

label: NodeLabel

The label in question

longest_prefix: NodeLabel

The longest prefix in the tree

longest_prefix_children: [Node<H>; 2]

The children of the longest prefix

longest_prefix_membership_proof: MembershipProof<H>

The membership proof of the longest prefix

Trait Implementations

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more
This method tests for self and other values to be equal, and is used by ==. Read more
This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
Compare self to key and return true if they are equal.

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.