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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,197f249b225fabe2 X-Google-Attributes: gid103376,public From: dewar@merv.cs.nyu.edu (Robert Dewar) Subject: Re: Ada 83 versions of Ada 95 packages Date: 1996/12/24 Message-ID: #1/1 X-Deja-AN: 205860021 references: <19961224202100.PAA15408@ladder01.news.aol.com> organization: New York University newsgroups: comp.lang.ada Date: 1996-12-24T00:00:00+00:00 List-Id: iJohn Herro said "I agree that the name of my package may be confusing, because what I really wrote was a *substitute* for unbounded strings for use with an Ada 83 compiler. I still hope that the package will prove useful to others. - John Herro" Sure, and it is a reasonable data structure, but it is not what unbounded strings are about. If you want an Ada 83 substitute for unbounded strings, you can certainly have one that is identical to the Ada 95 semantics with the exception of the automatic storage finalization.