Bump Rust version to 1.88

Author: maneatingape

.github/workflows/checks.yml

@@ -20,7 +20,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
     - uses: actions/checkout@v4
-    - run: rustup default 1.87
+    - run: rustup default 1.88
     - run: cargo test
 
   test-nightly:

.github/workflows/docs.yml

@@ -18,7 +18,7 @@ jobs:
       url: ${{ steps.deployment.outputs.page_url }}
     steps:
       - uses: actions/checkout@v4
-      - run: rustup default 1.87
+      - run: rustup default 1.88
       - run: cargo doc
         env:
           RUSTDOCFLAGS: "--document-private-items --default-theme=ayu --deny warnings"

Cargo.toml

@@ -2,7 +2,7 @@
 name = "aoc"
 version = "2024.12.25"
 edition = "2024"
-rust-version = "1.87"
+rust-version = "1.88"
 
 [features]
 frivolity = []
@@ -119,6 +119,7 @@ get_unwrap = "warn"
 host_endian_bytes = "allow"
 if_not_else = "warn"
 if_then_some_else_none = "warn"
+ignore_without_reason = "warn"
 ignored_unit_patterns = "warn"
 impl_trait_in_params = "warn"
 implicit_clone = "warn"
@@ -136,6 +137,7 @@ integer_division = "allow"
 integer_division_remainder_used = "allow"
 into_iter_without_iter = "warn"
 invalid_upcast_comparisons = "warn"
+ip_constant = "warn"
 items_after_statements = "warn"
 iter_filter_is_ok = "warn"
 iter_filter_is_some = "warn"
@@ -194,7 +196,7 @@ mutex_atomic = "warn"
 naive_bytecount = "allow"
 needless_bitwise_bool = "warn"
 needless_continue = "warn"
-needless_for_each = "warn"
+needless_for_each = "allow"
 needless_pass_by_value = "warn"
 needless_raw_string_hashes = "warn"
 needless_raw_strings = "warn"
@@ -210,6 +212,7 @@ panic_in_result_fn = "warn"
 partial_pub_fields = "warn"
 pathbuf_init_then_push = "warn"
 pattern_type_mismatch = "allow"
+pointer_format = "warn"
 precedence_bits = "warn"
 print_stderr = "allow"
 print_stdout = "allow"
@@ -227,6 +230,7 @@ rc_buffer = "warn"
 rc_mutex = "warn"
 redundant_closure_for_method_calls = "warn"
 redundant_else = "warn"
+redundant_test_prefix = "warn"
 redundant_type_annotations = "warn"
 ref_as_ptr = "warn"
 ref_binding_to_reference = "warn"

src/year2018/day15.rs

@@ -216,14 +216,14 @@ fn fight(input: &Input, elf_attack_power: i32, part_two: bool) -> Option<i32> {
 
             // If no enemy next to unit then move towards nearest enemy in reading order,
             // breaking equal distance ties in reading order.
-            if nearby.is_none() {
-                if let Some(next) = double_bfs(input.walls, &units, position, kind) {
-                    grid[position] = None;
-                    grid[next] = Some(index);
-                    units[index].position = next;
-
-                    nearby = attack(&grid, &units, next, kind);
-                }
+            if nearby.is_none()
+                && let Some(next) = double_bfs(input.walls, &units, position, kind)
+            {
+                grid[position] = None;
+                grid[next] = Some(index);
+                units[index].position = next;
+
+                nearby = attack(&grid, &units, next, kind);
             }
 
             // Attack enemy if possible.

src/year2019/day18.rs

@@ -140,14 +140,14 @@ fn parse_maze(width: i32, bytes: &[u8]) -> Maze {
                 needed |= 1 << door;
             }
 
-            if let Some(to) = is_key(bytes[index]) {
-                if distance > 0 {
-                    // Store the reciprocal edge weight and doors in the adjacency matrix.
-                    maze[from][to] = Door { distance, needed };
-                    maze[to][from] = Door { distance, needed };
-                    // Faster to stop here and use Floyd-Warshall later.
-                    continue;
-                }
+            if let Some(to) = is_key(bytes[index])
+                && distance > 0
+            {
+                // Store the reciprocal edge weight and doors in the adjacency matrix.
+                maze[from][to] = Door { distance, needed };
+                maze[to][from] = Door { distance, needed };
+                // Faster to stop here and use Floyd-Warshall later.
+                continue;
             }
 
             for delta in orthogonal {

src/year2019/day20.rs

@@ -166,10 +166,10 @@ pub fn part2(input: &Maze) -> u32 {
 
     while let Some((steps, index, level)) = todo.pop_front() {
         let key = (index, level);
-        if let Some(min) = cache.get(&key) {
-            if *min <= steps {
-                continue;
-            }
+        if let Some(min) = cache.get(&key)
+            && *min <= steps
+        {
+            continue;
         }
         cache.insert(key, steps);