Message-Id: <199707260100.VAA21452@delorie.com>
Date: Fri, 25 Jul 1997 17:51:53 -0600 (MDT)
From: David May <root AT tvi DOT cc DOT nm DOT us>
To: djgpp-announce AT delorie DOT com
Subject: ANNOUNCE: list and tree module.
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Precedence: bulk
Precedence: bulk

This is to announce a C based linked list library available for DJGPP
and GCC under other platforms at the following URL:

http://w3.tvi.cc.nm.us/~dmay/

The module includes a base library of list handling functions and a set of
functions for creating trees.  As there has been some traffic off and on
about being able to quickly and dynamically sort items, I felt there may
be some interest here.  The list module provides stable list-handling
functionality with support for sorted lists, queues, stacks and unsorted
lists.  The tree functions allow the user to build a dynamic tree that
will insert items in sorted order and allow for fairly quick searches.
The user can insert on the order of 20,000 items per second and search on
the order of 40,000 items per second.  More testing is needed and the
software should be considered in BETA, but it is stable freely available
to anyone who would like to use it.

The plan is to use the algorithm developed here for the dynamic tree
structure to create a disk-based tree structure to be used for sorting
data tables.  I have already created the table code (which can create and
query tables without index support) and intend to create the indexing
support to provide users with a database engine comparable to codeBase,
except free :-).  There are plans as well to provide a SQL-like language
with the system and possibly some relational support.  If this sounds
interesting, look for an announcement of an initial release sometime soon
(as time permits - hopefully **real** soon).

Users with questions, comments or bug reports can contact me at
dmay AT tvi DOT cc DOT nm DOT us.

Enjoy!


David May
UNIX System Support Specialist