Mhh it seems that my answer is not relevant to your question.
I haven't figured out how to do it yet, but I think, in this case, a
'recursive' solution that renders as points are created would use a lot
less resources, assuming that processed replacement rules are garbage
collected as the stack unwinds and elements are traversed over.
This sound like a case for 'co
2017-03-03 13:32 GMT+01:00 Joh-Tob Schäg <johtob...@gmail.com>:
> The initial iterative replacement solution I came up with (below) quickly
> runs out of resources as it has to build the entire list before starting to
> What error did you get?
> How much resources does picolisp use?
> Do you call ulimit before?
> I think you may have some fundamental problems with garabarage allocation