| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.guard/ |
| variadic_mutex.fail.cpp | 30 M n0, n1, n2; local
46 test_conversion<LG>({n0, n1, n2}); // expected-error{{no matching function for call}}
|
| /external/v8/src/compiler/ |
| graph.h | 70 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
71 Node* nodes[] = {n1, n2};
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
75 Node* nodes[] = {n1, n2, n3};
78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
79 Node* nodes[] = {n1, n2, n3, n4};
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
84 Node* nodes[] = {n1, n2, n3, n4, n5};
87 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
89 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
[all...] |
| /art/test/963-default-range-smali/src/ |
| Iface.java | 18 String n2,
|
| /external/clang/test/Sema/ |
| attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/v8/testing/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| ASCIICaseInsensitiveComparator.java | 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
|
| /prebuilts/ndk/r11/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /prebuilts/ndk/r13/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /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;
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/src/syscall/ |
| syscall_bsd_test.go | 27 n2, err := syscall.Getfsstat(data, flags)
28 t.Logf("Getfsstat([]syscall.Statfs_t, %d) = (%v, %v)", flags, n2, err)
32 if n != n2 {
33 t.Errorf("Getfsstat(nil) = %d, but subsequent Getfsstat(slice) = %d", n, n2)
41 for i, stat := range data[:n2] {
|
| /prebuilts/go/linux-x86/src/syscall/ |
| syscall_bsd_test.go | 27 n2, err := syscall.Getfsstat(data, flags)
28 t.Logf("Getfsstat([]syscall.Statfs_t, %d) = (%v, %v)", flags, n2, err)
32 if n != n2 {
33 t.Errorf("Getfsstat(nil) = %d, but subsequent Getfsstat(slice) = %d", n, n2)
41 for i, stat := range data[:n2] {
|
| /external/libmojo/mojo/public/cpp/bindings/tests/ |
| equals_unittest.cc | 67 NamedRegionPtr n2(n1.Clone());
68 EXPECT_TRUE(n1.Equals(n2));
70 n2->rects = base::nullopt;
71 EXPECT_FALSE(n1.Equals(n2));
72 n2->rects.emplace();
73 EXPECT_FALSE(n1.Equals(n2));
75 n2->rects->push_back(CreateRect());
76 n2->rects->push_back(CreateRect());
77 EXPECT_FALSE(n1.Equals(n2));
79 n2->rects->resize(1)
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| s_expl.c | 205 int k, n, n2; local
268 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */
276 n2 = (unsigned)n % INTERVALS;
289 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2).
295 t = tbl[n2].lo + tbl[n2].hi;
298 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q +
299 tbl[n2].hi * r1)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
| TTestImpl.java | 228 * <code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
231 * <strong><code> n2</code></strong> is the size of second sample;
237 * <code>var = sqrt(((n1 - 1)var1 + (n2 - 1)var2) / ((n1-1) + (n2-1)))</code>
270 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
273 * <strong><code> n2</code></strong> is the size of the second sample;
309 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
312 * <strong><code> n2</code></strong> is the size of the second sample;
350 * <code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
353 * <strong><code> n2</code></strong> is the size of second sample
[all...] |
| /external/dtc/tests/ |
| references.c | 79 int n1, n2, n3, n4, n5; local
88 n2 = fdt_path_offset(fdt, "/node2");
89 if (n2 < 0)
90 FAIL("fdt_path_offset(/node2): %s", fdt_strerror(n2));
102 h2 = fdt_get_phandle(fdt, n2);
121 check_ref(fdt, n2, h1);
|
| /external/testng/src/main/java/org/testng/ |
| SuiteResult.java | 54 String n2 = other.getTestContext().getName(); local
55 result = n1.compareTo(n2);
|
| /external/icu/icu4c/source/samples/uciter8/ |
| uciter8.c | 50 UCharIterator *iter2, const char *n2) {
58 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
73 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
81 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
90 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));
100 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));
118 log_err("%s->move(start) failed\n", n2);
122 log_err("%s->hasNext() at the start returns FALSE\n", n2);
130 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
140 log_err("%s->hasNext() at the end returns TRUE\n", n2);
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 35 for (int n2 = 0; n2 < l; ++n2, ++i)
36 assert(*i == t2[n2]);
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_flist.pass.cpp | 34 for (int n2 = 0; n2 < l; ++n2, ++i)
35 assert(*i == t2[n2]);
|
