code-auditor-mcp 1.20.0 → 2.0.0

package/dist/analyzers/cross-language/DependencyGraphBuilder.d.ts

@@ -0,0 +1,129 @@
+/**
+ * Cross-Language Dependency Graph Builder
+ * Creates dependency graphs that span multiple programming languages
+ */
+import { DependencyGraph, CrossLanguageEntity, CrossReference } from '../../types/crossLanguage.js';
+export interface GraphBuilderOptions {
+    includeInternalDependencies?: boolean;
+    includeExternalDependencies?: boolean;
+    maxDepth?: number;
+    excludeLanguages?: string[];
+    includeTestFiles?: boolean;
+    clusterByPackage?: boolean;
+}
+export declare class DependencyGraphBuilder {
+    private entities;
+    private references;
+    private options;
+    constructor(options?: GraphBuilderOptions);
+    /**
+     * Build a comprehensive dependency graph
+     */
+    buildGraph(entities: CrossLanguageEntity[], references: CrossReference[]): Promise<DependencyGraph>;
+    /**
+     * Build a focused subgraph around specific entities
+     */
+    buildSubgraph(targetEntityIds: string[], entities: CrossLanguageEntity[], references: CrossReference[], depth?: number): Promise<DependencyGraph>;
+    /**
+     * Analyze dependency health and suggest improvements
+     */
+    analyzeDependencyHealth(graph: DependencyGraph): Promise<{
+        healthScore: number;
+        issues: DependencyIssue[];
+        suggestions: DependencySuggestion[];
+    }>;
+    /**
+     * Filter entities based on options
+     */
+    private filterEntities;
+    /**
+     * Create graph nodes from entities
+     */
+    private createNodes;
+    /**
+     * Create graph edges from references
+     */
+    private createEdges;
+    /**
+     * Detect circular dependencies using DFS
+     */
+    private detectCycles;
+    /**
+     * Calculate various graph metrics
+     */
+    private calculateMetrics;
+    /**
+     * Find entities reachable within specified depth
+     */
+    private findReachableEntities;
+    /**
+     * Apply package-based clustering to nodes
+     */
+    private applyPackageClustering;
+    /**
+     * Calculate node weight based on various factors
+     */
+    private calculateNodeWeight;
+    /**
+     * Determine cluster for an entity
+     */
+    private determineCluster;
+    /**
+     * Extract package/module name from file path
+     */
+    private extractPackageFromFile;
+    /**
+     * Build adjacency list from edges
+     */
+    private buildAdjacencyList;
+    /**
+     * Build adjacency list from references
+     */
+    private buildAdjacencyListFromReferences;
+    /**
+     * Calculate maximum depth from a node
+     */
+    private calculateMaxDepth;
+    /**
+     * Count strongly connected components (simplified)
+     */
+    private countStronglyConnectedComponents;
+    /**
+     * Find tightly coupled clusters
+     */
+    private findTightlyCoupledClusters;
+    /**
+     * Find hub nodes with too many dependencies
+     */
+    private findHubNodes;
+    /**
+     * Find orphaned nodes with no dependencies
+     */
+    private findOrphanedNodes;
+    /**
+     * Calculate overall health score
+     */
+    private calculateHealthScore;
+    /**
+     * Generate suggestion for breaking cycles
+     */
+    private generateCycleSuggestion;
+    /**
+     * Check if a file is a test file
+     */
+    private isTestFile;
+}
+export interface DependencyIssue {
+    type: 'circular-dependency' | 'tight-coupling' | 'hub-nodes' | 'orphaned-nodes';
+    severity: 'critical' | 'warning' | 'suggestion';
+    description: string;
+    affectedNodes: string[];
+    impact: 'high' | 'medium' | 'low';
+}
+export interface DependencySuggestion {
+    type: 'break-cycles' | 'reduce-coupling' | 'split-responsibilities' | 'review-orphans';
+    priority: 'high' | 'medium' | 'low';
+    description: string;
+    implementation: string;
+}
+//# sourceMappingURL=DependencyGraphBuilder.d.ts.map

