Tree Container Library:
- Home
- Services
- FAQ
- Portfolio
- Latest News
- Datasoft Talk
- Tree Container Library
- Overview
- Usage
- Interface
- Iterators
- Iterator Overview
- Child Iterators
- Reverse Iterators
- Descendant Iterators
- Ordered Iterators
- Design
- Auxiliary Code
- Implementation
- basic_tree
- associative_tree
- tree/multitree
- unique_tree
- sequential_tree
- child iterators
- descendant iterators
- ordered-iterators
- Examples
- STL Compatibility
- Overview
- STL Containers
- STL Algorithms
- Development History
- Version History
- Credits
- Documentation
- Download
- About Us
The Tree Container Library
A C++ generic tree container library which, not only works much like the STL, but is also compatible with the STL algorithms. The Tree Container Library is used worldwide in thousands of industries and organizations. It is completely free to use, and is licensed under the zlib/libpng license.
Reverse child node iterators behave identically to the reverse child element iterators, except that the reverse child node iterators expose the underlying node, while the reverse child element iterators expose the underlying element.
The interface for the reverse child iterators is the same as the
regular child iterators, except for the fact that the ++ and --
operators work in reverse. Also, the node()
operation is not available to the reverse child node iterator.
Since the reverse child node iterator exposes the underlying node, there is no use for this operation.