Home
last modified time | relevance | path

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

12345678910>>...24

/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/
DPeriod.java30 final int[] counts; field in Period
166 for (int i = 0; i < counts.length; ++i) { in isSet()
167 if (counts[i] != 0) { in isSet()
180 return counts[unit.ordinal] > 0; in isSet()
191 if (counts[ord] == 0) { in getCount()
194 return (counts[ord] - 1)/1000f; in getCount()
266 for (int i = 0; i < counts.length; ++i) { in equals()
267 if (counts[i] != rhs.counts[i]) { in equals()
282 for (int i = 0; i < counts.length; ++i) { in hashCode()
283 hc = (hc << 2) ^ counts[i]; in hashCode()
[all …]
DBasicPeriodFormatter.java41 return format(period.timeLimit, period.inFuture, period.counts); in format()
53 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
55 for (int i = 0; i < counts.length; ++i) { in format()
56 if (counts[i] > 0) { in format()
66 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
67 if ((mask & m) != 0 && counts[i] == 1) { in format()
90 counts[sx] += (counts[mx]-1)/1000; in format()
99 counts[sx] = 1; in format()
101 counts[sx] += (counts[mx]-1)/1000; in format()
110 int last = counts.length - 1; in format()
[all …]
/external/strace/
Dcount.c46 #define counts (countv[current_personality]) macro
61 if (!counts) { in count_syscall()
62 counts = calloc(nsyscalls, sizeof(*counts)); in count_syscall()
63 if (!counts) in count_syscall()
66 cc = &counts[scno]; in count_syscall()
111 return -tv_cmp(&counts[*((int *) a)].time, in time_cmp()
112 &counts[*((int *) b)].time); in time_cmp()
125 int m = counts[*((int *) a)].calls; in count_cmp()
126 int n = counts[*((int *) b)].calls; in count_cmp()
184 if (counts == NULL || counts[i].calls == 0) in call_summary_pers()
[all …]
/external/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
30 FOO3FOO3BAR3: Block counts: [5, 8]
34 FOO3FOO3BAR3: Block counts: [11, 13]
40 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=DISJOINT
44 DISJOINT: Block counts: [2, 3]
[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…
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 --function "name with spaces" --counts | FileCheck %s -check-…
24 # SPACES-NEXT: Block counts: [0]
26 # RUN: llvm-profdata show %t.profdata --function large_numbers --counts | FileCheck %s -check-prefi…
39 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
/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 …]
DChiSquareTest.java150 double chiSquare(long[][] counts) in chiSquare() argument
181 double chiSquareTest(long[][] counts) in chiSquareTest() argument
219 boolean chiSquareTest(long[][] counts, double alpha) in chiSquareTest() argument
/external/libvpx/libvpx/vp9/common/
Dvp9_prob.c36 const unsigned int *counts, in tree_merge_probs_impl() argument
42 ? counts[-l] in tree_merge_probs_impl()
43 : tree_merge_probs_impl(l, tree, pre_probs, counts, in tree_merge_probs_impl()
47 ? counts[-r] in tree_merge_probs_impl()
48 : tree_merge_probs_impl(r, tree, pre_probs, counts, in tree_merge_probs_impl()
57 const unsigned int *counts, unsigned int count_sat, in vp9_tree_merge_probs() argument
59 tree_merge_probs_impl(0, tree, pre_probs, counts, count_sat, in vp9_tree_merge_probs()
Dvp9_entropymode.c345 const vp9_prob *pre_probs, const unsigned int *counts, in adapt_probs() argument
347 vp9_tree_merge_probs(tree, pre_probs, counts, COUNT_SAT, MAX_UPDATE_FACTOR, in adapt_probs()
355 const FRAME_COUNTS *counts = &cm->counts; in vp9_adapt_mode_probs() local
359 counts->intra_inter[i]); in vp9_adapt_mode_probs()
362 counts->comp_inter[i]); in vp9_adapt_mode_probs()
365 counts->comp_ref[i]); in vp9_adapt_mode_probs()
369 counts->single_ref[i][j]); in vp9_adapt_mode_probs()
373 counts->inter_mode[i], fc->inter_mode_probs[i]); in vp9_adapt_mode_probs()
377 counts->y_mode[i], fc->y_mode_prob[i]); in vp9_adapt_mode_probs()
381 counts->uv_mode[i], fc->uv_mode_prob[i]); in vp9_adapt_mode_probs()
[all …]
Dvp9_entropymv.c171 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) { in vp9_inc_mv() argument
172 if (counts != NULL) { in vp9_inc_mv()
174 ++counts->joints[j]; in vp9_inc_mv()
177 inc_mv_component(mv->row, &counts->comps[0], 1, 1); in vp9_inc_mv()
181 inc_mv_component(mv->col, &counts->comps[1], 1, 1); in vp9_inc_mv()
191 const unsigned int *counts, vp9_prob *probs) { in adapt_probs() argument
192 vp9_tree_merge_probs(tree, pre_probs, counts, MV_COUNT_SAT, in adapt_probs()
201 const nmv_context_counts *counts = &cm->counts.mv; in vp9_adapt_mv_probs() local
203 adapt_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, fc->joints); in vp9_adapt_mv_probs()
208 const nmv_component_counts *c = &counts->comps[i]; in vp9_adapt_mv_probs()
Dvp9_entropy.c750 vp9_coeff_count_model *counts = cm->counts.coef[tx_size]; in adapt_coef_probs() local
752 cm->counts.eob_branch[tx_size]; in adapt_coef_probs()
759 const int n0 = counts[i][j][k][l][ZERO_TOKEN]; in adapt_coef_probs()
760 const int n1 = counts[i][j][k][l][ONE_TOKEN]; in adapt_coef_probs()
761 const int n2 = counts[i][j][k][l][TWO_TOKEN]; in adapt_coef_probs()
762 const int neob = counts[i][j][k][l][EOB_MODEL_TOKEN]; in adapt_coef_probs()
/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()
DImmutableSortedMultiset.java105 int[] counts = {1}; in of() local
107 return new RegularImmutableSortedMultiset<E>(elementSet, counts, cumulativeCounts, 0, 1); in of()
296 int[] counts = new int[entries.size()]; in copyOfSortedEntries() local
301 counts[i] = entry.getCount(); in copyOfSortedEntries()
302 cumulativeCounts[i + 1] = cumulativeCounts[i] + counts[i]; in copyOfSortedEntries()
307 counts, cumulativeCounts, 0, entries.size()); in copyOfSortedEntries()
545 int[] counts; field in ImmutableSortedMultiset.SerializedForm
552 counts = new int[n]; in SerializedForm()
556 counts[i] = entry.getCount(); in SerializedForm()
565 builder.addCopies(elements[i], counts[i]); in readResolve()
/external/webp/src/utils/
Dhuffman_encode.c32 uint32_t* const counts) { in OptimizeHuffmanForRle() argument
39 if (counts[length - 1] != 0) { in OptimizeHuffmanForRle()
50 uint32_t symbol = counts[0]; in OptimizeHuffmanForRle()
53 if (i == length || counts[i] != symbol) { in OptimizeHuffmanForRle()
63 symbol = counts[i]; in OptimizeHuffmanForRle()
73 uint32_t limit = counts[0]; in OptimizeHuffmanForRle()
78 !ValuesShouldBeCollapsedToStrideAverage(counts[i], limit)) { in OptimizeHuffmanForRle()
93 counts[i - k - 1] = count; in OptimizeHuffmanForRle()
101 limit = (counts[i] + counts[i + 1] + in OptimizeHuffmanForRle()
102 counts[i + 2] + counts[i + 3] + 2) / 4; in OptimizeHuffmanForRle()
[all …]
/external/libvpx/libvpx/vp9/encoder/
Dvp9_encodemv.c151 const unsigned int counts[/*n - 1*/], in write_mv_update()
159 vp9_tree_probs_from_distribution(tree, branch_ct, counts); in write_mv_update()
167 nmv_context_counts *const counts = &cm->counts.mv; in vp9_write_nmv_probs() local
169 write_mv_update(vp9_mv_joint_tree, mvc->joints, counts->joints, MV_JOINTS, w); in vp9_write_nmv_probs()
173 nmv_component_counts *comp_counts = &counts->comps[i]; in vp9_write_nmv_probs()
187 counts->comps[i].class0_fp[j], MV_FP_SIZE, w); in vp9_write_nmv_probs()
189 write_mv_update(vp9_mv_fp_tree, mvc->comps[i].fp, counts->comps[i].fp, in vp9_write_nmv_probs()
195 update_mv(w, counts->comps[i].class0_hp, &mvc->comps[i].class0_hp, in vp9_write_nmv_probs()
197 update_mv(w, counts->comps[i].hp, &mvc->comps[i].hp, MV_UPDATE_PROB); in vp9_write_nmv_probs()
233 nmv_context_counts *counts) { in inc_mvs() argument
[all …]
Dvp9_tokenize.c173 unsigned int *counts) { in add_token() argument
179 ++counts[token]; in add_token()
186 unsigned int *counts) { in add_token_no_extra() argument
191 ++counts[token]; in add_token_no_extra()
220 unsigned int (*const counts)[COEFF_CONTEXTS][ENTROPY_TOKENS] = in tokenize_b() local
225 cpi->common.counts.eob_branch[tx_size][type][ref]; in tokenize_b()
245 counts[band[c]][pt]); in tokenize_b()
259 counts[band[c]][pt]); in tokenize_b()
269 counts[band[c]][pt]); in tokenize_b()
313 cm->counts.skip[ctx][1] += skip_inc; in vp9_tokenize_sb()
[all …]
/external/deqp/modules/gles2/stress/
Des2sVertexArrayTests.cpp74 int counts[] = {1, 256}; in init() local
80 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
102 spec.drawCount = counts[countNdx]; in init()
143 int counts[] = {1, 256}; in init() local
152 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
172 spec.drawCount = counts[countNdx]; in init()
212 int counts[] = {5, 256}; in init() local
221 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
243 spec.drawCount = counts[countNdx]; in init()
247 …offsets[offsetNdx]) + "_stride" + typeToString(stride) + "_quads" + typeToString(counts[countNdx]); in init()
[all …]
/external/deqp/modules/gles3/stress/
Des3sVertexArrayTests.cpp76 int counts[] = {1, 256}; in init() local
82 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
88 …" + Array::inputTypeToString(inputTypes[inputTypeNdx]) + "_quads" + typeToString(counts[countNdx]); in init()
103 spec.drawCount = counts[countNdx]; in init()
174 int counts[] = {1, 256}; in init() local
181 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
190 …stride) + "_components" + typeToString(componentCount) + "_quads" + typeToString(counts[countNdx]); in init()
208 spec.drawCount = counts[countNdx]; in init()
278 int counts[] = {5, 256}; in init() local
285 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
[all …]
/external/skia/debugger/
DSkDebugger.cpp68 SkTDArray<int> counts; in getOverviewText() local
69 counts.setCount(SkDrawCommand::kOpTypeCount); in getOverviewText()
71 counts[i] = 0; in getOverviewText()
75 counts[commands[i]->getType()]++; in getOverviewText()
84 if (0 == counts[i]) { in getOverviewText()
92 overview->appendS32(counts[i]); in getOverviewText()
107 total += counts[i]; in getOverviewText()
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
DTestBNF.java133 int[] counts; field in TestBNF.Counts
135 counts = new int[max+1]; in Counts()
138 counts[index]++; in inc()
142 for (int i = 0; i < counts.length; ++i) { in show()
143 if (counts[i] == 0) continue; in show()
144 System.out.println(i + ": " + counts[i]); in show()
/external/e2fsprogs/tests/f_resize_inode/
Dexpect24 Pass 4: Checking reference counts
37 Pass 4: Checking reference counts
52 Pass 4: Checking reference counts
65 Pass 4: Checking reference counts
80 Pass 4: Checking reference counts
93 Pass 4: Checking reference counts
108 Pass 4: Checking reference counts
121 Pass 4: Checking reference counts
134 Pass 4: Checking reference counts
167 Pass 4: Checking reference counts
/external/llvm/test/Analysis/ScalarEvolution/
Dtrip-count9.ll11 ; CHECK: Determining loop execution counts for: @foo
27 ; CHECK: Determining loop execution counts for: @step2
43 ; CHECK: Determining loop execution counts for: @start1
59 ; CHECK: Determining loop execution counts for: @start1_step2
75 ; CHECK: Determining loop execution counts for: @startx
91 ; CHECK: Determining loop execution counts for: @startx_step2
107 ; CHECK: Determining loop execution counts for: @nsw
132 ; CHECK: Determining loop execution counts for: @nsw_step2
149 ; CHECK: Determining loop execution counts for: @nsw_start1
165 ; CHECK: Determining loop execution counts for: @nsw_start1_step2
[all …]
/external/deqp/modules/gles2/functional/
Des2fVertexArrayTest.cpp73 int counts[] = {1, 256}; in init() local
79 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
101 spec.drawCount = counts[countNdx]; in init()
142 int counts[] = {1, 256}; in init() local
151 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
171 spec.drawCount = counts[countNdx]; in init()
211 int counts[] = {5, 256}; in init() local
220 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
242 spec.drawCount = counts[countNdx]; in init()
246 …offsets[offsetNdx]) + "_stride" + typeToString(stride) + "_quads" + typeToString(counts[countNdx]); in init()
[all …]
/external/deqp/modules/gles3/functional/
Des3fVertexArrayTest.cpp73 int counts[] = {1, 256}; in init() local
79 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
85 …" + Array::inputTypeToString(inputTypes[inputTypeNdx]) + "_quads" + typeToString(counts[countNdx]); in init()
100 spec.drawCount = counts[countNdx]; in init()
171 int counts[] = {1, 256}; in init() local
178 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
187 …stride) + "_components" + typeToString(componentCount) + "_quads" + typeToString(counts[countNdx]); in init()
205 spec.drawCount = counts[countNdx]; in init()
275 int counts[] = {5, 256}; in init() local
282 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) in init()
[all …]

12345678910>>...24