hermes-estree 0.32.1 → 0.33.0

package/dist/src/getModuleDocblock.js

@@ -1,112 +0,0 @@
-/**
- * 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
- */
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getModuleDocblock = getModuleDocblock;
-exports.parseDocblockString = parseDocblockString;
-const DIRECTIVE_REGEX = /^\s*@([a-zA-Z0-9_-]+)( +.+)?$/;
-
-function parseDocblockString(docblock) {
-  const directiveLines = docblock.split('\n') // remove the leading " *" from each line
-  .map(line => line.trimStart().replace(/^\* ?/, '').trim()).filter(line => line.startsWith('@'));
-  const directives = // $FlowExpectedError[incompatible-type] - flow types  this return as {...}
-  Object.create(null);
-
-  for (const line of directiveLines) {
-    var _match$;
-
-    const match = DIRECTIVE_REGEX.exec(line);
-
-    if (match == null) {
-      continue;
-    }
-
-    const name = match[1]; // explicitly use an empty string if there's no value
-    // this way the array length tracks how many instances of the directive there was
-
-    const value = ((_match$ = match[2]) != null ? _match$ : '').trim();
-
-    if (directives[name]) {
-      directives[name].push(value);
-    } else {
-      directives[name] = [value];
-    }
-  }
-
-  return directives;
-}
-
-function getModuleDocblock(hermesProgram) {
-  const docblockNode = (() => {
-    if (hermesProgram.type !== 'Program') {
-      return null;
-    } // $FlowExpectedError[incompatible-type] - escape out of the unsafe hermes types
-
-
-    const program = hermesProgram;
-
-    if (program.comments.length === 0) {
-      return null;
-    }
-
-    const firstComment = (() => {
-      const first = program.comments[0];
-
-      if (first.type === 'Block') {
-        return first;
-      }
-
-      if (program.comments.length === 1) {
-        return null;
-      } // ESLint will always strip out the shebang comment from the code before passing it to the parser
-      // https://github.com/eslint/eslint/blob/21d647904dc30f9484b22acdd9243a6d0ecfba38/lib/linter/linter.js#L779
-      // this means that we're forced to parse it as a line comment :(
-      // this hacks around it by selecting the second comment in this case
-
-
-      const second = program.comments[1];
-
-      if (first.type === 'Line' && first.range[0] === 0 && second.type === 'Block') {
-        return second;
-      }
-
-      return null;
-    })();
-
-    if (firstComment == null) {
-      return null;
-    }
-    /*
-    Handle cases like this where the comment isn't actually the first thing in the code:
-    ```
-    const x = 1; /* docblock *./
-    ```
-    */
-
-
-    if (program.body.length > 0 && program.body[0].range[0] < firstComment.range[0]) {
-      return null;
-    }
-
-    return firstComment;
-  })();
-
-  if (docblockNode == null) {
-    return null;
-  }
-
-  return {
-    directives: parseDocblockString(docblockNode.value),
-    comment: docblockNode
-  };
-}

package/dist/src/transform/SimpleTransform.js

