@theihtisham/agent-shadow-brain 2.1.0 → 3.0.0

package/dist/brain/ast-analyzer.js

@@ -0,0 +1,462 @@
+// src/brain/ast-analyzer.ts — AST-level code analysis: function complexity, nesting depth, parameter count
+// v3.0.0 — Deep structural code analysis without external AST dependencies
+import * as fs from 'fs';
+import * as path from 'path';
+const IGNORE_DIRS = new Set([
+    'node_modules', '.git', 'dist', 'build', 'out', 'target', 'vendor',
+    '__pycache__', '.next', '.nuxt', 'coverage', '.cache', '.tox',
+    'venv', '.venv', 'env', '.env', 'bin', 'obj', 'Pods', '.gradle',
+]);
+const CODE_EXTENSIONS = new Set(['.ts', '.tsx', '.js', '.jsx', '.py', '.rs', '.go', '.java']);
+export class ASTAnalyzer {
+    constructor(projectDir) {
+        this.projectDir = projectDir;
+    }
+    async analyzeProject(maxFiles = 100) {
+        const files = this.collectFiles(this.projectDir, maxFiles);
+        const insights = [];
+        for (const filePath of files) {
+            const functions = this.extractFunctionInfo(filePath);
+            for (const fn of functions) {
+                const fnInsights = this.analyzeFunction(fn, filePath);
+                insights.push(...fnInsights);
+            }
+            // File-level analysis
+            const fileInsights = this.analyzeFileStructure(filePath);
+            insights.push(...fileInsights);
+        }
+        return insights;
+    }
+    extractFunctionInfo(filePath) {
+        const ext = path.extname(filePath);
+        if (['.ts', '.tsx', '.js', '.jsx'].includes(ext)) {
+            return this.extractJSFunctions(filePath);
+        }
+        else if (ext === '.py') {
+            return this.extractPythonFunctions(filePath);
+        }
+        return [];
+    }
+    extractJSFunctions(filePath) {
+        let content;
+        try {
+            content = fs.readFileSync(filePath, 'utf-8');
+        }
+        catch {
+            return [];
+        }
+        const functions = [];
+        const lines = content.split('\n');
+        // Match function declarations, arrow functions, method definitions
+        const patterns = [
+            // Named function: function name(...) { or =>
+            /^(?:export\s+)?(?:async\s+)?function\s+(\w+)\s*\(([^)]*)\)/,
+            // Arrow function: const name = (...) => { or const name = (...) =>
+            /^(?:export\s+)?(?:const|let|var)\s+(\w+)\s*=\s*(?:async\s*)?\(([^)]*)\)\s*=>/,
+            // Method: name(...) { (in class)
+            /^\s+(?:async\s+)?(\w+)\s*\(([^)]*)\)\s*\{/,
+            // Class method shorthand
+            /^(?:public|private|protected|static)?\s*(?:async\s+)?(\w+)\s*\(([^)]*)\)\s*[:(]/,
+        ];
+        for (let i = 0; i < lines.length; i++) {
+            const line = lines[i];
+            for (const pattern of patterns) {
+                const match = line.match(pattern);
+                if (match) {
+                    const name = match[1];
+                    const params = match[2].split(',').filter(p => p.trim().length > 0).length;
+                    const startLine = i + 1;
+                    const endLine = this.findFunctionEnd(lines, i);
+                    const body = lines.slice(i, endLine).join('\n');
+                    const nestingDepth = this.calculateNestingDepth(body);
+                    const returnPaths = this.countReturnPaths(body);
+                    const cyclomaticComplexity = this.calculateCyclomaticComplexity(body);
+                    const cognitiveComplexity = this.calculateCognitiveComplexity(body);
+                    const isExported = /^(export|module\.exports)/.test(line.trim());
+                    const isAsync = /async\s/.test(line);
+                    functions.push({
+                        name,
+                        file: path.relative(this.projectDir, filePath),
+                        startLine,
+                        endLine: endLine + 1,
+                        params,
+                        nestingDepth,
+                        returnPaths,
+                        cyclomaticComplexity,
+                        cognitiveComplexity,
+                        linesOfCode: endLine - i + 1,
+                        isExported,
+                        isAsync,
+                        isPure: this.assessPurity(body),
+                    });
+                    break; // matched one pattern, skip remaining
+                }
+            }
+        }
+        return functions;
+    }
+    extractPythonFunctions(filePath) {
+        let content;
+        try {
+            content = fs.readFileSync(filePath, 'utf-8');
+        }
+        catch {
+            return [];
+        }
+        const functions = [];
+        const lines = content.split('\n');
+        for (let i = 0; i < lines.length; i++) {
+            const match = lines[i].match(/^(?:async\s+)?def\s+(\w+)\s*\(([^)]*)\)/);
+            if (match) {
+                const name = match[1];
+                const params = match[2].split(',').filter(p => p.trim().length > 0 && p.trim() !== 'self').length;
+                const startLine = i + 1;
+                const endLine = this.findPythonFunctionEnd(lines, i);
+                const body = lines.slice(i, endLine).join('\n');
+                functions.push({
+                    name,
+                    file: path.relative(this.projectDir, filePath),
+                    startLine,
+                    endLine: endLine + 1,
+                    params,
+                    nestingDepth: this.calculatePythonNesting(body),
+                    returnPaths: (body.match(/\breturn\b/g) || []).length,
+                    cyclomaticComplexity: this.calculatePythonComplexity(body),
+                    cognitiveComplexity: this.calculatePythonCognitiveComplexity(body),
+                    linesOfCode: endLine - i + 1,
+                    isExported: !lines[i].startsWith('_'),
+                    isAsync: /async\s+def/.test(lines[i]),
+                    isPure: true, // conservative
+                });
+            }
+        }
+        return functions;
+    }
+    analyzeFunction(fn, filePath) {
+        const insights = [];
+        const relPath = path.relative(this.projectDir, filePath);
+        // High cyclomatic complexity
+        if (fn.cyclomaticComplexity > 10) {
+            insights.push({
+                type: 'warning',
+                priority: fn.cyclomaticComplexity > 20 ? 'critical' : 'high',
+                title: `[complexity] Function "${fn.name}" has cyclomatic complexity of ${fn.cyclomaticComplexity}`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} has cyclomatic complexity ${fn.cyclomaticComplexity} (threshold: 10).\n` +
+                    `  Parameters: ${fn.params}, Nesting depth: ${fn.nestingDepth}, Return paths: ${fn.returnPaths}\n` +
+                    `  Lines of code: ${fn.linesOfCode}\n` +
+                    `  High complexity makes code hard to test, understand, and maintain.\n` +
+                    `  Consider: Extract helper functions, use early returns, simplify conditionals, apply guard clauses.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.95,
+                metadata: { complexity: fn.cyclomaticComplexity, lines: fn.linesOfCode },
+            });
+        }
+        else if (fn.cyclomaticComplexity > 5) {
+            insights.push({
+                type: 'suggestion',
+                priority: 'medium',
+                title: `[complexity] Function "${fn.name}" complexity ${fn.cyclomaticComplexity} (moderate)`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} has moderate complexity (${fn.cyclomaticComplexity}).\n` +
+                    `  Consider simplifying if possible — complexity above 5 increases testing difficulty.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.9,
+            });
+        }
+        // Too many parameters
+        if (fn.params > 5) {
+            insights.push({
+                type: 'suggestion',
+                priority: fn.params > 7 ? 'high' : 'medium',
+                title: `[design] Function "${fn.name}" has ${fn.params} parameters`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} accepts ${fn.params} parameters.\n` +
+                    `  Functions with more than 3-4 parameters are hard to call correctly.\n` +
+                    `  Consider: Use an options/config object, extract a builder, or group related parameters.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.9,
+            });
+        }
+        // Deep nesting
+        if (fn.nestingDepth > 4) {
+            insights.push({
+                type: 'warning',
+                priority: fn.nestingDepth > 6 ? 'critical' : 'high',
+                title: `[complexity] Deep nesting (${fn.nestingDepth} levels) in "${fn.name}"`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} has ${fn.nestingDepth} levels of nesting.\n` +
+                    `  Deep nesting reduces readability and increases bug surface.\n` +
+                    `  Consider: Early returns, extract nested logic into separate functions, use guard clauses.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.95,
+            });
+        }
+        // Very long functions
+        if (fn.linesOfCode > 50) {
+            insights.push({
+                type: 'suggestion',
+                priority: fn.linesOfCode > 100 ? 'high' : 'medium',
+                title: `[quality] Function "${fn.name}" is ${fn.linesOfCode} lines long`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} spans ${fn.linesOfCode} lines.\n` +
+                    `  Long functions are harder to understand, test, and reuse.\n` +
+                    `  Consider: Extract logical sections into named helper functions.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.85,
+            });
+        }
+        // Too many return paths
+        if (fn.returnPaths > 5) {
+            insights.push({
+                type: 'suggestion',
+                priority: 'medium',
+                title: `[quality] Function "${fn.name}" has ${fn.returnPaths} return paths`,
+                content: `Function \`${fn.name}\` in ${relPath}:${fn.startLine} has ${fn.returnPaths} distinct return paths.\n` +
+                    `  Multiple return paths increase testing complexity and can hide edge cases.\n` +
+                    `  Consider: Consolidate return logic, use result objects, or apply the single-exit principle.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.8,
+            });
+        }
+        return insights;
+    }
+    analyzeFileStructure(filePath) {
+        const insights = [];
+        let content;
+        try {
+            content = fs.readFileSync(filePath, 'utf-8');
+        }
+        catch {
+            return insights;
+        }
+        const lines = content.split('\n');
+        const relPath = path.relative(this.projectDir, filePath);
+        const lineCount = lines.length;
+        // Very large files
+        if (lineCount > 500) {
+            insights.push({
+                type: 'warning',
+                priority: lineCount > 1000 ? 'high' : 'medium',
+                title: `[architecture] Large file: ${relPath} (${lineCount} lines)`,
+                content: `File ${relPath} has ${lineCount} lines. Large files indicate potential SRP violations.\n` +
+                    `  Consider splitting into focused modules with clear responsibilities.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.85,
+            });
+        }
+        // Too many imports
+        const importLines = lines.filter(l => /^\s*(import\s|from\s|require\s*\()/.test(l));
+        if (importLines.length > 20) {
+            insights.push({
+                type: 'suggestion',
+                priority: 'medium',
+                title: `[architecture] High import count in ${relPath} (${importLines.length})`,
+                content: `File ${relPath} has ${importLines.length} imports. This may indicate the module has too many responsibilities.\n` +
+                    `  Consider: Split into smaller modules, consolidate related imports, use barrel exports.`,
+                files: [relPath],
+                timestamp: new Date(),
+                confidence: 0.8,
+            });
+        }
+        // TODO/FIXME/HACK comments
+        const todoPatterns = [
+            { regex: /TODO|FIXME|HACK|XXX|OPTIMIZE/gi, label: 'action item' },
+        ];
+        for (const { regex, label } of todoPatterns) {
+            const matches = [...content.matchAll(regex)];
+            if (matches.length > 3) {
+                insights.push({
+                    type: 'suggestion',
+                    priority: 'low',
+                    title: `[quality] ${matches.length} ${label}s in ${relPath}`,
+                    content: `File ${relPath} contains ${matches.length} ${label} comments (TODO/FIXME/HACK/XXX).\n` +
+                        `  Consider addressing these or converting to tracked issues.`,
+                    files: [relPath],
+                    timestamp: new Date(),
+                    confidence: 0.95,
+                });
+            }
+        }
+        return insights;
+    }
+    // ── Complexity Calculators ──────────────────────────────────────────────────
+    calculateCyclomaticComplexity(code) {
+        // McCabe's cyclomatic complexity: 1 + number of decisions
+        let complexity = 1;
+        const decisionPatterns = [
+            /\bif\b/g, /\belse\s+if\b/g, /\bfor\b/g, /\bwhile\b/g,
+            /\bcase\b/g, /\?.*:/g, /&&/g, /\|\|/g, /\?\?/g,
+            /\.catch\b/g, /\btry\b/g,
+        ];
+        for (const pattern of decisionPatterns) {
+            const matches = code.match(pattern);
+            if (matches)
+                complexity += matches.length;
+        }
+        return complexity;
+    }
+    calculateCognitiveComplexity(code) {
+        let complexity = 0;
+        let nestingLevel = 0;
+        const lines = code.split('\n');
+        for (const line of lines) {
+            const trimmed = line.trim();
+            // Increment nesting
+            if (/[{(]\s*$/.test(trimmed) || /\bthen\b\s*$/.test(trimmed)) {
+                nestingLevel++;
+            }
+            // Structural increments (with nesting bonus)
+            if (/\bif\b/.test(trimmed))
+                complexity += 1 + nestingLevel;
+            if (/\belse\b/.test(trimmed) || /\belif\b/.test(trimmed))
+                complexity += 1;
+            if (/\bfor\b/.test(trimmed) || /\bwhile\b/.test(trimmed))
+                complexity += 1 + nestingLevel;
+            if (/\bswitch\b/.test(trimmed))
+                complexity += 1 + nestingLevel;
+            if (/\bcase\b/.test(trimmed))
+                complexity += 1;
+            // Fundamental increments (no nesting bonus)
+            if (/&&|\|\||\?\?/.test(trimmed))
+                complexity += 1;
+            if (/\?\s*[^:]+\s*:/.test(trimmed))
+                complexity += 1;
+            // Decrement nesting
+            if (/^[)}]/.test(trimmed)) {
+                nestingLevel = Math.max(0, nestingLevel - 1);
+            }
+        }
+        return complexity;
+    }
+    calculateNestingDepth(code) {
+        let maxDepth = 0;
+        let currentDepth = 0;
+        let inString = false;
+        let stringChar = '';
+        for (let i = 0; i < code.length; i++) {
+            const ch = code[i];
+            if (inString) {
+                if (ch === stringChar && code[i - 1] !== '\\')
+                    inString = false;
+                continue;
+            }
+            if (ch === '"' || ch === "'" || ch === '`') {
+                inString = true;
+                stringChar = ch;
+                continue;
+            }
+            if (ch === '{' || ch === '(') {
+                currentDepth++;
+                maxDepth = Math.max(maxDepth, currentDepth);
+            }
+            else if (ch === '}' || ch === ')') {
+                currentDepth = Math.max(0, currentDepth - 1);
+            }
+        }
+        return maxDepth;
+    }
+    countReturnPaths(code) {
+        const matches = code.match(/\breturn\b/g);
+        return matches ? matches.length : 0;
+    }
+    assessPurity(code) {
+        // Heuristic: if function accesses globals, modifies external state, or does I/O, it's not pure
+        const impurityIndicators = [
+            /\bconsole\./, /\bprocess\./, /\brequire\(/, /\bimport\s/,
+            /\bfs\./, /\bfetch\(/, /\bawait\b/, /\bDate\.now\(\)/,
+            /\bMath\.random\(\)/, /\bdocument\./, /\bwindow\./,
+        ];
+        for (const indicator of impurityIndicators) {
+            if (indicator.test(code))
+                return false;
+        }
+        return true;
+    }
+    findFunctionEnd(lines, startIdx) {
+        let braceCount = 0;
+        let foundFirstBrace = false;
+        for (let i = startIdx; i < lines.length; i++) {
+            for (const ch of lines[i]) {
+                if (ch === '{') {
+                    braceCount++;
+                    foundFirstBrace = true;
+                }
+                if (ch === '}')
+                    braceCount--;
+            }
+            if (foundFirstBrace && braceCount <= 0)
+                return i;
+        }
+        return lines.length - 1;
+    }
+    findPythonFunctionEnd(lines, startIdx) {
+        const baseIndent = lines[startIdx].search(/\S/);
+        for (let i = startIdx + 1; i < lines.length; i++) {
+            const lineIndent = lines[i].search(/\S/);
+            if (lineIndent >= 0 && lineIndent <= baseIndent && lines[i].trim().length > 0) {
+                return i - 1;
+            }
+        }
+        return lines.length - 1;
+    }
+    calculatePythonNesting(code) {
+        let maxDepth = 0;
+        let currentDepth = 0;
+        for (const line of code.split('\n')) {
+            const indent = line.search(/\S/);
+            if (indent >= 0) {
+                currentDepth = Math.floor(indent / 4);
+                maxDepth = Math.max(maxDepth, currentDepth);
+            }
+        }
+        return maxDepth;
+    }
+    calculatePythonComplexity(code) {
+        let complexity = 1;
+        const patterns = [/\bif\b/g, /\belif\b/g, /\bfor\b/g, /\bwhile\b/g, /\band\b/g, /\bor\b/g, /\bexcept\b/g];
+        for (const p of patterns) {
+            const m = code.match(p);
+            if (m)
+                complexity += m.length;
+        }
+        return complexity;
+    }
+    calculatePythonCognitiveComplexity(code) {
+        return this.calculatePythonComplexity(code); // simplified
+    }
+    collectFiles(dir, maxFiles) {
+        const results = [];
+        const walk = (currentDir, depth) => {
+            if (results.length >= maxFiles || depth > 10)
+                return;
+            let entries;
+            try {
+                entries = fs.readdirSync(currentDir, { withFileTypes: true });
+            }
+            catch {
+                return;
+            }
+            for (const entry of entries) {
+                if (results.length >= maxFiles)
+                    return;
+                if (entry.name.startsWith('.') && entry.name !== '.env.example')
+                    continue;
+                const fullPath = path.join(currentDir, entry.name);
+                if (entry.isDirectory()) {
+                    if (IGNORE_DIRS.has(entry.name))
+                        continue;
+                    walk(fullPath, depth + 1);
+                }
+                else if (entry.isFile() && CODE_EXTENSIONS.has(path.extname(entry.name))) {
+                    results.push(fullPath);
+                }
+            }
+        };
+        walk(dir, 0);
+        return results;
+    }
+}
+//# sourceMappingURL=ast-analyzer.js.map

package/dist/brain/ast-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analyzer.js","sourceRoot":"","sources":["../../src/brain/ast-analyzer.ts"],"names":[],"mappings":"AAAA,2GAA2G;AAC3G,2EAA2E;AAG3E,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;IAClE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM;IAC7D,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS;CAChE,CAAC,CAAC;AAEH,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;AAE9F,MAAM,OAAO,WAAW;IAGtB,YAAY,UAAkB;QAC5B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,WAAmB,GAAG;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAmB,EAAE,CAAC;QAEpC,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YACrD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACtD,QAAQ,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YAC/B,CAAC;YAED,sBAAsB;YACtB,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,mBAAmB,CAAC,QAAgB;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAC3C,CAAC;aAAM,IAAI,GAAG,KAAK,KAAK,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAEO,kBAAkB,CAAC,QAAgB;QACzC,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAElC,mEAAmE;QACnE,MAAM,QAAQ,GAAG;YACf,6CAA6C;YAC7C,4DAA4D;YAC5D,mEAAmE;YACnE,8EAA8E;YAC9E,iCAAiC;YACjC,2CAA2C;YAC3C,yBAAyB;YACzB,iFAAiF;SAClF,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAClC,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;oBAC3E,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxB,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAEhD,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;oBACtD,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBAChD,MAAM,oBAAoB,GAAG,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC;oBACtE,MAAM,mBAAmB,GAAG,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC;oBACpE,MAAM,UAAU,GAAG,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;oBACjE,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAErC,SAAS,CAAC,IAAI,CAAC;wBACb,IAAI;wBACJ,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC;wBAC9C,SAAS;wBACT,OAAO,EAAE,OAAO,GAAG,CAAC;wBACpB,MAAM;wBACN,YAAY;wBACZ,WAAW;wBACX,oBAAoB;wBACpB,mBAAmB;wBACnB,WAAW,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;wBAC5B,UAAU;wBACV,OAAO;wBACP,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;qBAChC,CAAC,CAAC;oBACH,MAAM,CAAC,sCAAsC;gBAC/C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,sBAAsB,CAAC,QAAgB;QAC7C,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,yCAAyC,CAAC,CAAC;YACxE,IAAI,KAAK,EAAE,CAAC;gBACV,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;gBAClG,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACrD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEhD,SAAS,CAAC,IAAI,CAAC;oBACb,IAAI;oBACJ,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC;oBAC9C,SAAS;oBACT,OAAO,EAAE,OAAO,GAAG,CAAC;oBACpB,MAAM;oBACN,YAAY,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC;oBAC/C,WAAW,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;oBACrD,oBAAoB,EAAE,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC;oBAC1D,mBAAmB,EAAE,IAAI,CAAC,kCAAkC,CAAC,IAAI,CAAC;oBAClE,WAAW,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC;oBAC5B,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;oBACrC,OAAO,EAAE,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACrC,MAAM,EAAE,IAAI,EAAE,eAAe;iBAC9B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,eAAe,CAAC,EAAmB,EAAE,QAAgB;QAC3D,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAEzD,6BAA6B;QAC7B,IAAI,EAAE,CAAC,oBAAoB,GAAG,EAAE,EAAE,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,SAAS;gBACf,QAAQ,EAAE,EAAE,CAAC,oBAAoB,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM;gBAC5D,KAAK,EAAE,0BAA0B,EAAE,CAAC,IAAI,kCAAkC,EAAE,CAAC,oBAAoB,EAAE;gBACnG,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,8BAA8B,EAAE,CAAC,oBAAoB,qBAAqB;oBAC/H,iBAAiB,EAAE,CAAC,MAAM,oBAAoB,EAAE,CAAC,YAAY,mBAAmB,EAAE,CAAC,WAAW,IAAI;oBAClG,oBAAoB,EAAE,CAAC,WAAW,IAAI;oBACtC,wEAAwE;oBACxE,sGAAsG;gBACxG,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,IAAI;gBAChB,QAAQ,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,oBAAoB,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,EAAE;aACzE,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,EAAE,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,KAAK,EAAE,0BAA0B,EAAE,CAAC,IAAI,gBAAgB,EAAE,CAAC,oBAAoB,aAAa;gBAC5F,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,6BAA6B,EAAE,CAAC,oBAAoB,MAAM;oBAC/G,uFAAuF;gBACzF,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,sBAAsB;QACtB,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;gBAC3C,KAAK,EAAE,sBAAsB,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,MAAM,aAAa;gBACnE,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,YAAY,EAAE,CAAC,MAAM,gBAAgB;oBAC1F,yEAAyE;oBACzE,2FAA2F;gBAC7F,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,eAAe;QACf,IAAI,EAAE,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,SAAS;gBACf,QAAQ,EAAE,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM;gBACnD,KAAK,EAAE,8BAA8B,EAAE,CAAC,YAAY,gBAAgB,EAAE,CAAC,IAAI,GAAG;gBAC9E,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,QAAQ,EAAE,CAAC,YAAY,uBAAuB;oBACnG,iEAAiE;oBACjE,6FAA6F;gBAC/F,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,sBAAsB;QACtB,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,EAAE,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;gBAClD,KAAK,EAAE,uBAAuB,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,WAAW,aAAa;gBACxE,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,UAAU,EAAE,CAAC,WAAW,WAAW;oBACxF,+DAA+D;oBAC/D,mEAAmE;gBACrE,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,wBAAwB;QACxB,IAAI,EAAE,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,KAAK,EAAE,uBAAuB,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,WAAW,eAAe;gBAC3E,OAAO,EACL,cAAc,EAAE,CAAC,IAAI,SAAS,OAAO,IAAI,EAAE,CAAC,SAAS,QAAQ,EAAE,CAAC,WAAW,2BAA2B;oBACtG,gFAAgF;oBAChF,+FAA+F;gBACjG,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,oBAAoB,CAAC,QAAgB;QAC3C,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,IAAI,OAAe,CAAC;QACpB,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;QAE/B,mBAAmB;QACnB,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;YACpB,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,SAAS;gBACf,QAAQ,EAAE,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;gBAC9C,KAAK,EAAE,8BAA8B,OAAO,KAAK,SAAS,SAAS;gBACnE,OAAO,EACL,QAAQ,OAAO,QAAQ,SAAS,0DAA0D;oBAC1F,wEAAwE;gBAC1E,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,oCAAoC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,IAAI,WAAW,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,QAAQ,EAAE,QAAQ;gBAClB,KAAK,EAAE,uCAAuC,OAAO,KAAK,WAAW,CAAC,MAAM,GAAG;gBAC/E,OAAO,EACL,QAAQ,OAAO,QAAQ,WAAW,CAAC,MAAM,yEAAyE;oBAClH,0FAA0F;gBAC5F,KAAK,EAAE,CAAC,OAAO,CAAC;gBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;QACL,CAAC;QAED,2BAA2B;QAC3B,MAAM,YAAY,GAAG;YACnB,EAAE,KAAK,EAAE,gCAAgC,EAAE,KAAK,EAAE,aAAa,EAAE;SAClE,CAAC;QACF,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,YAAY,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,YAAY;oBAClB,QAAQ,EAAE,KAAK;oBACf,KAAK,EAAE,aAAa,OAAO,CAAC,MAAM,IAAI,KAAK,QAAQ,OAAO,EAAE;oBAC5D,OAAO,EACL,QAAQ,OAAO,aAAa,OAAO,CAAC,MAAM,IAAI,KAAK,oCAAoC;wBACvF,8DAA8D;oBAChE,KAAK,EAAE,CAAC,OAAO,CAAC;oBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;oBACrB,UAAU,EAAE,IAAI;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,+EAA+E;IAEvE,6BAA6B,CAAC,IAAY;QAChD,0DAA0D;QAC1D,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,gBAAgB,GAAG;YACvB,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,YAAY;YACrD,WAAW,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO;YAC9C,YAAY,EAAE,UAAU;SACzB,CAAC;QACF,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,OAAO;gBAAE,UAAU,IAAI,OAAO,CAAC,MAAM,CAAC;QAC5C,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,4BAA4B,CAAC,IAAY;QAC/C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAE5B,oBAAoB;YACpB,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7D,YAAY,EAAE,CAAC;YACjB,CAAC;YAED,6CAA6C;YAC7C,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,GAAG,YAAY,CAAC;YAC3D,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;YAC1E,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,GAAG,YAAY,CAAC;YACzF,IAAI,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,GAAG,YAAY,CAAC;YAC/D,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;YAE9C,4CAA4C;YAC5C,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;YAClD,IAAI,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC;YAEpD,oBAAoB;YACpB,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1B,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,qBAAqB,CAAC,IAAY;QACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,UAAU,GAAG,EAAE,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAEnB,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,EAAE,KAAK,UAAU,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI;oBAAE,QAAQ,GAAG,KAAK,CAAC;gBAChE,SAAS;YACX,CAAC;YAED,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBAC3C,QAAQ,GAAG,IAAI,CAAC;gBAChB,UAAU,GAAG,EAAE,CAAC;gBAChB,SAAS;YACX,CAAC;YAED,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBAC7B,YAAY,EAAE,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC9C,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACpC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,gBAAgB,CAAC,IAAY;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAEO,YAAY,CAAC,IAAY;QAC/B,+FAA+F;QAC/F,MAAM,kBAAkB,GAAG;YACzB,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY;YACzD,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,iBAAiB;YACrD,oBAAoB,EAAE,cAAc,EAAE,YAAY;SACnD,CAAC;QACF,KAAK,MAAM,SAAS,IAAI,kBAAkB,EAAE,CAAC;YAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QACzC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,eAAe,CAAC,KAAe,EAAE,QAAgB;QACvD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,eAAe,GAAG,KAAK,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;oBAAC,UAAU,EAAE,CAAC;oBAAC,eAAe,GAAG,IAAI,CAAC;gBAAC,CAAC;gBACzD,IAAI,EAAE,KAAK,GAAG;oBAAE,UAAU,EAAE,CAAC;YAC/B,CAAC;YACD,IAAI,eAAe,IAAI,UAAU,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEO,qBAAqB,CAAC,KAAe,EAAE,QAAgB;QAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,IAAI,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9E,OAAO,CAAC,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEO,sBAAsB,CAAC,IAAY;QACzC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBAChB,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACtC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,yBAAyB,CAAC,IAAY;QAC5C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,QAAQ,GAAG,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;QAC1G,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC;gBAAE,UAAU,IAAI,CAAC,CAAC,MAAM,CAAC;QAChC,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,kCAAkC,CAAC,IAAY;QACrD,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa;IAC5D,CAAC;IAEO,YAAY,CAAC,GAAW,EAAE,QAAgB;QAChD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,CAAC,UAAkB,EAAE,KAAa,EAAQ,EAAE;YACvD,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,IAAI,KAAK,GAAG,EAAE;gBAAE,OAAO;YACrD,IAAI,OAAoB,CAAC;YACzB,IAAI,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,OAAO;YAAC,CAAC;YACxF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;oBAAE,OAAO;gBACvC,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;oBAAE,SAAS;gBAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;gBACnD,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;oBACxB,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;wBAAE,SAAS;oBAC1C,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC5B,CAAC;qBAAM,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;oBAC3E,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACb,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/brain/code-age-analyzer.d.ts

@@ -0,0 +1,11 @@
+import { BrainInsight } from '../types.js';
+export declare class CodeAgeAnalyzer {
+    private projectDir;
+    constructor(projectDir: string);
+    analyzeProject(maxFiles?: number): Promise<BrainInsight[]>;
+    private analyzeFileAge;
+    private getFileAuthors;
+    private ageToInsight;
+    private collectFiles;
+}
+//# sourceMappingURL=code-age-analyzer.d.ts.map

package/dist/brain/code-age-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-age-analyzer.d.ts","sourceRoot":"","sources":["../../src/brain/code-age-analyzer.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,YAAY,EAAiB,MAAM,aAAa,CAAC;AAU1D,qBAAa,eAAe;IAC1B,OAAO,CAAC,UAAU,CAAS;gBAEf,UAAU,EAAE,MAAM;IAIxB,cAAc,CAAC,QAAQ,GAAE,MAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA8CrE,OAAO,CAAC,cAAc;IAkCtB,OAAO,CAAC,cAAc;IAetB,OAAO,CAAC,YAAY;IAsBpB,OAAO,CAAC,YAAY;CAqBrB"}

package/dist/brain/code-age-analyzer.js

@@ -0,0 +1,152 @@
+// src/brain/code-age-analyzer.ts — Code staleness and age analysis
+// v3.0.0 — Tracks file modification age, churn, and staleness risk
+import * as fs from 'fs';
+import * as path from 'path';
+const IGNORE_DIRS = new Set([
+    'node_modules', '.git', 'dist', 'build', 'out', 'coverage', '.next', '.nuxt', '.cache',
+]);
+const CODE_EXTENSIONS = new Set(['.ts', '.tsx', '.js', '.jsx', '.py', '.rs', '.go', '.java']);
+export class CodeAgeAnalyzer {
+    constructor(projectDir) {
+        this.projectDir = projectDir;
+    }
+    async analyzeProject(maxFiles = 300) {
+        const files = this.collectFiles(this.projectDir, maxFiles);
+        const insights = [];
+        const results = [];
+        const now = Date.now();
+        for (const filePath of files) {
+            const result = this.analyzeFileAge(filePath, now);
+            if (result) {
+                results.push(result);
+            }
+        }
+        // Sort by staleness score descending
+        results.sort((a, b) => b.stalenessScore - a.stalenessScore);
+        // Generate insights for stale files
+        for (const result of results) {
+            if (result.risk === 'ancient' || result.risk === 'stale') {
+                insights.push(this.ageToInsight(result));
+            }
+        }
+        // Summary insight if many stale files
+        const staleCount = results.filter(r => r.risk === 'stale' || r.risk === 'ancient').length;
+        const totalFiles = results.length;
+        if (staleCount > totalFiles * 0.3 && totalFiles > 10) {
+            insights.push({
+                type: 'warning',
+                priority: 'medium',
+                title: `[age] ${(staleCount / totalFiles * 100).toFixed(0)}% of code is stale (>180 days since modification)`,
+                content: `Project has ${staleCount}/${totalFiles} files that haven't been modified in over 180 days.\n` +
+                    `  This may indicate: dead code, abandoned features, or stable-but-untested modules.\n` +
+                    `  Consider reviewing stale files for removal or adding test coverage.`,
+                files: results.filter(r => r.risk === 'stale' || r.risk === 'ancient').map(r => r.file).slice(0, 20),
+                timestamp: new Date(),
+                confidence: 0.7,
+                metadata: { stalePercentage: staleCount / totalFiles, totalFiles, staleCount },
+            });
+        }
+        return insights;
+    }
+    analyzeFileAge(filePath, now) {
+        let stat;
+        try {
+            stat = fs.statSync(filePath);
+        }
+        catch {
+            return null;
+        }
+        const relPath = path.relative(this.projectDir, filePath);
+        const lastModified = stat.mtime;
+        const daysSinceModification = Math.floor((now - lastModified.getTime()) / (1000 * 60 * 60 * 24));
+        // Determine risk level
+        let risk;
+        if (daysSinceModification <= 7)
+            risk = 'fresh';
+        else if (daysSinceModification <= 30)
+            risk = 'stable';
+        else if (daysSinceModification <= 90)
+            risk = 'aging';
+        else if (daysSinceModification <= 365)
+            risk = 'stale';
+        else
+            risk = 'ancient';
+        // Staleness score: 0 = fresh, 1 = very stale
+        const stalenessScore = Math.min(1, daysSinceModification / 365);
+        // Try to get git blame info (simplified — just count unique authors from recent changes)
+        const authors = this.getFileAuthors(filePath);
+        return {
+            file: relPath,
+            lastModified,
+            daysSinceModification,
+            linesChangedRecently: 0, // would need git log for exact count
+            stalenessScore,
+            risk,
+            authors,
+            churnRate: 0, // would need git history for exact rate
+        };
+    }
+    getFileAuthors(filePath) {
+        // Try reading git log for authors (best-effort)
+        try {
+            const { execSync } = require('child_process');
+            const output = execSync(`git log --format="%an" --follow -- "${path.relative(this.projectDir, filePath)}"`, { cwd: this.projectDir, timeout: 5000, encoding: 'utf-8' });
+            const authors = [...new Set(output.trim().split('\n').filter(Boolean))];
+            return authors.slice(0, 5);
+        }
+        catch {
+            return [];
+        }
+    }
+    ageToInsight(result) {
+        const daysText = result.daysSinceModification > 365
+            ? `${(result.daysSinceModification / 365).toFixed(1)} years`
+            : `${result.daysSinceModification} days`;
+        return {
+            type: 'warning',
+            priority: result.risk === 'ancient' ? 'high' : 'medium',
+            title: `[age] ${result.risk} file: ${result.file} (${daysText} since last change)`,
+            content: `File ${result.file} hasn't been modified in ${daysText}.\n` +
+                `  Risk level: ${result.risk}\n` +
+                `  Staleness score: ${(result.stalenessScore * 100).toFixed(0)}%\n` +
+                (result.authors.length > 0 ? `  Previous authors: ${result.authors.join(', ')}\n` : '') +
+                `  Consider: Review for relevance, add tests if still needed, or remove if obsolete.`,
+            files: [result.file],
+            timestamp: new Date(),
+            confidence: 0.75,
+            metadata: { daysSinceModification: result.daysSinceModification, risk: result.risk, stalenessScore: result.stalenessScore },
+        };
+    }
+    collectFiles(dir, maxFiles) {
+        const results = [];
+        const walk = (currentDir, depth) => {
+            if (results.length >= maxFiles || depth > 10)
+                return;
+            let entries;
+            try {
+                entries = fs.readdirSync(currentDir, { withFileTypes: true });
+            }
+            catch {
+                return;
+            }
+            for (const entry of entries) {
+                if (results.length >= maxFiles)
+                    return;
+                if (entry.name.startsWith('.'))
+                    continue;
+                const fullPath = path.join(currentDir, entry.name);
+                if (entry.isDirectory()) {
+                    if (IGNORE_DIRS.has(entry.name))
+                        continue;
+                    walk(fullPath, depth + 1);
+                }
+                else if (entry.isFile() && CODE_EXTENSIONS.has(path.extname(entry.name))) {
+                    results.push(fullPath);
+                }
+            }
+        };
+        walk(dir, 0);
+        return results;
+    }
+}
+//# sourceMappingURL=code-age-analyzer.js.map