boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-01-19 04:22:09 +00:00
Code Issues Projects Releases Wiki Activity

Factorial coverage.

Browse Source
This commit is contained in:
jzmaddock
2024-03-08 17:51:21 +00:00
parent 47414e9420
commit e945458aa4
1 changed files with 7 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
test/test_factorials.cpp
View File

@@ -309,6 +309,13 @@ void test_spots(T)
BOOST_CHECK_CLOSE(::boost::math::falling_factorial(ldexp(static_cast<T>(1), -300), 200), static_cast<T>(-1.93579759151806711025267355739174942986011285920860098569075e282L), 10 * tolerance); BOOST_CHECK_CLOSE(::boost::math::falling_factorial(ldexp(static_cast<T>(1), -300), 200), static_cast<T>(-1.93579759151806711025267355739174942986011285920860098569075e282L), 10 * tolerance);
} }
// for coverage:
BOOST_MATH_IF_CONSTEXPR(std::numeric_limits<T>::has_infinity && (std::numeric_limits<T>::max_exponent <= std::numeric_limits<double>::max_exponent))
{
BOOST_CHECK_EQUAL(::boost::math::falling_factorial(boost::math::tools::epsilon<T>(), 200), -std::numeric_limits<T>::infinity());
}
tolerance = boost::math::tools::epsilon<T>() * 100 * 20; // 20 eps as a percent. tolerance = boost::math::tools::epsilon<T>() * 100 * 20; // 20 eps as a percent.
unsigned i = boost::math::max_factorial<T>::value; unsigned i = boost::math::max_factorial<T>::value;