Fix lint

Author: maneatingape

README.md

@@ -316,7 +316,7 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | 20 | [Particle Swarm](https://adventofcode.com/2017/day/20) | [Source](src/year2017/day20.rs) | 245 |
 | 21 | [Fractal Art](https://adventofcode.com/2017/day/21) | [Source](src/year2017/day21.rs) | 5 |
 | 22 | [Sporifica Virus](https://adventofcode.com/2017/day/22) | [Source](src/year2017/day22.rs) | 36000 |
-| 23 | [Coprocessor Conflagration](https://adventofcode.com/2017/day/23) | [Source](src/year2017/day23.rs) | 54 |
+| 23 | [Coprocessor Conflagration](https://adventofcode.com/2017/day/23) | [Source](src/year2017/day23.rs) | 19 |
 | 24 | [Electromagnetic Moat](https://adventofcode.com/2017/day/24) | [Source](src/year2017/day24.rs) | 275 |
 | 25 | [The Halting Problem](https://adventofcode.com/2017/day/25) | [Source](src/year2017/day25.rs) | 3698 |
 

src/util/slice.rs

@@ -31,7 +31,7 @@ impl<T> SliceOps<T> for &mut [T] {
 
         while i < n {
             if c[i] < i {
-                if i % 2 == 0 {
+                if i.is_multiple_of(2) {
                     self.swap(0, i);
                 } else {
                     self.swap(c[i], i);

src/year2016/day15.rs

@@ -32,7 +32,7 @@ fn solve(discs: &[Disc]) -> usize {
     let mut step = 1;
 
     for (offset, &[size, position]) in discs.iter().enumerate() {
-        while (time + offset + 1 + position) % size != 0 {
+        while !(time + offset + 1 + position).is_multiple_of(size) {
             time += step;
         }
 

src/year2017/day02.rs

@@ -28,7 +28,7 @@ pub fn part2(input: &Input) -> u32 {
         .map(|values| {
             for i in 0..values.len() {
                 for j in i + 1..values.len() {
-                    if values[j] % values[i] == 0 {
+                    if values[j].is_multiple_of(values[i]) {
                         return values[j] / values[i];
                     }
                 }

src/year2017/day13.rs

@@ -69,7 +69,7 @@ pub fn part1(input: &Input) -> u32 {
 
     for &[depth, range] in input {
         let period = 2 * (range - 1);
-        if depth % period == 0 {
+        if depth.is_multiple_of(period) {
             result += depth * range;
         }
     }
@@ -93,7 +93,7 @@ pub fn part2(input: &Input) -> u32 {
         // Check each multiple of the current `end` against the new scanner.
         for extra in (0..next_lcm).step_by(lcm as usize) {
             for &delay in current.iter() {
-                if (delay + extra + depth) % period != 0 {
+                if !(delay + extra + depth).is_multiple_of(period) {
                     next.push(delay + extra);
                 }
             }

src/year2017/day23.rs

@@ -69,11 +69,11 @@ pub fn part2(input: &u32) -> usize {
 /// Simple [prime number check](https://en.wikipedia.org/wiki/Primality_test)
 /// of all factors from 2 to √n inclusive.
 fn composite(n: u32) -> Option<u32> {
-    if n % 2 == 0 {
+    if n.is_multiple_of(2) {
         return Some(n);
-    };
+    }
     for f in (3..).step_by(2).take_while(|m| m * m <= n) {
-        if n % f == 0 {
+        if n.is_multiple_of(f) {
             return Some(n);
         }
     }

src/year2018/day19.rs

@@ -102,7 +102,7 @@ fn divisor_sum(mut n: u32) -> u32 {
         let mut g = sum;
 
         // `n` could have more than one of the same prime factor.
-        while n % f == 0 {
+        while n.is_multiple_of(f) {
             n /= f;
             g *= f;
             sum += g;

src/year2022/day11.rs

@@ -173,7 +173,11 @@ fn play(monkeys: &[Monkey], max_rounds: u32, adjust: impl Fn(u64) -> u64, pair:
         };
         item = adjust(worry);
 
-        let to = if item % monkeys[from].test == 0 { monkeys[from].yes } else { monkeys[from].no };
+        let to = if item.is_multiple_of(monkeys[from].test) {
+            monkeys[from].yes
+        } else {
+            monkeys[from].no
+        };
 
         // Only increase the round when the item is passes to a previous monkey
         // which will have to be processed in the next turn.

src/year2024/day07.rs

@@ -83,7 +83,7 @@ fn valid(terms: &[u64], test_value: u64, index: usize, concat: bool) -> bool {
         (concat
             && test_value % next_power_of_ten(terms[index]) == terms[index]
             && valid(terms, test_value / next_power_of_ten(terms[index]), index - 1, concat))
-            || (test_value % terms[index] == 0
+            || (test_value.is_multiple_of(terms[index])
                 && valid(terms, test_value / terms[index], index - 1, concat))
             || (test_value >= terms[index]
                 && valid(terms, test_value - terms[index], index - 1, concat))