| /external/ceres-solver/internal/ceres/ |
| block_sparse_matrix.h | 80 virtual int num_nonzeros() const { return num_nonzeros_; } function in class:ceres::internal::BlockSparseMatrix
|
| block_random_access_sparse_matrix.cc | 66 int num_nonzeros = 0; local
72 num_nonzeros += row_block_size * col_block_size;
77 << "] " << num_nonzeros; local
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros));
80 tsm_->set_num_nonzeros(num_nonzeros);
151 if (tsm_->num_nonzeros()) {
153 tsm_->num_nonzeros()).setZero();
|
| block_random_access_crs_matrix.cc | 67 int num_nonzeros = 0; local
73 num_nonzeros += row_block_size * col_block_size;
78 << "] " << num_nonzeros; local
80 crsm_.reset(new CompressedRowSparseMatrix(num_cols, num_cols, num_nonzeros));
|
| block_random_access_crs_matrix_test.cc | 49 int num_nonzeros = 0; local
51 num_nonzeros += blocks[0] * blocks[0];
54 num_nonzeros += blocks[1] * blocks[1];
57 num_nonzeros += blocks[1] * blocks[2];
60 num_nonzeros += blocks[2] * blocks[0];
90 EXPECT_EQ(crsm->num_nonzeros(), num_nonzeros);
|
| block_random_access_sparse_matrix_test.cc | 49 int num_nonzeros = 0; local
51 num_nonzeros += blocks[0] * blocks[0];
54 num_nonzeros += blocks[1] * blocks[1];
57 num_nonzeros += blocks[1] * blocks[2];
60 num_nonzeros += blocks[2] * blocks[0];
92 EXPECT_EQ(tsm->num_nonzeros(), num_nonzeros);
93 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros);
|
| compressed_row_sparse_matrix.h | 91 virtual int num_nonzeros() const { return rows_[num_rows_]; } function in class:ceres::internal::CompressedRowSparseMatrix
|
| dense_sparse_matrix.cc | 70 int num_nonzeros = m.num_nonzeros(); local
72 for (int i = 0; i < num_nonzeros; ++i) {
140 int DenseSparseMatrix::num_nonzeros() const { function in class:ceres::internal::DenseSparseMatrix
|
| triplet_sparse_matrix.h | 66 virtual int num_nonzeros() const { return num_nonzeros_; } function in class:ceres::internal::TripletSparseMatrix
69 virtual void set_num_nonzeros(int num_nonzeros);
|
| compressed_row_sparse_matrix.cc | 95 cols_.resize(m.num_nonzeros(), 0);
99 vector<int> index(m.num_nonzeros(), 0);
100 for (int i = 0; i < m.num_nonzeros(); ++i) {
118 for (int i = 0; i < m.num_nonzeros(); ++i) {
130 CHECK_EQ(num_nonzeros(), m.num_nonzeros());
150 CHECK_EQ(num_nonzeros(), num_rows);
223 if (cols_.size() < num_nonzeros() + m.num_nonzeros()) {
224 cols_.resize(num_nonzeros() + m.num_nonzeros())
294 int num_nonzeros = 0; local
[all...] |
| incomplete_lq_factorization.cc | 122 int num_nonzeros = rows[matrix->num_rows()]; local
126 rows[matrix->num_rows()] = num_nonzeros;
154 cols[num_nonzeros] = entry.first;
155 values[num_nonzeros] = entry.second;
156 ++num_nonzeros;
160 rows[matrix->num_rows()] = num_nonzeros;
230 l_cols[l->num_nonzeros()] = i;
231 l_values[l->num_nonzeros()] = NormalizeRow(i, &q);
|
| covariance_impl.cc | 296 int num_nonzeros = 0; local
310 num_nonzeros += size1 * size2;
334 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros));
607 const int num_nonzeros = jacobian.values.size(); local
610 vector<SuiteSparse_long> transpose_cols(num_nonzeros, 0);
611 vector<double> transpose_values(num_nonzeros, 0);
613 for (int idx = 0; idx < num_nonzeros; ++idx) {
639 cholmod_jacobian.nzmax = num_nonzeros;
|
| solver_impl.cc | 1543 int num_nonzeros = 0; local
[all...] |
