/usr/include/rheolef/field_expr_v2_utilities.h is in librheolef-dev 6.7-1+b4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 | #ifndef _RHEOLEF_FIELD_EXPR_V2_UTILITIES_H
#define _RHEOLEF_FIELD_EXPR_V2_UTILITIES_H
//
// This file is part of Rheolef.
//
// Copyright (C) 2000-2009 Pierre Saramito
//
// Rheolef is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// Rheolef is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Rheolef; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// ==========================================================================
//
// utiities for field expressions
//
// author: Pierre.Saramito@imag.fr
//
// date: 4 september 2015
//
#include "rheolef/promote.h"
#include "rheolef/point.h"
#include "rheolef/space_constant.h"
#include <functional>
#include <type_traits>
namespace rheolef {
// forward declaration:
template <typename T, typename M> class field_basic;
namespace details {
// ---------------------------------------------------------------------------
// type comparator, up to std::decay
// ---------------------------------------------------------------------------
template <typename T1, typename T2>
struct decay_is_same
: std::is_same<
typename std::decay<T1>::type,
typename std::decay<T2>::type
>::type
{};
// ---------------------------------------------------------------------------
// metaprogramming logicals: and, or, not with types
// ---------------------------------------------------------------------------
template<typename...>
struct or_type;
template<>
struct or_type<>
: public std::false_type
{ };
template<typename B1>
struct or_type<B1>
: public B1
{ };
template<typename B1, typename B2>
struct or_type<B1, B2>
: public std::conditional<B1::value, B1, B2>::type
{ };
template<typename B1, typename B2, typename B3, typename... Bn>
struct or_type<B1, B2, B3, Bn...>
: public std::conditional<B1::value, B1, or_type<B2, B3, Bn...>>::type
{ };
template<typename...>
struct and_type;
template<>
struct and_type<>
: public std::true_type
{ };
template<typename B1>
struct and_type<B1>
: public B1
{ };
template<typename B1, typename B2>
struct and_type<B1, B2>
: public std::conditional<B1::value, B2, B1>::type
{ };
template<typename B1, typename B2, typename B3, typename... Bn>
struct and_type<B1, B2, B3, Bn...>
: public std::conditional<B1::value, and_type<B2, B3, Bn...>, B1>::type
{ };
template<typename P>
struct not_type
: public std::integral_constant<bool, !P::value>
{ };
// ------------------------------------------
// tools for creating index lists
// ------------------------------------------
// TODO: C++2014 introduced index_sequence : test configure, etc
// the structure that encapsulates index lists
template <size_t... Is>
struct index_list {};
// Collects internal details for generating index ranges [MIN, MAX)
// declare primary template for index range builder
template <size_t MIN, size_t N, size_t... Is>
struct range_builder;
// base step
template <size_t MIN, size_t... Is>
struct range_builder<MIN, MIN, Is...>
{
typedef index_list<Is...> type;
};
// induction step
template <size_t MIN, size_t N, size_t... Is>
struct range_builder: public range_builder<MIN, N - 1, N - 1, Is...>
{
};
// Meta-function that returns a [MIN, MAX[ index range
template<size_t MIN, size_t MAX>
using index_range = typename range_builder<MIN, MAX>::type;
// ---------------------------------------------------------------------------
// general functor traits
// ---------------------------------------------------------------------------
// https://functionalcpp.wordpress.com/2013/08/05/function-traits/
// functor:
template <typename T>
struct functor_traits : public functor_traits<decltype(&T::operator())> {};
template <typename C, typename R, typename... Args>
struct functor_traits<R(C::*)(Args...) const> { // op() with a const qualifier
using result_type = R;
static const std::size_t arity = sizeof...(Args);
template <std::size_t I>
struct arg {
static_assert(I < arity, "error: invalid parameter index.");
using type = typename std::tuple_element<I, std::tuple<Args...> >::type;
using decay_type = typename std::decay<type>::type;
};
typedef std::tuple<Args...> args_tuple_type;
using function_type = R (Args...);
using function_pointer_type = R (*)(Args...);
using copiable_type = C;
using functor_type = C;
};
// true function:
template<class F>
struct true_function_traits;
template<class R, class... Args>
struct true_function_traits<R(*)(Args...)> : public true_function_traits<R(Args...)> {};
template<class R, class... Args>
struct true_function_traits<R(Args...)> {
using result_type = R;
static constexpr std::size_t arity = sizeof...(Args);
template <std::size_t I>
struct arg {
static_assert(I < arity, "error: invalid parameter index.");
using type = typename std::tuple_element<I,std::tuple<Args...> >::type;
};
typedef std::tuple<Args...> args_tuple_type;
using function_type = R (Args...);
using function_pointer_type = R (*)(Args...);
//using copiable_type = std::function<R(Args...)>; // more levels of indirections
using copiable_type = function_pointer_type; // shorter
using functor_type = std::function<R(Args...)>;
};
// select either true-fonction or functor
template<class F> struct function_traits : functor_traits<F> {};
template <typename R, typename... Args> struct function_traits <R(Args...)> : true_function_traits<R(Args...)> {};
template <typename R, typename... Args> struct function_traits <R(*)(Args...)> : true_function_traits<R(Args...)> {};
// field class is not an ordinary function/functor : for compose(field,args...) filtering
template <typename T, typename M> struct function_traits <field_basic<T,M> > {};
// -----------------------------------------------------------------------
// is_callable<Funct,Signature>::value : for both functions and functors
// -----------------------------------------------------------------------
// http://stackoverflow.com/questions/9083593/is-an-is-functor-c-trait-class-possible
// build R (*)(Args...) from R (Args...)
// compile error if signature is not a valid function signature
template <typename, typename>
struct build_free_function {};
template <typename F, typename R, typename ... Args>
struct build_free_function<F, R (Args...)>
{ using type = R (*)(Args...); };
// build R (C::*)(Args...) from R (Args...)
// R (C::*)(Args...) const from R (Args...) const
// R (C::*)(Args...) volatile from R (Args...) volatile
// compile error if signature is not a valid member function signature
template <typename, typename>
struct build_class_function {};
template <typename C, typename R, typename ... Args>
struct build_class_function<C, R (Args...)>
{ using type = R (C::*)(Args...); };
template <typename C, typename R, typename ... Args>
struct build_class_function<C, R (Args...) const>
{ using type = R (C::*)(Args...) const; };
template <typename C, typename R, typename ... Args>
struct build_class_function<C, R (Args...) volatile>
{ using type = R (C::*)(Args...) volatile; };
// determine whether a class C has an operator() with signature S
template <typename C, typename S>
struct is_functor_with_signature {
typedef char (& yes)[1];
typedef char (& no)[2];
// helper struct to determine that C::operator() does indeed have
// the desired signature; &C::operator() is only of type
// R (C::*)(Args...) if this is true
template <typename T, T> struct check;
// T is needed to enable SFINAE
template <typename T> static yes deduce(check<
typename build_class_function<C, S>::type, &T::operator()> *);
// fallback if check helper could not be built
template <typename> static no deduce(...);
static bool constexpr value = sizeof(deduce<C>(0)) == sizeof(yes);
};
// determine whether a free function pointer F has signature S
template <typename F, typename S>
struct is_function_with_signature {
// check whether F and the function pointer of S are of the same
// type
static bool constexpr value = std::is_same<
F, typename build_free_function<F, S>::type
>::value;
};
// C is a class, delegate to is_functor_with_signature
template <typename C, typename S, bool>
struct is_callable_impl
: std::integral_constant<
bool, is_functor_with_signature<C, S>::value
>
{};
// F is not a class, delegate to is_function_with_signature
template <typename F, typename S>
struct is_callable_impl<F, S, false>
: std::integral_constant<
bool, is_function_with_signature<F, S>::value
>
{};
// Determine whether type Callable is callable with signature Signature.
// Compliant with functors, i.e. classes that declare operator(); and free
// function pointers: R (*)(Args...), but not R (Args...)!
template <typename Callable, typename Signature>
struct is_callable
: is_callable_impl<
Callable, Signature,
std::is_class<Callable>::value
>
{};
// specil case for function R (Args...)
template <typename Signature>
struct is_callable<Signature,Signature> : std::true_type {};
namespace { // tests
struct A { void operator()(); };
struct B {};
struct C {
int operator()(int &, void **) const;
int operator()(double);
};
void a();
int b;
int c(int &, void **);
int c(double);
#define _RHEOLEF_IS_CALLABLE_POSITIVE "should be recognized as callable"
#define _RHEOLEF_IS_CALLABLE_NEGATIVE "should not be recognized as callable"
static_assert(is_callable<A, void ()>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
static_assert(!is_callable<B, void ()>::value, _RHEOLEF_IS_CALLABLE_NEGATIVE);
static_assert(is_callable<C, int (int &, void **) const>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
static_assert(is_callable<C, int (double)>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
static_assert(is_callable<decltype(static_cast<int (*)(int &, void **)>(&c)), int (int &, void **)>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
static_assert(is_callable<decltype(static_cast<int (*)(double)>(&c)), int (double)>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
static_assert(is_callable<int(double),int(double)>::value, _RHEOLEF_IS_CALLABLE_POSITIVE);
#undef _RHEOLEF_IS_CALLABLE_POSITIVE
#undef _RHEOLEF_IS_CALLABLE_NEGATIVE
} // tests
// ---------------------------------------------------------------------------
// is_functor: suppose an only one operator()
// ---------------------------------------------------------------------------
template <typename, typename> struct get_functor_result_impl {};
template <typename C, typename R, typename ... Args>
struct get_functor_result_impl<C, R (C::*)(Args...)> {
using type = R;
};
template <typename C, typename R, typename ... Args>
struct get_functor_result_impl<C, R (C::*)(Args...) const> {
using type = R;
};
template <typename C, typename R, typename ... Args>
struct get_functor_result_impl<C, R (C::*)(Args...) volatile> {
using type = R;
};
template <typename F, typename Sfinae = void> struct get_functor_result {
static const bool value = false;
};
template <typename F> struct get_functor_result <F,
typename std::enable_if<
std::is_member_function_pointer<decltype(&F::operator())>::value
>::type
> {
using type = typename get_functor_result_impl<F,decltype(&F::operator())>::type;
static const bool value = true;
};
template <typename F, typename Sfinae = void> struct is_functor : std::false_type {};
template <typename F> struct is_functor<F,
typename std::enable_if<
get_functor_result<F>::value
>::type
> : std::true_type {};
// ---------------------------------------------------------------------------
// class F is field_functor or field_true_function ?
//
// is_field_true_function : F = R (const point_basic<T>&)
// is_field_functor : F have R (F::*) (const point_basic<T>&) const
// with some T = some float type and R = any result_type
// ---------------------------------------------------------------------------
// is_field_true_function
template<class F> struct is_field_true_function : std::false_type {};
template<class R, class T> struct is_field_true_function <R(const point_basic<T>&)> : std::true_type {};
template<class R, class T> struct is_field_true_function <R(*)(const point_basic<T>&)> : std::true_type {};
// is_field_functor
template<class F, class Sfinae = void> struct is_field_functor : std::false_type {};
template<class F> struct is_field_functor<F,typename std::enable_if<
std::is_class<F>::value
&& is_functor<F>::value
>::type>
: std::conditional<
// TODO: arg = basic_point<T> with any T
is_callable<F,typename get_functor_result<F>::type (const point&) const>::value
, std::true_type, std::false_type>::type {};
// is_field_function = is_field_true_function || is_field_functor
template<class F, class Sfinae = void> struct is_field_function : std::false_type {};
template<class F> struct is_field_function<F,
typename std::enable_if<
is_field_true_function<F>::value
|| is_field_functor<F>::value
>::type
> : std::true_type {};
template<class F, class Sfinae = void> struct field_function_traits {};
#ifdef TO_CLEAN
template<class R, class T> struct field_function_traits <R(*)(const point_basic<T>&)> :
field_function_traits <R(const point_basic<T>&)> {};
#endif // TO_CLEAN
template<class F> struct field_function_traits<F,
typename std::enable_if<
is_field_true_function<F>::value
>::type
> {
typedef typename function_traits<F>::result_type result_type;
};
template<class F> struct field_function_traits<F,
typename std::enable_if<
is_field_functor<F>::value
>::type
> {
typedef typename functor_traits<F>::result_type result_type;
};
}} // namespace rheolef::details
#endif // _RHEOLEF_FIELD_EXPR_V2_UTILITIES_H
|