kirograph 0.27.1 → 0.28.0

package/dist/mcp/handlers/code-health.js

@@ -0,0 +1,563 @@
+"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 code_health_exports = {};
+__export(code_health_exports, {
+  handleCodeHealth: () => handleCodeHealth
+});
+module.exports = __toCommonJS(code_health_exports);
+var import_utils = require("./utils");
+async function handleCodeHealth(toolName, args, cg) {
+  switch (toolName) {
+    case "kirograph_dead_code": {
+      const limit = (0, import_utils.clampLimit)(args.limit, 50);
+      const dead = cg.findDeadCode(limit);
+      if (dead.length === 0) return "No dead code detected.";
+      return `Potential dead code (${dead.length} unexported symbols with no incoming references):
+` + dead.map((n) => `- ${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 ${n.filePath}:${n.startLine}`).join("\n");
+    }
+    case "kirograph_circular_deps": {
+      const cycles = cg.findCircularDependencies();
+      if (cycles.length === 0) return "No circular dependencies found.";
+      return `Found ${cycles.length} circular dependency cycle(s):
+` + cycles.map((cycle, i) => `Cycle ${i + 1}: ${cycle.join(" \u2192 ")}`).join("\n");
+    }
+    case "kirograph_path": {
+      const fromResults = cg.searchNodes(args.from, void 0, 3);
+      const toResults = cg.searchNodes(args.to, void 0, 3);
+      if (fromResults.length === 0) return `Symbol "${args.from}" not found in index.`;
+      if (toResults.length === 0) return `Symbol "${args.to}" not found in index.`;
+      const fromNode = fromResults[0].node;
+      const toNode = toResults[0].node;
+      const pathNodes = await cg.findPath(fromNode.id, toNode.id);
+      if (pathNodes.length === 0) return `No path found between \`${fromNode.name}\` and \`${toNode.name}\`.`;
+      return `Path from \`${fromNode.name}\` to \`${toNode.name}\` (${pathNodes.length} nodes):
+` + pathNodes.map((n, i) => `${i + 1}. ${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 ${n.filePath}:${n.startLine}`).join("\n");
+    }
+    case "kirograph_type_hierarchy": {
+      const results = cg.searchNodes(args.symbol, void 0, 5);
+      if (results.length === 0) return `Symbol "${args.symbol}" not found in index.`;
+      const node = results[0].node;
+      const direction = args.direction ?? "both";
+      const hierarchy = cg.getTypeHierarchy(node.id, direction);
+      if (hierarchy.length === 0) return `No type hierarchy found for \`${node.name}\`.`;
+      return `Type hierarchy for \`${node.name}\` (direction: ${direction}):
+` + hierarchy.map((n) => `- ${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 ${n.filePath}:${n.startLine}`).join("\n");
+    }
+    case "kirograph_hotspots": {
+      const limit = (0, import_utils.clampLimit)(args.limit, 20);
+      const hotspots = cg.findHotspots(limit);
+      if (hotspots.length === 0) return "No symbols found in index.";
+      const lines = [`Top ${hotspots.length} most-connected symbols (by edge degree):
+`];
+      for (const n of hotspots) {
+        lines.push(`${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 degree ${n.degree} (in: ${n.inDegree}, out: ${n.outDegree})`);
+        lines.push(`  File: ${n.filePath}:${n.startLine}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_surprising": {
+      const limit = (0, import_utils.clampLimit)(args.limit, 20);
+      const connections = cg.findSurprisingConnections(limit);
+      if (connections.length === 0) return "No surprising cross-file connections found.";
+      const lines = [`Top ${connections.length} surprising cross-file connections:
+`];
+      for (const c of connections) {
+        lines.push(`${(0, import_utils.mapKind)(c.source.kind)} \`${c.source.name}\` ${c.kind}\u2192 ${(0, import_utils.mapKind)(c.target.kind)} \`${c.target.name}\` (score: ${c.score.toFixed(2)})`);
+        lines.push(`  ${c.source.filePath} \u2192 ${c.target.filePath}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_diff": {
+      const sm = cg.createSnapshotManager();
+      const snapshot = args.snapshot ? sm.load(args.snapshot) : sm.loadLatest();
+      if (!snapshot) {
+        return args.snapshot ? `Snapshot "${args.snapshot}" not found. Use \`kirograph snapshot list\` to see available snapshots.` : "No snapshots found. Run `kirograph snapshot` to save one first.";
+      }
+      const diff = sm.diff(snapshot, sm.currentSnapshot());
+      const fromDate = new Date(diff.from.timestamp).toISOString().slice(0, 19).replace("T", " ");
+      const lines = [
+        `Graph diff: "${diff.from.label}" (${fromDate}) \u2192 current`,
+        ``,
+        `Symbols: +${diff.addedNodes.length} added, -${diff.removedNodes.length} removed`,
+        `Edges:   +${diff.addedEdges.length} added, -${diff.removedEdges.length} removed`
+      ];
+      if (diff.addedNodes.length > 0) {
+        lines.push(`
+## Added symbols (${diff.addedNodes.length})`);
+        for (const n of diff.addedNodes.slice(0, 30)) {
+          lines.push(`+ ${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 ${n.filePath}`);
+        }
+        if (diff.addedNodes.length > 30) lines.push(`  \u2026and ${diff.addedNodes.length - 30} more`);
+      }
+      if (diff.removedNodes.length > 0) {
+        lines.push(`
+## Removed symbols (${diff.removedNodes.length})`);
+        for (const n of diff.removedNodes.slice(0, 30)) {
+          lines.push(`- ${(0, import_utils.mapKind)(n.kind)} \`${n.name}\` \u2014 ${n.filePath}`);
+        }
+        if (diff.removedNodes.length > 30) lines.push(`  \u2026and ${diff.removedNodes.length - 30} more`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_snapshot_save": {
+      const sm = cg.createSnapshotManager();
+      const snapshot = sm.save(args.label);
+      return `Snapshot saved: "${snapshot.label}" \u2014 ${snapshot.nodeCount} symbols, ${snapshot.edgeCount} edges`;
+    }
+    case "kirograph_snapshot_list": {
+      const sm = cg.createSnapshotManager();
+      const snapshots = sm.list();
+      if (snapshots.length === 0) return "No snapshots yet. Use kirograph_snapshot_save to save one first.";
+      const lines = [`Saved snapshots (${snapshots.length}):
+`];
+      for (const s of snapshots) {
+        const date = new Date(s.timestamp).toISOString().slice(0, 19).replace("T", " ");
+        lines.push(`- ${s.label}  (${date}, ${s.nodeCount} symbols, ${s.edgeCount} edges)`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_module_api": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const pathArg = args.path;
+      let rows;
+      if (pathArg) {
+        const exact = pathArg.endsWith(".ts") || pathArg.endsWith(".js") || pathArg.includes(".");
+        rows = exact ? rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 AND file_path = ? ORDER BY kind, name`, [pathArg]) : rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 AND file_path LIKE ? ORDER BY kind, name`, [pathArg.replace(/\/$/, "") + "/%"]);
+      } else {
+        rows = rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 ORDER BY file_path, kind, name`);
+      }
+      if (rows.length === 0) return pathArg ? `No exported symbols found in "${pathArg}".` : "No exported symbols found.";
+      const limit = (0, import_utils.clampLimit)(args.limit, 100);
+      const limited = rows.slice(0, limit);
+      const lines = [`Exported API surface${pathArg ? ` for "${pathArg}"` : ""} (${limited.length}${rows.length > limit ? `/${rows.length}` : ""} symbols):
+`];
+      let lastFile = "";
+      for (const r of limited) {
+        if (r.file_path !== lastFile) {
+          lines.push(`
+${r.file_path}`);
+          lastFile = r.file_path;
+        }
+        const sig = r.signature ? `  ${r.signature}` : "";
+        lines.push(`  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\`${sig}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_rename_preview": {
+      const results = cg.searchNodes(args.symbol, void 0, 5);
+      if (results.length === 0) return `Symbol "${args.symbol}" not found in index.`;
+      const node = results[0].node;
+      const rawDb = cg.getDatabase().getRawDb();
+      const refs = rawDb.all(
+        `SELECT n.name, n.kind, n.file_path, n.start_line, e.kind as edge_kind
+         FROM edges e JOIN nodes n ON e.source = n.id
+         WHERE e.target = ? AND e.kind != 'contains'
+         ORDER BY n.file_path, n.start_line`,
+        [node.id]
+      );
+      if (refs.length === 0) return `No references to \`${node.name}\` found. Safe to rename.`;
+      const lines = [
+        `Rename preview for \`${node.name}\` (${(0, import_utils.mapKind)(node.kind)})`,
+        `Defined in: ${node.filePath}:${node.startLine}`,
+        `
+${refs.length} reference site(s):
+`
+      ];
+      let lastFile = "";
+      for (const r of refs) {
+        if (r.file_path !== lastFile) {
+          lines.push(`
+${r.file_path}`);
+          lastFile = r.file_path;
+        }
+        lines.push(`  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` (line ${r.start_line}, via ${r.edge_kind})`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_doc_coverage": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 50);
+      const rows = rawDb.all(
+        `SELECT kind, name, file_path, start_line FROM nodes
+         WHERE is_exported = 1 AND (docstring IS NULL OR docstring = '')
+         AND kind IN ('function','method','class','interface','type_alias')
+         ORDER BY file_path, start_line LIMIT ?`,
+        [limitN]
+      );
+      if (rows.length === 0) return "All exported symbols have docstrings.";
+      const lines = [`Exported symbols missing docstrings (${rows.length}):
+`];
+      let lastFile = "";
+      for (const r of rows) {
+        if (r.file_path !== lastFile) {
+          lines.push(`
+${r.file_path}`);
+          lastFile = r.file_path;
+        }
+        lines.push(`  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 line ${r.start_line}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_god_class": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 20);
+      const rows = rawDb.all(
+        `SELECT n.name, n.file_path, n.start_line, COUNT(e.target) as member_count
+         FROM nodes n JOIN edges e ON e.source = n.id AND e.kind = 'contains'
+         WHERE n.kind IN ('class','interface')
+         GROUP BY n.id HAVING member_count > 0
+         ORDER BY member_count DESC LIMIT ?`,
+        [limitN]
+      );
+      if (rows.length === 0) return "No class definitions found.";
+      const threshold = args.threshold ?? 10;
+      const gods = rows.filter((r) => r.member_count >= threshold);
+      const lines = [
+        `Classes ranked by member count (threshold: ${threshold}):
+`,
+        ...rows.map((r) => `${r.member_count >= threshold ? "\u26A0 " : "  "}${r.member_count.toString().padStart(4)} members  \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`)
+      ];
+      if (gods.length > 0) lines.unshift(`${gods.length} god class(es) found (\u2265${threshold} members).
+`);
+      return lines.join("\n");
+    }
+    case "kirograph_inheritance_depth": {
+      let depth2 = function(id) {
+        if (depths.has(id)) return depths.get(id);
+        const parents = childToParents.get(id) ?? [];
+        const d = parents.length === 0 ? 0 : 1 + Math.max(...parents.map(depth2));
+        depths.set(id, d);
+        return d;
+      };
+      var depth = depth2;
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 20);
+      const allNodes = rawDb.all(
+        `SELECT id, name, file_path, start_line FROM nodes WHERE kind IN ('class','interface')`,
+        []
+      );
+      const childToParents = /* @__PURE__ */ new Map();
+      const extEdges = rawDb.all(
+        `SELECT source, target FROM edges WHERE kind IN ('extends','implements')`,
+        []
+      );
+      for (const e of extEdges) {
+        if (!childToParents.has(e.source)) childToParents.set(e.source, []);
+        childToParents.get(e.source).push(e.target);
+      }
+      const depths = /* @__PURE__ */ new Map();
+      for (const n of allNodes) depth2(n.id);
+      const sorted = allNodes.map((n) => ({ ...n, depth: depths.get(n.id) ?? 0 })).filter((n) => n.depth > 0).sort((a, b) => b.depth - a.depth).slice(0, limitN);
+      if (sorted.length === 0) return "No inheritance hierarchies found.";
+      return `Deepest inheritance chains (${sorted.length}):
+
+` + sorted.map((n) => `  depth ${n.depth}  \`${n.name}\` \u2014 ${n.file_path}:${n.start_line}`).join("\n");
+    }
+    case "kirograph_recursion": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 30);
+      const direct = rawDb.all(
+        `SELECT n.name, n.kind, n.file_path, n.start_line FROM nodes n
+         JOIN edges e ON e.source = n.id AND e.target = n.id AND e.kind = 'calls'
+         WHERE n.kind IN ('function','method')
+         ORDER BY n.file_path, n.start_line LIMIT ?`,
+        [Math.ceil(limitN / 2)]
+      );
+      const mutual = rawDb.all(
+        `SELECT n1.name as a, n2.name as b, n1.file_path, n1.start_line FROM edges e1
+         JOIN edges e2 ON e1.target = e2.source AND e2.target = e1.source
+         JOIN nodes n1 ON n1.id = e1.source JOIN nodes n2 ON n2.id = e2.source
+         WHERE e1.kind = 'calls' AND e2.kind = 'calls' AND e1.source < e2.source
+         ORDER BY n1.name LIMIT ?`,
+        [Math.ceil(limitN / 2)]
+      );
+      if (direct.length === 0 && mutual.length === 0) return "No recursive functions detected.";
+      const lines = [];
+      if (direct.length > 0) {
+        lines.push(`Direct recursion (${direct.length}):
+`);
+        for (const r of direct) lines.push(`  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`);
+      }
+      if (mutual.length > 0) {
+        if (lines.length > 0) lines.push("");
+        lines.push(`Mutual recursion (${mutual.length} pairs):
+`);
+        for (const r of mutual) lines.push(`  \`${r.a}\` \u2194 \`${r.b}\` \u2014 ${r.file_path}:${r.start_line}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_largest": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 30);
+      const rows = rawDb.all(
+        `SELECT name, kind, file_path, start_line, (end_line - start_line + 1) as loc
+         FROM nodes WHERE end_line IS NOT NULL AND end_line > start_line
+         ORDER BY loc DESC LIMIT ?`,
+        [limitN]
+      );
+      if (rows.length === 0) return "No symbol size data available.";
+      return `Largest symbols by lines of code (${rows.length}):
+
+` + rows.map((r) => `  ${r.loc.toString().padStart(5)} LOC  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`).join("\n");
+    }
+    case "kirograph_rank": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 30);
+      const by = args.by ?? "fan-in";
+      let rows;
+      if (by === "fan-out") {
+        rows = rawDb.all(
+          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.target) as score
+           FROM nodes n JOIN edges e ON e.source = n.id AND e.kind = 'calls'
+           GROUP BY n.id ORDER BY score DESC LIMIT ?`,
+          [limitN]
+        );
+      } else {
+        rows = rawDb.all(
+          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.source) as score
+           FROM nodes n JOIN edges e ON e.target = n.id AND e.kind IN ('calls','imports')
+           GROUP BY n.id ORDER BY score DESC LIMIT ?`,
+          [limitN]
+        );
+      }
+      if (rows.length === 0) return `No ${by} data available.`;
+      return `Symbols ranked by ${by} (${rows.length}):
+
+` + rows.map((r) => `  ${r.score.toString().padStart(5)}  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`).join("\n");
+    }
+    case "kirograph_distribution": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const pathArg = args.path;
+      let rows;
+      if (pathArg) {
+        rows = rawDb.all(
+          `SELECT kind, COUNT(*) as count FROM nodes WHERE file_path LIKE ?
+           GROUP BY kind ORDER BY count DESC`,
+          [pathArg.replace(/\/$/, "") + "%"]
+        );
+      } else {
+        rows = rawDb.all(`SELECT kind, COUNT(*) as count FROM nodes GROUP BY kind ORDER BY count DESC`, []);
+      }
+      if (rows.length === 0) return "No symbols found.";
+      const total = rows.reduce((s, r) => s + r.count, 0);
+      const lines = [`Symbol distribution${pathArg ? ` in "${pathArg}"` : ""} (${total} total):
+`];
+      for (const r of rows) {
+        const pct = (r.count / total * 100).toFixed(1);
+        lines.push(`  ${r.count.toString().padStart(6)}  (${pct.padStart(5)}%)  ${r.kind}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_annotations": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 50);
+      const decorator = args.decorator;
+      let rows;
+      if (decorator) {
+        rows = rawDb.all(
+          `SELECT name, kind, file_path, start_line, decorators FROM nodes
+           WHERE decorators LIKE ? ORDER BY file_path, start_line LIMIT ?`,
+          [`%${decorator}%`, limitN]
+        );
+      } else {
+        const all = rawDb.all(`SELECT decorators FROM nodes WHERE decorators IS NOT NULL AND decorators != '[]'`, []);
+        const hist = /* @__PURE__ */ new Map();
+        for (const r of all) {
+          try {
+            const decs = JSON.parse(r.decorators);
+            for (const d of decs) hist.set(d, (hist.get(d) ?? 0) + 1);
+          } catch {
+          }
+        }
+        if (hist.size === 0) return "No decorators/annotations found.";
+        const sorted = [...hist.entries()].sort((a, b) => b[1] - a[1]).slice(0, limitN);
+        return `Decorator/annotation histogram (${hist.size} unique):
+
+` + sorted.map(([d, n]) => `  ${n.toString().padStart(5)}  @${d}`).join("\n");
+      }
+      if (rows.length === 0) return `No symbols with decorator "${decorator}" found.`;
+      return `Symbols with @${decorator} (${rows.length}):
+
+` + rows.map((r) => `  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`).join("\n");
+    }
+    case "kirograph_session_start": {
+      const sm = cg.createSnapshotManager();
+      const snapshot = sm.save("session-baseline");
+      return `Session baseline saved: ${snapshot.nodeCount} symbols, ${snapshot.edgeCount} edges.
+Use kirograph_session_end to see what changed.`;
+    }
+    case "kirograph_session_end": {
+      const sm = cg.createSnapshotManager();
+      const snapshots = sm.list();
+      const baseline = snapshots.find((s) => s.label === "session-baseline");
+      if (!baseline) return "No session baseline found. Run kirograph_session_start first.";
+      const current = sm.save(`session-end-${Date.now()}`);
+      const nodeDelta = current.nodeCount - baseline.nodeCount;
+      const edgeDelta = current.edgeCount - baseline.edgeCount;
+      const lines = [
+        `Session delta (since ${new Date(baseline.timestamp).toISOString().slice(0, 19).replace("T", " ")}):`,
+        `  Symbols: ${baseline.nodeCount} \u2192 ${current.nodeCount} (${nodeDelta >= 0 ? "+" : ""}${nodeDelta})`,
+        `  Edges:   ${baseline.edgeCount} \u2192 ${current.edgeCount} (${edgeDelta >= 0 ? "+" : ""}${edgeDelta})`
+      ];
+      return lines.join("\n");
+    }
+    case "kirograph_unused_imports": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 50);
+      const rows = rawDb.all(
+        `SELECT n.* FROM nodes n
+         LEFT JOIN edges e ON e.source = n.id AND e.kind != 'contains'
+         WHERE n.kind = 'import'
+         GROUP BY n.id HAVING COUNT(e.id) = 0
+         ORDER BY n.file_path, n.start_line LIMIT ?`,
+        [limitN]
+      );
+      if (rows.length === 0) return "No unused imports detected.";
+      const lines = [`Unused imports (${rows.length}):
+`];
+      let lastFile = "";
+      for (const r of rows) {
+        if (r.file_path !== lastFile) {
+          lines.push(`
+${r.file_path}`);
+          lastFile = r.file_path;
+        }
+        lines.push(`  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 line ${r.start_line}`);
+      }
+      return lines.join("\n");
+    }
+    case "kirograph_gini": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const metric = args.metric ?? "loc";
+      let values;
+      let rows;
+      if (metric === "loc") {
+        rows = rawDb.all(
+          `SELECT name, kind, file_path, start_line, (end_line - start_line + 1) as val
+           FROM nodes
+           WHERE kind IN ('function','method') AND end_line IS NOT NULL AND end_line >= start_line
+           ORDER BY val DESC`,
+          []
+        );
+      } else if (metric === "fan-out") {
+        rows = rawDb.all(
+          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.target) as val
+           FROM nodes n LEFT JOIN edges e ON e.source = n.id AND e.kind = 'calls'
+           WHERE n.kind IN ('function','method')
+           GROUP BY n.id ORDER BY val DESC`,
+          []
+        );
+      } else {
+        rows = rawDb.all(
+          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.source) as val
+           FROM nodes n LEFT JOIN edges e ON e.target = n.id AND e.kind IN ('calls','imports','references')
+           WHERE n.kind IN ('function','method')
+           GROUP BY n.id ORDER BY val DESC`,
+          []
+        );
+      }
+      if (rows.length < 2) return "Not enough function/method nodes to compute Gini coefficient.";
+      values = rows.map((r) => Number(r.val));
+      const n = values.length;
+      const sum = values.reduce((a, b) => a + b, 0);
+      let gini = 0;
+      if (sum > 0) {
+        const sorted = [...values].sort((a, b) => a - b);
+        const numerator = sorted.reduce((acc, x, i) => acc + (2 * (i + 1) - n - 1) * x, 0);
+        gini = numerator / (n * sum);
+      }
+      const top5 = rows.slice(0, 5);
+      const bottom5 = rows.slice(-5).reverse();
+      const lines = [
+        `Gini coefficient for ${metric} across ${n} function/method nodes: ${gini.toFixed(4)}`,
+        `(0 = perfect equality, 1 = total inequality)
+`,
+        `Top 5 by ${metric}:`,
+        ...top5.map((r) => `  ${String(r.val).padStart(6)}  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`),
+        `
+Bottom 5 by ${metric}:`,
+        ...bottom5.map((r) => `  ${String(r.val).padStart(6)}  ${(0, import_utils.mapKind)(r.kind)} \`${r.name}\` \u2014 ${r.file_path}:${r.start_line}`)
+      ];
+      return lines.join("\n");
+    }
+    case "kirograph_dependency_depth": {
+      const rawDb = cg.getDatabase().getRawDb();
+      const limitN = (0, import_utils.clampLimit)(args.limit, 20);
+      const fileRows = rawDb.all(`SELECT DISTINCT file_path FROM nodes ORDER BY file_path`, []);
+      const files = fileRows.map((r) => r.file_path);
+      if (files.length === 0) return "No files found in index.";
+      const edgeRows = rawDb.all(
+        `SELECT DISTINCT n1.file_path as src, n2.file_path as tgt
+         FROM edges e
+         JOIN nodes n1 ON n1.id = e.source
+         JOIN nodes n2 ON n2.id = e.target
+         WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`,
+        []
+      );
+      const outEdges = /* @__PURE__ */ new Map();
+      const inDegree = /* @__PURE__ */ new Map();
+      for (const f of files) {
+        outEdges.set(f, /* @__PURE__ */ new Set());
+        inDegree.set(f, 0);
+      }
+      for (const e of edgeRows) {
+        outEdges.get(e.src)?.add(e.tgt);
+        inDegree.set(e.tgt, (inDegree.get(e.tgt) ?? 0) + 1);
+      }
+      const level = /* @__PURE__ */ new Map();
+      const queue = [];
+      for (const f of files) {
+        if ((inDegree.get(f) ?? 0) === 0) {
+          queue.push(f);
+          level.set(f, 0);
+        }
+      }
+      while (queue.length > 0) {
+        const cur = queue.shift();
+        const curLevel = level.get(cur) ?? 0;
+        for (const nb of outEdges.get(cur) ?? []) {
+          const newLevel = curLevel + 1;
+          if ((level.get(nb) ?? -1) < newLevel) level.set(nb, newLevel);
+          const deg = (inDegree.get(nb) ?? 1) - 1;
+          inDegree.set(nb, deg);
+          if (deg === 0) queue.push(nb);
+        }
+      }
+      const sorted = files.map((f) => ({ file: f, depth: level.get(f) ?? 0 })).sort((a, b) => b.depth - a.depth).slice(0, limitN);
+      const lines = [`File dependency depths (deepest first, limit ${limitN}):
+`];
+      for (const { file, depth: depth2 } of sorted) {
+        const sample = rawDb.all(
+          `SELECT name, kind FROM nodes WHERE file_path = ? AND kind IN ('function','class','interface','method') LIMIT 3`,
+          [file]
+        );
+        const symbols = sample.map((r) => `\`${r.name}\``).join(", ");
+        lines.push(`  depth ${String(depth2).padStart(3)}  ${file}${symbols ? `  (${symbols})` : ""}`);
+      }
+      return lines.join("\n");
+    }
+    default:
+      return `Unknown tool: ${toolName}`;
+  }
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  handleCodeHealth
+});
+//# sourceMappingURL=code-health.js.map

