HomeSort by relevance Sort by last modified time
    Searched refs:row_begin (Results 1 - 4 of 4) sorted by null

  /external/ceres-solver/internal/ceres/
covariance_impl.cc 135 const int row_begin = local
141 const int row_size = rows[row_begin + 1] - rows[row_begin];
142 const int* cols_begin = cols + rows[row_begin];
171 ConstMatrixRef cov(covariance_matrix_->values() + rows[row_begin],
344 int row_begin = it->second; local
361 rows[row_begin + r] = cursor;
527 const int row_begin = rows[r]; local
529 if (row_end == row_begin) {
547 for (int idx = row_begin; idx < row_end; ++idx)
716 const int row_begin = rows[r]; local
    [all...]
covariance_test.cc 333 const int row_begin = FindOrDie(column_bounds_, block1).first; local
338 Matrix actual(row_end - row_begin, col_end - col_begin);
344 double diff_norm = (expected.block(row_begin,
346 row_end - row_begin,
348 diff_norm /= (row_end - row_begin) * (col_end - col_begin);
352 << "rows: " << row_begin << " " << row_end << " "
354 << "\n\n expected: \n " << expected.block(row_begin,
356 row_end - row_begin,
incomplete_lq_factorization.cc 46 const int row_begin = matrix->rows()[row]; local
51 for (int i = row_begin; i < row_end; ++i) {
57 for (int i = row_begin; i < row_end; ++i) {
compressed_row_sparse_matrix.cc 527 const int row_begin = m_rows[r]; local
529 for (int idx1 = row_begin; idx1 < row_end; ++idx1) {
531 for (int idx2 = row_begin; idx2 <= idx1; ++idx2, ++cursor) {

Completed in 423 milliseconds