oliver
@eikopf.com
absolutely will not shut up about programming languages. apparently also now the calendar guy
(he/him)
(he/him)
i am a walking national stereotype
December 11, 2025 at 10:03 AM
i am a walking national stereotype
yeah okay you can just do this instead
![solvePart2 :: [Vec3 Int] -> Int
solvePart2 ps = go Set.empty (length ps) . Seq.sortOn (uncurry d2) . pairs $ ps
where
go :: Set (Vec3 Int) -> Int -> Seq (Vec3 Int, Vec3 Int) -> Int
go _ pointCount Empty = error "unexpected end of list"
go seenPoints pointCount ((pl@(Vec3 lx _ _), pr@(Vec3 rx _ _)) :<| ps) =
let seenPoints' = Set.union seenPoints (Set.fromList [pl, pr])
in (if Set.size seenPoints' == pointCount then lx * rx else go seenPoints' pointCount ps)](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:vt464ohreg6sglmnb4cuctmr/bafkreihgy7da24er6jac2ydxbpx53dpdvti4k4pufywzl4z5rtahempdq4@jpeg)
December 8, 2025 at 2:02 PM
yeah okay you can just do this instead
![data Vec3 a = Vec3 a a a
deriving (Show, Ord, Eq)
-- | The squared Euclidean distance.
d2 :: (Num a) => Vec3 a -> Vec3 a -> a
d2 (Vec3 l1 l2 l3) (Vec3 r1 r2 r3) = (l1 - r1) ^ 2 + (l2 - r2) ^ 2 + (l3 - r3) ^ 2
parse :: String -> [Vec3 Int]
parse = map parseVec3 . lines
where
parseVec3 :: String -> Vec3 Int
parseVec3 s0 =
let (x, s') = span (/= ',') s0
(y, s'') = span (/= ',') $ drop 1 s'
z = drop 1 s''
in Vec3 (read x) (read y) (read z)
pairs :: [a] -> Seq (a, a)
pairs =
Seq.fromList
. concatMap (\(x :| xs) -> map (x,) xs)
. mapMaybe nonEmpty
. tails
-- the solution for part 1 would be much faster using a union-find data structure, but since there
-- doesn't seem to be an implementation of one in the GHC libraries i'm just using a set of sets
solvePart1 :: Int -> [Vec3 Int] -> Int
solvePart1 i =
foldl' (*) 1
. take 3
. sortBy (\lhs rhs -> compare (Down lhs) (Down rhs))
. fmap Set.size
. go []
. Seq.take i
. Seq.sortOn (uncurry d2)
. pairs
where
go :: [Set (Vec3 Int)] -> Seq (Vec3 Int, Vec3 Int) -> [Set (Vec3 Int)]
go circuits Empty = circuits
go circuits ((pl, pr) :<| ps) =
let (cs, cs') = partition (\set -> Set.member pl set || Set.member pr set) circuits
c = Set.unions (Set.fromList [pl, pr] : cs)
in go (c : cs') ps
solvePart2 :: [Vec3 Int] -> Int
solvePart2 ps = go [] (length ps) . Seq.sortOn (uncurry d2) . pairs $ ps
where
go :: [Set (Vec3 Int)] -> Int -> Seq (Vec3 Int, Vec3 Int) -> Int
go _ pointCount Empty = error "unexpected end of list"
go circuits pointCount ((pl@(Vec3 lx _ _), pr@(Vec3 rx _ _)) :<| ps) =
let (cs, cs') = partition (\set -> Set.member pl set || Set.member pr set) circuits
c = Set.unions (Set.fromList [pl, pr] : cs)
in ( if null cs' && Set.size c == pointCount
then lx * rx
else go (c : cs') pointCount ps
)
main :: IO ()
main = interact $ \…](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:vt464ohreg6sglmnb4cuctmr/bafkreihnqyzfhsowsofnwdd5hutzn6akdil3w6v5k2wanpvq5cloxko2de@jpeg)
i should post about things i should do
December 7, 2025 at 11:05 AM
i should post about things i should do
google overview is so helpful 🥰
December 6, 2025 at 9:09 AM
google overview is so helpful 🥰
> leftcoded tone
> assumes i’m an american
> normal life is a failure
> poverty is shameful
> go rerun the bernie 2016 campaign
> assumes i’m an american
> normal life is a failure
> poverty is shameful
> go rerun the bernie 2016 campaign
December 6, 2025 at 8:59 AM
> leftcoded tone
> assumes i’m an american
> normal life is a failure
> poverty is shameful
> go rerun the bernie 2016 campaign
> assumes i’m an american
> normal life is a failure
> poverty is shameful
> go rerun the bernie 2016 campaign
very happy with my solution for today
![data Db = Db [(Int, Int)] [Int]
deriving (Show)
parse :: String -> Db
parse = uncurry Db . bimap (map readRange) (map read . drop 1) . break null . lines
where
readRange :: String -> (Int, Int)
readRange = bimap read (read . drop 1) . break (== '-')
solvePart1 :: Db -> Int
solvePart1 (Db rs is) = length $ filter (flip any rs . flip inRange) is
solvePart2 :: Db -> Int
solvePart2 (Db rs _) =
sum . map rangeSize $
fix (\rec rs -> let rs' = foldl' upsertRange [] rs in if rs == rs' then rs else rec rs') rs
where
upsertRange :: [(Int, Int)] -> (Int, Int) -> [(Int, Int)]
upsertRange [] r' = [r']
upsertRange (r : rs) r' = case unionMaybe r r' of
Nothing -> r : upsertRange rs r'
Just r'' -> r'' : rs
unionMaybe :: (Int, Int) -> (Int, Int) -> Maybe (Int, Int)
unionMaybe lhs@(l1, l2) rhs@(r1, r2) =
if inRange lhs r1 || inRange rhs l1
then Just (min l1 r1, max l2 r2)
else Nothing
main :: IO ()
main = interact $ \s ->
let input = parse s
part1 = solvePart1 input
part2 = solvePart2 input
in "part 1: " ++ show part1 ++ "\npart 2: " ++ show part2 ++ "\n"](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:vt464ohreg6sglmnb4cuctmr/bafkreifsgg5ghqjbz5sq4rqfkty25nggqvjvupvhbrzs2bbpag64bo5jre@jpeg)
December 5, 2025 at 10:35 AM
very happy with my solution for today
part of me yearns for documentation that looks like this
December 3, 2025 at 7:25 PM
part of me yearns for documentation that looks like this
epstein? the high-energy physicist?
December 2, 2025 at 4:33 PM
epstein? the high-energy physicist?
and then i gave up and just wrote this
![-- | Parses the puzzle input into a sequence of (start, end) pairs.
parse :: String -> [(Int, Int)]
parse = pairs . map read . splitWhen (`elem` "-,") . filter (/= '\n')](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:vt464ohreg6sglmnb4cuctmr/bafkreiedjxt2kpmaugrl4qom5qo56t2yu26t6snuotmtbqqildk2ed5ite@jpeg)
December 2, 2025 at 1:35 PM
and then i gave up and just wrote this
haskelloids what the fuck does this mean
![, tgtUseLibffiForAdjustors = True
, tgtCCompiler = Cc {ccProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["--target=arm64-apple-darwin","-Qunused-arguments"] }}
, tgtCxxCompiler = Cxx {cxxProgram = Program { prgPath = "/usr/bin/g++" , prgFlags = ["--target=arm64-apple-darwin"] }}
, tgtCPreprocessor = Cpp {cppProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["-E"] }}
, tgtHsCPreprocessor = HsCpp {hsCppProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["-E","-undef","-traditional","-Wno-invalid-pp-token","-Wno-unicode","-Wno-trigraphs"] }}
, tgtJsCPreprocessor = Just (JsCpp {jsCppProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["-E","-CC","-Wno-unicode","-nostdinc"] }})
, tgtCmmCPreprocessor = CmmCpp {cmmCppProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["-E"] }, cmmCppSupportsG0 = True}
, tgtCCompilerLink = CcLink
{ ccLinkProgram = Program { prgPath = "/usr/bin/gcc" , prgFlags = ["--target=arm64-apple-darwin","-Wl,-no_fixup_chains","-Wl,-no_warn_duplicate_libraries"] }
, ccLinkSupportsNoPie = False
, ccLinkSupportsCompactUnwind = True
, ccLinkSupportsFilelist = True
, ccLinkSupportsSingleModule = False
, ccLinkIsGnu = False
}
, tgtAr = Ar
{ arMkArchive = Program { prgPath = "/usr/bin/ar" , prgFlags = ["qcls"] }
, arIsGnu = False
, arSupportsAtFile = False
, arSupportsDashL = False
, arNeedsRanlib = True
}
, tgtRanlib = Just (Ranlib {ranlibProgram = Program { prgPath = "/usr/bin/ranlib" , prgFlags = [] }})
, tgtNm = Nm {nmProgram = Program { prgPath = "/usr/bin/nm" , prgFlags = [] }}
, tgtMergeObjs = Just (MergeObjs {mergeObjsProgram = Program { prgPath = "/usr/bin/ld" , prgFlags = ["-r"] }, mergeObjsSupportsResponseFiles = True})
, tgtWindres = Nothing
}
ghc-toolchain-bin: Prelude.read: no parse
configure: WARNING:
There are some differences between the toolchain configured by "configure" (default.target) and the toolchain configured by the "ghc-toolchain" program (default.target.ghc-toolchain).
0a1,42
>…](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:vt464ohreg6sglmnb4cuctmr/bafkreif7egg5nuvmog3dprji3geg7hi5tu55jy4ntgaqbvgoiayhdse5ke@jpeg)
December 1, 2025 at 11:49 AM
haskelloids what the fuck does this mean
hmmmmmm this guy seems really well-adjusted
November 30, 2025 at 8:53 PM
hmmmmmm this guy seems really well-adjusted
world's most elegant programming language strikes again
November 24, 2025 at 4:35 PM
world's most elegant programming language strikes again
i was looking to see if ghc does any niche optimisations and what do you mean a tuple can have at most 64 elements
November 24, 2025 at 4:30 PM
i was looking to see if ghc does any niche optimisations and what do you mean a tuple can have at most 64 elements
here’s a page from the middle of the book
November 23, 2025 at 5:10 PM
here’s a page from the middle of the book
valve you cannot be putting USB-A into a new consumer device in the year of our lord 2025
November 12, 2025 at 6:37 PM
valve you cannot be putting USB-A into a new consumer device in the year of our lord 2025
