semantic-complexity 0.0.7-741984fb → 0.0.15-f5745e88

package/dist/graph/dependency.js

@@ -1,296 +0,0 @@
-import * as path from 'node:path';
-import * as fs from 'node:fs';
-import { parseSourceFile, extractImports } from '../ast/parser.js';
-/**
- * 의존성 그래프 빌더
- */
-export class DependencyGraph {
-    nodes = new Map();
-    projectRoot;
-    constructor(projectRoot) {
-        this.projectRoot = path.resolve(projectRoot);
-    }
-    /**
-     * 프로젝트 루트 경로 반환
-     */
-    getProjectRoot() {
-        return this.projectRoot;
-    }
-    /**
-     * 파일의 의존성 분석
-     */
-    analyzeFile(filePath, content) {
-        const absPath = path.resolve(filePath);
-        const normalizedPath = this.normalizePath(absPath);
-        // 이미 분석된 경우 캐시된 결과 반환
-        const existing = this.nodes.get(normalizedPath);
-        if (existing)
-            return existing;
-        // 파일 내용 읽기
-        const fileContent = content ?? this.readFile(absPath);
-        if (!fileContent) {
-            const node = {
-                filePath: normalizedPath,
-                imports: [],
-                importedBy: [],
-                depth: -1,
-            };
-            this.nodes.set(normalizedPath, node);
-            return node;
-        }
-        // 파싱 및 import 추출
-        const sourceFile = parseSourceFile(absPath, fileContent);
-        const imports = extractImports(sourceFile);
-        // import 경로 해석
-        const resolvedImports = imports
-            .map((imp) => this.resolveImportPath(absPath, imp.source))
-            .filter((p) => p !== null);
-        // 노드 생성
-        const node = {
-            filePath: normalizedPath,
-            imports: resolvedImports,
-            importedBy: [],
-            depth: 0,
-        };
-        this.nodes.set(normalizedPath, node);
-        // 역방향 참조 업데이트
-        for (const importPath of resolvedImports) {
-            const importNode = this.nodes.get(importPath);
-            if (importNode && !importNode.importedBy.includes(normalizedPath)) {
-                importNode.importedBy.push(normalizedPath);
-            }
-        }
-        return node;
-    }
-    /**
-     * 디렉토리 내 모든 파일 분석
-     */
-    analyzeDirectory(dirPath, extensions = ['.ts', '.tsx', '.js', '.jsx']) {
-        const files = this.findFiles(dirPath, extensions);
-        for (const file of files) {
-            this.analyzeFile(file);
-        }
-        // 모든 파일 분석 후 역방향 참조 재구성
-        this.rebuildReverseReferences();
-        // 깊이 계산
-        this.calculateDepths();
-    }
-    /**
-     * 특정 파일에서 시작하는 의존성 트리 구축
-     */
-    buildDependencyTree(filePath, maxDepth = 5) {
-        const absPath = path.resolve(filePath);
-        const normalizedPath = this.normalizePath(absPath);
-        const visited = new Set();
-        const result = [];
-        const traverse = (nodePath, depth) => {
-            if (depth > maxDepth || visited.has(nodePath))
-                return;
-            visited.add(nodePath);
-            let node = this.nodes.get(nodePath);
-            if (!node) {
-                node = this.analyzeFile(nodePath);
-            }
-            const nodeWithDepth = { ...node, depth };
-            result.push(nodeWithDepth);
-            for (const importPath of node.imports) {
-                traverse(importPath, depth + 1);
-            }
-        };
-        traverse(normalizedPath, 0);
-        return result;
-    }
-    /**
-     * 특정 파일을 참조하는 파일들 찾기
-     */
-    findDependents(filePath, maxDepth = 5) {
-        const absPath = path.resolve(filePath);
-        const normalizedPath = this.normalizePath(absPath);
-        const visited = new Set();
-        const result = [];
-        const traverse = (nodePath, depth) => {
-            if (depth > maxDepth || visited.has(nodePath))
-                return;
-            visited.add(nodePath);
-            const node = this.nodes.get(nodePath);
-            if (!node)
-                return;
-            const nodeWithDepth = { ...node, depth };
-            result.push(nodeWithDepth);
-            for (const dependentPath of node.importedBy) {
-                traverse(dependentPath, depth + 1);
-            }
-        };
-        traverse(normalizedPath, 0);
-        return result;
-    }
-    /**
-     * 노드 조회
-     */
-    getNode(filePath) {
-        const normalizedPath = this.normalizePath(path.resolve(filePath));
-        return this.nodes.get(normalizedPath);
-    }
-    /**
-     * 모든 노드 반환
-     */
-    getAllNodes() {
-        return Array.from(this.nodes.values());
-    }
-    /**
-     * 순환 의존성 탐지
-     */
-    findCircularDependencies() {
-        const cycles = [];
-        const visited = new Set();
-        const recursionStack = new Set();
-        const dfs = (nodePath, path) => {
-            visited.add(nodePath);
-            recursionStack.add(nodePath);
-            const node = this.nodes.get(nodePath);
-            if (!node)
-                return false;
-            for (const importPath of node.imports) {
-                if (!visited.has(importPath)) {
-                    if (dfs(importPath, [...path, importPath])) {
-                        return true;
-                    }
-                }
-                else if (recursionStack.has(importPath)) {
-                    // 순환 발견
-                    const cycleStart = path.indexOf(importPath);
-                    if (cycleStart >= 0) {
-                        cycles.push([...path.slice(cycleStart), importPath]);
-                    }
-                    else {
-                        cycles.push([...path, importPath]);
-                    }
-                }
-            }
-            recursionStack.delete(nodePath);
-            return false;
-        };
-        for (const nodePath of this.nodes.keys()) {
-            if (!visited.has(nodePath)) {
-                dfs(nodePath, [nodePath]);
-            }
-        }
-        return cycles;
-    }
-    // ─── Private Methods ───────────────────────────────────────────
-    normalizePath(filePath) {
-        return filePath.replace(/\\/g, '/');
-    }
-    readFile(filePath) {
-        try {
-            return fs.readFileSync(filePath, 'utf-8');
-        }
-        catch {
-            return null;
-        }
-    }
-    resolveImportPath(fromFile, importSource) {
-        // 상대 경로만 처리 (node_modules 제외)
-        if (!importSource.startsWith('.')) {
-            return null;
-        }
-        const fromDir = path.dirname(fromFile);
-        const resolved = path.resolve(fromDir, importSource);
-        // 확장자가 없으면 추가
-        const extensions = ['.ts', '.tsx', '.js', '.jsx', '/index.ts', '/index.tsx', '/index.js', '/index.jsx'];
-        for (const ext of extensions) {
-            const candidate = resolved + ext;
-            if (fs.existsSync(candidate)) {
-                return this.normalizePath(candidate);
-            }
-        }
-        // 이미 확장자가 있는 경우
-        if (fs.existsSync(resolved)) {
-            return this.normalizePath(resolved);
-        }
-        return null;
-    }
-    findFiles(dirPath, extensions) {
-        const files = [];
-        const traverse = (dir) => {
-            try {
-                const entries = fs.readdirSync(dir, { withFileTypes: true });
-                for (const entry of entries) {
-                    const fullPath = path.join(dir, entry.name);
-                    // node_modules 등 제외
-                    if (entry.name.startsWith('.') || entry.name === 'node_modules' || entry.name === 'dist') {
-                        continue;
-                    }
-                    if (entry.isDirectory()) {
-                        traverse(fullPath);
-                    }
-                    else if (extensions.some((ext) => entry.name.endsWith(ext))) {
-                        files.push(fullPath);
-                    }
-                }
-            }
-            catch {
-                // 접근 불가 디렉토리 무시
-            }
-        };
-        traverse(dirPath);
-        return files;
-    }
-    rebuildReverseReferences() {
-        // 기존 역참조 초기화
-        for (const node of this.nodes.values()) {
-            node.importedBy = [];
-        }
-        // 역참조 재구성
-        for (const node of this.nodes.values()) {
-            for (const importPath of node.imports) {
-                const importNode = this.nodes.get(importPath);
-                if (importNode && !importNode.importedBy.includes(node.filePath)) {
-                    importNode.importedBy.push(node.filePath);
-                }
-            }
-        }
-    }
-    calculateDepths() {
-        // 루트 노드 찾기 (참조되지 않는 노드)
-        const roots = Array.from(this.nodes.values()).filter((node) => node.importedBy.length === 0);
-        // BFS로 깊이 계산
-        const visited = new Set();
-        const queue = roots.map((r) => ({
-            path: r.filePath,
-            depth: 0,
-        }));
-        while (queue.length > 0) {
-            const { path: nodePath, depth } = queue.shift();
-            if (visited.has(nodePath))
-                continue;
-            visited.add(nodePath);
-            const node = this.nodes.get(nodePath);
-            if (!node)
-                continue;
-            node.depth = depth;
-            for (const importPath of node.imports) {
-                if (!visited.has(importPath)) {
-                    queue.push({ path: importPath, depth: depth + 1 });
-                }
-            }
-        }
-    }
-}
-/**
- * 의존성 그래프를 DOT 형식으로 출력 (시각화용)
- */
-export function exportToDot(graph) {
-    const lines = ['digraph DependencyGraph {', '  rankdir=TB;'];
-    for (const node of graph.getAllNodes()) {
-        const shortName = path.basename(node.filePath);
-        lines.push(`  "${shortName}" [label="${shortName}"];`);
-        for (const importPath of node.imports) {
-            const importName = path.basename(importPath);
-            lines.push(`  "${shortName}" -> "${importName}";`);
-        }
-    }
-    lines.push('}');
-    return lines.join('\n');
-}
-//# sourceMappingURL=dependency.js.map

