PAL CARD CATALOG ENTRY

SHORT DESCRIPTION

Manipulates ordered binary trees


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

ASSET PROFILE

UNIT NAME
New_Abstractions/LTREES (A2LTREES)
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
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 01:40:47Pm
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             944
Statements        195
Comments          400

Unidentified Withed Units --
1 unidentified withed units

FILE LISTING

Directory Display


languages/ada/asr/new-abstractions/ltrees:
  File Name                 Size
  ---------                 ----
  ltrees.zip               6,717


Totals
  ==============  ==============
    1 Files                6,717

ABSTRACT

	This generic package creates an ordered binary tree.  Quick
insertion and search are supported by this data structure.  The tree
is organized such that:

              label(leftchild) < label(root) < label(rightchild)

	Subprograms provided by this package are:

Create                  Create a tree
Destroy_Tree            Destroy a tree and return the space
Destroy_Deep_Tree       Destroy all space associated with a tree
Fetch_Value             Given a tree or label, returns the associated value
Get_Tree                Given a tree and label, returns the tree whose
                         root is at the label
Forward                 Advance the iterator
Insert_Node             Insert a node into a tree
Is_Empty                Return TRUE if the tree is empty
Iterator_Label          Returns the label of the node which corresponds
                         to the given iterator
Iterator_Value          Returns the value of the node which corresponds
                         to the given iterator
Make_Tree               Given a label and a value, return a tree
Make_Tree_Iter_In       Return an iterator in order to start an inorder
                         scan of the tree
Make_Tree_Iter_Pre      Return an iterator in order to start a preorder
                         scan of the tree
Make_Tree_Iter_Post     Return an iterator in order to start a postorder
                         scan of the tree
More, Next              Iterator functions
Store_Value             Replace a given node's value with a given value

        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.