|
sl@0
|
1 |
// (C) Copyright Jeremy Siek 1999.
|
|
sl@0
|
2 |
// Distributed under the Boost Software License, Version 1.0. (See
|
|
sl@0
|
3 |
// accompanying file LICENSE_1_0.txt or copy at
|
|
sl@0
|
4 |
// http://www.boost.org/LICENSE_1_0.txt)
|
|
sl@0
|
5 |
|
|
sl@0
|
6 |
#ifndef BOOST_TREE_STRUCTURE_HPP
|
|
sl@0
|
7 |
#define BOOST_TREE_STRUCTURE_HPP
|
|
sl@0
|
8 |
|
|
sl@0
|
9 |
namespace boost {
|
|
sl@0
|
10 |
|
|
sl@0
|
11 |
template <class T>
|
|
sl@0
|
12 |
struct tree_traits {
|
|
sl@0
|
13 |
typedef typename T::node_descriptor node_descriptor;
|
|
sl@0
|
14 |
typedef typename T::children_iterator children_iterator;
|
|
sl@0
|
15 |
};
|
|
sl@0
|
16 |
|
|
sl@0
|
17 |
|
|
sl@0
|
18 |
template <class Tree, class TreeVisitor>
|
|
sl@0
|
19 |
void traverse_tree(typename tree_traits<Tree>::node_descriptor v,
|
|
sl@0
|
20 |
Tree& t, TreeVisitor visitor)
|
|
sl@0
|
21 |
{
|
|
sl@0
|
22 |
visitor.preorder(v, t);
|
|
sl@0
|
23 |
typename tree_traits<Tree>::children_iterator i, end;
|
|
sl@0
|
24 |
tie(i, end) = children(v, t);
|
|
sl@0
|
25 |
if (i != end) {
|
|
sl@0
|
26 |
traverse_tree(*i++, t, visitor);
|
|
sl@0
|
27 |
visitor.inorder(v, t);
|
|
sl@0
|
28 |
while (i != end)
|
|
sl@0
|
29 |
traverse_tree(*i++, t, visitor);
|
|
sl@0
|
30 |
} else
|
|
sl@0
|
31 |
visitor.inorder(v, t);
|
|
sl@0
|
32 |
visitor.postorder(v, t);
|
|
sl@0
|
33 |
}
|
|
sl@0
|
34 |
|
|
sl@0
|
35 |
struct null_tree_visitor {
|
|
sl@0
|
36 |
template <typename Node, typename Tree> void preorder(Node, Tree&) { }
|
|
sl@0
|
37 |
template <typename Node, typename Tree> void inorder(Node, Tree&) { }
|
|
sl@0
|
38 |
template <typename Node, typename Tree> void postorder(Node, Tree&) { }
|
|
sl@0
|
39 |
};
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
} /* namespace boost */
|
|
sl@0
|
42 |
|
|
sl@0
|
43 |
#endif /* BOOST_TREE_STRUCTURE_HPP */
|