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,ea4f04ec8d41f5b7
X-Google-Attributes: gid103376,public
From: tmoran@bix.com
Subject: Re: Ada83 equivalents for Ada95
Date: 1996/05/25
Message-ID: <4o854r$t35@news1.delphi.com>#1/1
X-Deja-AN: 156744355
organization: Delphi Internet Services Corporation
newsgroups: comp.lang.ada
Date: 1996-05-25T00:00:00+00:00
List-Id: <comp.lang.ada>


>On a different but related topic, has anyone looked at designing Ada 83
>code so that the transition to using the *new* features of Ada 95 is as
>easy as possible.
  I'm currently trying to write some code that will use types with Access
discriminants in Ada 95, using Integers in Ada 83 where the integer is an
index into a table of entries of the Access-ed type.  Essentially doing
my own heap management for that type.  It's a bit kludgey in internal
implementation, but for the user of the package and type it seems a) not
too weird, and b) easily convertible.  If anyone has a better way,
though, I'd sure like to hear about it.  :)
  The problem with coding Ada 83 in the presence of Ada 95 is the pain
caused by seeing a simpler, less error-prone way to do something, while
knowing you must do it the clunky way.  :(