Lines Matching full:rows
61 // Count the number of non-zero entries and the number of rows in
63 for (int i = 0; i < block_structure_->rows.size(); ++i) {
64 int row_block_size = block_structure_->rows[i].block.size;
67 const vector<Cell>& cells = block_structure_->rows[i].cells;
92 for (int i = 0; i < block_structure_->rows.size(); ++i) {
93 int row_block_pos = block_structure_->rows[i].block.position;
94 int row_block_size = block_structure_->rows[i].block.size;
95 const vector<Cell>& cells = block_structure_->rows[i].cells;
112 for (int i = 0; i < block_structure_->rows.size(); ++i) {
113 int row_block_pos = block_structure_->rows[i].block.position;
114 int row_block_size = block_structure_->rows[i].block.size;
115 const vector<Cell>& cells = block_structure_->rows[i].cells;
131 for (int i = 0; i < block_structure_->rows.size(); ++i) {
132 int row_block_size = block_structure_->rows[i].block.size;
133 const vector<Cell>& cells = block_structure_->rows[i].cells;
148 for (int i = 0; i < block_structure_->rows.size(); ++i) {
149 int row_block_size = block_structure_->rows[i].block.size;
150 const vector<Cell>& cells = block_structure_->rows[i].cells;
169 for (int i = 0; i < block_structure_->rows.size(); ++i) {
170 int row_block_pos = block_structure_->rows[i].block.position;
171 int row_block_size = block_structure_->rows[i].block.size;
172 const vector<Cell>& cells = block_structure_->rows[i].cells;
192 for (int i = 0; i < block_structure_->rows.size(); ++i) {
193 int row_block_pos = block_structure_->rows[i].block.position;
194 int row_block_size = block_structure_->rows[i].block.size;
195 const vector<Cell>& cells = block_structure_->rows[i].cells;
222 for (int i = 0; i < block_structure_->rows.size(); ++i) {
223 const int row_block_pos = block_structure_->rows[i].block.position;
224 const int row_block_size = block_structure_->rows[i].block.size;
225 const vector<Cell>& cells = block_structure_->rows[i].cells;
