hermes-transform 0.5.0 → 0.6.0

package/dist/traverse/SimpleTraverser.js

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
  *
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
@@ -16,134 +16,103 @@ exports.SimpleTraverserSkip = exports.SimpleTraverserBreak = exports.SimpleTrave
 
 var _getVisitorKeys = require("../getVisitorKeys");
 
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
-function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
-
-function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }
-
-function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }
-
 /**
  * Can be thrown within the traversal "enter" function to prevent the traverser
  * from traversing the node any further, essentially culling the remainder of the
  * AST branch
  */
-var SimpleTraverserSkip = new Error();
+const SimpleTraverserSkip = new Error();
 /**
  * Can be thrown at any point during the traversal to immediately stop traversal
  * entirely.
  */
 
 exports.SimpleTraverserSkip = SimpleTraverserSkip;
-var SimpleTraverserBreak = new Error();
+const SimpleTraverserBreak = new Error();
 /**
  * A very simple traverser class to traverse AST trees.
  */
 
 exports.SimpleTraverserBreak = SimpleTraverserBreak;
 
-var SimpleTraverser = /*#__PURE__*/function () {
-  function SimpleTraverser() {
-    _classCallCheck(this, SimpleTraverser);
+class SimpleTraverser {
+  /**
+   * Traverse the given AST tree.
+   * @param node The root node to traverse.
+   * @param options The option object.
+   */
+  traverse(node, options) {
+    try {
+      this._traverse(node, null, options);
+    } catch (ex) {
+      if (ex === SimpleTraverserBreak) {
+        return;
+      }
+
+      throw ex;
+    }
   }
+  /**
+   * Traverse the given AST tree recursively.
+   * @param node The current node.
+   * @param parent The parent node.
+   * @private
+   */
 
-  _createClass(SimpleTraverser, [{
-    key: "traverse",
-    value:
-    /**
-     * Traverse the given AST tree.
-     * @param node The root node to traverse.
-     * @param options The option object.
-     */
-    function traverse(node, options) {
-      try {
-        this._traverse(node, null, options);
-      } catch (ex) {
-        if (ex === SimpleTraverserBreak) {
-          return;
-        }
 
-        throw ex;
-      }
+  _traverse(node, parent, options) {
+    if (!(0, _getVisitorKeys.isNode)(node)) {
+      return;
     }
-    /**
-     * Traverse the given AST tree recursively.
-     * @param node The current node.
-     * @param parent The parent node.
-     * @private
-     */
-
-  }, {
-    key: "_traverse",
-    value: function _traverse(node, parent, options) {
-      if (!(0, _getVisitorKeys.isNode)(node)) {
-        return;
-      }
 
-      try {
-        options.enter(node, parent);
-      } catch (ex) {
-        if (ex === SimpleTraverserSkip) {
-          return;
-        }
-
-        throw ex;
+    try {
+      options.enter(node, parent);
+    } catch (ex) {
+      if (ex === SimpleTraverserSkip) {
+        return;
       }
 
-      var keys = (0, _getVisitorKeys.getVisitorKeys)(node);
+      throw ex;
+    }
 
-      var _iterator = _createForOfIteratorHelper(keys),
-          _step;
+    const keys = (0, _getVisitorKeys.getVisitorKeys)(node);
 
-      try {
-        for (_iterator.s(); !(_step = _iterator.n()).done;) {
-          var key = _step.value;
-          // $FlowExpectedError[prop-missing]
-          var child = node[key];
+    for (const key of keys) {
+      // $FlowExpectedError[prop-missing]
+      const child = node[key];
 
-          if (Array.isArray(child)) {
-            for (var j = 0; j < child.length; ++j) {
-              this._traverse(child[j], node, options);
-            }
-          } else {
-            this._traverse(child, node, options);
-          }
+      if (Array.isArray(child)) {
+        for (let j = 0; j < child.length; ++j) {
+          this._traverse(child[j], node, options);
         }
-      } catch (err) {
-        _iterator.e(err);
-      } finally {
-        _iterator.f();
+      } else {
+        this._traverse(child, node, options);
       }
+    }
 
-      try {
-        options.leave(node, parent);
-      } catch (ex) {
-        if (ex === SimpleTraverserSkip) {
-          return;
-        }
-
-        throw ex;
+    try {
+      options.leave(node, parent);
+    } catch (ex) {
+      if (ex === SimpleTraverserSkip) {
+        return;
       }
+
+      throw ex;
     }
-    /**
-     * Traverse the given AST tree.
-     * @param node The root node to traverse.
-     * @param options The option object.
-     */
-
-  }], [{
-    key: "traverse",
-    value: function traverse(node, options) {
-      new SimpleTraverser().traverse(node, options);
-    }
-  }]);
+  }
+  /**
+   * Traverse the given AST tree.
+   * @param node The root node to traverse.
+   * @param options The option object.
+   */
+
+
+  static traverse(node, options) {
+    new SimpleTraverser().traverse(node, options);
+  }
 
-  return SimpleTraverser;
-}();
+}
 
-exports.SimpleTraverser = SimpleTraverser;
+exports.SimpleTraverser = SimpleTraverser;
+SimpleTraverser.Break = SimpleTraverserBreak;
+SimpleTraverser.Skip = SimpleTraverserSkip;

package/dist/traverse/SimpleTraverser.js.flow

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
  *
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
@@ -38,6 +38,9 @@ export const SimpleTraverserBreak: Error = new Error();
  * A very simple traverser class to traverse AST trees.
  */
 export class SimpleTraverser {
+  static Break: Error = SimpleTraverserBreak;
+  static Skip: Error = SimpleTraverserSkip;
+
   /**
    * Traverse the given AST tree.
    * @param node The root node to traverse.

package/dist/traverse/esquery.js

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
  *
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
@@ -16,22 +16,22 @@ exports.query = exports.parse = exports.matches = exports.match = void 0;
 
 var _esquery = _interopRequireDefault(require("esquery"));
 
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 
 // $FlowExpectedError[cannot-resolve-module]
 
 /** Parse a selector and return its AST. */
-var parse = _esquery["default"].parse;
+const parse = _esquery.default.parse;
 /** From a JS AST and a selector AST, collect all JS AST nodes that match the selector. */
 
 exports.parse = parse;
-var match = _esquery["default"].match;
+const match = _esquery.default.match;
 /** Given a `node` and its ancestors, determine if `node` is matched by `selector`. */
 
 exports.match = match;
-var matches = _esquery["default"].matches;
+const matches = _esquery.default.matches;
 /** Query the code AST using the selector string. */
 
 exports.matches = matches;
-var query = _esquery["default"].query;
+const query = _esquery.default.query;
 exports.query = query;

package/dist/traverse/esquery.js.flow

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
  *
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.

package/dist/traverse/traverse.js

@@ -12,17 +12,15 @@ var _SafeEmitter = require("./SafeEmitter");
 
 var _SimpleTraverser = require("./SimpleTraverser");
 
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
-
-function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * 
+ * @format
+ */
 
 /**
  * Traverse the AST with additional context members provided by `additionalContext`.
@@ -31,34 +29,35 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
  * @param additionalContext a callback function which returns additional context members to add to the context provided to the visitor
  */
 function traverseWithContext(ast, scopeManager, additionalContext, visitor) {
-  var emitter = new _SafeEmitter.SafeEmitter();
-  var nodeQueue = [];
-  var currentNode = ast; // set parent pointers and build up the traversal queue
+  const emitter = new _SafeEmitter.SafeEmitter();
+  const nodeQueue = [];
+  let currentNode = ast; // set parent pointers and build up the traversal queue
 
   _SimpleTraverser.SimpleTraverser.traverse(ast, {
-    enter: function enter(node, parent) {
+    enter(node, parent) {
       // $FlowExpectedError[cannot-write] - hermes doesn't set this
       node.parent = parent;
       nodeQueue.push({
         isEntering: true,
-        node: node
+        node
       });
     },
-    leave: function leave(node) {
+
+    leave(node) {
       nodeQueue.push({
         isEntering: false,
-        node: node
+        node
       });
     }
+
   });
 
-  var getScope = function getScope() {
-    var givenNode = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : currentNode;
+  const getScope = (givenNode = currentNode) => {
     // On Program node, get the outermost scope to avoid return Node.js special function scope or ES modules scope.
-    var inner = givenNode.type !== 'Program';
+    const inner = givenNode.type !== 'Program';
 
-    for (var _node = givenNode; _node; _node = _node.parent) {
-      var scope = scopeManager.acquire(_node, inner);
+    for (let node = givenNode; node; node = node.parent) {
+      const scope = scopeManager.acquire(node, inner);
 
       if (scope) {
         if (scope.type === 'function-expression-name') {
@@ -72,29 +71,16 @@ function traverseWithContext(ast, scopeManager, additionalContext, visitor) {
     return scopeManager.scopes[0];
   };
 
-  var traversalContextBase = Object.freeze({
-    getDeclaredVariables: function getDeclaredVariables(node) {
-      return scopeManager.getDeclaredVariables(node);
-    },
-    getBinding: function getBinding(name) {
-      var currentScope = getScope();
+  const traversalContextBase = Object.freeze({
+    getDeclaredVariables: node => scopeManager.getDeclaredVariables(node),
+    getBinding: name => {
+      let currentScope = getScope();
 
       while (currentScope != null) {
-        var _iterator = _createForOfIteratorHelper(currentScope.variables),
-            _step;
-
-        try {
-          for (_iterator.s(); !(_step = _iterator.n()).done;) {
-            var variable = _step.value;
-
-            if (variable.defs.length && variable.name === name) {
-              return variable;
-            }
+        for (const variable of currentScope.variables) {
+          if (variable.defs.length && variable.name === name) {
+            return variable;
           }
-        } catch (err) {
-          _iterator.e(err);
-        } finally {
-          _iterator.f();
         }
 
         currentScope = currentScope.upper;
@@ -102,23 +88,25 @@ function traverseWithContext(ast, scopeManager, additionalContext, visitor) {
 
       return null;
     },
-    getScope: getScope
+    getScope
+  });
+  const traversalContext = Object.freeze({ ...traversalContextBase,
+    ...additionalContext(traversalContextBase)
   });
-  var traversalContext = Object.freeze(_objectSpread(_objectSpread({}, traversalContextBase), additionalContext(traversalContextBase)));
-  var selectors = visitor(traversalContext); // add all the selectors from the visitor as listeners
+  const selectors = visitor(traversalContext); // add all the selectors from the visitor as listeners
 
-  Object.keys(selectors).forEach(function (selector) {
+  Object.keys(selectors).forEach(selector => {
     // flow doesn't want us to be general here - but it's safe
     // $FlowExpectedError[incompatible-type]
     // $FlowExpectedError[prop-missing]
-    var listener = selectors[selector];
+    const listener = selectors[selector];
 
     if (listener) {
       emitter.on(selector, listener);
     }
   });
-  var eventGenerator = new _NodeEventGenerator.NodeEventGenerator(emitter);
-  nodeQueue.forEach(function (traversalInfo) {
+  const eventGenerator = new _NodeEventGenerator.NodeEventGenerator(emitter);
+  nodeQueue.forEach(traversalInfo => {
     currentNode = traversalInfo.node;
 
     try {
@@ -135,5 +123,5 @@ function traverseWithContext(ast, scopeManager, additionalContext, visitor) {
 }
 
 function traverse(ast, scopeManager, visitor) {
-  traverseWithContext(ast, scopeManager, function () {}, visitor);
+  traverseWithContext(ast, scopeManager, () => {}, visitor);
 }

package/dist/traverse/traverse.js.flow

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
  *
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "hermes-transform",
-  "version": "0.5.0",
+  "version": "0.6.0",
   "description": "Tools built on top of Hermes-ESTree to enable codebase transformation",
   "main": "dist/index.js",
   "license": "MIT",
@@ -9,9 +9,10 @@
     "url": "git@github.com:facebook/hermes.git"
   },
   "dependencies": {
+    "@babel/code-frame": "^7.16.0",
     "esquery": "^1.4.0",
-    "hermes-eslint": "0.5.0",
-    "hermes-estree": "0.5.0"
+    "hermes-eslint": "0.6.0",
+    "hermes-estree": "0.6.0"
   },
   "peerDependencies": {
     "prettier": "^2.4.1"