tree.hh File Reference

#include <cassert>
#include <memory>
#include <stdexcept>
#include <iterator>
#include <set>
#include <queue>
#include <algorithm>

Classes

class  tree_node_< T >
 A node in the tree, combining links to other nodes as well as the actual data. More...
class  tree< T, tree_node_allocator >
class  tree< T, tree_node_allocator >::tree::iterator_base
 Base class for iterators, only pointers stored, no traversal logic. More...
class  tree< T, tree_node_allocator >::tree::pre_order_iterator
 Depth-first iterator, first accessing the node, then its children. More...
class  tree< T, tree_node_allocator >::tree::post_order_iterator
 Depth-first iterator, first accessing the children, then the node itself. More...
class  tree< T, tree_node_allocator >::tree::breadth_first_queued_iterator
 Breadth-first iterator, using a queue. More...
class  tree< T, tree_node_allocator >::tree::fixed_depth_iterator
 Iterator which traverses only the nodes at a given depth from the root. More...
class  tree< T, tree_node_allocator >::tree::sibling_iterator
 Iterator which traverses only the nodes which are siblings of each other. More...
class  tree< T, tree_node_allocator >::tree::leaf_iterator
 Iterator which traverses only the leaves. More...
class  tree< T, tree_node_allocator >::tree::iterator_base_less
 Comparator class for iterators (compares pointer values; why doesn't this work automatically?). More...
class  tree< T, tree_node_allocator >::tree::compare_nodes< StrictWeakOrdering >
 Comparator class for two nodes of a tree (used for sorting and searching). More...

Namespaces

namespace  kp

Functions

template<class T1 , class T2 >
void kp::constructor (T1 *p, T2 &val)
template<class T1 >
void kp::constructor (T1 *p)
template<class T1 >
void kp::destructor (T1 *p)

Generated on Sun Sep 27 11:32:19 2009 for tree by  doxygen 1.5.8