|
| 1 | +=== tests/cases/compiler/recursiveTupleTypeInference.ts === |
| 2 | +// Repro from #37475 |
| 3 | + |
| 4 | +export type A = "number" | "null" | A[]; |
| 5 | +>A : Symbol(A, Decl(recursiveTupleTypeInference.ts, 0, 0)) |
| 6 | +>A : Symbol(A, Decl(recursiveTupleTypeInference.ts, 0, 0)) |
| 7 | + |
| 8 | +export type F<T> = null extends T |
| 9 | +>F : Symbol(F, Decl(recursiveTupleTypeInference.ts, 2, 40)) |
| 10 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 4, 14)) |
| 11 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 4, 14)) |
| 12 | + |
| 13 | + ? [F<NonNullable<T>>, "null"] |
| 14 | +>F : Symbol(F, Decl(recursiveTupleTypeInference.ts, 2, 40)) |
| 15 | +>NonNullable : Symbol(NonNullable, Decl(lib.es5.d.ts, --, --)) |
| 16 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 4, 14)) |
| 17 | + |
| 18 | + : T extends number |
| 19 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 4, 14)) |
| 20 | + |
| 21 | + ? "number" |
| 22 | + : never; |
| 23 | + |
| 24 | +export type G<T> = { [k in keyof T]: F<T[k]> }; |
| 25 | +>G : Symbol(G, Decl(recursiveTupleTypeInference.ts, 8, 12)) |
| 26 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 10, 14)) |
| 27 | +>k : Symbol(k, Decl(recursiveTupleTypeInference.ts, 10, 22)) |
| 28 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 10, 14)) |
| 29 | +>F : Symbol(F, Decl(recursiveTupleTypeInference.ts, 2, 40)) |
| 30 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 10, 14)) |
| 31 | +>k : Symbol(k, Decl(recursiveTupleTypeInference.ts, 10, 22)) |
| 32 | + |
| 33 | +interface K { |
| 34 | +>K : Symbol(K, Decl(recursiveTupleTypeInference.ts, 10, 47)) |
| 35 | + |
| 36 | + b: number | null; |
| 37 | +>b : Symbol(K.b, Decl(recursiveTupleTypeInference.ts, 12, 13)) |
| 38 | +} |
| 39 | + |
| 40 | +const gK: { [key in keyof K]: A } = { b: ["number", "null"] }; |
| 41 | +>gK : Symbol(gK, Decl(recursiveTupleTypeInference.ts, 16, 5)) |
| 42 | +>key : Symbol(key, Decl(recursiveTupleTypeInference.ts, 16, 13)) |
| 43 | +>K : Symbol(K, Decl(recursiveTupleTypeInference.ts, 10, 47)) |
| 44 | +>A : Symbol(A, Decl(recursiveTupleTypeInference.ts, 0, 0)) |
| 45 | +>b : Symbol(b, Decl(recursiveTupleTypeInference.ts, 16, 37)) |
| 46 | + |
| 47 | +function foo<T>(g: G<T>): T { |
| 48 | +>foo : Symbol(foo, Decl(recursiveTupleTypeInference.ts, 16, 62)) |
| 49 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 18, 13)) |
| 50 | +>g : Symbol(g, Decl(recursiveTupleTypeInference.ts, 18, 16)) |
| 51 | +>G : Symbol(G, Decl(recursiveTupleTypeInference.ts, 8, 12)) |
| 52 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 18, 13)) |
| 53 | +>T : Symbol(T, Decl(recursiveTupleTypeInference.ts, 18, 13)) |
| 54 | + |
| 55 | + return {} as any; |
| 56 | +} |
| 57 | + |
| 58 | +foo(gK); |
| 59 | +>foo : Symbol(foo, Decl(recursiveTupleTypeInference.ts, 16, 62)) |
| 60 | +>gK : Symbol(gK, Decl(recursiveTupleTypeInference.ts, 16, 5)) |
| 61 | + |
0 commit comments