package/dist/graph/dependency.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dependency.js","sourceRoot":"","sources":["../../src/graph/dependency.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAE9B,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAEnE;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,KAAK,GAAgC,IAAI,GAAG,EAAE,CAAC;IAC/C,WAAW,CAAS;IAE5B,YAAY,WAAmB;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAgB,EAAE,OAAgB;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAEnD,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAE9B,WAAW;QACX,MAAM,WAAW,GAAG,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACtD,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,IAAI,GAAmB;gBAC3B,QAAQ,EAAE,cAAc;gBACxB,OAAO,EAAE,EAAE;gBACX,UAAU,EAAE,EAAE;gBACd,KAAK,EAAE,CAAC,CAAC;aACV,CAAC;YACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iBAAiB;QACjB,MAAM,UAAU,GAAG,eAAe,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAE3C,eAAe;QACf,MAAM,eAAe,GAAG,OAAO;aAC5B,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;aACzD,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAE1C,QAAQ;QACR,MAAM,IAAI,GAAmB;YAC3B,QAAQ,EAAE,cAAc;YACxB,OAAO,EAAE,eAAe;YACxB,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,CAAC;SACT,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAErC,cAAc;QACd,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;YACzC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;gBAClE,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,OAAe,EACf,UAAU,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC;QAE3C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAEhC,QAAQ;QACR,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,QAAgB,EAAE,QAAQ,GAAG,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,MAAM,QAAQ,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;YACnD,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YACtD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEtB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACpC,CAAC;YAED,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAE3B,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtC,QAAQ,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,QAAgB,EAAE,QAAQ,GAAG,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,MAAM,QAAQ,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAE,EAAE;YACnD,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,OAAO;YACtD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAE3B,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC5C,QAAQ,CAAC,aAAa,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,QAAgB;QACtB,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,wBAAwB;QACtB,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,MAAM,GAAG,GAAG,CAAC,QAAgB,EAAE,IAAc,EAAW,EAAE;YACxD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtB,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YAExB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC;wBAC3C,OAAO,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC1C,QAAQ;oBACR,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC5C,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;wBACpB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;oBACvD,CAAC;yBAAM,CAAC;wBACN,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;oBACrC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,GAAG,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kEAAkE;IAE1D,aAAa,CAAC,QAAgB;QACpC,OAAO,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;IAEO,QAAQ,CAAC,QAAgB;QAC/B,IAAI,CAAC;YACH,OAAO,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,iBAAiB,CACvB,QAAgB,EAChB,YAAoB;QAEpB,8BAA8B;QAC9B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAErD,cAAc;QACd,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;QAExG,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,QAAQ,GAAG,GAAG,CAAC;YACjC,IAAI,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,IAAI,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS,CAAC,OAAe,EAAE,UAAoB;QACrD,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,EAAE;YAC/B,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;oBAE5C,oBAAoB;oBACpB,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;wBACzF,SAAS;oBACX,CAAC;oBAED,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;wBACxB,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBACrB,CAAC;yBAAM,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;wBAC9D,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,gBAAgB;YAClB,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClB,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,wBAAwB;QAC9B,aAAa;QACb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QACvB,CAAC;QAED,UAAU;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC9C,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjE,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,eAAe;QACrB,wBAAwB;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAClD,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CACvC,CAAC;QAEF,aAAa;QACb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAsC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjE,IAAI,EAAE,CAAC,CAAC,QAAQ;YAChB,KAAK,EAAE,CAAC;SACT,CAAC,CAAC,CAAC;QAEJ,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACjD,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YAEnB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAsB;IAChD,MAAM,KAAK,GAAG,CAAC,2BAA2B,EAAE,eAAe,CAAC,CAAC;IAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,MAAM,SAAS,aAAa,SAAS,KAAK,CAAC,CAAC;QAEvD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAC7C,KAAK,CAAC,IAAI,CAAC,MAAM,SAAS,SAAS,UAAU,IAAI,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/graph/index.d.ts