package/dist/analyzers/cross-language/DependencyGraphBuilder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DependencyGraphBuilder.d.ts","sourceRoot":"","sources":["../../../src/analyzers/cross-language/DependencyGraphBuilder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACL,eAAe,EAKf,mBAAmB,EACnB,cAAc,EACf,MAAM,8BAA8B,CAAC;AAEtC,MAAM,WAAW,mBAAmB;IAClC,2BAA2B,CAAC,EAAE,OAAO,CAAC;IACtC,2BAA2B,CAAC,EAAE,OAAO,CAAC;IACtC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED,qBAAa,sBAAsB;IACjC,OAAO,CAAC,QAAQ,CAA6B;IAC7C,OAAO,CAAC,UAAU,CAAwB;IAC1C,OAAO,CAAC,OAAO,CAAsB;gBAEzB,OAAO,GAAE,mBAAwB;IAW7C;;OAEG;IACG,UAAU,CACd,QAAQ,EAAE,mBAAmB,EAAE,EAC/B,UAAU,EAAE,cAAc,EAAE,GAC3B,OAAO,CAAC,eAAe,CAAC;IAqC3B;;OAEG;IACG,aAAa,CACjB,eAAe,EAAE,MAAM,EAAE,EACzB,QAAQ,EAAE,mBAAmB,EAAE,EAC/B,UAAU,EAAE,cAAc,EAAE,EAC5B,KAAK,GAAE,MAAU,GAChB,OAAO,CAAC,eAAe,CAAC;IAa3B;;OAEG;IACG,uBAAuB,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC;QAC7D,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,eAAe,EAAE,CAAC;QAC1B,WAAW,EAAE,oBAAoB,EAAE,CAAC;KACrC,CAAC;IAyFF;;OAEG;IACH,OAAO,CAAC,cAAc;IAoBtB;;OAEG;IACH,OAAO,CAAC,WAAW;IAYnB;;OAEG;IACH,OAAO,CAAC,WAAW;IAcnB;;OAEG;IACH,OAAO,CAAC,YAAY;IAwCpB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAoBxB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA8B7B;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAQ9B;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAqB3B;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAOxB;;OAEG;IACH,OAAO,CAAC,sBAAsB;IAuB9B;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAa1B;;OAEG;IACH,OAAO,CAAC,gCAAgC;IAaxC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAoBzB;;OAEG;IACH,OAAO,CAAC,gCAAgC;IAKxC;;OAEG;IACH,OAAO,CAAC,0BAA0B;IA6BlC;;OAEG;IACH,OAAO,CAAC,YAAY;IAcpB;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAWzB;;OAEG;IACH,OAAO,CAAC,oBAAoB;IA6B5B;;OAEG;IACH,OAAO,CAAC,uBAAuB;IAU/B;;OAEG;IACH,OAAO,CAAC,UAAU;CAUnB;AAID,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,qBAAqB,GAAG,gBAAgB,GAAG,WAAW,GAAG,gBAAgB,CAAC;IAChF,QAAQ,EAAE,UAAU,GAAG,SAAS,GAAG,YAAY,CAAC;IAChD,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,MAAM,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,cAAc,GAAG,iBAAiB,GAAG,wBAAwB,GAAG,gBAAgB,CAAC;IACvF,QAAQ,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB"}

package/dist/analyzers/cross-language/DependencyGraphBuilder.js

