@babel/traverse 7.0.0-beta.43 → 7.0.0-beta.44

package/lib/cache.js

@@ -7,9 +7,9 @@ exports.clear = clear;
 exports.clearPath = clearPath;
 exports.clearScope = clearScope;
 exports.scope = exports.path = void 0;
-let path = new WeakMap();
+var path = new WeakMap();
 exports.path = path;
-let scope = new WeakMap();
+var scope = new WeakMap();
 exports.scope = scope;
 
 function clear() {

package/lib/context.js

@@ -5,12 +5,12 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.default = void 0;
 
-var _path = _interopRequireDefault(require("./path"));
+var _path2 = _interopRequireDefault(require("./path"));
 
 function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+  var data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -21,10 +21,10 @@ function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj;
 
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
-const testing = process.env.NODE_ENV === "test";
+var testing = process.env.NODE_ENV === "test";
 
-class TraversalContext {
-  constructor(scope, opts, state, parentPath) {
+var TraversalContext = function () {
+  function TraversalContext(scope, opts, state, parentPath) {
     this.queue = null;
     this.parentPath = parentPath;
     this.scope = scope;
@@ -32,31 +32,45 @@ class TraversalContext {
     this.opts = opts;
   }
 
-  shouldVisit(node) {
-    const opts = this.opts;
+  var _proto = TraversalContext.prototype;
+
+  _proto.shouldVisit = function shouldVisit(node) {
+    var opts = this.opts;
     if (opts.enter || opts.exit) return true;
     if (opts[node.type]) return true;
-    const keys = t().VISITOR_KEYS[node.type];
+    var keys = t().VISITOR_KEYS[node.type];
     if (!keys || !keys.length) return false;
 
-    for (const key of keys) {
+    for (var _iterator = keys, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : _iterator[Symbol.iterator]();;) {
+      var _ref;
+
+      if (_isArray) {
+        if (_i >= _iterator.length) break;
+        _ref = _iterator[_i++];
+      } else {
+        _i = _iterator.next();
+        if (_i.done) break;
+        _ref = _i.value;
+      }
+
+      var key = _ref;
       if (node[key]) return true;
     }
 
     return false;
-  }
+  };
 
-  create(node, obj, key, listKey) {
-    return _path.default.get({
+  _proto.create = function create(node, obj, key, listKey) {
+    return _path2.default.get({
       parentPath: this.parentPath,
       parent: node,
       container: obj,
       key: key,
-      listKey
+      listKey: listKey
     });
-  }
+  };
 
-  maybeQueue(path, notPriority) {
+  _proto.maybeQueue = function maybeQueue(path, notPriority) {
     if (this.trap) {
       throw new Error("Infinite cycle detected");
     }
@@ -68,14 +82,14 @@ class TraversalContext {
         this.priorityQueue.push(path);
       }
     }
-  }
+  };
 
-  visitMultiple(container, parent, listKey) {
+  _proto.visitMultiple = function visitMultiple(container, parent, listKey) {
     if (container.length === 0) return false;
-    const queue = [];
+    var queue = [];
 
-    for (let key = 0; key < container.length; key++) {
-      const node = container[key];
+    for (var key = 0; key < container.length; key++) {
+      var node = container[key];
 
       if (node && this.shouldVisit(node)) {
         queue.push(this.create(parent, container, key, listKey));
@@ -83,23 +97,35 @@ class TraversalContext {
     }
 
     return this.visitQueue(queue);
-  }
+  };
 
-  visitSingle(node, key) {
+  _proto.visitSingle = function visitSingle(node, key) {
     if (this.shouldVisit(node[key])) {
       return this.visitQueue([this.create(node, node, key)]);
     } else {
       return false;
     }
-  }
+  };
 
-  visitQueue(queue) {
+  _proto.visitQueue = function visitQueue(queue) {
     this.queue = queue;
     this.priorityQueue = [];
-    const visited = [];
-    let stop = false;
+    var visited = [];
+    var stop = false;
 
-    for (const path of queue) {
+    for (var _iterator2 = queue, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : _iterator2[Symbol.iterator]();;) {
+      var _ref2;
+
+      if (_isArray2) {
+        if (_i2 >= _iterator2.length) break;
+        _ref2 = _iterator2[_i2++];
+      } else {
+        _i2 = _iterator2.next();
+        if (_i2.done) break;
+        _ref2 = _i2.value;
+      }
+
+      var path = _ref2;
       path.resync();
 
       if (path.contexts.length === 0 || path.contexts[path.contexts.length - 1] !== this) {
@@ -128,16 +154,29 @@ class TraversalContext {
       }
     }
 
-    for (const path of queue) {
-      path.popContext();
+    for (var _iterator3 = queue, _isArray3 = Array.isArray(_iterator3), _i3 = 0, _iterator3 = _isArray3 ? _iterator3 : _iterator3[Symbol.iterator]();;) {
+      var _ref3;
+
+      if (_isArray3) {
+        if (_i3 >= _iterator3.length) break;
+        _ref3 = _iterator3[_i3++];
+      } else {
+        _i3 = _iterator3.next();
+        if (_i3.done) break;
+        _ref3 = _i3.value;
+      }
+
+      var _path = _ref3;
+
+      _path.popContext();
     }
 
     this.queue = null;
     return stop;
-  }
+  };
 
-  visit(node, key) {
-    const nodes = node[key];
+  _proto.visit = function visit(node, key) {
+    var nodes = node[key];
     if (!nodes) return false;
 
     if (Array.isArray(nodes)) {
@@ -145,8 +184,9 @@ class TraversalContext {
     } else {
       return this.visitSingle(node, key);
     }
-  }
+  };
 
-}
+  return TraversalContext;
+}();
 
 exports.default = TraversalContext;

package/lib/hub.js

@@ -5,11 +5,8 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.default = void 0;
 
-class Hub {
-  constructor(file) {
-    this.file = file;
-  }
-
-}
+var Hub = function Hub(file) {
+  this.file = file;
+};
 
 exports.default = Hub;

package/lib/index.js

@@ -6,19 +6,19 @@ Object.defineProperty(exports, "__esModule", {
 exports.default = traverse;
 Object.defineProperty(exports, "NodePath", {
   enumerable: true,
-  get: function () {
+  get: function get() {
     return _path.default;
   }
 });
 Object.defineProperty(exports, "Scope", {
   enumerable: true,
-  get: function () {
+  get: function get() {
     return _scope.default;
   }
 });
 Object.defineProperty(exports, "Hub", {
   enumerable: true,
-  get: function () {
+  get: function get() {
     return _hub.default;
   }
 });
@@ -31,9 +31,9 @@ var visitors = _interopRequireWildcard(require("./visitors"));
 exports.visitors = visitors;
 
 function _includes() {
-  const data = _interopRequireDefault(require("lodash/includes"));
+  var data = _interopRequireDefault(require("lodash/includes"));
 
-  _includes = function () {
+  _includes = function _includes() {
     return data;
   };
 
@@ -41,9 +41,9 @@ function _includes() {
 }
 
 function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+  var data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -68,7 +68,7 @@ function traverse(parent, opts, scope, state, parentPath) {
 
   if (!opts.noScope && !scope) {
     if (parent.type !== "Program" && parent.type !== "File") {
-      throw new Error("You must pass a scope and parentPath unless traversing a Program/File. " + `Instead of that you tried to traverse a ${parent.type} node without ` + "passing scope and parentPath.");
+      throw new Error("You must pass a scope and parentPath unless traversing a Program/File. " + ("Instead of that you tried to traverse a " + parent.type + " node without ") + "passing scope and parentPath.");
     }
   }
 
@@ -85,11 +85,23 @@ traverse.cheap = function (node, enter) {
 };
 
 traverse.node = function (node, opts, scope, state, parentPath, skipKeys) {
-  const keys = t().VISITOR_KEYS[node.type];
+  var keys = t().VISITOR_KEYS[node.type];
   if (!keys) return;
-  const context = new _context.default(scope, opts, state, parentPath);
+  var context = new _context.default(scope, opts, state, parentPath);
+
+  for (var _iterator = keys, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : _iterator[Symbol.iterator]();;) {
+    var _ref;
+
+    if (_isArray) {
+      if (_i >= _iterator.length) break;
+      _ref = _iterator[_i++];
+    } else {
+      _i = _iterator.next();
+      if (_i.done) break;
+      _ref = _i.value;
+    }
 
-  for (const key of keys) {
+    var key = _ref;
     if (skipKeys && skipKeys[key]) continue;
     if (context.visit(node, key)) return;
   }
@@ -115,7 +127,7 @@ function hasBlacklistedType(path, state) {
 traverse.hasType = function (tree, type, blacklistTypes) {
   if ((0, _includes().default)(blacklistTypes, tree.type)) return false;
   if (tree.type === type) return true;
-  const state = {
+  var state = {
     has: false,
     type: type
   };

package/lib/path/ancestry.js

@@ -15,9 +15,9 @@ exports.isDescendant = isDescendant;
 exports.inType = inType;
 
 function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+  var data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -31,7 +31,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
 
 function findParent(callback) {
-  let path = this;
+  var path = this;
 
   while (path = path.parentPath) {
     if (callback(path)) return path;
@@ -41,7 +41,7 @@ function findParent(callback) {
 }
 
 function find(callback) {
-  let path = this;
+  var path = this;
 
   do {
     if (callback(path)) return path;
@@ -51,11 +51,13 @@ function find(callback) {
 }
 
 function getFunctionParent() {
-  return this.findParent(p => p.isFunction());
+  return this.findParent(function (p) {
+    return p.isFunction();
+  });
 }
 
 function getStatementParent() {
-  let path = this;
+  var path = this;
 
   do {
     if (!path.parentPath || Array.isArray(path.container) && path.isStatement()) {
@@ -74,11 +76,13 @@ function getStatementParent() {
 
 function getEarliestCommonAncestorFrom(paths) {
   return this.getDeepestCommonAncestorFrom(paths, function (deepest, i, ancestries) {
-    let earliest;
-    const keys = t().VISITOR_KEYS[deepest.type];
+    var earliest;
+    var keys = t().VISITOR_KEYS[deepest.type];
+    var _arr = ancestries;
 
-    for (const ancestry of ancestries) {
-      const path = ancestry[i + 1];
+    for (var _i = 0; _i < _arr.length; _i++) {
+      var ancestry = _arr[_i];
+      var path = ancestry[i + 1];
 
       if (!earliest) {
         earliest = path;
@@ -92,8 +96,8 @@ function getEarliestCommonAncestorFrom(paths) {
         }
       }
 
-      const earliestKeyIndex = keys.indexOf(earliest.parentKey);
-      const currentKeyIndex = keys.indexOf(path.parentKey);
+      var earliestKeyIndex = keys.indexOf(earliest.parentKey);
+      var currentKeyIndex = keys.indexOf(path.parentKey);
 
       if (earliestKeyIndex > currentKeyIndex) {
         earliest = path;
@@ -105,6 +109,8 @@ function getEarliestCommonAncestorFrom(paths) {
 }
 
 function getDeepestCommonAncestorFrom(paths, filter) {
+  var _this = this;
+
   if (!paths.length) {
     return this;
   }
@@ -113,14 +119,14 @@ function getDeepestCommonAncestorFrom(paths, filter) {
     return paths[0];
   }
 
-  let minDepth = Infinity;
-  let lastCommonIndex, lastCommon;
-  const ancestries = paths.map(path => {
-    const ancestry = [];
+  var minDepth = Infinity;
+  var lastCommonIndex, lastCommon;
+  var ancestries = paths.map(function (path) {
+    var ancestry = [];
 
     do {
       ancestry.unshift(path);
-    } while ((path = path.parentPath) && path !== this);
+    } while ((path = path.parentPath) && path !== _this);
 
     if (ancestry.length < minDepth) {
       minDepth = ancestry.length;
@@ -128,12 +134,15 @@ function getDeepestCommonAncestorFrom(paths, filter) {
 
     return ancestry;
   });
-  const first = ancestries[0];
+  var first = ancestries[0];
+
+  depthLoop: for (var i = 0; i < minDepth; i++) {
+    var shouldMatch = first[i];
+    var _arr2 = ancestries;
 
-  depthLoop: for (let i = 0; i < minDepth; i++) {
-    const shouldMatch = first[i];
+    for (var _i2 = 0; _i2 < _arr2.length; _i2++) {
+      var ancestry = _arr2[_i2];
 
-    for (const ancestry of ancestries) {
       if (ancestry[i] !== shouldMatch) {
         break depthLoop;
       }
@@ -155,8 +164,8 @@ function getDeepestCommonAncestorFrom(paths, filter) {
 }
 
 function getAncestry() {
-  let path = this;
-  const paths = [];
+  var path = this;
+  var paths = [];
 
   do {
     paths.push(path);
@@ -170,14 +179,19 @@ function isAncestor(maybeDescendant) {
 }
 
 function isDescendant(maybeAncestor) {
-  return !!this.findParent(parent => parent === maybeAncestor);
+  return !!this.findParent(function (parent) {
+    return parent === maybeAncestor;
+  });
 }
 
 function inType() {
-  let path = this;
+  var path = this;
 
   while (path) {
-    for (const type of arguments) {
+    var _arr3 = arguments;
+
+    for (var _i3 = 0; _i3 < _arr3.length; _i3++) {
+      var type = _arr3[_i3];
       if (path.node.type === type) return true;
     }
 

package/lib/path/comments.js

@@ -8,9 +8,9 @@ exports.addComment = addComment;
 exports.addComments = addComments;
 
 function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+  var data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -21,15 +21,15 @@ function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj;
 
 function shareCommentsWithSiblings() {
   if (typeof this.key === "string") return;
-  const node = this.node;
+  var node = this.node;
   if (!node) return;
-  const trailing = node.trailingComments;
-  const leading = node.leadingComments;
+  var trailing = node.trailingComments;
+  var leading = node.leadingComments;
   if (!trailing && !leading) return;
-  const prev = this.getSibling(this.key - 1);
-  const next = this.getSibling(this.key + 1);
-  const hasPrev = Boolean(prev.node);
-  const hasNext = Boolean(next.node);
+  var prev = this.getSibling(this.key - 1);
+  var next = this.getSibling(this.key + 1);
+  var hasPrev = Boolean(prev.node);
+  var hasNext = Boolean(next.node);
 
   if (hasPrev && hasNext) {} else if (hasPrev) {
     prev.addComments("trailing", trailing);

package/lib/path/context.js

@@ -29,7 +29,7 @@ var _index = _interopRequireDefault(require("../index"));
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 function call(key) {
-  const opts = this.opts;
+  var opts = this.opts;
   this.debug(key);
 
   if (this.node) {
@@ -46,18 +46,30 @@ function call(key) {
 function _call(fns) {
   if (!fns) return false;
 
-  for (const fn of fns) {
+  for (var _iterator = fns, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : _iterator[Symbol.iterator]();;) {
+    var _ref;
+
+    if (_isArray) {
+      if (_i >= _iterator.length) break;
+      _ref = _iterator[_i++];
+    } else {
+      _i = _iterator.next();
+      if (_i.done) break;
+      _ref = _i.value;
+    }
+
+    var fn = _ref;
     if (!fn) continue;
-    const node = this.node;
+    var node = this.node;
     if (!node) return true;
-    const ret = fn.call(this.state, this, this.state);
+    var ret = fn.call(this.state, this, this.state);
 
     if (ret && typeof ret === "object" && typeof ret.then === "function") {
-      throw new Error(`You appear to be using a plugin with an async traversal visitor, ` + `which your current version of Babel does not support.` + `If you're using a published plugin, you may need to upgrade ` + `your @babel/core version.`);
+      throw new Error("You appear to be using a plugin with an async traversal visitor, " + "which your current version of Babel does not support." + "If you're using a published plugin, you may need to upgrade " + "your @babel/core version.");
     }
 
     if (ret) {
-      throw new Error(`Unexpected return value from visitor method ${fn}`);
+      throw new Error("Unexpected return value from visitor method " + fn);
     }
 
     if (this.node !== node) return true;
@@ -68,7 +80,7 @@ function _call(fns) {
 }
 
 function isBlacklisted() {
-  const blacklist = this.opts.blacklist;
+  var blacklist = this.opts.blacklist;
   return blacklist && blacklist.indexOf(this.node.type) > -1;
 }
 
@@ -113,8 +125,8 @@ function stop() {
 
 function setScope() {
   if (this.opts && this.opts.noScope) return;
-  let path = this.parentPath;
-  let target;
+  var path = this.parentPath;
+  var target;
 
   while (path && !target) {
     if (path.opts && path.opts.noScope) return;
@@ -163,13 +175,13 @@ function _resyncKey() {
   if (this.node === this.container[this.key]) return;
 
   if (Array.isArray(this.container)) {
-    for (let i = 0; i < this.container.length; i++) {
+    for (var i = 0; i < this.container.length; i++) {
       if (this.container[i] === this.node) {
         return this.setKey(i);
       }
     }
   } else {
-    for (const key in this.container) {
+    for (var key in this.container) {
       if (this.container[key] === this.node) {
         return this.setKey(key);
       }
@@ -181,7 +193,7 @@ function _resyncKey() {
 
 function _resyncList() {
   if (!this.parent || !this.inList) return;
-  const newContainer = this.parent[this.listKey];
+  var newContainer = this.parent[this.listKey];
   if (this.container === newContainer) return;
   this.container = newContainer || null;
 }
@@ -222,18 +234,34 @@ function setKey(key) {
   this.type = this.node && this.node.type;
 }
 
-function requeue(pathToQueue = this) {
+function requeue(pathToQueue) {
+  if (pathToQueue === void 0) {
+    pathToQueue = this;
+  }
+
   if (pathToQueue.removed) return;
-  const contexts = this.contexts;
+  var contexts = this.contexts;
+
+  for (var _iterator2 = contexts, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : _iterator2[Symbol.iterator]();;) {
+    var _ref2;
+
+    if (_isArray2) {
+      if (_i2 >= _iterator2.length) break;
+      _ref2 = _iterator2[_i2++];
+    } else {
+      _i2 = _iterator2.next();
+      if (_i2.done) break;
+      _ref2 = _i2.value;
+    }
 
-  for (const context of contexts) {
+    var context = _ref2;
     context.maybeQueue(pathToQueue);
   }
 }
 
 function _getQueueContexts() {
-  let path = this;
-  let contexts = this.contexts;
+  var path = this;
+  var contexts = this.contexts;
 
   while (!contexts.length) {
     path = path.parentPath;