Lines Matching refs:block
75 const Block& block = bs->cols[c];
77 num_cols_e_ += block.size;
79 num_cols_f_ += block.size;
98 // by the first cell in each row block.
102 const int row_block_pos = bs->rows[r].block.position;
103 const int row_block_size = bs->rows[r].block.size;
117 // Iterate over row blocks, and if the row block is in E, then
119 // E. If the row block is not in E (i.e its in the bottom
124 const int row_block_pos = bs->rows[r].block.position;
125 const int row_block_size = bs->rows[r].block.size;
143 // by the first cell in each row block.
147 const int row_block_pos = bs->rows[r].block.position;
148 const int row_block_size = bs->rows[r].block.size;
162 // Iterate over row blocks, and if the row block is in E, then
164 // E. If the row block is not in E (i.e its in the bottom
169 const int row_block_pos = bs->rows[r].block.position;
170 const int row_block_size = bs->rows[r].block.size;
184 // Given a range of columns blocks of a matrix m, compute the block
185 // structure of the block diagonal of the matrix m(:,
187 // and return a BlockSparseMatrix with the this block structure. The
198 // Iterate over the column blocks, creating a new diagonal block for
199 // each column block.
201 const Block& block = bs->cols[c];
202 block_diagonal_structure->cols.push_back(Block());
203 Block& diagonal_block = block_diagonal_structure->cols.back();
204 diagonal_block.size = block.size;
209 row.block = diagonal_block;
216 block_position += block.size;
217 diagonal_cell_position += block.size * block.size;
220 // Build a BlockSparseMatrix with the just computed block
254 const int row_block_size = bs->rows[r].block.size;
283 const int row_block_size = bs->rows[r].block.size;
