Lines Matching refs:num_nonzeros
96 cols_.resize(m.num_nonzeros(), 0);
100 vector<int> index(m.num_nonzeros(), 0);
101 for (int i = 0; i < m.num_nonzeros(); ++i) {
119 for (int i = 0; i < m.num_nonzeros(); ++i) {
131 CHECK_EQ(num_nonzeros(), m.num_nonzeros());
151 CHECK_EQ(num_nonzeros(), num_rows);
241 if (cols_.size() < num_nonzeros() + m.num_nonzeros()) {
242 cols_.resize(num_nonzeros() + m.num_nonzeros());
243 values_.resize(num_nonzeros() + m.num_nonzeros());
247 copy(m.cols(), m.cols() + m.num_nonzeros(), &cols_[num_nonzeros()]);
248 copy(m.values(), m.values() + m.num_nonzeros(), &values_[num_nonzeros()]);
289 void CompressedRowSparseMatrix::SetMaxNumNonZeros(int num_nonzeros) {
290 CHECK_GE(num_nonzeros, 0);
292 cols_.resize(num_nonzeros);
293 values_.resize(num_nonzeros);
320 int num_nonzeros = 0;
323 num_nonzeros += blocks[i] * blocks[i];
327 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros);
332 fill(values, values + num_nonzeros, 0.0);
352 CHECK_EQ(idx_cursor, num_nonzeros);
359 new CompressedRowSparseMatrix(num_cols_, num_rows_, num_nonzeros());
365 for (int idx = 0; idx < num_nonzeros(); ++idx) {
425 int num_nonzeros = 1;
429 ++num_nonzeros;
434 new CompressedRowSparseMatrix(num_rows, num_cols, num_nonzeros);
439 std::fill(crsm_cols, crsm_cols + num_nonzeros, 0);
484 CHECK_GT(m.num_nonzeros(), 0) << "Congratulations, "
