Re: Lower bound of result of Ada.Strings.Unbounded.Slice

["Randy Brukardt" <randy@rrsoftware.com>]

Jeff Carter wrote in message <3A1C4F45.26F41F0D@acm.org>...
>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 AI itself is part of the corrigendum, but as you say, it has nothing
to say about the lower bound of Slice.

The correct AI to look at is AI-00238. It asks this exact question. You
will note, however, that this is a work item AI which has not yet been
considered by the full ARG. (It wasn't discussed at the recent meeting).
The write-up is based on E-Mail discussion and aan existing
implementation survey.

The e-mail in the appendix is interesting; it is awful long for such a
simple issue!

Anyway, I think it wouldn't be too prudent to depend on any particular
bounds from Slice until this issue is resolved.

                Randy Brukardt, ARG Editor