Year 2023 speed and code quality improvements

Author: maneatingape

README.md

@@ -116,7 +116,7 @@ Performance is reasonable even on older hardware, for example a 2011 MacBook Pro
 | 7 | [Camel Cards](https://adventofcode.com/2023/day/7) | [Source](src/year2023/day07.rs) | 71 |
 | 8 | [Haunted Wasteland](https://adventofcode.com/2023/day/8) | [Source](src/year2023/day08.rs) | 34 |
 | 9 | [Mirage Maintenance](https://adventofcode.com/2023/day/9) | [Source](src/year2023/day09.rs) | 18 |
-| 10 | [Pipe Maze](https://adventofcode.com/2023/day/10) | [Source](src/year2023/day10.rs) | 41 |
+| 10 | [Pipe Maze](https://adventofcode.com/2023/day/10) | [Source](src/year2023/day10.rs) | 35 |
 | 11 | [Cosmic Expansion](https://adventofcode.com/2023/day/11) | [Source](src/year2023/day11.rs) | 12 |
 | 12 | [Hot Springs](https://adventofcode.com/2023/day/12) | [Source](src/year2023/day12.rs) | 387 |
 | 13 | [Point of Incidence](https://adventofcode.com/2023/day/13) | [Source](src/year2023/day13.rs) | 66 |

src/year2023/day10.rs

@@ -38,12 +38,34 @@ pub fn parse(input: &str) -> Input {
 
         // Change direction at corner pieces.
         direction = match grid[position] {
-            b'7' if direction == UP => LEFT,
-            b'F' if direction == UP => RIGHT,
-            b'J' if direction == DOWN => LEFT,
-            b'L' if direction == DOWN => RIGHT,
-            b'J' | b'L' => UP,
-            b'7' | b'F' => DOWN,
+            b'7' => {
+                if direction == UP {
+                    LEFT
+                } else {
+                    DOWN
+                }
+            }
+            b'F' => {
+                if direction == UP {
+                    RIGHT
+                } else {
+                    DOWN
+                }
+            }
+            b'J' => {
+                if direction == DOWN {
+                    LEFT
+                } else {
+                    UP
+                }
+            }
+            b'L' => {
+                if direction == DOWN {
+                    RIGHT
+                } else {
+                    UP
+                }
+            }
             _ => {
                 // We've looped all the way back to the start.
                 area += determinant(corner, position);

src/year2023/day12.rs

@@ -147,7 +147,7 @@ pub fn part2(input: &[Spring<'_>]) -> u64 {
         let partial = solve(iter, 5);
         shared.fetch_add(partial, Ordering::Relaxed);
     });
-    shared.load(Ordering::Relaxed)
+    shared.into_inner()
 }
 
 pub fn solve<'a, I>(iter: I, repeat: usize) -> u64

src/year2023/day16.rs

@@ -4,7 +4,7 @@
 //! according to the rules of each tile.
 //!
 //! To speed things up the next coordinate in each direction is precomputed for every point
-//! so that the empty spaces between mirrros and splitters are filled efficiently.
+//! so that the empty spaces between mirrors and splitters are filled efficiently.
 //!
 //! Some beams can enter a closed loop so we keep track of previously seen `(position, direction)`
 //! pairs and stop if we've seen a pair before.
@@ -129,7 +129,7 @@ pub fn part2(input: &Input) -> usize {
     // Use as many cores as possible to parallelize the search.
     spawn(|| worker(&shared));
 
-    shared.tiles.load(Ordering::Relaxed)
+    shared.tiles.into_inner()
 }
 
 /// Process starting locations from a shared queue.