hermes-estree 0.32.1 → 0.33.0

package/dist/src/utils/Builders.js

@@ -1,191 +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.EMPTY_PARENT = void 0;
-exports.callExpression = callExpression;
-exports.conjunction = conjunction;
-exports.createDefaultPosition = createDefaultPosition;
-exports.disjunction = disjunction;
-exports.etc = etc;
-exports.ident = ident;
-exports.iife = iife;
-exports.nullLiteral = nullLiteral;
-exports.numberLiteral = numberLiteral;
-exports.stringLiteral = stringLiteral;
-exports.throwStatement = throwStatement;
-exports.typeofExpression = typeofExpression;
-exports.variableDeclaration = variableDeclaration;
-// Rely on the mapper to fix up parent relationships.
-const EMPTY_PARENT = null;
-exports.EMPTY_PARENT = EMPTY_PARENT;
-
-function createDefaultPosition() {
-  return {
-    line: 1,
-    column: 0
-  };
-}
-
-function etc({
-  loc,
-  range,
-  parent
-} = {}) {
-  return {
-    loc: {
-      start: (loc == null ? void 0 : loc.start) != null ? loc.start : createDefaultPosition(),
-      end: (loc == null ? void 0 : loc.end) != null ? loc.end : createDefaultPosition()
-    },
-    range: range != null ? range : [0, 0],
-    parent: parent != null ? parent : EMPTY_PARENT
-  };
-}
-
-function ident(name, info) {
-  return {
-    type: 'Identifier',
-    name,
-    optional: false,
-    typeAnnotation: null,
-    ...etc(info)
-  };
-}
-
-function stringLiteral(value, info) {
-  return {
-    type: 'Literal',
-    value,
-    raw: `"${value}"`,
-    literalType: 'string',
-    ...etc(info)
-  };
-}
-
-function numberLiteral(value, info) {
-  return {
-    type: 'Literal',
-    value,
-    raw: String(value),
-    literalType: 'numeric',
-    ...etc(info)
-  };
-}
-
-function nullLiteral(info) {
-  return {
-    type: 'Literal',
-    value: null,
-    raw: 'null',
-    literalType: 'null',
-    ...etc(info)
-  };
-}
-
-function conjunction(tests) {
-  if (tests.length === 0) {
-    throw new Error('Must have at least one test.');
-  }
-
-  return tests.reduce((acc, test) => ({
-    type: 'LogicalExpression',
-    left: acc,
-    right: test,
-    operator: '&&',
-    ...etc()
-  }));
-}
-
-function disjunction(tests) {
-  if (tests.length === 0) {
-    throw new Error('Must have at least one test.');
-  }
-
-  return tests.reduce((acc, test) => ({
-    type: 'LogicalExpression',
-    left: acc,
-    right: test,
-    operator: '||',
-    ...etc()
-  }));
-}
-
-function variableDeclaration(kind, id, init, info) {
-  return {
-    type: 'VariableDeclaration',
-    kind,
-    declarations: [{
-      type: 'VariableDeclarator',
-      init,
-      id,
-      ...etc(),
-      parent: EMPTY_PARENT
-    }],
-    ...etc(info)
-  };
-}
-
-function callExpression(callee, args, info) {
-  return {
-    type: 'CallExpression',
-    callee,
-    arguments: args,
-    typeArguments: null,
-    optional: false,
-    ...etc(info)
-  };
-}
-
-function throwStatement(arg, info) {
-  return {
-    type: 'ThrowStatement',
-    argument: callExpression(ident('Error'), [arg]),
-    ...etc(info)
-  };
-}
-
-function iife(statements, params = [], args = []) {
-  const callee = {
-    type: 'ArrowFunctionExpression',
-    params,
-    expression: false,
-    async: false,
-    predicate: null,
-    returnType: null,
-    typeParameters: null,
-    id: null,
-    body: {
-      type: 'BlockStatement',
-      body: statements,
-      ...etc()
-    },
-    ...etc()
-  };
-  return callExpression(callee, args);
-}
-
-function typeofExpression(arg, kind) {
-  return {
-    type: 'BinaryExpression',
-    left: {
-      type: 'UnaryExpression',
-      operator: 'typeof',
-      argument: arg,
-      prefix: true,
-      ...etc()
-    },
-    right: stringLiteral(kind),
-    operator: '===',
-    ...etc()
-  };
-}

