semantic-complexity 0.0.7-741984fb → 0.0.13-2aaf183b

package/dist/metrics/cyclomatic.js

@@ -1,121 +0,0 @@
-import ts from 'typescript';
-import { getSourceLocation, extractFunctionInfo } from '../ast/parser.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 function calculateCyclomaticComplexity(node, sourceFile) {
-    let complexity = 1; // 기본 경로
-    const details = [];
-    function addDetail(node, type, description) {
-        details.push({
-            type,
-            location: getSourceLocation(node, sourceFile),
-            increment: 1,
-            nestingLevel: 0, // 순환복잡도에서는 중첩 레벨 무시
-            description,
-        });
-        complexity++;
-    }
-    function visit(node) {
-        switch (node.kind) {
-            case ts.SyntaxKind.IfStatement:
-                addDetail(node, 'if', 'if 조건문');
-                break;
-            case ts.SyntaxKind.CaseClause:
-                addDetail(node, 'case', 'switch case');
-                break;
-            case ts.SyntaxKind.DefaultClause:
-                // default는 복잡도에 포함하지 않음 (경로가 아닌 fallback)
-                break;
-            case ts.SyntaxKind.ForStatement:
-                addDetail(node, 'for', 'for 반복문');
-                break;
-            case ts.SyntaxKind.ForInStatement:
-                addDetail(node, 'for-in', 'for-in 반복문');
-                break;
-            case ts.SyntaxKind.ForOfStatement:
-                addDetail(node, 'for-of', 'for-of 반복문');
-                break;
-            case ts.SyntaxKind.WhileStatement:
-                addDetail(node, 'while', 'while 반복문');
-                break;
-            case ts.SyntaxKind.DoStatement:
-                addDetail(node, 'do-while', 'do-while 반복문');
-                break;
-            case ts.SyntaxKind.CatchClause:
-                addDetail(node, 'catch', 'catch 예외 처리');
-                break;
-            case ts.SyntaxKind.ConditionalExpression:
-                addDetail(node, 'conditional', '삼항 연산자');
-                break;
-            case ts.SyntaxKind.BinaryExpression: {
-                const binary = node;
-                if (binary.operatorToken.kind === ts.SyntaxKind.AmpersandAmpersandToken) {
-                    addDetail(node, 'logical-and', '논리 AND (&&)');
-                }
-                else if (binary.operatorToken.kind === ts.SyntaxKind.BarBarToken) {
-                    addDetail(node, 'logical-or', '논리 OR (||)');
-                }
-                else if (binary.operatorToken.kind === ts.SyntaxKind.QuestionQuestionToken) {
-                    addDetail(node, 'nullish-coalescing', 'Nullish coalescing (??)');
-                }
-                break;
-            }
-            default:
-                break;
-        }
-        ts.forEachChild(node, visit);
-    }
-    visit(node);
-    return { complexity, details };
-}
-/**
- * 함수 노드에서 순환복잡도 계산
- */
-export function analyzeFunctionCyclomatic(functionNode, sourceFile, functionInfo) {
-    const { complexity, details } = calculateCyclomaticComplexity(functionNode, sourceFile);
-    return {
-        function: functionInfo,
-        cyclomatic: complexity,
-        cognitive: 0, // cognitive.ts에서 별도 계산
-        details,
-    };
-}
-/**
- * 소스 파일의 모든 함수에 대한 순환복잡도 계산
- */
-export function analyzeFileCyclomatic(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 = analyzeFunctionCyclomatic(node, sourceFile, functionInfo);
-            results.push(result);
-        }
-        // 자식 노드 순회
-        ts.forEachChild(node, (child) => visit(child, className));
-    }
-    visit(sourceFile);
-    return results;
-}
-//# sourceMappingURL=cyclomatic.js.map

