build

node_modules/@babel/generator/lib/node/index.js

@@ -12,17 +12,11 @@ var whitespace = _interopRequireWildcard(require("./whitespace"));
 
 var parens = _interopRequireWildcard(require("./parentheses"));
 
-function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+var t = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
-    return data;
-  };
+function _getRequireWildcardCache() { if (typeof WeakMap !== "function") return null; var cache = new WeakMap(); _getRequireWildcardCache = function () { return cache; }; return cache; }
 
-  return data;
-}
-
-function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (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 expandAliases(obj) {
   const newObj = {};
@@ -36,7 +30,7 @@ function expandAliases(obj) {
   }
 
   for (const type of Object.keys(obj)) {
-    const aliases = t().FLIPPED_ALIAS_KEYS[type];
+    const aliases = t.FLIPPED_ALIAS_KEYS[type];
 
     if (aliases) {
       for (const alias of aliases) {
@@ -60,21 +54,17 @@ function find(obj, node, parent, printStack) {
 }
 
 function isOrHasCallExpression(node) {
-  if (t().isCallExpression(node)) {
+  if (t.isCallExpression(node)) {
     return true;
   }
 
-  if (t().isMemberExpression(node)) {
-    return isOrHasCallExpression(node.object) || !node.computed && isOrHasCallExpression(node.property);
-  } else {
-    return false;
-  }
+  return t.isMemberExpression(node) && isOrHasCallExpression(node.object);
 }
 
 function needsWhitespace(node, parent, type) {
   if (!node) return 0;
 
-  if (t().isExpressionStatement(node)) {
+  if (t.isExpressionStatement(node)) {
     node = node.expression;
   }
 
@@ -109,7 +99,7 @@ function needsWhitespaceAfter(node, parent) {
 function needsParens(node, parent, printStack) {
   if (!parent) return false;
 
-  if (t().isNewExpression(parent) && parent.callee === node) {
+  if (t.isNewExpression(parent) && parent.callee === node) {
     if (isOrHasCallExpression(node)) return true;
   }
 

node_modules/@babel/generator/lib/node/parentheses.js

@@ -13,6 +13,7 @@ exports.IntersectionTypeAnnotation = exports.UnionTypeAnnotation = UnionTypeAnno
 exports.TSAsExpression = TSAsExpression;
 exports.TSTypeAssertion = TSTypeAssertion;
 exports.TSIntersectionType = exports.TSUnionType = TSUnionType;
+exports.TSInferType = TSInferType;
 exports.BinaryExpression = BinaryExpression;
 exports.SequenceExpression = SequenceExpression;
 exports.AwaitExpression = exports.YieldExpression = YieldExpression;
@@ -21,24 +22,19 @@ exports.UnaryLike = UnaryLike;
 exports.FunctionExpression = FunctionExpression;
 exports.ArrowFunctionExpression = ArrowFunctionExpression;
 exports.ConditionalExpression = ConditionalExpression;
-exports.OptionalMemberExpression = OptionalMemberExpression;
+exports.OptionalCallExpression = exports.OptionalMemberExpression = OptionalMemberExpression;
 exports.AssignmentExpression = AssignmentExpression;
-exports.NewExpression = NewExpression;
+exports.LogicalExpression = LogicalExpression;
 
-function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+var t = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
-    return data;
-  };
+function _getRequireWildcardCache() { if (typeof WeakMap !== "function") return null; var cache = new WeakMap(); _getRequireWildcardCache = function () { return cache; }; return cache; }
 
-  return data;
-}
-
-function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (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; }
 
 const PRECEDENCE = {
   "||": 0,
+  "??": 0,
   "&&": 1,
   "|": 2,
   "^": 3,
@@ -64,24 +60,20 @@ const PRECEDENCE = {
   "**": 10
 };
 
-const isClassExtendsClause = (node, parent) => (t().isClassDeclaration(parent) || t().isClassExpression(parent)) && parent.superClass === node;
+const isClassExtendsClause = (node, parent) => (t.isClassDeclaration(parent) || t.isClassExpression(parent)) && parent.superClass === node;
+
+const hasPostfixPart = (node, parent) => (t.isMemberExpression(parent) || t.isOptionalMemberExpression(parent)) && parent.object === node || (t.isCallExpression(parent) || t.isOptionalCallExpression(parent) || t.isNewExpression(parent)) && parent.callee === node || t.isTaggedTemplateExpression(parent) && parent.tag === node || t.isTSNonNullExpression(parent);
 
 function NullableTypeAnnotation(node, parent) {
-  return t().isArrayTypeAnnotation(parent);
+  return t.isArrayTypeAnnotation(parent);
 }
 
-function FunctionTypeAnnotation(node, parent) {
-  return t().isUnionTypeAnnotation(parent) || t().isIntersectionTypeAnnotation(parent) || t().isArrayTypeAnnotation(parent);
+function FunctionTypeAnnotation(node, parent, printStack) {
+  return t.isUnionTypeAnnotation(parent) || t.isIntersectionTypeAnnotation(parent) || t.isArrayTypeAnnotation(parent) || t.isTypeAnnotation(parent) && t.isArrowFunctionExpression(printStack[printStack.length - 3]);
 }
 
 function UpdateExpression(node, parent) {
-  return t().isMemberExpression(parent, {
-    object: node
-  }) || t().isCallExpression(parent, {
-    callee: node
-  }) || t().isNewExpression(parent, {
-    callee: node
-  }) || isClassExtendsClause(node, parent);
+  return hasPostfixPart(node, parent) || isClassExtendsClause(node, parent);
 }
 
 function ObjectExpression(node, parent, printStack) {
@@ -95,7 +87,7 @@ function DoExpression(node, parent, printStack) {
 }
 
 function Binary(node, parent) {
-  if (node.operator === "**" && t().isBinaryExpression(parent, {
+  if (node.operator === "**" && t.isBinaryExpression(parent, {
     operator: "**"
   })) {
     return parent.left === node;
@@ -105,26 +97,24 @@ function Binary(node, parent) {
     return true;
   }
 
-  if ((t().isCallExpression(parent) || t().isNewExpression(parent)) && parent.callee === node || t().isUnaryLike(parent) || t().isMemberExpression(parent) && parent.object === node || t().isAwaitExpression(parent)) {
+  if (hasPostfixPart(node, parent) || t.isUnaryLike(parent) || t.isAwaitExpression(parent)) {
     return true;
   }
 
-  if (t().isBinary(parent)) {
+  if (t.isBinary(parent)) {
     const parentOp = parent.operator;
     const parentPos = PRECEDENCE[parentOp];
     const nodeOp = node.operator;
     const nodePos = PRECEDENCE[nodeOp];
 
-    if (parentPos === nodePos && parent.right === node && !t().isLogicalExpression(parent) || parentPos > nodePos) {
+    if (parentPos === nodePos && parent.right === node && !t.isLogicalExpression(parent) || parentPos > nodePos) {
       return true;
     }
   }
-
-  return false;
 }
 
 function UnionTypeAnnotation(node, parent) {
-  return t().isArrayTypeAnnotation(parent) || t().isNullableTypeAnnotation(parent) || t().isIntersectionTypeAnnotation(parent) || t().isUnionTypeAnnotation(parent);
+  return t.isArrayTypeAnnotation(parent) || t.isNullableTypeAnnotation(parent) || t.isIntersectionTypeAnnotation(parent) || t.isUnionTypeAnnotation(parent);
 }
 
 function TSAsExpression() {
@@ -136,15 +126,19 @@ function TSTypeAssertion() {
 }
 
 function TSUnionType(node, parent) {
-  return t().isTSArrayType(parent) || t().isTSOptionalType(parent) || t().isTSIntersectionType(parent) || t().isTSUnionType(parent) || t().isTSRestType(parent);
+  return t.isTSArrayType(parent) || t.isTSOptionalType(parent) || t.isTSIntersectionType(parent) || t.isTSUnionType(parent) || t.isTSRestType(parent);
+}
+
+function TSInferType(node, parent) {
+  return t.isTSArrayType(parent) || t.isTSOptionalType(parent);
 }
 
 function BinaryExpression(node, parent) {
-  return node.operator === "in" && (t().isVariableDeclarator(parent) || t().isFor(parent));
+  return node.operator === "in" && (t.isVariableDeclarator(parent) || t.isFor(parent));
 }
 
 function SequenceExpression(node, parent) {
-  if (t().isForStatement(parent) || t().isThrowStatement(parent) || t().isReturnStatement(parent) || t().isIfStatement(parent) && parent.test === node || t().isWhileStatement(parent) && parent.test === node || t().isForInStatement(parent) && parent.right === node || t().isSwitchStatement(parent) && parent.discriminant === node || t().isExpressionStatement(parent) && parent.expression === node) {
+  if (t.isForStatement(parent) || t.isThrowStatement(parent) || t.isReturnStatement(parent) || t.isIfStatement(parent) && parent.test === node || t.isWhileStatement(parent) && parent.test === node || t.isForInStatement(parent) && parent.right === node || t.isSwitchStatement(parent) && parent.discriminant === node || t.isExpressionStatement(parent) && parent.expression === node) {
     return false;
   }
 
@@ -152,7 +146,7 @@ function SequenceExpression(node, parent) {
 }
 
 function YieldExpression(node, parent) {
-  return t().isBinary(parent) || t().isUnaryLike(parent) || t().isCallExpression(parent) || t().isMemberExpression(parent) || t().isNewExpression(parent) || t().isAwaitExpression(parent) && t().isYieldExpression(node) || t().isConditionalExpression(parent) && node === parent.test || isClassExtendsClause(node, parent);
+  return t.isBinary(parent) || t.isUnaryLike(parent) || hasPostfixPart(node, parent) || t.isAwaitExpression(parent) && t.isYieldExpression(node) || t.isConditionalExpression(parent) && node === parent.test || isClassExtendsClause(node, parent);
 }
 
 function ClassExpression(node, parent, printStack) {
@@ -162,13 +156,7 @@ function ClassExpression(node, parent, printStack) {
 }
 
 function UnaryLike(node, parent) {
-  return t().isMemberExpression(parent, {
-    object: node
-  }) || t().isCallExpression(parent, {
-    callee: node
-  }) || t().isNewExpression(parent, {
-    callee: node
-  }) || t().isBinaryExpression(parent, {
+  return hasPostfixPart(node, parent) || t.isBinaryExpression(parent, {
     operator: "**",
     left: node
   }) || isClassExtendsClause(node, parent);
@@ -181,13 +169,13 @@ function FunctionExpression(node, parent, printStack) {
 }
 
 function ArrowFunctionExpression(node, parent) {
-  return t().isExportDeclaration(parent) || ConditionalExpression(node, parent);
+  return t.isExportDeclaration(parent) || ConditionalExpression(node, parent);
 }
 
 function ConditionalExpression(node, parent) {
-  if (t().isUnaryLike(parent) || t().isBinary(parent) || t().isConditionalExpression(parent, {
+  if (t.isUnaryLike(parent) || t.isBinary(parent) || t.isConditionalExpression(parent, {
     test: node
-  }) || t().isAwaitExpression(parent) || t().isOptionalMemberExpression(parent) || t().isTaggedTemplateExpression(parent) || t().isTSTypeAssertion(parent) || t().isTSAsExpression(parent)) {
+  }) || t.isAwaitExpression(parent) || t.isTSTypeAssertion(parent) || t.isTSAsExpression(parent)) {
     return true;
   }
 
@@ -195,19 +183,35 @@ function ConditionalExpression(node, parent) {
 }
 
 function OptionalMemberExpression(node, parent) {
-  return t().isCallExpression(parent) || t().isMemberExpression(parent);
+  return t.isCallExpression(parent, {
+    callee: node
+  }) || t.isMemberExpression(parent, {
+    object: node
+  });
 }
 
-function AssignmentExpression(node) {
-  if (t().isObjectPattern(node.left)) {
+function AssignmentExpression(node, parent, printStack) {
+  if (t.isObjectPattern(node.left)) {
     return true;
   } else {
-    return ConditionalExpression(...arguments);
+    return ConditionalExpression(node, parent, printStack);
   }
 }
 
-function NewExpression(node, parent) {
-  return isClassExtendsClause(node, parent);
+function LogicalExpression(node, parent) {
+  switch (node.operator) {
+    case "||":
+      if (!t.isLogicalExpression(parent)) return false;
+      return parent.operator === "??" || parent.operator === "&&";
+
+    case "&&":
+      return t.isLogicalExpression(parent, {
+        operator: "??"
+      });
+
+    case "??":
+      return t.isLogicalExpression(parent) && parent.operator !== "??";
+  }
 }
 
 function isFirstInStatement(printStack, {
@@ -220,25 +224,21 @@ function isFirstInStatement(printStack, {
   let parent = printStack[i];
 
   while (i > 0) {
-    if (t().isExpressionStatement(parent, {
+    if (t.isExpressionStatement(parent, {
       expression: node
-    }) || t().isTaggedTemplateExpression(parent) || considerDefaultExports && t().isExportDefaultDeclaration(parent, {
+    }) || considerDefaultExports && t.isExportDefaultDeclaration(parent, {
       declaration: node
-    }) || considerArrow && t().isArrowFunctionExpression(parent, {
+    }) || considerArrow && t.isArrowFunctionExpression(parent, {
       body: node
     })) {
       return true;
     }
 
-    if (t().isCallExpression(parent, {
-      callee: node
-    }) || t().isSequenceExpression(parent) && parent.expressions[0] === node || t().isMemberExpression(parent, {
-      object: node
-    }) || t().isConditional(parent, {
+    if (hasPostfixPart(node, parent) && !t.isNewExpression(parent) || t.isSequenceExpression(parent) && parent.expressions[0] === node || t.isConditional(parent, {
       test: node
-    }) || t().isBinary(parent, {
+    }) || t.isBinary(parent, {
       left: node
-    }) || t().isAssignmentExpression(parent, {
+    }) || t.isAssignmentExpression(parent, {
       left: node
     })) {
       node = parent;

node_modules/@babel/generator/lib/node/whitespace.js

@@ -5,31 +5,25 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.list = exports.nodes = void 0;
 
-function t() {
-  const data = _interopRequireWildcard(require("@babel/types"));
+var t = _interopRequireWildcard(require("@babel/types"));
 
-  t = function () {
-    return data;
-  };
+function _getRequireWildcardCache() { if (typeof WeakMap !== "function") return null; var cache = new WeakMap(); _getRequireWildcardCache = function () { return cache; }; return cache; }
 
-  return data;
-}
-
-function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) { var desc = Object.defineProperty && Object.getOwnPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : {}; if (desc.get || desc.set) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } } newObj.default = obj; return newObj; } }
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (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 crawl(node, state = {}) {
-  if (t().isMemberExpression(node)) {
+  if (t.isMemberExpression(node) || t.isOptionalMemberExpression(node)) {
     crawl(node.object, state);
     if (node.computed) crawl(node.property, state);
-  } else if (t().isBinary(node) || t().isAssignmentExpression(node)) {
+  } else if (t.isBinary(node) || t.isAssignmentExpression(node)) {
     crawl(node.left, state);
     crawl(node.right, state);
-  } else if (t().isCallExpression(node)) {
+  } else if (t.isCallExpression(node) || t.isOptionalCallExpression(node)) {
     state.hasCall = true;
     crawl(node.callee, state);
-  } else if (t().isFunction(node)) {
+  } else if (t.isFunction(node)) {
     state.hasFunction = true;
-  } else if (t().isIdentifier(node)) {
+  } else if (t.isIdentifier(node)) {
     state.hasHelper = state.hasHelper || isHelper(node.callee);
   }
 
@@ -37,21 +31,21 @@ function crawl(node, state = {}) {
 }
 
 function isHelper(node) {
-  if (t().isMemberExpression(node)) {
+  if (t.isMemberExpression(node)) {
     return isHelper(node.object) || isHelper(node.property);
-  } else if (t().isIdentifier(node)) {
+  } else if (t.isIdentifier(node)) {
     return node.name === "require" || node.name[0] === "_";
-  } else if (t().isCallExpression(node)) {
+  } else if (t.isCallExpression(node)) {
     return isHelper(node.callee);
-  } else if (t().isBinary(node) || t().isAssignmentExpression(node)) {
-    return t().isIdentifier(node.left) && isHelper(node.left) || isHelper(node.right);
+  } else if (t.isBinary(node) || t.isAssignmentExpression(node)) {
+    return t.isIdentifier(node.left) && isHelper(node.left) || isHelper(node.right);
   } else {
     return false;
   }
 }
 
 function isType(node) {
-  return t().isLiteral(node) || t().isObjectExpression(node) || t().isArrayExpression(node) || t().isIdentifier(node) || t().isMemberExpression(node);
+  return t.isLiteral(node) || t.isObjectExpression(node) || t.isArrayExpression(node) || t.isIdentifier(node) || t.isMemberExpression(node);
 }
 
 const nodes = {
@@ -74,7 +68,7 @@ const nodes = {
   },
 
   LogicalExpression(node) {
-    if (t().isFunction(node.left) || t().isFunction(node.right)) {
+    if (t.isFunction(node.left) || t.isFunction(node.right)) {
       return {
         after: true
       };
@@ -90,7 +84,16 @@ const nodes = {
   },
 
   CallExpression(node) {
-    if (t().isFunction(node.callee) || isHelper(node)) {
+    if (t.isFunction(node.callee) || isHelper(node)) {
+      return {
+        before: true,
+        after: true
+      };
+    }
+  },
+
+  OptionalCallExpression(node) {
+    if (t.isFunction(node.callee)) {
       return {
         before: true,
         after: true
@@ -118,7 +121,7 @@ const nodes = {
   },
 
   IfStatement(node) {
-    if (t().isBlockStatement(node.consequent)) {
+    if (t.isBlockStatement(node.consequent)) {
       return {
         before: true,
         after: true
@@ -138,7 +141,9 @@ nodes.ObjectProperty = nodes.ObjectTypeProperty = nodes.ObjectMethod = function
 };
 
 nodes.ObjectTypeCallProperty = function (node, parent) {
-  if (parent.callProperties[0] === node && (!parent.properties || !parent.properties.length)) {
+  var _parent$properties;
+
+  if (parent.callProperties[0] === node && !((_parent$properties = parent.properties) == null ? void 0 : _parent$properties.length)) {
     return {
       before: true
     };
@@ -146,7 +151,9 @@ nodes.ObjectTypeCallProperty = function (node, parent) {
 };
 
 nodes.ObjectTypeIndexer = function (node, parent) {
-  if (parent.indexers[0] === node && (!parent.properties || !parent.properties.length) && (!parent.callProperties || !parent.callProperties.length)) {
+  var _parent$properties2, _parent$callPropertie;
+
+  if (parent.indexers[0] === node && !((_parent$properties2 = parent.properties) == null ? void 0 : _parent$properties2.length) && !((_parent$callPropertie = parent.callProperties) == null ? void 0 : _parent$callPropertie.length)) {
     return {
       before: true
     };
@@ -154,7 +161,9 @@ nodes.ObjectTypeIndexer = function (node, parent) {
 };
 
 nodes.ObjectTypeInternalSlot = function (node, parent) {
-  if (parent.internalSlots[0] === node && (!parent.properties || !parent.properties.length) && (!parent.callProperties || !parent.callProperties.length) && (!parent.indexers || !parent.indexers.length)) {
+  var _parent$properties3, _parent$callPropertie2, _parent$indexers;
+
+  if (parent.internalSlots[0] === node && !((_parent$properties3 = parent.properties) == null ? void 0 : _parent$properties3.length) && !((_parent$callPropertie2 = parent.callProperties) == null ? void 0 : _parent$callPropertie2.length) && !((_parent$indexers = parent.indexers) == null ? void 0 : _parent$indexers.length)) {
     return {
       before: true
     };
@@ -184,7 +193,7 @@ exports.list = list;
     };
   }
 
-  [type].concat(t().FLIPPED_ALIAS_KEYS[type] || []).forEach(function (type) {
+  [type].concat(t.FLIPPED_ALIAS_KEYS[type] || []).forEach(function (type) {
     nodes[type] = function () {
       return amounts;
     };