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

package/lib/context.js

@@ -10,7 +10,7 @@ var _path = _interopRequireDefault(require("./path"));
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -39,7 +39,19 @@ class TraversalContext {
     const 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;
+      }
+
+      const key = _ref;
       if (node[key]) return true;
     }
 
@@ -99,7 +111,19 @@ class TraversalContext {
     const visited = [];
     let 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;
+      }
+
+      const path = _ref2;
       path.resync();
 
       if (path.contexts.length === 0 || path.contexts[path.contexts.length - 1] !== this) {
@@ -128,7 +152,19 @@ class TraversalContext {
       }
     }
 
-    for (const path of queue) {
+    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;
+      }
+
+      const path = _ref3;
       path.popContext();
     }
 

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;
   }
 });
@@ -33,7 +33,7 @@ exports.visitors = visitors;
 function _includes() {
   const data = _interopRequireDefault(require("lodash/includes"));
 
-  _includes = function () {
+  _includes = function _includes() {
     return data;
   };
 
@@ -43,7 +43,7 @@ function _includes() {
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -89,7 +89,19 @@ traverse.node = function (node, opts, scope, state, parentPath, skipKeys) {
   if (!keys) return;
   const context = new _context.default(scope, opts, state, parentPath);
 
-  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;
+    }
+
+    const key = _ref;
     if (skipKeys && skipKeys[key]) continue;
     if (context.visit(node, key)) return;
   }

package/lib/path/ancestry.js

@@ -17,7 +17,7 @@ exports.inType = inType;
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -76,8 +76,10 @@ function getEarliestCommonAncestorFrom(paths) {
   return this.getDeepestCommonAncestorFrom(paths, function (deepest, i, ancestries) {
     let earliest;
     const keys = t().VISITOR_KEYS[deepest.type];
+    var _arr = ancestries;
 
-    for (const ancestry of ancestries) {
+    for (var _i = 0; _i < _arr.length; _i++) {
+      const ancestry = _arr[_i];
       const path = ancestry[i + 1];
 
       if (!earliest) {
@@ -132,8 +134,11 @@ function getDeepestCommonAncestorFrom(paths, filter) {
 
   depthLoop: for (let i = 0; i < minDepth; i++) {
     const shouldMatch = first[i];
+    var _arr2 = ancestries;
+
+    for (var _i2 = 0; _i2 < _arr2.length; _i2++) {
+      const ancestry = _arr2[_i2];
 
-    for (const ancestry of ancestries) {
       if (ancestry[i] !== shouldMatch) {
         break depthLoop;
       }
@@ -177,7 +182,10 @@ function inType() {
   let path = this;
 
   while (path) {
-    for (const type of arguments) {
+    var _arr3 = arguments;
+
+    for (var _i3 = 0; _i3 < _arr3.length; _i3++) {
+      const type = _arr3[_i3];
       if (path.node.type === type) return true;
     }
 

package/lib/path/comments.js

@@ -10,7 +10,7 @@ exports.addComments = addComments;
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 

package/lib/path/context.js

@@ -46,7 +46,19 @@ 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;
+    }
+
+    const fn = _ref;
     if (!fn) continue;
     const node = this.node;
     if (!node) return true;
@@ -226,7 +238,19 @@ function requeue(pathToQueue = this) {
   if (pathToQueue.removed) return;
   const contexts = this.contexts;
 
-  for (const context of 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;
+    }
+
+    const context = _ref2;
     context.maybeQueue(pathToQueue);
   }
 }

package/lib/path/conversion.js

@@ -12,7 +12,7 @@ exports.arrowFunctionToExpression = arrowFunctionToExpression;
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -22,7 +22,7 @@ function t() {
 function _helperFunctionName() {
   const data = _interopRequireDefault(require("@babel/helper-function-name"));
 
-  _helperFunctionName = function () {
+  _helperFunctionName = function _helperFunctionName() {
     return data;
   };
 
@@ -136,22 +136,23 @@ function arrowFunctionToExpression({
 }
 
 function hoistFunctionEnvironment(fnPath, specCompliant = false, allowInsertArrow = true) {
-  const thisEnvFn = fnPath.findParent(p => p.isFunction() && !p.isArrowFunctionExpression() || p.isProgram() || p.isClassProperty({
-    static: false
-  }));
+  const thisEnvFn = fnPath.findParent(p => {
+    return p.isFunction() && !p.isArrowFunctionExpression() || p.isProgram() || p.isClassProperty({
+      static: false
+    });
+  });
   const inConstructor = thisEnvFn && thisEnvFn.node.kind === "constructor";
 
   if (thisEnvFn.isClassProperty()) {
     throw fnPath.buildCodeFrameError("Unable to transform arrow inside class property");
   }
 
-  const {
-    thisPaths,
-    argumentsPaths,
-    newTargetPaths,
-    superProps,
-    superCalls
-  } = getScopeInformation(fnPath);
+  const _getScopeInformation = getScopeInformation(fnPath),
+        thisPaths = _getScopeInformation.thisPaths,
+        argumentsPaths = _getScopeInformation.argumentsPaths,
+        newTargetPaths = _getScopeInformation.newTargetPaths,
+        superProps = _getScopeInformation.superProps,
+        superCalls = _getScopeInformation.superCalls;
 
   if (inConstructor && superCalls.length > 0) {
     if (!allowInsertArrow) {

package/lib/path/evaluation.js

@@ -20,12 +20,8 @@ function deopt(path, state) {
 }
 
 function evaluateCached(path, state) {
-  const {
-    node
-  } = path;
-  const {
-    seen
-  } = state;
+  const node = path.node;
+  const seen = state.seen;
 
   if (seen.has(node)) {
     const existing = seen.get(node);
@@ -55,9 +51,7 @@ function evaluateCached(path, state) {
 
 function _evaluate(path, state) {
   if (!state.confident) return;
-  const {
-    node
-  } = path;
+  const node = path.node;
 
   if (path.isSequenceExpression()) {
     const exprs = path.get("expressions");
@@ -78,11 +72,7 @@ function _evaluate(path, state) {
 
   if (path.isTaggedTemplateExpression() && path.get("tag").isMemberExpression()) {
     const object = path.get("tag.object");
-    const {
-      node: {
-        name
-      }
-    } = object;
+    const name = object.node.name;
     const property = path.get("tag.property");
 
     if (object.isIdentifier() && name === "String" && !path.scope.getBinding(name, true) && property.isIdentifier && property.node.name === "raw") {
@@ -191,7 +181,19 @@ function _evaluate(path, state) {
     const arr = [];
     const elems = path.get("elements");
 
-    for (const elem of elems) {
+    for (var _iterator = elems, _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 elem = _ref;
       const elemValue = elem.evaluate();
 
       if (elemValue.confident) {
@@ -208,7 +210,20 @@ function _evaluate(path, state) {
     const obj = {};
     const props = path.get("properties");
 
-    for (const prop of props) {
+    for (var _iterator2 = props, _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;
+      }
+
+      const prop = _ref2;
+
       if (prop.isObjectMethod() || prop.isSpreadElement()) {
         return deopt(prop, state);
       }
@@ -296,7 +311,7 @@ function _evaluate(path, state) {
         return left % right;
 
       case "**":
-        return left ** right;
+        return Math.pow(left, right);
 
       case "<":
         return left < right;
@@ -385,7 +400,19 @@ function evaluateQuasis(path, quasis, state, raw = false) {
   let i = 0;
   const exprs = path.get("expressions");
 
-  for (const elem of quasis) {
+  for (var _iterator3 = quasis, _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;
+    }
+
+    const elem = _ref3;
     if (!state.confident) break;
     str += raw ? elem.value.raw : elem.value.cooked;
     const expr = exprs[i++];

package/lib/path/family.js

@@ -23,7 +23,7 @@ var _index = _interopRequireDefault(require("./index"));
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -153,8 +153,11 @@ function _getKey(key, context) {
 
 function _getPattern(parts, context) {
   let path = this;
+  var _arr = parts;
+
+  for (var _i = 0; _i < _arr.length; _i++) {
+    const part = _arr[_i];
 
-  for (const part of parts) {
     if (part === ".") {
       path = path.parentPath;
     } else {

package/lib/path/index.js

@@ -10,7 +10,7 @@ var virtualTypes = _interopRequireWildcard(require("./lib/virtual-types"));
 function _debug() {
   const data = _interopRequireDefault(require("debug"));
 
-  _debug = function () {
+  _debug = function _debug() {
     return data;
   };
 
@@ -20,7 +20,7 @@ function _debug() {
 function _invariant() {
   const data = _interopRequireDefault(require("invariant"));
 
-  _invariant = function () {
+  _invariant = function _invariant() {
     return data;
   };
 
@@ -34,7 +34,7 @@ var _scope = _interopRequireDefault(require("../scope"));
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -46,7 +46,7 @@ var _cache = require("../cache");
 function _generator() {
   const data = _interopRequireDefault(require("@babel/generator"));
 
-  _generator = function () {
+  _generator = function _generator() {
     return data;
   };
 
@@ -199,16 +199,19 @@ class NodePath {
 
 exports.default = 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);
+var _arr = t().TYPES;
 
-for (const type of t().TYPES) {
+for (var _i = 0; _i < _arr.length; _i++) {
+  const type = _arr[_i];
   const typeKey = `is${type}`;
+  const fn = t()[typeKey];
 
   NodePath.prototype[typeKey] = function (opts) {
-    return t()[typeKey](this.node, opts);
+    return fn(this.node, opts);
   };
 
   NodePath.prototype[`assert${type}`] = function (opts) {
-    if (!this[typeKey](opts)) {
+    if (!fn(this.node, opts)) {
       throw new TypeError(`Expected node path of type ${type}`);
     }
   };

package/lib/path/inference/index.js

@@ -15,7 +15,7 @@ var inferers = _interopRequireWildcard(require("./inferers"));
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -103,7 +103,11 @@ function couldBeBaseType(name) {
   if (t().isAnyTypeAnnotation(type)) return true;
 
   if (t().isUnionTypeAnnotation(type)) {
-    for (const type2 of type.types) {
+    var _arr = type.types;
+
+    for (var _i = 0; _i < _arr.length; _i++) {
+      const type2 = _arr[_i];
+
       if (t().isAnyTypeAnnotation(type2) || _isBaseType(name, type2, true)) {
         return true;
       }

package/lib/path/inference/inferer-reference.js

@@ -8,7 +8,7 @@ exports.default = _default;
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -50,8 +50,10 @@ function getTypeAnnotationBindingConstantViolations(binding, path, name) {
 
   if (constantViolations.length) {
     constantViolations = constantViolations.concat(functionConstantViolations);
+    var _arr = constantViolations;
 
-    for (const violation of constantViolations) {
+    for (var _i = 0; _i < _arr.length; _i++) {
+      const violation = _arr[_i];
       types.push(violation.getTypeAnnotation());
     }
   }

package/lib/path/inference/inferers.js

@@ -27,7 +27,7 @@ exports.CallExpression = CallExpression;
 exports.TaggedTemplateExpression = TaggedTemplateExpression;
 Object.defineProperty(exports, "Identifier", {
   enumerable: true,
-  get: function () {
+  get: function get() {
     return _infererReference.default;
   }
 });
@@ -35,7 +35,7 @@ Object.defineProperty(exports, "Identifier", {
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -184,9 +184,7 @@ const isObjectValues = t().buildMatchMemberExpression("Object.values");
 const isObjectEntries = t().buildMatchMemberExpression("Object.entries");
 
 function CallExpression() {
-  const {
-    callee
-  } = this.node;
+  const callee = this.node.callee;
 
   if (isObjectKeys(callee)) {
     return t().arrayTypeAnnotation(t().stringTypeAnnotation());

package/lib/path/introspection.js

@@ -21,12 +21,13 @@ exports._guessExecutionStatusRelativeToDifferentFunctions = _guessExecutionStatu
 exports.resolve = resolve;
 exports._resolve = _resolve;
 exports.isConstantExpression = isConstantExpression;
+exports.isInStrictMode = isInStrictMode;
 exports.is = void 0;
 
 function _includes() {
   const data = _interopRequireDefault(require("lodash/includes"));
 
-  _includes = function () {
+  _includes = function _includes() {
     return data;
   };
 
@@ -36,7 +37,7 @@ function _includes() {
 function t() {
   const data = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
+  t = function t() {
     return data;
   };
 
@@ -229,7 +230,20 @@ function _guessExecutionStatusRelativeToDifferentFunctions(targetFuncParent) {
   if (!binding.references) return "before";
   const referencePaths = binding.referencePaths;
 
-  for (const path of referencePaths) {
+  for (var _iterator = referencePaths, _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 path = _ref;
+
     if (path.key !== "callee" || !path.parentPath.isCallExpression()) {
       return;
     }
@@ -237,7 +251,19 @@ function _guessExecutionStatusRelativeToDifferentFunctions(targetFuncParent) {
 
   let allStatus;
 
-  for (const path of referencePaths) {
+  for (var _iterator2 = referencePaths, _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;
+    }
+
+    const path = _ref2;
     const childOfFunction = !!path.find(path => path.node === targetFuncPath.node);
     if (childOfFunction) continue;
 
@@ -287,8 +313,10 @@ function _resolve(dangerous, resolved) {
 
     if (target.isObjectExpression()) {
       const props = target.get("properties");
+      var _arr = props;
 
-      for (const prop of props) {
+      for (var _i3 = 0; _i3 < _arr.length; _i3++) {
+        const prop = _arr[_i3];
         if (!prop.isProperty()) continue;
         const key = prop.get("key");
         let match = prop.isnt("computed") && key.isIdentifier({
@@ -343,4 +371,42 @@ function isConstantExpression() {
   }
 
   return false;
+}
+
+function isInStrictMode() {
+  const start = this.isProgram() ? this : this.parentPath;
+  const strictParent = start.find(path => {
+    if (path.isProgram({
+      sourceType: "module"
+    })) return true;
+    if (path.isClass()) return true;
+    if (!path.isProgram() && !path.isFunction()) return false;
+
+    if (path.isArrowFunctionExpression() && !path.get("body").isBlockStatement()) {
+      return false;
+    }
+
+    let node = path.node;
+    if (path.isFunction()) node = node.body;
+
+    for (var _iterator3 = node.directives, _isArray3 = Array.isArray(_iterator3), _i4 = 0, _iterator3 = _isArray3 ? _iterator3 : _iterator3[Symbol.iterator]();;) {
+      var _ref3;
+
+      if (_isArray3) {
+        if (_i4 >= _iterator3.length) break;
+        _ref3 = _iterator3[_i4++];
+      } else {
+        _i4 = _iterator3.next();
+        if (_i4.done) break;
+        _ref3 = _i4.value;
+      }
+
+      const directive = _ref3;
+
+      if (directive.value.value === "use strict") {
+        return true;
+      }
+    }
+  });
+  return !!strictParent;
 }