UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-01-19 00:37:25 +01:00
Code Issues Packages Projects Releases Wiki Activity

[poincare] Avoid infinite loop in binomial/permute coefficients

Browse Source 
Change-Id: I528bf2a4fcfb269511aa9128990807524e9c3945
This commit is contained in:
Émilie Feral
2017-12-04 17:46:41 +01:00
parent 1edd7ac095
commit 9efba84ba9
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
poincare/src/binomial_coefficient.cpp
View File

@@ -100,7 +100,7 @@ Expression * BinomialCoefficient::templatedApproximate(Context& context, AngleUn
T result = 1;
for (int i = 0; i < k; i++) {
result *= (n-(T)i)/(k-(T)i);
if (std::isinf(result)) {
if (std::isinf(result) || std::isnan(result)) {
return new Complex<T>(Complex<T>::Float(result));
}
}

2
poincare/src/permute_coefficient.cpp
View File

@@ -87,7 +87,7 @@ Complex<T> * PermuteCoefficient::templatedApproximate(Context& context, AngleUni
T result = 1;
for (int i = (int)n-(int)k+1; i <= (int)n; i++) {
result *= i;
if (std::isinf(result)) {
if (std::isinf(result) || std::isnan(result)) {
return new Complex<T>(Complex<T>::Float(result));
}
}