@@ -1,136 +0,0 @@
-/**
- * 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
- */
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.SimpleTransform = void 0;
-
-var _SimpleTraverser = require("../traverse/SimpleTraverser");
-
-var _astNodeMutationHelpers = require("./astNodeMutationHelpers");
-
-function setParentPointer(node, parent) {
-  if (parent != null) {
-    if (Array.isArray(node)) {
-      for (const item of node) {
-        // $FlowExpectedError[cannot-write]
-        item.parent = parent;
-      }
-    } else {
-      // $FlowExpectedError[cannot-write]
-      node.parent = parent;
-    }
-  }
-}
-/**
- * A simple class to recursively tranform AST trees.
- */
-
-
-class SimpleTransform {
-  /**
-   * Transform the given AST tree.
-   * @param rootNode The root node to traverse.
-   * @param options The option object.
-   * @return The modified rootNode or a new node if the rootNode was transformed directly.
-   */
-  transform(rootNode, options) {
-    let resultRootNode = rootNode;
-
-    _SimpleTraverser.SimpleTraverser.traverse(rootNode, {
-      enter: (node, parent) => {
-        // Ensure the parent pointers are correctly set before entering the node.
-        setParentPointer(node, parent);
-        const resultNode = options.transform(node);
-
-        if (resultNode !== node) {
-          let traversedResultNode = null;
-
-          if (resultNode != null) {
-            // Ensure the new node has the correct parent pointers before recursing again.
-            setParentPointer(resultNode, parent);
-
-            if (Array.isArray(resultNode)) {
-              traversedResultNode = resultNode.map(item => this.transform(item, options)).filter(item => item != null);
-            } else {
-              traversedResultNode = this.transform(resultNode, options);
-            }
-          }
-
-          if (parent == null) {
-            if (node !== rootNode) {
-              throw new Error('SimpleTransform infra error: Parent not set on non root node, this should not be possible');
-            }
-
-            if (Array.isArray(traversedResultNode)) {
-              throw new Error('SimpleTransform: invalid array result for root node');
-            } else {
-              resultRootNode = traversedResultNode;
-            }
-          } else if (traversedResultNode == null) {
-            (0, _astNodeMutationHelpers.removeNodeOnParent)(node, parent, options.visitorKeys);
-          } else {
-            (0, _astNodeMutationHelpers.replaceNodeOnParent)(node, parent, traversedResultNode, options.visitorKeys);
-            setParentPointer(traversedResultNode, parent);
-          }
-
-          throw _SimpleTraverser.SimpleTraverser.Skip;
-        }
-      },
-
-      leave(_node) {},
-
-      visitorKeys: options.visitorKeys
-    });
-
-    return resultRootNode;
-  }
-  /**
-   * Transform the given AST tree.
-   * @param node The root node to traverse.
-   * @param options The option object.
-   */
-
-
-  static transform(node, options) {
-    return new SimpleTransform().transform(node, options);
-  }
-
-  static transformProgram(program, options) {
-    const result = SimpleTransform.transform(program, options);
-
-    if ((result == null ? void 0 : result.type) === 'Program') {
-      return result;
-    }
-
-    throw new Error('SimpleTransform.transformProgram: Expected program node.');
-  }
-  /**
-   * Return a new AST node with the given properties overrided if needed.
-   *
-   * This function takes care to only create new nodes when needed. Referential equality of nodes
-   * is important as its used to know if a node should be re-traversed.
-   *
-   * @param node The base AST node.
-   * @param overrideProps New properties to apply to the node.
-   * @return Either the orginal node if the properties matched the existing node or a new node with
-   *         the new properties.
-   */
-
-
-  static nodeWith(node, overrideProps, visitorKeys) {
-    return (0, _astNodeMutationHelpers.nodeWith)(node, overrideProps, visitorKeys);
-  }
-
-}
-
-exports.SimpleTransform = SimpleTransform;

package/dist/src/transform/astArrayMutationHelpers.js

@@ -1,62 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.arrayIsEqual = arrayIsEqual;
-exports.insertInArray = insertInArray;
-exports.removeFromArray = removeFromArray;
-exports.replaceInArray = replaceInArray;
-
-/**
- * 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
- */
-function assertArrayBounds(array, index) {
-  if (index < 0 || index >= array.length) {
-    throw new Error(`Invalid Mutation: Tried to mutate an elements array with an out of bounds index. Index: ${index}, Array Size: ${array.length}`);
-  }
-}
-
-function arrayIsEqual(a1, a2) {
-  if (a1 === a2) {
-    return true;
-  }
-
-  if (a1.length !== a2.length) {
-    return false;
-  }
-
-  for (let i = 0; i < a1.length; i++) {
-    if (a1[i] !== a2[i]) {
-      return false;
-    }
-  }
-
-  return true;
-}
-
-function insertInArray(array, index, elements) {
-  if (index === array.length) {
-    // Support the insert at end of array case.
-    return array.concat(elements);
-  }
-
-  assertArrayBounds(array, index);
-  return array.slice(0, index).concat(elements).concat(array.slice(index));
-}
-
-function removeFromArray(array, index) {
-  assertArrayBounds(array, index);
-  return [...array.slice(0, index), ...array.slice(index + 1)];
-}
-
-function replaceInArray(array, index, elements) {
-  assertArrayBounds(array, index);
-  return array.slice(0, index).concat(elements).concat(array.slice(index + 1));
-}

package/dist/src/transform/astNodeMutationHelpers.js