package/dist/src/utils/GenID.js

@@ -1,41 +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.createGenID = createGenID;
-const genPrefix = '$$gen$';
-
-function createGenID(uniqueTransformPrefix) {
-  let genN = 0;
-  const used = new Set();
-  return {
-    genID() {
-      let name;
-
-      do {
-        name = `${genPrefix}${uniqueTransformPrefix}${genN}`;
-        genN++;
-      } while (used.has(name));
-
-      used.add(name);
-      return name;
-    },
-
-    addUsage(name) {
-      if (name.startsWith(genPrefix)) {
-        used.add(name);
-      }
-    }
-
-  };
-}

package/dist/src/utils/createSyntaxError.js

@@ -1,25 +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.createSyntaxError = createSyntaxError;
-
-function createSyntaxError(node, err) {
-  const syntaxError = new SyntaxError(err); // $FlowExpectedError[prop-missing]
-
-  syntaxError.loc = {
-    line: node.loc.start.line,
-    column: node.loc.start.column
-  };
-  return syntaxError;
-}

package/dist/src/utils/mutateESTreeASTForPrettier.js

@@ -1,127 +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.default = mutate;
-
-var _SimpleTransform = require("../transform/SimpleTransform");
-
-// https://github.com/prettier/prettier/blob/d962466a828f8ef51435e3e8840178d90b7ec6cd/src/language-js/parse/postprocess/index.js#L161-L182
-function transformChainExpression(node, comments) {
-  if (comments != null) {
-    var _node$comments;
-
-    // $FlowExpectedError[prop-missing]
-    const joinedComments = comments.concat((_node$comments = node.comments) != null ? _node$comments : []); // $FlowExpectedError[prop-missing]
-    // $FlowFixMe[cannot-write]
-
-    node.comments = joinedComments;
-  }
-
-  switch (node.type) {
-    case 'CallExpression':
-      // $FlowExpectedError[cannot-spread-interface]
-      return { ...node,
-        type: 'OptionalCallExpression',
-        callee: transformChainExpression(node.callee)
-      };
-
-    case 'MemberExpression':
-      // $FlowExpectedError[cannot-spread-interface]
-      return { ...node,
-        type: 'OptionalMemberExpression',
-        object: transformChainExpression(node.object)
-      };
-    // No default
-  }
-
-  return node;
-}
-
-function mutate(rootNode, visitorKeys) {
-  // Since we don't return the result of `transform` we need to be careful not to replace the Program root node.
-  _SimpleTransform.SimpleTransform.transform(rootNode, {
-    transform(node) {
-      // prettier fully expects the parent pointers are NOT set and
-      // certain cases can crash due to prettier infinite-looping
-      // whilst naively traversing the parent property
-      // https://github.com/prettier/prettier/issues/11793
-      // Note: Only needed for prettier V2, this is supported in V3
-      if (node.parent) {
-        // $FlowExpectedError[cannot-write]
-        delete node.parent;
-      } // prettier currently relies on the AST being in the old-school, deprecated AST format for optional chaining
-      // so we have to apply their transform to our AST so it can actually format it.
-      // Note: Only needed for prettier V2, this is supported in V3
-
-
-      if (node.type === 'ChainExpression') {
-        // $FlowFixMe[prop-missing]
-        return transformChainExpression(node.expression, node == null ? void 0 : node.comments);
-      } // Prettier currently relies on comparing the `node` vs `node.value` start positions to know if an
-      // `ObjectTypeProperty` is a method or not (instead of using the `node.method` boolean). To correctly print
-      // the node when its not a method we need the start position to be different from the `node.value`s start
-      // position.
-
-
-      if (node.type === 'ObjectTypeProperty') {
-        if (node.method === false && node.kind === 'init' && node.range[0] === 1 && node.value.range[0] === 1) {
-          // $FlowExpectedError[cannot-write]
-          // $FlowExpectedError[cannot-spread-interface]
-          node.value = { ...node.value,
-            range: [2, node.value.range[1]]
-          };
-        }
-
-        return node;
-      } // Prettier currently relies on comparing the the start positions to know if the import/export specifier should have a
-      // rename (eg `Name` vs `Name as Name`) when the name is exactly the same
-      // So we need to ensure that the range is always the same to avoid the useless code printing
-
-
-      if (node.type === 'ImportSpecifier') {
-        if (node.local.name === node.imported.name) {
-          if (node.local.range == null) {
-            // for our TS-ast printing which has no locs
-            // $FlowExpectedError[cannot-write]
-            node.local.range = [0, 0];
-          } // $FlowExpectedError[cannot-write]
-
-
-          node.imported.range = [...node.local.range];
-        }
-
-        return node;
-      }
-
-      if (node.type === 'ExportSpecifier') {
-        if (node.local.name === node.exported.name) {
-          if (node.local.range == null) {
-            // for our TS-ast printing which has no locs
-            // $FlowExpectedError[cannot-write]
-            node.local.range = [0, 0];
-          } // $FlowExpectedError[cannot-write]
-
-
-          node.exported.range = [...node.local.range];
-        }
-
-        return node;
-      }
-
-      return node;
-    },
-
-    visitorKeys
-  });
-}

