[gclist] Finalization and object orientation.

[Charles Fiterman]

>But, I don't think we need to handle cycles. Finalization
>order usually indicates dependence. If A is dependent on B,
>then B must finalize before A. A and B can't be both dependent
>upon one another, or there is no possible way to finalize
>them. I therefore believe that a dependence graph is
>necessarily a DAG.

As long as the finalization order being examined is one
intended for that use alone there is no problem. The number
of pointers should be small maybe zero. Things only get sick
if we assume every pointer is an indication of finalization
order. Ordinary pointers are no indication of finalization 
order.

Maybe the way to get between 100 and 101 is 100.5
That is use floats instead of ints.
			-  
Charles Fiterman		Geodesic Systems
414 North Orleans Suite 410	Phone 312 832 1221 x223
Chicago IL 60610-4418		FAX   312 832 1230
				http://www.geodesic.com

A computer language without garbage collection
  is like a city without garbage collection.