> Don't try the templates, they will lead you into a dead end... "People who think they know everything really annoy those of us who know we don't."
> I had a pool allocator in mind, where the allocator draws memspace from a > list of memory regions and the refcount bookkeeps the refs (summarized) into > entire regions. When such a refcount becomes zero, then the entire memory > region will get freed and therefore, you will get some speed. That's coarse grained refcounting, you save the inner-region pointer update RC ops, but the stack RC ops remain. It also has nothing to do with Bacon/Dingle. Just like a > if there are some. The primary problem of Bacon/Dingle are the abundant > refcount updates coming from local refs on the stack. Something that the > recent GC avoids. Deterministic deallocation is not automatically making > Bacon/Dingle a better design. No, indeed, it's not automatically better, but I wrote about its benefits, for Nim, and I don't like repeating myself.
