Updating NPM dependencies

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,9 +22,9 @@ 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;
 
 var t = _interopRequireWildcard(require("@babel/types"));
 
@@ -61,6 +62,8 @@ const PRECEDENCE = {
 
 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);
 }
@@ -70,13 +73,7 @@ function FunctionTypeAnnotation(node, parent, printStack) {
 }
 
 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) {
@@ -100,7 +97,7 @@ 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;
   }
 
@@ -114,8 +111,6 @@ function Binary(node, parent) {
       return true;
     }
   }
-
-  return false;
 }
 
 function UnionTypeAnnotation(node, parent) {
@@ -134,6 +129,10 @@ function TSUnionType(node, 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));
 }
@@ -147,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) {
@@ -157,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);
@@ -182,7 +175,7 @@ function ArrowFunctionExpression(node, parent) {
 function ConditionalExpression(node, 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;
   }
 
@@ -190,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) {
+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, {
@@ -214,10 +223,10 @@ function isFirstInStatement(printStack, {
   i--;
   let parent = printStack[i];
 
-  while (i > 0) {
+  while (i >= 0) {
     if (t.isExpressionStatement(parent, {
       expression: node
-    }) || t.isTaggedTemplateExpression(parent) || considerDefaultExports && t.isExportDefaultDeclaration(parent, {
+    }) || considerDefaultExports && t.isExportDefaultDeclaration(parent, {
       declaration: node
     }) || considerArrow && t.isArrowFunctionExpression(parent, {
       body: node
@@ -225,11 +234,7 @@ function isFirstInStatement(printStack, {
       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, {
       left: node