Linting

Author: maneatingape

Cargo.toml

@@ -280,7 +280,7 @@ too_many_lines = "warn"
 transmute_ptr_to_ptr = "warn"
 trivially_copy_pass_by_ref = "warn"
 try_err = "warn"
-unchecked_duration_subtraction = "warn"
+unchecked_time_subtraction = "warn"
 undocumented_unsafe_blocks = "warn"
 unicode_not_nfc = "warn"
 unimplemented = "warn"

src/year2017/day05.rs

@@ -71,7 +71,7 @@ pub fn part2(input: &[i32]) -> usize {
 
     while index < jump.len() {
         if index < coarse {
-            // Index lies withing precomputed blocks.
+            // Index lies within precomputed blocks.
             let base = index / 16;
             let offset = index % 16;
             let value = compact[base] as usize;

src/year2020/day20.rs

@@ -1,6 +1,6 @@
 //! # Jurassic Jigsaw
 //!
-//! At first this seems like a daunting problem. However a little anaylsis shows that the input
+//! At first this seems like a daunting problem. However a little analysis shows that the input
 //! has some nice properties that makes solving this more tractable.
 //!
 //! * Tile edges match with at most one other tile

src/year2021/day18.rs

@@ -165,7 +165,7 @@ fn explode(tree: &mut Snailfish, pair: usize) {
 ///
 /// Search the tree in an *in-order* traversal, splitting the first node over `10` found (if any).
 /// We can optimize the rules by immediately exploding if this results in a node 4 levels deep,
-/// as we know that the prior optimzation in the [`add`] function means that this is the only
+/// as we know that the prior optimization in the [`add`] function means that this is the only
 /// explosion possible.
 fn split(tree: &mut Snailfish) -> bool {
     for &i in &IN_ORDER {

src/year2021/day21.rs

@@ -46,7 +46,7 @@ pub fn part1(input: &State) -> usize {
 
 /// [Memoization](https://en.wikipedia.org/wiki/Memoization) is the key to solving part two in a
 /// reasonable time. For each possible starting universe we record the number of winning and losing
-/// recursive universes so that we can re-use the result and avoid uneccessary calculations.
+/// recursive universes so that we can re-use the result and avoid unnecessary calculations.
 ///
 /// Each player can be in position 1 to 10 and can have a score from 0 to 20 (as a score of 21
 /// ends the game). This is a total of (10 * 21) ^ 2 = 44100 possible states. For speed this