minor fix (#7828)

substrate/client/api/src/cht.rs

@@ -22,7 +22,7 @@
 //! One is generated for every `SIZE` blocks, allowing us to discard those blocks in
 //! favor of the trie root. When the "ancient" blocks need to be accessed, we simply
 //! request an inclusion proof of a specific block number against the trie with the
-//! root has. A correct proof implies that the claimed block is identical to the one
+//! root hash. A correct proof implies that the claimed block is identical to the one
 //! we discarded.
 
 use hash_db;

substrate/client/consensus/aura/src/lib.rs

@@ -256,7 +256,7 @@ where
 	) -> Option<Self::Claim> {
 		let expected_author = slot_author::<P>(slot_number, epoch_data);
 		expected_author.and_then(|p| {
-			 if SyncCryptoStore::has_keys(
+			if SyncCryptoStore::has_keys(
 				 &*self.keystore,
 				 &[(p.to_raw_vec(), sp_application_crypto::key_types::AURA)],
 			) {

substrate/client/service/src/client/client.rs

@@ -1306,7 +1306,7 @@ impl<B, E, Block, RA> BlockBuilderProvider<B, Block, Self> for Client<B, E, Bloc
 	}
 }
 
-impl<B, E, Block, RA>  ExecutorProvider<Block> for Client<B, E, Block, RA> where
+impl<B, E, Block, RA> ExecutorProvider<Block> for Client<B, E, Block, RA> where
 	B: backend::Backend<Block>,
 	E: CallExecutor<Block>,
 	Block: BlockT,

substrate/frame/support/src/weights.rs

@@ -24,7 +24,7 @@
 //! - [`ClassifyDispatch`]: class of the dispatch.
 //! - [`PaysFee`]: weather this weight should be translated to fee and deducted upon dispatch.
 //!
-//! Substrate then bundles then output information of the two traits into [`DispatchInfo`] struct
+//! Substrate then bundles the output information of the three traits into [`DispatchInfo`] struct
 //! and provides it by implementing the [`GetDispatchInfo`] for all `Call` both inner and outer call
 //! types.
 //!
@@ -91,10 +91,11 @@
 //! # fn main() {}
 //! ```
 //!
-//! ### 2. Define weights as a function of input arguments using `FunctionOf` tuple struct. This struct works
-//! in a similar manner as above. 3 items must be provided and each can be either a fixed value or a
-//! function/closure with the same parameters list as the dispatchable function itself, wrapper in a
-//! tuple.
+//! ### 2. Define weights as a function of input arguments using `FunctionOf` tuple struct.
+//!
+//! This struct works in a similar manner as above. 3 items must be provided and each can be either
+//! a fixed value or a function/closure with the same parameters list as the dispatchable function
+//! itself, wrapper in a tuple.
 //!
 //! Using this only makes sense if you want to use a function for at least one of the elements. If
 //! all 3 are static values, providing a raw tuple is easier.

substrate/primitives/externalities/src/extensions.rs

@@ -98,7 +98,7 @@ pub trait ExtensionStore {
 	/// instead of this function to get type system support and automatic type downcasting.
 	fn extension_by_type_id(&mut self, type_id: TypeId) -> Option<&mut dyn Any>;
 
-	/// Register extension `extension` with speciifed `type_id`.
+	/// Register extension `extension` with specified `type_id`.
 	///
 	/// It should return error if extension is already registered.
 	fn register_extension_with_type_id(&mut self, type_id: TypeId, extension: Box<dyn Extension>) -> Result<(), Error>;

substrate/primitives/state-machine/src/changes_trie/build_cache.rs

@@ -34,7 +34,7 @@ use sp_core::storage::PrefixedStorageKey;
 /// is inserted (because digest block will includes all keys from this entry).
 /// When there's a fork, entries are pruned when first changes trie is inserted.
 pub struct BuildCache<H, N> {
-	/// Map of block (implies changes true) number => changes trie root.
+	/// Map of block (implies changes trie) number => changes trie root.
 	roots_by_number: HashMap<N, H>,
 	/// Map of changes trie root => set of storage keys that are in this trie.
 	/// The `Option<Vec<u8>>` in inner `HashMap` stands for the child storage key.