bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity
831 Commits 5 Branches 0 Tags
1dc59c18ebbf05ba1b1083db6f9d8f83fe259fd7
Commit Graph

831 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Bert Peters
ea31a088b0 Merge branch '2018-benchmarking' 2018-12-18 16:22:34 +01:00
Bert Peters
477aaccc54 Use a macro for benchmarking. 
With this macro the code needed for a new benchmark is minimal, but not
small enough IMO. Unfortunately, a better version would require
concat_ident, which is not going to happen soon.
 2018-12-18 15:54:11 +01:00
Bert Peters
cc72c481cc Initial work on writing benchmarks. 2018-12-18 13:56:34 +01:00
Bert Peters
0b69a74cff Formatting and LOC update. 2018-12-18 12:06:27 +01:00
Bert Peters
89816ae2d7 Implement day 18. 
Curiously, it reminds me of some other day involving plants.
 2018-12-18 12:03:05 +01:00
Bert Peters
33f32fc1ac Update LOC count 2018-12-17 12:31:29 +01:00
Bert Peters
f23624c456 Fix all clippy warnings. 2018-12-17 12:26:31 +01:00
Bert Peters
851868bed4 Even more clean up. 
Removed duplicated code in the descend stage and moved it to different
functions. Also, range finders are no longer technically infinite, but
are assumed to be.
 2018-12-17 11:45:23 +01:00
Bert Peters
a632bdff10 Clean up. 2018-12-17 08:33:16 +01:00
Bert Peters
f175584ccf Update LOC graph. 2018-12-17 08:19:37 +01:00
Bert Peters
45a8b38ad4 Implement day 17. 
Today was a nice exercise, and I got to be somewhat fast too. Number 328/314.
 2018-12-17 08:18:25 +01:00
Bert Peters
eaa868017d Elaborate on tests. 2018-12-16 16:31:17 +01:00
Bert Peters
fbac0fb7f7 Update README. 
README now includes a small graphic with the lines of code per day.
 2018-12-16 16:27:29 +01:00
Bert Peters
718fd72cef Implement day 16 part 2. 2018-12-16 16:19:37 +01:00
Bert Peters
4fa6998369 Implement day 16 part 1. 2018-12-16 11:12:32 +01:00
Bert Peters
5b87c12b5f Remove numpy dependency. 2018-12-16 00:20:08 +01:00
Bert Peters
ed77e30cbf Add a plotting script for how terrible simulations are. 2018-12-15 23:24:36 +01:00
Bert Peters
7369fd2290 Small improvement to day 15. 2018-12-15 22:25:59 +01:00
Bert Peters
14a766f6f2 Implement day 15 part 2. 2018-12-15 22:16:30 +01:00
Bert Peters
10918a62ad Fix day 15 part 1. 2018-12-15 21:12:58 +01:00
Bert Peters
ae51e3c114 Clean up and simplify. 
The idea is that this makes it easier to debug. I'm not sure it does
yet.
 2018-12-15 19:12:33 +01:00
Bert Peters
44e5c38268 Attempt to fix Ubuntu incompatibility. 2018-12-15 18:11:16 +01:00
Bert Peters
baf07a7eaf Reuse manhattan implementation from common. 2018-12-15 18:08:42 +01:00
Bert Peters
069e381aeb Partial solution for day 15 part 1. 
Partial in the sense that it doesn't actually work for my input, only
for the samples.
 2018-12-15 18:02:16 +01:00
Bert Peters
bcccc85073 Reimplement day 14 with infinite streams. 2018-12-14 14:48:53 +01:00
Bert Peters
ccdbea4a1c Off-by-one bug fix 2018-12-14 12:02:27 +01:00
Bert Peters
5c4646b323 Clean up. 2018-12-14 11:48:48 +01:00
Bert Peters
f4a7b06d47 Reuse input helper. 2018-12-14 11:42:44 +01:00
Bert Peters
98da0a9857 Implement day 14. 2018-12-14 11:37:30 +01:00
Bert Peters
faf3ad90d9 Make day 12 even more rusty. 2018-12-13 14:55:30 +01:00
Bert Peters
0de6e22a00 Deduplicate day 12. 2018-12-13 14:47:00 +01:00
Bert Peters
91f0ec55f1 Slightly cleaned up by using structs. 2018-12-13 11:44:18 +01:00
Bert Peters
e6c8c6b100 Implement a very ugly part 2. 2018-12-13 11:24:03 +01:00
Bert Peters
973c9ed63b Add a part1 implementation and wrong part2. 2018-12-13 10:52:32 +01:00
Bert Peters
e22f934ea6 Remove code duplication. 2018-12-12 16:12:26 +01:00
Bert Peters
8340f2c8fa Preallocate correct state length. 2018-12-12 13:08:35 +01:00
Bert Peters
247613555b Implement day 12 part 2. 
This in no way should work, but it does, at least for my input.
 2018-12-12 12:44:27 +01:00
Bert Peters
fd3e509841 Implement part 1 of day 12. 
Part two is going to take 31 hours of computation, so I might need to
improve that.
 2018-12-12 11:30:45 +01:00
Bert Peters
b245e0911d Implement the summed-area-table algorithm. 
Which is somewhat awkward for the edge cases (that are not in my input!)
but is really fast anyway.
 2018-12-11 18:14:15 +01:00
Bert Peters
4b8255728c Remove an invalid optimization. 2018-12-11 15:49:39 +01:00
Bert Peters
59be8e9d7a Implement day 11 part 2. 2018-12-11 11:06:20 +01:00
Bert Peters
ff8bc97329 Implement day 11 part 1. 2018-12-11 10:31:23 +01:00
Bert Peters
eaf1156ae0 Refactor for autovectorization. 
By storing x/y as a vector of ints instead of a vector of tuples, the
compiler recognizes it for what it is: a huge vector multiplication. Now
the compiler emits AVX2 instructions.
 2018-12-10 17:13:10 +01:00
Bert Peters
c3480482f2 Implement an estimator function for day 10. 
This bumps the speed tenfold.
 2018-12-10 14:17:57 +01:00
Bert Peters
c94555fda1 Implement day 10. 
This implementation is stupid but it works.
 2018-12-10 13:13:29 +01:00
Bert Peters
63a5f81d8c Pre-allocate correct size. 2018-12-09 17:47:22 +01:00
Bert Peters
c17be69910 Replace linkedlist with VecDeq. 
Slightly slower but a lot cleaner.
 2018-12-09 13:27:05 +01:00
Bert Peters
9b287a0098 Prepare future scaffolding. 
Also reformat the code, but that is nothing significant.
 2018-12-09 13:02:54 +01:00
Bert Peters
9b04e3b2c9 Implement day 9 part 2. 
Linked lists in rust are a pain, but we got there.
 2018-12-09 10:57:47 +01:00
Bert Peters
e101dbd58c Move get_impl to crate. 2018-12-09 10:49:04 +01:00