/external/stlport/test/unit/ |
lexcmp_test.cpp | 34 char n1[size] = "shoe"; local 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); 43 char n1[size] = "shoe"; local 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
mismatch_test.cpp | 40 int n1[5] = { 1, 2, 3, 4, 5 }; local 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); 47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3); 48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5))); 49 CPPUNIT_ASSERT((result.first - n1)==3); 70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 73 copy(n1, n1 + 5, (char const**)n2) [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
lexcmp_test.cpp | 34 char n1[size] = "shoe"; local 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); 43 char n1[size] = "shoe"; local 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
mismatch_test.cpp | 40 int n1[5] = { 1, 2, 3, 4, 5 }; local 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); 47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3); 48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5))); 49 CPPUNIT_ASSERT((result.first - n1)==3); 70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 73 copy(n1, n1 + 5, (char const**)n2) [all...] |
/ndk/tests/device/test-stlport/unit/ |
lexcmp_test.cpp | 34 char n1[size] = "shoe"; local 37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size); 43 char n1[size] = "shoe"; local 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
mismatch_test.cpp | 40 int n1[5] = { 1, 2, 3, 4, 5 }; local 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2); 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5)); 47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3); 48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5))); 49 CPPUNIT_ASSERT((result.first - n1)==3); 70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local 73 copy(n1, n1 + 5, (char const**)n2) [all...] |
/external/flac/include/share/ |
alloc.h | 29 // malloc(n1 * n2) then memset to zero 30 static inline void *safe_calloc_(size_t n1, size_t n2) 33 return calloc(n1, n2); 36 // malloc(n1 + n2) 37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) 39 unsigned long long n = n1 + n2; 45 // malloc(n1 * n2) 46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) 48 unsigned long long n = n1 * n2; 54 // malloc(n1 * (n2 + n3) [all...] |
/external/libcxx/test/localization/locales/locale/locale.operators/ |
eq.pass.cpp | 23 std::locale n1(LOCALE_en_US_UTF_8); 25 std::locale noname1 = n1.combine<std::ctype<char> >(cloc); 27 std::locale noname2 = n1.combine<std::ctype<char> >(cloc); 31 assert(cloc != n1); 39 assert(copy != n1); 45 assert(n1 != cloc); 46 assert(n1 != copy); 47 assert(n1 == n1); 48 assert(n1 == n2) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locales/locale/locale.operators/ |
eq.pass.cpp | 23 std::locale n1(LOCALE_en_US_UTF_8); 25 std::locale noname1 = n1.combine<std::ctype<char> >(cloc); 27 std::locale noname2 = n1.combine<std::ctype<char> >(cloc); 31 assert(cloc != n1); 39 assert(copy != n1); 45 assert(n1 != cloc); 46 assert(n1 != copy); 47 assert(n1 == n1); 48 assert(n1 == n2) [all...] |
/external/libutf/ |
utfutf.c | 29 long f, n1, n2; local 32 n1 = chartorune(&r, s2); 38 for(p=s1; (p=utfrune(p, f)) != 0; p+=n1)
|
/external/chromium_org/v8/test/cctest/compiler/ |
test-node.cc | 22 Node* n1 = graph.NewNode(&dummy_operator); local 24 CHECK(n2->id() != n1->id()); 30 Node* n1 = graph.NewNode(&dummy_operator); local 32 CHECK(n1->op() == &dummy_operator); 49 Node* n1 = graph.NewNode(&dummy_operator); local 50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); 53 CHECK(n1 == n2->InputAt(1)); 60 Node* n1 = graph.NewNode(&dummy_operator); local 61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); 71 Node* n1 = graph.NewNode(&dummy_operator); local 84 Node* n1 = graph.NewNode(&dummy_operator, n0); local 95 Node* n1 = graph.NewNode(&dummy_operator); local 110 Node* n1 = graph.NewNode(&dummy_operator, n0); local 121 Node* n1 = graph.NewNode(&dummy_operator); local 135 Node* n1 = graph.NewNode(&dummy_operator, n0); local 161 Node* n1 = graph.NewNode(&dummy_operator, n0); local 183 Node* n1 = graph.NewNode(&dummy_operator); local 236 Node* n1 = graph.NewNode(&dummy_operator); local 254 Node* n1 = graph.NewNode(&dummy_operator, n0); local 284 Node* n1 = graph.NewNode(&dummy_operator, n0); local 302 Node* n1 = graph.NewNode(&dummy_operator, n0); local 345 Node* n1 = graph.NewNode(&dummy_operator, n0); local 366 Node* n1 = graph.NewNode(&dummy_operator, n0); local 403 Node* n1 = graph.NewNode(&dummy_operator, n0); local 421 Node* n1 = graph.NewNode(&dummy_operator, n0); local 444 Node* n1 = graph.NewNode(&dummy_operator, n0); local 480 Node* n1 = graph.NewNode(&dummy_operator, n0); local 485 n2->ReplaceUsesIf(FixedPredicate<true>(), n1); local 487 n2->ReplaceUsesIf(FixedPredicate<false>(), n1); local 491 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local 493 n3->ReplaceUsesIf(FixedPredicate<false>(), n1); local 498 n0->ReplaceUsesIf(FixedPredicate<false>(), n1); local 501 n0->ReplaceUsesIf(FixedPredicate<true>(), n1); local 509 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local 522 Node* n1 = graph.NewNode(&dummy_operator, n0); local 544 Node* n1 = graph.NewNode(&dummy_operator); local 562 Node* n1 = graph.NewNode(&dummy_operator, n0); local 571 Node* n1 = graph.NewNode(&dummy_operator, n0); local 579 Node* n1 = graph.NewNode(&dummy_operator); local 590 Node* n1 = graph.NewNode(&dummy_operator); local 601 Node* n1 = graph.NewNode(&dummy_operator); local 635 Node* n1 = graph.NewNode(&dummy_operator); local 645 Node* n1 = graph.NewNode(&dummy_operator); local 655 Node* n1 = graph.NewNode(&dummy_operator); local 671 Node* n1 = graph.NewNode(&dummy_operator); local 686 Node* n1 = graph.NewNode(&dummy_operator); local 731 Node* n1 = graph.NewNode(&dummy_operator); local 746 Node* n1 = graph.NewNode(&dummy_operator); local 760 Node* n1 = graph.NewNode(&dummy_operator); local 802 Node* n1 = graph.NewNode(&dummy_operator, n0); local 831 Node* n1 = graph.NewNode(&dummy_operator, n0); local [all...] |
/external/clang/test/CodeGen/ |
2002-09-18-UnionProblem.c | 13 short __udivmodhi4 (char n1, char bm) { 18 rr.s.high = n1;
|
/external/chromium_org/tools/auto_bisect/ |
ttest.py | 49 n1 = len(sample1) 51 t = _TValue(mean1, mean2, v1, v2, n1, n2) 52 df = _DegreesOfFreedom(v1, v2, n1, n2) 57 def _TValue(mean1, mean2, v1, v2, n1, n2): 68 n1: Sample size of sample 1. 77 return (mean1 - mean2) / (math.sqrt(v1 / n1 + v2 / n2)) 80 def _DegreesOfFreedom(v1, v2, n1, n2): 89 n1: Size of sample 2. 99 if n1 <= 1 or n2 <= 2: 101 df = (((v1 / n1 + v2 / n2) ** 2) [all...] |
/external/chromium_org/v8/src/compiler/ |
graph.h | 34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } 35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 36 Node* nodes[] = {n1, n2}; 39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 40 Node* nodes[] = {n1, n2, n3}; 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 44 Node* nodes[] = {n1, n2, n3, n4}; 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 49 Node* nodes[] = {n1, n2, n3, n4, n5} [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 98 n1 = pytree.Node(1000, [l1, l2]) 99 self.assertEqual(n1.type, 1000) 100 self.assertEqual(n1.children, [l1, l2]) 105 n1 = pytree.Node(1000, [l1, l2]) 106 self.assertEqual(repr(n1), 112 n1 = pytree.Node(1000, [l1, l2]) 113 self.assertEqual(str(n1), "foo bar") 118 n1 = pytree.Node(1000, [l1]) 119 self.assertEqual(n1.prefix, "") 120 n1.prefix = " [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
test_pytree.py | 98 n1 = pytree.Node(1000, [l1, l2]) 99 self.assertEqual(n1.type, 1000) 100 self.assertEqual(n1.children, [l1, l2]) 105 n1 = pytree.Node(1000, [l1, l2]) 106 self.assertEqual(repr(n1), 112 n1 = pytree.Node(1000, [l1, l2]) 113 self.assertEqual(str(n1), "foo bar") 118 n1 = pytree.Node(1000, [l1]) 119 self.assertEqual(n1.prefix, "") 120 n1.prefix = " [all...] |
/external/clang/test/SemaCXX/ |
pr18284-crash-on-invalid.cpp | 4 namespace n1 { namespace 13 } // namespace n1
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
SystemTest.java | 30 long n1 = System.nanoTime(); local 36 long nanos = n2 - n1; 48 long n1 = System.nanoTime(); local 56 long nanos = n2 - n1;
|
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
splice_after_flist.pass.cpp | 31 int n1 = 0; local 32 for (; n1 < p; ++n1, ++i) 33 assert(*i == t1[n1]); 36 for (; n1 < size_t1; ++n1, ++i) 37 assert(*i == t1[n1]);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
splice_after_flist.pass.cpp | 31 int n1 = 0; local 32 for (; n1 < p; ++n1, ++i) 33 assert(*i == t1[n1]); 36 for (; n1 < size_t1; ++n1, ++i) 37 assert(*i == t1[n1]);
|
/external/chromium_org/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/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());
|
/ndk/sources/host-tools/toolbox/ |
cmp_win.c | 70 int n1, n2, ret = 0; local 72 n1 = fread(buf1, 1, BUFSIZE, f1); 74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0; 75 } while (!ret && n1 == BUFSIZE);
|
/ndk/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/chromium_org/base/containers/ |
linked_list_unittest.cc | 75 Node n1(1); 76 list.Append(&n1); 78 EXPECT_EQ(&n1, list.head()); 79 EXPECT_EQ(&n1, list.tail()); 88 EXPECT_EQ(&n1, list.head()); 98 EXPECT_EQ(&n1, list.head()); 109 Node n1(1); 115 list.Append(&n1); 121 EXPECT_EQ(&n1, list.head()); 131 EXPECT_EQ(&n1, list.head()) [all...] |