From ac194d1d611ebbad8dd6c4718e8ad7c57a2b99df Mon Sep 17 00:00:00 2001
From: George Thomas <georgefsthomas@gmail.com>
Date: Tue, 2 Dec 2025 02:08:23 +0000
Subject: [PATCH] Format

---
 app/Main.hs | 50 +++++++++++++++++++++++++++-----------------------
 1 file changed, 27 insertions(+), 23 deletions(-)

diff --git a/app/Main.hs b/app/Main.hs
index 3971f6a..5365e48 100644
--- a/app/Main.hs
+++ b/app/Main.hs
@@ -35,29 +35,33 @@ puzzle1 =
                     _ -> Nothing
                 )
                 . lines
-        , part1 = Part { solve =
-            show
-                . sum
-                . flip evalState 50
-                . traverse \(d, i) -> state \p ->
-                    let (_, p') = step i d p
-                     in (Count if p' == 0 then 1 else 0, p')
-            }
-        , part2 = Part { solve =
-            show
-                . sum
-                . flip evalState 50
-                . traverse \(d, i) -> state \p ->
-                    let (c, p') = step i d p
-                        c' = case d of
-                            R -> abs c
-                            L ->
-                                if
-                                    | p == 0 -> abs c - 1
-                                    | p' == 0 -> abs c + 1
-                                    | otherwise -> abs c
-                     in (c', p')
-            }
+        , part1 =
+            Part
+                { solve =
+                    show
+                        . sum
+                        . flip evalState 50
+                        . traverse \(d, i) -> state \p ->
+                            let (_, p') = step i d p
+                             in (Count if p' == 0 then 1 else 0, p')
+                }
+        , part2 =
+            Part
+                { solve =
+                    show
+                        . sum
+                        . flip evalState 50
+                        . traverse \(d, i) -> state \p ->
+                            let (c, p') = step i d p
+                                c' = case d of
+                                    R -> abs c
+                                    L ->
+                                        if
+                                            | p == 0 -> abs c - 1
+                                            | p' == 0 -> abs c + 1
+                                            | otherwise -> abs c
+                             in (c', p')
+                }
         }
 
 data Direction = L | R