package/dist/mcp/handlers/code-health.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/mcp/handlers/code-health.ts"],
+  "sourcesContent": ["import KiroGraph from '../../index';\nimport { clampLimit, mapKind, truncate } from './utils';\n\nexport async function handleCodeHealth(toolName: string, args: Record<string, unknown>, cg: KiroGraph): Promise<string> {\n  switch (toolName) {\n    case 'kirograph_dead_code': {\n      const limit = clampLimit(args.limit as number | undefined, 50);\n      const dead = cg.findDeadCode(limit);\n      if (dead.length === 0) return 'No dead code detected.';\n      return `Potential dead code (${dead.length} unexported symbols with no incoming references):\\n` +\n        dead.map(n => `- ${mapKind(n.kind)} \\`${n.name}\\` \u2014 ${n.filePath}:${n.startLine}`).join('\\n');\n    }\n\n    case 'kirograph_circular_deps': {\n      const cycles = cg.findCircularDependencies();\n      if (cycles.length === 0) return 'No circular dependencies found.';\n      return `Found ${cycles.length} circular dependency cycle(s):\\n` +\n        cycles.map((cycle, i) => `Cycle ${i + 1}: ${cycle.join(' \u2192 ')}`).join('\\n');\n    }\n\n    case 'kirograph_path': {\n      const fromResults = cg.searchNodes(args.from as string, undefined, 3);\n      const toResults = cg.searchNodes(args.to as string, undefined, 3);\n      if (fromResults.length === 0) return `Symbol \"${args.from}\" not found in index.`;\n      if (toResults.length === 0) return `Symbol \"${args.to}\" not found in index.`;\n      const fromNode = fromResults[0].node;\n      const toNode = toResults[0].node;\n      const pathNodes = await cg.findPath(fromNode.id, toNode.id);\n      if (pathNodes.length === 0) return `No path found between \\`${fromNode.name}\\` and \\`${toNode.name}\\`.`;\n      return `Path from \\`${fromNode.name}\\` to \\`${toNode.name}\\` (${pathNodes.length} nodes):\\n` +\n        pathNodes.map((n, i) => `${i + 1}. ${mapKind(n.kind)} \\`${n.name}\\` \u2014 ${n.filePath}:${n.startLine}`).join('\\n');\n    }\n\n    case 'kirograph_type_hierarchy': {\n      const results = cg.searchNodes(args.symbol as string, undefined, 5);\n      if (results.length === 0) return `Symbol \"${args.symbol}\" not found in index.`;\n      const node = results[0].node;\n      const direction = (args.direction as 'up' | 'down' | 'both') ?? 'both';\n      const hierarchy = cg.getTypeHierarchy(node.id, direction);\n      if (hierarchy.length === 0) return `No type hierarchy found for \\`${node.name}\\`.`;\n      return `Type hierarchy for \\`${node.name}\\` (direction: ${direction}):\\n` +\n        hierarchy.map(n => `- ${mapKind(n.kind)} \\`${n.name}\\` \u2014 ${n.filePath}:${n.startLine}`).join('\\n');\n    }\n\n    case 'kirograph_hotspots': {\n      const limit = clampLimit(args.limit as number | undefined, 20);\n      const hotspots = cg.findHotspots(limit);\n      if (hotspots.length === 0) return 'No symbols found in index.';\n      const lines = [`Top ${hotspots.length} most-connected symbols (by edge degree):\\n`];\n      for (const n of hotspots) {\n        lines.push(`${mapKind(n.kind)} \\`${n.name}\\` \u2014 degree ${n.degree} (in: ${n.inDegree}, out: ${n.outDegree})`);\n        lines.push(`  File: ${n.filePath}:${n.startLine}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_surprising': {\n      const limit = clampLimit(args.limit as number | undefined, 20);\n      const connections = cg.findSurprisingConnections(limit);\n      if (connections.length === 0) return 'No surprising cross-file connections found.';\n      const lines = [`Top ${connections.length} surprising cross-file connections:\\n`];\n      for (const c of connections) {\n        lines.push(`${mapKind(c.source.kind)} \\`${c.source.name}\\` ${c.kind}\u2192 ${mapKind(c.target.kind)} \\`${c.target.name}\\` (score: ${c.score.toFixed(2)})`);\n        lines.push(`  ${c.source.filePath} \u2192 ${c.target.filePath}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_diff': {\n      const sm = cg.createSnapshotManager();\n      const snapshot = args.snapshot\n        ? sm.load(args.snapshot as string)\n        : sm.loadLatest();\n      if (!snapshot) {\n        return args.snapshot\n          ? `Snapshot \"${args.snapshot}\" not found. Use \\`kirograph snapshot list\\` to see available snapshots.`\n          : 'No snapshots found. Run `kirograph snapshot` to save one first.';\n      }\n      const diff = sm.diff(snapshot, sm.currentSnapshot());\n      const fromDate = new Date(diff.from.timestamp).toISOString().slice(0, 19).replace('T', ' ');\n      const lines = [\n        `Graph diff: \"${diff.from.label}\" (${fromDate}) \u2192 current`,\n        ``,\n        `Symbols: +${diff.addedNodes.length} added, -${diff.removedNodes.length} removed`,\n        `Edges:   +${diff.addedEdges.length} added, -${diff.removedEdges.length} removed`,\n      ];\n      if (diff.addedNodes.length > 0) {\n        lines.push(`\\n## Added symbols (${diff.addedNodes.length})`);\n        for (const n of diff.addedNodes.slice(0, 30)) {\n          lines.push(`+ ${mapKind(n.kind)} \\`${n.name}\\` \u2014 ${n.filePath}`);\n        }\n        if (diff.addedNodes.length > 30) lines.push(`  \u2026and ${diff.addedNodes.length - 30} more`);\n      }\n      if (diff.removedNodes.length > 0) {\n        lines.push(`\\n## Removed symbols (${diff.removedNodes.length})`);\n        for (const n of diff.removedNodes.slice(0, 30)) {\n          lines.push(`- ${mapKind(n.kind)} \\`${n.name}\\` \u2014 ${n.filePath}`);\n        }\n        if (diff.removedNodes.length > 30) lines.push(`  \u2026and ${diff.removedNodes.length - 30} more`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_snapshot_save': {\n      const sm = cg.createSnapshotManager();\n      const snapshot = sm.save(args.label as string | undefined);\n      return `Snapshot saved: \"${snapshot.label}\" \u2014 ${snapshot.nodeCount} symbols, ${snapshot.edgeCount} edges`;\n    }\n\n    case 'kirograph_snapshot_list': {\n      const sm = cg.createSnapshotManager();\n      const snapshots = sm.list();\n      if (snapshots.length === 0) return 'No snapshots yet. Use kirograph_snapshot_save to save one first.';\n      const lines = [`Saved snapshots (${snapshots.length}):\\n`];\n      for (const s of snapshots) {\n        const date = new Date(s.timestamp).toISOString().slice(0, 19).replace('T', ' ');\n        lines.push(`- ${s.label}  (${date}, ${s.nodeCount} symbols, ${s.edgeCount} edges)`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_module_api': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const pathArg = args.path as string | undefined;\n      let rows: any[];\n      if (pathArg) {\n        const exact = pathArg.endsWith('.ts') || pathArg.endsWith('.js') || pathArg.includes('.');\n        rows = exact\n          ? rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 AND file_path = ? ORDER BY kind, name`, [pathArg])\n          : rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 AND file_path LIKE ? ORDER BY kind, name`, [pathArg.replace(/\\/$/, '') + '/%']);\n      } else {\n        rows = rawDb.all(`SELECT * FROM nodes WHERE is_exported = 1 ORDER BY file_path, kind, name`);\n      }\n      if (rows.length === 0) return pathArg ? `No exported symbols found in \"${pathArg}\".` : 'No exported symbols found.';\n      const limit = clampLimit(args.limit as number | undefined, 100);\n      const limited = rows.slice(0, limit);\n      const lines = [`Exported API surface${pathArg ? ` for \"${pathArg}\"` : ''} (${limited.length}${rows.length > limit ? `/${rows.length}` : ''} symbols):\\n`];\n      let lastFile = '';\n      for (const r of limited) {\n        if (r.file_path !== lastFile) { lines.push(`\\n${r.file_path}`); lastFile = r.file_path; }\n        const sig = r.signature ? `  ${r.signature}` : '';\n        lines.push(`  ${mapKind(r.kind)} \\`${r.name}\\`${sig}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_rename_preview': {\n      const results = cg.searchNodes(args.symbol as string, undefined, 5);\n      if (results.length === 0) return `Symbol \"${args.symbol}\" not found in index.`;\n      const node = results[0].node;\n      const rawDb = cg.getDatabase().getRawDb();\n      const refs = rawDb.all(\n        `SELECT n.name, n.kind, n.file_path, n.start_line, e.kind as edge_kind\n         FROM edges e JOIN nodes n ON e.source = n.id\n         WHERE e.target = ? AND e.kind != 'contains'\n         ORDER BY n.file_path, n.start_line`,\n        [node.id]\n      );\n      if (refs.length === 0) return `No references to \\`${node.name}\\` found. Safe to rename.`;\n      const lines = [\n        `Rename preview for \\`${node.name}\\` (${mapKind(node.kind)})`,\n        `Defined in: ${node.filePath}:${node.startLine}`,\n        `\\n${refs.length} reference site(s):\\n`,\n      ];\n      let lastFile = '';\n      for (const r of refs) {\n        if (r.file_path !== lastFile) { lines.push(`\\n${r.file_path}`); lastFile = r.file_path; }\n        lines.push(`  ${mapKind(r.kind)} \\`${r.name}\\` (line ${r.start_line}, via ${r.edge_kind})`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_doc_coverage': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 50);\n      const rows = rawDb.all(\n        `SELECT kind, name, file_path, start_line FROM nodes\n         WHERE is_exported = 1 AND (docstring IS NULL OR docstring = '')\n         AND kind IN ('function','method','class','interface','type_alias')\n         ORDER BY file_path, start_line LIMIT ?`,\n        [limitN]\n      );\n      if (rows.length === 0) return 'All exported symbols have docstrings.';\n      const lines = [`Exported symbols missing docstrings (${rows.length}):\\n`];\n      let lastFile = '';\n      for (const r of rows) {\n        if (r.file_path !== lastFile) { lines.push(`\\n${r.file_path}`); lastFile = r.file_path; }\n        lines.push(`  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 line ${r.start_line}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_god_class': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 20);\n      const rows = rawDb.all(\n        `SELECT n.name, n.file_path, n.start_line, COUNT(e.target) as member_count\n         FROM nodes n JOIN edges e ON e.source = n.id AND e.kind = 'contains'\n         WHERE n.kind IN ('class','interface')\n         GROUP BY n.id HAVING member_count > 0\n         ORDER BY member_count DESC LIMIT ?`,\n        [limitN]\n      );\n      if (rows.length === 0) return 'No class definitions found.';\n      const threshold = (args.threshold as number) ?? 10;\n      const gods = rows.filter((r: any) => r.member_count >= threshold);\n      const lines = [\n        `Classes ranked by member count (threshold: ${threshold}):\\n`,\n        ...rows.map((r: any) => `${r.member_count >= threshold ? '\u26A0 ' : '  '}${r.member_count.toString().padStart(4)} members  \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`),\n      ];\n      if (gods.length > 0) lines.unshift(`${gods.length} god class(es) found (\u2265${threshold} members).\\n`);\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_inheritance_depth': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 20);\n      // BFS from root classes down the extends/implements hierarchy\n      const allNodes = rawDb.all(\n        `SELECT id, name, file_path, start_line FROM nodes WHERE kind IN ('class','interface')`,\n        []\n      );\n      const childToParents: Map<string, string[]> = new Map();\n      const extEdges = rawDb.all(\n        `SELECT source, target FROM edges WHERE kind IN ('extends','implements')`,\n        []\n      );\n      for (const e of extEdges) {\n        if (!childToParents.has(e.source)) childToParents.set(e.source, []);\n        childToParents.get(e.source)!.push(e.target);\n      }\n      // Compute depth per node via memoized DFS\n      const depths = new Map<string, number>();\n      function depth(id: string): number {\n        if (depths.has(id)) return depths.get(id)!;\n        const parents = childToParents.get(id) ?? [];\n        const d = parents.length === 0 ? 0 : 1 + Math.max(...parents.map(depth));\n        depths.set(id, d);\n        return d;\n      }\n      for (const n of allNodes) depth(n.id);\n      const sorted = allNodes\n        .map((n: any) => ({ ...n, depth: depths.get(n.id) ?? 0 }))\n        .filter((n: any) => n.depth > 0)\n        .sort((a: any, b: any) => b.depth - a.depth)\n        .slice(0, limitN);\n      if (sorted.length === 0) return 'No inheritance hierarchies found.';\n      return `Deepest inheritance chains (${sorted.length}):\\n\\n` +\n        sorted.map((n: any) => `  depth ${n.depth}  \\`${n.name}\\` \u2014 ${n.file_path}:${n.start_line}`).join('\\n');\n    }\n\n    case 'kirograph_recursion': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 30);\n      // Direct recursion: node calls itself\n      const direct = rawDb.all(\n        `SELECT n.name, n.kind, n.file_path, n.start_line FROM nodes n\n         JOIN edges e ON e.source = n.id AND e.target = n.id AND e.kind = 'calls'\n         WHERE n.kind IN ('function','method')\n         ORDER BY n.file_path, n.start_line LIMIT ?`,\n        [Math.ceil(limitN / 2)]\n      );\n      // Mutual recursion via SCCs on call graph (simple 2-cycle detection)\n      const mutual = rawDb.all(\n        `SELECT n1.name as a, n2.name as b, n1.file_path, n1.start_line FROM edges e1\n         JOIN edges e2 ON e1.target = e2.source AND e2.target = e1.source\n         JOIN nodes n1 ON n1.id = e1.source JOIN nodes n2 ON n2.id = e2.source\n         WHERE e1.kind = 'calls' AND e2.kind = 'calls' AND e1.source < e2.source\n         ORDER BY n1.name LIMIT ?`,\n        [Math.ceil(limitN / 2)]\n      );\n      if (direct.length === 0 && mutual.length === 0) return 'No recursive functions detected.';\n      const lines = [];\n      if (direct.length > 0) {\n        lines.push(`Direct recursion (${direct.length}):\\n`);\n        for (const r of direct) lines.push(`  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`);\n      }\n      if (mutual.length > 0) {\n        if (lines.length > 0) lines.push('');\n        lines.push(`Mutual recursion (${mutual.length} pairs):\\n`);\n        for (const r of mutual) lines.push(`  \\`${r.a}\\` \u2194 \\`${r.b}\\` \u2014 ${r.file_path}:${r.start_line}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_largest': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 30);\n      const rows = rawDb.all(\n        `SELECT name, kind, file_path, start_line, (end_line - start_line + 1) as loc\n         FROM nodes WHERE end_line IS NOT NULL AND end_line > start_line\n         ORDER BY loc DESC LIMIT ?`,\n        [limitN]\n      );\n      if (rows.length === 0) return 'No symbol size data available.';\n      return `Largest symbols by lines of code (${rows.length}):\\n\\n` +\n        rows.map((r: any) => `  ${r.loc.toString().padStart(5)} LOC  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`).join('\\n');\n    }\n\n    case 'kirograph_rank': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 30);\n      const by = (args.by as string) ?? 'fan-in';\n      let rows: any[];\n      if (by === 'fan-out') {\n        rows = rawDb.all(\n          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.target) as score\n           FROM nodes n JOIN edges e ON e.source = n.id AND e.kind = 'calls'\n           GROUP BY n.id ORDER BY score DESC LIMIT ?`,\n          [limitN]\n        );\n      } else {\n        rows = rawDb.all(\n          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.source) as score\n           FROM nodes n JOIN edges e ON e.target = n.id AND e.kind IN ('calls','imports')\n           GROUP BY n.id ORDER BY score DESC LIMIT ?`,\n          [limitN]\n        );\n      }\n      if (rows.length === 0) return `No ${by} data available.`;\n      return `Symbols ranked by ${by} (${rows.length}):\\n\\n` +\n        rows.map((r: any) => `  ${r.score.toString().padStart(5)}  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`).join('\\n');\n    }\n\n    case 'kirograph_distribution': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const pathArg = args.path as string | undefined;\n      let rows: any[];\n      if (pathArg) {\n        rows = rawDb.all(\n          `SELECT kind, COUNT(*) as count FROM nodes WHERE file_path LIKE ?\n           GROUP BY kind ORDER BY count DESC`,\n          [pathArg.replace(/\\/$/, '') + '%']\n        );\n      } else {\n        rows = rawDb.all(`SELECT kind, COUNT(*) as count FROM nodes GROUP BY kind ORDER BY count DESC`, []);\n      }\n      if (rows.length === 0) return 'No symbols found.';\n      const total = rows.reduce((s: number, r: any) => s + r.count, 0);\n      const lines = [`Symbol distribution${pathArg ? ` in \"${pathArg}\"` : ''} (${total} total):\\n`];\n      for (const r of rows) {\n        const pct = ((r.count / total) * 100).toFixed(1);\n        lines.push(`  ${r.count.toString().padStart(6)}  (${pct.padStart(5)}%)  ${r.kind}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_annotations': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 50);\n      const decorator = args.decorator as string | undefined;\n      let rows: any[];\n      if (decorator) {\n        rows = rawDb.all(\n          `SELECT name, kind, file_path, start_line, decorators FROM nodes\n           WHERE decorators LIKE ? ORDER BY file_path, start_line LIMIT ?`,\n          [`%${decorator}%`, limitN]\n        );\n      } else {\n        // Histogram of decorators\n        const all = rawDb.all(`SELECT decorators FROM nodes WHERE decorators IS NOT NULL AND decorators != '[]'`, []);\n        const hist = new Map<string, number>();\n        for (const r of all) {\n          try {\n            const decs: string[] = JSON.parse(r.decorators);\n            for (const d of decs) hist.set(d, (hist.get(d) ?? 0) + 1);\n          } catch { /* skip */ }\n        }\n        if (hist.size === 0) return 'No decorators/annotations found.';\n        const sorted = [...hist.entries()].sort((a, b) => b[1] - a[1]).slice(0, limitN);\n        return `Decorator/annotation histogram (${hist.size} unique):\\n\\n` +\n          sorted.map(([d, n]) => `  ${n.toString().padStart(5)}  @${d}`).join('\\n');\n      }\n      if (rows.length === 0) return `No symbols with decorator \"${decorator}\" found.`;\n      return `Symbols with @${decorator} (${rows.length}):\\n\\n` +\n        rows.map((r: any) => `  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`).join('\\n');\n    }\n\n    case 'kirograph_session_start': {\n      const sm = cg.createSnapshotManager();\n      const snapshot = sm.save('session-baseline');\n      return `Session baseline saved: ${snapshot.nodeCount} symbols, ${snapshot.edgeCount} edges.\\nUse kirograph_session_end to see what changed.`;\n    }\n\n    case 'kirograph_session_end': {\n      const sm = cg.createSnapshotManager();\n      const snapshots = sm.list();\n      const baseline = snapshots.find(s => s.label === 'session-baseline');\n      if (!baseline) return 'No session baseline found. Run kirograph_session_start first.';\n      const current = sm.save(`session-end-${Date.now()}`);\n      const nodeDelta = current.nodeCount - baseline.nodeCount;\n      const edgeDelta = current.edgeCount - baseline.edgeCount;\n      const lines = [\n        `Session delta (since ${new Date(baseline.timestamp).toISOString().slice(0, 19).replace('T', ' ')}):`,\n        `  Symbols: ${baseline.nodeCount} \u2192 ${current.nodeCount} (${nodeDelta >= 0 ? '+' : ''}${nodeDelta})`,\n        `  Edges:   ${baseline.edgeCount} \u2192 ${current.edgeCount} (${edgeDelta >= 0 ? '+' : ''}${edgeDelta})`,\n      ];\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_unused_imports': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 50);\n      const rows = rawDb.all(\n        `SELECT n.* FROM nodes n\n         LEFT JOIN edges e ON e.source = n.id AND e.kind != 'contains'\n         WHERE n.kind = 'import'\n         GROUP BY n.id HAVING COUNT(e.id) = 0\n         ORDER BY n.file_path, n.start_line LIMIT ?`,\n        [limitN]\n      );\n      if (rows.length === 0) return 'No unused imports detected.';\n      const lines = [`Unused imports (${rows.length}):\\n`];\n      let lastFile = '';\n      for (const r of rows) {\n        if (r.file_path !== lastFile) { lines.push(`\\n${r.file_path}`); lastFile = r.file_path; }\n        lines.push(`  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 line ${r.start_line}`);\n      }\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_gini': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const metric = (args.metric as string) ?? 'loc';\n      let values: number[];\n      let rows: any[];\n\n      if (metric === 'loc') {\n        rows = rawDb.all(\n          `SELECT name, kind, file_path, start_line, (end_line - start_line + 1) as val\n           FROM nodes\n           WHERE kind IN ('function','method') AND end_line IS NOT NULL AND end_line >= start_line\n           ORDER BY val DESC`,\n          []\n        );\n      } else if (metric === 'fan-out') {\n        rows = rawDb.all(\n          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.target) as val\n           FROM nodes n LEFT JOIN edges e ON e.source = n.id AND e.kind = 'calls'\n           WHERE n.kind IN ('function','method')\n           GROUP BY n.id ORDER BY val DESC`,\n          []\n        );\n      } else {\n        // fan-in\n        rows = rawDb.all(\n          `SELECT n.name, n.kind, n.file_path, n.start_line, COUNT(e.source) as val\n           FROM nodes n LEFT JOIN edges e ON e.target = n.id AND e.kind IN ('calls','imports','references')\n           WHERE n.kind IN ('function','method')\n           GROUP BY n.id ORDER BY val DESC`,\n          []\n        );\n      }\n\n      if (rows.length < 2) return 'Not enough function/method nodes to compute Gini coefficient.';\n\n      values = rows.map((r: any) => Number(r.val));\n      const n = values.length;\n      const sum = values.reduce((a, b) => a + b, 0);\n\n      let gini = 0;\n      if (sum > 0) {\n        const sorted = [...values].sort((a, b) => a - b);\n        const numerator = sorted.reduce((acc, x, i) => acc + (2 * (i + 1) - n - 1) * x, 0);\n        gini = numerator / (n * sum);\n      }\n\n      const top5 = rows.slice(0, 5);\n      const bottom5 = rows.slice(-5).reverse();\n\n      const lines = [\n        `Gini coefficient for ${metric} across ${n} function/method nodes: ${gini.toFixed(4)}`,\n        `(0 = perfect equality, 1 = total inequality)\\n`,\n        `Top 5 by ${metric}:`,\n        ...top5.map((r: any) => `  ${String(r.val).padStart(6)}  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`),\n        `\\nBottom 5 by ${metric}:`,\n        ...bottom5.map((r: any) => `  ${String(r.val).padStart(6)}  ${mapKind(r.kind)} \\`${r.name}\\` \u2014 ${r.file_path}:${r.start_line}`),\n      ];\n      return lines.join('\\n');\n    }\n\n    case 'kirograph_dependency_depth': {\n      const rawDb = cg.getDatabase().getRawDb();\n      const limitN = clampLimit(args.limit as number | undefined, 20);\n\n      // Get all distinct file paths\n      const fileRows = rawDb.all(`SELECT DISTINCT file_path FROM nodes ORDER BY file_path`, []);\n      const files: string[] = fileRows.map((r: any) => r.file_path);\n      if (files.length === 0) return 'No files found in index.';\n\n      // Get file-level import edges (source file imports target file)\n      const edgeRows = rawDb.all(\n        `SELECT DISTINCT n1.file_path as src, n2.file_path as tgt\n         FROM edges e\n         JOIN nodes n1 ON n1.id = e.source\n         JOIN nodes n2 ON n2.id = e.target\n         WHERE e.kind = 'imports' AND n1.file_path != n2.file_path`,\n        []\n      );\n\n      // Build adjacency + in-degree for Kahn's algorithm\n      const outEdges = new Map<string, Set<string>>();\n      const inDegree = new Map<string, number>();\n      for (const f of files) { outEdges.set(f, new Set()); inDegree.set(f, 0); }\n      for (const e of edgeRows) {\n        outEdges.get(e.src)?.add(e.tgt);\n        inDegree.set(e.tgt, (inDegree.get(e.tgt) ?? 0) + 1);\n      }\n\n      // Kahn's \u2014 assign levels (longest path from a root)\n      const level = new Map<string, number>();\n      const queue: string[] = [];\n      for (const f of files) {\n        if ((inDegree.get(f) ?? 0) === 0) { queue.push(f); level.set(f, 0); }\n      }\n      while (queue.length > 0) {\n        const cur = queue.shift()!;\n        const curLevel = level.get(cur) ?? 0;\n        for (const nb of (outEdges.get(cur) ?? [])) {\n          const newLevel = curLevel + 1;\n          if ((level.get(nb) ?? -1) < newLevel) level.set(nb, newLevel);\n          const deg = (inDegree.get(nb) ?? 1) - 1;\n          inDegree.set(nb, deg);\n          if (deg === 0) queue.push(nb);\n        }\n      }\n\n      const sorted = files\n        .map(f => ({ file: f, depth: level.get(f) ?? 0 }))\n        .sort((a, b) => b.depth - a.depth)\n        .slice(0, limitN);\n\n      const lines = [`File dependency depths (deepest first, limit ${limitN}):\\n`];\n      for (const { file, depth } of sorted) {\n        const sample = rawDb.all(\n          `SELECT name, kind FROM nodes WHERE file_path = ? AND kind IN ('function','class','interface','method') LIMIT 3`,\n          [file]\n        );\n        const symbols = sample.map((r: any) => `\\`${r.name}\\``).join(', ');\n        lines.push(`  depth ${String(depth).padStart(3)}  ${file}${symbols ? `  (${symbols})` : ''}`);\n      }\n      return lines.join('\\n');\n    }\n\n    default:\n      return `Unknown tool: ${toolName}`;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,mBAA8C;AAE9C,eAAsB,iBAAiB,UAAkB,MAA+B,IAAgC;AACtH,UAAQ,UAAU;AAAA,IAChB,KAAK,uBAAuB;AAC1B,YAAM,YAAQ,yBAAW,KAAK,OAA6B,EAAE;AAC7D,YAAM,OAAO,GAAG,aAAa,KAAK;AAClC,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,aAAO,wBAAwB,KAAK,MAAM;AAAA,IACxC,KAAK,IAAI,OAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,QAAQ,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,IAAI;AAAA,IAChG;AAAA,IAEA,KAAK,2BAA2B;AAC9B,YAAM,SAAS,GAAG,yBAAyB;AAC3C,UAAI,OAAO,WAAW,EAAG,QAAO;AAChC,aAAO,SAAS,OAAO,MAAM;AAAA,IAC3B,OAAO,IAAI,CAAC,OAAO,MAAM,SAAS,IAAI,CAAC,KAAK,MAAM,KAAK,UAAK,CAAC,EAAE,EAAE,KAAK,IAAI;AAAA,IAC9E;AAAA,IAEA,KAAK,kBAAkB;AACrB,YAAM,cAAc,GAAG,YAAY,KAAK,MAAgB,QAAW,CAAC;AACpE,YAAM,YAAY,GAAG,YAAY,KAAK,IAAc,QAAW,CAAC;AAChE,UAAI,YAAY,WAAW,EAAG,QAAO,WAAW,KAAK,IAAI;AACzD,UAAI,UAAU,WAAW,EAAG,QAAO,WAAW,KAAK,EAAE;AACrD,YAAM,WAAW,YAAY,CAAC,EAAE;AAChC,YAAM,SAAS,UAAU,CAAC,EAAE;AAC5B,YAAM,YAAY,MAAM,GAAG,SAAS,SAAS,IAAI,OAAO,EAAE;AAC1D,UAAI,UAAU,WAAW,EAAG,QAAO,2BAA2B,SAAS,IAAI,YAAY,OAAO,IAAI;AAClG,aAAO,eAAe,SAAS,IAAI,WAAW,OAAO,IAAI,OAAO,UAAU,MAAM;AAAA,IAC9E,UAAU,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,QAAQ,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,IAAI;AAAA,IAClH;AAAA,IAEA,KAAK,4BAA4B;AAC/B,YAAM,UAAU,GAAG,YAAY,KAAK,QAAkB,QAAW,CAAC;AAClE,UAAI,QAAQ,WAAW,EAAG,QAAO,WAAW,KAAK,MAAM;AACvD,YAAM,OAAO,QAAQ,CAAC,EAAE;AACxB,YAAM,YAAa,KAAK,aAAwC;AAChE,YAAM,YAAY,GAAG,iBAAiB,KAAK,IAAI,SAAS;AACxD,UAAI,UAAU,WAAW,EAAG,QAAO,iCAAiC,KAAK,IAAI;AAC7E,aAAO,wBAAwB,KAAK,IAAI,kBAAkB,SAAS;AAAA,IACjE,UAAU,IAAI,OAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,QAAQ,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,IAAI;AAAA,IACrG;AAAA,IAEA,KAAK,sBAAsB;AACzB,YAAM,YAAQ,yBAAW,KAAK,OAA6B,EAAE;AAC7D,YAAM,WAAW,GAAG,aAAa,KAAK;AACtC,UAAI,SAAS,WAAW,EAAG,QAAO;AAClC,YAAM,QAAQ,CAAC,OAAO,SAAS,MAAM;AAAA,CAA6C;AAClF,iBAAW,KAAK,UAAU;AACxB,cAAM,KAAK,OAAG,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,oBAAe,EAAE,MAAM,SAAS,EAAE,QAAQ,UAAU,EAAE,SAAS,GAAG;AAC3G,cAAM,KAAK,WAAW,EAAE,QAAQ,IAAI,EAAE,SAAS,EAAE;AAAA,MACnD;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,wBAAwB;AAC3B,YAAM,YAAQ,yBAAW,KAAK,OAA6B,EAAE;AAC7D,YAAM,cAAc,GAAG,0BAA0B,KAAK;AACtD,UAAI,YAAY,WAAW,EAAG,QAAO;AACrC,YAAM,QAAQ,CAAC,OAAO,YAAY,MAAM;AAAA,CAAuC;AAC/E,iBAAW,KAAK,aAAa;AAC3B,cAAM,KAAK,OAAG,sBAAQ,EAAE,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,IAAI,MAAM,EAAE,IAAI,cAAK,sBAAQ,EAAE,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,QAAQ,CAAC,CAAC,GAAG;AACpJ,cAAM,KAAK,KAAK,EAAE,OAAO,QAAQ,WAAM,EAAE,OAAO,QAAQ,EAAE;AAAA,MAC5D;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,kBAAkB;AACrB,YAAM,KAAK,GAAG,sBAAsB;AACpC,YAAM,WAAW,KAAK,WAClB,GAAG,KAAK,KAAK,QAAkB,IAC/B,GAAG,WAAW;AAClB,UAAI,CAAC,UAAU;AACb,eAAO,KAAK,WACR,aAAa,KAAK,QAAQ,6EAC1B;AAAA,MACN;AACA,YAAM,OAAO,GAAG,KAAK,UAAU,GAAG,gBAAgB,CAAC;AACnD,YAAM,WAAW,IAAI,KAAK,KAAK,KAAK,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,GAAG;AAC1F,YAAM,QAAQ;AAAA,QACZ,gBAAgB,KAAK,KAAK,KAAK,MAAM,QAAQ;AAAA,QAC7C;AAAA,QACA,aAAa,KAAK,WAAW,MAAM,YAAY,KAAK,aAAa,MAAM;AAAA,QACvE,aAAa,KAAK,WAAW,MAAM,YAAY,KAAK,aAAa,MAAM;AAAA,MACzE;AACA,UAAI,KAAK,WAAW,SAAS,GAAG;AAC9B,cAAM,KAAK;AAAA,oBAAuB,KAAK,WAAW,MAAM,GAAG;AAC3D,mBAAW,KAAK,KAAK,WAAW,MAAM,GAAG,EAAE,GAAG;AAC5C,gBAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,QAAQ,EAAE;AAAA,QACjE;AACA,YAAI,KAAK,WAAW,SAAS,GAAI,OAAM,KAAK,eAAU,KAAK,WAAW,SAAS,EAAE,OAAO;AAAA,MAC1F;AACA,UAAI,KAAK,aAAa,SAAS,GAAG;AAChC,cAAM,KAAK;AAAA,sBAAyB,KAAK,aAAa,MAAM,GAAG;AAC/D,mBAAW,KAAK,KAAK,aAAa,MAAM,GAAG,EAAE,GAAG;AAC9C,gBAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,QAAQ,EAAE;AAAA,QACjE;AACA,YAAI,KAAK,aAAa,SAAS,GAAI,OAAM,KAAK,eAAU,KAAK,aAAa,SAAS,EAAE,OAAO;AAAA,MAC9F;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,2BAA2B;AAC9B,YAAM,KAAK,GAAG,sBAAsB;AACpC,YAAM,WAAW,GAAG,KAAK,KAAK,KAA2B;AACzD,aAAO,oBAAoB,SAAS,KAAK,YAAO,SAAS,SAAS,aAAa,SAAS,SAAS;AAAA,IACnG;AAAA,IAEA,KAAK,2BAA2B;AAC9B,YAAM,KAAK,GAAG,sBAAsB;AACpC,YAAM,YAAY,GAAG,KAAK;AAC1B,UAAI,UAAU,WAAW,EAAG,QAAO;AACnC,YAAM,QAAQ,CAAC,oBAAoB,UAAU,MAAM;AAAA,CAAM;AACzD,iBAAW,KAAK,WAAW;AACzB,cAAM,OAAO,IAAI,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,GAAG;AAC9E,cAAM,KAAK,KAAK,EAAE,KAAK,MAAM,IAAI,KAAK,EAAE,SAAS,aAAa,EAAE,SAAS,SAAS;AAAA,MACpF;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,wBAAwB;AAC3B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,UAAU,KAAK;AACrB,UAAI;AACJ,UAAI,SAAS;AACX,cAAM,QAAQ,QAAQ,SAAS,KAAK,KAAK,QAAQ,SAAS,KAAK,KAAK,QAAQ,SAAS,GAAG;AACxF,eAAO,QACH,MAAM,IAAI,mFAAmF,CAAC,OAAO,CAAC,IACtG,MAAM,IAAI,sFAAsF,CAAC,QAAQ,QAAQ,OAAO,EAAE,IAAI,IAAI,CAAC;AAAA,MACzI,OAAO;AACL,eAAO,MAAM,IAAI,0EAA0E;AAAA,MAC7F;AACA,UAAI,KAAK,WAAW,EAAG,QAAO,UAAU,iCAAiC,OAAO,OAAO;AACvF,YAAM,YAAQ,yBAAW,KAAK,OAA6B,GAAG;AAC9D,YAAM,UAAU,KAAK,MAAM,GAAG,KAAK;AACnC,YAAM,QAAQ,CAAC,uBAAuB,UAAU,SAAS,OAAO,MAAM,EAAE,KAAK,QAAQ,MAAM,GAAG,KAAK,SAAS,QAAQ,IAAI,KAAK,MAAM,KAAK,EAAE;AAAA,CAAc;AACxJ,UAAI,WAAW;AACf,iBAAW,KAAK,SAAS;AACvB,YAAI,EAAE,cAAc,UAAU;AAAE,gBAAM,KAAK;AAAA,EAAK,EAAE,SAAS,EAAE;AAAG,qBAAW,EAAE;AAAA,QAAW;AACxF,cAAM,MAAM,EAAE,YAAY,KAAK,EAAE,SAAS,KAAK;AAC/C,cAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,GAAG,EAAE;AAAA,MACvD;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,4BAA4B;AAC/B,YAAM,UAAU,GAAG,YAAY,KAAK,QAAkB,QAAW,CAAC;AAClE,UAAI,QAAQ,WAAW,EAAG,QAAO,WAAW,KAAK,MAAM;AACvD,YAAM,OAAO,QAAQ,CAAC,EAAE;AACxB,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA,QAIA,CAAC,KAAK,EAAE;AAAA,MACV;AACA,UAAI,KAAK,WAAW,EAAG,QAAO,sBAAsB,KAAK,IAAI;AAC7D,YAAM,QAAQ;AAAA,QACZ,wBAAwB,KAAK,IAAI,WAAO,sBAAQ,KAAK,IAAI,CAAC;AAAA,QAC1D,eAAe,KAAK,QAAQ,IAAI,KAAK,SAAS;AAAA,QAC9C;AAAA,EAAK,KAAK,MAAM;AAAA;AAAA,MAClB;AACA,UAAI,WAAW;AACf,iBAAW,KAAK,MAAM;AACpB,YAAI,EAAE,cAAc,UAAU;AAAE,gBAAM,KAAK;AAAA,EAAK,EAAE,SAAS,EAAE;AAAG,qBAAW,EAAE;AAAA,QAAW;AACxF,cAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,YAAY,EAAE,UAAU,SAAS,EAAE,SAAS,GAAG;AAAA,MAC5F;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,0BAA0B;AAC7B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA,QAIA,CAAC,MAAM;AAAA,MACT;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAM,QAAQ,CAAC,wCAAwC,KAAK,MAAM;AAAA,CAAM;AACxE,UAAI,WAAW;AACf,iBAAW,KAAK,MAAM;AACpB,YAAI,EAAE,cAAc,UAAU;AAAE,gBAAM,KAAK;AAAA,EAAK,EAAE,SAAS,EAAE;AAAG,qBAAW,EAAE;AAAA,QAAW;AACxF,cAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,kBAAa,EAAE,UAAU,EAAE;AAAA,MACxE;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,uBAAuB;AAC1B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA;AAAA,QAKA,CAAC,MAAM;AAAA,MACT;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAM,YAAa,KAAK,aAAwB;AAChD,YAAM,OAAO,KAAK,OAAO,CAAC,MAAW,EAAE,gBAAgB,SAAS;AAChE,YAAM,QAAQ;AAAA,QACZ,8CAA8C,SAAS;AAAA;AAAA,QACvD,GAAG,KAAK,IAAI,CAAC,MAAW,GAAG,EAAE,gBAAgB,YAAY,YAAO,IAAI,GAAG,EAAE,aAAa,SAAS,EAAE,SAAS,CAAC,CAAC,eAAe,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MACxK;AACA,UAAI,KAAK,SAAS,EAAG,OAAM,QAAQ,GAAG,KAAK,MAAM,+BAA0B,SAAS;AAAA,CAAc;AAClG,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,+BAA+B;AAmBlC,UAASA,SAAT,SAAe,IAAoB;AACjC,YAAI,OAAO,IAAI,EAAE,EAAG,QAAO,OAAO,IAAI,EAAE;AACxC,cAAM,UAAU,eAAe,IAAI,EAAE,KAAK,CAAC;AAC3C,cAAM,IAAI,QAAQ,WAAW,IAAI,IAAI,IAAI,KAAK,IAAI,GAAG,QAAQ,IAAIA,MAAK,CAAC;AACvE,eAAO,IAAI,IAAI,CAAC;AAChB,eAAO;AAAA,MACT;AANS,kBAAAA;AAlBT,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAE9D,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA,CAAC;AAAA,MACH;AACA,YAAM,iBAAwC,oBAAI,IAAI;AACtD,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA,CAAC;AAAA,MACH;AACA,iBAAW,KAAK,UAAU;AACxB,YAAI,CAAC,eAAe,IAAI,EAAE,MAAM,EAAG,gBAAe,IAAI,EAAE,QAAQ,CAAC,CAAC;AAClE,uBAAe,IAAI,EAAE,MAAM,EAAG,KAAK,EAAE,MAAM;AAAA,MAC7C;AAEA,YAAM,SAAS,oBAAI,IAAoB;AAQvC,iBAAW,KAAK,SAAU,CAAAA,OAAM,EAAE,EAAE;AACpC,YAAM,SAAS,SACZ,IAAI,CAAC,OAAY,EAAE,GAAG,GAAG,OAAO,OAAO,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,EACxD,OAAO,CAAC,MAAW,EAAE,QAAQ,CAAC,EAC9B,KAAK,CAAC,GAAQ,MAAW,EAAE,QAAQ,EAAE,KAAK,EAC1C,MAAM,GAAG,MAAM;AAClB,UAAI,OAAO,WAAW,EAAG,QAAO;AAChC,aAAO,+BAA+B,OAAO,MAAM;AAAA;AAAA,IACjD,OAAO,IAAI,CAAC,MAAW,WAAW,EAAE,KAAK,OAAO,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE,EAAE,KAAK,IAAI;AAAA,IAC1G;AAAA,IAEA,KAAK,uBAAuB;AAC1B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAE9D,YAAM,SAAS,MAAM;AAAA,QACnB;AAAA;AAAA;AAAA;AAAA,QAIA,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,MACxB;AAEA,YAAM,SAAS,MAAM;AAAA,QACnB;AAAA;AAAA;AAAA;AAAA;AAAA,QAKA,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,MACxB;AACA,UAAI,OAAO,WAAW,KAAK,OAAO,WAAW,EAAG,QAAO;AACvD,YAAM,QAAQ,CAAC;AACf,UAAI,OAAO,SAAS,GAAG;AACrB,cAAM,KAAK,qBAAqB,OAAO,MAAM;AAAA,CAAM;AACnD,mBAAW,KAAK,OAAQ,OAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MAC1G;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,YAAI,MAAM,SAAS,EAAG,OAAM,KAAK,EAAE;AACnC,cAAM,KAAK,qBAAqB,OAAO,MAAM;AAAA,CAAY;AACzD,mBAAW,KAAK,OAAQ,OAAM,KAAK,OAAO,EAAE,CAAC,eAAU,EAAE,CAAC,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MACjG;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,qBAAqB;AACxB,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA,QAGA,CAAC,MAAM;AAAA,MACT;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,aAAO,qCAAqC,KAAK,MAAM;AAAA;AAAA,IACrD,KAAK,IAAI,CAAC,MAAW,KAAK,EAAE,IAAI,SAAS,EAAE,SAAS,CAAC,CAAC,aAAS,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE,EAAE,KAAK,IAAI;AAAA,IAC9I;AAAA,IAEA,KAAK,kBAAkB;AACrB,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,KAAM,KAAK,MAAiB;AAClC,UAAI;AACJ,UAAI,OAAO,WAAW;AACpB,eAAO,MAAM;AAAA,UACX;AAAA;AAAA;AAAA,UAGA,CAAC,MAAM;AAAA,QACT;AAAA,MACF,OAAO;AACL,eAAO,MAAM;AAAA,UACX;AAAA;AAAA;AAAA,UAGA,CAAC,MAAM;AAAA,QACT;AAAA,MACF;AACA,UAAI,KAAK,WAAW,EAAG,QAAO,MAAM,EAAE;AACtC,aAAO,qBAAqB,EAAE,KAAK,KAAK,MAAM;AAAA;AAAA,IAC5C,KAAK,IAAI,CAAC,MAAW,KAAK,EAAE,MAAM,SAAS,EAAE,SAAS,CAAC,CAAC,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE,EAAE,KAAK,IAAI;AAAA,IAC5I;AAAA,IAEA,KAAK,0BAA0B;AAC7B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,UAAU,KAAK;AACrB,UAAI;AACJ,UAAI,SAAS;AACX,eAAO,MAAM;AAAA,UACX;AAAA;AAAA,UAEA,CAAC,QAAQ,QAAQ,OAAO,EAAE,IAAI,GAAG;AAAA,QACnC;AAAA,MACF,OAAO;AACL,eAAO,MAAM,IAAI,+EAA+E,CAAC,CAAC;AAAA,MACpG;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAM,QAAQ,KAAK,OAAO,CAAC,GAAW,MAAW,IAAI,EAAE,OAAO,CAAC;AAC/D,YAAM,QAAQ,CAAC,sBAAsB,UAAU,QAAQ,OAAO,MAAM,EAAE,KAAK,KAAK;AAAA,CAAY;AAC5F,iBAAW,KAAK,MAAM;AACpB,cAAM,OAAQ,EAAE,QAAQ,QAAS,KAAK,QAAQ,CAAC;AAC/C,cAAM,KAAK,KAAK,EAAE,MAAM,SAAS,EAAE,SAAS,CAAC,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE;AAAA,MACpF;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,yBAAyB;AAC5B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,YAAY,KAAK;AACvB,UAAI;AACJ,UAAI,WAAW;AACb,eAAO,MAAM;AAAA,UACX;AAAA;AAAA,UAEA,CAAC,IAAI,SAAS,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF,OAAO;AAEL,cAAM,MAAM,MAAM,IAAI,oFAAoF,CAAC,CAAC;AAC5G,cAAM,OAAO,oBAAI,IAAoB;AACrC,mBAAW,KAAK,KAAK;AACnB,cAAI;AACF,kBAAM,OAAiB,KAAK,MAAM,EAAE,UAAU;AAC9C,uBAAW,KAAK,KAAM,MAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC;AAAA,UAC1D,QAAQ;AAAA,UAAa;AAAA,QACvB;AACA,YAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,cAAM,SAAS,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;AAC9E,eAAO,mCAAmC,KAAK,IAAI;AAAA;AAAA,IACjD,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,KAAK,IAAI;AAAA,MAC5E;AACA,UAAI,KAAK,WAAW,EAAG,QAAO,8BAA8B,SAAS;AACrE,aAAO,iBAAiB,SAAS,KAAK,KAAK,MAAM;AAAA;AAAA,IAC/C,KAAK,IAAI,CAAC,MAAW,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE,EAAE,KAAK,IAAI;AAAA,IACzG;AAAA,IAEA,KAAK,2BAA2B;AAC9B,YAAM,KAAK,GAAG,sBAAsB;AACpC,YAAM,WAAW,GAAG,KAAK,kBAAkB;AAC3C,aAAO,2BAA2B,SAAS,SAAS,aAAa,SAAS,SAAS;AAAA;AAAA,IACrF;AAAA,IAEA,KAAK,yBAAyB;AAC5B,YAAM,KAAK,GAAG,sBAAsB;AACpC,YAAM,YAAY,GAAG,KAAK;AAC1B,YAAM,WAAW,UAAU,KAAK,OAAK,EAAE,UAAU,kBAAkB;AACnE,UAAI,CAAC,SAAU,QAAO;AACtB,YAAM,UAAU,GAAG,KAAK,eAAe,KAAK,IAAI,CAAC,EAAE;AACnD,YAAM,YAAY,QAAQ,YAAY,SAAS;AAC/C,YAAM,YAAY,QAAQ,YAAY,SAAS;AAC/C,YAAM,QAAQ;AAAA,QACZ,wBAAwB,IAAI,KAAK,SAAS,SAAS,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,EAAE,QAAQ,KAAK,GAAG,CAAC;AAAA,QACjG,cAAc,SAAS,SAAS,WAAM,QAAQ,SAAS,KAAK,aAAa,IAAI,MAAM,EAAE,GAAG,SAAS;AAAA,QACjG,cAAc,SAAS,SAAS,WAAM,QAAQ,SAAS,KAAK,aAAa,IAAI,MAAM,EAAE,GAAG,SAAS;AAAA,MACnG;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,4BAA4B;AAC/B,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAC9D,YAAM,OAAO,MAAM;AAAA,QACjB;AAAA;AAAA;AAAA;AAAA;AAAA,QAKA,CAAC,MAAM;AAAA,MACT;AACA,UAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,YAAM,QAAQ,CAAC,mBAAmB,KAAK,MAAM;AAAA,CAAM;AACnD,UAAI,WAAW;AACf,iBAAW,KAAK,MAAM;AACpB,YAAI,EAAE,cAAc,UAAU;AAAE,gBAAM,KAAK;AAAA,EAAK,EAAE,SAAS,EAAE;AAAG,qBAAW,EAAE;AAAA,QAAW;AACxF,cAAM,KAAK,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,kBAAa,EAAE,UAAU,EAAE;AAAA,MACxE;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,kBAAkB;AACrB,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,SAAU,KAAK,UAAqB;AAC1C,UAAI;AACJ,UAAI;AAEJ,UAAI,WAAW,OAAO;AACpB,eAAO,MAAM;AAAA,UACX;AAAA;AAAA;AAAA;AAAA,UAIA,CAAC;AAAA,QACH;AAAA,MACF,WAAW,WAAW,WAAW;AAC/B,eAAO,MAAM;AAAA,UACX;AAAA;AAAA;AAAA;AAAA,UAIA,CAAC;AAAA,QACH;AAAA,MACF,OAAO;AAEL,eAAO,MAAM;AAAA,UACX;AAAA;AAAA;AAAA;AAAA,UAIA,CAAC;AAAA,QACH;AAAA,MACF;AAEA,UAAI,KAAK,SAAS,EAAG,QAAO;AAE5B,eAAS,KAAK,IAAI,CAAC,MAAW,OAAO,EAAE,GAAG,CAAC;AAC3C,YAAM,IAAI,OAAO;AACjB,YAAM,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAE5C,UAAI,OAAO;AACX,UAAI,MAAM,GAAG;AACX,cAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC/C,cAAM,YAAY,OAAO,OAAO,CAAC,KAAK,GAAG,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC;AACjF,eAAO,aAAa,IAAI;AAAA,MAC1B;AAEA,YAAM,OAAO,KAAK,MAAM,GAAG,CAAC;AAC5B,YAAM,UAAU,KAAK,MAAM,EAAE,EAAE,QAAQ;AAEvC,YAAM,QAAQ;AAAA,QACZ,wBAAwB,MAAM,WAAW,CAAC,2BAA2B,KAAK,QAAQ,CAAC,CAAC;AAAA,QACpF;AAAA;AAAA,QACA,YAAY,MAAM;AAAA,QAClB,GAAG,KAAK,IAAI,CAAC,MAAW,KAAK,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,QAC3H;AAAA,cAAiB,MAAM;AAAA,QACvB,GAAG,QAAQ,IAAI,CAAC,MAAW,KAAK,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,SAAK,sBAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,aAAQ,EAAE,SAAS,IAAI,EAAE,UAAU,EAAE;AAAA,MAChI;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA,KAAK,8BAA8B;AACjC,YAAM,QAAQ,GAAG,YAAY,EAAE,SAAS;AACxC,YAAM,aAAS,yBAAW,KAAK,OAA6B,EAAE;AAG9D,YAAM,WAAW,MAAM,IAAI,2DAA2D,CAAC,CAAC;AACxF,YAAM,QAAkB,SAAS,IAAI,CAAC,MAAW,EAAE,SAAS;AAC5D,UAAI,MAAM,WAAW,EAAG,QAAO;AAG/B,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA;AAAA;AAAA;AAAA;AAAA,QAKA,CAAC;AAAA,MACH;AAGA,YAAM,WAAW,oBAAI,IAAyB;AAC9C,YAAM,WAAW,oBAAI,IAAoB;AACzC,iBAAW,KAAK,OAAO;AAAE,iBAAS,IAAI,GAAG,oBAAI,IAAI,CAAC;AAAG,iBAAS,IAAI,GAAG,CAAC;AAAA,MAAG;AACzE,iBAAW,KAAK,UAAU;AACxB,iBAAS,IAAI,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG;AAC9B,iBAAS,IAAI,EAAE,MAAM,SAAS,IAAI,EAAE,GAAG,KAAK,KAAK,CAAC;AAAA,MACpD;AAGA,YAAM,QAAQ,oBAAI,IAAoB;AACtC,YAAM,QAAkB,CAAC;AACzB,iBAAW,KAAK,OAAO;AACrB,aAAK,SAAS,IAAI,CAAC,KAAK,OAAO,GAAG;AAAE,gBAAM,KAAK,CAAC;AAAG,gBAAM,IAAI,GAAG,CAAC;AAAA,QAAG;AAAA,MACtE;AACA,aAAO,MAAM,SAAS,GAAG;AACvB,cAAM,MAAM,MAAM,MAAM;AACxB,cAAM,WAAW,MAAM,IAAI,GAAG,KAAK;AACnC,mBAAW,MAAO,SAAS,IAAI,GAAG,KAAK,CAAC,GAAI;AAC1C,gBAAM,WAAW,WAAW;AAC5B,eAAK,MAAM,IAAI,EAAE,KAAK,MAAM,SAAU,OAAM,IAAI,IAAI,QAAQ;AAC5D,gBAAM,OAAO,SAAS,IAAI,EAAE,KAAK,KAAK;AACtC,mBAAS,IAAI,IAAI,GAAG;AACpB,cAAI,QAAQ,EAAG,OAAM,KAAK,EAAE;AAAA,QAC9B;AAAA,MACF;AAEA,YAAM,SAAS,MACZ,IAAI,QAAM,EAAE,MAAM,GAAG,OAAO,MAAM,IAAI,CAAC,KAAK,EAAE,EAAE,EAChD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,MAAM;AAElB,YAAM,QAAQ,CAAC,gDAAgD,MAAM;AAAA,CAAM;AAC3E,iBAAW,EAAE,MAAM,OAAAA,OAAM,KAAK,QAAQ;AACpC,cAAM,SAAS,MAAM;AAAA,UACnB;AAAA,UACA,CAAC,IAAI;AAAA,QACP;AACA,cAAM,UAAU,OAAO,IAAI,CAAC,MAAW,KAAK,EAAE,IAAI,IAAI,EAAE,KAAK,IAAI;AACjE,cAAM,KAAK,WAAW,OAAOA,MAAK,EAAE,SAAS,CAAC,CAAC,KAAK,IAAI,GAAG,UAAU,MAAM,OAAO,MAAM,EAAE,EAAE;AAAA,MAC9F;AACA,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAAA,IAEA;AACE,aAAO,iBAAiB,QAAQ;AAAA,EACpC;AACF;",
+  "names": ["depth"]
+}