Searched refs:ProblemImpl (Results 1 - 25 of 25) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dgradient_checking_cost_function.h41 class ProblemImpl;
66 // Create a new ProblemImpl object from the input problem_impl, where
68 // GradientCheckingCostFunctions. This gives us a ProblemImpl object
78 ProblemImpl* CreateGradientCheckingProblemImpl(ProblemImpl* problem_impl,
H A Dsolver_impl.h56 ProblemImpl* problem_impl,
60 ProblemImpl* problem_impl,
73 ProblemImpl* problem_impl,
90 ProblemImpl* problem_impl,
105 const ProblemImpl::ParameterMap& parameter_map,
110 const ProblemImpl* problem_impl,
120 const ProblemImpl::ParameterMap& parameter_map,
H A Dcovariance_impl.h56 ProblemImpl* problem);
64 ProblemImpl* problem);
76 ProblemImpl* problem_;
H A Dreorder_program.h46 bool ApplyOrdering(const ProblemImpl::ParameterMap& parameter_map,
77 const ProblemImpl::ParameterMap& parameter_map,
H A Dproblem_impl.cc93 ParameterBlock* ProblemImpl::InternalAddParameterBlock(double* values,
153 void ProblemImpl::InternalRemoveResidualBlock(ResidualBlock* residual_block) {
178 void ProblemImpl::DeleteBlock(ResidualBlock* residual_block) {
200 void ProblemImpl::DeleteBlock(ParameterBlock* parameter_block) {
210 ProblemImpl::ProblemImpl() : program_(new internal::Program) {} function in class:ceres::internal::ProblemImpl
211 ProblemImpl::ProblemImpl(const Problem::Options& options) function in class:ceres::internal::ProblemImpl
215 ProblemImpl::~ProblemImpl() {
[all...]
H A Dprogram.h43 class ProblemImpl;
185 friend class ProblemImpl;
H A Dproblem_impl.h64 class ProblemImpl { class in namespace:ceres::internal
69 ProblemImpl();
70 explicit ProblemImpl(const Problem::Options& options);
72 ~ProblemImpl();
214 CERES_DISALLOW_COPY_AND_ASSIGN(ProblemImpl);
H A Dcoordinate_descent_minimizer.h60 const ProblemImpl::ParameterMap& parameter_map,
H A Dprogram_test.cc79 ProblemImpl problem;
108 ProblemImpl problem;
133 ProblemImpl problem;
158 ProblemImpl problem;
185 ProblemImpl problem;
212 ProblemImpl problem;
252 ProblemImpl problem;
354 ProblemImpl problem;
396 ProblemImpl problem;
408 ProblemImpl proble
[all...]
H A Dreorder_program_test.cc62 ProblemImpl problem;
118 ProblemImpl problem;
140 ProblemImpl problem;
H A Dgradient_checking_cost_function.cc239 ProblemImpl* CreateGradientCheckingProblemImpl(ProblemImpl* problem_impl,
244 // ProblemImpl to take ownership of it and destroy it. The
255 ProblemImpl* gradient_checking_problem_impl = new ProblemImpl(
304 // ProblemImpl::AddResidualBlock can potentially take ownership of
H A Dsolver_impl_test.cc79 ProblemImpl problem(problem_options);
H A Dsolver_impl.cc185 ProblemImpl* problem_impl,
204 ProblemImpl* original_problem_impl,
210 ProblemImpl* problem_impl = original_problem_impl;
267 // ProblemImpl by wrapping the CostFunctions of problem_impl inside
270 scoped_ptr<ProblemImpl> gradient_checking_problem_impl;
292 const ProblemImpl::ParameterMap& parameter_map =
294 for (ProblemImpl::ParameterMap::const_iterator it = parameter_map.begin();
441 ProblemImpl* original_problem_impl,
446 ProblemImpl* problem_impl = original_problem_impl;
499 const ProblemImpl
[all...]
H A Dreorder_program.cc138 bool ApplyOrdering(const ProblemImpl::ParameterMap& parameter_map,
166 ProblemImpl::ParameterMap::const_iterator parameter_block_it =
312 const ProblemImpl::ParameterMap& parameter_map,
H A Dparameter_block.h51 class ProblemImpl;
390 // Necessary so ProblemImpl can clean up the parameterizations.
391 friend class ProblemImpl;
H A Dproblem.cc40 Problem::Problem() : problem_impl_(new internal::ProblemImpl) {}
42 : problem_impl_(new internal::ProblemImpl(options)) {}
H A Dcovariance_impl.cc90 ProblemImpl* problem) {
113 const ProblemImpl::ParameterMap& parameter_map = problem_->parameter_map();
159 const ProblemImpl::ParameterMap& parameter_map = problem_->parameter_map();
242 ProblemImpl* problem) {
249 const ProblemImpl::ParameterMap& parameter_map = problem->parameter_map();
H A Devaluator_test.cc111 // This program is straight from the ProblemImpl, and so has no index/offset
135 void EvaluateAndCompare(ProblemImpl *problem,
206 ProblemImpl problem;
591 ProblemImpl problem;
H A Dparameter_block_ordering_test.cc79 ProblemImpl problem_;
H A Dgradient_checking_cost_function_test.cc348 ProblemImpl problem_impl;
364 scoped_ptr<ProblemImpl> gradient_checking_problem_impl(
H A Dcoordinate_descent_minimizer.cc61 const ProblemImpl::ParameterMap& parameter_map,
H A Dproblem_test.cc375 // This tests against ProblemImpl instead of Problem in order to inspect the
382 problem.reset(new ProblemImpl(options));
473 scoped_ptr<ProblemImpl> problem;
883 const ProblemImpl &problem,
1149 ProblemImpl problem_;
H A Dsolver.cc325 internal::ProblemImpl* problem_impl = problem->problem_impl_.get();
H A Dcovariance_test.cc54 ProblemImpl problem;
/external/ceres-solver/include/ceres/
H A Dproblem.h60 class ProblemImpl;
464 internal::scoped_ptr<internal::ProblemImpl> problem_impl_;

Completed in 172 milliseconds