agentic-qe 1.0.0

package/dist/utils/sublinear/temporalPredictor.js

@@ -0,0 +1,474 @@
+"use strict";
+/**
+ * Temporal Advantage Predictor for Quality Engineering
+ * Implements temporal computational lead prediction with O(log n) complexity
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TemporalUtils = exports.TemporalPredictor = exports.TEMPORAL_SCENARIOS = void 0;
+exports.createTemporalPredictor = createTemporalPredictor;
+/**
+ * Predefined distance scenarios for temporal advantage calculation
+ */
+exports.TEMPORAL_SCENARIOS = [
+    {
+        name: 'trading',
+        description: 'High-frequency trading between NYSE and Tokyo',
+        distanceKm: 10900,
+        typicalUseCase: 'Financial algorithm validation before market data arrives'
+    },
+    {
+        name: 'satellite',
+        description: 'Ground station to geostationary satellite',
+        distanceKm: 35786,
+        typicalUseCase: 'Satellite command validation before telemetry confirmation'
+    },
+    {
+        name: 'network',
+        description: 'Cross-continental data center communication',
+        distanceKm: 8000,
+        typicalUseCase: 'Distributed system optimization before synchronization'
+    },
+    {
+        name: 'local',
+        description: 'City-to-city network latency',
+        distanceKm: 500,
+        typicalUseCase: 'Regional microservice coordination'
+    },
+    {
+        name: 'global',
+        description: 'Antipodal network communication',
+        distanceKm: 20000,
+        typicalUseCase: 'Global CDN optimization strategies'
+    }
+];
+/**
+ * Algorithm complexity models for different QE operations
+ */
+const ALGORITHM_MODELS = {
+    'test-generation': {
+        baseTimeMs: 0.05,
+        complexityExponent: 0.3, // Sublinear due to JL reduction
+        dataFactor: 1.2,
+        description: 'AI-driven test generation with neural patterns'
+    },
+    'coverage-optimization': {
+        baseTimeMs: 0.1,
+        complexityExponent: 0.25, // O(log n) with spectral sparsification
+        dataFactor: 1.5,
+        description: 'Sublinear coverage matrix optimization'
+    },
+    'defect-prediction': {
+        baseTimeMs: 0.08,
+        complexityExponent: 0.35, // Neural model inference
+        dataFactor: 1.1,
+        description: 'Neural defect prediction with temporal constraints'
+    },
+    'chaos-engineering': {
+        baseTimeMs: 0.15,
+        complexityExponent: 0.4, // System state analysis
+        dataFactor: 2.0,
+        description: 'Chaos experiment planning and validation'
+    }
+};
+/**
+ * Machine Learning model for temporal prediction calibration
+ */
+class TemporalMLModel {
+    constructor() {
+        this.performances = new Map();
+        this.calibrationHistory = [];
+    }
+    /**
+     * Record actual performance for model calibration
+     */
+    recordPerformance(algorithmType, problemSize, actualTimeMs, dataComplexity) {
+        const performances = this.performances.get(algorithmType) || [];
+        const complexityFactor = this.calculateComplexityFactor(problemSize, actualTimeMs, dataComplexity, algorithmType);
+        performances.push({
+            algorithmType,
+            avgComputationTime: actualTimeMs,
+            complexityFactor,
+            accuracy: this.calculateAccuracy(algorithmType),
+            lastCalibrated: new Date()
+        });
+        // Keep only recent performances (last 100 measurements)
+        if (performances.length > 100) {
+            performances.shift();
+        }
+        this.performances.set(algorithmType, performances);
+    }
+    /**
+     * Predict computation time based on historical data
+     */
+    predictComputationTime(algorithmType, problemSize, dataComplexity, systemLoad) {
+        const model = ALGORITHM_MODELS[algorithmType];
+        if (!model) {
+            throw new Error(`Unknown algorithm type: ${algorithmType}`);
+        }
+        const performances = this.performances.get(algorithmType) || [];
+        if (performances.length === 0) {
+            // Use theoretical model
+            const baseTime = model.baseTimeMs * Math.pow(problemSize, model.complexityExponent);
+            const dataAdjustment = Math.pow(dataComplexity, model.dataFactor);
+            const loadAdjustment = 1 + systemLoad * 0.5;
+            return {
+                timeMs: baseTime * dataAdjustment * loadAdjustment,
+                confidence: 0.6 // Lower confidence without historical data
+            };
+        }
+        // Use machine learning regression
+        const prediction = this.performRegression(performances, problemSize, dataComplexity, systemLoad);
+        return prediction;
+    }
+    calculateComplexityFactor(problemSize, actualTime, dataComplexity, algorithmType) {
+        const model = ALGORITHM_MODELS[algorithmType];
+        const expectedTime = model.baseTimeMs * Math.pow(problemSize, model.complexityExponent);
+        return actualTime / Math.max(expectedTime, 0.001);
+    }
+    calculateAccuracy(algorithmType) {
+        const recentPredictions = this.calibrationHistory
+            .filter(h => h.algorithm === algorithmType)
+            .slice(-20); // Last 20 predictions
+        if (recentPredictions.length === 0)
+            return 1.0;
+        const errors = recentPredictions.map(p => Math.abs(p.predicted - p.actual) / Math.max(p.actual, 0.001));
+        const avgError = errors.reduce((sum, err) => sum + err, 0) / errors.length;
+        return Math.max(0, 1 - avgError);
+    }
+    performRegression(performances, problemSize, dataComplexity, systemLoad) {
+        // Simple weighted regression based on recency
+        let weightedTime = 0;
+        let totalWeight = 0;
+        const now = Date.now();
+        for (const perf of performances) {
+            const age = now - perf.lastCalibrated.getTime();
+            const weight = Math.exp(-age / (7 * 24 * 60 * 60 * 1000)); // Exponential decay over 7 days
+            // Adjust for complexity and load
+            const adjustedTime = perf.avgComputationTime *
+                Math.pow(dataComplexity, 0.3) *
+                (1 + systemLoad * 0.3);
+            weightedTime += adjustedTime * weight;
+            totalWeight += weight;
+        }
+        const predictedTime = totalWeight > 0 ? weightedTime / totalWeight : 0;
+        const confidence = Math.min(0.95, totalWeight / performances.length);
+        return { timeMs: predictedTime, confidence };
+    }
+    /**
+     * Calibrate model with actual measurement
+     */
+    calibrate(algorithmType, predicted, actual) {
+        this.calibrationHistory.push({
+            predicted,
+            actual,
+            timestamp: new Date(),
+            algorithm: algorithmType
+        });
+        // Maintain history size
+        if (this.calibrationHistory.length > 1000) {
+            this.calibrationHistory.shift();
+        }
+    }
+    /**
+     * Get model statistics
+     */
+    getModelStats() {
+        const algorithmsTracked = this.performances.size;
+        const totalMeasurements = Array.from(this.performances.values())
+            .reduce((sum, perfs) => sum + perfs.length, 0);
+        const allPerformances = Array.from(this.performances.values()).flat();
+        const avgAccuracy = allPerformances.length > 0
+            ? allPerformances.reduce((sum, p) => sum + p.accuracy, 0) / allPerformances.length
+            : 0;
+        const lastCalibration = this.calibrationHistory.length > 0
+            ? this.calibrationHistory[this.calibrationHistory.length - 1].timestamp
+            : null;
+        return {
+            algorithmsTracked,
+            totalMeasurements,
+            avgAccuracy,
+            lastCalibration
+        };
+    }
+}
+/**
+ * Temporal Advantage Predictor
+ */
+class TemporalPredictor {
+    constructor() {
+        this.lightSpeedKmMs = 299792.458; // km/ms
+        this.mlModel = new TemporalMLModel();
+    }
+    /**
+     * Predict temporal advantage for a given scenario
+     */
+    async predictTemporalAdvantage(input, scenarioName = 'trading') {
+        const scenario = exports.TEMPORAL_SCENARIOS.find(s => s.name === scenarioName) || exports.TEMPORAL_SCENARIOS[0];
+        // Calculate light travel time
+        const dataTransferTimeMs = scenario.distanceKm / this.lightSpeedKmMs;
+        // Predict computation time using ML model
+        const { timeMs: computationTimeMs, confidence } = this.mlModel.predictComputationTime(input.algorithmType, input.problemSize, input.dataComplexity, input.systemLoad);
+        // Calculate temporal advantage
+        const temporalAdvantageMs = dataTransferTimeMs - computationTimeMs;
+        const hasAdvantage = temporalAdvantageMs > 0;
+        // Generate optimization recommendations
+        const optimizationRecommendations = this.generateOptimizationRecommendations(input, computationTimeMs, dataTransferTimeMs, hasAdvantage);
+        return {
+            computationTimeMs,
+            dataTransferTimeMs,
+            temporalAdvantageMs,
+            hasAdvantage,
+            confidenceScore: confidence,
+            scenario,
+            optimizationRecommendations
+        };
+    }
+    /**
+     * Predict for multiple scenarios simultaneously
+     */
+    async predictMultipleScenarios(input) {
+        const predictions = [];
+        for (const scenario of exports.TEMPORAL_SCENARIOS) {
+            const prediction = await this.predictTemporalAdvantage(input, scenario.name);
+            predictions.push(prediction);
+        }
+        return predictions.sort((a, b) => b.temporalAdvantageMs - a.temporalAdvantageMs);
+    }
+    /**
+     * Validate temporal advantage with actual execution
+     */
+    async validatePrediction(input, scenarioName, actualExecutionTimeMs) {
+        const prediction = await this.predictTemporalAdvantage(input, scenarioName);
+        const error = Math.abs(prediction.computationTimeMs - actualExecutionTimeMs);
+        const predictionAccuracy = 1 - (error / Math.max(actualExecutionTimeMs, 0.001));
+        // Update ML model with actual data
+        this.mlModel.recordPerformance(input.algorithmType, input.problemSize, actualExecutionTimeMs, input.dataComplexity);
+        this.mlModel.calibrate(input.algorithmType, prediction.computationTimeMs, actualExecutionTimeMs);
+        const actualAdvantage = prediction.dataTransferTimeMs > actualExecutionTimeMs;
+        return {
+            predictionAccuracy: Math.max(0, predictionAccuracy),
+            actualAdvantage,
+            modelUpdated: true
+        };
+    }
+    /**
+     * Optimize algorithm parameters for temporal advantage
+     */
+    async optimizeForTemporalAdvantage(baseInput, targetScenario, constraints) {
+        let currentInput = { ...baseInput };
+        const optimizationSteps = [];
+        let bestAdvantage = -Infinity;
+        let bestInput = currentInput;
+        // Try different optimization strategies
+        const strategies = [
+            {
+                name: 'Reduce problem complexity',
+                modifier: (input) => ({
+                    ...input,
+                    problemSize: Math.max(10, input.problemSize * 0.8),
+                    dataComplexity: Math.max(0.1, input.dataComplexity * 0.9)
+                })
+            },
+            {
+                name: 'Optimize data complexity',
+                modifier: (input) => ({
+                    ...input,
+                    dataComplexity: Math.max(0.1, input.dataComplexity * 0.7)
+                })
+            },
+            {
+                name: 'Balance system load',
+                modifier: (input) => ({
+                    ...input,
+                    systemLoad: Math.max(0, Math.min(constraints.maxSystemLoad, input.systemLoad * 0.8))
+                })
+            }
+        ];
+        for (const strategy of strategies) {
+            const testInput = strategy.modifier(currentInput);
+            // Check if within constraints
+            const complexityIncrease = (testInput.problemSize * testInput.dataComplexity) /
+                (baseInput.problemSize * baseInput.dataComplexity);
+            if (complexityIncrease <= constraints.maxComplexityIncrease) {
+                const prediction = await this.predictTemporalAdvantage(testInput, targetScenario);
+                if (prediction.temporalAdvantageMs > bestAdvantage &&
+                    prediction.confidenceScore >= constraints.minAccuracy) {
+                    bestAdvantage = prediction.temporalAdvantageMs;
+                    bestInput = testInput;
+                    optimizationSteps.push(`Applied ${strategy.name}: gained ${prediction.temporalAdvantageMs.toFixed(2)}ms advantage`);
+                }
+            }
+        }
+        return {
+            optimizedInput: bestInput,
+            predictedAdvantage: bestAdvantage,
+            optimizationSteps
+        };
+    }
+    /**
+     * Generate performance benchmarks across problem sizes
+     */
+    async benchmarkTemporalAdvantage(algorithmType, problemSizes, scenario = 'trading') {
+        const results = [];
+        for (const size of problemSizes) {
+            const input = {
+                problemSize: size,
+                algorithmType,
+                dataComplexity: 1.0,
+                systemLoad: 0.5
+            };
+            const prediction = await this.predictTemporalAdvantage(input, scenario);
+            const efficiency = prediction.hasAdvantage
+                ? prediction.temporalAdvantageMs / prediction.computationTimeMs
+                : 0;
+            results.push({
+                problemSize: size,
+                computationTimeMs: prediction.computationTimeMs,
+                temporalAdvantageMs: prediction.temporalAdvantageMs,
+                efficiency
+            });
+        }
+        return results;
+    }
+    generateOptimizationRecommendations(input, computationTimeMs, dataTransferTimeMs, hasAdvantage) {
+        const recommendations = [];
+        if (!hasAdvantage) {
+            const deficit = computationTimeMs - dataTransferTimeMs;
+            recommendations.push(`Need to reduce computation time by ${deficit.toFixed(2)}ms to achieve temporal advantage`);
+            if (input.dataComplexity > 1.0) {
+                recommendations.push('Consider data preprocessing or dimensionality reduction to lower complexity');
+            }
+            if (input.systemLoad > 0.7) {
+                recommendations.push('High system load detected - consider load balancing or resource scaling');
+            }
+            recommendations.push('Apply Johnson-Lindenstrauss dimension reduction for O(log n) complexity');
+            recommendations.push('Use spectral sparsification to reduce matrix operations');
+        }
+        else {
+            const margin = dataTransferTimeMs - computationTimeMs;
+            recommendations.push(`Temporal advantage achieved with ${margin.toFixed(2)}ms margin`);
+            if (margin > dataTransferTimeMs * 0.5) {
+                recommendations.push('Large temporal margin - consider additional quality checks or optimizations');
+            }
+            recommendations.push('Consider caching results for similar future predictions');
+        }
+        // Algorithm-specific recommendations
+        switch (input.algorithmType) {
+            case 'test-generation':
+                recommendations.push('Use neural pattern caching to accelerate similar test generation');
+                break;
+            case 'coverage-optimization':
+                recommendations.push('Apply spectral graph theory for faster coverage matrix optimization');
+                break;
+            case 'defect-prediction':
+                recommendations.push('Leverage pre-trained models for transfer learning acceleration');
+                break;
+            case 'chaos-engineering':
+                recommendations.push('Use parallel chaos simulation for faster experiment validation');
+                break;
+        }
+        return recommendations;
+    }
+    /**
+     * Get comprehensive temporal analysis
+     */
+    async getTemporalAnalysis(input) {
+        const allScenarios = await this.predictMultipleScenarios(input);
+        const bestScenario = allScenarios[0];
+        const worstScenario = allScenarios[allScenarios.length - 1];
+        const averageAdvantage = allScenarios.reduce((sum, scenario) => sum + scenario.temporalAdvantageMs, 0) / allScenarios.length;
+        const recommendedOptimizations = this.generateOptimizationRecommendations(input, bestScenario.computationTimeMs, bestScenario.dataTransferTimeMs, bestScenario.hasAdvantage);
+        const modelStats = this.mlModel.getModelStats();
+        return {
+            allScenarios,
+            bestScenario,
+            worstScenario,
+            averageAdvantage,
+            recommendedOptimizations,
+            modelStats
+        };
+    }
+    /**
+     * Export model data for persistence
+     */
+    exportModelData() {
+        const stats = this.mlModel.getModelStats();
+        return JSON.stringify({
+            version: '1.0',
+            exportDate: new Date().toISOString(),
+            modelStats: stats,
+            scenarios: exports.TEMPORAL_SCENARIOS
+        });
+    }
+    /**
+     * Calculate light travel time for custom distances
+     */
+    static calculateLightTravelTime(distanceKm) {
+        const lightSpeedKmMs = 299792.458;
+        return distanceKm / lightSpeedKmMs;
+    }
+    /**
+     * Get algorithm complexity information
+     */
+    static getAlgorithmInfo() {
+        return ALGORITHM_MODELS;
+    }
+}
+exports.TemporalPredictor = TemporalPredictor;
+/**
+ * Factory function for creating temporal predictor
+ */
+function createTemporalPredictor() {
+    return new TemporalPredictor();
+}
+/**
+ * Utility functions for temporal calculations
+ */
+class TemporalUtils {
+    /**
+     * Convert different time units to milliseconds
+     */
+    static timeToMs(value, unit) {
+        switch (unit) {
+            case 'ns': return value / 1000000;
+            case 'μs': return value / 1000;
+            case 'ms': return value;
+            case 's': return value * 1000;
+            default: throw new Error(`Unknown time unit: ${unit}`);
+        }
+    }
+    /**
+     * Format temporal advantage for display
+     */
+    static formatTemporalAdvantage(advantageMs) {
+        if (Math.abs(advantageMs) < 1) {
+            return `${(advantageMs * 1000).toFixed(1)}μs`;
+        }
+        else if (Math.abs(advantageMs) < 1000) {
+            return `${advantageMs.toFixed(2)}ms`;
+        }
+        else {
+            return `${(advantageMs / 1000).toFixed(2)}s`;
+        }
+    }
+    /**
+     * Calculate speed of light delay for various distances
+     */
+    static getCommonDistances() {
+        const lightSpeedKmMs = 299792.458;
+        const distances = [
+            { name: 'Fiber optic cable (1km)', distanceKm: 1 },
+            { name: 'City to city (100km)', distanceKm: 100 },
+            { name: 'Cross-country (3000km)', distanceKm: 3000 },
+            { name: 'Trans-Pacific (10000km)', distanceKm: 10000 },
+            { name: 'Geostationary satellite', distanceKm: 35786 },
+            { name: 'Moon', distanceKm: 384400 }
+        ];
+        return distances.map(d => ({
+            ...d,
+            delayMs: d.distanceKm / lightSpeedKmMs
+        }));
+    }
+}
+exports.TemporalUtils = TemporalUtils;
+//# sourceMappingURL=temporalPredictor.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"temporalPredictor.js","sourceRoot":"","sources":["../../../src/utils/sublinear/temporalPredictor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AA6nBH,0DAEC;AA7lBD;;GAEG;AACU,QAAA,kBAAkB,GAAuB;IACpD;QACE,IAAI,EAAE,SAAS;QACf,WAAW,EAAE,+CAA+C;QAC5D,UAAU,EAAE,KAAK;QACjB,cAAc,EAAE,2DAA2D;KAC5E;IACD;QACE,IAAI,EAAE,WAAW;QACjB,WAAW,EAAE,2CAA2C;QACxD,UAAU,EAAE,KAAK;QACjB,cAAc,EAAE,4DAA4D;KAC7E;IACD;QACE,IAAI,EAAE,SAAS;QACf,WAAW,EAAE,6CAA6C;QAC1D,UAAU,EAAE,IAAI;QAChB,cAAc,EAAE,wDAAwD;KACzE;IACD;QACE,IAAI,EAAE,OAAO;QACb,WAAW,EAAE,8BAA8B;QAC3C,UAAU,EAAE,GAAG;QACf,cAAc,EAAE,oCAAoC;KACrD;IACD;QACE,IAAI,EAAE,QAAQ;QACd,WAAW,EAAE,iCAAiC;QAC9C,UAAU,EAAE,KAAK;QACjB,cAAc,EAAE,oCAAoC;KACrD;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,gBAAgB,GAAG;IACvB,iBAAiB,EAAE;QACjB,UAAU,EAAE,IAAI;QAChB,kBAAkB,EAAE,GAAG,EAAE,gCAAgC;QACzD,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,gDAAgD;KAC9D;IACD,uBAAuB,EAAE;QACvB,UAAU,EAAE,GAAG;QACf,kBAAkB,EAAE,IAAI,EAAE,wCAAwC;QAClE,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,wCAAwC;KACtD;IACD,mBAAmB,EAAE;QACnB,UAAU,EAAE,IAAI;QAChB,kBAAkB,EAAE,IAAI,EAAE,yBAAyB;QACnD,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,oDAAoD;KAClE;IACD,mBAAmB,EAAE;QACnB,UAAU,EAAE,IAAI;QAChB,kBAAkB,EAAE,GAAG,EAAE,wBAAwB;QACjD,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,0CAA0C;KACxD;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,eAAe;IAArB;QACU,iBAAY,GAAoC,IAAI,GAAG,EAAE,CAAC;QAC1D,uBAAkB,GAKrB,EAAE,CAAC;IAsLV,CAAC;IApLC;;OAEG;IACH,iBAAiB,CACf,aAAqB,EACrB,WAAmB,EACnB,YAAoB,EACpB,cAAsB;QAEtB,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAEhE,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CACrD,WAAW,EACX,YAAY,EACZ,cAAc,EACd,aAAa,CACd,CAAC;QAEF,YAAY,CAAC,IAAI,CAAC;YAChB,aAAa;YACb,kBAAkB,EAAE,YAAY;YAChC,gBAAgB;YAChB,QAAQ,EAAE,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC;YAC/C,cAAc,EAAE,IAAI,IAAI,EAAE;SAC3B,CAAC,CAAC;QAEH,wDAAwD;QACxD,IAAI,YAAY,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YAC9B,YAAY,CAAC,KAAK,EAAE,CAAC;QACvB,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,sBAAsB,CACpB,aAAqB,EACrB,WAAmB,EACnB,cAAsB,EACtB,UAAkB;QAElB,MAAM,KAAK,GAAG,gBAAgB,CAAC,aAA8C,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,2BAA2B,aAAa,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAEhE,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,wBAAwB;YACxB,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;YACpF,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;YAClE,MAAM,cAAc,GAAG,CAAC,GAAG,UAAU,GAAG,GAAG,CAAC;YAE5C,OAAO;gBACL,MAAM,EAAE,QAAQ,GAAG,cAAc,GAAG,cAAc;gBAClD,UAAU,EAAE,GAAG,CAAC,2CAA2C;aAC5D,CAAC;QACJ,CAAC;QAED,kCAAkC;QAClC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CACvC,YAAY,EACZ,WAAW,EACX,cAAc,EACd,UAAU,CACX,CAAC;QAEF,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,yBAAyB,CAC/B,WAAmB,EACnB,UAAkB,EAClB,cAAsB,EACtB,aAAqB;QAErB,MAAM,KAAK,GAAG,gBAAgB,CAAC,aAA8C,CAAC,CAAC;QAC/E,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAExF,OAAO,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAEO,iBAAiB,CAAC,aAAqB;QAC7C,MAAM,iBAAiB,GAAG,IAAI,CAAC,kBAAkB;aAC9C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,aAAa,CAAC;aAC1C,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB;QAErC,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAE/C,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CACvC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAC7D,CAAC;QAEF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC3E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;IACnC,CAAC;IAEO,iBAAiB,CACvB,YAAgC,EAChC,WAAmB,EACnB,cAAsB,EACtB,UAAkB;QAElB,8CAA8C;QAC9C,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,gCAAgC;YAE3F,iCAAiC;YACjC,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB;gBAC1C,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC;gBAC7B,CAAC,CAAC,GAAG,UAAU,GAAG,GAAG,CAAC,CAAC;YAEzB,YAAY,IAAI,YAAY,GAAG,MAAM,CAAC;YACtC,WAAW,IAAI,MAAM,CAAC;QACxB,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAErE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,SAAS,CACP,aAAqB,EACrB,SAAiB,EACjB,MAAc;QAEd,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAC3B,SAAS;YACT,MAAM;YACN,SAAS,EAAE,IAAI,IAAI,EAAE;YACrB,SAAS,EAAE,aAAa;SACzB,CAAC,CAAC;QAEH,wBAAwB;QACxB,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;YAC1C,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,aAAa;QAMX,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;QACjD,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;aAC7D,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEjD,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACtE,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC;YAC5C,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,eAAe,CAAC,MAAM;YAClF,CAAC,CAAC,CAAC,CAAC;QAEN,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;YACxD,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS;YACvE,CAAC,CAAC,IAAI,CAAC;QAET,OAAO;YACL,iBAAiB;YACjB,iBAAiB;YACjB,WAAW;YACX,eAAe;SAChB,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAI5B;QAFQ,mBAAc,GAAW,UAAU,CAAC,CAAC,QAAQ;QAGnD,IAAI,CAAC,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,wBAAwB,CAC5B,KAAsB,EACtB,eAAiE,SAAS;QAE1E,MAAM,QAAQ,GAAG,0BAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,IAAI,0BAAkB,CAAC,CAAC,CAAC,CAAC;QAEhG,8BAA8B;QAC9B,MAAM,kBAAkB,GAAG,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;QAErE,0CAA0C;QAC1C,MAAM,EAAE,MAAM,EAAE,iBAAiB,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,sBAAsB,CACnF,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,WAAW,EACjB,KAAK,CAAC,cAAc,EACpB,KAAK,CAAC,UAAU,CACjB,CAAC;QAEF,+BAA+B;QAC/B,MAAM,mBAAmB,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;QACnE,MAAM,YAAY,GAAG,mBAAmB,GAAG,CAAC,CAAC;QAE7C,wCAAwC;QACxC,MAAM,2BAA2B,GAAG,IAAI,CAAC,mCAAmC,CAC1E,KAAK,EACL,iBAAiB,EACjB,kBAAkB,EAClB,YAAY,CACb,CAAC;QAEF,OAAO;YACL,iBAAiB;YACjB,kBAAkB;YAClB,mBAAmB;YACnB,YAAY;YACZ,eAAe,EAAE,UAAU;YAC3B,QAAQ;YACR,2BAA2B;SAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,wBAAwB,CAAC,KAAsB;QACnD,MAAM,WAAW,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,QAAQ,IAAI,0BAAkB,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC7E,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,GAAG,CAAC,CAAC,mBAAmB,CAAC,CAAC;IACnF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CACtB,KAAsB,EACtB,YAAoB,EACpB,qBAA6B;QAM7B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAE5E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,iBAAiB,GAAG,qBAAqB,CAAC,CAAC;QAC7E,MAAM,kBAAkB,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC,CAAC;QAEhF,mCAAmC;QACnC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAC5B,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,WAAW,EACjB,qBAAqB,EACrB,KAAK,CAAC,cAAc,CACrB,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,SAAS,CACpB,KAAK,CAAC,aAAa,EACnB,UAAU,CAAC,iBAAiB,EAC5B,qBAAqB,CACtB,CAAC;QAEF,MAAM,eAAe,GAAG,UAAU,CAAC,kBAAkB,GAAG,qBAAqB,CAAC;QAE9E,OAAO;YACL,kBAAkB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,kBAAkB,CAAC;YACnD,eAAe;YACf,YAAY,EAAE,IAAI;SACnB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,4BAA4B,CAChC,SAA0B,EAC1B,cAAsB,EACtB,WAIC;QAMD,IAAI,YAAY,GAAG,EAAE,GAAG,SAAS,EAAE,CAAC;QACpC,MAAM,iBAAiB,GAAa,EAAE,CAAC;QACvC,IAAI,aAAa,GAAG,CAAC,QAAQ,CAAC;QAC9B,IAAI,SAAS,GAAG,YAAY,CAAC;QAE7B,wCAAwC;QACxC,MAAM,UAAU,GAAG;YACjB;gBACE,IAAI,EAAE,2BAA2B;gBACjC,QAAQ,EAAE,CAAC,KAAsB,EAAE,EAAE,CAAC,CAAC;oBACrC,GAAG,KAAK;oBACR,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC;oBAClD,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC;iBAC1D,CAAC;aACH;YACD;gBACE,IAAI,EAAE,0BAA0B;gBAChC,QAAQ,EAAE,CAAC,KAAsB,EAAE,EAAE,CAAC,CAAC;oBACrC,GAAG,KAAK;oBACR,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC;iBAC1D,CAAC;aACH;YACD;gBACE,IAAI,EAAE,qBAAqB;gBAC3B,QAAQ,EAAE,CAAC,KAAsB,EAAE,EAAE,CAAC,CAAC;oBACrC,GAAG,KAAK;oBACR,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,aAAa,EAAE,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;iBACrF,CAAC;aACH;SACF,CAAC;QAEF,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAElD,8BAA8B;YAC9B,MAAM,kBAAkB,GAAG,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,CAAC,cAAc,CAAC;gBAC3E,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;YAErD,IAAI,kBAAkB,IAAI,WAAW,CAAC,qBAAqB,EAAE,CAAC;gBAC5D,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;gBAElF,IAAI,UAAU,CAAC,mBAAmB,GAAG,aAAa;oBAC9C,UAAU,CAAC,eAAe,IAAI,WAAW,CAAC,WAAW,EAAE,CAAC;oBAC1D,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC;oBAC/C,SAAS,GAAG,SAAS,CAAC;oBACtB,iBAAiB,CAAC,IAAI,CAAC,WAAW,QAAQ,CAAC,IAAI,YAAY,UAAU,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;gBACtH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,cAAc,EAAE,SAAS;YACzB,kBAAkB,EAAE,aAAa;YACjC,iBAAiB;SAClB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,0BAA0B,CAC9B,aAA+C,EAC/C,YAAsB,EACtB,WAAmB,SAAS;QAO5B,MAAM,OAAO,GAAG,EAAE,CAAC;QAEnB,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,KAAK,GAAoB;gBAC7B,WAAW,EAAE,IAAI;gBACjB,aAAa;gBACb,cAAc,EAAE,GAAG;gBACnB,UAAU,EAAE,GAAG;aAChB,CAAC;YAEF,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAExE,MAAM,UAAU,GAAG,UAAU,CAAC,YAAY;gBACxC,CAAC,CAAC,UAAU,CAAC,mBAAmB,GAAG,UAAU,CAAC,iBAAiB;gBAC/D,CAAC,CAAC,CAAC,CAAC;YAEN,OAAO,CAAC,IAAI,CAAC;gBACX,WAAW,EAAE,IAAI;gBACjB,iBAAiB,EAAE,UAAU,CAAC,iBAAiB;gBAC/C,mBAAmB,EAAE,UAAU,CAAC,mBAAmB;gBACnD,UAAU;aACX,CAAC,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,mCAAmC,CACzC,KAAsB,EACtB,iBAAyB,EACzB,kBAA0B,EAC1B,YAAqB;QAErB,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,iBAAiB,GAAG,kBAAkB,CAAC;YACvD,eAAe,CAAC,IAAI,CAAC,sCAAsC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,kCAAkC,CAAC,CAAC;YAEjH,IAAI,KAAK,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC;gBAC/B,eAAe,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;YACtG,CAAC;YAED,IAAI,KAAK,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBAC3B,eAAe,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;YAClG,CAAC;YAED,eAAe,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;YAChG,eAAe,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;QAClF,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,kBAAkB,GAAG,iBAAiB,CAAC;YACtD,eAAe,CAAC,IAAI,CAAC,oCAAoC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAEvF,IAAI,MAAM,GAAG,kBAAkB,GAAG,GAAG,EAAE,CAAC;gBACtC,eAAe,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;YACtG,CAAC;YAED,eAAe,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;QAClF,CAAC;QAED,qCAAqC;QACrC,QAAQ,KAAK,CAAC,aAAa,EAAE,CAAC;YAC5B,KAAK,iBAAiB;gBACpB,eAAe,CAAC,IAAI,CAAC,kEAAkE,CAAC,CAAC;gBACzF,MAAM;YACR,KAAK,uBAAuB;gBAC1B,eAAe,CAAC,IAAI,CAAC,qEAAqE,CAAC,CAAC;gBAC5F,MAAM;YACR,KAAK,mBAAmB;gBACtB,eAAe,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;gBACvF,MAAM;YACR,KAAK,mBAAmB;gBACtB,eAAe,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;gBACvF,MAAM;QACV,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,KAAsB;QAQ9C,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;QAChE,MAAM,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE5D,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAC1C,CAAC,GAAG,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,mBAAmB,EAAE,CAAC,CACzD,GAAG,YAAY,CAAC,MAAM,CAAC;QAExB,MAAM,wBAAwB,GAAG,IAAI,CAAC,mCAAmC,CACvE,KAAK,EACL,YAAY,CAAC,iBAAiB,EAC9B,YAAY,CAAC,kBAAkB,EAC/B,YAAY,CAAC,YAAY,CAC1B,CAAC;QAEF,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;QAEhD,OAAO;YACL,YAAY;YACZ,YAAY;YACZ,aAAa;YACb,gBAAgB;YAChB,wBAAwB;YACxB,UAAU;SACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC,SAAS,CAAC;YACpB,OAAO,EAAE,KAAK;YACd,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACpC,UAAU,EAAE,KAAK;YACjB,SAAS,EAAE,0BAAkB;SAC9B,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,wBAAwB,CAAC,UAAkB;QAChD,MAAM,cAAc,GAAG,UAAU,CAAC;QAClC,OAAO,UAAU,GAAG,cAAc,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,gBAAgB;QACrB,OAAO,gBAAgB,CAAC;IAC1B,CAAC;CACF;AA/UD,8CA+UC;AAED;;GAEG;AACH,SAAgB,uBAAuB;IACrC,OAAO,IAAI,iBAAiB,EAAE,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAa,aAAa;IACxB;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,KAAa,EAAE,IAA8B;QAC3D,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG,OAAS,CAAC;YACpC,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,GAAG,IAAK,CAAC;YAChC,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC;YACxB,KAAK,GAAG,CAAC,CAAC,OAAO,KAAK,GAAG,IAAK,CAAC;YAC/B,OAAO,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,uBAAuB,CAAC,WAAmB;QAChD,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,OAAO,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;QAChD,CAAC;aAAM,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,IAAI,EAAE,CAAC;YACxC,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;QAC/C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,kBAAkB;QACvB,MAAM,cAAc,GAAG,UAAU,CAAC;QAClC,MAAM,SAAS,GAAG;YAChB,EAAE,IAAI,EAAE,yBAAyB,EAAE,UAAU,EAAE,CAAC,EAAE;YAClD,EAAE,IAAI,EAAE,sBAAsB,EAAE,UAAU,EAAE,GAAG,EAAE;YACjD,EAAE,IAAI,EAAE,wBAAwB,EAAE,UAAU,EAAE,IAAI,EAAE;YACpD,EAAE,IAAI,EAAE,yBAAyB,EAAE,UAAU,EAAE,KAAK,EAAE;YACtD,EAAE,IAAI,EAAE,yBAAyB,EAAE,UAAU,EAAE,KAAK,EAAE;YACtD,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE;SACrC,CAAC;QAEF,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC;YACJ,OAAO,EAAE,CAAC,CAAC,UAAU,GAAG,cAAc;SACvC,CAAC,CAAC,CAAC;IACN,CAAC;CACF;AA9CD,sCA8CC"}

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

