Index of /lisp/lisp/trees_0.5

Icon  Name                    Last modified      Size  Description
[PARENTDIR] Parent Directory - [   ] TODO 2007-11-21 12:59 105 [   ] package.lisp 2007-11-21 12:59 527 [TXT] generics.lisp 2007-11-21 12:59 744 [   ] trees.asd 2007-11-21 12:59 829 [TXT] NEWS 2007-11-21 12:59 1.0K [TXT] LICENSE 2007-11-21 12:59 1.5K [TXT] benchmark.lisp 2007-11-21 12:59 1.5K [   ] types.lisp 2007-11-21 12:59 1.6K [   ] print.lisp 2007-11-21 12:59 1.8K [   ] aa-trees.lisp 2007-11-21 12:59 1.9K [   ] red-black-trees.lisp 2007-11-21 12:59 4.0K [   ] avl-trees.lisp 2007-11-21 12:59 6.2K [   ] utils.lisp 2007-11-21 12:59 6.5K [   ] binary-trees.lisp 2007-11-21 12:59 11K
This package implements binary trees of various kinds, presenting a
uniform interface to them all.  Reading package.lisp should give you an
idea of what sorts of things you can do to trees and reading
binary-trees.lisp and generics.lisp provides a slightly more in-depth
look at the functions you would want to use.

Most functions have been run through rudimentary testing, but bugs still
may lurk in some parts of the code.

tree-test.lisp contains a *very* simple test framework, which you are
mostly intended to verify that things are not broken by visual
inspection. :)  It also contains some straightforward timing code for
the various kinds of trees the package currently supports.  FWIW, AVL
trees seem to be the fastest (by a slim margin) on my 1GHz Linux box
(SBCL 0.8.3.x).

Report any bugs, comments, or improvements to <froydnj@cs.rice.edu>.

Nathan Froyd
10 March 2004