Rust 1.80.1: Update references to Rust version

benches/benches/hashing.rs

@@ -89,7 +89,7 @@ fn main() {
     criterion.final_summary();
 }
 
-// Arrays of arbitrary length do not implement `Default` as of Rust 1.78.0.
+// Arrays of arbitrary length do not implement `Default` as of Rust 1.80.1.
 // See <https://github.com/rust-lang/rust/issues/61415>.
 // We work around that by using `PublicKeyBytes` and `SignatureBytes` instead.
 

fork_choice_control/src/mutator.rs

@@ -2031,7 +2031,7 @@ where
 
         let mut gossip_ids = vec![];
 
-        // Use `drain_filter_polyfill` because `Vec::extract_if` is not stable as of Rust 1.78.0.
+        // Use `drain_filter_polyfill` because `Vec::extract_if` is not stable as of Rust 1.80.1.
         self.delayed_until_block.retain(|_, delayed| {
             let Delayed {
                 blocks,
@@ -2105,7 +2105,7 @@ where
 
         let mut gossip_ids = vec![];
 
-        // Use `HashMap::retain` because `HashMap::extract_if` is not stable as of Rust 1.78.0.
+        // Use `HashMap::retain` because `HashMap::extract_if` is not stable as of Rust 1.80.1.
         self.waiting_for_checkpoint_states
             .retain(|target, waiting| {
                 let prune = target.epoch < finalized_epoch;

http_api_utils/src/traits.rs

@@ -13,6 +13,6 @@ pub trait ApiError {
         self.sources().format(": ")
     }
 
-    // `StdError::sources` is not stable as of Rust 1.78.0.
+    // `StdError::sources` is not stable as of Rust 1.80.1.
     fn sources(&self) -> impl Iterator<Item = &dyn StdError>;
 }

ssz/src/merkle_tree.rs

@@ -238,7 +238,7 @@ impl<D: ArrayLength<H256>> MerkleTree<D> {
         // ```
         // See <https://oeis.org/A003817>.
         //
-        // `usize::saturating_shr` does not exist as of Rust 1.78.0.
+        // `usize::saturating_shr` does not exist as of Rust 1.80.1.
         let filled_left_subtree = usize::MAX
             .checked_shr(chunk_indices.start.leading_ones())
             .unwrap_or_default();