@@ -0,0 +1,81 @@
+/**
+ * Test Selection with O(log n) complexity using Johnson-Lindenstrauss dimension reduction
+ * Implements the SPARC Phase 2 pseudocode for sublinear test selection
+ */
+export interface TestCase {
+    id: string;
+    name: string;
+    executionTime: number;
+    coverage: Set<string>;
+    riskScore: number;
+    dependencies: string[];
+    priority: 'low' | 'medium' | 'high' | 'critical';
+}
+export interface TestSelectionConfig {
+    maxTests: number;
+    targetCoverage: number;
+    timeConstraint: number;
+    distortionParameter: number;
+    sparsificationEps: number;
+}
+export interface SelectionResult {
+    selectedTests: TestCase[];
+    coverageAchieved: number;
+    estimatedTime: number;
+    optimizationRatio: number;
+    complexityMetrics: {
+        originalDimension: number;
+        reducedDimension: number;
+        compressionRatio: number;
+    };
+}
+/**
+ * Sublinear Test Selector implementing O(log n) complexity
+ */
+export declare class SublinearTestSelector {
+    private config;
+    private projector?;
+    constructor(config: TestSelectionConfig);
+    /**
+     * Select optimal tests using sublinear algorithms
+     * Time Complexity: O(log n) where n is number of tests
+     */
+    selectOptimalTests(tests: TestCase[], codeElements: string[]): Promise<SelectionResult>;
+    /**
+     * Calculate optimal dimension using Johnson-Lindenstrauss lemma
+     * d = O(log n / ε²)
+     */
+    private calculateOptimalDimension;
+    /**
+     * Build binary coverage matrix: M[i][j] = 1 if test i covers element j
+     */
+    private buildCoverageMatrix;
+    /**
+     * Sublinear solver using iterative methods
+     */
+    private solveTrueSublinear;
+    private calculateGradient;
+    private calculateThreshold;
+    private softThreshold;
+    private calculateActualCoverage;
+    private augmentCoverageIfNeeded;
+    /**
+     * Benchmark the complexity of test selection
+     */
+    benchmarkComplexity(testCounts: number[]): Promise<{
+        results: Array<{
+            testCount: number;
+            timeMs: number;
+            logN: number;
+        }>;
+        isSublinear: boolean;
+    }>;
+    private generateMockTests;
+    private generateMockCodeElements;
+    private verifySublinearGrowth;
+}
+/**
+ * Factory function for creating test selector with default configuration
+ */
+export declare function createTestSelector(options?: Partial<TestSelectionConfig>): SublinearTestSelector;
+//# sourceMappingURL=testSelector.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"testSelector.d.ts","sourceRoot":"","sources":["../../../src/utils/sublinear/testSelector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,CAAC;CAClD;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,mBAAmB,EAAE,MAAM,CAAC;IAC5B,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,aAAa,EAAE,QAAQ,EAAE,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE;QACjB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,gBAAgB,EAAE,MAAM,CAAC;QACzB,gBAAgB,EAAE,MAAM,CAAC;KAC1B,CAAC;CACH;AAuED;;GAEG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,MAAM,CAAsB;IACpC,OAAO,CAAC,SAAS,CAAC,CAAgC;gBAEtC,MAAM,EAAE,mBAAmB;IAIvC;;;OAGG;IACG,kBAAkB,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC;IAwD7F;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IAcjC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAY3B;;OAEG;YACW,kBAAkB;IAkDhC,OAAO,CAAC,iBAAiB;IA+BzB,OAAO,CAAC,kBAAkB;IAS1B,OAAO,CAAC,aAAa;IAMrB,OAAO,CAAC,uBAAuB;YASjB,uBAAuB;IAqCrC;;OAEG;IACG,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QACvD,OAAO,EAAE,KAAK,CAAC;YAAE,SAAS,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QACpE,WAAW,EAAE,OAAO,CAAC;KACtB,CAAC;IAwBF,OAAO,CAAC,iBAAiB;IAyBzB,OAAO,CAAC,wBAAwB;IAIhC,OAAO,CAAC,qBAAqB;CAgB9B;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,GAAE,OAAO,CAAC,mBAAmB,CAAM,GAAG,qBAAqB,CAUpG"}