| /external/clang/test/CodeGenCXX/ |
| array-operator-delete-call.cpp | 22 struct COST
24 S *cost; member in struct:COST
28 ~COST();
29 COST();
33 COST::COST()
35 cost = new S[3];
40 COST::~COST()
42 if (cost) {
[all...] |
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_robust.h | 43 double cost; member in struct:db_stat_struct
|
| /external/ceres-solver/examples/ |
| circle_fit.cc | 71 // 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/ |
| iteration_callback.h | 51 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/ |
| residual_block_utils_test.cc | 60 double cost; local
66 &cost,
|
| evaluator_test.cc | 147 double cost = -1; local
166 &cost,
182 cost,
194 expected.cost,
201 // The values are ignored completely by the cost function.
222 // Cost
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.
260 // Cost
532 double cost; local
622 double cost = -1; local
629 double cost = -1; local
639 double cost = -1; local
[all...] |
| program.cc | 323 // The residual is constant and will be removed, so its cost is
325 double cost = 0.0; local
327 &cost,
335 *fixed_cost += cost;
|
| program_evaluator.h | 31 // 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) = 0.0
325 double cost; member in struct:ceres::internal::ProgramEvaluator::EvaluateScratch
[all...] |
| trust_region_minimizer.cc | 63 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;
[all...] |
| /external/eigen/bench/ |
| benchCholesky.cpp | 34 int cost = 0; local
38 cost += 2*(r*j+r+j);
82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t"
84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n";
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_robust.h | 43 double cost; member in struct:db_stat_struct
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_robust.h | 43 double cost; member in struct:db_stat_struct
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| encodemv.c | 104 unsigned int cost; local
108 cost = vp8_cost_zero(p [mvpis_short])
112 return cost;
117 cost = vp8_cost_one(p [mvpis_short]);
120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1);
135 return cost; /* + vp8_cost_bit( p [MVPsign], v < 0); */
209 const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p) + 128) >> 8); local
211 if (cur_b - new_b > cost)
[all...] |
| /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.cc | 51 int PartitionTreeNode::Cost(int penalty) {
53 int cost = 0; local
56 cost = std::max(max_parent_size_, this_size_) -
59 cost = std::max(max_parent_size_, this_size_) - min_parent_size_;
61 return cost + NumPackets() * penalty;
130 if (left->Cost(penalty) <= right->Cost(penalty)) {
138 if (second->Cost(penalty) <= first->Cost(penalty)) {
140 // Compare cost estimate for "second" with actual cost for "first"
248 int cost = 0; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemv.c | 104 unsigned int cost; local
108 cost = vp8_cost_zero(p [mvpis_short])
112 return cost;
117 cost = vp8_cost_one(p [mvpis_short]);
120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1);
135 return cost; /* + vp8_cost_bit( p [MVPsign], v < 0); */
209 const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p) + 128) >> 8); local
211 if (cur_b - new_b > cost)
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| CostAllocator.h | 1 //===---------- CostAllocator.h - PBQP Cost Allocator -----------*- C++ -*-===//
10 // Defines classes conforming to the PBQP cost value manager concept.
12 // Cost value managers are memory managers for PBQP cost values (vectors and
34 PoolEntry(CostPool &pool, CostKeyT cost)
35 : pool(pool), cost(std::move(cost)), refCount(0) {}
39 CostT& getCost() { return cost; }
40 const CostT& getCost() const { return cost; }
43 CostT cost; member in class:PBQP::CostPool::PoolEntry
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| encodemv.c | 104 unsigned int cost; local
108 cost = vp8_cost_zero(p [mvpis_short])
112 return cost;
117 cost = vp8_cost_one(p [mvpis_short]);
120 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
127 cost += vp8_cost_bit(p [MVPbits + i], (x >> i) & 1);
132 cost += vp8_cost_bit(p [MVPbits + 3], (x >> 3) & 1);
135 return cost; /* + vp8_cost_bit( p [MVPsign], v < 0); */
209 const int cost = 7 + MV_PROB_UPDATE_CORRECTION + ((vp8_cost_one(update_p) - vp8_cost_zero(update_p) + 128) >> 8); local
211 if (cur_b - new_b > cost)
[all...] |
| /external/bzip2/ |
| compress.c | 256 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[t] += s->len[t][icv]
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local
107 cost += class_cost[c];
112 cost += class0_cost[d];
117 cost += bits_cost[i][((d >> i) & 1)];
120 cost += class0_fp_cost[d][f];
122 cost += fp_cost[f];
126 cost += class0_hp_cost[e];
128 cost += hp_cost[e];
131 mvcost[v] = cost + sign_cost[0];
132 mvcost[-v] = cost + sign_cost[1]
[all...] |
| vp9_segmentation.c | 70 // Based on set of segment counts and probabilities calculate a cost estimate
79 // Cost the top node of the tree
80 int cost = c0123 * vp9_cost_zero(probs[0]) + local
83 // Cost subsequent levels
85 cost += c01 * vp9_cost_zero(probs[1]) +
89 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
92 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
97 cost += c45 * vp9_cost_zero(probs[2]) +
101 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
104 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| /external/chromium_org/third_party/libwebp/enc/ |
| cost.c | 10 // Cost tables for level and modes
14 #include "./cost.h"
17 // Boolean-cost cost table
49 // Level cost tables
338 int cost = 0; local
342 cost += VP8BitCost(bits & 1, probas[i]);
347 return cost;
370 // Starting at level 67 and up, the variable part of the cost is
379 // Mode cost tables
500 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
[all...] |
| /external/libphonenumber/java/src/com/android/i18n/phonenumbers/ |
| ShortNumberInfo.java | 55 /** Cost categories of short numbers. */
166 * Gets the expected cost category of a short number when dialled from a region (however, nothing
175 * ShortNumberInfo.ShortNumberCost cost = shortInfo.getExpectedCostForRegion(shortNumber,
177 * // Do something with the cost information here.
180 * @param shortNumber the short number for which we want to know the expected cost category,
183 * @return the expected cost category for that region of the short number. Returns UNKNOWN_COST if
184 * the number does not match a cost category. Note that an invalid number may match any cost
195 // The cost categories are tested in order of decreasing expense, since if for some reason the
196 // patterns overlap the most expensive matching cost category should be returned
243 ShortNumberCost cost = ShortNumberCost.TOLL_FREE; local
[all...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encodemv.c | 104 int z, c, o, d, e, f, cost = 0; local
107 cost += class_cost[c];
112 cost += class0_cost[d];
117 cost += bits_cost[i][((d >> i) & 1)];
120 cost += class0_fp_cost[d][f];
122 cost += fp_cost[f];
126 cost += class0_hp_cost[e];
128 cost += hp_cost[e];
131 mvcost[v] = cost + sign_cost[0];
132 mvcost[-v] = cost + sign_cost[1]
[all...] |
| vp9_segmentation.c | 82 // Based on set of segment counts and probabilities calculate a cost estimate
91 // Cost the top node of the tree
92 int cost = c0123 * vp9_cost_zero(probs[0]) + local
95 // Cost subsequent levels
97 cost += c01 * vp9_cost_zero(probs[1]) +
101 cost += segcounts[0] * vp9_cost_zero(probs[3]) +
104 cost += segcounts[2] * vp9_cost_zero(probs[4]) +
109 cost += c45 * vp9_cost_zero(probs[2]) +
113 cost += segcounts[4] * vp9_cost_zero(probs[5]) +
116 cost += segcounts[6] * vp9_cost_zero(probs[6])
[all...] |
| /external/opencv/cvaux/src/ |
| cvcorrespond.cpp | 73 float cost, cost1; local
113 /* Fill upper line in the cost Table */
128 /* Fill lefter line in the cost Table */
177 cost = 0;
184 cost = (float) (r_len * r_len - l_len * l_len) * (1 / (r_len * l_len));
188 cost = (float) (l_len * l_len - r_len * r_len) * (1 / (r_len * l_len));
200 min1 = costTable[i_1 + j_1 * row_size] + cost + (float) cost1;
|
