| /external/eigen/bench/ |
| sparse_setter.cpp | 360 I row_end = Ap[i+1]; local
364 for(I jj = row_start; jj < row_end; jj++){
370 for(I jj = row_start, n = 0; jj < row_end; jj++, n++){
385 I row_end = 0; local
387 I jj = row_end;
388 row_end = Ap[i+1];
389 while( jj < row_end ){
393 while( jj < row_end && Aj[jj] == j ){
|
| /external/ceres-solver/internal/ceres/ |
| incomplete_lq_factorization.cc | 47 const int row_end = matrix->rows()[row + 1]; local
51 for (int i = row_begin; i < row_end; ++i) {
57 for (int i = row_begin; i < row_end; ++i) {
|
| covariance_impl.cc | 491 int row_end = rows[r + 1]; local
492 if (row_end == row_begin) {
499 for (int idx = row_begin; idx < row_end; ++idx) {
537 int row_end = rows[r + 1]; local
538 if (row_end == row_begin) {
566 for (int idx = row_begin; idx < row_end; ++idx) {
717 const int row_end = rows[r + 1]; local
718 if (row_end == row_begin) {
736 for (int idx = row_begin; idx < row_end; ++idx) {
|
| covariance_test.cc | 334 const int row_end = FindOrDie(column_bounds_, block1).second; local
338 Matrix actual(row_end - row_begin, col_end - col_begin);
346 row_end - row_begin,
348 diff_norm /= (row_end - row_begin) * (col_end - col_begin);
352 << "rows: " << row_begin << " " << row_end << " "
356 row_end - row_begin,
|
| /external/chromium_org/third_party/libwebp/dsp/ |
| lossless.h | 31 // rows. Transform will be applied to rows [row_start, row_end[.
35 int row_start, int row_end,
|
| lossless.c | [all...] |
| /external/webp/src/dsp/ |
| lossless.h | 31 // rows. Transform will be applied to rows [row_start, row_end[.
35 int row_start, int row_end,
|
| lossless.c | [all...] |
