Re: Ada Queue

[Ole-Hjalmar Kristensen <ohk@clustra.com>]

"Joseph T." <thisthat7@hotmail.com> writes:

> Yes...I am looking for that techincal discussion...you're so slick.  =)
> 
> Let me ask you this...how come then, did the author of this page ( a CS professor
> ) choose the same method shown here:
> 
> http://www.cm.cf.ac.uk/Dave/C/node11.html
> 
> I think that the Ada replicates the method in C used by this professor. 
> Does his code suffer from the same things you mentioned?
> 

It would perhaps have been clearer for the reader to use a temporary
variable to iterate, but there are no other drawbacks associated with
his method, which is indeed a very common way of doing it in C.

But the algorithms can be made simpler (but perhaps not clearer) by
using a pointer to a pointer instead of a simple pointer.
For example, the AddItem code can be made much simpler by defining it
as listelement * AddItem (listelement ** listpointer, int data);
How to simplify the body of the function is left as an exercise to the
reader :-)

> Thanks so much.
> 

-- 
E pluribus Unix