Lines Matching refs:rows_
77 rows_.resize(num_rows + 1, 0);
95 rows_.resize(num_rows_ + 1, 0);
121 ++rows_[m.rows()[idx] + 1];
128 rows_[i] += rows_[i - 1];
140 rows_.resize(num_rows + 1);
144 rows_[0] = 0;
148 rows_[i + 1] = i + 1;
167 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
178 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
188 for (int idx = 0; idx < rows_[num_rows_]; ++idx) {
196 for (int idx = 0; idx < rows_[num_rows_]; ++idx) {
207 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
218 rows_.resize(num_rows_ + 1);
249 rows_.resize(num_rows_ + m.num_rows() + 1);
250 // new_rows = [rows_, m.row() + rows_[num_rows_]]
251 fill(rows_.begin() + num_rows_,
252 rows_.begin() + num_rows_ + m.num_rows() + 1,
253 rows_[num_rows_]);
256 rows_[num_rows_ + r] += m.rows()[r];
266 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
279 matrix->rows = rows_;
299 for (int idx = rows_[r]; idx < rows_[r + 1] - 1; ++idx) {
302 solution[r] /= values_[rows_[r + 1] - 1];
309 solution[r] /= values_[rows_[r + 1] - 1];
310 for (int idx = rows_[r + 1] - 2; idx >= rows_[r]; --idx) {
374 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx) {
