From 8c383a100355cf6b2759dfa64db87f873ae77c56 Mon Sep 17 00:00:00 2001 From: Aik-Siong Koh Date: Tue, 17 Oct 2023 07:55:59 -0600 Subject: [PATCH] auto max = 0 to double max = 0.0 --- OndselSolver/Array.h | 18 +++++++++--------- OndselSolver/BasicIntegrator.h | 2 +- OndselSolver/CADSystem.cpp | 2 +- OndselSolver/ConstVelConstraintIqcJc.cpp | 2 +- OndselSolver/ConstVelConstraintIqcJqc.cpp | 2 +- OndselSolver/Constraint.h | 2 +- OndselSolver/DiagonalMatrix.h | 4 ++-- OndselSolver/DifferenceOperator.h | 2 +- OndselSolver/EulerAngleszxzDDot.h | 2 +- OndselSolver/FullMatrix.h | 6 +++--- OndselSolver/FullVector.h | 16 ++++++++-------- OndselSolver/GEFullMatParPv.cpp | 2 +- OndselSolver/GESpMatFullPv.cpp | 4 ++-- OndselSolver/GESpMatFullPvPosIC.cpp | 2 +- OndselSolver/GESpMatParPvMarko.cpp | 2 +- OndselSolver/GESpMatParPvMarkoFast.cpp | 2 +- OndselSolver/GESpMatParPvPrecise.cpp | 2 +- OndselSolver/GeneralSpline.cpp | 22 +++++++++++----------- OndselSolver/IntegratorInterface.h | 2 +- OndselSolver/LDUFullMatParPv.cpp | 2 +- OndselSolver/MatrixSolver.cpp | 2 +- OndselSolver/MomentOfInertiaSolver.cpp | 2 +- OndselSolver/Part.cpp | 10 +++++----- OndselSolver/RowTypeMatrix.h | 4 ++-- OndselSolver/SparseMatrix.h | 4 ++-- OndselSolver/SystemSolver.h | 14 +++++++------- 26 files changed, 67 insertions(+), 67 deletions(-) diff --git a/OndselSolver/Array.h b/OndselSolver/Array.h index 7eed1a7..20fa6e5 100644 --- a/OndselSolver/Array.h +++ b/OndselSolver/Array.h @@ -96,7 +96,7 @@ namespace MbD { //template<> //inline double Array::maxMagnitude() //{ - // auto max = 0.0; + // double max = 0.0; // for (int i = 0; i < this->size(); i++) // { // auto element = this->at(i); @@ -108,10 +108,10 @@ namespace MbD { template inline double Array::maxMagnitudeOfVector() { - auto answer = 0.0; + double answer = 0.0; for (int i = 0; i < this->size(); i++) { - auto mag = std::abs(this->at(i)); + double mag = std::abs(this->at(i)); if (answer < mag) answer = mag; } return answer; @@ -127,15 +127,15 @@ namespace MbD { //template<> //inline void Array::normalizeSelf() //{ - // auto length = this->length(); + // double length = this->length(); // if (length == 0.0) throw std::runtime_error("Cannot normalize a null vector."); // this->magnifySelf(1.0 / length); //} //template<> //inline void Array::conditionSelf() //{ - // constexpr auto epsilon = std::numeric_limits::epsilon(); - // auto tol = maxMagnitude() * epsilon; + // constexpr double epsilon = std::numeric_limits::epsilon(); + // double tol = maxMagnitude() * epsilon; // conditionSelfWithTol(tol); //} //template<> @@ -143,7 +143,7 @@ namespace MbD { //{ // for (int i = 0; i < this->size(); i++) // { - // auto element = this->at(i); + // double element = this->at(i); // if (element < 0.0) element = -element; // if (element < tol) this->atiput(i, 0.0); // } @@ -156,10 +156,10 @@ namespace MbD { //template<> //inline double Array::length() //{ - // auto ssq = 0.0; + // double ssq = 0.0; // for (int i = 0; i < this->size(); i++) // { - // auto elem = this->at(i); + // double elem = this->at(i); // ssq += elem * elem; // } // return std::sqrt(ssq); diff --git a/OndselSolver/BasicIntegrator.h b/OndselSolver/BasicIntegrator.h index 10e0514..8905ad4 100644 --- a/OndselSolver/BasicIntegrator.h +++ b/OndselSolver/BasicIntegrator.h @@ -49,7 +49,7 @@ namespace MbD { IntegratorInterface* system; int istep = 0, iTry = 0, maxTry = 0; std::shared_ptr> tpast; - double t = 0, tnew = 0, h = 0, hnew = 0; + double t = 0.0, tnew = 0.0, h = 0, hnew = 0.0; int order = 0, orderNew = 0, orderMax = 0; std::shared_ptr opBDF; bool _continue = false; diff --git a/OndselSolver/CADSystem.cpp b/OndselSolver/CADSystem.cpp index 6604279..a3e00ff 100644 --- a/OndselSolver/CADSystem.cpp +++ b/OndselSolver/CADSystem.cpp @@ -610,7 +610,7 @@ void CADSystem::runPiston() systemSolver->errorTolAccKine = 1.0e-6; systemSolver->iterMaxPosKine = 25; systemSolver->iterMaxAccKine = 25; - systemSolver->tstart = 0; + systemSolver->tstart = 0.0; systemSolver->tend = 25.0; systemSolver->hmin = 2.5e-8; systemSolver->hmax = 25.0; diff --git a/OndselSolver/ConstVelConstraintIqcJc.cpp b/OndselSolver/ConstVelConstraintIqcJc.cpp index 315453b..992a85c 100644 --- a/OndselSolver/ConstVelConstraintIqcJc.cpp +++ b/OndselSolver/ConstVelConstraintIqcJc.cpp @@ -53,7 +53,7 @@ void MbD::ConstVelConstraintIqcJc::fillAccICIterError(FColDsptr col) col->atiplusFullVectortimes(iqEI, pGpEI, lam); auto efrmIqc = std::static_pointer_cast(frmI); auto qEdotI = efrmIqc->qEdot(); - auto sum = 0.0; + double sum = 0.0; sum += pGpEI->timesFullColumn(efrmIqc->qEddot()); sum += qEdotI->transposeTimesFullColumn(ppGpEIpEI->timesFullColumn(qEdotI)); col->atiplusNumber(iG, sum); diff --git a/OndselSolver/ConstVelConstraintIqcJqc.cpp b/OndselSolver/ConstVelConstraintIqcJqc.cpp index d8fa84e..2a30974 100644 --- a/OndselSolver/ConstVelConstraintIqcJqc.cpp +++ b/OndselSolver/ConstVelConstraintIqcJqc.cpp @@ -67,7 +67,7 @@ void MbD::ConstVelConstraintIqcJqc::fillAccICIterError(FColDsptr col) auto qEdotI = efrmIqc->qEdot(); auto efrmJqc = std::static_pointer_cast(frmJ); auto qEdotJ = efrmJqc->qEdot(); - auto sum = 0.0; + double sum = 0.0; sum += pGpEJ->timesFullColumn(efrmJqc->qEddot()); sum += 2.0 * qEdotI->transposeTimesFullColumn(ppGpEIpEJ->timesFullColumn(qEdotJ)); sum += qEdotJ->transposeTimesFullColumn(ppGpEJpEJ->timesFullColumn(qEdotJ)); diff --git a/OndselSolver/Constraint.h b/OndselSolver/Constraint.h index d470bb4..3063632 100644 --- a/OndselSolver/Constraint.h +++ b/OndselSolver/Constraint.h @@ -51,7 +51,7 @@ namespace MbD { int iG = -1; double aG = 0.0; //Constraint function double lam = 0.0; //Lambda is Lagrange Multiplier - double mu = 0, lamDeriv = 0; + double mu = 0.0, lamDeriv = 0.0; }; } diff --git a/OndselSolver/DiagonalMatrix.h b/OndselSolver/DiagonalMatrix.h index 5d9291e..69c0c28 100644 --- a/OndselSolver/DiagonalMatrix.h +++ b/OndselSolver/DiagonalMatrix.h @@ -121,10 +121,10 @@ namespace MbD { template<> inline double DiagonalMatrix::maxMagnitude() { - auto max = 0.0; + double max = 0.0; for (int i = 0; i < this->size(); i++) { - auto element = this->at(i); + double element = this->at(i); if (element < 0.0) element = -element; if (max < element) max = element; } diff --git a/OndselSolver/DifferenceOperator.h b/OndselSolver/DifferenceOperator.h index c3611a5..e9b02f1 100644 --- a/OndselSolver/DifferenceOperator.h +++ b/OndselSolver/DifferenceOperator.h @@ -28,7 +28,7 @@ namespace MbD { int iStep = 0, order = 0; FMatDsptr taylorMatrix, operatorMatrix; - double time = 0; + double time = 0.0; std::shared_ptr> timeNodes; static FRowDsptr OneOverFactorials; }; diff --git a/OndselSolver/EulerAngleszxzDDot.h b/OndselSolver/EulerAngleszxzDDot.h index 5d7cbe2..69bc344 100644 --- a/OndselSolver/EulerAngleszxzDDot.h +++ b/OndselSolver/EulerAngleszxzDDot.h @@ -40,7 +40,7 @@ namespace MbD { { //| zero phiThePsi phi sphi cphi phidot phiddot cphiddot sphiddot the sthe cthe thedot theddot ctheddot stheddot // psi spsi cpsi psidot psiddot cpsiddot spsiddot phiA theA psiA phiAdot theAdot psiAdot | - auto zero = 0.0; + double zero = 0.0; auto& phiThePsi = phiThePsiDot->phiThePsi; auto& phi = phiThePsi->at(0); auto sphi = std::sin(phi); diff --git a/OndselSolver/FullMatrix.h b/OndselSolver/FullMatrix.h index ac2007a..bc954b5 100644 --- a/OndselSolver/FullMatrix.h +++ b/OndselSolver/FullMatrix.h @@ -619,10 +619,10 @@ namespace MbD { template inline double FullMatrix::maxMagnitude() { - auto max = 0.0; + double max = 0.0; for (int i = 0; i < this->size(); i++) { - auto element = this->at(i)->maxMagnitude(); + double element = this->at(i)->maxMagnitude(); if (max < element) max = element; } return max; @@ -683,7 +683,7 @@ namespace MbD { template inline bool FullMatrix::isDiagonalToWithin(double ratio) { - auto maxMag = this->maxMagnitude(); + double maxMag = this->maxMagnitude(); auto tol = ratio * maxMag; auto nrow = this->nrow(); if (nrow == this->ncol()) { diff --git a/OndselSolver/FullVector.h b/OndselSolver/FullVector.h index 5e1f9ba..228145b 100644 --- a/OndselSolver/FullVector.h +++ b/OndselSolver/FullVector.h @@ -125,10 +125,10 @@ namespace MbD { template<> inline double FullVector::maxMagnitude() { - auto max = 0.0; + double max = 0.0; for (int i = 0; i < this->size(); i++) { - auto element = this->at(i); + double element = this->at(i); if (element < 0.0) element = -element; if (max < element) max = element; } @@ -143,17 +143,17 @@ namespace MbD { template<> inline void FullVector::normalizeSelf() { - auto length = this->length(); + double length = this->length(); if (length == 0.0) throw std::runtime_error("Cannot normalize a null vector."); this->magnifySelf(1.0 / length); } template inline double FullVector::length() { - auto ssq = 0.0; + double ssq = 0.0; for (int i = 0; i < this->size(); i++) { - auto elem = this->at(i); + double elem = this->at(i); ssq += elem * elem; } return std::sqrt(ssq); @@ -161,8 +161,8 @@ namespace MbD { template inline void FullVector::conditionSelf() { - constexpr auto epsilon = std::numeric_limits::epsilon(); - auto tol = this->maxMagnitude() * epsilon; + constexpr double epsilon = std::numeric_limits::epsilon(); + double tol = this->maxMagnitude() * epsilon; this->conditionSelfWithTol(tol); } template<> @@ -170,7 +170,7 @@ namespace MbD { { for (int i = 0; i < this->size(); i++) { - auto element = this->at(i); + double element = this->at(i); if (element < 0.0) element = -element; if (element < tol) this->atiput(i, 0.0); } diff --git a/OndselSolver/GEFullMatParPv.cpp b/OndselSolver/GEFullMatParPv.cpp index 5d57cf3..2fc7d43 100644 --- a/OndselSolver/GEFullMatParPv.cpp +++ b/OndselSolver/GEFullMatParPv.cpp @@ -19,7 +19,7 @@ void GEFullMatParPv::doPivoting(int p) //| app max rowPivot aip mag | auto app = matrixA->at(p)->at(p); - auto max = app * rowScalings->at(p); + double max = app * rowScalings->at(p); if (max < 0.0) max = -max; auto rowPivot = p; for (int i = p + 1; i < m; i++) diff --git a/OndselSolver/GESpMatFullPv.cpp b/OndselSolver/GESpMatFullPv.cpp index ff30ba3..4f7cd3c 100644 --- a/OndselSolver/GESpMatFullPv.cpp +++ b/OndselSolver/GESpMatFullPv.cpp @@ -20,7 +20,7 @@ void GESpMatFullPv::doPivoting(int p) //"Swap rows but keep columns in place." //"The elements below the diagonal are removed column by column." - auto max = 0.0; + double max = 0.0; auto pivotRow = p; auto pivotCol = p; for (int j = p; j < n; j++) @@ -169,7 +169,7 @@ void GESpMatFullPv::preSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr fullCol for (int i = 0; i < m; i++) { auto& spRowi = spMat->at(i); - auto maxRowMagnitude = spRowi->maxMagnitude(); + double maxRowMagnitude = spRowi->maxMagnitude(); if (maxRowMagnitude == 0) { throwSingularMatrixError(""); } diff --git a/OndselSolver/GESpMatFullPvPosIC.cpp b/OndselSolver/GESpMatFullPvPosIC.cpp index 7bd0496..194b457 100644 --- a/OndselSolver/GESpMatFullPvPosIC.cpp +++ b/OndselSolver/GESpMatFullPvPosIC.cpp @@ -33,7 +33,7 @@ void GESpMatFullPvPosIC::doPivoting(int p) //"Swap rows but keep columns in place." //"The elements below the diagonal are removed column by column." - auto max = 0.0; + double max = 0.0; auto pivotRow = p; auto pivotCol = p; for (int j = p; j < n; j++) diff --git a/OndselSolver/GESpMatParPvMarko.cpp b/OndselSolver/GESpMatParPvMarko.cpp index 295f3bc..6f8fd53 100644 --- a/OndselSolver/GESpMatParPvMarko.cpp +++ b/OndselSolver/GESpMatParPvMarko.cpp @@ -94,7 +94,7 @@ void GESpMatParPvMarko::preSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr ful for (int i = 0; i < m; i++) { auto& spRowi = spMat->at(i); - auto maxRowMagnitude = spRowi->maxMagnitude(); + double maxRowMagnitude = spRowi->maxMagnitude(); if (maxRowMagnitude == 0) { throwSingularMatrixError(""); } diff --git a/OndselSolver/GESpMatParPvMarkoFast.cpp b/OndselSolver/GESpMatParPvMarkoFast.cpp index 913246e..7a23812 100644 --- a/OndselSolver/GESpMatParPvMarkoFast.cpp +++ b/OndselSolver/GESpMatParPvMarkoFast.cpp @@ -33,7 +33,7 @@ void GESpMatParPvMarkoFast::preSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr for (int i = 0; i < m; i++) { auto& spRowi = spMat->at(i); - auto maxRowMagnitude = spRowi->maxMagnitude(); + double maxRowMagnitude = spRowi->maxMagnitude(); if (maxRowMagnitude == 0) throwSingularMatrixError(""); auto scaling = 1.0 / maxRowMagnitude; matrixA->at(i) = spRowi->timesconditionedWithTol(scaling, singularPivotTolerance); diff --git a/OndselSolver/GESpMatParPvPrecise.cpp b/OndselSolver/GESpMatParPvPrecise.cpp index 5ee7cc1..fca7e26 100644 --- a/OndselSolver/GESpMatParPvPrecise.cpp +++ b/OndselSolver/GESpMatParPvPrecise.cpp @@ -96,7 +96,7 @@ void GESpMatParPvPrecise::preSolvewithsaveOriginal(SpMatDsptr spMat, FColDsptr f for (int i = 0; i < m; i++) { auto& spRowi = spMat->at(i); - auto maxRowMagnitude = spRowi->maxMagnitude(); + double maxRowMagnitude = spRowi->maxMagnitude(); if (maxRowMagnitude == 0) throwSingularMatrixError("preSolvewithsaveOriginal"); rowScalings->at(i) = 1.0 / maxRowMagnitude; matrixA->at(i) = spRowi->conditionedWithTol(singularPivotTolerance * maxRowMagnitude); diff --git a/OndselSolver/GeneralSpline.cpp b/OndselSolver/GeneralSpline.cpp index 4f6c054..9966cb9 100644 --- a/OndselSolver/GeneralSpline.cpp +++ b/OndselSolver/GeneralSpline.cpp @@ -69,23 +69,23 @@ void MbD::GeneralSpline::computeDerivatives() auto matrix = std::make_shared>(np, np); auto bvector = std::make_shared>(np, 0.0); auto hs = std::make_shared>(n - 1); - auto hmax = 0.0; + double hmax = 0.0; for (int i = 0; i < n - 1; i++) { - auto h = xs->at((size_t)i + 1) - xs->at(i); + double h = xs->at((size_t)i + 1) - xs->at(i); hmax = std::max(hmax, std::abs(h)); hs->atiput(i, h); } for (int i = 0; i < n - 1; i++) { - auto offset = i * p; - auto hbar = hs->at(i) / hmax; + double offset = i * p; + double hbar = hs->at(i) / hmax; for (int j = 1; j < p; j++) { matrix->atijput(offset + j, offset + j - 1, 1.0); matrix->atijput(offset + j, offset + j - 1 + p, -1.0); } - auto dum = 1.0; + double dum = 1.0; for (int j = 0; j < p; j++) { dum = dum * hbar / (j + 1); @@ -148,7 +148,7 @@ double MbD::GeneralSpline::derivativeAt(int n, double xxx) if (n > degree) return 0.0; calcIndexAndDeltaFor(xxx); auto& derivsi = derivs->at(index); - auto sum = 0.0; + double sum = 0.0; for (int j = degree; j >= n + 1; j--) { sum = (sum + derivsi->at((size_t)j - 1)) * delta / (j - n); @@ -169,16 +169,16 @@ void MbD::GeneralSpline::calcIndexAndDeltaFor(double xxx) void MbD::GeneralSpline::calcCyclicIndexAndDelta() { - auto xFirst = xs->front(); - auto xLast = xs->back(); + double xFirst = xs->front(); + double xLast = xs->back(); xvalue = std::fmod(xvalue - xFirst, xLast - xFirst) + xFirst; calcIndexAndDelta(); } void MbD::GeneralSpline::calcNonCyclicIndexAndDelta() { - auto xFirst = xs->front(); - auto xLast = xs->back(); + double xFirst = xs->front(); + double xLast = xs->back(); if (xvalue <= xFirst) { index = 0; delta = xvalue - xFirst; @@ -230,7 +230,7 @@ double MbD::GeneralSpline::y(double xxx) calcIndexAndDeltaFor(xxx); auto& derivsi = derivs->at(index); - auto sum = 0.0; + double sum = 0.0; for (int j = degree; j >= 1; j--) { sum = (sum + derivsi->at((size_t)j - 1)) * delta / j; diff --git a/OndselSolver/IntegratorInterface.h b/OndselSolver/IntegratorInterface.h index 2436566..93ff606 100644 --- a/OndselSolver/IntegratorInterface.h +++ b/OndselSolver/IntegratorInterface.h @@ -36,7 +36,7 @@ namespace MbD { virtual void interpolateAt(double t); SystemSolver* system; - double tout = 0, hout = 0, hmin = 0, hmax = 0, tstart = 0, tend = 0; + double tout = 0.0, hout = 0.0, hmin = 0.0, hmax = 0.0, tstart = 0.0, tend = 0.0; std::shared_ptr integrator; }; } diff --git a/OndselSolver/LDUFullMatParPv.cpp b/OndselSolver/LDUFullMatParPv.cpp index c3d7f27..d0ef28c 100644 --- a/OndselSolver/LDUFullMatParPv.cpp +++ b/OndselSolver/LDUFullMatParPv.cpp @@ -18,7 +18,7 @@ void LDUFullMatParPv::doPivoting(int p) //| app max rowPivot aip mag | auto app = matrixA->at(p)->at(p); - auto max = app * rowScalings->at(p); + double max = app * rowScalings->at(p); if (max < 0.0) max = -max; auto rowPivot = p; for (int i = p + 1; i < m; i++) diff --git a/OndselSolver/MatrixSolver.cpp b/OndselSolver/MatrixSolver.cpp index f82a2a9..d09496e 100644 --- a/OndselSolver/MatrixSolver.cpp +++ b/OndselSolver/MatrixSolver.cpp @@ -64,7 +64,7 @@ void MatrixSolver::findScalingsForRowRange(int begin, int end) rowScalings = std::make_shared>(m); for (int i = begin; i < end; i++) { - auto maxRowMagnitude = this->getmatrixArowimaxMagnitude(i); + double maxRowMagnitude = this->getmatrixArowimaxMagnitude(i); if (maxRowMagnitude == 0.0) throwSingularMatrixError(""); rowScalings->at(i) = 1.0 / maxRowMagnitude; } diff --git a/OndselSolver/MomentOfInertiaSolver.cpp b/OndselSolver/MomentOfInertiaSolver.cpp index 5451c2e..8fd2cd6 100644 --- a/OndselSolver/MomentOfInertiaSolver.cpp +++ b/OndselSolver/MomentOfInertiaSolver.cpp @@ -43,7 +43,7 @@ void MbD::MomentOfInertiaSolver::example1() void MbD::MomentOfInertiaSolver::doFullPivoting(int p) { - auto max = 0.0; + double max = 0.0; auto pivotRow = p; auto pivotCol = p; for (int i = p; i < 3; i++) diff --git a/OndselSolver/Part.cpp b/OndselSolver/Part.cpp index 6186dbf..d05ef7a 100644 --- a/OndselSolver/Part.cpp +++ b/OndselSolver/Part.cpp @@ -267,8 +267,8 @@ void Part::fillqsuWeights(DiagMatDsptr diagMat) auto mMax = this->root()->maximumMass(); auto aJiMax = this->root()->maximumMomentOfInertia(); - auto minw = 1.0e3; - auto maxw = 1.0e6; + double minw = 1.0e3; + double maxw = 1.0e6; auto wqX = std::make_shared>(3); auto wqE = std::make_shared>(4); if (mMax == 0) { mMax = 1.0; } @@ -313,10 +313,10 @@ void Part::fillqsudotWeights(DiagMatDsptr diagMat) //| mMax aJiMax maxInertia minw maxw aJi wqXdot wqEdot | auto mMax = this->root()->maximumMass(); auto aJiMax = this->root()->maximumMomentOfInertia(); - auto maxInertia = std::max(mMax, aJiMax); + double maxInertia = std::max(mMax, aJiMax); if (maxInertia == 0) maxInertia = 1.0; - auto minw = 1.0e-12 * maxInertia; - auto maxw = maxInertia; + double minw = 1.0e-12 * maxInertia; + double maxw = maxInertia; auto wqXdot = std::make_shared>(3); auto wqEdot = std::make_shared>(4); for (int i = 0; i < 3; i++) diff --git a/OndselSolver/RowTypeMatrix.h b/OndselSolver/RowTypeMatrix.h index 6cbd921..86b799b 100644 --- a/OndselSolver/RowTypeMatrix.h +++ b/OndselSolver/RowTypeMatrix.h @@ -43,10 +43,10 @@ namespace MbD { //template //inline double RowTypeMatrix::maxMagnitude() //{ - // auto max = 0.0; + // double max = 0.0; // for (int i = 0; i < this->size(); i++) // { - // auto element = this->at(i)->maxMagnitude(); + // double element = this->at(i)->maxMagnitude(); // if (max < element) max = element; // } // return max; diff --git a/OndselSolver/SparseMatrix.h b/OndselSolver/SparseMatrix.h index 0b53c52..44e18c1 100644 --- a/OndselSolver/SparseMatrix.h +++ b/OndselSolver/SparseMatrix.h @@ -166,10 +166,10 @@ namespace MbD { template inline double SparseMatrix::maxMagnitude() { - auto max = 0.0; + double max = 0.0; for (int i = 0; i < this->size(); i++) { - auto element = this->at(i)->maxMagnitude(); + double element = this->at(i)->maxMagnitude(); if (max < element) max = element; } return max; diff --git a/OndselSolver/SystemSolver.h b/OndselSolver/SystemSolver.h index dd9aff0..9936e27 100644 --- a/OndselSolver/SystemSolver.h +++ b/OndselSolver/SystemSolver.h @@ -89,21 +89,21 @@ namespace MbD { int iterMaxAccKine = 25; std::shared_ptr basicIntegrator; std::shared_ptr> tstartPasts; - double tstart = 0; + double tstart = 0.0; double tend = 25; double toutFirst = 0.0; double hmin = 1.0e-9; double hmax = 1.0; double hout = 1.0e-1; double direction = 1; - double corAbsTol = 0; - double corRelTol = 0; - double intAbsTol = 0; - double intRelTol = 0; + double corAbsTol = 0.0; + double corRelTol = 0.0; + double intAbsTol = 0.0; + double intRelTol = 0.0; int iterMaxDyn = 0; int orderMax = 0; - double translationLimit = 0; - double rotationLimit = 0; + double translationLimit = 0.0; + double rotationLimit = 0.0; }; }