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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4c86cf2332cbe682
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-12 10:10:40 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!news.cac.psu.edu!news.pop.psu.edu!hudson.lm.com!godot.cc.duq.edu!newsfeed.pitt.edu!gatech!udel!news.mathworks.com!panix!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Ada.strings.bounded problems?
Date: 12 Jan 1995 13:10:40 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3f3rb0$j3@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no>
 <EACHUS.95Jan11170317@spectre.mitre.org>
Date: 1995-01-12T13:10:40-05:00
List-Id: <comp.lang.ada>

Robert Eachus says just use the Bounded Strings package and it should do
just what you want.

Suppose what you want is the following (easily provided by PL/1 for example).

I want several different strings, all bounded, with different maximum lengths,
and I want to be easily able to do operations between them.

True I can do:

      if To_String (A) = To_String (B) then

but first of all, it is annoying to have to write the To_String calls, and
second, I will be willing to bet that all compilers will generate extra
copies to implement this (at least one for each call, and possibly more
than one).

I think that's the sort of thing that was being requested ...