@typescript-deploys/pr-build 5.2.0-pr-54795-7 → 5.2.0-pr-53647-17

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (5) hide show
  1. package/lib/tsc.js +19 -16
  2. package/lib/tsserver.js +19 -16
  3. package/lib/tsserverlibrary.js +19 -16
  4. package/lib/typescript.js +19 -16
  5. package/package.json +2 -2
package/lib/tsc.js CHANGED
@@ -43746,7 +43746,7 @@ function createTypeChecker(host) {
43746
43746
  };
43747
43747
  var amalgamatedDuplicates;
43748
43748
  var reverseMappedCache = /* @__PURE__ */ new Map();
43749
- var inInferTypeForHomomorphicMappedType = false;
43749
+ var homomorphicMappedTypeInferenceStack = [];
43750
43750
  var ambientModulesCache;
43751
43751
  var patternAmbientModules;
43752
43752
  var patternAmbientModuleAugmentations;
@@ -62100,7 +62100,7 @@ function createTypeChecker(host) {
62100
62100
  }
62101
62101
  }
62102
62102
  }
62103
- const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i])) : target;
62103
+ const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i]), 0 /* None */) : target;
62104
62104
  return filtered.flags & 131072 /* Never */ ? target : filtered;
62105
62105
  }
62106
62106
  function isWeakType(type) {
@@ -63134,17 +63134,18 @@ function createTypeChecker(host) {
63134
63134
  );
63135
63135
  }
63136
63136
  function inferTypeForHomomorphicMappedType(source, target, constraint) {
63137
- if (inInferTypeForHomomorphicMappedType) {
63138
- return void 0;
63137
+ const cacheKey = source.id + "," + target.id + "," + constraint.id;
63138
+ if (reverseMappedCache.has(cacheKey)) {
63139
+ return reverseMappedCache.get(cacheKey);
63139
63140
  }
63140
- const key = source.id + "," + target.id + "," + constraint.id;
63141
- if (reverseMappedCache.has(key)) {
63142
- return reverseMappedCache.get(key);
63141
+ const recursionKey = source.id + "," + (target.target || target).id;
63142
+ if (contains(homomorphicMappedTypeInferenceStack, recursionKey)) {
63143
+ return void 0;
63143
63144
  }
63144
- inInferTypeForHomomorphicMappedType = true;
63145
+ homomorphicMappedTypeInferenceStack.push(recursionKey);
63145
63146
  const type = createReverseMappedType(source, target, constraint);
63146
- inInferTypeForHomomorphicMappedType = false;
63147
- reverseMappedCache.set(key, type);
63147
+ homomorphicMappedTypeInferenceStack.pop();
63148
+ reverseMappedCache.set(cacheKey, type);
63148
63149
  return type;
63149
63150
  }
63150
63151
  function isPartiallyInferableType(type) {
@@ -65601,12 +65602,14 @@ function createTypeChecker(host) {
65601
65602
  return narrowTypeByPrivateIdentifierInInExpression(type, expr, assumeTrue);
65602
65603
  }
65603
65604
  const target = getReferenceCandidate(expr.right);
65604
- let leftType;
65605
- if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */ && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
65606
- return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
65607
- }
65608
- if (isMatchingReference(reference, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */) {
65609
- return narrowTypeByInKeyword(type, leftType, assumeTrue);
65605
+ const leftType = getTypeOfExpression(expr.left);
65606
+ if (leftType.flags & 8576 /* StringOrNumberLiteralOrUnique */) {
65607
+ if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
65608
+ return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
65609
+ }
65610
+ if (isMatchingReference(reference, target)) {
65611
+ return narrowTypeByInKeyword(type, leftType, assumeTrue);
65612
+ }
65610
65613
  }
65611
65614
  break;
65612
65615
  case 28 /* CommaToken */:
package/lib/tsserver.js CHANGED
@@ -48422,7 +48422,7 @@ function createTypeChecker(host) {
48422
48422
  };
48423
48423
  var amalgamatedDuplicates;
48424
48424
  var reverseMappedCache = /* @__PURE__ */ new Map();
48425
- var inInferTypeForHomomorphicMappedType = false;
48425
+ var homomorphicMappedTypeInferenceStack = [];
48426
48426
  var ambientModulesCache;
48427
48427
  var patternAmbientModules;
48428
48428
  var patternAmbientModuleAugmentations;
@@ -66776,7 +66776,7 @@ function createTypeChecker(host) {
66776
66776
  }
66777
66777
  }
66778
66778
  }
66779
- const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i])) : target;
66779
+ const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i]), 0 /* None */) : target;
66780
66780
  return filtered.flags & 131072 /* Never */ ? target : filtered;
66781
66781
  }
66782
66782
  function isWeakType(type) {
@@ -67810,17 +67810,18 @@ function createTypeChecker(host) {
67810
67810
  );
67811
67811
  }
