specter VS adventofcode

> Another example is Specter. Specter is a generically useful library for querying and manipulating data structures

> https://github.com/redplanetlabs/specter/tree/master/src

> MutableCell.Java. 8 years ago

  package com.rpl.specter;

If you are truly interested in understanding my point of view -- a great way to do it would be to learn how to use this Clojure DSL: https://github.com/redplanetlabs/specter

For deeply nested data, use specter https://github.com/redplanetlabs/specter

Yes :), I needed a fast dijkstra implementation to solve a puzzle in 2021. A pure clojure implementation was too slow so i built one on top of this https://github.com/redplanetlabs/specter

https://github.com/redplanetlabs/specter (very powerful way to express modifications to nested data)

Don't forget about specter which is efficient and compact due to its DSL.

Learn and use specter for nested data manipulation, will take some studying but is a more general solution (https://github.com/redplanetlabs/specter)

For part 1, the version (and other things) are attached to the metadata of each sexp, and a Specter recursive path is used to extract all of the versions.

Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.

[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex