Home
last modified time | relevance | path

Searched refs:n2 (Results 1 – 25 of 603) sorted by relevance

12345678910>>...25

/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/
DNoCommentEqualsVisitor.java39 public static boolean equals(final Node n, final Node n2) { in equals() argument
40 return SINGLETON.nodeEquals(n, n2); in equals()
43 private <N extends Node> boolean nodesEquals(NodeList<N> n, NodeList<N> n2) { in nodesEquals() argument
44 if (n == n2) { in nodesEquals()
47 if (n == null || n2 == null) { in nodesEquals()
50 if (n.size() != n2.size()) { in nodesEquals()
54 if (!nodeEquals(n.get(i), n2.get(i))) { in nodesEquals()
61 private <T extends Node> boolean nodeEquals(final T n, final T n2) { in nodeEquals() argument
62 if (n == n2) { in nodeEquals()
65 if (n == null || n2 == null) { in nodeEquals()
[all …]
DEqualsVisitor.java45 public static boolean equals(final Node n, final Node n2) { in equals() argument
46 return SINGLETON.nodeEquals(n, n2); in equals()
57 private boolean commonNodeEquality(Node n, Node n2) { in commonNodeEquality() argument
58 if (!nodeEquals(n.getComment(), n2.getComment())) { in commonNodeEquality()
61 return nodesEquals(n.getOrphanComments(), n2.getOrphanComments()); in commonNodeEquality()
81 private <N extends Node> boolean nodesEquals(NodeList<N> n, NodeList<N> n2) { in nodesEquals() argument
82 if (n == n2) { in nodesEquals()
85 if (n == null || n2 == null) { in nodesEquals()
88 if (n.size() != n2.size()) { in nodesEquals()
92 if (!nodeEquals(n.get(i), n2.get(i))) { in nodesEquals()
[all …]
/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() 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/
DEqualsVisitor.java82 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()
129 if (n2 == null) { in nodeEquals()
133 } else if (n2 == null) { in nodeEquals()
136 if (n1.getClass() != n2.getClass()) { in nodeEquals()
[all …]
/external/libaom/libaom/aom_dsp/x86/
Dfft_sse2.c40 const int n2 = n / 2; in aom_fft_unpack_2d_output_sse2() local
43 output[2 * (n2 * n)] = packed[n2 * n]; in aom_fft_unpack_2d_output_sse2()
44 output[2 * (n2 * n) + 1] = 0; in aom_fft_unpack_2d_output_sse2()
46 output[2 * n2] = packed[n2]; in aom_fft_unpack_2d_output_sse2()
47 output[2 * n2 + 1] = 0; in aom_fft_unpack_2d_output_sse2()
48 output[2 * (n2 * n + n2)] = packed[n2 * n + n2]; in aom_fft_unpack_2d_output_sse2()
49 output[2 * (n2 * n + n2) + 1] = 0; in aom_fft_unpack_2d_output_sse2()
51 for (int c = 1; c < n2; ++c) { in aom_fft_unpack_2d_output_sse2()
53 output[2 * (0 * n + c) + 1] = packed[c + n2]; in aom_fft_unpack_2d_output_sse2()
54 output[2 * (n2 * n + c) + 0] = packed[n2 * n + c]; in aom_fft_unpack_2d_output_sse2()
[all …]
/external/strace/tests/
Drt_sigaction.awk31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
/external/strace/tests-mx32/
Drt_sigaction.awk31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
/external/strace/tests-m32/
Drt_sigaction.awk31 n1[1][1] = n2[1][1] = "SIG_IGN"
32 n1[1][2] = n2[1][2] = "\\[HUP INT\\]"
34 n2[1][3] = "SA_RESTART"
36 n2[1][4] = ""
38 n1[2][1] = n2[2][1] = "0x[0-9a-f]+"
39 n1[2][2] = n2[2][2] = "\\[QUIT TERM\\]"
41 n2[2][3] = "SA_SIGINFO"
43 n2[2][4] = ""
45 n1[3][1] = n2[3][1] = "SIG_DFL"
46 n1[3][2] = n2[3][2] = "\\[\\]"
[all …]
/external/boringssl/src/crypto/fipsmodule/bn/
Dmul.c340 int n2, int dna, int dnb, BN_ULONG *t) { in bn_mul_recursive() argument
342 assert(n2 != 0 && (n2 & (n2 - 1)) == 0); in bn_mul_recursive()
349 if (n2 == 8 && dna == 0 && dnb == 0) { in bn_mul_recursive()
355 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) { in bn_mul_recursive()
356 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb); in bn_mul_recursive()
358 OPENSSL_memset(&r[2 * n2 + dna + dnb], 0, in bn_mul_recursive()
374 int n = n2 / 2, tna = n + dna, tnb = n + dnb; in bn_mul_recursive()
379 BN_ULONG neg = bn_abs_sub_part_words(t, a, &a[n], tna, n - tna, &t[n2]); in bn_mul_recursive()
380 neg ^= bn_abs_sub_part_words(&t[n], &b[n], b, tnb, tnb - n, &t[n2]); in bn_mul_recursive()
387 bn_mul_comba4(&t[n2], t, &t[n]); in bn_mul_recursive()
[all …]
/external/javaparser/javaparser-symbol-solver-testing/src/test/resources/javaparser_expected_output/
Dcom_github_javaparser_ast_visitor_EqualsVisitor.txt6 Line 83) SINGLETON.nodeEquals(n1, n2) ==> boolean
7 Line 95) !nodeEquals(n1.getComment(), n2.getComment()) ==> boolean
9 Line 98) !nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()) ==> boolean
27 Line 125) n1 == n2 ==> boolean
30 Line 129) n2 == null ==> boolean
33 Line 133) n2 == null ==> boolean
35 Line 136) n1.getClass() != n2.getClass() ==> boolean
37 Line 139) !commonNodeEquality(n1, n2) ==> boolean
39 Line 142) n1.accept(this, n2).booleanValue() ==> boolean
40 Line 146) n1 == n2 ==> boolean
[all …]
/external/javaparser/javaparser-symbol-solver-testing/src/test/resources/javaparser_methodcalls_expected_output/
Dcom_github_javaparser_ast_visitor_EqualsVisitor.txt1 …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…
4 Line 123) n2.getComment() ==> com.github.javaparser.ast.Node.getComment()
5 …Line 126) nodesEquals(n1.getOrphanComments(), n2.getOrphanComments()) ==> com.github.javaparser.as…
7 Line 126) n2.getOrphanComments() ==> com.github.javaparser.ast.Node.getOrphanComments()
15 Line 153) n2.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/tensorflow/tensorflow/compiler/xla/
Darray3d_test.cc29 EXPECT_EQ(uninit.n2(), 3); in TEST()
38 EXPECT_EQ(fullof7.n2(), 3); in TEST()
42 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
44 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
56 EXPECT_EQ(arr.n2(), 4); in TEST()
79 EXPECT_EQ(arr.n2(), 4); in TEST()
98 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
100 EXPECT_EQ(fullof7(n1, n2, n3), 7); in TEST()
107 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
109 EXPECT_EQ(fullof7(n1, n2, n3), 11); in TEST()
Darray2d_test.cc28 EXPECT_EQ(empty.n2(), 0); in TEST()
35 EXPECT_EQ(uninit.n2(), 3); in TEST()
43 EXPECT_EQ(fullof7.n2(), 3); in TEST()
46 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
47 EXPECT_EQ(fullof7(n1, n2), 7); in TEST()
56 EXPECT_EQ(arr.n2(), 3); in TEST()
70 EXPECT_EQ(arr.n2(), 3); in TEST()
84 EXPECT_EQ(arr.n2(), 3); in TEST()
115 for (int64 n2 = 0; n2 < fullof7.n2(); ++n2) { in TEST() local
116 EXPECT_EQ(fullof7(n1, n2), 7); in TEST()
[all …]
Darray2d.h43 Array2D(const int64 n1, const int64 n2) in Array2D() argument
44 : Array<T>(std::vector<int64>{n1, n2}) {} in Array2D()
46 Array2D(const int64 n1, const int64 n2, const T value) in Array2D() argument
47 : Array<T>({n1, n2}, value) {} in Array2D()
69 int64 n2() const { return this->dim(1); } in n2() function
81 for (int64 i1 = 0; i1 < n2(); ++i1) {
83 ((i0 << tensorflow::Log2Ceiling64(n2())) | i1) + start_value;
91 for (int64 i1 = 0; i1 < n2(); ++i1) { in Each()
102 int64 n1, int64 n2) { in MakeLinspaceArray2D() argument
103 auto array = absl::make_unique<Array2D<NativeT>>(n1, n2); in MakeLinspaceArray2D()
[all …]
/external/selinux/libsepol/src/
Debitmap.c20 ebitmap_node_t *n1, *n2, *new, *prev; in ebitmap_or() local
25 n2 = e2->node; in ebitmap_or()
27 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
38 n2 = n2->next; in ebitmap_or()
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
44 new->startbit = n2->startbit; in ebitmap_or()
45 new->map = n2->map; in ebitmap_or()
46 n2 = n2->next; in ebitmap_or()
[all …]
/external/libcxx/test/std/localization/locales/locale/locale.operators/
Deq.pass.cpp26 std::locale n2(LOCALE_en_US_UTF_8); in main() local
34 assert(cloc != n2); in main()
42 assert(copy != n2); in main()
50 assert(n1 == n2); in main()
55 assert(n2 != cloc); in main()
56 assert(n2 != copy); in main()
57 assert(n2 == n1); in main()
58 assert(n2 == n2); in main()
59 assert(n2 != noname1); in main()
60 assert(n2 != nonamec); in main()
[all …]
/external/icu/icu4c/source/common/
Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalizedWithOptions()
[all …]
/external/deqp-deps/glslang/Test/baseResults/
Dspv.offsets.frag.out19 Name 12 "n2"
20 MemberName 12(n2) 0 "e"
21 MemberName 12(n2) 1 "f"
22 MemberName 12(n2) 2 "g"
23 MemberName 12(n2) 3 "h"
32 MemberDecorate 12(n2) 0 Offset 32
33 MemberDecorate 12(n2) 1 Offset 48
34 MemberDecorate 12(n2) 2 Offset 16
35 MemberDecorate 12(n2) 3 Offset 0
36 Decorate 12(n2) BufferBlock
[all …]
/external/libchrome/mojo/public/cpp/bindings/tests/
Dequals_unittest.cc59 NamedRegionPtr n2(n1.Clone()); in TEST_F() local
60 EXPECT_TRUE(n1.Equals(n2)); in TEST_F()
62 n2->rects = base::nullopt; in TEST_F()
63 EXPECT_FALSE(n1.Equals(n2)); in TEST_F()
64 n2->rects.emplace(); in TEST_F()
65 EXPECT_FALSE(n1.Equals(n2)); in TEST_F()
67 n2->rects->push_back(CreateRect()); in TEST_F()
68 n2->rects->push_back(CreateRect()); in TEST_F()
69 EXPECT_FALSE(n1.Equals(n2)); in TEST_F()
71 n2->rects->resize(1); in TEST_F()
[all …]
/external/python/cpython3/Lib/lib2to3/tests/
Dtest_pytree.py112 n2 = pytree.Node(1000, [n1, l3])
116 self.assertEqual(n2.get_suffix(), "")
120 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
121 self.assertEqual(n1, n2)
129 n2 = pytree.Node(1000, [l2])
130 self.assertEqual(n1, n2)
163 n2 = pytree.Node(1000, [l1, l2])
165 n1 = pytree.Node(1000, [n2, n3])
172 n2 = pytree.Node(1000, [l1, l2])
174 n1 = pytree.Node(1000, [n2, n3])
[all …]
/external/tensorflow/tensorflow/core/profiler/internal/
Dtfprof_show_multi.h84 [&opts](const T* n1, const T* n2) { in SortNodes()
86 if (n2->name() == kTFProfRoot) return false; in SortNodes()
87 bool name_cmp = n1->name() < n2->name(); in SortNodes()
92 n2->proto().total_requested_bytes(); in SortNodes()
95 n2->proto().total_peak_bytes(); in SortNodes()
98 n2->proto().total_residual_bytes(); in SortNodes()
101 n2->proto().total_output_bytes(); in SortNodes()
104 n2->proto().total_exec_micros(); in SortNodes()
107 n2->proto().total_accelerator_exec_micros(); in SortNodes()
110 n2->proto().total_cpu_exec_micros(); in SortNodes()
[all …]
Dtfprof_show.h82 [&opts](const T* n1, const T* n2) { in SortNodes()
84 if (n2->name() == kTFProfRoot) return false; in SortNodes()
85 bool name_cmp = n1->name() < n2->name(); in SortNodes()
90 n2->proto().total_requested_bytes(); in SortNodes()
93 n2->proto().total_peak_bytes(); in SortNodes()
96 n2->proto().total_residual_bytes(); in SortNodes()
99 n2->proto().total_output_bytes(); in SortNodes()
102 n2->proto().total_exec_micros(); in SortNodes()
105 n2->proto().total_accelerator_exec_micros(); in SortNodes()
108 n2->proto().total_cpu_exec_micros(); in SortNodes()
[all …]
/external/python/cpython2/Lib/lib2to3/tests/
Dtest_pytree.py134 n2 = pytree.Node(1000, [n1, l3])
138 self.assertEqual(n2.get_suffix(), "")
142 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
143 self.assertEqual(n1, n2)
151 n2 = pytree.Node(1000, [l2])
152 self.assertEqual(n1, n2)
185 n2 = pytree.Node(1000, [l1, l2])
187 n1 = pytree.Node(1000, [n2, n3])
194 n2 = pytree.Node(1000, [l1, l2])
196 n1 = pytree.Node(1000, [n2, n3])
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
DTTestImpl.java898 protected double df(double v1, double v2, double n1, double n2) { in df() argument
899 return (((v1 / n1) + (v2 / n2)) * ((v1 / n1) + (v2 / n2))) / in df()
901 (n2 * n2 * (n2 - 1d))); in df()
931 double n2) { in t() argument
932 return (m1 - m2) / FastMath.sqrt((v1 / n1) + (v2 / n2)); in t()
948 double v2, double n1, double n2) { in homoscedasticT() argument
949 double pooledVariance = ((n1 - 1) * v1 + (n2 -1) * v2 ) / (n1 + n2 - 2); in homoscedasticT()
950 return (m1 - m2) / FastMath.sqrt(pooledVariance * (1d / n1 + 1d / n2)); in homoscedasticT()
986 double n1, double n2) in tTest() argument
988 double t = FastMath.abs(t(m1, m2, v1, v2, n1, n2)); in tTest()
[all …]
/external/icu/icu4c/source/samples/uciter8/
Duciter8.c54 UCharIterator *iter2, const char *n2) { in compareIterators() argument
62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
77 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); in compareIterators()
85 … log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
94 …xt()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
104 …=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(ite… in compareIterators()
122 log_err("%s->move(start) failed\n", n2); in compareIterators()
126 log_err("%s->hasNext() at the start returns FALSE\n", n2); in compareIterators()
134 …log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, U… in compareIterators()
144 log_err("%s->hasNext() at the end returns TRUE\n", n2); in compareIterators()
[all …]

12345678910>>...25