agentic-qe 1.0.0

package/dist/utils/sublinear/coverageOptimizer.js

@@ -0,0 +1,415 @@
+"use strict";
+/**
+ * Coverage Optimization using Sublinear Algorithms
+ * Implements SPARC Phase 2 pseudocode for O(log n) coverage optimization
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SublinearCoverageOptimizer = void 0;
+exports.createCoverageOptimizer = createCoverageOptimizer;
+/**
+ * Spectral Sparsification for matrix compression
+ */
+class SpectralSparsifier {
+    constructor(epsilon = 0.1) {
+        this.epsilon = epsilon;
+    }
+    /**
+     * Apply spectral sparsification to reduce matrix density
+     * while preserving spectral properties
+     */
+    sparsify(matrix, rows, cols) {
+        const sparsifiedMatrix = new Float64Array(matrix.length);
+        let nonZeroCount = 0;
+        let originalNonZero = 0;
+        // Calculate effective resistance for each edge (matrix entry)
+        const resistances = this.calculateEffectiveResistances(matrix, rows, cols);
+        for (let i = 0; i < matrix.length; i++) {
+            if (matrix[i] !== 0) {
+                originalNonZero++;
+                // Sampling probability based on effective resistance
+                const samplingProb = Math.min(1.0, resistances[i] * Math.log(rows) / this.epsilon);
+                if (Math.random() < samplingProb) {
+                    sparsifiedMatrix[i] = matrix[i] / samplingProb;
+                    nonZeroCount++;
+                }
+            }
+        }
+        return {
+            sparsifiedMatrix,
+            sparsificationRatio: nonZeroCount / Math.max(originalNonZero, 1)
+        };
+    }
+    calculateEffectiveResistances(matrix, rows, cols) {
+        const resistances = new Float64Array(matrix.length);
+        // Simplified effective resistance calculation
+        // In practice, this would use more sophisticated spectral methods
+        for (let i = 0; i < rows; i++) {
+            for (let j = 0; j < cols; j++) {
+                const idx = i * cols + j;
+                if (matrix[idx] !== 0) {
+                    // Approximate resistance based on local connectivity
+                    let neighbors = 0;
+                    // Count non-zero neighbors in row
+                    for (let k = 0; k < cols; k++) {
+                        if (matrix[i * cols + k] !== 0)
+                            neighbors++;
+                    }
+                    // Count non-zero neighbors in column
+                    for (let k = 0; k < rows; k++) {
+                        if (matrix[k * cols + j] !== 0)
+                            neighbors++;
+                    }
+                    resistances[idx] = 1.0 / Math.max(neighbors, 1);
+                }
+            }
+        }
+        return resistances;
+    }
+}
+/**
+ * Sublinear Coverage Optimizer
+ */
+class SublinearCoverageOptimizer {
+    constructor(epsilon = 0.05, maxIterations = 1000) {
+        this.sparsifier = new SpectralSparsifier(epsilon);
+        this.maxIterations = maxIterations;
+    }
+    /**
+     * Optimize coverage using sublinear algorithms
+     * Implements the pseudocode from SPARC Phase 2: OptimizeCoverageSublinear
+     */
+    async optimizeCoverage(coverageMatrix, coveragePoints, constraint) {
+        const startTime = Date.now();
+        // Phase 1: Apply spectral sparsification
+        const { sparsifiedMatrix, sparsificationRatio } = this.sparsifier.sparsify(coverageMatrix.matrix, coverageMatrix.rows, coverageMatrix.cols);
+        // Phase 2: Create constraint vector
+        const constraintVector = this.createConstraintVector(coveragePoints, constraint);
+        // Phase 3: Apply Johnson-Lindenstrauss dimension reduction
+        const reducedDimension = this.calculateOptimalDimension(coverageMatrix.rows, coverageMatrix.cols);
+        const projectedData = await this.applyJLTransform(sparsifiedMatrix, coverageMatrix.rows, coverageMatrix.cols, reducedDimension);
+        // Phase 4: Solve using sublinear optimization
+        const solution = await this.solveTrueSublinear(projectedData.matrix, projectedData.rows, projectedData.cols, constraintVector, constraint);
+        // Phase 5: Map solution back to original space
+        const selectedIndices = this.mapSolutionToOriginalSpace(solution.solution, coverageMatrix.rows, coveragePoints, constraint);
+        // Phase 6: Validate and augment if necessary
+        const finalIndices = await this.validateAndAugment(selectedIndices, coverageMatrix, coveragePoints, constraint);
+        // Calculate final metrics
+        const coverageAchieved = this.calculateCoverageAchieved(finalIndices, coverageMatrix, coveragePoints);
+        const weightedScore = this.calculateWeightedCoverageScore(finalIndices, coverageMatrix, coveragePoints);
+        const redundancyReduction = this.calculateRedundancyReduction(finalIndices, coverageMatrix);
+        const optimizationTime = Date.now() - startTime;
+        return {
+            selectedTestIndices: finalIndices,
+            coverageAchieved,
+            weightedCoverageScore: weightedScore,
+            redundancyReduction,
+            optimizationTime,
+            algorithmMetrics: {
+                iterationsUsed: solution.iterations,
+                convergenceRate: solution.convergenceRate,
+                dimensionReduction: reducedDimension / coverageMatrix.cols
+            }
+        };
+    }
+    /**
+     * Create constraint vector based on coverage requirements
+     */
+    createConstraintVector(coveragePoints, constraint) {
+        const vector = new Float64Array(coveragePoints.length);
+        for (let i = 0; i < coveragePoints.length; i++) {
+            const point = coveragePoints[i];
+            // Weight constraint by point importance and difficulty
+            vector[i] = constraint.targetPercentage * point.weight * (1 + point.difficulty);
+        }
+        return vector;
+    }
+    /**
+     * Calculate optimal dimension for Johnson-Lindenstrauss reduction
+     */
+    calculateOptimalDimension(rows, cols) {
+        const epsilon = 0.1; // Distortion parameter
+        const n = Math.max(rows, cols);
+        // JL bound: d ≥ O(log n / ε²)
+        let dimension = Math.ceil(4 * Math.log(n) / (epsilon * epsilon));
+        // Practical bounds
+        dimension = Math.min(dimension, Math.floor(cols / 2));
+        dimension = Math.max(dimension, 10);
+        return dimension;
+    }
+    /**
+     * Apply Johnson-Lindenstrauss random projection
+     */
+    async applyJLTransform(matrix, rows, cols, targetDimension) {
+        const projectedMatrix = new Float64Array(rows * targetDimension);
+        // Generate random projection matrix
+        const projectionMatrix = new Float64Array(targetDimension * cols);
+        const scale = Math.sqrt(1.0 / targetDimension);
+        for (let i = 0; i < projectionMatrix.length; i++) {
+            // Gaussian random projection
+            const u1 = Math.random();
+            const u2 = Math.random();
+            const gaussian = Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+            projectionMatrix[i] = gaussian * scale;
+        }
+        // Apply projection: A' = A * P^T
+        for (let i = 0; i < rows; i++) {
+            for (let j = 0; j < targetDimension; j++) {
+                let sum = 0;
+                for (let k = 0; k < cols; k++) {
+                    sum += matrix[i * cols + k] * projectionMatrix[j * cols + k];
+                }
+                projectedMatrix[i * targetDimension + j] = sum;
+            }
+        }
+        return {
+            matrix: projectedMatrix,
+            rows,
+            cols: targetDimension
+        };
+    }
+    /**
+     * Solve optimization problem using sublinear methods
+     */
+    async solveTrueSublinear(matrix, rows, cols, constraintVector, constraint) {
+        const solution = new Float64Array(rows);
+        let iterations = 0;
+        let convergenceRate = 0;
+        // Initialize with uniform distribution
+        solution.fill(1.0 / rows);
+        // Fast Iterative Shrinkage-Thresholding Algorithm (FISTA)
+        const stepSize = 0.1;
+        const tolerance = 1e-6;
+        let previousObjective = Infinity;
+        for (iterations = 0; iterations < this.maxIterations; iterations++) {
+            // Calculate gradient
+            const gradient = this.calculateGradient(matrix, solution, constraintVector, rows, cols);
+            // Update solution with momentum
+            const momentum = iterations > 0 ? 0.9 : 0;
+            for (let i = 0; i < rows; i++) {
+                const oldValue = solution[i];
+                solution[i] = Math.max(0, solution[i] - stepSize * gradient[i]);
+                if (iterations > 0) {
+                    solution[i] += momentum * (solution[i] - oldValue);
+                }
+            }
+            // Project onto constraint set (simplex projection for test selection)
+            this.projectOntoSimplex(solution, constraint.maxTests / rows);
+            // Check convergence
+            const objective = this.calculateObjective(matrix, solution, constraintVector, rows, cols);
+            convergenceRate = Math.abs(previousObjective - objective) / Math.max(previousObjective, 1e-8);
+            if (convergenceRate < tolerance) {
+                break;
+            }
+            previousObjective = objective;
+        }
+        return { solution, iterations, convergenceRate };
+    }
+    calculateGradient(matrix, solution, target, rows, cols) {
+        const gradient = new Float64Array(rows);
+        // Calculate residual: Ax - b
+        const residual = new Float64Array(cols);
+        for (let j = 0; j < cols; j++) {
+            let sum = 0;
+            for (let i = 0; i < rows; i++) {
+                sum += matrix[i * cols + j] * solution[i];
+            }
+            residual[j] = sum - target[j];
+        }
+        // Calculate gradient: A^T(Ax - b)
+        for (let i = 0; i < rows; i++) {
+            let sum = 0;
+            for (let j = 0; j < cols; j++) {
+                sum += matrix[i * cols + j] * residual[j];
+            }
+            gradient[i] = sum;
+        }
+        return gradient;
+    }
+    calculateObjective(matrix, solution, target, rows, cols) {
+        let objective = 0;
+        // Calculate ||Ax - b||²
+        for (let j = 0; j < cols; j++) {
+            let sum = 0;
+            for (let i = 0; i < rows; i++) {
+                sum += matrix[i * cols + j] * solution[i];
+            }
+            const diff = sum - target[j];
+            objective += diff * diff;
+        }
+        return objective / 2;
+    }
+    projectOntoSimplex(vector, scale = 1.0) {
+        const n = vector.length;
+        const sorted = Array.from(vector).sort((a, b) => b - a);
+        let rho = 0;
+        let sum = 0;
+        for (let i = 0; i < n; i++) {
+            sum += sorted[i];
+            const threshold = (sum - scale) / (i + 1);
+            if (sorted[i] > threshold) {
+                rho = i;
+            }
+        }
+        const threshold = (sorted.slice(0, rho + 1).reduce((a, b) => a + b, 0) - scale) / (rho + 1);
+        for (let i = 0; i < n; i++) {
+            vector[i] = Math.max(0, vector[i] - threshold);
+        }
+    }
+    mapSolutionToOriginalSpace(solution, originalRows, coveragePoints, constraint) {
+        // Sort tests by solution value and select top k
+        const indices = Array.from({ length: originalRows }, (_, i) => i);
+        indices.sort((a, b) => solution[b] - solution[a]);
+        const maxTests = Math.min(constraint.maxTests, originalRows);
+        return indices.slice(0, maxTests);
+    }
+    async validateAndAugment(selectedIndices, coverageMatrix, coveragePoints, constraint) {
+        const coverage = this.calculateCoverageAchieved(selectedIndices, coverageMatrix, coveragePoints);
+        if (coverage >= constraint.targetPercentage) {
+            return selectedIndices;
+        }
+        // Greedy augmentation for missing coverage
+        const selected = new Set(selectedIndices);
+        const coveredPoints = new Set();
+        // Mark initially covered points
+        for (const testIdx of selectedIndices) {
+            for (let j = 0; j < coverageMatrix.cols; j++) {
+                if (coverageMatrix.matrix[testIdx * coverageMatrix.cols + j] > 0) {
+                    coveredPoints.add(j);
+                }
+            }
+        }
+        // Find uncovered high-priority points
+        const uncoveredPoints = [];
+        for (let j = 0; j < coveragePoints.length; j++) {
+            if (!coveredPoints.has(j)) {
+                uncoveredPoints.push({ index: j, weight: coveragePoints[j].weight });
+            }
+        }
+        // Sort by weight (importance)
+        uncoveredPoints.sort((a, b) => b.weight - a.weight);
+        // Greedily add tests for uncovered points
+        for (const point of uncoveredPoints) {
+            if (selected.size >= constraint.maxTests)
+                break;
+            let bestTest = -1;
+            let bestScore = 0;
+            for (let i = 0; i < coverageMatrix.rows; i++) {
+                if (selected.has(i))
+                    continue;
+                if (coverageMatrix.matrix[i * coverageMatrix.cols + point.index] > 0) {
+                    // Calculate test value: new coverage / execution cost
+                    let newCoverage = 0;
+                    for (let j = 0; j < coverageMatrix.cols; j++) {
+                        if (coverageMatrix.matrix[i * coverageMatrix.cols + j] > 0 && !coveredPoints.has(j)) {
+                            newCoverage += coveragePoints[j].weight;
+                        }
+                    }
+                    if (newCoverage > bestScore) {
+                        bestScore = newCoverage;
+                        bestTest = i;
+                    }
+                }
+            }
+            if (bestTest >= 0) {
+                selected.add(bestTest);
+                // Update covered points
+                for (let j = 0; j < coverageMatrix.cols; j++) {
+                    if (coverageMatrix.matrix[bestTest * coverageMatrix.cols + j] > 0) {
+                        coveredPoints.add(j);
+                    }
+                }
+            }
+        }
+        return Array.from(selected);
+    }
+    calculateCoverageAchieved(selectedIndices, coverageMatrix, coveragePoints) {
+        const coveredPoints = new Set();
+        for (const testIdx of selectedIndices) {
+            for (let j = 0; j < coverageMatrix.cols; j++) {
+                if (coverageMatrix.matrix[testIdx * coverageMatrix.cols + j] > 0) {
+                    coveredPoints.add(j);
+                }
+            }
+        }
+        return coveredPoints.size / coveragePoints.length;
+    }
+    calculateWeightedCoverageScore(selectedIndices, coverageMatrix, coveragePoints) {
+        const coveredPoints = new Set();
+        for (const testIdx of selectedIndices) {
+            for (let j = 0; j < coverageMatrix.cols; j++) {
+                if (coverageMatrix.matrix[testIdx * coverageMatrix.cols + j] > 0) {
+                    coveredPoints.add(j);
+                }
+            }
+        }
+        let totalWeight = 0;
+        let coveredWeight = 0;
+        for (let i = 0; i < coveragePoints.length; i++) {
+            totalWeight += coveragePoints[i].weight;
+            if (coveredPoints.has(i)) {
+                coveredWeight += coveragePoints[i].weight;
+            }
+        }
+        return totalWeight > 0 ? coveredWeight / totalWeight : 0;
+    }
+    calculateRedundancyReduction(selectedIndices, coverageMatrix) {
+        if (selectedIndices.length <= 1)
+            return 0;
+        let totalRedundancy = 0;
+        let comparisons = 0;
+        for (let i = 0; i < selectedIndices.length; i++) {
+            for (let j = i + 1; j < selectedIndices.length; j++) {
+                const test1 = selectedIndices[i];
+                const test2 = selectedIndices[j];
+                let overlap = 0;
+                let union = 0;
+                for (let k = 0; k < coverageMatrix.cols; k++) {
+                    const covers1 = coverageMatrix.matrix[test1 * coverageMatrix.cols + k] > 0;
+                    const covers2 = coverageMatrix.matrix[test2 * coverageMatrix.cols + k] > 0;
+                    if (covers1 && covers2)
+                        overlap++;
+                    if (covers1 || covers2)
+                        union++;
+                }
+                if (union > 0) {
+                    totalRedundancy += overlap / union; // Jaccard similarity
+                }
+                comparisons++;
+            }
+        }
+        return comparisons > 0 ? 1 - (totalRedundancy / comparisons) : 1;
+    }
+    /**
+     * Create a coverage matrix from test and coverage point data
+     */
+    static createCoverageMatrix(tests, coveragePoints) {
+        const pointIdToIndex = new Map();
+        coveragePoints.forEach((point, index) => {
+            pointIdToIndex.set(point.id, index);
+        });
+        const matrix = new Float64Array(tests.length * coveragePoints.length);
+        for (let i = 0; i < tests.length; i++) {
+            for (const pointId of tests[i].coveredPoints) {
+                const pointIndex = pointIdToIndex.get(pointId);
+                if (pointIndex !== undefined) {
+                    matrix[i * coveragePoints.length + pointIndex] = 1.0;
+                }
+            }
+        }
+        return {
+            matrix,
+            rows: tests.length,
+            cols: coveragePoints.length,
+            testIds: tests.map(t => t.id),
+            coveragePointIds: coveragePoints.map(p => p.id)
+        };
+    }
+}
+exports.SublinearCoverageOptimizer = SublinearCoverageOptimizer;
+/**
+ * Factory function for creating coverage optimizer
+ */
+function createCoverageOptimizer(epsilon = 0.05) {
+    return new SublinearCoverageOptimizer(epsilon);
+}
+//# sourceMappingURL=coverageOptimizer.js.map

