diff --git a/core/src/core/block.rs b/core/src/core/block.rs index 7c8057532..6a5442e98 100644 --- a/core/src/core/block.rs +++ b/core/src/core/block.rs @@ -1065,7 +1065,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } @@ -1082,7 +1082,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } @@ -1098,7 +1098,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } @@ -1115,7 +1115,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } @@ -1141,7 +1141,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } @@ -1167,7 +1167,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } diff --git a/core/src/core/mod.rs b/core/src/core/mod.rs index 8d1c72660..b54fb3c00 100644 --- a/core/src/core/mod.rs +++ b/core/src/core/mod.rs @@ -269,7 +269,7 @@ mod test { }; assert_eq!( vec.len(), - target_len, + target_len ); } diff --git a/core/src/core/pmmr.rs b/core/src/core/pmmr.rs index 1a4b29214..4ebce02d5 100644 --- a/core/src/core/pmmr.rs +++ b/core/src/core/pmmr.rs @@ -50,7 +50,7 @@ use util::LOGGER; pub trait Backend where T:PMMRable { /// Append the provided Hashes to the backend storage, and optionally an associated - /// data element to flatfile storage (for leaf nodes only). The position of the + /// data element to flatfile storage (for leaf nodes only). The position of the /// first element of the Vec in the MMR is provided to help the implementation. fn append(&mut self, position: u64, data: Vec<(Hash, Option)>) -> Result<(), String>; @@ -60,7 +60,7 @@ pub trait Backend where /// occurred (see remove). fn rewind(&mut self, position: u64, index: u32) -> Result<(), String>; - /// Get a Hash/Element by insertion position. If include_data is true, will + /// Get a Hash/Element by insertion position. If include_data is true, will /// also return the associated data element fn get(&self, position: u64, include_data: bool) -> Option<(Hash, Option)>; @@ -444,7 +444,7 @@ impl PruneList { /// given leaf. Helpful if, for instance, data for each leaf is being stored /// separately in a continuous flat-file pub fn get_leaf_shift(&self, pos: u64) -> Option { - + // get the position where the node at pos would fit in the pruned list, if // it's already pruned, nothing to skip match self.pruned_pos(pos) { @@ -739,7 +739,7 @@ mod test { assert_eq!(n_leaves(5),4); assert_eq!(n_leaves(8),5); assert_eq!(n_leaves(9),6); - + } #[test] @@ -851,7 +851,7 @@ mod test { let node_hash = elems[0].hash(); assert_eq!( pmmr.root(), - node_hash, + node_hash ); assert_eq!(pmmr.unpruned_size(), 1); pmmr.dump(false); diff --git a/keychain/src/keychain.rs b/keychain/src/keychain.rs index 39a5e622e..49136fde7 100644 --- a/keychain/src/keychain.rs +++ b/keychain/src/keychain.rs @@ -247,7 +247,7 @@ impl Keychain { pub fn verify_range_proof( secp: &Secp256k1, - commit: Commitment, + commit: Commitment, proof: RangeProof) -> Result<(), secp::Error> { let result = match USE_BULLET_PROOFS { true => secp.verify_bullet_proof(commit, proof), @@ -656,7 +656,7 @@ mod test { .add_blinding_factor(BlindingFactor::from_secret_key(skey1)) .add_blinding_factor(BlindingFactor::from_secret_key(skey2)) ).unwrap(), - BlindingFactor::from_secret_key(skey3), + BlindingFactor::from_secret_key(skey3) ); }