67812
67812
  function inferTypeForHomomorphicMappedType(source, target, constraint) {
67813
- if (inInferTypeForHomomorphicMappedType) {
67814
- return void 0;
67813
+ const cacheKey = source.id + "," + target.id + "," + constraint.id;
67814
+ if (reverseMappedCache.has(cacheKey)) {
67815
+ return reverseMappedCache.get(cacheKey);
67815
67816
  }
67816
- const key = source.id + "," + target.id + "," + constraint.id;
67817
- if (reverseMappedCache.has(key)) {
67818
- return reverseMappedCache.get(key);
67817
+ const recursionKey = source.id + "," + (target.target || target).id;
67818
+ if (contains(homomorphicMappedTypeInferenceStack, recursionKey)) {
67819
+ return void 0;
67819
67820
  }
67820
- inInferTypeForHomomorphicMappedType = true;
67821
+ homomorphicMappedTypeInferenceStack.push(recursionKey);
67821
67822
  const type = createReverseMappedType(source, target, constraint);
67822
- inInferTypeForHomomorphicMappedType = false;
67823
- reverseMappedCache.set(key, type);
67823
+ homomorphicMappedTypeInferenceStack.pop();
67824
+ reverseMappedCache.set(cacheKey, type);
67824
67825
  return type;
67825
67826
  }
67826
67827
  function isPartiallyInferableType(type) {
@@ -70277,12 +70278,14 @@ function createTypeChecker(host) {
70277
70278
  return narrowTypeByPrivateIdentifierInInExpression(type, expr, assumeTrue);
70278
70279
  }
70279
70280
  const target = getReferenceCandidate(expr.right);
70280
- let leftType;
70281
- if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */ && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
70282
- return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
70283
- }
70284
- if (isMatchingReference(reference, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */) {
70285
- return narrowTypeByInKeyword(type, leftType, assumeTrue);
70281
+ const leftType = getTypeOfExpression(expr.left);
70282
+ if (leftType.flags & 8576 /* StringOrNumberLiteralOrUnique */) {
70283
+ if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
70284
+ return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
70285
+ }
70286
+ if (isMatchingReference(reference, target)) {
70287
+ return narrowTypeByInKeyword(type, leftType, assumeTrue);
70288
+ }
70286
70289
  }
70287
70290
  break;
70288
70291
  case 28 /* CommaToken */:
package/lib/tsserverlibrary.js CHANGED
@@ -46189,7 +46189,7 @@ ${lanes.join("\n")}
46189
46189
  };
46190
46190
  var amalgamatedDuplicates;
46191
46191
  var reverseMappedCache = /* @__PURE__ */ new Map();
46192
- var inInferTypeForHomomorphicMappedType = false;
46192
+ var homomorphicMappedTypeInferenceStack = [];
46193
46193
  var ambientModulesCache;
46194
46194
  var patternAmbientModules;
46195
46195
  var patternAmbientModuleAugmentations;
@@ -64543,7 +64543,7 @@ ${lanes.join("\n")}
64543
64543
  }
64544
64544
  }
64545
64545
  }
64546
- const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i])) : target;
64546
+ const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i]), 0 /* None */) : target;
64547
64547
  return filtered.flags & 131072 /* Never */ ? target : filtered;
64548
64548
  }
64549
64549
  function isWeakType(type) {
@@ -65577,17 +65577,18 @@ ${lanes.join("\n")}
65577
65577
  );
65578
65578
  }
65579
65579
  function inferTypeForHomomorphicMappedType(source, target, constraint) {
65580
- if (inInferTypeForHomomorphicMappedType) {
65581
- return void 0;
65580
+ const cacheKey = source.id + "," + target.id + "," + constraint.id;
65581
+ if (reverseMappedCache.has(cacheKey)) {
65582
+ return reverseMappedCache.get(cacheKey);
65582
65583
  }
65583
- const key = source.id + "," + target.id + "," + constraint.id;
65584
- if (reverseMappedCache.has(key)) {
65585
- return reverseMappedCache.get(key);
65584
+ const recursionKey = source.id + "," + (target.target || target).id;
65585
+ if (contains(homomorphicMappedTypeInferenceStack, recursionKey)) {
65586
+ return void 0;
65586
65587
  }
65587
- inInferTypeForHomomorphicMappedType = true;
65588
+ homomorphicMappedTypeInferenceStack.push(recursionKey);
65588
65589
  const type = createReverseMappedType(source, target, constraint);
65589
- inInferTypeForHomomorphicMappedType = false;
65590
- reverseMappedCache.set(key, type);
65590
+ homomorphicMappedTypeInferenceStack.pop();
65591
+ reverseMappedCache.set(cacheKey, type);
65591
65592
  return type;
65592
65593
  }
65593
65594
  function isPartiallyInferableType(type) {
@@ -68044,12 +68045,14 @@ ${lanes.join("\n")}
68044
68045
  return narrowTypeByPrivateIdentifierInInExpression(type, expr, assumeTrue);
68045
68046
  }
68046
68047
  const target = getReferenceCandidate(expr.right);
68047
- let leftType;
68048
- if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */ && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
68049
- return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
68050
- }
68051
- if (isMatchingReference(reference, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */) {
68052
- return narrowTypeByInKeyword(type, leftType, assumeTrue);
68048
+ const leftType = getTypeOfExpression(expr.left);
68049
+ if (leftType.flags & 8576 /* StringOrNumberLiteralOrUnique */) {
68050
+ if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
68051
+ return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
68052
+ }
68053
+ if (isMatchingReference(reference, target)) {
68054
+ return narrowTypeByInKeyword(type, leftType, assumeTrue);
68055
+ }
68053
68056
  }
68054
68057
  break;
68055
68058
  case 28 /* CommaToken */:
package/lib/typescript.js CHANGED
@@ -46189,7 +46189,7 @@ ${lanes.join("\n")}
46189
46189
  };
46190
46190
  var amalgamatedDuplicates;
46191
46191
  var reverseMappedCache = /* @__PURE__ */ new Map();
46192
- var inInferTypeForHomomorphicMappedType = false;
46192
+ var homomorphicMappedTypeInferenceStack = [];
46193
46193
  var ambientModulesCache;
46194
46194
  var patternAmbientModules;
46195
46195
  var patternAmbientModuleAugmentations;
@@ -64543,7 +64543,7 @@ ${lanes.join("\n")}
64543
64543
  }
