/external/ceres-solver/internal/ceres/ |
H A D | gradient_checking_cost_function.h | 41 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 D | solver_impl.h | 56 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 D | covariance_impl.h | 56 ProblemImpl* problem); 64 ProblemImpl* problem); 76 ProblemImpl* problem_;
|
H A D | reorder_program.h | 46 bool ApplyOrdering(const ProblemImpl::ParameterMap& parameter_map, 77 const ProblemImpl::ParameterMap& parameter_map,
|
H A D | problem_impl.cc | 93 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 D | program.h | 43 class ProblemImpl; 185 friend class ProblemImpl;
|
H A D | problem_impl.h | 64 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 D | coordinate_descent_minimizer.h | 60 const ProblemImpl::ParameterMap& parameter_map,
|
H A D | program_test.cc | 79 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 D | reorder_program_test.cc | 62 ProblemImpl problem; 118 ProblemImpl problem; 140 ProblemImpl problem;
|
H A D | gradient_checking_cost_function.cc | 239 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 D | solver_impl_test.cc | 79 ProblemImpl problem(problem_options);
|
H A D | solver_impl.cc | 185 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 D | reorder_program.cc | 138 bool ApplyOrdering(const ProblemImpl::ParameterMap& parameter_map, 166 ProblemImpl::ParameterMap::const_iterator parameter_block_it = 312 const ProblemImpl::ParameterMap& parameter_map,
|
H A D | parameter_block.h | 51 class ProblemImpl; 390 // Necessary so ProblemImpl can clean up the parameterizations. 391 friend class ProblemImpl;
|
H A D | problem.cc | 40 Problem::Problem() : problem_impl_(new internal::ProblemImpl) {} 42 : problem_impl_(new internal::ProblemImpl(options)) {}
|
H A D | covariance_impl.cc | 90 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 D | evaluator_test.cc | 111 // 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 D | parameter_block_ordering_test.cc | 79 ProblemImpl problem_;
|
H A D | gradient_checking_cost_function_test.cc | 348 ProblemImpl problem_impl; 364 scoped_ptr<ProblemImpl> gradient_checking_problem_impl(
|
H A D | coordinate_descent_minimizer.cc | 61 const ProblemImpl::ParameterMap& parameter_map,
|
H A D | problem_test.cc | 375 // 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 D | solver.cc | 325 internal::ProblemImpl* problem_impl = problem->problem_impl_.get();
|
H A D | covariance_test.cc | 54 ProblemImpl problem;
|
/external/ceres-solver/include/ceres/ |
H A D | problem.h | 60 class ProblemImpl; 464 internal::scoped_ptr<internal::ProblemImpl> problem_impl_;
|