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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
// Boost.TypeErasure library
//
// Copyright 2011 Steven Watanabe
//
// 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)
//
// $Id$
#if !defined(BOOST_PP_IS_ITERATING)
#ifndef BOOST_TYPE_ERASURE_CHECK_MATCH_HPP_INCLUDED
#define BOOST_TYPE_ERASURE_CHECK_MATCH_HPP_INCLUDED
#include <boost/mpl/vector.hpp>
#include <boost/mpl/bool.hpp>
#include <boost/mpl/is_sequence.hpp>
#include <boost/mpl/find_if.hpp>
#include <boost/mpl/not.hpp>
#include <boost/mpl/end.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/preprocessor/cat.hpp>
#include <boost/preprocessor/iteration/iterate.hpp>
#include <boost/preprocessor/repetition/repeat.hpp>
#include <boost/preprocessor/repetition/enum_params.hpp>
#include <boost/preprocessor/repetition/enum_trailing_params.hpp>
#include <boost/preprocessor/repetition/enum_trailing_binary_params.hpp>
#include <boost/type_erasure/detail/extract_concept.hpp>
#include <boost/type_erasure/relaxed.hpp>
#include <boost/type_erasure/detail/access.hpp>
namespace boost {
namespace type_erasure {
template<class T>
struct typeid_;
template<class Concept>
class binding;
namespace detail {
template<class P, class T, class Table>
bool maybe_check_table(const T& arg, const Table*& table, boost::mpl::true_)
{
if(table == 0) {
table = &::boost::type_erasure::detail::access::table(arg);
return true;
} else {
return table->template find< ::boost::type_erasure::typeid_<P> >()() ==
::boost::type_erasure::detail::access::table(arg).
template find< ::boost::type_erasure::typeid_<P> >()();
}
}
template<class P, class T, class Table>
bool maybe_check_table(const T&, const Table*&, boost::mpl::false_)
{
return true;
}
template<class Concept, class T>
struct should_check :
boost::mpl::and_<
::boost::type_erasure::is_placeholder<T>,
::boost::type_erasure::is_relaxed<Concept>
>
{};
}
#ifdef BOOST_TYPE_ERASURE_DOXYGEN
/**
* If @ref relaxed is in @c Concept, checks whether the
* arguments to @c f match the types specified by
* @c binding. If @ref relaxed is not in @c Concept,
* returns true. If @c binding is not specified, it will
* be deduced from the arguments.
*/
template<class Concept, class Op, class... U>
bool check_match(const binding<Concept>& binding_arg, const Op& f, U&&... args);
/**
* \overload
*/
template<class Op, class... U>
bool check_match(const Op& f, U&&... args);
#else
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
namespace detail {
template<class Concept>
bool check_table(const ::boost::type_erasure::binding<Concept>* t, void(*)())
{
return true;
}
template<class Concept, class R, class T0, class... T, class U0, class... U>
bool check_table(
const ::boost::type_erasure::binding<Concept>* t,
R(*)(T0, T...),
const U0& arg0,
const U&... arg)
{
typedef typename ::boost::remove_cv<
typename ::boost::remove_reference<T0>::type
>::type t0;
if(!::boost::type_erasure::detail::maybe_check_table<t0>(
arg0,
t,
::boost::type_erasure::detail::should_check<Concept, t0>()))
return false;
return check_table(t, static_cast<void(*)(T...)>(0), arg...);
}
}
template<class Concept, class Op, class... U>
bool check_match(
const ::boost::type_erasure::binding<Concept>& table,
const Op&,
U&&... arg)
{
return ::boost::type_erasure::detail::check_table(
&table,
static_cast<typename ::boost::type_erasure::detail::get_signature<Op>::type*>(0),
arg...);
}
template<
class Op,
class... U
>
bool check_match(
const Op&,
U&&... arg)
{
const ::boost::type_erasure::binding<
typename ::boost::type_erasure::detail::extract_concept<
typename ::boost::type_erasure::detail::get_signature<Op>::type, U...>::type>* p = 0;
return ::boost::type_erasure::detail::check_table(
p, static_cast<typename ::boost::type_erasure::detail::get_signature<Op>::type*>(0), arg...);
}
#else
#define BOOST_PP_FILENAME_1 <boost/type_erasure/check_match.hpp>
#define BOOST_PP_ITERATION_LIMITS (0, BOOST_TYPE_ERASURE_MAX_ARITY)
#include BOOST_PP_ITERATE()
#endif
#endif
}
}
#endif
#else
namespace detail {
#define N BOOST_PP_ITERATION()
#define BOOST_TYPE_ERASURE_CHECK_TABLE(z, n, data) \
typedef typename ::boost::remove_cv< \
typename ::boost::remove_reference<BOOST_PP_CAT(T, n)>::type \
>::type BOOST_PP_CAT(t, n); \
if(!::boost::type_erasure::detail::maybe_check_table<BOOST_PP_CAT(t, n)>( \
BOOST_PP_CAT(arg, n), \
t, \
::boost::type_erasure::detail::should_check<Concept, BOOST_PP_CAT(t, n)>())) \
return false;
template<
class Concept,
class R
BOOST_PP_ENUM_TRAILING_PARAMS(N, class T)
BOOST_PP_ENUM_TRAILING_PARAMS(N, class U)>
bool
BOOST_PP_CAT(check_table, N)(
const ::boost::type_erasure::binding<Concept>* t,
R (*)(BOOST_PP_ENUM_PARAMS(N, T))
BOOST_PP_ENUM_TRAILING_BINARY_PARAMS(N, const U, &arg))
{
BOOST_PP_REPEAT(N, BOOST_TYPE_ERASURE_CHECK_TABLE, ~)
return true;
}
#if N != 0
template<class Sig BOOST_PP_ENUM_TRAILING_PARAMS(N, class U)>
struct BOOST_PP_CAT(do_extract_concept, N);
template<
class R
BOOST_PP_ENUM_TRAILING_PARAMS(N, class T)
BOOST_PP_ENUM_TRAILING_PARAMS(N, class U)
>
struct BOOST_PP_CAT(do_extract_concept, N)<
R(BOOST_PP_ENUM_PARAMS(N, T))
BOOST_PP_ENUM_TRAILING_PARAMS(N, U)
>
: ::boost::type_erasure::detail::BOOST_PP_CAT(extract_concept, N)<
BOOST_PP_ENUM_PARAMS(N, T)
BOOST_PP_ENUM_TRAILING_PARAMS(N, U)>
{};
#endif
}
#ifdef BOOST_NO_CXX11_RVALUE_REFERENCES
#define RREF &
#else
#define RREF &&
#endif
template<
class Concept,
class Op
BOOST_PP_ENUM_TRAILING_PARAMS(N, class U)
>
bool check_match(
const ::boost::type_erasure::binding<Concept>& table,
const Op&
BOOST_PP_ENUM_TRAILING_BINARY_PARAMS(N, U, RREF arg))
{
return ::boost::type_erasure::detail::BOOST_PP_CAT(check_table, N)(
&table,
(typename ::boost::type_erasure::detail::get_signature<Op>::type*)0
BOOST_PP_ENUM_TRAILING_PARAMS(N, arg));
}
#if N != 0
template<
class Op
BOOST_PP_ENUM_TRAILING_PARAMS(N, class U)
>
bool check_match(
const Op&
BOOST_PP_ENUM_TRAILING_BINARY_PARAMS(N, U, RREF arg))
{
const ::boost::type_erasure::binding<
typename ::boost::type_erasure::detail::BOOST_PP_CAT(do_extract_concept, N)<
typename ::boost::type_erasure::detail::get_signature<Op>::type,
BOOST_PP_ENUM_PARAMS(N, U)>::type>* p = 0;
return ::boost::type_erasure::detail::BOOST_PP_CAT(check_table, N)(
p,
(typename ::boost::type_erasure::detail::get_signature<Op>::type*)0
BOOST_PP_ENUM_TRAILING_PARAMS(N, arg));
}
#undef RREF
#undef BOOST_TYPE_ERASURE_CHECK_TABLE
#undef N
#endif
#endif
|
