@danielx/civet 0.7.34 → 0.7.35

package/dist/main.js

@@ -30,9 +30,9 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
 ));
 var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
 
-// node_modules/.pnpm/@danielx+hera@0.8.16/node_modules/@danielx/hera/dist/machine.js
+// node_modules/@danielx/hera/dist/machine.js
 var require_machine = __commonJS({
-  "node_modules/.pnpm/@danielx+hera@0.8.16/node_modules/@danielx/hera/dist/machine.js"(exports2, module2) {
+  "node_modules/@danielx/hera/dist/machine.js"(exports2, module2) {
     "use strict";
     var __defProp2 = Object.defineProperty;
     var __getOwnPropDesc2 = Object.getOwnPropertyDescriptor;
@@ -564,11 +564,13 @@ __export(lib_exports, {
   processProgramAsync: () => processProgramAsync,
   processTryBlock: () => processTryBlock,
   processUnaryExpression: () => processUnaryExpression,
+  processUnaryNestedExpression: () => processUnaryNestedExpression,
   quoteString: () => quoteString,
   reorderBindingRestProperty: () => reorderBindingRestProperty,
   replaceNode: () => replaceNode,
   replaceNodes: () => replaceNodes,
   skipImplicitArguments: () => skipImplicitArguments,
+  stripTrailingImplicitComma: () => stripTrailingImplicitComma,
   trimFirstSpace: () => trimFirstSpace,
   typeOfJSX: () => typeOfJSX,
   wrapIIFE: () => wrapIIFE
@@ -705,6 +707,40 @@ function isWhitespaceOrEmpty(node) {
     return node.every(isWhitespaceOrEmpty);
   return false;
 }
+function firstNonSpace(node) {
+  if (!(node != null)) {
+    return;
+  }
+  if (Array.isArray(node)) {
+    for (let i2 = 0, len22 = node.length; i2 < len22; i2++) {
+      const child = node[i2];
+      let ref1;
+      if (ref1 = firstNonSpace(child)) {
+        const first = ref1;
+        return first;
+      }
+    }
+    return void 0;
+  } else if (isParent(node)) {
+    let ref2;
+    if (ref2 = firstNonSpace(node.children)) {
+      const first = ref2;
+      return first;
+    } else {
+      return node;
+    }
+  } else if (isToken(node)) {
+    let m;
+    if (m = node.token, typeof m === "string" && /^[ \t]*$/.test(m)) {
+      return;
+    }
+  } else if (typeof node === "string") {
+    if (typeof node === "string" && /^[ \t]*$/.test(node)) {
+      return;
+    }
+  }
+  return node;
+}
 function isExit(node) {
   if (!(node != null)) {
     return false;
@@ -742,6 +778,14 @@ function isComma(node) {
   ;
   return;
 }
+function stripTrailingImplicitComma(children) {
+  const last = children[children.length - 1];
+  if (isComma(last) && last.implicit) {
+    return children.slice(0, -1);
+  } else {
+    return children;
+  }
+}
 function insertTrimmingSpace(target, c) {
   if (!(target != null)) {
     return target;
@@ -914,8 +958,8 @@ function startsWithPredicate(node, predicate, skip = isWhitespaceOrEmpty) {
     return void 0;
   }
   if (Array.isArray(node)) {
-    for (let i2 = 0, len22 = node.length; i2 < len22; i2++) {
-      const child = node[i2];
+    for (let i3 = 0, len3 = node.length; i3 < len3; i3++) {
+      const child = node[i3];
       if (skip(child)) {
         continue;
       }
@@ -1002,6 +1046,9 @@ function makeLeftHandSideExpression(expression) {
       return expression;
     }
   }
+  return parenthesizeExpression(expression);
+}
+function parenthesizeExpression(expression) {
   return makeNode({
     type: "ParenthesizedExpression",
     children: ["(", expression, ")"],
@@ -1017,8 +1064,8 @@ function updateParentPointers(node, parent, depth = 1) {
     return;
   }
   if (Array.isArray(node)) {
-    for (let i3 = 0, len3 = node.length; i3 < len3; i3++) {
-      const child = node[i3];
+    for (let i4 = 0, len4 = node.length; i4 < len4; i4++) {
+      const child = node[i4];
       updateParentPointers(child, parent, depth);
     }
     return;
@@ -1028,8 +1075,8 @@ function updateParentPointers(node, parent, depth = 1) {
     node.parent = parent;
   }
   if (depth && isParent(node)) {
-    for (let ref1 = node.children, i4 = 0, len4 = ref1.length; i4 < len4; i4++) {
-      const child = ref1[i4];
+    for (let ref3 = node.children, i5 = 0, len5 = ref3.length; i5 < len5; i5++) {
+      const child = ref3[i5];
       updateParentPointers(child, node, depth - 1);
     }
   }
@@ -1159,8 +1206,8 @@ function wrapIIFE(expressions, asyncFlag, generator) {
       children.splice(1, 0, ".bind(this)");
     }
     if (gatherRecursiveWithinFunction(block, (a2) => typeof a2 === "object" && a2 != null && "token" in a2 && a2.token === "arguments").length) {
-      let ref2;
-      children[children.length - 1] = (ref2 = parameters.children)[ref2.length - 1] = "(arguments)";
+      let ref4;
+      children[children.length - 1] = (ref4 = parameters.children)[ref4.length - 1] = "(arguments)";
     }
   }
   const exp = makeNode({
@@ -1183,9 +1230,9 @@ function wrapWithReturn(expression) {
 }
 function flatJoin(array, separator) {
   const result = [];
-  for (let i5 = 0, len5 = array.length; i5 < len5; i5++) {
-    const i = i5;
-    const items = array[i5];
+  for (let i6 = 0, len6 = array.length; i6 < len6; i6++) {
+    const i = i6;
+    const items = array[i6];
     if (i) {
       result.push(separator);
     }
@@ -1584,12 +1631,6 @@ function isVoidType(t) {
 function isPromiseVoidType(t) {
   return t?.type === "TypeIdentifier" && t.raw === "Promise" && t.args?.types?.length === 1 && isVoidType(t.args.types[0]);
 }
-function isGeneratorVoidType(t) {
-  return t?.type === "TypeIdentifier" && (t.raw === "Iterator" || t.raw === "Generator") && t.args?.types?.length >= 2 && isVoidType(t.args.types[1]);
-}
-function isAsyncGeneratorVoidType(t) {
-  return t?.type === "TypeIdentifier" && (t.raw === "AsyncIterator" || t.raw === "AsyncGenerator") && t.args?.types?.length >= 2 && isVoidType(t.args.types[1]);
-}
 function implicitFunctionBlock(f) {
   if (f.abstract || f.block || f.signature?.optional)
     return;
@@ -1627,7 +1668,7 @@ function processReturn(f, implicitReturns) {
     const { async, generator, set } = modifier;
     const isMethod = f.type === "MethodDefinition";
     const isConstructor = isMethod && name === "constructor";
-    const isVoid = isVoidType(returnType2?.t) || async && (isPromiseVoidType(returnType2?.t) || generator && isAsyncGeneratorVoidType(returnType2?.t)) || !async && generator && isGeneratorVoidType(returnType2?.t);
+    const isVoid = generator || isVoidType(returnType2?.t) || async && isPromiseVoidType(returnType2?.t);
     if (block?.type === "BlockStatement") {
       if (isVoid || set || isConstructor) {
         if (block.bare && block.implicitlyReturned) {
@@ -1643,10 +1684,7 @@ function processReturn(f, implicitReturns) {
 }
 function processReturnValue(func) {
   const { block } = func;
-  const values = gatherRecursiveWithinFunction(
-    block,
-    ({ type }) => type === "ReturnValue"
-  );
+  const values = gatherRecursiveWithinFunction(block, ($) => $.type === "ReturnValue");
   if (!values.length) {
     return false;
   }
@@ -1656,7 +1694,7 @@ function processReturnValue(func) {
     value.children = [ref];
     const { ancestor, child } = findAncestor(
       value,
-      ({ type }) => type === "Declaration",
+      ($1) => $1.type === "Declaration",
       isFunction
     );
     if (ancestor) {
@@ -1676,8 +1714,8 @@ function processReturnValue(func) {
     }
   }
   if (declaration) {
-    if (!(declaration.suffix != null)) {
-      declaration.children[1] = declaration.suffix = returnType;
+    if (!(declaration.typeSuffix != null)) {
+      declaration.children[1] = declaration.typeSuffix = returnType;
     }
   } else {
     block.expressions.unshift([
@@ -2017,7 +2055,7 @@ function processBreakContinueWith(statement) {
   let changed = false;
   for (const control of gatherRecursiveWithinFunction(
     statement.block,
-    ($) => $.type === "BreakStatement" || $.type === "ContinueStatement"
+    ($2) => $2.type === "BreakStatement" || $2.type === "ContinueStatement"
   )) {
     let controlName2 = function() {
       switch (control.type) {
@@ -2052,7 +2090,7 @@ function processBreakContinueWith(statement) {
         )
       );
       updateParentPointers(control.with, control);
-      const i = control.children.findIndex(($1) => $1?.type === "Error");
+      const i = control.children.findIndex(($3) => $3?.type === "Error");
       if (i >= 0) {
         control.children.splice(i, 1);
       }
@@ -2176,8 +2214,8 @@ function processSignature(f) {
   }
   if (hasYield(block) && !f.generator?.length) {
     if (f.type === "ArrowFunction") {
-      gatherRecursiveWithinFunction(block, ($2) => $2.type === "YieldExpression").forEach((y) => {
-        const i = y.children.findIndex(($3) => $3.type === "Yield");
+      gatherRecursiveWithinFunction(block, ($4) => $4.type === "YieldExpression").forEach((y) => {
+        const i = y.children.findIndex(($5) => $5.type === "Yield");
         return y.children.splice(i + 1, 0, {
           type: "Error",
           message: "Can't use yield inside of => arrow function"
@@ -2301,12 +2339,13 @@ function processCoffeeDo(ws, expression) {
     expression = {
       ...expression,
       parameters: newParameters,
-      children: expression.children.map(($4) => $4 === parameters ? newParameters : $4)
+      children: expression.children.map(($6) => $6 === parameters ? newParameters : $6)
     };
   }
   return {
     type: "CallExpression",
     children: [
+      ws,
       makeLeftHandSideExpression(expression),
       {
         type: "Call",
@@ -2322,7 +2361,7 @@ function makeAmpersandFunction(rhs) {
     ref = makeRef("$");
     inplacePrepend(ref, body);
   }
-  if (startsWithPredicate(body, ($5) => $5.type === "ObjectExpression")) {
+  if (startsWithPredicate(body, ($7) => $7.type === "ObjectExpression")) {
     body = makeLeftHandSideExpression(body);
   }
   const parameters = makeNode({
@@ -3512,7 +3551,7 @@ function aliasBinding(p, ref) {
 function len2(arr, length) {
   return arr.length === length;
 }
-function processAssignmentDeclaration(decl, pattern, suffix, ws, assign, e) {
+function processAssignmentDeclaration(decl, pattern, typeSuffix, ws, assign, e) {
   decl = {
     ...decl,
     $loc: {
@@ -3524,7 +3563,7 @@ function processAssignmentDeclaration(decl, pattern, suffix, ws, assign, e) {
   splices = splices.map((s) => [", ", s]);
   const thisAssignments = assignments.map((a) => ["", a, ";"]);
   if ("typeSuffix" in pattern) {
-    suffix ??= pattern.typeSuffix;
+    typeSuffix ??= pattern.typeSuffix;
   }
   const initializer = makeNode({
     type: "Initializer",
@@ -3536,9 +3575,9 @@ function processAssignmentDeclaration(decl, pattern, suffix, ws, assign, e) {
     pattern,
     initializer,
     splices,
-    suffix,
+    typeSuffix,
     thisAssignments,
-    children: [pattern, suffix, initializer]
+    children: [pattern, typeSuffix, initializer]
   });
   const children = [decl, binding];
   return makeNode({
@@ -3555,9 +3594,9 @@ function processDeclarations(statements) {
   gatherRecursiveAll(statements, ($) => $.type === "Declaration").forEach((statement) => {
     const { bindings } = statement;
     return bindings?.forEach((binding) => {
-      const suffix = binding.suffix;
-      if (suffix && suffix.optional && suffix.t) {
-        convertOptionalType(suffix);
+      const { typeSuffix } = binding;
+      if (typeSuffix && typeSuffix.optional && typeSuffix.t) {
+        convertOptionalType(typeSuffix);
       }
       const { initializer } = binding;
       if (initializer) {
@@ -3638,8 +3677,8 @@ function processDeclarationCondition(condition, rootCondition, parent) {
   }
   const { decl, bindings } = condition.declaration;
   const binding = bindings[0];
-  let { pattern, suffix, initializer } = binding;
-  const nullCheck = suffix?.optional && !suffix.t && !suffix.nonnull;
+  let { pattern, typeSuffix, initializer } = binding;
+  const nullCheck = typeSuffix?.optional && !typeSuffix.t && !typeSuffix.nonnull;
   if (!(initializer != null)) {
     condition.children = [
       {
@@ -3677,14 +3716,14 @@ function processDeclarationCondition(condition, rootCondition, parent) {
     if (nullCheck) {
       children.unshift("(");
       children.push(") != null");
-      suffix = void 0;
+      typeSuffix = void 0;
     }
     Object.assign(condition, {
       type: "AssignmentExpression",
       children,
       hoistDec: !simple ? {
         type: "Declaration",
-        children: ["let ", ref, suffix],
+        children: ["let ", ref, typeSuffix],
         names: []
       } : void 0,
       pattern,
@@ -3692,7 +3731,7 @@ function processDeclarationCondition(condition, rootCondition, parent) {
     });
   }
   updateParentPointers(condition, parent);
-  rootCondition.blockPrefix = getPatternBlockPrefix(pattern, ref, decl, suffix);
+  rootCondition.blockPrefix = getPatternBlockPrefix(pattern, ref, decl, typeSuffix);
 }
 function processDeclarationConditions(node) {
   gatherRecursiveAll(
@@ -4070,6 +4109,10 @@ function processUnaryExpression(pre, exp, post) {
         };
         pre = pre.slice(0, -1);
       } else {
+        let m;
+        if (m = firstNonSpace(exp), typeof m === "string" && /^[ \t]*\n/.test(m) || typeof m === "object" && m != null && "token" in m && typeof m.token === "string" && /^[ \t]*\n/.test(m.token)) {
+          exp = parenthesizeExpression(exp);
+        }
         exp = {
           type: "AwaitExpression",
           children: [...last.children, exp]
@@ -4085,6 +4128,77 @@ function processUnaryExpression(pre, exp, post) {
     children: [...pre, exp, post]
   };
 }
+function processUnaryNestedExpression(pre, args, post) {
+  const isArray = args.type === "ArrayExpression";
+  if (!isArray) {
+    args = stripTrailingImplicitComma(args);
+  }
+  if (isArray || args.length > 2) {
+    const last = pre[pre.length - 1];
+    if (!(typeof last === "object" && last != null && "type" in last && last.type === "Await")) {
+      return;
+    }
+    if (last.op) {
+      if (!isArray) {
+        args = {
+          type: "ArrayExpression",
+          children: ["[", args, "]"]
+        };
+      }
+    } else {
+      pre.pop();
+      if (!isArray) {
+        args = args;
+        args = {
+          type: "ArrayExpression",
+          children: [
+            "[",
+            ...(() => {
+              const results = [];
+              for (let i = 0, len3 = args.length; i < len3; i++) {
+                const arg = args[i];
+                if (typeof arg === "object" && arg != null && "type" in arg && arg.type === "Argument") {
+                  const expression = processUnaryExpression([last], arg.expression);
+                  results.push({
+                    ...arg,
+                    expression,
+                    children: arg.children.map(($) => $ === arg.expression ? expression : $)
+                  });
+                } else {
+                  results.push(arg);
+                }
+              }
+              return results;
+            })(),
+            "]"
+          ]
+        };
+      } else {
+        args = trimFirstSpace(args);
+        args = {
+          ...args,
+          children: args.children.map(
+            (arg) => {
+              if (typeof arg === "object" && arg != null && "type" in arg && arg.type === "ArrayElement" && "expression" in arg && "children" in arg) {
+                const { type, expression: exp, children } = arg;
+                let expression = processUnaryExpression([last], trimFirstSpace(exp));
+                expression = prepend(getTrimmingSpace(exp), expression);
+                return {
+                  ...arg,
+                  expression,
+                  children: children.map(($1) => $1 === exp ? expression : $1)
+                };
+              } else {
+                return arg;
+              }
+            }
+          )
+        };
+      }
+    }
+  }
+  return processUnaryExpression(pre, args, post);
+}
 
 // source/parser/pipe.civet
 function constructInvocation(fn, arg) {
@@ -4122,36 +4236,31 @@ function constructInvocation(fn, arg) {
   };
 }
 function constructPipeStep(fn, arg, returning) {
+  if (!returning) {
+    returning = null;
+  }
   let children = [[fn.leadingComment, fn.expr, fn.trailingComment].map(skipIfOnlyWS), " ", arg];
   switch (fn.expr.token) {
-    case "yield":
-    case "await":
-      if (fn.expr.op) {
-        children = processUnaryExpression([fn.expr], arg, void 0);
-      }
-      if (returning) {
-        return [
-          children,
-          returning
-        ];
-      }
+    case "await": {
+      children = processUnaryExpression([fn.expr], arg, void 0);
+    }
+    case "yield": {
       return [
         children,
-        null
+        returning
       ];
-    case "return":
+    }
+    case "return": {
       return [{
         type: "ReturnStatement",
         children
       }, null];
+    }
   }
-  if (returning) {
-    return [
-      constructInvocation(fn, arg),
-      returning
-    ];
-  }
-  return [constructInvocation(fn, arg), null];
+  return [
+    constructInvocation(fn, arg),
+    returning
+  ];
 }
 function processPipelineExpressions(statements) {
   gatherRecursiveAll(statements, (n) => n.type === "PipelineExpression").forEach((s) => {
@@ -4408,7 +4517,29 @@ function processForInOf($0, getRef) {
       message: "'own' is only meaningful in for..in loops"
     };
   }
-  if (!declaration2 && !own) {
+  const { binding } = declaration;
+  let pattern = binding?.pattern;
+  if (binding?.typeSuffix || inOf.token === "in" && declaration2 && pattern.type !== "Identifier") {
+    const itemRef = makeRef(inOf.token === "in" ? "key" : "item");
+    blockPrefix.push(["", {
+      type: "Declaration",
+      children: [declaration, " = ", itemRef],
+      names: declaration.names
+    }, ";"]);
+    pattern = itemRef;
+    declaration = {
+      type: "ForDeclaration",
+      binding: {
+        type: "Binding",
+        pattern,
+        children: [pattern],
+        names: []
+      },
+      children: ["const ", itemRef],
+      names: []
+    };
+  }
+  if (!(declaration2 || own)) {
     return {
       declaration,
       blockPrefix,
@@ -4447,29 +4578,6 @@ function processForInOf($0, getRef) {
           children: [" ", expRef2, " =", exp]
         };
       }
-      const { binding } = declaration;
-      let { pattern } = binding;
-      if (!(pattern.type === "Identifier")) {
-        const keyRef = makeRef("key");
-        blockPrefix.push(["", [
-          declaration,
-          " = ",
-          keyRef
-        ], ";"]);
-        pattern = keyRef;
-        declaration = {
-          type: "ForDeclaration",
-          binding: {
-            type: "Binding",
-            pattern,
-            children: [pattern],
-            names: [],
-            suffix: binding.suffix
-          },
-          children: ["const ", keyRef],
-          names: []
-        };
-      }
       if (own) {
         const hasPropRef = getRef("hasProp");
         blockPrefix.push(["", ["if (!", hasPropRef, "(", insertTrimmingSpace(expRef2, ""), ", ", insertTrimmingSpace(pattern, ""), ")) continue"], ";"]);
@@ -6151,44 +6259,82 @@ function attachPostfixStatementAsExpression(exp, post) {
 }
 function processTypes(node) {
   return gatherRecursiveAll(node, (n) => n.type === "TypeUnary").forEach((unary) => {
-    let last;
-    let count = 0;
-    let ref10;
-    while (unary.suffix.length && (ref10 = unary.suffix)[ref10.length - 1]?.token === "?") {
-      last = unary.suffix.pop();
-      count++;
-    }
-    if (!count) {
+    if (!unary.suffix.length) {
       return;
     }
-    let ref11;
-    if (unary.suffix.length || unary.prefix.length)
-      ref11 = unary;
-    else
-      ref11 = unary.t;
-    const t = ref11;
-    if (unary.parent?.type === "TypeTuple") {
-      if (count === 1) {
-        unary.suffix.push(last);
-        return;
+    let ref10;
+    let m3;
+    if (m3 = (ref10 = unary.suffix)[ref10.length - 1], typeof m3 === "object" && m3 != null && "token" in m3 && m3.token === "?") {
+      const { token } = m3;
+      let last;
+      let count = 0;
+      let ref11;
+      while (unary.suffix.length && (ref11 = unary.suffix)[ref11.length - 1]?.token === "?") {
+        last = unary.suffix.pop();
+        count++;
       }
-      replaceNode(unary, [
-        getTrimmingSpace(unary),
-        "(",
-        parenthesizeType(trimFirstSpace(t)),
-        " | null)",
-        last
-      ]);
-    } else {
-      replaceNode(unary, {
-        type: "TypeParenthesized",
-        ts: true,
-        children: [
+      let ref12;
+      while (unary.suffix.length && (ref12 = unary.suffix)[ref12.length - 1]?.type === "NonNullAssertion") {
+        unary.suffix.pop();
+      }
+      let ref13;
+      if (unary.suffix.length || unary.prefix.length)
+        ref13 = unary;
+      else
+        ref13 = unary.t;
+      const t = ref13;
+      if (unary.parent?.type === "TypeTuple") {
+        if (count === 1) {
+          unary.suffix.push(last);
+          return;
+        }
+        replaceNode(unary, [
           getTrimmingSpace(unary),
           "(",
           parenthesizeType(trimFirstSpace(t)),
-          count === 1 ? " | undefined" : " | undefined | null",
-          ")"
+          " | null)",
+          last
+        ]);
+      } else {
+        replaceNode(unary, {
+          type: "TypeParenthesized",
+          ts: true,
+          children: [
+            getTrimmingSpace(unary),
+            "(",
+            parenthesizeType(trimFirstSpace(t)),
+            count === 1 ? " | undefined" : " | undefined | null",
+            ")"
+          ]
+        });
+      }
+    } else if (typeof m3 === "object" && m3 != null && "type" in m3 && m3.type === "NonNullAssertion") {
+      const { type } = m3;
+      let ref14;
+      while (unary.suffix.length && (ref14 = unary.suffix)[ref14.length - 1]?.type === "NonNullAssertion") {
+        unary.suffix.pop();
+      }
+      let ref15;
+      while (unary.suffix.length && (ref15 = unary.suffix)[ref15.length - 1]?.token === "?") {
+        unary.suffix.pop();
+      }
+      const t = trimFirstSpace(
+        unary.suffix.length || unary.prefix.length ? unary : unary.t
+      );
+      const args = {
+        type: "TypeArguments",
+        ts: true,
+        types: [t],
+        children: ["<", t, ">"]
+      };
+      replaceNode(unary, {
+        type: "TypeIdentifier",
+        raw: "NonNullable",
+        args,
+        children: [
+          getTrimmingSpace(unary),
+          "NonNullable",
+          args
         ]
       });
     }
@@ -6198,11 +6344,11 @@ function processStatementExpressions(statements) {
   gatherRecursiveAll(statements, ($7) => $7.type === "StatementExpression").forEach((_exp) => {
     const exp = _exp;
     const { statement } = exp;
-    let ref12;
+    let ref16;
     switch (statement.type) {
       case "IfStatement": {
-        if (ref12 = expressionizeIfStatement(statement)) {
-          const expression = ref12;
+        if (ref16 = expressionizeIfStatement(statement)) {
+          const expression = ref16;
           return replaceNode(statement, expression, exp);
         } else {
           return replaceNode(statement, wrapIIFE([["", statement]]), exp);
@@ -6348,10 +6494,10 @@ function processPlaceholders(statements) {
         if (type === "IfStatement") {
           liftedIfs.add(ancestor2);
         }
-        let m3;
         let m4;
+        let m5;
         return type === "Call" || // Block, except for if/else blocks when condition already lifted
-        type === "BlockStatement" && !((m3 = ancestor2.parent, typeof m3 === "object" && m3 != null && "type" in m3 && m3.type === "IfStatement") && liftedIfs.has(ancestor2.parent)) && !((m4 = ancestor2.parent, typeof m4 === "object" && m4 != null && "type" in m4 && m4.type === "ElseClause" && "parent" in m4 && typeof m4.parent === "object" && m4.parent != null && "type" in m4.parent && m4.parent.type === "IfStatement") && liftedIfs.has(ancestor2.parent.parent)) || type === "PipelineExpression" || // Declaration
+        type === "BlockStatement" && !((m4 = ancestor2.parent, typeof m4 === "object" && m4 != null && "type" in m4 && m4.type === "IfStatement") && liftedIfs.has(ancestor2.parent)) && !((m5 = ancestor2.parent, typeof m5 === "object" && m5 != null && "type" in m5 && m5.type === "ElseClause" && "parent" in m5 && typeof m5.parent === "object" && m5.parent != null && "type" in m5.parent && m5.parent.type === "IfStatement") && liftedIfs.has(ancestor2.parent.parent)) || type === "PipelineExpression" || // Declaration
         type === "Initializer" || // Right-hand side of assignment
         type === "AssignmentExpression" && findChildIndex(ancestor2, child2) === ancestor2.children.indexOf(ancestor2.expression) || type === "ReturnStatement" || type === "YieldExpression";
       }));
@@ -6430,8 +6576,8 @@ function processPlaceholders(statements) {
     for (let i4 = 0, len3 = placeholders.length; i4 < len3; i4++) {
       const placeholder = placeholders[i4];
       typeSuffix ??= placeholder.typeSuffix;
-      let ref13;
-      replaceNode((ref13 = placeholder.children)[ref13.length - 1], ref);
+      let ref17;
+      replaceNode((ref17 = placeholder.children)[ref17.length - 1], ref);
     }
     const { parent } = ancestor;
     const body = maybeUnwrap(ancestor);
@@ -6448,16 +6594,16 @@ function processPlaceholders(statements) {
       }
       case "PipelineExpression": {
         const i = findChildIndex(parent, ancestor);
-        let ref14;
+        let ref18;
         if (i === 1) {
-          ref14 = ancestor === parent.children[i];
+          ref18 = ancestor === parent.children[i];
         } else if (i === 2) {
-          ref14 = ancestor === parent.children[i][findChildIndex(parent.children[i], ancestor)][3];
+          ref18 = ancestor === parent.children[i][findChildIndex(parent.children[i], ancestor)][3];
         } else {
-          ref14 = void 0;
+          ref18 = void 0;
         }
         ;
-        outer = ref14;
+        outer = ref18;
         break;
       }
       case "AssignmentExpression":
@@ -6472,9 +6618,9 @@ function processPlaceholders(statements) {
       fnExp = makeLeftHandSideExpression(fnExp);
     }
     replaceNode(ancestor, fnExp, parent);
-    let ref15;
-    if (ref15 = getTrimmingSpace(body)) {
-      const ws = ref15;
+    let ref19;
+    if (ref19 = getTrimmingSpace(body)) {
+      const ws = ref19;
       inplaceInsertTrimmingSpace(body, "");
       inplacePrepend(ws, fnExp);
     }
@@ -6519,8 +6665,8 @@ function reorderBindingRestProperty(props) {
       }
     ];
   }
-  let ref16;
-  if (Array.isArray(rest.delim) && (ref16 = rest.delim)[ref16.length - 1]?.token === ",") {
+  let ref20;
+  if (Array.isArray(rest.delim) && (ref20 = rest.delim)[ref20.length - 1]?.token === ",") {
     rest.delim = rest.delim.slice(0, -1);
     rest.children = [...rest.children.slice(0, -1), rest.delim];
   }
@@ -6685,6 +6831,7 @@ var grammar = {
   NestedArgumentList,
   NestedArgument,
   SingleLineArgumentExpressions,
+  WArgumentPart,
   ArgumentPart,
   NonPipelineArgumentPart,
   BinaryOpExpression,
@@ -6696,6 +6843,8 @@ var grammar = {
   UnaryExpression,
   UnaryWithoutParenthesizedAssignment,
   UnaryBody,
+  MaybeNestedCoffeeDoBody,
+  CoffeeDoBody,
   UnaryWithoutParenthesizedAssignmentBody,
   ParenthesizedAssignment,
   UnaryPostfix,
@@ -7028,6 +7177,7 @@ var grammar = {
   MaybeNestedNonPipelineExtendedExpression,
   MaybeNestedPostfixedExpression,
   MaybeNestedExtendedExpression,
+  NestedExtendedExpression,
   MaybeParenNestedExtendedExpression,
   ImportDeclaration,
   ImpliedImport,
@@ -7969,9 +8119,7 @@ var ImplicitArguments$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(ApplicationSt
   var close = $5;
   if (skipImplicitArguments(args))
     return $skip;
-  let last = args[args.length - 1];
-  if (last?.token === "," && last.implicit)
-    args = args.slice(0, -1);
+  args = stripTrailingImplicitComma(args);
   return {
     type: "Call",
     args,
@@ -8149,24 +8297,43 @@ var NestedArgument$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(Nested, SingleLi
   var args = $2;
   var comma = $3;
   let [arg0, ...rest] = args;
-  arg0 = [indent, ...arg0];
+  arg0 = prepend(indent, arg0);
   return [arg0, ...rest, comma];
 });
 function NestedArgument(ctx, state2) {
   return (0, import_lib3.$EVENT)(ctx, state2, "NestedArgument", NestedArgument$0);
 }
-var SingleLineArgumentExpressions$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$S)((0, import_lib3.$E)(_), ArgumentPart), (0, import_lib3.$Q)((0, import_lib3.$S)((0, import_lib3.$S)((0, import_lib3.$E)(_), Comma), (0, import_lib3.$S)((0, import_lib3.$E)(_), ArgumentPart)))), function($skip, $loc, $0, $1, $2) {
+var SingleLineArgumentExpressions$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(WArgumentPart, (0, import_lib3.$Q)((0, import_lib3.$S)((0, import_lib3.$S)((0, import_lib3.$E)(_), Comma), WArgumentPart))), function($skip, $loc, $0, $1, $2) {
   return [$1, ...$2.flat()];
 });
 function SingleLineArgumentExpressions(ctx, state2) {
   return (0, import_lib3.$EVENT)(ctx, state2, "SingleLineArgumentExpressions", SingleLineArgumentExpressions$0);
 }
-var ArgumentPart$0 = (0, import_lib3.$S)(DotDotDot, ExtendedExpression);
+var WArgumentPart$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$E)(_), ArgumentPart), function($skip, $loc, $0, $1, $2) {
+  return prepend($1, $2);
+});
+function WArgumentPart(ctx, state2) {
+  return (0, import_lib3.$EVENT)(ctx, state2, "WArgumentPart", WArgumentPart$0);
+}
+var ArgumentPart$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(DotDotDot, ExtendedExpression), function($skip, $loc, $0, $1, $2) {
+  var spread = $1;
+  var expression = $2;
+  return {
+    type: "Argument",
+    children: $0,
+    expression,
+    spread
+  };
+});
 var ArgumentPart$1 = (0, import_lib3.$TS)((0, import_lib3.$S)(ExtendedExpression, (0, import_lib3.$E)(DotDotDot)), function($skip, $loc, $0, $1, $2) {
-  if ($2) {
-    return [$2, $1];
-  }
-  return $1;
+  var expression = $1;
+  var spread = $2;
+  return {
+    type: "Argument",
+    children: spread ? [spread, expression] : [expression],
+    expression,
+    spread
+  };
 });
 var ArgumentPart$$ = [ArgumentPart$0, ArgumentPart$1];
 function ArgumentPart(ctx, state2) {
@@ -8254,17 +8421,18 @@ var RHS$$ = [RHS$0, RHS$1];
 function RHS(ctx, state2) {
   return (0, import_lib3.$EVENT_C)(ctx, state2, "RHS", RHS$$);
 }
-var UnaryExpression$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$Q)(UnaryOp), UnaryBody, (0, import_lib3.$E)(UnaryPostfix)), function($skip, $loc, $0, $1, $2, $3) {
+var UnaryExpression$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(IndentedApplicationAllowed, (0, import_lib3.$P)(UnaryOp), (0, import_lib3.$C)(ArrayLiteral, NestedArgumentList), (0, import_lib3.$E)(UnaryPostfix)), function($skip, $loc, $0, $1, $2, $3, $4) {
+  var pre = $2;
+  var args = $3;
+  var post = $4;
+  return processUnaryNestedExpression(pre, args, post) ?? $skip;
+});
+var UnaryExpression$1 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$Q)(UnaryOp), UnaryBody, (0, import_lib3.$E)(UnaryPostfix)), function($skip, $loc, $0, $1, $2, $3) {
   var pre = $1;
   var exp = $2;
   var post = $3;
   return processUnaryExpression(pre, exp, post);
 });
-var UnaryExpression$1 = (0, import_lib3.$TS)((0, import_lib3.$S)(CoffeeDoEnabled, Do, __, (0, import_lib3.$C)(ArrowFunction, (0, import_lib3.$S)(LeftHandSideExpression, (0, import_lib3.$N)((0, import_lib3.$S)(__, AssignmentOpSymbol))), ExtendedExpression)), function($skip, $loc, $0, $1, $2, $3, $4) {
-  var ws = $3;
-  var exp = $4;
-  return processCoffeeDo(ws, exp);
-});
 var UnaryExpression$$ = [UnaryExpression$0, UnaryExpression$1];
 function UnaryExpression(ctx, state2) {
   return (0, import_lib3.$EVENT_C)(ctx, state2, "UnaryExpression", UnaryExpression$$);
@@ -8278,14 +8446,35 @@ var UnaryWithoutParenthesizedAssignment$0 = (0, import_lib3.$TS)((0, import_lib3
 function UnaryWithoutParenthesizedAssignment(ctx, state2) {
   return (0, import_lib3.$EVENT)(ctx, state2, "UnaryWithoutParenthesizedAssignment", UnaryWithoutParenthesizedAssignment$0);
 }
-var UnaryBody$0 = ParenthesizedAssignment;
-var UnaryBody$1 = ExpressionizedStatementWithTrailingCallExpressions;
-var UnaryBody$2 = UpdateExpression;
-var UnaryBody$3 = NestedNonAssignmentExtendedExpression;
-var UnaryBody$$ = [UnaryBody$0, UnaryBody$1, UnaryBody$2, UnaryBody$3];
+var UnaryBody$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(CoffeeDoEnabled, Do, MaybeNestedCoffeeDoBody), function($skip, $loc, $0, $1, $2, $3) {
+  var body = $3;
+  return processCoffeeDo(...body);
+});
+var UnaryBody$1 = ParenthesizedAssignment;
+var UnaryBody$2 = ExpressionizedStatementWithTrailingCallExpressions;
+var UnaryBody$3 = UpdateExpression;
+var UnaryBody$4 = NestedNonAssignmentExtendedExpression;
+var UnaryBody$$ = [UnaryBody$0, UnaryBody$1, UnaryBody$2, UnaryBody$3, UnaryBody$4];
 function UnaryBody(ctx, state2) {
   return (0, import_lib3.$EVENT_C)(ctx, state2, "UnaryBody", UnaryBody$$);
 }
+var MaybeNestedCoffeeDoBody$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(PushIndent, (0, import_lib3.$E)((0, import_lib3.$S)(Nested, CoffeeDoBody)), PopIndent), function($skip, $loc, $0, $1, $2, $3) {
+  if (!$2)
+    return $skip;
+  return $2;
+});
+var MaybeNestedCoffeeDoBody$1 = (0, import_lib3.$S)((0, import_lib3.$E)(_), CoffeeDoBody);
+var MaybeNestedCoffeeDoBody$$ = [MaybeNestedCoffeeDoBody$0, MaybeNestedCoffeeDoBody$1];
+function MaybeNestedCoffeeDoBody(ctx, state2) {
+  return (0, import_lib3.$EVENT_C)(ctx, state2, "MaybeNestedCoffeeDoBody", MaybeNestedCoffeeDoBody$$);
+}
+var CoffeeDoBody$0 = ArrowFunction;
+var CoffeeDoBody$1 = (0, import_lib3.$S)(LeftHandSideExpression, (0, import_lib3.$N)((0, import_lib3.$S)(__, AssignmentOpSymbol)));
+var CoffeeDoBody$2 = ExtendedExpression;
+var CoffeeDoBody$$ = [CoffeeDoBody$0, CoffeeDoBody$1, CoffeeDoBody$2];
+function CoffeeDoBody(ctx, state2) {
+  return (0, import_lib3.$EVENT_C)(ctx, state2, "CoffeeDoBody", CoffeeDoBody$$);
+}
 var UnaryWithoutParenthesizedAssignmentBody$0 = UpdateExpression;
 var UnaryWithoutParenthesizedAssignmentBody$1 = ExpressionizedStatementWithTrailingCallExpressions;
 var UnaryWithoutParenthesizedAssignmentBody$2 = NestedNonAssignmentExtendedExpression;
@@ -8484,7 +8673,7 @@ var ArrowFunction$0 = ThinArrowFunction;
 var ArrowFunction$1 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$E)((0, import_lib3.$S)(Async, _)), ArrowParameters, (0, import_lib3.$E)(ReturnTypeSuffix), FatArrow, FatArrowBody), function($skip, $loc, $0, $1, $2, $3, $4, $5) {
   var async = $1;
   var parameters = $2;
-  var suffix = $3;
+  var returnType = $3;
   var arrow = $4;
   var expOrBlock = $5;
   if (!async)
@@ -8495,13 +8684,13 @@ var ArrowFunction$1 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$
       modifier: {
         async: !!async.length
       },
-      returnType: suffix
+      returnType
     },
     parameters,
-    returnType: suffix,
+    returnType,
     async,
     block: expOrBlock,
-    children: [async, parameters, suffix, arrow, expOrBlock]
+    children: [async, parameters, returnType, arrow, expOrBlock]
   };
 });
 var ArrowFunction$$ = [ArrowFunction$0, ArrowFunction$1];
@@ -10233,7 +10422,7 @@ var FunctionSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
   var wid = $4;
   var w = $5;
   var parameters = $6;
-  var suffix = $7;
+  var returnType = $7;
   if (!async)
     async = [];
   if (!generator)
@@ -10244,7 +10433,7 @@ var FunctionSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
     id,
     name: id?.name,
     parameters,
-    returnType: suffix,
+    returnType,
     async,
     generator,
     modifier: {
@@ -10252,7 +10441,7 @@ var FunctionSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
       generator: !!generator.length
     },
     block: null,
-    children: !parameters.implicit ? [async, func, generator, wid, w, parameters, suffix] : [async, func, generator, wid, parameters, w, suffix]
+    children: !parameters.implicit ? [async, func, generator, wid, w, parameters, returnType] : [async, func, generator, wid, parameters, w, returnType]
     // move whitespace w to after implicit () in parameters
   };
 });
@@ -10451,7 +10640,7 @@ var OperatorSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
   var behavior = $7;
   var w2 = $8;
   var parameters = $9;
-  var suffix = $10;
+  var returnType = $10;
   if (!async)
     async = [];
   if (!generator)
@@ -10466,7 +10655,7 @@ var OperatorSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
     id,
     name: id.name,
     parameters,
-    returnType: suffix,
+    returnType,
     async,
     generator,
     modifier: {
@@ -10474,7 +10663,7 @@ var OperatorSignature$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
       generator: !!generator.length
     },
     block: null,
-    children: [async, func, generator, w1, id, w2, parameters, suffix],
+    children: [async, func, generator, w1, id, w2, parameters, returnType],
     behavior
   };
 });
@@ -10521,7 +10710,7 @@ function OperatorAssociativity(ctx, state2) {
 var ThinArrowFunction$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$E)((0, import_lib3.$S)(Async, _)), ArrowParameters, (0, import_lib3.$E)(ReturnTypeSuffix), (0, import_lib3.$E)(_), Arrow, NoCommaBracedOrEmptyBlock), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6) {
   var async = $1;
   var parameters = $2;
-  var suffix = $3;
+  var returnType = $3;
   var arrow = $5;
   var block = $6;
   if (!async)
@@ -10531,7 +10720,7 @@ var ThinArrowFunction$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
     type: "FunctionExpression",
     id: void 0,
     parameters,
-    returnType: suffix,
+    returnType,
     async,
     generator,
     block,
@@ -10543,14 +10732,14 @@ var ThinArrowFunction$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_li
         async: !!async.length,
         generator: !!generator.length
       },
-      returnType: suffix
+      returnType
     },
     children: [
       async,
       { $loc: arrow.$loc, token: "function" },
       generator,
       parameters,
-      suffix,
+      returnType,
       block
     ]
   };
@@ -11247,6 +11436,7 @@ var ArrayElementExpression$2 = (0, import_lib3.$TS)((0, import_lib3.$S)(Extended
   return {
     type: "SpreadElement",
     children: [ws, dots, exp],
+    expression: exp,
     names: exp.names
   };
 });
@@ -11258,12 +11448,14 @@ var ArrayElementExpression$3 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, impo
       return {
         type: "ArrayElement",
         children: [exp],
+        expression: exp,
         names: exp.names
       };
     } else {
       return {
         type: "SpreadElement",
         children: [...spread, exp],
+        expression: exp,
         names: exp.names
       };
     }
@@ -11307,9 +11499,9 @@ var BulletedArray$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(InsertOpenBracket
     // replace first space with bracket
     ...content[1].flat()
   ];
-  const last = content[content.length - 1];
+  let last = content[content.length - 1];
   if (last.children?.at(-1)?.implicit) {
-    last.children = last.children.slice(0, -1);
+    content[content.length - 1] = last = { ...last, children: last.children.slice(0, -1) };
   }
   return {
     type: "ArrayExpression",
@@ -13199,14 +13391,14 @@ function ForDeclaration(ctx, state2) {
 }
 var ForBinding$0 = (0, import_lib3.$TS)((0, import_lib3.$S)((0, import_lib3.$C)(BindingPattern, BindingIdentifier), (0, import_lib3.$E)(TypeSuffix)), function($skip, $loc, $0, $1, $2) {
   var pattern = $1;
-  var suffix = $2;
-  suffix ??= pattern.typeSuffix;
+  var typeSuffix = $2;
+  typeSuffix ??= pattern.typeSuffix;
   return {
     type: "Binding",
-    children: [pattern, suffix],
+    children: [pattern, typeSuffix],
     names: pattern.names,
     pattern,
-    suffix,
+    typeSuffix,
     splices: [],
     thisAssignments: []
   };
@@ -13843,6 +14035,16 @@ var MaybeNestedExtendedExpression$$ = [MaybeNestedExtendedExpression$0, MaybeNes
 function MaybeNestedExtendedExpression(ctx, state2) {
   return (0, import_lib3.$EVENT_C)(ctx, state2, "MaybeNestedExtendedExpression", MaybeNestedExtendedExpression$$);
 }
+var NestedExtendedExpression$0 = NestedBulletedArray;
+var NestedExtendedExpression$1 = (0, import_lib3.$TS)((0, import_lib3.$S)(PushIndent, (0, import_lib3.$E)((0, import_lib3.$S)(Nested, ExtendedExpression)), PopIndent), function($skip, $loc, $0, $1, $2, $3) {
+  if ($3)
+    return $3;
+  return $skip;
+});
+var NestedExtendedExpression$$ = [NestedExtendedExpression$0, NestedExtendedExpression$1];
+function NestedExtendedExpression(ctx, state2) {
+  return (0, import_lib3.$EVENT_C)(ctx, state2, "NestedExtendedExpression", NestedExtendedExpression$$);
+}
 var MaybeParenNestedExtendedExpression$0 = (0, import_lib3.$T)((0, import_lib3.$S)((0, import_lib3.$N)(EOS), ExtendedExpression), function(value) {
   return value[1];
 });
@@ -14337,16 +14539,16 @@ function TypeAssignment(ctx, state2) {
 }
 var LexicalBinding$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(BindingPattern, (0, import_lib3.$E)(TypeSuffix), Initializer), function($skip, $loc, $0, $1, $2, $3) {
   var pattern = $1;
-  var suffix = $2;
+  var typeSuffix = $2;
   var initializer = $3;
   const [splices, thisAssignments] = gatherBindingCode(pattern);
-  suffix ??= pattern.typeSuffix;
+  typeSuffix ??= pattern.typeSuffix;
   return {
     type: "Binding",
-    children: [pattern, suffix, initializer],
+    children: [pattern, typeSuffix, initializer],
     names: pattern.names,
     pattern,
-    suffix,
+    typeSuffix,
     initializer,
     splices: splices.map((s) => [",", s]),
     thisAssignments: thisAssignments.map((s) => ["", s, ";"])
@@ -14354,14 +14556,14 @@ var LexicalBinding$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(BindingPattern,
 });
 var LexicalBinding$1 = (0, import_lib3.$TS)((0, import_lib3.$S)(BindingIdentifier, (0, import_lib3.$E)(TypeSuffix), (0, import_lib3.$E)(Initializer)), function($skip, $loc, $0, $1, $2, $3) {
   var pattern = $1;
-  var suffix = $2;
+  var typeSuffix = $2;
   var initializer = $3;
   return {
     type: "Binding",
     children: $0,
     names: pattern.names,
     pattern,
-    suffix,
+    typeSuffix,
     initializer,
     splices: [],
     thisAssignments: []
@@ -16306,14 +16508,14 @@ function UsingDeclaration(ctx, state2) {
 }
 var UsingBinding$0 = (0, import_lib3.$TS)((0, import_lib3.$S)(BindingIdentifier, (0, import_lib3.$E)(TypeSuffix), Initializer), function($skip, $loc, $0, $1, $2, $3) {
   var pattern = $1;
-  var suffix = $2;
+  var typeSuffix = $2;
   var initializer = $3;
   return {
     type: "Binding",
     children: $0,
     names: pattern.names,
     pattern,
-    suffix,
+    typeSuffix,
     initializer,
     splices: [],
     thisAssignments: []
@@ -16875,7 +17077,8 @@ function TypeUnary(ctx, state2) {
 }
 var TypeUnarySuffix$0 = TypeIndexedAccess;
 var TypeUnarySuffix$1 = QuestionMark;
-var TypeUnarySuffix$$ = [TypeUnarySuffix$0, TypeUnarySuffix$1];
+var TypeUnarySuffix$2 = NonNullAssertion;
+var TypeUnarySuffix$$ = [TypeUnarySuffix$0, TypeUnarySuffix$1, TypeUnarySuffix$2];
 function TypeUnarySuffix(ctx, state2) {
   return (0, import_lib3.$EVENT_C)(ctx, state2, "TypeUnarySuffix", TypeUnarySuffix$$);
 }