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

12345

/external/ceres-solver/internal/ceres/
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 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 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 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...]
/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/chromium_org/third_party/libvpx/source/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/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_cost.c37 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 Dvp9_cost.h36 int cost = 0; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
45 return cost;
/external/chromium_org/third_party/webrtc/test/
H A Dcommon_unittest.cc61 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));
/external/clang/utils/
H A DCmpDriver41 def cost(a, b): function in function:insertMinimumPadding
52 current = cost(a, b)
56 candidate = cost(a_0, b)
/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/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.c37 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 Dvp9_cost.h36 int cost = 0; local
41 cost += vp9_cost_bit(probs[i >> 1], bit);
45 return cost;
/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/chromium_org/third_party/libwebp/enc/
H A Dcost.h35 CostArray* cost; member in struct:__anon13271
49 // approximate cost per level:
64 // Level cost calculations
/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/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/srec/srec/ca/
H A Drec_nbes.c99 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument
106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost);
/external/webp/src/enc/
H A Dcost.h35 CostArray* cost; member in struct:__anon33368
49 // approximate cost per level:
64 // Level cost calculations
/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);

Completed in 465 milliseconds

12345