Re: Pointer function parameter

[Robert Dewar <robert_dewar@my-deja.com>]

In article <cJGH5.335638$i5.5078954@news1.frmt1.sfba.home.com>,
  tmoran@bix.com wrote:
> >virtually all dynamic data structures (linked lists, trees,
etc.)
> >require them.  [access types]
>   No. People were making those structures using array indexing
and not
> access types a long, long time ago.  Look at some old Fortran
code.


Well of course you can do anything in any style, The reason
that Fortran programmers did this was simple, no pointers!
Now of course there are still cases where arrays can be
usefully used instead of pointers (see the front end of
GNAT and the use of the Table abstraction for example), but
the use of pointers is perfectly fine in Ada, and we should
not think otherwise. Almost nothing *requires* anything if
we are strict about the term, Turing machines are pretty
powerful :-)


Sent via Deja.com http://www.deja.com/
Before you buy.