@weavelogic/knowledge-graph-agent 0.3.0 → 0.6.0

package/dist/plugins/analyzers/code-complexity/analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyzer.js","sources":["../../../../src/plugins/analyzers/code-complexity/analyzer.ts"],"sourcesContent":["/**\n * Code Complexity Analyzer\n *\n * Parses TypeScript/JavaScript files using typescript-estree and\n * analyzes complexity metrics for functions, methods, and files.\n *\n * @module plugins/analyzers/code-complexity/analyzer\n */\n\nimport { parse, type TSESTree } from '@typescript-eslint/typescript-estree';\nimport { readFile } from 'fs/promises';\nimport { extname, relative, basename } from 'path';\nimport fastGlob from 'fast-glob';\nimport { createLogger } from '../../../utils/logger.js';\nimport {\n  calculateCyclomaticComplexity,\n  calculateCognitiveComplexity,\n  calculateMaxNestingDepth,\n  calculateLinesOfCode,\n  countReturnStatements,\n  calculateMaintainabilityIndex,\n  aggregateFileComplexity,\n  classifyComplexityLevel,\n  detectComplexityIssues,\n  generateRecommendations,\n} from './metrics.js';\nimport type {\n  AnalyzerConfig,\n  FileAnalysis,\n  FunctionAnalysis,\n  FunctionKind,\n  ProjectAnalysis,\n  ProjectMetrics,\n  ComplexityScore,\n  ComplexityLevel,\n  DEFAULT_CONFIG,\n} from './types.js';\nimport { DEFAULT_THRESHOLDS } from './types.js';\n\nconst logger = createLogger('code-complexity-analyzer');\n\n// ============================================================================\n// Code Complexity Analyzer Class\n// ============================================================================\n\n/**\n * Analyzes TypeScript/JavaScript code for complexity metrics\n *\n * @example\n * ```typescript\n * const analyzer = new CodeComplexityAnalyzer({\n *   projectRoot: '/my/project',\n *   patterns: { include: ['src/** /*.ts'], exclude: ['** /*.test.ts'] }\n * });\n *\n * const result = await analyzer.analyzeProject();\n * console.log(`Found ${result.complexFunctions.length} complex functions`);\n * ```\n */\nexport class CodeComplexityAnalyzer {\n  private config: AnalyzerConfig;\n  private sourceCache: Map<string, string> = new Map();\n\n  constructor(config: Partial<AnalyzerConfig> = {}) {\n    // Merge with defaults\n    this.config = {\n      projectRoot: config.projectRoot ?? '.',\n      patterns: config.patterns ?? {\n        include: ['**/*.ts', '**/*.tsx', '**/*.js', '**/*.jsx'],\n        exclude: [\n          '**/node_modules/**',\n          '**/dist/**',\n          '**/build/**',\n          '**/*.d.ts',\n          '**/*.min.js',\n          '**/coverage/**',\n        ],\n      },\n      thresholds: { ...DEFAULT_THRESHOLDS, ...config.thresholds },\n      maxFiles: config.maxFiles,\n      includeNodeModules: config.includeNodeModules ?? false,\n      includeTests: config.includeTests ?? true,\n      generateGraphNodes: config.generateGraphNodes ?? true,\n      minComplexityToReport: config.minComplexityToReport ?? 0,\n      verbose: config.verbose ?? false,\n    };\n  }\n\n  // ==========================================================================\n  // Project Analysis\n  // ==========================================================================\n\n  /**\n   * Analyze entire project for complexity\n   */\n  async analyzeProject(): Promise<ProjectAnalysis> {\n    const startedAt = new Date();\n\n    logger.info('Starting project complexity analysis', {\n      projectRoot: this.config.projectRoot,\n    });\n\n    // Find files to analyze\n    const files = await this.findFiles();\n\n    if (this.config.verbose) {\n      logger.debug(`Found ${files.length} files to analyze`);\n    }\n\n    // Analyze each file\n    const fileAnalyses: FileAnalysis[] = [];\n    const errors: string[] = [];\n\n    for (const filePath of files) {\n      try {\n        const analysis = await this.analyzeFile(filePath);\n        if (analysis) {\n          fileAnalyses.push(analysis);\n        }\n      } catch (error) {\n        const message = error instanceof Error ? error.message : String(error);\n        errors.push(`${filePath}: ${message}`);\n        if (this.config.verbose) {\n          logger.warn(`Failed to analyze ${filePath}`, { error: message });\n        }\n      }\n    }\n\n    // Calculate project metrics\n    const metrics = this.calculateProjectMetrics(fileAnalyses);\n\n    // Identify hotspots\n    const hotspots = fileAnalyses\n      .filter((f) => f.level === 'high' || f.level === 'critical')\n      .sort((a, b) => b.complexity.cyclomatic - a.complexity.cyclomatic);\n\n    // Collect complex functions\n    const complexFunctions = fileAnalyses\n      .flatMap((f) => f.complexFunctions)\n      .sort((a, b) => b.complexity.cyclomatic - a.complexity.cyclomatic);\n\n    const completedAt = new Date();\n\n    const result: ProjectAnalysis = {\n      projectRoot: this.config.projectRoot,\n      files: fileAnalyses,\n      metrics,\n      hotspots,\n      complexFunctions,\n      config: this.config,\n      timing: {\n        startedAt,\n        completedAt,\n        durationMs: completedAt.getTime() - startedAt.getTime(),\n      },\n    };\n\n    logger.info('Project analysis complete', {\n      files: fileAnalyses.length,\n      functions: metrics.totalFunctions,\n      hotspots: hotspots.length,\n      duration: result.timing.durationMs,\n    });\n\n    return result;\n  }\n\n  // ==========================================================================\n  // File Analysis\n  // ==========================================================================\n\n  /**\n   * Analyze a single file for complexity\n   */\n  async analyzeFile(filePath: string): Promise<FileAnalysis | null> {\n    const extension = extname(filePath).toLowerCase();\n\n    // Only process TypeScript/JavaScript files\n    if (!['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'].includes(extension)) {\n      return null;\n    }\n\n    // Read source code\n    const sourceCode = await this.getSourceCode(filePath);\n    if (!sourceCode) return null;\n\n    // Parse AST\n    const ast = this.parseFile(filePath, sourceCode);\n    if (!ast) return null;\n\n    // Extract functions\n    const functions = this.extractFunctions(ast, filePath, sourceCode);\n\n    // Calculate file-level metrics\n    const { loc, totalLines } = calculateLinesOfCode(sourceCode, 1, sourceCode.split('\\n').length);\n\n    // Count imports and exports\n    const importCount = this.countImports(ast);\n    const exportCount = this.countExports(ast);\n    const classCount = this.countClasses(ast);\n\n    // Aggregate file complexity\n    const complexity = aggregateFileComplexity(functions, loc, totalLines);\n\n    // Classify file complexity level\n    const level = classifyComplexityLevel(complexity, this.config.thresholds);\n\n    // Find complex functions\n    const complexFunctions = functions.filter(\n      (f) => f.level === 'high' || f.level === 'critical'\n    );\n\n    return {\n      filePath,\n      relativePath: relative(this.config.projectRoot, filePath),\n      extension,\n      complexity,\n      functions,\n      classCount,\n      importCount,\n      exportCount,\n      analyzedAt: new Date(),\n      parseErrors: [],\n      complexFunctions,\n      level,\n    };\n  }\n\n  // ==========================================================================\n  // AST Parsing\n  // ==========================================================================\n\n  /**\n   * Parse source file to AST\n   */\n  private parseFile(filePath: string, sourceCode: string): TSESTree.Program | null {\n    const extension = extname(filePath).toLowerCase();\n    const isTypeScript = extension === '.ts' || extension === '.tsx';\n    const isJsx = extension === '.tsx' || extension === '.jsx';\n\n    try {\n      return parse(sourceCode, {\n        loc: true,\n        range: true,\n        tokens: false,\n        comment: false,\n        jsx: isJsx,\n        // Use looser parsing for JavaScript\n        ...(isTypeScript ? {} : { allowInvalidAST: true }),\n      });\n    } catch (error) {\n      if (this.config.verbose) {\n        logger.debug(`Parse error in ${filePath}`, {\n          error: error instanceof Error ? error.message : String(error),\n        });\n      }\n      return null;\n    }\n  }\n\n  // ==========================================================================\n  // Function Extraction\n  // ==========================================================================\n\n  /**\n   * Extract all functions from AST\n   */\n  private extractFunctions(\n    ast: TSESTree.Program,\n    filePath: string,\n    sourceCode: string\n  ): FunctionAnalysis[] {\n    const functions: FunctionAnalysis[] = [];\n\n    const traverse = (node: TSESTree.Node, parentName?: string): void => {\n      // Check for function-like nodes\n      const functionInfo = this.getFunctionInfo(node, parentName);\n      if (functionInfo) {\n        const analysis = this.analyzeFunctionNode(\n          functionInfo.node,\n          functionInfo.name,\n          functionInfo.kind,\n          filePath,\n          sourceCode,\n          functionInfo.isAsync,\n          functionInfo.isExported,\n          functionInfo.parentName\n        );\n        functions.push(analysis);\n      }\n\n      // Track class names for methods\n      let newParentName = parentName;\n      if (node.type === 'ClassDeclaration' || node.type === 'ClassExpression') {\n        const classNode = node as TSESTree.ClassDeclaration;\n        newParentName = classNode.id?.name ?? 'AnonymousClass';\n      }\n\n      // Traverse children\n      for (const key of Object.keys(node)) {\n        if (key === 'parent') continue;\n        const child = (node as unknown as Record<string, unknown>)[key];\n        if (child && typeof child === 'object') {\n          if (Array.isArray(child)) {\n            for (const item of child) {\n              if (item && typeof item === 'object' && 'type' in item) {\n                traverse(item as TSESTree.Node, newParentName);\n              }\n            }\n          } else if ('type' in child) {\n            traverse(child as TSESTree.Node, newParentName);\n          }\n        }\n      }\n    };\n\n    traverse(ast);\n    return functions;\n  }\n\n  /**\n   * Get function information from node\n   */\n  private getFunctionInfo(\n    node: TSESTree.Node,\n    parentName?: string\n  ): {\n    node: TSESTree.Node;\n    name: string;\n    kind: FunctionKind;\n    isAsync: boolean;\n    isExported: boolean;\n    parentName?: string;\n  } | null {\n    switch (node.type) {\n      case 'FunctionDeclaration': {\n        const fn = node as TSESTree.FunctionDeclaration;\n        return {\n          node: fn,\n          name: fn.id?.name ?? 'anonymous',\n          kind: fn.generator ? 'generator' : 'function',\n          isAsync: fn.async,\n          isExported: false,\n          parentName,\n        };\n      }\n\n      case 'FunctionExpression': {\n        const fn = node as TSESTree.FunctionExpression;\n        return {\n          node: fn,\n          name: fn.id?.name ?? 'anonymous',\n          kind: fn.generator ? 'generator' : 'function',\n          isAsync: fn.async,\n          isExported: false,\n          parentName,\n        };\n      }\n\n      case 'ArrowFunctionExpression': {\n        const fn = node as TSESTree.ArrowFunctionExpression;\n        // Try to get name from variable declaration\n        const name = this.getArrowFunctionName(node) ?? 'arrow';\n        return {\n          node: fn,\n          name,\n          kind: 'arrow',\n          isAsync: fn.async,\n          isExported: false,\n          parentName,\n        };\n      }\n\n      case 'MethodDefinition': {\n        const method = node as TSESTree.MethodDefinition;\n        const methodName = this.getPropertyName(method.key) ?? 'method';\n        let kind: FunctionKind;\n        if (method.kind === 'constructor') {\n          kind = 'constructor';\n        } else if (method.kind === 'get') {\n          kind = 'getter';\n        } else if (method.kind === 'set') {\n          kind = 'setter';\n        } else {\n          kind = 'method';\n        }\n        const fn = method.value as TSESTree.FunctionExpression;\n        return {\n          node: method.value,\n          name: methodName,\n          kind,\n          isAsync: fn.async,\n          isExported: false,\n          parentName,\n        };\n      }\n\n      default:\n        return null;\n    }\n  }\n\n  /**\n   * Analyze a single function node\n   */\n  private analyzeFunctionNode(\n    node: TSESTree.Node,\n    name: string,\n    kind: FunctionKind,\n    filePath: string,\n    sourceCode: string,\n    isAsync: boolean,\n    isExported: boolean,\n    parentName?: string\n  ): FunctionAnalysis {\n    const startLine = node.loc?.start.line ?? 1;\n    const endLine = node.loc?.end.line ?? 1;\n\n    // Calculate complexity metrics\n    const cyclomatic = calculateCyclomaticComplexity(node);\n    const cognitive = calculateCognitiveComplexity(node);\n    const maxNestingDepth = calculateMaxNestingDepth(node);\n    const { loc, totalLines } = calculateLinesOfCode(sourceCode, startLine, endLine);\n    const returnCount = countReturnStatements(node);\n\n    // Get parameter count\n    const parameterCount = this.getParameterCount(node);\n\n    const complexity: ComplexityScore = {\n      cyclomatic,\n      cognitive,\n      loc,\n      totalLines,\n      maxNestingDepth,\n      parameterCount,\n      returnCount,\n    };\n\n    // Classify complexity level\n    const level = classifyComplexityLevel(complexity, this.config.thresholds);\n\n    // Detect issues\n    const issues = detectComplexityIssues(complexity, this.config.thresholds, name);\n\n    // Generate recommendations\n    const recommendations = generateRecommendations(complexity, this.config.thresholds, level);\n\n    return {\n      name,\n      filePath,\n      startLine,\n      endLine,\n      kind,\n      complexity,\n      level,\n      parentName,\n      isAsync,\n      isExported,\n      issues,\n      recommendations,\n    };\n  }\n\n  // ==========================================================================\n  // Helper Methods\n  // ==========================================================================\n\n  /**\n   * Find files matching patterns\n   */\n  private async findFiles(): Promise<string[]> {\n    const patterns = this.config.patterns.include.map((p) =>\n      p.startsWith('/') ? p : `${this.config.projectRoot}/${p}`\n    );\n\n    const ignore = [...this.config.patterns.exclude];\n    if (!this.config.includeNodeModules) {\n      ignore.push('**/node_modules/**');\n    }\n    if (!this.config.includeTests) {\n      ignore.push('**/*.test.*', '**/*.spec.*', '**/__tests__/**');\n    }\n\n    let files = await fastGlob(patterns, {\n      ignore,\n      absolute: true,\n      onlyFiles: true,\n    });\n\n    // Limit files if configured\n    if (this.config.maxFiles && files.length > this.config.maxFiles) {\n      files = files.slice(0, this.config.maxFiles);\n    }\n\n    return files;\n  }\n\n  /**\n   * Get source code for file (with caching)\n   */\n  private async getSourceCode(filePath: string): Promise<string | null> {\n    if (this.sourceCache.has(filePath)) {\n      return this.sourceCache.get(filePath)!;\n    }\n\n    try {\n      const content = await readFile(filePath, 'utf-8');\n      this.sourceCache.set(filePath, content);\n      return content;\n    } catch {\n      return null;\n    }\n  }\n\n  /**\n   * Get arrow function name from parent\n   */\n  private getArrowFunctionName(node: TSESTree.Node): string | null {\n    // This would require parent tracking in the AST\n    // For now, return null and we'll use 'arrow' as default\n    return null;\n  }\n\n  /**\n   * Get property name from key\n   */\n  private getPropertyName(key: TSESTree.Node): string | null {\n    if (key.type === 'Identifier') {\n      return (key as TSESTree.Identifier).name;\n    }\n    if (key.type === 'Literal') {\n      return String((key as TSESTree.Literal).value);\n    }\n    return null;\n  }\n\n  /**\n   * Get parameter count from function\n   */\n  private getParameterCount(node: TSESTree.Node): number {\n    if ('params' in node && Array.isArray(node.params)) {\n      return node.params.length;\n    }\n    return 0;\n  }\n\n  /**\n   * Count imports in AST\n   */\n  private countImports(ast: TSESTree.Program): number {\n    return ast.body.filter((n) => n.type === 'ImportDeclaration').length;\n  }\n\n  /**\n   * Count exports in AST\n   */\n  private countExports(ast: TSESTree.Program): number {\n    return ast.body.filter(\n      (n) =>\n        n.type === 'ExportDefaultDeclaration' ||\n        n.type === 'ExportNamedDeclaration' ||\n        n.type === 'ExportAllDeclaration'\n    ).length;\n  }\n\n  /**\n   * Count classes in AST\n   */\n  private countClasses(ast: TSESTree.Program): number {\n    let count = 0;\n    const traverse = (node: TSESTree.Node): void => {\n      if (node.type === 'ClassDeclaration' || node.type === 'ClassExpression') {\n        count++;\n      }\n      for (const key of Object.keys(node)) {\n        if (key === 'parent') continue;\n        const child = (node as unknown as Record<string, unknown>)[key];\n        if (child && typeof child === 'object') {\n          if (Array.isArray(child)) {\n            for (const item of child) {\n              if (item && typeof item === 'object' && 'type' in item) {\n                traverse(item as TSESTree.Node);\n              }\n            }\n          } else if ('type' in child) {\n            traverse(child as TSESTree.Node);\n          }\n        }\n      }\n    };\n    traverse(ast);\n    return count;\n  }\n\n  /**\n   * Calculate project-wide metrics\n   */\n  private calculateProjectMetrics(files: FileAnalysis[]): ProjectMetrics {\n    if (files.length === 0) {\n      return {\n        totalFiles: 0,\n        totalFunctions: 0,\n        totalLoc: 0,\n        avgCyclomatic: 0,\n        avgCognitive: 0,\n        avgMaintainability: 100,\n        complexityDistribution: { low: 0, moderate: 0, high: 0, critical: 0 },\n        filesByLevel: { low: 0, moderate: 0, high: 0, critical: 0 },\n        topComplexFiles: [],\n        topComplexFunctions: [],\n      };\n    }\n\n    const allFunctions = files.flatMap((f) => f.functions);\n    const totalFunctions = allFunctions.length;\n    const totalLoc = files.reduce((sum, f) => sum + f.complexity.loc, 0);\n\n    // Calculate averages\n    const avgCyclomatic = totalFunctions > 0\n      ? allFunctions.reduce((sum, f) => sum + f.complexity.cyclomatic, 0) / totalFunctions\n      : 0;\n\n    const avgCognitive = totalFunctions > 0\n      ? allFunctions.reduce((sum, f) => sum + f.complexity.cognitive, 0) / totalFunctions\n      : 0;\n\n    const avgMaintainability = files.length > 0\n      ? files.reduce((sum, f) => sum + f.complexity.maintainabilityIndex, 0) / files.length\n      : 100;\n\n    // Distribution\n    const complexityDistribution: Record<ComplexityLevel, number> = {\n      low: 0,\n      moderate: 0,\n      high: 0,\n      critical: 0,\n    };\n    for (const fn of allFunctions) {\n      complexityDistribution[fn.level]++;\n    }\n\n    const filesByLevel: Record<ComplexityLevel, number> = {\n      low: 0,\n      moderate: 0,\n      high: 0,\n      critical: 0,\n    };\n    for (const file of files) {\n      filesByLevel[file.level]++;\n    }\n\n    // Top complex files\n    const topComplexFiles = files\n      .sort((a, b) => b.complexity.cyclomatic - a.complexity.cyclomatic)\n      .slice(0, 10)\n      .map((f) => ({ path: f.relativePath, score: f.complexity.cyclomatic }));\n\n    // Top complex functions\n    const topComplexFunctions = allFunctions\n      .sort((a, b) => b.complexity.cyclomatic - a.complexity.cyclomatic)\n      .slice(0, 10)\n      .map((f) => ({\n        name: f.parentName ? `${f.parentName}.${f.name}` : f.name,\n        file: relative(this.config.projectRoot, f.filePath),\n        score: f.complexity.cyclomatic,\n      }));\n\n    return {\n      totalFiles: files.length,\n      totalFunctions,\n      totalLoc,\n      avgCyclomatic: Math.round(avgCyclomatic * 100) / 100,\n      avgCognitive: Math.round(avgCognitive * 100) / 100,\n      avgMaintainability: Math.round(avgMaintainability * 100) / 100,\n      complexityDistribution,\n      filesByLevel,\n      topComplexFiles,\n      topComplexFunctions,\n    };\n  }\n\n  /**\n   * Clear source cache\n   */\n  clearCache(): void {\n    this.sourceCache.clear();\n  }\n}\n\n// ============================================================================\n// Factory Functions\n// ============================================================================\n\n/**\n * Create a code complexity analyzer\n */\nexport function createComplexityAnalyzer(\n  config?: Partial<AnalyzerConfig>\n): CodeComplexityAnalyzer {\n  return new CodeComplexityAnalyzer(config);\n}\n\n/**\n * Analyze a single file for complexity\n */\nexport async function analyzeFileComplexity(\n  filePath: string,\n  projectRoot?: string\n): Promise<FileAnalysis | null> {\n  const analyzer = new CodeComplexityAnalyzer({\n    projectRoot: projectRoot ?? '.',\n  });\n  return analyzer.analyzeFile(filePath);\n}\n\n/**\n * Analyze a project for complexity\n */\nexport async function analyzeProjectComplexity(\n  projectRoot: string,\n  options?: Partial<AnalyzerConfig>\n): Promise<ProjectAnalysis> {\n  const analyzer = new CodeComplexityAnalyzer({\n    ...options,\n    projectRoot,\n  });\n  return analyzer.analyzeProject();\n}\n"],"names":["parse","fastGlob"],"mappings":";;;;;;;AAuCA,MAAM,SAAS,aAAa,0BAA0B;AAoB/C,MAAM,uBAAuB;AAAA,EAC1B;AAAA,EACA,kCAAuC,IAAA;AAAA,EAE/C,YAAY,SAAkC,IAAI;AAEhD,SAAK,SAAS;AAAA,MACZ,aAAa,OAAO,eAAe;AAAA,MACnC,UAAU,OAAO,YAAY;AAAA,QAC3B,SAAS,CAAC,WAAW,YAAY,WAAW,UAAU;AAAA,QACtD,SAAS;AAAA,UACP;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QAAA;AAAA,MACF;AAAA,MAEF,YAAY,EAAE,GAAG,oBAAoB,GAAG,OAAO,WAAA;AAAA,MAC/C,UAAU,OAAO;AAAA,MACjB,oBAAoB,OAAO,sBAAsB;AAAA,MACjD,cAAc,OAAO,gBAAgB;AAAA,MACrC,oBAAoB,OAAO,sBAAsB;AAAA,MACjD,uBAAuB,OAAO,yBAAyB;AAAA,MACvD,SAAS,OAAO,WAAW;AAAA,IAAA;AAAA,EAE/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,iBAA2C;AAC/C,UAAM,gCAAgB,KAAA;AAEtB,WAAO,KAAK,wCAAwC;AAAA,MAClD,aAAa,KAAK,OAAO;AAAA,IAAA,CAC1B;AAGD,UAAM,QAAQ,MAAM,KAAK,UAAA;AAEzB,QAAI,KAAK,OAAO,SAAS;AACvB,aAAO,MAAM,SAAS,MAAM,MAAM,mBAAmB;AAAA,IACvD;AAGA,UAAM,eAA+B,CAAA;AAGrC,eAAW,YAAY,OAAO;AAC5B,UAAI;AACF,cAAM,WAAW,MAAM,KAAK,YAAY,QAAQ;AAChD,YAAI,UAAU;AACZ,uBAAa,KAAK,QAAQ;AAAA,QAC5B;AAAA,MACF,SAAS,OAAO;AACd,cAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAErE,YAAI,KAAK,OAAO,SAAS;AACvB,iBAAO,KAAK,qBAAqB,QAAQ,IAAI,EAAE,OAAO,SAAS;AAAA,QACjE;AAAA,MACF;AAAA,IACF;AAGA,UAAM,UAAU,KAAK,wBAAwB,YAAY;AAGzD,UAAM,WAAW,aACd,OAAO,CAAC,MAAM,EAAE,UAAU,UAAU,EAAE,UAAU,UAAU,EAC1D,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW,UAAU;AAGnE,UAAM,mBAAmB,aACtB,QAAQ,CAAC,MAAM,EAAE,gBAAgB,EACjC,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW,UAAU;AAEnE,UAAM,kCAAkB,KAAA;AAExB,UAAM,SAA0B;AAAA,MAC9B,aAAa,KAAK,OAAO;AAAA,MACzB,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,KAAK;AAAA,MACb,QAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA,YAAY,YAAY,QAAA,IAAY,UAAU,QAAA;AAAA,MAAQ;AAAA,IACxD;AAGF,WAAO,KAAK,6BAA6B;AAAA,MACvC,OAAO,aAAa;AAAA,MACpB,WAAW,QAAQ;AAAA,MACnB,UAAU,SAAS;AAAA,MACnB,UAAU,OAAO,OAAO;AAAA,IAAA,CACzB;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,YAAY,UAAgD;AAChE,UAAM,YAAY,QAAQ,QAAQ,EAAE,YAAA;AAGpC,QAAI,CAAC,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,MAAM,EAAE,SAAS,SAAS,GAAG;AACvE,aAAO;AAAA,IACT;AAGA,UAAM,aAAa,MAAM,KAAK,cAAc,QAAQ;AACpD,QAAI,CAAC,WAAY,QAAO;AAGxB,UAAM,MAAM,KAAK,UAAU,UAAU,UAAU;AAC/C,QAAI,CAAC,IAAK,QAAO;AAGjB,UAAM,YAAY,KAAK,iBAAiB,KAAK,UAAU,UAAU;AAGjE,UAAM,EAAE,KAAK,WAAA,IAAe,qBAAqB,YAAY,GAAG,WAAW,MAAM,IAAI,EAAE,MAAM;AAG7F,UAAM,cAAc,KAAK,aAAa,GAAG;AACzC,UAAM,cAAc,KAAK,aAAa,GAAG;AACzC,UAAM,aAAa,KAAK,aAAa,GAAG;AAGxC,UAAM,aAAa,wBAAwB,WAAW,KAAK,UAAU;AAGrE,UAAM,QAAQ,wBAAwB,YAAY,KAAK,OAAO,UAAU;AAGxE,UAAM,mBAAmB,UAAU;AAAA,MACjC,CAAC,MAAM,EAAE,UAAU,UAAU,EAAE,UAAU;AAAA,IAAA;AAG3C,WAAO;AAAA,MACL;AAAA,MACA,cAAc,SAAS,KAAK,OAAO,aAAa,QAAQ;AAAA,MACxD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,gCAAgB,KAAA;AAAA,MAChB,aAAa,CAAA;AAAA,MACb;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,UAAU,UAAkB,YAA6C;AAC/E,UAAM,YAAY,QAAQ,QAAQ,EAAE,YAAA;AACpC,UAAM,eAAe,cAAc,SAAS,cAAc;AAC1D,UAAM,QAAQ,cAAc,UAAU,cAAc;AAEpD,QAAI;AACF,aAAOA,YAAAA,MAAM,YAAY;AAAA,QACvB,KAAK;AAAA,QACL,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,KAAK;AAAA;AAAA,QAEL,GAAI,eAAe,CAAA,IAAK,EAAE,iBAAiB,KAAA;AAAA,MAAK,CACjD;AAAA,IACH,SAAS,OAAO;AACd,UAAI,KAAK,OAAO,SAAS;AACvB,eAAO,MAAM,kBAAkB,QAAQ,IAAI;AAAA,UACzC,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,QAAA,CAC7D;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,iBACN,KACA,UACA,YACoB;AACpB,UAAM,YAAgC,CAAA;AAEtC,UAAM,WAAW,CAAC,MAAqB,eAA8B;AAEnE,YAAM,eAAe,KAAK,gBAAgB,MAAM,UAAU;AAC1D,UAAI,cAAc;AAChB,cAAM,WAAW,KAAK;AAAA,UACpB,aAAa;AAAA,UACb,aAAa;AAAA,UACb,aAAa;AAAA,UACb;AAAA,UACA;AAAA,UACA,aAAa;AAAA,UACb,aAAa;AAAA,UACb,aAAa;AAAA,QAAA;AAEf,kBAAU,KAAK,QAAQ;AAAA,MACzB;AAGA,UAAI,gBAAgB;AACpB,UAAI,KAAK,SAAS,sBAAsB,KAAK,SAAS,mBAAmB;AACvE,cAAM,YAAY;AAClB,wBAAgB,UAAU,IAAI,QAAQ;AAAA,MACxC;AAGA,iBAAW,OAAO,OAAO,KAAK,IAAI,GAAG;AACnC,YAAI,QAAQ,SAAU;AACtB,cAAM,QAAS,KAA4C,GAAG;AAC9D,YAAI,SAAS,OAAO,UAAU,UAAU;AACtC,cAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,uBAAW,QAAQ,OAAO;AACxB,kBAAI,QAAQ,OAAO,SAAS,YAAY,UAAU,MAAM;AACtD,yBAAS,MAAuB,aAAa;AAAA,cAC/C;AAAA,YACF;AAAA,UACF,WAAW,UAAU,OAAO;AAC1B,qBAAS,OAAwB,aAAa;AAAA,UAChD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,aAAS,GAAG;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,MACA,YAQO;AACP,YAAQ,KAAK,MAAA;AAAA,MACX,KAAK,uBAAuB;AAC1B,cAAM,KAAK;AACX,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM,GAAG,IAAI,QAAQ;AAAA,UACrB,MAAM,GAAG,YAAY,cAAc;AAAA,UACnC,SAAS,GAAG;AAAA,UACZ,YAAY;AAAA,UACZ;AAAA,QAAA;AAAA,MAEJ;AAAA,MAEA,KAAK,sBAAsB;AACzB,cAAM,KAAK;AACX,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM,GAAG,IAAI,QAAQ;AAAA,UACrB,MAAM,GAAG,YAAY,cAAc;AAAA,UACnC,SAAS,GAAG;AAAA,UACZ,YAAY;AAAA,UACZ;AAAA,QAAA;AAAA,MAEJ;AAAA,MAEA,KAAK,2BAA2B;AAC9B,cAAM,KAAK;AAEX,cAAM,OAAO,KAAK,qBAAqB,IAAI,KAAK;AAChD,eAAO;AAAA,UACL,MAAM;AAAA,UACN;AAAA,UACA,MAAM;AAAA,UACN,SAAS,GAAG;AAAA,UACZ,YAAY;AAAA,UACZ;AAAA,QAAA;AAAA,MAEJ;AAAA,MAEA,KAAK,oBAAoB;AACvB,cAAM,SAAS;AACf,cAAM,aAAa,KAAK,gBAAgB,OAAO,GAAG,KAAK;AACvD,YAAI;AACJ,YAAI,OAAO,SAAS,eAAe;AACjC,iBAAO;AAAA,QACT,WAAW,OAAO,SAAS,OAAO;AAChC,iBAAO;AAAA,QACT,WAAW,OAAO,SAAS,OAAO;AAChC,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO;AAAA,QACT;AACA,cAAM,KAAK,OAAO;AAClB,eAAO;AAAA,UACL,MAAM,OAAO;AAAA,UACb,MAAM;AAAA,UACN;AAAA,UACA,SAAS,GAAG;AAAA,UACZ,YAAY;AAAA,UACZ;AAAA,QAAA;AAAA,MAEJ;AAAA,MAEA;AACE,eAAO;AAAA,IAAA;AAAA,EAEb;AAAA;AAAA;AAAA;AAAA,EAKQ,oBACN,MACA,MACA,MACA,UACA,YACA,SACA,YACA,YACkB;AAClB,UAAM,YAAY,KAAK,KAAK,MAAM,QAAQ;AAC1C,UAAM,UAAU,KAAK,KAAK,IAAI,QAAQ;AAGtC,UAAM,aAAa,8BAA8B,IAAI;AACrD,UAAM,YAAY,6BAA6B,IAAI;AACnD,UAAM,kBAAkB,yBAAyB,IAAI;AACrD,UAAM,EAAE,KAAK,WAAA,IAAe,qBAAqB,YAAY,WAAW,OAAO;AAC/E,UAAM,cAAc,sBAAsB,IAAI;AAG9C,UAAM,iBAAiB,KAAK,kBAAkB,IAAI;AAElD,UAAM,aAA8B;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAIF,UAAM,QAAQ,wBAAwB,YAAY,KAAK,OAAO,UAAU;AAGxE,UAAM,SAAS,uBAAuB,YAAY,KAAK,OAAO,YAAY,IAAI;AAG9E,UAAM,kBAAkB,wBAAwB,YAAY,KAAK,OAAO,YAAY,KAAK;AAEzF,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,YAA+B;AAC3C,UAAM,WAAW,KAAK,OAAO,SAAS,QAAQ;AAAA,MAAI,CAAC,MACjD,EAAE,WAAW,GAAG,IAAI,IAAI,GAAG,KAAK,OAAO,WAAW,IAAI,CAAC;AAAA,IAAA;AAGzD,UAAM,SAAS,CAAC,GAAG,KAAK,OAAO,SAAS,OAAO;AAC/C,QAAI,CAAC,KAAK,OAAO,oBAAoB;AACnC,aAAO,KAAK,oBAAoB;AAAA,IAClC;AACA,QAAI,CAAC,KAAK,OAAO,cAAc;AAC7B,aAAO,KAAK,eAAe,eAAe,iBAAiB;AAAA,IAC7D;AAEA,QAAI,QAAQ,MAAMC,GAAS,UAAU;AAAA,MACnC;AAAA,MACA,UAAU;AAAA,MACV,WAAW;AAAA,IAAA,CACZ;AAGD,QAAI,KAAK,OAAO,YAAY,MAAM,SAAS,KAAK,OAAO,UAAU;AAC/D,cAAQ,MAAM,MAAM,GAAG,KAAK,OAAO,QAAQ;AAAA,IAC7C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,cAAc,UAA0C;AACpE,QAAI,KAAK,YAAY,IAAI,QAAQ,GAAG;AAClC,aAAO,KAAK,YAAY,IAAI,QAAQ;AAAA,IACtC;AAEA,QAAI;AACF,YAAM,UAAU,MAAM,SAAS,UAAU,OAAO;AAChD,WAAK,YAAY,IAAI,UAAU,OAAO;AACtC,aAAO;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAAqB,MAAoC;AAG/D,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,KAAmC;AACzD,QAAI,IAAI,SAAS,cAAc;AAC7B,aAAQ,IAA4B;AAAA,IACtC;AACA,QAAI,IAAI,SAAS,WAAW;AAC1B,aAAO,OAAQ,IAAyB,KAAK;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,kBAAkB,MAA6B;AACrD,QAAI,YAAY,QAAQ,MAAM,QAAQ,KAAK,MAAM,GAAG;AAClD,aAAO,KAAK,OAAO;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,KAA+B;AAClD,WAAO,IAAI,KAAK,OAAO,CAAC,MAAM,EAAE,SAAS,mBAAmB,EAAE;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,KAA+B;AAClD,WAAO,IAAI,KAAK;AAAA,MACd,CAAC,MACC,EAAE,SAAS,8BACX,EAAE,SAAS,4BACX,EAAE,SAAS;AAAA,IAAA,EACb;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,KAA+B;AAClD,QAAI,QAAQ;AACZ,UAAM,WAAW,CAAC,SAA8B;AAC9C,UAAI,KAAK,SAAS,sBAAsB,KAAK,SAAS,mBAAmB;AACvE;AAAA,MACF;AACA,iBAAW,OAAO,OAAO,KAAK,IAAI,GAAG;AACnC,YAAI,QAAQ,SAAU;AACtB,cAAM,QAAS,KAA4C,GAAG;AAC9D,YAAI,SAAS,OAAO,UAAU,UAAU;AACtC,cAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,uBAAW,QAAQ,OAAO;AACxB,kBAAI,QAAQ,OAAO,SAAS,YAAY,UAAU,MAAM;AACtD,yBAAS,IAAqB;AAAA,cAChC;AAAA,YACF;AAAA,UACF,WAAW,UAAU,OAAO;AAC1B,qBAAS,KAAsB;AAAA,UACjC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,aAAS,GAAG;AACZ,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,wBAAwB,OAAuC;AACrE,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,QACL,YAAY;AAAA,QACZ,gBAAgB;AAAA,QAChB,UAAU;AAAA,QACV,eAAe;AAAA,QACf,cAAc;AAAA,QACd,oBAAoB;AAAA,QACpB,wBAAwB,EAAE,KAAK,GAAG,UAAU,GAAG,MAAM,GAAG,UAAU,EAAA;AAAA,QAClE,cAAc,EAAE,KAAK,GAAG,UAAU,GAAG,MAAM,GAAG,UAAU,EAAA;AAAA,QACxD,iBAAiB,CAAA;AAAA,QACjB,qBAAqB,CAAA;AAAA,MAAC;AAAA,IAE1B;AAEA,UAAM,eAAe,MAAM,QAAQ,CAAC,MAAM,EAAE,SAAS;AACrD,UAAM,iBAAiB,aAAa;AACpC,UAAM,WAAW,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,KAAK,CAAC;AAGnE,UAAM,gBAAgB,iBAAiB,IACnC,aAAa,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,YAAY,CAAC,IAAI,iBACpE;AAEJ,UAAM,eAAe,iBAAiB,IAClC,aAAa,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,WAAW,CAAC,IAAI,iBACnE;AAEJ,UAAM,qBAAqB,MAAM,SAAS,IACtC,MAAM,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,sBAAsB,CAAC,IAAI,MAAM,SAC7E;AAGJ,UAAM,yBAA0D;AAAA,MAC9D,KAAK;AAAA,MACL,UAAU;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,IAAA;AAEZ,eAAW,MAAM,cAAc;AAC7B,6BAAuB,GAAG,KAAK;AAAA,IACjC;AAEA,UAAM,eAAgD;AAAA,MACpD,KAAK;AAAA,MACL,UAAU;AAAA,MACV,MAAM;AAAA,MACN,UAAU;AAAA,IAAA;AAEZ,eAAW,QAAQ,OAAO;AACxB,mBAAa,KAAK,KAAK;AAAA,IACzB;AAGA,UAAM,kBAAkB,MACrB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW,UAAU,EAChE,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,cAAc,OAAO,EAAE,WAAW,WAAA,EAAa;AAGxE,UAAM,sBAAsB,aACzB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,aAAa,EAAE,WAAW,UAAU,EAChE,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,OAAO;AAAA,MACX,MAAM,EAAE,aAAa,GAAG,EAAE,UAAU,IAAI,EAAE,IAAI,KAAK,EAAE;AAAA,MACrD,MAAM,SAAS,KAAK,OAAO,aAAa,EAAE,QAAQ;AAAA,MAClD,OAAO,EAAE,WAAW;AAAA,IAAA,EACpB;AAEJ,WAAO;AAAA,MACL,YAAY,MAAM;AAAA,MAClB;AAAA,MACA;AAAA,MACA,eAAe,KAAK,MAAM,gBAAgB,GAAG,IAAI;AAAA,MACjD,cAAc,KAAK,MAAM,eAAe,GAAG,IAAI;AAAA,MAC/C,oBAAoB,KAAK,MAAM,qBAAqB,GAAG,IAAI;AAAA,MAC3D;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA,EAKA,aAAmB;AACjB,SAAK,YAAY,MAAA;AAAA,EACnB;AACF;AAkBA,eAAsB,sBACpB,UACA,aAC8B;AAC9B,QAAM,WAAW,IAAI,uBAAuB;AAAA,IAC1C,aAAa,eAAe;AAAA,EAAA,CAC7B;AACD,SAAO,SAAS,YAAY,QAAQ;AACtC;AAKA,eAAsB,yBACpB,aACA,SAC0B;AAC1B,QAAM,WAAW,IAAI,uBAAuB;AAAA,IAC1C,GAAG;AAAA,IACH;AAAA,EAAA,CACD;AACD,SAAO,SAAS,eAAA;AAClB;"}

