GNU libavl 2.0.3 is now available from ftp.gnu.org. The source distribution may be retrieved as: ftp://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.tar.gz Pre-formatted copies of the libavl book in various formats are also available: ftp://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.html.tar.gz ftp://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.pdf.gz ftp://ftp.gnu.org/pub/gnu/avl/avl-2.0.3.text.gz
libavl is a library in ANSI/ISO C for the manipulation of binary trees and balanced binary trees. libavl is written using a literate programming system called TexiWEB. By way of TexiWEB, libavl is as much a textbook on binary trees and balanced binary trees as it is a collection of code. Changes for version 2.0.3: Previously, all of libavl was under GPL version 2. Now, the libavl book is under the GNU Free Documentation License (version 1.2 or later), the libraries under the GNU Lesser General Public License (version 3 or later), and programs under the GNU General Public License (version 3 or later). Refer to README for details. Fix incompatibility between libavl and recent versions of Texinfo. libavl now recommends Texinfo 4.8. BST_MAX_HEIGHT, AVL_MAX_HEIGHT, RB_MAX_HEIGHT were fixed to use the maximum, not minimum, height of a tree, and to have reasonable values for 64-bit systems. The lower bound on the number of nodes in an AVL tree was fixed also. Fixed the spelling of referenced paper author Quentin Stout's name. Fixed a few minor typographical problems. Updated INSTALL to explain the intended use of libavl. The PDF version of libavl is now generated with pdftex, instead of using dvipdfm. libavl now has a dedicated mailing list for reporting bugs: [EMAIL PROTECTED] -- Ben Pfaff http://benpfaff.org _______________________________________________ GNU Announcement mailing list <info-gnu@gnu.org> http://lists.gnu.org/mailman/listinfo/info-gnu