@claude-flow/plugin-code-intelligence 3.0.0-alpha.1

package/dist/bridges/gnn-bridge.js

@@ -0,0 +1,527 @@
+/**
+ * GNN Bridge for Code Graph Analysis
+ *
+ * Provides graph neural network operations for code structure analysis
+ * using ruvector-gnn-wasm for high-performance graph algorithms.
+ *
+ * Features:
+ * - Code graph construction
+ * - Node embedding computation
+ * - Impact prediction using graph propagation
+ * - Community detection for module discovery
+ * - Pattern matching in code graphs
+ *
+ * Based on ADR-035: Advanced Code Intelligence Plugin
+ *
+ * @module v3/plugins/code-intelligence/bridges/gnn-bridge
+ */
+/**
+ * GNN Bridge Implementation
+ */
+export class GNNBridge {
+    // WASM module for future performance optimization (currently uses JS fallback)
+    wasmModule = null;
+    initialized = false;
+    embeddingDim;
+    constructor(embeddingDim = 128) {
+        this.embeddingDim = embeddingDim;
+    }
+    /**
+     * Initialize the WASM module
+     */
+    async initialize() {
+        if (this.initialized)
+            return;
+        try {
+            // Dynamic import of WASM module
+            this.wasmModule = await this.loadWasmModule();
+            this.initialized = true;
+        }
+        catch {
+            // Fallback to pure JS implementation
+            console.warn('WASM GNN module not available, using JS fallback');
+            this.wasmModule = null;
+            this.initialized = true;
+        }
+    }
+    /**
+     * Check if initialized
+     */
+    isInitialized() {
+        return this.initialized;
+    }
+    /**
+     * Build code graph from files
+     */
+    async buildCodeGraph(files, _includeCallGraph) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const nodes = [];
+        const edges = [];
+        const nodeMap = new Map();
+        // Create nodes for each file
+        for (let i = 0; i < files.length; i++) {
+            const file = files[i];
+            if (!file)
+                continue;
+            nodeMap.set(file, i);
+            nodes.push({
+                id: file,
+                label: file.split('/').pop() ?? file,
+                type: 'file',
+                language: this.detectLanguage(file),
+            });
+        }
+        // Build edges from imports (simplified - in production would parse AST)
+        for (const file of files) {
+            const imports = await this.extractImports(file, files);
+            for (const imp of imports) {
+                if (nodeMap.has(imp)) {
+                    edges.push({
+                        from: file,
+                        to: imp,
+                        type: 'import',
+                        weight: 1,
+                    });
+                }
+            }
+        }
+        // Calculate metadata
+        const avgDegree = edges.length > 0 ? (edges.length * 2) / nodes.length : 0;
+        const maxDepth = this.calculateMaxDepth(nodes, edges);
+        return {
+            nodes,
+            edges,
+            metadata: {
+                totalNodes: nodes.length,
+                totalEdges: edges.length,
+                avgDegree,
+                maxDepth,
+            },
+        };
+    }
+    /**
+     * Compute node embeddings using GNN
+     */
+    async computeNodeEmbeddings(graph, embeddingDim) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const embeddings = new Map();
+        const nodeCount = graph.nodes.length;
+        if (nodeCount === 0) {
+            return embeddings;
+        }
+        // Create node lookup
+        const nodeMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+        });
+        // Build adjacency list for WASM
+        const edgeArray = new Uint32Array(graph.edges.length * 2);
+        for (let i = 0; i < graph.edges.length; i++) {
+            const edge = graph.edges[i];
+            if (!edge)
+                continue;
+            const fromIdx = nodeMap.get(edge.from) ?? 0;
+            const toIdx = nodeMap.get(edge.to) ?? 0;
+            edgeArray[i * 2] = fromIdx;
+            edgeArray[i * 2 + 1] = toIdx;
+        }
+        // Initialize features (simple degree-based features)
+        const featureDim = 16;
+        const features = new Float32Array(nodeCount * featureDim);
+        for (let i = 0; i < nodeCount; i++) {
+            const node = graph.nodes[i];
+            if (!node)
+                continue;
+            // In-degree
+            features[i * featureDim] = graph.edges.filter(e => e.to === node.id).length;
+            // Out-degree
+            features[i * featureDim + 1] = graph.edges.filter(e => e.from === node.id).length;
+            // Node type encoding
+            features[i * featureDim + 2] = this.encodeNodeType(node.type);
+            // Language encoding
+            features[i * featureDim + 3] = node.language ? this.encodeLanguage(node.language) : 0;
+        }
+        // Compute embeddings (using JS fallback)
+        const embeddingMatrix = this.computeEmbeddingsJS(graph, features, featureDim, embeddingDim);
+        // Extract embeddings per node
+        for (let i = 0; i < nodeCount; i++) {
+            const node = graph.nodes[i];
+            if (!node)
+                continue;
+            const nodeEmbedding = embeddingMatrix.slice(i * embeddingDim, (i + 1) * embeddingDim);
+            embeddings.set(node.id, nodeEmbedding);
+        }
+        return embeddings;
+    }
+    /**
+     * Predict impact of changes using GNN
+     */
+    async predictImpact(graph, changedNodes, depth) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const impact = new Map();
+        const nodeCount = graph.nodes.length;
+        if (nodeCount === 0) {
+            return impact;
+        }
+        // Create node lookup
+        const nodeMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+        });
+        // Build adjacency list (reverse direction for impact propagation)
+        const adj = Array.from({ length: nodeCount }, () => []);
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                // Reverse: impact flows from dependency to dependent
+                adj[toIdx]?.push(fromIdx);
+            }
+        }
+        // Initialize impact scores
+        const scores = new Float32Array(nodeCount);
+        for (const nodeId of changedNodes) {
+            const idx = nodeMap.get(nodeId);
+            if (idx !== undefined) {
+                scores[idx] = 1.0;
+            }
+        }
+        // Propagate impact using BFS with decay
+        const visited = new Set();
+        const queue = [];
+        // Initialize queue with changed nodes
+        for (const nodeId of changedNodes) {
+            const idx = nodeMap.get(nodeId);
+            if (idx !== undefined) {
+                queue.push({ node: idx, depth: 0, score: 1.0 });
+                visited.add(idx);
+            }
+        }
+        // BFS propagation
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (!current || current.depth >= depth)
+                continue;
+            for (const neighbor of adj[current.node] ?? []) {
+                const newScore = current.score * 0.7; // Decay factor
+                const neighborScore = scores[neighbor];
+                if (neighborScore !== undefined && newScore > neighborScore) {
+                    scores[neighbor] = newScore;
+                }
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    queue.push({
+                        node: neighbor,
+                        depth: current.depth + 1,
+                        score: newScore,
+                    });
+                }
+            }
+        }
+        // Convert to map
+        for (let i = 0; i < nodeCount; i++) {
+            const node = graph.nodes[i];
+            const score = scores[i];
+            if (node && score !== undefined && score > 0) {
+                impact.set(node.id, score);
+            }
+        }
+        return impact;
+    }
+    /**
+     * Detect communities in code graph
+     */
+    async detectCommunities(graph) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const communities = new Map();
+        const nodeCount = graph.nodes.length;
+        if (nodeCount === 0) {
+            return communities;
+        }
+        // Create node lookup
+        const nodeMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+        });
+        // Build adjacency list (undirected)
+        const adj = Array.from({ length: nodeCount }, () => new Set());
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                adj[fromIdx]?.add(toIdx);
+                adj[toIdx]?.add(fromIdx);
+            }
+        }
+        // Simple community detection using connected components
+        // In production, would use Louvain or similar
+        const community = new Array(nodeCount).fill(-1);
+        let communityId = 0;
+        for (let i = 0; i < nodeCount; i++) {
+            if (community[i] !== -1)
+                continue;
+            // BFS to find connected component
+            const queue = [i];
+            community[i] = communityId;
+            while (queue.length > 0) {
+                const current = queue.shift();
+                for (const neighbor of adj[current] ?? []) {
+                    if (community[neighbor] === -1) {
+                        community[neighbor] = communityId;
+                        queue.push(neighbor);
+                    }
+                }
+            }
+            communityId++;
+        }
+        // Convert to map
+        for (let i = 0; i < nodeCount; i++) {
+            const node = graph.nodes[i];
+            const comm = community[i];
+            if (node && comm !== undefined) {
+                communities.set(node.id, comm);
+            }
+        }
+        return communities;
+    }
+    /**
+     * Find similar code patterns
+     */
+    async findSimilarPatterns(graph, patternGraph, threshold) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const matches = [];
+        // Compute embeddings for both graphs
+        const graphEmbeddings = await this.computeNodeEmbeddings(graph, this.embeddingDim);
+        const patternEmbeddings = await this.computeNodeEmbeddings(patternGraph, this.embeddingDim);
+        // Average pattern embedding
+        const patternAvg = new Float32Array(this.embeddingDim);
+        let patternCount = 0;
+        for (const [, embedding] of patternEmbeddings) {
+            for (let i = 0; i < this.embeddingDim; i++) {
+                patternAvg[i] = (patternAvg[i] ?? 0) + (embedding[i] ?? 0);
+            }
+            patternCount++;
+        }
+        if (patternCount > 0) {
+            for (let i = 0; i < this.embeddingDim; i++) {
+                patternAvg[i] = (patternAvg[i] ?? 0) / patternCount;
+            }
+        }
+        // Find similar nodes in main graph
+        for (const [nodeId, embedding] of graphEmbeddings) {
+            const similarity = this.cosineSimilarity(embedding, patternAvg);
+            if (similarity >= threshold) {
+                matches.push({ matchId: nodeId, score: similarity });
+            }
+        }
+        // Sort by score descending
+        matches.sort((a, b) => b.score - a.score);
+        return matches;
+    }
+    // ============================================================================
+    // Private Helper Methods
+    // ============================================================================
+    /**
+     * Load WASM module dynamically
+     */
+    async loadWasmModule() {
+        throw new Error('WASM module loading not implemented');
+    }
+    /**
+     * Detect language from file extension
+     */
+    detectLanguage(filePath) {
+        const ext = filePath.split('.').pop()?.toLowerCase();
+        const langMap = {
+            ts: 'typescript',
+            tsx: 'typescript',
+            js: 'javascript',
+            jsx: 'javascript',
+            py: 'python',
+            java: 'java',
+            go: 'go',
+            rs: 'rust',
+            cpp: 'cpp',
+            c: 'cpp',
+            cs: 'csharp',
+            rb: 'ruby',
+            php: 'php',
+            swift: 'swift',
+            kt: 'kotlin',
+            scala: 'scala',
+        };
+        return ext ? langMap[ext] : undefined;
+    }
+    /**
+     * Extract imports from file (simplified)
+     */
+    async extractImports(_file, _allFiles) {
+        // In production, would parse AST
+        // For now, return empty array
+        return [];
+    }
+    /**
+     * Calculate max depth of dependency graph
+     */
+    calculateMaxDepth(nodes, edges) {
+        if (nodes.length === 0)
+            return 0;
+        // Build adjacency list
+        const adj = new Map();
+        for (const node of nodes) {
+            adj.set(node.id, []);
+        }
+        for (const edge of edges) {
+            adj.get(edge.from)?.push(edge.to);
+        }
+        // Find nodes with no incoming edges (roots)
+        const hasIncoming = new Set();
+        for (const edge of edges) {
+            hasIncoming.add(edge.to);
+        }
+        const roots = nodes.filter(n => !hasIncoming.has(n.id)).map(n => n.id);
+        if (roots.length === 0) {
+            // Cycle - use first node
+            roots.push(nodes[0].id);
+        }
+        // BFS to find max depth
+        let maxDepth = 0;
+        const visited = new Set();
+        const queue = [];
+        for (const root of roots) {
+            queue.push({ node: root, depth: 0 });
+            visited.add(root);
+        }
+        while (queue.length > 0) {
+            const current = queue.shift();
+            maxDepth = Math.max(maxDepth, current.depth);
+            for (const neighbor of adj.get(current.node) ?? []) {
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    queue.push({ node: neighbor, depth: current.depth + 1 });
+                }
+            }
+        }
+        return maxDepth;
+    }
+    /**
+     * Encode node type as number
+     */
+    encodeNodeType(type) {
+        const types = {
+            file: 0.1,
+            module: 0.2,
+            package: 0.3,
+            class: 0.4,
+            function: 0.5,
+        };
+        return types[type];
+    }
+    /**
+     * Encode language as number
+     */
+    encodeLanguage(language) {
+        const languages = {
+            typescript: 0.1,
+            javascript: 0.15,
+            python: 0.2,
+            java: 0.25,
+            go: 0.3,
+            rust: 0.35,
+            cpp: 0.4,
+            csharp: 0.45,
+            ruby: 0.5,
+            php: 0.55,
+        };
+        return languages[language] ?? 0;
+    }
+    /**
+     * Compute embeddings using JS (fallback)
+     */
+    computeEmbeddingsJS(graph, features, featureDim, outputDim) {
+        const nodeCount = graph.nodes.length;
+        const embeddings = new Float32Array(nodeCount * outputDim);
+        // Create adjacency matrix
+        const nodeMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+        });
+        // Simple message passing (1 layer)
+        for (let i = 0; i < nodeCount; i++) {
+            const node = graph.nodes[i];
+            if (!node)
+                continue;
+            // Aggregate neighbor features
+            const neighbors = graph.edges
+                .filter(e => e.to === node.id)
+                .map(e => nodeMap.get(e.from))
+                .filter((idx) => idx !== undefined);
+            // Initialize with own features (projected to output dim)
+            for (let j = 0; j < outputDim; j++) {
+                const featureIdx = j % featureDim;
+                embeddings[i * outputDim + j] = features[i * featureDim + featureIdx] ?? 0;
+            }
+            // Add neighbor contributions
+            if (neighbors.length > 0) {
+                for (const neighborIdx of neighbors) {
+                    for (let j = 0; j < outputDim; j++) {
+                        const featureIdx = j % featureDim;
+                        const contribution = (features[neighborIdx * featureDim + featureIdx] ?? 0) / neighbors.length;
+                        const embIdx = i * outputDim + j;
+                        embeddings[embIdx] = (embeddings[embIdx] ?? 0) + contribution * 0.5;
+                    }
+                }
+            }
+        }
+        // Normalize embeddings
+        for (let i = 0; i < nodeCount; i++) {
+            let norm = 0;
+            for (let j = 0; j < outputDim; j++) {
+                const val = embeddings[i * outputDim + j] ?? 0;
+                norm += val * val;
+            }
+            norm = Math.sqrt(norm);
+            if (norm > 0) {
+                for (let j = 0; j < outputDim; j++) {
+                    embeddings[i * outputDim + j] = (embeddings[i * outputDim + j] ?? 0) / norm;
+                }
+            }
+        }
+        return embeddings;
+    }
+    /**
+     * Compute cosine similarity
+     */
+    cosineSimilarity(a, b) {
+        let dot = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            const aVal = a[i] ?? 0;
+            const bVal = b[i] ?? 0;
+            dot += aVal * bVal;
+            normA += aVal * aVal;
+            normB += bVal * bVal;
+        }
+        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+        return denominator > 0 ? dot / denominator : 0;
+    }
+}
+/**
+ * Create and export default bridge instance
+ */
+export function createGNNBridge(embeddingDim = 128) {
+    return new GNNBridge(embeddingDim);
+}
+export default GNNBridge;
+//# sourceMappingURL=gnn-bridge.js.map

