Replace int with size_t to avoid possible size mismatch
This commit is contained in:
parent
cbe232e880
commit
8faf68dabb
@ -993,7 +993,7 @@ protected:
|
|||||||
|
|
||||||
// reorder the sample points
|
// reorder the sample points
|
||||||
std::vector<Scalar> tmpX(n), tmpY(n);
|
std::vector<Scalar> tmpX(n), tmpY(n);
|
||||||
for (int i = 0; i < idxVector.size(); ++ i) {
|
for (size_t i = 0; i < idxVector.size(); ++ i) {
|
||||||
tmpX[i] = xPos_[idxVector[i]];
|
tmpX[i] = xPos_[idxVector[i]];
|
||||||
tmpY[i] = yPos_[idxVector[i]];
|
tmpY[i] = yPos_[idxVector[i]];
|
||||||
}
|
}
|
||||||
@ -1267,12 +1267,12 @@ protected:
|
|||||||
|
|
||||||
// See: J. Stoer: "Numerische Mathematik 1", 9th edition,
|
// See: J. Stoer: "Numerische Mathematik 1", 9th edition,
|
||||||
// Springer, 2005, p. 111
|
// Springer, 2005, p. 111
|
||||||
const int n = numSamples() - 1;
|
const size_t n = numSamples() - 1;
|
||||||
|
|
||||||
assert(M.rows() == n);
|
assert(M.rows() == n);
|
||||||
|
|
||||||
// second to next to last rows
|
// second to next to last rows
|
||||||
for (int i = 2; i < n; ++i) {
|
for (size_t i = 2; i < n; ++i) {
|
||||||
Scalar lambda_i = h_(i + 1) / (h_(i) + h_(i + 1));
|
Scalar lambda_i = h_(i + 1) / (h_(i) + h_(i + 1));
|
||||||
Scalar mu_i = 1 - lambda_i;
|
Scalar mu_i = 1 - lambda_i;
|
||||||
Scalar d_i =
|
Scalar d_i =
|
||||||
|
Loading…
Reference in New Issue
Block a user