FM / tree

/usr/include/boost/spirit/home/classic/tree/

/usr/include/boost/spirit/home/classic/tree

Name	Size	Mode	Actions
impl/	-	0755	rm
ast.hpp	11988	0644	edit dl rm
ast_fwd.hpp	1127	0644	edit dl rm
common.hpp	45302	0644	edit dl rm
common_fwd.hpp	2482	0644	edit dl rm
parse_tree.hpp	8791	0644	edit dl rm
parse_tree_fwd.hpp	1061	0644	edit dl rm
parse_tree_utils.hpp	2579	0644	edit dl rm
tree_to_xml.hpp	4579	0644	edit dl rm
typeof.hpp	4097	0644	edit dl rm

Edit: /usr/include/boost/spirit/home/classic/tree/parse_tree_utils.hpp (2579B)

/*=============================================================================
    Copyright (c) 2001-2003 Daniel Nuffer
    Copyright (c) 2001-2007 Hartmut Kaiser
    http://spirit.sourceforge.net/

Distributed under the Boost Software License, Version 1.0. (See accompanying
  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/

#ifndef BOOST_SPIRIT_CLASSIC_TREE_PARSE_TREE_UTILS_HPP
#define BOOST_SPIRIT_CLASSIC_TREE_PARSE_TREE_UTILS_HPP

#include <utility>                          // for std::pair

#include <boost/spirit/home/classic/tree/parse_tree.hpp> // needed for parse tree generation

///////////////////////////////////////////////////////////////////////////////
namespace boost {
namespace spirit {
BOOST_SPIRIT_CLASSIC_NAMESPACE_BEGIN

///////////////////////////////////////////////////////////////////////////////
//
//  The function 'get_first_leaf' returnes a reference to the first leaf node
//  of the given parsetree.
//
///////////////////////////////////////////////////////////////////////////////
template <typename T>
tree_node<T> const &
get_first_leaf (tree_node<T> const &node);

///////////////////////////////////////////////////////////////////////////////
//
//  The function 'find_node' finds a specified node through recursive search.
//  If the return value is true, the variable to which points the parameter
//  'found_node' will contain the address of the node with the given rule_id.
//
///////////////////////////////////////////////////////////////////////////////
template <typename T>
bool
find_node (tree_node<T> const &node, parser_id node_to_search,
    tree_node<T> const **found_node);

///////////////////////////////////////////////////////////////////////////////
//
//  The function 'get_node_range' return a pair of iterators pointing at the
//  range, which contains the elements of a specified node. It's very useful
//  for locating all information related with a specified node.
//
///////////////////////////////////////////////////////////////////////////////
template <typename T>
bool
get_node_range (tree_node<T> const &node, parser_id node_to_search,
    std::pair<typename tree_node<T>::const_tree_iterator,
        typename tree_node<T>::const_tree_iterator> &nodes);

///////////////////////////////////////////////////////////////////////////////
BOOST_SPIRIT_CLASSIC_NAMESPACE_END
}   // namespace spirit
}   // namespace boost

#include <boost/spirit/home/classic/tree/impl/parse_tree_utils.ipp>

#endif

/*============================================================================= Copyright (c) 2001-2003 Daniel Nuffer Copyright (c) 2001-2007 Hartmut Kaiser http://spirit.sourceforge.net/ Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) =============================================================================*/ #ifndef BOOST_SPIRIT_CLASSIC_TREE_PARSE_TREE_UTILS_HPP #define BOOST_SPIRIT_CLASSIC_TREE_PARSE_TREE_UTILS_HPP #include // for std::pair #include // needed for parse tree generation /////////////////////////////////////////////////////////////////////////////// namespace boost { namespace spirit { BOOST_SPIRIT_CLASSIC_NAMESPACE_BEGIN /////////////////////////////////////////////////////////////////////////////// // // The function 'get_first_leaf' returnes a reference to the first leaf node // of the given parsetree. // /////////////////////////////////////////////////////////////////////////////// template tree_node const & get_first_leaf (tree_node const &node); /////////////////////////////////////////////////////////////////////////////// // // The function 'find_node' finds a specified node through recursive search. // If the return value is true, the variable to which points the parameter // 'found_node' will contain the address of the node with the given rule_id. // /////////////////////////////////////////////////////////////////////////////// template bool find_node (tree_node const &node, parser_id node_to_search, tree_node const **found_node); /////////////////////////////////////////////////////////////////////////////// // // The function 'get_node_range' return a pair of iterators pointing at the // range, which contains the elements of a specified node. It's very useful // for locating all information related with a specified node. // /////////////////////////////////////////////////////////////////////////////// template bool get_node_range (tree_node const &node, parser_id node_to_search, std::pair::const_tree_iterator, typename tree_node::const_tree_iterator> &nodes); /////////////////////////////////////////////////////////////////////////////// BOOST_SPIRIT_CLASSIC_NAMESPACE_END } // namespace spirit } // namespace boost #include #endif