Bump Rust version to 1.87

Author: maneatingape

.github/workflows/checks.yml

@@ -20,7 +20,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
     - uses: actions/checkout@v4
-    - run: rustup default 1.86
+    - run: rustup default 1.87
     - 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.86
+      - run: rustup default 1.87
       - 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.86"
+rust-version = "1.87"
 
 [features]
 frivolity = []
@@ -84,9 +84,11 @@ default_trait_access = "warn"
 default_union_representation = "warn"
 deref_by_slicing = "allow"
 disallowed_script_idents = "warn"
+doc_comment_double_space_linebreaks = "warn"
 doc_include_without_cfg = "warn"
 doc_link_with_quotes = "warn"
 doc_markdown = "warn"
+elidable_lifetime_names = "warn"
 else_if_without_else = "allow"
 empty_drop = "warn"
 empty_enum = "warn"
@@ -154,17 +156,17 @@ macro_use_imports = "warn"
 manual_assert = "warn"
 manual_c_str_literals = "warn"
 manual_instant_elapsed = "warn"
-manual_is_power_of_two = "warn"
+manual_is_power_of_two = "allow"
 manual_is_variant_and = "warn"
 manual_let_else = "warn"
+manual_midpoint = "warn"
 manual_ok_or = "warn"
 manual_string_new = "warn"
 many_single_char_names = "allow"
 map_err_ignore = "warn"
 map_unwrap_or = "warn"
 map_with_unused_argument_over_ranges = "warn"
 match_bool = "warn"
-match_on_vec_items = "allow"
 match_same_arms = "warn"
 match_wild_err_arm = "warn"
 match_wildcard_for_single_variants = "warn"
@@ -220,7 +222,7 @@ pub_without_shorthand = "warn"
 question_mark_used = "allow"
 range_minus_one = "warn"
 range_plus_one = "allow"
-return_and_then = "warn"
+return_and_then = "allow"
 rc_buffer = "warn"
 rc_mutex = "warn"
 redundant_closure_for_method_calls = "warn"
@@ -274,6 +276,7 @@ unicode_not_nfc = "warn"
 unimplemented = "warn"
 uninlined_format_args = "warn"
 unnecessary_box_returns = "warn"
+unnecessary_debug_formatting = "warn"
 unnecessary_join = "warn"
 unnecessary_literal_bound = "warn"
 unnecessary_safety_comment = "warn"

src/year2015/day03.rs

@@ -18,7 +18,7 @@ pub fn part1(input: &[Point]) -> usize {
 }
 
 pub fn part2(input: &[Point]) -> usize {
-    deliver(input, |i| i % 2 == 0)
+    deliver(input, |i| i.is_multiple_of(2))
 }
 
 fn deliver(input: &[Point], predicate: fn(usize) -> bool) -> usize {

src/year2015/day23.rs

@@ -70,7 +70,7 @@ fn execute(input: &[Op], mut a: u64) -> u64 {
                 pc += 1;
             }
             Op::Jmp(index) => pc = index,
-            Op::Jie(index) => pc = if a % 2 == 0 { index } else { pc + 1 },
+            Op::Jie(index) => pc = if a.is_multiple_of(2) { index } else { pc + 1 },
             Op::Jio(index) => pc = if a == 1 { index } else { pc + 1 },
         }
     }

src/year2016/day13.rs

@@ -23,7 +23,7 @@ pub fn parse(input: &str) -> Input {
         for y in 0..52 {
             let n = (x * x) + (3 * x) + (2 * x * y) + y + (y * y) + favorite;
             let ones = n.count_ones();
-            maze[x][y] = ones % 2 == 0;
+            maze[x][y] = ones.is_multiple_of(2);
         }
     }
 

src/year2016/day16.rs

@@ -66,7 +66,7 @@ fn checksum(input: &[usize], step_size: usize) -> String {
         .map(|i| count(input, i * step_size))
         .collect::<Vec<_>>()
         .windows(2)
-        .map(|w| if (w[1] - w[0]) % 2 == 0 { '1' } else { '0' })
+        .map(|w| if (w[1] - w[0]).is_multiple_of(2) { '1' } else { '0' })
         .collect()
 }
 

src/year2017/day05.rs

