@danielx/civet 0.7.2 → 0.7.4

package/dist/browser.js

@@ -1320,8 +1320,8 @@ ${input.slice(result.pos)}
   function replaceBlockExpression(node, child, replacement) {
     let found = false;
     const { expressions } = node;
-    for (let i = 0, l = expressions.length; i < l; i++) {
-      const statement = expressions[i];
+    for (let i1 = 0, len2 = expressions.length; i1 < len2; i1++) {
+      const statement = expressions[i1];
       const [, s] = statement;
       if (s === child) {
         statement[1] = replacement;
@@ -1382,9 +1382,9 @@ ${input.slice(result.pos)}
   }
   function insertSemicolon(statements) {
     const l = statements.length;
-    for (let i1 = 0, len2 = statements.length; i1 < len2; i1++) {
-      const i = i1;
-      const s = statements[i1];
+    for (let i2 = 0, len1 = statements.length; i2 < len1; i2++) {
+      const i = i2;
+      const s = statements[i2];
       if (i < l - 1) {
         if (needsPrecedingSemicolon(statements[i + 1][1])) {
           const delim = s[2];
@@ -1402,8 +1402,8 @@ ${input.slice(result.pos)}
       return false;
     }
     if (Array.isArray(exp)) {
-      for (let i2 = 0, len1 = exp.length; i2 < len1; i2++) {
-        const child = exp[i2];
+      for (let i3 = 0, len2 = exp.length; i3 < len2; i3++) {
+        const child = exp[i3];
         if (!(child != null)) {
           continue;
         }
@@ -1464,9 +1464,12 @@ ${input.slice(result.pos)}
       return;
     }
     node = node;
-    node.parent = parent;
+    if (parent != null) {
+      node.parent = parent;
+    }
     if (node.children) {
-      for (const child of node.children) {
+      for (let ref1 = node.children, i1 = 0, len2 = ref1.length; i1 < len2; i1++) {
+        const child = ref1[i1];
         addParentPointers(child, node);
       }
     }
@@ -1476,10 +1479,9 @@ ${input.slice(result.pos)}
     return deepCopy(node);
   }
   function removeParentPointers(node) {
-    if (node == null)
-      return;
-    if (typeof node !== "object")
+    if (!(node != null && typeof node === "object")) {
       return;
+    }
     if (Array.isArray(node)) {
       for (const child of node) {
         removeParentPointers(child);
@@ -1523,7 +1525,8 @@ ${input.slice(result.pos)}
     if (node?.type !== "BlockStatement")
       return false;
     const { bare, expressions } = node;
-    return bare && (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
+    return bare && //expressions is like [], [, {type: "EmptyStatement"}]
+    (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
   }
   function isFunction(node) {
     const { type } = node;
@@ -1571,8 +1574,8 @@ ${input.slice(result.pos)}
     if (!(node != null)) {
       return false;
     }
-    let ref1;
     let ref2;
+    let ref3;
     switch (node.type) {
       case "ReturnStatement":
       case "ThrowStatement":
@@ -1581,10 +1584,10 @@ ${input.slice(result.pos)}
         return true;
       }
       case "IfStatement": {
-        return isExit(node.then) && isExit((ref1 = node.else)?.[ref1.length - 1]);
+        return isExit(node.then) && isExit((ref2 = node.else)?.[ref2.length - 1]);
       }
       case "BlockStatement": {
-        return isExit((ref2 = node.expressions)[ref2.length - 1]?.[1]);
+        return isExit((ref3 = node.expressions)[ref3.length - 1]?.[1]);
       }
       case "IterationStatement": {
         return node.condition?.type === "ParenthesizedExpression" && node.condition.expression?.type === "Literal" && node.condition.expression?.raw === "true" && gatherRecursiveWithinFunction(
@@ -1880,8 +1883,8 @@ ${input.slice(result.pos)}
       return;
     }
     if (Array.isArray(node)) {
-      for (let i1 = 0, len2 = node.length; i1 < len2; i1++) {
-        const child = node[i1];
+      for (let i2 = 0, len1 = node.length; i2 < len1; i2++) {
+        const child = node[i2];
         updateParentPointers(child, parent, depth);
       }
       return;
@@ -1891,8 +1894,8 @@ ${input.slice(result.pos)}
       node.parent = parent;
     }
     if (depth && isParent(node)) {
-      for (let ref3 = node.children, i2 = 0, len1 = ref3.length; i2 < len1; i2++) {
-        const child = ref3[i2];
+      for (let ref4 = node.children, i3 = 0, len2 = ref4.length; i3 < len2; i3++) {
+        const child = ref4[i3];
         updateParentPointers(child, node, depth - 1);
       }
     }
@@ -2022,9 +2025,9 @@ ${input.slice(result.pos)}
   }
   function flatJoin(array, separator) {
     const result = [];
-    for (let i3 = 0, len2 = array.length; i3 < len2; i3++) {
-      const i = i3;
-      const items = array[i3];
+    for (let i4 = 0, len3 = array.length; i4 < len3; i4++) {
+      const i = i4;
+      const items = array[i4];
       if (i) {
         result.push(separator);
       }
@@ -2075,8 +2078,9 @@ ${input.slice(result.pos)}
     return { ancestor: void 0, child: node };
   }
   function gatherNodes(node, predicate) {
-    if (node == null)
+    if (node == null || typeof node === "string") {
       return [];
+    }
     if (Array.isArray(node)) {
       return node.flatMap((n) => gatherNodes(n, predicate));
     }
@@ -2084,24 +2088,30 @@ ${input.slice(result.pos)}
       return [node];
     }
     switch (node.type) {
-      case "BlockStatement":
+      case "BlockStatement": {
         return [];
-      case "ForStatement":
+      }
+      case "ForStatement": {
         const isDec = node.declaration?.type === "Declaration";
         return node.children.flatMap((n) => {
-          if (isDec && n === node.declaration)
+          if (isDec && n === node.declaration) {
             return [];
-          return gatherNodes(n, predicate);
+          } else {
+            return gatherNodes(n, predicate);
+          }
         });
-      default:
+      }
+      default: {
         return gatherNodes(node.children, predicate);
+      }
     }
   }
   function gatherRecursive(node, predicate, skipPredicate) {
-    if (node == null)
+    if (node == null || typeof node === "string") {
       return [];
+    }
     if (Array.isArray(node)) {
-      return node.flatMap((n) => gatherRecursive(n, predicate, skipPredicate));
+      return node.flatMap(($) => gatherRecursive($, predicate, skipPredicate));
     }
     if (skipPredicate?.(node))
       return [];
@@ -2111,8 +2121,9 @@ ${input.slice(result.pos)}
     return gatherRecursive(node.children, predicate, skipPredicate);
   }
   function gatherRecursiveAll(node, predicate) {
-    if (node == null)
+    if (node == null || typeof node === "string") {
       return [];
+    }
     if (Array.isArray(node)) {
       return node.flatMap((n) => gatherRecursiveAll(n, predicate));
     }
@@ -2842,21 +2853,9 @@ ${input.slice(result.pos)}
           const { children, name, value } = p;
           const [ws] = children;
           switch (value && value.type) {
-            case "ArrayBindingPattern": {
-              let bindings = nonMatcherBindings(value);
-              if (!bindings.length) {
-                bindings = void 0;
-              }
-              return {
-                ...p,
-                children: [ws, name, bindings && ": ", bindings, p.delim]
-              };
-            }
+            case "ArrayBindingPattern":
             case "ObjectBindingPattern": {
-              let bindings = nonMatcherBindings(value);
-              if (!bindings.properties.length) {
-                bindings = void 0;
-              }
+              const bindings = nonMatcherBindings(value);
               return {
                 ...p,
                 children: [ws, name, bindings && ": ", bindings, p.delim]
@@ -3173,9 +3172,12 @@ ${input.slice(result.pos)}
     rootCondition.blockPrefix = getPatternBlockPrefix(pattern, ref, decl, suffix);
   }
   function processDeclarationConditions(node) {
-    gatherRecursiveAll(node, (n) => {
-      return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
-    }).forEach((s) => {
+    gatherRecursiveAll(
+      node,
+      (n) => {
+        return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
+      }
+    ).forEach((s) => {
       return processDeclarationConditionStatement(s);
     });
   }
@@ -4080,19 +4082,17 @@ ${input.slice(result.pos)}
   }
   var generate_default = gen;
   function prune(node) {
-    if (node === null || node === void 0) {
+    if (!(node != null)) {
       return;
     }
-    if (node.length === 0) {
+    if (typeof node === "string" && node.length === 0) {
       return;
     }
     if (node.parent != null) {
       delete node.parent;
     }
     if (Array.isArray(node)) {
-      const a = node.map(function(n) {
-        return prune(n);
-      }).filter(($) => !!$);
+      const a = node.map(prune).filter(($) => $);
       if (a.length > 1) {
         return a;
       }
@@ -5810,6 +5810,7 @@ ${input.slice(result.pos)}
     NonPipelineArgumentPart,
     BinaryOpExpression,
     BinaryOpRHS,
+    IsLike,
     WRHS,
     SingleLineBinaryOpRHS,
     RHS,
@@ -7225,22 +7226,12 @@ ${input.slice(result.pos)}
   function BinaryOpExpression(ctx, state2) {
     return (0, import_lib2.$EVENT)(ctx, state2, "BinaryOpExpression", BinaryOpExpression$0);
   }
-  var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), (0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
+  var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), IsLike, (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
     var ws1 = $1;
     var op = $2;
     var ws2 = $3;
     var patterns = $4;
-    return [
-      ws1,
-      {
-        type: "PatternTest",
-        children: op,
-        special: true,
-        negated: !!op[2]
-      },
-      ws2,
-      patterns
-    ];
+    return [ws1, op, ws2, patterns];
   });
   var BinaryOpRHS$1 = (0, import_lib2.$TS)((0, import_lib2.$S)(BinaryOp, RHS), function($skip, $loc, $0, $1, $2) {
     var op = $1;
@@ -7259,6 +7250,18 @@ ${input.slice(result.pos)}
   function BinaryOpRHS(ctx, state2) {
     return (0, import_lib2.$EVENT_C)(ctx, state2, "BinaryOpRHS", BinaryOpRHS$$);
   }
+  var IsLike$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), function($skip, $loc, $0, $1, $2, $3, $4) {
+    var not = $3;
+    return {
+      type: "PatternTest",
+      children: $0,
+      special: true,
+      negated: !!not
+    };
+  });
+  function IsLike(ctx, state2) {
+    return (0, import_lib2.$EVENT)(ctx, state2, "IsLike", IsLike$0);
+  }
   var WRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(PushIndent, (0, import_lib2.$E)((0, import_lib2.$S)(Nested, RHS)), PopIndent), function($skip, $loc, $0, $1, $2, $3) {
     var wrhs = $2;
     if (!wrhs)
@@ -7280,8 +7283,8 @@ ${input.slice(result.pos)}
   function SingleLineBinaryOpRHS(ctx, state2) {
     return (0, import_lib2.$EVENT)(ctx, state2, "SingleLineBinaryOpRHS", SingleLineBinaryOpRHS$0);
   }
-  var RHS$0 = UnaryExpression;
-  var RHS$1 = ExpressionizedStatementWithTrailingCallExpressions;
+  var RHS$0 = ExpressionizedStatementWithTrailingCallExpressions;
+  var RHS$1 = UnaryExpression;
   var RHS$$ = [RHS$0, RHS$1];
   function RHS(ctx, state2) {
     return (0, import_lib2.$EVENT_C)(ctx, state2, "RHS", RHS$$);
@@ -9275,7 +9278,28 @@ ${input.slice(result.pos)}
       expression: fn
     };
   });
-  var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
+  var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, IsLike, __, PatternExpressionList, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6) {
+    var open = $1;
+    var ws1 = $2;
+    var op = $3;
+    var ws2 = $4;
+    var rhs = $5;
+    var close = $6;
+    const refA = makeRef("a");
+    const fn = makeAmpersandFunction({
+      ref: refA,
+      body: processBinaryOpExpression([refA, [
+        [ws1, op, ws2, rhs]
+        // BinaryOpRHS
+      ]])
+    });
+    return {
+      type: "ParenthesizedExpression",
+      children: [open, fn, close],
+      expression: fn
+    };
+  });
+  var FunctionExpression$5 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
     var open = $1;
     var ws1 = $2;
     var op = $4;
@@ -9296,7 +9320,7 @@ ${input.slice(result.pos)}
       expression: fn
     };
   });
-  var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4];
+  var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4, FunctionExpression$5];
   function FunctionExpression(ctx, state2) {
     return (0, import_lib2.$EVENT_C)(ctx, state2, "FunctionExpression", FunctionExpression$$);
   }
@@ -13516,7 +13540,7 @@ ${input.slice(result.pos)}
   function Comma(ctx, state2) {
     return (0, import_lib2.$EVENT)(ctx, state2, "Comma", Comma$0);
   }
-  var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue), function($skip, $loc, $0, $1, $2) {
+  var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($L15, 'Comptime ":"'))), function($skip, $loc, $0, $1, $2, $3) {
     return { $loc, token: $1 };
   });
   function Comptime(ctx, state2) {
@@ -16658,10 +16682,18 @@ ${counts}`;
     if (options.ast) {
       return ast;
     }
+    function checkErrors() {
+      if (options.errors?.length) {
+        throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
+      }
+      ;
+      return;
+    }
     if (options.sourceMap || options.inlineMap) {
       const sm = SourceMap2(src);
       options.updateSourceMap = sm.updateSourceMap;
       const code = generate_default(ast, options);
+      checkErrors();
       if (options.inlineMap) {
         return SourceMap2.remap(code, sm, filename, filename + ".tsx");
       } else {
@@ -16672,9 +16704,7 @@ ${counts}`;
       }
     }
     const result = generate_default(ast, options);
-    if (options.errors?.length) {
-      throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
-    }
+    checkErrors();
     return result;
   };
   var makeCache = function({ hits, trace } = {}) {

package/dist/main.js

@@ -1313,8 +1313,8 @@ function makeBlockFragment() {
 function replaceBlockExpression(node, child, replacement) {
   let found = false;
   const { expressions } = node;
-  for (let i = 0, l = expressions.length; i < l; i++) {
-    const statement = expressions[i];
+  for (let i1 = 0, len2 = expressions.length; i1 < len2; i1++) {
+    const statement = expressions[i1];
     const [, s] = statement;
     if (s === child) {
       statement[1] = replacement;
@@ -1375,9 +1375,9 @@ function processBlocks(statements) {
 }
 function insertSemicolon(statements) {
   const l = statements.length;
-  for (let i1 = 0, len2 = statements.length; i1 < len2; i1++) {
-    const i = i1;
-    const s = statements[i1];
+  for (let i2 = 0, len1 = statements.length; i2 < len1; i2++) {
+    const i = i2;
+    const s = statements[i2];
     if (i < l - 1) {
       if (needsPrecedingSemicolon(statements[i + 1][1])) {
         const delim = s[2];
@@ -1395,8 +1395,8 @@ function needsPrecedingSemicolon(exp) {
     return false;
   }
   if (Array.isArray(exp)) {
-    for (let i2 = 0, len1 = exp.length; i2 < len1; i2++) {
-      const child = exp[i2];
+    for (let i3 = 0, len2 = exp.length; i3 < len2; i3++) {
+      const child = exp[i3];
       if (!(child != null)) {
         continue;
       }
@@ -1457,9 +1457,12 @@ function addParentPointers(node, parent) {
     return;
   }
   node = node;
-  node.parent = parent;
+  if (parent != null) {
+    node.parent = parent;
+  }
   if (node.children) {
-    for (const child of node.children) {
+    for (let ref1 = node.children, i1 = 0, len2 = ref1.length; i1 < len2; i1++) {
+      const child = ref1[i1];
       addParentPointers(child, node);
     }
   }
@@ -1469,10 +1472,9 @@ function clone(node) {
   return deepCopy(node);
 }
 function removeParentPointers(node) {
-  if (node == null)
-    return;
-  if (typeof node !== "object")
+  if (!(node != null && typeof node === "object")) {
     return;
+  }
   if (Array.isArray(node)) {
     for (const child of node) {
       removeParentPointers(child);
@@ -1516,7 +1518,8 @@ function isEmptyBareBlock(node) {
   if (node?.type !== "BlockStatement")
     return false;
   const { bare, expressions } = node;
-  return bare && (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
+  return bare && //expressions is like [], [, {type: "EmptyStatement"}]
+  (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
 }
 function isFunction(node) {
   const { type } = node;
@@ -1564,8 +1567,8 @@ function isExit(node) {
   if (!(node != null)) {
     return false;
   }
-  let ref1;
   let ref2;
+  let ref3;
   switch (node.type) {
     case "ReturnStatement":
     case "ThrowStatement":
@@ -1574,10 +1577,10 @@ function isExit(node) {
       return true;
     }
     case "IfStatement": {
-      return isExit(node.then) && isExit((ref1 = node.else)?.[ref1.length - 1]);
+      return isExit(node.then) && isExit((ref2 = node.else)?.[ref2.length - 1]);
     }
     case "BlockStatement": {
-      return isExit((ref2 = node.expressions)[ref2.length - 1]?.[1]);
+      return isExit((ref3 = node.expressions)[ref3.length - 1]?.[1]);
     }
     case "IterationStatement": {
       return node.condition?.type === "ParenthesizedExpression" && node.condition.expression?.type === "Literal" && node.condition.expression?.raw === "true" && gatherRecursiveWithinFunction(
@@ -1873,8 +1876,8 @@ function updateParentPointers(node, parent, depth = 1) {
     return;
   }
   if (Array.isArray(node)) {
-    for (let i1 = 0, len2 = node.length; i1 < len2; i1++) {
-      const child = node[i1];
+    for (let i2 = 0, len1 = node.length; i2 < len1; i2++) {
+      const child = node[i2];
       updateParentPointers(child, parent, depth);
     }
     return;
@@ -1884,8 +1887,8 @@ function updateParentPointers(node, parent, depth = 1) {
     node.parent = parent;
   }
   if (depth && isParent(node)) {
-    for (let ref3 = node.children, i2 = 0, len1 = ref3.length; i2 < len1; i2++) {
-      const child = ref3[i2];
+    for (let ref4 = node.children, i3 = 0, len2 = ref4.length; i3 < len2; i3++) {
+      const child = ref4[i3];
       updateParentPointers(child, node, depth - 1);
     }
   }
@@ -2015,9 +2018,9 @@ function wrapWithReturn(expression) {
 }
 function flatJoin(array, separator) {
   const result = [];
-  for (let i3 = 0, len2 = array.length; i3 < len2; i3++) {
-    const i = i3;
-    const items = array[i3];
+  for (let i4 = 0, len3 = array.length; i4 < len3; i4++) {
+    const i = i4;
+    const items = array[i4];
     if (i) {
       result.push(separator);
     }
@@ -2068,8 +2071,9 @@ function findAncestor(node, predicate, stopPredicate) {
   return { ancestor: void 0, child: node };
 }
 function gatherNodes(node, predicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
     return node.flatMap((n) => gatherNodes(n, predicate));
   }
@@ -2077,24 +2081,30 @@ function gatherNodes(node, predicate) {
     return [node];
   }
   switch (node.type) {
-    case "BlockStatement":
+    case "BlockStatement": {
       return [];
-    case "ForStatement":
+    }
+    case "ForStatement": {
       const isDec = node.declaration?.type === "Declaration";
       return node.children.flatMap((n) => {
-        if (isDec && n === node.declaration)
+        if (isDec && n === node.declaration) {
           return [];
-        return gatherNodes(n, predicate);
+        } else {
+          return gatherNodes(n, predicate);
+        }
       });
-    default:
+    }
+    default: {
       return gatherNodes(node.children, predicate);
+    }
   }
 }
 function gatherRecursive(node, predicate, skipPredicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
-    return node.flatMap((n) => gatherRecursive(n, predicate, skipPredicate));
+    return node.flatMap(($) => gatherRecursive($, predicate, skipPredicate));
   }
   if (skipPredicate?.(node))
     return [];
@@ -2104,8 +2114,9 @@ function gatherRecursive(node, predicate, skipPredicate) {
   return gatherRecursive(node.children, predicate, skipPredicate);
 }
 function gatherRecursiveAll(node, predicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
     return node.flatMap((n) => gatherRecursiveAll(n, predicate));
   }
@@ -2835,21 +2846,9 @@ function elideMatchersFromPropertyBindings(properties) {
         const { children, name, value } = p;
         const [ws] = children;
         switch (value && value.type) {
-          case "ArrayBindingPattern": {
-            let bindings = nonMatcherBindings(value);
-            if (!bindings.length) {
-              bindings = void 0;
-            }
-            return {
-              ...p,
-              children: [ws, name, bindings && ": ", bindings, p.delim]
-            };
-          }
+          case "ArrayBindingPattern":
           case "ObjectBindingPattern": {
-            let bindings = nonMatcherBindings(value);
-            if (!bindings.properties.length) {
-              bindings = void 0;
-            }
+            const bindings = nonMatcherBindings(value);
             return {
               ...p,
               children: [ws, name, bindings && ": ", bindings, p.delim]
@@ -3166,9 +3165,12 @@ function processDeclarationCondition(condition, rootCondition, parent) {
   rootCondition.blockPrefix = getPatternBlockPrefix(pattern, ref, decl, suffix);
 }
 function processDeclarationConditions(node) {
-  gatherRecursiveAll(node, (n) => {
-    return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
-  }).forEach((s) => {
+  gatherRecursiveAll(
+    node,
+    (n) => {
+      return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
+    }
+  ).forEach((s) => {
     return processDeclarationConditionStatement(s);
   });
 }
@@ -4073,19 +4075,17 @@ function gen(node, options) {
 }
 var generate_default = gen;
 function prune(node) {
-  if (node === null || node === void 0) {
+  if (!(node != null)) {
     return;
   }
-  if (node.length === 0) {
+  if (typeof node === "string" && node.length === 0) {
     return;
   }
   if (node.parent != null) {
     delete node.parent;
   }
   if (Array.isArray(node)) {
-    const a = node.map(function(n) {
-      return prune(n);
-    }).filter(($) => !!$);
+    const a = node.map(prune).filter(($) => $);
     if (a.length > 1) {
       return a;
     }
@@ -5803,6 +5803,7 @@ var grammar = {
   NonPipelineArgumentPart,
   BinaryOpExpression,
   BinaryOpRHS,
+  IsLike,
   WRHS,
   SingleLineBinaryOpRHS,
   RHS,
@@ -7218,22 +7219,12 @@ var BinaryOpExpression$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(UnaryExpress
 function BinaryOpExpression(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "BinaryOpExpression", BinaryOpExpression$0);
 }
-var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), (0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
+var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), IsLike, (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
   var ws1 = $1;
   var op = $2;
   var ws2 = $3;
   var patterns = $4;
-  return [
-    ws1,
-    {
-      type: "PatternTest",
-      children: op,
-      special: true,
-      negated: !!op[2]
-    },
-    ws2,
-    patterns
-  ];
+  return [ws1, op, ws2, patterns];
 });
 var BinaryOpRHS$1 = (0, import_lib2.$TS)((0, import_lib2.$S)(BinaryOp, RHS), function($skip, $loc, $0, $1, $2) {
   var op = $1;
@@ -7252,6 +7243,18 @@ var BinaryOpRHS$$ = [BinaryOpRHS$0, BinaryOpRHS$1, BinaryOpRHS$2, BinaryOpRHS$3]
 function BinaryOpRHS(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "BinaryOpRHS", BinaryOpRHS$$);
 }
+var IsLike$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), function($skip, $loc, $0, $1, $2, $3, $4) {
+  var not = $3;
+  return {
+    type: "PatternTest",
+    children: $0,
+    special: true,
+    negated: !!not
+  };
+});
+function IsLike(ctx, state2) {
+  return (0, import_lib2.$EVENT)(ctx, state2, "IsLike", IsLike$0);
+}
 var WRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(PushIndent, (0, import_lib2.$E)((0, import_lib2.$S)(Nested, RHS)), PopIndent), function($skip, $loc, $0, $1, $2, $3) {
   var wrhs = $2;
   if (!wrhs)
@@ -7273,8 +7276,8 @@ var SingleLineBinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, impor
 function SingleLineBinaryOpRHS(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "SingleLineBinaryOpRHS", SingleLineBinaryOpRHS$0);
 }
-var RHS$0 = UnaryExpression;
-var RHS$1 = ExpressionizedStatementWithTrailingCallExpressions;
+var RHS$0 = ExpressionizedStatementWithTrailingCallExpressions;
+var RHS$1 = UnaryExpression;
 var RHS$$ = [RHS$0, RHS$1];
 function RHS(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "RHS", RHS$$);
@@ -9268,7 +9271,28 @@ var FunctionExpression$3 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, (
     expression: fn
   };
 });
-var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
+var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, IsLike, __, PatternExpressionList, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6) {
+  var open = $1;
+  var ws1 = $2;
+  var op = $3;
+  var ws2 = $4;
+  var rhs = $5;
+  var close = $6;
+  const refA = makeRef("a");
+  const fn = makeAmpersandFunction({
+    ref: refA,
+    body: processBinaryOpExpression([refA, [
+      [ws1, op, ws2, rhs]
+      // BinaryOpRHS
+    ]])
+  });
+  return {
+    type: "ParenthesizedExpression",
+    children: [open, fn, close],
+    expression: fn
+  };
+});
+var FunctionExpression$5 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
   var open = $1;
   var ws1 = $2;
   var op = $4;
@@ -9289,7 +9313,7 @@ var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, _
     expression: fn
   };
 });
-var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4];
+var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4, FunctionExpression$5];
 function FunctionExpression(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "FunctionExpression", FunctionExpression$$);
 }
@@ -13509,7 +13533,7 @@ var Comma$0 = (0, import_lib2.$TV)((0, import_lib2.$EXPECT)($L25, 'Comma ","'),
 function Comma(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "Comma", Comma$0);
 }
-var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue), function($skip, $loc, $0, $1, $2) {
+var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($L15, 'Comptime ":"'))), function($skip, $loc, $0, $1, $2, $3) {
   return { $loc, token: $1 };
 });
 function Comptime(ctx, state2) {
@@ -16651,10 +16675,18 @@ ${counts}`;
   if (options.ast) {
     return ast;
   }
+  function checkErrors() {
+    if (options.errors?.length) {
+      throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
+    }
+    ;
+    return;
+  }
   if (options.sourceMap || options.inlineMap) {
     const sm = SourceMap2(src);
     options.updateSourceMap = sm.updateSourceMap;
     const code = generate_default(ast, options);
+    checkErrors();
     if (options.inlineMap) {
       return SourceMap2.remap(code, sm, filename, filename + ".tsx");
     } else {
@@ -16665,9 +16697,7 @@ ${counts}`;
     }
   }
   const result = generate_default(ast, options);
-  if (options.errors?.length) {
-    throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
-  }
+  checkErrors();
   return result;
 };
 var makeCache = function({ hits, trace } = {}) {

package/dist/main.mjs

@@ -1297,8 +1297,8 @@ function makeBlockFragment() {
 function replaceBlockExpression(node, child, replacement) {
   let found = false;
   const { expressions } = node;
-  for (let i = 0, l = expressions.length; i < l; i++) {
-    const statement = expressions[i];
+  for (let i1 = 0, len2 = expressions.length; i1 < len2; i1++) {
+    const statement = expressions[i1];
     const [, s] = statement;
     if (s === child) {
       statement[1] = replacement;
@@ -1359,9 +1359,9 @@ function processBlocks(statements) {
 }
 function insertSemicolon(statements) {
   const l = statements.length;
-  for (let i1 = 0, len2 = statements.length; i1 < len2; i1++) {
-    const i = i1;
-    const s = statements[i1];
+  for (let i2 = 0, len1 = statements.length; i2 < len1; i2++) {
+    const i = i2;
+    const s = statements[i2];
     if (i < l - 1) {
       if (needsPrecedingSemicolon(statements[i + 1][1])) {
         const delim = s[2];
@@ -1379,8 +1379,8 @@ function needsPrecedingSemicolon(exp) {
     return false;
   }
   if (Array.isArray(exp)) {
-    for (let i2 = 0, len1 = exp.length; i2 < len1; i2++) {
-      const child = exp[i2];
+    for (let i3 = 0, len2 = exp.length; i3 < len2; i3++) {
+      const child = exp[i3];
       if (!(child != null)) {
         continue;
       }
@@ -1441,9 +1441,12 @@ function addParentPointers(node, parent) {
     return;
   }
   node = node;
-  node.parent = parent;
+  if (parent != null) {
+    node.parent = parent;
+  }
   if (node.children) {
-    for (const child of node.children) {
+    for (let ref1 = node.children, i1 = 0, len2 = ref1.length; i1 < len2; i1++) {
+      const child = ref1[i1];
       addParentPointers(child, node);
     }
   }
@@ -1453,10 +1456,9 @@ function clone(node) {
   return deepCopy(node);
 }
 function removeParentPointers(node) {
-  if (node == null)
-    return;
-  if (typeof node !== "object")
+  if (!(node != null && typeof node === "object")) {
     return;
+  }
   if (Array.isArray(node)) {
     for (const child of node) {
       removeParentPointers(child);
@@ -1500,7 +1502,8 @@ function isEmptyBareBlock(node) {
   if (node?.type !== "BlockStatement")
     return false;
   const { bare, expressions } = node;
-  return bare && (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
+  return bare && //expressions is like [], [, {type: "EmptyStatement"}]
+  (expressions.length === 0 || expressions.length === 1 && expressions[0][1]?.type === "EmptyStatement");
 }
 function isFunction(node) {
   const { type } = node;
@@ -1548,8 +1551,8 @@ function isExit(node) {
   if (!(node != null)) {
     return false;
   }
-  let ref1;
   let ref2;
+  let ref3;
   switch (node.type) {
     case "ReturnStatement":
     case "ThrowStatement":
@@ -1558,10 +1561,10 @@ function isExit(node) {
       return true;
     }
     case "IfStatement": {
-      return isExit(node.then) && isExit((ref1 = node.else)?.[ref1.length - 1]);
+      return isExit(node.then) && isExit((ref2 = node.else)?.[ref2.length - 1]);
     }
     case "BlockStatement": {
-      return isExit((ref2 = node.expressions)[ref2.length - 1]?.[1]);
+      return isExit((ref3 = node.expressions)[ref3.length - 1]?.[1]);
     }
     case "IterationStatement": {
       return node.condition?.type === "ParenthesizedExpression" && node.condition.expression?.type === "Literal" && node.condition.expression?.raw === "true" && gatherRecursiveWithinFunction(
@@ -1857,8 +1860,8 @@ function updateParentPointers(node, parent, depth = 1) {
     return;
   }
   if (Array.isArray(node)) {
-    for (let i1 = 0, len2 = node.length; i1 < len2; i1++) {
-      const child = node[i1];
+    for (let i2 = 0, len1 = node.length; i2 < len1; i2++) {
+      const child = node[i2];
       updateParentPointers(child, parent, depth);
     }
     return;
@@ -1868,8 +1871,8 @@ function updateParentPointers(node, parent, depth = 1) {
     node.parent = parent;
   }
   if (depth && isParent(node)) {
-    for (let ref3 = node.children, i2 = 0, len1 = ref3.length; i2 < len1; i2++) {
-      const child = ref3[i2];
+    for (let ref4 = node.children, i3 = 0, len2 = ref4.length; i3 < len2; i3++) {
+      const child = ref4[i3];
       updateParentPointers(child, node, depth - 1);
     }
   }
@@ -1999,9 +2002,9 @@ function wrapWithReturn(expression) {
 }
 function flatJoin(array, separator) {
   const result = [];
-  for (let i3 = 0, len2 = array.length; i3 < len2; i3++) {
-    const i = i3;
-    const items = array[i3];
+  for (let i4 = 0, len3 = array.length; i4 < len3; i4++) {
+    const i = i4;
+    const items = array[i4];
     if (i) {
       result.push(separator);
     }
@@ -2052,8 +2055,9 @@ function findAncestor(node, predicate, stopPredicate) {
   return { ancestor: void 0, child: node };
 }
 function gatherNodes(node, predicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
     return node.flatMap((n) => gatherNodes(n, predicate));
   }
@@ -2061,24 +2065,30 @@ function gatherNodes(node, predicate) {
     return [node];
   }
   switch (node.type) {
-    case "BlockStatement":
+    case "BlockStatement": {
       return [];
-    case "ForStatement":
+    }
+    case "ForStatement": {
       const isDec = node.declaration?.type === "Declaration";
       return node.children.flatMap((n) => {
-        if (isDec && n === node.declaration)
+        if (isDec && n === node.declaration) {
           return [];
-        return gatherNodes(n, predicate);
+        } else {
+          return gatherNodes(n, predicate);
+        }
       });
-    default:
+    }
+    default: {
       return gatherNodes(node.children, predicate);
+    }
   }
 }
 function gatherRecursive(node, predicate, skipPredicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
-    return node.flatMap((n) => gatherRecursive(n, predicate, skipPredicate));
+    return node.flatMap(($) => gatherRecursive($, predicate, skipPredicate));
   }
   if (skipPredicate?.(node))
     return [];
@@ -2088,8 +2098,9 @@ function gatherRecursive(node, predicate, skipPredicate) {
   return gatherRecursive(node.children, predicate, skipPredicate);
 }
 function gatherRecursiveAll(node, predicate) {
-  if (node == null)
+  if (node == null || typeof node === "string") {
     return [];
+  }
   if (Array.isArray(node)) {
     return node.flatMap((n) => gatherRecursiveAll(n, predicate));
   }
@@ -2819,21 +2830,9 @@ function elideMatchersFromPropertyBindings(properties) {
         const { children, name, value } = p;
         const [ws] = children;
         switch (value && value.type) {
-          case "ArrayBindingPattern": {
-            let bindings = nonMatcherBindings(value);
-            if (!bindings.length) {
-              bindings = void 0;
-            }
-            return {
-              ...p,
-              children: [ws, name, bindings && ": ", bindings, p.delim]
-            };
-          }
+          case "ArrayBindingPattern":
           case "ObjectBindingPattern": {
-            let bindings = nonMatcherBindings(value);
-            if (!bindings.properties.length) {
-              bindings = void 0;
-            }
+            const bindings = nonMatcherBindings(value);
             return {
               ...p,
               children: [ws, name, bindings && ": ", bindings, p.delim]
@@ -3150,9 +3149,12 @@ function processDeclarationCondition(condition, rootCondition, parent) {
   rootCondition.blockPrefix = getPatternBlockPrefix(pattern, ref, decl, suffix);
 }
 function processDeclarationConditions(node) {
-  gatherRecursiveAll(node, (n) => {
-    return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
-  }).forEach((s) => {
+  gatherRecursiveAll(
+    node,
+    (n) => {
+      return n.type === "IfStatement" || n.type === "IterationStatement" || n.type === "SwitchStatement";
+    }
+  ).forEach((s) => {
     return processDeclarationConditionStatement(s);
   });
 }
@@ -4057,19 +4059,17 @@ function gen(node, options) {
 }
 var generate_default = gen;
 function prune(node) {
-  if (node === null || node === void 0) {
+  if (!(node != null)) {
     return;
   }
-  if (node.length === 0) {
+  if (typeof node === "string" && node.length === 0) {
     return;
   }
   if (node.parent != null) {
     delete node.parent;
   }
   if (Array.isArray(node)) {
-    const a = node.map(function(n) {
-      return prune(n);
-    }).filter(($) => !!$);
+    const a = node.map(prune).filter(($) => $);
     if (a.length > 1) {
       return a;
     }
@@ -5787,6 +5787,7 @@ var grammar = {
   NonPipelineArgumentPart,
   BinaryOpExpression,
   BinaryOpRHS,
+  IsLike,
   WRHS,
   SingleLineBinaryOpRHS,
   RHS,
@@ -7202,22 +7203,12 @@ var BinaryOpExpression$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(UnaryExpress
 function BinaryOpExpression(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "BinaryOpExpression", BinaryOpExpression$0);
 }
-var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), (0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
+var BinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$C)((0, import_lib2.$E)(_), IndentedFurther, Nested), IsLike, (0, import_lib2.$E)(_), PatternExpressionList), function($skip, $loc, $0, $1, $2, $3, $4) {
   var ws1 = $1;
   var op = $2;
   var ws2 = $3;
   var patterns = $4;
-  return [
-    ws1,
-    {
-      type: "PatternTest",
-      children: op,
-      special: true,
-      negated: !!op[2]
-    },
-    ws2,
-    patterns
-  ];
+  return [ws1, op, ws2, patterns];
 });
 var BinaryOpRHS$1 = (0, import_lib2.$TS)((0, import_lib2.$S)(BinaryOp, RHS), function($skip, $loc, $0, $1, $2) {
   var op = $1;
@@ -7236,6 +7227,18 @@ var BinaryOpRHS$$ = [BinaryOpRHS$0, BinaryOpRHS$1, BinaryOpRHS$2, BinaryOpRHS$3]
 function BinaryOpRHS(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "BinaryOpRHS", BinaryOpRHS$$);
 }
+var IsLike$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(Is, (0, import_lib2.$E)(_), (0, import_lib2.$E)((0, import_lib2.$S)(Not, (0, import_lib2.$E)(_))), Like), function($skip, $loc, $0, $1, $2, $3, $4) {
+  var not = $3;
+  return {
+    type: "PatternTest",
+    children: $0,
+    special: true,
+    negated: !!not
+  };
+});
+function IsLike(ctx, state2) {
+  return (0, import_lib2.$EVENT)(ctx, state2, "IsLike", IsLike$0);
+}
 var WRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)(PushIndent, (0, import_lib2.$E)((0, import_lib2.$S)(Nested, RHS)), PopIndent), function($skip, $loc, $0, $1, $2, $3) {
   var wrhs = $2;
   if (!wrhs)
@@ -7257,8 +7260,8 @@ var SingleLineBinaryOpRHS$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, impor
 function SingleLineBinaryOpRHS(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "SingleLineBinaryOpRHS", SingleLineBinaryOpRHS$0);
 }
-var RHS$0 = UnaryExpression;
-var RHS$1 = ExpressionizedStatementWithTrailingCallExpressions;
+var RHS$0 = ExpressionizedStatementWithTrailingCallExpressions;
+var RHS$1 = UnaryExpression;
 var RHS$$ = [RHS$0, RHS$1];
 function RHS(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "RHS", RHS$$);
@@ -9252,7 +9255,28 @@ var FunctionExpression$3 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, (
     expression: fn
   };
 });
-var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
+var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, IsLike, __, PatternExpressionList, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6) {
+  var open = $1;
+  var ws1 = $2;
+  var op = $3;
+  var ws2 = $4;
+  var rhs = $5;
+  var close = $6;
+  const refA = makeRef("a");
+  const fn = makeAmpersandFunction({
+    ref: refA,
+    body: processBinaryOpExpression([refA, [
+      [ws1, op, ws2, rhs]
+      // BinaryOpRHS
+    ]])
+  });
+  return {
+    type: "ParenthesizedExpression",
+    children: [open, fn, close],
+    expression: fn
+  };
+});
+var FunctionExpression$5 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, __, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($R13, "FunctionExpression /\\+\\+|--|[\\+\\-&]\\S/")), BinaryOp, __, NonPipelineAssignmentExpression, CloseParen), function($skip, $loc, $0, $1, $2, $3, $4, $5, $6, $7) {
   var open = $1;
   var ws1 = $2;
   var op = $4;
@@ -9273,7 +9297,7 @@ var FunctionExpression$4 = (0, import_lib2.$TS)((0, import_lib2.$S)(OpenParen, _
     expression: fn
   };
 });
-var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4];
+var FunctionExpression$$ = [FunctionExpression$0, FunctionExpression$1, FunctionExpression$2, FunctionExpression$3, FunctionExpression$4, FunctionExpression$5];
 function FunctionExpression(ctx, state2) {
   return (0, import_lib2.$EVENT_C)(ctx, state2, "FunctionExpression", FunctionExpression$$);
 }
@@ -13493,7 +13517,7 @@ var Comma$0 = (0, import_lib2.$TV)((0, import_lib2.$EXPECT)($L25, 'Comma ","'),
 function Comma(ctx, state2) {
   return (0, import_lib2.$EVENT)(ctx, state2, "Comma", Comma$0);
 }
-var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue), function($skip, $loc, $0, $1, $2) {
+var Comptime$0 = (0, import_lib2.$TS)((0, import_lib2.$S)((0, import_lib2.$EXPECT)($L138, 'Comptime "comptime"'), NonIdContinue, (0, import_lib2.$N)((0, import_lib2.$EXPECT)($L15, 'Comptime ":"'))), function($skip, $loc, $0, $1, $2, $3) {
   return { $loc, token: $1 };
 });
 function Comptime(ctx, state2) {
@@ -16635,10 +16659,18 @@ ${counts}`;
   if (options.ast) {
     return ast;
   }
+  function checkErrors() {
+    if (options.errors?.length) {
+      throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
+    }
+    ;
+    return;
+  }
   if (options.sourceMap || options.inlineMap) {
     const sm = SourceMap2(src);
     options.updateSourceMap = sm.updateSourceMap;
     const code = generate_default(ast, options);
+    checkErrors();
     if (options.inlineMap) {
       return SourceMap2.remap(code, sm, filename, filename + ".tsx");
     } else {
@@ -16649,9 +16681,7 @@ ${counts}`;
     }
   }
   const result = generate_default(ast, options);
-  if (options.errors?.length) {
-    throw new Error(`Parse errors: ${options.errors.map(($) => $.message).join("\n")} `);
-  }
+  checkErrors();
   return result;
 };
 var makeCache = function({ hits, trace } = {}) {

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@danielx/civet",
   "type": "commonjs",
-  "version": "0.7.2",
+  "version": "0.7.4",
   "description": "CoffeeScript style syntax for TypeScript",
   "main": "dist/main.js",
   "module": "dist/main.mjs",