@babel/traverse 7.0.0-beta.5 → 7.0.0-beta.53

package/README.md

@@ -1,33 +1,19 @@
 # @babel/traverse
 
-> @babel/traverse maintains the overall tree state, and is responsible for replacing, removing, and adding nodes.
+> 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.
 
 ## Install
 
+Using npm:
+
 ```sh
-$ npm install --save @babel/traverse
+npm install --save-dev @babel/traverse
 ```
 
-## Usage
-
-We can use it alongside Babylon to traverse and update nodes:
-
-```js
-import * as babylon from "babylon";
-import traverse from "@babel/traverse";
+or using yarn:
 
-const code = `function square(n) {
-  return n * n;
-}`;
-
-const ast = babylon.parse(code);
-
-traverse(ast, {
-  enter(path) {
-    if (path.isIdentifier({ name: "n" })) {
-      path.node.name = "x";
-    }
-  }
-});
+```sh
+yarn add @babel/traverse --dev
 ```
-[:book: **Read the full docs here**](https://github.com/thejameskyle/babel-handbook/blob/master/translations/en/plugin-handbook.md#babel-traverse)

package/lib/cache.js

@@ -1,13 +1,15 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.clear = clear;
 exports.clearPath = clearPath;
 exports.clearScope = clearScope;
 exports.scope = exports.path = void 0;
-var path = new WeakMap();
+let path = new WeakMap();
 exports.path = path;
-var scope = new WeakMap();
+let scope = new WeakMap();
 exports.scope = scope;
 
 function clear() {

package/lib/context.js

@@ -1,71 +1,62 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.default = void 0;
 
-var _path4 = _interopRequireDefault(require("./path"));
+var _path = _interopRequireDefault(require("./path"));
 
-var t = _interopRequireWildcard(require("@babel/types"));
+function t() {
+  const data = _interopRequireWildcard(require("@babel/types"));
 
-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)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+  t = function () {
+    return data;
+  };
+
+  return data;
+}
+
+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 _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
-var testing = process.env.NODE_ENV === "test";
+const testing = process.env.NODE_ENV === "test";
 
-var TraversalContext = function () {
-  function TraversalContext(scope, opts, state, parentPath) {
-    Object.defineProperty(this, "queue", {
-      configurable: true,
-      enumerable: true,
-      writable: true,
-      value: null
-    });
+class TraversalContext {
+  constructor(scope, opts, state, parentPath) {
+    this.queue = null;
     this.parentPath = parentPath;
     this.scope = scope;
     this.state = state;
     this.opts = opts;
   }
 
-  var _proto = TraversalContext.prototype;
-
-  _proto.shouldVisit = function shouldVisit(node) {
-    var opts = this.opts;
+  shouldVisit(node) {
+    const opts = this.opts;
     if (opts.enter || opts.exit) return true;
     if (opts[node.type]) return true;
-    var keys = t.VISITOR_KEYS[node.type];
+    const keys = t().VISITOR_KEYS[node.type];
     if (!keys || !keys.length) return false;
 
-    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;
+    for (const key of keys) {
+      if (node[key]) return true;
     }
 
     return false;
-  };
+  }
 
-  _proto.create = function create(node, obj, key, listKey) {
-    return _path4.default.get({
+  create(node, obj, key, listKey) {
+    return _path.default.get({
       parentPath: this.parentPath,
       parent: node,
       container: obj,
       key: key,
-      listKey: listKey
+      listKey
     });
-  };
+  }
 
-  _proto.maybeQueue = function maybeQueue(path, notPriority) {
+  maybeQueue(path, notPriority) {
     if (this.trap) {
       throw new Error("Infinite cycle detected");
     }
@@ -77,14 +68,14 @@ var TraversalContext = function () {
         this.priorityQueue.push(path);
       }
     }
-  };
+  }
 
-  _proto.visitMultiple = function visitMultiple(container, parent, listKey) {
+  visitMultiple(container, parent, listKey) {
     if (container.length === 0) return false;
-    var queue = [];
+    const queue = [];
 
-    for (var key = 0; key < container.length; key++) {
-      var node = container[key];
+    for (let key = 0; key < container.length; key++) {
+      const node = container[key];
 
       if (node && this.shouldVisit(node)) {
         queue.push(this.create(parent, container, key, listKey));
@@ -92,52 +83,39 @@ var TraversalContext = function () {
     }
 
     return this.visitQueue(queue);
-  };
+  }
 
-  _proto.visitSingle = function visitSingle(node, key) {
+  visitSingle(node, key) {
     if (this.shouldVisit(node[key])) {
       return this.visitQueue([this.create(node, node, key)]);
     } else {
       return false;
     }
-  };
+  }
 
-  _proto.visitQueue = function visitQueue(queue) {
+  visitQueue(queue) {
     this.queue = queue;
     this.priorityQueue = [];
-    var visited = [];
-    var stop = false;
+    const visited = [];
+    let stop = false;
 
-    for (var _iterator2 = queue, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : _iterator2[Symbol.iterator]();;) {
-      var _ref2;
+    for (const path of queue) {
+      path.resync();
 
-      if (_isArray2) {
-        if (_i2 >= _iterator2.length) break;
-        _ref2 = _iterator2[_i2++];
-      } else {
-        _i2 = _iterator2.next();
-        if (_i2.done) break;
-        _ref2 = _i2.value;
+      if (path.contexts.length === 0 || path.contexts[path.contexts.length - 1] !== this) {
+        path.pushContext(this);
       }
 
-      var _path2 = _ref2;
-
-      _path2.resync();
-
-      if (_path2.contexts.length === 0 || _path2.contexts[_path2.contexts.length - 1] !== this) {
-        _path2.pushContext(this);
-      }
-
-      if (_path2.key === null) continue;
+      if (path.key === null) continue;
 
       if (testing && queue.length >= 10000) {
         this.trap = true;
       }
 
-      if (visited.indexOf(_path2.node) >= 0) continue;
-      visited.push(_path2.node);
+      if (visited.indexOf(path.node) >= 0) continue;
+      visited.push(path.node);
 
-      if (_path2.visit()) {
+      if (path.visit()) {
         stop = true;
         break;
       }
@@ -150,29 +128,16 @@ var TraversalContext = function () {
       }
     }
 
-    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 _path3 = _ref3;
-
-      _path3.popContext();
+    for (const path of queue) {
+      path.popContext();
     }
 
     this.queue = null;
     return stop;
-  };
+  }
 
-  _proto.visit = function visit(node, key) {
-    var nodes = node[key];
+  visit(node, key) {
+    const nodes = node[key];
     if (!nodes) return false;
 
     if (Array.isArray(nodes)) {
@@ -180,9 +145,8 @@ var TraversalContext = function () {
     } else {
       return this.visitSingle(node, key);
     }
-  };
+  }
 
-  return TraversalContext;
-}();
+}
 
 exports.default = TraversalContext;

package/lib/hub.js

@@ -1,10 +1,15 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.default = void 0;
 
-var Hub = function Hub(file) {
-  this.file = file;
-};
+class Hub {
+  constructor(file) {
+    this.file = file;
+  }
+
+}
 
 exports.default = Hub;

package/lib/index.js

@@ -1,22 +1,24 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.default = traverse;
 Object.defineProperty(exports, "NodePath", {
   enumerable: true,
-  get: function get() {
+  get: function () {
     return _path.default;
   }
 });
 Object.defineProperty(exports, "Scope", {
   enumerable: true,
-  get: function get() {
+  get: function () {
     return _scope.default;
   }
 });
 Object.defineProperty(exports, "Hub", {
   enumerable: true,
-  get: function get() {
+  get: function () {
     return _hub.default;
   }
 });
@@ -28,9 +30,25 @@ var visitors = _interopRequireWildcard(require("./visitors"));
 
 exports.visitors = visitors;
 
-var _includes = _interopRequireDefault(require("lodash/includes"));
+function _includes() {
+  const data = _interopRequireDefault(require("lodash/includes"));
+
+  _includes = function () {
+    return data;
+  };
+
+  return data;
+}
+
+function t() {
+  const data = _interopRequireWildcard(require("@babel/types"));
 
-var t = _interopRequireWildcard(require("@babel/types"));
+  t = function () {
+    return data;
+  };
+
+  return data;
+}
 
 var cache = _interopRequireWildcard(require("./cache"));
 
@@ -40,7 +58,7 @@ var _scope = _interopRequireDefault(require("./scope"));
 
 var _hub = _interopRequireDefault(require("./hub"));
 
-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)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+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 _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
@@ -50,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.");
     }
   }
 
@@ -61,44 +79,29 @@ function traverse(parent, opts, scope, state, parentPath) {
 traverse.visitors = visitors;
 traverse.verify = visitors.verify;
 traverse.explode = visitors.explode;
-traverse.NodePath = require("./path");
-traverse.Scope = require("./scope");
-traverse.Hub = require("./hub");
 
 traverse.cheap = function (node, enter) {
-  return t.traverseFast(node, enter);
+  return t().traverseFast(node, enter);
 };
 
 traverse.node = function (node, opts, scope, state, parentPath, skipKeys) {
-  var keys = t.VISITOR_KEYS[node.type];
+  const keys = t().VISITOR_KEYS[node.type];
   if (!keys) return;
-  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;
-    }
+  const context = new _context.default(scope, opts, state, parentPath);
 
-    var _key = _ref;
-    if (skipKeys && skipKeys[_key]) continue;
-    if (context.visit(node, _key)) return;
+  for (const key of keys) {
+    if (skipKeys && skipKeys[key]) continue;
+    if (context.visit(node, key)) return;
   }
 };
 
 traverse.clearNode = function (node, opts) {
-  t.removeProperties(node, opts);
+  t().removeProperties(node, opts);
   cache.path.delete(node);
 };
 
 traverse.removeProperties = function (tree, opts) {
-  t.traverseFast(tree, traverse.clearNode, opts);
+  t().traverseFast(tree, traverse.clearNode, opts);
   return tree;
 };
 
@@ -110,9 +113,9 @@ function hasBlacklistedType(path, state) {
 }
 
 traverse.hasType = function (tree, type, blacklistTypes) {
-  if ((0, _includes.default)(blacklistTypes, tree.type)) return false;
+  if ((0, _includes().default)(blacklistTypes, tree.type)) return false;
   if (tree.type === type) return true;
-  var state = {
+  const state = {
     has: false,
     type: type
   };

package/lib/path/ancestry.js

@@ -1,6 +1,8 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.findParent = findParent;
 exports.find = find;
 exports.getFunctionParent = getFunctionParent;
@@ -12,16 +14,24 @@ exports.isAncestor = isAncestor;
 exports.isDescendant = isDescendant;
 exports.inType = inType;
 
-var t = _interopRequireWildcard(require("@babel/types"));
+function t() {
+  const data = _interopRequireWildcard(require("@babel/types"));
+
+  t = function () {
+    return data;
+  };
+
+  return data;
+}
 
 var _index = _interopRequireDefault(require("./index"));
 
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
-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)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+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) {
-  var path = this;
+  let path = this;
 
   while (path = path.parentPath) {
     if (callback(path)) return path;
@@ -31,7 +41,7 @@ function findParent(callback) {
 }
 
 function find(callback) {
-  var path = this;
+  let path = this;
 
   do {
     if (callback(path)) return path;
@@ -41,13 +51,11 @@ function find(callback) {
 }
 
 function getFunctionParent() {
-  return this.findParent(function (p) {
-    return p.isFunction();
-  });
+  return this.findParent(p => p.isFunction());
 }
 
 function getStatementParent() {
-  var path = this;
+  let path = this;
 
   do {
     if (!path.parentPath || Array.isArray(path.container) && path.isStatement()) {
@@ -66,13 +74,11 @@ function getStatementParent() {
 
 function getEarliestCommonAncestorFrom(paths) {
   return this.getDeepestCommonAncestorFrom(paths, function (deepest, i, ancestries) {
-    var earliest;
-    var keys = t.VISITOR_KEYS[deepest.type];
-    var _arr = ancestries;
+    let earliest;
+    const keys = t().VISITOR_KEYS[deepest.type];
 
-    for (var _i = 0; _i < _arr.length; _i++) {
-      var ancestry = _arr[_i];
-      var path = ancestry[i + 1];
+    for (const ancestry of ancestries) {
+      const path = ancestry[i + 1];
 
       if (!earliest) {
         earliest = path;
@@ -86,8 +92,8 @@ function getEarliestCommonAncestorFrom(paths) {
         }
       }
 
-      var earliestKeyIndex = keys.indexOf(earliest.parentKey);
-      var currentKeyIndex = keys.indexOf(path.parentKey);
+      const earliestKeyIndex = keys.indexOf(earliest.parentKey);
+      const currentKeyIndex = keys.indexOf(path.parentKey);
 
       if (earliestKeyIndex > currentKeyIndex) {
         earliest = path;
@@ -99,8 +105,6 @@ function getEarliestCommonAncestorFrom(paths) {
 }
 
 function getDeepestCommonAncestorFrom(paths, filter) {
-  var _this = this;
-
   if (!paths.length) {
     return this;
   }
@@ -109,14 +113,14 @@ function getDeepestCommonAncestorFrom(paths, filter) {
     return paths[0];
   }
 
-  var minDepth = Infinity;
-  var lastCommonIndex, lastCommon;
-  var ancestries = paths.map(function (path) {
-    var ancestry = [];
+  let minDepth = Infinity;
+  let lastCommonIndex, lastCommon;
+  const ancestries = paths.map(path => {
+    const ancestry = [];
 
     do {
       ancestry.unshift(path);
-    } while ((path = path.parentPath) && path !== _this);
+    } while ((path = path.parentPath) && path !== this);
 
     if (ancestry.length < minDepth) {
       minDepth = ancestry.length;
@@ -124,15 +128,12 @@ function getDeepestCommonAncestorFrom(paths, filter) {
 
     return ancestry;
   });
-  var first = ancestries[0];
-
-  depthLoop: for (var i = 0; i < minDepth; i++) {
-    var shouldMatch = first[i];
-    var _arr2 = ancestries;
+  const first = ancestries[0];
 
-    for (var _i2 = 0; _i2 < _arr2.length; _i2++) {
-      var ancestry = _arr2[_i2];
+  depthLoop: for (let i = 0; i < minDepth; i++) {
+    const shouldMatch = first[i];
 
+    for (const ancestry of ancestries) {
       if (ancestry[i] !== shouldMatch) {
         break depthLoop;
       }
@@ -154,8 +155,8 @@ function getDeepestCommonAncestorFrom(paths, filter) {
 }
 
 function getAncestry() {
-  var path = this;
-  var paths = [];
+  let path = this;
+  const paths = [];
 
   do {
     paths.push(path);
@@ -169,19 +170,14 @@ function isAncestor(maybeDescendant) {
 }
 
 function isDescendant(maybeAncestor) {
-  return !!this.findParent(function (parent) {
-    return parent === maybeAncestor;
-  });
+  return !!this.findParent(parent => parent === maybeAncestor);
 }
 
 function inType() {
-  var path = this;
+  let path = this;
 
   while (path) {
-    var _arr3 = arguments;
-
-    for (var _i3 = 0; _i3 < _arr3.length; _i3++) {
-      var type = _arr3[_i3];
+    for (const type of arguments) {
       if (path.node.type === type) return true;
     }
 

package/lib/path/comments.js

@@ -1,25 +1,35 @@
 "use strict";
 
-exports.__esModule = true;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
 exports.shareCommentsWithSiblings = shareCommentsWithSiblings;
 exports.addComment = addComment;
 exports.addComments = addComments;
 
-var t = _interopRequireWildcard(require("@babel/types"));
+function t() {
+  const data = _interopRequireWildcard(require("@babel/types"));
 
-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)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+  t = function () {
+    return data;
+  };
+
+  return data;
+}
+
+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 shareCommentsWithSiblings() {
   if (typeof this.key === "string") return;
-  var node = this.node;
+  const node = this.node;
   if (!node) return;
-  var trailing = node.trailingComments;
-  var leading = node.leadingComments;
+  const trailing = node.trailingComments;
+  const leading = node.leadingComments;
   if (!trailing && !leading) return;
-  var prev = this.getSibling(this.key - 1);
-  var next = this.getSibling(this.key + 1);
-  var hasPrev = Boolean(prev.node);
-  var hasNext = Boolean(next.node);
+  const prev = this.getSibling(this.key - 1);
+  const next = this.getSibling(this.key + 1);
+  const hasPrev = Boolean(prev.node);
+  const hasNext = Boolean(next.node);
 
   if (hasPrev && hasNext) {} else if (hasPrev) {
     prev.addComments("trailing", trailing);
@@ -29,9 +39,9 @@ function shareCommentsWithSiblings() {
 }
 
 function addComment(type, content, line) {
-  t.addComment(this.node, type, content, line);
+  t().addComment(this.node, type, content, line);
 }
 
 function addComments(type, comments) {
-  t.addComments(this.node, type, comments);
+  t().addComments(this.node, type, comments);
 }