diff --git a/src/examples/solver/test_ccolamd_blocks.cpp b/src/examples/solver/test_ccolamd_blocks.cpp index 9f345c7ceb6da288f6ae20c130f69500a7fc7381..64421f502818c7a0f5095160968487698d9a483e 100644 --- a/src/examples/solver/test_ccolamd_blocks.cpp +++ b/src/examples/solver/test_ccolamd_blocks.cpp @@ -28,8 +28,8 @@ using namespace Eigen; void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, const unsigned int& Nrows, const unsigned int& col, const unsigned int& Ncols) { - for (uint i = row; i < row + Nrows; i++) - for (uint j = col; j < row + Ncols; j++) + for (unsigned int i = row; i < row + Nrows; i++) + for (unsigned int j = col; j < row + Ncols; j++) original.coeffRef(i,j) = 0.0; original.makeCompressed(); @@ -37,8 +37,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c void addSparseBlock(const MatrixXd& ins, SparseMatrix<double>& original, const unsigned int& row, const unsigned int& col) { - for (uint r=0; r<ins.rows(); ++r) - for (uint c = 0; c < ins.cols(); c++) + for (unsigned int r=0; r<ins.rows(); ++r) + for (unsigned int c = 0; c < ins.cols(); c++) original.coeffRef(r + row, c + col) += ins(r,c); } diff --git a/src/examples/solver/test_iQR.cpp b/src/examples/solver/test_iQR.cpp index a224fd72993b118ef2383b69452a412f094ba5bd..d93cdcce888cd51176182ad3c3c4fad6eed15474 100644 --- a/src/examples/solver/test_iQR.cpp +++ b/src/examples/solver/test_iQR.cpp @@ -60,8 +60,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c block_pruning bp(row, col, Nrows, Ncols); original.prune(bp); -// for (uint i = row; i < row + Nrows; i++) -// for (uint j = col; j < row + Ncols; j++) +// for (unsigned int i = row; i < row + Nrows; i++) +// for (unsigned int j = col; j < row + Ncols; j++) // original.coeffRef(i,j) = 0.0; // // original.prune(0); @@ -69,8 +69,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c void addSparseBlock(const MatrixXd& ins, SparseMatrix<double>& original, const unsigned int& row, const unsigned int& col) { - for (uint r=0; r<ins.rows(); ++r) - for (uint c = 0; c < ins.cols(); c++) + for (unsigned int r=0; r<ins.rows(); ++r) + for (unsigned int c = 0; c < ins.cols(); c++) if (ins(r,c) != 0) original.coeffRef(r + row, c + col) += ins(r,c); } diff --git a/src/examples/solver/test_iQR_wolf.cpp b/src/examples/solver/test_iQR_wolf.cpp index 71b4e23ae240a92c1688542e6ed7c3ae510db271..61892690dab0cdf54b634e8f3e1bebfd2e8f72ff 100644 --- a/src/examples/solver/test_iQR_wolf.cpp +++ b/src/examples/solver/test_iQR_wolf.cpp @@ -54,8 +54,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c block_pruning bp(row, col, Nrows, Ncols); original.prune(bp); -// for (uint i = row; i < row + Nrows; i++) -// for (uint j = col; j < row + Ncols; j++) +// for (unsigned int i = row; i < row + Nrows; i++) +// for (unsigned int j = col; j < row + Ncols; j++) // original.coeffRef(i,j) = 0.0; // // original.prune(0); @@ -63,8 +63,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c void addSparseBlock(const MatrixXd& ins, SparseMatrix<double>& original, const unsigned int& row, const unsigned int& col) { - for (uint r=0; r<ins.rows(); ++r) - for (uint c = 0; c < ins.cols(); c++) + for (unsigned int r=0; r<ins.rows(); ++r) + for (unsigned int c = 0; c < ins.cols(); c++) if (ins(r,c) != 0) original.coeffRef(r + row, c + col) += ins(r,c); } diff --git a/src/examples/solver/test_incremental_ccolamd_blocks.cpp b/src/examples/solver/test_incremental_ccolamd_blocks.cpp index c822364929e12b58d5f9c6a859afc3bd26bdb056..ca39a9d2e18687f91bf11a65dd90f7dbb8f10cfb 100644 --- a/src/examples/solver/test_incremental_ccolamd_blocks.cpp +++ b/src/examples/solver/test_incremental_ccolamd_blocks.cpp @@ -28,8 +28,8 @@ using namespace Eigen; void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, const unsigned int& Nrows, const unsigned int& col, const unsigned int& Ncols) { - for (uint i = row; i < row + Nrows; i++) - for (uint j = col; j < row + Ncols; j++) + for (unsigned int i = row; i < row + Nrows; i++) + for (unsigned int j = col; j < row + Ncols; j++) original.coeffRef(i,j) = 0.0; original.makeCompressed(); @@ -37,8 +37,8 @@ void eraseSparseBlock(SparseMatrix<double>& original, const unsigned int& row, c void addSparseBlock(const MatrixXd& ins, SparseMatrix<double>& original, const unsigned int& row, const unsigned int& col) { - for (uint r=0; r<ins.rows(); ++r) - for (uint c = 0; c < ins.cols(); c++) + for (unsigned int r=0; r<ins.rows(); ++r) + for (unsigned int c = 0; c < ins.cols(); c++) if (ins(r,c) != 0) original.coeffRef(r + row, c + col) += ins(r,c); }