Struct Tree 

pub struct Tree<T: AsRef<[u8]>> {
    pub inner: NodeType<T>,
}

A merkle tree

Example

use irkle::Tree;

fn main() {
    println!("{:#?}", Tree::new(vec!["hello", "there"]));
}

Fields

inner: NodeType<T>

Type of node contained inside the tree or represents an empty tree

Implementations

impl<T: AsRef<[u8]>> Tree<T>

pub fn new<D: IntoIterator<Item = T>>(datapoints: D) -> Self

Creates a new Tree based off of data supplied in data

Trait Implementations

impl<T: Clone + AsRef<[u8]>> Clone for Tree<T>

fn clone(&self) -> Tree<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + AsRef<[u8]>> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T: AsRef<[u8]>> NodeMethod<T> for Tree<T>

fn get_hash(&self) -> Hash

Gets the blake3-based [Hash] for trait implementation, just call on any Node, Data or NodeType like so: item.get_hash(). Typically all this method will do is get the self.hash but this can be used to adapt a broader NodeType

fn verify(&self) -> Result<(), (Hash, Hash)>

Verifies the node down through recursion, providing a high-level checking/verification method

impl<T: PartialEq + AsRef<[u8]>> PartialEq for Tree<T>

fn eq(&self, other: &Tree<T>) -> 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<T: AsRef<[u8]>> StructuralPartialEq for Tree<T>