Lines Matching full:cells
64 const vector<Cell>& cells = bs->rows[r].cells;
65 if (cells[0].block_id < num_col_blocks_a) {
101 const Cell& cell = bs->rows[r].cells[0];
118 // multiply by all the cells except the first one which is of type
120 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
126 const vector<Cell>& cells = bs->rows[r].cells;
127 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
128 const int col_block_id = cells[c].block_id;
132 values + cells[c].position, row_block_size, col_block_size,
146 const Cell& cell = bs->rows[r].cells[0];
163 // multiply by all the cells except the first one which is of type
165 // num_row_blocks - num_row_blocks_e row blocks), then all the cells
171 const vector<Cell>& cells = bs->rows[r].cells;
172 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
173 const int col_block_id = cells[c].block_id;
177 values + cells[c].position, row_block_size, col_block_size,
211 row.cells.push_back(Cell());
212 Cell& cell = row.cells.back();
253 const Cell& cell = bs->rows[r].cells[0];
258 block_diagonal_structure->rows[block_id].cells[0].position;
284 const vector<Cell>& cells = bs->rows[r].cells;
285 for (int c = (r < num_row_blocks_e_) ? 1 : 0; c < cells.size(); ++c) {
286 const int col_block_id = cells[c].block_id;
290 block_diagonal_structure->rows[diagonal_block_id].cells[0].position;
294 values + cells[c].position, row_block_size, col_block_size,
295 values + cells[c].position, row_block_size, col_block_size,
