1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
// Copyright (c) 2014-2017 Dr. Colin Hirsch and Daniel Frey
// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
#ifndef TAOCPP_PEGTL_INCLUDE_INTERNAL_SOR_HPP
#define TAOCPP_PEGTL_INCLUDE_INTERNAL_SOR_HPP
#include "../config.hpp"
#include "skip_control.hpp"
#include "../apply_mode.hpp"
#include "../rewind_mode.hpp"
#include "../analysis/generic.hpp"
#include "integer_sequence.hpp"
namespace tao
{
namespace TAOCPP_PEGTL_NAMESPACE
{
namespace internal
{
template< typename... Rules >
struct sor;
template<>
struct sor<>
: trivial< false >
{
};
template< typename... Rules >
struct sor
: sor< index_sequence_for< Rules... >, Rules... >
{
};
template< std::size_t... Indices, typename... Rules >
struct sor< index_sequence< Indices... >, Rules... >
{
using analyze_t = analysis::generic< analysis::rule_type::SOR, Rules... >;
template< apply_mode A,
rewind_mode M,
template< typename... > class Action,
template< typename... > class Control,
typename Input,
typename... States >
static bool match( Input& in, States&&... st )
{
#ifdef __cpp_fold_expressions
return ( Control< Rules >::template match < A, ( Indices == ( sizeof...( Rules ) - 1 ) ) ? M : rewind_mode::REQUIRED, Action, Control > ( in, st... ) || ... );
#else
bool result = false;
using swallow = bool[];
(void)swallow{ result = result || Control< Rules >::template match < A, ( Indices == ( sizeof...( Rules ) - 1 ) ) ? M : rewind_mode::REQUIRED, Action, Control > ( in, st... )... };
return result;
#endif
}
};
template< typename... Rules >
struct skip_control< sor< Rules... > > : std::true_type
{
};
} // namespace internal
} // namespace TAOCPP_PEGTL_NAMESPACE
} // namespace tao
#endif
|
