'tree.hh' is a general purpose templated tree class for C++ in the spirit of the STL, and compatible with the STL algorithms. Nodes in the tree are templated over the content type, just like they are for vector, list and all other STL containers. There are iterators that traverse the entire tree and iterators that just traverse all children of a given node. You can use the STL algorithms (like find) to manipulate the tree. Tree-aware algorithms for sorting and comparison are also present.
DocumentationUser guide available in PostScript format from http://www.damtp.cam.ac.uk/user/kp229/tree/tree.ps; User guide available in LaTeX format from http://www.damtp.cam.ac.uk/user/kp229/tree/tree.tex
released on 10 July 2003
|License||Verified by||Verified on||Notes|
|GPLv2orlater||Janet Casey||29 August 2002|
Leaders and contributors
Resources and communication
This entry (in part or in whole) was last reviewed on 10 July 2003.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.