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

No long double policy: Fix falling_factorial calls in factorials.hpp

Browse Source
This commit is contained in:
jzmaddock
2020-07-20 09:28:40 +01:00
parent 2de2aeb7de
commit 0404e838e2
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/boost/math/special_functions/factorials.hpp
View File

@@ -187,13 +187,13 @@ inline T falling_factorial_imp(T x, unsigned n, const Policy& pol)
{
// If the two end of the range are far apart we have a ratio of two very large
// numbers, split the calculation up into two blocks:
T t1 = x * boost::math::falling_factorial(x - 1, max_factorial<T>::value - 2);
T t2 = boost::math::falling_factorial(x - max_factorial<T>::value + 1, n - max_factorial<T>::value + 1);
T t1 = x * boost::math::falling_factorial(x - 1, max_factorial<T>::value - 2, pol);
T t2 = boost::math::falling_factorial(x - max_factorial<T>::value + 1, n - max_factorial<T>::value + 1, pol);
if(tools::max_value<T>() / fabs(t1) < fabs(t2))
return boost::math::sign(t1) * boost::math::sign(t2) * policies::raise_overflow_error<T>("boost::math::falling_factorial<%1%>", 0, pol);
return t1 * t2;
}
return x * boost::math::falling_factorial(x - 1, n - 1);
return x * boost::math::falling_factorial(x - 1, n - 1, pol);
}
if(x <= n - 1)
{