agentic-qe 2.6.1 → 2.6.2

package/dist/routing/ComplexityClassifier.js

@@ -0,0 +1,567 @@
+"use strict";
+/**
+ * ComplexityClassifier - ML-Based Task Complexity Classification
+ *
+ * Uses machine learning techniques to classify task complexity for optimal LLM routing.
+ * Improves upon heuristic-based classification with learning from routing outcomes.
+ *
+ * Features:
+ * - Feature extraction from LLM completion options
+ * - Weighted scoring with trainable parameters
+ * - Learning from routing history and outcomes
+ * - Confidence scoring for classification decisions
+ * - Persistent memory integration for cross-session learning
+ *
+ * @module routing/ComplexityClassifier
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ComplexityClassifier = exports.TaskComplexity = void 0;
+const Logger_1 = require("../utils/Logger");
+/**
+ * Task complexity levels
+ */
+var TaskComplexity;
+(function (TaskComplexity) {
+    TaskComplexity["SIMPLE"] = "simple";
+    TaskComplexity["MODERATE"] = "moderate";
+    TaskComplexity["COMPLEX"] = "complex";
+    TaskComplexity["VERY_COMPLEX"] = "very_complex"; // Advanced analysis, architectural design (> 10000 chars)
+})(TaskComplexity || (exports.TaskComplexity = TaskComplexity = {}));
+/**
+ * ComplexityClassifier - ML-based task complexity classification
+ *
+ * Classifies LLM tasks into complexity levels using feature extraction
+ * and trainable weighted scoring. Learns from routing outcomes to improve
+ * classification accuracy over time.
+ *
+ * @example
+ * ```typescript
+ * const classifier = new ComplexityClassifier({
+ *   enableLearning: true,
+ *   learningRate: 0.1
+ * });
+ *
+ * const complexity = classifier.classifyTask(options);
+ * // After execution
+ * classifier.recordOutcome({
+ *   features: classifier.extractFeatures(options),
+ *   selectedComplexity: complexity,
+ *   actualOutcome: { success: true, latency: 1500, cost: 0.001 }
+ * });
+ * ```
+ */
+class ComplexityClassifier {
+    constructor(config = {}) {
+        this.logger = Logger_1.Logger.getInstance();
+        this.config = {
+            debug: config.debug ?? false,
+            enableLearning: config.enableLearning ?? true,
+            learningRate: config.learningRate ?? 0.05,
+            maxHistorySize: config.maxHistorySize ?? 500,
+            initialWeights: config.initialWeights ?? {},
+            initialThresholds: config.initialThresholds ?? {}
+        };
+        // Initialize default weights (can be tuned through learning)
+        this.weights = {
+            contentLength: 0.25,
+            tokenCount: 0.30,
+            messageCount: 0.10,
+            codeBlocks: 0.15,
+            keywordComplexity: 0.10,
+            promptEntropy: 0.05,
+            contextWindowUsage: 0.03,
+            multimodal: 0.02,
+            systemPrompt: 0.05,
+            ...config.initialWeights
+        };
+        // Normalize weights to sum to 1.0
+        this.normalizeWeights();
+        // Initialize default thresholds (tunable)
+        this.thresholds = {
+            simple: 0.25, // Score < 0.25 = SIMPLE
+            moderate: 0.50, // Score < 0.50 = MODERATE
+            complex: 0.75, // Score < 0.75 = COMPLEX
+            veryComplex: 0.75, // Score >= 0.75 = VERY_COMPLEX
+            ...config.initialThresholds
+        };
+        this.routingHistory = [];
+        this.classificationCount = 0;
+        this.confidenceScores = [];
+        this.logger.debug('ComplexityClassifier initialized', {
+            weights: this.weights,
+            thresholds: this.thresholds,
+            learningEnabled: this.config.enableLearning
+        });
+    }
+    /**
+     * Classify task complexity using ML-based feature extraction and scoring
+     *
+     * @param options - LLM completion options to analyze
+     * @returns Classified complexity level
+     */
+    classifyTask(options) {
+        const features = this.extractFeatures(options);
+        const score = this.calculateComplexityScore(features);
+        const complexity = this.scoreToComplexity(score);
+        const confidence = this.calculateConfidence(features, score);
+        this.classificationCount++;
+        this.confidenceScores.push(confidence);
+        // Keep only last 100 confidence scores
+        if (this.confidenceScores.length > 100) {
+            this.confidenceScores.shift();
+        }
+        if (this.config.debug) {
+            this.logger.debug('Task classified', {
+                complexity,
+                score: score.toFixed(3),
+                confidence: confidence.toFixed(3),
+                features: {
+                    contentLength: features.contentLength,
+                    tokens: features.estimatedTokenCount,
+                    hasCode: features.hasCodeBlocks,
+                    keywordScore: features.keywordComplexity.toFixed(2)
+                }
+            });
+        }
+        return complexity;
+    }
+    /**
+     * Extract features from LLM completion options
+     *
+     * @param options - LLM completion options
+     * @returns Extracted task features
+     */
+    extractFeatures(options) {
+        // Extract all text content from messages
+        const allContent = this.extractAllContent(options);
+        const contentLength = allContent.length;
+        // Estimate token count (rough approximation: 1 token ≈ 4 chars)
+        const estimatedTokenCount = Math.ceil(contentLength / 4);
+        // Message count
+        const messageCount = options.messages.length;
+        // Check for code blocks
+        const hasCodeBlocks = /```[\s\S]*?```|`[^`]+`/.test(allContent);
+        // Calculate keyword complexity
+        const keywordComplexity = this.calculateKeywordComplexity(allContent);
+        // Calculate prompt entropy (vocabulary diversity)
+        const promptEntropy = this.calculatePromptEntropy(allContent);
+        // Context window usage (assuming 8k context window)
+        const contextWindowUsage = Math.min(estimatedTokenCount / 8192, 1.0);
+        // Check for multimodal content
+        const hasMultimodal = options.messages.some(msg => Array.isArray(msg.content) && msg.content.some(c => c.type === 'image'));
+        // Requested max tokens
+        const requestedMaxTokens = options.maxTokens || 0;
+        // System prompt complexity
+        const systemPromptComplexity = this.calculateSystemPromptComplexity(options);
+        return {
+            contentLength,
+            estimatedTokenCount,
+            messageCount,
+            hasCodeBlocks,
+            keywordComplexity,
+            promptEntropy,
+            contextWindowUsage,
+            hasMultimodal,
+            requestedMaxTokens,
+            systemPromptComplexity
+        };
+    }
+    /**
+     * Record routing outcome for learning
+     *
+     * @param entry - Routing history entry with outcome
+     */
+    recordOutcome(entry) {
+        if (!this.config.enableLearning) {
+            return;
+        }
+        this.routingHistory.push({
+            ...entry,
+            timestamp: entry.timestamp || new Date()
+        });
+        // Keep history size bounded
+        if (this.routingHistory.length > this.config.maxHistorySize) {
+            this.routingHistory.shift();
+        }
+        // Update weights based on outcome
+        this.updateWeightsFromOutcome(entry);
+        if (this.config.debug) {
+            this.logger.debug('Routing outcome recorded', {
+                complexity: entry.selectedComplexity,
+                success: entry.actualOutcome.success,
+                latency: entry.actualOutcome.latency,
+                historySize: this.routingHistory.length
+            });
+        }
+    }
+    /**
+     * Get classification confidence (0-1)
+     *
+     * Confidence is based on:
+     * - How clearly the score falls into a complexity bucket
+     * - Historical accuracy of similar classifications
+     *
+     * @returns Confidence score (0-1)
+     */
+    getClassificationConfidence() {
+        if (this.confidenceScores.length === 0) {
+            return 0.5; // Default moderate confidence
+        }
+        // Average recent confidence scores
+        const recentScores = this.confidenceScores.slice(-10);
+        return recentScores.reduce((sum, score) => sum + score, 0) / recentScores.length;
+    }
+    /**
+     * Get current feature weights
+     *
+     * @returns Current feature weights
+     */
+    getWeights() {
+        return { ...this.weights };
+    }
+    /**
+     * Get current complexity thresholds
+     *
+     * @returns Current thresholds
+     */
+    getThresholds() {
+        return { ...this.thresholds };
+    }
+    /**
+     * Get routing history
+     *
+     * @returns Copy of routing history
+     */
+    getHistory() {
+        return [...this.routingHistory];
+    }
+    /**
+     * Get classification statistics
+     *
+     * @returns Statistics about classifications and learning
+     */
+    getStatistics() {
+        const successCount = this.routingHistory.filter(e => e.actualOutcome.success).length;
+        const successRate = this.routingHistory.length > 0
+            ? successCount / this.routingHistory.length
+            : 0;
+        const distribution = {
+            [TaskComplexity.SIMPLE]: 0,
+            [TaskComplexity.MODERATE]: 0,
+            [TaskComplexity.COMPLEX]: 0,
+            [TaskComplexity.VERY_COMPLEX]: 0
+        };
+        this.routingHistory.forEach(entry => {
+            distribution[entry.selectedComplexity]++;
+        });
+        return {
+            totalClassifications: this.classificationCount,
+            historySize: this.routingHistory.length,
+            averageConfidence: this.getClassificationConfidence(),
+            successRate,
+            complexityDistribution: distribution
+        };
+    }
+    /**
+     * Extract all text content from messages
+     */
+    extractAllContent(options) {
+        const parts = [];
+        // System prompts
+        if (options.system) {
+            parts.push(...options.system.map(s => s.text));
+        }
+        // Messages
+        options.messages.forEach(msg => {
+            if (typeof msg.content === 'string') {
+                parts.push(msg.content);
+            }
+            else {
+                parts.push(...msg.content.filter(c => c.type === 'text').map(c => c.text || ''));
+            }
+        });
+        return parts.join('\n');
+    }
+    /**
+     * Calculate keyword complexity score (0-1)
+     *
+     * Analyzes presence of complex technical keywords and patterns
+     */
+    calculateKeywordComplexity(content) {
+        const lowerContent = content.toLowerCase();
+        const complexPatterns = [
+            // Architecture & Design
+            { pattern: /architect|design\s+pattern|microservice|distributed/gi, weight: 0.15 },
+            { pattern: /scale|performance|optimization|bottleneck/gi, weight: 0.12 },
+            { pattern: /refactor|technical\s+debt|legacy/gi, weight: 0.10 },
+            // Advanced Programming
+            { pattern: /algorithm|complexity|o\(|big\s+o/gi, weight: 0.14 },
+            { pattern: /async|concurrent|parallel|thread/gi, weight: 0.11 },
+            { pattern: /generic|polymorphism|inheritance/gi, weight: 0.09 },
+            // Analysis & Problem Solving
+            { pattern: /analyze|investigate|debug|diagnose/gi, weight: 0.13 },
+            { pattern: /optimize|improve|enhance/gi, weight: 0.08 },
+            { pattern: /security|vulnerability|exploit/gi, weight: 0.08 }
+        ];
+        let score = 0;
+        let maxPossibleScore = 0;
+        complexPatterns.forEach(({ pattern, weight }) => {
+            maxPossibleScore += weight;
+            const matches = content.match(pattern);
+            if (matches) {
+                // Diminishing returns for multiple matches
+                const matchScore = Math.min(matches.length / 5, 1.0);
+                score += weight * matchScore;
+            }
+        });
+        return maxPossibleScore > 0 ? Math.min(score / maxPossibleScore, 1.0) : 0;
+    }
+    /**
+     * Calculate prompt entropy (vocabulary diversity)
+     *
+     * Higher entropy = more diverse vocabulary = potentially more complex
+     */
+    calculatePromptEntropy(content) {
+        // Tokenize into words
+        const words = content.toLowerCase()
+            .replace(/[^\w\s]/g, ' ')
+            .split(/\s+/)
+            .filter(w => w.length > 3); // Filter short words
+        if (words.length === 0)
+            return 0;
+        // Calculate word frequency
+        const frequency = new Map();
+        words.forEach(word => {
+            frequency.set(word, (frequency.get(word) || 0) + 1);
+        });
+        // Calculate Shannon entropy
+        let entropy = 0;
+        const totalWords = words.length;
+        frequency.forEach(count => {
+            const probability = count / totalWords;
+            entropy -= probability * Math.log2(probability);
+        });
+        // Normalize to 0-1 (max entropy for reasonable text is ~10)
+        return Math.min(entropy / 10, 1.0);
+    }
+    /**
+     * Calculate system prompt complexity
+     */
+    calculateSystemPromptComplexity(options) {
+        if (!options.system || options.system.length === 0) {
+            return 0;
+        }
+        const systemText = options.system.map(s => s.text).join('\n');
+        const length = systemText.length;
+        // Longer, more detailed system prompts = higher complexity
+        if (length > 5000)
+            return 1.0;
+        if (length > 2000)
+            return 0.7;
+        if (length > 500)
+            return 0.4;
+        return 0.2;
+    }
+    /**
+     * Calculate weighted complexity score (0-1)
+     */
+    calculateComplexityScore(features) {
+        let score = 0;
+        // Content length contribution (normalize to 0-1)
+        const lengthScore = Math.min(features.contentLength / 10000, 1.0);
+        score += this.weights.contentLength * lengthScore;
+        // Token count contribution
+        const tokenScore = Math.min(features.estimatedTokenCount / 4096, 1.0);
+        score += this.weights.tokenCount * tokenScore;
+        // Message count contribution
+        const messageScore = Math.min(features.messageCount / 10, 1.0);
+        score += this.weights.messageCount * messageScore;
+        // Code blocks contribution
+        score += this.weights.codeBlocks * (features.hasCodeBlocks ? 1.0 : 0.0);
+        // Keyword complexity
+        score += this.weights.keywordComplexity * features.keywordComplexity;
+        // Prompt entropy
+        score += this.weights.promptEntropy * features.promptEntropy;
+        // Context window usage
+        score += this.weights.contextWindowUsage * features.contextWindowUsage;
+        // Multimodal content
+        score += this.weights.multimodal * (features.hasMultimodal ? 1.0 : 0.0);
+        // System prompt complexity
+        score += this.weights.systemPrompt * features.systemPromptComplexity;
+        return Math.min(score, 1.0);
+    }
+    /**
+     * Convert complexity score to complexity level
+     */
+    scoreToComplexity(score) {
+        if (score < this.thresholds.simple) {
+            return TaskComplexity.SIMPLE;
+        }
+        if (score < this.thresholds.moderate) {
+            return TaskComplexity.MODERATE;
+        }
+        if (score < this.thresholds.complex) {
+            return TaskComplexity.COMPLEX;
+        }
+        return TaskComplexity.VERY_COMPLEX;
+    }
+    /**
+     * Calculate confidence for a classification
+     */
+    calculateConfidence(features, score) {
+        // Calculate distance from threshold boundaries
+        const thresholdValues = [
+            0,
+            this.thresholds.simple,
+            this.thresholds.moderate,
+            this.thresholds.complex,
+            1.0
+        ];
+        // Find which threshold range we're in
+        let minDistance = 1.0;
+        for (let i = 0; i < thresholdValues.length - 1; i++) {
+            const lower = thresholdValues[i];
+            const upper = thresholdValues[i + 1];
+            if (score >= lower && score < upper) {
+                const rangeSize = upper - lower;
+                const distanceFromLower = score - lower;
+                const distanceFromUpper = upper - score;
+                const minDistanceInRange = Math.min(distanceFromLower, distanceFromUpper);
+                // Normalize to 0-1 (closer to center of range = higher confidence)
+                minDistance = (rangeSize / 2 - Math.abs(score - (lower + upper) / 2)) / (rangeSize / 2);
+                break;
+            }
+        }
+        // Confidence is higher when we're clearly in the middle of a range
+        return Math.max(0.3, Math.min(minDistance, 1.0));
+    }
+    /**
+     * Update weights based on routing outcome (gradient descent style)
+     */
+    updateWeightsFromOutcome(entry) {
+        // Simple learning: adjust weights based on success/failure
+        const { success, latency } = entry.actualOutcome;
+        const features = entry.features;
+        // If failed, or high latency, this might indicate misclassification
+        const performanceScore = success ? (latency < 5000 ? 1.0 : 0.7) : 0.3;
+        // Calculate expected complexity based on actual performance
+        let expectedComplexity;
+        if (performanceScore < 0.5) {
+            // Poor performance - might need higher complexity
+            expectedComplexity = this.incrementComplexity(entry.selectedComplexity);
+        }
+        else if (performanceScore > 0.9 && latency < 1000) {
+            // Excellent performance - might be over-classified
+            expectedComplexity = this.decrementComplexity(entry.selectedComplexity);
+        }
+        else {
+            // Good performance - classification was correct
+            return; // No weight update needed
+        }
+        // If expected != selected, adjust weights
+        if (expectedComplexity !== entry.selectedComplexity) {
+            this.adjustWeights(features, expectedComplexity, entry.selectedComplexity);
+        }
+    }
+    /**
+     * Increment complexity level
+     */
+    incrementComplexity(complexity) {
+        const levels = [
+            TaskComplexity.SIMPLE,
+            TaskComplexity.MODERATE,
+            TaskComplexity.COMPLEX,
+            TaskComplexity.VERY_COMPLEX
+        ];
+        const index = levels.indexOf(complexity);
+        return index < levels.length - 1 ? levels[index + 1] : complexity;
+    }
+    /**
+     * Decrement complexity level
+     */
+    decrementComplexity(complexity) {
+        const levels = [
+            TaskComplexity.SIMPLE,
+            TaskComplexity.MODERATE,
+            TaskComplexity.COMPLEX,
+            TaskComplexity.VERY_COMPLEX
+        ];
+        const index = levels.indexOf(complexity);
+        return index > 0 ? levels[index - 1] : complexity;
+    }
+    /**
+     * Adjust weights to better match expected complexity
+     */
+    adjustWeights(features, expected, actual) {
+        const expectedScore = this.complexityToTargetScore(expected);
+        const actualScore = this.complexityToTargetScore(actual);
+        const error = expectedScore - actualScore;
+        // Gradient descent: adjust weights proportional to features and error
+        const lr = this.config.learningRate;
+        // Normalize features to 0-1 for weight updates
+        const normalizedFeatures = {
+            contentLength: Math.min(features.contentLength / 10000, 1.0),
+            tokenCount: Math.min(features.estimatedTokenCount / 4096, 1.0),
+            messageCount: Math.min(features.messageCount / 10, 1.0),
+            codeBlocks: features.hasCodeBlocks ? 1.0 : 0.0,
+            keywordComplexity: features.keywordComplexity,
+            promptEntropy: features.promptEntropy,
+            contextWindowUsage: features.contextWindowUsage,
+            multimodal: features.hasMultimodal ? 1.0 : 0.0,
+            systemPrompt: features.systemPromptComplexity
+        };
+        // Update weights (gradient descent)
+        this.weights.contentLength += lr * error * normalizedFeatures.contentLength;
+        this.weights.tokenCount += lr * error * normalizedFeatures.tokenCount;
+        this.weights.messageCount += lr * error * normalizedFeatures.messageCount;
+        this.weights.codeBlocks += lr * error * normalizedFeatures.codeBlocks;
+        this.weights.keywordComplexity += lr * error * normalizedFeatures.keywordComplexity;
+        this.weights.promptEntropy += lr * error * normalizedFeatures.promptEntropy;
+        this.weights.contextWindowUsage += lr * error * normalizedFeatures.contextWindowUsage;
+        this.weights.multimodal += lr * error * normalizedFeatures.multimodal;
+        this.weights.systemPrompt += lr * error * normalizedFeatures.systemPrompt;
+        // Normalize weights to sum to 1.0
+        this.normalizeWeights();
+        if (this.config.debug) {
+            this.logger.debug('Weights updated from outcome', {
+                expected,
+                actual,
+                error: error.toFixed(3),
+                newWeights: {
+                    contentLength: this.weights.contentLength.toFixed(3),
+                    tokenCount: this.weights.tokenCount.toFixed(3),
+                    codeBlocks: this.weights.codeBlocks.toFixed(3)
+                }
+            });
+        }
+    }
+    /**
+     * Convert complexity to target score for learning
+     */
+    complexityToTargetScore(complexity) {
+        switch (complexity) {
+            case TaskComplexity.SIMPLE:
+                return 0.15;
+            case TaskComplexity.MODERATE:
+                return 0.40;
+            case TaskComplexity.COMPLEX:
+                return 0.65;
+            case TaskComplexity.VERY_COMPLEX:
+                return 0.90;
+        }
+    }
+    /**
+     * Normalize weights to sum to 1.0
+     */
+    normalizeWeights() {
+        const sum = Object.values(this.weights).reduce((a, b) => a + b, 0);
+        if (sum > 0) {
+            Object.keys(this.weights).forEach(key => {
+                this.weights[key] /= sum;
+            });
+        }
+    }
+}
+exports.ComplexityClassifier = ComplexityClassifier;
+//# sourceMappingURL=ComplexityClassifier.js.map

package/dist/routing/ComplexityClassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ComplexityClassifier.js","sourceRoot":"","sources":["../../src/routing/ComplexityClassifier.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;AAGH,4CAAyC;AAEzC;;GAEG;AACH,IAAY,cAKX;AALD,WAAY,cAAc;IACxB,mCAAiB,CAAA;IACjB,uCAAqB,CAAA;IACrB,qCAAmB,CAAA;IACnB,+CAA6B,CAAA,CAAC,0DAA0D;AAC1F,CAAC,EALW,cAAc,8BAAd,cAAc,QAKzB;AAgGD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,oBAAoB;IAS/B,YAAY,SAAqC,EAAE;QACjD,IAAI,CAAC,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG;YACZ,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,KAAK;YAC5B,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,IAAI;YAC7C,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,IAAI;YACzC,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,GAAG;YAC5C,cAAc,EAAE,MAAM,CAAC,cAAc,IAAI,EAAE;YAC3C,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,EAAE;SAClD,CAAC;QAEF,6DAA6D;QAC7D,IAAI,CAAC,OAAO,GAAG;YACb,aAAa,EAAE,IAAI;YACnB,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,IAAI;YAChB,iBAAiB,EAAE,IAAI;YACvB,aAAa,EAAE,IAAI;YACnB,kBAAkB,EAAE,IAAI;YACxB,UAAU,EAAE,IAAI;YAChB,YAAY,EAAE,IAAI;YAClB,GAAG,MAAM,CAAC,cAAc;SACzB,CAAC;QAEF,kCAAkC;QAClC,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAExB,0CAA0C;QAC1C,IAAI,CAAC,UAAU,GAAG;YAChB,MAAM,EAAE,IAAI,EAAO,wBAAwB;YAC3C,QAAQ,EAAE,IAAI,EAAK,0BAA0B;YAC7C,OAAO,EAAE,IAAI,EAAM,yBAAyB;YAC5C,WAAW,EAAE,IAAI,EAAE,+BAA+B;YAClD,GAAG,MAAM,CAAC,iBAAiB;SAC5B,CAAC;QAEF,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAE3B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE;YACpD,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,eAAe,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc;SAC5C,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,OAA6B;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAE7D,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEvC,uCAAuC;QACvC,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACvC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAChC,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE;gBACnC,UAAU;gBACV,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBACvB,UAAU,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;gBACjC,QAAQ,EAAE;oBACR,aAAa,EAAE,QAAQ,CAAC,aAAa;oBACrC,MAAM,EAAE,QAAQ,CAAC,mBAAmB;oBACpC,OAAO,EAAE,QAAQ,CAAC,aAAa;oBAC/B,YAAY,EAAE,QAAQ,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;iBACpD;aACF,CAAC,CAAC;QACL,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,OAA6B;QAC3C,yCAAyC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACnD,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC;QAExC,gEAAgE;QAChE,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QAEzD,gBAAgB;QAChB,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;QAE7C,wBAAwB;QACxB,MAAM,aAAa,GAAG,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEhE,+BAA+B;QAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,0BAA0B,CAAC,UAAU,CAAC,CAAC;QAEtE,kDAAkD;QAClD,MAAM,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;QAE9D,oDAAoD;QACpD,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAmB,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAErE,+BAA+B;QAC/B,MAAM,aAAa,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAChD,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CACxE,CAAC;QAEF,uBAAuB;QACvB,MAAM,kBAAkB,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;QAElD,2BAA2B;QAC3B,MAAM,sBAAsB,GAAG,IAAI,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAE7E,OAAO;YACL,aAAa;YACb,mBAAmB;YACnB,YAAY;YACZ,aAAa;YACb,iBAAiB;YACjB,aAAa;YACb,kBAAkB;YAClB,aAAa;YACb,kBAAkB;YAClB,sBAAsB;SACvB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,KAA0B;QACtC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YAChC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YACvB,GAAG,KAAK;YACR,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE;SACzC,CAAC,CAAC;QAEH,4BAA4B;QAC5B,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YAC5D,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC9B,CAAC;QAED,kCAAkC;QAClC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;QAErC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0BAA0B,EAAE;gBAC5C,UAAU,EAAE,KAAK,CAAC,kBAAkB;gBACpC,OAAO,EAAE,KAAK,CAAC,aAAa,CAAC,OAAO;gBACpC,OAAO,EAAE,KAAK,CAAC,aAAa,CAAC,OAAO;gBACpC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,MAAM;aACxC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,2BAA2B;QACzB,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvC,OAAO,GAAG,CAAC,CAAC,8BAA8B;QAC5C,CAAC;QAED,mCAAmC;QACnC,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QACtD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;IACnF,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,aAAa;QACX,OAAO,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,aAAa;QAOX,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACrF,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;YAChD,CAAC,CAAC,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM;YAC3C,CAAC,CAAC,CAAC,CAAC;QAEN,MAAM,YAAY,GAAmC;YACnD,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC;SACjC,CAAC;QAEF,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YAClC,YAAY,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,oBAAoB,EAAE,IAAI,CAAC,mBAAmB;YAC9C,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,MAAM;YACvC,iBAAiB,EAAE,IAAI,CAAC,2BAA2B,EAAE;YACrD,WAAW;YACX,sBAAsB,EAAE,YAAY;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAA6B;QACrD,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,iBAAiB;QACjB,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,WAAW;QACX,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YAC7B,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACpC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC;YACnF,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACK,0BAA0B,CAAC,OAAe;QAChD,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;QAE3C,MAAM,eAAe,GAAG;YACtB,wBAAwB;YACxB,EAAE,OAAO,EAAE,uDAAuD,EAAE,MAAM,EAAE,IAAI,EAAE;YAClF,EAAE,OAAO,EAAE,6CAA6C,EAAE,MAAM,EAAE,IAAI,EAAE;YACxE,EAAE,OAAO,EAAE,oCAAoC,EAAE,MAAM,EAAE,IAAI,EAAE;YAE/D,uBAAuB;YACvB,EAAE,OAAO,EAAE,oCAAoC,EAAE,MAAM,EAAE,IAAI,EAAE;YAC/D,EAAE,OAAO,EAAE,oCAAoC,EAAE,MAAM,EAAE,IAAI,EAAE;YAC/D,EAAE,OAAO,EAAE,oCAAoC,EAAE,MAAM,EAAE,IAAI,EAAE;YAE/D,6BAA6B;YAC7B,EAAE,OAAO,EAAE,sCAAsC,EAAE,MAAM,EAAE,IAAI,EAAE;YACjE,EAAE,OAAO,EAAE,4BAA4B,EAAE,MAAM,EAAE,IAAI,EAAE;YACvD,EAAE,OAAO,EAAE,kCAAkC,EAAE,MAAM,EAAE,IAAI,EAAE;SAC9D,CAAC;QAEF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,eAAe,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE;YAC9C,gBAAgB,IAAI,MAAM,CAAC;YAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,OAAO,EAAE,CAAC;gBACZ,2CAA2C;gBAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;gBACrD,KAAK,IAAI,MAAM,GAAG,UAAU,CAAC;YAC/B,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,gBAAgB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED;;;;OAIG;IACK,sBAAsB,CAAC,OAAe;QAC5C,sBAAsB;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE;aAChC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;aACxB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,qBAAqB;QAEnD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEjC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACnB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,4BAA4B;QAC5B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QAEhC,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACxB,MAAM,WAAW,GAAG,KAAK,GAAG,UAAU,CAAC;YACvC,OAAO,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,4DAA4D;QAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,+BAA+B,CAAC,OAA6B;QACnE,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QAEjC,2DAA2D;QAC3D,IAAI,MAAM,GAAG,IAAI;YAAE,OAAO,GAAG,CAAC;QAC9B,IAAI,MAAM,GAAG,IAAI;YAAE,OAAO,GAAG,CAAC;QAC9B,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,GAAG,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,QAAsB;QACrD,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,iDAAiD;QACjD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,GAAG,KAAK,EAAE,GAAG,CAAC,CAAC;QAClE,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,GAAG,WAAW,CAAC;QAElD,2BAA2B;QAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,mBAAmB,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QACtE,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,UAAU,CAAC;QAE9C,6BAA6B;QAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QAC/D,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,YAAY,CAAC;QAElD,2BAA2B;QAC3B,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAExE,qBAAqB;QACrB,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,iBAAiB,GAAG,QAAQ,CAAC,iBAAiB,CAAC;QAErE,iBAAiB;QACjB,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,GAAG,QAAQ,CAAC,aAAa,CAAC;QAE7D,uBAAuB;QACvB,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,kBAAkB,GAAG,QAAQ,CAAC,kBAAkB,CAAC;QAEvE,qBAAqB;QACrB,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAExE,2BAA2B;QAC3B,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,GAAG,QAAQ,CAAC,sBAAsB,CAAC;QAErE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,KAAa;QACrC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;YACnC,OAAO,cAAc,CAAC,MAAM,CAAC;QAC/B,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACrC,OAAO,cAAc,CAAC,QAAQ,CAAC;QACjC,CAAC;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YACpC,OAAO,cAAc,CAAC,OAAO,CAAC;QAChC,CAAC;QACD,OAAO,cAAc,CAAC,YAAY,CAAC;IACrC,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,QAAsB,EAAE,KAAa;QAC/D,+CAA+C;QAC/C,MAAM,eAAe,GAAG;YACtB,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,MAAM;YACtB,IAAI,CAAC,UAAU,CAAC,QAAQ;YACxB,IAAI,CAAC,UAAU,CAAC,OAAO;YACvB,GAAG;SACJ,CAAC;QAEF,sCAAsC;QACtC,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAErC,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC;gBAChC,MAAM,iBAAiB,GAAG,KAAK,GAAG,KAAK,CAAC;gBACxC,MAAM,iBAAiB,GAAG,KAAK,GAAG,KAAK,CAAC;gBACxC,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;gBAE1E,mEAAmE;gBACnE,WAAW,GAAG,CAAC,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBACxF,MAAM;YACR,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,KAA0B;QACzD,2DAA2D;QAC3D,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,aAAa,CAAC;QACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAEhC,oEAAoE;QACpE,MAAM,gBAAgB,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAEtE,4DAA4D;QAC5D,IAAI,kBAAkC,CAAC;QACvC,IAAI,gBAAgB,GAAG,GAAG,EAAE,CAAC;YAC3B,kDAAkD;YAClD,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,gBAAgB,GAAG,GAAG,IAAI,OAAO,GAAG,IAAI,EAAE,CAAC;YACpD,mDAAmD;YACnD,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,gDAAgD;YAChD,OAAO,CAAC,0BAA0B;QACpC,CAAC;QAED,0CAA0C;QAC1C,IAAI,kBAAkB,KAAK,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACpD,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,UAA0B;QACpD,MAAM,MAAM,GAAG;YACb,cAAc,CAAC,MAAM;YACrB,cAAc,CAAC,QAAQ;YACvB,cAAc,CAAC,OAAO;YACtB,cAAc,CAAC,YAAY;SAC5B,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACzC,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpE,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,UAA0B;QACpD,MAAM,MAAM,GAAG;YACb,cAAc,CAAC,MAAM;YACrB,cAAc,CAAC,QAAQ;YACvB,cAAc,CAAC,OAAO;YACtB,cAAc,CAAC,YAAY;SAC5B,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACzC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IACpD,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,QAAsB,EACtB,QAAwB,EACxB,MAAsB;QAEtB,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,aAAa,GAAG,WAAW,CAAC;QAE1C,sEAAsE;QACtE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;QAEpC,+CAA+C;QAC/C,MAAM,kBAAkB,GAAG;YACzB,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,GAAG,KAAK,EAAE,GAAG,CAAC;YAC5D,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,mBAAmB,GAAG,IAAI,EAAE,GAAG,CAAC;YAC9D,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,YAAY,GAAG,EAAE,EAAE,GAAG,CAAC;YACvD,UAAU,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;YAC9C,iBAAiB,EAAE,QAAQ,CAAC,iBAAiB;YAC7C,aAAa,EAAE,QAAQ,CAAC,aAAa;YACrC,kBAAkB,EAAE,QAAQ,CAAC,kBAAkB;YAC/C,UAAU,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;YAC9C,YAAY,EAAE,QAAQ,CAAC,sBAAsB;SAC9C,CAAC;QAEF,oCAAoC;QACpC,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,aAAa,CAAC;QAC5E,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC;QACtE,IAAI,CAAC,OAAO,CAAC,YAAY,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,YAAY,CAAC;QAC1E,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC;QACtE,IAAI,CAAC,OAAO,CAAC,iBAAiB,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,iBAAiB,CAAC;QACpF,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,aAAa,CAAC;QAC5E,IAAI,CAAC,OAAO,CAAC,kBAAkB,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,kBAAkB,CAAC;QACtF,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC;QACtE,IAAI,CAAC,OAAO,CAAC,YAAY,IAAI,EAAE,GAAG,KAAK,GAAG,kBAAkB,CAAC,YAAY,CAAC;QAE1E,kCAAkC;QAClC,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAExB,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE;gBAChD,QAAQ;gBACR,MAAM;gBACN,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBACvB,UAAU,EAAE;oBACV,aAAa,EAAE,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;oBACpD,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC9C,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;iBAC/C;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,UAA0B;QACxD,QAAQ,UAAU,EAAE,CAAC;YACnB,KAAK,cAAc,CAAC,MAAM;gBACxB,OAAO,IAAI,CAAC;YACd,KAAK,cAAc,CAAC,QAAQ;gBAC1B,OAAO,IAAI,CAAC;YACd,KAAK,cAAc,CAAC,OAAO;gBACzB,OAAO,IAAI,CAAC;YACd,KAAK,cAAc,CAAC,YAAY;gBAC9B,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnE,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBACrC,IAAI,CAAC,OAAe,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACpC,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF;AAnmBD,oDAmmBC"}