hermes-transform 0.8.0 → 0.10.0

package/dist/transform/mutations/utils/arrayUtils.js.flow

@@ -1,50 +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-local
- * @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 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/traverse/SimpleTraverser.js

@@ -1,118 +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;
-      }
-
-      throw ex;
-    }
-
-    const keys = (0, _getVisitorKeys.getVisitorKeys)(node);
-
-    for (const key of keys) {
-      // $FlowExpectedError[prop-missing]
-      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;
-      }
-
-      throw ex;
-    }
-  }
-  /**
-   * 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/traverse/SimpleTraverser.js.flow

@@ -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.
- *
- * @flow strict-local
- * @format
- */
-
-'use strict';
-
-import type {ESNode} from 'hermes-estree';
-
-import {getVisitorKeys, isNode} from '../getVisitorKeys';
-
-export type TraverserCallback = (node: ESNode, parent: ?ESNode) => void;
-export type TraverserOptions = $ReadOnly<{
-  /** The callback function which is called on entering each node. */
-  enter: TraverserCallback,
-  /** The callback function which is called on leaving each node. */
-  leave: TraverserCallback,
-}>;
-
-/**
- * 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
- */
-export const SimpleTraverserSkip: Error = new Error();
-/**
- * Can be thrown at any point during the traversal to immediately stop traversal
- * entirely.
- */
-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.
-   * @param options The option object.
-   */
-  traverse(node: ESNode, options: TraverserOptions): void {
-    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: ESNode, parent: ?ESNode, options: TraverserOptions): void {
-    if (!isNode(node)) {
-      return;
-    }
-
-    try {
-      options.enter(node, parent);
-    } catch (ex) {
-      if (ex === SimpleTraverserSkip) {
-        return;
-      }
-      throw ex;
-    }
-
-    const keys = getVisitorKeys(node);
-    for (const key of keys) {
-      // $FlowExpectedError[prop-missing]
-      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;
-      }
-      throw ex;
-    }
-  }
-
-  /**
-   * Traverse the given AST tree.
-   * @param node The root node to traverse.
-   * @param options The option object.
-   */
-  static traverse(node: ESNode, options: TraverserOptions) {
-    new SimpleTraverser().traverse(node, options);
-  }
-}