AOC - My solutions to Advent of Code

	Commit message (Collapse)	Author	Age
*	11	Tom Smeding	2024-12-14
\|
*	10	Tom Smeding	2024-12-14
\|
*	9	Tom Smeding	2024-12-14
\|
*	WIP 9	Tom Smeding	2024-12-09
\|
*	8	Tom Smeding	2024-12-09
\|
*	7	Tom Smeding	2024-12-09
\|
*	6	Tom Smeding	2024-12-08
\| \| \| \|	Part 2 is very slow, but meh?
*	5 (don't put f*** cycles in your graph)	Tom Smeding	2024-12-06
\|
*	4	Tom Smeding	2024-12-04
\|
*	3	Tom Smeding	2024-12-03
\|
*	2: Fix bug that doesn't get triggered by my input	Tom Smeding	2024-12-02
\|
*	2	Tom Smeding	2024-12-02
\|
*	Can't share input	Tom Smeding	2024-12-02
\|
*	1: optimise (as if it's necessary)	Tom Smeding	2024-12-02
\|
*	2024	Tom Smeding	2024-12-02
\|
*	16	Tom Smeding	2021-12-16
\| \| \| \| \|	I don't know what you're all about with parsec and stuff, plain recursive descent?
*	Cleanup 15	Tom Smeding	2021-12-15
\|
*	15	Tom Smeding	2021-12-15
\|
*	Faster 14	Tom Smeding	2021-12-15
\|
*	14	Tom Smeding	2021-12-15
\|
*	uniq in Util	Tom Smeding	2021-12-15
\|
*	Remove Futhark type suffix in output of 9	Tom Smeding	2021-12-13
\|
*	13	Tom Smeding	2021-12-13
\|
*	12	Tom Smeding	2021-12-13
\|
*	11	Tom Smeding	2021-12-13
\|
*	WIP 11	Tom Smeding	2021-12-12
\|
*	Less warnings on 5 and 8	Tom Smeding	2021-12-12
\|
*	10	Tom Smeding	2021-12-12
\|
*	9	Tom Smeding	2021-12-09
\|
*	8	Tom Smeding	2021-12-08
\|
*	7	Tom Smeding	2021-12-07
\|
*	6	Tom Smeding	2021-12-06
\|
*	5	Tom Smeding	2021-12-05
\|
*	4	Tom Smeding	2021-12-04
\|
*	Allow 'c' argument for auto-paste	Tom Smeding	2021-12-04
\|
*	3	Tom Smeding	2021-12-03
\|
*	2	Tom Smeding	2021-12-02
\|
*	2021	Tom Smeding	2021-12-01
\|
*	Day 20	Tom Smeding	2020-12-27
\|
*	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.