AOC - My solutions to Advent of Code

	Commit message (Collapse)	Author	Age
*	Day 19 part 2	tomsmeding	2018-12-21
\|
*	Day 19 part 2 WIP	tomsmeding	2018-12-21
\|
*	Day 20	Tom Smeding	2018-12-20
\|
*	Day 19 part 1, part 2 WIP	Tom Smeding	2018-12-19
\|
*	Day 18	Tom Smeding	2018-12-18
\|
*	Fix warnings in day 17	Tom Smeding	2018-12-18
\|
*	Optimise day 17 a bit	tomsmeding	2018-12-17
\|
*	Day 17	tomsmeding	2018-12-17
\| \| \| \| \| \|	This was a really fun one! Enjoyed making the simulation that is really a complicated kind of automaton, and enjoyed looking at the automaton doing its thing in the terminal.
*	Day 16	tomsmeding	2018-12-16
\|
*	Make benchmark module less incorrect	tomsmeding	2018-12-15
\|
*	Day 15	tomsmeding	2018-12-15
\| \| \| \| \| \| \| \|	God dammit this one wasn't fun. The amount of edge cases and arbitrary rules made this more of a chore than a puzzle. The code could probably be shorter, but any sane amount of code structure and clarity demanded this size.
*	Own crappy benchmarking module	tomsmeding	2018-12-15
\|
*	Day 14	tomsmeding	2018-12-14
\|
*	Fix warnings in day13	tomsmeding	2018-12-14
\|
*	Day 13 part 2	Tom Smeding	2018-12-13
\|
*	Day 13 part 1	Tom Smeding	2018-12-13
\|
*	Day 12	Tom Smeding	2018-12-12
\|
*	Optimise day 11	Tom Smeding	2018-12-12
\|
*	Day 11	Tom Smeding	2018-12-11
\|
*	Optimise day 10	tomsmeding	2018-12-10
\|
*	Day 10	tomsmeding	2018-12-10
\|
*	Optimise day 6	tomsmeding	2018-12-09
\|
*	Run from crate root, not src/	tomsmeding	2018-12-09
\|
*	@lieuwex is a better cargo fix --edition-idioms	tomsmeding	2018-12-09
\|
*	cargo fix --edition-idioms	tomsmeding	2018-12-09
\|
*	Day 9	tomsmeding	2018-12-09
\|
*	Day 8	tomsmeding	2018-12-08
\|
*	Day 7	tomsmeding	2018-12-07
\|
*	Day 7 WIP	Tom Smeding	2018-12-07
\|
*	Day 6	Tom Smeding	2018-12-06
\|
*	Day 5 + benchmarking	Tom Smeding	2018-12-05
\|
*	Day 4	Tom Smeding	2018-12-04
\|
*	Day 3	tomsmeding	2018-12-03
\|
*	Day 2	tomsmeding	2018-12-02
\|
*	Start 2018!	tomsmeding	2018-12-01
\|
*	Christmas! 🎄	tomsmeding	2017-12-25
\|
*	Day 24	tomsmeding	2017-12-24
\|
*	Day 23	tomsmeding	2017-12-23
\| \| \| \|	Nice one, having to actually look at the input for once. :)
*	Day 22	tomsmeding	2017-12-22
\| \| \| \| \| \|	Haskell version is waaaaay too slow and uses huge amounts of memory. Didn't even let it run to completion on part 2. The C version is really quick. /shrug/
*	Day 21	tomsmeding	2017-12-21
\| \| \| \| \|	Please compile this, and even then running takes about a minute on my PC. This is a SLOW implementation, but it works.
*	Day 20	tomsmeding	2017-12-20
\| \| \| \| \| \|	This gives the right answer, but that 100 is a HIGHLY magic constant. Increase if incorrect. `prune` should work, but doesn't for some reason. This is sad but I've spent enough time on this as is.
*	Day 19	tomsmeding	2017-12-19
\|
*	Day 18	tomsmeding	2017-12-18
\| \| \| \| \| \|	I misread part 2 thinking that 'rcv 0' still shouldn't do anything. It should. That solved some problems. As in, let it work first try afterwards.
*	Day 17	tomsmeding	2017-12-17
\| \| \| \| \|	You want to compile this for part 2. Inefficient, but works. Reusing part 1 was so inefficient that it blew up my memory.
*	Day 16 b	tomsmeding	2017-12-16
\|
*	Day 16 a	tomsmeding	2017-12-16
\|
*	Day 15	tomsmeding	2017-12-15
\| \| \| \| \|	Generators are cool. Please compile this, otherwise it will burn your CPU.
*	Day 14	tomsmeding	2017-12-14
\| \| \| \| \| \| \|	Honestly, I'm surprised that this is even remotely fast. The usage of plain linked-list strings should make this horrifyingly slow, but apparently, the combination of an optimising GHC and a not-too-large map (apparently) make this tractable.
*	Day 13	tomsmeding	2017-12-13
\|
*	Day 12	tomsmeding	2017-12-12
\|