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=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Question on bounded / unbounded strings Date: Fri, 23 Sep 2016 09:48:55 +0200 Organization: Aioe.org NNTP Server Message-ID: References: <11ee98f5-d373-4c72-8562-c310cc76817d@googlegroups.com> <177d0054-2925-42d5-afba-f013dc7db4e2@googlegroups.com> <625e3d31-1a45-4308-8122-e7ccac0b3e13@googlegroups.com> NNTP-Posting-Host: vZYCW951TbFitc4GdEwQJg.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:45.0) Gecko/20100101 Thunderbird/45.3.0 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:31860 Date: 2016-09-23T09:48:55+02:00 List-Id: On 23/09/2016 08:36, Simon Wright wrote: > Maciej Sobczak writes: > >> An array of characters with known bounds is a bounded string. > > It'd be less confusing in an Ada context to call this a *fixed* string. I think that is a *definite* string. Some nomenclature: Ada fixed string: bounds are fixed, but could be unknown. Ada's bounded string: bounded bounds (unintended pun) + an independent string type (design flaw, arbitrary constraint). Ada's Unbounded_String: unknown bounds (bounds are limited by the platform / implementation) P.S. Neither bounded nor unbounded Ada string is "an array of characters" (yet another design flaw). -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de