|
Adobe Source Libraries 2.0.0
A collection of C++ libraries.
|
Go to the source code of this file.
Classes | |
| class | child_iterator< I > |
| An iterator used to traverse the children of a specific node in a forest. More... | |
| class | edge_iterator< I, Edge > |
| An iterator used to traverse a specific edge type within a forest. More... | |
| class | filter_fullorder_iterator< I, P > |
| class | reverse_fullorder_iterator< I > |
| class | depth_fullorder_iterator< I > |
| class | forest< T > |
| A homogeneous hierarchical structure class. More... | |
| struct | set_next_fn< child_iterator< I > > |
| class | child_adaptor< Forest > |
Namespaces | |
| namespace | adobe |
| namespace | adobe::unsafe |
Enumerations | |
| enum | { forest_trailing_edge , forest_leading_edge } |
Functions | |
| template<typename I> | |
| void | pivot (I &i) |
| template<typename I> | |
| I | pivot_of (I i) |
| template<typename I> | |
| I | leading_of (I i) |
| template<typename I> | |
| I | trailing_of (I i) |
| template<typename I> | |
| I | find_parent (I i) |
| template<typename I> | |
| bool | has_children (const I &i) |
| template<typename I> | |
| I | find_edge (I x, std::size_t edge) |
| template<typename I> | |
| I | find_edge_reverse (I x, std::size_t edge) |
| template<typename T> | |
| bool | operator== (const forest< T > &x, const forest< T > &y) |
| template<typename T> | |
| bool | operator!= (const forest< T > &x, const forest< T > &y) |
| template<typename I> | |
| child_iterator< I > | child_begin (const I &x) |
| template<typename I> | |
| child_iterator< I > | child_end (const I &x) |
| template<typename I> | |
| auto | child_range (const I &x) -> boost::iterator_range< child_iterator< I > > |