Siphalor/adventofcode24
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Day eight: Use Flow for more sane piping

Browse Source
This commit is contained in:
Siphalor
2024-12-08 14:01:32 +01:00
parent ff74e85ba6
commit 3fe54232b2
5 changed files with 10 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
day-08-haskell/src/Common.hs
View File

@@ -2,6 +2,7 @@ module Common where
import Data.Foldable (toList)
import qualified Data.Map.Strict as Map
import Flow
multiMapFromList :: Ord k => [(k, v)] -> Map.Map k [v]
multiMapFromList = Map.fromListWith (++) . map (\(k, v) -> (k, [v]))
@@ -20,10 +21,10 @@ enumerate :: [a] -> [(Int, a)]
enumerate = zip [0..]
readWorld :: String -> World
readWorld input = (determineSize $ lines input, readAntennas input)
readWorld input = (lines input |> determineSize, readAntennas input)
where
determineSize :: [String] -> Position
determineSize ls = (maximum $ map length ls, length ls)
determineSize ls = (map length ls |> maximum, length ls)
readAntennas :: String -> [Antenna]
readAntennas input = enumerate (lines input) >>= readLine

3
day-08-haskell/src/Task1.hs
View File

@@ -4,10 +4,11 @@ import Common (Position, readWorld, multiMapFromList, pairPermutations)
import qualified Data.Map.Strict as Map
import qualified Data.Set as Set
import Control.Monad (join)
import Flow
task1 :: String -> Int
task1 input = case readWorld input of
((width, height), antennas) -> length $ Set.fromList $ filter isInWorld $ join $ map antinodesOfFrequency $ Map.elems $ multiMapFromList antennas
((width, height), antennas) -> multiMapFromList antennas |> Map.elems |> map antinodesOfFrequency |> join |> filter isInWorld |> Set.fromList |> length
where
antinodesOfFrequency :: [Position] -> [Position]
antinodesOfFrequency nodes = pairPermutations nodes >>= antinodesOfPair

5
day-08-haskell/src/Task2.hs
View File

@@ -4,10 +4,11 @@ import Common (Position, readWorld, multiMapFromList, pairPermutations)
import qualified Data.Map.Strict as Map
import qualified Data.Set as Set
import Control.Monad (join)
import Flow
task2 :: String -> Int
task2 input = case readWorld input of
((width, height), antennas) -> length $ Set.fromList $ join $ map antinodesOfFrequency $ Map.elems $ multiMapFromList antennas
((width, height), antennas) -> multiMapFromList antennas |> Map.elems |> map antinodesOfFrequency |> join |> Set.fromList |> length
where
antinodesOfFrequency :: [Position] -> [Position]
antinodesOfFrequency nodes = pairPermutations nodes >>= antinodesOfPair
@@ -19,7 +20,7 @@ task2 input = case readWorld input of
in castInWorld a (-diffX, -diffY) ++ castInWorld b (diffX, diffY)
castInWorld (sx, sy) (ox, oy) =
takeWhile isInWorld $ map (\f -> (sx + ox * f, sy + oy * f)) [0..]
map (\f -> (sx + ox * f, sy + oy * f)) [0..] |> takeWhile isInWorld
isInWorld :: Position -> Bool
isInWorld (x, y)