scip-query 0.1.0

package/dist/chunk-JKP5GH6T.js

@@ -0,0 +1,213 @@
+import {
+  buildFileDepGraph
+} from "./chunk-FUHJCHS4.js";
+
+// src/queries/similar-chains.ts
+function similarChains(db, opts = {}) {
+  const {
+    minSimilarity = 0.5,
+    limit = 15,
+    scope,
+    minChainLength = 3,
+    maxChainLength = 8
+  } = opts;
+  const graph = buildFileDepGraph(db, scope);
+  const rawChains = generateChains(graph, minChainLength, maxChainLength);
+  if (rawChains.length === 0) return [];
+  const nodeFreq = /* @__PURE__ */ new Map();
+  const tailFreq = /* @__PURE__ */ new Map();
+  for (const chain of rawChains) {
+    const seen = /* @__PURE__ */ new Set();
+    for (const node of chain) {
+      if (!seen.has(node)) {
+        nodeFreq.set(node, (nodeFreq.get(node) ?? 0) + 1);
+        seen.add(node);
+      }
+    }
+    for (let t = Math.max(0, chain.length - 2); t < chain.length; t++) {
+      tailFreq.set(chain[t], (tailFreq.get(chain[t]) ?? 0) + 1);
+    }
+  }
+  const infraThreshold = rawChains.length * 0.4;
+  const tailThreshold = rawChains.length * 0.3;
+  const infraNodes = /* @__PURE__ */ new Set();
+  for (const [node, freq] of nodeFreq) {
+    if (freq > infraThreshold) infraNodes.add(node);
+  }
+  for (const [node, freq] of tailFreq) {
+    if (freq > tailThreshold) infraNodes.add(node);
+  }
+  const structuralNames = ["index.ts", "index.js", "cli.ts", "main.ts", "health.ts", "health.js"];
+  for (const node of nodeFreq.keys()) {
+    const basename = node.split("/").pop() ?? "";
+    if (structuralNames.includes(basename)) infraNodes.add(node);
+  }
+  const filteredChains = [];
+  for (const chain of rawChains) {
+    const filtered = chain.filter((n) => !infraNodes.has(n));
+    if (filtered.length >= 3) {
+      filteredChains.push({ original: chain, filtered });
+    }
+  }
+  if (filteredChains.length < 2) return [];
+  const results = [];
+  for (let i = 0; i < filteredChains.length; i++) {
+    for (let j = i + 1; j < filteredChains.length; j++) {
+      const a = filteredChains[i];
+      const b = filteredChains[j];
+      const setA = new Set(a.filtered);
+      let hasShared = false;
+      for (const node of b.filtered) {
+        if (setA.has(node)) {
+          hasShared = true;
+          break;
+        }
+      }
+      if (!hasShared) continue;
+      const { distance, ops } = editDistance(a.filtered, b.filtered);
+      const maxLen = Math.max(a.filtered.length, b.filtered.length);
+      if (maxLen === 0) continue;
+      const similarity = 1 - distance / maxLen;
+      if (similarity < minSimilarity) continue;
+      if (distance === 0) continue;
+      const divergencePoints = ops.filter((op) => op.type === "substitute").map((op) => ({
+        index: op.indexA,
+        nodeA: a.filtered[op.indexA],
+        nodeB: b.filtered[op.indexB]
+      }));
+      if (divergencePoints.length === 0) continue;
+      const matchCount = ops.filter((op) => op.type === "match").length;
+      if (matchCount < 2) continue;
+      const commonPrefix = getCommonPrefix(a.original, b.original);
+      const commonSuffix = getCommonSuffix(a.original, b.original);
+      results.push({
+        chainA: a.original,
+        chainB: b.original,
+        similarity,
+        editDistance: distance,
+        divergencePoints,
+        commonPrefix,
+        commonSuffix
+      });
+    }
+    if (results.length > limit * 10) break;
+  }
+  results.sort((a, b) => {
+    if (Math.abs(b.similarity - a.similarity) > 0.01) return b.similarity - a.similarity;
+    return a.divergencePoints.length - b.divergencePoints.length;
+  });
+  const deduped = [];
+  for (const r of results) {
+    const isDuplicate = deduped.some(
+      (existing) => isSubChain(r.chainA, existing.chainA) && isSubChain(r.chainB, existing.chainB)
+    );
+    if (!isDuplicate) deduped.push(r);
+    if (deduped.length >= limit) break;
+  }
+  return deduped;
+}
+function generateChains(graph, minLen, maxLen) {
+  const chains = [];
+  const maxChains = 500;
+  for (const startNode of graph.keys()) {
+    if (chains.length >= maxChains) break;
+    dfsChains(graph, startNode, [startNode], /* @__PURE__ */ new Set([startNode]), minLen, maxLen, chains, maxChains);
+  }
+  return chains;
+}
+function dfsChains(graph, node, path, visited, minLen, maxLen, results, maxResults) {
+  if (results.length >= maxResults) return;
+  if (path.length >= maxLen) {
+    if (path.length >= minLen) results.push([...path]);
+    return;
+  }
+  const neighbors = graph.get(node);
+  if (!neighbors || neighbors.size === 0) {
+    if (path.length >= minLen) results.push([...path]);
+    return;
+  }
+  let extended = false;
+  for (const next of neighbors) {
+    if (visited.has(next)) continue;
+    visited.add(next);
+    path.push(next);
+    dfsChains(graph, next, path, visited, minLen, maxLen, results, maxResults);
+    path.pop();
+    visited.delete(next);
+    extended = true;
+    if (results.length >= maxResults) return;
+  }
+  if (!extended && path.length >= minLen) {
+    results.push([...path]);
+  }
+}
+function editDistance(a, b) {
+  const m = a.length;
+  const n = b.length;
+  const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+  for (let i2 = 0; i2 <= m; i2++) dp[i2][0] = i2;
+  for (let j2 = 0; j2 <= n; j2++) dp[0][j2] = j2;
+  for (let i2 = 1; i2 <= m; i2++) {
+    for (let j2 = 1; j2 <= n; j2++) {
+      if (a[i2 - 1] === b[j2 - 1]) {
+        dp[i2][j2] = dp[i2 - 1][j2 - 1];
+      } else {
+        dp[i2][j2] = 1 + Math.min(
+          dp[i2 - 1][j2],
+          dp[i2][j2 - 1],
+          dp[i2 - 1][j2 - 1]
+        );
+      }
+    }
+  }
+  const ops = [];
+  let i = m, j = n;
+  while (i > 0 || j > 0) {
+    if (i > 0 && j > 0 && a[i - 1] === b[j - 1]) {
+      ops.unshift({ type: "match", indexA: i - 1, indexB: j - 1 });
+      i--;
+      j--;
+    } else if (i > 0 && j > 0 && dp[i][j] === dp[i - 1][j - 1] + 1) {
+      ops.unshift({ type: "substitute", indexA: i - 1, indexB: j - 1 });
+      i--;
+      j--;
+    } else if (j > 0 && dp[i][j] === dp[i][j - 1] + 1) {
+      ops.unshift({ type: "insert", indexA: i, indexB: j - 1 });
+      j--;
+    } else {
+      ops.unshift({ type: "delete", indexA: i - 1, indexB: j });
+      i--;
+    }
+  }
+  return { distance: dp[m][n], ops };
+}
+function getCommonPrefix(a, b) {
+  const prefix = [];
+  for (let i = 0; i < Math.min(a.length, b.length); i++) {
+    if (a[i] === b[i]) prefix.push(a[i]);
+    else break;
+  }
+  return prefix;
+}
+function getCommonSuffix(a, b) {
+  const suffix = [];
+  let ai = a.length - 1;
+  let bi = b.length - 1;
+  while (ai >= 0 && bi >= 0 && a[ai] === b[bi]) {
+    suffix.unshift(a[ai]);
+    ai--;
+    bi--;
+  }
+  return suffix;
+}
+function isSubChain(sub, full) {
+  if (sub.length > full.length) return false;
+  const fullStr = full.join("\u2192");
+  const subStr = sub.join("\u2192");
+  return fullStr.includes(subStr);
+}
+
+export {
+  similarChains
+};
+//# sourceMappingURL=chunk-JKP5GH6T.js.map

