Re: A simple ADA puzzle (I haven't the answer)

["Frank J. Lhota" <NOSPAM.lhota.adarose@verizon.net>]

"Jeffrey Carter" <spam@spam.com> wrote in message
news:_Q%zc.7117$Wr.4869@newsread1.news.pas.earthlink.net...
> Frank J. Lhota wrote:
> >
> > If  there is no reasonable upper limit on the LEN discriminant, if
> > say LEN can vary from 1 to hundreds of thousands, then the best
> > solution would be to use an array of pointers. This would be the only
> > reasonable way to create an array of objects of widely varying sizes.
> > For example:
>
> No, the best solution is to use Ada.Strings.Unbounded.Unbounded_String.

Well, that depends. Determinig the best solution requires a lot of details
not given in this thread. For example, is Abby required to use Ada 83? Is
there a requirement to use STRING_TYPE? If the answer is "Yes" to either of
these questions, then Unbounded_String is not a viable solution.

Even if Abby is working in Ada 95 and is able to replace STRING_TYPE with
something from the predefined library, it is not entirely clear that
Unbounded_String is the best solution. If there is a reasonable upper bound
on the length of the strings (say 60 characters), then Bounded_String would
be be a faster solution.

As always, all of this depends on one question: what is this software
supposed to do?