AOC - My solutions to Advent of Code

	Commit message (Collapse)	Author	Age
*	Day 19	Tom Smeding	2020-12-25
\| \| \| \| \| \| \| \|	The second part was supposed to be more difficult than the first part; the problem statement hinted that you might need to memoise the set of sentences matched by non-recursive rules, "especially rules 42 and 31". Why the hell then did my utterly naive matcher from part 1 work without changes in ~60ms total?
*	Day 18	Tom Smeding	2020-12-23
\| \| \| \|	Yay parsec
*	Day 17	Tom Smeding	2020-12-23
\|
*	Day 16	Tom Smeding	2020-12-19
\|
*	Day 15 (slow)	Tom Smeding	2020-12-16
\|
*	Day 14	Tom Smeding	2020-12-16
\|
*	Day 13	Tom Smeding	2020-12-16
\|
*	Day 12	Tom Smeding	2020-12-16
\|
*	Day 12 part 1	Tom Smeding	2020-12-14
\|
*	Day 11	Tom Smeding	2020-12-14
\|
*	Day 10	Tom Smeding	2020-12-13
\| \| \| \| \| \| \| \|	This one is particularly nice in Haskell, since transforming the naive recursive function to a memoised, linear form was literally a matter of writing the recursion using an explicit fixpoint combinator, and then replacing the recursive call with a lazy array index. This is where laziness shines.
*	Day 9	Tom Smeding	2020-12-13
\|
*	Day 8	Tom Smeding	2020-12-08
\|
*	Less intrusive Makefile dependency tracking	Tom Smeding	2020-12-08
\|
*	Day 7	Tom Smeding	2020-12-07
\|
*	Day 6	Tom Smeding	2020-12-06
\|
*	Day 5	Tom Smeding	2020-12-05
\|
*	Simplify hs dependency stuff in Makefile	Tom Smeding	2020-12-05
\|
*	Day 4	Tom Smeding	2020-12-04
\|
*	Add a hie.yaml	Tom Smeding	2020-12-03
\|
*	Day 3	Tom Smeding	2020-12-03
\|
*	Day 2	Tom Smeding	2020-12-02
\|
*	Start of 2020	Tom Smeding	2020-12-01