C++ Template Metaprogramming
Solutions to the exercises throughout the book
|
Establish an iterator to contain in-order traversal of the binary tree. More...
#include <exercise-5-10.hpp>
Public Types | |
typedef Cur | current_tree |
typedef Parent | parent_iterator |
typedef inorder_view_iterator< Cur, Parent, VisitCount > | type |
Static Public Attributes | |
static int const | visit_count = VisitCount |
Establish an iterator to contain in-order traversal of the binary tree.
Cur | The current (sub)tree. |
Parent | This is an iterator to the parent of this (sub)tree, or "void_". |
VisitCount | This is a marker to indicate next steps during tree traversal. In an in-order tree traversal, a visit count of 0 indicates "descent left", 1 indicates "return myself," and 2 indicates "descent right." |
Definition at line 99 of file exercise-5-10.hpp.
typedef Cur exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >::current_tree |
Definition at line 101 of file exercise-5-10.hpp.
typedef Parent exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >::parent_iterator |
Definition at line 102 of file exercise-5-10.hpp.
typedef inorder_view_iterator<Cur, Parent, VisitCount> exercise_5_10::inorder_view_iterator< Cur, Parent, VisitCount >::type |
Definition at line 105 of file exercise-5-10.hpp.
|
static |
Definition at line 103 of file exercise-5-10.hpp.