Struct indy_data_types::merkle_tree::MerkleTree

pub struct MerkleTree {
    pub root: Tree,
    pub height: usize,
    pub count: usize,
    pub nodes_count: usize,
}

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

root: Tree

The root of the inner binary tree

height: usize

The height of the tree

count: usize

The number of leaf nodes in the tree

nodes_count: usize

The number of nodes in the tree

Implementations

impl MerkleTree

pub fn from_vec(values: Vec<Vec<u8>>) -> Result<Self, ValidationError>

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

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

Returns the root hash of Merkle tree

pub fn root_hash_hex(&self) -> String

Returns the hex root hash of Merkle tree

pub fn height(&self) -> usize

Returns the height of Merkle tree

pub fn count(&self) -> usize

Returns the number of leaves in the Merkle tree

pub fn is_empty(&self) -> bool

Returns whether the Merkle tree is empty or not

pub fn gen_proof( &self, value: Vec<u8> ) -> Result<Option<Proof>, ValidationError>

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

pub fn iter(&self) -> LeavesIterator<'_>

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

impl MerkleTree

pub fn find_hash<'a>( from: &'a Tree, required_hash: &Vec<u8> ) -> Option<&'a Tree>

pub fn consistency_proof( &self, new_root_hash: &Vec<u8>, new_size: usize, proof: &[Vec<u8>] ) -> Result<bool, ValidationError>

pub fn append(&mut self, node: Vec<u8>) -> Result<(), ValidationError>

pub fn check_inclusion_proof( root_hash: &[u8], leaf_value: &Vec<u8>, path: &[Positioned<Vec<u8>>] ) -> Result<bool, ValidationError>

Trait Implementations

impl Clone for MerkleTree

fn clone(&self) -> MerkleTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleTree

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

Formats the value using the given formatter.

impl Default for MerkleTree

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for MerkleTree

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a> IntoIterator for &'a MerkleTree

fn into_iter(self) -> Self::IntoIter

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

type Item = &'a Vec<u8>

The type of the elements being iterated over.

type IntoIter = LeavesIterator<'a>

Which kind of iterator are we turning this into?

impl IntoIterator for MerkleTree

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.

type Item = Vec<u8>

The type of the elements being iterated over.

type IntoIter = LeavesIntoIterator

Which kind of iterator are we turning this into?

impl Serialize for MerkleTree

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.