Add argument to parser for disambiguating real data versus examples

This breaks less code than adding it to the solution functions, and is more elegant in a way.

haskell/Main.hs

@@ -35,7 +35,7 @@ main =
                             pt = show number
                             parseFile fp =
                                 either (fail . ("parse failure: " <>) . errorBundlePretty) pure
-                                    . runParser (parser <* eof) fp
+                                    . runParser (parser isRealData <* eof) fp
                                     =<< T.readFile fp
                          in
                             withResource (parseFile $ "../inputs/" <> t <> "/" <> pt) mempty \input ->

haskell/Pre.hs

@@ -82,7 +82,7 @@ import Text.Megaparsec.Char.Lexer (decimal)
 
 data Puzzle = forall input. Puzzle
     { number :: Word
-    , parser :: Parsec Void Text input
+    , parser :: Bool -> Parsec Void Text input
     , parts :: [input -> TL.Text]
     , extraTests :: Bool -> FilePath -> IO input -> [TestTree]
     }

haskell/Puzzles/Day1.hs

@@ -8,7 +8,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 1
-        , parser = flip sepEndBy newline $ (,) <$> ((char 'L' $> L) <|> (char 'R' $> R)) <*> (Inc <$> decimal)
+        , parser = const $ flip sepEndBy newline $ (,) <$> ((char 'L' $> L) <|> (char 'R' $> R)) <*> (Inc <$> decimal)
         , parts =
             [ TL.show
                 . sum

haskell/Puzzles/Day2.hs

@@ -9,7 +9,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 2
-        , parser = (<* newline) $ flip sepBy (char ',') $ (,) <$> (decimal <* char '-') <*> decimal
+        , parser = const $ (<* newline) $ flip sepBy (char ',') $ (,) <$> (decimal <* char '-') <*> decimal
         , parts =
             [ TL.show
                 . sum

haskell/Puzzles/Day3.hs

@@ -9,7 +9,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 3
-        , parser = flip sepEndBy newline $ Bank . fmap (fromIntegral . digitToInt) <$> some1 digitChar
+        , parser = const $ flip sepEndBy newline $ Bank . fmap (fromIntegral . digitToInt) <$> some1 digitChar
         , parts =
             [ TL.show
                 . sum

haskell/Puzzles/Day4.hs

@@ -12,7 +12,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 4
-        , parser = flip sepEndBy newline $ some $ asum $ enumerate <&> \t -> char (inToChar t) $> t
+        , parser = const $ flip sepEndBy newline $ some $ asum $ enumerate <&> \t -> char (inToChar t) $> t
         , parts =
             [ TL.show
                 . (\g -> countRolls g - countRolls (removeAccessibleRolls $ findAccessible g))

haskell/Puzzles/Day5.hs

@@ -8,7 +8,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 5
-        , parser = do
+        , parser = const do
             ranges <- flip sepEndBy newline $ Range <$> decimal <* single '-' <*> decimal
             void newline
             vals <- sepEndBy decimal newline

haskell/Puzzles/Day6.hs

@@ -8,7 +8,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 6
-        , parser = do
+        , parser = const do
             ints <- (hspace *> (decimal `sepBy1` hspace1)) `sepEndBy1` newline
             ops <- ((single '*' $> Multiply) <|> (single '+' $> Add)) `sepEndBy` hspace1
             void newline

haskell/Puzzles/Day7.hs

@@ -10,7 +10,7 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 7
-        , parser = do
+        , parser = const do
             line1 <- some $ (single '.' $> False) <|> (single 'S' $> True)
             start <- maybe (fail "start not found") (pure . fst) $ find snd $ zip [0 ..] line1
             void newline

haskell/Puzzles/Day8.hs

@@ -11,20 +11,18 @@ puzzle :: Puzzle
 puzzle =
     Puzzle
         { number = 8
-        , parser = (V3 <$> decimal <* single ',' <*> decimal <* single ',' <*> decimal) `sepEndBy` newline
+        , parser = \isRealData -> (if isRealData then 1000 else 10,) <$> (V3 <$> decimal <* single ',' <*> decimal <* single ',' <*> decimal) `sepEndBy` newline
         , parts =
-            [ TL.show
+            [ uncurry \n -> TL.show
                 . product
                 . take 3
                 . sortOn Down
                 . map length
                 . DS.toLists
                 . snd
-                . \boxes ->
+                . (!! n)
-                    -- TODO more principled way of distinguishing example and real
+                . connectBoxes
-                    (!! ((if length boxes == 20 then 10 else if length boxes == 1000 then 1000 else undefined))) $
+            , uncurry . const $ TL.show
-                        connectBoxes boxes
-            , TL.show
                 . maybe (error "sets never unified") (\((V3 x1 _ _, V3 x2 _ _), _) -> x1 * x2)
                 . lastMay
                 . takeWhile ((> 1) . DS.sets . snd)