| /external/ceres-solver/internal/ceres/ |
| D | triplet_sparse_matrix_test.cc | 55 m.mutable_rows()[0] = 0; in TEST()
59 m.mutable_rows()[1] = 1; in TEST()
88 m.mutable_rows()[0] = 10; in TEST()
91 m.mutable_rows()[0] = 1; in TEST()
103 orig.mutable_rows()[0] = 0; in TEST()
107 orig.mutable_rows()[1] = 1; in TEST()
131 orig.mutable_rows()[0] = 0; in TEST()
135 orig.mutable_rows()[1] = 1; in TEST()
141 cpy.mutable_rows()[0] = 0; in TEST()
145 cpy.mutable_rows()[1] = 2; in TEST()
[all …]
|
| D | dynamic_compressed_row_sparse_matrix.cc | 87 mutable_rows()[i] = index_into_values_and_cols; in Finalize()
99 mutable_rows()[num_rows()] = index_into_values_and_cols; in Finalize()
|
| D | incomplete_lq_factorization_test.cc | 59 matrix.mutable_rows()[0] = 0; in TEST()
60 matrix.mutable_rows()[1] = 1; in TEST()
84 int* rows = matrix.mutable_rows(); in TEST()
|
| D | incomplete_lq_factorization.cc | 119 int* rows = matrix->mutable_rows(); in DropEntriesAndAddRow()
185 int* l_rows = l->mutable_rows(); in IncompleteLQFactorization()
189 int* q_rows = q.mutable_rows(); in IncompleteLQFactorization()
|
| D | suitesparse.cc | 62 triplet.i = reinterpret_cast<void*>(A->mutable_rows()); in CreateSparseMatrix()
84 triplet.j = reinterpret_cast<void*>(A->mutable_rows()); in CreateSparseMatrixTranspose()
102 m.p = reinterpret_cast<void*>(A->mutable_rows()); in CreateSparseMatrixTransposeView()
|
| D | cxsparse.cc | 173 At.p = A->mutable_rows(); in CreateSparseMatrixTransposeView()
186 tsm_wrapper.i = tsm->mutable_rows(); in CreateSparseMatrix()
|
| D | triplet_sparse_matrix.h | 93 int* mutable_rows() { return rows_.get(); } in mutable_rows() function
|
| D | block_random_access_diagonal_matrix.cc | 67 int* rows = tsm_->mutable_rows(); in BlockRandomAccessDiagonalMatrix()
|
| D | compressed_row_sparse_matrix.h | 110 int* mutable_rows() { return &rows_[0]; } in mutable_rows() function
|
| D | symmetric_linear_solver_test.cc | 91 int* Ai = A->mutable_rows(); in TEST()
|
| D | compressed_row_sparse_matrix.cc | 329 int* rows = matrix->mutable_rows(); in CreateBlockDiagonalMatrix()
361 int* transpose_rows = transpose->mutable_rows(); in Transpose()
436 int* crsm_rows = matrix->mutable_rows(); in CompressAndFillProgram()
|
| D | compressed_row_sparse_matrix_test.cc | 283 int* rows = matrix_->mutable_rows(); in SetUp()
350 int* rows = matrix.mutable_rows(); in TEST()
466 std::copy(rows.begin(), rows.end(), tsm.mutable_rows()); in CreateRandomCompressedRowSparseMatrix()
|
| D | program_test.cc | 272 int* rows = expected_block_sparse_jacobian.mutable_rows(); in TEST()
369 int* rows = expected_block_sparse_jacobian.mutable_rows(); in TEST()
|
| D | block_random_access_sparse_matrix.cc | 81 int* rows = tsm_->mutable_rows(); in BlockRandomAccessSparseMatrix()
|
| D | program.cc | 392 int* rows = tsm->mutable_rows(); in CreateJacobianBlockSparsityTranspose()
411 rows = tsm->mutable_rows(); in CreateJacobianBlockSparsityTranspose()
|
| D | linear_least_squares_problems.cc | 93 int* Ai = A->mutable_rows(); in LinearLeastSquaresProblem0()
192 int* rows = A->mutable_rows(); in LinearLeastSquaresProblem1()
|
| D | dynamic_compressed_row_sparse_matrix_test.cc | 100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows()); in InitialiseSparseMatrixReferences()
|
| D | compressed_row_jacobian_writer.cc | 114 int* rows = jacobian->mutable_rows(); in CreateJacobian()
|
| D | compressed_col_sparse_matrix_utils_test.cc | 134 int* rows = tsm.mutable_rows(); in TEST()
|
| D | sparse_normal_cholesky_solver.cc | 177 outer_product_->mutable_rows(), in SolveImplUsingEigen()
|
| D | triplet_sparse_matrix.cc | 248 m->mutable_rows()[i] = i; in CreateSparseDiagonalMatrix()
|
| D | block_sparse_matrix.cc | 203 matrix->mutable_rows()[jac_pos] = row_block_pos + r; in ToTripletSparseMatrix()
|
| D | schur_complement_solver.cc | 475 crsm.mutable_rows(), in SolveReducedLinearSystemUsingEigen()
|
| D | covariance_impl.cc | 322 int* rows = covariance_matrix_->mutable_rows(); in ComputeCovarianceSparsity()
|