annotate DEPENDENCIES/generic/include/boost/graph/tree_traits.hpp @ 133:4acb5d8d80b6 tip

Don't fail environmental check if README.md exists (but .txt and no-suffix don't)
author Chris Cannam
date Tue, 30 Jul 2019 12:25:44 +0100
parents 2665513ce2d3
children
rev   line source
Chris@16 1 // (C) Copyright Jeremy Siek 1999.
Chris@16 2 // Distributed under the Boost Software License, Version 1.0. (See
Chris@16 3 // accompanying file LICENSE_1_0.txt or copy at
Chris@16 4 // http://www.boost.org/LICENSE_1_0.txt)
Chris@16 5
Chris@16 6 #ifndef BOOST_TREE_STRUCTURE_HPP
Chris@16 7 #define BOOST_TREE_STRUCTURE_HPP
Chris@16 8
Chris@16 9 namespace boost {
Chris@16 10
Chris@16 11 template <class T>
Chris@16 12 struct tree_traits {
Chris@16 13 typedef typename T::node_descriptor node_descriptor;
Chris@16 14 typedef typename T::children_iterator children_iterator;
Chris@16 15 };
Chris@16 16
Chris@16 17
Chris@16 18 template <class Tree, class TreeVisitor>
Chris@16 19 void traverse_tree(typename tree_traits<Tree>::node_descriptor v,
Chris@16 20 Tree& t, TreeVisitor visitor)
Chris@16 21 {
Chris@16 22 visitor.preorder(v, t);
Chris@16 23 typename tree_traits<Tree>::children_iterator i, end;
Chris@16 24 boost::tie(i, end) = children(v, t);
Chris@16 25 if (i != end) {
Chris@16 26 traverse_tree(*i++, t, visitor);
Chris@16 27 visitor.inorder(v, t);
Chris@16 28 while (i != end)
Chris@16 29 traverse_tree(*i++, t, visitor);
Chris@16 30 } else
Chris@16 31 visitor.inorder(v, t);
Chris@16 32 visitor.postorder(v, t);
Chris@16 33 }
Chris@16 34
Chris@16 35 struct null_tree_visitor {
Chris@16 36 template <typename Node, typename Tree> void preorder(Node, Tree&) { }
Chris@16 37 template <typename Node, typename Tree> void inorder(Node, Tree&) { }
Chris@16 38 template <typename Node, typename Tree> void postorder(Node, Tree&) { }
Chris@16 39 };
Chris@16 40
Chris@16 41 } /* namespace boost */
Chris@16 42
Chris@16 43 #endif /* BOOST_TREE_STRUCTURE_HPP */