[gclist] Finalization and collection should be separatly encapsulated..

[Stefan Monnier]

> Now the only data structure I can find that fills the bill is
> an acyclic graph. The question is what is the most natural and
> least intrusive way of being sure the acyclic graph stays acyclic
> through modifications. The method cannot require massive overhead
> to change the graph. This will make more restrictive than the
> acyclic requirment.

Not unsurprisingly, you'll find that one solution is to impose a stack
without forwards pointers. It's like imposing a total order where a partial
order suffices, but it makes for extremely light-weight code and is impressively
simple and probably fits most uses.


	Stefan