Searched refs:cost (Results 1 - 25 of 133) sorted by relevance

123456

/external/ceres-solver/internal/ceres/
H A Dresidual_block_utils.h36 // 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 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 Dline_search_minimizer.h51 : cost(0.0),
59 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
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_utils.h41 double cost; member in struct:ceres::internal::ExpectedEvaluation
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 Dautodiff_cost_function_test.cc46 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 Dline_search_minimizer.cc74 &(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...]
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 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
/external/clang/test/CodeGenCXX/
H A Darray-operator-delete-call.cpp24 S *cost; member in struct:COST
35 cost = new S[3];
42 if (cost) {
43 delete [] cost;
/external/libvpx/libvpx/vp8/encoder/
H A Dtreewriter.c14 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/iptables/include/linux/netfilter/
H A Dxt_limit.h20 __u32 credit_cap, cost; member in struct:xt_rateinfo
/external/kernel-headers/original/uapi/linux/netfilter/
H A Dxt_limit.h20 __u32 credit_cap, cost; member in struct:xt_rateinfo
/external/kernel-headers/original/uapi/linux/netfilter_bridge/
H A Debt_limit.h21 __u32 credit_cap, cost; member in struct:ebt_limit_info
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.c38 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, function
50 cost(costs, tree, probs, ii, cc);
55 cost(costs, tree, probs, 0, 0);
62 cost(costs, tree, probs, 2, 0);
H A Dvp9_cost.h36 int cost = 0; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
45 return cost;
/external/webp/src/dsp/
H A Dcost_mips_dsp_r2.c16 #include "../enc/cost.h"
29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
59 "addu %[cost], %[cost], %[temp1] \n\t"
65 "addu %[cost], %[cost], %[temp0] \n\t"
70 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg),
83 cost += VP8LevelCost(t, v);
88 cost
[all...]
H A Dcost_mips32.c16 #include "../enc/cost.h"
29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
62 "addu %[cost], %[cost], %[temp1] \n\t"
69 "addu %[cost], %[cost], %[temp0] \n\t"
75 : [cost]"+&r"(cost), [t]"+&r"(t), [n]"+&r"(n), [v_reg]"=&r"(v_reg),
88 cost += VP8LevelCost(t, v);
93 cost
[all...]
H A Dcost.c13 #include "../enc/cost.h"
16 // Boolean-cost cost table
48 // Level cost tables
331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
339 cost += VP8LevelCost(t, v);
346 cost += VP8LevelCost(t, v);
351 cost += VP8BitCost(0, last_p0);
354 return cost;
H A Dcost_sse2.c10 // SSE2 version of cost functions
19 #include "../enc/cost.h"
56 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0; local
86 cost += VP8LevelFixedCosts[flevel] + t[level]; // simplified VP8LevelCost()
94 cost += VP8LevelFixedCosts[flevel] + t[level];
99 cost += VP8BitCost(0, last_p0);
102 return cost;
/external/proguard/src/proguard/shrink/
H A DShortestUsageMark.java65 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 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/webrtc/webrtc/test/
H A Dcommon_unittest.cc64 virtual int cost(int x) const { function in struct:webrtc::__anon20595::Algo1_CostFunction
72 virtual int cost(int x) const { function in struct:webrtc::__anon20595::SqrCost
80 EXPECT_EQ(25, config.Get<Algo1_CostFunction>().cost(5));
/external/webrtc/webrtc/modules/rtp_rtcp/source/
H A Dvp8_partition_aggregator.cc52 int cost = 0; local
55 cost = std::max(max_parent_size_, this_size_int()) -
58 cost = std::max(max_parent_size_, this_size_int()) - min_parent_size_;
60 return cost + NumPackets() * penalty;
135 // Compare cost estimate for "second" with actual cost for "first".
249 size_t cost = 0; local
251 cost = min_size - fragment_size + n * penalty;
253 cost = fragment_size - max_size + n * penalty;
255 cost
[all...]

Completed in 1180 milliseconds

123456