\n
\n
\n
\n-
5#ifndef DUNE_QUADMATH_HH \n-
6#define DUNE_QUADMATH_HH \n+
5#ifndef DUNE_ITERATORFACADES_HH \n+
6#define DUNE_ITERATORFACADES_HH \n
\n-
\n-
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
38 using float128_t = __float128;
\n-
\n-
\n-
\n-
43 float128_t value_ = 0.0q;
\n-
\n-
\n-
46 constexpr Float128() =
default;
\n-
47 constexpr Float128(
const float128_t& value) noexcept
\n-
\n-
\n-
\n-
\n-
\n-
53 std::enable_if_t<std::is_arithmetic<T>::value,
int> = 0>
\n-
54 constexpr Float128(
const T& value) noexcept
\n-
\n-
\n-
\n-
\n-
59 explicit Float128(
const char* str) noexcept
\n-
60 : value_(strtoflt128(str, NULL))
\n-
\n-
\n-
\n-
64 constexpr operator float128_t() const noexcept {
return value_; }
\n-
\n-
66 constexpr float128_t
const& value() const noexcept {
return value_; }
\n-
67 constexpr float128_t& value() noexcept {
return value_; }
\n-
\n-
\n-
70 template<
class CharT,
class Traits>
\n-
71 friend std::basic_istream<CharT, Traits>&
\n-
72 operator>>(std::basic_istream<CharT, Traits>& in, Float128& x)
\n-
\n-
\n-
\n-
\n-
77 x.value() = strtoflt128(buf.c_str(), NULL);
\n-
\n-
\n-
\n-
81 template<
class CharT,
class Traits>
\n-
82 friend std::basic_ostream<CharT, Traits>&
\n-
83 operator<<(std::basic_ostream<CharT, Traits>& out,
const Float128& x)
\n-
\n-
85 const std::size_t bufSize = 128;
\n-
\n-
\n-
88 std::string format =
"%." + std::to_string(out.precision()) +
"Q" +
\n-
89 ((out.flags() | std::ios_base::scientific) ?
"e" :
"f");
\n-
90 const int numChars = quadmath_snprintf(buf, bufSize, format.c_str(), x.value());
\n-
91 if (std::size_t(numChars) >= bufSize) {
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
99 constexpr Float128& operator++() noexcept { ++value_;
return *
this; }
\n-
100 constexpr Float128& operator--() noexcept { --value_;
return *
this; }
\n-
\n-
102 constexpr Float128 operator++(
int)
noexcept { Float128 tmp{*
this}; ++value_;
return tmp; }
\n-
103 constexpr Float128 operator--(
int)
noexcept { Float128 tmp{*
this}; --value_;
return tmp; }
\n-
\n-
\n-
106 constexpr Float128
operator+() const noexcept {
return Float128{+value_}; }
\n-
107 constexpr Float128
operator-() const noexcept {
return Float128{-value_}; }
\n-
\n-
\n-
110#define DUNE_ASSIGN_OP(OP) \\ \n-
111 constexpr Float128& operator OP(const Float128& u) noexcept \\ \n-
\n-
113 value_ OP float128_t(u); \\ \n-
\n-
\n-
116 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
131#define DUNE_BINARY_OP(OP) \\ \n-
132 constexpr Float128 operator OP(const Float128& t, \\ \n-
133 const Float128& u) noexcept \\ \n-
\n-
135 return Float128{float128_t(t) OP float128_t(u)}; \\ \n-
\n-
137 constexpr Float128 operator OP(const float128_t& t, \\ \n-
138 const Float128& u) noexcept \\ \n-
\n-
140 return Float128{t OP float128_t(u)}; \\ \n-
\n-
142 constexpr Float128 operator OP(const Float128& t, \\ \n-
143 const float128_t& u) noexcept \\ \n-
\n-
145 return Float128{float128_t(t) OP u}; \\ \n-
\n-
147 template <class T, \\ \n-
148 std::enable_if_t<std::is_arithmetic<T>::value, int> = 0> \\ \n-
149 constexpr Float128 operator OP(const T& t, \\ \n-
150 const Float128& u) noexcept \\ \n-
\n-
152 return Float128{float128_t(t) OP float128_t(u)}; \\ \n-
\n-
154 template <class U, \\ \n-
155 std::enable_if_t<std::is_arithmetic<U>::value, int> = 0> \\ \n-
156 constexpr Float128 operator OP(const Float128& t, \\ \n-
157 const U& u) noexcept \\ \n-
\n-
159 return Float128{float128_t(t) OP float128_t(u)}; \\ \n-
\n-
161 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
173#define DUNE_BINARY_BOOL_OP(OP) \\ \n-
174 constexpr bool operator OP(const Float128& t, \\ \n-
175 const Float128& u) noexcept \\ \n-
\n-
177 return float128_t(t) OP float128_t(u); \\ \n-
\n-
179 template <class T, \\ \n-
180 std::enable_if_t<std::is_arithmetic<T>::value, int> = 0> \\ \n-
181 constexpr bool operator OP(const T& t, \\ \n-
182 const Float128& u) noexcept \\ \n-
\n-
184 return float128_t(t) OP float128_t(u); \\ \n-
\n-
186 template <class U, \\ \n-
187 std::enable_if_t<std::is_arithmetic<U>::value, int> = 0> \\ \n-
188 constexpr bool operator OP(const Float128& t, \\ \n-
189 const U& u) noexcept \\ \n-
\n-
191 return float128_t(t) OP float128_t(u); \\ \n-
\n-
193 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
195 DUNE_BINARY_BOOL_OP(==);
\n-
196 DUNE_BINARY_BOOL_OP(!=);
\n-
197 DUNE_BINARY_BOOL_OP(<);
\n-
198 DUNE_BINARY_BOOL_OP(>);
\n-
199 DUNE_BINARY_BOOL_OP(<=);
\n-
200 DUNE_BINARY_BOOL_OP(>=);
\n-
\n-
202#undef DUNE_BINARY_BOOL_OP \n+
\n+
\n+
\n+
\n+
\n+
140 template<
class T,
class V,
class R = V&,
class D = std::ptrdiff_t>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
201 return static_cast<DerivedType const*
>(
this)->dereference();
\n+
\n+
\n
\n-
\n-
\n-
\n-
207#define DUNE_UNARY_FUNC(name,func) \\ \n-
208 inline Float128 name(const Float128& u) noexcept \\ \n-
\n-
210 return Float128{func (float128_t(u))}; \\ \n-
\n-
212 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
\n-
215#define DUNE_CUSTOM_UNARY_FUNC(type,name,func) \\ \n-
216 inline type name(const Float128& u) noexcept \\ \n-
\n-
218 return (type)(func (float128_t(u))); \\ \n-
\n-
220 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
\n-
223#define DUNE_BINARY_FUNC(name,func) \\ \n-
224 inline Float128 name(const Float128& t, \\ \n-
225 const Float128& u) noexcept \\ \n-
\n-
227 return Float128{func (float128_t(t), float128_t(u))}; \\ \n-
\n-
229 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
248 DUNE_CUSTOM_UNARY_FUNC(
int, ilogb, ilogbq);
\n-
\n-
250 DUNE_CUSTOM_UNARY_FUNC(
long long int, llrint, llrintq);
\n-
251 DUNE_CUSTOM_UNARY_FUNC(
long long int, llround, llroundq);
\n-
\n-
\n-
\n-
\n-
\n-
257 DUNE_CUSTOM_UNARY_FUNC(
long int, lrint, lrintq);
\n-
258 DUNE_CUSTOM_UNARY_FUNC(
long int, lround, lroundq);
\n-
\n-
260 DUNE_BINARY_FUNC(nextafter, nextafterq);
\n-
261 DUNE_BINARY_FUNC(pow, powq);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
272 DUNE_CUSTOM_UNARY_FUNC(
bool, isfinite, finiteq);
\n-
273 DUNE_CUSTOM_UNARY_FUNC(
bool, isinf, isinfq);
\n-
274 DUNE_CUSTOM_UNARY_FUNC(
bool, isnan, isnanq);
\n-
275 DUNE_CUSTOM_UNARY_FUNC(
bool, signbit, signbitq);
\n+
\n+
\n+
\n+
206 return &(
static_cast<const DerivedType *
>(
this)->dereference());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
235 template<
class T1,
class V1,
class R1,
class D,
\n+
236 class T2,
class V2,
class R2>
\n+
237 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
241 if(std::is_convertible<T2,T1>::value)
\n+
242 return static_cast<const T1&
>(lhs).equals(
static_cast<const T2&
>(rhs));
\n+
\n+
244 return static_cast<const T2&
>(rhs).equals(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
257 template<
class T1,
class V1,
class R1,
class D,
\n+
258 class T2,
class V2,
class R2>
\n+
259 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
263 if(std::is_convertible<T2,T1>::value)
\n+
264 return !
static_cast<const T1&
>(lhs).equals(
static_cast<const T2&
>(rhs));
\n+
\n+
266 return !
static_cast<const T2&
>(rhs).equals(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
273 template<
class T,
class V,
class R = V&,
class D = std::ptrdiff_t>
\n+
\n+
\n+
\n
\n-
277#undef DUNE_UNARY_FUNC \n-
278#undef DUNE_CUSTOM_UNARY_FUNC \n-
279#undef DUNE_BINARY_FUNC \n-
\n-
\n-
\n-
283#define DUNE_BINARY_ARITHMETIC_FUNC(name,func) \\ \n-
284 inline Float128 name(const Float128& t, \\ \n-
285 const Float128& u) noexcept \\ \n-
\n-
287 return Float128{func (float128_t(t), float128_t(u))}; \\ \n-
\n-
289 template <class T, \\ \n-
290 std::enable_if_t<std::is_arithmetic<T>::value, int> = 0> \\ \n-
291 inline Float128 name(const T& t, \\ \n-
292 const Float128& u) noexcept \\ \n-
\n-
294 return Float128{func (float128_t(t), float128_t(u))}; \\ \n-
\n-
296 template <class U, \\ \n-
297 std::enable_if_t<std::is_arithmetic<U>::value, int> = 0> \\ \n-
298 inline Float128 name(const Float128& t, \\ \n-
299 const U& u) noexcept \\ \n-
\n-
301 return Float128{func (float128_t(t), float128_t(u))}; \\ \n-
\n-
303 static_assert(true, "Require semicolon to unconfuse editors") \n-
\n-
305 DUNE_BINARY_ARITHMETIC_FUNC(atan2,atan2q);
\n-
306 DUNE_BINARY_ARITHMETIC_FUNC(copysign,copysignq);
\n-
307 DUNE_BINARY_ARITHMETIC_FUNC(fdim,fdimq);
\n-
308 DUNE_BINARY_ARITHMETIC_FUNC(fmax,fmaxq);
\n-
309 DUNE_BINARY_ARITHMETIC_FUNC(fmin,fminq);
\n-
310 DUNE_BINARY_ARITHMETIC_FUNC(fmod,fmodq);
\n-
311 DUNE_BINARY_ARITHMETIC_FUNC(hypot,hypotq);
\n-
312 DUNE_BINARY_ARITHMETIC_FUNC(remainder,remainderq);
\n-
\n-
314#undef DUNE_BINARY_ARITHMETIC_FUNC \n-
\n-
\n-
\n-
318 inline Float128 fma(
const Float128& t,
const Float128& u,
const Float128& v)
\n-
\n-
320 return Float128{fmaq(float128_t(t),float128_t(u),float128_t(v))};
\n-
\n-
\n-
323 inline Float128 frexp(
const Float128& u,
int* p)
\n-
\n-
325 return Float128{frexpq(float128_t(u), p)};
\n-
\n-
\n-
328 inline Float128 ldexp(
const Float128& u,
int p)
\n-
\n-
330 return Float128{ldexpq(float128_t(u), p)};
\n-
\n-
\n-
333 inline Float128 remquo(
const Float128& t,
const Float128& u,
int* quo)
\n-
\n-
335 return Float128{remquoq(float128_t(t), float128_t(u), quo)};
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
335 return static_cast<DerivedType const*
>(
this)->dereference();
\n
\n+
\n
\n-
338 inline Float128 scalbln(
const Float128& u,
long int e)
\n-
\n-
340 return Float128{scalblnq(float128_t(u), e)};
\n+
\n+
\n+
\n+
340 return &(
static_cast<const DerivedType *
>(
this)->dereference());
\n
\n+
\n
\n-
343 inline Float128 scalbn(
const Float128& u,
int e)
\n-
\n-
345 return Float128{scalbnq(float128_t(u), e)};
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
356 std::enable_if_t<std::is_integral<Int>::value,
int> = 0>
\n-
357 inline Float128 pow(
const Float128& x,
const Int p)
\n-
\n-
359 static const Float128
max_value = FLT128_MAX;
\n-
360 static const Float128
min_value = FLT128_MIN;
\n-
361 static const Float128 inf_value = float128_t{1} / float128_t{0};
\n-
\n-
363 const bool isneg = (x < 0);
\n-
364 const bool isnan = (x != x);
\n-
\n-
\n-
367 if (isnan) {
return x; }
\n-
368 if (isinf) {
return Float128{nanq(
"")}; }
\n-
\n-
370 const Float128 abs_x = (isneg ? -x : x);
\n-
\n-
\n-
373 return (isneg ? -inf_value : +inf_value);
\n-
\n-
375 return Float128(1) / pow(x, Int(-p));
\n-
\n-
\n-
378 if (p == Int(0)) {
return Float128(1); }
\n-
379 if (p == Int(1)) {
return x; }
\n-
\n-
381 return (isneg ? -inf_value : +inf_value);
\n-
\n-
383 if (p == Int(2)) {
return (x * x); }
\n-
384 if (p == Int(3)) {
return ((x * x) * x); }
\n-
385 if (p == Int(4)) {
const Float128 x2 = (x * x);
return (x2 * x2); }
\n-
\n-
387 Float128 result = ((p % Int(2)) != Int(0)) ? x : Float128(1);
\n-
\n-
\n-
\n-
391 while (Int(p2 /= 2) != Int(0)) {
\n-
\n-
\n-
394 const bool has_binary_power = (Int(p2 % Int(2)) != Int(0));
\n-
395 if (has_binary_power)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
406 struct IsNumber<Impl::Float128>
\n-
407 :
public std::true_type {};
\n-
\n-
\n-
\n-
\n-
\n-
413#ifndef NO_STD_NUMERIC_LIMITS_SPECIALIZATION \n-
\n-
415 class numeric_limits<
Dune::Impl::Float128>
\n-
\n-
417 using Float128 = Dune::Impl::Float128;
\n-
418 using float128_t = Dune::Impl::float128_t;
\n-
\n-
\n-
421 static constexpr bool is_specialized =
true;
\n-
422 static constexpr Float128
min() noexcept {
return FLT128_MIN; }
\n-
423 static constexpr Float128
max() noexcept {
return FLT128_MAX; }
\n-
424 static constexpr Float128 lowest() noexcept {
return -FLT128_MAX; }
\n-
425 static constexpr int digits = FLT128_MANT_DIG;
\n-
426 static constexpr int digits10 = 34;
\n-
427 static constexpr int max_digits10 = 36;
\n-
428 static constexpr bool is_signed =
true;
\n-
429 static constexpr bool is_integer =
false;
\n-
430 static constexpr bool is_exact =
false;
\n-
431 static constexpr int radix = 2;
\n-
432 static constexpr Float128 epsilon() noexcept {
return FLT128_EPSILON; }
\n-
433 static constexpr Float128 round_error() noexcept {
return float128_t{0.5}; }
\n-
434 static constexpr int min_exponent = FLT128_MIN_EXP;
\n-
435 static constexpr int min_exponent10 = FLT128_MIN_10_EXP;
\n-
436 static constexpr int max_exponent = FLT128_MAX_EXP;
\n-
437 static constexpr int max_exponent10 = FLT128_MAX_10_EXP;
\n-
438 static constexpr bool has_infinity =
true;
\n-
439 static constexpr bool has_quiet_NaN =
true;
\n-
440 static constexpr bool has_signaling_NaN =
false;
\n-
441 static constexpr float_denorm_style has_denorm = denorm_present;
\n-
442 static constexpr bool has_denorm_loss =
false;
\n-
443 static constexpr Float128 infinity() noexcept {
return float128_t{1}/float128_t{0}; }
\n-
444 static Float128 quiet_NaN() noexcept {
return nanq(
""); }
\n-
445 static constexpr Float128 signaling_NaN() noexcept {
return float128_t{}; }
\n-
446 static constexpr Float128 denorm_min() noexcept {
return FLT128_DENORM_MIN; }
\n-
447 static constexpr bool is_iec559 =
true;
\n-
448 static constexpr bool is_bounded =
false;
\n-
449 static constexpr bool is_modulo =
false;
\n-
450 static constexpr bool traps =
false;
\n-
451 static constexpr bool tinyness_before =
false;
\n-
452 static constexpr float_round_style round_style = round_to_nearest;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
A few common exception classes.
\n-
#define DUNE_BINARY_OP(OP)
Definition debugalign.hh:261
\n-
#define DUNE_UNARY_FUNC(name)
\n-
#define DUNE_ASSIGN_OP(OP)
Definition debugalign.hh:220
\n-
Traits for type conversions and type information.
\n-
Stream & operator>>(Stream &stream, std::tuple< Ts... > &t)
Read a std::tuple.
Definition streamoperators.hh:43
\n-
constexpr auto max
Function object that returns the greater of the given values.
Definition hybridutilities.hh:484
\n-
constexpr auto min
Function object that returns the smaller of the given values.
Definition hybridutilities.hh:506
\n-
std::ostream & operator<<(std::ostream &s, const bigunsignedint< k > &x)
Definition bigunsignedint.hh:278
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
382 template<
class T1,
class V1,
class R1,
class D,
\n+
383 class T2,
class V2,
class R2>
\n+
384 inline typename std::enable_if<std::is_convertible<T2,T1>::value,
bool>::type
\n+
\n+
\n+
\n+
\n+
388 return static_cast<const T1&
>(lhs).equals(
static_cast<const T2&
>(rhs));
\n+
\n+
\n+
\n+
399 template<
class T1,
class V1,
class R1,
class D,
\n+
400 class T2,
class V2,
class R2>
\n+
\n+
402 typename std::enable_if<std::is_convertible<T1,T2>::value && !std::is_convertible<T2,T1>::value,
\n+
\n+
\n+
\n+
\n+
\n+
407 return static_cast<const T2&
>(rhs).equals(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
420 template<
class T1,
class V1,
class R1,
class D,
\n+
421 class T2,
class V2,
class R2>
\n+
422 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
426 return !(lhs == rhs);
\n+
\n+
\n+
\n+
433 template<
class T,
class V,
class R = V&,
class D = std::ptrdiff_t>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
503 return static_cast<DerivedType const*
>(
this)->dereference();
\n+
\n+
\n+
\n+
\n+
\n+
\n+
508 return &(
static_cast<const DerivedType *
>(
this)->dereference());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
518 return static_cast<const DerivedType *
>(
this)->elementAt(n);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
591 template<
class T1,
class V1,
class R1,
class D,
\n+
592 class T2,
class V2,
class R2>
\n+
593 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
597 if(std::is_convertible<T2,T1>::value)
\n+
598 return static_cast<const T1&
>(lhs).equals(
static_cast<const T2&
>(rhs));
\n+
\n+
600 return static_cast<const T2&
>(rhs).equals(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
613 template<
class T1,
class V1,
class R1,
class D,
\n+
614 class T2,
class V2,
class R2>
\n+
615 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
619 if(std::is_convertible<T2,T1>::value)
\n+
620 return !
static_cast<const T1&
>(lhs).equals(
static_cast<const T2&
>(rhs));
\n+
\n+
622 return !
static_cast<const T2&
>(rhs).equals(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
635 template<
class T1,
class V1,
class R1,
class D,
\n+
636 class T2,
class V2,
class R2>
\n+
\n+
\n+
\n+
\n+
\n+
641 if(std::is_convertible<T2,T1>::value)
\n+
642 return static_cast<const T1&
>(lhs).distanceTo(
static_cast<const T2&
>(rhs))>0;
\n+
\n+
644 return static_cast<const T2&
>(rhs).distanceTo(
static_cast<const T1&
>(lhs))<0;
\n+
\n+
\n+
\n+
\n+
658 template<
class T1,
class V1,
class R1,
class D,
\n+
659 class T2,
class V2,
class R2>
\n+
\n+
\n+
\n+
\n+
\n+
664 if(std::is_convertible<T2,T1>::value)
\n+
665 return static_cast<const T1&
>(lhs).distanceTo(
static_cast<const T2&
>(rhs))>=0;
\n+
\n+
667 return static_cast<const T2&
>(rhs).distanceTo(
static_cast<const T1&
>(lhs))<=0;
\n+
\n+
\n+
\n+
\n+
681 template<
class T1,
class V1,
class R1,
class D,
\n+
682 class T2,
class V2,
class R2>
\n+
683 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
687 if(std::is_convertible<T2,T1>::value)
\n+
688 return static_cast<const T1&
>(lhs).distanceTo(
static_cast<const T2&
>(rhs))<0;
\n+
\n+
690 return static_cast<const T2&
>(rhs).distanceTo(
static_cast<const T1&
>(lhs))>0;
\n+
\n+
\n+
\n+
703 template<
class T1,
class V1,
class R1,
class D,
\n+
704 class T2,
class V2,
class R2>
\n+
705 inline typename EnableIfInterOperable<T1,T2,bool>::type
\n+
\n+
\n+
\n+
\n+
709 if(std::is_convertible<T2,T1>::value)
\n+
710 return static_cast<const T1&
>(lhs).distanceTo(
static_cast<const T2&
>(rhs))<=0;
\n+
\n+
712 return static_cast<const T2&
>(rhs).distanceTo(
static_cast<const T1&
>(lhs))>=0;
\n+
\n+
\n+
\n+
725 template<
class T1,
class V1,
class R1,
class D,
\n+
726 class T2,
class V2,
class R2>
\n+
727 inline typename EnableIfInterOperable<T1,T2,D>::type
\n+
\n+
\n+
\n+
\n+
731 if(std::is_convertible<T2,T1>::value)
\n+
732 return -
static_cast<const T1&
>(lhs).distanceTo(
static_cast<const T2&
>(rhs));
\n+
\n+
734 return static_cast<const T2&
>(rhs).distanceTo(
static_cast<const T1&
>(lhs));
\n+
\n+
\n+
\n+
\n+
748 template<
class ProxyType>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
753 noexcept(std::is_nothrow_constructible_v<ProxyType, ProxyType&&>)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
758 noexcept(std::is_nothrow_constructible_v<ProxyType, const ProxyType&>)
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
790 static constexpr auto baseIterator(It&& it)
noexcept \n+
791 ->
decltype(it.baseIterator())
\n+
\n+
793 return it.baseIterator();
\n+
\n+
\n+
\n+
798 static constexpr auto derived(It&& it)
noexcept \n+
799 ->
decltype(it.derived())
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
808 namespace Impl::Concepts {
\n+
\n+
\n+
\n+
\n+
813 struct BaseIterDereferenceOp
\n+
\n+
\n+
816 auto require(
const It& it) ->
decltype(
\n+
817 *(IteratorFacadeAccess::baseIterator(it)),
\n+
\n+
\n+
\n+
\n+
\n+
\n+
824 template<
class It1,
class It2>
\n+
825 auto require(
const It1& it1,
const It2& it2) ->
decltype(
\n+
826 requireConvertible<bool>(it1 == it2)
\n+
\n+
\n+
\n+
830 struct BaseIterEqualsOp
\n+
\n+
832 template<
class It1,
class It2>
\n+
833 auto require(
const It1& it1,
const It2& it2) ->
decltype(
\n+
834 Dune::Concept::requireConvertible<bool>(IteratorFacadeAccess::baseIterator(it1) == IteratorFacadeAccess::baseIterator(it2))
\n+
\n+
\n+
\n+
838 struct BaseIterIncrementOp
\n+
\n+
\n+
841 auto require(It it) ->
decltype(
\n+
842 ++(IteratorFacadeAccess::baseIterator(it))
\n+
\n+
\n+
\n+
846 struct BaseIterDecrementOp
\n+
\n+
\n+
849 auto require(It it) ->
decltype(
\n+
850 --(IteratorFacadeAccess::baseIterator(it))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
858 auto require(It it) ->
decltype(
\n+
859 it += std::declval<D>()
\n+
\n+
\n+
\n+
\n+
864 struct BaseIterAdvanceOp
\n+
\n+
\n+
867 auto require(It it) ->
decltype(
\n+
868 IteratorFacadeAccess::baseIterator(it) += std::declval<D>()
\n+
\n+
\n+
\n+
\n+
873 struct IterDistanceOp
\n+
\n+
875 template<
class It1,
class It2>
\n+
876 auto require(
const It1& it1,
const It2& it2) ->
decltype(
\n+
877 Dune::Concept::requireConvertible<D>(it1 - it2)
\n+
\n+
\n+
\n+
\n+
882 struct BaseIterDistanceOp
\n+
\n+
884 template<
class It1,
class It2>
\n+
885 auto require(
const It1& it1,
const It2& it2) ->
decltype(
\n+
886 Dune::Concept::requireConvertible<D>(IteratorFacadeAccess::baseIterator(it1) - IteratorFacadeAccess::baseIterator(it2))
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1051 template<
class It,
class C,
class V,
class R = V&,
class P = V*,
class D = std::ptrdiff_t>
\n+
\n+
\n+
\n+
1054 static constexpr bool isBidirectional = std::is_convertible_v<C, std::bidirectional_iterator_tag>;
\n+
1055 static constexpr bool isRandomAccess = std::is_convertible_v<C, std::random_access_iterator_tag>;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1097 static_assert(std::is_signed_v<difference_type>,
\n+
1098 "Type used as difference_type must be signed");
\n+
\n+
1100 static_assert(std::is_convertible_v<
decltype(*constDerived),
reference>,
\n+
1101 "Derived class does not implement `*it` or `*(it.baseIterator())` for const `it` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
\n+
1103 "Derived class does not implement `++it`, `++(it.baseIterator())`, or `it+=1` for mutable `it` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
1104 static_assert(std::is_convertible_v<
decltype(constDerived==constDerived),
bool>,
\n+
1105 "Derived class does not implement `it1==it2` or `it1.baseIterator()==it2.baseIterator()` for const `it1` and `it2` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
1106 if constexpr (isBidirectional)
\n+
\n+
1108 "Derived class does not implement `--it`, `--(it.baseIterator())`, or `it-=1` for mutable `it` required by IteratorFacade<..., std::bidirectional_iterator_tag, ...>.");
\n+
1109 if constexpr (isRandomAccess)
\n+
\n+
1111 static_assert(std::is_convertible_v<decltype(derived()+=std::declval<difference_type>()),
DerivedIterator&>,
\n+
1112 "Derived class does not implement `it+=` or `it.baseIterator()+=` for mutable `it` required by IteratorFacade<..., std::random_access_iterator_tag, ...>.");
\n+
1113 static_assert(std::is_convertible_v<
decltype(constDerived-constDerived),
difference_type>,
\n+
1114 "Derived class does not implement `it1-it2` or `it1.baseIterator()-it2.baseIterator()` for const `it1` and `it2` required by IteratorFacade<..., std::random_access_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
\n+
\n+
1119 constexpr decltype(
auto)
operator*()
const \n+
\n+
1121 if constexpr (Dune::models<Impl::Concepts::BaseIterDereferenceOp<reference>,
DerivedIterator>())
\n+
1122 return *(IteratorFacadeAccess::baseIterator(
derived()));
\n+
\n+
\n+
1125 "Derived class does not implement `*it` or `*(it.baseIterator())` for const `it` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1131 if constexpr (std::is_pointer_v<pointer>)
\n+
1132 return std::addressof(*
derived());
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1138 constexpr decltype(
auto)
operator++()
\n+
\n+
1140 if constexpr (Dune::models<Impl::Concepts::BaseIterIncrementOp, DerivedIterator>())
\n+
\n+
1142 ++(IteratorFacadeAccess::baseIterator(
derived()));
\n+
\n+
\n+
1145 else if constexpr (Dune::models<Impl::Concepts::IterAdvanceOp<difference_type>,
DerivedIterator>())
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1152 "Derived class does not implement `++it`, `++(it.baseIterator())`, or `it+=1` for mutable `it` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
\n+
\n+
1168 template<
bool dummy=true, std::enable_if_t<isB
idirectional and dummy,
int> =0>
\n+
\n+
1169 constexpr decltype(
auto)
operator--()
\n+
\n+
1171 if constexpr (Dune::models<Impl::Concepts::BaseIterDecrementOp, DerivedIterator>())
\n+
\n+
1173 --(IteratorFacadeAccess::baseIterator(
derived()));
\n+
\n+
\n+
1176 else if constexpr (Dune::models<Impl::Concepts::IterAdvanceOp<difference_type>,
DerivedIterator>())
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1183 "Derived class does not implement `--it`, `--(it.baseIterator())`, or `it-=1` for mutable `it` required by IteratorFacade<..., std::bidirectional_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
1191 template<
bool dummy=true, std::enable_if_t<isB
idirectional and dummy,
int> =0>
\n+
\n+
\n+
1206 template<
bool dummy=true, std::enable_if_t<isRandomAccess and dummy,
int> =0>
\n+
\n+
\n+
1217 template<
bool dummy=true, std::enable_if_t<isRandomAccess and dummy,
int> =0>
\n+
\n+
\n+
\n+
1220 if constexpr (Dune::models<Impl::Concepts::BaseIterAdvanceOp<difference_type>,
DerivedIterator>())
\n+
\n+
1222 IteratorFacadeAccess::baseIterator(
derived()) += n;
\n+
\n+
\n+
\n+
\n+
1227 "Derived class does not implement `it+=` or `it.baseIterator()+=` for mutable `it` required by IteratorFacade<..., std::random_access_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
1235 template<
bool dummy=true, std::enable_if_t<isRandomAccess and dummy,
int> =0>
\n+
\n+
\n+
1248 template<
bool dummy=true, std::enable_if_t<isRandomAccess and dummy,
int> =0>
\n+
\n+
\n+
1260 template<
bool dummy=true, std::enable_if_t<isRandomAccess and dummy,
int> =0>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
1282 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2>
\n+
\n+
1283 constexpr auto operator==(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1285 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1286 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1287 if constexpr (Dune::models<Impl::Concepts::BaseIterEqualsOp, T1, T2>())
\n+
1288 return IteratorFacadeAccess::baseIterator(derivedIt1) == IteratorFacadeAccess::baseIterator(derivedIt2);
\n+
\n+
\n+
1291 "Derived class does not implement `it1==it2` or `it1.baseIterator()==it2.baseIterator()` for const `it1` and `it2` required by IteratorFacade<..., std::forward_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
1301 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2,
\n+
1302 std::enable_if_t< Dune::models<Impl::Concepts::IterEqualsOp,T1, T2>() ,
int> =0>
\n+
\n+
1303 constexpr bool operator!=(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1305 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1306 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1307 return not(derivedIt1 == derivedIt2);
\n+
\n+
\n+
\n+
1320 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D>
\n+
\n+
1321 constexpr auto operator-(
const IteratorFacade<T1,C,V1,R1,P1,D>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D>& it2)
\n+
\n+
1323 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1324 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1325 if constexpr (Dune::models<Impl::Concepts::BaseIterDistanceOp<D>,T1, T2>())
\n+
1326 return D(IteratorFacadeAccess::baseIterator(derivedIt1) - IteratorFacadeAccess::baseIterator(derivedIt2));
\n+
\n+
\n+
1329 "Derived class does not implement `it1-it2` or `it1.baseIterator()-it2.baseIterator()` for const `it1` and `it2` required by IteratorFacade<..., std::random_access_iterator_tag, ...>.");
\n+
\n+
\n+
\n+
1339 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2,
\n+
1340 std::enable_if_t< Dune::models<Impl::Concepts::IterDistanceOp<D1>,T1, T2>() ,
int> =0>
\n+
\n+
1341 constexpr bool operator<(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1343 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1344 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1345 return (derivedIt1 - derivedIt2) < D1(0);
\n+
\n+
\n+
\n+
1355 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2,
\n+
1356 std::enable_if_t< Dune::models<Impl::Concepts::IterDistanceOp<D1>,T1, T2>() ,
int> =0>
\n+
\n+
1357 constexpr bool operator<=(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1359 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1360 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1361 return (derivedIt1 - derivedIt2) <= D1(0);
\n+
\n+
\n+
\n+
1371 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2,
\n+
1372 std::enable_if_t< Dune::models<Impl::Concepts::IterDistanceOp<D1>,T1, T2>() ,
int> =0>
\n+
\n+
1373 constexpr bool operator>(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1375 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1376 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1377 return (derivedIt1 - derivedIt2) > D1(0);
\n+
\n+
\n+
\n+
1387 template<
class T1,
class T2,
class C,
class V1,
class V2,
class R1,
class R2,
class P1,
class P2,
class D1,
class D2,
\n+
1388 std::enable_if_t< Dune::models<Impl::Concepts::IterDistanceOp<D1>,T1, T2>() ,
int> =0>
\n+
\n+
1389 constexpr bool operator>=(
const IteratorFacade<T1,C,V1,R1,P1,D1>& it1,
const IteratorFacade<T2,C,V2,R2,P2,D2>& it2)
\n+
\n+
1391 const T1& derivedIt1 = IteratorFacadeAccess::derived(it1);
\n+
1392 const T2& derivedIt2 = IteratorFacadeAccess::derived(it2);
\n+
1393 return (derivedIt1 - derivedIt2) >= D1(0);
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
Traits for type conversions and type information.
\n+
Infrastructure for concepts.
\n
bigunsignedint< k > operator-(const bigunsignedint< k > &x, std::uintmax_t y)
Definition bigunsignedint.hh:542
\n-
bigunsignedint< k > operator+(const bigunsignedint< k > &x, std::uintmax_t y)
Definition bigunsignedint.hh:535
\n-
#define DUNE_THROW(E, m)
Definition exceptions.hh:218
\n+
EnableIfInterOperable< T1, T2, bool >::type operator<(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:638
\n+
EnableIfInterOperable< T1, T2, bool >::type operator>(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:684
\n+
EnableIfInterOperable< T1, T2, bool >::type operator<=(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:661
\n+
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition iteratorfacades.hh:238
\n+
EnableIfInterOperable< T1, T2, bool >::type operator>=(const RandomAccessIteratorFacade< T1, V1, R1, D > &lhs, const RandomAccessIteratorFacade< T2, V2, R2, D > &rhs)
Comparison operator.
Definition iteratorfacades.hh:706
\n+
EnableIfInterOperable< T1, T2, bool >::type operator!=(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for inequality.
Definition iteratorfacades.hh:260
\n
\n
Dune namespace.
Definition alignedallocator.hh:13
\n-
T max_value(const AlignedNumber< T, align > &val)
Definition debugalign.hh:494
\n-
T min_value(const AlignedNumber< T, align > &val)
Definition debugalign.hh:500
\n-
Default exception class for range errors.
Definition exceptions.hh:254
\n+
Namespace for concepts.
Definition concept.hh:34
\n+
constexpr bool requireConvertible()
Definition concept.hh:247
\n+
Base class for stl conformant forward iterators.
Definition iteratorfacades.hh:142
\n+
std::forward_iterator_tag iterator_category
Definition iteratorfacades.hh:146
\n+
V * pointer
Definition iteratorfacades.hh:149
\n+
DerivedType & operator++()
Preincrement operator.
Definition iteratorfacades.hh:210
\n+
D DifferenceType
The type of the difference between two positions.
Definition iteratorfacades.hh:191
\n+
R Reference
The type of the reference to the values accessed.
Definition iteratorfacades.hh:196
\n+
Pointer operator->() const
Definition iteratorfacades.hh:204
\n+
T DerivedType
The type of derived iterator.
Definition iteratorfacades.hh:176
\n+
V Value
The type of value accessed through the iterator.
Definition iteratorfacades.hh:181
\n+
typename std::remove_const< V >::type value_type
Definition iteratorfacades.hh:147
\n+
DerivedType operator++(int)
Postincrement operator.
Definition iteratorfacades.hh:217
\n+
V * Pointer
The pointer to the Value.
Definition iteratorfacades.hh:186
\n+
D difference_type
Definition iteratorfacades.hh:148
\n+
Reference operator*() const
Dereferencing operator.
Definition iteratorfacades.hh:199
\n+
R reference
Definition iteratorfacades.hh:150
\n+
Facade class for stl conformant bidirectional iterators.
Definition iteratorfacades.hh:275
\n+
V * pointer
Definition iteratorfacades.hh:282
\n+
typename std::remove_const< V >::type value_type
Definition iteratorfacades.hh:280
\n+
Reference operator*() const
Dereferencing operator.
Definition iteratorfacades.hh:333
\n+
D difference_type
Definition iteratorfacades.hh:281
\n+
T DerivedType
The type of derived iterator.
Definition iteratorfacades.hh:310
\n+
DerivedType & operator--()
Preincrement operator.
Definition iteratorfacades.hh:360
\n+
Pointer operator->() const
Definition iteratorfacades.hh:338
\n+
DerivedType & operator++()
Preincrement operator.
Definition iteratorfacades.hh:344
\n+
V * Pointer
The pointer to the Value.
Definition iteratorfacades.hh:320
\n+
R Reference
The type of the reference to the values accessed.
Definition iteratorfacades.hh:330
\n+
DerivedType operator++(int)
Postincrement operator.
Definition iteratorfacades.hh:351
\n+
std::bidirectional_iterator_tag iterator_category
Definition iteratorfacades.hh:279
\n+
D DifferenceType
The type of the difference between two positions.
Definition iteratorfacades.hh:325
\n+
DerivedType operator--(int)
Postincrement operator.
Definition iteratorfacades.hh:367
\n+
R reference
Definition iteratorfacades.hh:283
\n+
V Value
The type of value accessed through the iterator.
Definition iteratorfacades.hh:315
\n+
Base class for stl conformant forward iterators.
Definition iteratorfacades.hh:435
\n+
typename std::remove_const< V >::type value_type
Definition iteratorfacades.hh:440
\n+
D difference_type
Definition iteratorfacades.hh:441
\n+
DerivedType operator--(int)
Postdecrement operator.
Definition iteratorfacades.hh:558
\n+
V * pointer
Definition iteratorfacades.hh:442
\n+
std::random_access_iterator_tag iterator_category
Definition iteratorfacades.hh:439
\n+
Reference operator*() const
Dereferencing operator.
Definition iteratorfacades.hh:501
\n+
DerivedType & operator++()
Preincrement operator.
Definition iteratorfacades.hh:522
\n+
R reference
Definition iteratorfacades.hh:443
\n+
Pointer operator->() const
Definition iteratorfacades.hh:506
\n+
D DifferenceType
The type of the difference between two positions.
Definition iteratorfacades.hh:493
\n+
DerivedType & operator--()
Predecrement operator.
Definition iteratorfacades.hh:551
\n+
DerivedType & operator-=(DifferenceType n)
Definition iteratorfacades.hh:565
\n+
DerivedType operator+(DifferenceType n) const
Definition iteratorfacades.hh:542
\n+
Reference operator[](DifferenceType n) const
Get the element n positions from the current one.
Definition iteratorfacades.hh:516
\n+
T DerivedType
The type of derived iterator.
Definition iteratorfacades.hh:478
\n+
V * Pointer
The pointer to the Value.
Definition iteratorfacades.hh:488
\n+
DerivedType operator-(DifferenceType n) const
Definition iteratorfacades.hh:571
\n+
DerivedType operator++(int)
Postincrement operator.
Definition iteratorfacades.hh:529
\n+
V Value
The type of value accessed through the iterator.
Definition iteratorfacades.hh:483
\n+
DerivedType & operator+=(DifferenceType n)
Definition iteratorfacades.hh:536
\n+
R Reference
The type of the reference to the values accessed.
Definition iteratorfacades.hh:498
\n+
Helper to mimic a pointer for proxy objects.
Definition iteratorfacades.hh:750
\n+
constexpr ProxyArrowResult(const ProxyType &p) noexcept(std::is_nothrow_constructible_v< ProxyType, const ProxyType & >)
Definition iteratorfacades.hh:757
\n+
constexpr ProxyType * operator->() noexcept
Definition iteratorfacades.hh:767
\n+
constexpr const ProxyType * operator->() const noexcept
Definition iteratorfacades.hh:762
\n+
constexpr ProxyArrowResult(ProxyType &&p) noexcept(std::is_nothrow_constructible_v< ProxyType, ProxyType && >)
Definition iteratorfacades.hh:752
\n+
This class encapsulates access of IteratorFacade.
Definition iteratorfacades.hh:786
\n+
CRTP-Mixing class for stl conformant iterators of given iterator category.
Definition iteratorfacades.hh:1053
\n+
constexpr DerivedIterator operator--(int)
Postdecrement operator.
Definition iteratorfacades.hh:1192
\n+
D difference_type
Definition iteratorfacades.hh:1086
\n+
C iterator_category
Definition iteratorfacades.hh:1082
\n+
IteratorFacade()
Definition iteratorfacades.hh:1095
\n+
constexpr pointer operator->() const
Arrow access to members of referenced value.
Definition iteratorfacades.hh:1129
\n+
pointer Pointer
Definition iteratorfacades.hh:1091
\n+
reference Reference
Definition iteratorfacades.hh:1090
\n+
constexpr DerivedIterator operator+(difference_type n) const
Create iterator incremented by given value.
Definition iteratorfacades.hh:1236
\n+
constexpr DerivedIterator operator++(int)
Postincrement operator.
Definition iteratorfacades.hh:1156
\n+
constexpr DerivedIterator & derived()
Cast of *this to DerivedIterator type.
Definition iteratorfacades.hh:1074
\n+
It DerivedIterator
The derived iterator type.
Definition iteratorfacades.hh:1065
\n+
constexpr DerivedIterator & operator-=(difference_type n)
Decrement iterator by given value.
Definition iteratorfacades.hh:1249
\n+
constexpr decltype(auto) operator--()
Predecrement operator.
Definition iteratorfacades.hh:1169
\n+
R reference
Definition iteratorfacades.hh:1084
\n+
constexpr reference operator[](difference_type n) const
Dereference element with given offset form this iterator.
Definition iteratorfacades.hh:1207
\n+
constexpr const DerivedIterator & derived() const
Cast of *this to const DerivedIterator type.
Definition iteratorfacades.hh:1068
\n+
P pointer
Definition iteratorfacades.hh:1085
\n+
typename std::remove_const< V >::type value_type
Definition iteratorfacades.hh:1083
\n+
value_type Value
Definition iteratorfacades.hh:1089
\n+
constexpr decltype(auto) operator++()
Preincrement operator.
Definition iteratorfacades.hh:1138
\n+
difference_type DifferenceType
Definition iteratorfacades.hh:1092
\n+
constexpr DerivedIterator operator-(difference_type n) const
Create iterator decremented by given value.
Definition iteratorfacades.hh:1261
\n+
Enable typedef if two types are interoperable.
Definition typetraits.hh:81
\n+
template which always yields a false value
Definition typetraits.hh:124
\n
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,46 @@\n dune-common\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bc_\bo_\bm_\bm_\bo_\bn\n-vc.hh File Reference\n-Compatibility header for including