ASE2 CARD CATALOG ENTRY

Instructions:

• Scroll forward and backward through this Card Catalog Entry to view it.
• Strike the PRINT button on your browser to print this Card Catalog Entry.
• Go to the FILE SPECS section of this Card Catalog Entry to find out where the associated directories and files are. If they are on this Website, you can transfer to them by clicking on the indicated hyperlinks. Note: the FILE SPECS hyperlink in this bullet will take you directly to the FILE SPECS section.
• Use the FIND command of your browser to search this Card Catalog Entry.
• Click here to go to the Card Catalog Taxonomy.
• Click here to go to the Card Catalog Index. Warning: the index file is large, so this may take a while on slower systems.
• Click here to go to the Title Page.

---

ASSET OVERVIEW

UNIT NAME

Ada Structured Library

VERSION

1.0

REVIEW CODE

NR

INET ADDRESS

minyard@acm.org

AUTHOR

Corey Minyard
1805 Marquette
Richardson, TX 75081
(972) 680-1407

RIGHTS

Approved for Public Release; Distribution Unlimited
Released under the GNU Public Library License, see the included COPYING file
for details on the license.

COPYRIGHT

Copyright 1998 Corey Minyard

DATE CREATED

September 4, 1998

DATE RELEASED

September 4, 1998

DATE LAST UPDATED

September 4, 1998

LOCATION

PAL
http://www.concentric.net/~Minyard

ENVIRONMENT

Known to compile with gnat-3.11a and gnat-3.11b, and Rational Apex. The
code uses quite a few Ada95 features that push the limits of many compilers;
for instance gnat-3.10p will not compile it.

LIMITATIONS

A very good Ada95 compiler

CERTIFICATION

Not Certified

---

CLASSIFICATION

KEYWORD

Containers
Components
Generics
Semaphores
Leak Detector

INDEX

ASL
Ada Structured Library
Minyard, Corey

TAXONOMY

Software Components

Ada Structured Library

Software Components

Tree

Binary

Software Components

Tree

B

Software Components

Hash Table

Software Components

List

Doubly-Linked (3)

Software Components

List

Singly-Linked (2)

Software Components

Graph

Standard

Software Components

Graph

Directed

Software Components

Heap

DEPENDENCIES

None

SEE ALSO

SHORT DESCRIPTION

Generic components and libraries

---

FILE LISTING

FILE SPECS

Click here to enter Asset Directory/transfer Asset File(s): ../../ase02_02/comps/asl

DIRECTORY DISPLAY

Follow path to see directory

---

ABSTRACT

What Is the ASL?

Containers

The container classes consist of the main container types:

• Vector - A variable-sized array
• AList - A list based upon an array. This is good for stacks and queues that don't require insertions in the middle.
• DList - A doubly linked list, also good for stacks and queues. This one is good at insertions in the middle.
• Tree - An ordered binary tree, balance or unbalanced.
• List - A singly linked list, good for traversing in order, but you can't go backwards.
• Hash - A hash table. Good for fast lookups, sets, and bags.
• Heap - An ordered heap. Good for finding the largest or smallest value in a set.
• Graph - A standard graph. The links are all bidirectional
• DiGraph - A directed graph. The links are uni-directional.
• BTree - Good for fast lookups. Not quite as fast as heaps, but more deterministic.

Containers come in three flavors:

• Fixed - Implemented using a fixed size array. These containers are guaranteed to not allocate any dynamic store for their operations.
• Expandable - Implemented using a pointer to an array that will be reallocated as necessary.
• Dynamic - Each node in the container is dynamically allocated.

All containers come in all flavors, except a few do not have dynamic flavors because it doesn't make sense and the BTrees are only dynamic. Actually, some other combinations don't seem to make much sense, but someone might use them so they are provided.

All containers come in versions that use the default storage management or allow the user to specify the storage management.

The containers are quite functional, each has a rich set of functions. Tests and example programs are provided as well as some reasonable documentation.

Semaphores

The ASL contains several semaphore objects implemented using protected types:

• Binary - A standard binary semaphore
• Counting - A standard counting semaphore
• Nested - A binary semaphore, but the same task can claim it multiple times. It must be released the same number of times (by that task) to release the semaphore.
• Nested_Prio - A nested semaphore, but it does priority inheritance. This doesn't really work yet because setting dynamic priorities in Ada doesn't work immediately. If anyone has an idea how to make it work, I'd like to know.

Leak Detection Storage Manager

A storage manager that tracks all the allocated data and lets the user iterate over it. Useful for finding memory leaks. It has found a few for me :-).

---

REVISION HISTORY

Sept 4, 1998, Version 1.0, Corey Minyard, First non-beta release.

---

RELEASE NOTICE

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.

See the included COPYING file for more details.

---

ASE CARD CATALOG ENTRY NAVIGATION

• Go to Title Page
• Go to Taxonomy
• Go to Index (warning: the index file is large, so this may take a while on slower systems)
• Go to Top of this Page

Powered by the Generic Web-Based Reuse Library (GWRL)