docs: multiple small textual defects (paradigmxyz#17904)

Author: crStiv

crates/evm/execution-types/src/execution_outcome.rs

@@ -113,7 +113,7 @@ impl<T> ExecutionOutcome<T> {
                 )
             }),
             reverts.into_iter().map(|(_, reverts)| {
-                // does not needs to be sorted, it is done when taking reverts.
+                // does not need to be sorted, it is done when taking reverts.
                 reverts.into_iter().map(|(address, (original, storage))| {
                     (
                         address,
@@ -214,7 +214,7 @@ impl<T> ExecutionOutcome<T> {
 
     /// Returns the receipt root for all recorded receipts.
     /// Note: this function calculated Bloom filters for every receipt and created merkle trees
-    /// of receipt. This is a expensive operation.
+    /// of receipt. This is an expensive operation.
     pub fn generic_receipts_root_slow(
         &self,
         block_number: BlockNumber,

crates/transaction-pool/src/test_utils/mock.rs

@@ -1710,7 +1710,7 @@ impl MockTransactionSet {
     ///
     /// Let an example transaction set be `[(tx1, 1), (tx2, 2)]`, where the first element of the
     /// tuple is a transaction, and the second element is the nonce. If the `gap_pct` is 50, and
-    /// the `gap_range` is `1..=1`, then the resulting transaction set could would be either
+    /// the `gap_range` is `1..=1`, then the resulting transaction set could be either
     /// `[(tx1, 1), (tx2, 2)]` or `[(tx1, 1), (tx2, 3)]`, with a 50% chance of either.
     pub fn with_nonce_gaps(
         &mut self,

docs/crates/eth-wire.md

@@ -85,7 +85,7 @@ Let's understand how an `EthMessage` is implemented by taking a look at the `Tra
 Transactions (0x02)
 [tx₁, tx₂, ...]
 
-Specify transactions that the peer should make sure is included on its transaction queue.
+Specify transactions that the peer should make sure are included in its transaction queue.
 The items in the list are transactions in the format described in the main Ethereum specification.
 ...
 

examples/db-access/src/main.rs

@@ -57,7 +57,7 @@ fn header_provider_example<T: HeaderProvider>(provider: T, number: u64) -> eyre:
     // Can query the header by number
     let header = provider.header_by_number(number)?.ok_or(eyre::eyre!("header not found"))?;
 
-    // We can convert a header to a sealed header which contains the hash w/o needing to re-compute
+    // We can convert a header to a sealed header which contains the hash w/o needing to recompute
     // it every time.
     let sealed_header = SealedHeader::seal_slow(header);
 
@@ -180,7 +180,7 @@ fn receipts_provider_example<
         .receipts_by_block(100.into())?
         .ok_or(eyre::eyre!("no receipts found for block"))?;
 
-    // Can check if a address/topic filter is present in a header, if it is we query the block and
+    // Can check if an address/topic filter is present in a header, if it is we query the block and
     // receipts and do something with the data
     // 1. get the bloom from the header
     let header = provider.header_by_number(header_num)?.unwrap();