Home
last modified time | relevance | path

Searched refs:counts (Results 1 – 25 of 1322) sorted by relevance

12345678910>>...53

/external/tensorflow/tensorflow/contrib/distributions/python/ops/
Dbinomial.py236 def _log_prob(self, counts): argument
237 return self._log_unnormalized_prob(counts) - self._log_normalization(counts)
240 def _prob(self, counts): argument
241 return math_ops.exp(self._log_prob(counts))
243 def _cdf(self, counts): argument
244 counts = self._maybe_assert_valid_sample(counts)
246 if not (counts.shape.is_fully_defined()
248 and counts.shape.is_compatible_with(self.probs.shape)):
250 probs += array_ops.zeros_like(counts)
251 counts += array_ops.zeros_like(self.probs)
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
DPeriod.java32 final int[] counts; field in Period
168 for (int i = 0; i < counts.length; ++i) { in isSet()
169 if (counts[i] != 0) { in isSet()
182 return counts[unit.ordinal] > 0; in isSet()
193 if (counts[ord] == 0) { in getCount()
196 return (counts[ord] - 1)/1000f; in getCount()
269 for (int i = 0; i < counts.length; ++i) { in equals()
270 if (counts[i] != rhs.counts[i]) { in equals()
286 for (int i = 0; i < counts.length; ++i) { in hashCode()
287 hc = (hc << 2) ^ counts[i]; in hashCode()
[all …]
DBasicPeriodFormatter.java44 return format(period.timeLimit, period.inFuture, period.counts); in format()
57 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
59 for (int i = 0; i < counts.length; ++i) { in format()
60 if (counts[i] > 0) { in format()
70 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
71 if ((mask & m) != 0 && counts[i] == 1) { in format()
94 counts[sx] += (counts[mx]-1)/1000; in format()
103 counts[sx] = 1; in format()
105 counts[sx] += (counts[mx]-1)/1000; in format()
114 int last = counts.length - 1; in format()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/duration/
DPeriod.java34 final int[] counts; field in Period
170 for (int i = 0; i < counts.length; ++i) { in isSet()
171 if (counts[i] != 0) { in isSet()
184 return counts[unit.ordinal] > 0; in isSet()
195 if (counts[ord] == 0) { in getCount()
198 return (counts[ord] - 1)/1000f; in getCount()
271 for (int i = 0; i < counts.length; ++i) { in equals()
272 if (counts[i] != rhs.counts[i]) { in equals()
288 for (int i = 0; i < counts.length; ++i) { in hashCode()
289 hc = (hc << 2) ^ counts[i]; in hashCode()
[all …]
DBasicPeriodFormatter.java45 return format(period.timeLimit, period.inFuture, period.counts); in format()
58 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
60 for (int i = 0; i < counts.length; ++i) { in format()
61 if (counts[i] > 0) { in format()
71 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
72 if ((mask & m) != 0 && counts[i] == 1) { in format()
95 counts[sx] += (counts[mx]-1)/1000; in format()
104 counts[sx] = 1; in format()
106 counts[sx] += (counts[mx]-1)/1000; in format()
115 int last = counts.length - 1; in format()
[all …]
/external/strace/
Dcount.c47 #define counts (countv[current_personality]) macro
57 if (!counts) in count_syscall()
58 counts = xcalloc(nsyscalls, sizeof(*counts)); in count_syscall()
59 struct call_counts *cc = &counts[tcp->scno]; in count_syscall()
80 return -ts_cmp(&counts[*((int *) a)].time, in time_cmp()
81 &counts[*((int *) b)].time); in time_cmp()
95 int m = counts[*((int *) a)].calls; in count_cmp()
96 int n = counts[*((int *) b)].calls; in count_cmp()
149 if (counts == NULL || counts[i].calls == 0) in call_summary_pers()
151 ts_mul(&dtv, &overhead, counts[i].calls); in call_summary_pers()
[all …]
/external/libchrome/base/metrics/
Dsample_vector.cc39 if (!counts()) { in Accumulate()
47 if (counts()) in Accumulate()
59 subtle::NoBarrier_AtomicIncrement(&counts()[bucket_index], count); in Accumulate()
79 if (counts() || MountExistingCountsStorage()) { in TotalCount()
82 const HistogramBase::AtomicCount* counts_array = counts(); in TotalCount()
102 if (counts() || MountExistingCountsStorage()) in GetCountAtIndex()
103 return subtle::NoBarrier_Load(&counts()[bucket_index]); in GetCountAtIndex()
119 if (counts() || MountExistingCountsStorage()) { in Iterator()
120 return std::make_unique<SampleVectorIterator>(counts(), counts_size(), in Iterator()
164 if (!counts()) { in AddSubtractImpl()
[all …]
/external/tensorflow/tensorflow/python/ops/distributions/
Dmultinomial.py280 def _log_prob(self, counts): argument
281 return self._log_unnormalized_prob(counts) - self._log_normalization(counts)
283 def _log_unnormalized_prob(self, counts): argument
284 counts = self._maybe_assert_valid_sample(counts)
285 return math_ops.reduce_sum(counts * nn_ops.log_softmax(self.logits), -1)
287 def _log_normalization(self, counts): argument
288 counts = self._maybe_assert_valid_sample(counts)
289 return -distribution_util.log_combinations(self.total_count, counts)
307 def _maybe_assert_valid_sample(self, counts): argument
310 return counts
[all …]
Ddirichlet_multinomial.py281 def _log_prob(self, counts): argument
282 counts = self._maybe_assert_valid_sample(counts)
284 special_math_ops.lbeta(self.concentration + counts)
287 self.total_count, counts)
290 def _prob(self, counts): argument
291 return math_ops.exp(self._log_prob(counts))
346 def _maybe_assert_valid_sample(self, counts): argument
349 return counts
350 counts = distribution_util.embed_check_nonnegative_integer_form(counts)
353 self.total_count, math_ops.reduce_sum(counts, -1),
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/tools/llvm-profdata/
Dmultiple-inputs.test4 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
6 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
10 FOO3: Block counts: [7, 6]
16 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3EMPTY
20 FOO3EMPTY: Block counts: [2, 3]
26 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
27 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
31 FOO3FOO3BAR3-1: Block counts: [5, 8]
35 FOO3FOO3BAR3-2: Block counts: [11, 13]
41 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=DISJOINT --check-pr…
[all …]
Dgeneral.proftext5 # RUN: llvm-profdata show %t.profdata --function function_count_only --counts | FileCheck %s -check…
13 # FUNC_COUNT_ONLY-NEXT: Block counts: []
15 # RUN: llvm-profdata show %t.profdata.dense --function "name with spaces" --counts | FileCheck %s -…
16 # RUN: llvm-profdata show %t.profdata --function "name with spaces" --counts | FileCheck %s --check…
25 # SPACES-NEXT: Block counts: [0]
28 # RUN: llvm-profdata show %t.profdata --function large_numbers --counts | FileCheck %s -check-prefi…
41 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
74 …D-SUMMARY: 3 blocks with count >= 576460752303423488 account for 80 percentage of the total counts.
75 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 90 percentage of the total counts.
76 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 95 percentage of the total counts.
[all …]
Dcompat.proftext8 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function function_count_only --counts | Fi…
16 # FUNC_COUNT_ONLY-NEXT: Block counts: []
18 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function "name with spaces" --counts | Fil…
27 # SPACES-NEXT: Block counts: [0]
29 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function large_numbers --counts | FileChec…
42 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
49 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v2 -all-functions --counts | FileCheck %s -chec…
56 # FORMATV2-NEXT: Block counts: [179900]
61 # FORMATV2-NEXT: Block counts: [1000, 1000000, 499500]
68 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v4 -all-functions --counts | FileCheck %s -chec…
[all …]
/external/llvm/test/tools/llvm-profdata/
Dgeneral.proftext5 # RUN: llvm-profdata show %t.profdata --function function_count_only --counts | FileCheck %s -check…
13 # FUNC_COUNT_ONLY-NEXT: Block counts: []
15 # RUN: llvm-profdata show %t.profdata.dense --function "name with spaces" --counts | FileCheck %s -…
16 # RUN: llvm-profdata show %t.profdata --function "name with spaces" --counts | FileCheck %s --check…
25 # SPACES-NEXT: Block counts: [0]
28 # RUN: llvm-profdata show %t.profdata --function large_numbers --counts | FileCheck %s -check-prefi…
41 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
74 …D-SUMMARY: 3 blocks with count >= 576460752303423488 account for 80 percentage of the total counts.
75 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 90 percentage of the total counts.
76 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 95 percentage of the total counts.
[all …]
Dmultiple-inputs.test4 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
6 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
10 FOO3: Block counts: [7, 6]
16 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3EMPTY
20 FOO3EMPTY: Block counts: [2, 3]
26 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
27 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
31 FOO3FOO3BAR3-1: Block counts: [5, 8]
35 FOO3FOO3BAR3-2: Block counts: [11, 13]
41 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=DISJOINT --check-pr…
[all …]
Dcompat.proftext8 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function function_count_only --counts | Fi…
16 # FUNC_COUNT_ONLY-NEXT: Block counts: []
18 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function "name with spaces" --counts | Fil…
27 # SPACES-NEXT: Block counts: [0]
29 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function large_numbers --counts | FileChec…
42 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
49 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v2 -all-functions --counts | FileCheck %s -chec…
56 # FORMATV2-NEXT: Block counts: [179900]
61 # FORMATV2-NEXT: Block counts: [1000, 1000000, 499500]
67 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v4 -all-functions --counts | FileCheck %s -chec…
[all …]
/external/brotli/c/enc/
Dentropy_encode.c242 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts, in BrotliOptimizeHuffmanCountsForRle() argument
252 if (counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
259 while (length != 0 && counts[length - 1] == 0) { in BrotliOptimizeHuffmanCountsForRle()
270 if (counts[i] != 0) { in BrotliOptimizeHuffmanCountsForRle()
272 if (smallest_nonzero > counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
273 smallest_nonzero = counts[i]; in BrotliOptimizeHuffmanCountsForRle()
285 if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0) { in BrotliOptimizeHuffmanCountsForRle()
286 counts[i] = 1; in BrotliOptimizeHuffmanCountsForRle()
302 uint32_t symbol = counts[0]; in BrotliOptimizeHuffmanCountsForRle()
305 if (i == length || counts[i] != symbol) { in BrotliOptimizeHuffmanCountsForRle()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
DChiSquareTestImpl.java151 public double chiSquare(long[][] counts) throws IllegalArgumentException { in chiSquare() argument
153 checkArray(counts); in chiSquare()
154 int nRows = counts.length; in chiSquare()
155 int nCols = counts[0].length; in chiSquare()
163 rowSum[row] += counts[row][col]; in chiSquare()
164 colSum[col] += counts[row][col]; in chiSquare()
165 total += counts[row][col]; in chiSquare()
175 sumSq += ((counts[row][col] - expected) * in chiSquare()
176 (counts[row][col] - expected)) / expected; in chiSquare()
188 public double chiSquareTest(long[][] counts) in chiSquareTest() argument
[all …]
/external/libchrome/base/task/sequence_manager/
Dtask_queue_selector_unittest.cc385 size_t counts[] = {0, 0}; in TEST_F() local
391 counts[chosen_queue_index]++; in TEST_F()
394 EXPECT_GT(counts[1], 0ul); // Check highest doesn't starve high. in TEST_F()
395 EXPECT_GT(counts[0], counts[1]); // Check highest gets more chance to run. in TEST_F()
405 size_t counts[] = {0, 0, 0}; in TEST_F() local
411 counts[chosen_queue_index]++; in TEST_F()
416 EXPECT_GT(counts[0], counts[1]); in TEST_F()
419 EXPECT_GE(counts[1], counts[2]); in TEST_F()
422 EXPECT_GT(counts[2], 0ul); in TEST_F()
434 size_t counts[] = {0, 0, 0, 0}; in TEST_F() local
[all …]
/external/libvpx/libvpx/vp9/decoder/
Dvp9_decodemv.c35 FRAME_COUNTS *counts = xd->counts; in read_intra_mode_y() local
36 if (counts) ++counts->y_mode[size_group][y_mode]; in read_intra_mode_y()
45 FRAME_COUNTS *counts = xd->counts; in read_intra_mode_uv() local
46 if (counts) ++counts->uv_mode[y_mode][uv_mode]; in read_intra_mode_uv()
54 FRAME_COUNTS *counts = xd->counts; in read_inter_mode() local
55 if (counts) ++counts->inter_mode[ctx][mode]; in read_inter_mode()
66 FRAME_COUNTS *counts = xd->counts; in read_selected_tx_size() local
76 if (counts) ++get_tx_counts(max_tx_size, ctx, &counts->tx)[tx_size]; in read_selected_tx_size()
186 FRAME_COUNTS *counts = xd->counts; in read_skip() local
187 if (counts) ++counts->skip[ctx][skip]; in read_skip()
[all …]
/external/rappor/client/javatest/com/google/android/rappor/
DEncoderTest.java666 int counts[] = new int[64]; in testEncoderEncodeBits_prrFlipProbability() local
682 counts[iBit]++; in testEncoderEncodeBits_prrFlipProbability()
687 assertEquals(9843, counts[0]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
688 assertEquals(173, counts[1]); // input = 0, expectation = 156.25 in testEncoderEncodeBits_prrFlipProbability()
689 assertEquals(9839, counts[2]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
690 assertEquals(9831, counts[3]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
691 assertEquals(9848, counts[4]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
692 assertEquals(9828, counts[5]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
693 assertEquals(9834, counts[6]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
694 assertEquals(9837, counts[7]); // input = 1, expectation = 9843.75 in testEncoderEncodeBits_prrFlipProbability()
[all …]
/external/libvpx/libvpx/vpx_dsp/
Dprob.c29 const unsigned int *counts, in tree_merge_probs_impl() argument
33 (l <= 0) ? counts[-l] in tree_merge_probs_impl()
34 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs); in tree_merge_probs_impl()
37 (r <= 0) ? counts[-r] in tree_merge_probs_impl()
38 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs); in tree_merge_probs_impl()
45 const unsigned int *counts, vpx_prob *probs) { in vpx_tree_merge_probs() argument
46 tree_merge_probs_impl(0, tree, pre_probs, counts, probs); in vpx_tree_merge_probs()
/external/tensorflow/tensorflow/python/kernel_tests/distributions/
Ddirichlet_multinomial_test.py117 counts = [1., 0]
119 pmf = dist.prob(counts)
129 counts = [3., 2]
131 pmf = dist.prob(counts)
140 counts = [3., 2]
143 pmf = dist.prob(counts)
152 counts = [[1., 0], [0., 1]]
154 pmf = dist.prob(counts)
163 counts = [[1., 0], [0., 1]]
164 pmf = ds.DirichletMultinomial(1., alpha).prob(counts)
[all …]
/external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/
Dbinomial_test.py122 counts = 1.
124 pmf = binom.prob(counts)
125 cdf = binom.cdf(counts)
127 self.assertAllClose(stats.binom.cdf(counts, n=1, p=p), cdf.eval())
135 counts = 3.
137 pmf = binom.prob(counts)
138 cdf = binom.cdf(counts)
139 self.assertAllClose(stats.binom.pmf(counts, n=5., p=p), pmf.eval())
140 self.assertAllClose(stats.binom.cdf(counts, n=5., p=p), cdf.eval())
147 counts = [[1., 2.]]
[all …]
/external/libvpx/libvpx/vp9/common/
Dvp9_entropymode.c344 const FRAME_COUNTS *counts = &cm->counts; in vp9_adapt_mode_probs() local
348 counts->intra_inter[i]); in vp9_adapt_mode_probs()
351 mode_mv_merge_probs(pre_fc->comp_inter_prob[i], counts->comp_inter[i]); in vp9_adapt_mode_probs()
354 mode_mv_merge_probs(pre_fc->comp_ref_prob[i], counts->comp_ref[i]); in vp9_adapt_mode_probs()
358 pre_fc->single_ref_prob[i][j], counts->single_ref[i][j]); in vp9_adapt_mode_probs()
362 counts->inter_mode[i], fc->inter_mode_probs[i]); in vp9_adapt_mode_probs()
366 counts->y_mode[i], fc->y_mode_prob[i]); in vp9_adapt_mode_probs()
370 counts->uv_mode[i], fc->uv_mode_prob[i]); in vp9_adapt_mode_probs()
374 counts->partition[i], fc->partition_prob[i]); in vp9_adapt_mode_probs()
380 counts->switchable_interp[i], fc->switchable_interp_prob[i]); in vp9_adapt_mode_probs()
[all …]
/external/guava/guava/src/com/google/common/collect/
DRegularImmutableSortedMultiset.java33 private final transient int[] counts; field in RegularImmutableSortedMultiset
40 int[] counts, in RegularImmutableSortedMultiset() argument
45 this.counts = counts; in RegularImmutableSortedMultiset()
55 counts[offset + index]); in getEntry()
71 return (index == -1) ? 0 : counts[index + offset]; in count()
106 subElementSet, counts, cumulativeCounts, offset + from, to - from); in getSubMultiset()
112 return offset > 0 || length < counts.length; in isPartialView()

12345678910>>...53