Fix upcoming manual_is_multiple_of clippy lint

https://rust-lang.github.io/rust-clippy/master/index.html#manual_is_multiple_of

Author: ictrobot

crates/utils/src/date.rs

@@ -19,7 +19,8 @@ impl Date {
         let mut days = u64::from(self.day.0) - 1;
 
         for year in 2016..=self.year.0 {
-            let is_leap_year = (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
+            let is_leap_year =
+                (year.is_multiple_of(4) && !year.is_multiple_of(100)) || year.is_multiple_of(400);
             days += if is_leap_year { 366 } else { 365 };
         }
 

crates/year2015/src/day23.rs

@@ -69,8 +69,12 @@ impl Day23 {
                 Instruction::Increment(Register::A) => a += 1,
                 Instruction::Increment(Register::B) => b += 1,
                 Instruction::Jump(offset) => pc += offset - 1,
-                Instruction::JumpIfEven(Register::A, offset) if a % 2 == 0 => pc += offset - 1,
-                Instruction::JumpIfEven(Register::B, offset) if b % 2 == 0 => pc += offset - 1,
+                Instruction::JumpIfEven(Register::A, offset) if a.is_multiple_of(2) => {
+                    pc += offset - 1
+                }
+                Instruction::JumpIfEven(Register::B, offset) if b.is_multiple_of(2) => {
+                    pc += offset - 1
+                }
                 Instruction::JumpIfOne(Register::A, offset) if a == 1 => pc += offset - 1,
                 Instruction::JumpIfOne(Register::B, offset) if b == 1 => pc += offset - 1,
                 Instruction::JumpIfEven(_, _) | Instruction::JumpIfOne(_, _) => {}

crates/year2015/src/day24.rs

@@ -26,7 +26,7 @@ impl Day24 {
         remaining_totals.reverse();
 
         let sum: u32 = remaining_totals.first().copied().unwrap_or(0);
-        if sum % 12 != 0 {
+        if !sum.is_multiple_of(12) {
             return Err(InputError::new(input, 0, "Total must be multiple of 12"));
         }
 

crates/year2016/src/day13.rs

@@ -44,7 +44,7 @@ impl Day13 {
                 Point2D::new(p.x, p.y.saturating_add(1)),
             ] {
                 let n = (x * x) + (3 * x) + (2 * x * y) + y + (y * y) + favorite_number;
-                if n.count_ones() % 2 == 0 && !visited.contains(&next) {
+                if n.count_ones().is_multiple_of(2) && !visited.contains(&next) {
                     visited.insert(next);
                     queue.push_back((next, steps + 1));
                 }

crates/year2017/src/day02.rs

@@ -34,7 +34,7 @@ impl Day02 {
             .map(|row| {
                 for i in 0..row.len() - 1 {
                     for j in i + 1..row.len() {
-                        if row[j] % row[i] == 0 {
+                        if row[j].is_multiple_of(row[i]) {
                             return row[j] / row[i];
                         }
                     }

crates/year2017/src/day13.rs

@@ -27,7 +27,7 @@ impl Day13 {
             .iter()
             .map(|&(depth, range)| {
                 let period = (range - 1) * 2;
-                if depth % period == 0 {
+                if depth.is_multiple_of(period) {
                     depth * range
                 } else {
                     0

crates/year2017/src/day15.rs

@@ -1,6 +1,6 @@
 use std::collections::BTreeMap;
-use std::sync::atomic::{AtomicU32, Ordering};
 use std::sync::Mutex;
+use std::sync::atomic::{AtomicU32, Ordering};
 use utils::multithreading;
 use utils::number::mod_pow;
 use utils::prelude::*;
@@ -112,10 +112,10 @@ impl Day15 {
                 if a as u16 == b as u16 {
                     part1_matches += 1;
                 }
-                if !part2_a_finished && a % 4 == 0 {
+                if !part2_a_finished && a.is_multiple_of(4) {
                     part2_a_values.push(a as u16);
                 }
-                if !part2_b_finished && b % 8 == 0 {
+                if !part2_b_finished && b.is_multiple_of(8) {
                     part2_b_values.push(b as u16);
                 }
             }

crates/year2017/src/day22.rs

@@ -39,7 +39,7 @@ impl Day22 {
             b'#' => Some(State::Infected),
             _ => None,
         })?;
-        if rows != cols || rows % 2 == 0 {
+        if rows != cols || rows.is_multiple_of(2) {
             return Err(InputError::new(input, 0, "expected odd size square grid"));
         }
         Ok(Self { size: rows, grid })

crates/year2018/src/day11.rs

@@ -40,10 +40,10 @@ impl Day11 {
         let (mut max_size, mut max_total, mut max_x, mut max_y) = (0, i32::MIN, 0, 0);
         let mut sizes: Vec<i32> = Vec::with_capacity(300);
 
-        for size in 1..=300 {
+        for size in 1usize..=300 {
             // Try to split the N*N square into Y X*X squares to calculate an upper bound.
             // For example, if the best 5x5 is 100, then the best 10x10 must be <= 400.
-            if let Some(divisor) = (2..=size / 2).rev().find(|&d| size % d == 0) {
+            if let Some(divisor) = (2..=size / 2).rev().find(|&d| size.is_multiple_of(d)) {
                 let copies = (size / divisor) * (size / divisor);
                 let upper_bound = sizes[divisor - 1].saturating_mul(copies as i32);
                 if upper_bound < max_total {

crates/year2024/src/day07.rs

@@ -45,7 +45,7 @@ impl Day07 {
             return target == next;
         }
 
-        (target % next == 0 && Self::possible(target / next, numbers, concat))
+        (target.is_multiple_of(next) && Self::possible(target / next, numbers, concat))
             || (concat && {
                 // All the numbers are 1-3 digits, which makes this faster than
                 //  let pow = 10u64.pow(next.ilog10() + 1);