specter VS nested-data-structure-traversal

> 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.

Oh boy, some of the recent additions are looking tragic. Completely ignoring "reset_lesson_position", to code-golf their own simplified ideal of the problem? Eg. (at time of my comment) https://github.com/josevalim/nested-data-structure-traversal/blob/master/rust/for_in_anonymous_tuples.rs

Amusingly, I think I will lose this if I don't link it here. https://github.com/josevalim/nested-data-structure-traversal... is my attempt at getting a LOOP solution in.

As noted in the message, I originally did this in elisp, which felt a bit more natural, for some reason.

Traversing nested data-structures in various languages\ (32 comments)