mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2025-08-03 12:49:50 +00:00
workaround for no c++11 numeric_limits
This commit is contained in:
parent
ce16e24637
commit
7a1974742a
110 changed files with 727 additions and 436 deletions
|
@ -1,9 +1,9 @@
|
|||
#ifndef SPROUT_MATH_REMAINDER_HPP
|
||||
#define SPROUT_MATH_REMAINDER_HPP
|
||||
|
||||
#include <limits>
|
||||
#include <type_traits>
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/limits.hpp>
|
||||
#include <sprout/math/detail/config.hpp>
|
||||
#include <sprout/math/isnan.hpp>
|
||||
#include <sprout/math/signbit.hpp>
|
||||
|
@ -20,17 +20,17 @@ namespace sprout {
|
|||
>
|
||||
inline SPROUT_CONSTEXPR FloatType
|
||||
remainder(FloatType x, FloatType y) {
|
||||
return y == 0 ? -std::numeric_limits<FloatType>::quiet_NaN()
|
||||
return y == 0 ? -sprout::numeric_limits<FloatType>::quiet_NaN()
|
||||
: sprout::math::isnan(y)
|
||||
? sprout::math::isnan(x)
|
||||
? sprout::math::signbit(y) && sprout::math::signbit(x) ? -std::numeric_limits<FloatType>::quiet_NaN()
|
||||
: std::numeric_limits<FloatType>::quiet_NaN()
|
||||
? sprout::math::signbit(y) && sprout::math::signbit(x) ? -sprout::numeric_limits<FloatType>::quiet_NaN()
|
||||
: sprout::numeric_limits<FloatType>::quiet_NaN()
|
||||
: y
|
||||
: sprout::math::isnan(x) ? x
|
||||
: x == std::numeric_limits<FloatType>::infinity() || x == -std::numeric_limits<FloatType>::infinity()
|
||||
? -std::numeric_limits<FloatType>::quiet_NaN()
|
||||
: x == sprout::numeric_limits<FloatType>::infinity() || x == -sprout::numeric_limits<FloatType>::infinity()
|
||||
? -sprout::numeric_limits<FloatType>::quiet_NaN()
|
||||
: x == 0 ? x
|
||||
: y == std::numeric_limits<FloatType>::infinity() || y == -std::numeric_limits<FloatType>::infinity() ? x
|
||||
: y == sprout::numeric_limits<FloatType>::infinity() || y == -sprout::numeric_limits<FloatType>::infinity() ? x
|
||||
#if SPROUT_USE_BUILTIN_CMATH_FUNCTION
|
||||
: std::remainder(x, y)
|
||||
#else
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue