JavaScriptPlugins
diff --git a/‎src/compiler/checker.ts‎
Lines changed: 1 addition & 1 deletion b/‎src/compiler/checker.ts‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/compiler/core.ts‎
Lines changed: 22 additions & 1 deletion b/‎src/compiler/core.ts‎
Lines changed: 22 additions & 1 deletion
diff --git a/‎src/compiler/emitter.ts‎
Lines changed: 49 additions & 243 deletions b/‎src/compiler/emitter.ts‎
Lines changed: 49 additions & 243 deletions
@@ -19034,7 +19034,7 @@ namespace ts {
 
         function isNameOfModuleOrEnumDeclaration(node: Identifier) {
             const parent = node.parent;
-            return isModuleOrEnumDeclaration(parent) && node === parent.name;
+            return parent && isModuleOrEnumDeclaration(parent) && node === parent.name;
         }
 
         // When resolved as an expression identifier, if the given node references an exported entity, return the declaration
 
@@ -538,7 +538,7 @@ namespace ts {
      */
     export function append<T>(to: T[] | undefined, value: T | undefined): T[] | undefined {
         if (value === undefined) return to;
-        if (to === undefined) to = [];
+        if (to === undefined) return [value];
         to.push(value);
         return to;
     }
@@ -559,6 +559,16 @@ namespace ts {
         return to;
     }
 
+    /**
+     * Stable sort of an array. Elements equal to each other maintain their relative position in the array.
+     */
+    export function stableSort<T>(array: T[], comparer: (x: T, y: T) => Comparison = compareValues) {
+        return array
+            .map((_, i) => i) // create array of indices
+            .sort((x, y) => comparer(array[x], array[y]) || compareValues(x, y)) // sort indices by value then position
+            .map(i => array[i]); // get sorted array
+    }
+
     export function rangeEquals<T>(array1: T[], array2: T[], pos: number, end: number) {
         while (pos < end) {
             if (array1[pos] !== array2[pos]) {
@@ -2022,6 +2032,17 @@ namespace ts {
     }
 
     /** Remove an item from an array, moving everything to its right one space left. */
+    export function orderedRemoveItem<T>(array: T[], item: T): boolean {
+        for (let i = 0; i < array.length; i++) {
+            if (array[i] === item) {
+                orderedRemoveItemAt(array, i);
+                return true;
+            }
+        }
+        return false;
+    }
+
+    /** Remove an item by index from an array, moving everything to its right one space left. */
     export function orderedRemoveItemAt<T>(array: T[], index: number): void {
         // This seems to be faster than either `array.splice(i, 1)` or `array.copyWithin(i, i+ 1)`.
         for (let i = index; i < array.length - 1; i++) {
Original file line number	Diff line number	Diff line change
`@@ -19034,7 +19034,7 @@ namespace ts {`
`19034`	`19034`
`19035`	`19035`	`function isNameOfModuleOrEnumDeclaration(node: Identifier) {`
`19036`	`19036`	`const parent = node.parent;`
`19037`		`- return isModuleOrEnumDeclaration(parent) && node === parent.name;`
	`19037`	`+ return parent && isModuleOrEnumDeclaration(parent) && node === parent.name;`
`19038`	`19038`	`}`
`19039`	`19039`
`19040`	`19040`	`// When resolved as an expression identifier, if the given node references an exported entity, return the declaration`