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 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> where T: Into<Vec<u8>> + Clone

fn from_vec(algo: &'static Algorithm, values: Vec<T>) -> Option<Self>

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 gen_proof(&self, value: T) -> Option<Proof<T>>

Generate an inclusion proof for the given value. Returns None if the given value is not found in the 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.