| /external/ceres-solver/internal/ceres/ |
| D | triplet_sparse_matrix_test.cc | 58 m.mutable_values()[0] = 2.5; in TEST()
62 m.mutable_values()[1] = 5.2; in TEST()
106 orig.mutable_values()[0] = 2.5; in TEST()
110 orig.mutable_values()[1] = 5.2; in TEST()
134 orig.mutable_values()[0] = 2.5; in TEST()
138 orig.mutable_values()[1] = 5.2; in TEST()
144 cpy.mutable_values()[0] = 10.22; in TEST()
148 cpy.mutable_values()[1] = 34.45; in TEST()
152 cpy.mutable_values()[0] = 10.22; in TEST()
156 cpy.mutable_values()[1] = 4.4; in TEST()
[all …]
|
| D | cxsparse.cc | 102 At.x = A->mutable_values(); in CreateSparseMatrixTransposeView()
114 tsm_wrapper.x = tsm->mutable_values(); in CreateSparseMatrix()
|
| D | block_random_access_sparse_matrix.cc | 83 double* values = tsm_->mutable_values(); in BlockRandomAccessSparseMatrix()
152 VectorRef(tsm_->mutable_values(), in SetZero()
|
| D | suitesparse_test.cc | 135 fill(tsm.mutable_values(), tsm.mutable_values() + 18, 1.0); in TEST()
|
| D | suitesparse.cc | 49 triplet.x = reinterpret_cast<void*>(A->mutable_values()); in CreateSparseMatrix()
71 triplet.x = reinterpret_cast<void*>(A->mutable_values()); in CreateSparseMatrixTranspose()
89 m->x = reinterpret_cast<void*>(A->mutable_values()); in CreateSparseMatrixTransposeView()
|
| D | block_random_access_dense_matrix.h | 84 double* mutable_values() { return values_.get(); } in mutable_values() function
|
| D | sparse_matrix.h | 103 virtual double* mutable_values() = 0;
|
| D | block_evaluate_preparer.cc | 64 down_cast<BlockSparseMatrix*>(jacobian)->mutable_values(); in Prepare()
|
| D | dense_sparse_matrix.h | 79 virtual double* mutable_values() { return m_.data(); } in mutable_values() function
|
| D | linear_least_squares_problems.cc | 165 double* Ax = A->mutable_values(); in LinearLeastSquaresProblem0()
264 double* values = A->mutable_values(); in LinearLeastSquaresProblem1()
457 memcpy(A->mutable_values(), values.get(), nnz * sizeof(*A->values())); in LinearLeastSquaresProblem2()
561 memcpy(A->mutable_values(), values.get(), nnz * sizeof(*A->values())); in LinearLeastSquaresProblem3()
|
| D | block_sparse_matrix.h | 122 virtual double* mutable_values() { return values_.get(); } in mutable_values() function
|
| D | compressed_row_sparse_matrix.h | 101 virtual double* mutable_values() { return values_.get(); } in mutable_values() function
|
| D | triplet_sparse_matrix.h | 76 virtual double* mutable_values() { return values_.get(); } in mutable_values() function
|
| D | symmetric_linear_solver_test.cc | 93 double* Ax = A->mutable_values(); in TEST()
|
| D | partitioned_matrix_view.cc | 277 MatrixRef(block_diagonal->mutable_values() + cell_position, in UpdateBlockDiagonalEtE()
308 MatrixRef(block_diagonal->mutable_values() + cell_position, in UpdateBlockDiagonalFtF()
|
| D | compressed_row_jacobian_writer.cc | 161 double* jacobian_values = jacobian->mutable_values(); in Write()
|
| D | implicit_schur_complement_test.cc | 99 MatrixRef lhs_ref(blhs.mutable_values(), num_schur_rows, num_schur_rows); in ReducedLinearSystemAndSolution()
|
| D | implicit_schur_complement.cc | 154 MatrixRef m(block_diagonal->mutable_values() + cell.position, in AddDiagonalAndInvert()
|
| D | schur_eliminator_test.cc | 166 MatrixRef lhs_ref(lhs.mutable_values(), lhs.num_rows(), lhs.num_cols()); in EliminateSolveAndCompare()
|
| D | triplet_sparse_matrix.cc | 293 m->mutable_values()[i] = values[i]; in CreateSparseDiagonalMatrix()
|
| D | block_sparse_matrix.cc | 232 matrix->mutable_values()[jac_pos] = values_[jac_pos]; in ToTripletSparseMatrix()
|
| D | evaluator_test.cc | 243 VectorRef(sparse_matrix->mutable_values(), in SetSparseMatrixConstant()
|