cl-treemaps is a lightweight and fast implementation of binary trees. The current version only features red black trees. The interface is similar to the one of Common Lisp Hash Maps and is therefore very easy to understand and use. See the README
for further details. The package is only tested with SBCL.
The sourcecode is hosted on github (github.com/sake/cl-treemaps). Tarballs can also be found there, but to be more convenient, the latest version is asdf-installable.
ASDF-install package (obsolete) http://git.electrologic.org/downloads/cl-treemaps_0.1.tar.gz
This package does not implement the Treemapping method for displaying tree-structured data by using nested rectangles.
Topics: data structure