@@ -90,7 +90,7 @@ pub fn part2(input: &[i32]) -> usize {
             // Each time it crosses a block of 16 add to the compact binary representation.
             if jump[index] == 2 && index == fine {
                 fine += 1;
-                if fine % 16 == 0 {
+                if fine.is_multiple_of(16) {
                     let value = (coarse..fine).rev().fold(0, |acc, i| (acc << 1) | (jump[i] & 1));
                     coarse = fine;
                     compact.push(value as u16);

src/year2017/day15.rs

@@ -82,10 +82,10 @@ fn sender(shared: &Shared, tx: &Sender<Block>) {
             if left == right {
                 ones += 1;
             }
-            if left % 4 == 0 {
+            if left.is_multiple_of(4) {
                 fours.push(left);
             }
-            if right % 8 == 0 {
+            if right.is_multiple_of(8) {
                 eights.push(right);
             }
         }

src/year2018/day23.rs

@@ -57,9 +57,9 @@ impl Cube {
         let Cube { x1, x2, y1, y2, z1, z2 } = *self;
 
         // Lower and upper halves of the new sub-cubes.
-        let lx = (self.x1 + self.x2) / 2;
-        let ly = (self.y1 + self.y2) / 2;
-        let lz = (self.z1 + self.z2) / 2;
+        let lx = self.x1.midpoint(self.x2);
+        let ly = self.y1.midpoint(self.y2);
+        let lz = self.z1.midpoint(self.z2);
         let ux = lx + 1;
         let uy = ly + 1;
         let uz = lz + 1;

src/year2019/day02.rs

@@ -58,8 +58,8 @@ fn search(input: &Input, x1: i32, x2: i32, y1: i32, y2: i32) -> Option<i32> {
         return None;
     }
 
-    let x = (x1 + x2) / 2;
-    let y = (y1 + y2) / 2;
+    let x = x1.midpoint(x2);
+    let y = y1.midpoint(y2);
     let [a, b, c] = input;
     let result = a * x + b * y + c;
 

src/year2021/day07.rs

@@ -35,9 +35,7 @@ fn median(input: &[i32]) -> i32 {
     crabs.sort_unstable();
 
     let half = input.len() / 2;
-    let odd = crabs.len() % 2 == 1;
-
-    if odd { crabs[half] } else { (crabs[half - 1] + crabs[half]) / 2 }
+    if crabs.len().is_multiple_of(2) { crabs[half - 1].midpoint(crabs[half]) } else { crabs[half] }
 }
 
 fn mean(input: &[i32]) -> i32 {

src/year2022/day15.rs

@@ -112,6 +112,7 @@ pub fn part2_testable(input: &[Input], size: i32) -> u64 {
         for &&y in &horizontal {
             // Rotate intersection point counter clockwise and scale by 1 / √2
             // to return to original coordinates.
+            #[expect(clippy::manual_midpoint)]
             let point = Point::new((x + y) / 2, (y - x) / 2);
             // As we're mixing overlaps from different boxes there may some spurious false
             // positives, so double check all points are within the specified area

src/year2023/day06.rs

@@ -46,7 +46,7 @@ fn race(first: &str, second: &str) -> u128 {
         // Use the quadratic formula to find the start and end positions.
         let root = (time * time - 4 * distance).isqrt();
         let mut start = (time - root).div_ceil(2);
-        let mut end = (time + root) / 2;
+        let mut end = time.midpoint(root);
 
         // As we're using integer math we may need to adjust 1 step.
         if start * (time - start) > distance {

src/year2024/day09.rs

@@ -72,7 +72,7 @@ pub fn part2(disk: &[usize]) -> usize {
     // Build a min-heap (leftmost free block first) where the size of each block is
     // implicit in the index of the array.
     for (index, &size) in disk.iter().enumerate() {
-        if index % 2 == 1 && size > 0 {
+        if !index.is_multiple_of(2) && size > 0 {
             free[size].push(block);
         }
 
@@ -89,7 +89,7 @@ pub fn part2(disk: &[usize]) -> usize {
         block -= size;
 
         // Count any previous free blocks to decrement block offset correctly.
-        if index % 2 == 1 {
+        if !index.is_multiple_of(2) {
             continue;
         }
 

src/year2024/day11.rs

@@ -61,7 +61,7 @@ fn count(input: &[u64], blinks: usize) -> u64 {
                 (index_of(1), usize::MAX)
             } else {
                 let digits = number.ilog10() + 1;
-                if digits % 2 == 0 {
+                if digits.is_multiple_of(2) {
                     let power = 10_u64.pow(digits / 2);
                     (index_of(number / power), index_of(number % power))
                 } else {