@zgeoff/format-codemod 0.0.3 → 0.0.4

package/dist/cli.js

@@ -53,7 +53,7 @@ function isIgnored(file, patterns) {
 import { parseArgs } from "node:util";
 function parseCLIArgs(argv) {
   try {
-    const { values, positionals } = parseArgs({
+    const parsed = parseArgs({
       args: [...argv],
       options: {
         check: { type: "boolean", default: false },
@@ -68,13 +68,13 @@ function parseCLIArgs(argv) {
       strict: true
     });
     return {
-      mode: pickMode(values.check, values.dry),
-      quiet: values.quiet,
-      bench: values.bench,
-      help: values.help,
-      version: values.version,
-      ignore: values.ignore,
-      inputs: positionals
+      mode: pickMode(parsed.values.check, parsed.values.dry),
+      quiet: parsed.values.quiet,
+      bench: parsed.values.bench,
+      help: parsed.values.help,
+      version: parsed.values.version,
+      ignore: parsed.values.ignore,
+      inputs: parsed.positionals
     };
   } catch (error) {
     return error instanceof Error ? error.message : String(error);
@@ -222,11 +222,11 @@ function getStatementValues(node) {
   if (node.type === "VariableDeclaration") {
     return collectASTNodes(node["declarations"]).map((declarator) => declarator["init"]).filter((init) => isASTNode(init));
   }
-  const { expression } = node;
+  const expression = node["expression"];
   if (node.type !== "ExpressionStatement" || !isASTNode(expression)) {
     return [];
   }
-  const { right } = expression;
+  const right = expression["right"];
   if (expression.type === "AssignmentExpression" && isASTNode(right)) {
     return [right];
   }
@@ -291,7 +291,7 @@ function getStatementKind(node) {
   return isExpressionStatementOf(node, MUTATION_TYPES) ? "mutation" : null;
 }
 function isExpressionStatementOf(node, types) {
-  const { expression } = node;
+  const expression = node["expression"];
   return node.type === "ExpressionStatement" && isASTNode(expression) && types.includes(expression.type);
 }
 var VAR_DECL_KINDS = new Set(["const", "let", "var"]);
@@ -553,10 +553,11 @@ class MyersDiff {
     return ops.toReversed();
   }
   unwindRound(pos, d) {
-    const { prev, moveDown } = this.findPrevious(pos, d);
+    const previous = this.findPrevious(pos, d);
+    const prev = previous.prev;
     const ops = this.buildEqualOps(pos, prev);
     if (d > 0) {
-      const changeOp = moveDown ? { kind: "+", text: this.b[prev.y] ?? "" } : { kind: "-", text: this.a[prev.x] ?? "" };
+      const changeOp = previous.moveDown ? { kind: "+", text: this.b[prev.y] ?? "" } : { kind: "-", text: this.a[prev.x] ?? "" };
       ops.push(changeOp);
     }
     return { ops, pos: prev };
@@ -571,7 +572,8 @@ class MyersDiff {
   }
   buildEqualOps(pos, prev) {
     const ops = [];
-    let { x, y } = pos;
+    let x = pos.x;
+    let y = pos.y;
     while (x > prev.x && y > prev.y) {
       ops.push({ kind: " ", text: this.a[x - 1] ?? "" });
       x--;
@@ -601,12 +603,12 @@ function buildWindows(ops) {
   return windows;
 }
 function buildHunk(ops, w) {
-  const { aLine, bLine } = countPrecedingLines(ops, w.from);
+  const preceding = countPrecedingLines(ops, w.from);
   const slice = ops.slice(w.from, w.to);
   const aCount = slice.filter((o) => o.kind !== "+").length;
   const bCount = slice.filter((o) => o.kind !== "-").length;
   return {
-    header: `@@ -${formatRange(aLine, aCount)} +${formatRange(bLine, bCount)} @@
+    header: `@@ -${formatRange(preceding.aLine, aCount)} +${formatRange(preceding.bLine, bCount)} @@
 `,
     lines: slice.map((o) => `${o.kind}${o.text}
 `)
@@ -683,20 +685,23 @@ if (typeof parsedArgs === "string") {
   console.error(parsedArgs);
   process.exit(2);
 }
-var { mode, quiet, bench, help, version, ignore, inputs } = parsedArgs;
-if (help || inputs.length === 0 && !version) {
+var mode = parsedArgs.mode;
+var quiet = parsedArgs.quiet;
+var bench = parsedArgs.bench;
+var inputs = parsedArgs.inputs;
+if (parsedArgs.help || inputs.length === 0 && !parsedArgs.version) {
   const exitCode = inputs.length === 0 ? 2 : 0;
   printHelp();
   process.exit(exitCode);
 }
-if (version) {
+if (parsedArgs.version) {
   const pkgPath = fileURLToPath(new URL("../package.json", import.meta.url));
   process.stdout.write(`${readPackageVersion(pkgPath)}
 `);
   process.exit(0);
 }
 var t0 = Date.now();
-var files = await expandInputs(inputs, ignore);
+var files = await expandInputs(inputs, parsedArgs.ignore);
 if (files.length === 0) {
   console.error("no files matched");
   process.exit(2);

package/dist/index.js

@@ -72,11 +72,11 @@ function getStatementValues(node) {
   if (node.type === "VariableDeclaration") {
     return collectASTNodes(node["declarations"]).map((declarator) => declarator["init"]).filter((init) => isASTNode(init));
   }
-  const { expression } = node;
+  const expression = node["expression"];
   if (node.type !== "ExpressionStatement" || !isASTNode(expression)) {
     return [];
   }
-  const { right } = expression;
+  const right = expression["right"];
   if (expression.type === "AssignmentExpression" && isASTNode(right)) {
     return [right];
   }
@@ -141,7 +141,7 @@ function getStatementKind(node) {
   return isExpressionStatementOf(node, MUTATION_TYPES) ? "mutation" : null;
 }
 function isExpressionStatementOf(node, types) {
-  const { expression } = node;
+  const expression = node["expression"];
   return node.type === "ExpressionStatement" && isASTNode(expression) && types.includes(expression.type);
 }
 var VAR_DECL_KINDS = new Set(["const", "let", "var"]);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@zgeoff/format-codemod",
-  "version": "0.0.3",
+  "version": "0.0.4",
   "description": "Enforce blank-line padding conventions in TypeScript via a fast text-splice codemod",
   "license": "MIT",
   "repository": {