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-Thread: 103376,a3736685ef876ab2 X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news2.google.com!news.glorb.com!wns14feed!worldnet.att.net!attbi_s22.POSTED!53ab2750!not-for-mail From: "Jeffrey R. Carter" User-Agent: Thunderbird 2.0.0.9 (Windows/20071031) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: OO Style with Ada Containers References: <1195082906.420079.195000@d55g2000hsg.googlegroups.com> <1s27rv0gt4ujj$.3e2k326rp54d.dlg@40tude.net> <60e46dc9-d8ca-4f47-9e8a-f90a7d45e752@w28g2000hsf.googlegroups.com> <0319d921-4457-4b47-87f2-3f310aaa3d93@o6g2000hsd.googlegroups.com> <5076f153-d879-43dd-b2c8-ad61eeea241d@d61g2000hsa.googlegroups.com> <4182086a-2968-4c42-b08a-1a30b05fcf63@c29g2000hsa.googlegroups.com> <400347d7-aa93-4175-a3dc-e415ad0d9ca3@i29g2000prf.googlegroups.com> <4743f801$0$16661$9b4e6d93@newsspool3.arcor-online.net> In-Reply-To: <4743f801$0$16661$9b4e6d93@newsspool3.arcor-online.net> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 12.201.97.213 X-Complaints-To: abuse@mchsi.com X-Trace: attbi_s22 1195683920 12.201.97.213 (Wed, 21 Nov 2007 22:25:20 GMT) NNTP-Posting-Date: Wed, 21 Nov 2007 22:25:20 GMT Organization: AT&T ASP.att.net Date: Wed, 21 Nov 2007 22:25:20 GMT Xref: g2news1.google.com comp.lang.ada:18554 Date: 2007-11-21T22:25:20+00:00 List-Id: Georg Bauhaus wrote: > > 'Think of arrays as sequential structures. Some of the brightest people > in computer science have suggested that arrays never be accessed > randomly, but only sequentially (Mills and Linger 1986). Their argument > is that random accesses in arrays are similar to random "gotos" in a > program.' (p251) Actually, Mills and Linger suggested that arrays and pointers never be used; that the only data structures in an application be stacks, queues, and sets. They argued that indices and pointers were the data equivalent of using goto in programming. The paper is "Data Structured Programming: Program Design without Arrays and Pointers", /IEEE Transactions on Software Engineering/, 1986 Feb. -- Jeff Carter "Beyond 100,000 lines of code you should probably be coding in Ada." P. J. Plauger 26