Piers Cawley wrote: >"Branden" <[EMAIL PROTECTED]> writes: >> Of course, C++ has no GC, which is a good thing, but you can always >> fake it with Refcounts, which is much more efficient, and easily >> feasable with C++. > >Err... current research shows that the refcount approach is one of the >slowest forms of GC, and it doesn't even do the job properly. > >-- >Piers I actually don't understand how traversing a graph can be faster than incrementing/decrementing/testing for zero on a refcount. I believe you, but I just don't understand. Could you point me to some URLs that talk about this? Thanks alot, - Branden
- Re: JWZ on s/Java/Perl/ David Mitchell
- Re: JWZ on s/Java/Perl/ Jeanna FOx
- Re: JWZ on s/Java/Perl/ Dan Sugalski
- Re: JWZ on s/Java/Perl/ Branden
- Re: JWZ on s/Java/Perl/ Thomas Butler
- Re: JWZ on s/Java/Perl/ Dan Sugalski
- Re: JWZ on s/Java/Perl/ David Mitchell
- Re: JWZ on s/Java/Perl/ Branden
- Re: JWZ on s/Java/Perl/ David Mitchell
- Re: JWZ on s/Java/Perl/ Branden
- Re: JWZ on s/Java/Perl/ Branden
- Re: JWZ on s/Java/Perl/ Piers Cawley
- Re: JWZ on s/Java/Perl/ Ken Fox
- Re: JWZ on s/Java/Perl/ Branden
- Re: JWZ on s/Java/Perl/ Dan Sugalski
- Re: JWZ on s/Java/Perl/ abigail
- Re: JWZ on s/Java/Perl/ David L. Nicol
- Re: JWZ on s/Java/Perl/ Ken Fox
- Re: JWZ on s/Java/Perl/ Robin Berjon
- Re: JWZ on s/Java/Perl/ Dan Sugalski
- Re: JWZ on s/Java/Perl/ Bart Lateur