/external/chromium_org/third_party/libaddressinput/src/cpp/src/ |
H A D | address_problem.cc | 26 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 D | localization.cc | 67 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/ceres-solver/examples/ |
H A D | helloworld.cc | 64 // Build the problem. 65 Problem problem; local 71 problem.AddResidualBlock(cost_function, NULL, &x); 77 Solve(options, &problem, &summary);
|
H A D | helloworld_analytic_diff.cc | 69 // 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 D | helloworld_numeric_diff.cc | 60 // Build the problem. 61 Problem problem; local 67 problem.AddResidualBlock(cost_function, NULL, &x); 73 Solve(options, &problem, &summary);
|
H A D | powell.cc | 110 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 D | curve_fitting.c | 160 ceres_problem_t* problem; local 165 problem = ceres_create_problem(); 170 problem, 181 ceres_solve(problem); 182 ceres_free_problem(problem);
|
H A D | curve_fitting.cc | 143 Problem problem; local 145 problem.AddResidualBlock( 158 Solve(options, &problem, &summary);
|
H A D | robust_curve_fitting.cc | 145 Problem problem; local 150 problem.AddResidualBlock(cost_function, NULL, &m, &c); 158 Solve(options, &problem, &summary);
|
H A D | circle_fit.cc | 47 // There are closed form solutions [1] to this problem which you may want to 128 Problem problem; local 143 problem.AddResidualBlock(cost, loss, &x, &y, &m); 149 // Build and solve the problem. 154 Solve(options, &problem, &summary);
|
H A D | bundle_adjuster.cc | 31 // An example of solving a dynamically sized problem with various 39 // The problem being solved here is known as a Bundle Adjustment 40 // problem in computer vision. Given a set of 3d points X_1, ..., X_n, 50 // The problem used here comes from a collection of bundle adjustment 250 void BuildProblem(BALProblem* bal_problem, Problem* problem) { argument 289 problem->AddResidualBlock(cost_function, 295 problem->AddResidualBlock(cost_function, loss_function, camera, point); 303 problem->SetParameterization(cameras + camera_block_size * i, 311 Problem problem; local 319 BuildProblem(&bal_problem, &problem); [all...] |
H A D | denoising.cc | 88 // 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...] |
H A D | ellipse_approximation.cc | 360 ceres::Problem* problem, 365 ceres::Solve(options, problem, &summary); 410 ceres::Problem problem; local 421 problem.AddResidualBlock( 429 problem.AddResidualBlock( 443 CHECK(SolveWithFullReport(options, &problem, true)); 448 CHECK(SolveWithFullReport(options, &problem, false)); 359 SolveWithFullReport(ceres::Solver::Options options, ceres::Problem* problem, bool dynamic_sparsity) argument
|
H A D | more_garbow_hillstrom.cc | 50 // A problem is considered solved if of the log relative error of its 276 Problem problem; local 277 problem.AddResidualBlock(TestProblem::Create(), NULL, x); 279 problem.SetParameterLowerBound(x, i, TestProblem::lower_bounds[i]); 280 problem.SetParameterUpperBound(x, i, TestProblem::upper_bounds[i]); 290 Solve(options, &problem, &summary); 311 Problem problem; local 312 problem.AddResidualBlock(TestProblem::Create(), NULL, x); 321 Solve(options, &problem, &summary);
|
/external/ceres-solver/internal/ceres/ |
H A D | covariance.cc | 36 #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 D | c_api_test.cc | 143 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 D | reorder_program_test.cc | 62 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 D | linear_least_squares_problems.cc | 60 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 D | program_test.cc | 79 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...] |
/external/chromium_org/third_party/libaddressinput/chromium/ |
H A D | addressinput_util.cc | 26 // Returns true if the |problem| should not be reported for the |field| because 30 AddressProblem problem) { 35 field, problem)) == filter->end(); 28 FilterExcludes(const std::multimap<AddressField, AddressProblem>* filter, AddressField field, AddressProblem problem) argument
|
/external/chromium_org/third_party/libaddressinput/src/java/src/com/android/i18n/addressinput/ |
H A D | AddressProblems.java | 31 * 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/oauth/core/src/main/java/net/oauth/ |
H A D | OAuthProblemException.java | 25 * Describes an OAuth-related problem, using a set of named parameters. One 26 * parameter identifies the basic problem, and the others provide supplementary 42 public OAuthProblemException(String problem) { argument 43 super(problem); 44 if (problem != null) { 45 parameters.put(OAUTH_PROBLEM, problem);
|
/external/chromium_org/base/metrics/ |
H A D | histogram_delta_serialization.cc | 19 // Silently returns when seeing any data problem in the pickle. 97 HistogramBase::Inconsistency problem) { 98 inconsistencies_histogram_->Add(problem); 102 HistogramBase::Inconsistency problem) { 103 inconsistencies_unique_histogram_->Add(problem); 96 InconsistencyDetected( HistogramBase::Inconsistency problem) argument 101 UniqueInconsistencyDetected( HistogramBase::Inconsistency problem) argument
|
/external/chromium_org/third_party/libaddressinput/src/cpp/test/ |
H A D | validation_task_test.cc | 76 AddressProblem problem = kProblems[j]; local 77 filter_.insert(std::make_pair(field, problem));
|
/external/bison/lib/ |
H A D | argmatch.c | 131 argmatch_invalid (const char *context, const char *value, ptrdiff_t problem) 133 char const *format = (problem == -1 130 argmatch_invalid(const char *context, const char *value, ptrdiff_t problem) argument
|