package/dist/plugins/analyzers/code-complexity/graph-generator.d.ts

@@ -0,0 +1,70 @@
+/**
+ * Knowledge Graph Node Generator for Complexity Analysis
+ *
+ * Generates knowledge graph nodes and edges from complexity analysis results.
+ * Creates structured documentation for complex code that can be integrated
+ * into the knowledge graph.
+ *
+ * @module plugins/analyzers/code-complexity/graph-generator
+ */
+import type { ComplexityNode, ComplexityEdge, FunctionAnalysis, FileAnalysis, ProjectAnalysis, AnalyzerConfig } from './types.js';
+import type { KnowledgeNode } from '../../../core/types.js';
+/**
+ * Generates knowledge graph nodes from complexity analysis results
+ */
+export declare class ComplexityGraphGenerator {
+    private projectRoot;
+    private thresholds;
+    constructor(projectRoot: string, config?: Partial<AnalyzerConfig>);
+    /**
+     * Generate all nodes from project analysis
+     */
+    generateNodes(analysis: ProjectAnalysis): ComplexityNode[];
+    /**
+     * Generate a node for a complex function
+     */
+    generateFunctionNode(fn: FunctionAnalysis): ComplexityNode;
+    /**
+     * Generate a node for a complex file
+     */
+    generateFileNode(file: FileAnalysis): ComplexityNode;
+    /**
+     * Generate edges connecting complexity nodes
+     */
+    generateEdges(nodes: ComplexityNode[], analysis: ProjectAnalysis): ComplexityEdge[];
+    /**
+     * Convert complexity nodes to knowledge graph nodes
+     */
+    toKnowledgeNodes(nodes: ComplexityNode[]): KnowledgeNode[];
+    /**
+     * Convert a complexity node to a knowledge node
+     */
+    private complexityToKnowledge;
+    /**
+     * Generate markdown content for a complexity node
+     */
+    generateMarkdownContent(node: ComplexityNode): string;
+    /**
+     * Generate report markdown for entire project
+     */
+    generateProjectReport(analysis: ProjectAnalysis): string;
+    private generateFunctionTitle;
+    private generateFunctionTags;
+    private generateFileTags;
+    private generateFileIssues;
+    private generateFileRecommendations;
+    private generateDescription;
+    private getSeverityEmoji;
+}
+/**
+ * Create a complexity graph generator
+ */
+export declare function createGraphGenerator(projectRoot: string, config?: Partial<AnalyzerConfig>): ComplexityGraphGenerator;
+/**
+ * Generate knowledge graph nodes from analysis
+ */
+export declare function generateComplexityNodes(analysis: ProjectAnalysis, projectRoot: string): {
+    nodes: ComplexityNode[];
+    edges: ComplexityEdge[];
+};
+//# sourceMappingURL=graph-generator.d.ts.map

