| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| 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/libvpx/libvpx/vp8/encoder/ |
| 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);
|
| /bionic/libc/kernel/uapi/linux/netfilter/ |
| xt_limit.h | 31 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /bionic/libc/kernel/uapi/linux/netfilter_bridge/ |
| ebt_limit.h | 31 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /development/ndk/platforms/android-3/include/linux/netfilter/ |
| xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
| /development/ndk/platforms/android-L/include/linux/netfilter/ |
| xt_limit.h | 31 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /development/ndk/platforms/android-L/include/linux/netfilter_bridge/ |
| ebt_limit.h | 31 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /external/ceres-solver/internal/ceres/ |
| evaluator_test_utils.h | 41 double cost; member in struct:ceres::internal::ExpectedEvaluation
|
| line_search_minimizer.h | 51 : cost(0.0),
59 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
|
| 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 = 0.0
246 double cost; local
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/ |
| 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);
|
| 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/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/uapi/linux/netfilter/ |
| xt_limit.h | 20 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
| ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /external/libvpx/libvpx/vp9/encoder/ |
| 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);
|
| 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/ |
| gradient_checker.h | 32 // 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.resize(num_residuals, 1)
[all...] |
| /external/chromium_org/third_party/libwebp/enc/ |
| cost.h | 10 // Cost tables for level and modes.
35 CostArray* cost; member in struct:__anon17896
49 // approximate cost per level:
53 // Cost of coding one event with probability 'proba'.
58 // Cost calculation function.
64 // Level cost calculations
|
| /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/clang/utils/ |
| CmpDriver | 41 def cost(a, b): function in function:insertMinimumPadding
52 current = cost(a, b)
56 candidate = cost(a_0, b)
|
| /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/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);
|
