kirograph 0.27.1 → 0.28.0

package/dist/mcp/handlers/complexity.js

@@ -0,0 +1,267 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var complexity_exports = {};
+__export(complexity_exports, {
+  handleComplexity: () => handleComplexity
+});
+module.exports = __toCommonJS(complexity_exports);
+var import_utils = require("./utils");
+async function handleComplexity(toolName, args, cg) {
+  const rawDb = cg.getDatabase().getRawDb();
+  switch (toolName) {
+    case "kirograph_complexity": {
+      const limitN = (0, import_utils.clampLimit)(args.limit, 30);
+      const metric = args.metric ?? "cyclomatic";
+      const col = metric === "cognitive" ? "complexity_cognitive" : metric === "maintainability" ? "maintainability_index" : "complexity_cyclomatic";
+      const order = metric === "maintainability" ? "ASC" : "DESC";
+      const threshold = args.threshold ?? (metric === "maintainability" ? 50 : 10);
+      const rows = rawDb.all(
+        `SELECT name, kind, file_path, start_line, complexity_cyclomatic, complexity_cognitive,
+                maintainability_index, nesting_depth, (end_line - start_line + 1) as loc
+         FROM nodes WHERE ${col} IS NOT NULL AND kind IN ('function','method')
+         ORDER BY ${col} ${order} LIMIT ?`,
+        [limitN]
+      );
+      if (rows.length === 0) {
+        return "No complexity data found. Re-index with enableComplexity: true in .kirograph/config.json, then run `kirograph index`.";
+      }
+      const flagged = rows.filter(
+        (r) => metric === "maintainability" ? (r.maintainability_index ?? 100) <= threshold : (r[col] ?? 0) >= threshold
+      );
+      const lines = [
+        `Symbols ranked by ${metric} complexity (${rows.length} shown${flagged.length > 0 ? `, ${flagged.length} exceeding threshold ${threshold}` : ""}):
+`
+      ];
+      for (const r of rows) {
+        const cc = r.complexity_cyclomatic ?? "\u2014";
+        const mi = r.maintainability_index !== null ? r.maintainability_index.toFixed(1) : "\u2014";
+        const depth = r.nesting_depth ?? "\u2014";
+        const warn = flagged.includes(r) ? "\u26A0 " : "  ";
+        lines.push(`${warn}CC=${cc}  MI=${mi}  depth=${depth}  ${r.loc}LOC  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_simplify_scan": {
+      const limitN = (0, import_utils.clampLimit)(args.limit, 30);
+      const thresholdCC = args.thresholdCC ?? 10;
+      const thresholdMI = args.thresholdMI ?? 50;
+      const thresholdLOC = args.thresholdLOC ?? 50;
+      const rows = rawDb.all(
+        `SELECT name, kind, file_path, start_line,
+                complexity_cyclomatic, maintainability_index,
+                nesting_depth, (end_line - start_line + 1) as loc
+         FROM nodes WHERE kind IN ('function','method')
+           AND (
+             (complexity_cyclomatic IS NOT NULL AND complexity_cyclomatic >= ?)
+             OR (maintainability_index IS NOT NULL AND maintainability_index <= ?)
+             OR ((end_line - start_line + 1) >= ?)
+           )
+         ORDER BY complexity_cyclomatic DESC NULLS LAST LIMIT ?`,
+        [thresholdCC, thresholdMI, thresholdLOC, limitN]
+      );
+      if (rows.length === 0) return "No simplification candidates found \u2014 complexity is within thresholds.";
+      const lines = [`Simplification candidates (${rows.length}):
+`];
+      for (const r of rows) {
+        const issues = [];
+        if (r.complexity_cyclomatic !== null && r.complexity_cyclomatic >= thresholdCC) issues.push(`CC=${r.complexity_cyclomatic}`);
+        if (r.maintainability_index !== null && r.maintainability_index <= thresholdMI) issues.push(`MI=${r.maintainability_index.toFixed(1)}`);
+        if (r.loc >= thresholdLOC) issues.push(`${r.loc}LOC`);
+        lines.push(`  [${issues.join(", ")}] ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_health": {
+      const ccRows = rawDb.all(
+        `SELECT COUNT(*) as total,
+                SUM(CASE WHEN complexity_cyclomatic <= 10 THEN 1 ELSE 0 END) as good
+         FROM nodes WHERE kind IN ('function','method') AND complexity_cyclomatic IS NOT NULL`,
+        []
+      );
+      let complexity_score;
+      let complexityNote = "";
+      if (!ccRows[0] || ccRows[0].total === 0) {
+        complexity_score = 2500;
+        complexityNote = " (no CC data \u2014 set enableComplexity: true in config)";
+      } else {
+        const total = ccRows[0].total;
+        const good = ccRows[0].good;
+        complexity_score = Math.round(good / total * 2500);
+      }
+      const nodeCountRow = rawDb.all(
+        `SELECT COUNT(*) as cnt FROM nodes WHERE kind NOT IN ('file','module')`,
+        []
+      );
+      const totalNonFile = nodeCountRow[0]?.cnt ?? 0;
+      let dead_code_score = 2500;
+      if (totalNonFile > 0) {
+        const deadRows = rawDb.all(
+          `SELECT COUNT(*) as cnt FROM nodes n
+           WHERE n.kind NOT IN ('file','module')
+             AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.target = n.id)
+             AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.source = n.id)`,
+          []
+        );
+        const deadCount = deadRows[0]?.cnt ?? 0;
+        const dead_code_ratio = deadCount / totalNonFile;
+        dead_code_score = Math.round((1 - dead_code_ratio) * 2500);
+      }
+      const fanInRows = rawDb.all(
+        `SELECT AVG(cnt) as avg_fan_in FROM (SELECT target, COUNT(*) as cnt FROM edges WHERE kind='calls' GROUP BY target)`,
+        []
+      );
+      const avg_fan_in = fanInRows[0]?.avg_fan_in ?? 0;
+      let coupling_score;
+      if (avg_fan_in < 3) coupling_score = 2500;
+      else if (avg_fan_in < 6) coupling_score = 2e3;
+      else if (avg_fan_in < 10) coupling_score = 1500;
+      else coupling_score = 1e3;
+      const circRows = rawDb.all(
+        `SELECT COUNT(DISTINCT source) as cnt FROM edges WHERE kind='circular_dep'`,
+        []
+      );
+      const circCount = circRows[0]?.cnt ?? 0;
+      let circular_score;
+      if (circCount === 0) circular_score = 2500;
+      else if (circCount <= 5) circular_score = 2e3;
+      else if (circCount <= 15) circular_score = 1500;
+      else if (circCount <= 30) circular_score = 1e3;
+      else circular_score = 500;
+      const total_score = complexity_score + dead_code_score + coupling_score + circular_score;
+      const gradeLabel = total_score >= 9e3 ? "Excellent" : total_score >= 7e3 ? "Good" : total_score >= 5e3 ? "Fair" : total_score >= 3e3 ? "Poor" : "Critical";
+      const lines = [
+        `## Graph Health Score: ${total_score} / 10000  (${gradeLabel})
+`,
+        `Breakdown:`,
+        `  Complexity      ${complexity_score.toString().padStart(5)} / 2500${complexityNote}`,
+        `  Dead Code       ${dead_code_score.toString().padStart(5)} / 2500  (avg dead ratio)`,
+        `  Coupling        ${coupling_score.toString().padStart(5)} / 2500  (avg fan-in: ${avg_fan_in.toFixed(2)})`,
+        `  Circular Deps   ${circular_score.toString().padStart(5)} / 2500  (${circCount} circular dep sources)`,
+        "",
+        `Interpretation:`,
+        `  Complexity:    ${complexity_score >= 2e3 ? "Most functions have acceptable complexity." : complexity_score >= 1500 ? "Some high-complexity functions detected." : "Many high-complexity functions \u2014 refactor recommended."}`,
+        `  Dead Code:     ${dead_code_score >= 2e3 ? "Very little unreachable code." : dead_code_score >= 1500 ? "Some potentially dead code nodes." : "Significant dead code detected \u2014 consider cleanup."}`,
+        `  Coupling:      ${coupling_score >= 2e3 ? "Low coupling \u2014 healthy fan-in." : coupling_score >= 1500 ? "Moderate coupling." : "High coupling \u2014 consider reducing dependencies."}`,
+        `  Circular Deps: ${circular_score >= 2e3 ? "Few or no circular dependencies." : circular_score >= 1500 ? "Moderate circular dependencies." : "Many circular dependencies \u2014 architectural refactor recommended."}`
+      ];
+      if (complexityNote) lines.push("\nNote: enableComplexity: false in config \u2014 set to true and re-index for accurate complexity scoring.");
+      return lines.join("\n");
+    }
+    case "kirograph_dsm": {
+      const limitN = (0, import_utils.clampLimit)(args.limit, 15);
+      const nodes = rawDb.all(
+        `SELECT id, file_path FROM nodes WHERE file_path IS NOT NULL AND file_path != ''`,
+        []
+      );
+      const nodeGroup = /* @__PURE__ */ new Map();
+      const groupSet = /* @__PURE__ */ new Set();
+      for (const n of nodes) {
+        const parts = n.file_path.replace(/\\/g, "/").split("/");
+        const group = parts.length > 1 ? parts[0] : "<root>";
+        nodeGroup.set(n.id, group);
+        groupSet.add(group);
+      }
+      let groups = Array.from(groupSet).sort();
+      if (groups.length > limitN) groups = groups.slice(0, limitN);
+      if (groups.length === 0) return "No nodes with file paths found in the index.";
+      const matrix = groups.map(() => groups.map(() => 0));
+      const edges = rawDb.all(
+        `SELECT source, target FROM edges`,
+        []
+      );
+      for (const e of edges) {
+        const srcGroup = nodeGroup.get(e.source);
+        const tgtGroup = nodeGroup.get(e.target);
+        if (!srcGroup || !tgtGroup) continue;
+        const ri = groups.indexOf(srcGroup);
+        const ci = groups.indexOf(tgtGroup);
+        if (ri >= 0 && ci >= 0) matrix[ri][ci]++;
+      }
+      const colWidth = Math.max(...groups.map((g) => g.length), 6);
+      const pad = (s, w) => s.slice(0, w).padEnd(w);
+      const lines = [`## Design Structure Matrix (${groups.length} groups)
+`];
+      const header = "".padEnd(colWidth + 2) + groups.map((g) => pad(g, colWidth)).join("  ");
+      lines.push(header);
+      lines.push("-".repeat(header.length));
+      for (let r = 0; r < groups.length; r++) {
+        const row = pad(groups[r], colWidth) + "  " + matrix[r].map((v) => v.toString().padEnd(colWidth)).join("  ");
+        lines.push(row);
+      }
+      const couplings = [];
+      for (let r = 0; r < groups.length; r++) {
+        for (let c = 0; c < groups.length; c++) {
+          if (r !== c && matrix[r][c] > 0) couplings.push({ a: groups[r], b: groups[c], count: matrix[r][c] });
+        }
+      }
+      couplings.sort((x, y) => y.count - x.count);
+      lines.push("\n## Top 5 Heaviest Couplings:");
+      if (couplings.length === 0) {
+        lines.push("  No cross-group dependencies found.");
+      } else {
+        for (const cp of couplings.slice(0, 5)) {
+          lines.push(`  ${cp.a}  \u2192  ${cp.b}  (${cp.count} edges)`);
+        }
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_test_risk": {
+      const limitN = (0, import_utils.clampLimit)(args.limit, 20);
+      const threshold = args.threshold ?? 0;
+      const rows = rawDb.all(
+        `SELECT n.name, n.kind, n.file_path, n.start_line,
+                n.complexity_cyclomatic as cc,
+                COUNT(e.source) as fan_in
+         FROM nodes n
+         LEFT JOIN edges e ON e.target = n.id AND e.kind = 'calls'
+         WHERE n.kind IN ('function','method')
+           AND n.complexity_cyclomatic IS NOT NULL
+         GROUP BY n.id
+         HAVING (n.complexity_cyclomatic * COUNT(e.source)) > ?
+         ORDER BY (n.complexity_cyclomatic * COUNT(e.source)) DESC
+         LIMIT ?`,
+        [threshold, limitN]
+      );
+      if (rows.length === 0) {
+        return "No test risk data found. Ensure complexity is enabled (enableComplexity: true) and re-index.";
+      }
+      const lines = [
+        `## Test Risk Scores (top ${rows.length}, threshold=${threshold})
+`,
+        `${"risk".padEnd(8)}  ${"cc".padEnd(6)}  ${"fan_in".padEnd(8)}  kind        name  \u2014  location`,
+        "-".repeat(80)
+      ];
+      for (const r of rows) {
+        const risk = r.cc * r.fan_in;
+        lines.push(
+          `${risk.toString().padEnd(8)}  ${(r.cc ?? 0).toString().padEnd(6)}  ${r.fan_in.toString().padEnd(8)}  ${(0, import_utils.mapKind)(r.kind).padEnd(10)}  \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`
+        );
+      }
+      lines.push("\nNote: Coverage and churn factors not yet available \u2014 scores reflect complexity \xD7 fan-in only.");
+      return lines.join("\n");
+    }
+    default:
+      return `Unknown tool: ${toolName}`;
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  handleComplexity
+});
+//# sourceMappingURL=complexity.js.map

package/dist/mcp/handlers/complexity.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/mcp/handlers/complexity.ts"],
+  "sourcesContent": ["import KiroGraph from '../../index';\nimport { clampLimit, mapKind } from './utils';\n\nexport async function handleComplexity(toolName: string, args: Record<string, unknown>, cg: KiroGraph): Promise<string> {\n  const rawDb = cg.getDatabase().getRawDb();\n\n  switch (toolName) {\n    case 'kirograph_complexity': {\n      const limitN = clampLimit(args.limit as number | undefined, 30);\n      const metric = (args.metric as string) ?? 'cyclomatic';\n      const col = metric === 'cognitive' ? 'complexity_cognitive'\n        : metric === 'maintainability' ? 'maintainability_index'\n        : 'complexity_cyclomatic';\n      const order = metric === 'maintainability' ? 'ASC' : 'DESC';\n      const threshold = (args.threshold as number) ?? (metric === 'maintainability' ? 50 : 10);\n\n      const rows = rawDb.all(\n        `SELECT name, kind, file_path, start_line, complexity_cyclomatic, complexity_cognitive,\n                maintainability_index, nesting_depth, (end_line - start_line + 1) as loc\n         FROM nodes WHERE ${col} IS NOT NULL AND kind IN ('function','method')\n         ORDER BY ${col} ${order} LIMIT ?`,\n        [limitN]\n      );\n      if (rows.length === 0) {\n        return 'No complexity data found. Re-index with enableComplexity: true in .kirograph/config.json, then run `kirograph index`.';\n      }\n      const flagged = rows.filter((r: any) =>\n        metric === 'maintainability' ? (r.maintainability_index ?? 100) <= threshold : (r[col] ?? 0) >= threshold\n      );\n      const lines = [\n        `Symbols ranked by ${metric} complexity (${rows.length} shown${flagged.length > 0 ? `, ${flagged.length} exceeding threshold ${threshold}` : ''}):\\n`,\n      ];\n      for (const r of rows) {\n        const cc = r.complexity_cyclomatic ?? '\u2014';\n        const mi = r.maintainability_index !== null ? (r.maintainability_index as number).toFixed(1) : '\u2014';\n        const depth = r.nesting_depth ?? '\u2014';\n        const warn = flagged.includes(r) ? '\u26A0 ' : '  ';\n        lines.push(`${warn}CC=${cc}  MI=${mi}  depth=${depth}  ${r.loc}LOC  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_simplify_scan': {\n      // Quality analysis of changed files \u2014 complexity + size on recently modified symbols\n      const limitN = clampLimit(args.limit as number | undefined, 30);\n      const thresholdCC = (args.thresholdCC as number) ?? 10;\n      const thresholdMI = (args.thresholdMI as number) ?? 50;\n      const thresholdLOC = (args.thresholdLOC as number) ?? 50;\n\n      const rows = rawDb.all(\n        `SELECT name, kind, file_path, start_line,\n                complexity_cyclomatic, maintainability_index,\n                nesting_depth, (end_line - start_line + 1) as loc\n         FROM nodes WHERE kind IN ('function','method')\n           AND (\n             (complexity_cyclomatic IS NOT NULL AND complexity_cyclomatic >= ?)\n             OR (maintainability_index IS NOT NULL AND maintainability_index <= ?)\n             OR ((end_line - start_line + 1) >= ?)\n           )\n         ORDER BY complexity_cyclomatic DESC NULLS LAST LIMIT ?`,\n        [thresholdCC, thresholdMI, thresholdLOC, limitN]\n      );\n      if (rows.length === 0) return 'No simplification candidates found \u2014 complexity is within thresholds.';\n      const lines = [`Simplification candidates (${rows.length}):\\n`];\n      for (const r of rows) {\n        const issues = [];\n        if (r.complexity_cyclomatic !== null && r.complexity_cyclomatic >= thresholdCC) issues.push(`CC=${r.complexity_cyclomatic}`);\n        if (r.maintainability_index !== null && r.maintainability_index <= thresholdMI) issues.push(`MI=${(r.maintainability_index as number).toFixed(1)}`);\n        if (r.loc >= thresholdLOC) issues.push(`${r.loc}LOC`);\n        lines.push(`  [${issues.join(', ')}] ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_health': {\n      // complexity_score (0\u20132500): % of function/method nodes with CC <= 10\n      const ccRows = rawDb.all(\n        `SELECT COUNT(*) as total,\n                SUM(CASE WHEN complexity_cyclomatic <= 10 THEN 1 ELSE 0 END) as good\n         FROM nodes WHERE kind IN ('function','method') AND complexity_cyclomatic IS NOT NULL`,\n        []\n      );\n      let complexity_score: number;\n      let complexityNote = '';\n      if (!ccRows[0] || (ccRows[0] as any).total === 0) {\n        complexity_score = 2500;\n        complexityNote = ' (no CC data \u2014 set enableComplexity: true in config)';\n      } else {\n        const total = (ccRows[0] as any).total as number;\n        const good = (ccRows[0] as any).good as number;\n        complexity_score = Math.round((good / total) * 2500);\n      }\n\n      // dead_code_score (0\u20132500)\n      const nodeCountRow = rawDb.all(\n        `SELECT COUNT(*) as cnt FROM nodes WHERE kind NOT IN ('file','module')`,\n        []\n      );\n      const totalNonFile = (nodeCountRow[0] as any)?.cnt as number ?? 0;\n      let dead_code_score = 2500;\n      if (totalNonFile > 0) {\n        const deadRows = rawDb.all(\n          `SELECT COUNT(*) as cnt FROM nodes n\n           WHERE n.kind NOT IN ('file','module')\n             AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.target = n.id)\n             AND NOT EXISTS (SELECT 1 FROM edges e WHERE e.source = n.id)`,\n          []\n        );\n        const deadCount = (deadRows[0] as any)?.cnt as number ?? 0;\n        const dead_code_ratio = deadCount / totalNonFile;\n        dead_code_score = Math.round((1 - dead_code_ratio) * 2500);\n      }\n\n      // coupling_score (0\u20132500)\n      const fanInRows = rawDb.all(\n        `SELECT AVG(cnt) as avg_fan_in FROM (SELECT target, COUNT(*) as cnt FROM edges WHERE kind='calls' GROUP BY target)`,\n        []\n      );\n      const avg_fan_in = (fanInRows[0] as any)?.avg_fan_in as number ?? 0;\n      let coupling_score: number;\n      if (avg_fan_in < 3) coupling_score = 2500;\n      else if (avg_fan_in < 6) coupling_score = 2000;\n      else if (avg_fan_in < 10) coupling_score = 1500;\n      else coupling_score = 1000;\n\n      // circular_score (0\u20132500)\n      const circRows = rawDb.all(\n        `SELECT COUNT(DISTINCT source) as cnt FROM edges WHERE kind='circular_dep'`,\n        []\n      );\n      const circCount = (circRows[0] as any)?.cnt as number ?? 0;\n      let circular_score: number;\n      if (circCount === 0) circular_score = 2500;\n      else if (circCount <= 5) circular_score = 2000;\n      else if (circCount <= 15) circular_score = 1500;\n      else if (circCount <= 30) circular_score = 1000;\n      else circular_score = 500;\n\n      const total_score = complexity_score + dead_code_score + coupling_score + circular_score;\n\n      const gradeLabel = total_score >= 9000 ? 'Excellent'\n        : total_score >= 7000 ? 'Good'\n        : total_score >= 5000 ? 'Fair'\n        : total_score >= 3000 ? 'Poor'\n        : 'Critical';\n\n      const lines = [\n        `## Graph Health Score: ${total_score} / 10000  (${gradeLabel})\\n`,\n        `Breakdown:`,\n        `  Complexity      ${complexity_score.toString().padStart(5)} / 2500${complexityNote}`,\n        `  Dead Code       ${dead_code_score.toString().padStart(5)} / 2500  (avg dead ratio)`,\n        `  Coupling        ${coupling_score.toString().padStart(5)} / 2500  (avg fan-in: ${avg_fan_in.toFixed(2)})`,\n        `  Circular Deps   ${circular_score.toString().padStart(5)} / 2500  (${circCount} circular dep sources)`,\n        '',\n        `Interpretation:`,\n        `  Complexity:    ${complexity_score >= 2000 ? 'Most functions have acceptable complexity.' : complexity_score >= 1500 ? 'Some high-complexity functions detected.' : 'Many high-complexity functions \u2014 refactor recommended.'}`,\n        `  Dead Code:     ${dead_code_score >= 2000 ? 'Very little unreachable code.' : dead_code_score >= 1500 ? 'Some potentially dead code nodes.' : 'Significant dead code detected \u2014 consider cleanup.'}`,\n        `  Coupling:      ${coupling_score >= 2000 ? 'Low coupling \u2014 healthy fan-in.' : coupling_score >= 1500 ? 'Moderate coupling.' : 'High coupling \u2014 consider reducing dependencies.'}`,\n        `  Circular Deps: ${circular_score >= 2000 ? 'Few or no circular dependencies.' : circular_score >= 1500 ? 'Moderate circular dependencies.' : 'Many circular dependencies \u2014 architectural refactor recommended.'}`,\n      ];\n      if (complexityNote) lines.push('\\nNote: enableComplexity: false in config \u2014 set to true and re-index for accurate complexity scoring.');\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_dsm': {\n      const limitN = clampLimit(args.limit as number | undefined, 15);\n\n      // Get all nodes with file_path\n      const nodes = rawDb.all(\n        `SELECT id, file_path FROM nodes WHERE file_path IS NOT NULL AND file_path != ''`,\n        []\n      ) as Array<{ id: string; file_path: string }>;\n\n      // Extract top-level dir\n      const nodeGroup = new Map<string, string>();\n      const groupSet = new Set<string>();\n      for (const n of nodes) {\n        const parts = n.file_path.replace(/\\\\/g, '/').split('/');\n        const group = parts.length > 1 ? parts[0] : '<root>';\n        nodeGroup.set(n.id, group);\n        groupSet.add(group);\n      }\n\n      let groups = Array.from(groupSet).sort();\n      if (groups.length > limitN) groups = groups.slice(0, limitN);\n\n      if (groups.length === 0) return 'No nodes with file paths found in the index.';\n\n      // Build matrix: for each pair (A, B), count edges from nodes in A to nodes in B\n      const matrix: number[][] = groups.map(() => groups.map(() => 0));\n      const edges = rawDb.all(\n        `SELECT source, target FROM edges`,\n        []\n      ) as Array<{ source: string; target: string }>;\n\n      for (const e of edges) {\n        const srcGroup = nodeGroup.get(e.source);\n        const tgtGroup = nodeGroup.get(e.target);\n        if (!srcGroup || !tgtGroup) continue;\n        const ri = groups.indexOf(srcGroup);\n        const ci = groups.indexOf(tgtGroup);\n        if (ri >= 0 && ci >= 0) matrix[ri][ci]++;\n      }\n\n      // Build text table\n      const colWidth = Math.max(...groups.map(g => g.length), 6);\n      const pad = (s: string, w: number) => s.slice(0, w).padEnd(w);\n      const lines = [`## Design Structure Matrix (${groups.length} groups)\\n`];\n      const header = ''.padEnd(colWidth + 2) + groups.map(g => pad(g, colWidth)).join('  ');\n      lines.push(header);\n      lines.push('-'.repeat(header.length));\n      for (let r = 0; r < groups.length; r++) {\n        const row = pad(groups[r], colWidth) + '  ' + matrix[r].map(v => v.toString().padEnd(colWidth)).join('  ');\n        lines.push(row);\n      }\n\n      // Top 5 heaviest couplings\n      const couplings: Array<{ a: string; b: string; count: number }> = [];\n      for (let r = 0; r < groups.length; r++) {\n        for (let c = 0; c < groups.length; c++) {\n          if (r !== c && matrix[r][c] > 0) couplings.push({ a: groups[r], b: groups[c], count: matrix[r][c] });\n        }\n      }\n      couplings.sort((x, y) => y.count - x.count);\n      lines.push('\\n## Top 5 Heaviest Couplings:');\n      if (couplings.length === 0) {\n        lines.push('  No cross-group dependencies found.');\n      } else {\n        for (const cp of couplings.slice(0, 5)) {\n          lines.push(`  ${cp.a}  \u2192  ${cp.b}  (${cp.count} edges)`);\n        }\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_test_risk': {\n      const limitN = clampLimit(args.limit as number | undefined, 20);\n      const threshold = (args.threshold as number) ?? 0;\n\n      // Risk = CC * fan_in (coverage and churn not yet available)\n      const rows = rawDb.all(\n        `SELECT n.name, n.kind, n.file_path, n.start_line,\n                n.complexity_cyclomatic as cc,\n                COUNT(e.source) as fan_in\n         FROM nodes n\n         LEFT JOIN edges e ON e.target = n.id AND e.kind = 'calls'\n         WHERE n.kind IN ('function','method')\n           AND n.complexity_cyclomatic IS NOT NULL\n         GROUP BY n.id\n         HAVING (n.complexity_cyclomatic * COUNT(e.source)) > ?\n         ORDER BY (n.complexity_cyclomatic * COUNT(e.source)) DESC\n         LIMIT ?`,\n        [threshold, limitN]\n      ) as Array<{ name: string; kind: string; file_path: string; start_line: number; cc: number; fan_in: number }>;\n\n      if (rows.length === 0) {\n        return 'No test risk data found. Ensure complexity is enabled (enableComplexity: true) and re-index.';\n      }\n\n      const lines = [\n        `## Test Risk Scores (top ${rows.length}, threshold=${threshold})\\n`,\n        `${'risk'.padEnd(8)}  ${'cc'.padEnd(6)}  ${'fan_in'.padEnd(8)}  kind        name  \u2014  location`,\n        '-'.repeat(80),\n      ];\n      for (const r of rows) {\n        const risk = r.cc * r.fan_in;\n        lines.push(\n          `${risk.toString().padEnd(8)}  ${(r.cc ?? 0).toString().padEnd(6)}  ${r.fan_in.toString().padEnd(8)}  ${mapKind(r.kind).padEnd(10)}  \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`\n        );\n      }\n      lines.push('\\nNote: Coverage and churn factors not yet available \u2014 scores reflect complexity \u00D7 fan-in only.');\n      return lines.join('\\n');\n    }\n\n    default:\n      return `Unknown tool: ${toolName}`;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,mBAAoC;AAEpC,eAAsB,iBAAiB,UAAkB,MAA+B,IAAgC;AACtH,QAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AAExC,UAAQ,UAAU;AAAA,IAChB,KAAK,wBAAwB;AAC3B,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,SAAU,KAAK,UAAqB;AAC1C,YAAM,MAAM,WAAW,cAAc,yBACjC,WAAW,oBAAoB,0BAC/B;AACJ,YAAM,QAAQ,WAAW,oBAAoB,QAAQ;AACrD,YAAM,YAAa,KAAK,cAAyB,WAAW,oBAAoB,KAAK;AAErF,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA,4BAEoB,GAAG;AAAA,oBACX,GAAG,IAAI,KAAK;AAAA,QACxB,CAAC,MAAM;AAAA,MACT;AACA,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACT;AACA,YAAM,UAAU,KAAK;AAAA,QAAO,CAAC,MAC3B,WAAW,qBAAqB,EAAE,yBAAyB,QAAQ,aAAa,EAAE,GAAG,KAAK,MAAM;AAAA,MAClG;AACA,YAAM,QAAQ;AAAA,QACZ,qBAAqB,MAAM,gBAAgB,KAAK,MAAM,SAAS,QAAQ,SAAS,IAAI,KAAK,QAAQ,MAAM,wBAAwB,SAAS,KAAK,EAAE;AAAA;AAAA,MACjJ;AACA,iBAAW,KAAK,MAAM;AACpB,cAAM,KAAK,EAAE,yBAAyB;AACtC,cAAM,KAAK,EAAE,0BAA0B,OAAQ,EAAE,sBAAiC,QAAQ,CAAC,IAAI;AAC/F,cAAM,QAAQ,EAAE,iBAAiB;AACjC,cAAM,OAAO,QAAQ,SAAS,CAAC,IAAI,YAAO;AAC1C,cAAM,KAAK,GAAG,IAAI,MAAM,EAAE,QAAQ,EAAE,WAAW,KAAK,KAAK,EAAE,GAAG,YAAQ,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MACxI;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,2BAA2B;AAE9B,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,cAAe,KAAK,eAA0B;AACpD,YAAM,cAAe,KAAK,eAA0B;AACpD,YAAM,eAAgB,KAAK,gBAA2B;AAEtD,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAUA,CAAC,aAAa,aAAa,cAAc,MAAM;AAAA,MACjD;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAM,QAAQ,CAAC,8BAA8B,KAAK,MAAM;AAAA,CAAM;AAC9D,iBAAW,KAAK,MAAM;AACpB,cAAM,SAAS,CAAC;AAChB,YAAI,EAAE,0BAA0B,QAAQ,EAAE,yBAAyB,YAAa,QAAO,KAAK,MAAM,EAAE,qBAAqB,EAAE;AAC3H,YAAI,EAAE,0BAA0B,QAAQ,EAAE,yBAAyB,YAAa,QAAO,KAAK,MAAO,EAAE,sBAAiC,QAAQ,CAAC,CAAC,EAAE;AAClJ,YAAI,EAAE,OAAO,aAAc,QAAO,KAAK,GAAG,EAAE,GAAG,KAAK;AACpD,cAAM,KAAK,MAAM,OAAO,KAAK,IAAI,CAAC,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MACzG;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,oBAAoB;AAEvB,YAAM,SAAS,MAAM;AAAA,QACnB;AAAA;AAAA;AAAA,QAGA,CAAC;AAAA,MACH;AACA,UAAI;AACJ,UAAI,iBAAiB;AACrB,UAAI,CAAC,OAAO,CAAC,KAAM,OAAO,CAAC,EAAU,UAAU,GAAG;AAChD,2BAAmB;AACnB,yBAAiB;AAAA,MACnB,OAAO;AACL,cAAM,QAAS,OAAO,CAAC,EAAU;AACjC,cAAM,OAAQ,OAAO,CAAC,EAAU;AAChC,2BAAmB,KAAK,MAAO,OAAO,QAAS,IAAI;AAAA,MACrD;AAGA,YAAM,eAAe,MAAM;AAAA,QACzB;AAAA,QACA,CAAC;AAAA,MACH;AACA,YAAM,eAAgB,aAAa,CAAC,GAAW,OAAiB;AAChE,UAAI,kBAAkB;AACtB,UAAI,eAAe,GAAG;AACpB,cAAM,WAAW,MAAM;AAAA,UACrB;AAAA;AAAA;AAAA;AAAA,UAIA,CAAC;AAAA,QACH;AACA,cAAM,YAAa,SAAS,CAAC,GAAW,OAAiB;AACzD,cAAM,kBAAkB,YAAY;AACpC,0BAAkB,KAAK,OAAO,IAAI,mBAAmB,IAAI;AAAA,MAC3D;AAGA,YAAM,YAAY,MAAM;AAAA,QACtB;AAAA,QACA,CAAC;AAAA,MACH;AACA,YAAM,aAAc,UAAU,CAAC,GAAW,cAAwB;AAClE,UAAI;AACJ,UAAI,aAAa,EAAG,kBAAiB;AAAA,eAC5B,aAAa,EAAG,kBAAiB;AAAA,eACjC,aAAa,GAAI,kBAAiB;AAAA,UACtC,kBAAiB;AAGtB,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA,CAAC;AAAA,MACH;AACA,YAAM,YAAa,SAAS,CAAC,GAAW,OAAiB;AACzD,UAAI;AACJ,UAAI,cAAc,EAAG,kBAAiB;AAAA,eAC7B,aAAa,EAAG,kBAAiB;AAAA,eACjC,aAAa,GAAI,kBAAiB;AAAA,eAClC,aAAa,GAAI,kBAAiB;AAAA,UACtC,kBAAiB;AAEtB,YAAM,cAAc,mBAAmB,kBAAkB,iBAAiB;AAE1E,YAAM,aAAa,eAAe,MAAO,cACrC,eAAe,MAAO,SACtB,eAAe,MAAO,SACtB,eAAe,MAAO,SACtB;AAEJ,YAAM,QAAQ;AAAA,QACZ,0BAA0B,WAAW,cAAc,UAAU;AAAA;AAAA,QAC7D;AAAA,QACA,qBAAqB,iBAAiB,SAAS,EAAE,SAAS,CAAC,CAAC,UAAU,cAAc;AAAA,QACpF,qBAAqB,gBAAgB,SAAS,EAAE,SAAS,CAAC,CAAC;AAAA,QAC3D,qBAAqB,eAAe,SAAS,EAAE,SAAS,CAAC,CAAC,yBAAyB,WAAW,QAAQ,CAAC,CAAC;AAAA,QACxG,qBAAqB,eAAe,SAAS,EAAE,SAAS,CAAC,CAAC,aAAa,SAAS;AAAA,QAChF;AAAA,QACA;AAAA,QACA,oBAAoB,oBAAoB,MAAO,+CAA+C,oBAAoB,OAAO,6CAA6C,6DAAwD;AAAA,QAC9N,oBAAoB,mBAAmB,MAAO,kCAAkC,mBAAmB,OAAO,sCAAsC,yDAAoD;AAAA,QACpM,oBAAoB,kBAAkB,MAAO,wCAAmC,kBAAkB,OAAO,uBAAuB,sDAAiD;AAAA,QACjL,oBAAoB,kBAAkB,MAAO,qCAAqC,kBAAkB,OAAO,oCAAoC,uEAAkE;AAAA,MACnN;AACA,UAAI,eAAgB,OAAM,KAAK,4GAAuG;AACtI,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,iBAAiB;AACpB,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAG9D,YAAM,QAAQ,MAAM;AAAA,QAClB;AAAA,QACA,CAAC;AAAA,MACH;AAGA,YAAM,YAAY,oBAAI,IAAoB;AAC1C,YAAM,WAAW,oBAAI,IAAY;AACjC,iBAAW,KAAK,OAAO;AACrB,cAAM,QAAQ,EAAE,UAAU,QAAQ,OAAO,GAAG,EAAE,MAAM,GAAG;AACvD,cAAM,QAAQ,MAAM,SAAS,IAAI,MAAM,CAAC,IAAI;AAC5C,kBAAU,IAAI,EAAE,IAAI,KAAK;AACzB,iBAAS,IAAI,KAAK;AAAA,MACpB;AAEA,UAAI,SAAS,MAAM,KAAK,QAAQ,EAAE,KAAK;AACvC,UAAI,OAAO,SAAS,OAAQ,UAAS,OAAO,MAAM,GAAG,MAAM;AAE3D,UAAI,OAAO,WAAW,EAAG,QAAO;AAGhC,YAAM,SAAqB,OAAO,IAAI,MAAM,OAAO,IAAI,MAAM,CAAC,CAAC;AAC/D,YAAM,QAAQ,MAAM;AAAA,QAClB;AAAA,QACA,CAAC;AAAA,MACH;AAEA,iBAAW,KAAK,OAAO;AACrB,cAAM,WAAW,UAAU,IAAI,EAAE,MAAM;AACvC,cAAM,WAAW,UAAU,IAAI,EAAE,MAAM;AACvC,YAAI,CAAC,YAAY,CAAC,SAAU;AAC5B,cAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,cAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,YAAI,MAAM,KAAK,MAAM,EAAG,QAAO,EAAE,EAAE,EAAE;AAAA,MACvC;AAGA,YAAM,WAAW,KAAK,IAAI,GAAG,OAAO,IAAI,OAAK,EAAE,MAAM,GAAG,CAAC;AACzD,YAAM,MAAM,CAAC,GAAW,MAAc,EAAE,MAAM,GAAG,CAAC,EAAE,OAAO,CAAC;AAC5D,YAAM,QAAQ,CAAC,+BAA+B,OAAO,MAAM;AAAA,CAAY;AACvE,YAAM,SAAS,GAAG,OAAO,WAAW,CAAC,IAAI,OAAO,IAAI,OAAK,IAAI,GAAG,QAAQ,CAAC,EAAE,KAAK,IAAI;AACpF,YAAM,KAAK,MAAM;AACjB,YAAM,KAAK,IAAI,OAAO,OAAO,MAAM,CAAC;AACpC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,MAAM,IAAI,OAAO,CAAC,GAAG,QAAQ,IAAI,OAAO,OAAO,CAAC,EAAE,IAAI,OAAK,EAAE,SAAS,EAAE,OAAO,QAAQ,CAAC,EAAE,KAAK,IAAI;AACzG,cAAM,KAAK,GAAG;AAAA,MAChB;AAGA,YAAM,YAA4D,CAAC;AACnE,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,iBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAI,MAAM,KAAK,OAAO,CAAC,EAAE,CAAC,IAAI,EAAG,WAAU,KAAK,EAAE,GAAG,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;AAAA,QACrG;AAAA,MACF;AACA,gBAAU,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC1C,YAAM,KAAK,gCAAgC;AAC3C,UAAI,UAAU,WAAW,GAAG;AAC1B,cAAM,KAAK,sCAAsC;AAAA,MACnD,OAAO;AACL,mBAAW,MAAM,UAAU,MAAM,GAAG,CAAC,GAAG;AACtC,gBAAM,KAAK,KAAK,GAAG,CAAC,aAAQ,GAAG,CAAC,MAAM,GAAG,KAAK,SAAS;AAAA,QACzD;AAAA,MACF;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,uBAAuB;AAC1B,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,YAAa,KAAK,aAAwB;AAGhD,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAWA,CAAC,WAAW,MAAM;AAAA,MACpB;AAEA,UAAI,KAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ;AAAA,QACZ,4BAA4B,KAAK,MAAM,eAAe,SAAS;AAAA;AAAA,QAC/D,GAAG,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,KAAK,SAAS,OAAO,CAAC,CAAC;AAAA,QAC7D,IAAI,OAAO,EAAE;AAAA,MACf;AACA,iBAAW,KAAK,MAAM;AACpB,cAAM,OAAO,EAAE,KAAK,EAAE;AACtB,cAAM;AAAA,UACJ,GAAG,KAAK,SAAS,EAAE,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,SAAS,EAAE,OAAO,CAAC,CAAC,SAAK,sBAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,OAAO,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU;AAAA,QACpL;AAAA,MACF;AACA,YAAM,KAAK,yGAAiG;AAC5G,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA;AACE,aAAO,iBAAiB,QAAQ;AAAA,EACpC;AACF;",
+  "names": []
+}