Front page | perl.perl6.internals |
Postings from February 2001
Hong Zhang > > A deterministic finalization means we shouldn't need to force programmers > > to have good ideas. Make it easy, remember? :) > > I don't believe such an algorithm exists, unless you stick with reference > count. > Either doesn't exist, or is more expensive than refcounting. I guess we have to make a decision between deterministic finalization and not using refcounting as GC, because both together sure don't exist. And don't forget that if we stick with refcounting, we should try to find a way to break circular references, too. - BrandenThread Previous | Thread Next