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 14:17:32 PST
Path: 
 nntp.gmd.de!newsserver.jvnc.net!news.cac.psu.edu!news.pop.psu.edu!psuvax1!uwm.edu!news.alpha.net!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 17:17:32 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3f49ps$kgl@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no> <D29L78.J9@nntpa.cb.att.com>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1995-01-12T17:17:32-05:00
List-Id: <comp.lang.ada>

Kenneth says it is a weakness of Ada that you cannot implement bounded
strings of different lengths.

Sorry I don't see this at all, a type like

   type str (max_length : natural) is record
      current_length : natural;
      S : String (1 .. Max_Length);
   end record;

will do just fine, what's the problem?

In fact we were thinking of implementing the Ada 95 bounded string in terms
of this abstraction.