Skip to content

Commit bcacb71

Browse files
authored
Clippy fixes on rust 1.80 (#32)
1 parent b3e2092 commit bcacb71

File tree

2 files changed

+9
-9
lines changed

2 files changed

+9
-9
lines changed

src/lib.rs

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -3,15 +3,15 @@
33
//! This crate implements a Namespaced Merkle Tree compatible with <https://github.com/celestiaorg/nmt>. To quote from their documentation:
44
//!
55
//! > A Namespaced Merkle Tree is an ordered Merkle tree that uses a modified hash function so that each node in the tree
6-
//! includes the range of namespaces of the messages in all of the descendants of each node. The leafs in the tree are
7-
//! ordered by the namespace identifiers of the messages. In a namespaced Merkle tree, each non-leaf node in the tree contains
8-
//! the lowest and highest namespace identifiers found in all the leaf nodes that are descendants of the non-leaf node, in addition
9-
//! to the hash of the concatenation of the children of the node. This enables Merkle inclusion proofs to be created that prove to
10-
//! a verifier that all the elements of the tree for a specific namespace have been included in a Merkle inclusion proof.
11-
//!
6+
//! > includes the range of namespaces of the messages in all of the descendants of each node. The leafs in the tree are
7+
//! > ordered by the namespace identifiers of the messages. In a namespaced Merkle tree, each non-leaf node in the tree contains
8+
//! > the lowest and highest namespace identifiers found in all the leaf nodes that are descendants of the non-leaf node, in addition
9+
//! > to the hash of the concatenation of the children of the node. This enables Merkle inclusion proofs to be created that prove to
10+
//! > a verifier that all the elements of the tree for a specific namespace have been included in a Merkle inclusion proof.
11+
//! >
1212
//! > The concept was first introduced by [@musalbas](https://github.com/musalbas) in the [LazyLedger academic paper](https://arxiv.org/abs/1905.09274).
1313
//!
14-
//! This implementation was developed independently by Sovereign Labs, and is not endorsed by the Celestia foundation.
14+
//! This implementation was developed independently by [Sovereign Labs](https://www.sovereign.xyz/), and is not endorsed by the Celestia foundation.
1515
1616
#[cfg(not(feature = "std"))]
1717
extern crate alloc;

src/namespaced_hash.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -116,8 +116,8 @@ impl<const NS_ID_SIZE: usize> MerkleHash for NamespacedSha2Hasher<NS_ID_SIZE> {
116116

117117
let mut output = NamespacedHash::with_min_and_max_ns(min_ns, max_ns);
118118

119-
hasher.update(&left.iter().collect::<Vec<_>>());
120-
hasher.update(&right.iter().collect::<Vec<_>>());
119+
hasher.update(left.iter().collect::<Vec<_>>());
120+
hasher.update(right.iter().collect::<Vec<_>>());
121121

122122
output.set_hash(hasher.finalize().as_ref());
123123
output

0 commit comments

Comments
 (0)