agent-ide 0.1.9 → 0.2.0

package/dist/core/analysis/complexity-analyzer.js

@@ -1,255 +0,0 @@
-/**
- * 程式碼複雜度分析器
- * 提供循環複雜度和認知複雜度分析功能
- */
-/**
- * 循環複雜度分析器
- * 基於 McCabe 複雜度計算方法
- */
-export class CyclomaticComplexityAnalyzer {
-    /**
-     * 計算循環複雜度
-     * @param ast AST 節點
-     * @returns 複雜度數值
-     */
-    calculate(ast) {
-        let complexity = 1; // 基礎路徑
-        const traverse = (node) => {
-            switch (node.type) {
-                case 'IfStatement':
-                case 'ConditionalExpression':
-                case 'ForStatement':
-                case 'WhileStatement':
-                case 'DoWhileStatement':
-                case 'CatchClause':
-                    complexity++;
-                    break;
-                case 'SwitchCase':
-                    if (!node.default) {
-                        complexity++;
-                    }
-                    break;
-                case 'LogicalExpression':
-                    if (node.operator === '||' || node.operator === '&&') {
-                        complexity++;
-                    }
-                    break;
-            }
-            // 遍歷子節點
-            if (node.children) {
-                node.children.forEach(traverse);
-            }
-        };
-        traverse(ast);
-        return complexity;
-    }
-    /**
-     * 評估複雜度等級
-     * @param complexity 複雜度數值
-     * @returns 複雜度等級
-     */
-    evaluate(complexity) {
-        if (complexity <= 5) {
-            return 'simple';
-        }
-        else if (complexity <= 10) {
-            return 'moderate';
-        }
-        else if (complexity <= 20) {
-            return 'complex';
-        }
-        else {
-            return 'very-complex';
-        }
-    }
-}
-/**
- * 認知複雜度分析器
- * 考慮巢狀深度對程式碼理解難度的影響
- */
-export class CognitiveComplexityAnalyzer {
-    nestingLevel = 0;
-    /**
-     * 計算認知複雜度
-     * @param ast AST 節點
-     * @returns 認知複雜度數值
-     */
-    calculate(ast) {
-        let complexity = 0;
-        this.nestingLevel = 0;
-        const traverse = (node) => {
-            switch (node.type) {
-                case 'IfStatement':
-                case 'ForStatement':
-                case 'WhileStatement':
-                case 'DoWhileStatement':
-                    complexity += 1 + this.nestingLevel;
-                    this.nestingLevel++;
-                    if (node.children) {
-                        node.children.forEach(traverse);
-                    }
-                    this.nestingLevel--;
-                    return; // 避免重複遍歷子節點
-                case 'CallExpression':
-                    if (this.isRecursive(node)) {
-                        complexity += 1;
-                    }
-                    break;
-                case 'FunctionExpression':
-                case 'ArrowFunctionExpression':
-                    this.nestingLevel++;
-                    if (node.children) {
-                        node.children.forEach(traverse);
-                    }
-                    this.nestingLevel--;
-                    return;
-                case 'CatchClause':
-                    complexity += 1 + this.nestingLevel;
-                    break;
-                case 'SwitchStatement':
-                    complexity += 1 + this.nestingLevel;
-                    this.nestingLevel++;
-                    if (node.children) {
-                        node.children.forEach(traverse);
-                    }
-                    this.nestingLevel--;
-                    return;
-                case 'ConditionalExpression':
-                case 'LogicalExpression':
-                    if (node.operator === '&&' || node.operator === '||') {
-                        complexity += 1;
-                    }
-                    break;
-            }
-            // 遍歷子節點
-            if (node.children) {
-                node.children.forEach(traverse);
-            }
-        };
-        traverse(ast);
-        return complexity;
-    }
-    /**
-     * 檢查是否為遞歸調用
-     */
-    isRecursive(node) {
-        // 簡化實作，實際應該檢查調用的函式名稱
-        return false;
-    }
-    /**
-     * 評估認知複雜度等級
-     */
-    evaluate(complexity) {
-        if (complexity <= 5) {
-            return 'simple';
-        }
-        else if (complexity <= 10) {
-            return 'moderate';
-        }
-        else if (complexity <= 15) {
-            return 'complex';
-        }
-        else {
-            return 'very-complex';
-        }
-    }
-}
-/**
- * 綜合複雜度分析器
- * 整合循環複雜度和認知複雜度分析
- */
-export class ComplexityAnalyzer {
-    cyclomaticAnalyzer = new CyclomaticComplexityAnalyzer();
-    cognitiveAnalyzer = new CognitiveComplexityAnalyzer();
-    /**
-     * 分析程式碼複雜度
-     * @param code 程式碼字串
-     * @returns 複雜度分析結果
-     */
-    async analyzeCode(code) {
-        // 輸入驗證
-        if (typeof code !== 'string') {
-            throw new Error('程式碼必須是字串類型');
-        }
-        if (code.length === 0) {
-            return {
-                cyclomaticComplexity: 1,
-                cognitiveComplexity: 0,
-                evaluation: 'simple'
-            };
-        }
-        // 簡化的 AST 生成（實際應該使用真正的 parser）
-        const ast = this.parseCodeToAST(code);
-        const cyclomaticComplexity = this.cyclomaticAnalyzer.calculate(ast);
-        const cognitiveComplexity = this.cognitiveAnalyzer.calculate(ast);
-        return {
-            cyclomaticComplexity,
-            cognitiveComplexity,
-            evaluation: this.cyclomaticAnalyzer.evaluate(cyclomaticComplexity)
-        };
-    }
-    /**
-     * 簡化的程式碼解析為 AST
-     * 實際實作中應該使用完整的 TypeScript 或 JavaScript parser
-     */
-    parseCodeToAST(code) {
-        // 簡化實作：根據程式碼內容建立模擬的 AST
-        const children = [];
-        // 檢測條件語句
-        const ifMatches = code.match(/if\s*\(/g) || [];
-        ifMatches.forEach(() => {
-            children.push({ type: 'IfStatement', children: [] });
-        });
-        // 檢測迴圈
-        const forMatches = code.match(/for\s*\(/g) || [];
-        forMatches.forEach(() => {
-            children.push({ type: 'ForStatement', children: [] });
-        });
-        const whileMatches = code.match(/while\s*\(/g) || [];
-        whileMatches.forEach(() => {
-            children.push({ type: 'WhileStatement', children: [] });
-        });
-        // 檢測邏輯運算子
-        const logicalMatches = code.match(/(\|\||&&)/g) || [];
-        logicalMatches.forEach((operator) => {
-            children.push({
-                type: 'LogicalExpression',
-                operator: operator,
-                children: []
-            });
-        });
-        return {
-            type: 'Program',
-            children
-        };
-    }
-    /**
-     * 批次分析多個檔案的複雜度
-     */
-    async analyzeFiles(files) {
-        if (!Array.isArray(files)) {
-            throw new Error('檔案列表必須是陣列');
-        }
-        const results = await Promise.all(files.map(async (file) => {
-            try {
-                // 讀取檔案內容
-                const fs = await import('fs/promises');
-                const code = await fs.readFile(file, 'utf-8');
-                const complexity = await this.analyzeCode(code);
-                return { file, complexity };
-            }
-            catch (error) {
-                return {
-                    file,
-                    complexity: {
-                        cyclomaticComplexity: 0,
-                        cognitiveComplexity: 0,
-                        evaluation: 'error'
-                    }
-                };
-            }
-        }));
-        return results;
-    }
-}
-//# sourceMappingURL=complexity-analyzer.js.map

package/dist/core/analysis/complexity-analyzer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"complexity-analyzer.js","sourceRoot":"","sources":["../../../src/core/analysis/complexity-analyzer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAiBH;;;GAGG;AACH,MAAM,OAAO,4BAA4B;IACvC;;;;OAIG;IACH,SAAS,CAAC,GAAY;QACpB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,OAAO;QAE3B,MAAM,QAAQ,GAAG,CAAC,IAAa,EAAE,EAAE;YACjC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpB,KAAK,aAAa,CAAC;gBACnB,KAAK,uBAAuB,CAAC;gBAC7B,KAAK,cAAc,CAAC;gBACpB,KAAK,gBAAgB,CAAC;gBACtB,KAAK,kBAAkB,CAAC;gBACxB,KAAK,aAAa;oBAChB,UAAU,EAAE,CAAC;oBACb,MAAM;gBACR,KAAK,YAAY;oBACf,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;wBAClB,UAAU,EAAE,CAAC;oBACf,CAAC;oBACD,MAAM;gBACR,KAAK,mBAAmB;oBACtB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACrD,UAAU,EAAE,CAAC;oBACf,CAAC;oBACD,MAAM;YACR,CAAC;YAED,QAAQ;YACR,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,UAAkB;QACzB,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,QAAQ,CAAC;QAClB,CAAC;aAAM,IAAI,UAAU,IAAI,EAAE,EAAE,CAAC;YAC5B,OAAO,UAAU,CAAC;QACpB,CAAC;aAAM,IAAI,UAAU,IAAI,EAAE,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,OAAO,cAAc,CAAC;QACxB,CAAC;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,2BAA2B;IAC9B,YAAY,GAAG,CAAC,CAAC;IAEzB;;;;OAIG;IACH,SAAS,CAAC,GAAY;QACpB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QAEtB,MAAM,QAAQ,GAAG,CAAC,IAAa,EAAE,EAAE;YACjC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpB,KAAK,aAAa,CAAC;gBACnB,KAAK,cAAc,CAAC;gBACpB,KAAK,gBAAgB,CAAC;gBACtB,KAAK,kBAAkB;oBACrB,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;oBACpC,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAClC,CAAC;oBACD,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,OAAO,CAAC,YAAY;gBACtB,KAAK,gBAAgB;oBACnB,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC3B,UAAU,IAAI,CAAC,CAAC;oBAClB,CAAC;oBACD,MAAM;gBACR,KAAK,oBAAoB,CAAC;gBAC1B,KAAK,yBAAyB;oBAC5B,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAClC,CAAC;oBACD,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,OAAO;gBACT,KAAK,aAAa;oBAChB,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;oBACpC,MAAM;gBACR,KAAK,iBAAiB;oBACpB,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;oBACpC,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAClC,CAAC;oBACD,IAAI,CAAC,YAAY,EAAE,CAAC;oBACpB,OAAO;gBACT,KAAK,uBAAuB,CAAC;gBAC7B,KAAK,mBAAmB;oBACtB,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;wBACrD,UAAU,IAAI,CAAC,CAAC;oBAClB,CAAC;oBACD,MAAM;YACR,CAAC;YAED,QAAQ;YACR,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,IAAa;QAC/B,qBAAqB;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,UAAkB;QACzB,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACpB,OAAO,QAAQ,CAAC;QAClB,CAAC;aAAM,IAAI,UAAU,IAAI,EAAE,EAAE,CAAC;YAC5B,OAAO,UAAU,CAAC;QACpB,CAAC;aAAM,IAAI,UAAU,IAAI,EAAE,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,OAAO,cAAc,CAAC;QACxB,CAAC;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACrB,kBAAkB,GAAG,IAAI,4BAA4B,EAAE,CAAC;IACxD,iBAAiB,GAAG,IAAI,2BAA2B,EAAE,CAAC;IAE9D;;;;OAIG;IACH,KAAK,CAAC,WAAW,CAAC,IAAY;QAC5B,OAAO;QACP,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO;gBACL,oBAAoB,EAAE,CAAC;gBACvB,mBAAmB,EAAE,CAAC;gBACtB,UAAU,EAAE,QAAQ;aACrB,CAAC;QACJ,CAAC;QAED,+BAA+B;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAEtC,MAAM,oBAAoB,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACpE,MAAM,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAElE,OAAO;YACL,oBAAoB;YACpB,mBAAmB;YACnB,UAAU,EAAE,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,oBAAoB,CAAC;SACnE,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,IAAY;QACjC,wBAAwB;QACxB,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,SAAS;QACT,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC/C,SAAS,CAAC,OAAO,CAAC,GAAG,EAAE;YACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,OAAO;QACP,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACjD,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE;YACtB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACrD,YAAY,CAAC,OAAO,CAAC,GAAG,EAAE;YACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,UAAU;QACV,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;QACtD,cAAc,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;YAClC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,mBAAmB;gBACzB,QAAQ,EAAE,QAAuB;gBACjC,QAAQ,EAAE,EAAE;aACb,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,IAAI,EAAE,SAAS;YACf,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,KAAe;QAIhC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACvB,IAAI,CAAC;gBACH,SAAS;gBACT,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,CAAC;gBACvC,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC9C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;YAC9B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO;oBACL,IAAI;oBACJ,UAAU,EAAE;wBACV,oBAAoB,EAAE,CAAC;wBACvB,mBAAmB,EAAE,CAAC;wBACtB,UAAU,EAAE,OAAO;qBACpB;iBACF,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CACH,CAAC;QAEF,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/core/analysis/dead-code-detector.d.ts

@@ -1,152 +0,0 @@
-/**
- * 死代碼檢測器
- * 檢測未使用的變數、函式、類別和不可達代碼
- */
-import { TypeScriptParser } from '../../plugins/typescript/parser.js';
-import type { AST } from '../../shared/types/index.js';
-export interface LegacySymbol {
-    name: string;
-    type: 'variable' | 'function' | 'class' | 'import';
-    location: {
-        line: number;
-        column: number;
-    };
-    references: Reference[];
-    exported: boolean;
-    parameter: boolean;
-}
-export interface Reference {
-    location: {
-        line: number;
-        column: number;
-    };
-    type: 'read' | 'write' | 'call';
-}
-export interface UnusedCode {
-    type: 'variable' | 'function' | 'class' | 'import' | 'unreachable';
-    name?: string;
-    location: {
-        line: number;
-        column: number;
-    };
-    confidence: number;
-    reason?: string;
-}
-export interface ASTNode {
-    type: string;
-    children?: ASTNode[];
-    location: {
-        line: number;
-        column: number;
-    };
-    isTerminator?: boolean;
-    name?: string;
-    exported?: boolean;
-}
-/**
- * 未使用符號檢測器
- */
-export declare class UnusedSymbolDetector {
-    /**
-     * 檢測未使用的符號
-     * @param ast AST 物件
-     * @param parser TypeScript parser 實例（重用以提升效能）
-     * @returns 未使用的符號列表
-     */
-    detect(ast: AST, parser: TypeScriptParser): Promise<UnusedCode[]>;
-    /**
-     * 建立引用映射表（批次處理）
-     * 優化：使用 Promise.all 並行處理多個符號
-     */
-    private buildReferenceMap;
-    /**
-     * 檢查符號是否已匯出
-     */
-    private isExported;
-    /**
-     * 檢查是否為函式參數
-     */
-    private isParameter;
-    /**
-     * 檢查是否為 public 或 protected 類別成員
-     * 這些成員可能被子類別或外部程式碼使用，單檔案模式無法檢測
-     */
-    private isPublicOrProtectedMember;
-    /**
-     * 映射符號類型到 UnusedCode 類型
-     */
-    private mapSymbolType;
-    /**
-     * 計算檢測置信度
-     */
-    private calculateConfidence;
-    /**
-     * 清理資源
-     */
-    dispose(): Promise<void>;
-}
-/**
- * 不可達代碼檢測器
- */
-export declare class UnreachableCodeDetector {
-    /**
-     * 檢測不可達代碼
-     * @param ast AST 根節點
-     * @returns 不可達代碼列表
-     */
-    detect(ast: ASTNode): UnusedCode[];
-    /**
-     * 遍歷 AST 檢測不可達代碼
-     */
-    private traverse;
-    /**
-     * 檢查是否為可執行語句
-     */
-    private isExecutableStatement;
-    /**
-     * 檢查是否為終止語句
-     */
-    private isTerminatingStatement;
-}
-/**
- * 死代碼檢測器主類
- */
-export declare class DeadCodeDetector {
-    private unusedSymbolDetector;
-    private unreachableCodeDetector;
-    private parser;
-    /**
-     * 檢測檔案中的死代碼
-     * @param filePath 檔案路徑
-     * @param content 檔案內容
-     * @returns 死代碼檢測結果
-     */
-    detectInFile(filePath: string, content: string): Promise<UnusedCode[]>;
-    /**
-     * 批次檢測多個檔案
-     * @param files 檔案路徑列表
-     * @returns 每個檔案的死代碼檢測結果
-     */
-    detectInFiles(files: string[]): Promise<Array<{
-        file: string;
-        deadCode: UnusedCode[];
-    }>>;
-    /**
-     * 轉換 TypeScript AST 到舊版 AST 格式（用於不可達代碼檢測）
-     */
-    private convertToLegacyAST;
-    /**
-     * 獲取檢測統計
-     */
-    getStatistics(files: string[]): Promise<{
-        totalFiles: number;
-        totalDeadCode: number;
-        byType: Record<string, number>;
-        averageConfidence: number;
-    }>;
-    /**
-     * 清理資源
-     */
-    dispose(): Promise<void>;
-}
-//# sourceMappingURL=dead-code-detector.d.ts.map

package/dist/core/analysis/dead-code-detector.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dead-code-detector.d.ts","sourceRoot":"","sources":["../../../src/core/analysis/dead-code-detector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,KAAK,EAAU,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAI/D,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,GAAG,UAAU,GAAG,OAAO,GAAG,QAAQ,CAAC;IACnD,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;CACjC;AAGD,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,UAAU,GAAG,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,aAAa,CAAC;IACnE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAGD,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC;IACrB,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,qBAAa,oBAAoB;IAG/B;;;;;OAKG;IACG,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,gBAAgB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IA6DvE;;;OAGG;YACW,iBAAiB;IAmC/B;;OAEG;IACH,OAAO,CAAC,UAAU;IAIlB;;OAEG;IACH,OAAO,CAAC,WAAW;IAUnB;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IAgBjC;;OAEG;IACH,OAAO,CAAC,aAAa;IAcrB;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAe3B;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAG/B;AAED;;GAEG;AACH,qBAAa,uBAAuB;IAClC;;;;OAIG;IACH,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,UAAU,EAAE;IAQlC;;OAEG;IACH,OAAO,CAAC,QAAQ;IAgChB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;CAO/B;AAED;;GAEG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,oBAAoB,CAA8B;IAC1D,OAAO,CAAC,uBAAuB,CAAiC;IAChE,OAAO,CAAC,MAAM,CAA0B;IAExC;;;;;OAKG;IACG,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAuC5E;;;;OAIG;IACG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QAClD,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,EAAE,UAAU,EAAE,CAAC;KACxB,CAAC,CAAC;IA8BH;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAS1B;;OAEG;IACG,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAC5C,UAAU,EAAE,MAAM,CAAC;QACnB,aAAa,EAAE,MAAM,CAAC;QACtB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/B,iBAAiB,EAAE,MAAM,CAAC;KAC3B,CAAC;IAoBF;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAI/B"}