package/dist/utils/sublinear/coverageOptimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverageOptimizer.js","sourceRoot":"","sources":["../../../src/utils/sublinear/coverageOptimizer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAqnBH,0DAEC;AAllBD;;GAEG;AACH,MAAM,kBAAkB;IAGtB,YAAY,UAAkB,GAAG;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,MAAoB,EAAE,IAAY,EAAE,IAAY;QAIvD,MAAM,gBAAgB,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,8DAA8D;QAC9D,MAAM,WAAW,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAE3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,eAAe,EAAE,CAAC;gBAElB,qDAAqD;gBACrD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;gBAEnF,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,YAAY,EAAE,CAAC;oBACjC,gBAAgB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;oBAC/C,YAAY,EAAE,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,gBAAgB;YAChB,mBAAmB,EAAE,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC;SACjE,CAAC;IACJ,CAAC;IAEO,6BAA6B,CAAC,MAAoB,EAAE,IAAY,EAAE,IAAY;QACpF,MAAM,WAAW,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAEpD,8CAA8C;QAC9C,kEAAkE;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;gBACzB,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACtB,qDAAqD;oBACrD,IAAI,SAAS,GAAG,CAAC,CAAC;oBAElB,kCAAkC;oBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9B,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;4BAAE,SAAS,EAAE,CAAC;oBAC9C,CAAC;oBAED,qCAAqC;oBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9B,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;4BAAE,SAAS,EAAE,CAAC;oBAC9C,CAAC;oBAED,WAAW,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;CACF;AAED;;GAEG;AACH,MAAa,0BAA0B;IAIrC,YAAY,UAAkB,IAAI,EAAE,gBAAwB,IAAI;QAC9D,IAAI,CAAC,UAAU,GAAG,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,gBAAgB,CACpB,cAA8B,EAC9B,cAA+B,EAC/B,UAA8B;QAE9B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,yCAAyC;QACzC,MAAM,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CACxE,cAAc,CAAC,MAAM,EACrB,cAAc,CAAC,IAAI,EACnB,cAAc,CAAC,IAAI,CACpB,CAAC;QAEF,oCAAoC;QACpC,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;QAEjF,2DAA2D;QAC3D,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CACrD,cAAc,CAAC,IAAI,EACnB,cAAc,CAAC,IAAI,CACpB,CAAC;QAEF,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAC/C,gBAAgB,EAChB,cAAc,CAAC,IAAI,EACnB,cAAc,CAAC,IAAI,EACnB,gBAAgB,CACjB,CAAC;QAEF,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAC5C,aAAa,CAAC,MAAM,EACpB,aAAa,CAAC,IAAI,EAClB,aAAa,CAAC,IAAI,EAClB,gBAAgB,EAChB,UAAU,CACX,CAAC;QAEF,+CAA+C;QAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,0BAA0B,CACrD,QAAQ,CAAC,QAAQ,EACjB,cAAc,CAAC,IAAI,EACnB,cAAc,EACd,UAAU,CACX,CAAC;QAEF,6CAA6C;QAC7C,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAChD,eAAe,EACf,cAAc,EACd,cAAc,EACd,UAAU,CACX,CAAC;QAEF,0BAA0B;QAC1B,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CACrD,YAAY,EACZ,cAAc,EACd,cAAc,CACf,CAAC;QAEF,MAAM,aAAa,GAAG,IAAI,CAAC,8BAA8B,CACvD,YAAY,EACZ,cAAc,EACd,cAAc,CACf,CAAC;QAEF,MAAM,mBAAmB,GAAG,IAAI,CAAC,4BAA4B,CAC3D,YAAY,EACZ,cAAc,CACf,CAAC;QAEF,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAEhD,OAAO;YACL,mBAAmB,EAAE,YAAY;YACjC,gBAAgB;YAChB,qBAAqB,EAAE,aAAa;YACpC,mBAAmB;YACnB,gBAAgB;YAChB,gBAAgB,EAAE;gBAChB,cAAc,EAAE,QAAQ,CAAC,UAAU;gBACnC,eAAe,EAAE,QAAQ,CAAC,eAAe;gBACzC,kBAAkB,EAAE,gBAAgB,GAAG,cAAc,CAAC,IAAI;aAC3D;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,cAA+B,EAC/B,UAA8B;QAE9B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAChC,uDAAuD;YACvD,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QAClF,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,yBAAyB,CAAC,IAAY,EAAE,IAAY;QAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,uBAAuB;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAE/B,8BAA8B;QAC9B,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC;QAEjE,mBAAmB;QACnB,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACtD,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAEpC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,MAAoB,EACpB,IAAY,EACZ,IAAY,EACZ,eAAuB;QAEvB,MAAM,eAAe,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,eAAe,CAAC,CAAC;QAEjE,oCAAoC;QACpC,MAAM,gBAAgB,GAAG,IAAI,YAAY,CAAC,eAAe,GAAG,IAAI,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,eAAe,CAAC,CAAC;QAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,6BAA6B;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC3E,gBAAgB,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,KAAK,CAAC;QACzC,CAAC;QAED,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;gBAC/D,CAAC;gBACD,eAAe,CAAC,CAAC,GAAG,eAAe,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;YACjD,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM,EAAE,eAAe;YACvB,IAAI;YACJ,IAAI,EAAE,eAAe;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,MAAoB,EACpB,IAAY,EACZ,IAAY,EACZ,gBAA8B,EAC9B,UAA8B;QAE9B,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,uCAAuC;QACvC,QAAQ,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QAE1B,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,GAAG,CAAC;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC;QACvB,IAAI,iBAAiB,GAAG,QAAQ,CAAC;QAEjC,KAAK,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,EAAE,CAAC;YACnE,qBAAqB;YACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAExF,gCAAgC;YAChC,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;oBACnB,QAAQ,CAAC,CAAC,CAAC,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;YAED,sEAAsE;YACtE,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC;YAE9D,oBAAoB;YACpB,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1F,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;YAE9F,IAAI,eAAe,GAAG,SAAS,EAAE,CAAC;gBAChC,MAAM;YACR,CAAC;YAED,iBAAiB,GAAG,SAAS,CAAC;QAChC,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,eAAe,EAAE,CAAC;IACnD,CAAC;IAEO,iBAAiB,CACvB,MAAoB,EACpB,QAAsB,EACtB,MAAoB,EACpB,IAAY,EACZ,IAAY;QAEZ,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QAExC,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,kCAAkC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,kBAAkB,CACxB,MAAoB,EACpB,QAAsB,EACtB,MAAoB,EACpB,IAAY,EACZ,IAAY;QAEZ,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,SAAS,IAAI,IAAI,GAAG,IAAI,CAAC;QAC3B,CAAC;QAED,OAAO,SAAS,GAAG,CAAC,CAAC;IACvB,CAAC;IAEO,kBAAkB,CAAC,MAAoB,EAAE,QAAgB,GAAG;QAClE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAExD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,SAAS,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;gBAC1B,GAAG,GAAG,CAAC,CAAC;YACV,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAE5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAEO,0BAA0B,CAChC,QAAsB,EACtB,YAAoB,EACpB,cAA+B,EAC/B,UAA8B;QAE9B,gDAAgD;QAChD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAElD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC7D,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACpC,CAAC;IAEO,KAAK,CAAC,kBAAkB,CAC9B,eAAyB,EACzB,cAA8B,EAC9B,cAA+B,EAC/B,UAA8B;QAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,yBAAyB,CAAC,eAAe,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;QAEjG,IAAI,QAAQ,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;YAC5C,OAAO,eAAe,CAAC;QACzB,CAAC;QAED,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,gCAAgC;QAChC,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,cAAc,CAAC,MAAM,CAAC,OAAO,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,eAAe,GAAG,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,eAAe,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAEpD,0CAA0C;QAC1C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,IAAI,QAAQ,CAAC,IAAI,IAAI,UAAU,CAAC,QAAQ;gBAAE,MAAM;YAEhD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAE9B,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBACrE,sDAAsD;oBACtD,IAAI,WAAW,GAAG,CAAC,CAAC;oBACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC7C,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;4BACpF,WAAW,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;wBAC1C,CAAC;oBACH,CAAC;oBAED,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;wBAC5B,SAAS,GAAG,WAAW,CAAC;wBACxB,QAAQ,GAAG,CAAC,CAAC;oBACf,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACvB,wBAAwB;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,IAAI,cAAc,CAAC,MAAM,CAAC,QAAQ,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;wBAClE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEO,yBAAyB,CAC/B,eAAyB,EACzB,cAA8B,EAC9B,cAA+B;QAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,cAAc,CAAC,MAAM,CAAC,OAAO,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,aAAa,CAAC,IAAI,GAAG,cAAc,CAAC,MAAM,CAAC;IACpD,CAAC;IAEO,8BAA8B,CACpC,eAAyB,EACzB,cAA8B,EAC9B,cAA+B;QAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,IAAI,cAAc,CAAC,MAAM,CAAC,OAAO,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACjE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,WAAW,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzB,aAAa,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAEO,4BAA4B,CAClC,eAAyB,EACzB,cAA8B;QAE9B,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAE1C,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpD,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEjC,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,IAAI,KAAK,GAAG,CAAC,CAAC;gBAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC3E,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBAE3E,IAAI,OAAO,IAAI,OAAO;wBAAE,OAAO,EAAE,CAAC;oBAClC,IAAI,OAAO,IAAI,OAAO;wBAAE,KAAK,EAAE,CAAC;gBAClC,CAAC;gBAED,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACd,eAAe,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,qBAAqB;gBAC3D,CAAC;gBACD,WAAW,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,oBAAoB,CACzB,KAAqD,EACrD,cAA+B;QAE/B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,cAAc,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YACtC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QAEtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC/C,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;oBAC7B,MAAM,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,MAAM;YACN,IAAI,EAAE,KAAK,CAAC,MAAM;YAClB,IAAI,EAAE,cAAc,CAAC,MAAM;YAC3B,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7B,gBAAgB,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChD,CAAC;IACJ,CAAC;CACF;AA5fD,gEA4fC;AAED;;GAEG;AACH,SAAgB,uBAAuB,CAAC,UAAkB,IAAI;IAC5D,OAAO,IAAI,0BAA0B,CAAC,OAAO,CAAC,CAAC;AACjD,CAAC"}

