rust 1.89

Author: rene-d

README.md

@@ -72,7 +72,7 @@ All solutions are *tested* and *verified* with a lot of puzzle inputs and answer
 
 By choice, I use the most recent versions of the languages, and therefore sometimes new paradigms and functionalities, since AoC is an excellent way to practice, explore and learn (while having fun!).
 
-Rust solutions respect `cargo clippy -- -D clippy::all -F clippy::pedantic -F clippy::nursery`, which is a pretty strong hardening (except one `clippy::too_many_lines`).
+Rust solutions respect `cargo clippy -- -D clippy::all -F clippy::pedantic -F clippy::nursery`, which is a pretty strong hardening.
 
 They also include, for the most part, unit tests taken from the examples of puzzle statements.
 

crates/aoc/src/args.rs

@@ -70,7 +70,7 @@ impl Args {
     }
 
     #[must_use]
-    pub fn params(&self) -> &[String] {
+    pub const fn params(&self) -> &[String] {
         self.params.as_slice()
     }
 }

crates/aoc/src/coord.rs

@@ -152,7 +152,6 @@ impl MulAssign<i32> for Coord {
 
 impl From<u8> for Coord {
     #[inline]
-    #[must_use]
     fn from(value: u8) -> Self {
         match value {
             b'^' | b'U' => Self::UP,
@@ -166,7 +165,6 @@ impl From<u8> for Coord {
 
 impl From<char> for Coord {
     #[inline]
-    #[must_use]
     fn from(value: char) -> Self {
         match value {
             '^' | 'U' => Self::UP,

crates/aoc/src/grid.rs

@@ -337,11 +337,11 @@ impl<'a, T: Clone + Default> Iterator for Iter<'a, T> {
 
 impl<T: Clone + Default> Grid<T> {
     #[must_use]
-    pub fn iter(&self) -> Iter<T> {
+    pub fn iter(&self) -> Iter<'_, T> {
         Iter::new(self)
     }
 
-    pub fn iter_mut(&mut self) -> IterMut<T> {
+    pub fn iter_mut(&mut self) -> IterMut<'_, T> {
         IterMut::new(self)
     }
 }
@@ -368,7 +368,6 @@ impl<'a, T: Clone + Default> IntoIterator for &'a mut Grid<T> {
 
 impl From<&str> for Grid<char> {
     #[inline]
-    #[must_use]
     fn from(value: &str) -> Self {
         Self::parse(value, '#')
     }
@@ -420,7 +419,6 @@ impl std::fmt::Display for Grid<char> {
 
 impl From<&str> for Grid<u8> {
     #[inline]
-    #[must_use]
     fn from(value: &str) -> Self {
         Self::parse(value)
     }

crates/aoc/src/square.rs

@@ -153,7 +153,7 @@ impl<T: Clone + Copy + Default> Square<T> {
                     square.flip_vertical_inplace();
                 }
                 _ => panic!(),
-            };
+            }
             square.clone()
         })
     }

crates/assembunny/src/lib.rs

@@ -198,7 +198,7 @@ impl BunnyVM {
 
     /// returns true if the program is finished (instruction pointer is out of bounds)
     #[must_use]
-    pub fn is_terminated(&self) -> bool {
+    pub const fn is_terminated(&self) -> bool {
         self.ip >= self.instructions.len()
     }
 
@@ -266,7 +266,7 @@ impl BunnyVM {
     }
 
     /// reset the program to the initial state
-    pub fn reset(&mut self) {
+    pub const fn reset(&mut self) {
         self.registers = [0, 0, 0, 0];
         self.ip = 0;
         self.output = None;

src/main.rs

@@ -165,7 +165,7 @@ fn print_part_result(part: u8, answer: &str, ok: &str, day: u8) {
             println!("{}", answer.bright_green());
         } else {
             println!("{}", answer.bright_red());
-        };
+        }
     }
 }
 

src/year2015/day18/day18.rs

@@ -54,7 +54,7 @@ fn part2(data: &str) -> u32 {
     count_lights(&grid)
 }
 
-fn corners_on(grid: &mut Grid) {
+const fn corners_on(grid: &mut Grid) {
     grid[0][0] = 1;
     grid[0][99] = 1;
     grid[99][0] = 1;

src/year2015/day22/day22.rs

@@ -44,7 +44,7 @@ impl State {
         }
     }
 
-    fn apply_effects(&mut self) -> Option<CastResult> {
+    const fn apply_effects(&mut self) -> Option<CastResult> {
         if self.timer_recharge > 0 {
             self.timer_recharge -= 1;
             self.mana += 101;

src/year2015/day23/day23.rs

@@ -77,7 +77,7 @@ impl Puzzle {
                 }
             }
             _ => (),
-        };
+        }
         1
     }