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,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-12 06:24:42 PST
Path: 
 nntp.gmd.de!Germany.EU.net!howland.reston.ans.net!math.ohio-state.edu!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 09:24:42 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3f3e3a$5e6@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1995-01-12T09:24:42-05:00
List-Id: <comp.lang.ada>

Tarjei, you can certainly write a generic package on top of bounded
strings. Simply include a parameter that is a formal derived pacakge,
then the user of your generic will supply the instantiation.

In GNAT, we are thinking of redoing the bounded strings so that they lie
on top of a non-generic package where there is a discriminant giving the
maximum length.

Not only will this avoid unnecessary duplication of code, but we could
also think of giving direct access to the underlying package. Of course
programs that took advantage of this would be potentially non-portable
(although not really, they could just include the GNAT version of these
packages, even if they were using some other compiler).