spectra-cli 4.1.1

package/dist/graph/mermaid-renderer.js

@@ -0,0 +1,133 @@
+/**
+ * 简化模块路径用于 Mermaid 显示
+ */
+function simplifyPath(filePath) {
+    // 移除扩展名和 src/ 前缀
+    return filePath
+        .replace(/^src\//, '')
+        .replace(/\.(ts|tsx|js|jsx)$/, '')
+        .replace(/\/index$/, '');
+}
+/**
+ * 创建 Mermaid 安全的节点 ID
+ */
+function toNodeId(filePath) {
+    return simplifyPath(filePath).replace(/[^a-zA-Z0-9_]/g, '_');
+}
+/**
+ * 按目录分组模块
+ */
+function groupByDirectory(modules) {
+    const groups = new Map();
+    for (const mod of modules) {
+        const simplified = simplifyPath(mod);
+        const dir = simplified.includes('/') ? simplified.split('/')[0] : '.';
+        if (!groups.has(dir)) {
+            groups.set(dir, []);
+        }
+        groups.get(dir).push(mod);
+    }
+    return groups;
+}
+/**
+ * 为依赖关系图生成 Mermaid graph TD 源码
+ *
+ * @param graph - 依赖关系图
+ * @param options - 渲染选项
+ * @returns Mermaid graph TD 源码
+ */
+export function renderDependencyGraph(graph, options = {}) {
+    const { highlightCycles = true, maxNodes = 50, } = options;
+    const collapseDirectories = options.collapseDirectories ??
+        graph.modules.length > 20;
+    const lines = ['graph TD'];
+    // 收集循环依赖的模块
+    const circularModules = new Set();
+    if (highlightCycles) {
+        for (const scc of graph.sccs) {
+            if (scc.modules.length > 1) {
+                for (const mod of scc.modules) {
+                    circularModules.add(mod);
+                }
+            }
+        }
+    }
+    if (collapseDirectories) {
+        // 目录折叠模式
+        const groups = groupByDirectory(graph.modules.map((m) => m.source));
+        const dirNodes = new Map();
+        for (const [dir, modules] of groups) {
+            const nodeId = `dir_${dir.replace(/[^a-zA-Z0-9_]/g, '_')}`;
+            dirNodes.set(dir, nodeId);
+            const hasCircular = modules.some((m) => circularModules.has(m));
+            const label = `${dir}/ (${modules.length})`;
+            if (hasCircular && highlightCycles) {
+                lines.push(`  ${nodeId}["${label}"]:::cycle`);
+            }
+            else {
+                lines.push(`  ${nodeId}["${label}"]`);
+            }
+        }
+        // 目录间的边
+        const dirEdges = new Set();
+        for (const edge of graph.edges) {
+            const fromDir = simplifyPath(edge.from).includes('/')
+                ? simplifyPath(edge.from).split('/')[0]
+                : '.';
+            const toDir = simplifyPath(edge.to).includes('/')
+                ? simplifyPath(edge.to).split('/')[0]
+                : '.';
+            if (fromDir !== toDir) {
+                const key = `${fromDir}->${toDir}`;
+                if (!dirEdges.has(key)) {
+                    dirEdges.add(key);
+                    const fromId = dirNodes.get(fromDir);
+                    const toId = dirNodes.get(toDir);
+                    if (fromId && toId) {
+                        lines.push(`  ${fromId} --> ${toId}`);
+                    }
+                }
+            }
+        }
+    }
+    else {
+        // 逐模块模式（限制 maxNodes）
+        const visibleModules = graph.modules.slice(0, maxNodes);
+        for (const mod of visibleModules) {
+            const nodeId = toNodeId(mod.source);
+            const label = simplifyPath(mod.source);
+            if (circularModules.has(mod.source) && highlightCycles) {
+                lines.push(`  ${nodeId}["${label}"]:::cycle`);
+            }
+            else {
+                lines.push(`  ${nodeId}["${label}"]`);
+            }
+        }
+        // 可见模块的集合
+        const visibleSet = new Set(visibleModules.map((m) => m.source));
+        // 边
+        for (const edge of graph.edges) {
+            if (!visibleSet.has(edge.from) || !visibleSet.has(edge.to))
+                continue;
+            const fromId = toNodeId(edge.from);
+            const toId = toNodeId(edge.to);
+            if (edge.isCircular && highlightCycles) {
+                lines.push(`  ${fromId} -.->|circular| ${toId}`);
+            }
+            else {
+                lines.push(`  ${fromId} --> ${toId}`);
+            }
+        }
+        // 超出 maxNodes 的提示
+        if (graph.modules.length > maxNodes) {
+            lines.push(`  more["... 还有 ${graph.modules.length - maxNodes} 个模块"]`);
+        }
+    }
+    // 循环依赖样式
+    if (highlightCycles && circularModules.size > 0) {
+        lines.push('');
+        lines.push('  classDef cycle fill:#f96,stroke:#f00,color:#fff');
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=mermaid-renderer.js.map

package/dist/graph/mermaid-renderer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mermaid-renderer.js","sourceRoot":"","sources":["../../src/graph/mermaid-renderer.ts"],"names":[],"mappings":"AAeA;;GAEG;AACH,SAAS,YAAY,CAAC,QAAgB;IACpC,iBAAiB;IACjB,OAAO,QAAQ;SACZ,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;SACrB,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC;SACjC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,SAAS,QAAQ,CAAC,QAAgB;IAChC,OAAO,YAAY,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;AAC/D,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CACvB,OAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE3C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QACvE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAsB,EACtB,UAAyB,EAAE;IAE3B,MAAM,EACJ,eAAe,GAAG,IAAI,EACtB,QAAQ,GAAG,EAAE,GACd,GAAG,OAAO,CAAC;IACZ,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB;QACrD,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC;IAE5B,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,CAAC;IAErC,YAAY;IACZ,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,IAAI,eAAe,EAAE,CAAC;QACpB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC7B,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;oBAC9B,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,mBAAmB,EAAE,CAAC;QACxB,SAAS;QACT,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC;YAC3D,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC1B,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,KAAK,GAAG,GAAG,GAAG,MAAM,OAAO,CAAC,MAAM,GAAG,CAAC;YAE5C,IAAI,WAAW,IAAI,eAAe,EAAE,CAAC;gBACnC,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,KAAK,YAAY,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,QAAQ;QACR,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACnD,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE;gBACxC,CAAC,CAAC,GAAG,CAAC;YACR,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAC/C,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE;gBACtC,CAAC,CAAC,GAAG,CAAC;YAER,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;gBACtB,MAAM,GAAG,GAAG,GAAG,OAAO,KAAK,KAAK,EAAE,CAAC;gBACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAClB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;oBACtC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;oBAClC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;wBACnB,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,QAAQ,IAAI,EAAE,CAAC,CAAC;oBACxC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,qBAAqB;QACrB,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAExD,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEvC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,eAAe,EAAE,CAAC;gBACvD,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,KAAK,YAAY,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,UAAU;QACV,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEhE,IAAI;QACJ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAErE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAE/B,IAAI,IAAI,CAAC,UAAU,IAAI,eAAe,EAAE,CAAC;gBACvC,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,mBAAmB,IAAI,EAAE,CAAC,CAAC;YACnD,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,QAAQ,IAAI,EAAE,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CACR,kBAAkB,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,QAAQ,QAAQ,CAC1D,CAAC;QACJ,CAAC;IACH,CAAC;IAED,SAAS;IACT,IAAI,eAAe,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/graph/topological-sort.d.ts

@@ -0,0 +1,31 @@
+/**
+ * 拓扑排序与 Tarjan SCC 检测
+ * 参见 contracts/graph-module.md
+ */
+import type { DependencyGraph, SCC } from '../models/dependency-graph.js';
+export interface TopologicalResult {
+    /** 按依赖顺序排列的文件路径（叶子节点优先） */
+    order: string[];
+    /** 模块 → 拓扑层级 */
+    levels: Map<string, number>;
+    /** 是否存在循环依赖 */
+    hasCycles: boolean;
+    /** 大小 > 1 的 SCC */
+    cycleGroups: string[][];
+}
+/**
+ * 基于 Tarjan 算法的强连通分量检测
+ *
+ * @param graph - 依赖关系图
+ * @returns 所有 SCC（单模块 SCC 的 modules.length === 1）
+ */
+export declare function detectSCCs(graph: DependencyGraph): SCC[];
+/**
+ * 使用 Kahn 算法计算处理顺序
+ * 循环依赖被折叠为 SCC 后作为整体处理
+ *
+ * @param graph - 依赖关系图
+ * @returns 拓扑排序结果
+ */
+export declare function topologicalSort(graph: DependencyGraph): TopologicalResult;
+//# sourceMappingURL=topological-sort.d.ts.map

package/dist/graph/topological-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.d.ts","sourceRoot":"","sources":["../../src/graph/topological-sort.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,eAAe,EAAE,GAAG,EAAE,MAAM,+BAA+B,CAAC;AAM1E,MAAM,WAAW,iBAAiB;IAChC,2BAA2B;IAC3B,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,gBAAgB;IAChB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,eAAe;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,mBAAmB;IACnB,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;CACzB;AAMD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,eAAe,GAAG,GAAG,EAAE,CA+DxD;AAMD;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,GAAG,iBAAiB,CAsGzE"}

package/dist/graph/topological-sort.js

@@ -0,0 +1,167 @@
+// ============================================================
+// Tarjan SCC 检测
+// ============================================================
+/**
+ * 基于 Tarjan 算法的强连通分量检测
+ *
+ * @param graph - 依赖关系图
+ * @returns 所有 SCC（单模块 SCC 的 modules.length === 1）
+ */
+export function detectSCCs(graph) {
+    const nodes = graph.modules.map((m) => m.source);
+    const nodeSet = new Set(nodes);
+    // 构建邻接表
+    const adjacency = new Map();
+    for (const node of nodes) {
+        adjacency.set(node, []);
+    }
+    for (const edge of graph.edges) {
+        if (nodeSet.has(edge.from) && nodeSet.has(edge.to)) {
+            adjacency.get(edge.from).push(edge.to);
+        }
+    }
+    // Tarjan 算法状态
+    let index = 0;
+    const indices = new Map();
+    const lowlinks = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    let sccId = 0;
+    function strongConnect(v) {
+        indices.set(v, index);
+        lowlinks.set(v, index);
+        index++;
+        stack.push(v);
+        onStack.add(v);
+        for (const w of adjacency.get(v) ?? []) {
+            if (!indices.has(w)) {
+                // w 未访问
+                strongConnect(w);
+                lowlinks.set(v, Math.min(lowlinks.get(v), lowlinks.get(w)));
+            }
+            else if (onStack.has(w)) {
+                // w 在栈上 → 属于当前 SCC
+                lowlinks.set(v, Math.min(lowlinks.get(v), indices.get(w)));
+            }
+        }
+        // v 是 SCC 的根节点
+        if (lowlinks.get(v) === indices.get(v)) {
+            const sccModules = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.delete(w);
+                sccModules.push(w);
+            } while (w !== v);
+            sccs.push({ id: sccId++, modules: sccModules });
+        }
+    }
+    for (const node of nodes) {
+        if (!indices.has(node)) {
+            strongConnect(node);
+        }
+    }
+    return sccs;
+}
+// ============================================================
+// 拓扑排序（Kahn 算法）
+// ============================================================
+/**
+ * 使用 Kahn 算法计算处理顺序
+ * 循环依赖被折叠为 SCC 后作为整体处理
+ *
+ * @param graph - 依赖关系图
+ * @returns 拓扑排序结果
+ */
+export function topologicalSort(graph) {
+    const nodes = graph.modules.map((m) => m.source);
+    const nodeSet = new Set(nodes);
+    if (nodes.length === 0) {
+        return { order: [], levels: new Map(), hasCycles: false, cycleGroups: [] };
+    }
+    // 检测 SCC
+    const sccs = detectSCCs(graph);
+    const cycleGroups = sccs
+        .filter((scc) => scc.modules.length > 1)
+        .map((scc) => scc.modules);
+    const hasCycles = cycleGroups.length > 0;
+    // 将 SCC 折叠为单个节点
+    // 每个模块映射到其 SCC 的代表节点
+    const sccRepresentative = new Map();
+    for (const scc of sccs) {
+        const rep = scc.modules[0];
+        for (const mod of scc.modules) {
+            sccRepresentative.set(mod, rep);
+        }
+    }
+    // 构建折叠后的 DAG
+    const collapsedNodes = new Set();
+    for (const scc of sccs) {
+        collapsedNodes.add(scc.modules[0]);
+    }
+    const collapsedAdj = new Map();
+    const collapsedInDegree = new Map();
+    for (const node of collapsedNodes) {
+        collapsedAdj.set(node, new Set());
+        collapsedInDegree.set(node, 0);
+    }
+    for (const edge of graph.edges) {
+        if (!nodeSet.has(edge.from) || !nodeSet.has(edge.to))
+            continue;
+        const fromRep = sccRepresentative.get(edge.from);
+        const toRep = sccRepresentative.get(edge.to);
+        if (fromRep !== toRep && !collapsedAdj.get(fromRep).has(toRep)) {
+            collapsedAdj.get(fromRep).add(toRep);
+            collapsedInDegree.set(toRep, (collapsedInDegree.get(toRep) ?? 0) + 1);
+        }
+    }
+    // Kahn 算法
+    const queue = [];
+    for (const [node, degree] of collapsedInDegree) {
+        if (degree === 0) {
+            queue.push(node);
+        }
+    }
+    const sortedCollapsed = [];
+    const levels = new Map();
+    while (queue.length > 0) {
+        const node = queue.shift();
+        sortedCollapsed.push(node);
+        // 计算层级：max(依赖的层级) + 1，无依赖则为 0
+        let maxDepLevel = -1;
+        for (const edge of graph.edges) {
+            const toRep = sccRepresentative.get(edge.to);
+            const fromRep = sccRepresentative.get(edge.from);
+            if (toRep === node && fromRep !== node) {
+                const depLevel = levels.get(fromRep) ?? 0;
+                maxDepLevel = Math.max(maxDepLevel, depLevel);
+            }
+        }
+        const level = maxDepLevel + 1;
+        // 展开 SCC 中的所有模块
+        const scc = sccs.find((s) => s.modules[0] === node);
+        if (scc) {
+            for (const mod of scc.modules) {
+                levels.set(mod, level);
+            }
+        }
+        for (const neighbor of collapsedAdj.get(node) ?? []) {
+            const newDegree = (collapsedInDegree.get(neighbor) ?? 1) - 1;
+            collapsedInDegree.set(neighbor, newDegree);
+            if (newDegree === 0) {
+                queue.push(neighbor);
+            }
+        }
+    }
+    // 展开排序结果：叶子节点优先（反转依赖方向）
+    const order = [];
+    for (const rep of sortedCollapsed) {
+        const scc = sccs.find((s) => s.modules[0] === rep);
+        if (scc) {
+            order.push(...scc.modules);
+        }
+    }
+    return { order, levels, hasCycles, cycleGroups };
+}
+//# sourceMappingURL=topological-sort.js.map

package/dist/graph/topological-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.js","sourceRoot":"","sources":["../../src/graph/topological-sort.ts"],"names":[],"mappings":"AAqBA,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAE/D;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAsB;IAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,QAAQ;IACR,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,cAAc;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,aAAa,CAAC,CAAS;QAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACvB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,QAAQ;gBACR,aAAa,CAAC,CAAC,CAAC,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAChE,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,mBAAmB;gBACnB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,eAAe;QACf,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,IAAI,CAAS,CAAC;YACd,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAElB,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAE/D;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;IAC7E,CAAC;IAED,SAAS;IACT,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,WAAW,GAAG,IAAI;SACrB,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;SACvC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAEzC,gBAAgB;IAChB,qBAAqB;IACrB,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAC9B,iBAAiB,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,aAAa;IACb,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IACpD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAClC,iBAAiB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC/D,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;QAClD,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;QAC9C,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAChE,YAAY,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACtC,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,UAAU;IACV,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,iBAAiB,EAAE,CAAC;QAC/C,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE3B,8BAA8B;QAC9B,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,OAAQ,CAAC,IAAI,CAAC,CAAC;gBAC3C,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC;QAE9B,gBAAgB;QAChB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACpD,IAAI,GAAG,EAAE,CAAC;YACR,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,MAAM,SAAS,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7D,iBAAiB,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC3C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACnD,IAAI,GAAG,EAAE,CAAC;YACR,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AACnD,CAAC"}

package/dist/hooks/git-hook-installer.d.ts

@@ -0,0 +1,37 @@
+/**
+ * git post-commit hook 安装/卸载逻辑
+ * 在 .git/hooks/post-commit 中追加/删除 spectra 标记段落
+ */
+/**
+ * 生成 post-commit hook spectra 段落内容
+ * - 使用 POSIX sh 语法（兼容性最好）
+ * - nohup 后台运行，不阻塞 git 工作流
+ * - 区分代码文件和文档文件分别处理
+ */
+export declare function generatePostCommitSegment(): string;
+/**
+ * 解析 post-commit hook 文件的真实路径
+ * - 普通仓库：.git 是目录 → .git/hooks/post-commit
+ * - worktree：.git 是文件（含 "gitdir: <path>"） → 解析 gitdir 并定位 hooks/post-commit
+ * @param projectRoot - 项目根目录绝对路径
+ * @throws 当 .git 不存在或格式不可识别时
+ */
+export declare function resolveHookPath(projectRoot: string): string;
+/**
+ * 安装 git post-commit hook 段落
+ * - 幂等：段落已存在时打印提示并返回
+ * - 若 post-commit 不存在则创建并写入 #!/bin/sh 头部
+ * - 支持普通仓库和 git worktree
+ * @param projectRoot - 项目根目录绝对路径
+ * @throws 当 .git 不存在时（FR-013）
+ */
+export declare function installGitHook(projectRoot: string): void;
+/**
+ * 卸载 git post-commit hook 段落
+ * - 幂等：段落不存在时静默退出
+ * - 正则删除 spectra 标记段落（含标记行），保留其他内容
+ * - 保持文件可执行权限
+ * @param projectRoot - 项目根目录绝对路径
+ */
+export declare function removeGitHook(projectRoot: string): void;
+//# sourceMappingURL=git-hook-installer.d.ts.map

package/dist/hooks/git-hook-installer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"git-hook-installer.d.ts","sourceRoot":"","sources":["../../src/hooks/git-hook-installer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH;;;;;GAKG;AACH,wBAAgB,yBAAyB,IAAI,MAAM,CAiBlD;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CA0B3D;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CA6BxD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CA+BvD"}

package/dist/hooks/git-hook-installer.js

@@ -0,0 +1,136 @@
+/**
+ * git post-commit hook 安装/卸载逻辑
+ * 在 .git/hooks/post-commit 中追加/删除 spectra 标记段落
+ */
+import { existsSync, readFileSync, writeFileSync, chmodSync, statSync, mkdirSync } from 'node:fs';
+import { join, resolve, dirname } from 'node:path';
+/** spectra 段落开始标记 */
+const SEGMENT_BEGIN = '# --- spectra begin ---';
+/** spectra 段落结束标记 */
+const SEGMENT_END = '# --- spectra end ---';
+/**
+ * 生成 post-commit hook spectra 段落内容
+ * - 使用 POSIX sh 语法（兼容性最好）
+ * - nohup 后台运行，不阻塞 git 工作流
+ * - 区分代码文件和文档文件分别处理
+ */
+export function generatePostCommitSegment() {
+    return `${SEGMENT_BEGIN}
+_spectra_changed=$(git diff HEAD~1 HEAD --name-only 2>/dev/null || true)
+
+_spectra_has_code=$(echo "$_spectra_changed" | grep -E '\\.(ts|js|tsx|jsx|py|go|rs|java|rb|php|cs)$' | wc -l | tr -d ' ')
+_spectra_has_docs=$(echo "$_spectra_changed" | grep -E '\\.(md|txt|rst|adoc)$' | wc -l | tr -d ' ')
+
+if [ "$_spectra_has_code" -gt 0 ]; then
+  # 后台运行 + 超时保护，防止僵尸进程积累（FR-010 CLARIFIED）
+  ( spectra graph & _pid=$!; sleep 30 && kill $_pid 2>/dev/null ) > /dev/null 2>&1 &
+fi
+
+if [ "$_spectra_has_docs" -gt 0 ]; then
+  echo "[spectra] Docs changed. Run 'spectra graph' to refresh the knowledge graph."
+fi
+${SEGMENT_END}
+`;
+}
+/**
+ * 解析 post-commit hook 文件的真实路径
+ * - 普通仓库：.git 是目录 → .git/hooks/post-commit
+ * - worktree：.git 是文件（含 "gitdir: <path>"） → 解析 gitdir 并定位 hooks/post-commit
+ * @param projectRoot - 项目根目录绝对路径
+ * @throws 当 .git 不存在或格式不可识别时
+ */
+export function resolveHookPath(projectRoot) {
+    const gitPath = join(projectRoot, '.git');
+    let stat;
+    try {
+        stat = statSync(gitPath);
+    }
+    catch {
+        throw new Error('[spectra] .git directory not found. Is this a git repository?');
+    }
+    if (stat.isDirectory()) {
+        return join(gitPath, 'hooks', 'post-commit');
+    }
+    if (stat.isFile()) {
+        // git worktree：.git 是包含 "gitdir: <path>" 的文件
+        const content = readFileSync(gitPath, 'utf-8').trim();
+        const match = /^gitdir:\s*(.+)$/.exec(content);
+        if (!match) {
+            throw new Error('[spectra] Cannot parse .git file. Is this a valid git worktree?');
+        }
+        const gitDir = resolve(dirname(gitPath), match[1]);
+        return join(gitDir, 'hooks', 'post-commit');
+    }
+    throw new Error('[spectra] .git directory not found. Is this a git repository?');
+}
+/**
+ * 安装 git post-commit hook 段落
+ * - 幂等：段落已存在时打印提示并返回
+ * - 若 post-commit 不存在则创建并写入 #!/bin/sh 头部
+ * - 支持普通仓库和 git worktree
+ * @param projectRoot - 项目根目录绝对路径
+ * @throws 当 .git 不存在时（FR-013）
+ */
+export function installGitHook(projectRoot) {
+    const hookPath = resolveHookPath(projectRoot);
+    // 确保 hooks 目录存在（worktree 场景下可能不存在）
+    mkdirSync(dirname(hookPath), { recursive: true });
+    // 若 post-commit 不存在，创建含 #!/bin/sh 头部的文件
+    let existing = '';
+    if (existsSync(hookPath)) {
+        existing = readFileSync(hookPath, 'utf-8');
+    }
+    else {
+        existing = '#!/bin/sh\n';
+    }
+    // 幂等判定：已含开始标记则跳过
+    if (existing.includes(SEGMENT_BEGIN)) {
+        console.log('[spectra] git hook already installed, skipping.');
+        return;
+    }
+    // 追加 spectra 段落（确保前有空行分隔）
+    const needsNewline = existing.length > 0 && !existing.endsWith('\n');
+    const content = needsNewline
+        ? `${existing}\n${generatePostCommitSegment()}`
+        : `${existing}${generatePostCommitSegment()}`;
+    writeFileSync(hookPath, content, 'utf-8');
+    chmodSync(hookPath, 0o755);
+    console.log('[spectra] git post-commit hook installed.');
+}
+/**
+ * 卸载 git post-commit hook 段落
+ * - 幂等：段落不存在时静默退出
+ * - 正则删除 spectra 标记段落（含标记行），保留其他内容
+ * - 保持文件可执行权限
+ * @param projectRoot - 项目根目录绝对路径
+ */
+export function removeGitHook(projectRoot) {
+    let hookPath;
+    try {
+        hookPath = resolveHookPath(projectRoot);
+    }
+    catch {
+        // .git 不存在 → 无需卸载
+        return;
+    }
+    if (!existsSync(hookPath)) {
+        return;
+    }
+    const content = readFileSync(hookPath, 'utf-8');
+    if (!content.includes(SEGMENT_BEGIN)) {
+        return;
+    }
+    // 正则删除从开始标记到结束标记（含标记行）的全部内容
+    // 使用非贪婪匹配，支持多行，标记行之间允许任意字符
+    const pattern = new RegExp(`${escapeRegex(SEGMENT_BEGIN)}[\\s\\S]*?${escapeRegex(SEGMENT_END)}\\n?`, 'g');
+    const updated = content.replace(pattern, '');
+    writeFileSync(hookPath, updated, 'utf-8');
+    // 保持可执行权限
+    chmodSync(hookPath, 0o755);
+    console.log('[spectra] git post-commit hook removed.');
+}
+/** 转义正则特殊字符 */
+function escapeRegex(str) {
+    return str.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+}
+//# sourceMappingURL=git-hook-installer.js.map

package/dist/hooks/git-hook-installer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"git-hook-installer.js","sourceRoot":"","sources":["../../src/hooks/git-hook-installer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAClG,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEnD,qBAAqB;AACrB,MAAM,aAAa,GAAG,yBAAyB,CAAC;AAChD,qBAAqB;AACrB,MAAM,WAAW,GAAG,uBAAuB,CAAC;AAE5C;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB;IACvC,OAAO,GAAG,aAAa;;;;;;;;;;;;;;EAcvB,WAAW;CACZ,CAAC;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,WAAmB;IACjD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAE1C,IAAI,IAAI,CAAC;IACT,IAAI,CAAC;QACH,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;IACnF,CAAC;IAED,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAClB,6CAA6C;QAC7C,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAC;QACrF,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,+DAA+D,CAAC,CAAC;AACnF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,WAAmB;IAChD,MAAM,QAAQ,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAE9C,mCAAmC;IACnC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAElD,wCAAwC;IACxC,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzB,QAAQ,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;SAAM,CAAC;QACN,QAAQ,GAAG,aAAa,CAAC;IAC3B,CAAC;IAED,iBAAiB;IACjB,IAAI,QAAQ,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACrC,OAAO,CAAC,GAAG,CAAC,iDAAiD,CAAC,CAAC;QAC/D,OAAO;IACT,CAAC;IAED,0BAA0B;IAC1B,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACrE,MAAM,OAAO,GAAG,YAAY;QAC1B,CAAC,CAAC,GAAG,QAAQ,KAAK,yBAAyB,EAAE,EAAE;QAC/C,CAAC,CAAC,GAAG,QAAQ,GAAG,yBAAyB,EAAE,EAAE,CAAC;IAEhD,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC3B,OAAO,CAAC,GAAG,CAAC,2CAA2C,CAAC,CAAC;AAC3D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,WAAmB;IAC/C,IAAI,QAAgB,CAAC;IACrB,IAAI,CAAC;QACH,QAAQ,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,kBAAkB;QAClB,OAAO;IACT,CAAC;IAED,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1B,OAAO;IACT,CAAC;IAED,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAEhD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QACrC,OAAO;IACT,CAAC;IAED,4BAA4B;IAC5B,2BAA2B;IAC3B,MAAM,OAAO,GAAG,IAAI,MAAM,CACxB,GAAG,WAAW,CAAC,aAAa,CAAC,aAAa,WAAW,CAAC,WAAW,CAAC,MAAM,EACxE,GAAG,CACJ,CAAC;IACF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAE7C,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,UAAU;IACV,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC3B,OAAO,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAC;AACzD,CAAC;AAED,eAAe;AACf,SAAS,WAAW,CAAC,GAAW;IAC9B,OAAO,GAAG,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AACpD,CAAC"}

package/dist/hooks/hook-installer.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Claude Code PreToolUse hook 安装/卸载核心逻辑
+ * 包含：HookConfig/ClaudeSettings 类型定义、shell 脚本生成、幂等安装/卸载
+ */
+/** settings.json 中 hook 条目结构 */
+export interface HookConfig {
+    matcher: string;
+    command: string;
+}
+/** settings.json 顶层结构（保留未知字段） */
+export interface ClaudeSettings {
+    hooks?: {
+        PreToolUse?: HookConfig[];
+        PostToolUse?: HookConfig[];
+    };
+    [key: string]: unknown;
+}
+/**
+ * 生成 spectra-context.sh 脚本内容
+ * - 使用 node -e 内联 JSON 解析，避免依赖 jq
+ * - 任何异常均 exit 0，不阻塞 Claude Code 工具调用
+ */
+export declare function generateContextScript(): string;
+/**
+ * 安装 Claude Code PreToolUse hook
+ * - 幂等：已安装时打印提示并返回，不重复写入
+ * - 备份：写入前先 copyFileSync 到 .bak
+ * - 原子写入：使用 writeAtomicJson
+ * @param projectRoot - 项目根目录绝对路径
+ */
+export declare function installClaudeHook(projectRoot: string): void;
+/**
+ * 卸载 Claude Code PreToolUse hook
+ * - 幂等：未找到时静默退出
+ * - 过滤掉 command 含 spectra-context.sh 的条目，保留其他条目
+ * @param projectRoot - 项目根目录绝对路径
+ */
+export declare function removeClaudeHook(projectRoot: string): void;
+//# sourceMappingURL=hook-installer.d.ts.map

package/dist/hooks/hook-installer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hook-installer.d.ts","sourceRoot":"","sources":["../../src/hooks/hook-installer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,gCAAgC;AAChC,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,iCAAiC;AACjC,MAAM,WAAW,cAAc;IAC7B,KAAK,CAAC,EAAE;QACN,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC;QAC1B,WAAW,CAAC,EAAE,UAAU,EAAE,CAAC;KAC5B,CAAC;IACF,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAWD;;;;GAIG;AACH,wBAAgB,qBAAqB,IAAI,MAAM,CAkD9C;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAoD3D;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAqC1D"}