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

12345678

/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
456 scoped_ptr<ProblemImpl> problem; member in struct:ceres::internal::DynamicProblem
464 Problem problem; local
475 Problem problem; local
486 Problem problem; local
498 Problem problem; local
508 Problem problem; local
[all...]
H A Devaluator_test.cc110 void EvaluateAndCompare(ProblemImpl *problem, argument
118 CreateEvaluator(problem->mutable_program()));
166 EvaluateAndCompare(&problem,
181 ProblemImpl problem; member in struct:ceres::internal::EvaluatorTest
190 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 2, 3, 4>,
218 problem.AddParameterBlock(x, 2);
219 problem.AddParameterBlock(y, 3);
220 problem.AddParameterBlock(z, 4);
226 // for a long time, since by chance most users added parameters to the problem
228 problem
564 ProblemImpl problem; local
[all...]
H A Dsolver_impl_test.cc77 ProblemImpl problem; local
82 problem.AddParameterBlock(&x, 1);
83 problem.AddParameterBlock(&y, 1);
84 problem.AddParameterBlock(&z, 1);
85 problem.AddResidualBlock(new UnaryCostFunction(), NULL, &x);
86 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &x, &y);
87 problem.AddResidualBlock(new TernaryCostFunction(), NULL, &x, &y, &z);
96 Program program(*problem.mutable_program());
108 ProblemImpl problem; local
111 problem
130 ProblemImpl problem; local
157 ProblemImpl problem; local
188 ProblemImpl problem; local
220 ProblemImpl problem; local
265 ProblemImpl problem; local
321 ProblemImpl problem; local
390 ProblemImpl problem; local
447 ProblemImpl problem; local
469 ProblemImpl problem; local
851 ProblemImpl problem; local
953 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 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 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);
H A Dcovariance_impl.h56 ProblemImpl* problem);
64 ProblemImpl* problem);
/external/openssh/
H A Dauth-krb5.c61 krb5_error_code problem; local
64 problem = krb5_init_context(&authctxt->krb5_ctx);
65 if (problem)
66 return (problem);
78 krb5_error_code problem; local
89 problem = krb5_init(authctxt);
90 if (problem)
93 problem = krb5_parse_name(authctxt->krb5_ctx, client,
95 if (problem)
99 problem
[all...]
H A Dgss-serv-krb5.c66 krb5_error_code problem; local
71 problem = krb5_init_context(&krb_context);
72 if (problem) {
119 krb5_error_code problem; local
133 if ((problem = krb5_cc_gen_new(krb_context, &krb5_fcc_ops, &ccache))) {
135 krb5_get_err_text(krb_context, problem));
139 if ((problem = ssh_krb5_cc_gen(krb_context, &ccache))) {
141 krb5_get_err_text(krb_context, problem));
146 if ((problem = krb5_parse_name(krb_context,
149 krb5_get_err_text(krb_context, problem));
[all...]
/external/chromium_org/chrome/common/metrics/
H A Dmetrics_service_base.cc40 base::HistogramBase::Inconsistency problem) {
42 problem, base::HistogramBase::NEVER_EXCEEDED_VALUE);
46 base::HistogramBase::Inconsistency problem) {
48 problem, base::HistogramBase::NEVER_EXCEEDED_VALUE);
39 InconsistencyDetected( base::HistogramBase::Inconsistency problem) argument
45 UniqueInconsistencyDetected( base::HistogramBase::Inconsistency problem) argument
H A Dmetrics_service_base.h27 base::HistogramBase::Inconsistency problem) OVERRIDE;
29 base::HistogramBase::Inconsistency problem) OVERRIDE;
/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 Dquadratic.cc75 // Build the problem.
76 Problem problem; local
78 problem.AddResidualBlock(new SimpleCostFunction, NULL, &x);
86 Solve(options, &problem, &summary);
H A Dquadratic_auto_diff.cc67 // Build the problem.
68 Problem problem; local
72 problem.AddResidualBlock(
84 Solve(options, &problem, &summary);
H A Dquadratic_numeric_diff.cc69 // Build the problem.
70 Problem problem; local
71 problem.AddResidualBlock(cost, NULL, &x);
79 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.h77 * problem,
116 /* Create and destroy a problem */
117 /* TODO(keir): Add options for the problem. */
119 void ceres_free_problem(ceres_problem_t* problem);
123 ceres_problem_t* problem,
133 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;

Completed in 314 milliseconds

12345678