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,LOTS_OF_MONEY autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,4c459ff0adb576bc X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-02-09 15:06:14 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!newsfeeds.belnet.be!news.belnet.be!news.tele.dk!small.news.tele.dk!207.115.63.138!newscon04.news.prodigy.com!newsmst01.news.prodigy.com!prodigy.com!postmaster.news.prodigy.com!newssvr30.news.prodigy.com.POSTED!not-for-mail From: "Pat Rogers" Newsgroups: comp.lang.ada References: <3C5AB0B7.9D75D49A@grammatech.com> <3c639940@pull.gecm.com> <4519e058.0202080714.1bf916bb@posting.google.com> <23f98.25730$H37.3045922@news2-win.server.ntlworld.com> Subject: Re: Refactoring and Ada X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Message-ID: <0Xh98.39580$B42.1708056640@newssvr30.news.prodigy.com> NNTP-Posting-Host: 208.191.180.40 X-Complaints-To: abuse@prodigy.net X-Trace: newssvr30.news.prodigy.com 1013295932 ST000 208.191.180.40 (Sat, 09 Feb 2002 18:05:32 EST) NNTP-Posting-Date: Sat, 09 Feb 2002 18:05:32 EST Organization: Prodigy Internet http://www.prodigy.com X-UserInfo1: FKPO@MC@OXRQRILY@BJZ\_TDFRYB@GXLN@GZ_GYO^BVNDQUBLNTC@AWZWDXZXQ[K\FFSKCVM@F_N_DOBWVWG__LG@VVOIPLIGX\\BU_B@\P\PFX\B[APHTWAHDCKJF^NHD[YJAZMCY_CWG[SX\Y]^KC\HSZRWSWKGAY_PC[BQ[BXAS\F\\@DMTLFZFUE@\VL Date: Sat, 09 Feb 2002 23:05:32 GMT Xref: archiver1.google.com comp.lang.ada:19820 Date: 2002-02-09T23:05:32+00:00 List-Id: "martin.m.dowie" wrote in message news:23f98.25730$H37.3045922@news2-win.server.ntlworld.com... > > The issue is indeed performance. (The special case to be recognized by > the > > compiler is that the clause is in fact a confirming rep clause.) The > semantics > > have to be maintained -- eg, array indexing and for-loop iterations -- but > the > > compiler will produce comparably inefficient code unless the special case > is > > recognized. (Most do.) Think about how array element address calculation > would > > work using arbitrarily ascending values for the indexes, and the problem > becomes > > evident. > > Thought as much - not exactly hard to spot though you would think! Right.