Update benchmarks and fix lints

Author: maneatingape

README.md

@@ -87,7 +87,7 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | 6 | [Trash Compactor](https://adventofcode.com/2025/day/6) | [Source](src/year2025/day06.rs) | 20 |
 | 7 | [Laboratories](https://adventofcode.com/2025/day/7) | [Source](src/year2025/day07.rs) | 5 |
 | 8 | [Playground](https://adventofcode.com/2025/day/8) | [Source](src/year2025/day08.rs) | 527 |
-| 9 | [Movie Theater](https://adventofcode.com/2025/day/9) | [Source](src/year2025/day09.rs) | 668 |
+| 9 | [Movie Theater](https://adventofcode.com/2025/day/9) | [Source](src/year2025/day09.rs) | 128 |
 | 10 | [Factory](https://adventofcode.com/2025/day/10) | [Source](src/year2025/day10.rs) | 296 |
 | 11 | [Reactor](https://adventofcode.com/2025/day/11) | [Source](src/year2025/day11.rs) | 75 |
 | 12 | [Christmas Tree Farm](https://adventofcode.com/2025/day/12) | [Source](src/year2025/day12.rs) | 25 |

docs/pie-2025.svg

@@ -1,8 +1,44 @@
+//! # Movie Theater
 use crate::util::iter::*;
 use crate::util::parse::*;
 
 type Tile = [u64; 2];
 
+struct Candidate {
+    x: u64,
+    y: u64,
+    interval: Interval,
+}
+
+/// The set { x in u64 | l <= x <= r }.
+#[derive(Clone, Copy)]
+struct Interval {
+    l: u64,
+    r: u64,
+}
+
+impl Interval {
+    fn new(l: u64, r: u64) -> Self {
+        debug_assert!(l <= r);
+
+        Interval { l, r }
+    }
+
+    fn intersects(self, other: Self) -> bool {
+        other.l <= self.r && self.l <= other.r
+    }
+
+    fn intersection(self, other: Self) -> Self {
+        debug_assert!(self.intersects(other));
+
+        Interval::new(self.l.max(other.l), self.r.min(other.r))
+    }
+
+    fn contains(self, x: u64) -> bool {
+        self.l <= x && x <= self.r
+    }
+}
+
 pub fn parse(input: &str) -> Vec<Tile> {
     input.iter_unsigned::<u64>().chunk::<2>().collect()
 }
@@ -33,12 +69,6 @@ pub fn part2(tiles: &[Tile]) -> u64 {
 
     // Each red tile (`x`, `y`) becomes a candidate for being a top corner of the largest area, and during the
     // scan the `interval` containing the maximum possible width is updated:
-    struct Candidate {
-        x: u64,
-        y: u64,
-        interval: Interval,
-    }
-
     let mut candidates: Vec<Candidate> = Vec::with_capacity(512);
 
     // Maintain an ordered list of descending edges, i.e. [begin_interval_0, end_interval_0, begin_interval_1, end_interval_1, ...]:
@@ -74,7 +104,7 @@ pub fn part2(tiles: &[Tile]) -> u64 {
         );
 
         // Check the rectangles this red tile could be a bottom tile for, with the current candidates:
-        for candidate in candidates.iter() {
+        for candidate in &candidates {
             for x in [x0, x1] {
                 if candidate.interval.contains(x) {
                     largest_area = largest_area
@@ -109,35 +139,6 @@ pub fn part2(tiles: &[Tile]) -> u64 {
     largest_area
 }
 
-/// The set { x in u64 | l <= x <= r }.
-#[derive(Clone, Copy)]
-struct Interval {
-    l: u64,
-    r: u64,
-}
-
-impl Interval {
-    fn new(l: u64, r: u64) -> Self {
-        debug_assert!(l <= r);
-
-        Interval { l, r }
-    }
-
-    fn intersects(self, other: Self) -> bool {
-        other.l <= self.r && self.l <= other.r
-    }
-
-    fn intersection(self, other: Self) -> Self {
-        debug_assert!(self.intersects(other));
-
-        Interval::new(self.l.max(other.l), self.r.min(other.r))
-    }
-
-    fn contains(self, x: u64) -> bool {
-        self.l <= x && x <= self.r
-    }
-}
-
 // Adds `value` if it isn't in `ordered_list`, removes it if it is, maintaining the order.
 fn toggle_value_membership_in_ordered_list(ordered_list: &mut Vec<u64>, value: u64) {
     let mut i = 0;