U Of Scranton Ada'95 Components
languages/ada/swcomps/uofs_ds: File Name Size --------- ---- README 6,318 uofs_ds.zip 73,572 Totals ============== ============== 2 Files 79,890
This collection contains data structure that make extensive use of Ada'95 features. The current version contains examples of stacks, lists (recursive and positional paradigms) binary trees (recursive and positional paradigms), and N-ary trees (recursive only). Future versions will include sets, digraphs, priority queues, and others. Software developers may find the suite of lists and recursive binary trees of some interest, for two reasons. First, these packages make use of the Ada'95 "aliased", "'Access", and "access all" features to implement recursive data structures. Second, the suites of recursive list and recursive binary tree packages are each derived from a single package. That is, only one package actually implements the data structure, derived packages provide various levels of user-developer visibility. Eventually every component suite will be implemented in an analogous manner. This work is supported through DISA grant DCA100-94-1-005.
17 April 1995, Ver. 1.00, Basic Packages 21 April 1995, Ver. 1.01, Reorganized files 25 April 1995, Ver. 1.02, Corrections to make all software GNAT 2.04 compatible 27 June 1995, Ver. 2.03, Update to GNAT 2.06
This prologue must be included in all copies of this software. Restriction on use or distribution: See GNU Copyleft
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 exists. 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 damage or lost profit.