kamov/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

haskell: 2023 15 refactor

Browse source
This commit is contained in:
Maciej Jur 2023-12-16 12:49:02 +01:00
parent bbc271e001
commit 4b3faa6e12
Signed by: kamov
GPG key ID: 191CBFF5F72ECAFD
2 changed files with 10 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
2023/.inputs/15 Normal file
View file

File diff suppressed because one or more lines are too long

15
2023/haskell/solutions/Day15.hs
View file

@ -5,11 +5,12 @@ import Data.Void (Void)
import Data.Text (Text)
import qualified Data.Text as T
import Data.Char (ord, isSpace)
import Data.List (findIndex)
import Data.Bifunctor (bimap)
import Text.Megaparsec (Parsec, errorBundlePretty, runParser, sepBy, optional, eof, many, choice)
import Text.Megaparsec.Char (newline, alphaNumChar, char)
import Text.Megaparsec.Char.Lexer (decimal)
import Lens.Micro (ix, (%~))
import Lens.Micro (ix, (%~), (.~))
data Op
@ -50,12 +51,14 @@ del :: Text -> [[Entry]] -> [[Entry]]
del k = ix (hash k) %~ filter ((k /=) . fst)
set :: Text -> Int -> [[Entry]] -> [[Entry]]
set k v = ix (hash k) %~ update
set k v = ix (hash k) %~ upsert
where
update :: [Entry] -> [Entry]
update es
| any ((k ==) . fst) es = map (\(k', v') -> if k == k' then (k, v) else (k', v')) es
| otherwise = es <> [(k, v)]
update :: Int -> [Entry] -> [Entry]
update n = ix n .~ (k, v)
insert :: [Entry] -> [Entry]
insert = (<> [(k, v)])
upsert :: [Entry] -> [Entry]
upsert es = maybe (insert es) (`update` es) . findIndex ((k ==) . fst) $ es
solveB :: [(Text, Op)] -> Int
solveB = sum . zipWith row [1..] . foldl (flip run) (replicate 256 []) . map snd