@@ -1,200 +0,0 @@
-/**
- * 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
- */
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.deepCloneNode = deepCloneNode;
-exports.nodeWith = nodeWith;
-exports.removeNodeOnParent = removeNodeOnParent;
-exports.replaceNodeOnParent = replaceNodeOnParent;
-exports.setParentPointersInDirectChildren = setParentPointersInDirectChildren;
-exports.shallowCloneNode = shallowCloneNode;
-exports.updateAllParentPointers = updateAllParentPointers;
-
-var _astArrayMutationHelpers = require("./astArrayMutationHelpers");
-
-var _getVisitorKeys = require("../traverse/getVisitorKeys");
-
-var _SimpleTraverser = require("../traverse/SimpleTraverser");
-
-function getParentKey(target, parent, visitorKeys) {
-  if (parent == null) {
-    throw new Error(`Expected parent node to be set on "${target.type}"`);
-  }
-
-  for (const key of (0, _getVisitorKeys.getVisitorKeys)(parent, visitorKeys)) {
-    if ((0, _getVisitorKeys.isNode)( // $FlowExpectedError[prop-missing]
-    parent[key])) {
-      // $FlowFixMe[invalid-compare]
-      if (parent[key] === target) {
-        return {
-          type: 'single',
-          node: parent,
-          key
-        };
-      }
-    } else if (Array.isArray(parent[key])) {
-      for (let i = 0; i < parent[key].length; i += 1) {
-        // $FlowExpectedError[invalid-tuple-index]
-        const current = parent[key][i];
-
-        if (current === target) {
-          return {
-            type: 'array',
-            node: parent,
-            key,
-            targetIndex: i
-          };
-        }
-      }
-    }
-  } // this shouldn't happen ever
-
-
-  throw new Error(`Expected to find the ${target.type} as a direct child of the ${parent.type}.`);
-}
-/**
- * Replace a node with a new node within an AST (via the parent pointer).
- */
-
-
-function replaceNodeOnParent(originalNode, originalNodeParent, nodeToReplaceWith, visitorKeys) {
-  const replacementParent = getParentKey(originalNode, originalNodeParent, visitorKeys);
-  const parent = replacementParent.node;
-
-  if (replacementParent.type === 'array') {
-    // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key] = (0, _astArrayMutationHelpers.replaceInArray)( // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key], replacementParent.targetIndex, Array.isArray(nodeToReplaceWith) ? nodeToReplaceWith : [nodeToReplaceWith]);
-  } else {
-    if (Array.isArray(nodeToReplaceWith)) {
-      throw new Error(`Cannot insert array into non-array parent type: ${parent.type}`);
-    } // $FlowExpectedError[prop-missing]
-
-
-    parent[replacementParent.key] = nodeToReplaceWith;
-  }
-}
-/**
- * Remove a node from the AST its connected to (via the parent pointer).
- */
-
-
-function removeNodeOnParent(originalNode, originalNodeParent, visitorKeys) {
-  const replacementParent = getParentKey(originalNode, originalNodeParent, visitorKeys);
-  const parent = replacementParent.node;
-
-  if (replacementParent.type === 'array') {
-    // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key] = (0, _astArrayMutationHelpers.removeFromArray)( // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key], replacementParent.targetIndex);
-  } else {
-    // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key] = null;
-  }
-}
-/**
- * Corrects the parent pointers in direct children of the given node.
- */
-
-
-function setParentPointersInDirectChildren(node, visitorKeys) {
-  for (const key of (0, _getVisitorKeys.getVisitorKeys)(node, visitorKeys)) {
-    if ((0, _getVisitorKeys.isNode)(node[key])) {
-      // $FlowExpectedError[cannot-write]
-      node[key].parent = node;
-    } else if (Array.isArray(node[key])) {
-      for (const child of node[key]) {
-        child.parent = node;
-      }
-    }
-  }
-}
-/**
- * Traverses the entire subtree to ensure the parent pointers are set correctly.
- */
-
-
-function updateAllParentPointers(node, visitorKeys) {
-  _SimpleTraverser.SimpleTraverser.traverse(node, {
-    enter(node, parent) {
-      // $FlowExpectedError[cannot-write]
-      node.parent = parent;
-    },
-
-    leave() {},
-
-    visitorKeys
-  });
-}
-/**
- * Clone node and add new props.
- *
- * This will only create a new object if the overrides actually result in a change.
- */
-
-
-function nodeWith(node, overrideProps, visitorKeys) {
-  // Check if this will actually result in a change, maintaining referential equality is important.
-  const willBeUnchanged = Object.entries(overrideProps).every(([key, value]) => {
-    const node_ = node;
-
-    if (Array.isArray(value)) {
-      return Array.isArray(node_[key]) ? (0, _astArrayMutationHelpers.arrayIsEqual)(node_[key], value) : false;
-    }
-
-    return node_[key] === value;
-  });
-
-  if (willBeUnchanged) {
-    return node;
-  } // Create new node.
-  // $FlowExpectedError[cannot-spread-interface]
-
-
-  const newNode = { ...node,
-    ...overrideProps
-  }; // Ensure parent pointers are correctly set within this nodes children.
-
-  setParentPointersInDirectChildren(newNode, visitorKeys);
-  return newNode;
-}
-/**
- * Shallow clones node, providing a new reference for an existing node.
- */
-
-
-function shallowCloneNode(node, visitorKeys) {
-  // $FlowExpectedError[cannot-spread-interface]
-  const newNode = { ...node
-  }; // Ensure parent pointers are correctly set within this nodes children.
-
-  setParentPointersInDirectChildren(newNode, visitorKeys);
-  return newNode;
-}
-/**
- * Deeply clones node and its entire tree.
- */
-
-
-function deepCloneNode(node, visitorKeys) {
-  const clone = JSON.parse(JSON.stringify(node, (key, value) => {
-    // null out parent pointers
-    if (key === 'parent') {
-      return undefined;
-    }
-
-    return value;
-  }));
-  updateAllParentPointers(clone, visitorKeys);
-  return clone;
-}

