/external/ceres-solver/internal/ceres/ |
H A D | residual_block_utils.h | 36 // compute part of a cost/residual/jacobian. 38 // 2. Numerical failure while computing the cost/residual/jacobian, 54 // Invalidate cost, resdual and jacobian arrays (if not NULL). 56 double* cost, 60 // Check if any of the arrays cost, residuals or jacobians contains an 64 double* cost, 73 double* cost,
|
H A D | residual_block_test.cc | 42 // 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 D | line_search_minimizer.h | 51 : cost(0.0), 59 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
|
H A D | 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, 151 Evaluate(const double* state, double* cost, double* residuals, double* gradient, SparseMatrix* jacobian) argument [all...] |
H A D | evaluator_test_utils.h | 41 double cost; member in struct:ceres::internal::ExpectedEvaluation
|
H A D | residual_block_utils.cc | 48 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 D | 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;
|
H A D | 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...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
H A D | treewriter.c | 14 static void cost( function 32 cost(C, T, P, j, d); 38 cost(c, t, p, 0, 0); 42 cost(c, t, p, start, 0);
|
/external/clang/test/CodeGenCXX/ |
H A D | array-operator-delete-call.cpp | 24 S *cost; member in struct:COST 35 cost = new S[3]; 42 if (cost) { 43 delete [] cost;
|
/external/libvpx/libvpx/vp8/encoder/ |
H A D | treewriter.c | 14 static void cost( function 32 cost(C, T, P, j, d); 38 cost(c, t, p, 0, 0); 42 cost(c, t, p, start, 0);
|
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
H A D | literal_cost.h | 15 // Literal cost model to allow backward reference replacement to be efficient. 27 // to the ringbuffer (cost, mask). 30 float *cost); 34 float *cost);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, function 49 cost(costs, tree, probs, ii, cc); 54 cost(costs, tree, probs, 0, 0); 61 cost(costs, tree, probs, 2, 0);
|
H A D | vp9_cost.h | 36 int cost = 0; local 41 cost += vp9_cost_bit(probs[i >> 1], bit); 45 return cost;
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
H A D | ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, function 49 cost(costs, tree, probs, ii, cc); 54 cost(costs, tree, probs, 0, 0); 61 cost(costs, tree, probs, 2, 0);
|
H A D | vp9_cost.h | 36 int cost = 0; local 41 cost += vp9_cost_bit(probs[i >> 1], bit); 45 return cost;
|
/external/srec/srec/crec/ |
H A D | 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 < eftoke [all...] |
H A D | 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 310 bigcostdata cost, cost_for_word; local 486 srec_get_top_choice_score(multi_srec* recm, bigcostdata *cost, int do_incsil) argument 521 bigcostdata cost; local [all...] |
/external/proguard/src/proguard/shrink/ |
H A D | 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; 63 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz) argument 80 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz, Member member) argument
|
/external/ceres-solver/include/ceres/ |
H A D | 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/srec/srec/include/ |
H A D | 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/ |
H A D | common_unittest.cc | 61 virtual int cost(int x) const { function in struct:webrtc::__anon16172::Algo1_CostFunction 69 virtual int cost(int x) const { function in struct:webrtc::__anon16172::SqrCost 77 EXPECT_EQ(25, config.Get<Algo1_CostFunction>().cost(5));
|