package/dist/plugins/analyzers/code-complexity/graph-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-generator.d.ts","sourceRoot":"","sources":["../../../../src/plugins/analyzers/code-complexity/graph-generator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,KAAK,EACV,cAAc,EACd,cAAc,EAGd,gBAAgB,EAChB,YAAY,EACZ,eAAe,EAEf,cAAc,EACf,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,aAAa,EAAuB,MAAM,wBAAwB,CAAC;AAgCjF;;GAEG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,UAAU,CAAqC;gBAE3C,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC;IAYjE;;OAEG;IACH,aAAa,CAAC,QAAQ,EAAE,eAAe,GAAG,cAAc,EAAE;IAkB1D;;OAEG;IACH,oBAAoB,CAAC,EAAE,EAAE,gBAAgB,GAAG,cAAc;IAqB1D;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,YAAY,GAAG,cAAc;IAyBpD;;OAEG;IACH,aAAa,CACX,KAAK,EAAE,cAAc,EAAE,EACvB,QAAQ,EAAE,eAAe,GACxB,cAAc,EAAE;IA+CnB;;OAEG;IACH,gBAAgB,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,aAAa,EAAE;IAI1D;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA0C7B;;OAEG;IACH,uBAAuB,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM;IA+ErD;;OAEG;IACH,qBAAqB,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM;IA+FxD,OAAO,CAAC,qBAAqB;IAK7B,OAAO,CAAC,oBAAoB;IAc5B,OAAO,CAAC,gBAAgB;IAaxB,OAAO,CAAC,kBAAkB;IAwB1B,OAAO,CAAC,2BAA2B;IAkBnC,OAAO,CAAC,mBAAmB;IAO3B,OAAO,CAAC,gBAAgB;CAYzB;AAMD;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,WAAW,EAAE,MAAM,EACnB,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAC/B,wBAAwB,CAE1B;AAED;;GAEG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,eAAe,EACzB,WAAW,EAAE,MAAM,GAClB;IAAE,KAAK,EAAE,cAAc,EAAE,CAAC;IAAC,KAAK,EAAE,cAAc,EAAE,CAAA;CAAE,CAKtD"}

