refactor(day2): make parseInput truly point-free

IndecisionTree · IndecisionTree · commit 7fe09cebe4ab · 2022-12-02T09:01:21.000-05:00
diff --git a/solutions/Days/Day02.hs b/solutions/Days/Day02.hs
@@ -1,22 +1,22 @@
 module Days.Day02 (day02) where
 
 import AOC (Solution (..))
-import Data.Bifunctor (second)
+import Control.Arrow ((>>>), (***), second)
 import Data.Maybe (fromMaybe)
 import qualified Data.Text as T
 
 day02 :: Solution
 day02 = Solution parseInput part1 part2
+
 data RPS = Rock | Paper | Scissors
   deriving (Show, Eq, Enum, Bounded)
 
 data Action = Lose | Draw | Win
   deriving (Show, Eq)
 
 parseInput :: T.Text -> [(RPS, T.Text)]
-parseInput = fmap pLine . T.lines
+parseInput = fmap (T.breakOn " " >>> translate table *** T.tail) . T.lines
   where
-    pLine l = let [a, b] = T.words l in (translate table a, b)
     table = [("A", Rock), ("B", Paper), ("C", Scissors)]
 
 part1 :: [(RPS, T.Text)] -> Int
