5353475fce
* Always generate type & symbol baselines * Accept changed shadowed baselines * Accept brand new type and symbol baselines * Allow `getTypeAtLocation` to return undefined in the type writer * Accept baselines which had missing type information * Bind container for dynamically names enum members so they may be printed * Accept type/symbol baselines for enums with computed members * First pass at reducing typeWriter memory overhead * Use generators to allow for type and symbol baselines with no cache * Accept new baselines for tests whose output was fixed by better newline splitting * Hard cap on number of declarations printed, cache declaration print text * handle differing newlines better still to handle RWC newlines * Lower abridging count, accept abridged baselines * Limit max RWC error output size, limit RWC type and symbol baseline input size * Move skip logic into type and symbol baseliner to streamline error handling * Accept removal of empty baselines * Canonicalize path earlier to handle odd paths in input files * Do canonicalization earlier still, also ensure parallel perf profiles for different targets do not trample one another * No need to pathify again
284 lines
5.2 KiB
Plaintext
284 lines
5.2 KiB
Plaintext
=== tests/cases/compiler/arrayAssignmentTest1.ts ===
|
|
interface I1 {
|
|
>I1 : I1
|
|
|
|
IM1():void[];
|
|
>IM1 : () => void[]
|
|
}
|
|
|
|
class C1 implements I1 {
|
|
>C1 : C1
|
|
>I1 : I1
|
|
|
|
IM1():void[] {return null;}
|
|
>IM1 : () => void[]
|
|
>null : null
|
|
|
|
C1M1():C1[] {return null;}
|
|
>C1M1 : () => C1[]
|
|
>C1 : C1
|
|
>null : null
|
|
}
|
|
class C2 extends C1 {
|
|
>C2 : C2
|
|
>C1 : C1
|
|
|
|
C2M1():C2[] { return null;}
|
|
>C2M1 : () => C2[]
|
|
>C2 : C2
|
|
>null : null
|
|
}
|
|
|
|
class C3 {
|
|
>C3 : C3
|
|
|
|
CM3M1() { return 3;}
|
|
>CM3M1 : () => number
|
|
>3 : 3
|
|
}
|
|
|
|
|
|
/*
|
|
|
|
This behaves unexpectedly with the following types:
|
|
|
|
Type 1 of any[]:
|
|
|
|
* Type 2 of the following throws an error but shouldn't: () => void[], SomeClass[], and {one: 1}[].
|
|
|
|
* Type 2 of the following doesn't throw an error but should: {one: 1}, new() => SomeClass, SomeClass.
|
|
|
|
*/
|
|
var a1 : any = null;
|
|
>a1 : any
|
|
>null : null
|
|
|
|
var c1 : C1 = new C1();
|
|
>c1 : C1
|
|
>C1 : C1
|
|
>new C1() : C1
|
|
>C1 : typeof C1
|
|
|
|
var i1 : I1 = c1;
|
|
>i1 : I1
|
|
>I1 : I1
|
|
>c1 : C1
|
|
|
|
var c2 : C2 = new C2();
|
|
>c2 : C2
|
|
>C2 : C2
|
|
>new C2() : C2
|
|
>C2 : typeof C2
|
|
|
|
var c3 : C3 = new C3();
|
|
>c3 : C3
|
|
>C3 : C3
|
|
>new C3() : C3
|
|
>C3 : typeof C3
|
|
|
|
var o1 = {one : 1};
|
|
>o1 : { one: number; }
|
|
>{one : 1} : { one: number; }
|
|
>one : number
|
|
>1 : 1
|
|
|
|
var f1 = function () { return new C1();}
|
|
>f1 : () => C1
|
|
>function () { return new C1();} : () => C1
|
|
>new C1() : C1
|
|
>C1 : typeof C1
|
|
|
|
var arr_any: any[] = [];
|
|
>arr_any : any[]
|
|
>[] : undefined[]
|
|
|
|
var arr_i1: I1[] = [];
|
|
>arr_i1 : I1[]
|
|
>I1 : I1
|
|
>[] : undefined[]
|
|
|
|
var arr_c1: C1[] = [];
|
|
>arr_c1 : C1[]
|
|
>C1 : C1
|
|
>[] : undefined[]
|
|
|
|
var arr_c2: C2[] = [];
|
|
>arr_c2 : C2[]
|
|
>C2 : C2
|
|
>[] : undefined[]
|
|
|
|
var arr_i1_2: I1[] = [];
|
|
>arr_i1_2 : I1[]
|
|
>I1 : I1
|
|
>[] : undefined[]
|
|
|
|
var arr_c1_2: C1[] = [];
|
|
>arr_c1_2 : C1[]
|
|
>C1 : C1
|
|
>[] : undefined[]
|
|
|
|
var arr_c2_2: C2[] = [];
|
|
>arr_c2_2 : C2[]
|
|
>C2 : C2
|
|
>[] : undefined[]
|
|
|
|
var arr_c3: C3[] = [];
|
|
>arr_c3 : C3[]
|
|
>C3 : C3
|
|
>[] : undefined[]
|
|
|
|
var i1_error: I1 = []; // should be an error - is
|
|
>i1_error : I1
|
|
>I1 : I1
|
|
>[] : undefined[]
|
|
|
|
var c1_error: C1 = []; // should be an error - is
|
|
>c1_error : C1
|
|
>C1 : C1
|
|
>[] : undefined[]
|
|
|
|
var c2_error: C2 = []; // should be an error - is
|
|
>c2_error : C2
|
|
>C2 : C2
|
|
>[] : undefined[]
|
|
|
|
var c3_error: C3 = []; // should be an error - is
|
|
>c3_error : C3
|
|
>C3 : C3
|
|
>[] : undefined[]
|
|
|
|
|
|
arr_any = arr_i1; // should be ok - is
|
|
>arr_any = arr_i1 : I1[]
|
|
>arr_any : any[]
|
|
>arr_i1 : I1[]
|
|
|
|
arr_any = arr_c1; // should be ok - is
|
|
>arr_any = arr_c1 : C1[]
|
|
>arr_any : any[]
|
|
>arr_c1 : C1[]
|
|
|
|
arr_any = arr_c2; // should be ok - is
|
|
>arr_any = arr_c2 : C2[]
|
|
>arr_any : any[]
|
|
>arr_c2 : C2[]
|
|
|
|
arr_any = arr_c3; // should be ok - is
|
|
>arr_any = arr_c3 : C3[]
|
|
>arr_any : any[]
|
|
>arr_c3 : C3[]
|
|
|
|
arr_i1 = arr_i1; // should be ok - subtype relationship - is
|
|
>arr_i1 = arr_i1 : I1[]
|
|
>arr_i1 : I1[]
|
|
>arr_i1 : I1[]
|
|
|
|
arr_i1 = arr_c1; // should be ok - subtype relationship - is
|
|
>arr_i1 = arr_c1 : C1[]
|
|
>arr_i1 : I1[]
|
|
>arr_c1 : C1[]
|
|
|
|
arr_i1 = arr_c2; // should be ok - subtype relationship - is
|
|
>arr_i1 = arr_c2 : C2[]
|
|
>arr_i1 : I1[]
|
|
>arr_c2 : C2[]
|
|
|
|
arr_i1 = arr_c3; // should be an error - is
|
|
>arr_i1 = arr_c3 : C3[]
|
|
>arr_i1 : I1[]
|
|
>arr_c3 : C3[]
|
|
|
|
arr_c1 = arr_c1; // should be ok - subtype relationship - is
|
|
>arr_c1 = arr_c1 : C1[]
|
|
>arr_c1 : C1[]
|
|
>arr_c1 : C1[]
|
|
|
|
arr_c1 = arr_c2; // should be ok - subtype relationship - is
|
|
>arr_c1 = arr_c2 : C2[]
|
|
>arr_c1 : C1[]
|
|
>arr_c2 : C2[]
|
|
|
|
arr_c1 = arr_i1; // should be an error - is
|
|
>arr_c1 = arr_i1 : I1[]
|
|
>arr_c1 : C1[]
|
|
>arr_i1 : I1[]
|
|
|
|
arr_c1 = arr_c3; // should be an error - is
|
|
>arr_c1 = arr_c3 : C3[]
|
|
>arr_c1 : C1[]
|
|
>arr_c3 : C3[]
|
|
|
|
arr_c2 = arr_c2; // should be ok - subtype relationship - is
|
|
>arr_c2 = arr_c2 : C2[]
|
|
>arr_c2 : C2[]
|
|
>arr_c2 : C2[]
|
|
|
|
arr_c2 = arr_c1; // should be an error - subtype relationship - is
|
|
>arr_c2 = arr_c1 : C1[]
|
|
>arr_c2 : C2[]
|
|
>arr_c1 : C1[]
|
|
|
|
arr_c2 = arr_i1; // should be an error - subtype relationship - is
|
|
>arr_c2 = arr_i1 : I1[]
|
|
>arr_c2 : C2[]
|
|
>arr_i1 : I1[]
|
|
|
|
arr_c2 = arr_c3; // should be an error - is
|
|
>arr_c2 = arr_c3 : C3[]
|
|
>arr_c2 : C2[]
|
|
>arr_c3 : C3[]
|
|
|
|
// "clean up bug" occurs at this point
|
|
// if you move these three expressions to another file, they raise an error
|
|
// something to do with state from the above propagating forward?
|
|
arr_c3 = arr_c2_2; // should be an error - is
|
|
>arr_c3 = arr_c2_2 : C2[]
|
|
>arr_c3 : C3[]
|
|
>arr_c2_2 : C2[]
|
|
|
|
arr_c3 = arr_c1_2; // should be an error - is
|
|
>arr_c3 = arr_c1_2 : C1[]
|
|
>arr_c3 : C3[]
|
|
>arr_c1_2 : C1[]
|
|
|
|
arr_c3 = arr_i1_2; // should be an error - is
|
|
>arr_c3 = arr_i1_2 : I1[]
|
|
>arr_c3 : C3[]
|
|
>arr_i1_2 : I1[]
|
|
|
|
arr_any = f1; // should be an error - is
|
|
>arr_any = f1 : () => C1
|
|
>arr_any : any[]
|
|
>f1 : () => C1
|
|
|
|
arr_any = o1; // should be an error - is
|
|
>arr_any = o1 : { one: number; }
|
|
>arr_any : any[]
|
|
>o1 : { one: number; }
|
|
|
|
arr_any = a1; // should be ok - is
|
|
>arr_any = a1 : any
|
|
>arr_any : any[]
|
|
>a1 : any
|
|
|
|
arr_any = c1; // should be an error - is
|
|
>arr_any = c1 : C1
|
|
>arr_any : any[]
|
|
>c1 : C1
|
|
|
|
arr_any = c2; // should be an error - is
|
|
>arr_any = c2 : C2
|
|
>arr_any : any[]
|
|
>c2 : C2
|
|
|
|
arr_any = c3; // should be an error - is
|
|
>arr_any = c3 : C3
|
|
>arr_any : any[]
|
|
>c3 : C3
|
|
|
|
arr_any = i1; // should be an error - is
|
|
>arr_any = i1 : I1
|
|
>arr_any : any[]
|
|
>i1 : I1
|
|
|