@babel/traverse 7.12.5 → 7.12.7

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

@@ -178,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

@@ -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/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@babel/traverse",
-  "version": "7.12.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/",
@@ -19,8 +19,8 @@
     "@babel/generator": "^7.12.5",
     "@babel/helper-function-name": "^7.10.4",
     "@babel/helper-split-export-declaration": "^7.11.0",
-    "@babel/parser": "^7.12.5",
-    "@babel/types": "^7.12.5",
+    "@babel/parser": "^7.12.7",
+    "@babel/types": "^7.12.7",
     "debug": "^4.1.0",
     "globals": "^11.1.0",
     "lodash": "^4.17.19"