stlab.adobe.com Adobe Systems Incorporated

forest.hpp File Reference

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

Classes

class  child_adaptor< Forest >
class  child_iterator< I >
 An iterator used to traverse the children of a specific node in a forest. More...
class  depth_fullorder_iterator< I >
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  forest< T >
 A homogeneous hierarchical structure class. More...
class  reverse_fullorder_iterator< I >
struct  set_next_fn< child_iterator< I > >

Namespaces

namespace  adobe
namespace  adobe::unsafe

Enumerations

enum  { forest_trailing_edge, forest_leading_edge }

Functions

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 >
find_edge (I x, std::size_t edge)
template<typename I >
find_edge_reverse (I x, std::size_t edge)
template<typename I >
find_parent (I i)
template<typename I >
bool has_children (const I &i)
template<typename 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 >
pivot_of (I i)
template<typename T >
void swap (forest< T > &, forest< T > &)
template<typename I >
trailing_of (I i)

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google