mirror/eigen
2
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2024-12-27 07:29:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

Augment NumTraits with min/max_exponent().

Browse Source 
Replace usage of `std::numeric_limits<...>::min/max_exponent` in
codebase.  Also replaced some other `numeric_limits` usages in
affected tests with the `NumTraits` equivalent.

Fixes #2148
This commit is contained in:
Antonio Sanchez 2021-02-12 13:14:05 -08:00 committed by Rasmus Munk Larsen
parent 9fb7062440
commit 75ce9cd2a7
6 changed files with 74 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
Eigen/src/Core/NumTraits.h
View File

@ -135,9 +135,18 @@ EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Tgt bit_cast(const Src& src) {
* \li A dummy_precision() function returning a weak epsilon value. It is mainly used as a default * \li A dummy_precision() function returning a weak epsilon value. It is mainly used as a default
* value by the fuzzy comparison operators. * value by the fuzzy comparison operators.
* \li highest() and lowest() functions returning the highest and lowest possible values respectively. * \li highest() and lowest() functions returning the highest and lowest possible values respectively.
* \li digits() function returning the number of radix digits (non-sign digits for integers, mantissa for floating-point). This is
* the analogue of <a href="http://en.cppreference.com/w/cpp/types/numeric_limits/digits">std::numeric_limits<T>::digits</a>
* which is used as the default implementation if specialized.
* \li digits10() function returning the number of decimal digits that can be represented without change. This is * \li digits10() function returning the number of decimal digits that can be represented without change. This is
* the analogue of <a href="http://en.cppreference.com/w/cpp/types/numeric_limits/digits10">std::numeric_limits<T>::digits10</a> * the analogue of <a href="http://en.cppreference.com/w/cpp/types/numeric_limits/digits10">std::numeric_limits<T>::digits10</a>
* which is used as the default implementation if specialized. * which is used as the default implementation if specialized.
* \li min_exponent() and max_exponent() functions returning the highest and lowest possible values, respectively,
* such that the radix raised to the power exponent-1 is a normalized floating-point number. These are equivalent to
* <a href="http://en.cppreference.com/w/cpp/types/numeric_limits/min_exponent">std::numeric_limits<T>::min_exponent</a>/
* <a href="http://en.cppreference.com/w/cpp/types/numeric_limits/max_exponent">std::numeric_limits<T>::max_exponent</a>.
* \li infinity() function returning a representation of positive infinity, if available.
* \li quiet_NaN function returning a non-signaling "not-a-number", if available.
*/ */
template<typename T> struct GenericNumTraits template<typename T> struct GenericNumTraits
@ -179,6 +188,18 @@ template<typename T> struct GenericNumTraits
return internal::default_digits_impl<T>::run(); return internal::default_digits_impl<T>::run();
} }
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
static inline int min_exponent()
{
return numext::numeric_limits<T>::min_exponent;
}
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
static inline int max_exponent()
{
return numext::numeric_limits<T>::max_exponent;
}
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
static inline Real dummy_precision() static inline Real dummy_precision()
{ {
@ -186,7 +207,6 @@ template<typename T> struct GenericNumTraits
return Real(0); return Real(0);
} }
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR
static inline T highest() { static inline T highest() {
return (numext::numeric_limits<T>::max)(); return (numext::numeric_limits<T>::max)();

6
Eigen/src/Core/StableNorm.h
View File

@ -134,9 +134,9 @@ blueNorm_impl(const EigenBase<Derived>& _vec)
// statements can be replaced // statements can be replaced
static const int ibeta = std::numeric_limits<RealScalar>::radix; // base for floating-point numbers static const int ibeta = std::numeric_limits<RealScalar>::radix; // base for floating-point numbers
static const int it = NumTraits<RealScalar>::digits(); // number of base-beta digits in mantissa static const int it = NumTraits<RealScalar>::digits(); // number of base-beta digits in mantissa
static const int iemin = std::numeric_limits<RealScalar>::min_exponent; // minimum exponent static const int iemin = NumTraits<RealScalar>::min_exponent(); // minimum exponent
static const int iemax = std::numeric_limits<RealScalar>::max_exponent; // maximum exponent static const int iemax = NumTraits<RealScalar>::max_exponent(); // maximum exponent
static const RealScalar rbig = (std::numeric_limits<RealScalar>::max)(); // largest floating-point number static const RealScalar rbig = NumTraits<RealScalar>::highest(); // largest floating-point number
static const RealScalar b1 = RealScalar(pow(RealScalar(ibeta),RealScalar(-((1-iemin)/2)))); // lower boundary of midrange static const RealScalar b1 = RealScalar(pow(RealScalar(ibeta),RealScalar(-((1-iemin)/2)))); // lower boundary of midrange
static const RealScalar b2 = RealScalar(pow(RealScalar(ibeta),RealScalar((iemax + 1 - it)/2))); // upper boundary of midrange static const RealScalar b2 = RealScalar(pow(RealScalar(ibeta),RealScalar((iemax + 1 - it)/2))); // upper boundary of midrange
static const RealScalar s1m = RealScalar(pow(RealScalar(ibeta),RealScalar((2-iemin)/2))); // scaling factor for lower range static const RealScalar s1m = RealScalar(pow(RealScalar(ibeta),RealScalar((2-iemin)/2))); // scaling factor for lower range

14
Eigen/src/Core/arch/Default/GenericPacketMathFunctions.h
View File

@ -36,7 +36,7 @@ template<typename Packet> EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC
Packet pfrexp_generic_get_biased_exponent(const Packet& a) { Packet pfrexp_generic_get_biased_exponent(const Packet& a) {
typedef typename unpacket_traits<Packet>::type Scalar; typedef typename unpacket_traits<Packet>::type Scalar;
typedef typename unpacket_traits<Packet>::integer_packet PacketI; typedef typename unpacket_traits<Packet>::integer_packet PacketI;
enum { mantissa_bits = numext::numeric_limits<Scalar>::digits - 1}; enum { mantissa_bits = NumTraits<Scalar>::digits() - 1};
return pcast<PacketI, Packet>(plogical_shift_right<mantissa_bits>(preinterpret<PacketI>(pabs(a)))); return pcast<PacketI, Packet>(plogical_shift_right<mantissa_bits>(preinterpret<PacketI>(pabs(a))));
} }
@ -48,7 +48,7 @@ Packet pfrexp_generic(const Packet& a, Packet& exponent) {
typedef typename make_unsigned<typename make_integer<Scalar>::type>::type ScalarUI; typedef typename make_unsigned<typename make_integer<Scalar>::type>::type ScalarUI;
enum { enum {
TotalBits = sizeof(Scalar) * CHAR_BIT, TotalBits = sizeof(Scalar) * CHAR_BIT,
MantissaBits = numext::numeric_limits<Scalar>::digits - 1, MantissaBits = NumTraits<Scalar>::digits() - 1,
ExponentBits = int(TotalBits) - int(MantissaBits) - 1 ExponentBits = int(TotalBits) - int(MantissaBits) - 1
}; };
@ -116,7 +116,7 @@ Packet pldexp_generic(const Packet& a, const Packet& exponent) {
typedef typename unpacket_traits<PacketI>::type ScalarI; typedef typename unpacket_traits<PacketI>::type ScalarI;
enum { enum {
TotalBits = sizeof(Scalar) * CHAR_BIT, TotalBits = sizeof(Scalar) * CHAR_BIT,
MantissaBits = numext::numeric_limits<Scalar>::digits - 1, MantissaBits = NumTraits<Scalar>::digits() - 1,
ExponentBits = int(TotalBits) - int(MantissaBits) - 1 ExponentBits = int(TotalBits) - int(MantissaBits) - 1
}; };
@ -135,7 +135,7 @@ Packet pldexp_generic(const Packet& a, const Packet& exponent) {
// Explicitly multiplies // Explicitly multiplies
// a * (2^e) // a * (2^e)
// clamping e to the range // clamping e to the range
// [numeric_limits<Scalar>::min_exponent-2, numeric_limits<Scalar>::max_exponent] // [NumTraits<Scalar>::min_exponent()-2, NumTraits<Scalar>::max_exponent()]
// //
// This is approx 7x faster than pldexp_impl, but will prematurely over/underflow // This is approx 7x faster than pldexp_impl, but will prematurely over/underflow
// if 2^e doesn't fit into a normal floating-point Scalar. // if 2^e doesn't fit into a normal floating-point Scalar.
@ -148,7 +148,7 @@ struct pldexp_fast_impl {
typedef typename unpacket_traits<PacketI>::type ScalarI; typedef typename unpacket_traits<PacketI>::type ScalarI;
enum { enum {
TotalBits = sizeof(Scalar) * CHAR_BIT, TotalBits = sizeof(Scalar) * CHAR_BIT,
MantissaBits = numext::numeric_limits<Scalar>::digits - 1, MantissaBits = NumTraits<Scalar>::digits() - 1,
ExponentBits = int(TotalBits) - int(MantissaBits) - 1 ExponentBits = int(TotalBits) - int(MantissaBits) - 1
}; };
@ -1480,8 +1480,8 @@ Packet generic_pow(const Packet& x, const Packet& y) {
const Packet y_is_nan = pandnot(ptrue(y), pcmp_eq(y, y)); const Packet y_is_nan = pandnot(ptrue(y), pcmp_eq(y, y));
const Packet abs_y_is_inf = pcmp_eq(pabs(y), cst_pos_inf); const Packet abs_y_is_inf = pcmp_eq(pabs(y), cst_pos_inf);
EIGEN_CONSTEXPR Scalar huge_exponent = EIGEN_CONSTEXPR Scalar huge_exponent =
(std::numeric_limits<Scalar>::max_exponent * Scalar(EIGEN_LN2)) / (NumTraits<Scalar>::max_exponent() * Scalar(EIGEN_LN2)) /
std::numeric_limits<Scalar>::epsilon(); NumTraits<Scalar>::epsilon();
const Packet abs_y_is_huge = pcmp_le(pset1<Packet>(huge_exponent), pabs(y)); const Packet abs_y_is_huge = pcmp_le(pset1<Packet>(huge_exponent), pabs(y));
// Predicates for whether y is integer and/or even. // Predicates for whether y is integer and/or even.

12
bench/bench_norm.cpp
View File

@ -111,12 +111,12 @@ EIGEN_DONT_INLINE typename T::Scalar pblueNorm(const T& v)
int nbig, ibeta, it, iemin, iemax, iexp; int nbig, ibeta, it, iemin, iemax, iexp;
Scalar abig, eps; Scalar abig, eps;
nbig = std::numeric_limits<int>::max(); // largest integer nbig = NumTraits<int>::highest(); // largest integer
ibeta = std::numeric_limits<Scalar>::radix; //NumTraits<Scalar>::Base; // base for floating-point numbers ibeta = std::numeric_limits<Scalar>::radix; // NumTraits<Scalar>::Base; // base for floating-point numbers
it = std::numeric_limits<Scalar>::digits; //NumTraits<Scalar>::Mantissa; // number of base-beta digits in mantissa it = NumTraits<Scalar>::digits(); // NumTraits<Scalar>::Mantissa; // number of base-beta digits in mantissa
iemin = std::numeric_limits<Scalar>::min_exponent; // minimum exponent iemin = NumTraits<Scalar>::min_exponent(); // minimum exponent
iemax = std::numeric_limits<Scalar>::max_exponent; // maximum exponent iemax = NumTraits<Scalar>::max_exponent(); // maximum exponent
rbig = std::numeric_limits<Scalar>::max(); // largest floating-point number rbig = NumTraits<Scalar>::highest(); // largest floating-point number
// Check the basic machine-dependent constants. // Check the basic machine-dependent constants.
if(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5) if(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5)

10
test/array_cwise.cpp
View File

@ -14,18 +14,18 @@
template<typename Scalar> template<typename Scalar>
void pow_test() { void pow_test() {
const Scalar zero = Scalar(0); const Scalar zero = Scalar(0);
const Scalar eps = std::numeric_limits<Scalar>::epsilon(); const Scalar eps = Eigen::NumTraits<Scalar>::epsilon();
const Scalar one = Scalar(1); const Scalar one = Scalar(1);
const Scalar two = Scalar(2); const Scalar two = Scalar(2);
const Scalar three = Scalar(3); const Scalar three = Scalar(3);
const Scalar sqrt_half = Scalar(std::sqrt(0.5)); const Scalar sqrt_half = Scalar(std::sqrt(0.5));
const Scalar sqrt2 = Scalar(std::sqrt(2)); const Scalar sqrt2 = Scalar(std::sqrt(2));
const Scalar inf = std::numeric_limits<Scalar>::infinity(); const Scalar inf = Eigen::NumTraits<Scalar>::infinity();
const Scalar nan = std::numeric_limits<Scalar>::quiet_NaN(); const Scalar nan = Eigen::NumTraits<Scalar>::quiet_NaN();
const Scalar denorm_min = std::numeric_limits<Scalar>::denorm_min(); const Scalar denorm_min = std::numeric_limits<Scalar>::denorm_min();
const Scalar min = (std::numeric_limits<Scalar>::min)(); const Scalar min = (std::numeric_limits<Scalar>::min)();
const Scalar max = (std::numeric_limits<Scalar>::max)(); const Scalar max = (std::numeric_limits<Scalar>::max)();
const Scalar max_exp = (static_cast<Scalar>(int(std::numeric_limits<Scalar>::max_exponent)) * Scalar(EIGEN_LN2)) / eps; const Scalar max_exp = (static_cast<Scalar>(int(Eigen::NumTraits<Scalar>::max_exponent())) * Scalar(EIGEN_LN2)) / eps;
const static Scalar abs_vals[] = {zero, const static Scalar abs_vals[] = {zero,
denorm_min, denorm_min,
@ -613,7 +613,7 @@ template<typename ArrayType> void min_max(const ArrayType& m)
// min/max with various NaN propagation options. // min/max with various NaN propagation options.
if (m1.size() > 1 && !NumTraits<Scalar>::IsInteger) { if (m1.size() > 1 && !NumTraits<Scalar>::IsInteger) {
m1(0,0) = std::numeric_limits<Scalar>::quiet_NaN(); m1(0,0) = NumTraits<Scalar>::quiet_NaN();
maxM1 = m1.template maxCoeff<PropagateNaN>(); maxM1 = m1.template maxCoeff<PropagateNaN>();
minM1 = m1.template minCoeff<PropagateNaN>(); minM1 = m1.template minCoeff<PropagateNaN>();
VERIFY((numext::isnan)(maxM1)); VERIFY((numext::isnan)(maxM1));

64
test/packetmath.cpp
View File

@ -273,7 +273,7 @@ void packetmath_boolean_mask_ops() {
//Test NaN //Test NaN
for (int i = 0; i < PacketSize; ++i) { for (int i = 0; i < PacketSize; ++i) {
data1[i] = std::numeric_limits<Scalar>::quiet_NaN(); data1[i] = NumTraits<Scalar>::quiet_NaN();
data1[i + PacketSize] = internal::random<bool>() ? data1[i] : Scalar(0); data1[i + PacketSize] = internal::random<bool>() ? data1[i] : Scalar(0);
} }
CHECK_CWISE2_IF(true, internal::pcmp_eq, internal::pcmp_eq); CHECK_CWISE2_IF(true, internal::pcmp_eq, internal::pcmp_eq);
@ -634,7 +634,7 @@ void packetmath_real() {
if (PacketTraits::HasExp) { if (PacketTraits::HasExp) {
// Check denormals: // Check denormals:
for (int j=0; j<3; ++j) { for (int j=0; j<3; ++j) {
data1[0] = Scalar(std::ldexp(1, std::numeric_limits<Scalar>::min_exponent-j)); data1[0] = Scalar(std::ldexp(1, NumTraits<Scalar>::min_exponent()-j));
CHECK_CWISE1_BYREF1_IF(PacketTraits::HasExp, REF_FREXP, internal::pfrexp); CHECK_CWISE1_BYREF1_IF(PacketTraits::HasExp, REF_FREXP, internal::pfrexp);
data1[0] = -data1[0]; data1[0] = -data1[0];
CHECK_CWISE1_BYREF1_IF(PacketTraits::HasExp, REF_FREXP, internal::pfrexp); CHECK_CWISE1_BYREF1_IF(PacketTraits::HasExp, REF_FREXP, internal::pfrexp);
@ -671,10 +671,10 @@ void packetmath_real() {
if (PacketTraits::HasExp) { if (PacketTraits::HasExp) {
data1[0] = Scalar(-1); data1[0] = Scalar(-1);
// underflow to zero // underflow to zero
data1[PacketSize] = Scalar(std::numeric_limits<Scalar>::min_exponent-55); data1[PacketSize] = Scalar(NumTraits<Scalar>::min_exponent()-55);
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
// overflow to inf // overflow to inf
data1[PacketSize] = Scalar(std::numeric_limits<Scalar>::max_exponent+10); data1[PacketSize] = Scalar(NumTraits<Scalar>::max_exponent()+10);
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
// NaN stays NaN // NaN stays NaN
data1[0] = NumTraits<Scalar>::quiet_NaN(); data1[0] = NumTraits<Scalar>::quiet_NaN();
@ -682,21 +682,21 @@ void packetmath_real() {
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
// inf stays inf // inf stays inf
data1[0] = NumTraits<Scalar>::infinity(); data1[0] = NumTraits<Scalar>::infinity();
data1[PacketSize] = Scalar(std::numeric_limits<Scalar>::min_exponent-10); data1[PacketSize] = Scalar(NumTraits<Scalar>::min_exponent()-10);
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
// zero stays zero // zero stays zero
data1[0] = Scalar(0); data1[0] = Scalar(0);
data1[PacketSize] = Scalar(std::numeric_limits<Scalar>::max_exponent+10); data1[PacketSize] = Scalar(NumTraits<Scalar>::max_exponent()+10);
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
// Small number big exponent. // Small number big exponent.
data1[0] = Scalar(std::ldexp(Scalar(1.0), std::numeric_limits<Scalar>::min_exponent-1)); data1[0] = Scalar(std::ldexp(Scalar(1.0), NumTraits<Scalar>::min_exponent()-1));
data1[PacketSize] = Scalar(-std::numeric_limits<Scalar>::min_exponent data1[PacketSize] = Scalar(-NumTraits<Scalar>::min_exponent()
+std::numeric_limits<Scalar>::max_exponent); +NumTraits<Scalar>::max_exponent());
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
// Big number small exponent. // Big number small exponent.
data1[0] = Scalar(std::ldexp(Scalar(1.0), std::numeric_limits<Scalar>::max_exponent-1)); data1[0] = Scalar(std::ldexp(Scalar(1.0), NumTraits<Scalar>::max_exponent()-1));
data1[PacketSize] = Scalar(+std::numeric_limits<Scalar>::min_exponent data1[PacketSize] = Scalar(+NumTraits<Scalar>::min_exponent()
-std::numeric_limits<Scalar>::max_exponent); -NumTraits<Scalar>::max_exponent());
CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp); CHECK_CWISE2_IF(PacketTraits::HasExp, REF_LDEXP, internal::pldexp);
} }
@ -707,8 +707,8 @@ void packetmath_real() {
data1[0] = Scalar(1e-20); data1[0] = Scalar(1e-20);
CHECK_CWISE1_IF(PacketTraits::HasTanh, std::tanh, internal::ptanh); CHECK_CWISE1_IF(PacketTraits::HasTanh, std::tanh, internal::ptanh);
if (PacketTraits::HasExp && PacketSize >= 2) { if (PacketTraits::HasExp && PacketSize >= 2) {
const Scalar small = std::numeric_limits<Scalar>::epsilon(); const Scalar small = NumTraits<Scalar>::epsilon();
data1[0] = std::numeric_limits<Scalar>::quiet_NaN(); data1[0] = NumTraits<Scalar>::quiet_NaN();
data1[1] = small; data1[1] = small;
test::packet_helper<PacketTraits::HasExp, Packet> h; test::packet_helper<PacketTraits::HasExp, Packet> h;
h.store(data2, internal::pexp(h.load(data1))); h.store(data2, internal::pexp(h.load(data1)));
@ -742,7 +742,7 @@ void packetmath_real() {
if (PacketTraits::HasTanh) { if (PacketTraits::HasTanh) {
// NOTE this test migh fail with GCC prior to 6.3, see MathFunctionsImpl.h for details. // NOTE this test migh fail with GCC prior to 6.3, see MathFunctionsImpl.h for details.
data1[0] = std::numeric_limits<Scalar>::quiet_NaN(); data1[0] = NumTraits<Scalar>::quiet_NaN();
test::packet_helper<internal::packet_traits<Scalar>::HasTanh, Packet> h; test::packet_helper<internal::packet_traits<Scalar>::HasTanh, Packet> h;
h.store(data2, internal::ptanh(h.load(data1))); h.store(data2, internal::ptanh(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
@ -762,17 +762,17 @@ void packetmath_real() {
} }
#if EIGEN_HAS_C99_MATH && (EIGEN_COMP_CXXVER >= 11) #if EIGEN_HAS_C99_MATH && (EIGEN_COMP_CXXVER >= 11)
data1[0] = std::numeric_limits<Scalar>::infinity(); data1[0] = NumTraits<Scalar>::infinity();
data1[1] = Scalar(-1); data1[1] = Scalar(-1);
CHECK_CWISE1_IF(PacketTraits::HasLog1p, std::log1p, internal::plog1p); CHECK_CWISE1_IF(PacketTraits::HasLog1p, std::log1p, internal::plog1p);
data1[0] = std::numeric_limits<Scalar>::infinity(); data1[0] = NumTraits<Scalar>::infinity();
data1[1] = -std::numeric_limits<Scalar>::infinity(); data1[1] = -NumTraits<Scalar>::infinity();
CHECK_CWISE1_IF(PacketTraits::HasExpm1, std::expm1, internal::pexpm1); CHECK_CWISE1_IF(PacketTraits::HasExpm1, std::expm1, internal::pexpm1);
#endif #endif
if (PacketSize >= 2) { if (PacketSize >= 2) {
data1[0] = std::numeric_limits<Scalar>::quiet_NaN(); data1[0] = NumTraits<Scalar>::quiet_NaN();
data1[1] = std::numeric_limits<Scalar>::epsilon(); data1[1] = NumTraits<Scalar>::epsilon();
if (PacketTraits::HasLog) { if (PacketTraits::HasLog) {
test::packet_helper<PacketTraits::HasLog, Packet> h; test::packet_helper<PacketTraits::HasLog, Packet> h;
h.store(data2, internal::plog(h.load(data1))); h.store(data2, internal::plog(h.load(data1)));
@ -782,7 +782,7 @@ void packetmath_real() {
VERIFY_IS_APPROX(std::log(data1[1]), data2[1]); VERIFY_IS_APPROX(std::log(data1[1]), data2[1]);
} }
data1[0] = -std::numeric_limits<Scalar>::epsilon(); data1[0] = -NumTraits<Scalar>::epsilon();
data1[1] = Scalar(0); data1[1] = Scalar(0);
h.store(data2, internal::plog(h.load(data1))); h.store(data2, internal::plog(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
@ -813,14 +813,14 @@ void packetmath_real() {
h.store(data2, internal::plog(h.load(data1))); h.store(data2, internal::plog(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
data1[0] = std::numeric_limits<Scalar>::infinity(); data1[0] = NumTraits<Scalar>::infinity();
h.store(data2, internal::plog(h.load(data1))); h.store(data2, internal::plog(h.load(data1)));
VERIFY((numext::isinf)(data2[0])); VERIFY((numext::isinf)(data2[0]));
} }
if (PacketTraits::HasLog1p) { if (PacketTraits::HasLog1p) {
test::packet_helper<PacketTraits::HasLog1p, Packet> h; test::packet_helper<PacketTraits::HasLog1p, Packet> h;
data1[0] = Scalar(-2); data1[0] = Scalar(-2);
data1[1] = -std::numeric_limits<Scalar>::infinity(); data1[1] = -NumTraits<Scalar>::infinity();
h.store(data2, internal::plog1p(h.load(data1))); h.store(data2, internal::plog1p(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
VERIFY((numext::isnan)(data2[1])); VERIFY((numext::isnan)(data2[1]));
@ -831,7 +831,7 @@ void packetmath_real() {
if (std::numeric_limits<Scalar>::has_denorm == std::denorm_present) { if (std::numeric_limits<Scalar>::has_denorm == std::denorm_present) {
data1[1] = -std::numeric_limits<Scalar>::denorm_min(); data1[1] = -std::numeric_limits<Scalar>::denorm_min();
} else { } else {
data1[1] = -std::numeric_limits<Scalar>::epsilon(); data1[1] = -NumTraits<Scalar>::epsilon();
} }
h.store(data2, internal::psqrt(h.load(data1))); h.store(data2, internal::psqrt(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
@ -842,7 +842,7 @@ void packetmath_real() {
&& !internal::is_same<Scalar, half>::value && !internal::is_same<Scalar, half>::value
&& !internal::is_same<Scalar, bfloat16>::value) { && !internal::is_same<Scalar, bfloat16>::value) {
test::packet_helper<PacketTraits::HasCos, Packet> h; test::packet_helper<PacketTraits::HasCos, Packet> h;
for (Scalar k = Scalar(1); k < Scalar(10000) / std::numeric_limits<Scalar>::epsilon(); k *= Scalar(2)) { for (Scalar k = Scalar(1); k < Scalar(10000) / NumTraits<Scalar>::epsilon(); k *= Scalar(2)) {
for (int k1 = 0; k1 <= 1; ++k1) { for (int k1 = 0; k1 <= 1; ++k1) {
data1[0] = Scalar((2 * double(k) + k1) * double(EIGEN_PI) / 2 * internal::random<double>(0.8, 1.2)); data1[0] = Scalar((2 * double(k) + k1) * double(EIGEN_PI) / 2 * internal::random<double>(0.8, 1.2));
data1[1] = Scalar((2 * double(k) + 2 + k1) * double(EIGEN_PI) / 2 * internal::random<double>(0.8, 1.2)); data1[1] = Scalar((2 * double(k) + 2 + k1) * double(EIGEN_PI) / 2 * internal::random<double>(0.8, 1.2));
@ -863,8 +863,8 @@ void packetmath_real() {
} }
} }
data1[0] = std::numeric_limits<Scalar>::infinity(); data1[0] = NumTraits<Scalar>::infinity();
data1[1] = -std::numeric_limits<Scalar>::infinity(); data1[1] = -NumTraits<Scalar>::infinity();
h.store(data2, internal::psin(h.load(data1))); h.store(data2, internal::psin(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
VERIFY((numext::isnan)(data2[1])); VERIFY((numext::isnan)(data2[1]));
@ -873,7 +873,7 @@ void packetmath_real() {
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
VERIFY((numext::isnan)(data2[1])); VERIFY((numext::isnan)(data2[1]));
data1[0] = std::numeric_limits<Scalar>::quiet_NaN(); data1[0] = NumTraits<Scalar>::quiet_NaN();
h.store(data2, internal::psin(h.load(data1))); h.store(data2, internal::psin(h.load(data1)));
VERIFY((numext::isnan)(data2[0])); VERIFY((numext::isnan)(data2[0]));
h.store(data2, internal::pcos(h.load(data1))); h.store(data2, internal::pcos(h.load(data1)));
@ -997,13 +997,13 @@ void packetmath_notcomplex() {
VERIFY(internal::isApprox(ref[0], internal::predux_max<PropagateNaN>(internal::pload<Packet>(data1))) && "internal::predux_max<PropagateNumbers>"); VERIFY(internal::isApprox(ref[0], internal::predux_max<PropagateNaN>(internal::pload<Packet>(data1))) && "internal::predux_max<PropagateNumbers>");
// A single NaN. // A single NaN.
const size_t index = std::numeric_limits<size_t>::quiet_NaN() % PacketSize; const size_t index = std::numeric_limits<size_t>::quiet_NaN() % PacketSize;
data1[index] = std::numeric_limits<Scalar>::quiet_NaN(); data1[index] = NumTraits<Scalar>::quiet_NaN();
VERIFY(PacketSize==1 || !(numext::isnan)(internal::predux_min<PropagateNumbers>(internal::pload<Packet>(data1)))); VERIFY(PacketSize==1 || !(numext::isnan)(internal::predux_min<PropagateNumbers>(internal::pload<Packet>(data1))));
VERIFY((numext::isnan)(internal::predux_min<PropagateNaN>(internal::pload<Packet>(data1)))); VERIFY((numext::isnan)(internal::predux_min<PropagateNaN>(internal::pload<Packet>(data1))));
VERIFY(PacketSize==1 || !(numext::isnan)(internal::predux_max<PropagateNumbers>(internal::pload<Packet>(data1)))); VERIFY(PacketSize==1 || !(numext::isnan)(internal::predux_max<PropagateNumbers>(internal::pload<Packet>(data1))));
VERIFY((numext::isnan)(internal::predux_max<PropagateNaN>(internal::pload<Packet>(data1)))); VERIFY((numext::isnan)(internal::predux_max<PropagateNaN>(internal::pload<Packet>(data1))));
// All NaNs. // All NaNs.
for (int i = 0; i < 4 * PacketSize; ++i) data1[i] = std::numeric_limits<Scalar>::quiet_NaN(); for (int i = 0; i < 4 * PacketSize; ++i) data1[i] = NumTraits<Scalar>::quiet_NaN();
VERIFY((numext::isnan)(internal::predux_min<PropagateNumbers>(internal::pload<Packet>(data1)))); VERIFY((numext::isnan)(internal::predux_min<PropagateNumbers>(internal::pload<Packet>(data1))));
VERIFY((numext::isnan)(internal::predux_min<PropagateNaN>(internal::pload<Packet>(data1)))); VERIFY((numext::isnan)(internal::predux_min<PropagateNaN>(internal::pload<Packet>(data1))));
VERIFY((numext::isnan)(internal::predux_max<PropagateNumbers>(internal::pload<Packet>(data1)))); VERIFY((numext::isnan)(internal::predux_max<PropagateNumbers>(internal::pload<Packet>(data1))));
@ -1011,8 +1011,8 @@ void packetmath_notcomplex() {
// Test NaN propagation for coefficient-wise min and max. // Test NaN propagation for coefficient-wise min and max.
for (int i = 0; i < PacketSize; ++i) { for (int i = 0; i < PacketSize; ++i) {
data1[i] = internal::random<bool>() ? std::numeric_limits<Scalar>::quiet_NaN() : Scalar(0); data1[i] = internal::random<bool>() ? NumTraits<Scalar>::quiet_NaN() : Scalar(0);
data1[i + PacketSize] = internal::random<bool>() ? std::numeric_limits<Scalar>::quiet_NaN() : Scalar(0); data1[i + PacketSize] = internal::random<bool>() ? NumTraits<Scalar>::quiet_NaN() : Scalar(0);
} }
// Note: NaN propagation is implementation defined for pmin/pmax, so we do not test it here. // Note: NaN propagation is implementation defined for pmin/pmax, so we do not test it here.
CHECK_CWISE2_IF(PacketTraits::HasMin, propagate_number_min, (internal::pmin<PropagateNumbers>)); CHECK_CWISE2_IF(PacketTraits::HasMin, propagate_number_min, (internal::pmin<PropagateNumbers>));