package/dist/chunk-JKP5GH6T.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queries/similar-chains.ts"],"sourcesContent":["import type { ScipDatabase } from '../db.js';\nimport { buildFileDepGraph } from '../query-support.js';\nimport type { SimilarChainResult } from '../types.js';\n\n/**\n * Find end-to-end dependency flows that are structurally similar\n * but diverge at a few points — indicating duplicated pipelines\n * that could be consolidated.\n *\n * Uses infrastructure-filtered chain comparison:\n *\n * 1. Build all dependency chains via DFS\n * 2. Compute node frequency across all chains\n * 3. Filter out infrastructure nodes (appearing in >50% of chains)\n * 4. Compare the filtered chains — what's left is the unique pipeline\n * 5. Edit distance on filtered chains finds real structural duplicates\n *\n * Two chains that both pass through db.ts → types.ts is meaningless.\n * Two chains that both pass through userValidation → userRepo → emailService\n * after filtering is a strong consolidation signal.\n */\nexport function similarChains(\n  db: ScipDatabase,\n  opts: {\n    minSimilarity?: number;\n    limit?: number;\n    scope?: string;\n    minChainLength?: number;\n    maxChainLength?: number;\n  } = {},\n): SimilarChainResult[] {\n  const {\n    minSimilarity = 0.5,\n    limit = 15,\n    scope,\n    minChainLength = 3,\n    maxChainLength = 8,\n  } = opts;\n\n  const graph = buildFileDepGraph(db, scope);\n  const rawChains = generateChains(graph, minChainLength, maxChainLength);\n\n  if (rawChains.length === 0) return [];\n\n  // Compute node frequency to identify infrastructure.\n  // Count both general frequency (appears anywhere in chain) and\n  // tail frequency (appears as one of the last 2 nodes). Shared\n  // tails like \"→ db.ts → types.ts\" are infrastructure even if\n  // they don't appear in >50% of chains overall.\n  const nodeFreq = new Map<string, number>();\n  const tailFreq = new Map<string, number>();\n  for (const chain of rawChains) {\n    const seen = new Set<string>();\n    for (const node of chain) {\n      if (!seen.has(node)) {\n        nodeFreq.set(node, (nodeFreq.get(node) ?? 0) + 1);\n        seen.add(node);\n      }\n    }\n    // Track tail nodes (last 2)\n    for (let t = Math.max(0, chain.length - 2); t < chain.length; t++) {\n      tailFreq.set(chain[t]!, (tailFreq.get(chain[t]!) ?? 0) + 1);\n    }\n  }\n\n  // Infrastructure: nodes in >40% of chains OR tail nodes in >30% of chains\n  const infraThreshold = rawChains.length * 0.4;\n  const tailThreshold = rawChains.length * 0.3;\n  const infraNodes = new Set<string>();\n  for (const [node, freq] of nodeFreq) {\n    if (freq > infraThreshold) infraNodes.add(node);\n  }\n  for (const [node, freq] of tailFreq) {\n    if (freq > tailThreshold) infraNodes.add(node);\n  }\n\n  // Also treat structural role files as infrastructure — entry points,\n  // barrels, and orchestrators are not meaningful pipeline nodes.\n  const structuralNames = ['index.ts', 'index.js', 'cli.ts', 'main.ts', 'health.ts', 'health.js'];\n  for (const node of nodeFreq.keys()) {\n    const basename = node.split('/').pop() ?? '';\n    if (structuralNames.includes(basename)) infraNodes.add(node);\n  }\n\n  // Filter chains: remove infrastructure nodes, keep the \"unique pipeline\"\n  const filteredChains: { original: string[]; filtered: string[] }[] = [];\n  for (const chain of rawChains) {\n    const filtered = chain.filter((n) => !infraNodes.has(n));\n    // Only keep chains that have at least 3 non-infrastructure nodes.\n    // Chains with 1-2 unique nodes are just \"query → infra\" which is\n    // the expected pattern, not a consolidation opportunity.\n    if (filtered.length >= 3) {\n      filteredChains.push({ original: chain, filtered });\n    }\n  }\n\n  if (filteredChains.length < 2) return [];\n\n  // Pairwise comparison on filtered chains\n  const results: SimilarChainResult[] = [];\n\n  for (let i = 0; i < filteredChains.length; i++) {\n    for (let j = i + 1; j < filteredChains.length; j++) {\n      const a = filteredChains[i]!;\n      const b = filteredChains[j]!;\n\n      // Quick reject: filtered chains must share at least one non-infra node\n      const setA = new Set(a.filtered);\n      let hasShared = false;\n      for (const node of b.filtered) {\n        if (setA.has(node)) { hasShared = true; break; }\n      }\n      if (!hasShared) continue;\n\n      // Edit distance on the FILTERED chains (infrastructure stripped)\n      const { distance, ops } = editDistance(a.filtered, b.filtered);\n      const maxLen = Math.max(a.filtered.length, b.filtered.length);\n      if (maxLen === 0) continue;\n\n      const similarity = 1 - distance / maxLen;\n      if (similarity < minSimilarity) continue;\n      if (distance === 0) continue; // identical filtered chains = not interesting\n\n      // Divergence points from the filtered comparison\n      const divergencePoints = ops\n        .filter((op) => op.type === 'substitute')\n        .map((op) => ({\n          index: op.indexA,\n          nodeA: a.filtered[op.indexA]!,\n          nodeB: b.filtered[op.indexB]!,\n        }));\n\n      if (divergencePoints.length === 0) continue;\n\n      // Require at least 2 matching (non-divergent) filtered nodes.\n      // A chain pair with 1 match and 1 divergence is just \"two things\n      // that share one dependency\" — not a duplicated pipeline.\n      const matchCount = ops.filter((op) => op.type === 'match').length;\n      if (matchCount < 2) continue;\n\n      // Report using original chains for context, but similarity is from filtered\n      const commonPrefix = getCommonPrefix(a.original, b.original);\n      const commonSuffix = getCommonSuffix(a.original, b.original);\n\n      results.push({\n        chainA: a.original,\n        chainB: b.original,\n        similarity,\n        editDistance: distance,\n        divergencePoints,\n        commonPrefix,\n        commonSuffix,\n      });\n    }\n\n    if (results.length > limit * 10) break;\n  }\n\n  // Sort by similarity desc, then fewest divergence points\n  results.sort((a, b) => {\n    if (Math.abs(b.similarity - a.similarity) > 0.01) return b.similarity - a.similarity;\n    return a.divergencePoints.length - b.divergencePoints.length;\n  });\n\n  // Deduplicate sub-chains\n  const deduped: SimilarChainResult[] = [];\n  for (const r of results) {\n    const isDuplicate = deduped.some(\n      (existing) =>\n        isSubChain(r.chainA, existing.chainA) && isSubChain(r.chainB, existing.chainB),\n    );\n    if (!isDuplicate) deduped.push(r);\n    if (deduped.length >= limit) break;\n  }\n\n  return deduped;\n}\n\n// ── Chain generation ───────────────────────────────────────\n\nfunction generateChains(\n  graph: Map<string, Set<string>>,\n  minLen: number,\n  maxLen: number,\n): string[][] {\n  const chains: string[][] = [];\n  const maxChains = 500;\n\n  for (const startNode of graph.keys()) {\n    if (chains.length >= maxChains) break;\n    dfsChains(graph, startNode, [startNode], new Set([startNode]), minLen, maxLen, chains, maxChains);\n  }\n\n  return chains;\n}\n\nfunction dfsChains(\n  graph: Map<string, Set<string>>,\n  node: string,\n  path: string[],\n  visited: Set<string>,\n  minLen: number,\n  maxLen: number,\n  results: string[][],\n  maxResults: number,\n): void {\n  if (results.length >= maxResults) return;\n  if (path.length >= maxLen) {\n    if (path.length >= minLen) results.push([...path]);\n    return;\n  }\n\n  const neighbors = graph.get(node);\n  if (!neighbors || neighbors.size === 0) {\n    if (path.length >= minLen) results.push([...path]);\n    return;\n  }\n\n  let extended = false;\n  for (const next of neighbors) {\n    if (visited.has(next)) continue;\n    visited.add(next);\n    path.push(next);\n    dfsChains(graph, next, path, visited, minLen, maxLen, results, maxResults);\n    path.pop();\n    visited.delete(next);\n    extended = true;\n    if (results.length >= maxResults) return;\n  }\n\n  if (!extended && path.length >= minLen) {\n    results.push([...path]);\n  }\n}\n\n// ── Edit distance ──────────────────────────────────────────\n\ninterface EditOp {\n  type: 'match' | 'substitute' | 'insert' | 'delete';\n  indexA: number;\n  indexB: number;\n}\n\nfunction editDistance(a: string[], b: string[]): { distance: number; ops: EditOp[] } {\n  const m = a.length;\n  const n = b.length;\n\n  const dp: number[][] = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));\n  for (let i = 0; i <= m; i++) dp[i]![0] = i;\n  for (let j = 0; j <= n; j++) dp[0]![j] = j;\n\n  for (let i = 1; i <= m; i++) {\n    for (let j = 1; j <= n; j++) {\n      if (a[i - 1] === b[j - 1]) {\n        dp[i]![j] = dp[i - 1]![j - 1]!;\n      } else {\n        dp[i]![j] = 1 + Math.min(\n          dp[i - 1]![j]!,\n          dp[i]![j - 1]!,\n          dp[i - 1]![j - 1]!,\n        );\n      }\n    }\n  }\n\n  const ops: EditOp[] = [];\n  let i = m, j = n;\n  while (i > 0 || j > 0) {\n    if (i > 0 && j > 0 && a[i - 1] === b[j - 1]) {\n      ops.unshift({ type: 'match', indexA: i - 1, indexB: j - 1 });\n      i--; j--;\n    } else if (i > 0 && j > 0 && dp[i]![j] === dp[i - 1]![j - 1]! + 1) {\n      ops.unshift({ type: 'substitute', indexA: i - 1, indexB: j - 1 });\n      i--; j--;\n    } else if (j > 0 && dp[i]![j] === dp[i]![j - 1]! + 1) {\n      ops.unshift({ type: 'insert', indexA: i, indexB: j - 1 });\n      j--;\n    } else {\n      ops.unshift({ type: 'delete', indexA: i - 1, indexB: j });\n      i--;\n    }\n  }\n\n  return { distance: dp[m]![n]!, ops };\n}\n\n// ── Utility ────────────────────────────────────────────────\n\nfunction getCommonPrefix(a: string[], b: string[]): string[] {\n  const prefix: string[] = [];\n  for (let i = 0; i < Math.min(a.length, b.length); i++) {\n    if (a[i] === b[i]) prefix.push(a[i]!);\n    else break;\n  }\n  return prefix;\n}\n\nfunction getCommonSuffix(a: string[], b: string[]): string[] {\n  const suffix: string[] = [];\n  let ai = a.length - 1;\n  let bi = b.length - 1;\n  while (ai >= 0 && bi >= 0 && a[ai] === b[bi]) {\n    suffix.unshift(a[ai]!);\n    ai--; bi--;\n  }\n  return suffix;\n}\n\nfunction isSubChain(sub: string[], full: string[]): boolean {\n  if (sub.length > full.length) return false;\n  const fullStr = full.join('→');\n  const subStr = sub.join('→');\n  return fullStr.includes(subStr);\n}\n"],"mappings":";;;;;AAqBO,SAAS,cACd,IACA,OAMI,CAAC,GACiB;AACtB,QAAM;AAAA,IACJ,gBAAgB;AAAA,IAChB,QAAQ;AAAA,IACR;AAAA,IACA,iBAAiB;AAAA,IACjB,iBAAiB;AAAA,EACnB,IAAI;AAEJ,QAAM,QAAQ,kBAAkB,IAAI,KAAK;AACzC,QAAM,YAAY,eAAe,OAAO,gBAAgB,cAAc;AAEtE,MAAI,UAAU,WAAW,EAAG,QAAO,CAAC;AAOpC,QAAM,WAAW,oBAAI,IAAoB;AACzC,QAAM,WAAW,oBAAI,IAAoB;AACzC,aAAW,SAAS,WAAW;AAC7B,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,iBAAS,IAAI,OAAO,SAAS,IAAI,IAAI,KAAK,KAAK,CAAC;AAChD,aAAK,IAAI,IAAI;AAAA,MACf;AAAA,IACF;AAEA,aAAS,IAAI,KAAK,IAAI,GAAG,MAAM,SAAS,CAAC,GAAG,IAAI,MAAM,QAAQ,KAAK;AACjE,eAAS,IAAI,MAAM,CAAC,IAAK,SAAS,IAAI,MAAM,CAAC,CAAE,KAAK,KAAK,CAAC;AAAA,IAC5D;AAAA,EACF;AAGA,QAAM,iBAAiB,UAAU,SAAS;AAC1C,QAAM,gBAAgB,UAAU,SAAS;AACzC,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,CAAC,MAAM,IAAI,KAAK,UAAU;AACnC,QAAI,OAAO,eAAgB,YAAW,IAAI,IAAI;AAAA,EAChD;AACA,aAAW,CAAC,MAAM,IAAI,KAAK,UAAU;AACnC,QAAI,OAAO,cAAe,YAAW,IAAI,IAAI;AAAA,EAC/C;AAIA,QAAM,kBAAkB,CAAC,YAAY,YAAY,UAAU,WAAW,aAAa,WAAW;AAC9F,aAAW,QAAQ,SAAS,KAAK,GAAG;AAClC,UAAM,WAAW,KAAK,MAAM,GAAG,EAAE,IAAI,KAAK;AAC1C,QAAI,gBAAgB,SAAS,QAAQ,EAAG,YAAW,IAAI,IAAI;AAAA,EAC7D;AAGA,QAAM,iBAA+D,CAAC;AACtE,aAAW,SAAS,WAAW;AAC7B,UAAM,WAAW,MAAM,OAAO,CAAC,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;AAIvD,QAAI,SAAS,UAAU,GAAG;AACxB,qBAAe,KAAK,EAAE,UAAU,OAAO,SAAS,CAAC;AAAA,IACnD;AAAA,EACF;AAEA,MAAI,eAAe,SAAS,EAAG,QAAO,CAAC;AAGvC,QAAM,UAAgC,CAAC;AAEvC,WAAS,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAC9C,aAAS,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;AAClD,YAAM,IAAI,eAAe,CAAC;AAC1B,YAAM,IAAI,eAAe,CAAC;AAG1B,YAAM,OAAO,IAAI,IAAI,EAAE,QAAQ;AAC/B,UAAI,YAAY;AAChB,iBAAW,QAAQ,EAAE,UAAU;AAC7B,YAAI,KAAK,IAAI,IAAI,GAAG;AAAE,sBAAY;AAAM;AAAA,QAAO;AAAA,MACjD;AACA,UAAI,CAAC,UAAW;AAGhB,YAAM,EAAE,UAAU,IAAI,IAAI,aAAa,EAAE,UAAU,EAAE,QAAQ;AAC7D,YAAM,SAAS,KAAK,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AAC5D,UAAI,WAAW,EAAG;AAElB,YAAM,aAAa,IAAI,WAAW;AAClC,UAAI,aAAa,cAAe;AAChC,UAAI,aAAa,EAAG;AAGpB,YAAM,mBAAmB,IACtB,OAAO,CAAC,OAAO,GAAG,SAAS,YAAY,EACvC,IAAI,CAAC,QAAQ;AAAA,QACZ,OAAO,GAAG;AAAA,QACV,OAAO,EAAE,SAAS,GAAG,MAAM;AAAA,QAC3B,OAAO,EAAE,SAAS,GAAG,MAAM;AAAA,MAC7B,EAAE;AAEJ,UAAI,iBAAiB,WAAW,EAAG;AAKnC,YAAM,aAAa,IAAI,OAAO,CAAC,OAAO,GAAG,SAAS,OAAO,EAAE;AAC3D,UAAI,aAAa,EAAG;AAGpB,YAAM,eAAe,gBAAgB,EAAE,UAAU,EAAE,QAAQ;AAC3D,YAAM,eAAe,gBAAgB,EAAE,UAAU,EAAE,QAAQ;AAE3D,cAAQ,KAAK;AAAA,QACX,QAAQ,EAAE;AAAA,QACV,QAAQ,EAAE;AAAA,QACV;AAAA,QACA,cAAc;AAAA,QACd;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAEA,QAAI,QAAQ,SAAS,QAAQ,GAAI;AAAA,EACnC;AAGA,UAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,QAAI,KAAK,IAAI,EAAE,aAAa,EAAE,UAAU,IAAI,KAAM,QAAO,EAAE,aAAa,EAAE;AAC1E,WAAO,EAAE,iBAAiB,SAAS,EAAE,iBAAiB;AAAA,EACxD,CAAC;AAGD,QAAM,UAAgC,CAAC;AACvC,aAAW,KAAK,SAAS;AACvB,UAAM,cAAc,QAAQ;AAAA,MAC1B,CAAC,aACC,WAAW,EAAE,QAAQ,SAAS,MAAM,KAAK,WAAW,EAAE,QAAQ,SAAS,MAAM;AAAA,IACjF;AACA,QAAI,CAAC,YAAa,SAAQ,KAAK,CAAC;AAChC,QAAI,QAAQ,UAAU,MAAO;AAAA,EAC/B;AAEA,SAAO;AACT;AAIA,SAAS,eACP,OACA,QACA,QACY;AACZ,QAAM,SAAqB,CAAC;AAC5B,QAAM,YAAY;AAElB,aAAW,aAAa,MAAM,KAAK,GAAG;AACpC,QAAI,OAAO,UAAU,UAAW;AAChC,cAAU,OAAO,WAAW,CAAC,SAAS,GAAG,oBAAI,IAAI,CAAC,SAAS,CAAC,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AAAA,EAClG;AAEA,SAAO;AACT;AAEA,SAAS,UACP,OACA,MACA,MACA,SACA,QACA,QACA,SACA,YACM;AACN,MAAI,QAAQ,UAAU,WAAY;AAClC,MAAI,KAAK,UAAU,QAAQ;AACzB,QAAI,KAAK,UAAU,OAAQ,SAAQ,KAAK,CAAC,GAAG,IAAI,CAAC;AACjD;AAAA,EACF;AAEA,QAAM,YAAY,MAAM,IAAI,IAAI;AAChC,MAAI,CAAC,aAAa,UAAU,SAAS,GAAG;AACtC,QAAI,KAAK,UAAU,OAAQ,SAAQ,KAAK,CAAC,GAAG,IAAI,CAAC;AACjD;AAAA,EACF;AAEA,MAAI,WAAW;AACf,aAAW,QAAQ,WAAW;AAC5B,QAAI,QAAQ,IAAI,IAAI,EAAG;AACvB,YAAQ,IAAI,IAAI;AAChB,SAAK,KAAK,IAAI;AACd,cAAU,OAAO,MAAM,MAAM,SAAS,QAAQ,QAAQ,SAAS,UAAU;AACzE,SAAK,IAAI;AACT,YAAQ,OAAO,IAAI;AACnB,eAAW;AACX,QAAI,QAAQ,UAAU,WAAY;AAAA,EACpC;AAEA,MAAI,CAAC,YAAY,KAAK,UAAU,QAAQ;AACtC,YAAQ,KAAK,CAAC,GAAG,IAAI,CAAC;AAAA,EACxB;AACF;AAUA,SAAS,aAAa,GAAa,GAAkD;AACnF,QAAM,IAAI,EAAE;AACZ,QAAM,IAAI,EAAE;AAEZ,QAAM,KAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,MAAM,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;AAC/E,WAASA,KAAI,GAAGA,MAAK,GAAGA,KAAK,IAAGA,EAAC,EAAG,CAAC,IAAIA;AACzC,WAASC,KAAI,GAAGA,MAAK,GAAGA,KAAK,IAAG,CAAC,EAAGA,EAAC,IAAIA;AAEzC,WAASD,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,aAASC,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,UAAI,EAAED,KAAI,CAAC,MAAM,EAAEC,KAAI,CAAC,GAAG;AACzB,WAAGD,EAAC,EAAGC,EAAC,IAAI,GAAGD,KAAI,CAAC,EAAGC,KAAI,CAAC;AAAA,MAC9B,OAAO;AACL,WAAGD,EAAC,EAAGC,EAAC,IAAI,IAAI,KAAK;AAAA,UACnB,GAAGD,KAAI,CAAC,EAAGC,EAAC;AAAA,UACZ,GAAGD,EAAC,EAAGC,KAAI,CAAC;AAAA,UACZ,GAAGD,KAAI,CAAC,EAAGC,KAAI,CAAC;AAAA,QAClB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,MAAgB,CAAC;AACvB,MAAI,IAAI,GAAG,IAAI;AACf,SAAO,IAAI,KAAK,IAAI,GAAG;AACrB,QAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AAC3C,UAAI,QAAQ,EAAE,MAAM,SAAS,QAAQ,IAAI,GAAG,QAAQ,IAAI,EAAE,CAAC;AAC3D;AAAK;AAAA,IACP,WAAW,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC,EAAG,CAAC,MAAM,GAAG,IAAI,CAAC,EAAG,IAAI,CAAC,IAAK,GAAG;AACjE,UAAI,QAAQ,EAAE,MAAM,cAAc,QAAQ,IAAI,GAAG,QAAQ,IAAI,EAAE,CAAC;AAChE;AAAK;AAAA,IACP,WAAW,IAAI,KAAK,GAAG,CAAC,EAAG,CAAC,MAAM,GAAG,CAAC,EAAG,IAAI,CAAC,IAAK,GAAG;AACpD,UAAI,QAAQ,EAAE,MAAM,UAAU,QAAQ,GAAG,QAAQ,IAAI,EAAE,CAAC;AACxD;AAAA,IACF,OAAO;AACL,UAAI,QAAQ,EAAE,MAAM,UAAU,QAAQ,IAAI,GAAG,QAAQ,EAAE,CAAC;AACxD;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,UAAU,GAAG,CAAC,EAAG,CAAC,GAAI,IAAI;AACrC;AAIA,SAAS,gBAAgB,GAAa,GAAuB;AAC3D,QAAM,SAAmB,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK;AACrD,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO,KAAK,EAAE,CAAC,CAAE;AAAA,QAC/B;AAAA,EACP;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAa,GAAuB;AAC3D,QAAM,SAAmB,CAAC;AAC1B,MAAI,KAAK,EAAE,SAAS;AACpB,MAAI,KAAK,EAAE,SAAS;AACpB,SAAO,MAAM,KAAK,MAAM,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,GAAG;AAC5C,WAAO,QAAQ,EAAE,EAAE,CAAE;AACrB;AAAM;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,WAAW,KAAe,MAAyB;AAC1D,MAAI,IAAI,SAAS,KAAK,OAAQ,QAAO;AACrC,QAAM,UAAU,KAAK,KAAK,QAAG;AAC7B,QAAM,SAAS,IAAI,KAAK,QAAG;AAC3B,SAAO,QAAQ,SAAS,MAAM;AAChC;","names":["i","j"]}

package/dist/chunk-KCBMVQL5.js

@@ -0,0 +1,38 @@
+import {
+  cleanSignature
+} from "./chunk-4TYLS5XX.js";
+import {
+  shortenSymbol
+} from "./chunk-QOV2R2WT.js";
+
+// src/queries/symbols.ts
+function symbols(db, filePattern) {
+  const rows = db.all(
+    `SELECT
+      der.start_line,
+      der.end_line,
+      REPLACE(SUBSTR(gs.documentation, INSTR(gs.documentation, '|') + 1), char(10), ' ') AS sig,
+      gs.symbol,
+      d.relative_path
+    FROM defn_enclosing_ranges der
+    JOIN global_symbols gs ON der.symbol_id = gs.id
+    JOIN documents d ON der.document_id = d.id
+    WHERE d.relative_path LIKE ?
+      AND ${db.localSymbolPredicate}
+      ${db.symbolNoise}
+    ORDER BY der.start_line`,
+    `%${filePattern}%`
+  );
+  return rows.filter((r) => !db.isIgnored(r.relative_path)).map((r) => ({
+    startLine: r.start_line,
+    endLine: r.end_line,
+    symbol: r.symbol,
+    shortName: shortenSymbol(r.symbol),
+    signature: cleanSignature(r.sig)
+  }));
+}
+
+export {
+  symbols
+};
+//# sourceMappingURL=chunk-KCBMVQL5.js.map

package/dist/chunk-KCBMVQL5.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queries/symbols.ts"],"sourcesContent":["import type { ScipDatabase } from '../db.js';\nimport type { SymbolResult } from '../types.js';\nimport { shortenSymbol } from '../symbol-parser.js';\nimport { cleanSignature } from './clean-signature.js';\n\nexport function symbols(db: ScipDatabase, filePattern: string): SymbolResult[] {\n  const rows = db.all<{\n    start_line: number;\n    end_line: number;\n    sig: string | null;\n    symbol: string;\n    relative_path: string;\n  }>(\n    `SELECT\n      der.start_line,\n      der.end_line,\n      REPLACE(SUBSTR(gs.documentation, INSTR(gs.documentation, '|') + 1), char(10), ' ') AS sig,\n      gs.symbol,\n      d.relative_path\n    FROM defn_enclosing_ranges der\n    JOIN global_symbols gs ON der.symbol_id = gs.id\n    JOIN documents d ON der.document_id = d.id\n    WHERE d.relative_path LIKE ?\n      AND ${db.localSymbolPredicate}\n      ${db.symbolNoise}\n    ORDER BY der.start_line`,\n    `%${filePattern}%`,\n  );\n\n  return rows\n    .filter((r) => !db.isIgnored(r.relative_path))\n    .map((r) => ({\n      startLine: r.start_line,\n      endLine: r.end_line,\n      symbol: r.symbol,\n      shortName: shortenSymbol(r.symbol),\n      signature: cleanSignature(r.sig),\n    }));\n}\n"],"mappings":";;;;;;;;AAKO,SAAS,QAAQ,IAAkB,aAAqC;AAC7E,QAAM,OAAO,GAAG;AAAA,IAOd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAUQ,GAAG,oBAAoB;AAAA,QAC3B,GAAG,WAAW;AAAA;AAAA,IAElB,IAAI,WAAW;AAAA,EACjB;AAEA,SAAO,KACJ,OAAO,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,aAAa,CAAC,EAC5C,IAAI,CAAC,OAAO;AAAA,IACX,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,IACX,QAAQ,EAAE;AAAA,IACV,WAAW,cAAc,EAAE,MAAM;AAAA,IACjC,WAAW,eAAe,EAAE,GAAG;AAAA,EACjC,EAAE;AACN;","names":[]}

package/dist/chunk-KVSW5KYP.js

@@ -0,0 +1,78 @@
+// src/queries/coupling.ts
+function coupling(db, file1, file2) {
+  const row = db.get(
+    `SELECT COUNT(DISTINCT gs.id) AS shared
+    FROM global_symbols gs
+    WHERE (
+      -- Defined in file1, referenced in file2
+      EXISTS (
+        SELECT 1 FROM defn_enclosing_ranges der
+        JOIN documents d ON der.document_id = d.id
+        WHERE der.symbol_id = gs.id AND d.relative_path LIKE ?
+      )
+      AND EXISTS (
+        SELECT 1 FROM mentions m
+        JOIN chunks c ON m.chunk_id = c.id
+        JOIN documents d ON c.document_id = d.id
+        WHERE m.symbol_id = gs.id AND m.role = 0 AND d.relative_path LIKE ?
+      )
+    ) OR (
+      -- Defined in file2, referenced in file1
+      EXISTS (
+        SELECT 1 FROM defn_enclosing_ranges der
+        JOIN documents d ON der.document_id = d.id
+        WHERE der.symbol_id = gs.id AND d.relative_path LIKE ?
+      )
+      AND EXISTS (
+        SELECT 1 FROM mentions m
+        JOIN chunks c ON m.chunk_id = c.id
+        JOIN documents d ON c.document_id = d.id
+        WHERE m.symbol_id = gs.id AND m.role = 0 AND d.relative_path LIKE ?
+      )
+    )`,
+    `%${file1}%`,
+    `%${file2}%`,
+    `%${file2}%`,
+    `%${file1}%`
+  );
+  return {
+    file1,
+    file2,
+    sharedSymbols: row?.shared ?? 0
+  };
+}
+function topCoupling(db, opts = {}) {
+  const { limit = 20, scope } = opts;
+  const scopeFilter = scope ? `AND d1.relative_path LIKE '%${scope}%' AND d2.relative_path LIKE '%${scope}%'` : "";
+  const rows = db.all(
+    `SELECT
+      def_d.relative_path AS file1,
+      ref_d.relative_path AS file2,
+      COUNT(DISTINCT gs.id) AS shared
+    FROM mentions m
+    JOIN chunks c ON m.chunk_id = c.id
+    JOIN documents ref_d ON c.document_id = ref_d.id
+    JOIN global_symbols gs ON m.symbol_id = gs.id
+    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id
+    JOIN documents def_d ON der.document_id = def_d.id
+    WHERE m.role = 0
+      AND def_d.id != ref_d.id
+      ${db.pathExclusionsFor("def_d", "ref_d")}
+      ${scopeFilter}
+    GROUP BY def_d.id, ref_d.id
+    ORDER BY shared DESC
+    LIMIT ?`,
+    limit
+  );
+  return rows.filter((r) => !db.isIgnored(r.file1) && !db.isIgnored(r.file2)).map((r) => ({
+    file1: r.file1,
+    file2: r.file2,
+    sharedSymbols: r.shared
+  }));
+}
+
+export {
+  coupling,
+  topCoupling
+};
+//# sourceMappingURL=chunk-KVSW5KYP.js.map

package/dist/chunk-KVSW5KYP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queries/coupling.ts"],"sourcesContent":["import type { ScipDatabase } from '../db.js';\nimport type { CouplingResult } from '../types.js';\n\n/**\n * Measure coupling between two files: how many symbols do they share\n * (symbols defined in one and referenced in the other, or vice versa).\n */\nexport function coupling(\n  db: ScipDatabase,\n  file1: string,\n  file2: string,\n): CouplingResult {\n  const row = db.get<{ shared: number }>(\n    `SELECT COUNT(DISTINCT gs.id) AS shared\n    FROM global_symbols gs\n    WHERE (\n      -- Defined in file1, referenced in file2\n      EXISTS (\n        SELECT 1 FROM defn_enclosing_ranges der\n        JOIN documents d ON der.document_id = d.id\n        WHERE der.symbol_id = gs.id AND d.relative_path LIKE ?\n      )\n      AND EXISTS (\n        SELECT 1 FROM mentions m\n        JOIN chunks c ON m.chunk_id = c.id\n        JOIN documents d ON c.document_id = d.id\n        WHERE m.symbol_id = gs.id AND m.role = 0 AND d.relative_path LIKE ?\n      )\n    ) OR (\n      -- Defined in file2, referenced in file1\n      EXISTS (\n        SELECT 1 FROM defn_enclosing_ranges der\n        JOIN documents d ON der.document_id = d.id\n        WHERE der.symbol_id = gs.id AND d.relative_path LIKE ?\n      )\n      AND EXISTS (\n        SELECT 1 FROM mentions m\n        JOIN chunks c ON m.chunk_id = c.id\n        JOIN documents d ON c.document_id = d.id\n        WHERE m.symbol_id = gs.id AND m.role = 0 AND d.relative_path LIKE ?\n      )\n    )`,\n    `%${file1}%`, `%${file2}%`,\n    `%${file2}%`, `%${file1}%`,\n  );\n\n  return {\n    file1,\n    file2,\n    sharedSymbols: row?.shared ?? 0,\n  };\n}\n\n/**\n * Find the most coupled file pairs in the codebase.\n */\nexport function topCoupling(\n  db: ScipDatabase,\n  opts: { limit?: number; scope?: string } = {},\n): CouplingResult[] {\n  const { limit = 20, scope } = opts;\n  const scopeFilter = scope\n    ? `AND d1.relative_path LIKE '%${scope}%' AND d2.relative_path LIKE '%${scope}%'`\n    : '';\n\n  // Find file pairs that share the most symbols (one defines, other references)\n  const rows = db.all<{\n    file1: string;\n    file2: string;\n    shared: number;\n  }>(\n    `SELECT\n      def_d.relative_path AS file1,\n      ref_d.relative_path AS file2,\n      COUNT(DISTINCT gs.id) AS shared\n    FROM mentions m\n    JOIN chunks c ON m.chunk_id = c.id\n    JOIN documents ref_d ON c.document_id = ref_d.id\n    JOIN global_symbols gs ON m.symbol_id = gs.id\n    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id\n    JOIN documents def_d ON der.document_id = def_d.id\n    WHERE m.role = 0\n      AND def_d.id != ref_d.id\n      ${db.pathExclusionsFor('def_d', 'ref_d')}\n      ${scopeFilter}\n    GROUP BY def_d.id, ref_d.id\n    ORDER BY shared DESC\n    LIMIT ?`,\n    limit,\n  );\n\n  return rows\n    .filter((r) => !db.isIgnored(r.file1) && !db.isIgnored(r.file2))\n    .map((r) => ({\n      file1: r.file1,\n      file2: r.file2,\n      sharedSymbols: r.shared,\n    }));\n}\n"],"mappings":";AAOO,SAAS,SACd,IACA,OACA,OACgB;AAChB,QAAM,MAAM,GAAG;AAAA,IACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IA6BA,IAAI,KAAK;AAAA,IAAK,IAAI,KAAK;AAAA,IACvB,IAAI,KAAK;AAAA,IAAK,IAAI,KAAK;AAAA,EACzB;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,eAAe,KAAK,UAAU;AAAA,EAChC;AACF;AAKO,SAAS,YACd,IACA,OAA2C,CAAC,GAC1B;AAClB,QAAM,EAAE,QAAQ,IAAI,MAAM,IAAI;AAC9B,QAAM,cAAc,QAChB,+BAA+B,KAAK,kCAAkC,KAAK,OAC3E;AAGJ,QAAM,OAAO,GAAG;AAAA,IAKd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAYI,GAAG,kBAAkB,SAAS,OAAO,CAAC;AAAA,QACtC,WAAW;AAAA;AAAA;AAAA;AAAA,IAIf;AAAA,EACF;AAEA,SAAO,KACJ,OAAO,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,KAAK,KAAK,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,EAC9D,IAAI,CAAC,OAAO;AAAA,IACX,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,IACT,eAAe,EAAE;AAAA,EACnB,EAAE;AACN;","names":[]}

package/dist/chunk-LAWMH22O.js

@@ -0,0 +1,172 @@
+import {
+  shortenSymbol
+} from "./chunk-QOV2R2WT.js";
+
+// src/queries/by-kind.ts
+var KIND_NAMES = {
+  0: "UnspecifiedKind",
+  1: "AbstractMethod",
+  2: "Accessor",
+  3: "Array",
+  4: "Assertion",
+  5: "AssociatedType",
+  6: "Attribute",
+  7: "Axiom",
+  8: "Boolean",
+  9: "Class",
+  10: "Constant",
+  11: "Constructor",
+  12: "Contract",
+  13: "DataFamily",
+  14: "DefinitionMacro",
+  15: "Delegate",
+  16: "Enum",
+  17: "EnumMember",
+  18: "Error",
+  19: "Event",
+  20: "Fact",
+  21: "Field",
+  22: "File",
+  23: "Function",
+  24: "Getter",
+  25: "Grammar",
+  26: "Instance",
+  27: "Interface",
+  28: "Key",
+  29: "Lang",
+  30: "Lemma",
+  31: "Library",
+  32: "Macro",
+  33: "Method",
+  34: "MethodAlias",
+  35: "MethodReceiver",
+  36: "MethodSpecification",
+  37: "Message",
+  38: "Modifier",
+  39: "Module",
+  40: "Namespace",
+  41: "Null",
+  42: "Number",
+  43: "Object",
+  44: "Operator",
+  45: "Package",
+  46: "PackageObject",
+  47: "Parameter",
+  48: "ParameterLabel",
+  49: "Pattern",
+  50: "Predicate",
+  51: "Property",
+  52: "Protocol",
+  53: "ProtocolMethod",
+  54: "PureVirtualMethod",
+  55: "Quasiquoter",
+  56: "SelfParameter",
+  57: "Setter",
+  58: "Signature",
+  59: "SingletonClass",
+  60: "SingletonMethod",
+  61: "StaticDataMember",
+  62: "StaticEvent",
+  63: "StaticField",
+  64: "StaticMethod",
+  65: "StaticProperty",
+  66: "StaticVariable",
+  67: "String",
+  68: "Struct",
+  69: "Subscript",
+  70: "Tactic",
+  71: "Theorem",
+  72: "ThisParameter",
+  73: "Trait",
+  74: "TraitMethod",
+  75: "Type",
+  76: "TypeAlias",
+  77: "TypeClass",
+  78: "TypeClassMethod",
+  79: "TypeFamily",
+  80: "TypeParameter",
+  81: "Union",
+  82: "Value",
+  83: "Variable"
+};
+var KIND_BY_NAME = /* @__PURE__ */ new Map();
+for (const [k, v] of Object.entries(KIND_NAMES)) {
+  KIND_BY_NAME.set(v.toLowerCase(), Number(k));
+}
+function byKind(db, kindQuery, opts = {}) {
+  const { scope, limit = 100 } = opts;
+  let kindNum = null;
+  const asNum = parseInt(kindQuery, 10);
+  if (!isNaN(asNum)) {
+    kindNum = asNum;
+  } else {
+    kindNum = KIND_BY_NAME.get(kindQuery.toLowerCase()) ?? null;
+    if (kindNum === null) {
+      for (const [name, num] of KIND_BY_NAME) {
+        if (name.includes(kindQuery.toLowerCase())) {
+          kindNum = num;
+          break;
+        }
+      }
+    }
+  }
+  if (kindNum === null) {
+    return [];
+  }
+  const scopeFilter = scope ? `AND d.relative_path LIKE '%${scope}%'` : "";
+  const hasKinds = db.get(
+    `SELECT COUNT(*) AS c FROM global_symbols WHERE kind IS NOT NULL`
+  );
+  if (!hasKinds || hasKinds.c === 0) {
+    return [];
+  }
+  const rows = db.all(
+    `SELECT gs.symbol, gs.kind, d.relative_path, der.start_line, der.end_line
+    FROM global_symbols gs
+    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id
+    JOIN documents d ON der.document_id = d.id
+    WHERE gs.kind = ?
+      ${db.pathExclusionsFor("d")}
+      ${scopeFilter}
+    ORDER BY d.relative_path, der.start_line
+    LIMIT ?`,
+    kindNum,
+    limit
+  );
+  return rows.filter((r) => !db.isIgnored(r.relative_path)).map((r) => ({
+    symbol: r.symbol,
+    shortName: shortenSymbol(r.symbol),
+    kind: r.kind,
+    kindName: KIND_NAMES[r.kind] ?? "Unknown",
+    relativePath: r.relative_path,
+    startLine: r.start_line,
+    endLine: r.end_line
+  }));
+}
+function kindCounts(db, opts = {}) {
+  const scopeFilter = opts.scope ? `AND d.relative_path LIKE '%${opts.scope}%'` : "";
+  const rows = db.all(
+    `SELECT gs.kind, COUNT(*) AS cnt
+    FROM global_symbols gs
+    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id
+    JOIN documents d ON der.document_id = d.id
+    WHERE 1 = 1
+      ${db.pathExclusionsFor("d")}
+      AND gs.kind IS NOT NULL
+      AND gs.kind != 0
+      ${scopeFilter}
+    GROUP BY gs.kind
+    ORDER BY cnt DESC`
+  );
+  return rows.map((r) => ({
+    kind: r.kind,
+    kindName: KIND_NAMES[r.kind] ?? "Unknown",
+    count: r.cnt
+  }));
+}
+
+export {
+  byKind,
+  kindCounts
+};
+//# sourceMappingURL=chunk-LAWMH22O.js.map

package/dist/chunk-LAWMH22O.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queries/by-kind.ts"],"sourcesContent":["import type { ScipDatabase } from '../db.js';\nimport type { ByKindResult } from '../types.js';\nimport { shortenSymbol } from '../symbol-parser.js';\n\n/**\n * SCIP SymbolInformation.Kind enum values.\n * From: https://github.com/sourcegraph/scip/blob/main/scip.proto\n */\nconst KIND_NAMES: Record<number, string> = {\n  0: 'UnspecifiedKind',\n  1: 'AbstractMethod',\n  2: 'Accessor',\n  3: 'Array',\n  4: 'Assertion',\n  5: 'AssociatedType',\n  6: 'Attribute',\n  7: 'Axiom',\n  8: 'Boolean',\n  9: 'Class',\n  10: 'Constant',\n  11: 'Constructor',\n  12: 'Contract',\n  13: 'DataFamily',\n  14: 'DefinitionMacro',\n  15: 'Delegate',\n  16: 'Enum',\n  17: 'EnumMember',\n  18: 'Error',\n  19: 'Event',\n  20: 'Fact',\n  21: 'Field',\n  22: 'File',\n  23: 'Function',\n  24: 'Getter',\n  25: 'Grammar',\n  26: 'Instance',\n  27: 'Interface',\n  28: 'Key',\n  29: 'Lang',\n  30: 'Lemma',\n  31: 'Library',\n  32: 'Macro',\n  33: 'Method',\n  34: 'MethodAlias',\n  35: 'MethodReceiver',\n  36: 'MethodSpecification',\n  37: 'Message',\n  38: 'Modifier',\n  39: 'Module',\n  40: 'Namespace',\n  41: 'Null',\n  42: 'Number',\n  43: 'Object',\n  44: 'Operator',\n  45: 'Package',\n  46: 'PackageObject',\n  47: 'Parameter',\n  48: 'ParameterLabel',\n  49: 'Pattern',\n  50: 'Predicate',\n  51: 'Property',\n  52: 'Protocol',\n  53: 'ProtocolMethod',\n  54: 'PureVirtualMethod',\n  55: 'Quasiquoter',\n  56: 'SelfParameter',\n  57: 'Setter',\n  58: 'Signature',\n  59: 'SingletonClass',\n  60: 'SingletonMethod',\n  61: 'StaticDataMember',\n  62: 'StaticEvent',\n  63: 'StaticField',\n  64: 'StaticMethod',\n  65: 'StaticProperty',\n  66: 'StaticVariable',\n  67: 'String',\n  68: 'Struct',\n  69: 'Subscript',\n  70: 'Tactic',\n  71: 'Theorem',\n  72: 'ThisParameter',\n  73: 'Trait',\n  74: 'TraitMethod',\n  75: 'Type',\n  76: 'TypeAlias',\n  77: 'TypeClass',\n  78: 'TypeClassMethod',\n  79: 'TypeFamily',\n  80: 'TypeParameter',\n  81: 'Union',\n  82: 'Value',\n  83: 'Variable',\n};\n\n/** Reverse lookup: name -> kind number */\nconst KIND_BY_NAME = new Map<string, number>();\nfor (const [k, v] of Object.entries(KIND_NAMES)) {\n  KIND_BY_NAME.set(v.toLowerCase(), Number(k));\n}\n\n/**\n * Find symbols by SCIP kind (class, interface, enum, function, etc.)\n */\nexport function byKind(\n  db: ScipDatabase,\n  kindQuery: string,\n  opts: { scope?: string; limit?: number } = {},\n): ByKindResult[] {\n  const { scope, limit = 100 } = opts;\n\n  // Resolve kind: accept number or name\n  let kindNum: number | null = null;\n  const asNum = parseInt(kindQuery, 10);\n  if (!isNaN(asNum)) {\n    kindNum = asNum;\n  } else {\n    kindNum = KIND_BY_NAME.get(kindQuery.toLowerCase()) ?? null;\n    // Fuzzy match: try partial name\n    if (kindNum === null) {\n      for (const [name, num] of KIND_BY_NAME) {\n        if (name.includes(kindQuery.toLowerCase())) {\n          kindNum = num;\n          break;\n        }\n      }\n    }\n  }\n\n  if (kindNum === null) {\n    return [];\n  }\n\n  const scopeFilter = scope ? `AND d.relative_path LIKE '%${scope}%'` : '';\n\n  // Check if the index actually has kind data populated\n  const hasKinds = db.get<{ c: number }>(\n    `SELECT COUNT(*) AS c FROM global_symbols WHERE kind IS NOT NULL`,\n  );\n  if (!hasKinds || hasKinds.c === 0) {\n    return []; // Indexer doesn't populate kind field\n  }\n\n  const rows = db.all<{\n    symbol: string;\n    kind: number;\n    relative_path: string;\n    start_line: number;\n    end_line: number;\n  }>(\n    `SELECT gs.symbol, gs.kind, d.relative_path, der.start_line, der.end_line\n    FROM global_symbols gs\n    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id\n    JOIN documents d ON der.document_id = d.id\n    WHERE gs.kind = ?\n      ${db.pathExclusionsFor('d')}\n      ${scopeFilter}\n    ORDER BY d.relative_path, der.start_line\n    LIMIT ?`,\n    kindNum, limit,\n  );\n\n  return rows\n    .filter((r) => !db.isIgnored(r.relative_path))\n    .map((r) => ({\n      symbol: r.symbol,\n      shortName: shortenSymbol(r.symbol),\n      kind: r.kind,\n      kindName: KIND_NAMES[r.kind] ?? 'Unknown',\n      relativePath: r.relative_path,\n      startLine: r.start_line,\n      endLine: r.end_line,\n    }));\n}\n\n/** List all symbol kinds present in the index with counts */\nexport function kindCounts(\n  db: ScipDatabase,\n  opts: { scope?: string } = {},\n): Array<{ kind: number; kindName: string; count: number }> {\n  const scopeFilter = opts.scope\n    ? `AND d.relative_path LIKE '%${opts.scope}%'`\n    : '';\n\n  const rows = db.all<{ kind: number; cnt: number }>(\n    `SELECT gs.kind, COUNT(*) AS cnt\n    FROM global_symbols gs\n    JOIN defn_enclosing_ranges der ON gs.id = der.symbol_id\n    JOIN documents d ON der.document_id = d.id\n    WHERE 1 = 1\n      ${db.pathExclusionsFor('d')}\n      AND gs.kind IS NOT NULL\n      AND gs.kind != 0\n      ${scopeFilter}\n    GROUP BY gs.kind\n    ORDER BY cnt DESC`,\n  );\n\n  return rows.map((r) => ({\n    kind: r.kind,\n    kindName: KIND_NAMES[r.kind] ?? 'Unknown',\n    count: r.cnt,\n  }));\n}\n"],"mappings":";;;;;AAQA,IAAM,aAAqC;AAAA,EACzC,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,IAAI;AACN;AAGA,IAAM,eAAe,oBAAI,IAAoB;AAC7C,WAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC/C,eAAa,IAAI,EAAE,YAAY,GAAG,OAAO,CAAC,CAAC;AAC7C;AAKO,SAAS,OACd,IACA,WACA,OAA2C,CAAC,GAC5B;AAChB,QAAM,EAAE,OAAO,QAAQ,IAAI,IAAI;AAG/B,MAAI,UAAyB;AAC7B,QAAM,QAAQ,SAAS,WAAW,EAAE;AACpC,MAAI,CAAC,MAAM,KAAK,GAAG;AACjB,cAAU;AAAA,EACZ,OAAO;AACL,cAAU,aAAa,IAAI,UAAU,YAAY,CAAC,KAAK;AAEvD,QAAI,YAAY,MAAM;AACpB,iBAAW,CAAC,MAAM,GAAG,KAAK,cAAc;AACtC,YAAI,KAAK,SAAS,UAAU,YAAY,CAAC,GAAG;AAC1C,oBAAU;AACV;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,YAAY,MAAM;AACpB,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,cAAc,QAAQ,8BAA8B,KAAK,OAAO;AAGtE,QAAM,WAAW,GAAG;AAAA,IAClB;AAAA,EACF;AACA,MAAI,CAAC,YAAY,SAAS,MAAM,GAAG;AACjC,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,OAAO,GAAG;AAAA,IAOd;AAAA;AAAA;AAAA;AAAA;AAAA,QAKI,GAAG,kBAAkB,GAAG,CAAC;AAAA,QACzB,WAAW;AAAA;AAAA;AAAA,IAGf;AAAA,IAAS;AAAA,EACX;AAEA,SAAO,KACJ,OAAO,CAAC,MAAM,CAAC,GAAG,UAAU,EAAE,aAAa,CAAC,EAC5C,IAAI,CAAC,OAAO;AAAA,IACX,QAAQ,EAAE;AAAA,IACV,WAAW,cAAc,EAAE,MAAM;AAAA,IACjC,MAAM,EAAE;AAAA,IACR,UAAU,WAAW,EAAE,IAAI,KAAK;AAAA,IAChC,cAAc,EAAE;AAAA,IAChB,WAAW,EAAE;AAAA,IACb,SAAS,EAAE;AAAA,EACb,EAAE;AACN;AAGO,SAAS,WACd,IACA,OAA2B,CAAC,GAC8B;AAC1D,QAAM,cAAc,KAAK,QACrB,8BAA8B,KAAK,KAAK,OACxC;AAEJ,QAAM,OAAO,GAAG;AAAA,IACd;AAAA;AAAA;AAAA;AAAA;AAAA,QAKI,GAAG,kBAAkB,GAAG,CAAC;AAAA;AAAA;AAAA,QAGzB,WAAW;AAAA;AAAA;AAAA,EAGjB;AAEA,SAAO,KAAK,IAAI,CAAC,OAAO;AAAA,IACtB,MAAM,EAAE;AAAA,IACR,UAAU,WAAW,EAAE,IAAI,KAAK;AAAA,IAChC,OAAO,EAAE;AAAA,EACX,EAAE;AACJ;","names":[]}

package/dist/chunk-LB7OS35Q.js

@@ -0,0 +1,72 @@
+import {
+  findFirstSymbolMatch,
+  getCalleeRowsForSymbol
+} from "./chunk-FUHJCHS4.js";
+import {
+  shortenSymbol
+} from "./chunk-QOV2R2WT.js";
+
+// src/queries/convergence.ts
+function convergence(db, symbolPatternA, symbolPatternB) {
+  const matchA = findFirstSymbolMatch(db, symbolPatternA);
+  const matchB = findFirstSymbolMatch(db, symbolPatternB);
+  if (!matchA || !matchB) return null;
+  const calleesA = new Set(
+    getCalleeRowsForSymbol(db, matchA).map((r) => r.symbol)
+  );
+  const calleesB = new Set(
+    getCalleeRowsForSymbol(db, matchB).map((r) => r.symbol)
+  );
+  const shared = [];
+  for (const c of calleesA) {
+    if (calleesB.has(c)) shared.push(c);
+  }
+  const uniqueA = [];
+  for (const c of calleesA) {
+    if (!calleesB.has(c)) uniqueA.push(c);
+  }
+  const uniqueB = [];
+  for (const c of calleesB) {
+    if (!calleesA.has(c)) uniqueB.push(c);
+  }
+  const union = /* @__PURE__ */ new Set([...calleesA, ...calleesB]);
+  const similarity = union.size > 0 ? shared.length / union.size : 0;
+  let strategy;
+  if (uniqueA.length === 0 && uniqueB.length === 0) {
+    strategy = "These functions have identical callee sets. One can replace the other directly.";
+  } else if (uniqueA.length === 0) {
+    strategy = `A is a subset of B. A can be replaced by calling B (B does everything A does plus more).`;
+  } else if (uniqueB.length === 0) {
+    strategy = `B is a subset of A. B can be replaced by calling A (A does everything B does plus more).`;
+  } else if (uniqueA.length <= 2 && uniqueB.length <= 2) {
+    strategy = `Create a shared function with the ${shared.length} common callees. Pass the ${uniqueA.length + uniqueB.length} divergent callees as parameters or strategy callbacks.`;
+  } else {
+    strategy = `Extract the ${shared.length} shared callees into a common helper. Each function calls the helper plus its own unique logic (${uniqueA.length} callees in A, ${uniqueB.length} in B).`;
+  }
+  const locA = matchA.endLine - matchA.startLine + 1;
+  const locB = matchB.endLine - matchB.startLine + 1;
+  return {
+    symbolA: {
+      symbol: matchA.symbol,
+      shortName: shortenSymbol(matchA.symbol),
+      file: matchA.relativePath,
+      loc: locA
+    },
+    symbolB: {
+      symbol: matchB.symbol,
+      shortName: shortenSymbol(matchB.symbol),
+      file: matchB.relativePath,
+      loc: locB
+    },
+    similarity,
+    sharedCallees: shared.map(shortenSymbol),
+    uniqueToA: uniqueA.map(shortenSymbol),
+    uniqueToB: uniqueB.map(shortenSymbol),
+    consolidationStrategy: strategy
+  };
+}
+
+export {
+  convergence
+};
+//# sourceMappingURL=chunk-LB7OS35Q.js.map

package/dist/chunk-LB7OS35Q.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/queries/convergence.ts"],"sourcesContent":["import type { ScipDatabase } from '../db.js';\nimport { findFirstSymbolMatch, getCalleeRowsForSymbol } from '../query-support.js';\nimport type { ConvergenceResult } from '../types.js';\nimport { shortenSymbol } from '../symbol-parser.js';\n\n/**\n * Given two similar symbols, show what a consolidated version would look like.\n * The shared callee set becomes the common body. The unique callees become\n * the parameterization points.\n */\nexport function convergence(\n  db: ScipDatabase,\n  symbolPatternA: string,\n  symbolPatternB: string,\n): ConvergenceResult | null {\n  const matchA = findFirstSymbolMatch(db, symbolPatternA);\n  const matchB = findFirstSymbolMatch(db, symbolPatternB);\n\n  if (!matchA || !matchB) return null;\n\n  const calleesA = new Set(\n    getCalleeRowsForSymbol(db, matchA).map((r) => r.symbol),\n  );\n  const calleesB = new Set(\n    getCalleeRowsForSymbol(db, matchB).map((r) => r.symbol),\n  );\n\n  const shared: string[] = [];\n  for (const c of calleesA) {\n    if (calleesB.has(c)) shared.push(c);\n  }\n\n  const uniqueA: string[] = [];\n  for (const c of calleesA) {\n    if (!calleesB.has(c)) uniqueA.push(c);\n  }\n\n  const uniqueB: string[] = [];\n  for (const c of calleesB) {\n    if (!calleesA.has(c)) uniqueB.push(c);\n  }\n\n  const union = new Set([...calleesA, ...calleesB]);\n  const similarity = union.size > 0 ? shared.length / union.size : 0;\n\n  // Generate a consolidation strategy description\n  let strategy: string;\n  if (uniqueA.length === 0 && uniqueB.length === 0) {\n    strategy = 'These functions have identical callee sets. One can replace the other directly.';\n  } else if (uniqueA.length === 0) {\n    strategy = `A is a subset of B. A can be replaced by calling B (B does everything A does plus more).`;\n  } else if (uniqueB.length === 0) {\n    strategy = `B is a subset of A. B can be replaced by calling A (A does everything B does plus more).`;\n  } else if (uniqueA.length <= 2 && uniqueB.length <= 2) {\n    strategy = `Create a shared function with the ${shared.length} common callees. Pass the ${uniqueA.length + uniqueB.length} divergent callees as parameters or strategy callbacks.`;\n  } else {\n    strategy = `Extract the ${shared.length} shared callees into a common helper. Each function calls the helper plus its own unique logic (${uniqueA.length} callees in A, ${uniqueB.length} in B).`;\n  }\n\n  const locA = matchA.endLine - matchA.startLine + 1;\n  const locB = matchB.endLine - matchB.startLine + 1;\n\n  return {\n    symbolA: {\n      symbol: matchA.symbol,\n      shortName: shortenSymbol(matchA.symbol),\n      file: matchA.relativePath,\n      loc: locA,\n    },\n    symbolB: {\n      symbol: matchB.symbol,\n      shortName: shortenSymbol(matchB.symbol),\n      file: matchB.relativePath,\n      loc: locB,\n    },\n    similarity,\n    sharedCallees: shared.map(shortenSymbol),\n    uniqueToA: uniqueA.map(shortenSymbol),\n    uniqueToB: uniqueB.map(shortenSymbol),\n    consolidationStrategy: strategy,\n  };\n}\n"],"mappings":";;;;;;;;;AAUO,SAAS,YACd,IACA,gBACA,gBAC0B;AAC1B,QAAM,SAAS,qBAAqB,IAAI,cAAc;AACtD,QAAM,SAAS,qBAAqB,IAAI,cAAc;AAEtD,MAAI,CAAC,UAAU,CAAC,OAAQ,QAAO;AAE/B,QAAM,WAAW,IAAI;AAAA,IACnB,uBAAuB,IAAI,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM;AAAA,EACxD;AACA,QAAM,WAAW,IAAI;AAAA,IACnB,uBAAuB,IAAI,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM;AAAA,EACxD;AAEA,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,UAAU;AACxB,QAAI,SAAS,IAAI,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,EACpC;AAEA,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,UAAU;AACxB,QAAI,CAAC,SAAS,IAAI,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EACtC;AAEA,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,UAAU;AACxB,QAAI,CAAC,SAAS,IAAI,CAAC,EAAG,SAAQ,KAAK,CAAC;AAAA,EACtC;AAEA,QAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,UAAU,GAAG,QAAQ,CAAC;AAChD,QAAM,aAAa,MAAM,OAAO,IAAI,OAAO,SAAS,MAAM,OAAO;AAGjE,MAAI;AACJ,MAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,GAAG;AAChD,eAAW;AAAA,EACb,WAAW,QAAQ,WAAW,GAAG;AAC/B,eAAW;AAAA,EACb,WAAW,QAAQ,WAAW,GAAG;AAC/B,eAAW;AAAA,EACb,WAAW,QAAQ,UAAU,KAAK,QAAQ,UAAU,GAAG;AACrD,eAAW,qCAAqC,OAAO,MAAM,6BAA6B,QAAQ,SAAS,QAAQ,MAAM;AAAA,EAC3H,OAAO;AACL,eAAW,eAAe,OAAO,MAAM,mGAAmG,QAAQ,MAAM,kBAAkB,QAAQ,MAAM;AAAA,EAC1L;AAEA,QAAM,OAAO,OAAO,UAAU,OAAO,YAAY;AACjD,QAAM,OAAO,OAAO,UAAU,OAAO,YAAY;AAEjD,SAAO;AAAA,IACL,SAAS;AAAA,MACP,QAAQ,OAAO;AAAA,MACf,WAAW,cAAc,OAAO,MAAM;AAAA,MACtC,MAAM,OAAO;AAAA,MACb,KAAK;AAAA,IACP;AAAA,IACA,SAAS;AAAA,MACP,QAAQ,OAAO;AAAA,MACf,WAAW,cAAc,OAAO,MAAM;AAAA,MACtC,MAAM,OAAO;AAAA,MACb,KAAK;AAAA,IACP;AAAA,IACA;AAAA,IACA,eAAe,OAAO,IAAI,aAAa;AAAA,IACvC,WAAW,QAAQ,IAAI,aAAa;AAAA,IACpC,WAAW,QAAQ,IAAI,aAAa;AAAA,IACpC,uBAAuB;AAAA,EACzB;AACF;","names":[]}