package/dist/plugins/analyzers/code-complexity/graph-generator.js

@@ -0,0 +1,405 @@
+import { relative, basename } from "path";
+import { createHash } from "crypto";
+function generateNodeId(type, filePath, functionName) {
+  const input = functionName ? `${type}:${filePath}:${functionName}` : `${type}:${filePath}`;
+  const hash = createHash("sha256").update(input).digest("hex").slice(0, 12);
+  return `complexity-${hash}`;
+}
+function slugify(text) {
+  return text.toLowerCase().replace(/[^a-z0-9]+/g, "-").replace(/^-|-$/g, "");
+}
+class ComplexityGraphGenerator {
+  projectRoot;
+  thresholds;
+  constructor(projectRoot, config) {
+    this.projectRoot = projectRoot;
+    this.thresholds = {
+      high: config?.thresholds?.cyclomaticHigh ?? 10,
+      critical: config?.thresholds?.cyclomaticCritical ?? 20
+    };
+  }
+  // ==========================================================================
+  // Node Generation
+  // ==========================================================================
+  /**
+   * Generate all nodes from project analysis
+   */
+  generateNodes(analysis) {
+    const nodes = [];
+    for (const fn of analysis.complexFunctions) {
+      const node = this.generateFunctionNode(fn);
+      nodes.push(node);
+    }
+    for (const file of analysis.hotspots) {
+      const node = this.generateFileNode(file);
+      nodes.push(node);
+    }
+    return nodes;
+  }
+  /**
+   * Generate a node for a complex function
+   */
+  generateFunctionNode(fn) {
+    const id = generateNodeId("complex-function", fn.filePath, fn.name);
+    relative(this.projectRoot, fn.filePath);
+    return {
+      id,
+      type: "complex-function",
+      title: this.generateFunctionTitle(fn),
+      filePath: fn.filePath,
+      functionName: fn.name,
+      lineRange: { start: fn.startLine, end: fn.endLine },
+      complexity: fn.complexity,
+      level: fn.level,
+      issues: fn.issues,
+      recommendations: fn.recommendations,
+      relatedNodes: [],
+      tags: this.generateFunctionTags(fn),
+      createdAt: /* @__PURE__ */ new Date()
+    };
+  }
+  /**
+   * Generate a node for a complex file
+   */
+  generateFileNode(file) {
+    const id = generateNodeId("complex-file", file.filePath);
+    relative(this.projectRoot, file.filePath);
+    return {
+      id,
+      type: "complex-file",
+      title: `Complex File: ${basename(file.filePath)}`,
+      filePath: file.filePath,
+      complexity: file.complexity,
+      level: file.level,
+      issues: this.generateFileIssues(file),
+      recommendations: this.generateFileRecommendations(file),
+      relatedNodes: file.functions.map(
+        (fn) => generateNodeId("complex-function", file.filePath, fn.name)
+      ),
+      tags: this.generateFileTags(file),
+      createdAt: /* @__PURE__ */ new Date()
+    };
+  }
+  // ==========================================================================
+  // Edge Generation
+  // ==========================================================================
+  /**
+   * Generate edges connecting complexity nodes
+   */
+  generateEdges(nodes, analysis) {
+    const edges = [];
+    for (const file of analysis.hotspots) {
+      const fileNodeId = generateNodeId("complex-file", file.filePath);
+      for (const fn of file.complexFunctions) {
+        const fnNodeId = generateNodeId("complex-function", file.filePath, fn.name);
+        edges.push({
+          source: fileNodeId,
+          target: fnNodeId,
+          type: "contains",
+          weight: fn.complexity.cyclomatic / this.thresholds.critical,
+          complexityScore: fn.complexity.cyclomatic,
+          context: `${fn.name} is a complex function in this file`
+        });
+      }
+    }
+    for (const file of analysis.files) {
+      const complexFns = file.complexFunctions;
+      for (let i = 0; i < complexFns.length; i++) {
+        for (let j = i + 1; j < complexFns.length; j++) {
+          const fn1 = complexFns[i];
+          const fn2 = complexFns[j];
+          edges.push({
+            source: generateNodeId("complex-function", file.filePath, fn1.name),
+            target: generateNodeId("complex-function", file.filePath, fn2.name),
+            type: "related",
+            weight: 0.5,
+            context: "Both functions are complex and in the same file"
+          });
+        }
+      }
+    }
+    return edges;
+  }
+  // ==========================================================================
+  // Knowledge Node Conversion
+  // ==========================================================================
+  /**
+   * Convert complexity nodes to knowledge graph nodes
+   */
+  toKnowledgeNodes(nodes) {
+    return nodes.map((node) => this.complexityToKnowledge(node));
+  }
+  /**
+   * Convert a complexity node to a knowledge node
+   */
+  complexityToKnowledge(node) {
+    const relativePath = relative(this.projectRoot, node.filePath);
+    const filename = `${slugify(node.title)}.md`;
+    return {
+      id: node.id,
+      path: `docs/complexity/${filename}`,
+      filename,
+      title: node.title,
+      type: "technical",
+      status: node.level === "critical" ? "active" : "draft",
+      content: this.generateMarkdownContent(node),
+      frontmatter: {
+        title: node.title,
+        type: "technical",
+        status: node.level === "critical" ? "active" : "draft",
+        tags: node.tags,
+        category: "complexity",
+        description: this.generateDescription(node),
+        created: node.createdAt.toISOString(),
+        complexity_level: node.level,
+        cyclomatic_complexity: node.complexity.cyclomatic,
+        cognitive_complexity: node.complexity.cognitive,
+        file_path: relativePath,
+        function_name: node.functionName
+      },
+      tags: node.tags,
+      outgoingLinks: node.relatedNodes.map((target) => ({
+        target,
+        type: "wikilink",
+        context: "Related complexity hotspot"
+      })),
+      incomingLinks: [],
+      wordCount: 0,
+      lastModified: node.createdAt
+    };
+  }
+  // ==========================================================================
+  // Markdown Generation
+  // ==========================================================================
+  /**
+   * Generate markdown content for a complexity node
+   */
+  generateMarkdownContent(node) {
+    const relativePath = relative(this.projectRoot, node.filePath);
+    const lines = [];
+    lines.push(`# ${node.title}`);
+    lines.push("");
+    const severityEmoji = this.getSeverityEmoji(node.level);
+    lines.push(`> ${severityEmoji} **Severity: ${node.level.toUpperCase()}**`);
+    lines.push("");
+    lines.push("## Location");
+    lines.push("");
+    lines.push(`- **File**: \`${relativePath}\``);
+    if (node.functionName) {
+      lines.push(`- **Function**: \`${node.functionName}\``);
+    }
+    if (node.lineRange) {
+      lines.push(`- **Lines**: ${node.lineRange.start} - ${node.lineRange.end}`);
+    }
+    lines.push("");
+    lines.push("## Complexity Metrics");
+    lines.push("");
+    lines.push("| Metric | Value | Threshold |");
+    lines.push("|--------|-------|-----------|");
+    lines.push(
+      `| Cyclomatic Complexity | ${node.complexity.cyclomatic} | ${this.thresholds.high} (high) / ${this.thresholds.critical} (critical) |`
+    );
+    lines.push(
+      `| Cognitive Complexity | ${node.complexity.cognitive} | 15 (high) / 25 (critical) |`
+    );
+    lines.push(`| Lines of Code | ${node.complexity.loc} | 50 (max) |`);
+    lines.push(`| Max Nesting Depth | ${node.complexity.maxNestingDepth} | 4 (max) |`);
+    lines.push("");
+    if (node.issues.length > 0) {
+      lines.push("## Issues Detected");
+      lines.push("");
+      for (const issue of node.issues) {
+        lines.push(`- ${issue}`);
+      }
+      lines.push("");
+    }
+    if (node.recommendations.length > 0) {
+      lines.push("## Recommendations");
+      lines.push("");
+      for (const rec of node.recommendations) {
+        lines.push(`- ${rec}`);
+      }
+      lines.push("");
+    }
+    if (node.relatedNodes.length > 0) {
+      lines.push("## Related Hotspots");
+      lines.push("");
+      for (const related of node.relatedNodes) {
+        lines.push(`- [[${related}]]`);
+      }
+      lines.push("");
+    }
+    lines.push("## Tags");
+    lines.push("");
+    lines.push(node.tags.map((t) => `\`${t}\``).join(" "));
+    lines.push("");
+    return lines.join("\n");
+  }
+  /**
+   * Generate report markdown for entire project
+   */
+  generateProjectReport(analysis) {
+    const lines = [];
+    lines.push("# Code Complexity Analysis Report");
+    lines.push("");
+    lines.push(`> Generated: ${(/* @__PURE__ */ new Date()).toISOString()}`);
+    lines.push("");
+    lines.push("## Summary");
+    lines.push("");
+    lines.push(`- **Total Files Analyzed**: ${analysis.metrics.totalFiles}`);
+    lines.push(`- **Total Functions**: ${analysis.metrics.totalFunctions}`);
+    lines.push(`- **Total Lines of Code**: ${analysis.metrics.totalLoc}`);
+    lines.push(`- **Analysis Duration**: ${analysis.timing.durationMs}ms`);
+    lines.push("");
+    lines.push("## Average Metrics");
+    lines.push("");
+    lines.push("| Metric | Value |");
+    lines.push("|--------|-------|");
+    lines.push(`| Cyclomatic Complexity | ${analysis.metrics.avgCyclomatic} |`);
+    lines.push(`| Cognitive Complexity | ${analysis.metrics.avgCognitive} |`);
+    lines.push(`| Maintainability Index | ${analysis.metrics.avgMaintainability} |`);
+    lines.push("");
+    lines.push("## Complexity Distribution");
+    lines.push("");
+    lines.push("| Level | Functions | Files |");
+    lines.push("|-------|-----------|-------|");
+    const levels = ["low", "moderate", "high", "critical"];
+    for (const level of levels) {
+      lines.push(
+        `| ${level} | ${analysis.metrics.complexityDistribution[level]} | ${analysis.metrics.filesByLevel[level]} |`
+      );
+    }
+    lines.push("");
+    if (analysis.metrics.topComplexFiles.length > 0) {
+      lines.push("## Most Complex Files");
+      lines.push("");
+      lines.push("| File | Cyclomatic Complexity |");
+      lines.push("|------|----------------------|");
+      for (const file of analysis.metrics.topComplexFiles) {
+        lines.push(`| ${file.path} | ${file.score} |`);
+      }
+      lines.push("");
+    }
+    if (analysis.metrics.topComplexFunctions.length > 0) {
+      lines.push("## Most Complex Functions");
+      lines.push("");
+      lines.push("| Function | File | Score |");
+      lines.push("|----------|------|-------|");
+      for (const fn of analysis.metrics.topComplexFunctions) {
+        lines.push(`| ${fn.name} | ${fn.file} | ${fn.score} |`);
+      }
+      lines.push("");
+    }
+    if (analysis.hotspots.length > 0) {
+      lines.push("## Hotspots Requiring Attention");
+      lines.push("");
+      for (const hotspot of analysis.hotspots.slice(0, 10)) {
+        const relativePath = relative(this.projectRoot, hotspot.filePath);
+        lines.push(`### ${basename(hotspot.filePath)}`);
+        lines.push("");
+        lines.push(`- **Path**: \`${relativePath}\``);
+        lines.push(`- **Complexity Level**: ${hotspot.level}`);
+        lines.push(`- **Functions**: ${hotspot.functions.length}`);
+        lines.push(`- **Complex Functions**: ${hotspot.complexFunctions.length}`);
+        lines.push("");
+        if (hotspot.complexFunctions.length > 0) {
+          lines.push("**Complex Functions:**");
+          for (const fn of hotspot.complexFunctions) {
+            lines.push(`- \`${fn.name}\` (CC: ${fn.complexity.cyclomatic})`);
+          }
+          lines.push("");
+        }
+      }
+    }
+    return lines.join("\n");
+  }
+  // ==========================================================================
+  // Helper Methods
+  // ==========================================================================
+  generateFunctionTitle(fn) {
+    const prefix = fn.parentName ? `${fn.parentName}.` : "";
+    return `Complex Function: ${prefix}${fn.name}`;
+  }
+  generateFunctionTags(fn) {
+    const tags = ["complexity", fn.level, fn.kind];
+    if (fn.isAsync) tags.push("async");
+    if (fn.complexity.cyclomatic >= this.thresholds.critical) {
+      tags.push("needs-refactoring");
+    }
+    if (fn.complexity.maxNestingDepth > 4) {
+      tags.push("deep-nesting");
+    }
+    return tags;
+  }
+  generateFileTags(file) {
+    const tags = ["complexity", file.level, "file"];
+    if (file.complexFunctions.length > 3) {
+      tags.push("multiple-hotspots");
+    }
+    if (file.complexity.maintainabilityIndex < 50) {
+      tags.push("low-maintainability");
+    }
+    return tags;
+  }
+  generateFileIssues(file) {
+    const issues = [];
+    if (file.complexFunctions.length > 0) {
+      issues.push(
+        `Contains ${file.complexFunctions.length} complex function(s) that need attention`
+      );
+    }
+    if (file.complexity.maintainabilityIndex < 50) {
+      issues.push(
+        `Low maintainability index (${file.complexity.maintainabilityIndex})`
+      );
+    }
+    if (file.complexity.avgCyclomatic > 10) {
+      issues.push(
+        `High average cyclomatic complexity (${file.complexity.avgCyclomatic})`
+      );
+    }
+    return issues;
+  }
+  generateFileRecommendations(file) {
+    const recommendations = [];
+    if (file.complexFunctions.length > 3) {
+      recommendations.push("Consider splitting this file into smaller modules");
+    }
+    if (file.complexity.avgCyclomatic > 10) {
+      recommendations.push("Refactor complex functions to reduce average complexity");
+    }
+    if (file.complexity.functionCount > 20) {
+      recommendations.push("Large number of functions - consider organizing into classes");
+    }
+    return recommendations;
+  }
+  generateDescription(node) {
+    if (node.type === "complex-function") {
+      return `Complex function with cyclomatic complexity ${node.complexity.cyclomatic}`;
+    }
+    return `Complex file containing ${node.relatedNodes.length} complexity hotspots`;
+  }
+  getSeverityEmoji(level) {
+    switch (level) {
+      case "critical":
+        return "🔴";
+      case "high":
+        return "🟠";
+      case "moderate":
+        return "🟡";
+      case "low":
+        return "🟢";
+    }
+  }
+}
+function generateComplexityNodes(analysis, projectRoot) {
+  const generator = new ComplexityGraphGenerator(projectRoot);
+  const nodes = generator.generateNodes(analysis);
+  const edges = generator.generateEdges(nodes, analysis);
+  return { nodes, edges };
+}
+export {
+  ComplexityGraphGenerator,
+  generateComplexityNodes
+};
+//# sourceMappingURL=graph-generator.js.map

