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

package/dist/bridges/mincut-bridge.js

@@ -0,0 +1,481 @@
+/**
+ * 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
+ */
+/**
+ * MinCut Bridge Implementation
+ */
+export class MinCutBridge {
+    // WASM module for future performance optimization (currently uses JS fallback)
+    wasmModule = null;
+    initialized = false;
+    /**
+     * 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 MinCut module not available, using JS fallback');
+            this.wasmModule = null;
+            this.initialized = true;
+        }
+    }
+    /**
+     * Check if initialized
+     */
+    isInitialized() {
+        return this.initialized;
+    }
+    /**
+     * Find optimal module boundaries using MinCut
+     */
+    async findOptimalCuts(graph, numModules, constraints) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const partition = new Map();
+        const nodeCount = graph.nodes.length;
+        if (nodeCount === 0 || numModules < 2) {
+            // All nodes in single partition
+            for (const node of graph.nodes) {
+                partition.set(node.id, 0);
+            }
+            return partition;
+        }
+        // Create node lookup
+        const nodeMap = new Map();
+        const indexMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+            indexMap.set(index, node.id);
+        });
+        // Apply constraints for preserved boundaries
+        const fixed = new Map();
+        if (constraints.preserveBoundaries) {
+            for (let i = 0; i < constraints.preserveBoundaries.length && i < numModules; i++) {
+                const boundary = constraints.preserveBoundaries[i];
+                if (boundary) {
+                    const nodeIdx = nodeMap.get(boundary);
+                    if (nodeIdx !== undefined) {
+                        fixed.set(nodeIdx, i);
+                    }
+                }
+            }
+        }
+        // Build adjacency matrix with weights
+        const weights = Array.from({ length: nodeCount }, () => Array(nodeCount).fill(0));
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                weights[fromIdx][toIdx] = edge.weight;
+                weights[toIdx][fromIdx] = edge.weight; // Symmetric for partitioning
+            }
+        }
+        // Use spectral partitioning (JS fallback)
+        const partitionArray = this.spectralPartition(weights, numModules, fixed, constraints);
+        // Convert to map
+        for (let i = 0; i < nodeCount; i++) {
+            const nodeId = indexMap.get(i);
+            const part = partitionArray[i];
+            if (nodeId && part !== undefined) {
+                partition.set(nodeId, part);
+            }
+        }
+        // Apply keepTogether constraints
+        if (constraints.keepTogether) {
+            for (const group of constraints.keepTogether) {
+                if (group.length > 0) {
+                    const firstIdx = nodeMap.get(group[0] ?? '');
+                    const firstPart = firstIdx !== undefined ? partitionArray[firstIdx] : undefined;
+                    if (firstPart !== undefined) {
+                        for (const nodeId of group) {
+                            partition.set(nodeId, firstPart);
+                        }
+                    }
+                }
+            }
+        }
+        return partition;
+    }
+    /**
+     * Calculate cut weight for a given partition
+     */
+    async calculateCutWeight(graph, partition) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        let cutWeight = 0;
+        for (const edge of graph.edges) {
+            const fromPart = partition.get(edge.from);
+            const toPart = partition.get(edge.to);
+            if (fromPart !== undefined && toPart !== undefined && fromPart !== toPart) {
+                cutWeight += edge.weight;
+            }
+        }
+        return cutWeight;
+    }
+    /**
+     * Find minimum s-t cut
+     */
+    async minSTCut(graph, source, sink) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const nodeCount = graph.nodes.length;
+        // Create node lookup
+        const nodeMap = new Map();
+        const indexMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+            indexMap.set(index, node.id);
+        });
+        const sourceIdx = nodeMap.get(source);
+        const sinkIdx = nodeMap.get(sink);
+        if (sourceIdx === undefined || sinkIdx === undefined) {
+            return {
+                cutValue: 0,
+                cutEdges: [],
+                sourceSet: [],
+                sinkSet: graph.nodes.map(n => n.id),
+            };
+        }
+        // Build capacity matrix
+        const capacity = Array.from({ length: nodeCount }, () => Array(nodeCount).fill(0));
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                capacity[fromIdx][toIdx] = edge.weight;
+            }
+        }
+        // Ford-Fulkerson with BFS (Edmonds-Karp)
+        const { maxFlow, residual } = this.edmondsKarp(capacity, sourceIdx, sinkIdx);
+        // Find source set using BFS on residual graph
+        const sourceSet = new Set();
+        const queue = [sourceIdx];
+        sourceSet.add(sourceIdx);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (let next = 0; next < nodeCount; next++) {
+                if (!sourceSet.has(next) && (residual[current]?.[next] ?? 0) > 0) {
+                    sourceSet.add(next);
+                    queue.push(next);
+                }
+            }
+        }
+        // Find cut edges
+        const cutEdges = [];
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                if (sourceSet.has(fromIdx) && !sourceSet.has(toIdx)) {
+                    cutEdges.push({ from: edge.from, to: edge.to });
+                }
+            }
+        }
+        // Convert sets to arrays
+        const sourceSetNodes = [];
+        const sinkSetNodes = [];
+        for (let i = 0; i < nodeCount; i++) {
+            const nodeId = indexMap.get(i);
+            if (nodeId) {
+                if (sourceSet.has(i)) {
+                    sourceSetNodes.push(nodeId);
+                }
+                else {
+                    sinkSetNodes.push(nodeId);
+                }
+            }
+        }
+        return {
+            cutValue: maxFlow,
+            cutEdges,
+            sourceSet: sourceSetNodes,
+            sinkSet: sinkSetNodes,
+        };
+    }
+    /**
+     * Multi-way cut for module splitting
+     */
+    async multiWayCut(graph, terminals, _weights) {
+        if (!this.initialized) {
+            await this.initialize();
+        }
+        const numTerminals = terminals.length;
+        if (numTerminals < 2) {
+            const partitions = new Map();
+            for (const node of graph.nodes) {
+                partitions.set(node.id, 0);
+            }
+            return { cutValue: 0, partitions };
+        }
+        // Create node lookup
+        const nodeMap = new Map();
+        graph.nodes.forEach((node, index) => {
+            nodeMap.set(node.id, index);
+        });
+        // Get terminal indices
+        const terminalIndices = terminals
+            .map(t => nodeMap.get(t))
+            .filter((idx) => idx !== undefined);
+        if (terminalIndices.length < 2) {
+            const partitions = new Map();
+            for (const node of graph.nodes) {
+                partitions.set(node.id, 0);
+            }
+            return { cutValue: 0, partitions };
+        }
+        // Use isolating cuts algorithm
+        // Assign each node to the nearest terminal
+        const partitions = new Map();
+        const distances = this.computeDistances(graph, terminalIndices, nodeMap);
+        for (const node of graph.nodes) {
+            const nodeIdx = nodeMap.get(node.id);
+            if (nodeIdx === undefined)
+                continue;
+            let minDist = Infinity;
+            let minTerminal = 0;
+            for (let t = 0; t < terminalIndices.length; t++) {
+                const dist = distances.get(`${nodeIdx}-${t}`) ?? Infinity;
+                if (dist < minDist) {
+                    minDist = dist;
+                    minTerminal = t;
+                }
+            }
+            partitions.set(node.id, minTerminal);
+        }
+        // Calculate cut value
+        const cutValue = await this.calculateCutWeight(graph, partitions);
+        return { cutValue, partitions };
+    }
+    // ============================================================================
+    // Private Helper Methods
+    // ============================================================================
+    /**
+     * Load WASM module dynamically
+     */
+    async loadWasmModule() {
+        throw new Error('WASM module loading not implemented');
+    }
+    /**
+     * Spectral partitioning using Fiedler vector
+     */
+    spectralPartition(weights, numPartitions, fixed, _constraints) {
+        const n = weights.length;
+        const partition = new Array(n).fill(0);
+        if (n === 0)
+            return partition;
+        // Apply fixed partitions
+        for (const [node, part] of fixed) {
+            partition[node] = part;
+        }
+        // If all fixed, return
+        if (fixed.size >= n)
+            return partition;
+        // Compute Laplacian
+        const laplacian = Array.from({ length: n }, () => Array(n).fill(0));
+        for (let i = 0; i < n; i++) {
+            let degree = 0;
+            for (let j = 0; j < n; j++) {
+                if (i !== j) {
+                    const w = (weights[i]?.[j] ?? 0) + (weights[j]?.[i] ?? 0);
+                    laplacian[i][j] = -w;
+                    degree += w;
+                }
+            }
+            laplacian[i][i] = degree;
+        }
+        // Power iteration to find Fiedler vector (second smallest eigenvector)
+        // Simplified: use random initialization and iterate
+        const fiedler = new Array(n).fill(0).map(() => Math.random() - 0.5);
+        // Normalize
+        let norm = Math.sqrt(fiedler.reduce((sum, v) => sum + v * v, 0));
+        for (let i = 0; i < n; i++) {
+            fiedler[i] = (fiedler[i] ?? 0) / norm;
+        }
+        // Iterate
+        for (let iter = 0; iter < 50; iter++) {
+            // Multiply by Laplacian
+            const newFiedler = new Array(n).fill(0);
+            for (let i = 0; i < n; i++) {
+                for (let j = 0; j < n; j++) {
+                    newFiedler[i] += (laplacian[i]?.[j] ?? 0) * (fiedler[j] ?? 0);
+                }
+            }
+            // Orthogonalize against constant vector
+            const mean = newFiedler.reduce((a, b) => a + b, 0) / n;
+            for (let i = 0; i < n; i++) {
+                newFiedler[i] = (newFiedler[i] ?? 0) - mean;
+            }
+            // Normalize
+            norm = Math.sqrt(newFiedler.reduce((sum, v) => sum + v * v, 0));
+            if (norm > 0) {
+                for (let i = 0; i < n; i++) {
+                    fiedler[i] = (newFiedler[i] ?? 0) / norm;
+                }
+            }
+        }
+        // Partition based on Fiedler vector
+        if (numPartitions === 2) {
+            // Simple bisection
+            for (let i = 0; i < n; i++) {
+                if (!fixed.has(i)) {
+                    partition[i] = (fiedler[i] ?? 0) >= 0 ? 0 : 1;
+                }
+            }
+        }
+        else {
+            // K-means clustering on Fiedler values
+            const sorted = fiedler
+                .map((v, i) => ({ value: v, index: i }))
+                .filter(item => !fixed.has(item.index))
+                .sort((a, b) => (a.value ?? 0) - (b.value ?? 0));
+            const binSize = Math.ceil(sorted.length / numPartitions);
+            for (let i = 0; i < sorted.length; i++) {
+                const item = sorted[i];
+                if (item) {
+                    partition[item.index] = Math.min(Math.floor(i / binSize), numPartitions - 1);
+                }
+            }
+        }
+        return partition;
+    }
+    /**
+     * Edmonds-Karp algorithm (Ford-Fulkerson with BFS)
+     */
+    edmondsKarp(capacity, source, sink) {
+        const n = capacity.length;
+        const residual = capacity.map(row => [...row]);
+        let maxFlow = 0;
+        // BFS to find augmenting path
+        const bfs = () => {
+            const parent = new Array(n).fill(-1);
+            const visited = new Array(n).fill(false);
+            const queue = [source];
+            visited[source] = true;
+            while (queue.length > 0) {
+                const current = queue.shift();
+                if (current === sink) {
+                    // Reconstruct path
+                    const path = [];
+                    let node = sink;
+                    while (node !== source) {
+                        path.unshift(node);
+                        node = parent[node] ?? source;
+                    }
+                    path.unshift(source);
+                    return path;
+                }
+                for (let next = 0; next < n; next++) {
+                    if (!visited[next] && (residual[current]?.[next] ?? 0) > 0) {
+                        visited[next] = true;
+                        parent[next] = current;
+                        queue.push(next);
+                    }
+                }
+            }
+            return null;
+        };
+        // Find augmenting paths
+        let path = bfs();
+        while (path !== null) {
+            // Find minimum capacity along path
+            let minCap = Infinity;
+            for (let i = 0; i < path.length - 1; i++) {
+                const from = path[i];
+                const to = path[i + 1];
+                if (from !== undefined && to !== undefined) {
+                    minCap = Math.min(minCap, residual[from]?.[to] ?? 0);
+                }
+            }
+            // Update residual capacities
+            for (let i = 0; i < path.length - 1; i++) {
+                const from = path[i];
+                const to = path[i + 1];
+                if (from !== undefined && to !== undefined) {
+                    residual[from][to] = (residual[from]?.[to] ?? 0) - minCap;
+                    residual[to][from] = (residual[to]?.[from] ?? 0) + minCap;
+                }
+            }
+            maxFlow += minCap;
+            path = bfs();
+        }
+        return { maxFlow, residual };
+    }
+    /**
+     * Compute distances from terminals to all nodes
+     */
+    computeDistances(graph, terminalIndices, nodeMap) {
+        const distances = new Map();
+        const nodeCount = graph.nodes.length;
+        // Build adjacency list with weights
+        const adj = new Map();
+        for (let i = 0; i < nodeCount; i++) {
+            adj.set(i, []);
+        }
+        for (const edge of graph.edges) {
+            const fromIdx = nodeMap.get(edge.from);
+            const toIdx = nodeMap.get(edge.to);
+            if (fromIdx !== undefined && toIdx !== undefined) {
+                adj.get(fromIdx)?.push({ to: toIdx, weight: edge.weight });
+                adj.get(toIdx)?.push({ to: fromIdx, weight: edge.weight });
+            }
+        }
+        // Dijkstra from each terminal
+        for (let t = 0; t < terminalIndices.length; t++) {
+            const terminal = terminalIndices[t];
+            if (terminal === undefined)
+                continue;
+            const dist = new Array(nodeCount).fill(Infinity);
+            dist[terminal] = 0;
+            const pq = [{ node: terminal, dist: 0 }];
+            while (pq.length > 0) {
+                pq.sort((a, b) => a.dist - b.dist);
+                const current = pq.shift();
+                if (current.dist > (dist[current.node] ?? Infinity))
+                    continue;
+                for (const neighbor of adj.get(current.node) ?? []) {
+                    const newDist = current.dist + (1 / Math.max(neighbor.weight, 0.1)); // Inverse weight as distance
+                    if (newDist < (dist[neighbor.to] ?? Infinity)) {
+                        dist[neighbor.to] = newDist;
+                        pq.push({ node: neighbor.to, dist: newDist });
+                    }
+                }
+            }
+            // Store distances
+            for (let i = 0; i < nodeCount; i++) {
+                distances.set(`${i}-${t}`, dist[i] ?? Infinity);
+            }
+        }
+        return distances;
+    }
+}
+/**
+ * Create and export default bridge instance
+ */
+export function createMinCutBridge() {
+    return new MinCutBridge();
+}
+export default MinCutBridge;
+//# sourceMappingURL=mincut-bridge.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"mincut-bridge.js","sourceRoot":"","sources":["../../src/bridges/mincut-bridge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAkDH;;GAEG;AACH,MAAM,OAAO,YAAY;IACvB,+EAA+E;IACvE,UAAU,GAA4B,IAAI,CAAC;IAC3C,WAAW,GAAG,KAAK,CAAC;IAE5B;;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,qDAAqD,CAAC,CAAC;YACpE,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,eAAe,CACnB,KAAsB,EACtB,UAAkB,EAClB,WAA6B;QAE7B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,IAAI,SAAS,KAAK,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACtC,gCAAgC;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,IAAI,WAAW,CAAC,kBAAkB,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,kBAAkB,CAAC,MAAM,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjF,MAAM,QAAQ,GAAG,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBACnD,IAAI,QAAQ,EAAE,CAAC;oBACb,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;wBAC1B,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,OAAO,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CACjE,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACzB,CAAC;QAEF,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,OAAO,CAAC,OAAO,CAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBACvC,OAAO,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,6BAA6B;YACvE,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAC3C,OAAO,EACP,UAAU,EACV,KAAK,EACL,WAAW,CACZ,CAAC;QAEF,iBAAiB;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACjC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,YAAY,EAAE,CAAC;gBAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC7C,MAAM,SAAS,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;oBAChF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;wBAC5B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;4BAC3B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CACtB,KAAsB,EACtB,SAA8B;QAE9B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEtC,IAAI,QAAQ,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;gBAC1E,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CACZ,KAAsB,EACtB,MAAc,EACd,IAAY;QAOZ,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElC,IAAI,SAAS,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACrD,OAAO;gBACL,QAAQ,EAAE,CAAC;gBACX,QAAQ,EAAE,EAAE;gBACZ,SAAS,EAAE,EAAE;gBACb,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACpC,CAAC;QACJ,CAAC;QAED,wBAAwB;QACxB,MAAM,QAAQ,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAClE,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACzB,CAAC;QAEF,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,QAAQ,CAAC,OAAO,CAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAE7E,8CAA8C;QAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC;QAC1B,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,MAAM,QAAQ,GAAwC,EAAE,CAAC;QACzD,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,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACpD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,OAAO;YACjB,QAAQ;YACR,SAAS,EAAE,cAAc;YACzB,OAAO,EAAE,YAAY;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CACf,KAAsB,EACtB,SAAmB,EACnB,QAA6B;QAK7B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1B,CAAC;QAED,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC;QAEtC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;QACrC,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,uBAAuB;QACvB,MAAM,eAAe,GAAG,SAAS;aAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACxB,MAAM,CAAC,CAAC,GAAG,EAAiB,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC;QAErD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;gBAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC;QACrC,CAAC;QAED,+BAA+B;QAC/B,2CAA2C;QAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;QAEzE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAS;YAEpC,IAAI,OAAO,GAAG,QAAQ,CAAC;YACvB,IAAI,WAAW,GAAG,CAAC,CAAC;YAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;gBAC1D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;oBACf,WAAW,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QACvC,CAAC;QAED,sBAAsB;QACtB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QAElE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAClC,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,iBAAiB,CACvB,OAAmB,EACnB,aAAqB,EACrB,KAA0B,EAC1B,YAA8B;QAE9B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEvC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE9B,yBAAyB;QACzB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YACjC,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACzB,CAAC;QAED,uBAAuB;QACvB,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAEtC,oBAAoB;QACpB,MAAM,SAAS,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAC3D,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACjB,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;oBAC1D,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtB,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YACD,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QAC5B,CAAC;QAED,uEAAuE;QACvE,oDAAoD;QACpD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC;QAEpE,YAAY;QACZ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QACxC,CAAC;QAED,UAAU;QACV,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;YACrC,wBAAwB;YACxB,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;YAED,wCAAwC;YACxC,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;YAC9C,CAAC;YAED,YAAY;YACZ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;YACxB,mBAAmB;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,uCAAuC;YACvC,MAAM,MAAM,GAAG,OAAO;iBACnB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;iBACvC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;YAEnD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,IAAI,EAAE,CAAC;oBACT,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;gBAC/E,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,WAAW,CACjB,QAAoB,EACpB,MAAc,EACd,IAAY;QAEZ,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC1B,MAAM,QAAQ,GAAe,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3D,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,8BAA8B;QAC9B,MAAM,GAAG,GAAG,GAAoB,EAAE;YAChC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;YAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAE/B,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;oBACrB,mBAAmB;oBACnB,MAAM,IAAI,GAAa,EAAE,CAAC;oBAC1B,IAAI,IAAI,GAAG,IAAI,CAAC;oBAChB,OAAO,IAAI,KAAK,MAAM,EAAE,CAAC;wBACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBACnB,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC;oBAChC,CAAC;oBACD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACrB,OAAO,IAAI,CAAC;gBACd,CAAC;gBAED,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;oBACpC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC3D,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;wBACrB,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;wBACvB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,wBAAwB;QACxB,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;QACjB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,mCAAmC;YACnC,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvB,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC3C,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;YAED,6BAA6B;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvB,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;oBAC3C,QAAQ,CAAC,IAAI,CAAE,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;oBAC3D,QAAQ,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAC7D,CAAC;YACH,CAAC;YAED,OAAO,IAAI,MAAM,CAAC;YAClB,IAAI,GAAG,GAAG,EAAE,CAAC;QACf,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAAsB,EACtB,eAAyB,EACzB,OAA4B;QAE5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QAErC,oCAAoC;QACpC,MAAM,GAAG,GAAuD,IAAI,GAAG,EAAE,CAAC;QAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjB,CAAC;QAED,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,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;gBAC3D,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAS;YAErC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,EAAE,GAA0C,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAEhF,OAAO,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBACnC,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,EAAG,CAAC;gBAE5B,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;oBAAE,SAAS;gBAE9D,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnD,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,6BAA6B;oBAClG,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;wBAC9C,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;wBAC5B,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;oBAChD,CAAC;gBACH,CAAC;YACH,CAAC;YAED,kBAAkB;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO,IAAI,YAAY,EAAE,CAAC;AAC5B,CAAC;AAED,eAAe,YAAY,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,113 @@
+/**
+ * Code Intelligence Plugin for Claude Flow V3
+ *
+ * A comprehensive code intelligence plugin combining graph neural networks
+ * for code structure analysis with ultra-fast vector search for semantic
+ * code similarity.
+ *
+ * Features:
+ * - Semantic code search
+ * - Architecture analysis and drift detection
+ * - Refactoring impact prediction using GNN
+ * - Module splitting suggestions using MinCut
+ * - Pattern learning from code history
+ *
+ * Based on ADR-035: Advanced Code Intelligence Plugin
+ *
+ * @module @claude-flow/plugin-code-intelligence
+ */
+export * from './types.js';
+export { GNNBridge, createGNNBridge } from './bridges/gnn-bridge.js';
+export { MinCutBridge, createMinCutBridge } from './bridges/mincut-bridge.js';
+export { semanticSearchTool, architectureAnalyzeTool, refactorImpactTool, splitSuggestTool, learnPatternsTool, codeIntelligenceTools, toolHandlers, createToolContext, } from './mcp-tools.js';
+export type { MCPTool, ToolContext, MCPToolResult } from './mcp-tools.js';
+import type { CodeIntelligenceConfig, IGNNBridge, IMinCutBridge } from './types.js';
+/**
+ * Plugin metadata
+ */
+export declare const pluginMetadata: {
+    name: string;
+    version: string;
+    description: string;
+    author: string;
+    category: string;
+    keywords: string[];
+    homepage: string;
+    repository: string;
+};
+/**
+ * Plugin state
+ */
+export type PluginState = 'uninitialized' | 'initializing' | 'ready' | 'error' | 'shutdown';
+/**
+ * Code Intelligence Plugin Class
+ */
+export declare class CodeIntelligencePlugin {
+    private state;
+    private config;
+    private gnnBridge;
+    private mincutBridge;
+    constructor(config?: Partial<CodeIntelligenceConfig>);
+    /**
+     * Get plugin metadata
+     */
+    getMetadata(): {
+        name: string;
+        version: string;
+        description: string;
+        author: string;
+        category: string;
+        keywords: string[];
+        homepage: string;
+        repository: string;
+    };
+    /**
+     * Get current state
+     */
+    getState(): PluginState;
+    /**
+     * Initialize the plugin
+     */
+    initialize(): Promise<void>;
+    /**
+     * Shutdown the plugin
+     */
+    shutdown(): Promise<void>;
+    /**
+     * Get MCP tools provided by this plugin
+     */
+    getMCPTools(): import("./mcp-tools.js").MCPTool<unknown, unknown>[];
+    /**
+     * Get tool context for execution
+     */
+    getToolContext(): {
+        get: <T>(key: string) => T | undefined;
+        set: <T>(key: string, value: T) => void;
+        bridges: {
+            gnn: IGNNBridge;
+            mincut: IMinCutBridge;
+        };
+        config: {
+            allowedRoots: string[];
+            blockedPatterns: RegExp[];
+            maskSecrets: boolean;
+        };
+    };
+    /**
+     * Get configuration
+     */
+    getConfig(): CodeIntelligenceConfig;
+    /**
+     * Update configuration
+     */
+    updateConfig(config: Partial<CodeIntelligenceConfig>): void;
+}
+/**
+ * Create plugin instance
+ */
+export declare function createPlugin(config?: Partial<CodeIntelligenceConfig>): CodeIntelligencePlugin;
+/**
+ * Default export
+ */
+export default CodeIntelligencePlugin;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,cAAc,YAAY,CAAC;AAG3B,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAG9E,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,EACjB,qBAAqB,EACrB,YAAY,EACZ,iBAAiB,GAClB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAM1E,OAAO,KAAK,EACV,sBAAsB,EACtB,UAAU,EACV,aAAa,EACd,MAAM,YAAY,CAAC;AAGpB;;GAEG;AACH,eAAO,MAAM,cAAc;;;;;;;;;CAS1B,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,eAAe,GAAG,cAAc,GAAG,OAAO,GAAG,OAAO,GAAG,UAAU,CAAC;AAE5F;;GAEG;AACH,qBAAa,sBAAsB;IACjC,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,MAAM,CAAyB;IACvC,OAAO,CAAC,SAAS,CAA2B;IAC5C,OAAO,CAAC,YAAY,CAA8B;gBAEtC,MAAM,GAAE,OAAO,CAAC,sBAAsB,CAAM;IAIxD;;OAEG;IACH,WAAW;;;;;;;;;;IAIX;;OAEG;IACH,QAAQ,IAAI,WAAW;IAIvB;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAsBjC;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAM/B;;OAEG;IACH,WAAW;IAIX;;OAEG;IACH,cAAc;cAYJ,CAAC,OAAO,MAAM,KAAuB,CAAC,GAAG,SAAS;cAClD,CAAC,OAAO,MAAM,SAAS,CAAC;;;;;;;;;;;IAalC;;OAEG;IACH,SAAS,IAAI,sBAAsB;IAInC;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,sBAAsB,CAAC,GAAG,IAAI;CAU5D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,sBAAsB,CAAC,GAAG,sBAAsB,CAE7F;AAED;;GAEG;AACH,eAAe,sBAAsB,CAAC"}