package/dist/utils/sublinear/index.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Sublinear Utilities Index
+ * Exports all sublinear optimization components with O(log n) guarantees
+ */
+export { SublinearTestSelector, createTestSelector } from './testSelector';
+export { SublinearCoverageOptimizer, createCoverageOptimizer } from './coverageOptimizer';
+export { SublinearMatrixSolver, createMatrixSolver } from './matrixSolver';
+export { TemporalPredictor, createTemporalPredictor } from './temporalPredictor';
+export type { TestCase, TestSelectionConfig, SelectionResult } from './testSelector';
+export type { CoveragePoint, CoverageConstraint, CoverageMatrix, OptimizationResult } from './coverageOptimizer';
+export type { Matrix, SparseMatrix, SolverConfig, SolverResult, TemporalAdvantageResult } from './matrixSolver';
+export type { PredictionInput, TemporalScenario, PredictionResult, ModelPerformance } from './temporalPredictor';
+export { TEMPORAL_SCENARIOS } from './temporalPredictor';
+/**
+ * Sublinear Enhancement Factory
+ * Creates enhanced versions of existing agents with sublinear capabilities
+ */
+export declare class SublinearEnhancer {
+    private static instance;
+    private constructor();
+    static getInstance(): SublinearEnhancer;
+    /**
+     * Enhance Coverage Analyzer with O(log n) optimization
+     */
+    enhanceCoverageAnalyzer(originalAgent: any): any;
+    /**
+     * Enhance Test Generator with dimension reduction
+     */
+    enhanceTestGenerator(originalAgent: any): any;
+    /**
+     * Enhance Quality Gate with temporal prediction
+     */
+    enhanceQualityGate(originalAgent: any): any;
+}
+export declare const sublinearEnhancer: SublinearEnhancer;
+/**
+ * Utility function to create enhanced agent instances
+ */
+export declare function enhanceAgentWithSublinear(agent: any, agentType: 'coverage' | 'generator' | 'qualityGate'): any;
+/**
+ * Performance verification utility
+ */
+export declare function verifySublinearPerformance(): Promise<{
+    testSelector: boolean;
+    coverageOptimizer: boolean;
+    matrixSolver: boolean;
+    temporalPredictor: boolean;
+    overallPass: boolean;
+}>;
+//# sourceMappingURL=index.d.ts.map

