Lines Matching full:rows
47 // duplicates in the pair of arrays rows and cols, i.e., there is no
50 // rows[i] == rows[j] && cols[i] == cols[j]
54 RowColLessThan(const int* rows, const int* cols)
55 : rows(rows), cols(cols) {
59 if (rows[x] == rows[y]) {
62 return (rows[x] < rows[y]);
65 const int* rows;
82 VLOG(1) << "# of rows: " << num_rows_
107 sort(index.begin(), index.end(), RowColLessThan(m.rows(), m.cols()));
109 VLOG(1) << "# of rows: " << num_rows_
121 ++rows_[m.rows()[idx] + 1];
220 // Walk the list of row blocks until we reach the new number of rows
256 rows_[num_rows_ + r] += m.rows()[r];
279 matrix->rows = rows_;
284 matrix->rows.resize(matrix->num_rows + 1);
285 matrix->cols.resize(matrix->rows[matrix->num_rows]);
286 matrix->values.resize(matrix->rows[matrix->num_rows]);
329 int* rows = matrix->mutable_rows();
339 *(rows++) = idx_cursor;
347 *rows = idx_cursor;
496 for (int idx1 = m.rows()[r]; idx1 < m.rows()[r + 1]; ++idx1) {
497 for (int idx2 = m.rows()[r]; idx2 <= idx1; ++idx2) {
519 const int* m_rows = m.rows();
