Lines Matching defs:block

75     const Block& block = bs->cols[c];
77 num_cols_e_ += block.size;
79 num_cols_f_ += block.size;
103 // by the first cell in each row block.
107 const int row_block_pos = bs->rows[r].block.position;
108 const int row_block_size = bs->rows[r].block.size;
125 // Iterate over row blocks, and if the row block is in E, then
127 // E. If the row block is not in E (i.e its in the bottom
132 const int row_block_pos = bs->rows[r].block.position;
133 const int row_block_size = bs->rows[r].block.size;
147 const int row_block_pos = bs->rows[r].block.position;
148 const int row_block_size = bs->rows[r].block.size;
169 // by the first cell in each row block.
173 const int row_block_pos = bs->rows[r].block.position;
174 const int row_block_size = bs->rows[r].block.size;
191 // Iterate over row blocks, and if the row block is in E, then
193 // E. If the row block is not in E (i.e its in the bottom
198 const int row_block_pos = bs->rows[r].block.position;
199 const int row_block_size = bs->rows[r].block.size;
213 const int row_block_pos = bs->rows[r].block.position;
214 const int row_block_size = bs->rows[r].block.size;
228 // Given a range of columns blocks of a matrix m, compute the block
229 // structure of the block diagonal of the matrix m(:,
231 // and return a BlockSparseMatrix with the this block structure. The
244 // Iterate over the column blocks, creating a new diagonal block for
245 // each column block.
247 const Block& block = bs->cols[c];
250 diagonal_block.size = block.size;
255 row.block = diagonal_block;
262 block_position += block.size;
263 diagonal_cell_position += block.size * block.size;
266 // Build a BlockSparseMatrix with the just computed block
310 const int row_block_size = bs->rows[r].block.size;
341 const int row_block_size = bs->rows[r].block.size;
360 const int row_block_size = bs->rows[r].block.size;