hermes-transform 0.36.0 → 0.37.0

package/dist/src/transform/comments/prettier/main/comments.js

@@ -1,11 +1,3 @@
-/**
- * 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';
 
 const assert = require('assert');
@@ -32,9 +24,6 @@ function getSortedChildNodes(node, options, resultArray) {
 
   if (resultArray) {
     if (printer.canAttachComment && printer.canAttachComment(node)) {
-      // This reverse insertion sort almost always takes constant
-      // time because we almost always (maybe always?) append the
-      // nodes in order anyway.
       let i;
 
       for (i = resultArray.length - 1; i >= 0; --i) {
@@ -66,10 +55,7 @@ function getSortedChildNodes(node, options, resultArray) {
   }
 
   return resultArray;
-} // As efficiently as possible, decorate the comment object with
-// .precedingNode, .enclosingNode, and/or .followingNode properties, at
-// least one of which is guaranteed to be defined.
-
+}
 
 function decorateComment(node, comment, options, enclosingNode) {
   const {
@@ -80,8 +66,7 @@ function decorateComment(node, comment, options, enclosingNode) {
   const commentEnd = locEnd(comment);
   const childNodes = getSortedChildNodes(node, options);
   let precedingNode;
-  let followingNode; // Time to dust off the old binary search robes and wizard hat.
-
+  let followingNode;
   let left = 0;
   let right = childNodes.length;
 
@@ -89,39 +74,26 @@ function decorateComment(node, comment, options, enclosingNode) {
     const middle = left + right >> 1;
     const child = childNodes[middle];
     const start = locStart(child);
-    const end = locEnd(child); // The comment is completely contained by this child node.
+    const end = locEnd(child);
 
     if (start <= commentStart && commentEnd <= end) {
-      // Abandon the binary search at this level.
       return decorateComment(child, comment, options, child);
     }
 
     if (end <= commentStart) {
-      // This child node falls completely before the comment.
-      // Because we will never consider this node or any nodes
-      // before it again, this node must be the closest preceding
-      // node we have encountered so far.
       precedingNode = child;
       left = middle + 1;
       continue;
     }
 
     if (commentEnd <= start) {
-      // This child node falls completely after the comment.
-      // Because we will never consider this node or any nodes after
-      // it again, this node must be the closest following node we
-      // have encountered so far.
       followingNode = child;
       right = middle;
       continue;
     }
-    /* istanbul ignore next */
-
 
     throw new Error('Comment location overlaps with node location');
