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, MSGID_RANDY 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: Robert Dewar Subject: Re: Ragged Array Proposal Date: 1999/09/25 Message-ID: <7sijop$tab$1@nnrp1.deja.com>#1/1 X-Deja-AN: 529392928 References: <37e7c08e@eeyore.callnetuk.com> <37EA9A72.594ED8F5@mitre.org> <37ebb120@eeyore.callnetuk.com> X-Http-Proxy: 1.0 x40.deja.com:80 (Squid/1.1.22) for client 205.232.38.14 Organization: Deja.com - Before you buy. X-Article-Creation-Date: Sat Sep 25 13:47:07 1999 GMT X-MyDeja-Info: XMYDJUIDrobert_dewar Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I) Date: 1999-09-25T00:00:00+00:00 List-Id: In article <37ebb120@eeyore.callnetuk.com>, "Nick Roberts" wrote: > Using Ada.Strings.Unbounded is one of the unappealing alternatives I was > talking about. The trouble with this thread is that it is just replaying an old discussion with little new being added on both sides. I guess that is somewhat inevitable as new people begin to think about things, often without digging through the past :-) Nick, you might want to dig up some of the old discussions and proposals on ragged arrays ... Sent via Deja.com http://www.deja.com/ Before you buy.