Lines Matching full:rows
86 const int num_row_blocks = bs->rows.size();
104 // matrix should already have been ordered so that all rows
109 const int chunk_block_id = bs->rows[r].cells.front().block_id;
124 const CompressedRow& row = bs->rows[r + chunk.size];
228 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
293 // For rows with no e_blocks, the schur complement update reduces to
310 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
328 const CompressedRow& row = bs->rows[chunk.start + j];
336 (b + bs->rows[chunk.start + j].block.position, row.block.size);
378 const int e_block_id = bs->rows[chunk.start].cells.front().block_id;
381 int b_pos = bs->rows[row_block_counter].block.position;
384 const CompressedRow& row = bs->rows[row_block_counter + j];
409 // Given a Chunk - set of rows with the same e_block, e.g. in the
410 // following Chunk with two rows.
442 int b_pos = bs->rows[row_block_counter].block.position;
443 const int e_block_size = ete->rows();
445 // Iterate over the rows in this chunk, for each row, compute the
451 const CompressedRow& row = bs->rows[row_block_counter + j];
505 const int e_block_size = inverse_ete.rows();
547 // For rows with no e_blocks, the schur complement update reduces to S
548 // += F'F. This function iterates over the rows of A with no e_block,
560 for (; row_block_counter < bs->rows.size(); ++row_block_counter) {
561 const CompressedRow& row = bs->rows[row_block_counter];
582 // static structure of the matrix A only pays attention to rows with
583 // e_blocks. This is becase rows without e_blocks are rare and
586 // rows with e_blocks. Including them in the static structure
588 // dynamic. Since the number of rows without e_blocks is small, the
597 const CompressedRow& row = bs->rows[row_block_index];
650 const CompressedRow& row = bs->rows[row_block_index];
