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
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: 103376,54c513170bafd693
X-Google-Attributes: gid103376,public
From: Gautier <gautier.demontmollin@maths.unine.ch>
Subject: Re: Desirability of C++
Date: 2000/05/02
Message-ID: <390DFE79.FE2FBAD9@maths.unine.ch>#1/1
X-Deja-AN: 618017283
Content-Transfer-Encoding: 8bit
References: <01HW.B4BFC2820005B06B08A24140@news.pacbell.net>
 <20000204073443.24976.00001288@ng-ci1.aol.com> <87euk0$c93$1@nnrp1.deja.com>
 <Pine.BSF.4.21.0002040920070.2217-100000@shell5.ba.best.com>
 <01HW.B4C1346100072D2408A24140@news.pacbell.net>
 <949867976.281549@the-rowan.albatross.co.nz>
 <8766v93w66.fsf@deneb.cygnus.argh.org>
 <F721B334E5BE49E3.6D9E1F7A7C81C3CE.9B64FD843F046A46@lp.airnews.net>
 <sc336dpgee6168@corp.supernews.com> <38E8C81A.AA62CF4C@HiWAAY.net>
 <hoffman-ya02408000R1204002048410001@news.insync.net>
 <7EA1B852F5D4D8C6.26EEE9181C80F0DF.0161EA2D9C353253@lp.airnews.net>
 <01HW.B51C1B6E00F41C2D04BB51B0@news.pacbell.net>
 <38F796B2.A99A206A@ftw.rsc.raytheon.com> <38F7A27A.4F7729FA@raytheon.com>
 <8eclae$afj$1@slb7.atl.mindspring.net>
 <4F706057FEE2A550.BF5FE19AE279EFCD.A55706B3F9D07043@lp.airnews.net>
 <8eiv08$820$1@slb1.atl.mindspring.net> <390D001C.7433140B@netwood.net>
 <390D58F9.7CC64B85@maths.unine.ch> <t7r9bmjnf7.fsf@calumny.jyacc.com>
 <390DEC7F.9429C82C@online.no>
X-Accept-Language: en
Content-Type: text/plain; charset=iso-8859-1
X-Trace: 2 May 2000 00:00:26 +0100, mac13-32.unine.ch
Organization: Maths - Uni =?iso-8859-1?Q?Neuch=E2tel?=
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Date: 2000-05-02T00:00:00+00:00
List-Id: <comp.lang.ada>

"Tarjei Tj�stheim Jensen":

> I think a lot of the strings stuff is dinosaur stuff (probably very nice
> for real time, but not wonderful for general computing stuff). The
> impression is that there is too much copying going on. I think Borland
> made the right decision on strings when they selected counted strings
> for Turbo Pascal/Delphi even if they are limited to 255 characters or
> less. And I think they made the right decision about how to handle
> string assignment, compares, etc.

Agreed - except that while you manipulate strings as expressions
it remains easy. Also slices. The variables are funnier...
Well there is Ada.Strings.Bounded, but with 1 package instance per
maximum length! Incidentally I just made a (pure Ada 83) BorStrings
package, see paqs.zip @
______________________________________________________
Gautier  --  http://members.xoom.com/gdemont/gsoft.htm