PAL CARD CATALOG ENTRY

SHORT DESCRIPTION

Manipulate labeled binary trees


MOVEMENT WITHIN THE PAL CARD CATALOG
Move to top-level taxonomy
Move to keyword list

ASSET PROFILE

UNIT NAME
New_Abstractions/LBINTREE (A2LBINTRE)
VERSION
1.0
REVIEW CODE
C1 1.0 B
INET ADDRESS
Not documented in PAL database
AUTHOR
Bill Toscano, Michael Gordon
Intermetrics, Inc,
733 Concord Ave
Cambridge, MA 02138
Contact: Lt. Colonel Falgiano
ESD/SCW
Hanscom AFB, MA 01731
RIGHTS
PUBLIC DOMAIN
COPYRIGHT
(c) 1985 Intermetrics, Inc.
DATE CREATED
1986
DATE RELEASED
1 April 1986
DATE LAST UPDATED
1 April 1986
LOCATION
PAL
ASR
C2MUG
PC-BLUE
ENVIRONMENT
VAX/VMS, DEC Ada
LIMITATIONS
Not documented in PAL database
CERTIFICATION
Ada System Certifier_1 1.0
Date/Time of Processing: Tuesday   24 May       1994 12:44:41Pm
Overall Assessment of System: OK
Classification of System: B
Basis of Classification --
Syntax Errors                               PASS
Completeness                                PASS
Independence from External Libraries        FAIL
Independence from a Specific Ada Compiler   PASS

Explanations for failures --
System withs non-standard library units that are not provided

Number of ...
Files               2
Library Units       2
Lines             564
Statements        111
Comments          246

Unidentified Withed Units --
1 unidentified withed units

FILE LISTING

Directory Display


languages/ada/asr/new-abstractions/lbintree:
  File Name                 Size
  ---------                 ----
  lbintree.zip             4,897


Totals
  ==============  ==============
    1 Files                4,897

ABSTRACT

	This generic package provides an efficient implementation of
labeled binary trees.  Labeled binary trees are the same as unlabeled
binary trees except that when searching for or inserting a value into
a tree, only the label field is compared.
	The following operations are provided:

Constructors:
 Insert         Insert a node into a tree
 Destroy        Destroy a tree
 Destroy_Deep   Destroy a tree and its contents
 Balanced_Tree  Create a balanced tree
 Copy           Copy a tree

Queries:
 Is_Empty       Return TRUE if a tree is empty
 Find           Search tree for a node
 Is_Found       Return TRUE if tree contains a specified value
 Size           Return number of nodes in a tree

Iterators:
 Visit          Apply a procedure to every node
 Make_Iter      Create an iterator
 More, Next     Iterator functions

        NEW_ABSTRACTIONS  is  used  by NOSC/WIS tools 4.1.1 and 4.1.2.


REVISION HISTORY

DATE         VERSION AUTHOR                  HISTORY 
03/85        1.0  Bill Toscano               Initial Release 


RELEASE NOTICE

This prologue must be included in all copies of this software.
This software is copyright by the author.
This software is released to the Ada community.
This software is released to the Public Domain (note:
  software released to the Public Domain is not subject
  to copyright protection).
Restrictions on use or distribution:  NONE


DISCLAIMER

	This software and its documentation are provided "AS IS" and
without any expressed or implied warranties whatsoever.  No warranties
as to performance, merchantability, or fitness for a particular
purpose exist.
	The user is advised to test the software thoroughly before
relying on it.  The user must assume the entire risk and liability of
using this software.  In no event shall any person or organization of
people be held responsible for any direct, indirect, consequential or
inconsequential damages or lost profits.