@@ -1,3 +0,0 @@
-export { DependencyGraph, exportToDot } from './dependency.js';
-export { CallGraph, exportToMermaid } from './call.js';
-//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC"}

package/dist/graph/index.js

@@ -1,3 +0,0 @@
-export { DependencyGraph, exportToDot } from './dependency.js';
-export { CallGraph, exportToMermaid } from './call.js';
-//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC"}

package/dist/metrics/cognitive.d.ts

@@ -1,42 +0,0 @@
-import ts from 'typescript';
-import type { ComplexityResult, ComplexityDetail, FunctionInfo } from '../types.js';
-/**
- * SonarSource 인지복잡도 계산
- *
- * 기본 원칙:
- * 1. 중첩은 복잡성을 증가시킨다 (nesting penalty)
- * 2. 선형 흐름 중단은 복잡성을 증가시킨다 (structural increment)
- * 3. 일부 구조는 "하이브리드" (둘 다 적용)
- *
- * Structural Increment (+1):
- * - if, else if, else
- * - switch
- * - for, for-in, for-of, while, do-while
- * - catch
- * - goto (JS/TS에서는 labeled break/continue)
- * - 재귀 호출
- * - 중첩 함수
- *
- * Nesting Penalty (+nesting level):
- * - if, else if, else (중첩 시)
- * - switch (중첩 시)
- * - for, for-in, for-of, while, do-while (중첩 시)
- * - catch (중첩 시)
- * - 삼항 연산자 (중첩 시)
- * - 중첩 함수
- *
- * 참고: 순환복잡도와 달리 &&, ||, ??는 시퀀스가 아닌 경우에만 카운트
- */
-export declare function calculateCognitiveComplexity(node: ts.Node, sourceFile: ts.SourceFile, currentFunctionName?: string): {
-    complexity: number;
-    details: ComplexityDetail[];
-};
-/**
- * 함수 노드에서 인지복잡도 계산
- */
-export declare function analyzeFunctionCognitive(functionNode: ts.Node, sourceFile: ts.SourceFile, functionInfo: FunctionInfo): ComplexityResult;
-/**
- * 소스 파일의 모든 함수에 대한 인지복잡도 계산
- */
-export declare function analyzeFileCognitive(sourceFile: ts.SourceFile): ComplexityResult[];
-//# sourceMappingURL=cognitive.d.ts.map

