Struct akd::proof_structs::MembershipProof
source · pub struct MembershipProof<H: Hasher> {
pub label: NodeLabel,
pub hash_val: H::Digest,
pub layer_proofs: Vec<LayerProof<H>>,
}
Expand description
Merkle proof of membership of a NodeLabel
with a particular hash value
in the tree at a given epoch.
Fields
label: NodeLabel
The node label
hash_val: H::Digest
The hash of the value
layer_proofs: Vec<LayerProof<H>>
The proofs at the layers up the tree
Trait Implementations
sourceimpl<H: Hasher> Clone for MembershipProof<H>
impl<H: Hasher> Clone for MembershipProof<H>
sourceimpl<H: PartialEq + Hasher> PartialEq<MembershipProof<H>> for MembershipProof<H>where
H::Digest: PartialEq,
impl<H: PartialEq + Hasher> PartialEq<MembershipProof<H>> for MembershipProof<H>where
H::Digest: PartialEq,
sourcefn eq(&self, other: &MembershipProof<H>) -> bool
fn eq(&self, other: &MembershipProof<H>) -> bool
impl<H: Eq + Hasher> Eq for MembershipProof<H>where
H::Digest: Eq,
impl<H: Hasher> StructuralEq for MembershipProof<H>
impl<H: Hasher> StructuralPartialEq for MembershipProof<H>
Auto Trait Implementations
impl<H> RefUnwindSafe for MembershipProof<H>where
<H as Hasher>::Digest: RefUnwindSafe,
impl<H> Send for MembershipProof<H>
impl<H> Sync for MembershipProof<H>
impl<H> Unpin for MembershipProof<H>where
<H as Hasher>::Digest: Unpin,
impl<H> UnwindSafe for MembershipProof<H>where
<H as Hasher>::Digest: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
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
sourceimpl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.