agentic-qe 2.6.5 → 2.6.6

package/dist/test/partition/MinCutPartitioner.js

@@ -0,0 +1,459 @@
+"use strict";
+/**
+ * MinCut-Based Test Suite Partitioner
+ *
+ * Uses the Stoer-Wagner minimum cut algorithm to optimally partition
+ * test suites for parallel execution, minimizing cross-partition
+ * dependencies and balancing execution time across workers.
+ *
+ * Expected improvement: 30-50% faster parallel execution compared
+ * to naive round-robin or random distribution.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinCutPartitioner = void 0;
+exports.partitionTests = partitionTests;
+const types_js_1 = require("./types.js");
+const MinCutAnalyzer_js_1 = require("../../code-intelligence/analysis/mincut/MinCutAnalyzer.js");
+const Logger_js_1 = require("../../utils/Logger.js");
+const logger = Logger_js_1.Logger.getInstance();
+/**
+ * Partitions test suites using MinCut algorithm to minimize
+ * cross-partition dependencies and balance execution time.
+ */
+class MinCutPartitioner {
+    constructor(config = {}) {
+        this.config = { ...types_js_1.DEFAULT_PARTITION_CONFIG, ...config };
+        this.minCutAnalyzer = new MinCutAnalyzer_js_1.MinCutAnalyzer({
+            timeout: this.config.timeout,
+            maxNodes: 10000,
+        });
+    }
+    /**
+     * Partition test files for optimal parallel execution
+     *
+     * @param tests - Array of test files with metadata
+     * @returns PartitionResult with optimized test distribution
+     */
+    async partition(tests) {
+        const startTime = performance.now();
+        // Handle edge cases
+        if (tests.length === 0) {
+            return this.emptyResult(startTime);
+        }
+        if (tests.length <= this.config.partitionCount) {
+            return this.trivialPartition(tests, startTime);
+        }
+        // Build dependency graph
+        const { nodes, edges } = this.buildTestGraph(tests);
+        // If no dependencies, use duration-balanced partitioning
+        if (edges.length === 0) {
+            return this.durationBalancedPartition(tests, startTime);
+        }
+        // Use MinCut to find optimal partition boundaries
+        const graph = {
+            nodes: nodes.map(n => ({
+                id: n.id,
+                label: n.id,
+                properties: { weight: n.weight },
+            })),
+            edges: edges.map(e => ({
+                source: e.source,
+                target: e.target,
+                weight: e.weight,
+            })),
+            directed: false,
+        };
+        try {
+            // For 2 partitions, use single MinCut
+            if (this.config.partitionCount === 2) {
+                const result = await this.minCutAnalyzer.computeMinCut(graph);
+                return this.buildResult(tests, [result], startTime);
+            }
+            // For k partitions, use recursive bisection
+            const partitions = await this.recursiveBisection(tests, graph);
+            return this.buildResultFromPartitions(tests, partitions, startTime);
+        }
+        catch (error) {
+            logger.warn('MinCut partitioning failed, falling back to duration-balanced', { error });
+            return this.durationBalancedPartition(tests, startTime);
+        }
+    }
+    /**
+     * Build a dependency graph from test files
+     */
+    buildTestGraph(tests) {
+        const testMap = new Map(tests.map(t => [t.path, t]));
+        const nodes = [];
+        const edges = [];
+        const edgeSet = new Set();
+        for (const test of tests) {
+            // Node weight based on duration (normalized)
+            const maxDuration = Math.max(...tests.map(t => t.estimatedDuration));
+            const normalizedWeight = maxDuration > 0 ? test.estimatedDuration / maxDuration : 1;
+            nodes.push({
+                id: test.path,
+                testFile: test,
+                weight: normalizedWeight,
+            });
+            // Add edges for dependencies
+            for (const dep of test.dependencies) {
+                if (testMap.has(dep)) {
+                    const edgeKey = [test.path, dep].sort().join('->');
+                    if (!edgeSet.has(edgeKey)) {
+                        edgeSet.add(edgeKey);
+                        edges.push({
+                            source: test.path,
+                            target: dep,
+                            weight: this.calculateEdgeWeight(test, testMap.get(dep)),
+                            type: 'import',
+                        });
+                    }
+                }
+            }
+            // Add edges for dependents (reverse dependencies)
+            for (const dependent of test.dependents) {
+                if (testMap.has(dependent)) {
+                    const edgeKey = [test.path, dependent].sort().join('->');
+                    if (!edgeSet.has(edgeKey)) {
+                        edgeSet.add(edgeKey);
+                        edges.push({
+                            source: test.path,
+                            target: dependent,
+                            weight: this.calculateEdgeWeight(test, testMap.get(dependent)),
+                            type: 'fixture',
+                        });
+                    }
+                }
+            }
+        }
+        return { nodes, edges };
+    }
+    /**
+     * Calculate edge weight based on dependency characteristics
+     * Higher weight = stronger coupling = should stay together
+     */
+    calculateEdgeWeight(test1, test2) {
+        let weight = 1.0;
+        // Shared tags increase weight
+        const sharedTags = test1.tags?.filter(t => test2.tags?.includes(t)) || [];
+        weight += sharedTags.length * 0.5;
+        // Same priority increases weight
+        if (test1.priority === test2.priority) {
+            weight += 0.3;
+        }
+        // Critical tests should stay with their dependencies
+        if (test1.priority === 'critical' || test2.priority === 'critical') {
+            weight += 1.0;
+        }
+        // Flaky tests should stay together (for isolation)
+        if (test1.flakinessScore > 0.3 && test2.flakinessScore > 0.3) {
+            weight += 0.5;
+        }
+        return weight;
+    }
+    /**
+     * Recursively bisect graph to create k partitions
+     */
+    async recursiveBisection(tests, graph) {
+        const partitions = [];
+        const queue = [{ tests, graph }];
+        while (queue.length < this.config.partitionCount && queue.length > 0) {
+            // Find the largest partition to split
+            queue.sort((a, b) => b.tests.length - a.tests.length);
+            const { tests: currentTests, graph: currentGraph } = queue.shift();
+            if (currentTests.length <= 2) {
+                // Too small to split, add as final partition
+                partitions.push(currentTests);
+                continue;
+            }
+            try {
+                const result = await this.minCutAnalyzer.computeMinCut(currentGraph);
+                // Create two sub-partitions
+                const partition1Tests = currentTests.filter(t => result.partition1.includes(t.path));
+                const partition2Tests = currentTests.filter(t => result.partition2.includes(t.path));
+                // Create sub-graphs
+                const subGraph1 = this.createSubgraph(currentGraph, result.partition1);
+                const subGraph2 = this.createSubgraph(currentGraph, result.partition2);
+                if (partition1Tests.length > 0) {
+                    queue.push({ tests: partition1Tests, graph: subGraph1 });
+                }
+                if (partition2Tests.length > 0) {
+                    queue.push({ tests: partition2Tests, graph: subGraph2 });
+                }
+            }
+            catch (error) {
+                // If MinCut fails, add as final partition
+                partitions.push(currentTests);
+            }
+        }
+        // Add remaining queue items as partitions
+        for (const item of queue) {
+            partitions.push(item.tests);
+        }
+        // Ensure we have exactly partitionCount partitions
+        return this.balancePartitions(partitions);
+    }
+    /**
+     * Create a subgraph containing only specified nodes
+     */
+    createSubgraph(graph, nodeIds) {
+        const nodeSet = new Set(nodeIds);
+        return {
+            nodes: graph.nodes.filter(n => nodeSet.has(n.id)),
+            edges: graph.edges.filter(e => nodeSet.has(e.source) && nodeSet.has(e.target)),
+            directed: graph.directed,
+        };
+    }
+    /**
+     * Balance partitions to ensure exactly k partitions
+     */
+    balancePartitions(partitions) {
+        const k = this.config.partitionCount;
+        // If we have too few partitions, split the largest ones
+        while (partitions.length < k) {
+            partitions.sort((a, b) => b.length - a.length);
+            const largest = partitions.shift();
+            if (largest.length <= 1) {
+                partitions.push(largest);
+                break;
+            }
+            const mid = Math.ceil(largest.length / 2);
+            partitions.push(largest.slice(0, mid));
+            partitions.push(largest.slice(mid));
+        }
+        // If we have too many partitions, merge the smallest ones
+        while (partitions.length > k) {
+            partitions.sort((a, b) => a.length - b.length);
+            const smallest1 = partitions.shift();
+            const smallest2 = partitions.shift();
+            partitions.push([...smallest1, ...smallest2]);
+        }
+        return partitions;
+    }
+    /**
+     * Simple duration-balanced partitioning (fallback)
+     */
+    durationBalancedPartition(tests, startTime) {
+        // Sort by duration descending (longest first)
+        const sortedTests = [...tests].sort((a, b) => b.estimatedDuration - a.estimatedDuration);
+        // Initialize partition buckets
+        const buckets = [];
+        for (let i = 0; i < this.config.partitionCount; i++) {
+            buckets.push({ tests: [], duration: 0 });
+        }
+        // Greedy assignment: add each test to the bucket with least total duration
+        for (const test of sortedTests) {
+            buckets.sort((a, b) => a.duration - b.duration);
+            buckets[0].tests.push(test);
+            buckets[0].duration += test.estimatedDuration;
+        }
+        const partitions = buckets.map((bucket, i) => ({
+            id: `partition-${i}`,
+            tests: bucket.tests,
+            estimatedDuration: bucket.duration,
+            crossPartitionDeps: this.countCrossPartitionDeps(bucket.tests, tests, buckets),
+            workerIndex: i,
+        }));
+        const computationTimeMs = performance.now() - startTime;
+        const stats = this.calculateStats(partitions, tests);
+        return {
+            partitions,
+            algorithm: 'duration-balanced',
+            totalCrossPartitionDeps: partitions.reduce((sum, p) => sum + p.crossPartitionDeps, 0),
+            loadBalanceScore: stats.parallelEfficiency,
+            computationTimeMs,
+            estimatedSpeedup: this.estimateSpeedup(partitions, tests),
+        };
+    }
+    /**
+     * Build result from MinCut output (2 partitions)
+     */
+    buildResult(tests, cuts, startTime) {
+        const testMap = new Map(tests.map(t => [t.path, t]));
+        const cut = cuts[0];
+        const partition1Tests = tests.filter(t => cut.partition1.includes(t.path));
+        const partition2Tests = tests.filter(t => cut.partition2.includes(t.path));
+        const partitions = [
+            {
+                id: 'partition-0',
+                tests: partition1Tests,
+                estimatedDuration: partition1Tests.reduce((sum, t) => sum + t.estimatedDuration, 0),
+                crossPartitionDeps: cut.cutEdges.length,
+                workerIndex: 0,
+            },
+            {
+                id: 'partition-1',
+                tests: partition2Tests,
+                estimatedDuration: partition2Tests.reduce((sum, t) => sum + t.estimatedDuration, 0),
+                crossPartitionDeps: cut.cutEdges.length,
+                workerIndex: 1,
+            },
+        ];
+        const computationTimeMs = performance.now() - startTime;
+        const stats = this.calculateStats(partitions, tests);
+        return {
+            partitions,
+            algorithm: 'mincut',
+            totalCrossPartitionDeps: cut.cutEdges.length,
+            loadBalanceScore: stats.parallelEfficiency,
+            computationTimeMs,
+            minCutValue: cut.cutValue,
+            estimatedSpeedup: this.estimateSpeedup(partitions, tests),
+        };
+    }
+    /**
+     * Build result from recursive bisection partitions
+     */
+    buildResultFromPartitions(tests, testPartitions, startTime) {
+        const partitions = testPartitions.map((partition, i) => ({
+            id: `partition-${i}`,
+            tests: partition,
+            estimatedDuration: partition.reduce((sum, t) => sum + t.estimatedDuration, 0),
+            crossPartitionDeps: this.countCrossPartitionDepsForPartition(partition, tests, testPartitions),
+            workerIndex: i,
+        }));
+        const computationTimeMs = performance.now() - startTime;
+        const stats = this.calculateStats(partitions, tests);
+        const totalCrossPartitionDeps = partitions.reduce((sum, p) => sum + p.crossPartitionDeps, 0) / 2; // Divide by 2 to avoid double counting
+        return {
+            partitions,
+            algorithm: 'mincut',
+            totalCrossPartitionDeps,
+            loadBalanceScore: stats.parallelEfficiency,
+            computationTimeMs,
+            estimatedSpeedup: this.estimateSpeedup(partitions, tests),
+        };
+    }
+    /**
+     * Count cross-partition dependencies for a single partition
+     */
+    countCrossPartitionDepsForPartition(partition, allTests, allPartitions) {
+        const partitionPaths = new Set(partition.map(t => t.path));
+        let count = 0;
+        for (const test of partition) {
+            for (const dep of [...test.dependencies, ...test.dependents]) {
+                if (!partitionPaths.has(dep) && allTests.some(t => t.path === dep)) {
+                    count++;
+                }
+            }
+        }
+        return count;
+    }
+    /**
+     * Count cross-partition dependencies
+     */
+    countCrossPartitionDeps(partitionTests, allTests, buckets) {
+        const partitionPaths = new Set(partitionTests.map(t => t.path));
+        let count = 0;
+        for (const test of partitionTests) {
+            for (const dep of [...test.dependencies, ...test.dependents]) {
+                if (!partitionPaths.has(dep) && allTests.some(t => t.path === dep)) {
+                    count++;
+                }
+            }
+        }
+        return count;
+    }
+    /**
+     * Calculate partition quality statistics
+     */
+    calculateStats(partitions, tests) {
+        const durations = partitions.map(p => p.estimatedDuration);
+        const avgDuration = durations.reduce((a, b) => a + b, 0) / durations.length;
+        const variance = durations.reduce((sum, d) => sum + Math.pow(d - avgDuration, 2), 0) / durations.length;
+        const stdDev = Math.sqrt(variance);
+        const sizes = partitions.map(p => p.tests.length);
+        const avgSize = sizes.reduce((a, b) => a + b, 0) / sizes.length;
+        const sizeVariance = sizes.reduce((sum, s) => sum + Math.pow(s - avgSize, 2), 0) / sizes.length;
+        const sizeStdDev = Math.sqrt(sizeVariance);
+        const totalDeps = tests.reduce((sum, t) => sum + t.dependencies.length + t.dependents.length, 0);
+        const crossDeps = partitions.reduce((sum, p) => sum + p.crossPartitionDeps, 0);
+        const crossDepPercentage = totalDeps > 0 ? crossDeps / totalDeps : 0;
+        // Parallel efficiency: ratio of avg duration to max duration
+        const maxDuration = Math.max(...durations);
+        const parallelEfficiency = maxDuration > 0 ? avgDuration / maxDuration : 1;
+        // Compare with naive round-robin (would have higher variance)
+        const naiveVariance = this.estimateNaiveVariance(tests);
+        const vsNaiveImprovement = naiveVariance > 0 ? 1 - (variance / naiveVariance) : 0;
+        return {
+            durationVariance: variance,
+            sizeStdDev,
+            crossDepPercentage,
+            parallelEfficiency,
+            vsNaiveImprovement: Math.max(0, vsNaiveImprovement),
+        };
+    }
+    /**
+     * Estimate variance for naive round-robin
+     */
+    estimateNaiveVariance(tests) {
+        const k = this.config.partitionCount;
+        const naiveBuckets = Array(k).fill(0);
+        tests.forEach((test, i) => {
+            naiveBuckets[i % k] += test.estimatedDuration;
+        });
+        const avg = naiveBuckets.reduce((a, b) => a + b, 0) / k;
+        return naiveBuckets.reduce((sum, d) => sum + Math.pow(d - avg, 2), 0) / k;
+    }
+    /**
+     * Estimate speedup compared to sequential execution
+     */
+    estimateSpeedup(partitions, tests) {
+        const totalDuration = tests.reduce((sum, t) => sum + t.estimatedDuration, 0);
+        const maxPartitionDuration = Math.max(...partitions.map(p => p.estimatedDuration));
+        if (maxPartitionDuration === 0)
+            return 1;
+        // Account for cross-partition dependency overhead (10% per dependency)
+        const crossDepOverhead = partitions.reduce((sum, p) => sum + p.crossPartitionDeps, 0) * 0.1;
+        const effectiveParallelDuration = maxPartitionDuration * (1 + crossDepOverhead / 100);
+        return totalDuration / effectiveParallelDuration;
+    }
+    /**
+     * Empty result for no tests
+     */
+    emptyResult(startTime) {
+        return {
+            partitions: [],
+            algorithm: 'mincut',
+            totalCrossPartitionDeps: 0,
+            loadBalanceScore: 1,
+            computationTimeMs: performance.now() - startTime,
+            estimatedSpeedup: 1,
+        };
+    }
+    /**
+     * Trivial partition when tests <= partition count
+     */
+    trivialPartition(tests, startTime) {
+        const partitions = tests.map((test, i) => ({
+            id: `partition-${i}`,
+            tests: [test],
+            estimatedDuration: test.estimatedDuration,
+            crossPartitionDeps: 0,
+            workerIndex: i,
+        }));
+        return {
+            partitions,
+            algorithm: 'mincut',
+            totalCrossPartitionDeps: 0,
+            loadBalanceScore: 1,
+            computationTimeMs: performance.now() - startTime,
+            estimatedSpeedup: tests.length,
+        };
+    }
+    /**
+     * Get current configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+exports.MinCutPartitioner = MinCutPartitioner;
+/**
+ * Convenience function for one-off partitioning
+ */
+async function partitionTests(tests, config) {
+    const partitioner = new MinCutPartitioner(config);
+    return partitioner.partition(tests);
+}
+//# sourceMappingURL=MinCutPartitioner.js.map

package/dist/test/partition/MinCutPartitioner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MinCutPartitioner.js","sourceRoot":"","sources":["../../../src/test/partition/MinCutPartitioner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AA4hBH,wCAMC;AAhiBD,yCASoB;AACpB,iGAA2F;AAE3F,qDAA+C;AAE/C,MAAM,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;AAEpC;;;GAGG;AACH,MAAa,iBAAiB;IAI5B,YAAY,SAAmC,EAAE;QAC/C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,mCAAwB,EAAE,GAAG,MAAM,EAAE,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,IAAI,kCAAc,CAAC;YACvC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;YAC5B,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,SAAS,CAAC,KAAiB;QACtC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,oBAAoB;QACpB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACjD,CAAC;QAED,yBAAyB;QACzB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAEpD,yDAAyD;QACzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;QAED,kDAAkD;QAClD,MAAM,KAAK,GAAqB;YAC9B,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrB,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,CAAC,CAAC,EAAE;gBACX,UAAU,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;aACjC,CAAC,CAAC;YACH,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;aACjB,CAAC,CAAC;YACH,QAAQ,EAAE,KAAK;SAChB,CAAC;QAEF,IAAI,CAAC;YACH,sCAAsC;YACtC,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,KAAK,CAAC,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9D,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC;YACtD,CAAC;YAED,4CAA4C;YAC5C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC/D,OAAO,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QACtE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,+DAA+D,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YACxF,OAAO,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAiB;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,6CAA6C;YAC7C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;YACrE,MAAM,gBAAgB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAEpF,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,IAAI,CAAC,IAAI;gBACb,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,gBAAgB;aACzB,CAAC,CAAC;YAEH,6BAA6B;YAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrB,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBACrB,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,IAAI,CAAC,IAAI;4BACjB,MAAM,EAAE,GAAG;4BACX,MAAM,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;4BACzD,IAAI,EAAE,QAAQ;yBACf,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YAED,kDAAkD;YAClD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACxC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC3B,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACzD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBACrB,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,IAAI,CAAC,IAAI;4BACjB,MAAM,EAAE,SAAS;4BACjB,MAAM,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;4BAC/D,IAAI,EAAE,SAAS;yBAChB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACK,mBAAmB,CAAC,KAAe,EAAE,KAAe;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QAEjB,8BAA8B;QAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1E,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC;QAElC,iCAAiC;QACjC,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,qDAAqD;QACrD,IAAI,KAAK,CAAC,QAAQ,KAAK,UAAU,IAAI,KAAK,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YACnE,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,mDAAmD;QACnD,IAAI,KAAK,CAAC,cAAc,GAAG,GAAG,IAAI,KAAK,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC;YAC7D,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,KAAiB,EACjB,KAAuB;QAEvB,MAAM,UAAU,GAAiB,EAAE,CAAC;QACpC,MAAM,KAAK,GAAqD,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAEnF,OAAO,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrE,sCAAsC;YACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACtD,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEpE,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,6CAA6C;gBAC7C,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC9B,SAAS;YACX,CAAC;YAED,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;gBAErE,4BAA4B;gBAC5B,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACrF,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAErF,oBAAoB;gBACpB,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;gBACvE,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;gBAEvE,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;gBAC3D,CAAC;gBACD,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,0CAA0C;gBAC1C,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,mDAAmD;QACnD,OAAO,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAuB,EAAE,OAAiB;QAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9E,QAAQ,EAAE,KAAK,CAAC,QAAQ;SACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,UAAwB;QAChD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QAErC,wDAAwD;QACxD,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;YACpC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACzB,MAAM;YACR,CAAC;YACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1C,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,0DAA0D;QAC1D,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAC/C,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;YACtC,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,yBAAyB,CAAC,KAAiB,EAAE,SAAiB;QACpE,8CAA8C;QAC9C,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAEzF,+BAA+B;QAC/B,MAAM,OAAO,GAA8C,EAAE,CAAC;QAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;QAED,2EAA2E;QAC3E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,iBAAiB,CAAC;QAChD,CAAC;QAED,MAAM,UAAU,GAAoB,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9D,EAAE,EAAE,aAAa,CAAC,EAAE;YACpB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,iBAAiB,EAAE,MAAM,CAAC,QAAQ;YAClC,kBAAkB,EAAE,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC;YAC9E,WAAW,EAAE,CAAC;SACf,CAAC,CAAC,CAAC;QAEJ,MAAM,iBAAiB,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAErD,OAAO;YACL,UAAU;YACV,SAAS,EAAE,mBAAmB;YAC9B,uBAAuB,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC;YACrF,gBAAgB,EAAE,KAAK,CAAC,kBAAkB;YAC1C,iBAAiB;YACjB,gBAAgB,EAAE,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC;SAC1D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,KAAiB,EAAE,IAAoB,EAAE,SAAiB;QAC5E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAEpB,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAE3E,MAAM,UAAU,GAAoB;YAClC;gBACE,EAAE,EAAE,aAAa;gBACjB,KAAK,EAAE,eAAe;gBACtB,iBAAiB,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC;gBACnF,kBAAkB,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM;gBACvC,WAAW,EAAE,CAAC;aACf;YACD;gBACE,EAAE,EAAE,aAAa;gBACjB,KAAK,EAAE,eAAe;gBACtB,iBAAiB,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC;gBACnF,kBAAkB,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM;gBACvC,WAAW,EAAE,CAAC;aACf;SACF,CAAC;QAEF,MAAM,iBAAiB,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAErD,OAAO;YACL,UAAU;YACV,SAAS,EAAE,QAAQ;YACnB,uBAAuB,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM;YAC5C,gBAAgB,EAAE,KAAK,CAAC,kBAAkB;YAC1C,iBAAiB;YACjB,WAAW,EAAE,GAAG,CAAC,QAAQ;YACzB,gBAAgB,EAAE,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC;SAC1D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,yBAAyB,CAC/B,KAAiB,EACjB,cAA4B,EAC5B,SAAiB;QAEjB,MAAM,UAAU,GAAoB,cAAc,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACxE,EAAE,EAAE,aAAa,CAAC,EAAE;YACpB,KAAK,EAAE,SAAS;YAChB,iBAAiB,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC;YAC7E,kBAAkB,EAAE,IAAI,CAAC,mCAAmC,CAAC,SAAS,EAAE,KAAK,EAAE,cAAc,CAAC;YAC9F,WAAW,EAAE,CAAC;SACf,CAAC,CAAC,CAAC;QAEJ,MAAM,iBAAiB,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACrD,MAAM,uBAAuB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,uCAAuC;QAEzI,OAAO;YACL,UAAU;YACV,SAAS,EAAE,QAAQ;YACnB,uBAAuB;YACvB,gBAAgB,EAAE,KAAK,CAAC,kBAAkB;YAC1C,iBAAiB;YACjB,gBAAgB,EAAE,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC;SAC1D,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,mCAAmC,CACzC,SAAqB,EACrB,QAAoB,EACpB,aAA2B;QAE3B,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC7D,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACnE,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,cAA0B,EAC1B,QAAoB,EACpB,OAAgC;QAEhC,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC7D,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACnE,KAAK,EAAE,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,UAA2B,EAAE,KAAiB;QACnE,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC;QAC3D,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC5E,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QACxG,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAChE,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAChG,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAE3C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjG,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,kBAAkB,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,6DAA6D;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;QAC3C,MAAM,kBAAkB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3E,8DAA8D;QAC9D,MAAM,aAAa,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACxD,MAAM,kBAAkB,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElF,OAAO;YACL,gBAAgB,EAAE,QAAQ;YAC1B,UAAU;YACV,kBAAkB;YAClB,kBAAkB;YAClB,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,kBAAkB,CAAC;SACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,KAAiB;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;QACrC,MAAM,YAAY,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEhD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACxB,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACxD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5E,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,UAA2B,EAAE,KAAiB;QACpE,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC7E,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAEnF,IAAI,oBAAoB,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEzC,uEAAuE;QACvE,MAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;QAC5F,MAAM,yBAAyB,GAAG,oBAAoB,GAAG,CAAC,CAAC,GAAG,gBAAgB,GAAG,GAAG,CAAC,CAAC;QAEtF,OAAO,aAAa,GAAG,yBAAyB,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,SAAiB;QACnC,OAAO;YACL,UAAU,EAAE,EAAE;YACd,SAAS,EAAE,QAAQ;YACnB,uBAAuB,EAAE,CAAC;YAC1B,gBAAgB,EAAE,CAAC;YACnB,iBAAiB,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;YAChD,gBAAgB,EAAE,CAAC;SACpB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAiB,EAAE,SAAiB;QAC3D,MAAM,UAAU,GAAoB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1D,EAAE,EAAE,aAAa,CAAC,EAAE;YACpB,KAAK,EAAE,CAAC,IAAI,CAAC;YACb,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,kBAAkB,EAAE,CAAC;YACrB,WAAW,EAAE,CAAC;SACf,CAAC,CAAC,CAAC;QAEJ,OAAO;YACL,UAAU;YACV,SAAS,EAAE,QAAQ;YACnB,uBAAuB,EAAE,CAAC;YAC1B,gBAAgB,EAAE,CAAC;YACnB,iBAAiB,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;YAChD,gBAAgB,EAAE,KAAK,CAAC,MAAM;SAC/B,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,SAAS;QACd,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF;AAjgBD,8CAigBC;AAED;;GAEG;AACI,KAAK,UAAU,cAAc,CAClC,KAAiB,EACjB,MAAiC;IAEjC,MAAM,WAAW,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAClD,OAAO,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AACtC,CAAC"}

package/dist/test/partition/RealTestExecutor.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Real Test Executor
+ *
+ * Executes tests using actual Jest/Vitest via child_process.spawn.
+ * This replaces the fake "setTimeout + random pass/fail" mock
+ * with real test execution.
+ */
+export interface TestExecutionResult {
+    testFile: string;
+    passed: boolean;
+    failed: number;
+    total: number;
+    duration: number;
+    error?: string;
+    output?: string;
+    workerIndex: number;
+}
+export interface BatchExecutionResult {
+    results: TestExecutionResult[];
+    totalDuration: number;
+    passed: number;
+    failed: number;
+}
+export interface ExecutorConfig {
+    /** Test runner command (default: 'npx') */
+    command: string;
+    /** Test runner args (default: ['jest']) */
+    runnerArgs: string[];
+    /** Timeout per test file in ms (default: 30000) */
+    timeout: number;
+    /** Working directory */
+    cwd: string;
+    /** Environment variables */
+    env?: Record<string, string>;
+    /** Whether to collect coverage */
+    collectCoverage: boolean;
+}
+/**
+ * Executes real tests using Jest via child_process
+ */
+export declare class RealTestExecutor {
+    private config;
+    private runningProcesses;
+    constructor(config?: Partial<ExecutorConfig>);
+    /**
+     * Execute a single test file
+     */
+    executeTest(testFile: string, workerIndex?: number): Promise<TestExecutionResult>;
+    /**
+     * Execute a batch of test files sequentially on a single worker
+     */
+    executeBatch(testFiles: string[], workerIndex?: number): Promise<BatchExecutionResult>;
+    /**
+     * Execute multiple batches in parallel (one per worker)
+     */
+    executeParallel(batches: string[][], onProgress?: (workerIndex: number, result: TestExecutionResult) => void): Promise<BatchExecutionResult[]>;
+    /**
+     * Execute batch with progress callback
+     */
+    private executeBatchWithProgress;
+    /**
+     * Parse Jest JSON output to extract test results
+     */
+    private parseJestOutput;
+    /**
+     * Kill all running test processes
+     */
+    killAll(): void;
+    /**
+     * Get number of currently running tests
+     */
+    getRunningCount(): number;
+}
+/**
+ * Aggregate results from multiple batch executions
+ */
+export declare function aggregateBatchResults(batches: BatchExecutionResult[]): {
+    allResults: TestExecutionResult[];
+    totalDuration: number;
+    maxWorkerDuration: number;
+    passed: number;
+    failed: number;
+    total: number;
+    parallelSpeedup: number;
+};
+//# sourceMappingURL=RealTestExecutor.d.ts.map

package/dist/test/partition/RealTestExecutor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RealTestExecutor.d.ts","sourceRoot":"","sources":["../../../src/test/partition/RealTestExecutor.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,oBAAoB;IACnC,OAAO,EAAE,mBAAmB,EAAE,CAAC;IAC/B,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,cAAc;IAC7B,2CAA2C;IAC3C,OAAO,EAAE,MAAM,CAAC;IAChB,2CAA2C;IAC3C,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,mDAAmD;IACnD,OAAO,EAAE,MAAM,CAAC;IAChB,wBAAwB;IACxB,GAAG,EAAE,MAAM,CAAC;IACZ,4BAA4B;IAC5B,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,kCAAkC;IAClC,eAAe,EAAE,OAAO,CAAC;CAC1B;AAUD;;GAEG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,MAAM,CAAiB;IAC/B,OAAO,CAAC,gBAAgB,CAAwC;gBAEpD,MAAM,GAAE,OAAO,CAAC,cAAc,CAAM;IAIhD;;OAEG;IACU,WAAW,CACtB,QAAQ,EAAE,MAAM,EAChB,WAAW,GAAE,MAAU,GACtB,OAAO,CAAC,mBAAmB,CAAC;IAqG/B;;OAEG;IACU,YAAY,CACvB,SAAS,EAAE,MAAM,EAAE,EACnB,WAAW,GAAE,MAAU,GACtB,OAAO,CAAC,oBAAoB,CAAC;IA2BhC;;OAEG;IACU,eAAe,CAC1B,OAAO,EAAE,MAAM,EAAE,EAAE,EACnB,UAAU,CAAC,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,mBAAmB,KAAK,IAAI,GACtE,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAQlC;;OAEG;YACW,wBAAwB;IAiCtC;;OAEG;IACH,OAAO,CAAC,eAAe;IAgCvB;;OAEG;IACI,OAAO,IAAI,IAAI;IAQtB;;OAEG;IACI,eAAe,IAAI,MAAM;CAGjC;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,oBAAoB,EAAE,GAAG;IACtE,UAAU,EAAE,mBAAmB,EAAE,CAAC;IAClC,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,EAAE,MAAM,CAAC;CACzB,CAgBA"}