From: Wolfgang Bangerth Date: Fri, 2 Oct 2020 21:52:24 +0000 (-0600) Subject: Use the correct English terminology: factorial. X-Git-Tag: v9.3.0-rc1~1041^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=refs%2Fpull%2F10998%2Fhead;p=dealii.git Use the correct English terminology: factorial. --- diff --git a/source/base/polynomial.cc b/source/base/polynomial.cc index cbb7bffbdd..7bf897c29b 100644 --- a/source/base/polynomial.cc +++ b/source/base/polynomial.cc @@ -149,11 +149,11 @@ namespace Polynomials // multiply derivatives by k! to transform the product p_n = // p^(n)(x)/k! into the actual form of the derivative { - number k_faculty = 1; + number k_factorial = 1; for (unsigned int k = 0; k <= n_derivatives; ++k) { - values[k] *= k_faculty * weight; - k_faculty *= static_cast(k + 1); + values[k] *= k_factorial * weight; + k_factorial *= static_cast(k + 1); } } break; @@ -226,7 +226,7 @@ namespace Polynomials // scheme const unsigned int m = coefficients.size(); std::vector a(coefficients); - unsigned int j_faculty = 1; + unsigned int j_factorial = 1; // loop over all requested derivatives. note that derivatives @p{j>m} are // necessarily zero, as they differentiate the polynomial more often than @@ -236,9 +236,9 @@ namespace Polynomials { for (int k = m - 2; k >= static_cast(j); --k) a[k] += x * a[k + 1]; - values[j] = static_cast(j_faculty) * a[j]; + values[j] = static_cast(j_factorial) * a[j]; - j_faculty *= j + 1; + j_factorial *= j + 1; } // fill higher derivatives by zero