@su-record/vibe 3.0.0 → 3.2.0

package/dist/infra/orchestrator/types.test.js

@@ -1,57 +0,0 @@
-import { describe, it, expect } from 'vitest';
-import { computeLlmPriority, TASK_LLM_PRIORITY, TASK_TYPES } from './types.js';
-/**
- * LLM 라우팅 정책 SSOT 가드 — computeLlmPriority 가 provider 우선순위의 유일 소스이며,
- * 정적 맵(TASK_LLM_PRIORITY)이 여기서 파생되어 절대 어긋나지 않음을 잠근다.
- */
-describe('computeLlmPriority (routing policy SSOT)', () => {
-    it('falls back to claude-only when no external provider is available', () => {
-        for (const t of TASK_TYPES) {
-            expect(computeLlmPriority(t, { codex: false, antigravity: false })).toEqual(['claude']);
-        }
-    });
-    it('always ends the chain with claude', () => {
-        const avail = { codex: true, antigravity: true };
-        for (const t of TASK_TYPES) {
-            const chain = computeLlmPriority(t, avail);
-            expect(chain[chain.length - 1]).toBe('claude');
-        }
-    });
-    it('puts antigravity first for web-search / uiux', () => {
-        const avail = { codex: true, antigravity: true };
-        expect(computeLlmPriority('web-search', avail)[0]).toBe('antigravity');
-        expect(computeLlmPriority('uiux', avail)[0]).toBe('antigravity');
-    });
-    it('puts gpt first for gpt-preferred tasks, with antigravity cross-check where configured', () => {
-        const avail = { codex: true, antigravity: true };
-        expect(computeLlmPriority('architecture', avail)).toEqual(['gpt', 'antigravity', 'claude']);
-        expect(computeLlmPriority('debugging', avail)).toEqual(['gpt', 'claude']);
-        expect(computeLlmPriority('code-review', avail)).toEqual(['gpt', 'antigravity', 'claude']);
-    });
-    it('routes general straight to claude even when providers are available', () => {
-        expect(computeLlmPriority('general', { codex: true, antigravity: true })).toEqual(['claude']);
-    });
-    it('honours single-provider availability', () => {
-        expect(computeLlmPriority('architecture', { codex: true, antigravity: false })).toEqual(['gpt', 'claude']);
-        expect(computeLlmPriority('web-search', { codex: false, antigravity: true })).toEqual(['antigravity', 'claude']);
-    });
-    it('TASK_LLM_PRIORITY is derived from computeLlmPriority (all-available) — cannot drift', () => {
-        for (const t of TASK_TYPES) {
-            expect(TASK_LLM_PRIORITY[t]).toEqual(computeLlmPriority(t, { codex: true, antigravity: true, zai: true }));
-        }
-    });
-    it('routes UI (uiux) to zai(GLM) first when zai is available', () => {
-        expect(computeLlmPriority('uiux', { codex: true, antigravity: true, zai: true }))
-            .toEqual(['zai', 'antigravity', 'claude']);
-        // zai only → GLM then claude
-        expect(computeLlmPriority('uiux', { codex: false, antigravity: false, zai: true }))
-            .toEqual(['zai', 'claude']);
-    });
-    it('does not route non-UI tasks to zai', () => {
-        expect(computeLlmPriority('architecture', { codex: true, antigravity: true, zai: true }))
-            .toEqual(['gpt', 'antigravity', 'claude']);
-        expect(computeLlmPriority('code-gen', { codex: true, antigravity: true, zai: true }))
-            .toEqual(['gpt', 'claude']);
-    });
-});
-//# sourceMappingURL=types.test.js.map

package/dist/infra/orchestrator/types.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.test.js","sourceRoot":"","sources":["../../../src/infra/orchestrator/types.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE/E;;;GAGG;AACH,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1F,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QACjD,MAAM,CAAC,kBAAkB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uFAAuF,EAAE,GAAG,EAAE;QAC/F,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QACjD,MAAM,CAAC,kBAAkB,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC5F,MAAM,CAAC,kBAAkB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,kBAAkB,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC7F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,kBAAkB,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,kBAAkB,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3G,MAAM,CAAC,kBAAkB,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;IACnH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAClC,kBAAkB,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CACrE,CAAC;QACJ,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;aAC9E,OAAO,CAAC,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7C,6BAA6B;QAC7B,MAAM,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;aAChF,OAAO,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,kBAAkB,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;aACtF,OAAO,CAAC,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;aAClF,OAAO,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tools/semantic/analyzeDependencyGraph.d.ts

