fs_playground
advent_of_code_ex
| fs_playground | advent_of_code_ex | |
|---|---|---|
| 2 | 2 | |
| 0 | 0 | |
| - | - | |
| 8.3 | 7.0 | |
| 12 days ago | 6 months ago | |
| Jupyter Notebook | Elixir | |
| - | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
fs_playground
-
Advent of Code 2023 is nigh
Perhaps for some puzzles, but I find this solution to be pretty elegant!
https://github.com/williamcotton/fs_playground/blob/ffbc57ac...
-
Shh: Simple Shell Scripting from Haskell
Huh, I was just tinkering with the same sort of thing with the same motivations but with F#:
https://github.com/williamcotton/fs_playground/blob/main/Scr...
Thanks for this, I’m going to borrow a lot of your concepts, especially the added infix operators, those are slick!
advent_of_code_ex
-
Advent of Code 2023 is nigh
> Test your code as you go. Printing the output of intermediate steps to the console is a great way of catching bugs.
Honestly, just set up whatever you need to be able to write unit tests in your lang of choice. These problems are _so_ amenable to a piecewise approach driven by tests. I'm not like a big TDD advocate or anything, but these problems are great practice for that style of coding - it's just so damn useful to know each of your small pieces of code work.
Parameterized tests are amazing for AoC, because you can get a handful of test cases basically for free from the puzzle description. If your code doesn't work once you've got all the samples working, you either have some weird edge case that you didn't consider, or you've got one of the brute-force killer puzzles.
Even for today's, I wound up with 43 different test cases. The vast majority of those are from the puzzle text, and adding them didn't really make the puzzle take that much longer. (Obviously, if you're optimizing for solve speed, you probably wouldn't bother with this approach, but I'm not).
https://github.com/epiccoleman/advent_of_code_ex/blob/master...
Another thing of note is that every puzzle basically operates on a list of strings, so it's pretty easy to genericize certain parts of the work of solving puzzles. I have a script which generates a module for the solution in my repo, with separate functions for each part that receive the input, and a test file that has tests for part 1 and part 2. The tests read the input file and pass it as a list of strings (lines) to the part_1 and part_2 functions, so that all the boilerplate is already done, and I get to just focus on writing the guts of the part_1 and part_2 functions (which usually get broken down into several other functions, which can also be tested individually).
What are some alternatives?
shh - Simple shell like scripting from Haskell
advent2023 - scribblings at advent of code 2023
tanenbaum - OCaml Advent of Code starter project
advent-of-code - Advent of Code 2022 solutions
xonsh - :shell: Python-powered, cross-platform, Unix-gazing shell.
swift-interpreter - Build an interpreter in Swift
kino_aoc - A helper for Advent of Code (a smart cell) for Elixir Livebook
advent-of-code
AdventOfCode2023
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.