Struct MerkleTree

pub struct MerkleTree<H, T> { /* private fields */ }

A Merkle tree.

Values of this type represent fully constructed Merkle trees. A valid tree either has a single leaf node as the root node, or has a hierarchy of nodes terminating with leaf nodes and with hash-only nodes at levels above leaves.

MerkleTree hierarchies are immutable: it’s not possible to e.g. swap out nodes in safe code because doing so would violate the hash integrity.

Implementations

impl<H, T> MerkleTree<H, T>

pub fn root(&self) -> &Node<H, T>

Returns the root node of the tree as a borrowed reference.

Trait Implementations

impl<H: Debug, T: Debug> Debug for MerkleTree<H, T>

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

Formats the value using the given formatter.

impl<H: Hash, T> Hash for MerkleTree<H, T>

fn hash<S: Hasher>(&self, state: &mut S)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<H: PartialEq, T> PartialEq<HashNode<H, T>> for MerkleTree<H, T>

fn eq(&self, other: &HashNode<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq<LeafNode<H, T>> for MerkleTree<H, T>

fn eq(&self, other: &LeafNode<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq<MerkleTree<H, T>> for HashNode<H, T>

fn eq(&self, other: &MerkleTree<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq<MerkleTree<H, T>> for LeafNode<H, T>

fn eq(&self, other: &MerkleTree<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq<MerkleTree<H, T>> for Node<H, T>

fn eq(&self, other: &MerkleTree<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq<Node<H, T>> for MerkleTree<H, T>

fn eq(&self, other: &Node<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H: PartialEq, T> PartialEq for MerkleTree<H, T>

fn eq(&self, other: &MerkleTree<H, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<H, T> Serialize for MerkleTree<H, T>

where H: Serialize, T: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<H: Eq, T> Eq for MerkleTree<H, T>