@nathanmarz thanks again for all the help again the other day! I just wanted to clarify one thing, this function you gave me for filtering out empty lists isn't working: (setval [LEAVES ALL #(= [] %)] NONE *map*). It seems like it should so I'm a bit confused.

seems to be working fine

user=> (def LEAVES
  #_=>   (recursive-path [] p
  #_=>     (if-path map?
  #_=>       [MAP-VALS p]
  #_=>       STAY
  #_=>       )))
#'user/LEAVES
user=> (def m {0 {1 [[1 2 3] [] [4]]} 2 [[] [] [5 6]]}) 
#'user/m
user=> (setval [LEAVES ALL #(= [] %)] NONE m)
{0 {1 [[1 2 3] [4]]}, 2 [[5 6]]}

Oh wait. You're filtering empty vectors inside the values. I was thinking that would filter values that were empty vectors.

if you want to filter the direct values of the maps then just remove the ALL

you can also do (setval [LEAVES (continue-then-stay ALL) #(= [] %)] NONE m) to remove empty vectors from inside the map values and then remove key/value pairs where the value is []

Ah, I see. I just looked back at the docs. Since I'm already selecting for leaves of the maps that means ALL would go inside any collections present in the values. I assumed it meant "apply this to all leaves."

Yup, looks good now. Thanks!

no problem

@teng srange navigates you to a sequence, so navigating to a keyword from there doesn't make sense

I think you want: (setval [:educations (nthpath 1) :major-name] "C" data)

@nathanmarz That worked, thanks! 🙂

@nathanmarz so in the crazy nested structure of {:id "blah :children [{:id "blah2 :children [ .. ]]} it looks like a (select-first (recursive-path [] p [(walker (fn [x] ... match an id ...) STAY]) tree) will grab any intermediate node in that structure (and halt with the STAY) is that right?

@albaker it'll grab the first node it encounters

fyi that path isn't recursive so no reason to use recursive-path

and no reason to have the STAY after walker

ah, so the walker will depth first down through w/o a recursive path, and select-first makes STAY redundant? I'm still wrapping my head around paths