/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
H A D | ChiSquareTest.java | 33 * frequency counts. 36 * the observed counts follow the expected distribution.</p> 39 * <li>Expected counts must all be positive. 41 * <li>Observed counts must all be >= 0. 49 * @param observed array of observed frequency counts 50 * @param expected array of expected frequency counts 63 * frequency counts to those in the <code>expected</code> array. 66 * the null hypothesis that the observed counts conform to the frequency distribution 67 * described by the expected counts.</p> 70 * <li>Expected counts mus 150 chiSquare(long[][] counts) argument 181 chiSquareTest(long[][] counts) argument 219 chiSquareTest(long[][] counts, double alpha) argument [all...] |
H A D | ChiSquareTestImpl.java | 58 * expected and observed counts are equal.</p> 60 * @param observed array of observed frequency counts 61 * @param expected array of expected frequency counts 107 * expected and observed counts are equal.</p> 109 * @param observed array of observed frequency counts 110 * @param expected array of expected frequency counts 126 * expected and observed counts are equal.</p> 128 * @param observed array of observed frequency counts 129 * @param expected array of expected frequency counts 147 * @param counts arra 151 chiSquare(long[][] counts) argument 188 chiSquareTest(long[][] counts) argument 204 chiSquareTest(long[][] counts, double alpha) argument [all...] |
H A D | TestUtils.java | 334 public static double chiSquare(long[][] counts) argument 336 return chiSquareTest.chiSquare(counts); 359 public static boolean chiSquareTest(long[][] counts, double alpha) argument 361 return chiSquareTest. chiSquareTest(counts, alpha); 367 public static double chiSquareTest(long[][] counts) argument 369 return chiSquareTest. chiSquareTest(counts);
|
/external/libvpx/libvpx/vpx_dsp/ |
H A D | prob.c | 35 const unsigned int *counts, 39 ? counts[-l] 40 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs); 43 ? counts[-r] 44 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs); 51 const unsigned int *counts, vpx_prob *probs) { 52 tree_merge_probs_impl(0, tree, pre_probs, counts, probs); 32 tree_merge_probs_impl(unsigned int i, const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument 50 vpx_tree_merge_probs(const vpx_tree_index *tree, const vpx_prob *pre_probs, const unsigned int *counts, vpx_prob *probs) argument
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
H A D | BasicPeriodFormatter.java | 41 return format(period.timeLimit, period.inFuture, period.counts); 53 private String format(int tl, boolean inFuture, int[] counts) { argument 55 for (int i = 0; i < counts.length; ++i) { 56 if (counts[i] > 0) { 66 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { 67 if ((mask & m) != 0 && counts[i] == 1) { 90 counts[sx] += (counts[mx]-1)/1000; 99 counts[sx] = 1; 101 counts[s [all...] |
H A D | Period.java | 30 final int[] counts; field in class:Period 166 for (int i = 0; i < counts.length; ++i) { 167 if (counts[i] != 0) { 180 return counts[unit.ordinal] > 0; 191 if (counts[ord] == 0) { 194 return (counts[ord] - 1)/1000f; 254 * the same counts, both extend into the future or both into the 266 for (int i = 0; i < counts.length; ++i) { 267 if (counts[i] != rhs.counts[ 301 Period(int timeLimit, boolean inFuture, int[] counts) argument [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | RegularImmutableSortedMultiset.java | 33 private final transient int[] counts; field in class:RegularImmutableSortedMultiset 40 int[] counts, 45 this.counts = counts; 55 counts[offset + index]); 71 return (index == -1) ? 0 : counts[index + offset]; 106 subElementSet, counts, cumulativeCounts, offset + from, to - from); 112 return offset > 0 || length < counts.length; 38 RegularImmutableSortedMultiset( RegularImmutableSortedSet<E> elementSet, int[] counts, long[] cumulativeCounts, int offset, int length) argument
|
H A D | ImmutableMultiset.java | 429 final int[] counts; field in class:ImmutableMultiset.SerializedForm 434 counts = new int[distinct]; 438 counts[i] = entry.getCount(); 447 multiset.add(elements[i], counts[i]);
|
H A D | ImmutableSortedMultiset.java | 105 int[] counts = {1}; 107 return new RegularImmutableSortedMultiset<E>(elementSet, counts, cumulativeCounts, 0, 1); 296 int[] counts = new int[entries.size()]; 301 counts[i] = entry.getCount(); 302 cumulativeCounts[i + 1] = cumulativeCounts[i] + counts[i]; 307 counts, cumulativeCounts, 0, entries.size()); 545 int[] counts; field in class:ImmutableSortedMultiset.SerializedForm 552 counts = new int[n]; 556 counts[i] = entry.getCount(); 565 builder.addCopies(elements[i], counts[ [all...] |
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/ |
H A D | TestBNF.java | 133 int[] counts; field in class:TestBNF.Counts 135 counts = new int[max+1]; 138 counts[index]++; 142 for (int i = 0; i < counts.length; ++i) { 143 if (counts[i] == 0) continue; 144 System.out.println(i + ": " + counts[i]); 199 Counts counts = new Counts(count + 10); 202 counts.inc(s.length()); 204 counts.show(); 208 Counts counts [all...] |
/external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/util/ |
H A D | CaseIterator.java | 407 private int[] counts; field in class:CaseIterator 423 counts = new int[source.length()]; 468 counts[i] = 0; 489 nextBuffer.append(variants[i][counts[i]]); 495 counts[i]++; 496 if (counts[i] < variants[i].length) break; 497 counts[i] = 0;
|
/external/libvncserver/libvncserver/ |
H A D | corre.c | 307 static int counts[NUMCLRS]; local 325 counts[i] = 0; 334 counts[k] += 1; 335 if (counts[k] > maxcount) { 336 maxcount = counts[k];
|
H A D | rre.c | 274 static int counts[NUMCLRS]; local 292 counts[i] = 0; 301 counts[k] += 1; 302 if (counts[k] > maxcount) { 303 maxcount = counts[k];
|
/external/skia/debugger/ |
H A D | SkDebugger.cpp | 68 SkTDArray<int> counts; local 69 counts.setCount(SkDrawCommand::kOpTypeCount); 71 counts[i] = 0; 75 counts[commands[i]->getType()]++; 84 if (0 == counts[i]) { 92 overview->appendS32(counts[i]); 107 total += counts[i];
|
/external/deqp/modules/gles2/stress/ |
H A D | es2sVertexArrayTests.cpp | 74 int counts[] = {1, 256}; local 80 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) 102 spec.drawCount = counts[countNdx]; 140 // Test strides with different input types, component counts and storage, Usage(?) 143 int counts[] = {1, 256}; local 152 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) 172 spec.drawCount = counts[countNdx]; 210 // Test strides with different input types, component counts and storage, Usage(?) 212 int counts[] = {5, 256}; local 221 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd 283 int counts[] = {1, 256}; local [all...] |
/external/guava/guava-tests/test/com/google/common/util/concurrent/ |
H A D | AtomicDoubleArrayTest.java | 290 volatile long counts; field in class:AtomicDoubleArrayTest.Counter 301 ++counts; 328 assertEquals(c1.counts + c2.counts, SIZE * COUNTDOWN);
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_entropymv.c | 164 void vp9_inc_mv(const MV *mv, nmv_context_counts *counts) { argument 165 if (counts != NULL) { 167 ++counts->joints[j]; 170 inc_mv_component(mv->row, &counts->comps[0], 1, 1); 174 inc_mv_component(mv->col, &counts->comps[1], 1, 1); 184 const nmv_context_counts *counts = &cm->counts.mv; local 186 vpx_tree_merge_probs(vp9_mv_joint_tree, pre_fc->joints, counts->joints, 192 const nmv_component_counts *c = &counts->comps[i];
|
H A D | vp9_entropy.c | 776 vp9_coeff_count_model *counts = cm->counts.coef[tx_size]; local 778 cm->counts.eob_branch[tx_size]; 785 const int n0 = counts[i][j][k][l][ZERO_TOKEN]; 786 const int n1 = counts[i][j][k][l][ONE_TOKEN]; 787 const int n2 = counts[i][j][k][l][TWO_TOKEN]; 788 const int neob = counts[i][j][k][l][EOB_MODEL_TOKEN];
|
H A D | vp9_entropymode.c | 341 const FRAME_COUNTS *counts = &cm->counts; local 345 counts->intra_inter[i]); 348 counts->comp_inter[i]); 351 counts->comp_ref[i]); 355 pre_fc->single_ref_prob[i][j], counts->single_ref[i][j]); 359 counts->inter_mode[i], fc->inter_mode_probs[i]); 363 counts->y_mode[i], fc->y_mode_prob[i]); 367 counts->uv_mode[i], fc->uv_mode_prob[i]); 371 counts [all...] |
H A D | vp9_thread_common.c | 319 // Accumulate frame counts. 320 void vp9_accumulate_frame_counts(VP9_COMMON *cm, FRAME_COUNTS *counts, argument 326 cm->counts.y_mode[i][j] += counts->y_mode[i][j]; 330 cm->counts.uv_mode[i][j] += counts->uv_mode[i][j]; 334 cm->counts.partition[i][j] += counts->partition[i][j]; 343 cm->counts.eob_branch[i][j][k][l][m] += 344 counts [all...] |
/external/libvpx/libvpx/vp9/decoder/ |
H A D | vp9_decoder.h | 42 FRAME_COUNTS counts; member in struct:TileWorkerData
|
/external/deqp/modules/gles3/stress/ |
H A D | es3sVertexArrayTests.cpp | 76 int counts[] = {1, 256}; local 82 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) 88 const std::string name = "stride" + typeToString(stride) + "_" + Array::inputTypeToString(inputTypes[inputTypeNdx]) + "_quads" + typeToString(counts[countNdx]); 103 spec.drawCount = counts[countNdx]; 174 int counts[] = {1, 256}; local 181 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNdx++) 190 std::string name = Array::storageToString(storages[storageNdx]) + "_stride" + typeToString(stride) + "_components" + typeToString(componentCount) + "_quads" + typeToString(counts[countNdx]); 208 spec.drawCount = counts[countNdx]; 278 int counts[] = {5, 256}; local 285 for (int countNdx = 0; countNdx < DE_LENGTH_OF_ARRAY(counts); countNd 382 int counts[] = {1, 256}; local [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ImmutableMultiset.java | 418 final int[] counts; field in class:ImmutableMultiset.SerializedForm 423 counts = new int[distinct]; 427 counts[i] = entry.getCount(); 436 multiset.add(elements[i], counts[i]);
|
/external/jdiff/src/jdiff/ |
H A D | DiffMyers.java | 523 @return the array of equivalence class counts. 562 @param counts The count of each equivalence number for the other file. 567 private byte[] discardable(final int[] counts) { argument 584 nmatch = counts[equivs[i]];
|
/external/libvpx/libvpx/ |
H A D | rate_hist.c | 250 void show_q_histogram(const int counts[64], int max_buckets) { argument 258 if (counts[i]) { 260 bucket[buckets].count = counts[i]; 262 total += counts[i];
|