package/dist/plugins/analyzers/code-complexity/graph-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-generator.js","sources":["../../../../src/plugins/analyzers/code-complexity/graph-generator.ts"],"sourcesContent":["/**\n * Knowledge Graph Node Generator for Complexity Analysis\n *\n * Generates knowledge graph nodes and edges from complexity analysis results.\n * Creates structured documentation for complex code that can be integrated\n * into the knowledge graph.\n *\n * @module plugins/analyzers/code-complexity/graph-generator\n */\n\nimport { basename, dirname, relative } from 'path';\nimport { createHash } from 'crypto';\nimport type {\n  ComplexityNode,\n  ComplexityEdge,\n  ComplexityNodeType,\n  ComplexityLevel,\n  FunctionAnalysis,\n  FileAnalysis,\n  ProjectAnalysis,\n  ComplexityScore,\n  AnalyzerConfig,\n} from './types.js';\nimport type { KnowledgeNode, NodeType, GraphEdge } from '../../../core/types.js';\n\n// ============================================================================\n// Node ID Generation\n// ============================================================================\n\n/**\n * Generate a unique node ID for a complexity entry\n */\nfunction generateNodeId(type: ComplexityNodeType, filePath: string, functionName?: string): string {\n  const input = functionName\n    ? `${type}:${filePath}:${functionName}`\n    : `${type}:${filePath}`;\n\n  const hash = createHash('sha256').update(input).digest('hex').slice(0, 12);\n  return `complexity-${hash}`;\n}\n\n/**\n * Generate a slug for file/function names\n */\nfunction slugify(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, '-')\n    .replace(/^-|-$/g, '');\n}\n\n// ============================================================================\n// Complexity Graph Generator\n// ============================================================================\n\n/**\n * Generates knowledge graph nodes from complexity analysis results\n */\nexport class ComplexityGraphGenerator {\n  private projectRoot: string;\n  private thresholds: { high: number; critical: number };\n\n  constructor(projectRoot: string, config?: Partial<AnalyzerConfig>) {\n    this.projectRoot = projectRoot;\n    this.thresholds = {\n      high: config?.thresholds?.cyclomaticHigh ?? 10,\n      critical: config?.thresholds?.cyclomaticCritical ?? 20,\n    };\n  }\n\n  // ==========================================================================\n  // Node Generation\n  // ==========================================================================\n\n  /**\n   * Generate all nodes from project analysis\n   */\n  generateNodes(analysis: ProjectAnalysis): ComplexityNode[] {\n    const nodes: ComplexityNode[] = [];\n\n    // Generate nodes for complex functions\n    for (const fn of analysis.complexFunctions) {\n      const node = this.generateFunctionNode(fn);\n      nodes.push(node);\n    }\n\n    // Generate nodes for complex files\n    for (const file of analysis.hotspots) {\n      const node = this.generateFileNode(file);\n      nodes.push(node);\n    }\n\n    return nodes;\n  }\n\n  /**\n   * Generate a node for a complex function\n   */\n  generateFunctionNode(fn: FunctionAnalysis): ComplexityNode {\n    const id = generateNodeId('complex-function', fn.filePath, fn.name);\n    const relativePath = relative(this.projectRoot, fn.filePath);\n\n    return {\n      id,\n      type: 'complex-function',\n      title: this.generateFunctionTitle(fn),\n      filePath: fn.filePath,\n      functionName: fn.name,\n      lineRange: { start: fn.startLine, end: fn.endLine },\n      complexity: fn.complexity,\n      level: fn.level,\n      issues: fn.issues,\n      recommendations: fn.recommendations,\n      relatedNodes: [],\n      tags: this.generateFunctionTags(fn),\n      createdAt: new Date(),\n    };\n  }\n\n  /**\n   * Generate a node for a complex file\n   */\n  generateFileNode(file: FileAnalysis): ComplexityNode {\n    const id = generateNodeId('complex-file', file.filePath);\n    const relativePath = relative(this.projectRoot, file.filePath);\n\n    return {\n      id,\n      type: 'complex-file',\n      title: `Complex File: ${basename(file.filePath)}`,\n      filePath: file.filePath,\n      complexity: file.complexity,\n      level: file.level,\n      issues: this.generateFileIssues(file),\n      recommendations: this.generateFileRecommendations(file),\n      relatedNodes: file.functions.map((fn) =>\n        generateNodeId('complex-function', file.filePath, fn.name)\n      ),\n      tags: this.generateFileTags(file),\n      createdAt: new Date(),\n    };\n  }\n\n  // ==========================================================================\n  // Edge Generation\n  // ==========================================================================\n\n  /**\n   * Generate edges connecting complexity nodes\n   */\n  generateEdges(\n    nodes: ComplexityNode[],\n    analysis: ProjectAnalysis\n  ): ComplexityEdge[] {\n    const edges: ComplexityEdge[] = [];\n\n    // Create edges between files and their complex functions\n    for (const file of analysis.hotspots) {\n      const fileNodeId = generateNodeId('complex-file', file.filePath);\n\n      for (const fn of file.complexFunctions) {\n        const fnNodeId = generateNodeId('complex-function', file.filePath, fn.name);\n\n        edges.push({\n          source: fileNodeId,\n          target: fnNodeId,\n          type: 'contains',\n          weight: fn.complexity.cyclomatic / this.thresholds.critical,\n          complexityScore: fn.complexity.cyclomatic,\n          context: `${fn.name} is a complex function in this file`,\n        });\n      }\n    }\n\n    // Create edges between related complex functions (same file)\n    for (const file of analysis.files) {\n      const complexFns = file.complexFunctions;\n      for (let i = 0; i < complexFns.length; i++) {\n        for (let j = i + 1; j < complexFns.length; j++) {\n          const fn1 = complexFns[i];\n          const fn2 = complexFns[j];\n\n          edges.push({\n            source: generateNodeId('complex-function', file.filePath, fn1.name),\n            target: generateNodeId('complex-function', file.filePath, fn2.name),\n            type: 'related',\n            weight: 0.5,\n            context: 'Both functions are complex and in the same file',\n          });\n        }\n      }\n    }\n\n    return edges;\n  }\n\n  // ==========================================================================\n  // Knowledge Node Conversion\n  // ==========================================================================\n\n  /**\n   * Convert complexity nodes to knowledge graph nodes\n   */\n  toKnowledgeNodes(nodes: ComplexityNode[]): KnowledgeNode[] {\n    return nodes.map((node) => this.complexityToKnowledge(node));\n  }\n\n  /**\n   * Convert a complexity node to a knowledge node\n   */\n  private complexityToKnowledge(node: ComplexityNode): KnowledgeNode {\n    const relativePath = relative(this.projectRoot, node.filePath);\n    const filename = `${slugify(node.title)}.md`;\n\n    return {\n      id: node.id,\n      path: `docs/complexity/${filename}`,\n      filename,\n      title: node.title,\n      type: 'technical' as NodeType,\n      status: node.level === 'critical' ? 'active' : 'draft',\n      content: this.generateMarkdownContent(node),\n      frontmatter: {\n        title: node.title,\n        type: 'technical',\n        status: node.level === 'critical' ? 'active' : 'draft',\n        tags: node.tags,\n        category: 'complexity',\n        description: this.generateDescription(node),\n        created: node.createdAt.toISOString(),\n        complexity_level: node.level,\n        cyclomatic_complexity: node.complexity.cyclomatic,\n        cognitive_complexity: node.complexity.cognitive,\n        file_path: relativePath,\n        function_name: node.functionName,\n      },\n      tags: node.tags,\n      outgoingLinks: node.relatedNodes.map((target) => ({\n        target,\n        type: 'wikilink' as const,\n        context: 'Related complexity hotspot',\n      })),\n      incomingLinks: [],\n      wordCount: 0,\n      lastModified: node.createdAt,\n    };\n  }\n\n  // ==========================================================================\n  // Markdown Generation\n  // ==========================================================================\n\n  /**\n   * Generate markdown content for a complexity node\n   */\n  generateMarkdownContent(node: ComplexityNode): string {\n    const relativePath = relative(this.projectRoot, node.filePath);\n    const lines: string[] = [];\n\n    // Header\n    lines.push(`# ${node.title}`);\n    lines.push('');\n\n    // Severity badge\n    const severityEmoji = this.getSeverityEmoji(node.level);\n    lines.push(`> ${severityEmoji} **Severity: ${node.level.toUpperCase()}**`);\n    lines.push('');\n\n    // Location\n    lines.push('## Location');\n    lines.push('');\n    lines.push(`- **File**: \\`${relativePath}\\``);\n    if (node.functionName) {\n      lines.push(`- **Function**: \\`${node.functionName}\\``);\n    }\n    if (node.lineRange) {\n      lines.push(`- **Lines**: ${node.lineRange.start} - ${node.lineRange.end}`);\n    }\n    lines.push('');\n\n    // Metrics\n    lines.push('## Complexity Metrics');\n    lines.push('');\n    lines.push('| Metric | Value | Threshold |');\n    lines.push('|--------|-------|-----------|');\n    lines.push(\n      `| Cyclomatic Complexity | ${node.complexity.cyclomatic} | ${this.thresholds.high} (high) / ${this.thresholds.critical} (critical) |`\n    );\n    lines.push(\n      `| Cognitive Complexity | ${node.complexity.cognitive} | 15 (high) / 25 (critical) |`\n    );\n    lines.push(`| Lines of Code | ${node.complexity.loc} | 50 (max) |`);\n    lines.push(`| Max Nesting Depth | ${node.complexity.maxNestingDepth} | 4 (max) |`);\n    lines.push('');\n\n    // Issues\n    if (node.issues.length > 0) {\n      lines.push('## Issues Detected');\n      lines.push('');\n      for (const issue of node.issues) {\n        lines.push(`- ${issue}`);\n      }\n      lines.push('');\n    }\n\n    // Recommendations\n    if (node.recommendations.length > 0) {\n      lines.push('## Recommendations');\n      lines.push('');\n      for (const rec of node.recommendations) {\n        lines.push(`- ${rec}`);\n      }\n      lines.push('');\n    }\n\n    // Related nodes\n    if (node.relatedNodes.length > 0) {\n      lines.push('## Related Hotspots');\n      lines.push('');\n      for (const related of node.relatedNodes) {\n        lines.push(`- [[${related}]]`);\n      }\n      lines.push('');\n    }\n\n    // Tags\n    lines.push('## Tags');\n    lines.push('');\n    lines.push(node.tags.map((t) => `\\`${t}\\``).join(' '));\n    lines.push('');\n\n    return lines.join('\\n');\n  }\n\n  /**\n   * Generate report markdown for entire project\n   */\n  generateProjectReport(analysis: ProjectAnalysis): string {\n    const lines: string[] = [];\n\n    lines.push('# Code Complexity Analysis Report');\n    lines.push('');\n    lines.push(`> Generated: ${new Date().toISOString()}`);\n    lines.push('');\n\n    // Summary\n    lines.push('## Summary');\n    lines.push('');\n    lines.push(`- **Total Files Analyzed**: ${analysis.metrics.totalFiles}`);\n    lines.push(`- **Total Functions**: ${analysis.metrics.totalFunctions}`);\n    lines.push(`- **Total Lines of Code**: ${analysis.metrics.totalLoc}`);\n    lines.push(`- **Analysis Duration**: ${analysis.timing.durationMs}ms`);\n    lines.push('');\n\n    // Averages\n    lines.push('## Average Metrics');\n    lines.push('');\n    lines.push('| Metric | Value |');\n    lines.push('|--------|-------|');\n    lines.push(`| Cyclomatic Complexity | ${analysis.metrics.avgCyclomatic} |`);\n    lines.push(`| Cognitive Complexity | ${analysis.metrics.avgCognitive} |`);\n    lines.push(`| Maintainability Index | ${analysis.metrics.avgMaintainability} |`);\n    lines.push('');\n\n    // Distribution\n    lines.push('## Complexity Distribution');\n    lines.push('');\n    lines.push('| Level | Functions | Files |');\n    lines.push('|-------|-----------|-------|');\n    const levels: ComplexityLevel[] = ['low', 'moderate', 'high', 'critical'];\n    for (const level of levels) {\n      lines.push(\n        `| ${level} | ${analysis.metrics.complexityDistribution[level]} | ${analysis.metrics.filesByLevel[level]} |`\n      );\n    }\n    lines.push('');\n\n    // Top Complex Files\n    if (analysis.metrics.topComplexFiles.length > 0) {\n      lines.push('## Most Complex Files');\n      lines.push('');\n      lines.push('| File | Cyclomatic Complexity |');\n      lines.push('|------|----------------------|');\n      for (const file of analysis.metrics.topComplexFiles) {\n        lines.push(`| ${file.path} | ${file.score} |`);\n      }\n      lines.push('');\n    }\n\n    // Top Complex Functions\n    if (analysis.metrics.topComplexFunctions.length > 0) {\n      lines.push('## Most Complex Functions');\n      lines.push('');\n      lines.push('| Function | File | Score |');\n      lines.push('|----------|------|-------|');\n      for (const fn of analysis.metrics.topComplexFunctions) {\n        lines.push(`| ${fn.name} | ${fn.file} | ${fn.score} |`);\n      }\n      lines.push('');\n    }\n\n    // Hotspots\n    if (analysis.hotspots.length > 0) {\n      lines.push('## Hotspots Requiring Attention');\n      lines.push('');\n      for (const hotspot of analysis.hotspots.slice(0, 10)) {\n        const relativePath = relative(this.projectRoot, hotspot.filePath);\n        lines.push(`### ${basename(hotspot.filePath)}`);\n        lines.push('');\n        lines.push(`- **Path**: \\`${relativePath}\\``);\n        lines.push(`- **Complexity Level**: ${hotspot.level}`);\n        lines.push(`- **Functions**: ${hotspot.functions.length}`);\n        lines.push(`- **Complex Functions**: ${hotspot.complexFunctions.length}`);\n        lines.push('');\n\n        if (hotspot.complexFunctions.length > 0) {\n          lines.push('**Complex Functions:**');\n          for (const fn of hotspot.complexFunctions) {\n            lines.push(`- \\`${fn.name}\\` (CC: ${fn.complexity.cyclomatic})`);\n          }\n          lines.push('');\n        }\n      }\n    }\n\n    return lines.join('\\n');\n  }\n\n  // ==========================================================================\n  // Helper Methods\n  // ==========================================================================\n\n  private generateFunctionTitle(fn: FunctionAnalysis): string {\n    const prefix = fn.parentName ? `${fn.parentName}.` : '';\n    return `Complex Function: ${prefix}${fn.name}`;\n  }\n\n  private generateFunctionTags(fn: FunctionAnalysis): string[] {\n    const tags = ['complexity', fn.level, fn.kind];\n\n    if (fn.isAsync) tags.push('async');\n    if (fn.complexity.cyclomatic >= this.thresholds.critical) {\n      tags.push('needs-refactoring');\n    }\n    if (fn.complexity.maxNestingDepth > 4) {\n      tags.push('deep-nesting');\n    }\n\n    return tags;\n  }\n\n  private generateFileTags(file: FileAnalysis): string[] {\n    const tags = ['complexity', file.level, 'file'];\n\n    if (file.complexFunctions.length > 3) {\n      tags.push('multiple-hotspots');\n    }\n    if (file.complexity.maintainabilityIndex < 50) {\n      tags.push('low-maintainability');\n    }\n\n    return tags;\n  }\n\n  private generateFileIssues(file: FileAnalysis): string[] {\n    const issues: string[] = [];\n\n    if (file.complexFunctions.length > 0) {\n      issues.push(\n        `Contains ${file.complexFunctions.length} complex function(s) that need attention`\n      );\n    }\n\n    if (file.complexity.maintainabilityIndex < 50) {\n      issues.push(\n        `Low maintainability index (${file.complexity.maintainabilityIndex})`\n      );\n    }\n\n    if (file.complexity.avgCyclomatic > 10) {\n      issues.push(\n        `High average cyclomatic complexity (${file.complexity.avgCyclomatic})`\n      );\n    }\n\n    return issues;\n  }\n\n  private generateFileRecommendations(file: FileAnalysis): string[] {\n    const recommendations: string[] = [];\n\n    if (file.complexFunctions.length > 3) {\n      recommendations.push('Consider splitting this file into smaller modules');\n    }\n\n    if (file.complexity.avgCyclomatic > 10) {\n      recommendations.push('Refactor complex functions to reduce average complexity');\n    }\n\n    if (file.complexity.functionCount > 20) {\n      recommendations.push('Large number of functions - consider organizing into classes');\n    }\n\n    return recommendations;\n  }\n\n  private generateDescription(node: ComplexityNode): string {\n    if (node.type === 'complex-function') {\n      return `Complex function with cyclomatic complexity ${node.complexity.cyclomatic}`;\n    }\n    return `Complex file containing ${node.relatedNodes.length} complexity hotspots`;\n  }\n\n  private getSeverityEmoji(level: ComplexityLevel): string {\n    switch (level) {\n      case 'critical':\n        return '🔴';\n      case 'high':\n        return '🟠';\n      case 'moderate':\n        return '🟡';\n      case 'low':\n        return '🟢';\n    }\n  }\n}\n\n// ============================================================================\n// Factory Functions\n// ============================================================================\n\n/**\n * Create a complexity graph generator\n */\nexport function createGraphGenerator(\n  projectRoot: string,\n  config?: Partial<AnalyzerConfig>\n): ComplexityGraphGenerator {\n  return new ComplexityGraphGenerator(projectRoot, config);\n}\n\n/**\n * Generate knowledge graph nodes from analysis\n */\nexport function generateComplexityNodes(\n  analysis: ProjectAnalysis,\n  projectRoot: string\n): { nodes: ComplexityNode[]; edges: ComplexityEdge[] } {\n  const generator = new ComplexityGraphGenerator(projectRoot);\n  const nodes = generator.generateNodes(analysis);\n  const edges = generator.generateEdges(nodes, analysis);\n  return { nodes, edges };\n}\n"],"names":[],"mappings":";;AAgCA,SAAS,eAAe,MAA0B,UAAkB,cAA+B;AACjG,QAAM,QAAQ,eACV,GAAG,IAAI,IAAI,QAAQ,IAAI,YAAY,KACnC,GAAG,IAAI,IAAI,QAAQ;AAEvB,QAAM,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACzE,SAAO,cAAc,IAAI;AAC3B;AAKA,SAAS,QAAQ,MAAsB;AACrC,SAAO,KACJ,cACA,QAAQ,eAAe,GAAG,EAC1B,QAAQ,UAAU,EAAE;AACzB;AASO,MAAM,yBAAyB;AAAA,EAC5B;AAAA,EACA;AAAA,EAER,YAAY,aAAqB,QAAkC;AACjE,SAAK,cAAc;AACnB,SAAK,aAAa;AAAA,MAChB,MAAM,QAAQ,YAAY,kBAAkB;AAAA,MAC5C,UAAU,QAAQ,YAAY,sBAAsB;AAAA,IAAA;AAAA,EAExD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cAAc,UAA6C;AACzD,UAAM,QAA0B,CAAA;AAGhC,eAAW,MAAM,SAAS,kBAAkB;AAC1C,YAAM,OAAO,KAAK,qBAAqB,EAAE;AACzC,YAAM,KAAK,IAAI;AAAA,IACjB;AAGA,eAAW,QAAQ,SAAS,UAAU;AACpC,YAAM,OAAO,KAAK,iBAAiB,IAAI;AACvC,YAAM,KAAK,IAAI;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB,IAAsC;AACzD,UAAM,KAAK,eAAe,oBAAoB,GAAG,UAAU,GAAG,IAAI;AAC7C,aAAS,KAAK,aAAa,GAAG,QAAQ;AAE3D,WAAO;AAAA,MACL;AAAA,MACA,MAAM;AAAA,MACN,OAAO,KAAK,sBAAsB,EAAE;AAAA,MACpC,UAAU,GAAG;AAAA,MACb,cAAc,GAAG;AAAA,MACjB,WAAW,EAAE,OAAO,GAAG,WAAW,KAAK,GAAG,QAAA;AAAA,MAC1C,YAAY,GAAG;AAAA,MACf,OAAO,GAAG;AAAA,MACV,QAAQ,GAAG;AAAA,MACX,iBAAiB,GAAG;AAAA,MACpB,cAAc,CAAA;AAAA,MACd,MAAM,KAAK,qBAAqB,EAAE;AAAA,MAClC,+BAAe,KAAA;AAAA,IAAK;AAAA,EAExB;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,MAAoC;AACnD,UAAM,KAAK,eAAe,gBAAgB,KAAK,QAAQ;AAClC,aAAS,KAAK,aAAa,KAAK,QAAQ;AAE7D,WAAO;AAAA,MACL;AAAA,MACA,MAAM;AAAA,MACN,OAAO,iBAAiB,SAAS,KAAK,QAAQ,CAAC;AAAA,MAC/C,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK,mBAAmB,IAAI;AAAA,MACpC,iBAAiB,KAAK,4BAA4B,IAAI;AAAA,MACtD,cAAc,KAAK,UAAU;AAAA,QAAI,CAAC,OAChC,eAAe,oBAAoB,KAAK,UAAU,GAAG,IAAI;AAAA,MAAA;AAAA,MAE3D,MAAM,KAAK,iBAAiB,IAAI;AAAA,MAChC,+BAAe,KAAA;AAAA,IAAK;AAAA,EAExB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,cACE,OACA,UACkB;AAClB,UAAM,QAA0B,CAAA;AAGhC,eAAW,QAAQ,SAAS,UAAU;AACpC,YAAM,aAAa,eAAe,gBAAgB,KAAK,QAAQ;AAE/D,iBAAW,MAAM,KAAK,kBAAkB;AACtC,cAAM,WAAW,eAAe,oBAAoB,KAAK,UAAU,GAAG,IAAI;AAE1E,cAAM,KAAK;AAAA,UACT,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,MAAM;AAAA,UACN,QAAQ,GAAG,WAAW,aAAa,KAAK,WAAW;AAAA,UACnD,iBAAiB,GAAG,WAAW;AAAA,UAC/B,SAAS,GAAG,GAAG,IAAI;AAAA,QAAA,CACpB;AAAA,MACH;AAAA,IACF;AAGA,eAAW,QAAQ,SAAS,OAAO;AACjC,YAAM,aAAa,KAAK;AACxB,eAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,iBAAS,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC9C,gBAAM,MAAM,WAAW,CAAC;AACxB,gBAAM,MAAM,WAAW,CAAC;AAExB,gBAAM,KAAK;AAAA,YACT,QAAQ,eAAe,oBAAoB,KAAK,UAAU,IAAI,IAAI;AAAA,YAClE,QAAQ,eAAe,oBAAoB,KAAK,UAAU,IAAI,IAAI;AAAA,YAClE,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,SAAS;AAAA,UAAA,CACV;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,iBAAiB,OAA0C;AACzD,WAAO,MAAM,IAAI,CAAC,SAAS,KAAK,sBAAsB,IAAI,CAAC;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA,EAKQ,sBAAsB,MAAqC;AACjE,UAAM,eAAe,SAAS,KAAK,aAAa,KAAK,QAAQ;AAC7D,UAAM,WAAW,GAAG,QAAQ,KAAK,KAAK,CAAC;AAEvC,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM,mBAAmB,QAAQ;AAAA,MACjC;AAAA,MACA,OAAO,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,QAAQ,KAAK,UAAU,aAAa,WAAW;AAAA,MAC/C,SAAS,KAAK,wBAAwB,IAAI;AAAA,MAC1C,aAAa;AAAA,QACX,OAAO,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,QAAQ,KAAK,UAAU,aAAa,WAAW;AAAA,QAC/C,MAAM,KAAK;AAAA,QACX,UAAU;AAAA,QACV,aAAa,KAAK,oBAAoB,IAAI;AAAA,QAC1C,SAAS,KAAK,UAAU,YAAA;AAAA,QACxB,kBAAkB,KAAK;AAAA,QACvB,uBAAuB,KAAK,WAAW;AAAA,QACvC,sBAAsB,KAAK,WAAW;AAAA,QACtC,WAAW;AAAA,QACX,eAAe,KAAK;AAAA,MAAA;AAAA,MAEtB,MAAM,KAAK;AAAA,MACX,eAAe,KAAK,aAAa,IAAI,CAAC,YAAY;AAAA,QAChD;AAAA,QACA,MAAM;AAAA,QACN,SAAS;AAAA,MAAA,EACT;AAAA,MACF,eAAe,CAAA;AAAA,MACf,WAAW;AAAA,MACX,cAAc,KAAK;AAAA,IAAA;AAAA,EAEvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,wBAAwB,MAA8B;AACpD,UAAM,eAAe,SAAS,KAAK,aAAa,KAAK,QAAQ;AAC7D,UAAM,QAAkB,CAAA;AAGxB,UAAM,KAAK,KAAK,KAAK,KAAK,EAAE;AAC5B,UAAM,KAAK,EAAE;AAGb,UAAM,gBAAgB,KAAK,iBAAiB,KAAK,KAAK;AACtD,UAAM,KAAK,KAAK,aAAa,gBAAgB,KAAK,MAAM,aAAa,IAAI;AACzE,UAAM,KAAK,EAAE;AAGb,UAAM,KAAK,aAAa;AACxB,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,iBAAiB,YAAY,IAAI;AAC5C,QAAI,KAAK,cAAc;AACrB,YAAM,KAAK,qBAAqB,KAAK,YAAY,IAAI;AAAA,IACvD;AACA,QAAI,KAAK,WAAW;AAClB,YAAM,KAAK,gBAAgB,KAAK,UAAU,KAAK,MAAM,KAAK,UAAU,GAAG,EAAE;AAAA,IAC3E;AACA,UAAM,KAAK,EAAE;AAGb,UAAM,KAAK,uBAAuB;AAClC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,gCAAgC;AAC3C,UAAM,KAAK,gCAAgC;AAC3C,UAAM;AAAA,MACJ,6BAA6B,KAAK,WAAW,UAAU,MAAM,KAAK,WAAW,IAAI,aAAa,KAAK,WAAW,QAAQ;AAAA,IAAA;AAExH,UAAM;AAAA,MACJ,4BAA4B,KAAK,WAAW,SAAS;AAAA,IAAA;AAEvD,UAAM,KAAK,qBAAqB,KAAK,WAAW,GAAG,eAAe;AAClE,UAAM,KAAK,yBAAyB,KAAK,WAAW,eAAe,cAAc;AACjF,UAAM,KAAK,EAAE;AAGb,QAAI,KAAK,OAAO,SAAS,GAAG;AAC1B,YAAM,KAAK,oBAAoB;AAC/B,YAAM,KAAK,EAAE;AACb,iBAAW,SAAS,KAAK,QAAQ;AAC/B,cAAM,KAAK,KAAK,KAAK,EAAE;AAAA,MACzB;AACA,YAAM,KAAK,EAAE;AAAA,IACf;AAGA,QAAI,KAAK,gBAAgB,SAAS,GAAG;AACnC,YAAM,KAAK,oBAAoB;AAC/B,YAAM,KAAK,EAAE;AACb,iBAAW,OAAO,KAAK,iBAAiB;AACtC,cAAM,KAAK,KAAK,GAAG,EAAE;AAAA,MACvB;AACA,YAAM,KAAK,EAAE;AAAA,IACf;AAGA,QAAI,KAAK,aAAa,SAAS,GAAG;AAChC,YAAM,KAAK,qBAAqB;AAChC,YAAM,KAAK,EAAE;AACb,iBAAW,WAAW,KAAK,cAAc;AACvC,cAAM,KAAK,OAAO,OAAO,IAAI;AAAA,MAC/B;AACA,YAAM,KAAK,EAAE;AAAA,IACf;AAGA,UAAM,KAAK,SAAS;AACpB,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC;AACrD,UAAM,KAAK,EAAE;AAEb,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKA,sBAAsB,UAAmC;AACvD,UAAM,QAAkB,CAAA;AAExB,UAAM,KAAK,mCAAmC;AAC9C,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,iBAAgB,oBAAI,QAAO,YAAA,CAAa,EAAE;AACrD,UAAM,KAAK,EAAE;AAGb,UAAM,KAAK,YAAY;AACvB,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,+BAA+B,SAAS,QAAQ,UAAU,EAAE;AACvE,UAAM,KAAK,0BAA0B,SAAS,QAAQ,cAAc,EAAE;AACtE,UAAM,KAAK,8BAA8B,SAAS,QAAQ,QAAQ,EAAE;AACpE,UAAM,KAAK,4BAA4B,SAAS,OAAO,UAAU,IAAI;AACrE,UAAM,KAAK,EAAE;AAGb,UAAM,KAAK,oBAAoB;AAC/B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,oBAAoB;AAC/B,UAAM,KAAK,oBAAoB;AAC/B,UAAM,KAAK,6BAA6B,SAAS,QAAQ,aAAa,IAAI;AAC1E,UAAM,KAAK,4BAA4B,SAAS,QAAQ,YAAY,IAAI;AACxE,UAAM,KAAK,6BAA6B,SAAS,QAAQ,kBAAkB,IAAI;AAC/E,UAAM,KAAK,EAAE;AAGb,UAAM,KAAK,4BAA4B;AACvC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,+BAA+B;AAC1C,UAAM,KAAK,+BAA+B;AAC1C,UAAM,SAA4B,CAAC,OAAO,YAAY,QAAQ,UAAU;AACxE,eAAW,SAAS,QAAQ;AAC1B,YAAM;AAAA,QACJ,KAAK,KAAK,MAAM,SAAS,QAAQ,uBAAuB,KAAK,CAAC,MAAM,SAAS,QAAQ,aAAa,KAAK,CAAC;AAAA,MAAA;AAAA,IAE5G;AACA,UAAM,KAAK,EAAE;AAGb,QAAI,SAAS,QAAQ,gBAAgB,SAAS,GAAG;AAC/C,YAAM,KAAK,uBAAuB;AAClC,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,kCAAkC;AAC7C,YAAM,KAAK,iCAAiC;AAC5C,iBAAW,QAAQ,SAAS,QAAQ,iBAAiB;AACnD,cAAM,KAAK,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI;AAAA,MAC/C;AACA,YAAM,KAAK,EAAE;AAAA,IACf;AAGA,QAAI,SAAS,QAAQ,oBAAoB,SAAS,GAAG;AACnD,YAAM,KAAK,2BAA2B;AACtC,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,6BAA6B;AACxC,YAAM,KAAK,6BAA6B;AACxC,iBAAW,MAAM,SAAS,QAAQ,qBAAqB;AACrD,cAAM,KAAK,KAAK,GAAG,IAAI,MAAM,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI;AAAA,MACxD;AACA,YAAM,KAAK,EAAE;AAAA,IACf;AAGA,QAAI,SAAS,SAAS,SAAS,GAAG;AAChC,YAAM,KAAK,iCAAiC;AAC5C,YAAM,KAAK,EAAE;AACb,iBAAW,WAAW,SAAS,SAAS,MAAM,GAAG,EAAE,GAAG;AACpD,cAAM,eAAe,SAAS,KAAK,aAAa,QAAQ,QAAQ;AAChE,cAAM,KAAK,OAAO,SAAS,QAAQ,QAAQ,CAAC,EAAE;AAC9C,cAAM,KAAK,EAAE;AACb,cAAM,KAAK,iBAAiB,YAAY,IAAI;AAC5C,cAAM,KAAK,2BAA2B,QAAQ,KAAK,EAAE;AACrD,cAAM,KAAK,oBAAoB,QAAQ,UAAU,MAAM,EAAE;AACzD,cAAM,KAAK,4BAA4B,QAAQ,iBAAiB,MAAM,EAAE;AACxE,cAAM,KAAK,EAAE;AAEb,YAAI,QAAQ,iBAAiB,SAAS,GAAG;AACvC,gBAAM,KAAK,wBAAwB;AACnC,qBAAW,MAAM,QAAQ,kBAAkB;AACzC,kBAAM,KAAK,OAAO,GAAG,IAAI,WAAW,GAAG,WAAW,UAAU,GAAG;AAAA,UACjE;AACA,gBAAM,KAAK,EAAE;AAAA,QACf;AAAA,MACF;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAMQ,sBAAsB,IAA8B;AAC1D,UAAM,SAAS,GAAG,aAAa,GAAG,GAAG,UAAU,MAAM;AACrD,WAAO,qBAAqB,MAAM,GAAG,GAAG,IAAI;AAAA,EAC9C;AAAA,EAEQ,qBAAqB,IAAgC;AAC3D,UAAM,OAAO,CAAC,cAAc,GAAG,OAAO,GAAG,IAAI;AAE7C,QAAI,GAAG,QAAS,MAAK,KAAK,OAAO;AACjC,QAAI,GAAG,WAAW,cAAc,KAAK,WAAW,UAAU;AACxD,WAAK,KAAK,mBAAmB;AAAA,IAC/B;AACA,QAAI,GAAG,WAAW,kBAAkB,GAAG;AACrC,WAAK,KAAK,cAAc;AAAA,IAC1B;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,iBAAiB,MAA8B;AACrD,UAAM,OAAO,CAAC,cAAc,KAAK,OAAO,MAAM;AAE9C,QAAI,KAAK,iBAAiB,SAAS,GAAG;AACpC,WAAK,KAAK,mBAAmB;AAAA,IAC/B;AACA,QAAI,KAAK,WAAW,uBAAuB,IAAI;AAC7C,WAAK,KAAK,qBAAqB;AAAA,IACjC;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,mBAAmB,MAA8B;AACvD,UAAM,SAAmB,CAAA;AAEzB,QAAI,KAAK,iBAAiB,SAAS,GAAG;AACpC,aAAO;AAAA,QACL,YAAY,KAAK,iBAAiB,MAAM;AAAA,MAAA;AAAA,IAE5C;AAEA,QAAI,KAAK,WAAW,uBAAuB,IAAI;AAC7C,aAAO;AAAA,QACL,8BAA8B,KAAK,WAAW,oBAAoB;AAAA,MAAA;AAAA,IAEtE;AAEA,QAAI,KAAK,WAAW,gBAAgB,IAAI;AACtC,aAAO;AAAA,QACL,uCAAuC,KAAK,WAAW,aAAa;AAAA,MAAA;AAAA,IAExE;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,4BAA4B,MAA8B;AAChE,UAAM,kBAA4B,CAAA;AAElC,QAAI,KAAK,iBAAiB,SAAS,GAAG;AACpC,sBAAgB,KAAK,mDAAmD;AAAA,IAC1E;AAEA,QAAI,KAAK,WAAW,gBAAgB,IAAI;AACtC,sBAAgB,KAAK,yDAAyD;AAAA,IAChF;AAEA,QAAI,KAAK,WAAW,gBAAgB,IAAI;AACtC,sBAAgB,KAAK,8DAA8D;AAAA,IACrF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,oBAAoB,MAA8B;AACxD,QAAI,KAAK,SAAS,oBAAoB;AACpC,aAAO,+CAA+C,KAAK,WAAW,UAAU;AAAA,IAClF;AACA,WAAO,2BAA2B,KAAK,aAAa,MAAM;AAAA,EAC5D;AAAA,EAEQ,iBAAiB,OAAgC;AACvD,YAAQ,OAAA;AAAA,MACN,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,MACT,KAAK;AACH,eAAO;AAAA,IAAA;AAAA,EAEb;AACF;AAmBO,SAAS,wBACd,UACA,aACsD;AACtD,QAAM,YAAY,IAAI,yBAAyB,WAAW;AAC1D,QAAM,QAAQ,UAAU,cAAc,QAAQ;AAC9C,QAAM,QAAQ,UAAU,cAAc,OAAO,QAAQ;AACrD,SAAO,EAAE,OAAO,MAAA;AAClB;"}