tboudreaux/SERiF
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor(thetaSeriesExpansion): marked parameters as const

Browse Source
This commit is contained in:
Emily Boudreaux
2025-04-21 09:09:09 -04:00
parent 513e90b7a0
commit 1af5bd00a2
2 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/poly/solver/private/polySolver.cpp
View File

@@ -41,14 +41,14 @@
namespace laneEmden { namespace laneEmden {
double a (int k, double n) { // NOLINT(*-no-recursion) double a (const int k, const double n) { // NOLINT(*-no-recursion)
if ( k == 0 ) { return 1; } if ( k == 0 ) { return 1; }
if ( k == 1 ) { return 0; } if ( k == 1 ) { return 0; }
else { return -(c(k-2, n)/(std::pow(k, 2)+k)); } else { return -(c(k-2, n)/(std::pow(k, 2)+k)); }
} }
double c(int m, double n) { // NOLINT(*-no-recursion) double c(const int m, const double n) { // NOLINT(*-no-recursion)
if ( m == 0 ) { return std::pow(a(0, n), n); } if ( m == 0 ) { return std::pow(a(0, n), n); }
else { else {
double termOne = 1.0/(m*a(0, n)); double termOne = 1.0/(m*a(0, n));
@@ -60,7 +60,7 @@ namespace laneEmden {
} }
} }
double thetaSeriesExpansion(double xi, double n, int order) { double thetaSeriesExpansion(const double xi, const double n, const int order) {
double acc = 0; double acc = 0;
for (int k = 0; k < order; k++) { for (int k = 0; k < order; k++) {
acc += a(k, n) * std::pow(xi, k); acc += a(k, n) * std::pow(xi, k);

6
src/poly/solver/public/polySolver.h
View File

@@ -33,9 +33,9 @@
namespace laneEmden { namespace laneEmden {
double a (int k, double n); double a (const int k, const double n);
double c(int m, double n); double c(const int m, const double n);
double thetaSeriesExpansion(double xi, double n, int order); double thetaSeriesExpansion(const double xi, const double n, const int order);
} }
// Struct to persist lifetime of the linear and nonlinear solvers // Struct to persist lifetime of the linear and nonlinear solvers