@babel/traverse 7.11.5 → 7.12.7

package/README.md

@@ -2,7 +2,7 @@
 
 > The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes
 
-See our website [@babel/traverse](https://babeljs.io/docs/en/next/babel-traverse.html) for more information or the [issues](https://github.com/babel/babel/issues?utf8=%E2%9C%93&q=is%3Aissue+label%3A%22pkg%3A%20traverse%22+is%3Aopen) associated with this package.
+See our website [@babel/traverse](https://babeljs.io/docs/en/babel-traverse) for more information or the [issues](https://github.com/babel/babel/issues?utf8=%E2%9C%93&q=is%3Aissue+label%3A%22pkg%3A%20traverse%22+is%3Aopen) associated with this package.
 
 ## Install
 

package/lib/context.js

@@ -90,7 +90,7 @@ class TraversalContext {
   visitQueue(queue) {
     this.queue = queue;
     this.priorityQueue = [];
-    const visited = [];
+    const visited = new WeakSet();
     let stop = false;
 
     for (const path of queue) {
@@ -106,8 +106,11 @@ class TraversalContext {
         this.trap = true;
       }
 
-      if (visited.indexOf(path.node) >= 0) continue;
-      visited.push(path.node);
+      const {
+        node
+      } = path;
+      if (visited.has(node)) continue;
+      if (node) visited.add(node);
 
       if (path.visit()) {
         stop = true;

package/lib/path/family.js

@@ -41,27 +41,43 @@ function addCompletionRecords(path, paths) {
   return paths;
 }
 
+function findBreak(statements) {
+  let breakStatement;
+
+  if (!Array.isArray(statements)) {
+    statements = [statements];
+  }
+
+  for (const statement of statements) {
+    if (statement.isDoExpression() || statement.isProgram() || statement.isBlockStatement() || statement.isCatchClause() || statement.isLabeledStatement()) {
+      breakStatement = findBreak(statement.get("body"));
+    } else if (statement.isIfStatement()) {
+      var _findBreak;
+
+      breakStatement = (_findBreak = findBreak(statement.get("consequent"))) != null ? _findBreak : findBreak(statement.get("alternate"));
+    } else if (statement.isTryStatement()) {
+      var _findBreak2;
+
+      breakStatement = (_findBreak2 = findBreak(statement.get("block"))) != null ? _findBreak2 : findBreak(statement.get("handler"));
+    } else if (statement.isBreakStatement()) {
+      breakStatement = statement;
+    }
+
+    if (breakStatement) {
+      return breakStatement;
+    }
+  }
+
+  return null;
+}
+
 function completionRecordForSwitch(cases, paths) {
   let isLastCaseWithConsequent = true;
 
   for (let i = cases.length - 1; i >= 0; i--) {
     const switchCase = cases[i];
     const consequent = switchCase.get("consequent");
-    let breakStatement;
-
-    findBreak: for (const statement of consequent) {
-      if (statement.isBlockStatement()) {
-        for (const statementInBlock of statement.get("body")) {
-          if (statementInBlock.isBreakStatement()) {
-            breakStatement = statementInBlock;
-            break findBreak;
-          }
-        }
-      } else if (statement.isBreakStatement()) {
-        breakStatement = statement;
-        break;
-      }
-    }
+    let breakStatement = findBreak(consequent);
 
     if (breakStatement) {
       while (breakStatement.key === 0 && breakStatement.parentPath.isBlockStatement()) {
@@ -162,7 +178,7 @@ function getAllPrevSiblings() {
   return siblings;
 }
 
-function get(key, context) {
+function get(key, context = true) {
   if (context === true) context = this.context;
   const parts = key.split(".");
 

package/lib/path/index.js

@@ -57,22 +57,22 @@ exports.SHOULD_SKIP = SHOULD_SKIP;
 
 class NodePath {
   constructor(hub, parent) {
-    this.parent = parent;
-    this.hub = hub;
     this.contexts = [];
-    this.data = null;
-    this._traverseFlags = 0;
     this.state = null;
     this.opts = null;
+    this._traverseFlags = 0;
     this.skipKeys = null;
     this.parentPath = null;
-    this.context = null;
     this.container = null;
     this.listKey = null;
     this.key = null;
     this.node = null;
-    this.scope = null;
     this.type = null;
+    this.parent = parent;
+    this.hub = hub;
+    this.data = null;
+    this.context = null;
+    this.scope = null;
   }
 
   static get({
@@ -92,26 +92,20 @@ class NodePath {
     }
 
     const targetNode = container[key];
-    const paths = _cache.path.get(parent) || [];
-
-    if (!_cache.path.has(parent)) {
-      _cache.path.set(parent, paths);
-    }
 
-    let path;
+    let paths = _cache.path.get(parent);
 
-    for (let i = 0; i < paths.length; i++) {
-      const pathCheck = paths[i];
+    if (!paths) {
+      paths = new Map();
 
-      if (pathCheck.node === targetNode) {
-        path = pathCheck;
-        break;
-      }
+      _cache.path.set(parent, paths);
     }
 
+    let path = paths.get(targetNode);
+
     if (!path) {
       path = new NodePath(hub, parent);
-      paths.push(path);
+      if (targetNode) paths.set(targetNode, path);
     }
 
     path.setup(parentPath, container, listKey, key);

package/lib/path/modification.js

@@ -136,9 +136,7 @@ function updateSiblingKeys(fromIndex, incrementBy) {
 
   const paths = _cache.path.get(this.parent);
 
-  for (let i = 0; i < paths.length; i++) {
-    const path = paths[i];
-
+  for (const [, path] of paths) {
     if (path.key >= fromIndex) {
       path.key += incrementBy;
     }

package/lib/path/removal.js

@@ -12,6 +12,8 @@ exports._assertUnremoved = _assertUnremoved;
 
 var _removalHooks = require("./lib/removal-hooks");
 
+var _cache = require("../cache");
+
 var _index = require("./index");
 
 function remove() {
@@ -60,6 +62,7 @@ function _remove() {
 
 function _markRemoved() {
   this._traverseFlags |= _index.SHOULD_SKIP | _index.REMOVED;
+  if (this.parent) _cache.path.get(this.parent).delete(this.node);
   this.node = null;
 }
 

package/lib/path/replacement.js

@@ -16,6 +16,8 @@ var _index = _interopRequireDefault(require("../index"));
 
 var _index2 = _interopRequireDefault(require("./index"));
 
+var _cache = require("../cache");
+
 var _parser = require("@babel/parser");
 
 var t = _interopRequireWildcard(require("@babel/types"));
@@ -59,6 +61,9 @@ function replaceWithMultiple(nodes) {
   nodes = this._verifyNodeList(nodes);
   t.inheritLeadingComments(nodes[0], this.node);
   t.inheritTrailingComments(nodes[nodes.length - 1], this.node);
+
+  _cache.path.get(this.parent).delete(this.node);
+
   this.node = this.container[this.key] = null;
   const paths = this.insertAfter(nodes);
 

package/lib/scope/binding.js

@@ -12,15 +12,15 @@ class Binding {
     path,
     kind
   }) {
-    this.identifier = identifier;
-    this.scope = scope;
-    this.path = path;
-    this.kind = kind;
     this.constantViolations = [];
     this.constant = true;
     this.referencePaths = [];
     this.referenced = false;
     this.references = 0;
+    this.identifier = identifier;
+    this.scope = scope;
+    this.path = path;
+    this.kind = kind;
     this.clearValue();
   }
 

package/lib/scope/index.js

@@ -9,8 +9,6 @@ var _renamer = _interopRequireDefault(require("./lib/renamer"));
 
 var _index = _interopRequireDefault(require("../index"));
 
-var _defaults = _interopRequireDefault(require("lodash/defaults"));
-
 var _binding = _interopRequireDefault(require("./binding"));
 
 var _globals = _interopRequireDefault(require("globals"));
@@ -346,7 +344,7 @@ class Scope {
   generateUid(name = "temp") {
     name = t.toIdentifier(name).replace(/^_+/, "").replace(/[0-9]+$/g, "");
     let uid;
-    let i = 0;
+    let i = 1;
 
     do {
       uid = this._generateUid(name, i);
@@ -838,7 +836,12 @@ class Scope {
     let scope = this;
 
     do {
-      (0, _defaults.default)(ids, scope.bindings);
+      for (const key of Object.keys(scope.bindings)) {
+        if (key in ids === false) {
+          ids[key] = scope.bindings[key];
+        }
+      }
+
       scope = scope.parent;
     } while (scope);
 
@@ -876,7 +879,9 @@ class Scope {
       const binding = scope.getOwnBinding(name);
 
       if (binding) {
-        if (previousPath && previousPath.isPattern() && previousPath.parentPath.isFunction() && binding.kind !== "param") {} else {
+        var _previousPath;
+
+        if (((_previousPath = previousPath) == null ? void 0 : _previousPath.isPattern()) && binding.kind !== "param") {} else {
           return binding;
         }
       }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@babel/traverse",
-  "version": "7.11.5",
+  "version": "7.12.7",
   "description": "The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes",
   "author": "Sebastian McKenzie <sebmck@gmail.com>",
   "homepage": "https://babeljs.io/",
@@ -16,17 +16,16 @@
   "main": "lib/index.js",
   "dependencies": {
     "@babel/code-frame": "^7.10.4",
-    "@babel/generator": "^7.11.5",
+    "@babel/generator": "^7.12.5",
     "@babel/helper-function-name": "^7.10.4",
     "@babel/helper-split-export-declaration": "^7.11.0",
-    "@babel/parser": "^7.11.5",
-    "@babel/types": "^7.11.5",
+    "@babel/parser": "^7.12.7",
+    "@babel/types": "^7.12.7",
     "debug": "^4.1.0",
     "globals": "^11.1.0",
     "lodash": "^4.17.19"
   },
   "devDependencies": {
-    "@babel/helper-plugin-test-runner": "^7.10.4"
-  },
-  "gitHead": "af64ccb2b00bc7574943674996c2f0507cdbfb6f"
+    "@babel/helper-plugin-test-runner": "7.10.4"
+  }
 }