|
| 1 | +=== tests/cases/compiler/recursiveTupleTypes1.ts === |
| 2 | +interface Tree1 { |
| 3 | +>Tree1 : Symbol(Tree1, Decl(recursiveTupleTypes1.ts, 0, 0)) |
| 4 | + |
| 5 | + children: [Tree1, Tree2]; |
| 6 | +>children : Symbol(children, Decl(recursiveTupleTypes1.ts, 0, 17)) |
| 7 | +>Tree1 : Symbol(Tree1, Decl(recursiveTupleTypes1.ts, 0, 0)) |
| 8 | +>Tree2 : Symbol(Tree2, Decl(recursiveTupleTypes1.ts, 2, 1)) |
| 9 | +} |
| 10 | + |
| 11 | +interface Tree2 { |
| 12 | +>Tree2 : Symbol(Tree2, Decl(recursiveTupleTypes1.ts, 2, 1)) |
| 13 | + |
| 14 | + children: [Tree2, Tree1]; |
| 15 | +>children : Symbol(children, Decl(recursiveTupleTypes1.ts, 4, 17)) |
| 16 | +>Tree2 : Symbol(Tree2, Decl(recursiveTupleTypes1.ts, 2, 1)) |
| 17 | +>Tree1 : Symbol(Tree1, Decl(recursiveTupleTypes1.ts, 0, 0)) |
| 18 | +} |
| 19 | + |
| 20 | +let tree1: Tree1; |
| 21 | +>tree1 : Symbol(tree1, Decl(recursiveTupleTypes1.ts, 8, 3)) |
| 22 | +>Tree1 : Symbol(Tree1, Decl(recursiveTupleTypes1.ts, 0, 0)) |
| 23 | + |
| 24 | +let tree2: Tree2; |
| 25 | +>tree2 : Symbol(tree2, Decl(recursiveTupleTypes1.ts, 9, 3)) |
| 26 | +>Tree2 : Symbol(Tree2, Decl(recursiveTupleTypes1.ts, 2, 1)) |
| 27 | + |
| 28 | +tree1 = tree2; |
| 29 | +>tree1 : Symbol(tree1, Decl(recursiveTupleTypes1.ts, 8, 3)) |
| 30 | +>tree2 : Symbol(tree2, Decl(recursiveTupleTypes1.ts, 9, 3)) |
| 31 | + |
| 32 | +tree2 = tree1; |
| 33 | +>tree2 : Symbol(tree2, Decl(recursiveTupleTypes1.ts, 9, 3)) |
| 34 | +>tree1 : Symbol(tree1, Decl(recursiveTupleTypes1.ts, 8, 3)) |
| 35 | + |
0 commit comments