package/dist/bridges/gnn-bridge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gnn-bridge.js","sourceRoot":"","sources":["../../src/bridges/gnn-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AA2DH;;GAEG;AACH,MAAM,OAAO,SAAS;IACpB,+EAA+E;IACvE,UAAU,GAAyB,IAAI,CAAC;IACxC,WAAW,GAAG,KAAK,CAAC;IACX,YAAY,CAAS;IAEtC,YAAY,YAAY,GAAG,GAAG;QAC5B,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC;YACH,gCAAgC;YAChC,IAAI,CAAC,UAAU,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;YAC9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,qCAAqC;YACrC,OAAO,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;YACjE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAClB,KAAe,EACf,iBAA0B;QAE1B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,IAAI;gBACR,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI;gBACpC,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;aACpC,CAAC,CAAC;QACL,CAAC;QAED,wEAAwE;QACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACvD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrB,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,IAAI;wBACV,EAAE,EAAE,GAAG;wBACP,IAAI,EAAE,QAAQ;wBACd,MAAM,EAAE,CAAC;qBACV,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEtD,OAAO;YACL,KAAK;YACL,KAAK;YACL,QAAQ,EAAE;gBACR,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,SAAS;gBACT,QAAQ;aACT;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,qBAAqB,CACzB,KAAsB,EACtB,YAAoB;QAEpB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;QACnD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,UAAU,CAAC;QACpB,CAAC;QAED,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,gCAAgC;QAChC,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACxC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;YAC3B,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC/B,CAAC;QAED,qDAAqD;QACrD,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,YAAY;YACZ,QAAQ,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;YAC5E,aAAa;YACb,QAAQ,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;YAClF,qBAAqB;YACrB,QAAQ,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9D,oBAAoB;YACpB,QAAQ,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,CAAC;QAED,yCAAyC;QACzC,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAC9C,KAAK,EACL,QAAQ,EACR,UAAU,EACV,YAAY,CACb,CAAC;QAEF,8BAA8B;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CACzC,CAAC,GAAG,YAAY,EAChB,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,CACvB,CAAC;YACF,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,KAAsB,EACtB,YAAsB,EACtB,KAAa;QAEb,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,kEAAkE;QAClE,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACjD,qDAAqD;gBACrD,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;YACpB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA0D,EAAE,CAAC;QAExE,sCAAsC;QACtC,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;gBAChD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,KAAK,IAAI,KAAK;gBAAE,SAAS;YAEjD,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC/C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,eAAe;gBACrD,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACvC,IAAI,aAAa,KAAK,SAAS,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;oBAC5D,MAAM,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;gBAC9B,CAAC;gBACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,QAAQ;wBACd,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;wBACxB,KAAK,EAAE,QAAQ;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,IAAI,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC7C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAsB;QAEtB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,oCAAoC;QACpC,MAAM,GAAG,GAAkB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9E,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACjD,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;gBACzB,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,8CAA8C;QAC9C,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAE,SAAS;YAElC,kCAAkC;YAClC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,SAAS,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAE3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAC/B,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC1C,IAAI,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;wBAC/B,SAAS,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;wBAClC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,WAAW,EAAE,CAAC;QAChB,CAAC;QAED,iBAAiB;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CACvB,KAAsB,EACtB,YAA6B,EAC7B,SAAiB;QAEjB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,OAAO,GAA8C,EAAE,CAAC;QAE9D,qCAAqC;QACrC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACnF,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAE5F,4BAA4B;QAC5B,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,iBAAiB,EAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7D,CAAC;YACD,YAAY,EAAE,CAAC;QACjB,CAAC;QACD,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC;YACtD,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,eAAe,EAAE,CAAC;YAClD,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YAChE,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,+EAA+E;IAC/E,yBAAyB;IACzB,+EAA+E;IAE/E;;OAEG;IACK,KAAK,CAAC,cAAc;QAC1B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAAgB;QACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,CAAC;QACrD,MAAM,OAAO,GAA+C;YAC1D,EAAE,EAAE,YAAY;YAChB,GAAG,EAAE,YAAY;YACjB,EAAE,EAAE,YAAY;YAChB,GAAG,EAAE,YAAY;YACjB,EAAE,EAAE,QAAQ;YACZ,IAAI,EAAE,MAAM;YACZ,EAAE,EAAE,IAAI;YACR,EAAE,EAAE,MAAM;YACV,GAAG,EAAE,KAAK;YACV,CAAC,EAAE,KAAK;YACR,EAAE,EAAE,QAAQ;YACZ,EAAE,EAAE,MAAM;YACV,GAAG,EAAE,KAAK;YACV,KAAK,EAAE,OAAO;YACd,EAAE,EAAE,QAAQ;YACZ,KAAK,EAAE,OAAO;SACf,CAAC;QACF,OAAO,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,cAAc,CAAC,KAAa,EAAE,SAAmB;QAC7D,iCAAiC;QACjC,8BAA8B;QAC9B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAuB,EAAE,KAAuB;QACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEjC,uBAAuB;QACvB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpC,CAAC;QAED,4CAA4C;QAC5C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEvE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,yBAAyB;YACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;QAED,wBAAwB;QACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA2C,EAAE,CAAC;QAEzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YAE7C,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAA4B;QACjD,MAAM,KAAK,GAA2C;YACpD,IAAI,EAAE,GAAG;YACT,MAAM,EAAE,GAAG;YACX,OAAO,EAAE,GAAG;YACZ,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,GAAG;SACd,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,QAAgB;QACrC,MAAM,SAAS,GAA2B;YACxC,UAAU,EAAE,GAAG;YACf,UAAU,EAAE,IAAI;YAChB,MAAM,EAAE,GAAG;YACX,IAAI,EAAE,IAAI;YACV,EAAE,EAAE,GAAG;YACP,IAAI,EAAE,IAAI;YACV,GAAG,EAAE,GAAG;YACR,MAAM,EAAE,IAAI;YACZ,IAAI,EAAE,GAAG;YACT,GAAG,EAAE,IAAI;SACV,CAAC;QACF,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,KAAsB,EACtB,QAAsB,EACtB,UAAkB,EAClB,SAAiB;QAEjB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;QAE3D,0BAA0B;QAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,8BAA8B;YAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK;iBAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;iBAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;iBAC7B,MAAM,CAAC,CAAC,GAAG,EAAiB,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;YAErD,yDAAyD;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC;gBAClC,UAAU,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC7E,CAAC;YAED,6BAA6B;YAC7B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,MAAM,WAAW,IAAI,SAAS,EAAE,CAAC;oBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;wBACnC,MAAM,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC;wBAClC,MAAM,YAAY,GAAG,CAAC,QAAQ,CAAC,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;wBAC/F,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;wBACjC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;oBACtE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC/C,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC;YACpB,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,UAAU,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;gBAC9E,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,CAAe,EAAE,CAAe;QACvD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;YACnB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;YACrB,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,YAAY,GAAG,GAAG;IAChD,OAAO,IAAI,SAAS,CAAC,YAAY,CAAC,CAAC;AACrC,CAAC;AAED,eAAe,SAAS,CAAC"}

