Message-Id: <199712130139.UAA09857@delorie.com>
Date: Fri, 12 Dec 1997 16:32:19 -0700 (MST)
From: David May <dmay AT tvi DOT cc DOT nm DOT us>
To: djgpp-announce AT delorie DOT com
Subject: ANNOUNCE: List 1.0
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Precedence: bulk
Precedence: bulk


Announcing the list/tree module.  This is a set of routines for creating
linked-lists (sorted and unsorted), stacks, queues, and trees.  The
routines have been extensively tested (which is not to say the code is
**real** pretty, yet :o) and the testing scripts are included with the
distribution.  This is version 1.0 of the module; I feel fairly confident
(I hope?  :o) most of the real bad bugs are worked out.

This version adds the ability to store a list or tree to file.  Also, a
big-time hairy bug was fixed that only showed up once in a while.  The
test scripts genrate pseudo-random data to test with, so they are good for
ferreting out only-on-occasion types of bugs.  Performance wise, the
system was designed for efficiency and works rather well, IMHO.  Any 
suggestions or recommendations along those lines are welcome as well.

You can get it at

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

The source has been tested on DOS (DJGPP), Win95 (DJGPP, Borland C 4.5,
Watcom C 11.0), Linux (GCC) and Solaris 2.5.1 (GCC).  I suspect it will
work on any ANSI compliant platform with some tweaking.  A fairly wide
range of testing has been done, including very large data sets (on the
order of 500,000) and many queries on relatively small data sets
(1,000,000 searches on 20,000 data items).  Under both extremes the system
gives comfortable performance.

You can contact dmay AT tvi DOT cc DOT nm DOT us if you have questions or bug-reports.

Enjoy!

==============================

David May
UNIX System Support Specialist
Albuquerque TVI

==============================