| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_cost.h | 36 int cost = 0; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
45 return cost;
|
| /external/srec/srec/crec/ |
| srec_eosd.c | 165 /* eos cost margin */
176 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost;
180 eos_cost_margin = oeftoken->cost + wrapup_cost - eftoken->cost;
182 else if (oeftoken->cost > eftoken->cost)
184 eos_cost_margin = xftoken->cost + wrapup_cost - eftoken->cost;
187 { /* if(oeftoken->cost < eftoken->cost) *
[all...] |
| word_lattice.c | 47 #define TRUE_KILL_WTOKEN(WT) { WT.cost = MAXcostdata; \
94 if (best_cost > wtoken->cost)
95 best_cost = wtoken->cost;
115 bigcostdata cost; local
129 cost = wtoken->cost + rec->accumulated_cost_offset[ wtoken->end_time];
134 cost_for_word = cost - next_wtoken->cost - rec->accumulated_cost_offset[ next_wtoken->end_time];
138 cost_for_word = cost;
141 PLogMessage (" (%d W%d %s cost=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, wt (…)
310 bigcostdata cost, cost_for_word; local
521 bigcostdata cost; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_cost.h | 36 int cost = 0; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
45 return cost;
|
| /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,
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_robust.h | 43 double cost; member in struct:db_stat_struct
|
| /external/ceres-solver/internal/ceres/ |
| evaluator.h | 52 // 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,
[all...] |
| residual_block_utils.cc | 48 double* cost,
54 InvalidateArray(1, cost);
66 double* cost,
69 CHECK_NOTNULL(cost);
117 double* cost,
|
| autodiff_cost_function_test.cc | 46 T* cost) const {
47 cost[0] = x[0] * y[0] + x[1] * y[1] - T(a_);
105 T* cost) const {
106 cost[0] = *x0 + *x1 + *x2 + *x3 + *x4 + *x5 + *x6 + *x7 + *x8 + *x9;
|
| line_search_minimizer.cc | 74 &(state->cost),
133 // Do initial cost and Jacobian evaluation.
136 summary->message = "Initial cost and jacobian evaluation failed. "
142 summary->initial_cost = current_state.cost + summary->fixed_cost;
143 iteration_summary.cost = current_state.cost + summary->fixed_cost;
294 : min(1.0, 2.0 * (current_state.cost - previous_state.cost) /
305 (current_state.cost - previous_state.cost));
[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...] |
| residual_block.cc | 68 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.
|
| 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...] |
| callbacks.cc | 71 summary.cost,
81 output = "iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time\n";
87 summary.cost,
|
| /external/proguard/src/proguard/shrink/ |
| ShortestUsageMark.java | 65 int cost,
68 this(previousUsageMark, reason, cost, clazz, null);
78 * @param cost the added cost of following this path.
82 int cost,
88 this.depth = previousUsageMark.depth + cost;
|
| /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/srec/srec/include/ |
| srec_results.h | 42 int srec_nbest_get_result(void* nbest, int n, char* label, int label_len, asr_int32_t* cost, int whether_strip_slot_markers);
44 ESR_ReturnCode srec_nbest_get_resultWordIDs(void* nbest, size_t inde, wordID* wordIDs, size_t* len, asr_int32_t* cost);
|
| /external/chromium_org/third_party/webrtc/test/ |
| common_unittest.cc | 61 virtual int cost(int x) const { function in struct:webrtc::__anon20790::Algo1_CostFunction
69 virtual int cost(int x) const { function in struct:webrtc::__anon20790::SqrCost
77 EXPECT_EQ(25, config.Get<Algo1_CostFunction>().cost(5));
|
| /external/srec/srec/ca/ |
| rec_resu.c | 45 bigcostdata cost; local
47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil);
49 *score = cost;
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| bit_cost.h | 15 // 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
|
| /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...] |
| /ndk/sources/host-tools/sed-4.2.1/sed/ |
| fmt.c | 48 cost of 50 means that it is as bad as a line 5 characters too short
52 typedef long COST;
54 #define MAXCOST (~(((unsigned long) 1) << (8 * sizeof (COST) -1)))
57 #define EQUIV(n) SQR ((COST) (n))
59 /* Cost of a filled line n chars longer or shorter than best_width. */
62 /* Cost of the difference between adjacent filled lines. */
65 /* Basic cost per line. */
68 /* Cost of breaking a line after the first word of a sentence, where
72 /* Cost of breaking a line before the last word of a sentence, where
79 /* Cost of breaking a line after a period not marking end of a sentence
484 register COST cost; local
518 register COST cost; local
[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...] |
| /external/opencv/cv/src/ |
| cvemd.cpp | 87 float **cost; member in struct:CvEMDState
120 const float* cost, int cost_step,
124 static CvStatus icvFindBasicVariables( float **cost, char **is_x,
127 static float icvIsOptimal( float **cost, char **is_x,
175 CvMat cost_stub, *cost = &cost_stub; local
207 cost->data.fl = 0;
208 cost->step = 0;
216 "Only one of cost matrix or distance function should be non-NULL in case of user-defined distance" );
220 "The lower boundary can not be calculated if the cost matrix is used" );
222 CV_CALL( cost = cvGetMat( cost_matrix, &cost_stub ))
918 float **cost = state->cost; local
[all...] |
