| /external/ceres-solver/internal/ceres/ |
| D | triplet_sparse_matrix_test.cc | 56 m.mutable_cols()[0] = 1; in TEST()
60 m.mutable_cols()[1] = 4; in TEST()
92 m.mutable_cols()[0] = 100; in TEST()
104 orig.mutable_cols()[0] = 1; in TEST()
108 orig.mutable_cols()[1] = 4; in TEST()
132 orig.mutable_cols()[0] = 1; in TEST()
136 orig.mutable_cols()[1] = 4; in TEST()
142 cpy.mutable_cols()[0] = 10; in TEST()
146 cpy.mutable_cols()[1] = 23; in TEST()
150 cpy.mutable_cols()[0] = 10; in TEST()
[all …]
|
| D | incomplete_lq_factorization.cc | 120 int* cols = matrix->mutable_cols(); in DropEntriesAndAddRow()
186 int* l_cols = l->mutable_cols(); in IncompleteLQFactorization()
190 int* q_cols = q.mutable_cols(); in IncompleteLQFactorization()
|
| D | suitesparse.cc | 63 triplet.j = reinterpret_cast<void*>(A->mutable_cols()); in CreateSparseMatrix()
85 triplet.i = reinterpret_cast<void*>(A->mutable_cols()); in CreateSparseMatrixTranspose()
103 m.i = reinterpret_cast<void*>(A->mutable_cols()); in CreateSparseMatrixTransposeView()
|
| D | cxsparse.cc | 174 At.i = A->mutable_cols(); in CreateSparseMatrixTransposeView()
185 tsm_wrapper.p = tsm->mutable_cols(); in CreateSparseMatrix()
|
| D | incomplete_lq_factorization_test.cc | 61 matrix.mutable_cols()[0] = 0; in TEST()
85 int* cols = matrix.mutable_cols(); in TEST()
|
| D | triplet_sparse_matrix.h | 94 int* mutable_cols() { return cols_.get(); } in mutable_cols() function
|
| D | block_random_access_diagonal_matrix.cc | 68 int* cols = tsm_->mutable_cols(); in BlockRandomAccessDiagonalMatrix()
|
| D | dynamic_compressed_row_sparse_matrix.cc | 90 memcpy(mutable_cols() + index_into_values_and_cols, in Finalize()
|
| D | symmetric_linear_solver_test.cc | 92 int* Aj = A->mutable_cols(); in TEST()
|
| D | compressed_row_sparse_matrix.h | 107 int* mutable_cols() { return &cols_[0]; } in mutable_cols() function
|
| D | compressed_row_sparse_matrix.cc | 330 int* cols = matrix->mutable_cols(); in CreateBlockDiagonalMatrix()
362 int* transpose_cols = transpose->mutable_cols(); in Transpose()
438 int* crsm_cols = matrix->mutable_cols(); in CompressAndFillProgram()
|
| D | compressed_row_sparse_matrix_test.cc | 284 int* cols = matrix_->mutable_cols(); in SetUp()
351 int* cols = matrix.mutable_cols(); in TEST()
467 std::copy(cols.begin(), cols.end(), tsm.mutable_cols()); in CreateRandomCompressedRowSparseMatrix()
|
| D | program_test.cc | 273 int* cols = expected_block_sparse_jacobian.mutable_cols(); in TEST()
370 int* cols = expected_block_sparse_jacobian.mutable_cols(); in TEST()
|
| D | block_random_access_sparse_matrix.cc | 82 int* cols = tsm_->mutable_cols(); in BlockRandomAccessSparseMatrix()
|
| D | program.cc | 393 int* cols = tsm->mutable_cols(); in CreateJacobianBlockSparsityTranspose()
412 cols = tsm->mutable_cols(); in CreateJacobianBlockSparsityTranspose()
|
| D | linear_least_squares_problems.cc | 94 int* Aj = A->mutable_cols(); in LinearLeastSquaresProblem0()
193 int* cols = A->mutable_cols(); in LinearLeastSquaresProblem1()
|
| D | dynamic_compressed_row_sparse_matrix_test.cc | 101 std::copy(cols.begin(), cols.end(), tsm->mutable_cols()); in InitialiseSparseMatrixReferences()
|
| D | compressed_row_jacobian_writer.cc | 115 int* cols = jacobian->mutable_cols(); in CreateJacobian()
|
| D | compressed_col_sparse_matrix_utils_test.cc | 135 int* cols = tsm.mutable_cols(); in TEST()
|
| D | triplet_sparse_matrix.cc | 249 m->mutable_cols()[i] = i; in CreateSparseDiagonalMatrix()
|
| D | sparse_normal_cholesky_solver.cc | 178 outer_product_->mutable_cols(), in SolveImplUsingEigen()
|
| D | block_sparse_matrix.cc | 204 matrix->mutable_cols()[jac_pos] = col_block_pos + c; in ToTripletSparseMatrix()
|
| D | schur_complement_solver.cc | 476 crsm.mutable_cols(), in SolveReducedLinearSystemUsingEigen()
|
| D | covariance_impl.cc | 323 int* cols = covariance_matrix_->mutable_cols(); in ComputeCovarianceSparsity()
|