Enum Node 

pub enum Node {
    Empty,
    Digest([u8; 32]),
}

Available on crate feature unstable only.

A node in the Merkle tree.

Empty represents an empty subtree (used to pad odd-sized levels and to represent the root of a tree built from zero leaves). Digest carries the 32-byte Blake2b256 hash of either a leaf or an inner node.

Variants

Empty

A subtree with no leaves underneath it.

Digest([u8; 32])

A non-empty node carrying its 32-byte hash.

Implementations

impl Node

pub fn bytes(&self) -> [u8; 32]

Returns the 32-byte representation of this node. Empty is rendered as the all-zero digest.

Trait Implementations

impl AsRef<[u8]> for Node

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl From<[u8; 32]> for Node

fn from(value: [u8; 32]) -> Self

Converts to this type from the input type.

impl From<Digest> for Node

fn from(value: Digest) -> Self

Converts to this type from the input type.

impl Hash for Node

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Node

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for Node

impl Eq for Node

impl StructuralPartialEq for Node