package/dist/src/traverse/SimpleTraverser.js

@@ -1,137 +0,0 @@
-/**
- * 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
- */
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.SimpleTraverserSkip = exports.SimpleTraverserBreak = exports.SimpleTraverser = void 0;
-
-var _getVisitorKeys = require("./getVisitorKeys");
-
-/**
- * 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
- */
-const SimpleTraverserSkip = new Error();
-/**
- * Can be thrown at any point during the traversal to immediately stop traversal
- * entirely.
- */
-
-exports.SimpleTraverserSkip = SimpleTraverserSkip;
-const SimpleTraverserBreak = new Error();
-/**
- * A very simple traverser class to traverse AST trees.
- */
-
-exports.SimpleTraverserBreak = SimpleTraverserBreak;
-
-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
-   */
-
-
-  _traverse(node, parent, options) {
-    if (!(0, _getVisitorKeys.isNode)(node)) {
-      return;
-    }
-
-    try {
-      options.enter(node, parent);
-    } catch (ex) {
-      if (ex === SimpleTraverserSkip) {
-        return;
-      }
-
-      this._setErrorContext(ex, node);
-
-      throw ex;
-    }
-
-    const keys = (0, _getVisitorKeys.getVisitorKeys)(node, options.visitorKeys);
-
-    for (const key of keys) {
-      const child = node[key];
-
-      if (Array.isArray(child)) {
-        for (let j = 0; j < child.length; ++j) {
-          this._traverse(child[j], node, options);
-        }
-      } else {
-        this._traverse(child, node, options);
-      }
-    }
-
-    try {
-      options.leave(node, parent);
-    } catch (ex) {
-      if (ex === SimpleTraverserSkip) {
-        return;
-      }
-
-      this._setErrorContext(ex, node);
-
-      throw ex;
-    }
-  }
-  /**
-   * Set useful contextual information onto the error object.
-   * @param ex The error object.
-   * @param node The current node.
-   * @private
-   */
-
-
-  _setErrorContext(ex, node) {
-    // $FlowFixMe[prop-missing]
-    ex.currentNode = {
-      type: node.type,
-      range: node.range,
-      loc: node.loc
-    };
-  }
-  /**
-   * 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);
-  }
-
-}
-
-exports.SimpleTraverser = SimpleTraverser;
-SimpleTraverser.Break = SimpleTraverserBreak;
-SimpleTraverser.Skip = SimpleTraverserSkip;

package/dist/src/traverse/getVisitorKeys.js

@@ -1,37 +0,0 @@
-/**
- * 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.
- *
- * 
- * @noformat
- */
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getVisitorKeys = getVisitorKeys;
-exports.isNode = isNode;
-
-var _ESTreeVisitorKeys = _interopRequireDefault(require("../generated/ESTreeVisitorKeys"));
-
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
-function isNode(thing)
-/*: implies thing is {+[string]: mixed} */
-{
-  return typeof thing === 'object' && thing != null && typeof thing.type === 'string';
-}
-
-function getVisitorKeys(node, visitorKeys) {
-  const keys = (visitorKeys != null ? visitorKeys : _ESTreeVisitorKeys.default)[node.type];
-
-  if (keys == null) {
-    throw new Error(`No visitor keys found for node type "${node.type}".`);
-  } // $FlowExpectedError[prop-missing]
-
-
-  return keys;
-}