Struct akd_client::NonMembershipProof

pub struct NonMembershipProof {
    pub label: NodeLabel,
    pub longest_prefix: NodeLabel,
    pub longest_prefix_children: [AzksElement; 2],
    pub longest_prefix_membership_proof: MembershipProof,
}

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: [AzksElement; 2]

The children of the longest prefix

longest_prefix_membership_proof: MembershipProof

The membership proof of the longest prefix

Trait Implementations

impl Clone for NonMembershipProof

fn clone(&self) -> NonMembershipProof

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NonMembershipProof

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

Formats the value using the given formatter.

impl PartialEq<NonMembershipProof> for NonMembershipProof

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for NonMembershipProof

impl StructuralEq for NonMembershipProof

impl StructuralPartialEq for NonMembershipProof