-  } // We don't want comments inside of different expressions inside of the same
-  // template literal to move to another expression.
-
+  }
 
   if (enclosingNode && enclosingNode.type === 'TemplateLiteral') {
     const {
@@ -159,8 +131,7 @@ function attach(comments, ast, text, options) {
     printer: {
       handleComments = {}
     }
-  } = options; // TODO: Make this as default behavior
-
+  } = options;
   const {
     avoidAstMutation,
     ownLine: handleOwnLineComment = returnFalse,
@@ -211,51 +182,33 @@ function attach(comments, ast, text, options) {
     }
 
     if (isOwnLineComment(text, options, decoratedComments, index)) {
-      comment.placement = 'ownLine'; // If a comment exists on its own line, prefer a leading comment.
-      // We also need to check if it's the first line of the file.
+      comment.placement = 'ownLine';
 
-      if (handleOwnLineComment(...args)) {// We're good
-      } else if (followingNode) {
-        // Always a leading comment.
+      if (handleOwnLineComment(...args)) {} else if (followingNode) {
         addLeadingComment(followingNode, comment);
       } else if (precedingNode) {
         addTrailingComment(precedingNode, comment);
       } else if (enclosingNode) {
         addDanglingComment(enclosingNode, comment);
       } else {
-        // There are no nodes, let's attach it to the root of the ast
-
-        /* istanbul ignore next */
         addDanglingComment(ast, comment);
       }
     } else if (isEndOfLineComment(text, options, decoratedComments, index)) {
       comment.placement = 'endOfLine';
 
-      if (handleEndOfLineComment(...args)) {// We're good
-      } else if (precedingNode) {
-        // There is content before this comment on the same line, but
-        // none after it, so prefer a trailing comment of the previous node.
+      if (handleEndOfLineComment(...args)) {} else if (precedingNode) {
         addTrailingComment(precedingNode, comment);
       } else if (followingNode) {
         addLeadingComment(followingNode, comment);
       } else if (enclosingNode) {
         addDanglingComment(enclosingNode, comment);
       } else {
-        // There are no nodes, let's attach it to the root of the ast
-
-        /* istanbul ignore next */
         addDanglingComment(ast, comment);
       }
     } else {
       comment.placement = 'remaining';
 
-      if (handleRemainingComment(...args)) {// We're good
-      } else if (precedingNode && followingNode) {
-        // Otherwise, text exists both before and after the comment on
-        // the same line. If there is both a preceding and following
-        // node, use a tie-breaking algorithm to determine if it should
-        // be attached to the next or previous node. In the last case,
-        // simply attach the right node;
+      if (handleRemainingComment(...args)) {} else if (precedingNode && followingNode) {
         const tieCount = tiesToBreak.length;
 
         if (tieCount > 0) {
@@ -274,9 +227,6 @@ function attach(comments, ast, text, options) {
       } else if (enclosingNode) {
         addDanglingComment(enclosingNode, comment);
       } else {
-        // There are no nodes, let's attach it to the root of the ast
-
-        /* istanbul ignore next */
         addDanglingComment(ast, comment);
       }
     }
@@ -286,9 +236,6 @@ function attach(comments, ast, text, options) {
 
   if (!avoidAstMutation) {
     for (const comment of comments) {
-      // These node references were useful for breaking ties, but we
-      // don't need them anymore, and they create cycles in the AST that
-      // may lead to infinite recursion if we don't delete them here.
       delete comment.precedingNode;
       delete comment.enclosingNode;
       delete comment.followingNode;
@@ -310,7 +257,6 @@ function isOwnLineComment(text, options, decoratedComments, commentIndex) {
   let start = locStart(comment);
 
   if (precedingNode) {
-    // Find first comment on the same line
     for (let index = commentIndex - 1; index >= 0; index--) {
       const {
         comment,
@@ -342,7 +288,6 @@ function isEndOfLineComment(text, options, decoratedComments, commentIndex) {
   let end = locEnd(comment);
 
   if (followingNode) {
-    // Find last comment on the same line
     for (let index = commentIndex + 1; index < decoratedComments.length; index++) {
       const {
         comment,
@@ -373,12 +318,7 @@ function breakTies(tiesToBreak, text, options) {
     enclosingNode
   } = tiesToBreak[0];
   const gapRegExp = options.printer.getGapRegex && options.printer.getGapRegex(enclosingNode) || /^[\s(]*$/;
-  let gapEndPos = options.locStart(followingNode); // Iterate backwards through tiesToBreak, examining the gaps
-  // between the tied comments. In order to qualify as leading, a
-  // comment must be separated from followingNode by an unbroken series of
-  // gaps (or other comments). Gaps should only contain whitespace or open
-  // parentheses.
-
+  let gapEndPos = options.locStart(followingNode);
   let indexOfFirstLeadingComment;
 
   for (indexOfFirstLeadingComment = tieCount; indexOfFirstLeadingComment > 0; --indexOfFirstLeadingComment) {
@@ -394,8 +334,6 @@ function breakTies(tiesToBreak, text, options) {
     if (gapRegExp.test(gap)) {
       gapEndPos = options.locStart(comment);
     } else {
-      // The gap string contained something other than whitespace or open
-      // parentheses.
       break;
     }
   }
@@ -426,11 +364,7 @@ function findExpressionIndexForComment(quasis, comment, options) {
     if (startPos < options.locStart(quasis[i])) {
       return i - 1;
     }
-  } // We haven't found it, it probably means that some of the locations are off.
-  // Let's just return the first one.
-
-  /* istanbul ignore next */
-
+  }
 
   return 0;
 }

package/dist/src/transform/comments/prettier/utils/get-last.js

@@ -1,11 +1,3 @@
-/**
- * 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';
 
 const getLast = arr => arr[arr.length - 1];

package/dist/src/transform/mutations/AddComments.js

@@ -8,15 +8,6 @@ exports.performAddCommentsMutation = performAddCommentsMutation;
 
 var _comments = require("../comments/comments");
 
-/**
- * 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 createAddCommentsMutation(node, comments) {
   if (comments.length === 0) {
     return null;

package/dist/src/transform/mutations/CloneCommentsTo.js

@@ -8,15 +8,6 @@ exports.performCloneCommentsToMutation = performCloneCommentsToMutation;
 
 var _comments = require("../comments/comments");
 
-/**
- * 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 createCloneCommentsToMutation(target, destination) {
   return {
     type: 'cloneCommentsTo',

package/dist/src/transform/mutations/InsertStatement.js

@@ -20,15 +20,6 @@ function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "functio
 
 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) 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 createInsertStatementMutation(side, target, nodesToInsert) {
   if (nodesToInsert.length === 0) {
     return null;
@@ -44,7 +35,7 @@ function createInsertStatementMutation(side, target, nodesToInsert) {
 
 function performInsertStatementMutation(mutationContext, mutation) {
   mutationContext.assertNotDeleted(mutation.target, `Attempted to insert ${mutation.side} a deleted ${mutation.target.type} node. This likely means that you attempted to mutate around the target after it was deleted/replaced.`);
-  const insertionParent = (0, _getStatementParent.getStatementParent)(mutation.target); // enforce that if we are inserting module declarations - they are being inserted in a valid location
+  const insertionParent = (0, _getStatementParent.getStatementParent)(mutation.target);
 
   if (!(0, _isValidModuleDeclarationParent.isValidModuleDeclarationParent)(insertionParent.parent, mutation.nodesToInsert)) {
     throw new _Errors.InvalidInsertionError(`import/export cannot be inserted into a ${insertionParent.parent.type}.`);
@@ -72,15 +63,12 @@ function performInsertStatementMutation(mutationContext, mutation) {
     return insertionParent.parent;
   }
 
-  const statementsToInsert = // $FlowExpectedError[incompatible-type] -- this is enforced by isValidModuleDeclarationParent above
-  mutation.nodesToInsert;
+  const statementsToInsert = mutation.nodesToInsert;
   const {
     parent,
     key
-  } = insertionParent; // $FlowExpectedError[prop-missing]
-
-  const statementToWrap = parent[key]; // we need to wrap this key in a BlockStatement so we can insert the new statement
-
+  } = insertionParent;
+  const statementToWrap = parent[key];
   const blockStatement = t.BlockStatement({
     body: mutation.side === 'before' ? [...statementsToInsert, statementToWrap] : [statementToWrap, ...statementsToInsert],
     parent: insertionParent.parent

package/dist/src/transform/mutations/ModifyNodeInPlace.js

@@ -8,15 +8,6 @@ exports.performModifyNodeInPlaceMutation = performModifyNodeInPlaceMutation;
 
 var _hermesParser = require("hermes-parser");
 
-/**
- * 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 createModifyNodeInPlaceMutation(target, newProps) {
   return {
     type: 'modifyNodeInPlace',
@@ -32,13 +23,11 @@ function performModifyNodeInPlaceMutation(mutationContext, mutation) {
   } = mutation;
 
   for (const [key, newPropValue] of Object.entries(newProps)) {
-    const prevPropValue = target[key]; // If the value did not change, skip.
-    // $FlowFixMe[invalid-compare]
+    const prevPropValue = target[key];
 
     if (prevPropValue === newPropValue) {
       continue;
-    } // Mark removed nodes as deleted
-
+    }
 
     if ((0, _hermesParser.isNode)(prevPropValue)) {
       mutationContext.markDeletion(prevPropValue);
@@ -48,11 +37,9 @@ function performModifyNodeInPlaceMutation(mutationContext, mutation) {
           mutationContext.markDeletion(prevPropValueItem);
         }
       }
-    } // Mark node property as mutated.
-
-
-    mutationContext.markMutation(target, key); // Assign new property.
+    }
 
+    mutationContext.markMutation(target, key);
     target[key] = newPropValue;
   }
 

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

@@ -10,15 +10,6 @@ var _hermesParser = require("hermes-parser");
 
 var _comments = require("../comments/comments");
 
-/**
- * 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 createRemoveCommentMutation(comment) {
   return {
     type: 'removeComment',
@@ -55,7 +46,6 @@ function performRemoveCommentMutations(ast, mutations) {
       (0, _comments.setCommentsOnNode)(node, Array.from(nodeCommentsSet));
 
       if (commentsToRemove.size === 0) {
-        // no more comments to process - so we can exit traversal
         throw _hermesParser.SimpleTraverserBreak;
       }
     },

package/dist/src/transform/mutations/RemoveNode.js

@@ -10,15 +10,6 @@ var _hermesParser = require("hermes-parser");
 
 var _Errors = require("../Errors");
 
-/**
- * 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 createRemoveNodeMutation(node) {
   return {
     type: 'removeNode',
@@ -46,7 +37,6 @@ function getRemovalParent(node) {
     }
 
     switch (node.type) {
-      // ClassMember
       case 'PropertyDefinition':
       case 'MethodDefinition':
         assertParent('ClassBody');
@@ -58,7 +48,6 @@ function getRemovalParent(node) {
       case 'EnumStringMember':
         assertParent(VALID_ENUM_MEMBER_PARENTS);
         return 'members';
-      // Components
 
       case 'ComponentParameter':
         assertParent('ComponentDeclaration');
@@ -67,7 +56,6 @@ function getRemovalParent(node) {
       case 'ComponentTypeParameter':
         assertParent(VALID_COMPONENT_TYPE_PARAMETER_PARENTS);
         return 'params';
-      // FunctionParameter
 
       case 'AssignmentPattern':
       case 'ArrayPattern':
@@ -107,7 +95,6 @@ function getRemovalParent(node) {
       case 'Property':
         assertParent(VALID_PROPERTY_PARENTS);
         return 'properties';
-      // Identifier can be the child of a number of usecases
 
       case 'Identifier':
         switch (node.parent.type) {
@@ -124,8 +111,6 @@ function getRemovalParent(node) {
             throw new _Errors.InvalidRemovalError(getErrorMessage(['ArrowFunctionExpression', 'FunctionDeclaration', 'FunctionExpression', 'ArrayExpression', 'ArrayPattern']));
         }
 
-      // RestElement can be the child of a number of usecases
-
       case 'RestElement':
         switch (node.parent.type) {
           case 'ArrowFunctionExpression':
@@ -139,8 +124,6 @@ function getRemovalParent(node) {
 
           case 'ObjectPattern':
             return 'properties';
-          // $FlowFixMe[incompatible-type]
-          // $FlowFixMe[invalid-compare]
 
           case 'OptionalCallExpression':
           case 'CallExpression':
@@ -151,8 +134,6 @@ function getRemovalParent(node) {
             throw new _Errors.InvalidRemovalError(getErrorMessage(['ArrowFunctionExpression', 'FunctionDeclaration', 'FunctionExpression', 'ComponentDeclaration', 'ArrayPattern', 'ObjectPattern', 'CallExpression', 'OptionalCallExpression', 'NewExpression']));
         }
 
-      // SpreadElement can be the child of a number of usecases
-
       case 'SpreadElement':
         switch (node.parent.type) {
           case 'ArrayExpression':
@@ -160,8 +141,6 @@ function getRemovalParent(node) {
 
           case 'ObjectExpression':
             return 'properties';
-          // $FlowFixMe[incompatible-type]
-          // $FlowFixMe[invalid-compare]
 
           case 'OptionalCallExpression':
           case 'CallExpression':
@@ -178,9 +157,8 @@ function getRemovalParent(node) {
   })();
 
   const targetIndex = (() => {
-    // $FlowExpectedError[prop-missing]
     const arr = node.parent[key];
-    const idx = arr.indexOf(node); // $FlowFixMe[invalid-compare]
+    const idx = arr.indexOf(node);
 
     if (idx === -1) {
       throw new _Errors.InvalidRemovalError(`Could not find target in array of \`${node.parent.type}.${key}\`.`);

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

@@ -16,15 +16,6 @@ function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "functio
 
 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) 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 createRemoveStatementMutation(node) {
   return {
     type: 'removeStatement',
@@ -41,13 +32,6 @@ function performRemoveStatementMutation(mutationContext, mutation) {
     const parent = removalParent.parent;
     parent[removalParent.key] = _hermesParser.astArrayMutationHelpers.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

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

@@ -14,15 +14,6 @@ var _Errors = require("../Errors");
 
 var _detachedNode = require("../../detachedNode");
 
-/**
- * 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 createReplaceNodeMutation(target, nodeToReplaceWith, options) {
   var _options$keepComments;
 
@@ -37,10 +28,7 @@ function createReplaceNodeMutation(target, nodeToReplaceWith, options) {
 function performReplaceNodeMutation(mutationContext, mutation) {
   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?
+  mutationContext.markMutation(replacementParent.parent, replacementParent.key);
 
   if (replacementParent.type === 'array') {
     const parent = replacementParent.parent;
@@ -63,7 +51,6 @@ function getParentKey(target) {
     const child = parent[key];
 
     if ((0, _hermesParser.isNode)(child)) {
-      // $FlowFixMe[invalid-compare]
       if (child === target) {
         return {
           type: 'single',
@@ -86,8 +73,7 @@ function getParentKey(target) {
         }
       }
     }
-  } // this shouldn't happen ever
-
+  }
 
   throw new _Errors.InvalidReplacementError(`Expected to find the ${target.type} as a direct child of the ${parent.type}.`);
 }

package/dist/src/transform/mutations/ReplaceStatementWithMany.js

@@ -22,15 +22,6 @@ function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "functio
 
 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) 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 createReplaceStatementWithManyMutation(target, nodesToReplaceWith, options) {
   var _options$keepComments;
 
@@ -47,7 +38,7 @@ function createReplaceStatementWithManyMutation(target, nodesToReplaceWith, opti
 }
 
 function performReplaceStatementWithManyMutation(mutationContext, mutation) {
-  const replacementParent = (0, _getStatementParent.getStatementParent)(mutation.target); // enforce that if we are replacing with module declarations - they are being inserted in a valid location
+  const replacementParent = (0, _getStatementParent.getStatementParent)(mutation.target);
 
   if (!(0, _isValidModuleDeclarationParent.isValidModuleDeclarationParent)(replacementParent.parent, mutation.nodesToReplaceWith)) {
     throw new _Errors.InvalidReplacementError(`import/export cannot be replaced into a ${replacementParent.parent.type}.`);
@@ -57,7 +48,6 @@ function performReplaceStatementWithManyMutation(mutationContext, mutation) {
   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]);
   }
 
@@ -67,9 +57,7 @@ function performReplaceStatementWithManyMutation(mutationContext, mutation) {
     return replacementParent.parent;
   }
 
-  const statementsToReplaceWith = // $FlowExpectedError[incompatible-type] -- this is enforced by isValidModuleDeclarationParent above
-  mutation.nodesToReplaceWith; // we need to wrap the nodes in a BlockStatement as before there was only 1 node
-
+  const statementsToReplaceWith = mutation.nodesToReplaceWith;
   const blockStatement = t.BlockStatement({
     body: statementsToReplaceWith,
     parent: replacementParent.parent

package/dist/src/transform/mutations/utils/getStatementParent.js

@@ -7,23 +7,12 @@ exports.getStatementParent = getStatementParent;
 
 var _Errors = require("../../Errors");
 
-/**
- * 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 getStatementParent(target) {
   function assertValidStatementLocation(parentWithType, ...invalidKeys) {
     for (const key of invalidKeys) {
-      // $FlowExpectedError[prop-missing]
       const value = parentWithType[key];
 
-      if ( // $FlowFixMe[invalid-compare]
-      value === target || Array.isArray(value) && value.includes(target)) {
+      if (value === target || Array.isArray(value) && value.includes(target)) {
         throw new _Errors.InvalidStatementError(`Attempted to insert a statement into \`${parentWithType.type}.${key}\`.`);
       }
     }
@@ -98,9 +87,7 @@ function getStatementParent(target) {
       case 'ForInStatement':
       case 'ForOfStatement':
         {
-          assertValidStatementLocation(parent, // $FlowExpectedError[prop-missing] - flow does not track properties from parent interface
-          'left', // $FlowExpectedError[prop-missing] - flow does not track properties from parent interface
-          'right');
+          assertValidStatementLocation(parent, 'left', 'right');
           return {
             type: 'single',
             parent,
@@ -134,10 +121,7 @@ function getStatementParent(target) {
     throw new _Errors.InvalidStatementError(`Expected to find a valid statement parent, but found a parent of type "${parent.type}".`);
   })();
 
-  if ( // array insertions are already validated by the getAssertedIndex function
-  result.targetIndex == null && // $FlowExpectedError[prop-missing]
-  // $FlowFixMe[invalid-compare]
-  result.parent[result.key] !== target) {
+  if (result.targetIndex == null && result.parent[result.key] !== target) {
     throw new _Errors.InvalidStatementError(`Expected to find the target "${target.type}" on the "${result.parent.type}.${result.key}", but found a different node. ` + 'This likely means that you attempted to mutate around the target after it was deleted/replaced.');
   }