Fix spelling mistakes across the whole repository (#3808)

**Update:** Pushed additional changes based on the review comments.

**This pull request fixes various spelling mistakes in this
repository.**

Most of the changes are contained in the first **3** commits:

- `Fix spelling mistakes in comments and docs`

- `Fix spelling mistakes in test names`

- `Fix spelling mistakes in error messages, panic messages, logs and
tracing`

Other source code spelling mistakes are separated into individual
commits for easier reviewing:

- `Fix the spelling of 'authority'`

- `Fix the spelling of 'REASONABLE_HEADERS_IN_JUSTIFICATION_ANCESTRY'`

- `Fix the spelling of 'prev_enqueud_messages'`

- `Fix the spelling of 'endpoint'`

- `Fix the spelling of 'children'`

- `Fix the spelling of 'PenpalSiblingSovereignAccount'`

- `Fix the spelling of 'PenpalSudoAccount'`

- `Fix the spelling of 'insufficient'`

- `Fix the spelling of 'PalletXcmExtrinsicsBenchmark'`

- `Fix the spelling of 'subtracted'`

- `Fix the spelling of 'CandidatePendingAvailability'`

- `Fix the spelling of 'exclusive'`

- `Fix the spelling of 'until'`

- `Fix the spelling of 'discriminator'`

- `Fix the spelling of 'nonexistent'`

- `Fix the spelling of 'subsystem'`

- `Fix the spelling of 'indices'`

- `Fix the spelling of 'committed'`

- `Fix the spelling of 'topology'`

- `Fix the spelling of 'response'`

- `Fix the spelling of 'beneficiary'`

- `Fix the spelling of 'formatted'`

- `Fix the spelling of 'UNKNOWN_PROOF_REQUEST'`

- `Fix the spelling of 'succeeded'`

- `Fix the spelling of 'reopened'`

- `Fix the spelling of 'proposer'`

- `Fix the spelling of 'InstantiationNonce'`

- `Fix the spelling of 'depositor'`

- `Fix the spelling of 'expiration'`

- `Fix the spelling of 'phantom'`

- `Fix the spelling of 'AggregatedKeyValue'`

- `Fix the spelling of 'randomness'`

- `Fix the spelling of 'defendant'`

- `Fix the spelling of 'AquaticMammal'`

- `Fix the spelling of 'transactions'`

- `Fix the spelling of 'PassingTracingSubscriber'`

- `Fix the spelling of 'TxSignaturePayload'`

- `Fix the spelling of 'versioning'`

- `Fix the spelling of 'descendant'`

- `Fix the spelling of 'overridden'`

- `Fix the spelling of 'network'`

Let me know if this structure is adequate.

**Note:** The usage of the words `Merkle`, `Merkelize`, `Merklization`,
`Merkelization`, `Merkleization`, is somewhat inconsistent but I left it
as it is.

~~**Note:** In some places the term `Receival` is used to refer to
message reception, IMO `Reception` is the correct word here, but I left
it as it is.~~

~~**Note:** In some places the term `Overlayed` is used instead of the
more acceptable version `Overlaid` but I also left it as it is.~~

~~**Note:** In some places the term `Applyable` is used instead of the
correct version `Applicable` but I also left it as it is.~~

**Note:** Some usage of British vs American english e.g. `judgement` vs
`judgment`, `initialise` vs `initialize`, `optimise` vs `optimize` etc.
are both present in different places, but I suppose that's
understandable given the number of contributors.

~~**Note:** There is a spelling mistake in `.github/CODEOWNERS` but it
triggers errors in CI when I make changes to it, so I left it as it
is.~~

substrate/primitives/state-machine/src/ext.rs

@@ -44,7 +44,7 @@ const EXT_NOT_ALLOWED_TO_FAIL: &str = "Externalities not allowed to fail within
 const BENCHMARKING_FN: &str = "\
 	This is a special fn only for benchmarking where a database commit happens from the runtime.
 	For that reason client started transactions before calling into runtime are not allowed.
-	Without client transactions the loop condition garantuees the success of the tx close.";
+	Without client transactions the loop condition guarantees the success of the tx close.";
 
 #[cfg(feature = "std")]
 fn guard() -> sp_panic_handler::AbortGuard {
@@ -722,7 +722,7 @@ impl Encode for EncodeOpaqueValue {
 	}
 }
 
-/// Auxialiary structure for appending a value to a storage item.
+/// Auxiliary structure for appending a value to a storage item.
 pub(crate) struct StorageAppend<'a>(&'a mut Vec<u8>);
 
 impl<'a> StorageAppend<'a> {

substrate/primitives/state-machine/src/lib.rs

@@ -1451,7 +1451,7 @@ mod tests {
 		enum Item {
 			InitializationItem,
 			DiscardedItem,
-			CommitedItem,
+			CommittedItem,
 		}
 
 		let key = b"events".to_vec();
@@ -1488,21 +1488,21 @@ mod tests {
 
 			assert_eq!(ext.storage(key.as_slice()), Some(vec![Item::InitializationItem].encode()));
 
-			ext.storage_append(key.clone(), Item::CommitedItem.encode());
+			ext.storage_append(key.clone(), Item::CommittedItem.encode());
 
 			assert_eq!(
 				ext.storage(key.as_slice()),
-				Some(vec![Item::InitializationItem, Item::CommitedItem].encode()),
+				Some(vec![Item::InitializationItem, Item::CommittedItem].encode()),
 			);
 		}
 		overlay.start_transaction();
 
-		// Then only initlaization item and second (committed) item should persist.
+		// Then only initialization item and second (committed) item should persist.
 		{
 			let ext = Ext::new(&mut overlay, backend, None);
 			assert_eq!(
 				ext.storage(key.as_slice()),
-				Some(vec![Item::InitializationItem, Item::CommitedItem].encode()),
+				Some(vec![Item::InitializationItem, Item::CommittedItem].encode()),
 			);
 		}
 	}
@@ -1866,7 +1866,7 @@ mod tests {
 						// a inner hashable node
 						(&b"k"[..], Some(&long_vec[..])),
 						// need to ensure this is not an inline node
-						// otherwhise we do not know what is accessed when
+						// otherwise we do not know what is accessed when
 						// storing proof.
 						(&b"key1"[..], Some(&vec![5u8; 32][..])),
 						(&b"key2"[..], Some(&b"val3"[..])),

substrate/primitives/state-machine/src/overlayed_changes/changeset.rs

@@ -47,7 +47,7 @@ pub struct NoOpenTransaction;
 #[cfg_attr(test, derive(PartialEq))]
 pub struct AlreadyInRuntime;
 
-/// Error when calling `exit_runtime` when not being in runtime exection mdde.
+/// Error when calling `exit_runtime` when not being in runtime execution mode.
 #[derive(Debug)]
 #[cfg_attr(test, derive(PartialEq))]
 pub struct NotInRuntime;
@@ -269,7 +269,7 @@ impl<K: Ord + Hash + Clone, V> OverlayedMap<K, V> {
 	///
 	/// Panics:
 	/// Panics if there are open transactions: `transaction_depth() > 0`
-	pub fn drain_commited(self) -> impl Iterator<Item = (K, V)> {
+	pub fn drain_committed(self) -> impl Iterator<Item = (K, V)> {
 		assert!(self.transaction_depth() == 0, "Drain is not allowed with open transactions.");
 		self.changes.into_iter().map(|(k, mut v)| (k, v.pop_transaction().value))
 	}
@@ -281,7 +281,7 @@ impl<K: Ord + Hash + Clone, V> OverlayedMap<K, V> {
 		self.dirty_keys.len()
 	}
 
-	/// Call this before transfering control to the runtime.
+	/// Call this before transferring control to the runtime.
 	///
 	/// This protects all existing transactions from being removed by the runtime.
 	/// Calling this while already inside the runtime will return an error.
@@ -471,7 +471,7 @@ mod test {
 	}
 
 	fn assert_drained_changes(is: OverlayedChangeSet, expected: Changes) {
-		let is = is.drain_commited().collect::<Vec<_>>();
+		let is = is.drain_committed().collect::<Vec<_>>();
 		let expected = expected
 			.iter()
 			.map(|(k, v)| (k.to_vec(), v.0.map(From::from)))
@@ -480,7 +480,7 @@ mod test {
 	}
 
 	fn assert_drained(is: OverlayedChangeSet, expected: Drained) {
-		let is = is.drain_commited().collect::<Vec<_>>();
+		let is = is.drain_committed().collect::<Vec<_>>();
 		let expected = expected
 			.iter()
 			.map(|(k, v)| (k.to_vec(), v.map(From::from)))
@@ -526,7 +526,7 @@ mod test {
 		changeset.set(b"key0".to_vec(), Some(b"val0-rolled".to_vec()), Some(1000));
 		changeset.set(b"key5".to_vec(), Some(b"val5-rolled".to_vec()), None);
 
-		// changes contain all changes not only the commmited ones.
+		// changes contain all changes not only the committed ones.
 		let all_changes: Changes = vec![
 			(b"key0", (Some(b"val0-rolled"), vec![1, 10, 1000])),
 			(b"key1", (Some(b"val1"), vec![1])),
@@ -807,7 +807,7 @@ mod test {
 	fn drain_with_open_transaction_panics() {
 		let mut changeset = OverlayedChangeSet::default();
 		changeset.start_transaction();
-		let _ = changeset.drain_commited();
+		let _ = changeset.drain_committed();
 	}
 
 	#[test]

substrate/primitives/state-machine/src/overlayed_changes/mod.rs

@@ -480,7 +480,7 @@ impl<H: Hasher> OverlayedChanges<H> {
 		Ok(())
 	}
 
-	/// Call this before transfering control to the runtime.
+	/// Call this before transferring control to the runtime.
 	///
 	/// This protects all existing transactions from being removed by the runtime.
 	/// Calling this while already inside the runtime will return an error.
@@ -575,10 +575,10 @@ impl<H: Hasher> OverlayedChanges<H> {
 		};
 
 		use core::mem::take;
-		let main_storage_changes = take(&mut self.top).drain_commited();
+		let main_storage_changes = take(&mut self.top).drain_committed();
 		let child_storage_changes = take(&mut self.children)
 			.into_iter()
-			.map(|(key, (val, info))| (key, (val.drain_commited(), info)));
+			.map(|(key, (val, info))| (key, (val.drain_committed(), info)));
 
 		let offchain_storage_changes = self.offchain_drain_committed().collect();
 
@@ -809,7 +809,7 @@ pub struct OverlayedExtensions<'a> {
 
 #[cfg(feature = "std")]
 impl<'a> OverlayedExtensions<'a> {
-	/// Create a new instance of overalyed extensions from the given extensions.
+	/// Create a new instance of overlaid extensions from the given extensions.
 	pub fn new(extensions: &'a mut Extensions) -> Self {
 		Self {
 			extensions: extensions

substrate/primitives/state-machine/src/testing.rs

@@ -417,7 +417,7 @@ mod tests {
 			original_ext.backend.clone().into_storage(),
 		);
 
-		// Ensure all have the correct ref counrt
+		// Ensure all have the correct ref count
 		assert!(original_ext.backend.backend_storage().keys().values().all(|r| *r == 2));
 
 		// Drain the raw storage and root.

substrate/primitives/state-machine/src/trie_backend_essence.rs

@@ -34,8 +34,8 @@ use parking_lot::RwLock;
 use sp_core::storage::{ChildInfo, ChildType, StateVersion};
 use sp_trie::{
 	child_delta_trie_root, delta_trie_root, empty_child_trie_root,
-	read_child_trie_first_descedant_value, read_child_trie_hash, read_child_trie_value,
-	read_trie_first_descedant_value, read_trie_value,
+	read_child_trie_first_descendant_value, read_child_trie_hash, read_child_trie_value,
+	read_trie_first_descendant_value, read_trie_value,
 	trie_types::{TrieDBBuilder, TrieError},
 	DBValue, KeySpacedDB, MerkleValue, NodeCodec, PrefixedMemoryDB, Trie, TrieCache,
 	TrieDBRawIterator, TrieRecorder, TrieRecorderProvider,
@@ -554,7 +554,7 @@ where
 		let map_e = |e| format!("Trie lookup error: {}", e);
 
 		self.with_recorder_and_cache(None, |recorder, cache| {
-			read_trie_first_descedant_value::<Layout<H>, _>(self, &self.root, key, recorder, cache)
+			read_trie_first_descendant_value::<Layout<H>, _>(self, &self.root, key, recorder, cache)
 				.map_err(map_e)
 		})
 	}
@@ -570,7 +570,7 @@ where
 		let map_e = |e| format!("Trie lookup error: {}", e);
 
 		self.with_recorder_and_cache(Some(child_root), |recorder, cache| {
-			read_child_trie_first_descedant_value::<Layout<H>, _>(
+			read_child_trie_first_descendant_value::<Layout<H>, _>(
 				child_info.keyspace(),
 				self,
 				&child_root,