libavl 2.0 ALPHA 3 now available

[Ben Pfaff]

The following message is a courtesy copy of an article
that has been posted to comp.lang.c,comp.programming as well.

libavl 2.0 ALPHA 3 is now available on cscw.msu.edu.  It will
also be available on alpha.gnu.org if I ever figure out what is
wrong with my Kerberos 5 setup.

libavl is a library for manipulation of binary search trees and
balanced binary trees, written in ANSI C.  libavl 2.0 is written
using a custom-designed literate programming system.  In addition
to being a complete, useful library, it is also a book that
explains the algorithms and rationale behind the code.

Alpha 3 of libavl now includes a chapter on red-black trees, in
addition to the previously existing chapters on binary search
trees and AVL trees.

In response to requests from readers of previous alpha releases,
this version uses far fewer mathematical symbols in place of
standard C symbols.  Feedback is requested from readers and
programmers on this change.  Comments are also welcome on any
other aspect of libavl.

The libavl homepage is at
	http://www.msu.edu/~pfaffben

The complete libavl 2.0alpha3 distribution can be found at:
	ftp://cscw.msu.edu/blp/avl-2000.08.31.tar.gz (361 kB)

Prebuilt versions of the libavl book are available in several
formats, including plain text, PDF, and PostScript:
	ftp://cscw.msu.edu/blp/avl-2000.08.31.pdf (699 kB)
	ftp://cscw.msu.edu/blp/avl-2000.08.31.pdf.gz (515 kB)
	ftp://cscw.msu.edu/blp/avl-2000.08.31.text (291 kB)
	ftp://cscw.msu.edu/blp/avl-2000.08.31.text.gz (77 kB)
	ftp://cscw.msu.edu/blp/avl-2000.08.31.ps (855 kB)
	ftp://cscw.msu.edu/blp/avl-2000.08.31.ps.gz (254 kB)

Thanks,

Ben.
-- 
"To prepare for the writing of Software, 
 the writer must first become one with it, 
 sometimes two."
--W. C. Carlson