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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,b41c04fc501479d6 X-Google-Attributes: gid103376,public From: Jeff Carter Subject: Re: Lower bound of result of Ada.Strings.Unbounded.Slice Date: 2000/11/22 Message-ID: <3A1C4F45.26F41F0D@acm.org>#1/1 X-Deja-AN: 696859780 Content-Transfer-Encoding: 7bit References: <3A1B087B.D45A8751@acm.org> <8vfjr1$t85$1@nnrp1.deja.com> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Complaints-To: abuse@earthlink.net X-Trace: newsread1.prod.itd.earthlink.net 974933836 199.174.137.78 (Wed, 22 Nov 2000 14:57:16 PST) Organization: EarthLink Inc. -- http://www.EarthLink.net MIME-Version: 1.0 NNTP-Posting-Date: Wed, 22 Nov 2000 14:57:16 PST Newsgroups: comp.lang.ada Date: 2000-11-22T00:00:00+00:00 List-Id: Robert Dewar wrote: > Always look up existing AI's before submitting a new one :-) That would be easier if there were some way to search them without downloading all of them. The only AI I could find that mentioned Unbounded.Slice is 128, which contains a comment from Keith Thompson that he disagreed with Bob Duff saying the lower bound should be 1, and that Robert Dewar also disagreed with Bob Duff. Perhaps I don't know how to read an AI, but I saw nothing to indicate that this was a binding interpretation (though I hope I'm wrong). > The proper answer is that the slice semantics are to be > observed (forcing a lower bound of 1 is wrong). If that's true, can I presume that the current version of GNAT works this way? The compiler that gave 1 as the lower bound is GNAT 3.13p/Win. -- Jeff Carter "Hello! Smelly English K...niggets." Monty Python & the Holy Grail