Struct akd::proof_structs::NonMembershipProof
source · [−]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
sourceimpl<H: Hasher> Clone for NonMembershipProof<H>
impl<H: Hasher> Clone for NonMembershipProof<H>
sourceimpl<H: Debug + Hasher> Debug for NonMembershipProof<H>
impl<H: Debug + Hasher> Debug for NonMembershipProof<H>
sourceimpl<H: PartialEq + Hasher> PartialEq<NonMembershipProof<H>> for NonMembershipProof<H>
impl<H: PartialEq + Hasher> PartialEq<NonMembershipProof<H>> for NonMembershipProof<H>
sourcefn eq(&self, other: &NonMembershipProof<H>) -> bool
fn eq(&self, other: &NonMembershipProof<H>) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &NonMembershipProof<H>) -> bool
fn ne(&self, other: &NonMembershipProof<H>) -> bool
This method tests for !=
.
impl<H: Hasher> StructuralPartialEq for NonMembershipProof<H>
Auto Trait Implementations
impl<H> RefUnwindSafe for NonMembershipProof<H> where
<H as Hasher>::Digest: RefUnwindSafe,
impl<H> Send for NonMembershipProof<H>
impl<H> Sync for NonMembershipProof<H>
impl<H> Unpin for NonMembershipProof<H> where
<H as Hasher>::Digest: Unpin,
impl<H> UnwindSafe for NonMembershipProof<H> where
<H as Hasher>::Digest: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more