package/dist/utils/sublinear/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/sublinear/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC3E,OAAO,EAAE,0BAA0B,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC1F,OAAO,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAGjF,YAAY,EACV,QAAQ,EACR,mBAAmB,EACnB,eAAe,EAChB,MAAM,gBAAgB,CAAC;AAExB,YAAY,EACV,aAAa,EACb,kBAAkB,EAClB,cAAc,EACd,kBAAkB,EACnB,MAAM,qBAAqB,CAAC;AAE7B,YAAY,EACV,MAAM,EACN,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,uBAAuB,EACxB,MAAM,gBAAgB,CAAC;AAExB,YAAY,EACV,eAAe,EACf,gBAAgB,EAChB,gBAAgB,EAChB,gBAAgB,EACjB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAEzD;;;GAGG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAoB;IAE3C,OAAO;IAEP,MAAM,CAAC,WAAW,IAAI,iBAAiB;IAOvC;;OAEG;IACH,uBAAuB,CAAC,aAAa,EAAE,GAAG,GAAG,GAAG;IAsGhD;;OAEG;IACH,oBAAoB,CAAC,aAAa,EAAE,GAAG,GAAG,GAAG;IA6F7C;;OAEG;IACH,kBAAkB,CAAC,aAAa,EAAE,GAAG,GAAG,GAAG;CAmF5C;AAGD,eAAO,MAAM,iBAAiB,mBAAkC,CAAC;AAEjE;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,UAAU,GAAG,WAAW,GAAG,aAAa,GAAG,GAAG,CAa9G;AAED;;GAEG;AACH,wBAAsB,0BAA0B,IAAI,OAAO,CAAC;IAC1D,YAAY,EAAE,OAAO,CAAC;IACtB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,YAAY,EAAE,OAAO,CAAC;IACtB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,WAAW,EAAE,OAAO,CAAC;CACtB,CAAC,CAwBD"}