qyriad/miden-crypto
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Fix: typos (#249)

Browse source 
* tests: fix typos
* full.rs: fix typo
* CONTRIBUTING: fix typo
This commit is contained in:
cristiantroy 2024-01-17 08:17:48 +08:00 • committed by Bobbin Threadbare
parent 6b5db8a6db
commit 260592f8e7
3 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
CONTRIBUTING.md
View file

@ -72,7 +72,7 @@ For example, a new change to the AIR crate might have the following message: `fe
// ================================================================================ // ================================================================================
``` ```
- [Rustfmt](https://github.com/rust-lang/rustfmt) and [Clippy](https://github.com/rust-lang/rust-clippy) linting is included in CI pipeline. Anyways it's prefferable to run linting locally before push: - [Rustfmt](https://github.com/rust-lang/rustfmt) and [Clippy](https://github.com/rust-lang/rust-clippy) linting is included in CI pipeline. Anyways it's preferable to run linting locally before push:
``` ```
cargo fix --allow-staged --allow-dirty --all-targets --all-features; cargo fmt; cargo clippy --workspace --all-targets --all-features -- -D warnings cargo fix --allow-staged --allow-dirty --all-targets --all-features; cargo fmt; cargo clippy --workspace --all-targets --all-features -- -D warnings
``` ```

2
src/merkle/mmr/full.rs
View file

@ -280,7 +280,7 @@ impl Mmr {
// Update the depth of the tree to correspond to a subtree // Update the depth of the tree to correspond to a subtree
forest_target >>= 1; forest_target >>= 1;
// compute the indeces of the right and left subtrees based on the post-order // compute the indices of the right and left subtrees based on the post-order
let right_offset = index - 1; let right_offset = index - 1;
let left_offset = right_offset - nodes_in_forest(forest_target); let left_offset = right_offset - nodes_in_forest(forest_target);

8
src/merkle/store/tests.rs
View file

@ -103,7 +103,7 @@ fn test_merkle_tree() -> Result<(), MerkleError> {
"node 3 must be the same for both MerkleTree and MerkleStore" "node 3 must be the same for both MerkleTree and MerkleStore"
); );
// STORE MERKLE PATH MATCHS ============================================================== // STORE MERKLE PATH MATCHES ==============================================================
// assert the merkle path returned by the store is the same as the one in the tree // assert the merkle path returned by the store is the same as the one in the tree
let result = store.get_path(mtree.root(), NodeIndex::make(mtree.depth(), 0)).unwrap(); let result = store.get_path(mtree.root(), NodeIndex::make(mtree.depth(), 0)).unwrap();
assert_eq!( assert_eq!(
@ -290,7 +290,7 @@ fn test_sparse_merkle_tree() -> Result<(), MerkleError> {
"node 4 must be the same for both SparseMerkleTree and MerkleStore" "node 4 must be the same for both SparseMerkleTree and MerkleStore"
); );
// STORE MERKLE PATH MATCHS ============================================================== // STORE MERKLE PATH MATCHES ==============================================================
// assert the merkle path returned by the store is the same as the one in the tree // assert the merkle path returned by the store is the same as the one in the tree
let result = store.get_path(smt.root(), NodeIndex::make(smt.depth(), 0)).unwrap(); let result = store.get_path(smt.root(), NodeIndex::make(smt.depth(), 0)).unwrap();
assert_eq!( assert_eq!(
@ -425,7 +425,7 @@ fn test_add_merkle_paths() -> Result<(), MerkleError> {
"node 3 must be the same for both PartialMerkleTree and MerkleStore" "node 3 must be the same for both PartialMerkleTree and MerkleStore"
); );
// STORE MERKLE PATH MATCHS ============================================================== // STORE MERKLE PATH MATCHES ==============================================================
// assert the merkle path returned by the store is the same as the one in the pmt // assert the merkle path returned by the store is the same as the one in the pmt
let result = store.get_path(pmt.root(), NodeIndex::make(pmt.max_depth(), 0)).unwrap(); let result = store.get_path(pmt.root(), NodeIndex::make(pmt.max_depth(), 0)).unwrap();
assert_eq!( assert_eq!(
@ -649,7 +649,7 @@ fn get_leaf_depth_works_depth_64() {
let index = NodeIndex::new(64, k).unwrap(); let index = NodeIndex::new(64, k).unwrap();
// assert the leaf doesn't exist before the insert. the returned depth should always // assert the leaf doesn't exist before the insert. the returned depth should always
// increment with the paths count of the set, as they are insersecting one another up to // increment with the paths count of the set, as they are intersecting one another up to
// the first bits of the used key. // the first bits of the used key.
assert_eq!(d, store.get_leaf_depth(root, 64, k).unwrap()); assert_eq!(d, store.get_leaf_depth(root, 64, k).unwrap());