package/dist/bridges/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Code Intelligence Plugin - Bridges Barrel Export
+ *
+ * @module @claude-flow/plugin-code-intelligence/bridges
+ */
+export { GNNBridge, createGNNBridge, } from './gnn-bridge.js';
+export { MinCutBridge, createMinCutBridge, } from './mincut-bridge.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/bridges/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/bridges/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,SAAS,EACT,eAAe,GAChB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,YAAY,EACZ,kBAAkB,GACnB,MAAM,oBAAoB,CAAC"}

package/dist/bridges/index.js

@@ -0,0 +1,8 @@
+/**
+ * Code Intelligence Plugin - Bridges Barrel Export
+ *
+ * @module @claude-flow/plugin-code-intelligence/bridges
+ */
+export { GNNBridge, createGNNBridge, } from './gnn-bridge.js';
+export { MinCutBridge, createMinCutBridge, } from './mincut-bridge.js';
+//# sourceMappingURL=index.js.map

package/dist/bridges/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/bridges/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,SAAS,EACT,eAAe,GAChB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,YAAY,EACZ,kBAAkB,GACnB,MAAM,oBAAoB,CAAC"}

package/dist/bridges/mincut-bridge.d.ts

@@ -0,0 +1,81 @@
+/**
+ * MinCut Bridge for Module Splitting
+ *
+ * Provides graph min-cut operations for optimal module boundary detection
+ * using ruvector-mincut-wasm for high-performance graph partitioning.
+ *
+ * Features:
+ * - Optimal module boundary detection
+ * - Multi-way graph partitioning
+ * - Constraint-aware splitting
+ * - Cut weight optimization
+ *
+ * Based on ADR-035: Advanced Code Intelligence Plugin
+ *
+ * @module v3/plugins/code-intelligence/bridges/mincut-bridge
+ */
+import type { IMinCutBridge, DependencyGraph, SplitConstraints } from '../types.js';
+/**
+ * MinCut Bridge Implementation
+ */
+export declare class MinCutBridge implements IMinCutBridge {
+    private wasmModule;
+    private initialized;
+    /**
+     * Initialize the WASM module
+     */
+    initialize(): Promise<void>;
+    /**
+     * Check if initialized
+     */
+    isInitialized(): boolean;
+    /**
+     * Find optimal module boundaries using MinCut
+     */
+    findOptimalCuts(graph: DependencyGraph, numModules: number, constraints: SplitConstraints): Promise<Map<string, number>>;
+    /**
+     * Calculate cut weight for a given partition
+     */
+    calculateCutWeight(graph: DependencyGraph, partition: Map<string, number>): Promise<number>;
+    /**
+     * Find minimum s-t cut
+     */
+    minSTCut(graph: DependencyGraph, source: string, sink: string): Promise<{
+        cutValue: number;
+        cutEdges: Array<{
+            from: string;
+            to: string;
+        }>;
+        sourceSet: string[];
+        sinkSet: string[];
+    }>;
+    /**
+     * Multi-way cut for module splitting
+     */
+    multiWayCut(graph: DependencyGraph, terminals: string[], _weights: Map<string, number>): Promise<{
+        cutValue: number;
+        partitions: Map<string, number>;
+    }>;
+    /**
+     * Load WASM module dynamically
+     */
+    private loadWasmModule;
+    /**
+     * Spectral partitioning using Fiedler vector
+     */
+    private spectralPartition;
+    /**
+     * Edmonds-Karp algorithm (Ford-Fulkerson with BFS)
+     */
+    private edmondsKarp;
+    /**
+     * Compute distances from terminals to all nodes
+     */
+    private computeDistances;
+}
+/**
+ * Create and export default bridge instance
+ */
+export declare function createMinCutBridge(): IMinCutBridge;
+export default MinCutBridge;
+//# sourceMappingURL=mincut-bridge.d.ts.map

