Difference between revisions of "Tree.hh"

From Free Software Directory
Jump to: navigation, search
(Created page with "{{Entry |Name=Tree.hh |Short description=Templated tree class for C++ |Full description='tree.hh' is a general purpose templated tree class for C++ in the spirit of the STL, and ...")
 
(New version)
 
Line 3: Line 3:
 
|Short description=Templated tree class for C++
 
|Short description=Templated tree class for C++
 
|Full description='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.
 
|Full description='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.
 +
|Homepage URL=http://tree.phi-sci.com/
 
|User level=none
 
|User level=none
|Status=Live
 
|Component programs=
 
|Homepage URL=http://www.damtp.cam.ac.uk/user/kp229/tree/
 
|VCS checkout command=
 
 
|Computer languages=C++
 
|Computer languages=C++
 
|Documentation note=User 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
 
|Documentation note=User 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
|Paid support=
 
|IRC help=
 
|IRC general=
 
|IRC development=
 
|Related projects=
 
 
|Keywords=C++,template,tree,STL,tree.hh,node
 
|Keywords=C++,template,tree,STL,tree.hh,node
|Is GNU=n
+
|Version identifier=3.1
|Last review by=Janet Casey
+
|Version date=2015/05/06
|Last review date=2003-07-10
+
|Version status=stable
 +
|Version download=http://tree.phi-sci.com/tree.hh
 +
|Version comment=3.1 stable released 2015-05-06
 +
|Last review by=Alejandroindependiente
 +
|Last review date=2017/01/09
 
|Submitted by=Database conversion
 
|Submitted by=Database conversion
 
|Submitted date=2011-04-01
 
|Submitted date=2011-04-01
|Version identifier=1.90
+
|Status=
|Version date=2003-07-10
+
|Is GNU=No
|Version status=stable
+
|License verified date=2002-08-29
|Version download=http://www.damtp.cam.ac.uk/user/kp229/tree/#download
+
}}
 +
{{Project license
 +
|License=GPLv2orlater
 +
|License verified by=Janet Casey
 
|License verified date=2002-08-29
 
|License verified date=2002-08-29
|Version comment=1.90 stable released 2003-07-10
 
 
}}
 
}}
 
{{Person
 
{{Person
 +
|Real name=Kasper Peeters
 
|Role=Maintainer
 
|Role=Maintainer
|Real name=Kasper Peeters
 
 
|Email=k.peeters@damtp.cam.ac.uk
 
|Email=k.peeters@damtp.cam.ac.uk
 
|Resource URL=
 
|Resource URL=
Line 41: Line 39:
 
{{Software category
 
{{Software category
 
|Interface=command-line
 
|Interface=command-line
|Library=c++
 
 
|Use=library
 
|Use=library
 
}}
 
}}
{{Project license
+
{{Featured}}
|License=GPLv2orlater
 
|License verified by=Janet Casey
 
|License verified date=2002-08-29
 
}}
 

Latest revision as of 22:33, 8 January 2017

[edit]

Tree.hh

http://tree.phi-sci.com/
Templated tree class for C++

'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.

Documentation

User 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



Download

http://tree.phi-sci.com/tree.hh

version 3.1 (stable)
released on 6 May 2015




Categories





Licensing

License

Verified by

Verified on

Notes

Verified by

Janet Casey

Verified on

29 August 2002




Leaders and contributors

Contact(s)Role
Kasper Peeters Maintainer


Resources and communication

AudienceResource typeURI
Bug Tracking,Developer,SupportE-mailmailto:k.peeters@damtp.cam.ac.uk


Software prerequisites

This entry (in part or in whole) was last reviewed on 9 January 2017.



Entry


























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.