#include <adobe/config.hpp>
#include <adobe/algorithm/reverse.hpp>
#include <adobe/iterator/set_next.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/next_prior.hpp>
#include <boost/range.hpp>
#include <cstddef>
#include <iterator>
#include <functional>
Go to the source code of this file.
|
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 > |
I | find_edge (I x, std::size_t edge) |
|
template<typename I > |
I | find_edge_reverse (I x, std::size_t edge) |
|
template<typename I > |
I | find_parent (I i) |
|
template<typename I > |
bool | has_children (const I &i) |
|
template<typename I > |
I | leading_of (I i) |
|
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 > |
void | pivot (I &i) |
|
template<typename I > |
I | pivot_of (I i) |
|
template<typename T > |
void | swap (forest< T > &, forest< T > &) |
|
template<typename I > |
I | trailing_of (I i) |
|