Tidy code

Author: maneatingape

src/year2015/day02.rs

@@ -17,10 +17,9 @@ pub fn parse(input: &str) -> Input {
     input
         .iter_unsigned()
         .chunk::<3>()
-        .map(|chunk| {
-            let mut gift = chunk;
-            gift.sort_unstable();
-            gift
+        .map(|mut chunk| {
+            chunk.sort_unstable();
+            chunk
         })
         .collect()
 }

src/year2015/day19.rs

@@ -28,7 +28,7 @@ pub fn part1(input: &Input<'_>) -> usize {
     // Group replacements of the same size together.
     for &(from, to) in replacements {
         let extra = to.len() - from.len();
-        groups.entry(extra).or_insert(Vec::new()).push((from, to));
+        groups.entry(extra).or_insert_with(Vec::new).push((from, to));
     }
 
     for (_, group) in groups {

src/year2022/day03.rs

@@ -55,10 +55,6 @@ fn mask(s: &str) -> u128 {
 /// Find the lowest set bit (there should only be one) then convert to priority using the
 /// given rules.
 fn priority(mask: u128) -> u32 {
-    let zeroes = mask.trailing_zeros();
-    match zeroes {
-        65..=90 => zeroes - 38,
-        97..=122 => zeroes - 96,
-        _ => unreachable!(),
-    }
+    let bit = mask.trailing_zeros();
+    if bit > 96 { bit - 96 } else { bit - 38 }
 }

src/year2023/day17.rs

@@ -56,7 +56,7 @@ fn astar<const L: i32, const U: i32>(grid: &Grid<i32>) -> i32 {
     let heat = &grid.bytes;
 
     let mut index = 0;
-    let mut todo = repeat_with(|| Vec::with_capacity(1000)).take(100).collect::<Vec<_>>();
+    let mut todo: Vec<_> = repeat_with(|| Vec::with_capacity(1000)).take(100).collect();
     let mut cost = vec![[i32::MAX; 2]; heat.len()];
 
     // Start from the top left corner checking both vertical and horizontal directions.

src/year2023/day23.rs

@@ -327,8 +327,8 @@ fn compress(input: &str) -> Graph {
                 }
 
                 // Graph is undirected so add both edges.
-                edges.entry(from).or_insert(Vec::new()).push(to);
-                edges.entry(to).or_insert(Vec::new()).push(from);
+                edges.entry(from).or_insert_with(Vec::new).push(to);
+                edges.entry(to).or_insert_with(Vec::new).push(from);
                 weight.insert((from, to), cost);
                 weight.insert((to, from), cost);