package/dist/metrics/cognitive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cognitive.d.ts","sourceRoot":"","sources":["../../src/metrics/cognitive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAEhB,YAAY,EACb,MAAM,aAAa,CAAC;AAGrB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,EACzB,mBAAmB,CAAC,EAAE,MAAM,GAC3B;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,gBAAgB,EAAE,CAAA;CAAE,CA6KrD;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,YAAY,EAAE,EAAE,CAAC,IAAI,EACrB,UAAU,EAAE,EAAE,CAAC,UAAU,EACzB,YAAY,EAAE,YAAY,GACzB,gBAAgB,CAalB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,EAAE,CAAC,UAAU,GACxB,gBAAgB,EAAE,CAwBpB"}

package/dist/metrics/cognitive.js

@@ -1,204 +0,0 @@
-import ts from 'typescript';
-import { getSourceLocation, extractFunctionInfo } from '../ast/parser.js';
-/**
- * SonarSource 인지복잡도 계산
- *
- * 기본 원칙:
- * 1. 중첩은 복잡성을 증가시킨다 (nesting penalty)
- * 2. 선형 흐름 중단은 복잡성을 증가시킨다 (structural increment)
- * 3. 일부 구조는 "하이브리드" (둘 다 적용)
- *
- * Structural Increment (+1):
- * - if, else if, else
- * - switch
- * - for, for-in, for-of, while, do-while
- * - catch
- * - goto (JS/TS에서는 labeled break/continue)
- * - 재귀 호출
- * - 중첩 함수
- *
- * Nesting Penalty (+nesting level):
- * - if, else if, else (중첩 시)
- * - switch (중첩 시)
- * - for, for-in, for-of, while, do-while (중첩 시)
- * - catch (중첩 시)
- * - 삼항 연산자 (중첩 시)
- * - 중첩 함수
- *
- * 참고: 순환복잡도와 달리 &&, ||, ??는 시퀀스가 아닌 경우에만 카운트
- */
-export function calculateCognitiveComplexity(node, sourceFile, currentFunctionName) {
-    let complexity = 0;
-    const details = [];
-    function addDetail(node, type, increment, nestingLevel, description) {
-        const totalIncrement = increment + nestingLevel;
-        details.push({
-            type,
-            location: getSourceLocation(node, sourceFile),
-            increment: totalIncrement,
-            nestingLevel,
-            description: `${description} (+${increment}${nestingLevel > 0 ? ` +${nestingLevel} nesting` : ''})`,
-        });
-        complexity += totalIncrement;
-    }
-    function visit(node, nestingLevel, inLogicalSequence) {
-        switch (node.kind) {
-            case ts.SyntaxKind.IfStatement: {
-                const ifStmt = node;
-                // if 또는 else if
-                const parent = node.parent;
-                const isElseIf = parent &&
-                    ts.isIfStatement(parent) &&
-                    parent.elseStatement === node;
-                if (isElseIf) {
-                    addDetail(node, 'else-if', 1, 0, 'else if'); // else if는 nesting penalty 없음
-                }
-                else {
-                    addDetail(node, 'if', 1, nestingLevel, 'if 조건문');
-                }
-                // then 브랜치
-                visit(ifStmt.thenStatement, nestingLevel + 1, false);
-                // else 브랜치
-                if (ifStmt.elseStatement) {
-                    if (ts.isIfStatement(ifStmt.elseStatement)) {
-                        // else if는 nesting 증가 없이 순회
-                        visit(ifStmt.elseStatement, nestingLevel, false);
-                    }
-                    else {
-                        addDetail(ifStmt.elseStatement, 'else', 1, 0, 'else');
-                        visit(ifStmt.elseStatement, nestingLevel + 1, false);
-                    }
-                }
-                return; // 자식 노드 이미 처리함
-            }
-            case ts.SyntaxKind.SwitchStatement:
-                addDetail(node, 'switch', 1, nestingLevel, 'switch 문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.ForStatement:
-                addDetail(node, 'for', 1, nestingLevel, 'for 반복문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.ForInStatement:
-                addDetail(node, 'for-in', 1, nestingLevel, 'for-in 반복문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.ForOfStatement:
-                addDetail(node, 'for-of', 1, nestingLevel, 'for-of 반복문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.WhileStatement:
-                addDetail(node, 'while', 1, nestingLevel, 'while 반복문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.DoStatement:
-                addDetail(node, 'do-while', 1, nestingLevel, 'do-while 반복문');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.CatchClause:
-                addDetail(node, 'catch', 1, nestingLevel, 'catch 예외 처리');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.ConditionalExpression:
-                addDetail(node, 'conditional', 1, nestingLevel, '삼항 연산자');
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            case ts.SyntaxKind.BinaryExpression: {
-                const binary = node;
-                const op = binary.operatorToken.kind;
-                // 논리 연산자 시퀀스 처리
-                // a && b && c 는 +1 (시퀀스)
-                // a && b || c 는 +2 (다른 연산자)
-                const isLogical = op === ts.SyntaxKind.AmpersandAmpersandToken ||
-                    op === ts.SyntaxKind.BarBarToken ||
-                    op === ts.SyntaxKind.QuestionQuestionToken;
-                if (isLogical) {
-                    const parentBinary = node.parent;
-                    const isContinuingSequence = inLogicalSequence &&
-                        ts.isBinaryExpression(parentBinary) &&
-                        parentBinary.operatorToken.kind === op;
-                    if (!isContinuingSequence) {
-                        const type = op === ts.SyntaxKind.AmpersandAmpersandToken
-                            ? 'logical-and'
-                            : op === ts.SyntaxKind.BarBarToken
-                                ? 'logical-or'
-                                : 'nullish-coalescing';
-                        const desc = op === ts.SyntaxKind.AmpersandAmpersandToken
-                            ? '논리 AND 시퀀스'
-                            : op === ts.SyntaxKind.BarBarToken
-                                ? '논리 OR 시퀀스'
-                                : 'Nullish coalescing 시퀀스';
-                        addDetail(node, type, 1, 0, desc);
-                    }
-                    visit(binary.left, nestingLevel, true);
-                    visit(binary.right, nestingLevel, true);
-                    return;
-                }
-                break;
-            }
-            case ts.SyntaxKind.FunctionDeclaration:
-            case ts.SyntaxKind.FunctionExpression:
-            case ts.SyntaxKind.ArrowFunction: {
-                // 중첩 함수 (콜백)
-                if (nestingLevel > 0) {
-                    addDetail(node, 'nested-function', 1, nestingLevel, '중첩 함수/콜백');
-                }
-                // 중첩 함수 내부는 새로운 nesting 시작
-                ts.forEachChild(node, (child) => visit(child, nestingLevel + 1, false));
-                return;
-            }
-            case ts.SyntaxKind.CallExpression: {
-                // 재귀 호출 감지
-                const call = node;
-                if (currentFunctionName &&
-                    ts.isIdentifier(call.expression) &&
-                    call.expression.text === currentFunctionName) {
-                    addDetail(node, 'recursion', 1, 0, '재귀 호출');
-                }
-                break;
-            }
-            default:
-                break;
-        }
-        ts.forEachChild(node, (child) => visit(child, nestingLevel, inLogicalSequence));
-    }
-    visit(node, 0, false);
-    return { complexity, details };
-}
-/**
- * 함수 노드에서 인지복잡도 계산
- */
-export function analyzeFunctionCognitive(functionNode, sourceFile, functionInfo) {
-    const { complexity, details } = calculateCognitiveComplexity(functionNode, sourceFile, functionInfo.name !== '<anonymous>' ? functionInfo.name : undefined);
-    return {
-        function: functionInfo,
-        cyclomatic: 0, // cyclomatic.ts에서 별도 계산
-        cognitive: complexity,
-        details,
-    };
-}
-/**
- * 소스 파일의 모든 함수에 대한 인지복잡도 계산
- */
-export function analyzeFileCognitive(sourceFile) {
-    const results = [];
-    function visit(node, className) {
-        // 클래스 처리
-        if (ts.isClassDeclaration(node) || ts.isClassExpression(node)) {
-            const name = node.name?.getText(sourceFile) ?? '<anonymous>';
-            node.members.forEach((member) => visit(member, name));
-            return;
-        }
-        // 함수 노드 확인
-        const functionInfo = extractFunctionInfo(node, sourceFile, className);
-        if (functionInfo) {
-            const result = analyzeFunctionCognitive(node, sourceFile, functionInfo);
-            results.push(result);
-        }
-        // 자식 노드 순회 - 중첩 함수는 별도로 분석하지 않음 (상위 함수에 포함)
-        // 최상위 레벨 함수만 독립적으로 분석
-    }
-    ts.forEachChild(sourceFile, (node) => visit(node));
-    return results;
-}
-//# sourceMappingURL=cognitive.js.map

package/dist/metrics/cognitive.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cognitive.js","sourceRoot":"","sources":["../../src/metrics/cognitive.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAO5B,OAAO,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAE1E;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,4BAA4B,CAC1C,IAAa,EACb,UAAyB,EACzB,mBAA4B;IAE5B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,SAAS,SAAS,CAChB,IAAa,EACb,IAA2B,EAC3B,SAAiB,EACjB,YAAoB,EACpB,WAAmB;QAEnB,MAAM,cAAc,GAAG,SAAS,GAAG,YAAY,CAAC;QAChD,OAAO,CAAC,IAAI,CAAC;YACX,IAAI;YACJ,QAAQ,EAAE,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC;YAC7C,SAAS,EAAE,cAAc;YACzB,YAAY;YACZ,WAAW,EAAE,GAAG,WAAW,MAAM,SAAS,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG;SACpG,CAAC,CAAC;QACH,UAAU,IAAI,cAAc,CAAC;IAC/B,CAAC;IAED,SAAS,KAAK,CAAC,IAAa,EAAE,YAAoB,EAAE,iBAA0B;QAC5E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAsB,CAAC;gBAEtC,gBAAgB;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC3B,MAAM,QAAQ,GACZ,MAAM;oBACN,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC;oBACxB,MAAM,CAAC,aAAa,KAAK,IAAI,CAAC;gBAEhC,IAAI,QAAQ,EAAE,CAAC;oBACb,SAAS,CAAC,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,8BAA8B;gBAC7E,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;gBACnD,CAAC;gBAED,WAAW;gBACX,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;gBAErD,WAAW;gBACX,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;oBACzB,IAAI,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;wBAC3C,4BAA4B;wBAC5B,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;oBACnD,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;wBACtD,KAAK,CAAC,MAAM,CAAC,aAAa,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;oBACvD,CAAC;gBACH,CAAC;gBACD,OAAO,CAAC,eAAe;YACzB,CAAC;YAED,KAAK,EAAE,CAAC,UAAU,CAAC,eAAe;gBAChC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;gBACvD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY;gBAC7B,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;gBACnD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;gBACzD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;gBACzD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;gBACvD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAC5B,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;gBAC7D,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAC5B,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;gBACzD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB;gBACtC,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;gBAC1D,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YAET,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACpC,MAAM,MAAM,GAAG,IAA2B,CAAC;gBAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;gBAErC,gBAAgB;gBAChB,yBAAyB;gBACzB,4BAA4B;gBAC5B,MAAM,SAAS,GACb,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB;oBAC5C,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;oBAChC,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB,CAAC;gBAE7C,IAAI,SAAS,EAAE,CAAC;oBACd,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC;oBACjC,MAAM,oBAAoB,GACxB,iBAAiB;wBACjB,EAAE,CAAC,kBAAkB,CAAC,YAAY,CAAC;wBACnC,YAAY,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC;oBAEzC,IAAI,CAAC,oBAAoB,EAAE,CAAC;wBAC1B,MAAM,IAAI,GACR,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB;4BAC1C,CAAC,CAAC,aAAa;4BACf,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gCAChC,CAAC,CAAC,YAAY;gCACd,CAAC,CAAC,oBAAoB,CAAC;wBAC7B,MAAM,IAAI,GACR,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB;4BAC1C,CAAC,CAAC,YAAY;4BACd,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gCAChC,CAAC,CAAC,WAAW;gCACb,CAAC,CAAC,wBAAwB,CAAC;wBACjC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;oBACpC,CAAC;oBAED,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;oBACvC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;oBACxC,OAAO;gBACT,CAAC;gBACD,MAAM;YACR,CAAC;YAED,KAAK,EAAE,CAAC,UAAU,CAAC,mBAAmB,CAAC;YACvC,KAAK,EAAE,CAAC,UAAU,CAAC,kBAAkB,CAAC;YACtC,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,CAAC;gBACjC,aAAa;gBACb,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACrB,SAAS,CAAC,IAAI,EAAE,iBAAiB,EAAE,CAAC,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;gBAClE,CAAC;gBACD,2BAA2B;gBAC3B,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACxE,OAAO;YACT,CAAC;YAED,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC;gBAClC,WAAW;gBACX,MAAM,IAAI,GAAG,IAAyB,CAAC;gBACvC,IACE,mBAAmB;oBACnB,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;oBAChC,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,mBAAmB,EAC5C,CAAC;oBACD,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;gBAC9C,CAAC;gBACD,MAAM;YACR,CAAC;YAED;gBACE,MAAM;QACV,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE,iBAAiB,CAAC,CAAC,CAAC;IAClF,CAAC;IAED,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAEtB,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,YAAqB,EACrB,UAAyB,EACzB,YAA0B;IAE1B,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAC1D,YAAY,EACZ,UAAU,EACV,YAAY,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CACpE,CAAC;IAEF,OAAO;QACL,QAAQ,EAAE,YAAY;QACtB,UAAU,EAAE,CAAC,EAAE,wBAAwB;QACvC,SAAS,EAAE,UAAU;QACrB,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAyB;IAEzB,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,SAAS,KAAK,CAAC,IAAa,EAAE,SAAkB;QAC9C,SAAS;QACT,IAAI,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,IAAI,aAAa,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;YACtD,OAAO;QACT,CAAC;QAED,WAAW;QACX,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QACtE,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,wBAAwB,CAAC,IAAI,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;YACxE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,4CAA4C;QAC5C,sBAAsB;IACxB,CAAC;IAED,EAAE,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/metrics/cyclomatic.d.ts

@@ -1,31 +0,0 @@
-import ts from 'typescript';
-import type { ComplexityResult, ComplexityDetail, FunctionInfo } from '../types.js';
-/**
- * McCabe 순환복잡도 계산
- *
- * V(G) = E - N + 2P
- * 단순화: 분기점 개수 + 1
- *
- * 분기점:
- * - if, else if
- * - case (switch)
- * - for, for-in, for-of
- * - while, do-while
- * - catch
- * - 삼항 연산자 (?:)
- * - 논리 AND (&&), OR (||)
- * - nullish coalescing (??)
- */
-export declare function calculateCyclomaticComplexity(node: ts.Node, sourceFile: ts.SourceFile): {
-    complexity: number;
-    details: ComplexityDetail[];
-};
-/**
- * 함수 노드에서 순환복잡도 계산
- */
-export declare function analyzeFunctionCyclomatic(functionNode: ts.Node, sourceFile: ts.SourceFile, functionInfo: FunctionInfo): ComplexityResult;
-/**
- * 소스 파일의 모든 함수에 대한 순환복잡도 계산
- */
-export declare function analyzeFileCyclomatic(sourceFile: ts.SourceFile): ComplexityResult[];
-//# sourceMappingURL=cyclomatic.d.ts.map

package/dist/metrics/cyclomatic.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cyclomatic.d.ts","sourceRoot":"","sources":["../../src/metrics/cyclomatic.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAEhB,YAAY,EACb,MAAM,aAAa,CAAC;AAGrB;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,6BAA6B,CAC3C,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,GACxB;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,gBAAgB,EAAE,CAAA;CAAE,CAqFrD;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,YAAY,EAAE,EAAE,CAAC,IAAI,EACrB,UAAU,EAAE,EAAE,CAAC,UAAU,EACzB,YAAY,EAAE,YAAY,GACzB,gBAAgB,CAYlB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,EAAE,CAAC,UAAU,GACxB,gBAAgB,EAAE,CAwBpB"}