I'm taking another at an AOC series, once again in C. I wanted to use it to learn CLion, work hard at not giving up at yet-another-graph traversal thing, and build a fun CLI.
Always appreciative for these annual puzzles that Eric Wastl puts together.
New this time is a single-entry-point CLI with a relatively simple model for extensibility, i.e. adding solution for a new day. Also is some support for profiling (like if I have different implementations of the same solution), and a form of unit-testing to capture the expected output value and validate it. Again, setting myself up to be able to iterate or optimize or play with solutions after they're solved.
Here's the simple help for the CLI:
aoc - CLI driver for AOC 2022 puzzles
usage:
aoc (empty) runs the puzzle dataset for the most recent day that's been implemented
aoc N runs the puzzle dataset for day N
aoc all runs the puzzle dataset for all the days implemented
-s Sample: solves the sample dataset instead of the actual puzzle dataset
-t Test: run both the puzzle and sample datasets and compares the results
the expected saved values
-q Quiet: suppress the summary message at the end of a dataset solution
-p Profile: iterates 10 times over the dataset and times the execution
-?, -h Help: you're looking at it
Nothing right now.
Welp, there's a CMakeLists.txt (possibly in the top 5 of dumb hardcoded naming patterns from tools), so maybe it'll just work for you.
This code is copyrighted 2022 by Chad Royal but is free to use under the MIT License. Share and enjoy.