@typescript-deploys/pr-build 6.0.0-pr-62184-3 → 6.0.0-pr-62093-21

package/lib/_tsc.js

@@ -18,7 +18,7 @@ and limitations under the License.
 
 // src/compiler/corePublic.ts
 var versionMajorMinor = "6.0";
-var version = `${versionMajorMinor}.0-insiders.20250816`;
+var version = `${versionMajorMinor}.0-insiders.20250820`;
 
 // src/compiler/core.ts
 var emptyArray = [];
@@ -46865,11 +46865,27 @@ function createTypeChecker(host) {
   function runWithoutResolvedSignatureCaching(node, fn) {
     node = findAncestor(node, isCallLikeOrFunctionLikeExpression);
     if (node) {
-      sourceFileWithoutResolvedSignatureCaching = getSourceFileOfNode(node);
+      const cachedResolvedSignatures = [];
+      const cachedTypes2 = [];
+      while (node) {
+        const nodeLinks2 = getNodeLinks(node);
+        cachedResolvedSignatures.push([nodeLinks2, nodeLinks2.resolvedSignature]);
+        nodeLinks2.resolvedSignature = void 0;
+        if (isFunctionExpressionOrArrowFunction(node)) {
+          const symbolLinks2 = getSymbolLinks(getSymbolOfDeclaration(node));
+          const type = symbolLinks2.type;
+          cachedTypes2.push([symbolLinks2, type]);
+          symbolLinks2.type = void 0;
+        }
+        node = findAncestor(node.parent, isCallLikeOrFunctionLikeExpression);
+      }
       const result = fn();
-      sourceFileWithoutResolvedSignatureCaching = void 0;
-      symbolLinksWithoutResolvedSignatureCaching = void 0;
-      nodeLinksWithoutResolvedSignatureCaching = void 0;
+      for (const [nodeLinks2, resolvedSignature] of cachedResolvedSignatures) {
+        nodeLinks2.resolvedSignature = resolvedSignature;
+      }
+      for (const [symbolLinks2, type] of cachedTypes2) {
+        symbolLinks2.type = type;
+      }
       return result;
     }
     return fn();
@@ -47342,10 +47358,7 @@ function createTypeChecker(host) {
   var maximumSuggestionCount = 10;
   var mergedSymbols = [];
   var symbolLinks = [];
-  var symbolLinksWithoutResolvedSignatureCaching;
   var nodeLinks = [];
-  var nodeLinksWithoutResolvedSignatureCaching;
-  var sourceFileWithoutResolvedSignatureCaching;
   var flowLoopCaches = [];
   var flowLoopNodes = [];
   var flowLoopKeys = [];
@@ -47814,19 +47827,11 @@ function createTypeChecker(host) {
   function getSymbolLinks(symbol) {
     if (symbol.flags & 33554432 /* Transient */) return symbol.links;
     const id = getSymbolId(symbol);
-    if (sourceFileWithoutResolvedSignatureCaching && symbol.valueDeclaration && (isFunctionExpressionOrArrowFunction(symbol.valueDeclaration) || tryGetRootParameterDeclaration(symbol.valueDeclaration)) && getSourceFileOfNode(symbol.valueDeclaration) === sourceFileWithoutResolvedSignatureCaching) {
-      symbolLinksWithoutResolvedSignatureCaching ?? (symbolLinksWithoutResolvedSignatureCaching = []);
-      return symbolLinksWithoutResolvedSignatureCaching[id] ?? (symbolLinksWithoutResolvedSignatureCaching[id] = new SymbolLinks());
-    }
     return symbolLinks[id] ?? (symbolLinks[id] = new SymbolLinks());
   }
   function getNodeLinks(node) {
     const nodeId = getNodeId(node);
-    if (sourceFileWithoutResolvedSignatureCaching && (isCallLikeOrFunctionLikeExpression(node) || tryGetRootParameterDeclaration(node)) && getSourceFileOfNode(node) === sourceFileWithoutResolvedSignatureCaching) {
-      nodeLinksWithoutResolvedSignatureCaching ?? (nodeLinksWithoutResolvedSignatureCaching = []);
-      return nodeLinksWithoutResolvedSignatureCaching[nodeId] ?? (nodeLinksWithoutResolvedSignatureCaching[nodeId] = new NodeLinks());
-    }
-    return nodeLinks[nodeId] ?? (nodeLinks[nodeId] = new NodeLinks());
+    return nodeLinks[nodeId] || (nodeLinks[nodeId] = new NodeLinks());
   }
   function getSymbol(symbols, name, meaning) {
     if (meaning) {
@@ -62554,7 +62559,7 @@ function createTypeChecker(host) {
           context.nonFixingMapper = combineTypeMappers(context.nonFixingMapper, mapper);
         }
         if (!checkTypeDeferred) {
-          inferTypes(context.inferences, checkType, extendsType, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
+          inferTypes(context.inferences, checkType, extendsType, 1024 /* NoConstraints */ | 2048 /* AlwaysStrict */);
         }
         combinedMapper = mapper ? combineTypeMappers(context.mapper, mapper) : context.mapper;
       }
@@ -66241,7 +66246,7 @@ function createTypeChecker(host) {
               0 /* None */,
               isRelatedToWorker
             );
-            inferTypes(ctx.inferences, target2.extendsType, sourceExtends, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
+            inferTypes(ctx.inferences, target2.extendsType, sourceExtends, 1024 /* NoConstraints */ | 2048 /* AlwaysStrict */);
             sourceExtends = instantiateType(sourceExtends, ctx.mapper);
             mapper = ctx.mapper;
           }
@@ -68506,7 +68511,7 @@ function createTypeChecker(host) {
   function inferTypes(inferences, originalSource, originalTarget, priority = 0 /* None */, contravariant = false) {
     let bivariant = false;
     let propagationType;
-    let inferencePriority = 2048 /* MaxValue */;
+    let inferencePriority = 4096 /* MaxValue */;
     let visited;
     let sourceStack;
     let targetStack;
@@ -68581,13 +68586,18 @@ function createTypeChecker(host) {
             if (candidate === blockedStringType) {
               return;
             }
-            if (inference.priority === void 0 || priority < inference.priority) {
+            const combinedPriority = priority | (inference.individualPriority || 0 /* None */);
+            if (inference.priority === void 0 || priority < (inference.priority & ~512 /* DistributiveConditional */)) {
               inference.candidates = void 0;
               inference.contraCandidates = void 0;
               inference.topLevel = true;
-              inference.priority = priority;
+              inference.priority = combinedPriority;
             }
-            if (priority === inference.priority) {
+            if (priority === (inference.priority & ~512 /* DistributiveConditional */)) {
+              if (inference.priority > combinedPriority) {
+                inference.priority = combinedPriority;
+                clearCachedInferences(inferences);
+              }
               if (contravariant && !bivariant) {
                 if (!contains(inference.contraCandidates, candidate)) {
                   inference.contraCandidates = append(inference.contraCandidates, candidate);
@@ -68669,7 +68679,7 @@ function createTypeChecker(host) {
         if (isGenericMappedType(source) && isGenericMappedType(target)) {
           invokeOnce(source, target, inferFromGenericMappedTypes);
         }
-        if (!(priority & 512 /* NoConstraints */ && source.flags & (2097152 /* Intersection */ | 465829888 /* Instantiable */))) {
+        if (!(priority & 1024 /* NoConstraints */ && source.flags & (2097152 /* Intersection */ | 465829888 /* Instantiable */))) {
           const apparentSource = getApparentType(source);
           if (apparentSource !== source && !(apparentSource.flags & (524288 /* Object */ | 2097152 /* Intersection */))) {
             return inferFromTypes(apparentSource, target);
@@ -68708,7 +68718,7 @@ function createTypeChecker(host) {
       }
       (visited || (visited = /* @__PURE__ */ new Map())).set(key, -1 /* Circularity */);
       const saveInferencePriority = inferencePriority;
-      inferencePriority = 2048 /* MaxValue */;
+      inferencePriority = 4096 /* MaxValue */;
       const saveExpandingFlags = expandingFlags;
       (sourceStack ?? (sourceStack = [])).push(source);
       (targetStack ?? (targetStack = [])).push(target);
@@ -68758,7 +68768,7 @@ function createTypeChecker(host) {
       contravariant = !contravariant;
     }
     function inferFromContravariantTypesIfStrictFunctionTypes(source, target) {
-      if (strictFunctionTypes || priority & 1024 /* AlwaysStrict */) {
+      if (strictFunctionTypes || priority & 2048 /* AlwaysStrict */) {
         inferFromContravariantTypes(source, target);
       } else {
         inferFromTypes(source, target);
@@ -68799,7 +68809,7 @@ function createTypeChecker(host) {
           } else {
             for (let i = 0; i < sources.length; i++) {
               const saveInferencePriority = inferencePriority;
-              inferencePriority = 2048 /* MaxValue */;
+              inferencePriority = 4096 /* MaxValue */;
               inferFromTypes(sources[i], t);
               if (inferencePriority === priority) matched[i] = true;
               inferenceCircularity = inferenceCircularity || inferencePriority === -1 /* Circularity */;
@@ -68878,6 +68888,11 @@ function createTypeChecker(host) {
       return false;
     }
     function inferToConditionalType(source, target) {
+      const info = target.root.isDistributive ? getInferenceInfoForType(getActualTypeVariable(target.checkType)) : void 0;
+      const saveIndividualPriority = info == null ? void 0 : info.individualPriority;
+      if (info) {
+        info.individualPriority = (info.individualPriority || 0 /* None */) | 512 /* DistributiveConditional */;
+      }
       if (source.flags & 16777216 /* Conditional */) {
         inferFromTypes(source.checkType, target.checkType);
         inferFromTypes(source.extendsType, target.extendsType);
@@ -68887,6 +68902,9 @@ function createTypeChecker(host) {
         const targetTypes = [getTrueTypeFromConditionalType(target), getFalseTypeFromConditionalType(target)];
         inferToMultipleTypesWithPriority(source, targetTypes, target.flags, contravariant ? 64 /* ContravariantConditional */ : 0);
       }
+      if (info) {
+        info.individualPriority = saveIndividualPriority;
+      }
     }
     function inferToTemplateLiteralType(source, target) {
       const matches = inferTypesFromTemplateLiteralType(source, target);
@@ -69127,14 +69145,14 @@ function createTypeChecker(host) {
     return candidates;
   }
   function getContravariantInference(inference) {
-    return inference.priority & 416 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
+    return inference.priority & 928 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
   }
   function getCovariantInference(inference, signature) {
     const candidates = unionObjectAndArrayLiteralCandidates(inference.candidates);
     const primitiveConstraint = hasPrimitiveConstraint(inference.typeParameter) || isConstTypeVariable(inference.typeParameter);
     const widenLiteralTypes = !primitiveConstraint && inference.topLevel && (inference.isFixed || !isTypeParameterAtTopLevelInReturnType(signature, inference.typeParameter));
     const baseCandidates = primitiveConstraint ? sameMap(candidates, getRegularTypeOfLiteralType) : widenLiteralTypes ? sameMap(candidates, getWidenedLiteralType) : candidates;
-    const unwidenedType = inference.priority & 416 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
+    const unwidenedType = inference.priority & 928 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
     return getWidenedType(unwidenedType);
   }
   function getInferredType(context, index) {

package/lib/typescript.d.ts

@@ -6893,10 +6893,11 @@ declare namespace ts {
         ContravariantConditional = 64,
         ReturnType = 128,
         LiteralKeyof = 256,
-        NoConstraints = 512,
-        AlwaysStrict = 1024,
-        MaxValue = 2048,
-        PriorityImpliesCombination = 416,
+        DistributiveConditional = 512,
+        NoConstraints = 1024,
+        AlwaysStrict = 2048,
+        MaxValue = 4096,
+        PriorityImpliesCombination = 928,
         Circularity = -1,
     }
     interface FileExtensionInfo {

package/lib/typescript.js

@@ -2285,7 +2285,7 @@ module.exports = __toCommonJS(typescript_exports);
 
 // src/compiler/corePublic.ts
 var versionMajorMinor = "6.0";
-var version = `${versionMajorMinor}.0-insiders.20250816`;
+var version = `${versionMajorMinor}.0-insiders.20250820`;
 var Comparison = /* @__PURE__ */ ((Comparison3) => {
   Comparison3[Comparison3["LessThan"] = -1] = "LessThan";
   Comparison3[Comparison3["EqualTo"] = 0] = "EqualTo";
@@ -6641,10 +6641,11 @@ var InferencePriority = /* @__PURE__ */ ((InferencePriority2) => {
   InferencePriority2[InferencePriority2["ContravariantConditional"] = 64] = "ContravariantConditional";
   InferencePriority2[InferencePriority2["ReturnType"] = 128] = "ReturnType";
   InferencePriority2[InferencePriority2["LiteralKeyof"] = 256] = "LiteralKeyof";
-  InferencePriority2[InferencePriority2["NoConstraints"] = 512] = "NoConstraints";
-  InferencePriority2[InferencePriority2["AlwaysStrict"] = 1024] = "AlwaysStrict";
-  InferencePriority2[InferencePriority2["MaxValue"] = 2048] = "MaxValue";
-  InferencePriority2[InferencePriority2["PriorityImpliesCombination"] = 416] = "PriorityImpliesCombination";
+  InferencePriority2[InferencePriority2["DistributiveConditional"] = 512] = "DistributiveConditional";
+  InferencePriority2[InferencePriority2["NoConstraints"] = 1024] = "NoConstraints";
+  InferencePriority2[InferencePriority2["AlwaysStrict"] = 2048] = "AlwaysStrict";
+  InferencePriority2[InferencePriority2["MaxValue"] = 4096] = "MaxValue";
+  InferencePriority2[InferencePriority2["PriorityImpliesCombination"] = 928] = "PriorityImpliesCombination";
   InferencePriority2[InferencePriority2["Circularity"] = -1] = "Circularity";
   return InferencePriority2;
 })(InferencePriority || {});
@@ -51473,11 +51474,27 @@ function createTypeChecker(host) {
   function runWithoutResolvedSignatureCaching(node, fn) {
     node = findAncestor(node, isCallLikeOrFunctionLikeExpression);
     if (node) {
-      sourceFileWithoutResolvedSignatureCaching = getSourceFileOfNode(node);
+      const cachedResolvedSignatures = [];
+      const cachedTypes2 = [];
+      while (node) {
+        const nodeLinks2 = getNodeLinks(node);
+        cachedResolvedSignatures.push([nodeLinks2, nodeLinks2.resolvedSignature]);
+        nodeLinks2.resolvedSignature = void 0;
+        if (isFunctionExpressionOrArrowFunction(node)) {
+          const symbolLinks2 = getSymbolLinks(getSymbolOfDeclaration(node));
+          const type = symbolLinks2.type;
+          cachedTypes2.push([symbolLinks2, type]);
+          symbolLinks2.type = void 0;
+        }
+        node = findAncestor(node.parent, isCallLikeOrFunctionLikeExpression);
+      }
       const result = fn();
-      sourceFileWithoutResolvedSignatureCaching = void 0;
-      symbolLinksWithoutResolvedSignatureCaching = void 0;
-      nodeLinksWithoutResolvedSignatureCaching = void 0;
+      for (const [nodeLinks2, resolvedSignature] of cachedResolvedSignatures) {
+        nodeLinks2.resolvedSignature = resolvedSignature;
+      }
+      for (const [symbolLinks2, type] of cachedTypes2) {
+        symbolLinks2.type = type;
+      }
       return result;
     }
     return fn();
@@ -51950,10 +51967,7 @@ function createTypeChecker(host) {
   var maximumSuggestionCount = 10;
   var mergedSymbols = [];
   var symbolLinks = [];
-  var symbolLinksWithoutResolvedSignatureCaching;
   var nodeLinks = [];
-  var nodeLinksWithoutResolvedSignatureCaching;
-  var sourceFileWithoutResolvedSignatureCaching;
   var flowLoopCaches = [];
   var flowLoopNodes = [];
   var flowLoopKeys = [];
@@ -52422,19 +52436,11 @@ function createTypeChecker(host) {
   function getSymbolLinks(symbol) {
     if (symbol.flags & 33554432 /* Transient */) return symbol.links;
     const id = getSymbolId(symbol);
-    if (sourceFileWithoutResolvedSignatureCaching && symbol.valueDeclaration && (isFunctionExpressionOrArrowFunction(symbol.valueDeclaration) || tryGetRootParameterDeclaration(symbol.valueDeclaration)) && getSourceFileOfNode(symbol.valueDeclaration) === sourceFileWithoutResolvedSignatureCaching) {
-      symbolLinksWithoutResolvedSignatureCaching ?? (symbolLinksWithoutResolvedSignatureCaching = []);
-      return symbolLinksWithoutResolvedSignatureCaching[id] ?? (symbolLinksWithoutResolvedSignatureCaching[id] = new SymbolLinks());
-    }
     return symbolLinks[id] ?? (symbolLinks[id] = new SymbolLinks());
   }
   function getNodeLinks(node) {
     const nodeId = getNodeId(node);
-    if (sourceFileWithoutResolvedSignatureCaching && (isCallLikeOrFunctionLikeExpression(node) || tryGetRootParameterDeclaration(node)) && getSourceFileOfNode(node) === sourceFileWithoutResolvedSignatureCaching) {
-      nodeLinksWithoutResolvedSignatureCaching ?? (nodeLinksWithoutResolvedSignatureCaching = []);
-      return nodeLinksWithoutResolvedSignatureCaching[nodeId] ?? (nodeLinksWithoutResolvedSignatureCaching[nodeId] = new NodeLinks());
-    }
-    return nodeLinks[nodeId] ?? (nodeLinks[nodeId] = new NodeLinks());
+    return nodeLinks[nodeId] || (nodeLinks[nodeId] = new NodeLinks());
   }
   function getSymbol2(symbols, name, meaning) {
     if (meaning) {
@@ -67162,7 +67168,7 @@ function createTypeChecker(host) {
           context.nonFixingMapper = combineTypeMappers(context.nonFixingMapper, mapper);
         }
         if (!checkTypeDeferred) {
-          inferTypes(context.inferences, checkType, extendsType, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
+          inferTypes(context.inferences, checkType, extendsType, 1024 /* NoConstraints */ | 2048 /* AlwaysStrict */);
         }
         combinedMapper = mapper ? combineTypeMappers(context.mapper, mapper) : context.mapper;
       }
@@ -70849,7 +70855,7 @@ function createTypeChecker(host) {
               0 /* None */,
               isRelatedToWorker
             );
-            inferTypes(ctx.inferences, target2.extendsType, sourceExtends, 512 /* NoConstraints */ | 1024 /* AlwaysStrict */);
+            inferTypes(ctx.inferences, target2.extendsType, sourceExtends, 1024 /* NoConstraints */ | 2048 /* AlwaysStrict */);
             sourceExtends = instantiateType(sourceExtends, ctx.mapper);
             mapper = ctx.mapper;
           }
@@ -73114,7 +73120,7 @@ function createTypeChecker(host) {
   function inferTypes(inferences, originalSource, originalTarget, priority = 0 /* None */, contravariant = false) {
     let bivariant = false;
     let propagationType;
-    let inferencePriority = 2048 /* MaxValue */;
+    let inferencePriority = 4096 /* MaxValue */;
     let visited;
     let sourceStack;
     let targetStack;
@@ -73189,13 +73195,18 @@ function createTypeChecker(host) {
             if (candidate === blockedStringType) {
               return;
             }
-            if (inference.priority === void 0 || priority < inference.priority) {
+            const combinedPriority = priority | (inference.individualPriority || 0 /* None */);
+            if (inference.priority === void 0 || priority < (inference.priority & ~512 /* DistributiveConditional */)) {
               inference.candidates = void 0;
               inference.contraCandidates = void 0;
               inference.topLevel = true;
-              inference.priority = priority;
+              inference.priority = combinedPriority;
             }
-            if (priority === inference.priority) {
+            if (priority === (inference.priority & ~512 /* DistributiveConditional */)) {
+              if (inference.priority > combinedPriority) {
+                inference.priority = combinedPriority;
+                clearCachedInferences(inferences);
+              }
               if (contravariant && !bivariant) {
                 if (!contains(inference.contraCandidates, candidate)) {
                   inference.contraCandidates = append(inference.contraCandidates, candidate);
@@ -73277,7 +73288,7 @@ function createTypeChecker(host) {
         if (isGenericMappedType(source) && isGenericMappedType(target)) {
           invokeOnce(source, target, inferFromGenericMappedTypes);
         }
-        if (!(priority & 512 /* NoConstraints */ && source.flags & (2097152 /* Intersection */ | 465829888 /* Instantiable */))) {
+        if (!(priority & 1024 /* NoConstraints */ && source.flags & (2097152 /* Intersection */ | 465829888 /* Instantiable */))) {
           const apparentSource = getApparentType(source);
           if (apparentSource !== source && !(apparentSource.flags & (524288 /* Object */ | 2097152 /* Intersection */))) {
             return inferFromTypes(apparentSource, target);
@@ -73316,7 +73327,7 @@ function createTypeChecker(host) {
       }
       (visited || (visited = /* @__PURE__ */ new Map())).set(key, -1 /* Circularity */);
       const saveInferencePriority = inferencePriority;
-      inferencePriority = 2048 /* MaxValue */;
+      inferencePriority = 4096 /* MaxValue */;
       const saveExpandingFlags = expandingFlags;
       (sourceStack ?? (sourceStack = [])).push(source);
       (targetStack ?? (targetStack = [])).push(target);
@@ -73366,7 +73377,7 @@ function createTypeChecker(host) {
       contravariant = !contravariant;
     }
     function inferFromContravariantTypesIfStrictFunctionTypes(source, target) {
-      if (strictFunctionTypes || priority & 1024 /* AlwaysStrict */) {
+      if (strictFunctionTypes || priority & 2048 /* AlwaysStrict */) {
         inferFromContravariantTypes(source, target);
       } else {
         inferFromTypes(source, target);
@@ -73407,7 +73418,7 @@ function createTypeChecker(host) {
           } else {
             for (let i = 0; i < sources.length; i++) {
               const saveInferencePriority = inferencePriority;
-              inferencePriority = 2048 /* MaxValue */;
+              inferencePriority = 4096 /* MaxValue */;
               inferFromTypes(sources[i], t);
               if (inferencePriority === priority) matched[i] = true;
               inferenceCircularity = inferenceCircularity || inferencePriority === -1 /* Circularity */;
@@ -73486,6 +73497,11 @@ function createTypeChecker(host) {
       return false;
     }
     function inferToConditionalType(source, target) {
+      const info = target.root.isDistributive ? getInferenceInfoForType(getActualTypeVariable(target.checkType)) : void 0;
+      const saveIndividualPriority = info == null ? void 0 : info.individualPriority;
+      if (info) {
+        info.individualPriority = (info.individualPriority || 0 /* None */) | 512 /* DistributiveConditional */;
+      }
       if (source.flags & 16777216 /* Conditional */) {
         inferFromTypes(source.checkType, target.checkType);
         inferFromTypes(source.extendsType, target.extendsType);
@@ -73495,6 +73511,9 @@ function createTypeChecker(host) {
         const targetTypes = [getTrueTypeFromConditionalType(target), getFalseTypeFromConditionalType(target)];
         inferToMultipleTypesWithPriority(source, targetTypes, target.flags, contravariant ? 64 /* ContravariantConditional */ : 0);
       }
+      if (info) {
+        info.individualPriority = saveIndividualPriority;
+      }
     }
     function inferToTemplateLiteralType(source, target) {
       const matches = inferTypesFromTemplateLiteralType(source, target);
@@ -73735,14 +73754,14 @@ function createTypeChecker(host) {
     return candidates;
   }
   function getContravariantInference(inference) {
-    return inference.priority & 416 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
+    return inference.priority & 928 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
   }
   function getCovariantInference(inference, signature) {
     const candidates = unionObjectAndArrayLiteralCandidates(inference.candidates);
     const primitiveConstraint = hasPrimitiveConstraint(inference.typeParameter) || isConstTypeVariable(inference.typeParameter);
     const widenLiteralTypes = !primitiveConstraint && inference.topLevel && (inference.isFixed || !isTypeParameterAtTopLevelInReturnType(signature, inference.typeParameter));
     const baseCandidates = primitiveConstraint ? sameMap(candidates, getRegularTypeOfLiteralType) : widenLiteralTypes ? sameMap(candidates, getWidenedLiteralType) : candidates;
-    const unwidenedType = inference.priority & 416 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
+    const unwidenedType = inference.priority & 928 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
     return getWidenedType(unwidenedType);
   }
   function getInferredType(context, index) {

package/package.json

@@ -2,7 +2,7 @@
   "name": "@typescript-deploys/pr-build",
   "author": "Microsoft Corp.",
   "homepage": "https://www.typescriptlang.org/",
-  "version": "6.0.0-pr-62184-3",
+  "version": "6.0.0-pr-62093-21",
   "license": "Apache-2.0",
   "description": "TypeScript is a language for application scale JavaScript development",
   "keywords": [