hermes-transform 0.5.0

package/dist/transform/mutations/RemoveComment.js

@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRemoveCommentMutation = createRemoveCommentMutation;
+exports.performRemoveCommentMutations = performRemoveCommentMutations;
+
+var _SimpleTraverser = require("../../traverse/SimpleTraverser");
+
+var _comments = require("../comments/comments");
+
+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 createRemoveCommentMutation(comment) {
+  return {
+    type: 'removeComment',
+    comment: comment
+  };
+}
+
+function performRemoveCommentMutations(ast, mutations) {
+  if (mutations.length === 0) {
+    return;
+  }
+
+  var commentsToRemove = new Set(mutations.map(function (m) {
+    return m.comment;
+  }));
+
+  _SimpleTraverser.SimpleTraverser.traverse(ast, {
+    enter: function enter(node) {
+      if (node === ast) {
+        return;
+      }
+
+      var nodeCommentsSet = new Set((0, _comments.getCommentsForNode)(node));
+
+      if (nodeCommentsSet.size === 0) {
+        return;
+      }
+
+      var matchedComments = intersectSets(commentsToRemove, nodeCommentsSet);
+
+      var _iterator = _createForOfIteratorHelper(matchedComments),
+          _step;
+
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var comment = _step.value;
+          commentsToRemove["delete"](comment);
+          nodeCommentsSet["delete"](comment);
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+
+      (0, _comments.setCommentsOnNode)(node, Array.from(nodeCommentsSet));
+
+      if (commentsToRemove.size === 0) {
+        // no more comments to process - so we can exit traversal
+        throw _SimpleTraverser.SimpleTraverserBreak;
+      }
+    },
+    leave: function leave() {}
+  });
+}
+
+function intersectSets(first, other) {
+  var ret = new Set();
+
+  var _iterator2 = _createForOfIteratorHelper(first),
+      _step2;
+
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var value = _step2.value;
+
+      if (other.has(value)) {
+        ret.add(value);
+      }
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+
+  return ret;
+}

package/dist/transform/mutations/RemoveComment.js.flow

@@ -0,0 +1,80 @@
+/**
+ * Copyright (c) Facebook, Inc. and its 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
+ */
+
+import type {Comment, Program} from 'hermes-estree';
+import {
+  SimpleTraverser,
+  SimpleTraverserBreak,
+} from '../../traverse/SimpleTraverser';
+import {getCommentsForNode, setCommentsOnNode} from '../comments/comments';
+
+export type RemoveCommentMutation = $ReadOnly<{
+  type: 'removeComment',
+  comment: Comment,
+}>;
+
+export function createRemoveCommentMutation(
+  comment: RemoveCommentMutation['comment'],
+): RemoveCommentMutation {
+  return {
+    type: 'removeComment',
+    comment,
+  };
+}
+
+export function performRemoveCommentMutations(
+  ast: Program,
+  mutations: $ReadOnlyArray<RemoveCommentMutation>,
+): void {
+  if (mutations.length === 0) {
+    return;
+  }
+
+  const commentsToRemove = new Set(mutations.map(m => m.comment));
+
+  SimpleTraverser.traverse(ast, {
+    enter(node) {
+      if (node === ast) {
+        return;
+      }
+
+      const nodeCommentsSet = new Set(getCommentsForNode(node));
+      if (nodeCommentsSet.size === 0) {
+        return;
+      }
+
+      const matchedComments = intersectSets(commentsToRemove, nodeCommentsSet);
+      for (const comment of matchedComments) {
+        commentsToRemove.delete(comment);
+        nodeCommentsSet.delete(comment);
+      }
+      setCommentsOnNode(node, Array.from(nodeCommentsSet));
+
+      if (commentsToRemove.size === 0) {
+        // no more comments to process - so we can exit traversal
+        throw SimpleTraverserBreak;
+      }
+    },
+    leave() {},
+  });
+}
+
+function intersectSets<T>(
+  first: $ReadOnlySet<T>,
+  other: $ReadOnlySet<T>,
+): Set<T> {
+  const ret = new Set();
+  for (const value of first) {
+    if (other.has(value)) {
+      ret.add(value);
+    }
+  }
+  return ret;
+}

package/dist/transform/mutations/RemoveStatement.js

