agent-ide 0.1.0

package/dist/core/dependency/cycle-detector.js

@@ -0,0 +1,300 @@
+/**
+ * 循環依賴檢測器
+ * 使用 Tarjan 算法檢測強連通分量和循環依賴
+ */
+import { calculateCycleSeverity } from './types.js';
+/**
+ * 循環依賴檢測器類別
+ */
+export class CycleDetector {
+    /**
+     * 檢測圖中的所有循環依賴
+     * @param graph 依賴圖
+     * @param options 檢測選項
+     * @returns 循環依賴列表
+     */
+    detectCycles(graph, options) {
+        const opts = this.getDefaultOptions(options);
+        if (opts.maxCycleLength <= 0) {
+            throw new Error('最大循環長度必須大於 0');
+        }
+        const stronglyConnectedComponents = this.findStronglyConnectedComponents(graph);
+        const cycles = [];
+        for (const scc of stronglyConnectedComponents) {
+            if (scc.size === 1) {
+                // 檢查自迴圈
+                const node = scc.nodes[0];
+                if (graph.hasDependency(node, node)) {
+                    if (!opts.ignoreSelfLoops) {
+                        cycles.push({
+                            cycle: [node],
+                            length: 1,
+                            severity: calculateCycleSeverity(1)
+                        });
+                    }
+                }
+            }
+            else if (scc.size > 1 && scc.size <= opts.maxCycleLength) {
+                // 找出 SCC 中的實際循環路徑
+                const cyclePaths = this.findCyclePathsInSCC(graph, [...scc.nodes]);
+                for (const cyclePath of cyclePaths) {
+                    if (cyclePath.length <= opts.maxCycleLength) {
+                        cycles.push({
+                            cycle: cyclePath,
+                            length: cyclePath.length,
+                            severity: calculateCycleSeverity(cyclePath.length)
+                        });
+                        // 如果不需要報告所有循環，找到第一個就停止
+                        if (!opts.reportAllCycles) {
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+        return cycles;
+    }
+    /**
+     * 使用 Tarjan 算法找出強連通分量
+     * @param graph 依賴圖
+     * @returns 強連通分量列表
+     */
+    findStronglyConnectedComponents(graph) {
+        const nodes = graph.getAllNodes();
+        const nodeStates = new Map();
+        const stack = [];
+        const sccs = [];
+        let index = 0;
+        const strongConnect = (node) => {
+            // 設定節點的索引和 lowLink
+            nodeStates.set(node, {
+                index: index,
+                lowLink: index,
+                onStack: true
+            });
+            index++;
+            stack.push(node);
+            // 考慮所有依賴
+            const dependencies = graph.getDependencies(node);
+            for (const dep of dependencies) {
+                const depState = nodeStates.get(dep);
+                if (!depState) {
+                    // 依賴尚未被訪問，遞歸處理
+                    strongConnect(dep);
+                    const nodeState = nodeStates.get(node);
+                    const depStateAfter = nodeStates.get(dep);
+                    nodeState.lowLink = Math.min(nodeState.lowLink, depStateAfter.lowLink);
+                }
+                else if (depState.onStack) {
+                    // 依賴在當前路徑上，更新 lowLink
+                    const nodeState = nodeStates.get(node);
+                    nodeState.lowLink = Math.min(nodeState.lowLink, depState.index);
+                }
+            }
+            // 如果是根節點，產生 SCC
+            const nodeState = nodeStates.get(node);
+            if (nodeState.lowLink === nodeState.index) {
+                const sccNodes = [];
+                let currentNode;
+                do {
+                    currentNode = stack.pop();
+                    const currentState = nodeStates.get(currentNode);
+                    currentState.onStack = false;
+                    sccNodes.push(currentNode);
+                } while (currentNode !== node);
+                if (sccNodes.length > 0) {
+                    sccs.push({
+                        nodes: sccNodes,
+                        size: sccNodes.length,
+                        cycleComplexity: this.calculateCycleComplexity(graph, sccNodes)
+                    });
+                }
+            }
+        };
+        // 對每個未訪問的節點執行 Tarjan 算法
+        for (const node of nodes) {
+            if (!nodeStates.has(node)) {
+                strongConnect(node);
+            }
+        }
+        return sccs;
+    }
+    /**
+     * 在強連通分量中找出循環路徑
+     * @param graph 依賴圖
+     * @param sccNodes SCC 中的節點
+     * @returns 循環路徑列表
+     */
+    findCyclePathsInSCC(graph, sccNodes) {
+        const cycles = [];
+        const visited = new Set();
+        // 從每個節點開始嘗試找出循環
+        for (const startNode of sccNodes) {
+            if (visited.has(startNode)) {
+                continue;
+            }
+            const cycle = this.findShortestCyclePath(graph, startNode, sccNodes);
+            if (cycle && cycle.length > 1) {
+                cycles.push(cycle);
+                // 標記這個循環中的所有節點為已訪問
+                cycle.forEach(node => visited.add(node));
+            }
+        }
+        return cycles;
+    }
+    /**
+     * 找出從指定節點開始的最短循環路徑
+     * @param graph 依賴圖
+     * @param startNode 起始節點
+     * @param sccNodes 限制搜尋範圍的節點
+     * @returns 循環路徑或 null
+     */
+    findShortestCyclePath(graph, startNode, sccNodes) {
+        const sccSet = new Set(sccNodes);
+        const queue = [{
+                node: startNode,
+                path: [startNode]
+            }];
+        const visited = new Set();
+        while (queue.length > 0) {
+            const { node, path } = queue.shift();
+            if (visited.has(node) && node !== startNode) {
+                continue;
+            }
+            visited.add(node);
+            const dependencies = graph.getDependencies(node).filter(dep => sccSet.has(dep));
+            for (const dep of dependencies) {
+                if (dep === startNode && path.length > 1) {
+                    // 找到循環
+                    return path;
+                }
+                if (!path.includes(dep)) {
+                    queue.push({
+                        node: dep,
+                        path: [...path, dep]
+                    });
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * 計算循環的複雜度
+     * @param graph 依賴圖
+     * @param cycleNodes 循環中的節點
+     * @returns 複雜度分數
+     */
+    calculateCycleComplexity(graph, cycleNodes) {
+        if (cycleNodes.length <= 1) {
+            return 0;
+        }
+        let complexity = 0;
+        const cycleSet = new Set(cycleNodes);
+        // 計算循環內部的連接密度
+        for (const node of cycleNodes) {
+            const dependencies = graph.getDependencies(node);
+            const internalDeps = dependencies.filter(dep => cycleSet.has(dep));
+            complexity += internalDeps.length;
+        }
+        // 計算外部連接
+        for (const node of cycleNodes) {
+            const allDependents = graph.getDependents(node);
+            const externalDependents = allDependents.filter(dep => !cycleSet.has(dep));
+            complexity += externalDependents.length * 0.5; // 外部連接權重較低
+        }
+        return Math.round(complexity);
+    }
+    /**
+     * 取得預設檢測選項
+     * @param options 使用者提供的選項
+     * @returns 合併後的選項
+     */
+    getDefaultOptions(options) {
+        return {
+            maxCycleLength: 20,
+            reportAllCycles: false,
+            ignoreSelfLoops: true,
+            ...options
+        };
+    }
+    /**
+     * 檢查圖中是否存在循環依賴
+     * @param graph 依賴圖
+     * @returns 是否存在循環
+     */
+    hasCycles(graph) {
+        const topologicalResult = graph.topologicalSort();
+        return topologicalResult.hasCycle;
+    }
+    /**
+     * 取得循環依賴的摘要統計
+     * @param graph 依賴圖
+     * @returns 統計資訊
+     */
+    getCycleStatistics(graph) {
+        const cycles = this.detectCycles(graph, {
+            reportAllCycles: true,
+            maxCycleLength: 100,
+            ignoreSelfLoops: false
+        });
+        if (cycles.length === 0) {
+            return {
+                totalCycles: 0,
+                averageCycleLength: 0,
+                maxCycleLength: 0,
+                cyclesBySeverity: { low: 0, medium: 0, high: 0 }
+            };
+        }
+        const totalLength = cycles.reduce((sum, cycle) => sum + cycle.length, 0);
+        const maxLength = Math.max(...cycles.map(cycle => cycle.length));
+        const severityCount = cycles.reduce((acc, cycle) => {
+            acc[cycle.severity]++;
+            return acc;
+        }, { low: 0, medium: 0, high: 0 });
+        return {
+            totalCycles: cycles.length,
+            averageCycleLength: totalLength / cycles.length,
+            maxCycleLength: maxLength,
+            cyclesBySeverity: severityCount
+        };
+    }
+    /**
+     * 建議循環依賴的修復策略
+     * @param cycles 循環依賴列表
+     * @returns 修復建議
+     */
+    suggestFixStrategies(cycles) {
+        return cycles.map(cycle => {
+            let strategy = '';
+            let description = '';
+            let priority = 'low';
+            if (cycle.length === 1) {
+                strategy = 'remove_self_reference';
+                description = '移除自我引用，檢查是否真的需要';
+                priority = 'low';
+            }
+            else if (cycle.length === 2) {
+                strategy = 'extract_common_dependency';
+                description = '提取共同依賴到第三個模組';
+                priority = cycle.severity === 'high' ? 'high' : 'medium';
+            }
+            else if (cycle.length <= 5) {
+                strategy = 'dependency_inversion';
+                description = '使用依賴倒置原則，引入介面或抽象層';
+                priority = cycle.severity === 'high' ? 'high' : 'medium';
+            }
+            else {
+                strategy = 'architectural_refactoring';
+                description = '需要重新設計架構，考慮拆分模組';
+                priority = 'high';
+            }
+            return {
+                cycle: [...cycle.cycle],
+                strategy,
+                description,
+                priority
+            };
+        });
+    }
+}
+//# sourceMappingURL=cycle-detector.js.map

package/dist/core/dependency/cycle-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-detector.js","sourceRoot":"","sources":["../../../src/core/dependency/cycle-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AAWpD;;GAEG;AACH,MAAM,OAAO,aAAa;IACxB;;;;;OAKG;IACH,YAAY,CACV,KAAsB,EACtB,OAA+B;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAE7C,IAAI,IAAI,CAAC,cAAc,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,2BAA2B,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAChF,MAAM,MAAM,GAAyB,EAAE,CAAC;QAExC,KAAK,MAAM,GAAG,IAAI,2BAA2B,EAAE,CAAC;YAC9C,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACnB,QAAQ;gBACR,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBACpC,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;wBAC1B,MAAM,CAAC,IAAI,CAAC;4BACV,KAAK,EAAE,CAAC,IAAI,CAAC;4BACb,MAAM,EAAE,CAAC;4BACT,QAAQ,EAAE,sBAAsB,CAAC,CAAC,CAAC;yBACpC,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;gBAC3D,kBAAkB;gBAClB,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBAEnE,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;oBACnC,IAAI,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;wBAC5C,MAAM,CAAC,IAAI,CAAC;4BACV,KAAK,EAAE,SAAS;4BAChB,MAAM,EAAE,SAAS,CAAC,MAAM;4BACxB,QAAQ,EAAE,sBAAsB,CAAC,SAAS,CAAC,MAAM,CAAC;yBACnD,CAAC,CAAC;wBAEH,uBAAuB;wBACvB,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;4BAC1B,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,+BAA+B,CAAC,KAAsB;QACpD,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;QACjD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAiC,EAAE,CAAC;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,MAAM,aAAa,GAAG,CAAC,IAAY,EAAE,EAAE;YACrC,mBAAmB;YACnB,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE;gBACnB,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,KAAK;gBACd,OAAO,EAAE,IAAI;aACd,CAAC,CAAC;YACH,KAAK,EAAE,CAAC;YACR,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEjB,SAAS;YACT,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACjD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAErC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,eAAe;oBACf,aAAa,CAAC,GAAG,CAAC,CAAC;oBACnB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;oBACxC,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;oBAC3C,SAAS,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;gBACzE,CAAC;qBAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;oBAC5B,sBAAsB;oBACtB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;oBACxC,SAAS,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;YAED,gBAAgB;YAChB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YACxC,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC;gBAC1C,MAAM,QAAQ,GAAa,EAAE,CAAC;gBAC9B,IAAI,WAAmB,CAAC;gBAExB,GAAG,CAAC;oBACF,WAAW,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBAC3B,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;oBAClD,YAAY,CAAC,OAAO,GAAG,KAAK,CAAC;oBAC7B,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC7B,CAAC,QAAQ,WAAW,KAAK,IAAI,EAAE;gBAE/B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,IAAI,CAAC,IAAI,CAAC;wBACR,KAAK,EAAE,QAAQ;wBACf,IAAI,EAAE,QAAQ,CAAC,MAAM;wBACrB,eAAe,EAAE,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,CAAC;qBAChE,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,aAAa,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACK,mBAAmB,CAAC,KAAsB,EAAE,QAAkB;QACpE,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,gBAAgB;QAChB,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACrE,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,mBAAmB;gBACnB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,qBAAqB,CAC3B,KAAsB,EACtB,SAAiB,EACjB,QAAkB;QAElB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,KAAK,GAA4C,CAAC;gBACtD,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC,SAAS,CAAC;aAClB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEtC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC5C,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAElB,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhF,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,IAAI,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzC,OAAO;oBACP,OAAO,IAAI,CAAC;gBACd,CAAC;gBAED,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,GAAG;wBACT,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC;qBACrB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACK,wBAAwB,CAAC,KAAsB,EAAE,UAAoB;QAC3E,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;QAErC,cAAc;QACd,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,YAAY,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACnE,UAAU,IAAI,YAAY,CAAC,MAAM,CAAC;QACpC,CAAC;QAED,SAAS;QACT,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAChD,MAAM,kBAAkB,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3E,UAAU,IAAI,kBAAkB,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW;QAC5D,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,OAA+B;QACvD,OAAO;YACL,cAAc,EAAE,EAAE;YAClB,eAAe,EAAE,KAAK;YACtB,eAAe,EAAE,IAAI;YACrB,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,KAAsB;QAC9B,MAAM,iBAAiB,GAAG,KAAK,CAAC,eAAe,EAAE,CAAC;QAClD,OAAO,iBAAiB,CAAC,QAAQ,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,KAAsB;QAMvC,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE;YACtC,eAAe,EAAE,IAAI;YACrB,cAAc,EAAE,GAAG;YACnB,eAAe,EAAE,KAAK;SACvB,CAAC,CAAC;QAEH,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;gBACL,WAAW,EAAE,CAAC;gBACd,kBAAkB,EAAE,CAAC;gBACrB,cAAc,EAAE,CAAC;gBACjB,gBAAgB,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;aACjD,CAAC;QACJ,CAAC;QAED,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAEjE,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;YACjD,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtB,OAAO,GAAG,CAAC;QACb,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAEnC,OAAO;YACL,WAAW,EAAE,MAAM,CAAC,MAAM;YAC1B,kBAAkB,EAAE,WAAW,GAAG,MAAM,CAAC,MAAM;YAC/C,cAAc,EAAE,SAAS;YACzB,gBAAgB,EAAE,aAAa;SAChC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,oBAAoB,CAAC,MAA4B;QAM/C,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACxB,IAAI,QAAQ,GAAG,EAAE,CAAC;YAClB,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,IAAI,QAAQ,GAA8B,KAAK,CAAC;YAEhD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,QAAQ,GAAG,uBAAuB,CAAC;gBACnC,WAAW,GAAG,iBAAiB,CAAC;gBAChC,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC9B,QAAQ,GAAG,2BAA2B,CAAC;gBACvC,WAAW,GAAG,cAAc,CAAC;gBAC7B,QAAQ,GAAG,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC3D,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,QAAQ,GAAG,sBAAsB,CAAC;gBAClC,WAAW,GAAG,mBAAmB,CAAC;gBAClC,QAAQ,GAAG,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC3D,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,2BAA2B,CAAC;gBACvC,WAAW,GAAG,iBAAiB,CAAC;gBAChC,QAAQ,GAAG,MAAM,CAAC;YACpB,CAAC;YAED,OAAO;gBACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;gBACvB,QAAQ;gBACR,WAAW;gBACX,QAAQ;aACT,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/core/dependency/dependency-analyzer.d.ts

@@ -0,0 +1,152 @@
+/**
+ * 依賴關係分析器
+ * 分析檔案和專案的依賴關係，提供影響分析和統計功能
+ */
+import type { FileDependencies, ProjectDependencies, DependencyStats, ImpactAnalysisResult, DependencyQueryOptions, ExtendedDependencyAnalysisOptions } from './types.js';
+/**
+ * 依賴關係分析器類別
+ */
+export declare class DependencyAnalyzer {
+    private graph;
+    private cycleDetector;
+    private cache;
+    private options;
+    constructor(options?: Partial<ExtendedDependencyAnalysisOptions>);
+    /**
+     * 分析單個檔案的依賴關係
+     * @param filePath 檔案路徑
+     * @returns 檔案依賴資訊
+     */
+    analyzeFile(filePath: string): Promise<FileDependencies>;
+    /**
+     * 分析整個專案的依賴關係
+     * @param projectPath 專案路徑
+     * @returns 專案依賴資訊
+     */
+    analyzeProject(projectPath: string): Promise<ProjectDependencies>;
+    /**
+     * 取得檔案的直接依賴
+     * @param filePath 檔案路徑
+     * @returns 依賴列表
+     */
+    getDependencies(filePath: string): string[];
+    /**
+     * 取得檔案的直接依賴者
+     * @param filePath 檔案路徑
+     * @returns 依賴者列表
+     */
+    getDependents(filePath: string): string[];
+    /**
+     * 取得檔案的傳遞依賴
+     * @param filePath 檔案路徑
+     * @param options 查詢選項
+     * @returns 傳遞依賴列表
+     */
+    getTransitiveDependencies(filePath: string, options?: DependencyQueryOptions): string[];
+    /**
+     * 取得檔案變更的影響範圍
+     * @param filePath 檔案路徑
+     * @returns 受影響的檔案列表
+     */
+    getImpactedFiles(filePath: string): string[];
+    /**
+     * 取得詳細的影響分析結果
+     * @param filePath 檔案路徑
+     * @returns 影響分析結果
+     */
+    getImpactAnalysis(filePath: string): ImpactAnalysisResult;
+    /**
+     * 取得受影響的測試檔案
+     * @param filePath 檔案路徑
+     * @returns 測試檔案列表
+     */
+    getAffectedTests(filePath: string): string[];
+    /**
+     * 取得依賴統計資訊
+     * @returns 統計資訊
+     */
+    getStats(): DependencyStats;
+    /**
+     * 從檔案內容中提取依賴關係
+     * @param content 檔案內容
+     * @param filePath 檔案路徑
+     * @returns 依賴列表
+     */
+    private extractDependencies;
+    /**
+     * 解析路徑
+     * @param importPath 匯入路徑
+     * @param fromFile 來源檔案
+     * @returns 解析結果
+     */
+    private resolvePath;
+    /**
+     * 更新依賴圖
+     * @param fileDependencies 檔案依賴資訊
+     */
+    private updateDependencyGraph;
+    /**
+     * 找出專案中的原始檔案
+     * @param projectPath 專案路徑
+     * @returns 檔案路徑列表
+     */
+    private findSourceFiles;
+    /**
+     * 檢查檔案是否應該被排除
+     * @param filePath 檔案路徑
+     * @returns 是否排除
+     */
+    private isExcluded;
+    /**
+     * 檢查檔案是否應該被包含
+     * @param filePath 檔案路徑
+     * @returns 是否包含
+     */
+    private isIncluded;
+    /**
+     * 簡單的 glob 模式匹配
+     * @param filePath 檔案路徑
+     * @param pattern glob 模式
+     * @returns 是否匹配
+     */
+    private matchGlob;
+    /**
+     * 檢查是否應該包含此依賴
+     * @param resolvedPath 解析後的路徑
+     * @returns 是否包含
+     */
+    private shouldIncludeDependency;
+    /**
+     * 檢查是否為測試檔案
+     * @param filePath 檔案路徑
+     * @returns 是否為測試檔案
+     */
+    private isTestFile;
+    /**
+     * 計算影響分數
+     * @param directAffected 直接影響數量
+     * @param transitiveAffected 傳遞影響數量
+     * @param testAffected 測試影響數量
+     * @returns 影響分數
+     */
+    private calculateImpactScore;
+    /**
+     * 將陣列分塊
+     * @param array 原陣列
+     * @param size 塊大小
+     * @returns 分塊後的陣列
+     */
+    private chunkArray;
+    /**
+     * 建立預設分析選項
+     * @returns 預設選項
+     */
+    private createDefaultAnalysisOptions;
+    /**
+     * 取得預設查詢選項
+     * @param options 使用者選項
+     * @returns 合併後的選項
+     */
+    private getDefaultQueryOptions;
+}
+//# sourceMappingURL=dependency-analyzer.d.ts.map

package/dist/core/dependency/dependency-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-analyzer.d.ts","sourceRoot":"","sources":["../../../src/core/dependency/dependency-analyzer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,KAAK,EACV,gBAAgB,EAChB,mBAAmB,EACnB,eAAe,EACf,oBAAoB,EAEpB,sBAAsB,EAEtB,iCAAiC,EAClC,MAAM,YAAY,CAAC;AAWpB;;GAEG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,KAAK,CAAkB;IAC/B,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,KAAK,CAA0B;IACvC,OAAO,CAAC,OAAO,CAAoC;gBAEvC,OAAO,CAAC,EAAE,OAAO,CAAC,iCAAiC,CAAC;IAUhE;;;;OAIG;IACG,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;IAmD9D;;;;OAIG;IACG,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC;IAyBvE;;;;OAIG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAK3C;;;;OAIG;IACH,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAKzC;;;;;OAKG;IACH,yBAAyB,CACvB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,sBAAsB,GAC/B,MAAM,EAAE;IAWX;;;;OAIG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAK5C;;;;OAIG;IACH,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,oBAAoB;IAsBzD;;;;OAIG;IACH,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAe5C;;;OAGG;IACH,QAAQ,IAAI,eAAe;IAyB3B;;;;;OAKG;YACW,mBAAmB;IA4CjC;;;;;OAKG;YACW,WAAW;IAkDzB;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAmB7B;;;;OAIG;YACW,eAAe;IAkC7B;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAMlB;;;;OAIG;IACH,OAAO,CAAC,UAAU;IAMlB;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IAWjB;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IAQ/B;;;;OAIG;IACH,OAAO,CAAC,UAAU;IASlB;;;;;;OAMG;IACH,OAAO,CAAC,oBAAoB;IAQ5B;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IAQlB;;;OAGG;IACH,OAAO,CAAC,4BAA4B;IAWpC;;;;OAIG;IACH,OAAO,CAAC,sBAAsB;CAQ/B"}