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,4f316de357ae35e9 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-08-05 06:31:54 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!hammer.uoregon.edu!skates!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: Re: FAQ and string functions Date: 05 Aug 2002 09:29:29 -0400 Organization: NASA Goddard Space Flight Center (skates.gsfc.nasa.gov) Message-ID: References: <20020730093206.A8550@videoproject.kiev.ua> <4519e058.0207300548.15eeb65c@posting.google.com> <20020731104643.C1083@videoproject.kiev.ua> <4519e058.0208010629.5e6182ca@posting.google.com> <20020801194720.Q1080@videoproject.kiev.ua> <4519e058.0208020605.5ab7e092@posting.google.com> <3D4AAF63.72782659@san.rr.com> <3D4B2382.7030209@telepath.com> <3D4B2ACD.FDA29B9A@san.rr.com> <3D4B401E.3060802@telepath.com> <3D4B4477.500088B@san.rr.com> NNTP-Posting-Host: anarres.gsfc.nasa.gov Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: skates.gsfc.nasa.gov 1028554681 10081 128.183.220.71 (5 Aug 2002 13:38:01 GMT) X-Complaints-To: usenet@news.gsfc.nasa.gov NNTP-Posting-Date: 5 Aug 2002 13:38:01 GMT User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: archiver1.google.com comp.lang.ada:27700 Date: 2002-08-05T13:38:01+00:00 List-Id: Darren New writes: > Tell me how you declare a variable for an array whose bounds you don't know > until after you're past the declaration? Tell me how you add more elements > to the end of an array? Use SAL.Poly.Unbounded_Array. As has been said before, you just need the appropriate library. > You can't do something like X := X & Y as far as *I* understand. Hmm. SAL.Poly.Unbounded_Array does not currently provide this operator (no one has asked for it :). But it clearly can. > > You are quite correct there. All that stuff is basicly equivalent to > > Unbounded Lists and Maps, which is a known deficiency that will > > (hopefully) be addressed in the next version of the language. > > That's good news! My concern is that while you *can* implement it, if it > doesn't come with the language, you're likely to wind up having incompatible > implementations between packages. Exactly. But the only way to ensure that it gets into the next version of the language is to start implementing it now, so we have a solid proposal. -- -- Stephe