@@ -23,7 +23,7 @@ namespace core
2323
2424template <typename T> int isSquare ( const vector<vector<T>> &vm )
2525{
26- for ( int i = 0 ; i < vm.size (); i++ )
26+ for ( size_t i = 0 ; i < vm.size (); i++ )
2727 {
2828 if ( vm[i].size () != vm.size () )
2929 return 0 ;
@@ -86,31 +86,38 @@ vector<vector<T>> invertVM( const vector<vector<T>> &vMtx )
8686
8787 Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> m;
8888 m.resize ( vMtx.size (), vMtx[0 ].size () );
89- FORIJ ( m.rows (), m.cols () ) m ( i, j ) = vMtx[i][j];
89+ for ( Eigen::Index i = 0 ; i < m.rows (); i++ )
90+ for ( Eigen::Index j = 0 ; j < m.cols (); j++ )
91+ m ( i, j ) = vMtx[i][j];
9092
9193 // Map < Eigen::Matrix < T, Eigen::Dynamic, Eigen::Dynamic, RowMajor > > m (vMtx[0]);
9294 // m.resize(vMtx.size(), vMtx[0].size());
9395
9496 m = m.inverse ();
9597
9698 vector<vector<T>> vMtxR ( m.rows (), vector<T>( m.cols () ) );
97- FORIJ ( m.rows (), m.cols () ) vMtxR[i][j] = m ( i, j );
99+ for ( Eigen::Index i = 0 ; i < m.rows (); i++ )
100+ for ( Eigen::Index j = 0 ; j < m.cols (); j++ )
101+ vMtxR[i][j] = m ( i, j );
98102
99103 return vMtxR;
100104};
101105
102106template <typename T> vector<T> invertV ( const vector<T> &vMtx )
103107{
104- int size = std::sqrt ( static_cast <int >( vMtx.size () ) );
108+ size_t size = std::sqrt ( static_cast <size_t >( vMtx.size () ) );
105109 vector<vector<T>> tmp ( size, vector<T>( size ) );
106110
107- FORIJ ( size, size )
108- tmp[i][j] = vMtx[i * size + j];
111+ for ( size_t i = 0 ; i < size; i++ )
112+ for ( size_t j = 0 ; j < size; j++ )
113+ tmp[i][j] = vMtx[i * size + j];
109114
110115 tmp = invertVM ( tmp );
111116 vector<T> result ( vMtx.size () );
112117
113- FORIJ ( size, size ) result[i * size + j] = tmp[i][j];
118+ for ( size_t i = 0 ; i < size; i++ )
119+ for ( size_t j = 0 ; j < size; j++ )
120+ result[i * size + j] = tmp[i][j];
114121
115122 return result;
116123};
@@ -138,11 +145,15 @@ vector<vector<T>> transposeVec( const vector<vector<T>> &vMtx )
138145 Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> m;
139146 m.resize ( vMtx.size (), vMtx[0 ].size () );
140147
141- FORIJ ( m.rows (), m.cols () ) m ( i, j ) = vMtx[i][j];
148+ for ( Eigen::Index i = 0 ; i < m.rows (); i++ )
149+ for ( Eigen::Index j = 0 ; j < m.cols (); j++ )
150+ m ( i, j ) = vMtx[i][j];
142151 m.transposeInPlace ();
143152
144153 vector<vector<T>> vTran ( m.rows (), vector<T>( m.cols () ) );
145- FORIJ ( m.rows (), m.cols () ) vTran[i][j] = m ( i, j );
154+ for ( Eigen::Index i = 0 ; i < m.rows (); i++ )
155+ for ( Eigen::Index j = 0 ; j < m.cols (); j++ )
156+ vTran[i][j] = m ( i, j );
146157
147158 return vTran;
148159};
@@ -162,12 +173,12 @@ template <typename T> T sumVectorM( const vector<vector<T>> &vct )
162173 size_t row = vct.size ();
163174 size_t col = vct[0 ].size ();
164175
165- T sum = T ( 0 );
166176 Eigen::Matrix<T, Eigen::Dynamic, 1 > v;
167177 v.resize ( row * col, 1 );
168178
169- FORIJ ( row, col )
170- v ( i * col + j ) = vct[i][j];
179+ for ( size_t i = 0 ; i < row; i++ )
180+ for ( size_t j = 0 ; j < col; j++ )
181+ v ( i * col + j ) = vct[i][j];
171182
172183 return v.sum ();
173184};
@@ -177,11 +188,11 @@ template <typename T> void scaleVector( vector<T> &vct, const T scale )
177188 Eigen::Matrix<T, Eigen::Dynamic, 1 > v;
178189 v.resize ( vct.size (), 1 );
179190
180- for ( int i = 0 ; i < vct.size (); i++ )
191+ for ( size_t i = 0 ; i < vct.size (); i++ )
181192 v ( i, 0 ) = vct[i];
182193 v *= scale;
183194
184- for ( int i = 0 ; i < vct.size (); i++ )
195+ for ( size_t i = 0 ; i < vct.size (); i++ )
185196 vct[i] = v ( i, 0 );
186197
187198 return ;
@@ -214,8 +225,8 @@ vector<T> mulVector( vector<T> vct1, vector<T> vct2, int k = 3 )
214225 int rows = ( static_cast <int >( vct1.size () ) ) / k;
215226 int cols = ( static_cast <int >( vct2.size () ) ) / k;
216227
217- assert ( rows * k == vct1.size () );
218- assert ( k * cols == vct2.size () );
228+ assert ( static_cast < size_t >( rows * k ) == vct1.size () );
229+ assert ( static_cast < size_t >( k * cols ) == vct2.size () );
219230
220231 vector<T> vct3 ( rows * cols );
221232 T *pA = &vct1[0 ];
@@ -246,15 +257,19 @@ mulVector( const vector<vector<T>> &vct1, const vector<vector<T>> &vct2 )
246257 m1.resize ( vct1.size (), vct1[0 ].size () );
247258 m2.resize ( vct2[0 ].size (), vct2.size () );
248259
249- FORIJ ( m1.rows (), m1.cols () )
250- m1 ( i, j ) = vct1[i][j];
251- FORIJ ( m2.rows (), m2.cols () )
252- m2 ( i, j ) = vct2[j][i];
260+ for ( Eigen::Index i = 0 ; i < m1.rows (); i++ )
261+ for ( Eigen::Index j = 0 ; j < m1.cols (); j++ )
262+ m1 ( i, j ) = vct1[i][j];
263+ for ( Eigen::Index i = 0 ; i < m2.rows (); i++ )
264+ for ( Eigen::Index j = 0 ; j < m2.cols (); j++ )
265+ m2 ( i, j ) = vct2[j][i];
253266
254267 m3 = m1 * m2;
255268
256269 vector<vector<T>> vct3 ( m3.rows (), vector<T>( m3.cols () ) );
257- FORIJ ( m3.rows (), m3.cols () ) vct3[i][j] = m3 ( i, j );
270+ for ( Eigen::Index i = 0 ; i < m3.rows (); i++ )
271+ for ( Eigen::Index j = 0 ; j < m3.cols (); j++ )
272+ vct3[i][j] = m3 ( i, j );
258273
259274 return vct3;
260275};
@@ -268,9 +283,10 @@ vector<T> mulVector( const vector<vector<T>> &vct1, const vector<T> &vct2 )
268283 m1.resize ( vct1.size (), vct1[0 ].size () );
269284 m2.resize ( vct2.size (), 1 );
270285
271- FORIJ ( m1.rows (), m1.cols () )
272- m1 ( i, j ) = vct1[i][j];
273- for ( int i = 0 ; i < m2.rows (); i++ )
286+ for ( Eigen::Index i = 0 ; i < m1.rows (); i++ )
287+ for ( Eigen::Index j = 0 ; j < m1.cols (); j++ )
288+ m1 ( i, j ) = vct1[i][j];
289+ for ( Eigen::Index i = 0 ; i < m2.rows (); i++ )
274290 m2 ( i, 0 ) = vct2[i];
275291
276292 m3 = m1 * m2;
@@ -301,7 +317,7 @@ T calculate_SSE( const vector<T> &tcp, const vector<T> &src )
301317 vector<T> tmp ( src.size () );
302318
303319 T sum = T ( 0.0 );
304- for ( int i = 0 ; i < tcp.size (); i++ )
320+ for ( size_t i = 0 ; i < tcp.size (); i++ )
305321 sum += std::pow ( ( tcp[i] / src[i] - 1.0 ), T ( 2.0 ) );
306322
307323 return sum;
@@ -334,7 +350,7 @@ vector<T> interp1DLinear(
334350
335351 vector<T> slope, intercept, Y1;
336352
337- for ( int i = 0 ; i < X0.size () - 1 ; i++ )
353+ for ( size_t i = 0 ; i < X0.size () - 1 ; i++ )
338354 {
339355 slope.push_back ( ( Y0[i + 1 ] - Y0[i] ) / ( X0[i + 1 ] - X0[i] ) );
340356 intercept.push_back ( Y0[i] - X0[i] * slope[i] );
@@ -343,7 +359,7 @@ vector<T> interp1DLinear(
343359 slope.push_back ( slope[slope.size () - 1 ] );
344360 intercept.push_back ( intercept[intercept.size () - 1 ] );
345361
346- for ( int i = 0 ; i < X1.size (); i++ )
362+ for ( size_t i = 0 ; i < X1.size (); i++ )
347363 {
348364 int index = findIndexInterp1 ( X1[i], X0, int ( X0.size () ) );
349365 if ( index != -1 )
@@ -423,17 +439,18 @@ vector<vector<T>> XYZ_to_LAB( const vector<vector<T>> &XYZ )
423439 T add = T ( 16.0 / 116.0 );
424440
425441 vector<vector<T>> tmpXYZ ( XYZ.size (), vector<T>( 3 , T ( 1.0 ) ) );
426- FORIJ ( XYZ.size (), 3 )
427- {
428- tmpXYZ[i][j] = XYZ[i][j] / ACES_white_point_XYZ[j];
429- if ( tmpXYZ[i][j] > T ( e ) )
430- tmpXYZ[i][j] = ceres::pow ( tmpXYZ[i][j], T ( 1.0 / 3.0 ) );
431- else
432- tmpXYZ[i][j] = T ( k ) * tmpXYZ[i][j] + add;
433- }
442+ for ( size_t i = 0 ; i < XYZ.size (); i++ )
443+ for ( size_t j = 0 ; j < 3 ; j++ )
444+ {
445+ tmpXYZ[i][j] = XYZ[i][j] / ACES_white_point_XYZ[j];
446+ if ( tmpXYZ[i][j] > T ( e ) )
447+ tmpXYZ[i][j] = ceres::pow ( tmpXYZ[i][j], T ( 1.0 / 3.0 ) );
448+ else
449+ tmpXYZ[i][j] = T ( k ) * tmpXYZ[i][j] + add;
450+ }
434451
435452 vector<vector<T>> outCalcLab ( XYZ.size (), vector<T>( 3 ) );
436- for ( int i = 0 ; i < XYZ.size (); i++ )
453+ for ( size_t i = 0 ; i < XYZ.size (); i++ )
437454 {
438455 outCalcLab[i][0 ] = T ( 116.0 ) * tmpXYZ[i][1 ] - T ( 16.0 );
439456 outCalcLab[i][1 ] = T ( 500.0 ) * ( tmpXYZ[i][0 ] - tmpXYZ[i][1 ] );
@@ -452,7 +469,9 @@ getCalcXYZt( const vector<vector<T>> &RGB, const T beta_params[6] )
452469 vector<vector<T>> BV ( 3 , vector<T>( 3 ) );
453470 vector<vector<T>> M ( 3 , vector<T>( 3 ) );
454471
455- FORIJ ( 3 , 3 ) M[i][j] = T ( acesrgb_XYZ_3[i][j] );
472+ for ( size_t i = 0 ; i < 3 ; i++ )
473+ for ( size_t j = 0 ; j < 3 ; j++ )
474+ M[i][j] = T ( acesrgb_XYZ_3[i][j] );
456475
457476 BV[0 ][0 ] = beta_params[0 ];
458477 BV[0 ][1 ] = beta_params[1 ];
0 commit comments