package/dist/metrics/cyclomatic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cyclomatic.js","sourceRoot":"","sources":["../../src/metrics/cyclomatic.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAC;AAO5B,OAAO,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAE1E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,6BAA6B,CAC3C,IAAa,EACb,UAAyB;IAEzB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ;IAC5B,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,SAAS,SAAS,CAChB,IAAa,EACb,IAA2B,EAC3B,WAAmB;QAEnB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI;YACJ,QAAQ,EAAE,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC;YAC7C,SAAS,EAAE,CAAC;YACZ,YAAY,EAAE,CAAC,EAAE,oBAAoB;YACrC,WAAW;SACZ,CAAC,CAAC;QACH,UAAU,EAAE,CAAC;IACf,CAAC;IAED,SAAS,KAAK,CAAC,IAAa;QAC1B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAC5B,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAChC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,UAAU;gBAC3B,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;gBACvC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,aAAa;gBAC9B,0CAA0C;gBAC1C,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,YAAY;gBAC7B,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;gBAClC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;gBACxC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;gBACxC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,cAAc;gBAC/B,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;gBACtC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAC5B,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;gBAC5C,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW;gBAC5B,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;gBACxC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB;gBACtC,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;gBACzC,MAAM;YAER,KAAK,EAAE,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACpC,MAAM,MAAM,GAAG,IAA2B,CAAC;gBAC3C,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,uBAAuB,EAAE,CAAC;oBACxE,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;gBAChD,CAAC;qBAAM,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC;oBACnE,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;gBAC9C,CAAC;qBAAM,IACL,MAAM,CAAC,aAAa,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,CAAC,qBAAqB,EACjE,CAAC;oBACD,SAAS,CAAC,IAAI,EAAE,oBAAoB,EAAE,yBAAyB,CAAC,CAAC;gBACnE,CAAC;gBACD,MAAM;YACR,CAAC;YAED;gBACE,MAAM;QACV,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC;IAEZ,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,YAAqB,EACrB,UAAyB,EACzB,YAA0B;IAE1B,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,6BAA6B,CAC3D,YAAY,EACZ,UAAU,CACX,CAAC;IAEF,OAAO;QACL,QAAQ,EAAE,YAAY;QACtB,UAAU,EAAE,UAAU;QACtB,SAAS,EAAE,CAAC,EAAE,uBAAuB;QACrC,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,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,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;YACzE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,WAAW;QACX,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,CAAC;IAClB,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/metrics/dimensional.d.ts

@@ -1,32 +0,0 @@
-/**
- * 차원 기반 복잡도 분석 (Dimensional Complexity)
- *
- * 1D: 제어 흐름 (순환복잡도 기반) - cyclomatic.ts
- * 2D: 중첩 (인지복잡도 기반) - cognitive.ts
- * 3D: 상태 복잡도 - 이 파일
- * 4D: 비동기 복잡도 - 이 파일
- * 5D: 숨은 결합 복잡도 - 이 파일
- */
-import * as ts from 'typescript';
-import type { StateComplexity, AsyncComplexity, CouplingComplexity, DimensionalComplexity, DimensionalWeights } from '../types.js';
-/**
- * 상태 복잡도 분석
- */
-export declare function analyzeStateComplexity(node: ts.Node, sourceFile: ts.SourceFile): StateComplexity;
-/**
- * 비동기 복잡도 분석
- */
-export declare function analyzeAsyncComplexity(node: ts.Node, sourceFile: ts.SourceFile): AsyncComplexity;
-/**
- * 숨은 결합 복잡도 분석
- */
-export declare function analyzeCouplingComplexity(node: ts.Node, sourceFile: ts.SourceFile, scopeVariables?: Set<string>): CouplingComplexity;
-/**
- * 기본 가중치
- */
-export declare const DEFAULT_WEIGHTS: DimensionalWeights;
-/**
- * 차원 기반 복잡도 전체 분석
- */
-export declare function analyzeDimensionalComplexity(node: ts.Node, sourceFile: ts.SourceFile, cyclomatic: number, nestingPenalty: number, weights?: DimensionalWeights): DimensionalComplexity;
-//# sourceMappingURL=dimensional.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"dimensional.d.ts","sourceRoot":"","sources":["../../src/metrics/dimensional.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,MAAM,YAAY,CAAC;AACjC,OAAO,KAAK,EAEV,eAAe,EACf,eAAe,EACf,kBAAkB,EAElB,qBAAqB,EACrB,kBAAkB,EAEnB,MAAM,aAAa,CAAC;AAwBrB;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,GACxB,eAAe,CA+FjB;AAuBD;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,GACxB,eAAe,CAmHjB;AA0CD;;GAEG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,EACzB,cAAc,GAAE,GAAG,CAAC,MAAM,CAAa,GACtC,kBAAkB,CAoKpB;AAgCD;;GAEG;AACH,eAAO,MAAM,eAAe,EAAE,kBAM7B,CAAC;AA2CF;;GAEG;AACH,wBAAgB,4BAA4B,CAC1C,IAAI,EAAE,EAAE,CAAC,IAAI,EACb,UAAU,EAAE,EAAE,CAAC,UAAU,EACzB,UAAU,EAAE,MAAM,EAClB,cAAc,EAAE,MAAM,EACtB,OAAO,GAAE,kBAAoC,GAC5C,qBAAqB,CAqEvB"}