@@ -0,0 +1,61 @@
+"use strict";
+
+function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRemoveStatementMutation = createRemoveStatementMutation;
+exports.performRemoveStatementMutation = performRemoveStatementMutation;
+
+var _arrayUtils = require("./utils/arrayUtils");
+
+var _getStatementParent = require("./utils/getStatementParent");
+
+var t = _interopRequireWildcard(require("../../generated/node-types"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { "default": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj["default"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+/**
+ * Copyright (c) Facebook, Inc. and its 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 createRemoveStatementMutation(node) {
+  return {
+    type: 'removeStatement',
+    node: node
+  };
+}
+
+function performRemoveStatementMutation(mutationContext, mutation) {
+  var removalParent = (0, _getStatementParent.getStatementParent)(mutation.node);
+  mutationContext.markDeletion(mutation.node);
+  mutationContext.markMutation(removalParent.parent, removalParent.key);
+
+  if (removalParent.type === 'array') {
+    var parent = removalParent.parent;
+    parent[removalParent.key] = (0, _arrayUtils.removeFromArray)(parent[removalParent.key], removalParent.targetIndex);
+  } else {
+    // The parent has a 1:1 relationship on this key, so we can't just
+    // remove the node. Instead we replace it with an empty block statement.
+    // We COULD throw an error here and make the codemodder write a stricter
+    // codemod - but we decided to add this bit of magic to make it easier
+    // to write codemods.
+    // Worst case it creates some dead code that can be easily detected
+    // and cleaned up later.
+    var blockStatement = t.BlockStatement({
+      body: [],
+      parent: removalParent.parent
+    });
+    removalParent.parent[removalParent.key] = blockStatement;
+  }
+
+  return removalParent.parent;
+}

package/dist/transform/mutations/RemoveStatement.js.flow

@@ -0,0 +1,68 @@
+/**
+ * Copyright (c) Facebook, Inc. and its 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
+ */
+
+import type {ESNode, ModuleDeclaration, Statement} from 'hermes-estree';
+import type {MutationContext} from '../MutationContext';
+import type {DetachedNode} from '../../detachedNode';
+
+import {removeFromArray} from './utils/arrayUtils';
+import {getStatementParent} from './utils/getStatementParent';
+import * as t from '../../generated/node-types';
+
+export type RemoveStatementMutation = $ReadOnly<{
+  type: 'removeStatement',
+  node: ModuleDeclaration | Statement,
+}>;
+
+export function createRemoveStatementMutation(
+  node: RemoveStatementMutation['node'],
+): RemoveStatementMutation {
+  return {
+    type: 'removeStatement',
+    node,
+  };
+}
+
+export function performRemoveStatementMutation(
+  mutationContext: MutationContext,
+  mutation: RemoveStatementMutation,
+): ESNode {
+  const removalParent = getStatementParent(mutation.node);
+
+  mutationContext.markDeletion(mutation.node);
+  mutationContext.markMutation(removalParent.parent, removalParent.key);
+
+  if (removalParent.type === 'array') {
+    const parent: interface {
+      [string]: $ReadOnlyArray<DetachedNode<Statement | ModuleDeclaration>>,
+    } = removalParent.parent;
+    parent[removalParent.key] = removeFromArray(
+      parent[removalParent.key],
+      removalParent.targetIndex,
+    );
+  } else {
+    // The parent has a 1:1 relationship on this key, so we can't just
+    // remove the node. Instead we replace it with an empty block statement.
+    // We COULD throw an error here and make the codemodder write a stricter
+    // codemod - but we decided to add this bit of magic to make it easier
+    // to write codemods.
+    // Worst case it creates some dead code that can be easily detected
+    // and cleaned up later.
+    const blockStatement = t.BlockStatement({
+      body: [],
+      parent: removalParent.parent,
+    });
+
+    (removalParent.parent: interface {[string]: mixed})[removalParent.key] =
+      blockStatement;
+  }
+
+  return removalParent.parent;
+}

package/dist/transform/mutations/ReplaceNode.js

@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReplaceNodeMutation = createReplaceNodeMutation;
+exports.performReplaceNodeMutation = performReplaceNodeMutation;
+
+var _arrayUtils = require("./utils/arrayUtils");
+
+var _comments = require("../comments/comments");
+
+var _Errors = require("../Errors");
+
+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 createReplaceNodeMutation(target, nodeToReplaceWith, options) {
+  var _options$keepComments;
+
+  return {
+    type: 'replaceNode',
+    target: target,
+    nodeToReplaceWith: nodeToReplaceWith,
+    keepComments: (_options$keepComments = options === null || options === void 0 ? void 0 : options.keepComments) !== null && _options$keepComments !== void 0 ? _options$keepComments : false
+  };
+}
+
+function performReplaceNodeMutation(mutationContext, mutation) {
+  var replacementParent = getParentKey(mutation.target);
+  mutationContext.markDeletion(mutation.target);
+  mutationContext.markMutation(replacementParent.parent, replacementParent.key); // NOTE: currently this mutation assumes you're doing the right thing.
+  // it does no runtime checks and provides no guarantees about the
+  // correctness of the resulting code.
+  // TODO: maybe add some runtime checks based on codegenned predicates?
+
+  if (replacementParent.type === 'array') {
+    var parent = replacementParent.parent;
+    parent[replacementParent.key] = (0, _arrayUtils.replaceInArray)(parent[replacementParent.key], replacementParent.targetIndex, [mutation.nodeToReplaceWith]);
+  } else {
+    replacementParent.parent[replacementParent.key] = mutation.nodeToReplaceWith;
+  }
+
+  if (mutation.keepComments) {
+    (0, _comments.moveCommentsToNewNode)(mutation.target, mutation.nodeToReplaceWith);
+  }
+
+  return replacementParent.parent;
+}
+
+function getParentKey(target) {
+  var parent = target.parent;
+
+  var _iterator = _createForOfIteratorHelper((0, _getVisitorKeys.getVisitorKeys)(parent)),
+      _step;
+
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var key = _step.value;
+
+      if ((0, _getVisitorKeys.isNode)( // $FlowExpectedError[prop-missing]
+      parent[key])) {
+        if (parent[key] === target) {
+          return {
+            type: 'single',
+            parent: parent,
+            key: key
+          };
+        }
+      } else if (Array.isArray(parent[key])) {
+        for (var i = 0; i < parent[key].length; i += 1) {
+          if (parent[key][i] === target) {
+            return {
+              type: 'array',
+              parent: parent,
+              key: key,
+              targetIndex: i
+            };
+          }
+        }
+      }
+    } // this shouldn't happen ever
+
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+
+  throw new _Errors.InvalidReplacementError("Expected to find the ".concat(target.type, " as a direct child of the ").concat(target.type, "."));
+}

package/dist/transform/mutations/ReplaceNode.js.flow

@@ -0,0 +1,113 @@
+/**
+ * Copyright (c) Facebook, Inc. and its 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
+ */
+
+import type {ESNode} from 'hermes-estree';
+import type {MutationContext} from '../MutationContext';
+import type {DetachedNode} from '../../detachedNode';
+
+import {replaceInArray} from './utils/arrayUtils';
+import {moveCommentsToNewNode} from '../comments/comments';
+import {InvalidReplacementError} from '../Errors';
+import {getVisitorKeys, isNode} from '../../getVisitorKeys';
+
+export type ReplaceNodeMutation = $ReadOnly<{
+  type: 'replaceNode',
+  target: ESNode,
+  nodeToReplaceWith: DetachedNode<ESNode>,
+  keepComments: boolean,
+}>;
+
+export function createReplaceNodeMutation(
+  target: ReplaceNodeMutation['target'],
+  nodeToReplaceWith: ReplaceNodeMutation['nodeToReplaceWith'],
+  options?: $ReadOnly<{keepComments?: boolean}>,
+): ReplaceNodeMutation {
+  return {
+    type: 'replaceNode',
+    target,
+    nodeToReplaceWith,
+    keepComments: options?.keepComments ?? false,
+  };
+}
+
+export function performReplaceNodeMutation(
+  mutationContext: MutationContext,
+  mutation: ReplaceNodeMutation,
+): ESNode {
+  const replacementParent = getParentKey(mutation.target);
+
+  mutationContext.markDeletion(mutation.target);
+  mutationContext.markMutation(replacementParent.parent, replacementParent.key);
+
+  // NOTE: currently this mutation assumes you're doing the right thing.
+  // it does no runtime checks and provides no guarantees about the
+  // correctness of the resulting code.
+  // TODO: maybe add some runtime checks based on codegenned predicates?
+
+  if (replacementParent.type === 'array') {
+    const parent: interface {
+      [string]: $ReadOnlyArray<DetachedNode<ESNode>>,
+    } = replacementParent.parent;
+    parent[replacementParent.key] = replaceInArray(
+      parent[replacementParent.key],
+      replacementParent.targetIndex,
+      [mutation.nodeToReplaceWith],
+    );
+  } else {
+    (replacementParent.parent: interface {[string]: mixed})[
+      replacementParent.key
+    ] = mutation.nodeToReplaceWith;
+  }
+
+  if (mutation.keepComments) {
+    moveCommentsToNewNode(mutation.target, mutation.nodeToReplaceWith);
+  }
+
+  return replacementParent.parent;
+}
+
+function getParentKey(target: ESNode): $ReadOnly<
+  | {
+      type: 'single',
+      parent: ESNode,
+      key: string,
+    }
+  | {
+      type: 'array',
+      parent: ESNode,
+      key: string,
+      targetIndex: number,
+    },
+> {
+  const parent = target.parent;
+  for (const key of getVisitorKeys(parent)) {
+    if (
+      isNode(
+        // $FlowExpectedError[prop-missing]
+        parent[key],
+      )
+    ) {
+      if (parent[key] === target) {
+        return {type: 'single', parent, key};
+      }
+    } else if (Array.isArray(parent[key])) {
+      for (let i = 0; i < parent[key].length; i += 1) {
+        if (parent[key][i] === target) {
+          return {type: 'array', parent, key, targetIndex: i};
+        }
+      }
+    }
+  }
+
+  // this shouldn't happen ever
+  throw new InvalidReplacementError(
+    `Expected to find the ${target.type} as a direct child of the ${target.type}.`,
+  );
+}

package/dist/transform/mutations/ReplaceStatementWithMany.js

@@ -0,0 +1,81 @@
+"use strict";
+
+function _typeof(obj) { "@babel/helpers - typeof"; if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); }
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReplaceStatementWithManyMutation = createReplaceStatementWithManyMutation;
+exports.performReplaceStatementWithManyMutation = performReplaceStatementWithManyMutation;
+
+var _arrayUtils = require("./utils/arrayUtils");
+
+var _getStatementParent = require("./utils/getStatementParent");
+
+var _isValidModuleDeclarationParent = require("./utils/isValidModuleDeclarationParent");
+
+var _comments = require("../comments/comments");
+
+var _Errors = require("../Errors");
+
+var t = _interopRequireWildcard(require("../../generated/node-types"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== "object" && typeof obj !== "function") { return { "default": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj["default"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+/**
+ * Copyright (c) Facebook, Inc. and its 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 createReplaceStatementWithManyMutation(target, nodesToReplaceWith, options) {
+  var _options$keepComments;
+
+  if (nodesToReplaceWith.length === 0) {
+    return null;
+  }
+
+  return {
+    type: 'replaceStatementWithMany',
+    target: target,
+    nodesToReplaceWith: nodesToReplaceWith,
+    keepComments: (_options$keepComments = options === null || options === void 0 ? void 0 : options.keepComments) !== null && _options$keepComments !== void 0 ? _options$keepComments : false
+  };
+}
+
+function performReplaceStatementWithManyMutation(mutationContext, mutation) {
+  var replacementParent = (0, _getStatementParent.getStatementParent)(mutation.target); // enforce that if we are replacing with module declarations - they are being inserted in a valid location
+
+  if (!(0, _isValidModuleDeclarationParent.isValidModuleDeclarationParent)(replacementParent.parent, mutation.nodesToReplaceWith)) {
+    throw new _Errors.InvalidReplacementError("import/export cannot be replaced into a ".concat(replacementParent.parent.type, "."));
+  }
+
+  mutationContext.markDeletion(mutation.target);
+  mutationContext.markMutation(replacementParent.parent, replacementParent.key);
+
+  if (mutation.keepComments) {
+    // attach comments to the very first replacement node
+    (0, _comments.moveCommentsToNewNode)(mutation.target, mutation.nodesToReplaceWith[0]);
+  }
+
+  if (replacementParent.type === 'array') {
+    var parent = replacementParent.parent;
+    parent[replacementParent.key] = (0, _arrayUtils.replaceInArray)(parent[replacementParent.key], replacementParent.targetIndex, mutation.nodesToReplaceWith);
+    return replacementParent.parent;
+  }
+
+  var statementsToReplaceWith = // $FlowExpectedError[incompatible-cast] -- this is enforced by isValidModuleDeclarationParent above
+  mutation.nodesToReplaceWith; // we need to wrap the nodes in a BlockStatement as before there was only 1 node
+
+  var blockStatement = t.BlockStatement({
+    body: statementsToReplaceWith,
+    parent: replacementParent.parent
+  });
+  replacementParent.parent[replacementParent.key] = blockStatement;
+  return replacementParent.parent;
+}