| /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/strace/tests/ |
| sigaction.awk | 29 n1[1] = "SIG_IGN, \\[HUP INT\\], SA_RESTORER\\|SA_RESTART, 0x[0-9a-f]+"
32 n1[2] = "0x[0-9a-f]+, \\[QUIT TERM\\], SA_RESTORER\\|SA_SIGINFO, 0x[0-9a-f]+"
35 n1[3] = "SIG_DFL, \\[\\], SA_RESTORER, 0x[0-9a-f]+"
38 n1[4] = "SIG_DFL, ~\\[HUP( ((RT|SIGRT)[^] ]+|[3-9][0-9]|1[0-9][0-9]))*\\], SA_RESTORER, 0x[0-9a-f]+"
44 o1[i] = n1[i - 1]
54 "\\{" n1[i] "\\}, \\{" o1[i] "\\}, " a1 "|" \
|
| /external/v8/test/cctest/compiler/ |
| test-node.cc | 147 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
151 CHECK_USES(n0, n1, n2);
153 CHECK_INPUTS(n1, n0);
159 CHECK_USES(n1, NONE);
161 CHECK_USES(n3, n1, n2);
163 CHECK_INPUTS(n1, n3);
172 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
174 CHECK_USES(n0, n1);
175 CHECK_USES(n1, NONE);
177 n1->ReplaceInput(0, n1); // Create self-reference
196 Node* n1 = graph.NewNode(&dummy_operator0); local
224 Node* n1 = graph.NewNode(&dummy_operator0); local
242 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
273 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
295 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
323 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
353 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
375 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
402 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
425 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
453 Node* n1 = graph.NewNode(&dummy_operator0); local
472 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
480 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
488 Node* n1 = graph.NewNode(&dummy_operator0); local
498 Node* n1 = graph.NewNode(&dummy_operator0); local
508 Node* n1 = graph.NewNode(&dummy_operator0); local
540 Node* n1 = graph.NewNode(&dummy_operator0); local
552 Node* n1 = graph.NewNode(&dummy_operator0); local
562 Node* n1 = graph.NewNode(&dummy_operator0); local
576 Node* n1 = graph.NewNode(&dummy_operator0); local
590 Node* n1 = graph.NewNode(&dummy_operator0); local
634 Node* n1 = graph.NewNode(&dummy_operator0); local
647 Node* n1 = graph.NewNode(&dummy_operator0); local
660 Node* n1 = graph.NewNode(&dummy_operator0); local
703 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
732 Node* n1 = graph.NewNode(&dummy_operator1, n0); local
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| dls.h | 163 int n1 = nn - 1; local
185 while (n1 >= low) {
188 int l = n1;
203 if (l == n1) {
204 H[n1][n1] = H[n1][n1] + exshift;
205 d[n1] = H[n1][n1]
[all...] |
| /external/libcxx/test/std/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)
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/ |
| DspFftServer.java | 53 int ii, jj, kk, n1, n2, aa; local
60 n1 = n2;
61 while (jj >= n1) {
62 jj = jj - n1;
63 n1 = n1 / 2;
65 jj = jj + n1;
78 n1 = 0;
81 n1 = n2;
85 for (jj = 0; jj < n1; jj++)
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-unittest.cc | 49 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
51 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1));
52 EXPECT_EQ(0, n1->UseCount());
53 EXPECT_EQ(1, n1->InputCount());
54 EXPECT_EQ(n0, n1->InputAt(0));
55 Node* n0_n1[] = {n0, n1};
58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2));
59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2));
62 EXPECT_EQ(n1, n2->InputAt(1));
74 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false) local
81 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
96 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
103 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
113 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
137 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
153 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
159 node->AppendInput(zone(), n1); local
165 node->AppendInput(zone(), n1); local
172 Node* n1 = Node::New(zone(), 1, &kOp0, 0, nullptr, false); local
192 node->AppendInput(zone(), n1); local
242 Node* n1 = Node::New(zone(), 1, &kOp1, 1, &n0, false); local
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-09-18-UnionProblem.c | 13 short __udivmodhi4 (char n1, char bm) {
18 rr.s.high = n1;
|
| /external/testng/src/test/java/test/tmp/ |
| Test_TestListenerAppender.java | 15 public void verifyData1(String n1, Integer n2) {
16 System.out.println(n1 + " " + n2);
|
| /external/opencv3/modules/photo/src/ |
| arrays.hpp | 54 int n1,n2; member in struct:cv::Array2d
58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false)
67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false)
72 n1(_n1), n2(_n2), needToDeallocArray(true)
74 a = new T[n1*n2];
98 int n1,n2,n3; member in struct:cv::Array3d
102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false)
107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true)
109 a = new T[n1*n2*n3]
134 int n1,n2,n3,n4; member in struct:cv::Array4d
[all...] |
| /external/opencv3/modules/core/src/ |
| lda.cpp | 325 int n1 = nn - 1; local
347 while (n1 >= low) {
350 int l = n1;
365 if (l == n1) {
366 H[n1][n1] = H[n1][n1] + exshift;
367 d[n1] = H[n1][n1]
[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 | 40 long n1 = System.nanoTime(); local
46 long nanos = n2 - n1;
58 long n1 = System.nanoTime(); local
66 long nanos = n2 - n1;
|
| /external/selinux/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
229 ebitmap_node_t *n1 = e1->node; local
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/util/ |
| color_histogram.py | 27 n1 = sum_func(hist1)
29 if (n1 == 0 or n2 == 0) and default_color is None:
31 if n1 == 0:
33 n1 = 1
39 remainder = np.multiply(hist1, n2) - np.multiply(hist2, n1)
46 remainder += value1 * n2 - value2 * n1
51 return abs(float(total) / n1 / n2)
|
| /external/libcxx/test/std/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/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());
|
