Re: Ada 83 versions of Ada 95 packages

[johnherro@aol.com]

"Norman H. Cohen" <ncohen@watson.ibm.com> writes:
>The natural way to implement a Bounded_String type
>in Ada 83 is with a record consisting of a fixed-length
>string (whose length is the maximum length for the type)
>and a current-length component.
Yes, and that's exactly what the Ada 83 LRM suggested with its
Text_Handler package.  The LRM supplies only the specification, but
writing the body is less than an hour's work, and some Ada 83 compilers
(such as Meridian AdaVantage) come with Text_Handler all ready to use.

With my "pseudo unbounded strings" package, you can at least do this:
Months : array(1 .. 12) of Unbounded_String := (+"January", +"February"
... );
N : Integer := 5;
...
Put_Line(+Months(N));
N(5) := +"The merry, merry month of May";
Put_Line(+Months(N));

However, you're right.  To implement Append, etc., you probably first have
to convert to String, storing the result in a string that you know is long
enough.
- John Herro
Software Innovations Technology
http://members.aol.com/AdaTutor
ftp://members.aol.com/AdaTutor