| /third_party/python/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 …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeArgumentsWithStringLiteralTypes01.js | 19 namespace n1 {
128 var n1; variable
129 (function (n1) { argument
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.a);
140 n1.b = takeReturnString(n1.b);
[all …]
|
| D | overload1.types | 30 g(n1:number,n2:number):number;
31 >g : { (n1: number, n2: number): number; (n: number): string; (a: A): C; (c: C): string; }
32 >n1 : number
36 >g : { (n1: number, n2: number): number; (n: number): string; (a: A): C; (c: C): string; }
40 >g : { (n1: number, n2: number): number; (n: number): string; (a: A): C; (c: C): string; }
44 >g : { (n1: number, n2: number): number; (n: number): string; (a: A): C; (c: C): string; }
66 >x.g : { (n1: number, n2: number): number; (n: number): string; (a: O.A): O.C; (c: O.C): string; }
68 >g : { (n1: number, n2: number): number; (n: number): string; (a: O.A): O.C; (c: O.C): string; }
94 >x.g : { (n1: number, n2: number): number; (n: number): string; (a: O.A): O.C; (c: O.C): string; }
96 >g : { (n1: number, n2: number): number; (n: number): string; (a: O.A): O.C; (c: O.C): string; }
[all …]
|
| D | checkJsdocTypeTagOnObjectProperty2.types | 8 …ction(number): number} */ method1(n1) { return "42"; }, /** @type {function(number): numbe…
16 method1(n1) {
17 >method1 : (n1: number) => number
18 >n1 : number
25 method2: (n1) => "lol",
27 >(n1) => "lol" : (n1: number) => number
28 >n1 : number
|
| /third_party/rust/crates/memchr/src/memchr/ |
| D | mod.rs | 90 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
91 naive::memchr(n1, haystack) in memchr()
96 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
97 x86::memchr(n1, haystack) in memchr()
106 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
107 c::memchr(n1, haystack) in memchr()
116 fn imp(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
117 fallback::memchr(n1, haystack) in memchr()
154 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
155 naive::memchr2(n1, n2, haystack) in memchr2()
[all …]
|
| D | naive.rs | 3 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 || b == n2) in memrchr2()
[all …]
|
| D | fallback.rs | 46 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: u8, haystack: &[u8]) -> Option<usize> { in memrchr()
[all …]
|
| /third_party/selinux/libsepol/src/ |
| D | ebitmap.c | 20 const ebitmap_node_t *n1, *n2; in ebitmap_or() local
25 n1 = e1->node; in ebitmap_or()
28 while (n1 || n2) { in ebitmap_or()
35 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
36 new->startbit = n1->startbit; in ebitmap_or()
37 new->map = n1->map | n2->map; in ebitmap_or()
38 n1 = n1->next; in ebitmap_or()
40 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) { in ebitmap_or()
41 new->startbit = n1->startbit; in ebitmap_or()
42 new->map = n1->map; in ebitmap_or()
[all …]
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | LinkedListTests.cpp | 98 Node n1(1); in TEST() local
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() local
138 list.Append(&n1); in TEST()
144 EXPECT_EQ(&n1, list.head()); in TEST()
154 EXPECT_EQ(&n1, list.head()); in TEST()
[all …]
|
| /third_party/rust/crates/memchr/src/tests/memchr/ |
| D | memchr.rs | 95 fn qc_memchr1_matches_naive(n1: u8, corpus: Vec<u8>) -> bool {
96 memchr(n1, &corpus) == naive::memchr(n1, &corpus)
101 fn qc_memchr2_matches_naive(n1: u8, n2: u8, corpus: Vec<u8>) -> bool {
102 memchr2(n1, n2, &corpus) == naive::memchr2(n1, n2, &corpus)
108 n1: u8, n2: u8, n3: u8,
111 memchr3(n1, n2, n3, &corpus) == naive::memchr3(n1, n2, n3, &corpus)
116 fn qc_memrchr1_matches_naive(n1: u8, corpus: Vec<u8>) -> bool {
117 memrchr(n1, &corpus) == naive::memrchr(n1, &corpus)
122 fn qc_memrchr2_matches_naive(n1: u8, n2: u8, corpus: Vec<u8>) -> bool {
123 memrchr2(n1, n2, &corpus) == naive::memrchr2(n1, n2, &corpus)
[all …]
|
| /third_party/openssl/crypto/lhash/ |
| D | lhash.c | 215 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 = lh->b[(int)lh->p]; in contract()
281 if (n1 == NULL) in contract()
284 while (n1->next != NULL) in contract()
[all …]
|
| /third_party/glslang/Test/baseResults/ |
| D | spv.offsets.frag.out | 13 Name 7 "n1"
14 MemberName 7(n1) 0 "a"
15 MemberName 7(n1) 1 "b"
16 MemberName 7(n1) 2 "c"
17 MemberName 7(n1) 3 "d"
25 MemberDecorate 7(n1) 0 Offset 8
26 MemberDecorate 7(n1) 1 Offset 4
27 MemberDecorate 7(n1) 2 Offset 0
28 MemberDecorate 7(n1) 3 Offset 12
29 Decorate 7(n1) Block
[all …]
|
| /third_party/openssl/test/testutil/ |
| D | format_output.c | 49 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 > 0) in test_fail_string_common()
112 m1 += n1; in test_fail_string_common()
[all …]
|
| /third_party/cmsis/CMSIS/DSP/Include/dsp/ |
| D | utils.h | 158 int32_t n1; in arm_norm_64_to_32u() local
162 n1 = __CLZ(hi) - 32; in arm_norm_64_to_32u()
163 if (!n1) in arm_norm_64_to_32u()
168 n1 = __CLZ(lo); in arm_norm_64_to_32u()
169 if (!n1) in arm_norm_64_to_32u()
178 if (n1 == 32) in arm_norm_64_to_32u()
190 *norm = n1 - 1; in arm_norm_64_to_32u()
199 n1 = 1 - n1; in arm_norm_64_to_32u()
200 *norm = -n1; in arm_norm_64_to_32u()
204 *normalized = (((uint32_t) lo) >> n1) | (hi << (32 - n1)); in arm_norm_64_to_32u()
|
| /third_party/rust/crates/memchr/src/memchr/x86/ |
| D | mod.rs | 95 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/cmsis/CMSIS/DSP/Source/TransformFunctions/ |
| D | arm_cfft_radix2_q15.c | 96 uint32_t n1, n2, ia; in arm_radix2_butterfly_q15() local
104 n1 = n2; in arm_radix2_butterfly_q15()
177 n1 = n2; in arm_radix2_butterfly_q15()
189 for (i = j; i < fftLen; i += n1) in arm_radix2_butterfly_q15()
211 i += n1; in arm_radix2_butterfly_q15()
240 n1 = n2; in arm_radix2_butterfly_q15()
249 for (i = 0; i < fftLen; i += n1) in arm_radix2_butterfly_q15()
263 i += n1; in arm_radix2_butterfly_q15()
282 uint32_t n1, n2, ia; in arm_radix2_butterfly_q15()
289 n1 = n2; in arm_radix2_butterfly_q15()
[all …]
|
| D | arm_cfft_radix2_q31.c | 97 unsigned n1, n2, ia; in arm_radix2_butterfly_q31() local
104 n1 = n2; in arm_radix2_butterfly_q31()
138 n1 = n2; in arm_radix2_butterfly_q31()
151 m = fftLen / n1; in arm_radix2_butterfly_q31()
168 i += n1; in arm_radix2_butterfly_q31()
177 n1 = n2; in arm_radix2_butterfly_q31()
186 for (i = 0; i < fftLen; i += n1) in arm_radix2_butterfly_q31()
199 i += n1; in arm_radix2_butterfly_q31()
225 unsigned n1, n2, ia; in arm_radix2_butterfly_inverse_q31() local
232 n1 = n2; in arm_radix2_butterfly_inverse_q31()
[all …]
|
| /third_party/icu/icu4c/source/samples/uciter8/ |
| D | uciter8.c | 53 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, iter… in compareIterators()
104 …->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->… 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, U… 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/ |
| D | uciter8.c | 53 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, iter… in compareIterators()
104 …->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->… 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, U… in compareIterators()
140 log_err("%s->hasNext() at the end returns true\n", n1); in compareIterators()
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/samples/uciter8/ |
| D | uciter8.c | 53 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, iter… in compareIterators()
104 …->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->… 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, U… in compareIterators()
140 log_err("%s->hasNext() at the end returns TRUE\n", n1); in compareIterators()
[all …]
|
| /third_party/mbedtls/tests/suites/ |
| D | test_suite_gcm.function | 14 size_t n1,
19 size_t n2 = input->len - n1;
24 TEST_ASSERT( n1 <= input->len );
36 ASSERT_ALLOC( output, n1 );
38 TEST_EQUAL( 0, mbedtls_gcm_update( ctx, input->x, n1, output, n1, &olen ) );
39 TEST_EQUAL( n1, olen );
40 ASSERT_COMPARE( output, olen, expected_output->x, n1 );
46 TEST_EQUAL( 0, mbedtls_gcm_update( ctx, input->x + n1, n2, output, n2, &olen ) );
48 ASSERT_COMPARE( output, olen, expected_output->x + n1, n2 );
201 size_t n1;
[all …]
|
| /third_party/typescript/tests/ts_extra_tests/test_ts_cases/spec/functions/function_implementations/ |
| D | function_implementations_5.ts | 28 function f(n1: number = a, n2 = n1 * 2, n3 = n1 + 2) {
34 return { n1, n2, n3, g: c };
36 Assert.equal(f().n1, 3);
40 Assert.equal(f(1).n1, 1);
|
| /third_party/openssl/ms/ |
| D | cmp.pl | 20 $n1=sysread(IN0,$b1,4096);
23 last if ($n1 != $n2);
25 last if ($n1 < 0);
26 if ($n1 == 0)
31 $tot+=$n1;
49 $nm=$tot+$n1;
|
| /third_party/skia/resources/sksl/shared/ |
| D | StructsInFunctions.sksl | 38 Nested n1, n2, n3;
39 n1.a = returns_a_struct();
40 n1.b = n1.a;
41 n2 = n1;
51 (n1 == n2) && (n1 != n3) && (n3 == Nested(S(1, 2), S(2, 3))) &&
|
| /third_party/skia/tests/sksl/shared/ |
| D | StructsInFunctions.glsl | 38 Nested n1;
41 n1.a = returns_a_struct_S();
42 n1.b = n1.a;
43 n2 = n1;
49 …& s == expected) && s == S(2.0, 3)) && s != returns_a_struct_S()) && n1 == n2) && n1 != n3) && n3 …
|