Home
last modified time | relevance | path

Searched refs:idx_a (Results 1 – 1 of 1) sorted by relevance

/external/ceres-solver/internal/ceres/
Dincomplete_lq_factorization.cc80 int idx_a = a_rows[row_a]; in RowDotProduct() local
83 while (idx_a < row_a_end && idx_b < row_b_end) { in RowDotProduct()
84 if (a_cols[idx_a] == b_cols[idx_b]) { in RowDotProduct()
85 dot_product += a_values[idx_a++] * b_values[idx_b++]; in RowDotProduct()
88 while (a_cols[idx_a] < b_cols[idx_b] && idx_a < row_a_end) { in RowDotProduct()
89 ++idx_a; in RowDotProduct()
92 while (a_cols[idx_a] > b_cols[idx_b] && idx_b < row_b_end) { in RowDotProduct()