Struct merkle::MerkleTree

pub struct MerkleTree<T> {
    pub algorithm: &'static Algorithm,
    // some fields omitted
}

A Merkle tree is a binary tree, with values of type T at the leafs, and where every internal node holds the hash of the concatenation of the hashes of its children nodes.

Fields

algorithm: &'static Algorithm

The hashing algorithm used by this Merkle tree

Methods

impl<T> MerkleTree<T>

fn from_vec(algorithm: &'static Algorithm, values: Vec<T>) -> Self where
    T: Hashable, 

Constructs a Merkle Tree from a vector of data blocks. Returns None if values is empty.

fn root_hash(&self) -> &Vec<u8>

Returns the root hash of Merkle tree

fn height(&self) -> usize

Returns the height of Merkle tree

fn count(&self) -> usize

Returns the number of leaves in the Merkle tree

fn is_empty(&self) -> bool

Returns whether the Merkle tree is empty or not

fn gen_proof(&self, value: T) -> Option<Proof<T>> where
    T: Hashable, 

Generate an inclusion proof for the given value. Returns None if the given value is not found in the tree.

fn iter(&self) -> LeavesIterator<T>

Creates an Iterator over the values contained in this Merkle tree.

Trait Implementations

impl<T: Clone> Clone for MerkleTree<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for MerkleTree<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> IntoIterator for MerkleTree<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = LeavesIntoIterator<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates a consuming iterator, that is, one that moves each value out of the Merkle tree. The tree cannot be used after calling this.

impl<'a, T> IntoIterator for &'a MerkleTree<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = LeavesIterator<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates a borrowing Iterator over the values contained in this Merkle tree.