From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,bc1361a952ec75ca X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-08-16 08:45:57 PST Path: archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsxfer.interpacket.net!news-west.rr.com!lsnws01.we.mediaone.net!cyclone-LA3.rr.com!typhoon.san.rr.com.POSTED!not-for-mail Message-ID: <3B7BEA38.7FD8E9F0@san.rr.com> From: Darren New Organization: Boxes! X-Mailer: Mozilla 4.77 [en] (Windows NT 5.0; U) X-Accept-Language: en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Ada and pointers References: <9ldto7$9pg$1@nh.pace.co.uk> <9lei8f$gmu$1@houston.jhuapl.edu> <9lgibn$ak1$1@nh.pace.co.uk> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Thu, 16 Aug 2001 15:43:52 GMT NNTP-Posting-Host: 24.165.20.141 X-Complaints-To: abuse@rr.com X-Trace: typhoon.san.rr.com 997976632 24.165.20.141 (Thu, 16 Aug 2001 08:43:52 PDT) NNTP-Posting-Date: Thu, 16 Aug 2001 08:43:52 PDT Xref: archiver1.google.com comp.lang.ada:11994 Date: 2001-08-16T15:43:52+00:00 List-Id: > 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?