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

1234567

/external/ceres-solver/internal/ceres/
H A Dproblem_test.cc32 #include "ceres/problem.h"
122 Problem problem; local
123 problem.AddParameterBlock(x, 3);
124 problem.AddParameterBlock(y, 4);
125 problem.AddParameterBlock(z, 5);
127 EXPECT_DEATH_IF_SUPPORTED(problem.AddResidualBlock(NULL, NULL, x),
134 Problem problem; local
135 problem.AddParameterBlock(x, 3);
136 problem.AddParameterBlock(y, 4);
137 problem
148 Problem problem; local
159 Problem problem; local
172 Problem problem; local
187 Problem problem; local
200 Problem problem; local
223 Problem problem; local
251 Problem problem; local
274 Problem problem; local
330 Problem problem; local
349 Problem problem; local
473 scoped_ptr<ProblemImpl> problem; member in struct:ceres::internal::DynamicProblem
481 Problem problem; local
492 Problem problem; local
503 Problem problem; local
515 Problem problem; local
526 Problem problem; local
539 Problem problem; local
882 ExpectProblemHasResidualBlocks( const ProblemImpl &problem, const ResidualBlockId *expected_residual_blocks) argument
[all...]
H A Dprogram_test.cc79 ProblemImpl problem; local
84 problem.AddParameterBlock(&x, 1);
85 problem.AddParameterBlock(&y, 1);
86 problem.AddParameterBlock(&z, 1);
87 problem.AddResidualBlock(new UnaryCostFunction(), NULL, &x);
88 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &x, &y);
89 problem.AddResidualBlock(new TernaryCostFunction(), NULL, &x, &y, &z);
95 CHECK_NOTNULL(problem
108 ProblemImpl problem; local
111 problem
133 ProblemImpl problem; local
158 ProblemImpl problem; local
185 ProblemImpl problem; local
212 ProblemImpl problem; local
252 ProblemImpl problem; local
354 ProblemImpl problem; local
396 ProblemImpl problem; local
408 ProblemImpl problem; local
419 ProblemImpl problem; local
[all...]
H A Dsolver_impl_test.cc79 ProblemImpl problem(problem_options);
80 problem.AddResidualBlock(cost_function.get(), NULL, &x, &y, &z, &w);
81 problem.SetParameterBlockConstant(&x);
82 problem.SetParameterBlockConstant(&w);
88 SolverImpl::Solve(options, &problem, &summary);
98 EXPECT_EQ(&x, problem.program().parameter_blocks()[0]->state());
99 EXPECT_EQ(&y, problem.program().parameter_blocks()[1]->state());
100 EXPECT_EQ(&z, problem.program().parameter_blocks()[2]->state());
101 EXPECT_EQ(&w, problem.program().parameter_blocks()[3]->state());
103 EXPECT_TRUE(problem
[all...]
H A Dreorder_program_test.cc62 ProblemImpl problem; local
67 problem.AddParameterBlock(&x, 1);
68 problem.AddParameterBlock(&y, 1);
69 problem.AddParameterBlock(&z, 1);
71 problem.AddResidualBlock(new UnaryCostFunction(), NULL, &x);
72 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &z, &x);
73 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &z, &y);
74 problem.AddResidualBlock(new UnaryCostFunction(), NULL, &z);
75 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &x, &y);
76 problem
118 ProblemImpl problem; local
140 ProblemImpl problem; local
[all...]
H A Dcovariance.cc36 #include "ceres/problem.h"
50 Problem* problem) {
51 return impl_->Compute(covariance_blocks, problem->problem_impl_.get());
48 Compute( const vector<pair<const double*, const double*> >& covariance_blocks, Problem* problem) argument
H A Devaluator_test.cc135 void EvaluateAndCompare(ProblemImpl *problem, argument
143 CreateEvaluator(problem->mutable_program()));
191 EvaluateAndCompare(&problem,
206 ProblemImpl problem; member in struct:ceres::internal::EvaluatorTest
215 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 2, 3, 4>,
243 problem.AddParameterBlock(x, 2);
244 problem.AddParameterBlock(y, 3);
245 problem.AddParameterBlock(z, 4);
251 // for a long time, since by chance most users added parameters to the problem
253 problem
591 ProblemImpl problem; local
[all...]
H A Dlinear_least_squares_problems.cc60 LOG(FATAL) << "Unknown problem id requested " << id;
84 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
87 problem->b.reset(new double[3]);
88 problem->D.reset(new double[2]);
90 problem->x.reset(new double[2]);
91 problem->x_D.reset(new double[2]);
113 problem->A.reset(A);
115 problem->b[0] = 8;
116 problem->b[1] = 18;
117 problem
184 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
289 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
423 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
[all...]
H A Dsolver_test.cc40 #include "ceres/problem.h"
92 Problem problem(problem_options);
93 problem.AddResidualBlock(cost_function.get(), NULL, &x);
106 Solve(options, &problem, &summary);
118 Solve(options, &problem, &summary);
163 Problem problem; local
167 Solve(options, &problem, &summary);
175 Problem problem; local
179 Solve(options, &problem, &summary);
187 Problem problem; local
201 Problem problem; local
215 Problem problem; local
229 Problem problem; local
[all...]
H A Diterative_schur_complement_solver_test.cc62 scoped_ptr<LinearLeastSquaresProblem> problem(
65 CHECK_NOTNULL(problem.get());
66 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
67 b_.reset(problem->b.release());
68 D_.reset(problem->D.release());
72 num_eliminate_blocks_ = problem->num_eliminate_blocks;
H A Dblock_sparse_matrix_test.cc48 scoped_ptr<LinearLeastSquaresProblem> problem(
50 CHECK_NOTNULL(problem.get());
51 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
53 problem.reset(CreateLinearLeastSquaresProblemFromId(1));
54 CHECK_NOTNULL(problem.get());
55 B_.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
H A Dc_api.cc42 #include "ceres/problem.h"
60 void ceres_free_problem(ceres_problem_t* problem) { argument
61 delete reinterpret_cast<Problem*>(problem);
142 ceres_problem_t* problem,
151 Problem* ceres_problem = reinterpret_cast<Problem*>(problem);
175 Problem* problem = reinterpret_cast<Problem*>(c_problem); local
186 ceres::Solve(options, problem, &summary);
141 ceres_problem_add_residual_block( ceres_problem_t* problem, ceres_cost_function_t cost_function, void* cost_function_data, ceres_loss_function_t loss_function, void* loss_function_data, int num_residuals, int num_parameter_blocks, int* parameter_block_sizes, double** parameters) argument
H A Dc_api_test.cc143 ceres_problem_t* problem = ceres_create_problem(); local
146 problem,
157 ceres_solve(problem);
162 ceres_free_problem(problem);
197 ceres_problem_t* problem = ceres_create_problem(); local
200 problem,
211 ceres_solve(problem);
217 ceres_free_problem(problem);
/external/chromium_org/third_party/libaddressinput/src/cpp/src/
H A Daddress_problem.cc26 std::ostream& operator<<(std::ostream& o, AddressProblem problem) { argument
38 if (problem < 0 || static_cast<size_t>(problem) >= arraysize(kProblemNames)) {
39 o << "[INVALID ENUM VALUE " << static_cast<int>(problem) << "]";
41 o << kProblemNames[problem];
H A Dlocalization.cc67 AddressProblem problem,
94 return GetErrorMessageForPostalCode(address, problem,
98 if (problem == MISSING_REQUIRED_FIELD) {
100 } else if (problem == UNKNOWN_VALUE) {
111 } else if (problem == USES_P_O_BOX) {
129 AddressProblem problem,
135 if (problem == MISSING_REQUIRED_FIELD) {
151 } else if (problem == INVALID_FORMAT) {
169 } else if (problem == MISMATCHING_VALUE) {
65 GetErrorMessage(const AddressData& address, AddressField field, AddressProblem problem, bool enable_examples, bool enable_links) const argument
127 GetErrorMessageForPostalCode( const AddressData& address, AddressProblem problem, bool uses_postal_code_as_label, std::string postal_code_example, std::string post_service_url) const argument
/external/chromium_org/base/metrics/
H A Dhistogram_flattener.h29 virtual void InconsistencyDetected(HistogramBase::Inconsistency problem) = 0;
34 HistogramBase::Inconsistency problem) = 0;
/external/ceres-solver/examples/
H A Dhelloworld.cc64 // Build the problem.
65 Problem problem; local
71 problem.AddResidualBlock(cost_function, NULL, &x);
77 Solve(options, &problem, &summary);
H A Dhelloworld_analytic_diff.cc69 // For this simple problem it is overkill to check if jacobians[0]
89 // Build the problem.
90 Problem problem; local
94 problem.AddResidualBlock(cost_function, NULL, &x);
100 Solve(options, &problem, &summary);
H A Dhelloworld_numeric_diff.cc60 // Build the problem.
61 Problem problem; local
67 problem.AddResidualBlock(cost_function, NULL, &x);
73 Solve(options, &problem, &summary);
H A Dpowell.cc110 Problem problem; local
111 // Add residual terms to the problem using the using the autodiff
114 problem.AddResidualBlock(new AutoDiffCostFunction<F1, 1, 1, 1>(new F1),
117 problem.AddResidualBlock(new AutoDiffCostFunction<F2, 1, 1, 1>(new F2),
120 problem.AddResidualBlock(new AutoDiffCostFunction<F3, 1, 1, 1>(new F3),
123 problem.AddResidualBlock(new AutoDiffCostFunction<F4, 1, 1, 1>(new F4),
145 Solve(options, &problem, &summary);
H A Ddenoising.cc88 // Creates a Fields of Experts MAP inference problem.
91 Problem* problem,
100 problem->AddResidualBlock(cost_function,
129 problem->AddResidualBlock(cost_function[alpha_index],
137 // Solves the FoE problem using Ceres and post-processes it to make sure the
139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { argument
157 ceres::Solve(options, problem, &summary);
209 ceres::Problem problem; local
210 CreateProblem(foe, image, &problem, &solution);
212 SolveProblem(&problem,
89 CreateProblem(const FieldsOfExperts& foe, const PGMImage<double>& image, Problem* problem, PGMImage<double>* solution) argument
[all...]
/external/ceres-solver/include/ceres/
H A Dc_api.h80 * problem,
119 /* Create and destroy a problem */
120 /* TODO(keir): Add options for the problem. */
122 CERES_EXPORT void ceres_free_problem(ceres_problem_t* problem);
126 ceres_problem_t* problem,
136 CERES_EXPORT void ceres_solve(ceres_problem_t* problem);
/external/oauth/core/src/main/java/net/oauth/
H A DSimpleOAuthValidator.java78 OAuthProblemException problem = new OAuthProblemException("version_rejected");
79 problem.setParameter("oauth_acceptable_versions", minVersion + "-" + maxVersion);
80 throw problem;
94 OAuthProblemException problem = new OAuthProblemException("timestamp_refused");
95 problem.setParameter("oauth_acceptable_timestamps", min + "-" + max);
96 throw problem;
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/
H A DAddressProblems.java31 * Only one address problem type is saved per addressField. Address field as used here refers to
34 void add(AddressField addressField, AddressProblemType problem) { argument
35 mProblems.put(addressField, problem);
/external/chromium_org/third_party/libaddressinput/src/cpp/include/libaddressinput/
H A Daddress_problem.h23 // Address problem types, in no particular order.
66 i18n::addressinput::AddressProblem problem);
/external/chromium_org/content/browser/gpu/
H A Dcompositor_util.cc346 base::DictionaryValue* problem = new base::DictionaryValue(); local
347 problem->SetString("description",
349 problem->Set("crBugs", new base::ListValue());
350 problem->Set("webkitBugs", new base::ListValue());
353 problem->Set("affectedGpuSettings", disabled_features);
354 problem->SetString("tag", "disabledFeatures");
355 problem_list->Insert(0, problem);
362 base::DictionaryValue* problem = new base::DictionaryValue(); local
363 problem->SetString(
365 problem
[all...]

Completed in 327 milliseconds

1234567