| /third_party/typescript/tests/baselines/reference/ |
| D | typeArgumentsWithStringLiteralTypes01.js | 83 namespace n3 {
185 var n3; variable
186 (function (n3) { argument
189 n3.a = fun2("Hello", "World");
190 n3.b = fun2("World", "Hello");
191 n3.c = fun2("Hello", "Hello");
192 n3.d = fun2("World", "World");
193 n3.e = fun3("Hello", "World");
195 n3.a = takeReturnString(n3.a);
196 n3.b = takeReturnString(n3.b);
[all …]
|
| D | importDeclFromTypeNodeInJsSource.types | 30 namespace a1.a2.n3 {
33 >n3 : typeof n3
66 import { n3, d } from 'nestNamespaceModule';
67 >n3 : typeof n3
78 export class Foo2 extends n3.c {
80 >n3.c : n3.c
81 >n3 : typeof n3
82 >c : typeof n3.c
|
| D | importDeclFromTypeNodeInJsSource.symbols | 30 namespace a1.a2.n3 {
33 >n3 : Symbol(n3, Decl(events.d.ts, 13, 20))
66 import { n3, d } from 'nestNamespaceModule';
67 >n3 : Symbol(n3, Decl(b.js, 1, 8))
78 export class Foo2 extends n3.c {
80 >n3.c : Symbol(n3.c, Decl(events.d.ts, 13, 24))
81 >n3 : Symbol(n3, Decl(b.js, 1, 8))
82 >c : Symbol(n3.c, Decl(events.d.ts, 13, 24))
|
| D | recursiveInitializer.js | 5 var n3 /* any */ = n3 + n3; variable
26 var n3 /* any */ = n3 + n3;
|
| D | recursiveInitializer.types | 14 var n3 /* any */ = n3 + n3;
15 >n3 : any
16 >n3 + n3 : any
17 >n3 : any
18 >n3 : any
|
| D | genericReduce.js | 12 var n3 = b.reduce<string>( (x, y) => x + y, ""); // Initial value is of type string variable
13 n3.toExponential(2); // should error if 'n3' is correctly type 'string'
14 n3.charAt(0); // should not error if 'n3' is correctly type 'string'
25 var n3 = b.reduce(function (x, y) { return x + y; }, ""); // Initial value is of type string
26 n3.toExponential(2); // should error if 'n3' is correctly type 'string'
27 n3.charAt(0); // should not error if 'n3' is correctly type 'string'
|
| D | recursiveInitializer.symbols | 12 var n3 /* any */ = n3 + n3;
13 >n3 : Symbol(n3, Decl(recursiveInitializer.ts, 3, 3))
14 >n3 : Symbol(n3, Decl(recursiveInitializer.ts, 3, 3))
15 >n3 : Symbol(n3, Decl(recursiveInitializer.ts, 3, 3))
|
| D | genericReduce.symbols | 51 var n3 = b.reduce<string>( (x, y) => x + y, ""); // Initial value is of type string
52 >n3 : Symbol(n3, Decl(genericReduce.ts, 10, 3))
61 n3.toExponential(2); // should error if 'n3' is correctly type 'string'
62 >n3 : Symbol(n3, Decl(genericReduce.ts, 10, 3))
64 n3.charAt(0); // should not error if 'n3' is correctly type 'string'
65 >n3.charAt : Symbol(String.charAt, Decl(lib.es5.d.ts, --, --))
66 >n3 : Symbol(n3, Decl(genericReduce.ts, 10, 3))
|
| D | importDeclFromTypeNodeInJsSource.js | 19 namespace a1.a2.n3 {
34 import { n3, d } from 'nestNamespaceModule';
40 export class Foo2 extends n3.c {
60 class Foo2 extends nestNamespaceModule_1.n3.c {
74 export class Foo2 extends n3.c {
81 import { n3 } from "nestNamespaceModule";
|
| D | genericReduce.types | 76 var n3 = b.reduce<string>( (x, y) => x + y, ""); // Initial value is of type string
77 >n3 : string
90 n3.toExponential(2); // should error if 'n3' is correctly type 'string'
91 >n3.toExponential(2) : any
92 >n3.toExponential : any
93 >n3 : string
97 n3.charAt(0); // should not error if 'n3' is correctly type 'string'
98 >n3.charAt(0) : string
99 >n3.charAt : (pos: number) => string
100 >n3 : string
|
| D | overloadCrash.types | 17 >foo : { (...n: I1[]): any; (n1: I2, n3: I2): any; }
20 declare function foo(n1:I2, n3:I2);
21 >foo : { (...n: I1[]): any; (n1: I2, n3: I2): any; }
23 >n3 : I2
30 >foo : { (...n: I1[]): any; (n1: I2, n3: I2): any; }
|
| D | genericReduce.errors.txt | 21 var n3 = b.reduce<string>( (x, y) => x + y, ""); // Initial value is of type string
22 n3.toExponential(2); // should error if 'n3' is correctly type 'string'
25 n3.charAt(0); // should not error if 'n3' is correctly type 'string'
|
| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | LinkedListTests.cpp | 118 Node n3(3); in TEST() local
119 list.Append(&n3); in TEST()
122 EXPECT_EQ(&n3, list.tail()); in TEST()
134 Node n3(3); in TEST() local
140 list.Append(&n3); in TEST()
152 n3.RemoveFromList(); in TEST()
192 list.Append(&n3); in TEST()
209 Node n3(3); in TEST() local
222 n3.InsertBefore(&n2); in TEST()
246 Node n3(3); in TEST() local
[all …]
|
| /third_party/typescript/tests/ts_extra_tests/test_ts_cases/spec/types/primitive_types/the_number_type/ |
| D | the_number_type_2.ts | 37 let n3: number = 0b1011; variable
38 Assert.isNumber(n3);
39 Assert.equal(n3, 0b1011);
40 n3 = 0b1111;
41 Assert.isNumber(n3);
42 Assert.equal(n3, 0b1111);
|
| /third_party/rust/crates/memchr/src/memchr/ |
| D | mod.rs | 212 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
213 naive::memchr3(n1, n2, n3, haystack) in memchr3()
218 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
219 x86::memchr3(n1, n2, n3, haystack) in memchr3()
227 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
228 fallback::memchr3(n1, n2, n3, haystack) in memchr3()
386 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3()
387 naive::memrchr3(n1, n2, n3, haystack) in memrchr3()
392 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3()
393 x86::memrchr3(n1, n2, n3, haystack) in memrchr3()
[all …]
|
| D | naive.rs | 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()
23 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3()
24 haystack.iter().rposition(|&b| b == n1 || b == n2 || b == n3) in memrchr3()
|
| /third_party/skia/tests/sksl/shared/ |
| D | StructsInFunctions.metal | 41 void _skOutParamHelper1_modifies_a_struct_vS(thread Nested& n3) {
42 S _var0 = n3.b;
44 n3.b = _var0;
92 Nested n3;
96 n3 = n2;
97 _skOutParamHelper1_modifies_a_struct_vS(n3);
101 … && s == S{2.0, 3}) && s != returns_a_struct_S()) && n1 == n2) && n1 != n3) && n3 == Nested{S{1.0,…
|
| D | StructsInFunctions.glsl | 40 Nested n3;
44 n3 = n2;
45 modifies_a_struct_vS(n3.b);
49 … && s == S(2.0, 3)) && s != returns_a_struct_S()) && n1 == n2) && n1 != n3) && n3 == Nested(S(1.0,…
|
| /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 };
38 Assert.equal(f().n3, 5);
42 Assert.equal(f(1).n3, 3);
|
| /third_party/rust/crates/memchr/src/tests/memchr/ |
| D | memchr.rs | 108 n1: u8, n2: u8, n3: u8,
111 memchr3(n1, n2, n3, &corpus) == naive::memchr3(n1, n2, n3, &corpus)
129 n1: u8, n2: u8, n3: u8,
132 memrchr3(n1, n2, n3, &corpus) == naive::memrchr3(n1, n2, n3, &corpus)
|
| /third_party/skia/resources/sksl/shared/ |
| D | StructsInFunctions.sksl | 38 Nested n1, n2, n3;
42 n3 = n2;
43 modifies_a_struct(n3.b);
51 (n1 == n2) && (n1 != n3) && (n3 == Nested(S(1, 2), S(2, 3))) &&
|
| /third_party/libxml2/result/c14n/without-comments/ |
| D | test-2 | 1 <n1:elem2 xmlns:n0="foo://bar" xmlns:n1="http://example.net" xmlns:n3="ftp://example.org" xml:lang=…
2 <n3:stuff></n3:stuff>
|
| /third_party/typescript/tests/cases/conformance/statements/VariableStatements/ |
| D | recursiveInitializer.ts | 4 var n3 /* any */ = n3 + n3; variable
|
| /third_party/typescript/tests/cases/compiler/ |
| D | importDeclFromTypeNodeInJsSource.ts | 23 namespace a1.a2.n3 {
38 import { n3, d } from 'nestNamespaceModule';
44 export class Foo2 extends n3.c {
|
| /third_party/rust/crates/memchr/src/memchr/x86/ |
| D | sse42.rs | 26 n3: u8, in memchr3()
31 let vn3 = _mm_set1_epi8(n3 as i8); in memchr3()
33 n1 as i8, n2 as i8, n3 as i8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, in memchr3()
42 if *ptr == n1 || *ptr == n2 || *ptr == n3 { in memchr3()
|