TR-mbed 1.0
Loading...
Searching...
No Matches
CXX11Meta.h
Go to the documentation of this file.
1// This file is part of Eigen, a lightweight C++ template library
2// for linear algebra.
3//
4// Copyright (C) 2013 Christian Seiler <christian@iwakd.de>
5//
6// This Source Code Form is subject to the terms of the Mozilla
7// Public License v. 2.0. If a copy of the MPL was not distributed
8// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9
10#ifndef EIGEN_CXX11META_H
11#define EIGEN_CXX11META_H
12
13#include <vector>
14#include "EmulateArray.h"
15
16#include "CXX11Workarounds.h"
17
18namespace Eigen {
19
20namespace internal {
21
28template<typename... tt>
29struct type_list { constexpr static int count = sizeof...(tt); };
30
31template<typename t, typename... tt>
32struct type_list<t, tt...> { constexpr static int count = sizeof...(tt) + 1; typedef t first_type; };
33
34template<typename T, T... nn>
35struct numeric_list { constexpr static std::size_t count = sizeof...(nn); };
36
37template<typename T, T n, T... nn>
38struct numeric_list<T, n, nn...> { static const std::size_t count = sizeof...(nn) + 1; const static T first_value = n; };
39
40#ifndef EIGEN_PARSED_BY_DOXYGEN
41/* numeric list constructors
42 *
43 * equivalencies:
44 * constructor result
45 * typename gen_numeric_list<int, 5>::type numeric_list<int, 0,1,2,3,4>
46 * typename gen_numeric_list_reversed<int, 5>::type numeric_list<int, 4,3,2,1,0>
47 * typename gen_numeric_list_swapped_pair<int, 5,1,2>::type numeric_list<int, 0,2,1,3,4>
48 * typename gen_numeric_list_repeated<int, 0, 5>::type numeric_list<int, 0,0,0,0,0>
49 */
50
51template<typename T, std::size_t n, T start = 0, T... ii> struct gen_numeric_list : gen_numeric_list<T, n-1, start, start + n-1, ii...> {};
52template<typename T, T start, T... ii> struct gen_numeric_list<T, 0, start, ii...> { typedef numeric_list<T, ii...> type; };
53
54template<typename T, std::size_t n, T start = 0, T... ii> struct gen_numeric_list_reversed : gen_numeric_list_reversed<T, n-1, start, ii..., start + n-1> {};
55template<typename T, T start, T... ii> struct gen_numeric_list_reversed<T, 0, start, ii...> { typedef numeric_list<T, ii...> type; };
56
57template<typename T, std::size_t n, T a, T b, T start = 0, T... ii> struct gen_numeric_list_swapped_pair : gen_numeric_list_swapped_pair<T, n-1, a, b, start, (start + n-1) == a ? b : ((start + n-1) == b ? a : (start + n-1)), ii...> {};
58template<typename T, T a, T b, T start, T... ii> struct gen_numeric_list_swapped_pair<T, 0, a, b, start, ii...> { typedef numeric_list<T, ii...> type; };
59
60template<typename T, std::size_t n, T V, T... nn> struct gen_numeric_list_repeated : gen_numeric_list_repeated<T, n-1, V, V, nn...> {};
61template<typename T, T V, T... nn> struct gen_numeric_list_repeated<T, 0, V, nn...> { typedef numeric_list<T, nn...> type; };
62
63/* list manipulation: concatenate */
64
65template<class a, class b> struct concat;
66
67template<typename... as, typename... bs> struct concat<type_list<as...>, type_list<bs...>> { typedef type_list<as..., bs...> type; };
68template<typename T, T... as, T... bs> struct concat<numeric_list<T, as...>, numeric_list<T, bs...> > { typedef numeric_list<T, as..., bs...> type; };
69
70template<typename... p> struct mconcat;
71template<typename a> struct mconcat<a> { typedef a type; };
72template<typename a, typename b> struct mconcat<a, b> : concat<a, b> {};
73template<typename a, typename b, typename... cs> struct mconcat<a, b, cs...> : concat<a, typename mconcat<b, cs...>::type> {};
74
75/* list manipulation: extract slices */
76
77template<int n, typename x> struct take;
78template<int n, typename a, typename... as> struct take<n, type_list<a, as...>> : concat<type_list<a>, typename take<n-1, type_list<as...>>::type> {};
79template<int n> struct take<n, type_list<>> { typedef type_list<> type; };
80template<typename a, typename... as> struct take<0, type_list<a, as...>> { typedef type_list<> type; };
81template<> struct take<0, type_list<>> { typedef type_list<> type; };
82
83template<typename T, int n, T a, T... as> struct take<n, numeric_list<T, a, as...>> : concat<numeric_list<T, a>, typename take<n-1, numeric_list<T, as...>>::type> {};
84template<typename T, int n> struct take<n, numeric_list<T>> { typedef numeric_list<T> type; };
85template<typename T, T a, T... as> struct take<0, numeric_list<T, a, as...>> { typedef numeric_list<T> type; };
86template<typename T> struct take<0, numeric_list<T>> { typedef numeric_list<T> type; };
87
88template<typename T, int n, T... ii> struct h_skip_helper_numeric;
89template<typename T, int n, T i, T... ii> struct h_skip_helper_numeric<T, n, i, ii...> : h_skip_helper_numeric<T, n-1, ii...> {};
90template<typename T, T i, T... ii> struct h_skip_helper_numeric<T, 0, i, ii...> { typedef numeric_list<T, i, ii...> type; };
91template<typename T, int n> struct h_skip_helper_numeric<T, n> { typedef numeric_list<T> type; };
92template<typename T> struct h_skip_helper_numeric<T, 0> { typedef numeric_list<T> type; };
93
94template<int n, typename... tt> struct h_skip_helper_type;
95template<int n, typename t, typename... tt> struct h_skip_helper_type<n, t, tt...> : h_skip_helper_type<n-1, tt...> {};
96template<typename t, typename... tt> struct h_skip_helper_type<0, t, tt...> { typedef type_list<t, tt...> type; };
97template<int n> struct h_skip_helper_type<n> { typedef type_list<> type; };
98template<> struct h_skip_helper_type<0> { typedef type_list<> type; };
99#endif //not EIGEN_PARSED_BY_DOXYGEN
100
101template<int n>
102struct h_skip {
103 template<typename T, T... ii>
105 template<typename... tt>
106 constexpr static EIGEN_STRONG_INLINE typename h_skip_helper_type<n, tt...>::type helper(type_list<tt...>) { return typename h_skip_helper_type<n, tt...>::type(); }
107};
108
109template<int n, typename a> struct skip { typedef decltype(h_skip<n>::helper(a())) type; };
110
111template<int start, int count, typename a> struct slice : take<count, typename skip<start, a>::type> {};
112
113/* list manipulation: retrieve single element from list */
114
115template<int n, typename x> struct get;
116
117template<int n, typename a, typename... as> struct get<n, type_list<a, as...>> : get<n-1, type_list<as...>> {};
118template<typename a, typename... as> struct get<0, type_list<a, as...>> { typedef a type; };
119
120template<typename T, int n, T a, T... as> struct get<n, numeric_list<T, a, as...>> : get<n-1, numeric_list<T, as...>> {};
121template<typename T, T a, T... as> struct get<0, numeric_list<T, a, as...>> { constexpr static T value = a; };
122
123template<std::size_t n, typename T, T a, T... as> constexpr T array_get(const numeric_list<T, a, as...>&) {
124 return get<(int)n, numeric_list<T, a, as...>>::value;
125}
126
127/* always get type, regardless of dummy; good for parameter pack expansion */
128
129template<typename T, T dummy, typename t> struct id_numeric { typedef t type; };
130template<typename dummy, typename t> struct id_type { typedef t type; };
131
132/* equality checking, flagged version */
133
134template<typename a, typename b> struct is_same_gf : is_same<a, b> { constexpr static int global_flags = 0; };
135
136/* apply_op to list */
137
138template<
139 bool from_left, // false
140 template<typename, typename> class op,
141 typename additional_param,
142 typename... values
143>
145template<
146 template<typename, typename> class op,
147 typename additional_param,
148 typename... values
149>
151
152template<
153 bool from_left,
154 template<typename, typename> class op,
155 typename additional_param
156>
158{
159 template<typename... values>
162};
163
164template<
165 template<typename, typename> class op,
166 typename additional_param,
167 typename a
168>
170
171template<
172 template<typename, typename> class op,
173 typename additional_param,
174 typename a
175>
177
178/* see if an element is in a list */
179
180template<
181 template<typename, typename> class test,
182 typename check_against,
183 typename h_list,
184 bool last_check_positive = false
185>
187
188template<
189 template<typename, typename> class test,
190 typename check_against,
191 typename h_list
192>
194{
195 constexpr static bool value = true;
196};
197
198template<
199 template<typename, typename> class test,
200 typename check_against,
201 typename a,
202 typename... as
203>
204struct contained_in_list<test, check_against, type_list<a, as...>, false> : contained_in_list<test, check_against, type_list<as...>, test<check_against, a>::value> {};
205
206template<
207 template<typename, typename> class test,
208 typename check_against
209 EIGEN_TPL_PP_SPEC_HACK_DEFC(typename, empty)
210>
211struct contained_in_list<test, check_against, type_list<EIGEN_TPL_PP_SPEC_HACK_USE(empty)>, false> { constexpr static bool value = false; };
212
213/* see if an element is in a list and check for global flags */
214
215template<
216 template<typename, typename> class test,
217 typename check_against,
218 typename h_list,
219 int default_flags = 0,
220 bool last_check_positive = false,
222>
224
225template<
226 template<typename, typename> class test,
227 typename check_against,
228 typename h_list,
229 int default_flags,
231>
233{
234 constexpr static bool value = true;
235 constexpr static int global_flags = last_check_flags;
236};
237
238template<
239 template<typename, typename> class test,
240 typename check_against,
241 typename a,
242 typename... as,
243 int default_flags,
245>
246struct contained_in_list_gf<test, check_against, type_list<a, as...>, default_flags, false, last_check_flags> : contained_in_list_gf<test, check_against, type_list<as...>, default_flags, test<check_against, a>::value, test<check_against, a>::global_flags> {};
247
248template<
249 template<typename, typename> class test,
250 typename check_against
251 EIGEN_TPL_PP_SPEC_HACK_DEFC(typename, empty),
252 int default_flags,
254>
255struct contained_in_list_gf<test, check_against, type_list<EIGEN_TPL_PP_SPEC_HACK_USE(empty)>, default_flags, false, last_check_flags> { constexpr static bool value = false; constexpr static int global_flags = default_flags; };
256
257/* generic reductions */
258
259template<
260 typename Reducer,
261 typename... Ts
262> struct reduce;
263
264template<
265 typename Reducer
267{
268 EIGEN_DEVICE_FUNC constexpr static EIGEN_STRONG_INLINE int run() { return Reducer::Identity; }
269};
270
271template<
272 typename Reducer,
273 typename A
274> struct reduce<Reducer, A>
275{
276 EIGEN_DEVICE_FUNC constexpr static EIGEN_STRONG_INLINE A run(A a) { return a; }
277};
278
279template<
280 typename Reducer,
281 typename A,
282 typename... Ts
283> struct reduce<Reducer, A, Ts...>
284{
285 EIGEN_DEVICE_FUNC constexpr static EIGEN_STRONG_INLINE auto run(A a, Ts... ts) -> decltype(Reducer::run(a, reduce<Reducer, Ts...>::run(ts...))) {
286 return Reducer::run(a, reduce<Reducer, Ts...>::run(ts...));
287 }
288};
289
290/* generic binary operations */
291
292struct sum_op {
293 template<typename A, typename B> EIGEN_DEVICE_FUNC constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a + b) { return a + b; }
294 static constexpr int Identity = 0;
295};
297 template<typename A, typename B> EIGEN_DEVICE_FUNC constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a * b) { return a * b; }
298 static constexpr int Identity = 1;
299};
300
301struct logical_and_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a && b) { return a && b; } };
302struct logical_or_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a || b) { return a || b; } };
303
304struct equal_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a == b) { return a == b; } };
305struct not_equal_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a != b) { return a != b; } };
306struct lesser_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a < b) { return a < b; } };
307struct lesser_equal_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a <= b) { return a <= b; } };
308struct greater_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a > b) { return a > b; } };
309struct greater_equal_op { template<typename A, typename B> constexpr static EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a >= b) { return a >= b; } };
310
311/* generic unary operations */
312
313struct not_op { template<typename A> constexpr static EIGEN_STRONG_INLINE auto run(A a) -> decltype(!a) { return !a; } };
314struct negation_op { template<typename A> constexpr static EIGEN_STRONG_INLINE auto run(A a) -> decltype(-a) { return -a; } };
315struct greater_equal_zero_op { template<typename A> constexpr static EIGEN_STRONG_INLINE auto run(A a) -> decltype(a >= 0) { return a >= 0; } };
316
317
318/* reductions for lists */
319
320// using auto -> return value spec makes ICC 13.0 and 13.1 crash here, so we have to hack it
321// together in front... (13.0 doesn't work with array_prod/array_reduce/... anyway, but 13.1
322// does...
323template<typename... Ts>
328
329template<typename... Ts>
330constexpr EIGEN_STRONG_INLINE decltype(reduce<sum_op, Ts...>::run((*((Ts*)0))...)) arg_sum(Ts... ts)
331{
333}
334
335/* reverse arrays */
336
337template<typename Array, int... n>
339{
340 return {{array_get<sizeof...(n) - n - 1>(arr)...}};
341}
342
343template<typename T, std::size_t N>
348
349
350/* generic array reductions */
351
352// can't reuse standard reduce() interface above because Intel's Compiler
353// *really* doesn't like it, so we just reimplement the stuff
354// (start from N - 1 and work down to 0 because specialization for
355// n == N - 1 also doesn't work in Intel's compiler, so it goes into
356// an infinite loop)
357template<typename Reducer, typename T, std::size_t N, std::size_t n = N - 1>
364
365template<typename Reducer, typename T, std::size_t N>
367{
369 {
370 return array_get<0>(arr);
371 }
372};
373
374template<typename Reducer, typename T>
376{
378 {
379 return identity;
380 }
381};
382
383template<typename Reducer, typename T, std::size_t N>
388
389/* standard array reductions */
390
391template<typename T, std::size_t N>
393{
394 return array_reduce<sum_op, T, N>(arr, static_cast<T>(0));
395}
396
397template<typename T, std::size_t N>
399{
400 return array_reduce<product_op, T, N>(arr, static_cast<T>(1));
401}
402
403template<typename t>
405 eigen_assert(a.size() > 0);
406 t prod = 1;
407 for (size_t i = 0; i < a.size(); ++i) { prod *= a[i]; }
408 return prod;
409}
410
411/* zip an array */
412
413template<typename Op, typename A, typename B, std::size_t N, int... n>
415{
416 return array<decltype(Op::run(A(), B())),N>{{ Op::run(array_get<n>(a), array_get<n>(b))... }};
417}
418
419template<typename Op, typename A, typename B, std::size_t N>
420constexpr EIGEN_STRONG_INLINE array<decltype(Op::run(A(), B())),N> array_zip(array<A, N> a, array<B, N> b)
421{
423}
424
425/* zip an array and reduce the result */
426
427template<typename Reducer, typename Op, typename A, typename B, std::size_t N, int... n>
428constexpr EIGEN_STRONG_INLINE auto h_array_zip_and_reduce(array<A, N> a, array<B, N> b, numeric_list<int, n...>) -> decltype(reduce<Reducer, typename id_numeric<int,n,decltype(Op::run(A(), B()))>::type...>::run(Op::run(array_get<n>(a), array_get<n>(b))...))
429{
430 return reduce<Reducer, typename id_numeric<int,n,decltype(Op::run(A(), B()))>::type...>::run(Op::run(array_get<n>(a), array_get<n>(b))...);
431}
432
433template<typename Reducer, typename Op, typename A, typename B, std::size_t N>
438
439/* apply stuff to an array */
440
441template<typename Op, typename A, std::size_t N, int... n>
443{
444 return array<decltype(Op::run(A())),N>{{ Op::run(array_get<n>(a))... }};
445}
446
447template<typename Op, typename A, std::size_t N>
448constexpr EIGEN_STRONG_INLINE array<decltype(Op::run(A())),N> array_apply(array<A, N> a)
449{
451}
452
453/* apply stuff to an array and reduce */
454
455template<typename Reducer, typename Op, typename A, std::size_t N, int... n>
456constexpr EIGEN_STRONG_INLINE auto h_array_apply_and_reduce(array<A, N> arr, numeric_list<int, n...>) -> decltype(reduce<Reducer, typename id_numeric<int,n,decltype(Op::run(A()))>::type...>::run(Op::run(array_get<n>(arr))...))
457{
458 return reduce<Reducer, typename id_numeric<int,n,decltype(Op::run(A()))>::type...>::run(Op::run(array_get<n>(arr))...);
459}
460
461template<typename Reducer, typename Op, typename A, std::size_t N>
466
467/* repeat a value n times (and make an array out of it
468 * usage:
469 * array<int, 16> = repeat<16>(42);
470 */
471
472template<int n>
474{
475 template<typename t, int... ii>
477 {
478 return {{ typename id_numeric<int, ii, t>::type(v)... }};
479 }
480};
481
482template<int n, typename t>
484
485/* instantiate a class by a C-style array */
486template<class InstType, typename ArrType, std::size_t N, bool Reverse, typename... Ps>
488
489template<class InstType, typename ArrType, std::size_t N, typename... Ps>
497
498template<class InstType, typename ArrType, std::size_t N, typename... Ps>
506
507template<class InstType, typename ArrType, typename... Ps>
509{
511 {
512 (void)arr;
513 return InstType(args...);
514 }
515};
516
517template<class InstType, typename ArrType, typename... Ps>
519{
521 {
522 (void)arr;
523 return InstType(args...);
524 }
525};
526
527template<class InstType, typename ArrType, std::size_t N, bool Reverse = false>
532
533} // end namespace internal
534
535} // end namespace Eigen
536
537#endif // EIGEN_CXX11META_H
ArrayXXi a
Definition Array_initializer_list_23_cxx11.cpp:1
Array< int, Dynamic, 1 > v
Definition Array_initializer_list_vector_cxx11.cpp:1
int n
Definition BiCGSTAB_simple.cpp:1
int i
Definition BiCGSTAB_step_by_step.cpp:9
#define EIGEN_TPL_PP_SPEC_HACK_USE(n)
Definition CXX11Workarounds.h:76
#define EIGEN_TPL_PP_SPEC_HACK_DEFC(mt, n)
Definition CXX11Workarounds.h:75
MatrixXcd V
Definition EigenSolver_EigenSolver_MatrixType.cpp:15
#define EIGEN_DEVICE_FUNC
Definition Macros.h:976
#define eigen_assert(x)
Definition Macros.h:1037
#define EIGEN_STRONG_INLINE
Definition Macros.h:917
float * p
Definition Tutorial_Map_using.cpp:9
Eigen::Triplet< double > T
Definition Tutorial_sparse_example.cpp:6
Scalar * b
Definition benchVecAdd.cpp:17
Matrix< SCALARA, Dynamic, Dynamic, opt_A > A
Definition bench_gemm.cpp:48
Matrix< SCALARB, Dynamic, Dynamic, opt_B > B
Definition bench_gemm.cpp:49
General-purpose arrays with easy API for coefficient-wise operations.
Definition Array.h:47
The matrix class, also used for vectors and row-vectors.
Definition Matrix.h:180
Expression of the reverse of a vector or matrix.
Definition Reverse.h:65
Definition EmulateArray.h:21
@ N
Definition constructor.cpp:23
return int(ret)+1
constexpr EIGEN_STRONG_INLINE auto h_array_apply_and_reduce(array< A, N > arr, numeric_list< int, n... >) -> decltype(reduce< Reducer, typename id_numeric< int, n, decltype(Op::run(A()))>::type... >::run(Op::run(array_get< n >(arr))...))
Definition CXX11Meta.h:456
constexpr EIGEN_STRONG_INLINE Array h_array_reverse(Array arr, numeric_list< int, n... >)
Definition CXX11Meta.h:338
EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::ptrdiff_t array_prod(const Sizes< Indices... > &)
Definition TensorDimensions.h:140
constexpr EIGEN_STRONG_INLINE array< decltype(Op::run(A(), B())), N > array_zip(array< A, N > a, array< B, N > b)
Definition CXX11Meta.h:420
EIGEN_DEVICE_FUNC constexpr EIGEN_STRONG_INLINE decltype(reduce< product_op, Ts... >::run((*((Ts *) 0))...) arg_prod)(Ts... ts)
Definition CXX11Meta.h:324
constexpr array< t, n > repeat(t v)
Definition CXX11Meta.h:483
EIGEN_DEVICE_FUNC constexpr EIGEN_STRONG_INLINE auto array_sum(const array< T, N > &arr) -> decltype(array_reduce< sum_op, T, N >(arr, static_cast< T >(0)))
Definition CXX11Meta.h:392
constexpr EIGEN_STRONG_INLINE array< decltype(Op::run(A())), N > array_apply(array< A, N > a)
Definition CXX11Meta.h:448
constexpr EIGEN_STRONG_INLINE array< decltype(Op::run(A(), B())), N > h_array_zip(array< A, N > a, array< B, N > b, numeric_list< int, n... >)
Definition CXX11Meta.h:414
EIGEN_DEVICE_FUNC constexpr EIGEN_STRONG_INLINE auto array_reduce(const array< T, N > &arr, T identity) -> decltype(h_array_reduce< Reducer, T, N >::run(arr, identity))
Definition CXX11Meta.h:384
constexpr EIGEN_STRONG_INLINE array< T, N > array_reverse(array< T, N > arr)
Definition CXX11Meta.h:344
constexpr EIGEN_STRONG_INLINE auto h_array_zip_and_reduce(array< A, N > a, array< B, N > b, numeric_list< int, n... >) -> decltype(reduce< Reducer, typename id_numeric< int, n, decltype(Op::run(A(), B()))>::type... >::run(Op::run(array_get< n >(a), array_get< n >(b))...))
Definition CXX11Meta.h:428
const Index array_get(DimensionList< Index, Rank > &)
Definition TensorDimensionList.h:39
constexpr EIGEN_STRONG_INLINE array< decltype(Op::run(A())), N > h_array_apply(array< A, N > a, numeric_list< int, n... >)
Definition CXX11Meta.h:442
constexpr EIGEN_STRONG_INLINE decltype(reduce< sum_op, Ts... >::run((*((Ts *) 0))...) arg_sum)(Ts... ts)
Definition CXX11Meta.h:330
constexpr EIGEN_STRONG_INLINE auto array_zip_and_reduce(array< A, N > a, array< B, N > b) -> decltype(h_array_zip_and_reduce< Reducer, Op, A, B, N >(a, b, typename gen_numeric_list< int, N >::type()))
Definition CXX11Meta.h:434
InstType instantiate_by_c_array(ArrType *arr)
Definition CXX11Meta.h:528
constexpr EIGEN_STRONG_INLINE auto array_apply_and_reduce(array< A, N > a) -> decltype(h_array_apply_and_reduce< Reducer, Op, A, N >(a, typename gen_numeric_list< int, N >::type()))
Definition CXX11Meta.h:462
Namespace containing all symbols from the Eigen library.
Definition bench_norm.cpp:85
const Product< Lhs, Rhs > prod(const Lhs &lhs, const Rhs &rhs)
Definition evaluators.cpp:8
Definition BandTriangularSolver.h:13
Definition CXX11Meta.h:169
decltype(h_apply_op< true, op, additional_param >::helper(a())) type
Definition CXX11Meta.h:169
Definition CXX11Meta.h:176
decltype(h_apply_op< false, op, additional_param >::helper(a())) type
Definition CXX11Meta.h:176
numeric_list< T, as..., bs... > type
Definition CXX11Meta.h:68
type_list< as..., bs... > type
Definition CXX11Meta.h:67
Definition CXX11Meta.h:65
Definition CXX11Meta.h:223
Definition CXX11Meta.h:186
Definition CXX11Meta.h:304
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a==b)
Definition CXX11Meta.h:304
numeric_list< T, ii... > type
Definition CXX11Meta.h:52
numeric_list< T, nn... > type
Definition CXX11Meta.h:61
numeric_list< T, ii... > type
Definition CXX11Meta.h:55
numeric_list< T, ii... > type
Definition CXX11Meta.h:58
Definition CXX11Meta.h:51
Definition CXX11Meta.h:115
Definition CXX11Meta.h:309
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a >=b)
Definition CXX11Meta.h:309
Definition CXX11Meta.h:315
static constexpr EIGEN_STRONG_INLINE auto run(A a) -> decltype(a >=0)
Definition CXX11Meta.h:315
Definition CXX11Meta.h:308
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a > b)
Definition CXX11Meta.h:308
type_list< typename op< additional_param, values >::type... > type
Definition CXX11Meta.h:150
Definition CXX11Meta.h:144
type_list< typename op< values, additional_param >::type... > type
Definition CXX11Meta.h:144
Definition CXX11Meta.h:158
static constexpr h_apply_op_helper< from_left, op, additional_param, values... >::type helper(type_list< values... >)
Definition CXX11Meta.h:160
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE T run(const array< T, 0 > &, T identity)
Definition CXX11Meta.h:377
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE T run(const array< T, N > &arr, T)
Definition CXX11Meta.h:368
Definition CXX11Meta.h:358
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE auto run(array< T, N > arr, T identity) -> decltype(Reducer::run(h_array_reduce< Reducer, T, N, n - 1 >::run(arr, identity), array_get< n >(arr)))
Definition CXX11Meta.h:359
static InstType run(ArrType *arr, Ps... args)
Definition CXX11Meta.h:510
static InstType run(ArrType *arr, Ps... args)
Definition CXX11Meta.h:520
static InstType run(ArrType *arr, Ps... args)
Definition CXX11Meta.h:492
static InstType run(ArrType *arr, Ps... args)
Definition CXX11Meta.h:501
Definition CXX11Meta.h:474
static constexpr EIGEN_STRONG_INLINE array< t, n > run(t v, numeric_list< int, ii... >)
Definition CXX11Meta.h:476
numeric_list< T, i, ii... > type
Definition CXX11Meta.h:90
numeric_list< T > type
Definition CXX11Meta.h:92
numeric_list< T > type
Definition CXX11Meta.h:91
type_list< t, tt... > type
Definition CXX11Meta.h:96
type_list type
Definition CXX11Meta.h:98
type_list type
Definition CXX11Meta.h:97
Definition CXX11Meta.h:94
Definition CXX11Meta.h:102
static constexpr EIGEN_STRONG_INLINE h_skip_helper_numeric< T, n, ii... >::type helper(numeric_list< T, ii... >)
Definition CXX11Meta.h:104
static constexpr EIGEN_STRONG_INLINE h_skip_helper_type< n, tt... >::type helper(type_list< tt... >)
Definition CXX11Meta.h:106
Definition CXX11Meta.h:129
t type
Definition CXX11Meta.h:129
Definition CXX11Meta.h:130
t type
Definition CXX11Meta.h:130
Definition CXX11Meta.h:134
static constexpr int global_flags
Definition CXX11Meta.h:134
Definition Meta.h:148
Definition CXX11Meta.h:307
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a<=b)
Definition CXX11Meta.h:307
Definition CXX11Meta.h:306
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a< b)
Definition CXX11Meta.h:306
Definition CXX11Meta.h:301
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a &&b)
Definition CXX11Meta.h:301
Definition CXX11Meta.h:302
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a||b)
Definition CXX11Meta.h:302
a type
Definition CXX11Meta.h:71
Definition CXX11Meta.h:70
Definition CXX11Meta.h:314
static constexpr EIGEN_STRONG_INLINE auto run(A a) -> decltype(-a)
Definition CXX11Meta.h:314
Definition CXX11Meta.h:305
static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a !=b)
Definition CXX11Meta.h:305
Definition CXX11Meta.h:313
static constexpr EIGEN_STRONG_INLINE auto run(A a) -> decltype(!a)
Definition CXX11Meta.h:313
Definition CXX11Meta.h:35
static constexpr std::size_t count
Definition CXX11Meta.h:35
Definition CXX11Meta.h:296
static constexpr int Identity
Definition CXX11Meta.h:298
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a *b)
Definition CXX11Meta.h:297
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE auto run(A a, Ts... ts) -> decltype(Reducer::run(a, reduce< Reducer, Ts... >::run(ts...)))
Definition CXX11Meta.h:285
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE A run(A a)
Definition CXX11Meta.h:276
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE int run()
Definition CXX11Meta.h:268
Definition CXX11Meta.h:262
Definition CXX11Meta.h:109
decltype(h_skip< n >::helper(a())) type
Definition CXX11Meta.h:109
Definition CXX11Meta.h:111
Definition CXX11Meta.h:292
EIGEN_DEVICE_FUNC static constexpr EIGEN_STRONG_INLINE auto run(A a, B b) -> decltype(a+b)
Definition CXX11Meta.h:293
static constexpr int Identity
Definition CXX11Meta.h:294
numeric_list< T > type
Definition CXX11Meta.h:85
numeric_list< T > type
Definition CXX11Meta.h:86
type_list type
Definition CXX11Meta.h:80
type_list type
Definition CXX11Meta.h:81
numeric_list< T > type
Definition CXX11Meta.h:84
type_list type
Definition CXX11Meta.h:79
Definition CXX11Meta.h:77
Definition ForwardDeclarations.h:17
t first_type
Definition CXX11Meta.h:32
Definition CXX11Meta.h:29
static constexpr int count
Definition CXX11Meta.h:29