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=3.8 required=5.0 tests=BAYES_00,INVALID_MSGID,
	RATWARE_MS_HASH,RATWARE_OUTLOOK_NONAME autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c63aa81a67eceb8f
X-Google-Attributes: gid103376,public
From: "Pascal Obry" <pascal_obry@csi.com>
Subject: Re: Ragged Array Proposal
Date: 1999/09/27
Message-ID: <01bf0919$67bbb350$022a6282@dieppe>#1/1
X-Deja-AN: 529968968
References: <37e7c08e@eeyore.callnetuk.com> <37EA9A72.594ED8F5@mitre.org>
 <37ebb120@eeyore.callnetuk.com> <7so0i4$d8j$1@nnrp1.deja.com>
X-Complaints-To: newsmaster@compuserve.com
X-Trace: ssauraaa-i-1.production.compuserve.com 938457758 12235 195.232.72.168
 (27 Sep 1999 18:42:38 GMT)
Organization: CompuServe Interactive Services
NNTP-Posting-Date: 27 Sep 1999 18:42:38 GMT
Newsgroups: comp.lang.ada
Date: 1999-09-27T18:42:38+00:00
List-Id: <comp.lang.ada>


> 
> Actually, that hides a bit of information. If I were writing it, it
> would look more like:
> 
> Fruits : constant array (Positive range <>) of
> Ada.Strings.Unbounded.Unbounded_String :=
>    (Ada.Strings.Unbounded.To_Unbounded_String("Apple"),
>     Ada.Strings.Unbounded.To_Unbounded_String("Orange"),
>     Ada.Strings.Unbounded.To_Unbounded_String("Pear"),
>     ...);
> 

Well Ada.Strings.Unbounded is a package that has been designed to
be used with a use clause. Look above at all the redundant infos. Really
I think that a use in this case is just nice.

Pascal.