Bert Peters bert
0 Followers · 0 Following
Repositories
10
 Projects Packages Code Public Activity Starred Repositories
bert synced commits to master at bert/adventofcode from mirror 2021-12-16 23:27:22 +01:00
0f6167e90f Merge common parts of parsers
3e2a3f5206 Avoid allocating and tracking bits manually
8cc2245492 Optimize hex parser
Compare 3 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-16 15:27:22 +01:00
fb167ef899 Implementation day 16
bert synced commits to master at bert/adventofcode from mirror 2021-12-15 23:27:22 +01:00
4240f8fc8c Avoid queueing worse routes
9a4ac427e0 Use Dijkstra instead of A*
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-15 15:27:23 +01:00
c3929a56d8 Slow implementation for day 15
bert synced commits to master at bert/adventofcode from mirror 2021-12-14 23:27:22 +01:00
9e37026f30 Remove unnecessary indexing
a926243f0d Improve "winning" logic
a35ae82548 Replace unnecessary HashMap and allocations
Compare 3 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-14 15:27:22 +01:00
8a0b72f111 Implementation day 14 2021
bert synced commits to master at bert/aur from mirror 2021-12-14 04:07:22 +01:00
d1ba1566b2 upgpkg: json_dto 0.3.0-1
bert synced commits to master at bert/adventofcode from mirror 2021-12-13 23:27:22 +01:00
b5866b2d8a Modify points in-place
554683bc64 Actually apply nom
1031a8cdbb Avoid allocating the final buffer twice
5c764f6627 Don't use silly hashsets
Compare 4 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-13 15:27:22 +01:00
ffe8d27469 Clean up day 13 a little.
d471f170b3 Very dirty solution day 13
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-12 23:27:22 +01:00
07cbf6cf53 Fix upcoming clippy warning
6e3252ce5a Add formal benchmarking code
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-12 15:27:22 +01:00
0897e2e907 Implement day 12 part 2
4d1fdd9cc0 Implement day 12 part 1
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-11 23:27:22 +01:00
84c160cf54 Simplify part 2
bert synced commits to master at bert/adventofcode from mirror 2021-12-11 15:27:22 +01:00
440d454911 Implement day 11
bert synced commits to master at bert/adventofcode from mirror 2021-12-10 15:27:22 +01:00
50cd6d8171 Implementation day 10 2021
bert synced commits to master at bert/adventofcode from mirror 2021-12-09 15:27:22 +01:00
dde9c0adbf Update to RC version of clap
e0e1bc26e8 Simplify implementation day 8
77ce31980b Implement day 9
Compare 3 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-08 15:17:23 +01:00
8c78106846 Bit-optimize day 8
22f767e8df Implement day 08 2021
Compare 2 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-07 15:17:22 +01:00
3434966ac2 Just use the median, obviously
c5f66fcc09 Avoid more allocations in day 7 part 1
c02f1e11c5 Convert recursion to iteration
d099614217 Improve part 2 with binary search
766ee91719 Brute-force day 7 part 2
Compare 6 commits »
bert synced commits to master at bert/adventofcode from mirror 2021-12-06 15:17:22 +01:00
b369f9d36a Implement day 6 2021
bert synced commits to master at bert/adventofcode from mirror 2021-12-05 15:17:22 +01:00
1433b0cdbe Implement day 5
bert synced commits to master at bert/adventofcode from mirror 2021-12-04 15:10:26 +01:00
5e52da6e6b Use iterator instead of range
e50b812aed Day 4: more efficiently ignore completed cards
fdef10a78e Less awkward line length hack
392aefb32d Less allocations in day 3 part 2
fb358be8f0 Implementation day 4 2021
Compare 5 commits »