Fork me on GitHub
#meander
<
2021-03-19
>
mac18:03:45

Hej all, I am matching on a rather large datastructure using search and $. I would like to try to optimize this a bit. Is there a way to short circuit sub structures under for instance specific keys that I know are not relevant?

noprompt19:03:23

Not at the moment one thing you could try is

(keep (fn [x] (m/find x ,,,))
      (tree-seq branch? children root))

mac19:03:35

Thanks. Will be messy do to the heterogeneity of the structure.