HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 51 - 75 of 802) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
TTestImpl.java 228 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
230 * where <strong><code>n1</code></strong> is the size of first sample;
237 * <code>var = sqrt(((n1 - 1)var1 + (n2 - 1)var2) / ((n1-1) + (n2-1)))</code>
270 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
272 * where <strong><code>n1</code></strong> is the size of the first sample
309 * &nbsp;&nbsp; <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
311 * where <strong><code>n1</code></strong> is the size of the first sample;
350 * &nbsp;&nbsp;<code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
352 * where <strong><code>n1</code></strong> is the size of first sample
    [all...]
  /external/guava/guava-tests/benchmark/com/google/common/math/
BigIntegerMathBenchmark.java 68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) {
71 assert n1 <= n2; local
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
75 for (int i = n1 + 1; i <= n2; i++) {
85 int mid = (n1 + n2) >>> 1;
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/
cplx.go 121 var n1 Node
126 subnode(&n1, &n2, nl)
129 minus(&n1, &n5)
137 var n1 Node
144 subnode(&n1, &n2, nl)
150 ra.Left = &n1
152 ra.Type = n1.Type
168 var n1 Node
176 subnode(&n1, &n2, nl)
185 rm1.Left = &n1
    [all...]
cgen.go 54 var n1 Node
55 Tempname(&n1, n.Type)
56 Cgen_eface(n, &n1)
57 cgen_wb(&n1, res, wb)
77 var n1 Node
78 Tempname(&n1, n.Type)
79 Cgen(n, &n1)
80 cgen_wb(&n1, res, wb)
96 var n1 Node
97 Tempname(&n1, n.Type
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
cplx.go 118 var n1 Node
123 subnode(&n1, &n2, nl)
126 minus(&n1, &n5)
134 var n1 Node
141 subnode(&n1, &n2, nl)
147 ra.Left = &n1
149 ra.Type = n1.Type
165 var n1 Node
173 subnode(&n1, &n2, nl)
182 rm1.Left = &n1
    [all...]
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/
cplx.go 121 var n1 Node
126 subnode(&n1, &n2, nl)
129 minus(&n1, &n5)
137 var n1 Node
144 subnode(&n1, &n2, nl)
150 ra.Left = &n1
152 ra.Type = n1.Type
168 var n1 Node
176 subnode(&n1, &n2, nl)
185 rm1.Left = &n1
    [all...]
cgen.go 54 var n1 Node
55 Tempname(&n1, n.Type)
56 Cgen_eface(n, &n1)
57 cgen_wb(&n1, res, wb)
77 var n1 Node
78 Tempname(&n1, n.Type)
79 Cgen(n, &n1)
80 cgen_wb(&n1, res, wb)
96 var n1 Node
97 Tempname(&n1, n.Type
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/
cplx.go 118 var n1 Node
123 subnode(&n1, &n2, nl)
126 minus(&n1, &n5)
134 var n1 Node
141 subnode(&n1, &n2, nl)
147 ra.Left = &n1
149 ra.Type = n1.Type
165 var n1 Node
173 subnode(&n1, &n2, nl)
182 rm1.Left = &n1
    [all...]
  /prebuilts/go/darwin-x86/test/ken/
divmod.go 13 n1 = +5
31 if n1/d1 != q1 || n1%d1 != r1 {
32 println("ideal-1", n1, d1, n1/d1, n1%d1)
39 if n1/d2 != q3 || n1%d2 != r3 {
40 println("ideal-3", n1, d2, n1/d2, n1%d2
11 n1 = +5 const
    [all...]
  /prebuilts/go/linux-x86/test/ken/
divmod.go 13 n1 = +5
31 if n1/d1 != q1 || n1%d1 != r1 {
32 println("ideal-1", n1, d1, n1/d1, n1%d1)
39 if n1/d2 != q3 || n1%d2 != r3 {
40 println("ideal-3", n1, d2, n1/d2, n1%d2
11 n1 = +5 const
    [all...]
  /external/clang/test/CodeGenCXX/
nested-base-member-access.cpp 50 N n1; local
51 n1.PR();
  /external/skia/platform_tools/android/bin/
android_gdb_native 48 GDB_COMMAND=$(command ls "$ANDROID_TOOLCHAIN"/*-gdb | head -n1)
  /external/testng/src/main/java/org/testng/
SuiteResult.java 53 String n1 = getTestContext().getName(); local
55 result = n1.compareTo(n2);
  /prebuilts/go/darwin-x86/src/runtime/
string1.go 52 n1 := 0
54 n1 += runetochar(buf[:], rune(str[i]))
56 s, b := rawstring(n1 + 4)
60 if n2 >= n1 {
  /prebuilts/go/linux-x86/src/runtime/
string1.go 52 n1 := 0
54 n1 += runetochar(buf[:], rune(str[i]))
56 s, b := rawstring(n1 + 4)
60 if n2 >= n1 {
  /external/icu/icu4c/source/samples/uciter8/
uciter8.c 43 compareIterators(UCharIterator *iter1, const char *n1,
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
61 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
75 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
84 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
94 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
102 log_err("%s->move(start) failed\n", n1);
106 log_err("%s->hasNext() at the start returns FALSE\n", n1);
124 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
130 log_err("%s->hasNext() at the end returns TRUE\n", n1);
    [all...]
  /external/opencv3/modules/photo/test/
test_inpaint.cpp 94 double n1 = cvtest::norm(diff1.reshape(1), NORM_INF, inv_mask.reshape(1)); local
97 if (n1 != 0 || n2 != 0)
106 n1 = cvtest::norm(diff1.reshape(1), NORM_INF, mask.reshape(1));
110 if (n1 > jpeg_thres || n2 > jpeg_thres)
  /prebuilts/go/darwin-x86/test/bench/shootout/
fannkuch.go 52 n1 := n - 1
76 if perm1[0] != 0 && perm1[n1] != n1 {
  /prebuilts/go/linux-x86/test/bench/shootout/
fannkuch.go 52 n1 := n - 1
76 if perm1[0] != 0 && perm1[n1] != n1 {
  /system/extras/tests/binder/benchmarks/
binderAddInts.cpp 223 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
224 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
225 stream << (char) str[n1];
236 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
237 if (CPU_ISSET(n1, &set))
239 stream << n1; local
    [all...]
  /external/v8/test/unittests/compiler/
graph-reducer-unittest.cc 507 Node* n1 = graph()->NewNode(&kOpA0); local
508 Node* n2 = graph()->NewNode(&kOpA1, n1);
509 Node* n3 = graph()->NewNode(&kOpA1, n1);
513 EXPECT_CALL(r1, Reduce(n1)).InSequence(s1, s2);
522 Node* n1 = graph()->NewNode(&kOpA0); local
523 Node* end = graph()->NewNode(&kOpA1, n1);
532 EXPECT_EQ(&kOpB0, n1->op());
534 EXPECT_EQ(n1, end->InputAt(0));
540 Node* n1 = graph()->NewNode(&kOpA0); local
541 Node* n2 = graph()->NewNode(&kOpA1, n1);
565 Node* n1 = graph()->NewNode(&kOpA0); local
631 Node* n1 = nend->InputAt(0); local
640 Node* n1 = graph()->NewNode(&kOpA0); local
658 Node* n1 = graph()->NewNode(&kOpA0); local
684 Node* n1 = graph()->NewNode(&kOpA0); local
705 Node* n1 = graph()->NewNode(&kOpA0); local
734 Node* n1 = graph()->NewNode(&kOpA0); local
814 Node* n1 = end->InputAt(0); local
835 Node* n1 = graph()->NewNode(&kOpA0); local
    [all...]
  /frameworks/native/opengl/tests/hwc/
hwcStress.cpp 428 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++) {
429 unsigned int idx = testRandMod(selectedFrames[n1].size());
430 sp<GraphicBuffer> gBuf = selectedFrames[n1][idx];
431 hwc_layer_1_t *layer = &list->hwLayers[n1];
492 for (unsigned int n1 = 0; n1 < numSet; n1++) {
499 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++)
    [all...]
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/x86/
ggen.go 132 var n1 gc.Node
133 gc.Regalloc(&n1, gc.Types[gc.Tptr], nil)
135 gc.Agen(nl, &n1)
136 n1.Op = gc.OINDREG
145 n1.Type = z.Type
146 gins(x86.AMOVL, &z, &n1)
147 n1.Xoffset += 4
157 n1.Type = z.Type
158 gins(x86.AMOVB, &z, &n1)
159 n1.Xoffset+
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/x86/
ggen.go 129 var n1 gc.Node
130 gc.Regalloc(&n1, gc.Types[gc.Tptr], nil)
132 gc.Agen(nl, &n1)
133 n1.Op = gc.OINDREG
142 n1.Type = z.Type
143 gins(x86.AMOVL, &z, &n1)
144 n1.Xoffset += 4
154 n1.Type = z.Type
155 gins(x86.AMOVB, &z, &n1)
156 n1.Xoffset+
    [all...]
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/x86/
ggen.go 132 var n1 gc.Node
133 gc.Regalloc(&n1, gc.Types[gc.Tptr], nil)
135 gc.Agen(nl, &n1)
136 n1.Op = gc.OINDREG
145 n1.Type = z.Type
146 gins(x86.AMOVL, &z, &n1)
147 n1.Xoffset += 4
157 n1.Type = z.Type
158 gins(x86.AMOVB, &z, &n1)
159 n1.Xoffset+
    [all...]

Completed in 508 milliseconds

1 23 4 5 6 7 8 91011>>