@@ -0,0 +1,473 @@
+/**
+ * Cross-Language Dependency Graph Builder
+ * Creates dependency graphs that span multiple programming languages
+ */
+export class DependencyGraphBuilder {
+    entities = [];
+    references = [];
+    options;
+    constructor(options = {}) {
+        this.options = {
+            includeInternalDependencies: true,
+            includeExternalDependencies: true,
+            maxDepth: 10,
+            includeTestFiles: false,
+            clusterByPackage: true,
+            ...options
+        };
+    }
+    /**
+     * Build a comprehensive dependency graph
+     */
+    async buildGraph(entities, references) {
+        this.entities = entities;
+        this.references = references;
+        console.log(`[DependencyGraphBuilder] Building graph from ${entities.length} entities and ${references.length} references`);
+        // Filter entities based on options
+        const filteredEntities = this.filterEntities(entities);
+        // Create nodes
+        const nodes = this.createNodes(filteredEntities);
+        // Create edges from references
+        const edges = this.createEdges(references, nodes);
+        // Detect cycles
+        const cycles = this.detectCycles(nodes, edges);
+        // Calculate metrics
+        const metrics = this.calculateMetrics(nodes, edges, cycles);
+        // Apply clustering if enabled
+        if (this.options.clusterByPackage) {
+            this.applyPackageClustering(nodes);
+        }
+        const graph = {
+            nodes,
+            edges,
+            cycles,
+            metrics
+        };
+        console.log(`[DependencyGraphBuilder] Generated graph with ${nodes.length} nodes, ${edges.length} edges, ${cycles.length} cycles`);
+        return graph;
+    }
+    /**
+     * Build a focused subgraph around specific entities
+     */
+    async buildSubgraph(targetEntityIds, entities, references, depth = 2) {
+        console.log(`[DependencyGraphBuilder] Building subgraph for ${targetEntityIds.length} target entities with depth ${depth}`);
+        // Find all entities within the specified depth
+        const reachableEntities = this.findReachableEntities(targetEntityIds, entities, references, depth);
+        // Build graph with only reachable entities
+        return this.buildGraph(reachableEntities, references.filter(ref => reachableEntities.some(e => e.id === ref.sourceId) &&
+            reachableEntities.some(e => e.id === ref.targetId)));
+    }
+    /**
+     * Analyze dependency health and suggest improvements
+     */
+    async analyzeDependencyHealth(graph) {
+        const issues = [];
+        const suggestions = [];
+        // Check for circular dependencies
+        if (graph.cycles.length > 0) {
+            issues.push({
+                type: 'circular-dependency',
+                severity: 'critical',
+                description: `Found ${graph.cycles.length} circular dependencies`,
+                affectedNodes: graph.cycles.flatMap(cycle => cycle.nodes),
+                impact: 'high'
+            });
+            suggestions.push({
+                type: 'break-cycles',
+                priority: 'high',
+                description: 'Break circular dependencies by introducing interfaces or dependency injection',
+                implementation: 'Consider using dependency inversion principle to break cycles'
+            });
+        }
+        // Check for tightly coupled clusters
+        const tightlyCoupledClusters = this.findTightlyCoupledClusters(graph);
+        if (tightlyCoupledClusters.length > 0) {
+            issues.push({
+                type: 'tight-coupling',
+                severity: 'warning',
+                description: `Found ${tightlyCoupledClusters.length} tightly coupled clusters`,
+                affectedNodes: tightlyCoupledClusters.flatMap(cluster => cluster.nodes),
+                impact: 'medium'
+            });
+            suggestions.push({
+                type: 'reduce-coupling',
+                priority: 'medium',
+                description: 'Reduce coupling between modules using interfaces and abstractions',
+                implementation: 'Extract common interfaces and use dependency injection'
+            });
+        }
+        // Check for hub nodes (too many dependencies)
+        const hubNodes = this.findHubNodes(graph);
+        if (hubNodes.length > 0) {
+            issues.push({
+                type: 'hub-nodes',
+                severity: 'warning',
+                description: `Found ${hubNodes.length} hub nodes with excessive dependencies`,
+                affectedNodes: hubNodes.map(node => node.id),
+                impact: 'medium'
+            });
+            suggestions.push({
+                type: 'split-responsibilities',
+                priority: 'medium',
+                description: 'Split large modules to reduce their dependency burden',
+                implementation: 'Apply Single Responsibility Principle to break down large modules'
+            });
+        }
+        // Check for orphaned nodes
+        const orphanedNodes = this.findOrphanedNodes(graph);
+        if (orphanedNodes.length > 0) {
+            issues.push({
+                type: 'orphaned-nodes',
+                severity: 'suggestion',
+                description: `Found ${orphanedNodes.length} orphaned nodes with no dependencies`,
+                affectedNodes: orphanedNodes.map(node => node.id),
+                impact: 'low'
+            });
+            suggestions.push({
+                type: 'review-orphans',
+                priority: 'low',
+                description: 'Review orphaned nodes to ensure they are still needed',
+                implementation: 'Consider removing unused code or integrating orphaned modules'
+            });
+        }
+        // Calculate health score
+        const healthScore = this.calculateHealthScore(graph, issues);
+        return {
+            healthScore,
+            issues,
+            suggestions
+        };
+    }
+    /**
+     * Filter entities based on options
+     */
+    filterEntities(entities) {
+        let filtered = entities;
+        // Filter by language
+        if (this.options.excludeLanguages?.length) {
+            filtered = filtered.filter(entity => !this.options.excludeLanguages.includes(entity.language));
+        }
+        // Filter test files
+        if (!this.options.includeTestFiles) {
+            filtered = filtered.filter(entity => !this.isTestFile(entity.file));
+        }
+        return filtered;
+    }
+    /**
+     * Create graph nodes from entities
+     */
+    createNodes(entities) {
+        return entities.map(entity => ({
+            id: entity.id,
+            name: entity.name,
+            language: entity.language,
+            type: entity.type,
+            file: entity.file,
+            weight: this.calculateNodeWeight(entity),
+            cluster: this.determineCluster(entity)
+        }));
+    }
+    /**
+     * Create graph edges from references
+     */
+    createEdges(references, nodes) {
+        const nodeIds = new Set(nodes.map(node => node.id));
+        return references
+            .filter(ref => nodeIds.has(ref.sourceId) && nodeIds.has(ref.targetId))
+            .map(ref => ({
+            from: ref.sourceId,
+            to: ref.targetId,
+            type: ref.type,
+            weight: ref.confidence,
+            protocol: ref.protocol
+        }));
+    }
+    /**
+     * Detect circular dependencies using DFS
+     */
+    detectCycles(nodes, edges) {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const adjList = this.buildAdjacencyList(edges);
+        const dfs = (nodeId, path) => {
+            visited.add(nodeId);
+            recursionStack.add(nodeId);
+            path.push(nodeId);
+            const neighbors = adjList.get(nodeId) || [];
+            for (const neighbor of neighbors) {
+                if (!visited.has(neighbor)) {
+                    dfs(neighbor, [...path]);
+                }
+                else if (recursionStack.has(neighbor)) {
+                    // Found a cycle
+                    const cycleStart = path.indexOf(neighbor);
+                    const cycleNodes = path.slice(cycleStart);
+                    cycles.push({
+                        nodes: cycleNodes,
+                        severity: cycleNodes.length > 5 ? 'critical' : 'warning',
+                        suggestion: this.generateCycleSuggestion(cycleNodes)
+                    });
+                }
+            }
+            recursionStack.delete(nodeId);
+        };
+        for (const node of nodes) {
+            if (!visited.has(node.id)) {
+                dfs(node.id, []);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Calculate various graph metrics
+     */
+    calculateMetrics(nodes, edges, cycles) {
+        const adjList = this.buildAdjacencyList(edges);
+        // Calculate depths from each node
+        const depths = nodes.map(node => this.calculateMaxDepth(node.id, adjList));
+        return {
+            totalNodes: nodes.length,
+            totalEdges: edges.length,
+            cycleCount: cycles.length,
+            averageDepth: depths.reduce((sum, depth) => sum + depth, 0) / depths.length,
+            maxDepth: Math.max(...depths),
+            stronglyConnectedComponents: this.countStronglyConnectedComponents(nodes, edges)
+        };
+    }
+    /**
+     * Find entities reachable within specified depth
+     */
+    findReachableEntities(startIds, entities, references, maxDepth) {
+        const reachable = new Set(startIds);
+        const adjList = this.buildAdjacencyListFromReferences(references);
+        let currentLevel = new Set(startIds);
+        for (let depth = 0; depth < maxDepth && currentLevel.size > 0; depth++) {
+            const nextLevel = new Set();
+            for (const nodeId of currentLevel) {
+                const neighbors = adjList.get(nodeId) || [];
+                for (const neighbor of neighbors) {
+                    if (!reachable.has(neighbor)) {
+                        reachable.add(neighbor);
+                        nextLevel.add(neighbor);
+                    }
+                }
+            }
+            currentLevel = nextLevel;
+        }
+        return entities.filter(entity => reachable.has(entity.id));
+    }
+    /**
+     * Apply package-based clustering to nodes
+     */
+    applyPackageClustering(nodes) {
+        for (const node of nodes) {
+            if (!node.cluster) {
+                node.cluster = this.extractPackageFromFile(node.file, node.language);
+            }
+        }
+    }
+    /**
+     * Calculate node weight based on various factors
+     */
+    calculateNodeWeight(entity) {
+        let weight = 1;
+        // Increase weight for exported/public entities
+        if (entity.visibility === 'public' || entity.metadata?.isExported) {
+            weight += 2;
+        }
+        // Increase weight for complex entities
+        if (entity.complexity && entity.complexity > 5) {
+            weight += Math.floor(entity.complexity / 5);
+        }
+        // Increase weight for interfaces and services
+        if (entity.type === 'interface' || entity.type === 'service') {
+            weight += 3;
+        }
+        return weight;
+    }
+    /**
+     * Determine cluster for an entity
+     */
+    determineCluster(entity) {
+        if (this.options.clusterByPackage) {
+            return this.extractPackageFromFile(entity.file, entity.language);
+        }
+        return entity.language;
+    }
+    /**
+     * Extract package/module name from file path
+     */
+    extractPackageFromFile(filePath, language) {
+        const parts = filePath.split('/');
+        switch (language) {
+            case 'go':
+                // For Go, use the last directory as package
+                return parts[parts.length - 2] || 'main';
+            case 'typescript':
+            case 'javascript':
+                // For TS/JS, look for common structure patterns
+                if (parts.includes('src')) {
+                    const srcIndex = parts.indexOf('src');
+                    return parts[srcIndex + 1] || 'src';
+                }
+                return parts[parts.length - 2] || 'root';
+            case 'python':
+                // For Python, use directory structure
+                return parts[parts.length - 2] || 'main';
+            default:
+                return 'unknown';
+        }
+    }
+    /**
+     * Build adjacency list from edges
+     */
+    buildAdjacencyList(edges) {
+        const adjList = new Map();
+        for (const edge of edges) {
+            if (!adjList.has(edge.from)) {
+                adjList.set(edge.from, []);
+            }
+            adjList.get(edge.from).push(edge.to);
+        }
+        return adjList;
+    }
+    /**
+     * Build adjacency list from references
+     */
+    buildAdjacencyListFromReferences(references) {
+        const adjList = new Map();
+        for (const ref of references) {
+            if (!adjList.has(ref.sourceId)) {
+                adjList.set(ref.sourceId, []);
+            }
+            adjList.get(ref.sourceId).push(ref.targetId);
+        }
+        return adjList;
+    }
+    /**
+     * Calculate maximum depth from a node
+     */
+    calculateMaxDepth(nodeId, adjList) {
+        const visited = new Set();
+        const dfs = (currentId) => {
+            if (visited.has(currentId))
+                return 0; // Avoid cycles
+            visited.add(currentId);
+            const neighbors = adjList.get(currentId) || [];
+            if (neighbors.length === 0)
+                return 1;
+            const maxChildDepth = Math.max(...neighbors.map(neighbor => dfs(neighbor)));
+            visited.delete(currentId);
+            return 1 + maxChildDepth;
+        };
+        return dfs(nodeId);
+    }
+    /**
+     * Count strongly connected components (simplified)
+     */
+    countStronglyConnectedComponents(nodes, edges) {
+        // Simplified implementation - would use Tarjan's algorithm in practice
+        return Math.ceil(nodes.length / 10); // Rough estimate
+    }
+    /**
+     * Find tightly coupled clusters
+     */
+    findTightlyCoupledClusters(graph) {
+        const clusters = new Map();
+        // Group nodes by cluster
+        for (const node of graph.nodes) {
+            const cluster = node.cluster || 'default';
+            if (!clusters.has(cluster)) {
+                clusters.set(cluster, []);
+            }
+            clusters.get(cluster).push(node.id);
+        }
+        const tightlyCoupled = [];
+        for (const [clusterName, nodeIds] of clusters) {
+            const internalEdges = graph.edges.filter(edge => nodeIds.includes(edge.from) && nodeIds.includes(edge.to));
+            const coupling = internalEdges.length / (nodeIds.length * (nodeIds.length - 1));
+            if (coupling > 0.7) { // High coupling threshold
+                tightlyCoupled.push({ nodes: nodeIds, coupling });
+            }
+        }
+        return tightlyCoupled;
+    }
+    /**
+     * Find hub nodes with too many dependencies
+     */
+    findHubNodes(graph) {
+        const dependencyCounts = new Map();
+        for (const edge of graph.edges) {
+            dependencyCounts.set(edge.from, (dependencyCounts.get(edge.from) || 0) + 1);
+        }
+        const threshold = Math.max(5, graph.nodes.length * 0.1); // 10% of nodes or minimum 5
+        return graph.nodes.filter(node => (dependencyCounts.get(node.id) || 0) > threshold);
+    }
+    /**
+     * Find orphaned nodes with no dependencies
+     */
+    findOrphanedNodes(graph) {
+        const connectedNodes = new Set();
+        for (const edge of graph.edges) {
+            connectedNodes.add(edge.from);
+            connectedNodes.add(edge.to);
+        }
+        return graph.nodes.filter(node => !connectedNodes.has(node.id));
+    }
+    /**
+     * Calculate overall health score
+     */
+    calculateHealthScore(graph, issues) {
+        let score = 100;
+        for (const issue of issues) {
+            switch (issue.severity) {
+                case 'critical':
+                    score -= 20;
+                    break;
+                case 'warning':
+                    score -= 10;
+                    break;
+                case 'suggestion':
+                    score -= 5;
+                    break;
+            }
+        }
+        // Additional penalties
+        if (graph.cycles.length > 0) {
+            score -= graph.cycles.length * 5;
+        }
+        if (graph.metrics.maxDepth > 15) {
+            score -= 10;
+        }
+        return Math.max(0, score);
+    }
+    /**
+     * Generate suggestion for breaking cycles
+     */
+    generateCycleSuggestion(cycleNodes) {
+        if (cycleNodes.length === 2) {
+            return 'Consider using dependency injection or extracting a common interface';
+        }
+        else if (cycleNodes.length <= 5) {
+            return 'Consider introducing a mediator pattern or event-driven architecture';
+        }
+        else {
+            return 'This is a complex cycle - consider major refactoring to break it down into smaller modules';
+        }
+    }
+    /**
+     * Check if a file is a test file
+     */
+    isTestFile(filePath) {
+        return filePath.includes('test') ||
+            filePath.includes('spec') ||
+            filePath.includes('__tests__') ||
+            filePath.endsWith('.test.ts') ||
+            filePath.endsWith('.test.js') ||
+            filePath.endsWith('.spec.ts') ||
+            filePath.endsWith('.spec.js') ||
+            filePath.endsWith('_test.go');
+    }
+}
+//# sourceMappingURL=DependencyGraphBuilder.js.map

package/dist/analyzers/cross-language/DependencyGraphBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DependencyGraphBuilder.js","sourceRoot":"","sources":["../../../src/analyzers/cross-language/DependencyGraphBuilder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAqBH,MAAM,OAAO,sBAAsB;IACzB,QAAQ,GAA0B,EAAE,CAAC;IACrC,UAAU,GAAqB,EAAE,CAAC;IAClC,OAAO,CAAsB;IAErC,YAAY,UAA+B,EAAE;QAC3C,IAAI,CAAC,OAAO,GAAG;YACb,2BAA2B,EAAE,IAAI;YACjC,2BAA2B,EAAE,IAAI;YACjC,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,KAAK;YACvB,gBAAgB,EAAE,IAAI;YACtB,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CACd,QAA+B,EAC/B,UAA4B;QAE5B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,OAAO,CAAC,GAAG,CAAC,gDAAgD,QAAQ,CAAC,MAAM,iBAAiB,UAAU,CAAC,MAAM,aAAa,CAAC,CAAC;QAE5H,mCAAmC;QACnC,MAAM,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAEvD,eAAe;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAEjD,+BAA+B;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAElD,gBAAgB;QAChB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE/C,oBAAoB;QACpB,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAE5D,8BAA8B;QAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAClC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,KAAK,GAAoB;YAC7B,KAAK;YACL,KAAK;YACL,MAAM;YACN,OAAO;SACR,CAAC;QAEF,OAAO,CAAC,GAAG,CAAC,iDAAiD,KAAK,CAAC,MAAM,WAAW,KAAK,CAAC,MAAM,WAAW,MAAM,CAAC,MAAM,SAAS,CAAC,CAAC;QACnI,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,eAAyB,EACzB,QAA+B,EAC/B,UAA4B,EAC5B,QAAgB,CAAC;QAEjB,OAAO,CAAC,GAAG,CAAC,kDAAkD,eAAe,CAAC,MAAM,+BAA+B,KAAK,EAAE,CAAC,CAAC;QAE5H,+CAA+C;QAC/C,MAAM,iBAAiB,GAAG,IAAI,CAAC,qBAAqB,CAAC,eAAe,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAEnG,2CAA2C;QAC3C,OAAO,IAAI,CAAC,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAChE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,QAAQ,CAAC;YAClD,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,QAAQ,CAAC,CACnD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,uBAAuB,CAAC,KAAsB;QAKlD,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,MAAM,WAAW,GAA2B,EAAE,CAAC;QAE/C,kCAAkC;QAClC,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,qBAAqB;gBAC3B,QAAQ,EAAE,UAAU;gBACpB,WAAW,EAAE,SAAS,KAAK,CAAC,MAAM,CAAC,MAAM,wBAAwB;gBACjE,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;gBACzD,MAAM,EAAE,MAAM;aACf,CAAC,CAAC;YAEH,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,cAAc;gBACpB,QAAQ,EAAE,MAAM;gBAChB,WAAW,EAAE,+EAA+E;gBAC5F,cAAc,EAAE,+DAA+D;aAChF,CAAC,CAAC;QACL,CAAC;QAED,qCAAqC;QACrC,MAAM,sBAAsB,GAAG,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;QACtE,IAAI,sBAAsB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,gBAAgB;gBACtB,QAAQ,EAAE,SAAS;gBACnB,WAAW,EAAE,SAAS,sBAAsB,CAAC,MAAM,2BAA2B;gBAC9E,aAAa,EAAE,sBAAsB,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;gBACvE,MAAM,EAAE,QAAQ;aACjB,CAAC,CAAC;YAEH,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,iBAAiB;gBACvB,QAAQ,EAAE,QAAQ;gBAClB,WAAW,EAAE,mEAAmE;gBAChF,cAAc,EAAE,wDAAwD;aACzE,CAAC,CAAC;QACL,CAAC;QAED,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,WAAW;gBACjB,QAAQ,EAAE,SAAS;gBACnB,WAAW,EAAE,SAAS,QAAQ,CAAC,MAAM,wCAAwC;gBAC7E,aAAa,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,MAAM,EAAE,QAAQ;aACjB,CAAC,CAAC;YAEH,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,wBAAwB;gBAC9B,QAAQ,EAAE,QAAQ;gBAClB,WAAW,EAAE,uDAAuD;gBACpE,cAAc,EAAE,mEAAmE;aACpF,CAAC,CAAC;QACL,CAAC;QAED,2BAA2B;QAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,gBAAgB;gBACtB,QAAQ,EAAE,YAAY;gBACtB,WAAW,EAAE,SAAS,aAAa,CAAC,MAAM,sCAAsC;gBAChF,aAAa,EAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjD,MAAM,EAAE,KAAK;aACd,CAAC,CAAC;YAEH,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,gBAAgB;gBACtB,QAAQ,EAAE,KAAK;gBACf,WAAW,EAAE,uDAAuD;gBACpE,cAAc,EAAE,+DAA+D;aAChF,CAAC,CAAC;QACL,CAAC;QAED,yBAAyB;QACzB,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAE7D,OAAO;YACL,WAAW;YACX,MAAM;YACN,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAA+B;QACpD,IAAI,QAAQ,GAAG,QAAQ,CAAC;QAExB,qBAAqB;QACrB,IAAI,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;YAC1C,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAClC,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAC1D,CAAC;QACJ,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YACnC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAClC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAC9B,CAAC;QACJ,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,QAA+B;QACjD,OAAO,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC7B,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC;YACxC,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;SACvC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,UAA4B,EAAE,KAAuB;QACvE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpD,OAAO,UAAU;aACd,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aACrE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,QAAQ;YAClB,EAAE,EAAE,GAAG,CAAC,QAAQ;YAChB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,MAAM,EAAE,GAAG,CAAC,UAAU;YACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ;SACvB,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,KAAuB,EAAE,KAAuB;QACnE,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,CAAC,MAAc,EAAE,IAAc,EAAQ,EAAE;YACnD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAC3B,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,gBAAgB;oBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAE1C,MAAM,CAAC,IAAI,CAAC;wBACV,KAAK,EAAE,UAAU;wBACjB,QAAQ,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS;wBACxD,UAAU,EAAE,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC;qBACrD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAAuB,EACvB,KAAuB,EACvB,MAAyB;QAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAE/C,kCAAkC;QAClC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QAE3E,OAAO;YACL,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,UAAU,EAAE,MAAM,CAAC,MAAM;YACzB,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM;YAC3E,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;YAC7B,2BAA2B,EAAE,IAAI,CAAC,gCAAgC,CAAC,KAAK,EAAE,KAAK,CAAC;SACjF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,qBAAqB,CAC3B,QAAkB,EAClB,QAA+B,EAC/B,UAA4B,EAC5B,QAAgB;QAEhB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;QAElE,IAAI,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAErC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YAEpC,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC7B,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACxB,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QAED,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,KAAuB;QACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,MAA2B;QACrD,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,+CAA+C;QAC/C,IAAI,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,CAAC;YAClE,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QAED,uCAAuC;QACvC,IAAI,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,8CAA8C;QAC9C,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7D,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,MAA2B;QAClD,IAAI,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,MAAM,CAAC,QAAQ,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAElC,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,IAAI;gBACP,4CAA4C;gBAC5C,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;YAC3C,KAAK,YAAY,CAAC;YAClB,KAAK,YAAY;gBACf,gDAAgD;gBAChD,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1B,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACtC,OAAO,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;gBACtC,CAAC;gBACD,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;YAC3C,KAAK,QAAQ;gBACX,sCAAsC;gBACtC,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC;YAC3C;gBACE,OAAO,SAAS,CAAC;QACrB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,KAAuB;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,gCAAgC,CAAC,UAA4B;QACnE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE5C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,MAAc,EAAE,OAA8B;QACtE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,MAAM,GAAG,GAAG,CAAC,SAAiB,EAAU,EAAE;YACxC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,eAAe;YAErD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvB,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YAE/C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YAErC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5E,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAE1B,OAAO,CAAC,GAAG,aAAa,CAAC;QAC3B,CAAC,CAAC;QAEF,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,gCAAgC,CAAC,KAAuB,EAAE,KAAuB;QACvF,uEAAuE;QACvE,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,iBAAiB;IACxD,CAAC;IAED;;OAEG;IACK,0BAA0B,CAAC,KAAsB;QACvD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE7C,yBAAyB;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,SAAS,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC5B,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,cAAc,GAA4C,EAAE,CAAC;QAEnE,KAAK,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC9C,MAAM,aAAa,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAC9C,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CACzD,CAAC;YAEF,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAEhF,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC,CAAC,0BAA0B;gBAC9C,cAAc,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,KAAsB;QACzC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEnD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAErF,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAC/B,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CACjD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAsB;QAC9C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QAEzC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9B,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,KAAsB,EAAE,MAAyB;QAC5E,IAAI,KAAK,GAAG,GAAG,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACvB,KAAK,UAAU;oBACb,KAAK,IAAI,EAAE,CAAC;oBACZ,MAAM;gBACR,KAAK,SAAS;oBACZ,KAAK,IAAI,EAAE,CAAC;oBACZ,MAAM;gBACR,KAAK,YAAY;oBACf,KAAK,IAAI,CAAC,CAAC;oBACX,MAAM;YACV,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,GAAG,EAAE,EAAE,CAAC;YAChC,KAAK,IAAI,EAAE,CAAC;QACd,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,UAAoB;QAClD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,sEAAsE,CAAC;QAChF,CAAC;aAAM,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAClC,OAAO,sEAAsE,CAAC;QAChF,CAAC;aAAM,CAAC;YACN,OAAO,4FAA4F,CAAC;QACtG,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,QAAgB;QACjC,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;YACzB,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;YACzB,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC;YAC9B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC7B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC7B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC7B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;YAC7B,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;CACF"}