Struct merkle::MerkleTree
[−]
[src]
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>
[src]
fn from_vec(algorithm: &'static Algorithm, values: Vec<T>) -> Self where
T: Hashable,
[src]
T: Hashable,
Constructs a Merkle Tree from a vector of data blocks.
Returns None
if values
is empty.
fn root_hash(&self) -> &Vec<u8>
[src]
Returns the root hash of Merkle tree
fn height(&self) -> usize
[src]
Returns the height of Merkle tree
fn count(&self) -> usize
[src]
Returns the number of leaves in the Merkle tree
fn is_empty(&self) -> bool
[src]
Returns whether the Merkle tree is empty or not
fn gen_proof(&self, value: T) -> Option<Proof<T>> where
T: Hashable,
[src]
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>
[src]
Creates an Iterator
over the values contained in this Merkle tree.
Trait Implementations
impl<T: Clone> Clone for MerkleTree<T>
[src]
fn clone(&self) -> MerkleTree<T>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<T: Debug> Debug for MerkleTree<T>
[src]
impl<T: PartialEq> PartialEq for MerkleTree<T>
[src]
fn eq(&self, other: &MerkleTree<T>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<T: Eq> Eq for MerkleTree<T>
[src]
impl<T: Ord> PartialOrd for MerkleTree<T>
[src]
fn partial_cmp(&self, other: &MerkleTree<T>) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl<T: Ord> Ord for MerkleTree<T>
[src]
fn cmp(&self, other: &MerkleTree<T>) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.22.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.22.0[src]
Compares and returns the minimum of two values. Read more
impl<T: Hash> Hash for MerkleTree<T>
[src]
fn hash<H: Hasher>(&self, state: &mut H)
[src]
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<T> IntoIterator for MerkleTree<T>
[src]
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
[src]
Creates a consuming iterator, that is, one that moves each value out of the Merkle tree. The tree cannot be used after calling this.