@babel/traverse 7.18.2 → 7.18.5

package/lib/path/index.js

@@ -227,6 +227,9 @@ class NodePath {
 }
 
 Object.assign(NodePath.prototype, NodePath_ancestry, NodePath_inference, NodePath_replacement, NodePath_evaluation, NodePath_conversion, NodePath_introspection, NodePath_context, NodePath_removal, NodePath_modification, NodePath_family, NodePath_comments);
+{
+  NodePath.prototype._guessExecutionStatusRelativeToDifferentFunctions = NodePath_introspection._guessExecutionStatusRelativeTo;
+}
 
 for (const type of t.TYPES) {
   const typeKey = `is${type}`;

package/lib/path/introspection.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports._guessExecutionStatusRelativeTo = _guessExecutionStatusRelativeTo;
-exports._guessExecutionStatusRelativeToDifferentFunctions = _guessExecutionStatusRelativeToDifferentFunctions;
 exports._resolve = _resolve;
 exports.canHaveVariableDeclarationOrExpression = canHaveVariableDeclarationOrExpression;
 exports.canSwapBetweenExpressionAndStatement = canSwapBetweenExpressionAndStatement;
@@ -232,20 +231,24 @@ function isExecutionUncertainInList(paths, maxIndex) {
 }
 
 function _guessExecutionStatusRelativeTo(target) {
+  return _guessExecutionStatusRelativeToCached(this, target, new Map());
+}
+
+function _guessExecutionStatusRelativeToCached(base, target, cache) {
   const funcParent = {
-    this: getOuterFunction(this),
+    this: getOuterFunction(base),
     target: getOuterFunction(target)
   };
 
   if (funcParent.target.node !== funcParent.this.node) {
-    return this._guessExecutionStatusRelativeToDifferentFunctions(funcParent.target);
+    return _guessExecutionStatusRelativeToDifferentFunctionsCached(base, funcParent.target, cache);
   }
 
   const paths = {
     target: target.getAncestry(),
-    this: this.getAncestry()
+    this: base.getAncestry()
   };
-  if (paths.target.indexOf(this) >= 0) return "after";
+  if (paths.target.indexOf(base) >= 0) return "after";
   if (paths.this.indexOf(target) >= 0) return "before";
   let commonPath;
   const commonIndex = {
@@ -289,9 +292,9 @@ function _guessExecutionStatusRelativeTo(target) {
   return keyPosition.target > keyPosition.this ? "before" : "after";
 }
 
-const executionOrderCheckedNodes = new WeakSet();
+const executionOrderCheckedNodes = new Set();
 
-function _guessExecutionStatusRelativeToDifferentFunctions(target) {
+function _guessExecutionStatusRelativeToDifferentFunctionsInternal(base, target, cache) {
   if (!target.isFunctionDeclaration() || target.parentPath.isExportDeclaration()) {
     return "unknown";
   }
@@ -312,20 +315,37 @@ function _guessExecutionStatusRelativeToDifferentFunctions(target) {
     if (executionOrderCheckedNodes.has(path.node)) continue;
     executionOrderCheckedNodes.add(path.node);
 
-    const status = this._guessExecutionStatusRelativeTo(path);
-
-    executionOrderCheckedNodes.delete(path.node);
+    try {
+      const status = _guessExecutionStatusRelativeToCached(base, path, cache);
 
-    if (allStatus && allStatus !== status) {
-      return "unknown";
-    } else {
-      allStatus = status;
+      if (allStatus && allStatus !== status) {
+        return "unknown";
+      } else {
+        allStatus = status;
+      }
+    } finally {
+      executionOrderCheckedNodes.delete(path.node);
     }
   }
 
   return allStatus;
 }
 
+function _guessExecutionStatusRelativeToDifferentFunctionsCached(base, target, cache) {
+  let nodeMap = cache.get(base.node);
+
+  if (!nodeMap) {
+    cache.set(base.node, nodeMap = new Map());
+  } else if (nodeMap.has(target.node)) {
+    return nodeMap.get(target.node);
+  }
+
+  const result = _guessExecutionStatusRelativeToDifferentFunctionsInternal(base, target, cache);
+
+  nodeMap.set(target.node, result);
+  return result;
+}
+
 function resolve(dangerous, resolved) {
   return this._resolve(dangerous, resolved) || this;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@babel/traverse",
-  "version": "7.18.2",
+  "version": "7.18.5",
   "description": "The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-traverse",
@@ -22,8 +22,8 @@
     "@babel/helper-function-name": "^7.17.9",
     "@babel/helper-hoist-variables": "^7.16.7",
     "@babel/helper-split-export-declaration": "^7.16.7",
-    "@babel/parser": "^7.18.0",
-    "@babel/types": "^7.18.2",
+    "@babel/parser": "^7.18.5",
+    "@babel/types": "^7.18.4",
     "debug": "^4.1.0",
     "globals": "^11.1.0"
   },