64544
64544
  }
64545
64545
  }
64546
- const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i])) : target;
64546
+ const filtered = contains(include, 0 /* False */) ? getUnionType(types.filter((_, i) => include[i]), 0 /* None */) : target;
64547
64547
  return filtered.flags & 131072 /* Never */ ? target : filtered;
64548
64548
  }
64549
64549
  function isWeakType(type) {
@@ -65577,17 +65577,18 @@ ${lanes.join("\n")}
65577
65577
  );
65578
65578
  }
65579
65579
  function inferTypeForHomomorphicMappedType(source, target, constraint) {
65580
- if (inInferTypeForHomomorphicMappedType) {
65581
- return void 0;
65580
+ const cacheKey = source.id + "," + target.id + "," + constraint.id;
65581
+ if (reverseMappedCache.has(cacheKey)) {
65582
+ return reverseMappedCache.get(cacheKey);
65582
65583
  }
65583
- const key = source.id + "," + target.id + "," + constraint.id;
65584
- if (reverseMappedCache.has(key)) {
65585
- return reverseMappedCache.get(key);
65584
+ const recursionKey = source.id + "," + (target.target || target).id;
65585
+ if (contains(homomorphicMappedTypeInferenceStack, recursionKey)) {
65586
+ return void 0;
65586
65587
  }
65587
- inInferTypeForHomomorphicMappedType = true;
65588
+ homomorphicMappedTypeInferenceStack.push(recursionKey);
65588
65589
  const type = createReverseMappedType(source, target, constraint);
65589
- inInferTypeForHomomorphicMappedType = false;
65590
- reverseMappedCache.set(key, type);
65590
+ homomorphicMappedTypeInferenceStack.pop();
65591
+ reverseMappedCache.set(cacheKey, type);
65591
65592
  return type;
65592
65593
  }
65593
65594
  function isPartiallyInferableType(type) {
@@ -68044,12 +68045,14 @@ ${lanes.join("\n")}
68044
68045
  return narrowTypeByPrivateIdentifierInInExpression(type, expr, assumeTrue);
68045
68046
  }
68046
68047
  const target = getReferenceCandidate(expr.right);
68047
- let leftType;
68048
- if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */ && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
68049
- return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
68050
- }
68051
- if (isMatchingReference(reference, target) && (leftType = getTypeOfExpression(expr.left)).flags & 8576 /* StringOrNumberLiteralOrUnique */) {
68052
- return narrowTypeByInKeyword(type, leftType, assumeTrue);
68048
+ const leftType = getTypeOfExpression(expr.left);
68049
+ if (leftType.flags & 8576 /* StringOrNumberLiteralOrUnique */) {
68050
+ if (containsMissingType(type) && isAccessExpression(reference) && isMatchingReference(reference.expression, target) && getAccessedPropertyName(reference) === getPropertyNameFromType(leftType)) {
68051
+ return getTypeWithFacts(type, assumeTrue ? 524288 /* NEUndefined */ : 65536 /* EQUndefined */);
68052
+ }
68053
+ if (isMatchingReference(reference, target)) {
68054
+ return narrowTypeByInKeyword(type, leftType, assumeTrue);
68055
+ }
68053
68056
  }
68054
68057
  break;
68055
68058
  case 28 /* CommaToken */:
package/package.json CHANGED
@@ -2,7 +2,7 @@
2
2
  "name": "@typescript-deploys/pr-build",
3
3
  "author": "Microsoft Corp.",
4
4
  "homepage": "https://www.typescriptlang.org/",
5
- "version": "5.2.0-pr-54795-7",
5
+ "version": "5.2.0-pr-53647-17",
6
6
  "license": "Apache-2.0",
7
7
  "description": "TypeScript is a language for application scale JavaScript development",
8
8
  "keywords": [
@@ -115,5 +115,5 @@
115
115
  "node": "20.1.0",
116
116
  "npm": "8.19.4"
117
117
  },
118
- "gitHead": "77b53fe6bf7e4cd647cc4c44affd81f70e7597d9"
118
+ "gitHead": "e7c204e85a9d50cebdfc1716b45a9069ae4f0a27"
119
119
  }