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

Reply via email to