Enum binary_merkle_tree::Leaf

pub enum Leaf<'a, H> {
    Value(&'a [u8]),
    Hash(H),
}

Leaf node for proof verification.

Can be either a value that needs to be hashed first, or the hash itself.

Variants

Value(&'a [u8])

Leaf content.

Hash(H)

Hash of the leaf content.

Trait Implementations

impl<'a, H: Debug> Debug for Leaf<'a, H>

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

Formats the value using the given formatter.

impl<'a, H, T: AsRef<[u8]>> From<&'a T> for Leaf<'a, H>

fn from(v: &'a T) -> Self

Converts to this type from the input type.

impl<'a, H: PartialEq> PartialEq<Leaf<'a, H>> for Leaf<'a, H>

fn eq(&self, other: &Leaf<'a, H>) -> 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<'a, H: Eq> Eq for Leaf<'a, H>

impl<'a, H> StructuralEq for Leaf<'a, H>

impl<'a, H> StructuralPartialEq for Leaf<'a, H>