Can I use specter to get the path of some deeply nested key using a predicate? Say I want the path to the last value that’s brown here: {:a "foo" :b :_ :c {:d "brown" :e "bar"} :f [{:g "pale" :h "brown" :i {:j "ale" :k [{:l "brown"} {:l "brown"}]}}]}

@hkjels yes, you use recursive-path and collect-one

a related example here: https://github.com/nathanmarz/specter/wiki/Using-Specter-Recursively#find-the-index-route-of-a-value-within-a-data-structure

@nathanmarz thanks! I’ll give that a shot Looks like a really good lib

@nathanmarz: Just pushed a new version of PR with mutual recursion and the building blocks we've been working on - could use an assist coming up with a better example for mutually recursive paths

@michaelwfogleman I only ever made a mutually recursive path once... and it's way too involved to use as an example

I think just showing the basics of how mutually recursive paths would be structured is sufficient

speaking of examples, if anyone has any interesting ones that they want me to turn into a specter koan, just open an issue and paste it in https://github.com/gdeer81/specter-koans/issues

or you can just paste your scratchpad and I can mine it for any good nuggets

@nathanmarz In that case, the PR should be either pretty close or good to go 🙂