chore: tidy

Author: clechasseur

aoclp_solutions/src/y2025/day_09.rs

@@ -1,10 +1,11 @@
 use std::cmp::{max, min};
 use std::collections::HashMap;
 use std::iter::{once, successors};
+
+use aoclp::positioning::direction::four_points::Direction4;
 use aoclp::positioning::pt::{rectangular_area, Pt};
 use aoclp::solvers_impl::input::safe_get_input_as_many;
 use itertools::Itertools;
-use aoclp::positioning::direction::four_points::Direction4;
 
 pub fn part_1() -> i64 {
     input()
@@ -28,14 +29,17 @@ pub fn part_2() -> i64 {
 
         let safe = successors(Some(p), |&p| (p.y > safe_line).then_some(p + Direction4::Up))
             .filter(|p| path.get(p).is_some_and(|&step| step == PathStep::LeftRight))
-            .count() % 2 != 0;
+            .count()
+            % 2
+            != 0;
         pt_safety.insert(p, safe);
         safe
     };
     let mut safe_line = |a: Pt, b: Pt| -> bool {
         let displacement = Pt::new((b.x - a.x).signum(), (b.y - a.y).signum());
-        successors(Some(a), |&p| (p != b).then_some(p + displacement)).chain(Some(b))
-            .all(|p| safe_pt(p))
+        successors(Some(a), |&p| (p != b).then_some(p + displacement))
+            .chain(Some(b))
+            .all(&mut safe_pt)
     };
     let mut safe_rectangle = |a: Pt, b: Pt| {
         let corners = [
@@ -90,7 +94,8 @@ fn build_path(red_tiles: &[Pt]) -> HashMap<Pt, PathStep> {
             let displacement = Pt::new((b.x - a.x).signum(), (b.y - a.y).signum());
             successors(Some((a, PathStep::Corner)), move |&(p, _)| {
                 (p != b).then_some((p + displacement, step))
-            }).chain(once((b, PathStep::Corner)))
+            })
+            .chain(once((b, PathStep::Corner)))
         })
         .collect()
 }