typescript 5.6.0-dev.20240618 → 5.6.0-dev.20240619

package/lib/tsc.js

@@ -18,16 +18,16 @@ and limitations under the License.
 
 // src/compiler/corePublic.ts
 var versionMajorMinor = "5.6";
-var version = `${versionMajorMinor}.0-dev.20240618`;
+var version = `${versionMajorMinor}.0-dev.20240619`;
 
 // src/compiler/core.ts
 var emptyArray = [];
 var emptyMap = /* @__PURE__ */ new Map();
 function length(array) {
-  return array ? array.length : 0;
+  return array !== void 0 ? array.length : 0;
 }
 function forEach(array, callback) {
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const result = callback(array[i], i);
       if (result) {
@@ -78,7 +78,7 @@ function zipWith(arrayA, arrayB, callback) {
   return result;
 }
 function every(array, callback) {
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       if (!callback(array[i], i)) {
         return false;
@@ -126,20 +126,17 @@ function findLastIndex(array, predicate, startIndex) {
   return -1;
 }
 function contains(array, value, equalityComparer = equateValues) {
-  if (array) {
-    for (const v of array) {
-      if (equalityComparer(v, value)) {
+  if (array !== void 0) {
+    for (let i = 0; i < array.length; i++) {
+      if (equalityComparer(array[i], value)) {
         return true;
       }
     }
   }
   return false;
 }
-function arraysEqual(a, b, equalityComparer = equateValues) {
-  return a.length === b.length && a.every((x, i) => equalityComparer(x, b[i]));
-}
 function indexOfAnyCharCode(text, charCodes, start) {
-  for (let i = start || 0; i < text.length; i++) {
+  for (let i = start ?? 0; i < text.length; i++) {
     if (contains(charCodes, text.charCodeAt(i))) {
       return i;
     }
@@ -148,7 +145,7 @@ function indexOfAnyCharCode(text, charCodes, start) {
 }
 function countWhere(array, predicate) {
   let count = 0;
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const v = array[i];
       if (predicate(v, i)) {
@@ -159,7 +156,7 @@ function countWhere(array, predicate) {
   return count;
 }
 function filter(array, f) {
-  if (array) {
+  if (array !== void 0) {
     const len = array.length;
     let i = 0;
     while (i < len && f(array[i])) i++;
@@ -193,7 +190,7 @@ function clear(array) {
 }
 function map(array, f) {
   let result;
-  if (array) {
+  if (array !== void 0) {
     result = [];
     for (let i = 0; i < array.length; i++) {
       result.push(f(array[i], i));
@@ -207,7 +204,7 @@ function* mapIterator(iter, mapFn) {
   }
 }
 function sameMap(array, f) {
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const item = array[i];
       const mapped = f(item, i);
@@ -225,7 +222,8 @@ function sameMap(array, f) {
 }
 function flatten(array) {
   const result = [];
-  for (const v of array) {
+  for (let i = 0; i < array.length; i++) {
+    const v = array[i];
     if (v) {
       if (isArray(v)) {
         addRange(result, v);
@@ -238,7 +236,7 @@ function flatten(array) {
 }
 function flatMap(array, mapfn) {
   let result;
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const v = mapfn(array[i], i);
       if (v) {
@@ -250,11 +248,11 @@ function flatMap(array, mapfn) {
       }
     }
   }
-  return result || emptyArray;
+  return result ?? emptyArray;
 }
 function flatMapToMutable(array, mapfn) {
   const result = [];
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const v = mapfn(array[i], i);
       if (v) {
@@ -270,7 +268,7 @@ function flatMapToMutable(array, mapfn) {
 }
 function sameFlatMap(array, mapfn) {
   let result;
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const item = array[i];
       const mapped = mapfn(item, i);
@@ -286,11 +284,11 @@ function sameFlatMap(array, mapfn) {
       }
     }
   }
-  return result || array;
+  return result ?? array;
 }
 function mapDefined(array, mapFn) {
   const result = [];
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const mapped = mapFn(array[i], i);
       if (mapped !== void 0) {
@@ -325,7 +323,7 @@ function tryAddToSet(set, value) {
 }
 function spanMap(array, keyfn, mapfn) {
   let result;
-  if (array) {
+  if (array !== void 0) {
     result = [];
     const len = array.length;
     let previousKey;
@@ -357,10 +355,10 @@ function spanMap(array, keyfn, mapfn) {
   return result;
 }
 function some(array, predicate) {
-  if (array) {
-    if (predicate) {
-      for (const v of array) {
-        if (predicate(v)) {
+  if (array !== void 0) {
+    if (predicate !== void 0) {
+      for (let i = 0; i < array.length; i++) {
+        if (predicate(array[i])) {
           return true;
         }
       }
@@ -385,8 +383,8 @@ function getRangesWhere(arr, pred, cb) {
   if (start !== void 0) cb(start, arr.length);
 }
 function concatenate(array1, array2) {
-  if (!some(array2)) return array1;
-  if (!some(array1)) return array2;
+  if (array2 === void 0 || array2.length === 0) return array1;
+  if (array1 === void 0 || array1.length === 0) return array2;
   return [...array1, ...array2];
 }
 function selectIndex(_, i) {
@@ -413,8 +411,8 @@ function deduplicateRelational(array, equalityComparer, comparer) {
 }
 function deduplicateEquality(array, equalityComparer) {
   const result = [];
-  for (const item of array) {
-    pushIfUnique(result, item, equalityComparer);
+  for (let i = 0; i < array.length; i++) {
+    pushIfUnique(result, array[i], equalityComparer);
   }
   return result;
 }
@@ -465,10 +463,10 @@ function insertSorted(array, insert, compare, equalityComparer, allowDuplicates)
   return false;
 }
 function sortAndDeduplicate(array, comparer, equalityComparer) {
-  return deduplicateSorted(sort(array, comparer), equalityComparer || comparer || compareStringsCaseSensitive);
+  return deduplicateSorted(sort(array, comparer), equalityComparer ?? comparer ?? compareStringsCaseSensitive);
 }
 function arrayIsEqualTo(array1, array2, equalityComparer = equateValues) {
-  if (!array1 || !array2) {
+  if (array1 === void 0 || array2 === void 0) {
     return array1 === array2;
   }
   if (array1.length !== array2.length) {
@@ -483,20 +481,18 @@ function arrayIsEqualTo(array1, array2, equalityComparer = equateValues) {
 }
 function compact(array) {
   let result;
-  if (array) {
+  if (array !== void 0) {
     for (let i = 0; i < array.length; i++) {
       const v = array[i];
-      if (result || !v) {
-        if (!result) {
-          result = array.slice(0, i);
-        }
+      if (result ?? !v) {
+        result ?? (result = array.slice(0, i));
         if (v) {
           result.push(v);
         }
       }
     }
   }
-  return result || array;
+  return result ?? array;
 }
 function relativeComplement(arrayA, arrayB, comparer) {
   if (!arrayB || !arrayA || arrayB.length === 0 || arrayA.length === 0) return arrayB;
@@ -554,7 +550,7 @@ function pushIfUnique(array, toAdd, equalityComparer) {
   }
 }
 function appendIfUnique(array, toAdd, equalityComparer) {
-  if (array) {
+  if (array !== void 0) {
     pushIfUnique(array, toAdd, equalityComparer);
     return array;
   } else {
@@ -582,7 +578,7 @@ function rangeEquals(array1, array2, pos, end) {
   return true;
 }
 var elementAt = !!Array.prototype.at ? (array, offset) => array == null ? void 0 : array.at(offset) : (array, offset) => {
-  if (array) {
+  if (array !== void 0) {
     offset = toOffset(array, offset);
     if (offset < array.length) {
       return array[offset];
@@ -594,7 +590,7 @@ function firstOrUndefined(array) {
   return array === void 0 || array.length === 0 ? void 0 : array[0];
 }
 function firstOrUndefinedIterator(iter) {
-  if (iter) {
+  if (iter !== void 0) {
     for (const value of iter) {
       return value;
     }
@@ -619,10 +615,10 @@ function last(array) {
   return array[array.length - 1];
 }
 function singleOrUndefined(array) {
-  return array && array.length === 1 ? array[0] : void 0;
+  return array !== void 0 && array.length === 1 ? array[0] : void 0;
 }
 function singleOrMany(array) {
-  return array && array.length === 1 ? array[0] : array;
+  return array !== void 0 && array.length === 1 ? array[0] : array;
 }
 function replaceElement(array, index, value) {
   const result = array.slice(0);
@@ -636,7 +632,7 @@ function binarySearchKey(array, key, keySelector, keyComparer, offset) {
   if (!some(array)) {
     return -1;
   }
-  let low = offset || 0;
+  let low = offset ?? 0;
   let high = array.length - 1;
   while (low <= high) {
     const middle = low + (high - low >> 1);
@@ -741,7 +737,8 @@ function equalOwnProperties(left, right, equalityComparer = equateValues) {
 }
 function arrayToMap(array, makeKey, makeValue = identity) {
   const result = /* @__PURE__ */ new Map();
-  for (const value of array) {
+  for (let i = 0; i < array.length; i++) {
+    const value = array[i];
     const key = makeKey(value);
     if (key !== void 0) result.set(key, makeValue(value));
   }
@@ -749,7 +746,8 @@ function arrayToMap(array, makeKey, makeValue = identity) {
 }
 function arrayToMultiMap(values, makeKey, makeValue = identity) {
   const result = createMultiMap();
-  for (const value of values) {
+  for (let i = 0; i < values.length; i++) {
+    const value = values[i];
     result.add(makeKey(value), makeValue(value));
   }
   return result;
@@ -759,8 +757,9 @@ function group(values, getGroupId, resultSelector = identity) {
 }
 function groupBy(values, keySelector) {
   const result = {};
-  if (values) {
-    for (const value of values) {
+  if (values !== void 0) {
+    for (let i = 0; i < values.length; i++) {
+      const value = values[i];
       const key = `${keySelector(value)}`;
       const array = result[key] ?? (result[key] = []);
       array.push(value);
@@ -790,7 +789,7 @@ function copyProperties(first2, second) {
   }
 }
 function maybeBind(obj, fn) {
-  return fn ? fn.bind(obj) : void 0;
+  return fn == null ? void 0 : fn.bind(obj);
 }
 function createMultiMap() {
   const map2 = /* @__PURE__ */ new Map();
@@ -800,7 +799,7 @@ function createMultiMap() {
 }
 function multiMapAdd(key, value) {
   let values = this.get(key);
-  if (values) {
+  if (values !== void 0) {
     values.push(value);
   } else {
     this.set(key, values = [value]);
@@ -809,7 +808,7 @@ function multiMapAdd(key, value) {
 }
 function multiMapRemove(key, value) {
   const values = this.get(key);
-  if (values) {
+  if (values !== void 0) {
     unorderedRemoveItem(values, value);
     if (!values.length) {
       this.delete(key);
@@ -817,7 +816,7 @@ function multiMapRemove(key, value) {
   }
 }
 function createQueue(items) {
-  const elements = (items == null ? void 0 : items.slice()) || [];
+  const elements = (items == null ? void 0 : items.slice()) ?? [];
   let headIndex = 0;
   function isEmpty() {
     return headIndex === elements.length;
@@ -931,6 +930,12 @@ function compareComparableValues(a, b) {
 function compareValues(a, b) {
   return compareComparableValues(a, b);
 }
+function maxBy(arr, init, mapper) {
+  for (let i = 0; i < arr.length; i++) {
+    init = Math.max(init, mapper(arr[i]));
+  }
+  return init;
+}
 function min(items, compare) {
   return reduceLeft(items, (x, y) => compare(x, y) === -1 /* LessThan */ ? x : y);
 }
@@ -1076,7 +1081,8 @@ function matchedText(pattern, candidate) {
 function findBestPatternMatch(values, getPattern, candidate) {
   let matchedValue;
   let longestMatchPrefixLength = -1;
-  for (const v of values) {
+  for (let i = 0; i < values.length; i++) {
+    const v = values[i];
     const pattern = getPattern(v);
     if (isPatternMatch(pattern, candidate) && pattern.prefix.length > longestMatchPrefixLength) {
       longestMatchPrefixLength = pattern.prefix.length;
@@ -1118,7 +1124,7 @@ function singleElementArray(t) {
   return t === void 0 ? void 0 : [t];
 }
 function enumerateInsertsAndDeletes(newItems, oldItems, comparer, inserted, deleted, unchanged) {
-  unchanged = unchanged || noop;
+  unchanged ?? (unchanged = noop);
   let newIndex = 0;
   let oldIndex = 0;
   const newLen = newItems.length;
@@ -1180,7 +1186,7 @@ function cartesianProductWorker(arrays, result, outer, index) {
   }
 }
 function takeWhile(array, predicate) {
-  if (array) {
+  if (array !== void 0) {
     const len = array.length;
     let index = 0;
     while (index < len && predicate(array[index])) {
@@ -1190,7 +1196,7 @@ function takeWhile(array, predicate) {
   }
 }
 function skipWhile(array, predicate) {
-  if (array) {
+  if (array !== void 0) {
     const len = array.length;
     let index = 0;
     while (index < len && predicate(array[index])) {
@@ -2107,7 +2113,7 @@ m2: ${this.mapper2.__debugToString().split("\n").join("\n    ")}`;
     }
     function renderGraph() {
       const columnCount = columnWidths.length;
-      const laneCount = nodes.reduce((x, n) => Math.max(x, n.lane), 0) + 1;
+      const laneCount = maxBy(nodes, 0, (n) => n.lane) + 1;
       const lanes = fill(Array(laneCount), "");
       const grid = columnWidths.map(() => Array(laneCount));
       const connectors = columnWidths.map(() => fill(Array(laneCount), 0));
@@ -8115,7 +8121,7 @@ function computePositionOfLineAndCharacter(lineStarts, line, character, debugTex
     if (allowEdits) {
       line = line < 0 ? 0 : line >= lineStarts.length ? lineStarts.length - 1 : line;
     } else {
-      Debug.fail(`Bad line number. Line: ${line}, lineStarts.length: ${lineStarts.length} , line map is correct? ${debugText !== void 0 ? arraysEqual(lineStarts, computeLineStarts(debugText)) : "unknown"}`);
+      Debug.fail(`Bad line number. Line: ${line}, lineStarts.length: ${lineStarts.length} , line map is correct? ${debugText !== void 0 ? arrayIsEqualTo(lineStarts, computeLineStarts(debugText)) : "unknown"}`);
     }
   }
   const res = lineStarts[line] + character;
@@ -37513,9 +37519,7 @@ function convertToTSConfig(configParseResult, configFileName, host) {
   return config;
 }
 function optionMapToObject(optionMap) {
-  return {
-    ...arrayFrom(optionMap.entries()).reduce((prev, cur) => ({ ...prev, [cur[0]]: cur[1] }), {})
-  };
+  return Object.fromEntries(optionMap);
 }
 function filterSameAsDefaultInclude(specs) {
   if (!length(specs)) return void 0;
@@ -66420,7 +66424,7 @@ function createTypeChecker(host) {
     return false;
   }
   function inferTypesFromTemplateLiteralType(source, target) {
-    return source.flags & 128 /* StringLiteral */ ? inferFromLiteralPartsToTemplateLiteral([source.value], emptyArray, target) : source.flags & 134217728 /* TemplateLiteral */ ? arraysEqual(source.texts, target.texts) ? map(source.types, (s, i) => {
+    return source.flags & 128 /* StringLiteral */ ? inferFromLiteralPartsToTemplateLiteral([source.value], emptyArray, target) : source.flags & 134217728 /* TemplateLiteral */ ? arrayIsEqualTo(source.texts, target.texts) ? map(source.types, (s, i) => {
       return isTypeAssignableTo(getBaseConstraintOrType(s), getBaseConstraintOrType(target.types[i])) ? s : getStringLikeTypeForType(s);
     }) : inferFromLiteralPartsToTemplateLiteral(source.texts, source.types, target) : void 0;
   }
@@ -68584,7 +68588,7 @@ function createTypeChecker(host) {
         return getEvolvingArrayType(getUnionType(map(types, getElementTypeOfEvolvingArrayType)));
       }
       const result = recombineUnknownType(getUnionType(sameMap(types, finalizeEvolvingArrayType), subtypeReduction));
-      if (result !== declaredType && result.flags & declaredType.flags & 1048576 /* Union */ && arraysEqual(result.types, declaredType.types)) {
+      if (result !== declaredType && result.flags & declaredType.flags & 1048576 /* Union */ && arrayIsEqualTo(result.types, declaredType.types)) {
         return declaredType;
       }
       return result;
@@ -120132,7 +120136,7 @@ function createProgram(rootNamesOrOptions, _options, _host, _oldProgram, _config
     if (file.hasNoDefaultLib) {
       return true;
     }
-    if (!options.noLib) {
+    if (options.noLib) {
       return false;
     }
     const equalityComparer = host.useCaseSensitiveFileNames() ? equateStringsCaseSensitive : equateStringsCaseInsensitive;
@@ -125450,7 +125454,7 @@ function createTabularErrorsDisplay(filesInError, host) {
   if (distinctFiles.length === 0) return "";
   const numberLength = (num) => Math.log(num) * Math.LOG10E + 1;
   const fileToErrorCount = distinctFiles.map((file) => [file, countWhere(filesInError, (fileInError) => fileInError.fileName === file.fileName)]);
-  const maxErrors = fileToErrorCount.reduce((acc, value) => Math.max(acc, value[1] || 0), 0);
+  const maxErrors = maxBy(fileToErrorCount, 0, (value) => value[1]);
   const headerRow = Diagnostics.Errors_Files.message;
   const leftColumnHeadingLength = headerRow.split(" ")[0].length;
   const leftPaddingGoal = Math.max(leftColumnHeadingLength, numberLength(maxErrors));