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,89a10de5b2ea87d7
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: generic binary tree in ada 83
Date: 1998/04/28
Message-ID: <dewar.893821882@merv>#1/1
X-Deja-AN: 348636083
References: <35461333.6DFB@westcott.force9.co.uk> <6i55q1$nfe@top.mitre.org>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 893822205 30480 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1998-04-28T00:00:00+00:00
List-Id: <comp.lang.ada>


Michael said

<<Just add the following lines on top of your package that implements
the Tree data structure on type character:

    generic
        type character is private;

and it will work on generic data. To instantiate it, use the following
code:
      package tree_of_limbs is new character_tree (character => limbs);

Then it will work on TYPE LIMBS exactly as it worked on type character.
>>


This is almost certainly incorrect advice. It is perhaps deliberately
wrong (people often give answers that are deliberately incomplete when
it sounds likely that the question is of the kind "please help me with
my assignment, I don't feel like doing it myself" (be warned!)

But almost certainly the binary tree implementation will require a
total ordering, which of course the above generic formal does not provide.