| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/ |
| D | EqualsVisitor.java | 110 public static boolean equals(final Node n1, final Node n2) { in equals() argument
111 return SINGLETON.nodeEquals(n1, n2); in equals()
122 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality() argument
123 if (!nodeEquals(n1.getComment(), n2.getComment())) { in commonNodeEquality()
126 return nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()); in commonNodeEquality()
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals() argument
147 if (n1 == n2) { in nodeEquals()
150 if (n1 == null || n2 == null) { in nodeEquals()
153 if (n1.getClass() != n2.getClass()) { in nodeEquals()
156 if (!commonNodeEquality(n1, n2)){ in nodeEquals()
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/ |
| D | EqualsVisitor.java | 82 public static boolean equals(final Node n1, final Node n2) { in equals() argument
83 return SINGLETON.nodeEquals(n1, n2); in equals()
94 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality() argument
95 if (!nodeEquals(n1.getComment(), n2.getComment())) { in commonNodeEquality()
98 if (!nodesEquals(n1.getOrphanComments(), n2.getOrphanComments())){ in commonNodeEquality()
124 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals() argument
125 if (n1 == n2) { in nodeEquals()
128 if (n1 == null) { in nodeEquals()
136 if (n1.getClass() != n2.getClass()) { in nodeEquals()
139 if (!commonNodeEquality(n1, n2)){ in nodeEquals()
[all …]
|
| /external/fft2d/src/fft2d/fft2d/ |
| D | fftsg2d.c | 397 void cdft2d(int n1, int n2, int isgn, double **a, double *t, in cdft2d() argument
402 void cdft2d_sub(int n1, int n2, int isgn, double **a, double *t, in cdft2d()
405 void xdft2d0_subth(int n1, int n2, int icr, int isgn, double **a, in cdft2d()
407 void cdft2d_subth(int n1, int n2, int isgn, double **a, double *t, in cdft2d()
412 n = n1 << 1; in cdft2d()
426 nt = 8 * nthread * n1; in cdft2d()
436 if ((double) n1 * n2 >= (double) FFT2D_THREADS_BEGIN_N) { in cdft2d()
437 xdft2d0_subth(n1, n2, 0, isgn, a, ip, w); in cdft2d()
438 cdft2d_subth(n1, n2, isgn, a, t, ip, w); in cdft2d()
442 for (i = 0; i < n1; i++) { in cdft2d()
[all …]
|
| D | fftsg3d.c | 493 void cdft3d(int n1, int n2, int n3, int isgn, double ***a, in cdft3d() argument
497 void xdft3da_sub(int n1, int n2, int n3, int icr, int isgn, in cdft3d()
499 void cdft3db_sub(int n1, int n2, int n3, int isgn, double ***a, in cdft3d()
502 void xdft3da_subth(int n1, int n2, int n3, int icr, int isgn, in cdft3d()
504 void cdft3db_subth(int n1, int n2, int n3, int isgn, double ***a, in cdft3d()
509 n = n1; in cdft3d()
523 nt = n1; in cdft3d()
540 if ((double) n1 * n2 * n3 >= (double) FFT3D_THREADS_BEGIN_N) { in cdft3d()
541 xdft3da_subth(n1, n2, n3, 0, isgn, a, t, ip, w); in cdft3d()
542 cdft3db_subth(n1, n2, n3, isgn, a, t, ip, w); in cdft3d()
[all …]
|
| D | alloc.c | 13 int *alloc_1d_int(int n1) in alloc_1d_int() argument
17 i = (int *) malloc(sizeof(int) * n1); in alloc_1d_int()
29 double *alloc_1d_double(int n1) in alloc_1d_double() argument
33 d = (double *) malloc(sizeof(double) * n1); in alloc_1d_double()
45 int **alloc_2d_int(int n1, int n2) in alloc_2d_int() argument
50 ii = (int **) malloc(sizeof(int *) * n1); in alloc_2d_int()
52 i = (int *) malloc(sizeof(int) * n1 * n2); in alloc_2d_int()
55 for (j = 1; j < n1; j++) { in alloc_2d_int()
69 double **alloc_2d_double(int n1, int n2) in alloc_2d_double() argument
74 dd = (double **) malloc(sizeof(double *) * n1); in alloc_2d_double()
[all …]
|
| D | fftsg2d.f | 312 subroutine cdft2d(n1max, n1, n2, isgn, a, t, ip, w) argument
313 integer n1max, n1, n2, isgn, ip(0 : *), n, j local
316 n = max(n1, 2 * n2)
321 call cdft(n1, isgn, a(0, j), ip, w)
323 call cdft2d_sub(n1max, n1, n2, isgn, a, t, ip, w)
326 subroutine rdft2d(n1max, n1, n2, isgn, a, t, ip, w) argument
327 integer n1max, n1, n2, isgn, ip(0 : *), n, nw, nc, j local
330 n = max(n1, 2 * n2)
337 if (n1 .gt. 4 * nc) then
338 nc = n1 / 4
[all …]
|
| /external/fft2d/src/fft2d/fft2d/sample2d/ |
| D | fft4f2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
24 scanf("%d", &n1); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 t = alloc_2d_double(n1, n2); in main()
30 n = MAX(n1, n2 / 2); in main()
32 n = MAX(n1 / 2, n2 / 4) + MAX(n1, n2); in main()
37 putdata2d(n1, n2, a); in main()
38 cdft2d(n1, n2, 1, a, ip, w); in main()
[all …]
|
| D | fftsg2dt.c | 18 void putdata2d(int n1, int n2, double **a); in main()
19 double errorcheck2d(int n1, int n2, double scale, double **a); in main()
20 int *ip, n1, n2, n, i; in main() local
24 scanf("%d", &n1); in main()
28 a = alloc_2d_double(n1, n2); in main()
29 n = MAX(n1, n2 / 2); in main()
31 n = MAX(n1, n2) * 3 / 2; in main()
36 putdata2d(n1, n2, a); in main()
37 cdft2d(n1, n2, 1, a, NULL, ip, w); in main()
38 cdft2d(n1, n2, -1, a, NULL, ip, w); in main()
[all …]
|
| D | fftsg2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
12 read (*, *) n1
18 call putdata2d(nmax, n1, n2, a)
19 call cdft2d(nmax, n1, n2, 1, a, t, ip, w)
20 call cdft2d(nmax, n1, n2, -1, a, t, ip, w)
21 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
25 call putdata2d(nmax, n1, n2, a)
26 call rdft2d(nmax, n1, n2, 1, a, t, ip, w)
27 call rdft2d(nmax, n1, n2, -1, a, t, ip, w)
28 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
[all …]
|
| D | fft4f2dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
13 read (*, *) n1
19 call putdata2d(nmax, n1, n2, a)
20 call cdft2d(nmax, n1, n2, 1, a, ip, w)
21 call cdft2d(nmax, n1, n2, -1, a, ip, w)
22 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
26 call putdata2d(nmax, n1, n2, a)
27 call rdft2d(nmax, n1, n2, 1, a, ip, w)
28 call rdft2d(nmax, n1, n2, -1, a, ip, w)
29 err = errorcheck2d(nmax, n1, n2, 2.0d0 / n1 / n2, a)
[all …]
|
| D | fftsg3dt.f | 7 integer ip(0 : nmaxsqrt + 1), n1, n2, n3, i, j variable
13 read (*, *) n1
21 call putdata3d(nmax, nmax, n1, n2, n3, a)
22 call cdft3d(nmax, nmax, n1, n2, n3, 1, a, t, ip, w)
23 call cdft3d(nmax, nmax, n1, n2, n3, -1, a, t, ip, w)
24 err = errorcheck3d(nmax, nmax, n1, n2, n3,
25 & 2.0d0 / n1 / n2 / n3, a)
29 call putdata3d(nmax, nmax, n1, n2, n3, a)
30 call rdft3d(nmax, nmax, n1, n2, n3, 1, a, t, ip, w)
31 call rdft3d(nmax, nmax, n1, n2, n3, -1, a, t, ip, w)
[all …]
|
| D | fftsg3dt.c | 18 void putdata3d(int n1, int n2, int n3, double ***a); in main()
19 double errorcheck3d(int n1, int n2, int n3, double scale, double ***a); in main()
20 int *ip, n1, n2, n3, n, nt, i, j; in main() local
24 scanf("%d", &n1); in main()
30 a = alloc_3d_double(n1, n2, n3); in main()
31 nt = MAX(n1, n2); in main()
39 putdata3d(n1, n2, n3, a); in main()
40 cdft3d(n1, n2, n3, 1, a, NULL, ip, w); in main()
41 cdft3d(n1, n2, n3, -1, a, NULL, ip, w); in main()
42 err = errorcheck3d(n1, n2, n3, 2.0 / n1 / n2 / n3, a); in main()
[all …]
|
| /external/python/cpython3/Lib/lib2to3/tests/ |
| D | test_pytree.py | 76 n1 = pytree.Node(1000, [l1, l2])
77 self.assertEqual(n1.type, 1000)
78 self.assertEqual(n1.children, [l1, l2])
83 n1 = pytree.Node(1000, [l1, l2])
84 self.assertEqual(repr(n1),
90 n1 = pytree.Node(1000, [l1, l2])
91 self.assertEqual(str(n1), "foo bar")
96 n1 = pytree.Node(1000, [l1])
97 self.assertEqual(n1.prefix, "")
98 n1.prefix = " "
[all …]
|
| /external/python/cpython2/Lib/lib2to3/tests/ |
| D | 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/strace/tests-m32/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/strace/tests-mx32/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/strace/tests/ |
| D | rt_sigaction.awk | 31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
33 n1[1][3] = "SA_RESTORER\\|SA_RESTART"
35 n1[1][4] = ", sa_restorer=0x[0-9a-f]+"
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
40 n1[2][3] = "SA_RESTORER\\|SA_SIGINFO"
42 n1[2][4] = ", sa_restorer=0x[0-9a-f]+"
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/expected_output/ |
| D | com_github_javaparser_ast_visitor_EqualsVisitor.txt | 1 …Line 111) SINGLETON.nodeEquals(n1, n2) ==> com.github.javaparser.ast.visitor.EqualsVisitor.nodeEqu…
2 …Line 123) nodeEquals(n1.getComment(), n2.getComment()) ==> com.github.javaparser.ast.visitor.Equal…
3 Line 123) n1.getComment() ==> com.github.javaparser.ast.Node.getComment()
5 …Line 126) nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()) ==> com.github.javaparser.as…
6 Line 126) n1.getOrphanComments() ==> com.github.javaparser.ast.Node.getOrphanComments()
14 Line 153) n1.getClass() ==> java.lang.Object.getClass()
16 …Line 156) commonNodeEquality(n1, n2) ==> com.github.javaparser.ast.visitor.EqualsVisitor.commonNod…
17 …Line 159) n1.accept(this, n2) ==> com.github.javaparser.ast.Node.accept(com.github.javaparser.ast.…
18 Line 169) n1.equals(n2) ==> java.lang.Object.equals(java.lang.Object)
19 …Line 175) nodeEquals(n1.getPackage(), n2.getPackage()) ==> com.github.javaparser.ast.visitor.Equal…
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 72 for (std::size_t n1 = 0; n1 <= max_n; n1 = n1 <= 16 ? n1 + 1 : std::size_t(3.1415 * n1)) in test() local
75 n2 = n1; in test()
76 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() … in test()
78 n2 = n1; in test()
80 std::size_t ind = n1 / 2; in test()
82 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() … in test()
86 ind = n1 / 5; in test()
88 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.cbegin(), in2.cbegin(… in test()
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string() local
103 in1 += n1; in test_string()
[all …]
|
| /external/rust/crates/memchr/src/ |
| D | lib.rs | 136 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
137 naive::memchr(n1, haystack) in memchr()
142 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
143 x86::memchr(n1, haystack) in memchr()
152 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
153 c::memchr(n1, haystack) in memchr()
162 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
163 fallback::memchr(n1, haystack) in memchr()
199 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
200 naive::memchr2(n1, n2, haystack) in memchr2()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| D | array3d_test.cc | 28 EXPECT_EQ(uninit.n1(), 2); in TEST()
37 EXPECT_EQ(fullof7.n1(), 2); in TEST()
41 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
44 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
55 EXPECT_EQ(arr.n1(), 3); in TEST()
78 EXPECT_EQ(arr.n1(), 3); in TEST()
97 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
100 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
106 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
109 EXPECT_EQ(fullof7(n1, n2, n3), 11); in TEST()
|
| /external/igt-gpu-tools/lib/ |
| D | igt_core.h | 577 #define igt_assert_cmpint(n1, cmp, ncmp, n2) \ argument
579 int __n1 = (n1), __n2 = (n2); \
582 #n1 " " #cmp " " #n2, \
595 #define igt_assert_cmpuint(n1, cmp, ncmp, n2) \ argument
597 uint32_t __n1 = (n1), __n2 = (n2); \
600 #n1 " " #cmp " " #n2, \
613 #define igt_assert_cmps64(n1, cmp, ncmp, n2) \ argument
615 int64_t __n1 = (n1), __n2 = (n2); \
618 #n1 " " #cmp " " #n2, \
631 #define igt_assert_cmpu64(n1, cmp, ncmp, n2) \ argument
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
| D | partial_sort_copy.pass.cpp | 62 …r()(pstl::execution::unsequenced_policy, InputIterator first, InputIterator last, Size n1, Size n2, in operator ()()
69 …:execution::parallel_unsequenced_policy, InputIterator first, InputIterator last, Size n1, Size n2, in operator ()()
76 …r()(pstl::execution::unsequenced_policy, InputIterator first, InputIterator last, Size n1, Size n2, in operator ()()
83 …:execution::parallel_unsequenced_policy, InputIterator first, InputIterator last, Size n1, Size n2, in operator ()()
91 …operator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& tras… in operator ()()
94 prepare_data(first, last, n1, trash); in operator ()()
104 …operator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& tras… in operator ()()
106 prepare_data(first, last, n1, trash); in operator ()()
117 prepare_data(InputIterator first, InputIterator last, Size n1, const T& trash) in prepare_data()
121 std::generate(first, last, [n1]() { return T(rand() % (2 * n1 + 1)); }); in prepare_data()
[all …]
|
| /external/llvm-project/libcxx/test/std/localization/locales/locale/locale.operators/ |
| D | eq.pass.cpp | 25 std::locale n1(LOCALE_en_US_UTF_8); in main() local
27 std::locale noname1 = n1.combine<std::ctype<char> >(cloc); in main()
29 std::locale noname2 = n1.combine<std::ctype<char> >(cloc); in main()
33 assert(cloc != n1); in main()
41 assert(copy != n1); in main()
47 assert(n1 != cloc); in main()
48 assert(n1 != copy); in main()
49 assert(n1 == n1); in main()
50 assert(n1 == n2); in main()
51 assert(n1 != noname1); in main()
[all …]
|
| /external/libcxx/test/std/localization/locales/locale/locale.operators/ |
| D | eq.pass.cpp | 25 std::locale n1(LOCALE_en_US_UTF_8); in main() local
27 std::locale noname1 = n1.combine<std::ctype<char> >(cloc); in main()
29 std::locale noname2 = n1.combine<std::ctype<char> >(cloc); in main()
33 assert(cloc != n1); in main()
41 assert(copy != n1); in main()
47 assert(n1 != cloc); in main()
48 assert(n1 != copy); in main()
49 assert(n1 == n1); in main()
50 assert(n1 == n2); in main()
51 assert(n1 != noname1); in main()
[all …]
|