Enum HashTree 

pub enum HashTree<'a> {
    Empty,
    Fork(Box<ForkInner<'a>>),
    Labeled(Cow<'a, [u8]>, Box<HashTree<'a>>),
    Leaf(Cow<'a, [u8]>),
    Pruned(Hash),
}

HashTree as defined in the interfaces spec. https://sdk.dfinity.org/docs/interface-spec/index.html#_certificate

Variants

Empty

Fork(Box<ForkInner<'a>>)

Labeled(Cow<'a, [u8]>, Box<HashTree<'a>>)

Leaf(Cow<'a, [u8]>)

Pruned(Hash)

Implementations

impl<'a> HashTree<'a>

pub fn reconstruct(&self) -> Hash

pub fn get_labels<'b: 'a>(&'b self) -> Vec<&'b [u8]>

Collect and return all of the labels in this HashTree.

This method is intended for testing purposes.

pub fn get_leaf_values<'b: 'a>(&'b self) -> Vec<&'b [u8]>

Collect and return all of the values in this HashTree.

This method is intended for testing purposes.

Trait Implementations

impl<'a> Debug for HashTree<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for HashTree<'a>

fn eq(&self, other: &HashTree<'a>) -> 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 Serialize for HashTree<'_>

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a> Eq for HashTree<'a>

impl<'a> StructuralPartialEq for HashTree<'a>