| /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...] |
| /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/dropbear/libtommath/ |
| bn_mp_prime_miller_rabin.c | 27 mp_int n1, y, r; local
38 /* get n1 = a - 1 */
39 if ((err = mp_init_copy (&n1, a)) != MP_OKAY) {
42 if ((err = mp_sub_d (&n1, 1, &n1)) != MP_OKAY) {
46 /* set 2**s * r = n1 */
47 if ((err = mp_init_copy (&r, &n1)) != MP_OKAY) {
69 /* if y != 1 and y != n1 do */
70 if (mp_cmp_d (&y, 1) != MP_EQ && mp_cmp (&y, &n1) != MP_EQ) {
72 /* while j <= s-1 and y != n1 */
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-09-18-UnionProblem.c | 13 short __udivmodhi4 (char n1, char bm) {
18 rr.s.high = n1;
|
| /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/chromium/base/ |
| 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...] |
| /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...] |
| /external/clang/test/Sema/ |
| attr-section.c | 13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute is not valid on local variables}} local
|
| /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/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/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/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());
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 125 int n1; local
137 n1 = p.bitLength();
138 if (p.compareTo(BigInteger.valueOf(1)) != 1 || n1 < 512 || n1 > 1024 || (n1 & 077) != 0) {
201 int n, n1, n2; local
245 n1 = rBytes.length;
247 n1++;
255 signature = new byte[6 + n1 + n2]; // 48 is max. possible length of signature
257 signature[1] = (byte) (4 + n1 + n2); // total length of two INTEGER
323 int n1, n2; local
[all...] |
| /external/libsepol/src/ |
| ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local
24 n1 = e1->node;
27 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
35 new->startbit = n1->startbit;
36 new->map = n1->map | n2->map;
37 n1 = n1->next;
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit))
152 ebitmap_node_t *n1, *n2; local
202 ebitmap_node_t *n1, *n2; local
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