package/dist/bridges/mincut-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mincut-bridge.d.ts","sourceRoot":"","sources":["../../src/bridges/mincut-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EACV,aAAa,EACb,eAAe,EACf,gBAAgB,EACjB,MAAM,aAAa,CAAC;AA4CrB;;GAEG;AACH,qBAAa,YAAa,YAAW,aAAa;IAEhD,OAAO,CAAC,UAAU,CAAiC;IACnD,OAAO,CAAC,WAAW,CAAS;IAE5B;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAejC;;OAEG;IACH,aAAa,IAAI,OAAO;IAIxB;;OAEG;IACG,eAAe,CACnB,KAAK,EAAE,eAAe,EACtB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,gBAAgB,GAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAuF/B;;OAEG;IACG,kBAAkB,CACtB,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC7B,OAAO,CAAC,MAAM,CAAC;IAmBlB;;OAEG;IACG,QAAQ,CACZ,KAAK,EAAE,eAAe,EACtB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,OAAO,CAAC;QACT,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,KAAK,CAAC;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QAC9C,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,OAAO,EAAE,MAAM,EAAE,CAAC;KACnB,CAAC;IA6FF;;OAEG;IACG,WAAW,CACf,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,MAAM,EAAE,EACnB,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAC5B,OAAO,CAAC;QACT,QAAQ,EAAE,MAAM,CAAC;QACjB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACjC,CAAC;IAmEF;;OAEG;YACW,cAAc;IAI5B;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAkGzB;;OAEG;IACH,OAAO,CAAC,WAAW;IAyEnB;;OAEG;IACH,OAAO,CAAC,gBAAgB;CAwDzB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,IAAI,aAAa,CAElD;AAED,eAAe,YAAY,CAAC"}