Fork me on GitHub
#meander
<
2021-04-02
>
ribelo21:04:28

Is there any way to do it faster and better? Better in the sense that search when adding or returns all possible combinations

(m/search dx100k
       {_ {_ {:db/id ?e
              :name  "Ivan"}}} ?e)
such a thing works, but for more elements it throws a stackoverflow
(m/rewrite dx100k
       (m/map-of _ (m/map-of _ {:db/id !e :name "Ivan"}))
       [!e ...])

Jimmy Miller00:04:19

Definitely seems with filing an issue for. If you could include the stacktrace we can look into and see if it is easy to fix or not. Will try to look at the error message soon to understand the root cause.

ribelo00:04:16

and stacktrace

Jimmy Miller17:04:49

So I see the ultimate problem. But I’m really not sure if there is a straight forward fix here. Basically we generate some mutually recursive functions that blow the stack. We could definitely be smarter about this. A github issue would be nice if you have the time. (If not I can) Maybe @U06MDAPTP has some idea of a good fix for this. But there is a chance we might just hold off on this till zeta. (Unless someone else wants to help fix it which is of course always welcome).

noprompt18:04:26

Thanks for opening the ticket!

👍 3
telekid22:04:19

Jimmy – I’m assuming you’ve come across this in your studies, but just in case you haven’t, you may find it interesting: https://egraphs-good.github.io/