>> That's why I said full ref counting, not any of the deferred variants. The >> only "complicated" part to explain are why some programs may experience >> pauses when collecting a large structure. > I wasn't talking about deferred variants. Hybrid refcounting systems with > cycle collection essentially use periodic Mark-Sweep to find cycles (not > unlike a GC). I'm not aware of any such system which can guarantee > deterministic collection of cycles. If there is one, I'd love to be pointed > to it.
if you could boil the ocean to make it happen, how would you do that? if memory were no object, or if there were a co-processor only for finding cycles, if every time something got a reference to something else, could a table of transitive closures or some such be updated? _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
