Home
last modified time | relevance | path

Searched refs:n1 (Results 1 - 25 of 211) sorted by relevance

123456789

/third_party/python/Lib/lib2to3/tests/
H A Dtest_pytree.py76 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
[all...]
/third_party/typescript/tests/baselines/reference/
H A DtypeArgumentsWithStringLiteralTypes01.js19 namespace n1 {
128 var n1; variable
129 (function (n1) {
133 n1.a = fun1("Hello", "World");
134 n1.b = fun1("Hello", "Hello");
135 n1.c = fun2("Hello", "World");
136 n1.d = fun2("Hello", "Hello");
137 n1.e = fun3("Hello", "Hello", "World", "Foo");
139 n1.a = takeReturnString(n1
[all...]
H A DgenericReduce.js4 var n1 = b.reduce((x, y) => x + y); variable
7 n1.x = "fail"; // should error, as 'n1' should be type 'number', not 'any'.
8 n1.toExponential(2); // should not error if 'n1' is correctly number.
19 var n1 = b.reduce(function (x, y) { return x + y; }); variable
21 n1.x = "fail"; // should error, as 'n1' should be type 'number', not 'any'.
22 n1.toExponential(2); // should not error if 'n1' i
[all...]
H A DcheckJsdocTypeTagOnObjectProperty2.js8 method1(n1) {
12 method2: (n1) => "lol",
32 method1: function (n1) {
36 method2: function (n1) { return "lol"; },
H A DcheckJsdocTypeTagOnObjectProperty1.js10 method1(n1) {
11 return n1 + 42;
37 method1: function (n1) {
38 return n1 + 42;
H A DrecursiveInitializer.js3 var n1 = n1++; variable
24 var n1 = n1++; variable
/third_party/selinux/libsepol/src/
H A Debitmap.c20 const ebitmap_node_t *n1, *n2; in ebitmap_or() local
25 n1 = e1->node; in ebitmap_or()
28 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
35 new->startbit = n1->startbit; in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
37 n1 = n1->next; in ebitmap_or()
39 } else if (!n2 || (n1 in ebitmap_or()
76 const ebitmap_node_t *n1, *n2; ebitmap_and() local
119 const ebitmap_node_t *n1, *n2; ebitmap_xor() local
259 const ebitmap_node_t *n1, *n2; ebitmap_cmp() local
309 const ebitmap_node_t *n1, *n2; ebitmap_contains() local
336 const ebitmap_node_t *n1 = e1->node; ebitmap_match_any() local
[all...]
/third_party/rust/crates/memchr/src/memchr/
H A Dmod.rs90 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr_iter()
91 naive::memchr(n1, haystack) in memchr_iter()
96 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr_iter()
97 x86::memchr(n1, haystack) in memchr_iter()
106 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr_iter()
107 c::memchr(n1, haystack) in memchr_iter()
116 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr_iter()
117 fallback::memchr(n1, haystack) in memchr_iter()
154 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
155 naive::memchr2(n1, n in memchr2()
[all...]
H A Dnaive.rs3 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
4 haystack.iter().position(|&b| b == n1) in memchr()
7 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
8 haystack.iter().position(|&b| b == n1 || b == n2) in memchr2()
11 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
12 haystack.iter().position(|&b| b == n1 || b == n2 || b == n3) in memchr3()
15 pub fn memrchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memrchr()
16 haystack.iter().rposition(|&b| b == n1) in memrchr()
19 pub fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memrchr2()
20 haystack.iter().rposition(|&b| b == n1 || in memrchr2()
[all...]
H A Dfallback.rs46 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
47 let vn1 = repeat_byte(n1); in memchr()
48 let confirm = |byte| byte == n1; in memchr()
85 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
86 let vn1 = repeat_byte(n1); in memchr2()
88 let confirm = |byte| byte == n1 || byte == n2; in memchr2()
125 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
126 let vn1 = repeat_byte(n1); in memchr3()
129 let confirm = |byte| byte == n1 || byte == n2 || byte == n3; in memchr3()
168 pub fn memrchr(n1
[all...]
/third_party/rust/crates/memchr/src/tests/memchr/
H A Dmemchr.rs95 fn qc_memchr1_matches_naive(n1: u8, corpus: Vec<u8>) -> bool { in qc_memchr1_matches_naive()
96 memchr(n1, &corpus) == naive::memchr(n1, &corpus) in qc_memchr1_matches_naive()
101 fn qc_memchr2_matches_naive(n1: u8, n2: u8, corpus: Vec<u8>) -> bool { in qc_memchr2_matches_naive()
102 memchr2(n1, n2, &corpus) == naive::memchr2(n1, n2, &corpus) in qc_memchr2_matches_naive()
108 n1: u8, n2: u8, n3: u8, in qc_memchr3_matches_naive()
111 memchr3(n1, n2, n3, &corpus) == naive::memchr3(n1, n2, n3, &corpus) in qc_memchr3_matches_naive()
116 fn qc_memrchr1_matches_naive(n1
[all...]
H A Diter.rs29 test.iter_one(true, |n1, corpus| Memchr::new(n1, corpus).rev()); in memrchr1_iter()
36 test.iter_two(true, |n1, n2, corpus| { in memrchr2_iter()
37 Memchr2::new(n1, n2, corpus).rev() in memrchr2_iter()
45 test.iter_three(true, |n1, n2, n3, corpus| { in memrchr3_iter()
46 Memchr3::new(n1, n2, n3, corpus).rev() in memrchr3_iter()
194 n1: u8, in positions1()
200 .filter(move |&(_, &b)| b == n1) in positions1()
206 n1: u8, in positions2()
213 .filter(move |&(_, &b)| b == n1 || in positions2()
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp98 Node n1(1); in TEST()
99 list.Append(&n1); in TEST()
101 EXPECT_EQ(&n1, list.head()); in TEST()
102 EXPECT_EQ(&n1, list.tail()); in TEST()
111 EXPECT_EQ(&n1, list.head()); in TEST()
121 EXPECT_EQ(&n1, list.head()); in TEST()
132 Node n1(1); in TEST()
138 list.Append(&n1); in TEST()
144 EXPECT_EQ(&n1, list.head()); in TEST()
154 EXPECT_EQ(&n1, lis in TEST()
[all...]
/third_party/node/deps/openssl/openssl/crypto/lhash/
H A Dlhash.c215 OPENSSL_LH_NODE **n, **n1, **n2, *np; in expand() local
239 n1 = &(lh->b[p]); in expand()
243 for (np = *n1; np != NULL;) { in expand()
246 *n1 = (*n1)->next; in expand()
250 n1 = &((*n1)->next); in expand()
251 np = *n1; in expand()
259 OPENSSL_LH_NODE **n, *n1, *np; in contract() local
280 n1 in contract()
293 OPENSSL_LH_NODE **ret, *n1; getrn() local
[all...]
/third_party/openssl/crypto/lhash/
H A Dlhash.c215 OPENSSL_LH_NODE **n, **n1, **n2, *np; in expand() local
239 n1 = &(lh->b[p]); in expand()
243 for (np = *n1; np != NULL;) { in expand()
246 *n1 = (*n1)->next; in expand()
250 n1 = &((*n1)->next); in expand()
251 np = *n1; in expand()
259 OPENSSL_LH_NODE **n, *n1, *np; in contract() local
280 n1 in contract()
293 OPENSSL_LH_NODE **ret, *n1; getrn() local
[all...]
/third_party/rust/crates/memchr/src/memchr/x86/
H A Dmod.rs95 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
96 unsafe_ifunc!(fn(u8, &[u8]) -> Option<usize>, memchr, haystack, n1) in memchr()
100 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
105 n1, in memchr2()
111 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
116 n1, in memchr3()
123 pub fn memrchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memrchr()
124 unsafe_ifunc!(fn(u8, &[u8]) -> Option<usize>, memrchr, haystack, n1) in memrchr()
128 pub fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memrchr2()
133 n1, in memrchr2()
[all...]
/third_party/openssl/test/testutil/
H A Dformat_output.c49 size_t n1, n2, i; in test_fail_string_common() local
72 n1 = n2 = 0; in test_fail_string_common()
74 b1[n1 = l1 > width ? width : l1] = 0; in test_fail_string_common()
75 for (i = 0; i < n1; i++) in test_fail_string_common()
85 if (n1 > 0 && n2 > 0) { in test_fail_string_common()
86 const size_t j = n1 < n2 ? n1 : n2; in test_fail_string_common()
97 if (n1 == n2 && !diff) { in test_fail_string_common()
98 test_printf_stderr("%4u: '%s'\n", cnt, n2 > n1 ? b2 : b1); in test_fail_string_common()
102 else if (n1 > in test_fail_string_common()
275 size_t l1, l2, n1, n2, i, len; test_fail_bignum_common() local
434 size_t n1, n2, i; test_fail_memory_common() local
[all...]
H A Dtests.c305 const char *s1, size_t n1, const char *s2, size_t n2) in test_strn_eq()
309 if (n1 != n2 || s1 == NULL || s2 == NULL || strncmp(s1, s2, n1) != 0) { in test_strn_eq()
311 s1, s1 == NULL ? 0 : OPENSSL_strnlen(s1, n1), in test_strn_eq()
319 const char *s1, size_t n1, const char *s2, size_t n2) in test_strn_ne()
323 if (n1 != n2 || s1 == NULL || strncmp(s1, s2, n1) == 0) { in test_strn_ne()
325 s1, s1 == NULL ? 0 : OPENSSL_strnlen(s1, n1), in test_strn_ne()
333 const void *s1, size_t n1, const void *s2, size_t n2) in test_mem_eq()
337 if (n1 ! in test_mem_eq()
304 test_strn_eq(const char *file, int line, const char *st1, const char *st2, const char *s1, size_t n1, const char *s2, size_t n2) test_strn_eq() argument
318 test_strn_ne(const char *file, int line, const char *st1, const char *st2, const char *s1, size_t n1, const char *s2, size_t n2) test_strn_ne() argument
332 test_mem_eq(const char *file, int line, const char *st1, const char *st2, const void *s1, size_t n1, const void *s2, size_t n2) test_mem_eq() argument
345 test_mem_ne(const char *file, int line, const char *st1, const char *st2, const void *s1, size_t n1, const void *s2, size_t n2) test_mem_ne() argument
[all...]
/third_party/icu/icu4c/source/samples/uciter8/
H A Duciter8.c53 compareIterators(UCharIterator *iter1, const char *n1, in compareIterators() argument
62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
71 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); 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 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
104 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
112 log_err("%s->move(start) failed\n", n1); in compareIterators()
116 log_err("%s->hasNext() at the start returns false\n", n1); in compareIterators()
134 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
140 log_err("%s->hasNext() at the end returns true\n", n1); in compareIterators()
[all...]
/third_party/skia/third_party/externals/icu/source/samples/uciter8/
H A Duciter8.c53 compareIterators(UCharIterator *iter1, const char *n1, in compareIterators() argument
62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
71 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); 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 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
104 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
112 log_err("%s->move(start) failed\n", n1); in compareIterators()
116 log_err("%s->hasNext() at the start returns false\n", n1); in compareIterators()
134 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
140 log_err("%s->hasNext() at the end returns true\n", n1); in compareIterators()
[all...]
/third_party/icu/icu4j/main/tests/localespi/src/com/ibm/icu/dev/test/localespi/
H A DNumberFormatTest.java179 Number n1, n2; in TestICUEquivalent()
191 n1 = n2 = null; in TestICUEquivalent()
193 n1 = nf.parse(s1); in TestICUEquivalent()
207 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
209 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
226 n1 = n2 = null; in TestICUEquivalent()
228 n1 = nf.parse(s1); in TestICUEquivalent()
242 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
244 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
261 n1 in TestICUEquivalent()
[all...]
/third_party/ffmpeg/libavdevice/tests/
H A Dtimefilter.c31 double n0, n1; in main() local
37 for (n1 = 0; n1 < 10; n1 = 2 * n1 + 1) { in main()
46 ideal[i] = samplet[i] + n1 * i / (1000); in main()
/third_party/googletest/googletest/samples/
H A Dsample3_unittest.cc99 for (const QueueNode<int>*n1 = q->Head(), *n2 = new_q->Head(); in MapTester()
100 n1 != nullptr; n1 = n1->next(), n2 = n2->next()) { in MapTester()
101 EXPECT_EQ(2 * n1->element(), n2->element()); in MapTester()
/third_party/lame/mpglib/
H A Dlayer1.c86 unsigned char n1 = si->allocation[i][1]; in I_step_one() local
88 unsigned char b1 = n1 ? get_leq_8_bits(mp, 6) : 0; /* values 0-63 */ in I_step_one()
124 unsigned char n1 = si->allocation[i][1]; in I_step_two() local
128 assert( n1 < 16 ); in I_step_two()
136 if (n1 > 0) { in I_step_two()
137 unsigned short v = get_leq_16_bits(mp, n1 + 1); /* 0-65535 */ in I_step_two()
138 r1 = (((-1) << n1) + v + 1) * muls[n1 + 1][i1]; in I_step_two()
/third_party/musl/libc-test/src/functionalext/supplement/search/search_gtest/
H A Dsearch_tfind_test.cpp29 Node n1(1); in HWTEST_F()
31 EXPECT_EQ(nullptr, tfind(&n1, &root, NodeCmp)); in HWTEST_F()
34 void* i = tsearch(&n1, &root, NodeCmp); in HWTEST_F()
36 EXPECT_EQ(i, tfind(&n1, &root, NodeCmp)); in HWTEST_F()

Completed in 16 milliseconds

123456789