[−][src]Struct merkle::MerkleTree
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]
pub 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.
pub fn root_hash(&self) -> &Vec<u8>
[src]
Returns the root hash of Merkle tree
pub fn height(&self) -> usize
[src]
Returns the height of Merkle tree
pub fn count(&self) -> usize
[src]
Returns the number of leaves in the Merkle tree
pub fn is_empty(&self) -> bool
[src]
Returns whether the Merkle tree is empty or not
pub 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.
pub fn gen_nth_proof(&self, n: usize) -> Option<Proof<T>> where
T: Hashable + Clone,
[src]
T: Hashable + Clone,
Generate an inclusion proof for the n
-th leaf value.
ⓘImportant traits for LeavesIterator<'a, T>pub 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]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<T: Ord> Ord for MerkleTree<T>
[src]
fn cmp(&self, other: &MerkleTree<T>) -> Ordering
[src]
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more
fn clamp(self, min: Self, max: Self) -> Self
[src]
clamp
)Restrict a value to a certain interval. 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.
impl<'a, T> IntoIterator for &'a MerkleTree<T>
[src]
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
[src]
Creates a borrowing Iterator
over the values contained in this Merkle tree.
impl<T: Ord> PartialOrd<MerkleTree<T>> for MerkleTree<T>
[src]
fn partial_cmp(&self, other: &MerkleTree<T>) -> Option<Ordering>
[src]
#[must_use]
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
#[must_use]
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
#[must_use]
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
#[must_use]
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: PartialEq> PartialEq<MerkleTree<T>> for MerkleTree<T>
[src]
fn eq(&self, other: &MerkleTree<T>) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<T: Eq> Eq for MerkleTree<T>
[src]
impl<T: Debug> Debug for MerkleTree<T>
[src]
impl<T: Hash> Hash for MerkleTree<T>
[src]
Auto Trait Implementations
impl<T> Sync for MerkleTree<T> where
T: Sync,
T: Sync,
impl<T> Send for MerkleTree<T> where
T: Send,
T: Send,
impl<T> Unpin for MerkleTree<T> where
T: Unpin,
T: Unpin,
impl<T> RefUnwindSafe for MerkleTree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> UnwindSafe for MerkleTree<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,