Searched defs:cost (Results 1 - 25 of 118) sorted by path

12345

/external/bzip2/
H A Dcompress.c256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[
[all...]
/external/ceres-solver/examples/
H A Dcircle_fit.cc71 // The cost for a single sample. The returned residual is related to the
90 // It is tempting to use the following cost:
95 // reasonably well, but the sqrt() adds strong nonlinearities to the cost
96 // function. Instead, a different cost is used, which while not strictly a
98 // robust fits when there are outliers. This is because the cost surface is
140 CostFunction *cost = local
143 problem.AddResidualBlock(cost, loss, &x, &y, &m);
/external/ceres-solver/include/ceres/
H A Dgradient_checker.h32 // This file contains a class that exercises a cost function, to make sure
34 // computed by the cost function with those obtained by finite
53 // An object that exercises a cost function, to compare the answers that it
71 // Computed cost.
72 Vector cost; member in struct:ceres::GradientChecker::GradientCheckResults
74 // The sizes of these matrices are dictated by the cost function's
80 // Derivatives as computed by the cost function.
90 // Checks the Jacobian computed by a cost function.
97 // term: The cost function to test. Not retained after this call returns.
174 results->cost
[all...]
H A Diteration_callback.h51 cost(0.0),
96 double cost; member in struct:ceres::IterationSummary
113 // cost and the change in the cost of the linearized approximation.
195 // summary.cost,
/external/ceres-solver/internal/ceres/
H A Devaluator.h52 // The Evaluator interface offers a way to interact with a least squares cost
77 // This is used for computing the cost, residual and Jacobian for
83 // which case they will not be evaluated. cost cannot be NULL.
97 double* cost,
132 // Evaluate the cost function for the given state. Returns the cost,
139 // state is an array of size NumParameters(), cost is a pointer to a single
143 double* cost,
152 double* cost,
158 cost,
151 Evaluate(const double* state, double* cost, double* residuals, double* gradient, SparseMatrix* jacobian) argument
[all...]
H A Devaluator_test.cc147 double cost = -1; local
166 &cost,
182 cost,
194 expected.cost,
201 // The values are ignored completely by the cost function.
247 // Then use a cost function which is similar to the others, but swap around
248 // the ordering of the parameters to the cost function. This shouldn't affect
252 // in the same order that they occured as parameters to a cost function.
445 // The values are ignored completely by the cost function.
532 double cost; local
622 double cost = -1; local
629 double cost = -1; local
639 double cost = -1; local
[all...]
H A Devaluator_test_utils.h41 double cost; member in struct:ceres::internal::ExpectedEvaluation
H A Dline_search_minimizer.h51 : cost(0.0),
59 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
H A Dproblem.cc199 double* cost,
204 cost,
198 Evaluate(const EvaluateOptions& evaluate_options, double* cost, vector<double>* residuals, vector<double>* gradient, CRSMatrix* jacobian) argument
H A Dproblem_impl.cc175 // cost and loss functions are tucked away for future deletion, since it is not
216 // Collect the unique cost/loss functions and delete the residuals.
229 // Delete the owned cost/loss functions and parameterizations.
253 << "that the cost function expects.";
287 << "The cost function expects parameter block " << i
600 double* cost,
604 if (cost == NULL &&
755 if (cost != NULL) {
756 *cost = tmp_cost;
599 Evaluate(const Problem::EvaluateOptions& evaluate_options, double* cost, vector<double>* residuals, vector<double>* gradient, CRSMatrix* jacobian) argument
H A Dproblem_test.cc56 // Trivial cost function that accepts a single argument.
75 // Trivial cost function that accepts two arguments.
96 // Trivial cost function that accepts three arguments.
177 // The cost function expects the size of the second parameter, z, to be 4
327 // Add a cost function multiple times and check to make sure that
328 // the destructor on the cost function is only called once.
334 CostFunction* cost = new DestructorCountingCostFunction(&num_destructions); local
335 problem.AddResidualBlock(cost, NULL, y, z);
336 problem.AddResidualBlock(cost, NULL, y, z);
337 problem.AddResidualBlock(cost, NUL
1094 double cost; local
[all...]
H A Dprogram.cc323 // The residual is constant and will be removed, so its cost is
325 double cost = 0.0; local
327 &cost,
335 *fixed_cost += cost;
H A Dprogram_evaluator.h31 // The ProgramEvaluator runs the cost functions contained in each residual block
36 // pointers to the jacobian blocks where the cost function evaluates to.
52 // // a cost function's evaluate method.
136 double* cost,
159 // Each thread gets it's own cost and evaluate scratch space.
161 evaluate_scratch_[i].cost = 0.0;
208 // Evaluate the cost, residuals, and jacobians.
224 scratch->cost += block_cost;
258 // Sum the cost and gradient (if requested) from each thread.
259 (*cost)
134 Evaluate(const Evaluator::EvaluateOptions& evaluate_options, const double* state, double* cost, double* residuals, double* gradient, SparseMatrix* jacobian) argument
325 double cost; member in struct:ceres::internal::ProgramEvaluator::EvaluateScratch
[all...]
H A Dresidual_block.cc68 double* cost,
108 InvalidateEvaluation(*this, cost, residuals, eval_jacobians);
116 cost,
127 cost,
159 *cost = 0.5 * squared_norm;
165 *cost = 0.5 * rho[0];
201 // space to store the residuals, which is needed for cost-only evaluations.
67 Evaluate(const bool apply_loss_function, double* cost, double* residuals, double** jacobians, double* scratch) const argument
H A Dresidual_block_test.cc42 // Trivial cost function that accepts three arguments.
106 // Verify cost-only evaluation.
107 double cost; local
108 residual_block.Evaluate(true, &cost, NULL, NULL, scratch);
109 EXPECT_EQ(0.5 * (0*0 + 1*1 + 2*2), cost);
111 // Verify cost and residual evaluation.
113 residual_block.Evaluate(true, &cost, residuals, NULL, scratch);
114 EXPECT_EQ(0.5 * (0*0 + 1*1 + 2*2), cost);
119 // Verify cost, residual, and jacobian evaluation.
120 cost
246 double cost; local
[all...]
H A Dresidual_block_utils.cc48 double* cost,
54 InvalidateArray(1, cost);
66 double* cost,
69 CHECK_NOTNULL(cost);
117 double* cost,
47 InvalidateEvaluation(const ResidualBlock& block, double* cost, double* residuals, double** jacobians) argument
64 EvaluationToString(const ResidualBlock& block, double const* const* parameters, double* cost, double* residuals, double** jacobians) argument
115 IsEvaluationValid(const ResidualBlock& block, double const* const* parameters, double* cost, double* residuals, double** jacobians) argument
H A Dresidual_block_utils_test.cc60 double cost; local
66 &cost,
H A Dtrust_region_minimizer.cc63 const double cost,
96 line_search->Search(1.0, cost, gradient.dot(delta), &summary);
101 line_search->Search(1.0, cost, -gradient.squaredNorm(), &summary);
196 // Do initial cost and Jacobian evaluation.
197 double cost = 0.0; local
199 &cost,
219 summary->initial_cost = cost + summary->fixed_cost;
220 iteration_summary.cost = cost + summary->fixed_cost;
250 double minimum_cost = cost;
60 DoLineSearch(const Minimizer::Options& options, const Vector& x, const Vector& gradient, const double cost, const Vector& delta, Evaluator* evaluator) argument
[all...]
H A Dtrust_region_minimizer_test.cc87 double* cost,
113 *cost = (f1*f1 + f2*f2 + f3*f3 + f4*f4) / 2.0;
115 VLOG(1) << "Cost: " << *cost;
85 Evaluate(const Evaluator::EvaluateOptions& evaluate_options, const double* state, double* cost, double* residuals, double* gradient, SparseMatrix* jacobian) argument
/external/chromium_org/chrome/browser/ssl/
H A Dssl_error_classification.cc121 int cost = str1[i] == str2[j] ? 0 : 1; local
123 kSecondRow[j] + 1, kFirstRow[j + 1] + 1), kFirstRow[j] + cost);
/external/chromium_org/content/browser/loader/
H A Dresource_request_info_impl.h154 void set_memory_cost(int cost) { memory_cost_ = cost; } argument
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
H A Dcompiler.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ...
/external/chromium_org/third_party/brotli/src/brotli/enc/
H A Dbit_cost.h15 // Functions to estimate the bit cost of Huffman trees.
93 uint8_t cost[kCodeLengthCodes] = { 0 }; local
94 CreateHuffmanTree(histogram, kCodeLengthCodes, 7, cost);
96 cost[16] += 2;
97 cost[17] += 3;
100 int bits = 18 + 2 * max_depth; // huffman tree of huffman tree cost
102 bits += histogram[i] * cost[i]; // huffman tree bit cost
H A Dblock_splitter.cc167 double *cost = new double[vecsize]; local
168 memset(cost, 0, sizeof(cost[0]) * vecsize);
171 // After each iteration of this loop, cost[k] will contain the difference
172 // between the minimum cost of arriving at the current byte position using
173 // entropy code k, and the minimum cost of arriving at the current byte
174 // position. This difference is capped at the block switch cost, and if it
175 // reaches block switch cost, it means that when we trace back from the last
183 cost[k] += insert_cost[insert_cost_ix + k];
184 if (cost[
[all...]
H A Dliteral_cost.cc15 // Literal cost model to allow backward reference replacement to be efficient.
63 float *cost) {
128 cost[(pos + i) & cost_mask] = lit_cost;
134 float *cost) {
166 cost[(pos + i) & cost_mask] = lit_cost;
61 EstimateBitCostsForLiteralsUTF8(size_t pos, size_t len, size_t mask, size_t cost_mask, const uint8_t *data, float *cost) argument

Completed in 487 milliseconds

12345