hermes-estree 0.32.1 → 0.33.1

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

@@ -1,71 +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
- */
-
-function assertArrayBounds<T>(array: $ReadOnlyArray<T>, index: number): void {
-  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}`,
-    );
-  }
-}
-
-export function arrayIsEqual(
-  a1: $ReadOnlyArray<mixed>,
-  a2: $ReadOnlyArray<mixed>,
-): boolean {
-  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;
-}
-
-export function insertInArray<T>(
-  array: $ReadOnlyArray<T>,
-  index: number,
-  elements: $ReadOnlyArray<T>,
-): Array<T> {
-  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));
-}
-
-export function removeFromArray<T>(
-  array: $ReadOnlyArray<T>,
-  index: number,
-): Array<T> {
-  assertArrayBounds(array, index);
-  return [...array.slice(0, index), ...array.slice(index + 1)];
-}
-
-export function replaceInArray<T>(
-  array: $ReadOnlyArray<T>,
-  index: number,
-  elements: $ReadOnlyArray<T>,
-): Array<T> {
-  assertArrayBounds(array, index);
-  return array
-    .slice(0, index)
-    .concat(elements)
-    .concat(array.slice(index + 1));
-}

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

@@ -1,246 +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 {ESNode} from 'hermes-estree';
-import type {VisitorKeysType} from '../traverse/getVisitorKeys';
-
-import {
-  arrayIsEqual,
-  removeFromArray,
-  replaceInArray,
-} from './astArrayMutationHelpers';
-import {getVisitorKeys, isNode} from '../traverse/getVisitorKeys';
-import {SimpleTraverser} from '../traverse/SimpleTraverser';
-
-function getParentKey(
-  target: ESNode,
-  parent: ESNode,
-  visitorKeys?: ?VisitorKeysType,
-): $ReadOnly<
-  | {
-      type: 'single',
-      node: ESNode,
-      key: string,
-    }
-  | {
-      type: 'array',
-      node: ESNode,
-      key: string,
-      targetIndex: number,
-    },
-> {
-  if (parent == null) {
-    throw new Error(`Expected parent node to be set on "${target.type}"`);
-  }
-  for (const key of getVisitorKeys(parent, visitorKeys)) {
-    if (
-      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).
- */
-export function replaceNodeOnParent(
-  originalNode: ESNode,
-  originalNodeParent: ESNode,
-  nodeToReplaceWith: ESNode | $ReadOnlyArray<ESNode>,
-  visitorKeys?: ?VisitorKeysType,
-): void {
-  const replacementParent = getParentKey(
-    originalNode,
-    originalNodeParent,
-    visitorKeys,
-  );
-  const parent = replacementParent.node;
-  if (replacementParent.type === 'array') {
-    // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key] = 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).
- */
-export function removeNodeOnParent(
-  originalNode: ESNode,
-  originalNodeParent: ESNode,
-  visitorKeys?: ?VisitorKeysType,
-): void {
-  const replacementParent = getParentKey(
-    originalNode,
-    originalNodeParent,
-    visitorKeys,
-  );
-  const parent = replacementParent.node;
-  if (replacementParent.type === 'array') {
-    // $FlowExpectedError[prop-missing]
-    parent[replacementParent.key] = 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.
- */
-export function setParentPointersInDirectChildren(
-  node: ESNode,
-  visitorKeys?: ?VisitorKeysType,
-): void {
-  for (const key: $FlowFixMe of getVisitorKeys(node, visitorKeys)) {
-    if (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.
- */
-export function updateAllParentPointers(
-  node: ESNode,
-  visitorKeys?: ?VisitorKeysType,
-) {
-  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.
- */
-export function nodeWith<T: ESNode>(
-  node: T,
-  overrideProps: Partial<T>,
-  visitorKeys?: ?VisitorKeysType,
-): T {
-  // Check if this will actually result in a change, maintaining referential equality is important.
-  const willBeUnchanged = Object.entries(overrideProps).every(
-    ([key, value]) => {
-      const node_: $FlowFixMe = node;
-      if (Array.isArray(value)) {
-        return Array.isArray(node_[key])
-          ? arrayIsEqual(node_[key], value)
-          : false;
-      }
-      return node_[key] === value;
-    },
-  );
-  if (willBeUnchanged) {
-    return node;
-  }
-
-  // Create new node.
-  // $FlowExpectedError[cannot-spread-interface]
-  const newNode: T = {
-    ...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.
- */
-export function shallowCloneNode<T: ESNode>(
-  node: T,
-  visitorKeys?: ?VisitorKeysType,
-): T {
-  // $FlowExpectedError[cannot-spread-interface]
-  const newNode: T = {...node};
-
-  // Ensure parent pointers are correctly set within this nodes children.
-  setParentPointersInDirectChildren(newNode, visitorKeys);
-
-  return newNode;
-}
-
-/**
- * Deeply clones node and its entire tree.
- */
-export function deepCloneNode<T: ESNode>(
-  node: T,
-  visitorKeys?: ?VisitorKeysType,
-): T {
-  const clone: T = 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/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;