@typescript-deploys/pr-build 5.9.0-pr-58378-3 → 5.9.0-pr-61913-11

package/lib/_tsc.js

@@ -46848,40 +46848,32 @@ function createTypeChecker(host) {
     return arrayFrom(candidatesSet);
   }
   function runWithoutResolvedSignatureCaching(node, fn) {
-    const cachedResolvedSignatures = [];
-    const cachedTypes2 = [];
     node = findAncestor(node, isCallLikeOrFunctionLikeExpression);
-    if (!node) {
-      return fn();
-    }
-    while (node) {
-      const nodeLinks2 = getNodeLinks(node);
-      cachedResolvedSignatures.push([nodeLinks2, nodeLinks2.resolvedSignature, nodeLinks2.flags]);
-      nodeLinks2.resolvedSignature = void 0;
-      nodeLinks2.flags = 0 /* None */;
-      if (isFunctionExpressionOrArrowFunction(node)) {
-        resetCachedSymbolTypes(node);
-        for (const parameter of node.parameters) {
-          resetCachedSymbolTypes(parameter);
+    if (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);
       }
-      node = findAncestor(node.parent, isCallLikeOrFunctionLikeExpression);
-    }
-    const result = fn();
-    for (const [nodeLinks2, resolvedSignature, nodeCheckFlags] of cachedResolvedSignatures) {
-      nodeLinks2.resolvedSignature = resolvedSignature;
-      nodeLinks2.flags = nodeCheckFlags;
-    }
-    for (const [symbolLinks2, type] of cachedTypes2) {
-      symbolLinks2.type = type;
-    }
-    return result;
-    function resetCachedSymbolTypes(declaration) {
-      const symbolLinks2 = getSymbolLinks(getSymbolOfDeclaration(declaration));
-      const type = symbolLinks2.type;
-      cachedTypes2.push([symbolLinks2, type]);
-      symbolLinks2.type = void 0;
+      const result = fn();
+      for (const [nodeLinks2, resolvedSignature] of cachedResolvedSignatures) {
+        nodeLinks2.resolvedSignature = resolvedSignature;
+      }
+      for (const [symbolLinks2, type] of cachedTypes2) {
+        symbolLinks2.type = type;
+      }
+      return result;
     }
+    return fn();
   }
   function runWithInferenceBlockedFromSourceNode(node, fn) {
     const containingCall = findAncestor(node, isCallLikeExpression);
@@ -68421,7 +68413,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;
@@ -68493,7 +68485,7 @@ function createTypeChecker(host) {
           }
           if (!inference.isFixed) {
             const candidate = propagationType || source;
-            if (candidate === blockedStringType) {
+            if (candidate === blockedStringType || candidate.flags & 3 /* AnyOrUnknown */ && priority & 2048 /* ReturnMapper */) {
               return;
             }
             if (inference.priority === void 0 || priority < inference.priority) {
@@ -68623,7 +68615,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);
@@ -68714,7 +68706,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 */;
@@ -69042,14 +69034,14 @@ function createTypeChecker(host) {
     return candidates;
   }
   function getContravariantInference(inference) {
-    return inference.priority & 416 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
+    return inference.priority & 2464 /* 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 & 2464 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
     return getWidenedType(unwidenedType);
   }
   function getInferredType(context, index) {
@@ -75714,7 +75706,7 @@ function createTypeChecker(host) {
           }
           const returnContext = createInferenceContext(signature.typeParameters, signature, context.flags);
           const returnSourceType = instantiateType(contextualType, outerContext && createOuterReturnMapper(outerContext));
-          inferTypes(returnContext.inferences, returnSourceType, inferenceTargetType);
+          inferTypes(returnContext.inferences, returnSourceType, inferenceTargetType, 2048 /* ReturnMapper */);
           context.returnMapper = some(returnContext.inferences, hasInferenceCandidates) ? getMapperFromContext(cloneInferredPartOfContext(returnContext)) : void 0;
         }
       }

package/lib/typescript.d.ts

@@ -6894,8 +6894,9 @@ declare namespace ts {
         LiteralKeyof = 256,
         NoConstraints = 512,
         AlwaysStrict = 1024,
-        MaxValue = 2048,
-        PriorityImpliesCombination = 416,
+        ReturnMapper = 2048,
+        MaxValue = 4096,
+        PriorityImpliesCombination = 2464,
         Circularity = -1,
     }
     interface FileExtensionInfo {

package/lib/typescript.js

@@ -6643,8 +6643,9 @@ var InferencePriority = /* @__PURE__ */ ((InferencePriority2) => {
   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["ReturnMapper"] = 2048] = "ReturnMapper";
+  InferencePriority2[InferencePriority2["MaxValue"] = 4096] = "MaxValue";
+  InferencePriority2[InferencePriority2["PriorityImpliesCombination"] = 2464] = "PriorityImpliesCombination";
   InferencePriority2[InferencePriority2["Circularity"] = -1] = "Circularity";
   return InferencePriority2;
 })(InferencePriority || {});
@@ -6653,6 +6654,7 @@ var InferenceFlags = /* @__PURE__ */ ((InferenceFlags2) => {
   InferenceFlags2[InferenceFlags2["NoDefault"] = 1] = "NoDefault";
   InferenceFlags2[InferenceFlags2["AnyDefault"] = 2] = "AnyDefault";
   InferenceFlags2[InferenceFlags2["SkippedGenericFunction"] = 4] = "SkippedGenericFunction";
+  InferenceFlags2[InferenceFlags2["NoUnknownInference"] = 8] = "NoUnknownInference";
   return InferenceFlags2;
 })(InferenceFlags || {});
 var Ternary = /* @__PURE__ */ ((Ternary2) => {
@@ -51459,40 +51461,32 @@ function createTypeChecker(host) {
     return arrayFrom(candidatesSet);
   }
   function runWithoutResolvedSignatureCaching(node, fn) {
-    const cachedResolvedSignatures = [];
-    const cachedTypes2 = [];
     node = findAncestor(node, isCallLikeOrFunctionLikeExpression);
-    if (!node) {
-      return fn();
-    }
-    while (node) {
-      const nodeLinks2 = getNodeLinks(node);
-      cachedResolvedSignatures.push([nodeLinks2, nodeLinks2.resolvedSignature, nodeLinks2.flags]);
-      nodeLinks2.resolvedSignature = void 0;
-      nodeLinks2.flags = 0 /* None */;
-      if (isFunctionExpressionOrArrowFunction(node)) {
-        resetCachedSymbolTypes(node);
-        for (const parameter of node.parameters) {
-          resetCachedSymbolTypes(parameter);
+    if (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);
       }
-      node = findAncestor(node.parent, isCallLikeOrFunctionLikeExpression);
-    }
-    const result = fn();
-    for (const [nodeLinks2, resolvedSignature, nodeCheckFlags] of cachedResolvedSignatures) {
-      nodeLinks2.resolvedSignature = resolvedSignature;
-      nodeLinks2.flags = nodeCheckFlags;
-    }
-    for (const [symbolLinks2, type] of cachedTypes2) {
-      symbolLinks2.type = type;
-    }
-    return result;
-    function resetCachedSymbolTypes(declaration) {
-      const symbolLinks2 = getSymbolLinks(getSymbolOfDeclaration(declaration));
-      const type = symbolLinks2.type;
-      cachedTypes2.push([symbolLinks2, type]);
-      symbolLinks2.type = void 0;
+      const result = fn();
+      for (const [nodeLinks2, resolvedSignature] of cachedResolvedSignatures) {
+        nodeLinks2.resolvedSignature = resolvedSignature;
+      }
+      for (const [symbolLinks2, type] of cachedTypes2) {
+        symbolLinks2.type = type;
+      }
+      return result;
     }
+    return fn();
   }
   function runWithInferenceBlockedFromSourceNode(node, fn) {
     const containingCall = findAncestor(node, isCallLikeExpression);
@@ -73032,7 +73026,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;
@@ -73104,7 +73098,7 @@ function createTypeChecker(host) {
           }
           if (!inference.isFixed) {
             const candidate = propagationType || source;
-            if (candidate === blockedStringType) {
+            if (candidate === blockedStringType || candidate.flags & 3 /* AnyOrUnknown */ && priority & 2048 /* ReturnMapper */) {
               return;
             }
             if (inference.priority === void 0 || priority < inference.priority) {
@@ -73234,7 +73228,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);
@@ -73325,7 +73319,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 */;
@@ -73653,14 +73647,14 @@ function createTypeChecker(host) {
     return candidates;
   }
   function getContravariantInference(inference) {
-    return inference.priority & 416 /* PriorityImpliesCombination */ ? getIntersectionType(inference.contraCandidates) : getCommonSubtype(inference.contraCandidates);
+    return inference.priority & 2464 /* 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 & 2464 /* PriorityImpliesCombination */ ? getUnionType(baseCandidates, 2 /* Subtype */) : getCommonSupertype(baseCandidates);
     return getWidenedType(unwidenedType);
   }
   function getInferredType(context, index) {
@@ -80325,7 +80319,7 @@ function createTypeChecker(host) {
           }
           const returnContext = createInferenceContext(signature.typeParameters, signature, context.flags);
           const returnSourceType = instantiateType(contextualType, outerContext && createOuterReturnMapper(outerContext));
-          inferTypes(returnContext.inferences, returnSourceType, inferenceTargetType);
+          inferTypes(returnContext.inferences, returnSourceType, inferenceTargetType, 2048 /* ReturnMapper */);
           context.returnMapper = some(returnContext.inferences, hasInferenceCandidates) ? getMapperFromContext(cloneInferredPartOfContext(returnContext)) : void 0;
         }
       }

package/package.json

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