Searched refs:a_cols (Results 1 - 2 of 2) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | incomplete_lq_factorization.cc | 70 const int* a_cols = a.cols(); local 84 if (a_cols[idx_a] == b_cols[idx_b]) { 88 while (a_cols[idx_a] < b_cols[idx_b] && idx_a < row_a_end) { 92 while (a_cols[idx_a] > b_cols[idx_b] && idx_b < row_b_end) {
|
/external/opencv3/modules/ts/src/ |
H A D | ts_func.cpp | 2158 int d_rows, int d_cols, int a_cols, int cn, 2172 for( int k = 0; k < a_cols; k++ ) 2184 for( int k = 0; k < a_cols; k++ ) 2223 int a_rows = a.rows, a_cols = a.cols, b_rows = b.rows, b_cols = b.cols; 2233 std::swap( a_rows, a_cols ); 2264 (int)d.step1(), a_rows, b_cols, a_cols, cn, alpha, beta ); 2268 (int)d.step1(), a_rows, b_cols, a_cols, cn, alpha, beta );
|
Completed in 121 milliseconds