#include <parse_tree_fwd.hpp>
|
template<typename MatchAT , typename MatchBT > |
static void | concat (MatchAT &a, MatchBT const &b) |
|
template<typename MatchT , typename Iterator1T , typename Iterator2T > |
static void | group_match (MatchT &m, parser_id const &id, Iterator1T const &first, Iterator2T const &last) |
|
template<typename FunctorT , typename MatchT > |
static void | apply_op_to_match (FunctorT const &op, MatchT &m) |
|
template<typename Iterator1T , typename Iterator2T > |
static node_t | create_node (std::size_t, Iterator1T const &first, Iterator2T const &last, bool leaf_node) |
|
static node_t | empty_node () |
|
template<typename FunctorT > |
static void | apply_op_to_match (FunctorT const &op, match_t &m) |
|
template<typename MatchPolicyT , typename NodeFactoryT >
template<typename MatchPolicyT , typename NodeFactoryT , typename T >
template<typename MatchPolicyT , typename NodeFactoryT , typename T >
template<typename MatchPolicyT , typename NodeFactoryT >
template<typename MatchPolicyT , typename NodeFactoryT , typename T >
template<typename FunctorT , typename MatchT >
template<typename MatchPolicyT , typename NodeFactoryT >
template<typename FunctorT >
template<typename MatchPolicyT , typename NodeFactoryT , typename T >
template<typename MatchAT , typename MatchBT >
template<typename MatchPolicyT , typename NodeFactoryT >
template<typename Iterator1T , typename Iterator2T >
template<typename MatchPolicyT , typename NodeFactoryT >
template<typename MatchPolicyT , typename NodeFactoryT , typename T >
template<typename MatchT , typename Iterator1T , typename Iterator2T >
The documentation for this struct was generated from the following file: