Home
last modified time | relevance | path

Searched defs:n1 (Results 1 – 25 of 399) sorted by relevance

12345678910>>...16

/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/visitor/
DEqualsVisitor.java110 public static boolean equals(final Node n1, final Node n2) { in equals()
122 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality()
146 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals()
162 private boolean objEquals(final Object n1, final Object n2) { in objEquals()
172 @Override public Boolean visit(final CompilationUnit n1, final Node arg) { in visit()
194 @Override public Boolean visit(final PackageDeclaration n1, final Node arg) { in visit()
208 @Override public Boolean visit(final ImportDeclaration n1, final Node arg) { in visit()
218 @Override public Boolean visit(final TypeParameter n1, final Node arg) { in visit()
234 @Override public Boolean visit(final LineComment n1, final Node arg) { in visit()
248 @Override public Boolean visit(final BlockComment n1, final Node arg) { in visit()
[all …]
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/visitor/
DEqualsVisitor.java82 public static boolean equals(final Node n1, final Node n2) { in equals()
94 private boolean commonNodeEquality(Node n1, Node n2) { in commonNodeEquality()
124 private <T extends Node> boolean nodeEquals(final T n1, final T n2) { in nodeEquals()
145 private boolean objEquals(final Object n1, final Object n2) { in objEquals()
160 @Override public Boolean visit(final CompilationUnit n1, final Node arg) { in visit()
182 @Override public Boolean visit(final PackageDeclaration n1, final Node arg) { in visit()
196 @Override public Boolean visit(final ImportDeclaration n1, final Node arg) { in visit()
206 @Override public Boolean visit(final TypeParameter n1, final Node arg) { in visit()
222 @Override public Boolean visit(final LineComment n1, final Node arg) { in visit()
236 @Override public Boolean visit(final BlockComment n1, final Node arg) { in visit()
[all …]
/external/igt-gpu-tools/lib/
Digt_core.h577 #define igt_assert_cmpint(n1, cmp, ncmp, n2) \ argument
595 #define igt_assert_cmpuint(n1, cmp, ncmp, n2) \ argument
613 #define igt_assert_cmps64(n1, cmp, ncmp, n2) \ argument
631 #define igt_assert_cmpu64(n1, cmp, ncmp, n2) \ argument
649 #define igt_assert_cmpdouble(n1, cmp, ncmp, n2) \ argument
669 #define igt_assert_eq(n1, n2) igt_assert_cmpint(n1, ==, !=, n2) argument
678 #define igt_assert_eq_u32(n1, n2) igt_assert_cmpuint(n1, ==, !=, n2) argument
687 #define igt_assert_eq_s64(n1, n2) igt_assert_cmps64(n1, ==, !=, n2) argument
696 #define igt_assert_eq_u64(n1, n2) igt_assert_cmpu64(n1, ==, !=, n2) argument
705 #define igt_assert_eq_double(n1, n2) igt_assert_cmpdouble(n1, ==, !=, n2) argument
[all …]
/external/fft2d/src/fft2d/fft2d/
Dalloc.c13 int *alloc_1d_int(int n1) in alloc_1d_int()
29 double *alloc_1d_double(int n1) in alloc_1d_double()
45 int **alloc_2d_int(int n1, int n2) in alloc_2d_int()
69 double **alloc_2d_double(int n1, int n2) in alloc_2d_double()
93 int ***alloc_3d_int(int n1, int n2, int n3) in alloc_3d_int()
124 double ***alloc_3d_double(int n1, int n2, int n3) in alloc_3d_double()
Dfftsg2d.c397 void cdft2d(int n1, int n2, int isgn, double **a, double *t, in cdft2d()
453 void rdft2d(int n1, int n2, int isgn, double **a, double *t, in rdft2d()
532 void rdft2dsort(int n1, int n2, int isgn, double **a) in rdft2dsort()
566 void ddct2d(int n1, int n2, int isgn, double **a, double *t, in ddct2d()
630 void ddst2d(int n1, int n2, int isgn, double **a, double *t, in ddst2d()
697 void cdft2d_sub(int n1, int n2, int isgn, double **a, double *t, in cdft2d_sub()
759 void rdft2d_sub(int n1, int n2, int isgn, double **a) in rdft2d_sub()
787 void ddxt2d_sub(int n1, int n2, int ics, int isgn, double **a, in ddxt2d_sub()
844 int n1; member
856 void xdft2d0_subth(int n1, int n2, int icr, int isgn, double **a, in xdft2d0_subth()
[all …]
Dfftsg3d.c493 void cdft3d(int n1, int n2, int n3, int isgn, double ***a, in cdft3d()
555 void rdft3d(int n1, int n2, int n3, int isgn, double ***a, in rdft3d()
640 void rdft3dsort(int n1, int n2, int n3, int isgn, double ***a) in rdft3dsort()
721 void ddct3d(int n1, int n2, int n3, int isgn, double ***a, in ddct3d()
788 void ddst3d(int n1, int n2, int n3, int isgn, double ***a, in ddst3d()
858 void xdft3da_sub(int n1, int n2, int n3, int icr, int isgn, in xdft3da_sub()
937 void cdft3db_sub(int n1, int n2, int n3, int isgn, double ***a, in cdft3db_sub()
1005 void rdft3d_sub(int n1, int n2, int n3, int isgn, double ***a) in rdft3d_sub()
1096 void ddxt3da_sub(int n1, int n2, int n3, int ics, int isgn, in ddxt3da_sub()
1160 void ddxt3db_sub(int n1, int n2, int n3, int ics, int isgn, in ddxt3db_sub()
[all …]
Dfftsg2d.f312 subroutine cdft2d(n1max, n1, n2, isgn, a, t, ip, w) argument
313 integer n1max, n1, n2, isgn, ip(0 : *), n, j local
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
354 subroutine rdft2dsort(n1max, n1, n2, isgn, a) argument
355 integer n1max, n1, n2, isgn, n2h, j local
385 subroutine ddct2d(n1max, n1, n2, isgn, a, t, ip, w) argument
386 integer n1max, n1, n2, isgn, ip(0 : *), n, nw, nc, j local
406 subroutine ddst2d(n1max, n1, n2, isgn, a, t, ip, w) argument
407 integer n1max, n1, n2, isgn, ip(0 : *), n, nw, nc, j local
[all …]
Dfftsg3d.f400 subroutine cdft3d(n1max, n2max, n1, n2, n3, isgn, a, argument
402 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), n local
416 subroutine rdft3d(n1max, n2max, n1, n2, n3, isgn, a, argument
418 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), local
449 subroutine rdft3dsort(n1max, n2max, n1, n2, n3, isgn, a) argument
450 integer n1max, n2max, n1, n2, n3, isgn, n2h, n3h, j, k local
527 subroutine ddct3d(n1max, n2max, n1, n2, n3, isgn, a, argument
529 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), local
551 subroutine ddst3d(n1max, n2max, n1, n2, n3, isgn, a, argument
553 integer n1max, n2max, n1, n2, n3, isgn, ip(0 : *), local
[all …]
/external/tensorflow/tensorflow/compiler/xla/
Darray3d.h42 Array3D(const int64 n1, const int64 n2, const int64 n3) in Array3D()
46 Array3D(const int64 n1, const int64 n2, const int64 n3, const T value) in Array3D()
73 int64 n1() const { return this->dim(0); } in n1() function
Darray2d.h43 Array2D(const int64 n1, const int64 n2) in Array2D()
46 Array2D(const int64 n1, const int64 n2, const T value) in Array2D()
68 int64 n1() const { return this->dim(0); } in n1() function
102 int64 n1, int64 n2) { in MakeLinspaceArray2D()
Darray3d_test.cc41 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
97 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
106 for (int64 n1 = 0; n1 < fullof7.n1(); ++n1) { in TEST() local
/external/tensorflow/tensorflow/core/kernels/data/
Dhash_utils_test.cc194 NodeDef* n1 = gd.add_node(); in TEST_F() local
241 NodeDef* n1 = gd.add_node(); in TEST_F() local
280 NodeDef* n1 = gd.add_node(); in TEST_F() local
352 NodeDef* n1 = gd.add_node(); in TEST_F() local
402 NodeDef* n1 = gd.add_node(); in TEST_F() local
440 NodeDef* n1 = gd.add_node(); in TEST_F() local
500 NodeDef* n1 = gd.add_node(); in TEST_F() local
565 NodeDef* n1 = gd.add_node(); in TEST_F() local
630 NodeDef* n1 = gd.add_node(); in TEST_F() local
678 NodeDef* n1 = gd.add_node(); in TEST_F() local
[all …]
/external/fft2d/src/fft2d/fft2d/sample2d/
Dfftsg2dt.f7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
60 subroutine putdata2d(n1max, n1, n2, a) argument
61 integer n1max, n1, n2, j1, j2, seed local
73 integer n1max, n1, n2, j1, j2, seed local
Dfft4f2dt.f7 integer ip(0 : nmaxsqrt + 1), n1, n2, i variable
61 subroutine putdata2d(n1max, n1, n2, a) argument
62 integer n1max, n1, n2, j1, j2, seed local
74 integer n1max, n1, n2, j1, j2, seed local
Dfftsg2dt.c20 int *ip, n1, n2, n, i; in main() local
82 void putdata2d(int n1, int n2, double **a) in putdata2d()
94 double errorcheck2d(int n1, int n2, double scale, double **a) in errorcheck2d()
Dfft4f2dt.c20 int *ip, n1, n2, n, i; in main() local
84 void putdata2d(int n1, int n2, double **a) in putdata2d()
96 double errorcheck2d(int n1, int n2, double scale, double **a) in errorcheck2d()
Dfftsg3dt.f7 integer ip(0 : nmaxsqrt + 1), n1, n2, n3, i, j variable
81 subroutine putdata3d(n1max, n2max, n1, n2, n3, a) argument
82 integer n1max, n2max, n1, n2, n3, j1, j2, j3, seed local
96 integer n1max, n2max, n1, n2, n3, j1, j2, j3, seed local
Dfftsg3dt.c20 int *ip, n1, n2, n3, n, nt, i, j; in main() local
99 void putdata3d(int n1, int n2, int n3, double ***a) in putdata3d()
113 double errorcheck3d(int n1, int n2, int n3, double scale, double ***a) in errorcheck3d()
/external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/
Dlexicographical_compare.pass.cpp72 for (std::size_t n1 = 0; n1 <= max_n; n1 = n1 <= 16 ? n1 + 1 : std::size_t(3.1415 * n1)) in test() local
101 for (std::size_t n1 = 0; n1 <= max_n; ++n1) in test_string() local
106 for (std::size_t n1 = 0; n1 <= 2 * max_n; ++n1) in test_string() local
113 for (std::size_t n1 = 0; n1 < in1.size(); n1 = n1 <= 16 ? n1 + 1 : std::size_t(3.1415 * n1)) in test_string() local
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/internal/
DLockFreeLinkedListTest.kt17 val n1 = IntNode(1).apply { list.addLast(this) } in testSimpleAddLast() constant
54 val n1 = IntNode(1).also { single(list.describeAddLast(it)) } in testAtomicOpsSingle() constant
/external/testng/src/test/java/test/factory/
DFactoryDataProviderTest.java37 private void runTest(Class<?> cls, int n1, int n2) { in runTest()
50 Assert.assertEquals(t1.getN(), n1); in runTest() local
/external/apache-xml/src/main/java/org/apache/xpath/objects/
DXNodeSet.java754 abstract boolean compareNumbers(double n1, double n2); in compareNumbers()
787 boolean compareNumbers(double n1, double n2) in compareNumbers()
823 boolean compareNumbers(double n1, double n2) in compareNumbers()
859 boolean compareNumbers(double n1, double n2) in compareNumbers()
895 boolean compareNumbers(double n1, double n2) in compareNumbers()
930 boolean compareNumbers(double n1, double n2) in compareNumbers()
965 boolean compareNumbers(double n1, double n2) in compareNumbers()
/external/libcxx/test/std/strings/string.view/string.view.ops/
Dcompare.pointer_size.pass.cpp25 size_t pos1, size_t n1, const CharT *s, int expected ) { in test1()
42 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected) in test()
Dcompare.size_size_sv.pass.cpp24 void test1 ( std::basic_string_view<CharT> sv1, size_t pos1, size_t n1, in test1()
42 void test ( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected ) { in test()
/external/llvm-project/libcxx/test/std/strings/string.view/string.view.ops/
Dcompare.pointer_size.pass.cpp24 size_t pos1, size_t n1, const CharT *s, int expected ) { in test1()
41 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected) in test()

12345678910>>...16