Clojurians Log v2

Hey everyone, I’m trying to traverse some nested tree in a level-order traversal, for example:

(defn descendants [cont]
    [(sp/recursive-path [] p
                        (sp/if-path  :children
                                     [:children sp/MAP-VALS (sp/stay-then-continue p)])) cont])
  

  (sp/select [(descendants [(sp/pred #(= (-> % :meta :name) "child1"))])]
             {:meta {:id "root" :name "root"}
              :children {:child1 {:meta {:id :child1 :name "child1"}
                                  :children {:child11 {:meta {:id :child11 :name "child11"}}}}
                         :child2 {:meta {:id :child2  :name "child2"}
                                  :children {:child1 {:meta {:id :child21 :name "child1"}}}}}})
  ;; Returns:
  ;; [{:meta {:id :child1, :name "child1"}, :children {:child11 {:meta {:id :child11, :name "child11"}}}}
  ;;  {:meta {:id :child21, :name "child1"}}]

  (sp/select [(descendants [(sp/pred #(= (-> % :meta :name) "child1"))])]
             {:meta {:id "root" :name "root"}
              :children {:child2 {:meta {:id :child2  :name "child2"}
                                  :children {:child1 {:meta {:id :child21 :name "child1"}}}}
                         :child1 {:meta {:id :child1 :name "child1"}
                                  :children {:child11 {:meta {:id :child11 :name "child11"}}}}}}))
;; Returns:
;; [{:meta {:id :child21, :name "child1"}}
;;  {:meta {:id :child1, :name "child1"}, :children {:child11 {:meta {:id :child11, :name "child11"}}}}]

you can't traverse in level-order with Specter

but your path is simpler like this: (def DESCENDANTS (recursive-path [] p (continue-then-stay :children MAP-VALS)))

and then you can use it like (select [DESCENDANTS (selected? :meta :name (pred= "child1"))] data)

one could probably capture the depth during traversal and post-process with a sort