hermes-transform 0.5.0 → 0.6.0

package/dist/transform/mutations/ReplaceNode.js

@@ -14,25 +14,28 @@ 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; }
-
+/**
+ * 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;
 
   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
+    target,
+    nodeToReplaceWith,
+    keepComments: (_options$keepComments = options == null ? void 0 : options.keepComments) != null ? _options$keepComments : false
   };
 }
 
 function performReplaceNodeMutation(mutationContext, mutation) {
-  var replacementParent = getParentKey(mutation.target);
+  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
@@ -40,7 +43,7 @@ function performReplaceNodeMutation(mutationContext, mutation) {
   // TODO: maybe add some runtime checks based on codegenned predicates?
 
   if (replacementParent.type === 'array') {
-    var parent = replacementParent.parent;
+    const parent = replacementParent.parent;
     parent[replacementParent.key] = (0, _arrayUtils.replaceInArray)(parent[replacementParent.key], replacementParent.targetIndex, [mutation.nodeToReplaceWith]);
   } else {
     replacementParent.parent[replacementParent.key] = mutation.nodeToReplaceWith;
@@ -54,43 +57,32 @@ function performReplaceNodeMutation(mutationContext, mutation) {
 }
 
 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) {
+  const parent = target.parent;
+
+  for (const key of (0, _getVisitorKeys.getVisitorKeys)(parent)) {
+    if ((0, _getVisitorKeys.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: 'single',
-            parent: parent,
-            key: key
+            type: 'array',
+            parent,
+            key,
+            targetIndex: i
           };
         }
-      } 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
+    }
+  } // 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, "."));
+  throw new _Errors.InvalidReplacementError(`Expected to find the ${target.type} as a direct child of the ${target.type}.`);
 }

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

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.

package/dist/transform/mutations/ReplaceStatementWithMany.js

@@ -1,7 +1,5 @@
 "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
 });
@@ -20,12 +18,12 @@ 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 _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (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; }
+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.
+ * 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.
@@ -42,17 +40,17 @@ function createReplaceStatementWithManyMutation(target, nodesToReplaceWith, opti
 
   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
+    target,
+    nodesToReplaceWith,
+    keepComments: (_options$keepComments = options == null ? void 0 : options.keepComments) != null ? _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
+  const 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, "."));
+    throw new _Errors.InvalidReplacementError(`import/export cannot be replaced into a ${replacementParent.parent.type}.`);
   }
 
   mutationContext.markDeletion(mutation.target);
@@ -64,15 +62,15 @@ function performReplaceStatementWithManyMutation(mutationContext, mutation) {
   }
 
   if (replacementParent.type === 'array') {
-    var parent = replacementParent.parent;
+    const 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
+  const 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({
+  const blockStatement = t.BlockStatement({
     body: statementsToReplaceWith,
     parent: replacementParent.parent
   });

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

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.

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

@@ -7,20 +7,8 @@ exports.insertInArray = insertInArray;
 exports.removeFromArray = removeFromArray;
 exports.replaceInArray = replaceInArray;
 
-function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
-
-function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-
-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 _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
-
-function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
-
-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; }
-
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -33,7 +21,7 @@ function insertInArray(array, index, elements) {
 }
 
 function removeFromArray(array, index) {
-  return [].concat(_toConsumableArray(array.slice(0, index)), _toConsumableArray(array.slice(index + 1)));
+  return [...array.slice(0, index), ...array.slice(index + 1)];
 }
 
 function replaceInArray(array, index, elements) {

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

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.

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

@@ -8,7 +8,7 @@ exports.getStatementParent = getStatementParent;
 var _Errors = require("../../Errors");
 
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -17,44 +17,39 @@ var _Errors = require("../../Errors");
  * @format
  */
 function getStatementParent(target) {
-  function assertValidStatementLocation(parentWithType) {
-    for (var _len = arguments.length, invalidKeys = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
-      invalidKeys[_key - 1] = arguments[_key];
-    }
-
-    for (var _i = 0, _invalidKeys = invalidKeys; _i < _invalidKeys.length; _i++) {
-      var key = _invalidKeys[_i];
+  function assertValidStatementLocation(parentWithType, ...invalidKeys) {
+    for (const key of invalidKeys) {
       // $FlowExpectedError[prop-missing]
-      var value = parentWithType[key];
+      const value = parentWithType[key];
 
       if (value === target || Array.isArray(value) && value.includes(target)) {
-        throw new _Errors.InvalidStatementError("Attempted to insert a statement into `".concat(parentWithType.type, ".").concat(key, "`."));
+        throw new _Errors.InvalidStatementError(`Attempted to insert a statement into \`${parentWithType.type}.${key}\`.`);
       }
     }
   }
 
   function getAssertedIndex(key, arr) {
-    var idx = arr.indexOf(target);
+    const idx = arr.indexOf(target);
 
-    if (idx == null) {
-      throw new _Errors.InvalidStatementError("Could not find target in array of `".concat(parent.type, ".").concat(key, "`."));
+    if (idx === -1) {
+      throw new _Errors.InvalidStatementError(`Could not find target in array of \`${parent.type}.${key}\`.`);
     }
 
     return idx;
   }
 
-  var parent = target.parent;
+  const parent = target.parent;
 
-  var result = function () {
+  const result = (() => {
     switch (parent.type) {
       case 'IfStatement':
         {
           assertValidStatementLocation(parent, 'test');
-          var key = parent.consequent === target ? 'consequent' : 'alternate';
+          const key = parent.consequent === target ? 'consequent' : 'alternate';
           return {
             type: 'single',
-            parent: parent,
-            key: key
+            parent,
+            key
           };
         }
 
@@ -63,7 +58,7 @@ function getStatementParent(target) {
           assertValidStatementLocation(parent, 'label');
           return {
             type: 'single',
-            parent: parent,
+            parent,
             key: 'body'
           };
         }
@@ -73,7 +68,7 @@ function getStatementParent(target) {
           assertValidStatementLocation(parent, 'object');
           return {
             type: 'single',
-            parent: parent,
+            parent,
             key: 'body'
           };
         }
@@ -84,7 +79,7 @@ function getStatementParent(target) {
           assertValidStatementLocation(parent, 'test');
           return {
             type: 'single',
-            parent: parent,
+            parent,
             key: 'body'
           };
         }
@@ -94,7 +89,7 @@ function getStatementParent(target) {
           assertValidStatementLocation(parent, 'init', 'test', 'update');
           return {
             type: 'single',
-            parent: parent,
+            parent,
             key: 'body'
           };
         }
@@ -106,7 +101,7 @@ function getStatementParent(target) {
           parent, 'left', 'right');
           return {
             type: 'single',
-            parent: parent,
+            parent,
             key: 'body'
           };
         }
@@ -116,7 +111,7 @@ function getStatementParent(target) {
           assertValidStatementLocation(parent, 'test');
           return {
             type: 'array',
-            parent: parent,
+            parent,
             key: 'consequent',
             targetIndex: getAssertedIndex('consequent', parent.consequent)
           };
@@ -127,20 +122,20 @@ function getStatementParent(target) {
         {
           return {
             type: 'array',
-            parent: parent,
+            parent,
             key: 'body',
             targetIndex: getAssertedIndex('body', parent.body)
           };
         }
     }
 
-    throw new _Errors.InvalidStatementError("Expected to find a valid statement parent, but found a parent of type \"".concat(parent.type, "\"."));
-  }();
+    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]
   result.parent[result.key] !== target) {
-    throw new _Errors.InvalidStatementError("Expected to find the target \"".concat(target.type, "\" on the \"").concat(result.parent.type, ".").concat(result.key, "\", but found a different node. ") + 'This likely means that you attempted to mutate around the target after it was deleted/replaced.');
+    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.');
   }
 
   return result;

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

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -52,7 +52,7 @@ export function getStatementParent(
   }
   function getAssertedIndex(key: string, arr: $ReadOnlyArray<mixed>): number {
     const idx = arr.indexOf(target);
-    if (idx == null) {
+    if (idx === -1) {
       throw new InvalidStatementError(
         `Could not find target in array of \`${parent.type}.${key}\`.`,
       );

package/dist/transform/mutations/utils/isValidModuleDeclarationParent.js

@@ -5,14 +5,8 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.isValidModuleDeclarationParent = isValidModuleDeclarationParent;
 
-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; }
-
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -29,24 +23,13 @@ function isValidModuleDeclarationParent(target, nodesToInsertOrReplace) {
     return true;
   }
 
-  var _iterator = _createForOfIteratorHelper(nodesToInsertOrReplace),
-      _step;
-
-  try {
-    for (_iterator.s(); !(_step = _iterator.n()).done;) {
-      var node = _step.value;
-
-      if (!isModuleDeclaration( // $FlowExpectedError[incompatible-cast]
-      node)) {
-        continue;
-      }
-
-      return false;
+  for (const node of nodesToInsertOrReplace) {
+    if (!isModuleDeclaration( // $FlowExpectedError[incompatible-cast]
+    node)) {
+      continue;
     }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
+
+    return false;
   }
 
   return true;

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

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.

package/dist/transform/transform.js

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -9,8 +9,6 @@
  */
 '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
 });
@@ -18,27 +16,20 @@ exports.transform = transform;
 
 var prettier = _interopRequireWildcard(require("prettier"));
 
-var _getTransformedAST2 = require("./getTransformedAST");
+var _getTransformedAST = require("./getTransformedAST");
 
 var _SimpleTraverser = require("../traverse/SimpleTraverser");
 
-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; }
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) { symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); } keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
-
-function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
 
-function transform(originalCode, visitors) {
-  var prettierOptions = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+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; }
 
-  var _getTransformedAST = (0, _getTransformedAST2.getTransformedAST)(originalCode, visitors),
-      ast = _getTransformedAST.ast,
-      astWasMutated = _getTransformedAST.astWasMutated,
-      mutatedCode = _getTransformedAST.mutatedCode;
+function transform(originalCode, visitors, prettierOptions = {}) {
+  const {
+    ast,
+    astWasMutated,
+    mutatedCode
+  } = (0, _getTransformedAST.getTransformedAST)(originalCode, visitors);
 
   if (!astWasMutated) {
     return originalCode;
@@ -49,11 +40,13 @@ function transform(originalCode, visitors) {
 
 
   _SimpleTraverser.SimpleTraverser.traverse(ast, {
-    enter: function enter(node) {
+    enter(node) {
       // $FlowExpectedError[cannot-write]
       delete node.parent;
     },
-    leave: function leave() {}
+
+    leave() {}
+
   }); // we need to delete the comments prop or else prettier will do
   // its own attachment pass after the mutation and duplicate the
   // comments on each node, borking the output
@@ -61,9 +54,12 @@ function transform(originalCode, visitors) {
 
 
   delete ast.comments;
-  return prettier.format(mutatedCode, _objectSpread(_objectSpread({}, prettierOptions), {}, {
-    parser: function parser() {
+  return prettier.format(mutatedCode, // $FlowExpectedError[incompatible-exact] - we don't want to create a dependency on the prettier types
+  { ...prettierOptions,
+
+    parser() {
       return ast;
     }
-  }));
+
+  });
 }

package/dist/transform/transform.js.flow

@@ -1,5 +1,5 @@
 /**
- * Copyright (c) Facebook, Inc. and its affiliates.
+ * 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.
@@ -17,11 +17,11 @@ import * as prettier from 'prettier';
 import {getTransformedAST} from './getTransformedAST';
 import {SimpleTraverser} from '../traverse/SimpleTraverser';
 
-export type Visitors = Visitor<TransformContext>;
+export type TransformVisitor = Visitor<TransformContext>;
 
 export function transform(
   originalCode: string,
-  visitors: Visitor<TransformContext>,
+  visitors: TransformVisitor,
   prettierOptions: {...} = {},
 ): string {
   const {ast, astWasMutated, mutatedCode} = getTransformedAST(
@@ -51,10 +51,14 @@ export function transform(
   // $FlowExpectedError[cannot-write]
   delete ast.comments;
 
-  return prettier.format(mutatedCode, {
-    ...prettierOptions,
-    parser() {
-      return ast;
+  return prettier.format(
+    mutatedCode,
+    // $FlowExpectedError[incompatible-exact] - we don't want to create a dependency on the prettier types
+    {
+      ...prettierOptions,
+      parser() {
+        return ast;
+      },
     },
-  });
+  );
 }