Struct MerkleTree 

pub struct MerkleTree<B: IsMerkleTreeBackend> {
    pub root: B::Node,
    /* private fields */
}

The struct for the Merkle tree, consisting of the root and the nodes. A typical tree would look like this root /
leaf 12 leaf 34 / \ /
leaf 1 leaf 2 leaf 3 leaf 4 The bottom leafs correspond to the hashes of the elements, while each upper layer contains the hash of the concatenation of the daughter nodes.

Fields

root: B::Node

Implementations

impl<B> MerkleTree<B>

where B: IsMerkleTreeBackend,

pub fn build(unhashed_leaves: &[B::Data]) -> Option<Self>

Create a Merkle tree from a slice of data

pub fn get_proof_by_pos(&self, pos: usize) -> Option<Proof<B::Node>>

Returns a Merkle proof for the element/s at position pos For example, give me an inclusion proof for the 3rd element in the Merkle tree

Trait Implementations

impl<B: Clone + IsMerkleTreeBackend> Clone for MerkleTree<B>

where B::Node: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.