@@ -1,12 +0,0 @@
-import { ToolResult, ToolDefinition } from '../../infra/types/tool.js';
-export declare const analyzeDependencyGraphDefinition: ToolDefinition;
-interface AnalyzeDependencyGraphArgs {
-    projectPath: string;
-    targetFile?: string;
-    maxDepth?: number;
-    includeExternal?: boolean;
-    detectCircular?: boolean;
-}
-export declare function analyzeDependencyGraph(args: AnalyzeDependencyGraphArgs): Promise<ToolResult>;
-export {};
-//# sourceMappingURL=analyzeDependencyGraph.d.ts.map

package/dist/tools/semantic/analyzeDependencyGraph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"analyzeDependencyGraph.d.ts","sourceRoot":"","sources":["../../../src/tools/semantic/analyzeDependencyGraph.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAGvE,eAAO,MAAM,gCAAgC,EAAE,cAiD9C,CAAC;AAEF,UAAU,0BAA0B;IAClC,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAgBD,wBAAsB,sBAAsB,CAAC,IAAI,EAAE,0BAA0B,GAAG,OAAO,CAAC,UAAU,CAAC,CAuLlG"}

package/dist/tools/semantic/analyzeDependencyGraph.js

@@ -1,359 +0,0 @@
-// Analyze code dependency graph
-import { ProjectCache } from '../../infra/lib/ProjectCache.js';
-export const analyzeDependencyGraphDefinition = {
-    name: 'analyze_dependency_graph',
-    description: `Analyzes code dependency graphs.
-
-Keywords: dependency, relationship analysis, circular reference, dependency graph, circular dependency
-
-**Analysis includes:**
-- Import/export relationships between files
-- Circular dependency detection
-- Module cluster identification
-- Code coupling analysis
-
-Usage examples:
-- "Analyze dependency graph in src folder"
-- "Show dependencies of index.ts"`,
-    inputSchema: {
-        type: 'object',
-        properties: {
-            projectPath: {
-                type: 'string',
-                description: 'Project path'
-            },
-            targetFile: {
-                type: 'string',
-                description: 'Specific file to analyze (optional)'
-            },
-            maxDepth: {
-                type: 'number',
-                description: 'Maximum traversal depth (default: 3)'
-            },
-            includeExternal: {
-                type: 'boolean',
-                description: 'Include external packages (default: false)'
-            },
-            detectCircular: {
-                type: 'boolean',
-                description: 'Detect circular dependencies (default: true)'
-            }
-        },
-        required: ['projectPath']
-    },
-    annotations: {
-        title: 'Analyze Dependency Graph',
-        audience: ['user', 'assistant'],
-        readOnlyHint: true,
-        destructiveHint: false,
-        idempotentHint: true,
-        openWorldHint: false
-    }
-};
-export async function analyzeDependencyGraph(args) {
-    try {
-        const { projectPath, targetFile, maxDepth = 3, includeExternal = false, detectCircular = true } = args;
-        const project = await ProjectCache.getInstance().getOrCreate(projectPath);
-        const sourceFiles = project.getSourceFiles();
-        if (sourceFiles.length === 0) {
-            return {
-                content: [{
-                        type: 'text',
-                        text: `✗ No source files found in project: ${projectPath}`
-                    }]
-            };
-        }
-        const graph = {
-            nodes: [],
-            edges: [],
-            circularDependencies: [],
-            clusters: []
-        };
-        const fileMap = new Map();
-        const adjacencyList = new Map();
-        // Build dependency graph
-        for (const sourceFile of sourceFiles) {
-            const filePath = sourceFile.getFilePath();
-            const relativePath = getRelativePath(filePath, projectPath);
-            // Skip if targeting specific file and this isn't it or related
-            if (targetFile && !relativePath.includes(targetFile) && !shouldIncludeInGraph(relativePath, targetFile, maxDepth)) {
-                continue;
-            }
-            const imports = [];
-            const exports = [];
-            // Get imports
-            const importDeclarations = sourceFile.getImportDeclarations();
-            for (const imp of importDeclarations) {
-                const moduleSpecifier = imp.getModuleSpecifierValue();
-                // Skip external packages unless requested
-                if (!includeExternal && (moduleSpecifier.startsWith('@') || !moduleSpecifier.startsWith('.'))) {
-                    continue;
-                }
-                const resolvedPath = resolveImportPath(moduleSpecifier, filePath, projectPath);
-                if (resolvedPath) {
-                    imports.push(resolvedPath);
-                    // Add edge
-                    graph.edges.push({
-                        from: relativePath,
-                        to: resolvedPath,
-                        type: 'import'
-                    });
-                    // Update adjacency list
-                    if (!adjacencyList.has(relativePath)) {
-                        adjacencyList.set(relativePath, new Set());
-                    }
-                    adjacencyList.get(relativePath).add(resolvedPath);
-                }
-            }
-            // Get exports
-            const exportDeclarations = sourceFile.getExportDeclarations();
-            for (const exp of exportDeclarations) {
-                const namedExports = exp.getNamedExports();
-                for (const named of namedExports) {
-                    exports.push(named.getName());
-                }
-            }
-            // Also get exported declarations
-            const exportedDeclarations = sourceFile.getExportedDeclarations();
-            exportedDeclarations.forEach((declarations, name) => {
-                if (!exports.includes(name)) {
-                    exports.push(name);
-                }
-            });
-            const node = {
-                file: relativePath,
-                imports,
-                exports,
-                depth: 0
-            };
-            fileMap.set(relativePath, node);
-            graph.nodes.push(node);
-        }
-        // Detect circular dependencies
-        if (detectCircular) {
-            graph.circularDependencies = findCircularDependencies(adjacencyList);
-        }
-        // Detect clusters (strongly connected components)
-        graph.clusters = findClusters(adjacencyList);
-        // Generate output
-        let output = `## Dependency Graph Analysis\n\n`;
-        output += `**Project**: ${projectPath}\n`;
-        output += `**Files analyzed**: ${graph.nodes.length}\n`;
-        output += `**Dependencies**: ${graph.edges.length}\n\n`;
-        // Show target file dependencies if specified
-        if (targetFile) {
-            const targetNode = graph.nodes.find(n => n.file.includes(targetFile));
-            if (targetNode) {
-                output += `### ${targetFile} Dependencies\n\n`;
-                output += `**Imports** (${targetNode.imports.length}):\n`;
-                for (const imp of targetNode.imports) {
-                    output += `- ← ${imp}\n`;
-                }
-                output += `\n**Exports** (${targetNode.exports.length}):\n`;
-                for (const exp of targetNode.exports) {
-                    output += `- → ${exp}\n`;
-                }
-                output += '\n';
-            }
-        }
-        // Circular dependencies warning
-        if (graph.circularDependencies.length > 0) {
-            output += `### ⚠️ Circular Dependencies Detected\n\n`;
-            for (const cycle of graph.circularDependencies) {
-                output += `- ${cycle.join(' → ')} → ${cycle[0]}\n`;
-            }
-            output += '\n';
-        }
-        // Clusters
-        if (graph.clusters.length > 0) {
-            output += `### Module Clusters\n\n`;
-            for (let i = 0; i < graph.clusters.length; i++) {
-                if (graph.clusters[i].length > 1) {
-                    output += `**Cluster ${i + 1}** (${graph.clusters[i].length} files):\n`;
-                    for (const file of graph.clusters[i].slice(0, 5)) {
-                        output += `  - ${file}\n`;
-                    }
-                    if (graph.clusters[i].length > 5) {
-                        output += `  - ... and ${graph.clusters[i].length - 5} more\n`;
-                    }
-                    output += '\n';
-                }
-            }
-        }
-        // Mermaid diagram for small graphs
-        if (graph.nodes.length <= 20) {
-            output += `### Dependency Diagram\n\n`;
-            output += generateMermaidDiagram(graph);
-        }
-        // Statistics
-        output += `### Statistics\n\n`;
-        output += generateStatistics(graph);
-        return {
-            content: [{
-                    type: 'text',
-                    text: output
-                }]
-        };
-    }
-    catch (error) {
-        return {
-            content: [{
-                    type: 'text',
-                    text: `✗ Dependency analysis error: ${error instanceof Error ? error.message : 'Unknown error'}`
-                }]
-        };
-    }
-}
-function getRelativePath(filePath, projectPath) {
-    const normalizedFile = filePath.replace(/\\/g, '/');
-    const normalizedProject = projectPath.replace(/\\/g, '/');
-    return normalizedFile.replace(normalizedProject, '').replace(/^\//, '');
-}
-function resolveImportPath(moduleSpecifier, fromFile, projectPath) {
-    if (!moduleSpecifier.startsWith('.')) {
-        return null;
-    }
-    // Simple resolution - in real implementation would use ts-morph's resolution
-    const fromDir = fromFile.substring(0, fromFile.lastIndexOf('/'));
-    let resolved = moduleSpecifier;
-    if (moduleSpecifier.startsWith('./')) {
-        resolved = `${fromDir}/${moduleSpecifier.substring(2)}`;
-    }
-    else if (moduleSpecifier.startsWith('../')) {
-        const parts = fromDir.split('/');
-        const upCount = (moduleSpecifier.match(/\.\.\//g) || []).length;
-        parts.splice(-upCount);
-        resolved = `${parts.join('/')}/${moduleSpecifier.replace(/\.\.\//g, '')}`;
-    }
-    // Add .ts extension if missing
-    if (!resolved.endsWith('.ts') && !resolved.endsWith('.js')) {
-        resolved += '.ts';
-    }
-    return getRelativePath(resolved, projectPath);
-}
-function shouldIncludeInGraph(file, targetFile, maxDepth) {
-    // Simple heuristic - include files in same or nearby directories
-    const targetDir = targetFile.substring(0, targetFile.lastIndexOf('/'));
-    return file.startsWith(targetDir);
-}
-function findCircularDependencies(adjacencyList) {
-    const cycles = [];
-    const visited = new Set();
-    const recursionStack = new Set();
-    const path = [];
-    function dfs(node) {
-        visited.add(node);
-        recursionStack.add(node);
-        path.push(node);
-        const neighbors = adjacencyList.get(node) || new Set();
-        for (const neighbor of neighbors) {
-            if (!visited.has(neighbor)) {
-                dfs(neighbor);
-            }
-            else if (recursionStack.has(neighbor)) {
-                // Found cycle
-                const cycleStart = path.indexOf(neighbor);
-                const cycle = path.slice(cycleStart);
-                cycles.push([...cycle]);
-            }
-        }
-        path.pop();
-        recursionStack.delete(node);
-    }
-    for (const node of adjacencyList.keys()) {
-        if (!visited.has(node)) {
-            dfs(node);
-        }
-    }
-    return cycles;
-}
-function findClusters(adjacencyList) {
-    // Simple connected components using Union-Find
-    const parent = {};
-    for (const node of adjacencyList.keys()) {
-        parent[node] = node;
-    }
-    function find(x) {
-        if (parent[x] !== x) {
-            parent[x] = find(parent[x]);
-        }
-        return parent[x];
-    }
-    function union(x, y) {
-        const px = find(x);
-        const py = find(y);
-        if (px !== py) {
-            parent[px] = py;
-        }
-    }
-    for (const [node, neighbors] of adjacencyList) {
-        for (const neighbor of neighbors) {
-            if (parent[neighbor] !== undefined) {
-                union(node, neighbor);
-            }
-        }
-    }
-    const clusters = {};
-    for (const node of adjacencyList.keys()) {
-        const root = find(node);
-        if (!clusters[root]) {
-            clusters[root] = [];
-        }
-        clusters[root].push(node);
-    }
-    return Object.values(clusters).filter(c => c.length > 1);
-}
-function generateMermaidDiagram(graph) {
-    let diagram = '```mermaid\ngraph TD\n';
-    // Add nodes
-    for (const node of graph.nodes) {
-        const id = node.file.replace(/[^a-zA-Z0-9]/g, '_');
-        const label = node.file.split('/').pop() || node.file;
-        diagram += `  ${id}["${label}"]\n`;
-    }
-    // Add edges
-    for (const edge of graph.edges) {
-        const fromId = edge.from.replace(/[^a-zA-Z0-9]/g, '_');
-        const toId = edge.to.replace(/[^a-zA-Z0-9]/g, '_');
-        diagram += `  ${fromId} --> ${toId}\n`;
-    }
-    diagram += '```\n';
-    return diagram;
-}
-function generateStatistics(graph) {
-    // Calculate metrics
-    const importCounts = new Map();
-    const exportCounts = new Map();
-    for (const edge of graph.edges) {
-        importCounts.set(edge.to, (importCounts.get(edge.to) || 0) + 1);
-        exportCounts.set(edge.from, (exportCounts.get(edge.from) || 0) + 1);
-    }
-    // Most imported files
-    const topImported = [...importCounts.entries()]
-        .sort((a, b) => b[1] - a[1])
-        .slice(0, 5);
-    // Files with most dependencies
-    const topDependencies = graph.nodes
-        .map(n => ({ file: n.file, count: n.imports.length }))
-        .sort((a, b) => b.count - a.count)
-        .slice(0, 5);
-    let stats = `- **Total files**: ${graph.nodes.length}\n`;
-    stats += `- **Total dependencies**: ${graph.edges.length}\n`;
-    stats += `- **Circular dependencies**: ${graph.circularDependencies.length}\n`;
-    stats += `- **Clusters**: ${graph.clusters.length}\n\n`;
-    if (topImported.length > 0) {
-        stats += `**Most referenced files**:\n`;
-        for (const [file, count] of topImported) {
-            stats += `- ${file}: ${count} times\n`;
-        }
-        stats += '\n';
-    }
-    if (topDependencies.length > 0) {
-        stats += `**Files with most dependencies**:\n`;
-        for (const { file, count } of topDependencies) {
-            stats += `- ${file}: ${count} imports\n`;
-        }
-    }
-    return stats;
-}
-//# sourceMappingURL=analyzeDependencyGraph.js.map

package/dist/tools/semantic/analyzeDependencyGraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"analyzeDependencyGraph.js","sourceRoot":"","sources":["../../../src/tools/semantic/analyzeDependencyGraph.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAGhC,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAE/D,MAAM,CAAC,MAAM,gCAAgC,GAAmB;IAC9D,IAAI,EAAE,0BAA0B;IAChC,WAAW,EAAE;;;;;;;;;;;;kCAYmB;IAChC,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,cAAc;aAC5B;YACD,UAAU,EAAE;gBACV,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,qCAAqC;aACnD;YACD,QAAQ,EAAE;gBACR,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,sCAAsC;aACpD;YACD,eAAe,EAAE;gBACf,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,4CAA4C;aAC1D;YACD,cAAc,EAAE;gBACd,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,8CAA8C;aAC5D;SACF;QACD,QAAQ,EAAE,CAAC,aAAa,CAAC;KAC1B;IACD,WAAW,EAAE;QACX,KAAK,EAAE,0BAA0B;QACjC,QAAQ,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QAC/B,YAAY,EAAE,IAAI;QAClB,eAAe,EAAE,KAAK;QACtB,cAAc,EAAE,IAAI;QACpB,aAAa,EAAE,KAAK;KACrB;CACF,CAAC;AAwBF,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAAC,IAAgC;IAC3E,IAAI,CAAC;QACH,MAAM,EACJ,WAAW,EACX,UAAU,EACV,QAAQ,GAAG,CAAC,EACZ,eAAe,GAAG,KAAK,EACvB,cAAc,GAAG,IAAI,EACtB,GAAG,IAAI,CAAC;QAET,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAE7C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,OAAO,EAAE,CAAC;wBACR,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,uCAAuC,WAAW,EAAE;qBAC3D,CAAC;aACH,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAoB;YAC7B,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,EAAE;YACT,oBAAoB,EAAE,EAAE;YACxB,QAAQ,EAAE,EAAE;SACb,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;QAClD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;QAErD,yBAAyB;QACzB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,YAAY,GAAG,eAAe,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;YAE5D,+DAA+D;YAC/D,IAAI,UAAU,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,oBAAoB,CAAC,YAAY,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAClH,SAAS;YACX,CAAC;YAED,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;YAE7B,cAAc;YACd,MAAM,kBAAkB,GAAG,UAAU,CAAC,qBAAqB,EAAE,CAAC;YAC9D,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;gBACrC,MAAM,eAAe,GAAG,GAAG,CAAC,uBAAuB,EAAE,CAAC;gBAEtD,0CAA0C;gBAC1C,IAAI,CAAC,eAAe,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBAC9F,SAAS;gBACX,CAAC;gBAED,MAAM,YAAY,GAAG,iBAAiB,CAAC,eAAe,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;gBAC/E,IAAI,YAAY,EAAE,CAAC;oBACjB,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAE3B,WAAW;oBACX,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;wBACf,IAAI,EAAE,YAAY;wBAClB,EAAE,EAAE,YAAY;wBAChB,IAAI,EAAE,QAAQ;qBACf,CAAC,CAAC;oBAEH,wBAAwB;oBACxB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;wBACrC,aAAa,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBAC7C,CAAC;oBACD,aAAa,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;YAED,cAAc;YACd,MAAM,kBAAkB,GAAG,UAAU,CAAC,qBAAqB,EAAE,CAAC;YAC9D,KAAK,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;gBACrC,MAAM,YAAY,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC;gBAC3C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YAED,iCAAiC;YACjC,MAAM,oBAAoB,GAAG,UAAU,CAAC,uBAAuB,EAAE,CAAC;YAClE,oBAAoB,CAAC,OAAO,CAAC,CAAC,YAAmB,EAAE,IAAY,EAAE,EAAE;gBACjE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,MAAM,IAAI,GAAmB;gBAC3B,IAAI,EAAE,YAAY;gBAClB,OAAO;gBACP,OAAO;gBACP,KAAK,EAAE,CAAC;aACT,CAAC;YAEF,OAAO,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;YAChC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QAED,+BAA+B;QAC/B,IAAI,cAAc,EAAE,CAAC;YACnB,KAAK,CAAC,oBAAoB,GAAG,wBAAwB,CAAC,aAAa,CAAC,CAAC;QACvE,CAAC;QAED,kDAAkD;QAClD,KAAK,CAAC,QAAQ,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;QAE7C,kBAAkB;QAClB,IAAI,MAAM,GAAG,kCAAkC,CAAC;QAChD,MAAM,IAAI,gBAAgB,WAAW,IAAI,CAAC;QAC1C,MAAM,IAAI,uBAAuB,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;QACxD,MAAM,IAAI,qBAAqB,KAAK,CAAC,KAAK,CAAC,MAAM,MAAM,CAAC;QAExD,6CAA6C;QAC7C,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACtE,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,IAAI,OAAO,UAAU,mBAAmB,CAAC;gBAC/C,MAAM,IAAI,gBAAgB,UAAU,CAAC,OAAO,CAAC,MAAM,MAAM,CAAC;gBAC1D,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;oBACrC,MAAM,IAAI,OAAO,GAAG,IAAI,CAAC;gBAC3B,CAAC;gBACD,MAAM,IAAI,kBAAkB,UAAU,CAAC,OAAO,CAAC,MAAM,MAAM,CAAC;gBAC5D,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC;oBACrC,MAAM,IAAI,OAAO,GAAG,IAAI,CAAC;gBAC3B,CAAC;gBACD,MAAM,IAAI,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,KAAK,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,IAAI,2CAA2C,CAAC;YACtD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;YACrD,CAAC;YACD,MAAM,IAAI,IAAI,CAAC;QACjB,CAAC;QAED,WAAW;QACX,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,yBAAyB,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjC,MAAM,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,CAAC;oBACxE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;wBACjD,MAAM,IAAI,OAAO,IAAI,IAAI,CAAC;oBAC5B,CAAC;oBACD,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACjC,MAAM,IAAI,eAAe,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,SAAS,CAAC;oBACjE,CAAC;oBACD,MAAM,IAAI,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YAC7B,MAAM,IAAI,4BAA4B,CAAC;YACvC,MAAM,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QAED,aAAa;QACb,MAAM,IAAI,oBAAoB,CAAC;QAC/B,MAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAEpC,OAAO;YACL,OAAO,EAAE,CAAC;oBACR,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,MAAM;iBACb,CAAC;SACH,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,OAAO,EAAE,CAAC;oBACR,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,gCAAgC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE;iBACjG,CAAC;SACH,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,QAAgB,EAAE,WAAmB;IAC5D,MAAM,cAAc,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpD,MAAM,iBAAiB,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC1D,OAAO,cAAc,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,iBAAiB,CAAC,eAAuB,EAAE,QAAgB,EAAE,WAAmB;IACvF,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACjE,IAAI,QAAQ,GAAG,eAAe,CAAC;IAE/B,IAAI,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,QAAQ,GAAG,GAAG,OAAO,IAAI,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,CAAC;SAAM,IAAI,eAAe,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAChE,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;QACvB,QAAQ,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,eAAe,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;IAC5E,CAAC;IAED,+BAA+B;IAC/B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3D,QAAQ,IAAI,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,eAAe,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAY,EAAE,UAAkB,EAAE,QAAgB;IAC9E,iEAAiE;IACjE,MAAM,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;IACvE,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,wBAAwB,CAAC,aAAuC;IACvE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,IAAY;QACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,cAAc;gBACd,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAC,aAAuC;IAC3D,+CAA+C;IAC/C,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,SAAS,IAAI,CAAC,CAAS;QACrB,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACd,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;gBACnC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAA6B,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAsB;IACpD,IAAI,OAAO,GAAG,wBAAwB,CAAC;IAEvC,YAAY;IACZ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC;QACtD,OAAO,IAAI,KAAK,EAAE,KAAK,KAAK,MAAM,CAAC;IACrC,CAAC;IAED,YAAY;IACZ,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;QACnD,OAAO,IAAI,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC;IACzC,CAAC;IAED,OAAO,IAAI,OAAO,CAAC;IACnB,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAsB;IAChD,oBAAoB;IACpB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,sBAAsB;IACtB,MAAM,WAAW,GAAG,CAAC,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;SAC5C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEf,+BAA+B;IAC/B,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK;SAChC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;SACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEf,IAAI,KAAK,GAAG,sBAAsB,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;IACzD,KAAK,IAAI,6BAA6B,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;IAC7D,KAAK,IAAI,gCAAgC,KAAK,CAAC,oBAAoB,CAAC,MAAM,IAAI,CAAC;IAC/E,KAAK,IAAI,mBAAmB,KAAK,CAAC,QAAQ,CAAC,MAAM,MAAM,CAAC;IAExD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,IAAI,8BAA8B,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACxC,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,UAAU,CAAC;QACzC,CAAC;QACD,KAAK,IAAI,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,KAAK,IAAI,qCAAqC,CAAC;QAC/C,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,eAAe,EAAE,CAAC;YAC9C,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,YAAY,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/tools/semantic/astGrep.d.ts

@@ -1,25 +0,0 @@
-/**
- * ast-grep Tools - 패턴 기반 코드 검색/변환
- *
- * 지원 언어: JavaScript, TypeScript, TSX, JSX, HTML, CSS
- * (Python, Go, Rust 등은 ast-grep-napi에서 별도 동적 등록 필요)
- *
- * @ast-grep/napi는 네이티브 바이너리 optional dependency → 동적 import
- */
-import { ToolResult, ToolDefinition } from '../../infra/types/tool.js';
-export declare const astGrepSearchDefinition: ToolDefinition;
-export declare const astGrepReplaceDefinition: ToolDefinition;
-export declare function astGrepSearch(args: {
-    pattern: string;
-    path: string;
-    lang?: string;
-    maxResults?: number;
-}): Promise<ToolResult>;
-export declare function astGrepReplace(args: {
-    pattern: string;
-    replacement: string;
-    path: string;
-    lang?: string;
-    dryRun?: boolean;
-}): Promise<ToolResult>;
-//# sourceMappingURL=astGrep.d.ts.map

package/dist/tools/semantic/astGrep.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"astGrep.d.ts","sourceRoot":"","sources":["../../../src/tools/semantic/astGrep.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAKH,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AA+DvE,eAAO,MAAM,uBAAuB,EAAE,cAkCrC,CAAC;AAEF,eAAO,MAAM,wBAAwB,EAAE,cAsCtC,CAAC;AAsDF,wBAAsB,aAAa,CAAC,IAAI,EAAE;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB,GAAG,OAAO,CAAC,UAAU,CAAC,CAmEtB;AAED,wBAAsB,cAAc,CAAC,IAAI,EAAE;IACzC,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB,GAAG,OAAO,CAAC,UAAU,CAAC,CAgHtB"}