I’m stuck writing a selector: I’d like to recursively walk down nested maps, and, if I get a choice, deepest first. So, for:

{"a" {"b" {"c" 1}}}

writing the nested traversal that just grabs the values at the leaves is easy:

(sr/recursive-path
   [] p
   (sr/cond-path
    map? (sr/stay-then-continue [p sr/MAP-VALS])
    sr/STAY sr/STAY))

This is almost what I want:

(def tree-vals
  (sr/recursive-path
   [] p
   (sr/if-path map?
    [sr/VAL sr/MAP-VALS p]
    sr/STAY)))

(sr/NONE still selects nil; and I’m not sure how to say “ok you’re done now” — I don’t think it’s STOP, because that just stops navigation entirely, right?)

Got it:

(def tree-vals
  (sr/recursive-path
   [] p
   (sr/if-path map? (sr/continue-then-stay [sr/MAP-VALS p]))))

@lvh you can omit the [] in continue-then-stay

no performance difference, just a little nicer

Ah, thanks :)