Lines Matching full:matrix
201 void CompressedRowSparseMatrix::ToDenseMatrix(Matrix* dense_matrix) const {
236 << "Cannot append a matrix with row blocks to one without and vice versa."
237 << "This matrix has : " << row_blocks_.size() << " row blocks."
238 << "The matrix being appended has: " << m.row_blocks().size()
246 // Copy the contents of m into this matrix.
276 void CompressedRowSparseMatrix::ToCRSMatrix(CRSMatrix* matrix) const {
277 matrix->num_rows = num_rows_;
278 matrix->num_cols = num_cols_;
279 matrix->rows = rows_;
280 matrix->cols = cols_;
281 matrix->values = values_;
284 matrix->rows.resize(matrix->num_rows + 1);
285 matrix->cols.resize(matrix->rows[matrix->num_rows]);
286 matrix->values.resize(matrix->rows[matrix->num_rows]);
326 CompressedRowSparseMatrix* matrix =
329 int* rows = matrix->mutable_rows();
330 int* cols = matrix->mutable_cols();
331 double* values = matrix->mutable_values();
349 *matrix->mutable_row_blocks() = blocks;
350 *matrix->mutable_col_blocks() = blocks;
354 return matrix;
394 // A ProductTerm is a term in the outer product of a matrix with
433 CompressedRowSparseMatrix* matrix =
436 int* crsm_rows = matrix->mutable_rows();
438 int* crsm_cols = matrix->mutable_cols();
449 // result matrix), then they do not affect the sparsity structure of
450 // the result matrix.
474 return matrix;
