Kevin, Jorge, Fred,
thanks a lot for your advice.
I think I will go with Jorge's suggestion, extended with a check for
cycles involving cells, for the sake of generality.
I thought about using a binary search tree instead of a list for
tracking already visited records.
But then I would have to implement a strict ordering on cyclic records
and would be back at the starting point, I guess ;-)
Wolfgang
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
