Re: C bug of the day

[Wesley Groleau <wesgroleau@despammed.com>]

 > The "adjustment" procedure is used for such things as incrementing
 > reference counts. The "finalize" procedure could be used to

There are probably a lot of good ways to use Ada "adjust."
One important one is replacing a copy of a pointer with
a pointer to a new copy of the heap object.

This can be recursive, so that in a tree or list or such,
each allocation also "adjusts" any pointers within.

But then what if it's something like a map or graph, where
there may be more than five pointers to the same node?
You'd want one new node with five pointers to it.
Can be done, but it's awkward.  Hoever, not as awkward
as doing the whole deep copy _without_ language assistance.

I presume C++ is substantially equivalent on this issue?


      [ See http://www.gotw.ca/resources/clcm.htm for info about ]
      [ comp.lang.c++.moderated.    First time posters: Do this! ]