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,47def5aa7b3182bd X-Google-Attributes: gid103376,public From: Matthew Heaney Subject: Re: How to write TYPECASE in Ada 95? Date: 1999/02/06 Message-ID: #1/1 X-Deja-AN: 441447153 Sender: matt@mheaney.ni.net References: <79fct8$9k3$1@murdoch.acc.Virginia.EDU> <0JJEkbcU#GA.219@pet.hiwaay.net> NNTP-Posting-Date: Sat, 06 Feb 1999 12:11:09 PDT Newsgroups: comp.lang.ada Date: 1999-02-06T00:00:00+00:00 List-Id: "David C. Hoos, Sr." writes: > procedure Test_Points is > > -- Since an object of Points.Point'Class must be constrained at the time > of > -- declaration to some one of the types derived from Points.Point, and > -- therefore cannot be re-used for other types derived from Points.Point, > -- we use an access object, instead. But first, we declare the type of > -- that access object, as well as a deallocation procedure for it. > type Point_Class_Access is access all Points.Point'Class; > > procedure Free is new Ada.Unchecked_Deallocation > (Object => Points.Point'Class, > Name => Point_Class_Access); > > -- We do not need to initialize this access object here, but we do so > -- just to illustrate that it can be done. > P_Access : Point_Class_Access := new Points.Tall_Point'(3.0, 4.0, 5.0); Note that there's another way to illustrate these concepts, that does not require heap. Just use a declare block to declare each new kind of point, as follows: with Ada.Text_Io; with Ada.Unchecked_Deallocation; with Points; use Points; procedure Test_Points is begin declare P : Tall_Point := (3.0, 4.0, 5.0); begin Points.Show_Type (P); Points.Show_Properties (Point'Class (P)); end; declare P : Painted_Point := (3.0, 4.0, Points.Blue); begin Points.Show_Type (P); Points.Show_Properties (Point'Class (P)); end; end Test_Points; Declare blocks are your friend. Unnecessary use of heap is your enemy.