| /external/ceres-solver/internal/ceres/ |
| D | compressed_row_sparse_matrix.cc | 96 cols_.resize(m.num_nonzeros(), 0); in CompressedRowSparseMatrix()
100 vector<int> index(m.num_nonzeros(), 0); in CompressedRowSparseMatrix()
101 for (int i = 0; i < m.num_nonzeros(); ++i) { in CompressedRowSparseMatrix()
119 for (int i = 0; i < m.num_nonzeros(); ++i) { in CompressedRowSparseMatrix()
131 CHECK_EQ(num_nonzeros(), m.num_nonzeros()); in CompressedRowSparseMatrix()
151 CHECK_EQ(num_nonzeros(), num_rows); in CompressedRowSparseMatrix()
241 if (cols_.size() < num_nonzeros() + m.num_nonzeros()) { in AppendRows()
242 cols_.resize(num_nonzeros() + m.num_nonzeros()); in AppendRows()
243 values_.resize(num_nonzeros() + m.num_nonzeros()); in AppendRows()
247 copy(m.cols(), m.cols() + m.num_nonzeros(), &cols_[num_nonzeros()]); in AppendRows()
[all …]
|
| D | block_random_access_diagonal_matrix.cc | 53 int num_nonzeros = 0; in BlockRandomAccessDiagonalMatrix() local
58 num_nonzeros += blocks_[i] * blocks_[i]; in BlockRandomAccessDiagonalMatrix()
63 << "] " << num_nonzeros; in BlockRandomAccessDiagonalMatrix()
65 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros)); in BlockRandomAccessDiagonalMatrix()
66 tsm_->set_num_nonzeros(num_nonzeros); in BlockRandomAccessDiagonalMatrix()
113 if (tsm_->num_nonzeros()) { in SetZero()
115 tsm_->num_nonzeros()).setZero(); in SetZero()
|
| D | block_random_access_sparse_matrix_test.cc | 49 int num_nonzeros = 0; in TEST() local
51 num_nonzeros += blocks[0] * blocks[0]; in TEST()
54 num_nonzeros += blocks[1] * blocks[1]; in TEST()
57 num_nonzeros += blocks[1] * blocks[2]; in TEST()
60 num_nonzeros += blocks[2] * blocks[0]; in TEST()
92 EXPECT_EQ(tsm->num_nonzeros(), num_nonzeros); in TEST()
93 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros); in TEST()
|
| D | block_random_access_sparse_matrix.cc | 66 int num_nonzeros = 0; in BlockRandomAccessSparseMatrix() local
72 num_nonzeros += row_block_size * col_block_size; in BlockRandomAccessSparseMatrix()
77 << "] " << num_nonzeros; in BlockRandomAccessSparseMatrix()
79 tsm_.reset(new TripletSparseMatrix(num_cols, num_cols, num_nonzeros)); in BlockRandomAccessSparseMatrix()
80 tsm_->set_num_nonzeros(num_nonzeros); in BlockRandomAccessSparseMatrix()
151 if (tsm_->num_nonzeros()) { in SetZero()
153 tsm_->num_nonzeros()).setZero(); in SetZero()
|
| D | dynamic_compressed_row_sparse_matrix_test.cc | 73 int num_nonzeros = 0; in InitialiseDenseReference() local
78 ++num_nonzeros; in InitialiseDenseReference()
81 ASSERT_EQ(num_nonzeros, expected_num_nonzeros); in InitialiseDenseReference()
129 EXPECT_EQ(dcrsm->num_nonzeros(), 0); in ExpectEmpty()
151 ConstIntVectorRef crsm_cols(crsm->cols(), crsm->num_nonzeros()); in ExpectEqualToCompressedRowSparseMatrixReference()
152 ConstIntVectorRef dcrsm_cols(dcrsm->cols(), dcrsm->num_nonzeros()); in ExpectEqualToCompressedRowSparseMatrixReference()
155 ConstVectorRef crsm_values(crsm->values(), crsm->num_nonzeros()); in ExpectEqualToCompressedRowSparseMatrixReference()
156 ConstVectorRef dcrsm_values(dcrsm->values(), dcrsm->num_nonzeros()); in ExpectEqualToCompressedRowSparseMatrixReference()
|
| D | triplet_sparse_matrix_test.cc | 43 EXPECT_EQ(m.num_nonzeros(), 0); in TEST()
52 EXPECT_EQ(m.num_nonzeros(), 0); in TEST()
64 EXPECT_EQ(m.num_nonzeros(), 2); in TEST()
97 EXPECT_EQ(m.num_nonzeros(), 0); in TEST()
116 ASSERT_EQ(cpy.num_nonzeros(), 2); in TEST()
162 ASSERT_EQ(cpy.num_nonzeros(), 2); in TEST()
207 ASSERT_EQ(m.num_nonzeros(), 5); in TEST()
260 ASSERT_EQ(m.num_nonzeros(), 5); in TEST()
290 ASSERT_EQ(m->num_nonzeros(), 10); in TEST()
312 ASSERT_EQ(m.num_nonzeros(), 30); in TEST()
|
| D | incomplete_lq_factorization.cc | 122 int num_nonzeros = rows[matrix->num_rows()]; in DropEntriesAndAddRow() local
126 rows[matrix->num_rows()] = num_nonzeros; in DropEntriesAndAddRow()
154 cols[num_nonzeros] = entry.first; in DropEntriesAndAddRow()
155 values[num_nonzeros] = entry.second; in DropEntriesAndAddRow()
156 ++num_nonzeros; in DropEntriesAndAddRow()
160 rows[matrix->num_rows()] = num_nonzeros; in DropEntriesAndAddRow()
230 l_cols[l->num_nonzeros()] = i; in IncompleteLQFactorization()
231 l_values[l->num_nonzeros()] = NormalizeRow(i, &q); in IncompleteLQFactorization()
|
| D | incomplete_lq_factorization_test.cc | 51 for (int i = 0; i < actual.num_nonzeros(); ++i) { in ExpectMatricesAreEqual()
139 EXPECT_EQ(matrix.num_nonzeros(), 1); in TEST()
147 EXPECT_EQ(matrix.num_nonzeros(), 7); in TEST()
157 EXPECT_EQ(matrix.num_nonzeros(), 10); in TEST()
171 EXPECT_EQ(matrix.num_nonzeros(), 14); in TEST()
187 EXPECT_EQ(matrix.num_nonzeros(), 16); in TEST()
|
| D | block_random_access_diagonal_matrix_test.cc | 48 const int num_nonzeros = 3 * 3 + 4 * 4 + 5 * 5; in TEST() local
88 EXPECT_EQ(tsm->num_nonzeros(), num_nonzeros); in TEST()
89 EXPECT_EQ(tsm->max_num_nonzeros(), num_nonzeros); in TEST()
|
| D | program.cc | 391 int num_nonzeros = 0; in CreateJacobianBlockSparsityTranspose() local
408 if (num_nonzeros >= tsm->max_num_nonzeros()) { in CreateJacobianBlockSparsityTranspose()
409 tsm->set_num_nonzeros(num_nonzeros); in CreateJacobianBlockSparsityTranspose()
410 tsm->Reserve(2 * num_nonzeros); in CreateJacobianBlockSparsityTranspose()
417 rows[num_nonzeros] = r; in CreateJacobianBlockSparsityTranspose()
418 cols[num_nonzeros] = c; in CreateJacobianBlockSparsityTranspose()
419 values[num_nonzeros] = 1.0; in CreateJacobianBlockSparsityTranspose()
420 ++num_nonzeros; in CreateJacobianBlockSparsityTranspose()
424 tsm->set_num_nonzeros(num_nonzeros); in CreateJacobianBlockSparsityTranspose()
|
| D | dense_sparse_matrix.cc | 70 int num_nonzeros = m.num_nonzeros(); in DenseSparseMatrix() local
72 for (int i = 0; i < num_nonzeros; ++i) { in DenseSparseMatrix()
140 int DenseSparseMatrix::num_nonzeros() const { in num_nonzeros() function in ceres::internal::DenseSparseMatrix
|
| D | block_sparse_matrix_test.cc | 59 CHECK_EQ(A_->num_nonzeros(), B_->num_nonzeros()); in SetUp()
68 EXPECT_EQ(13, A_->num_nonzeros()); in TEST_F()
|
| D | covariance_impl.cc | 282 int num_nonzeros = 0; in ComputeCovarianceSparsity() local
296 num_nonzeros += size1 * size2; in ComputeCovarianceSparsity()
320 new CompressedRowSparseMatrix(num_rows, num_rows, num_nonzeros)); in ComputeCovarianceSparsity()
418 const int num_nonzeros = jacobian.values.size(); in ComputeCovarianceValuesUsingSuiteSparseQR() local
421 vector<SuiteSparse_long> transpose_cols(num_nonzeros, 0); in ComputeCovarianceValuesUsingSuiteSparseQR()
422 vector<double> transpose_values(num_nonzeros, 0); in ComputeCovarianceValuesUsingSuiteSparseQR()
424 for (int idx = 0; idx < num_nonzeros; ++idx) { in ComputeCovarianceValuesUsingSuiteSparseQR()
450 cholmod_jacobian.nzmax = num_nonzeros; in ComputeCovarianceValuesUsingSuiteSparseQR()
|
| D | triplet_sparse_matrix.h | 66 virtual int num_nonzeros() const { return num_nonzeros_; } in num_nonzeros() function
69 virtual void set_num_nonzeros(int num_nonzeros);
|
| D | triplet_sparse_matrix.cc | 135 void TripletSparseMatrix::set_num_nonzeros(int num_nonzeros) { in set_num_nonzeros() argument
136 CHECK_GE(num_nonzeros, 0); in set_num_nonzeros()
137 CHECK_LE(num_nonzeros, max_num_nonzeros_); in set_num_nonzeros()
138 num_nonzeros_ = num_nonzeros; in set_num_nonzeros()
|
| D | cxsparse.cc | 172 At.nzmax = A->num_nonzeros(); in CreateSparseMatrixTransposeView()
181 tsm_wrapper.nzmax = tsm->num_nonzeros(); in CreateSparseMatrix()
182 tsm_wrapper.nz = tsm->num_nonzeros(); in CreateSparseMatrix()
|
| D | compressed_row_sparse_matrix_test.cc | 224 EXPECT_EQ(crsm->num_nonzeros(), crs_matrix.cols.size()); in TEST_F()
225 EXPECT_EQ(crsm->num_nonzeros(), crs_matrix.values.size()); in TEST_F()
231 for (int i = 0; i < crsm->num_nonzeros(); ++i) { in TEST_F()
254 EXPECT_EQ(matrix->num_nonzeros(), 9); in TEST()
463 const int num_nonzeros = values.size(); in CreateRandomCompressedRowSparseMatrix() local
465 TripletSparseMatrix tsm(num_rows, num_cols, num_nonzeros); in CreateRandomCompressedRowSparseMatrix()
469 tsm.set_num_nonzeros(num_nonzeros); in CreateRandomCompressedRowSparseMatrix()
|
| D | compressed_row_sparse_matrix.h | 91 virtual int num_nonzeros() const { return rows_[num_rows_]; } in num_nonzeros() function
119 void SetMaxNumNonZeros(int num_nonzeros);
|
| D | suitesparse.cc | 61 triplet.nnz = A->num_nonzeros(); in CreateSparseMatrix()
81 triplet.nnz = A->num_nonzeros(); in CreateSparseMatrixTranspose()
100 m.nzmax = A->num_nonzeros(); in CreateSparseMatrixTransposeView()
|
| D | sparse_matrix.h | 101 virtual int num_nonzeros() const = 0;
|
| D | block_sparse_matrix.h | 80 virtual int num_nonzeros() const { return num_nonzeros_; } in num_nonzeros() function
|
| D | dense_sparse_matrix.h | 69 virtual int num_nonzeros() const;
|
| D | iterative_schur_complement_solver_test.cc | 78 A_->num_nonzeros()); in TestSolver()
|
| D | covariance_test.cc | 105 EXPECT_EQ(crsm->num_nonzeros(), 40); in TEST()
116 for (int c = 0; c < crsm->num_nonzeros(); ++c) { in TEST()
|
| D | schur_complement_solver_test.cc | 73 A->num_nonzeros()); in SetUpFromProblemId()
|