Re: Ada and pointers

[Darren New <dnew@san.rr.com>]

> It sounds to me like you think I'm claiming that people should translate
> their linked list programs into array implementations - or that trying to do
> so would be a good thing. This is not my claim at all.

FWIW, in college I used a Lisp interpreter written in Fortran IV.
INTEGER CAR(200000)
INTEGER CDR(200000)

 :-)


As an aside, I have a C library right now that uses lots of linked
lists. Linked lists of messages to send, linked lists of messages
awaiting answers, linked lists of message numbers sent for which no
answer has been received, etc.  Basically, most of these would be better
as arrays where I could add elements to either end or delete elements
from either end or the middle. Is there a better idiom for doing this in
Ada, rather than using access types? 

Basically, I guess I'm asking whether there's an idiom for building
unbounded queues rather than with linked lists using access types?

-- 
Darren New / Senior MTS & Free Radical / Invisible Worlds Inc.
San Diego, CA, USA (PST). Cryptokeys on demand. dnew@san.rr.com
           When was sliced bread invented?