|
From: | lloda |
Subject: | Re: more advanced bytevector => supervectors |
Date: | Wed, 8 Sep 2021 09:18:05 +0200 |
I'm curious where you're going with this. I implemented something similar (iiuc) in https://github.com/lloda/guile-newra/, specifically https://github.com/lloda/guile-newra/blob/master/mod/newra/map.scm , where the lookup/set methods are inlined in the loop. The compilation times indeed grow exponentially so I'm forced to have a default 'generic' case. The idea for fixing this was to have some kind of run time compilation cache so only a fixed number of type combinations that actually get used would be compiled, instead of the tensor product of all types. But I haven't figured out, or actually tried to do that yet. Regards Daniel |
[Prev in Thread] | Current Thread | [Next in Thread] |