binary_tree.h File Reference

#include <list>
#include <queue>
#include <set>
#include <boost/array.hpp>
#include <boost/type_traits.hpp>
#include <boost/utility/enable_if.hpp>
#include "globalTraits.h"
#include "binary_tree.tpp"

Include dependency graph for binary_tree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	til::NaryTree< T, N >
	A class to represent an N-ary tree. More...
class	til::NaryTree< T, N >::TreeRootAlreadyDefined
class	til::NaryTree< T, N >::Node
	Internal class used inside binary tree. More...
class	til::NaryTree< T, N >::const_iterator
	Const iterator on n-ary trees. More...
class	til::NaryTree< T, N >::iterator
	Non-const iterator on n-ary trees. More...
struct	til::NaryTree< T, N >::Destructor
class	til::treeFunctors::Count< TTreeIterator >
struct	til::detail::Print
	Breadth-first tree functor to print out tree. More...

Namespaces
	til
	Belongs to package Box Do not include directly, include til/Box.h instead.
	til::treeFunctors
	til::detail
	Multiply an image with another object.

Functions
template<typename T , std::size_t N>
std::size_t	til::size (const NaryTree< T, N > &ntree)
template<typename TTreeIterator , typename TTreeFunctor >
void	til::pre_order_scan (TTreeIterator iTree, TTreeFunctor &f)
	Pre-order scan. More...
template<typename TTreeIterator , typename TTreeFunctor >
void	til::post_order_scan (TTreeIterator iTree, const TTreeFunctor &f)
	Post-order scan. More...
template<typename TTreeIterator , typename TTreeFunctor >
void	til::in_order_scan (TTreeIterator iTree, const TTreeFunctor &f)
	In-order scan. More...
template<typename TTreeIterator , typename TBFFunctor >
void	til::detail::breadth_first (std::queue< TTreeIterator > q, const TBFFunctor &f)
template<typename TTreeIterator , typename TBFFunctor >
void	til::breadth_first (TTreeIterator iTree, const TBFFunctor &f)
	Apply a functor in a breadth-first traversal order, starting from the iterator given in input. More...
template<typename T , std::size_t N>
void	til::print (const NaryTree< T, N > &tree)
	Print tree on stdout (very ugly and experimental). More...