package/dist/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/transform/SimpleTransform.js.flow

@@ -1,169 +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.
- *
- * @flow strict
- * @format
- */
-
-'use strict';
-
-import type {VisitorKeysType} from '../traverse/getVisitorKeys';
-import type {ESNode, Program} from 'hermes-estree';
-
-import {SimpleTraverser} from '../traverse/SimpleTraverser';
-import {
-  nodeWith,
-  removeNodeOnParent,
-  replaceNodeOnParent,
-} from './astNodeMutationHelpers';
-
-/**
- * Transform callback
- * @param node The node we are visiting
- * @returns
- *   - return input node, signals no changes were made will continue to the next node.
- *   - return new node, the old node will be replaced in the AST. The new node and its
- *     children are then traversed.
- *   - return null, signals the node should be deleted from the AST.
- */
-export type TransformCallback = (
-  node: ESNode,
-) => ESNode | $ReadOnlyArray<ESNode> | null;
-
-export type TransformOptions = $ReadOnly<{
-  /** The callback function which is called on entering each node. */
-  transform: TransformCallback,
-
-  /** The set of visitor keys to use for traversal. Defaults to the Flow ESTree visitor keys */
-  visitorKeys?: ?VisitorKeysType,
-}>;
-
-function setParentPointer(
-  node: ESNode | $ReadOnlyArray<ESNode>,
-  parent: ?ESNode,
-): void {
-  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.
- */
-export 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: ESNode, options: TransformOptions): ESNode | null {
-    let resultRootNode: ESNode | null = rootNode;
-    SimpleTraverser.traverse(rootNode, {
-      enter: (node: ESNode, parent: ?ESNode) => {
-        // Ensure the parent pointers are correctly set before entering the node.
-        setParentPointer(node, parent);
-
-        const resultNode: ESNode | $ReadOnlyArray<ESNode> | null =
-          options.transform(node);
-        if (resultNode !== node) {
-          let traversedResultNode: ESNode | $ReadOnlyArray<ESNode> | null =
-            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) {
-            removeNodeOnParent(node, parent, options.visitorKeys);
-          } else {
-            replaceNodeOnParent(
-              node,
-              parent,
-              traversedResultNode,
-              options.visitorKeys,
-            );
-            setParentPointer(traversedResultNode, parent);
-          }
-
-          throw SimpleTraverser.Skip;
-        }
-      },
-      leave(_node: ESNode) {},
-      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: ESNode, options: TransformOptions): ESNode | null {
-    return new SimpleTransform().transform(node, options);
-  }
-
-  static transformProgram(
-    program: Program,
-    options: TransformOptions,
-  ): Program {
-    const result = SimpleTransform.transform(program, options);
-    if (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<T: ESNode>(
-    node: T,
-    overrideProps: Partial<T>,
-    visitorKeys?: VisitorKeysType,
-  ): T {
-    return nodeWith<T>(node, overrideProps, visitorKeys);
-  }
-}