Ada95 Data Structures

[beidler@guinness.cs.uofs.edu (Jack Beidler)]

For those who may be interested, a collection of data structures
written in Ada95 is available via anonymous ftp from

    ftp.cs.uofs.edu

They are in the file Ada95ds.zip in the pub/Ada subdirectory.

The zip file expands into a single file following the pager2
format.  It contains various examples of stacks, queues, lists,
binary trees, and n-ary trees.  It includes some examples of
data structures that may contain tagged types, and examples of
structures made visible as controlled types.  They all compile
and run under gnat v.2.03.

The expanded file can be "gnatchop"ped once the two descriptive
files are removed from the beginning of the paged file and the
sets of data are removed from the end of the file.

Features of interest:
1.  A family of list packages all derived from a single package
    with each packages providing different client-package visibility.

2.  The list and tree packages make use of three Ada95 features
    (aliased, access all, and 'Class) to produce a recursive
    representation of the structures.

3.  The queue and stack packages have child units containing
    features that override the fundamental structures.

There are several test programs and data sets included.

This suite of software is currently being used in two courses and
have not been thoroughly tested.  A more complete set will be
released in about six weeks, once the semester is over.

PS:  Also at ftp.cs.uofs.edu is a collection of Visual Basic
examples in pub/VB
-- 
+----------------------------------------+------------------------+
|John (Jack) Beidler                    ++   beidler@cs.uofs.edu  |
|  Professor, Computing Sciences Dept. ++                         |
|  University of Scranton             ++  (717) 941-7446 (voice)  |
| Scranton, PA 18510                 ++     (717) 941-4250 (FAX)  |
|      WWW site:  http://www.cs.uofs.edu/CS/cs.home.html          |
+------------------------------------+----------------------------+