agentic-qe 2.3.5 → 2.5.0

package/dist/core/optimization/RecursiveOptimizer.js

@@ -0,0 +1,509 @@
+"use strict";
+/**
+ * RecursiveOptimizer - TRM-based recursive optimization with binary cache
+ *
+ * Implements iterative refinement optimization using Test-time Reasoning
+ * & Metacognition (TRM) patterns. Features:
+ * - Recursive quality improvement with convergence detection
+ * - Binary cache for fast pattern retrieval
+ * - SONA integration for adaptive learning
+ * - EWC++ for preventing catastrophic forgetting
+ *
+ * @module core/optimization/RecursiveOptimizer
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecursiveOptimizer = void 0;
+exports.createTestGenerationOptimizer = createTestGenerationOptimizer;
+exports.createCodeAnalysisOptimizer = createCodeAnalysisOptimizer;
+const BinaryMetadataCache_1 = require("../cache/BinaryMetadataCache");
+const Logger_1 = require("../../utils/Logger");
+const ruvllm_loader_1 = require("../../utils/ruvllm-loader");
+/**
+ * RecursiveOptimizer - TRM-based recursive optimization
+ *
+ * Uses iterative refinement with convergence detection to optimize
+ * outputs. Patterns are cached for fast retrieval on similar inputs.
+ */
+class RecursiveOptimizer {
+    constructor(config) {
+        this.cache = new Map();
+        this.initialized = false;
+        // Statistics
+        this.stats = {
+            totalOptimizations: 0,
+            cacheHits: 0,
+            cacheMisses: 0,
+            avgIterations: 0,
+            avgQuality: 0,
+            avgDuration: 0,
+            convergenceRate: 0,
+        };
+        /**
+         * Default text quality evaluator using heuristic metrics.
+         *
+         * @warning All metrics currently use PLACEHOLDER HEURISTICS.
+         * See individual measure* methods for details on what proper implementations
+         * would look like. These heuristics are sufficient for testing TRM iteration
+         * mechanics but should not be used for production quality assessment.
+         *
+         * Available metrics:
+         * - 'coherence': Sentence structure analysis (heuristic)
+         * - 'coverage': Unique word ratio (heuristic)
+         * - 'diversity': Vocabulary variety (heuristic)
+         * - 'composite': Weighted combination (40% coherence, 30% coverage, 30% diversity)
+         *
+         * @todo M4 milestone: Replace with ML-based evaluation using ruvLLM
+         */
+        this.defaultTextEvaluator = (text, metric) => {
+            switch (metric) {
+                case 'coherence':
+                    return this.measureCoherence(text);
+                case 'coverage':
+                    return this.measureCoverage(text);
+                case 'diversity':
+                    return this.measureDiversity(text);
+                case 'composite':
+                    return (this.measureCoherence(text) * 0.4 +
+                        this.measureCoverage(text) * 0.3 +
+                        this.measureDiversity(text) * 0.3);
+                default:
+                    return this.measureCoherence(text);
+            }
+        };
+        this.logger = Logger_1.Logger.getInstance();
+        this.config = {
+            maxIterations: config?.maxIterations ?? 7,
+            convergenceThreshold: config?.convergenceThreshold ?? 0.95,
+            qualityMetric: config?.qualityMetric ?? 'coherence',
+            minQuality: config?.minQuality ?? 0.5,
+            enableCache: config?.enableCache ?? true,
+            cachePath: config?.cachePath ?? '.aqe/cache/optimizer.bin',
+            enableSONA: config?.enableSONA ?? true,
+            loraRank: config?.loraRank ?? 8,
+            similarityThreshold: config?.similarityThreshold ?? 0.85,
+        };
+    }
+    /**
+     * Initialize the optimizer
+     */
+    async initialize() {
+        if (this.initialized) {
+            this.logger.warn('RecursiveOptimizer already initialized');
+            return;
+        }
+        try {
+            // Load ruvLLM if SONA enabled
+            if (this.config.enableSONA) {
+                const ruvllmModule = (0, ruvllm_loader_1.loadRuvLLM)();
+                if (ruvllmModule) {
+                    this.ruvllm = new ruvllmModule.RuvLLM({ learningEnabled: true });
+                    this.sonaCoordinator = new ruvllmModule.SonaCoordinator();
+                    this.logger.info('SONA components loaded for RecursiveOptimizer');
+                }
+                else {
+                    this.logger.warn('RuvLLM not available, SONA disabled');
+                }
+            }
+            this.initialized = true;
+            this.logger.info('RecursiveOptimizer initialized', {
+                maxIterations: this.config.maxIterations,
+                convergenceThreshold: this.config.convergenceThreshold,
+                qualityMetric: this.config.qualityMetric,
+                enableCache: this.config.enableCache,
+                enableSONA: this.config.enableSONA,
+            });
+        }
+        catch (error) {
+            this.logger.warn('Failed to load ruvLLM, using fallback mode', {
+                error: error.message,
+            });
+            this.initialized = true;
+        }
+    }
+    /**
+     * Optimize an output using recursive refinement
+     *
+     * @param initial - Initial output to optimize
+     * @param refine - Function to refine the output in each iteration
+     * @param evaluate - Function to evaluate output quality
+     * @param options - Override configuration options
+     * @returns Optimization result
+     */
+    async optimize(initial, refine, evaluate, options) {
+        this.ensureInitialized();
+        const startTime = Date.now();
+        const effectiveConfig = { ...this.config, ...options };
+        const qualityHistory = [];
+        // Check cache first
+        if (effectiveConfig.enableCache) {
+            const cached = this.checkCache(initial);
+            if (cached) {
+                this.stats.cacheHits++;
+                this.logger.debug('Cache hit for optimization', { patternId: cached.result.patternId });
+                return cached.result;
+            }
+            this.stats.cacheMisses++;
+        }
+        // Initial quality evaluation
+        let current = initial;
+        let quality = evaluate(current, effectiveConfig.qualityMetric);
+        const initialQuality = quality;
+        qualityHistory.push(quality);
+        this.logger.debug('Starting optimization', {
+            initialQuality,
+            metric: effectiveConfig.qualityMetric,
+            maxIterations: effectiveConfig.maxIterations,
+        });
+        // Iterative refinement loop
+        let converged = false;
+        let iteration = 0;
+        for (iteration = 1; iteration < effectiveConfig.maxIterations; iteration++) {
+            // Refine the output
+            const refined = await refine(current, iteration, quality);
+            // Evaluate new quality
+            const newQuality = evaluate(refined, effectiveConfig.qualityMetric);
+            const improvement = newQuality - quality;
+            qualityHistory.push(newQuality);
+            this.logger.debug(`Iteration ${iteration}`, {
+                quality: newQuality,
+                improvement,
+                converged: improvement < (1 - effectiveConfig.convergenceThreshold),
+            });
+            // Check convergence
+            if (improvement < (1 - effectiveConfig.convergenceThreshold)) {
+                converged = true;
+                this.logger.info('Optimization converged', {
+                    iterations: iteration,
+                    finalQuality: newQuality,
+                    improvement: newQuality - initialQuality,
+                });
+                break;
+            }
+            current = refined;
+            quality = newQuality;
+        }
+        const duration = Date.now() - startTime;
+        // Create result
+        const result = {
+            output: current,
+            quality,
+            iterations: iteration,
+            converged,
+            qualityHistory,
+            duration,
+            metadata: {
+                metric: effectiveConfig.qualityMetric,
+                initialQuality,
+                improvement: quality - initialQuality,
+                avgIterationTime: duration / iteration,
+                cacheHit: false,
+            },
+        };
+        // Cache the result
+        if (effectiveConfig.enableCache && quality >= effectiveConfig.minQuality) {
+            result.patternId = await this.cacheResult(initial, result);
+        }
+        // Track trajectory in SONA
+        if (this.sonaCoordinator && this.config.enableSONA) {
+            await this.trackOptimizationTrajectory(initial, result);
+        }
+        // Update statistics
+        this.updateStats(result);
+        return result;
+    }
+    /**
+     * Optimize with default text quality evaluation
+     */
+    async optimizeText(initial, refine, options) {
+        return this.optimize(initial, refine, this.defaultTextEvaluator, options);
+    }
+    /**
+     * Batch optimize multiple outputs
+     */
+    async optimizeBatch(items, refine, evaluate, options) {
+        this.ensureInitialized();
+        if (options?.parallel) {
+            // Parallel optimization
+            return Promise.all(items.map((item) => this.optimize(item, refine, evaluate, options)));
+        }
+        // Sequential optimization
+        const results = [];
+        for (const item of items) {
+            results.push(await this.optimize(item, refine, evaluate, options));
+        }
+        return results;
+    }
+    /**
+     * Get optimizer statistics
+     */
+    getStats() {
+        return { ...this.stats };
+    }
+    /**
+     * Get cache statistics
+     */
+    getCacheStats() {
+        const entries = Array.from(this.cache.values());
+        const now = Date.now();
+        return {
+            entries: this.cache.size,
+            hitRate: this.stats.cacheHits / Math.max(this.stats.cacheHits + this.stats.cacheMisses, 1),
+            avgAccessCount: entries.length > 0
+                ? entries.reduce((sum, e) => sum + e.accessCount, 0) / entries.length
+                : 0,
+            oldestEntry: entries.length > 0
+                ? now - Math.min(...entries.map((e) => e.createdAt))
+                : 0,
+            newestEntry: entries.length > 0
+                ? now - Math.max(...entries.map((e) => e.createdAt))
+                : 0,
+        };
+    }
+    /**
+     * Clear the optimization cache
+     */
+    clearCache() {
+        this.cache.clear();
+        this.logger.info('Optimization cache cleared');
+    }
+    /**
+     * Reset optimizer statistics
+     */
+    resetStats() {
+        this.stats = {
+            totalOptimizations: 0,
+            cacheHits: 0,
+            cacheMisses: 0,
+            avgIterations: 0,
+            avgQuality: 0,
+            avgDuration: 0,
+            convergenceRate: 0,
+        };
+    }
+    // === Private Helpers ===
+    ensureInitialized() {
+        if (!this.initialized) {
+            throw new Error('RecursiveOptimizer not initialized. Call initialize() first.');
+        }
+    }
+    checkCache(input) {
+        const hash = this.hashInput(input);
+        const entry = this.cache.get(hash);
+        if (entry) {
+            entry.accessCount++;
+            entry.lastAccessed = Date.now();
+            return entry;
+        }
+        return null;
+    }
+    async cacheResult(input, result) {
+        const hash = this.hashInput(input);
+        const inputText = typeof input === 'string' ? input : JSON.stringify(input);
+        const outputText = typeof result.output === 'string'
+            ? result.output
+            : JSON.stringify(result.output);
+        // Generate embeddings
+        const inputEmb = this.generateEmbedding(inputText);
+        const outputEmb = this.generateEmbedding(outputText);
+        // Create TRM pattern
+        const pattern = (0, BinaryMetadataCache_1.createTRMPatternEntry)(inputText, outputText, inputEmb, outputEmb, {
+            quality: result.quality,
+            qualityMetric: result.metadata.metric,
+            iterations: result.iterations,
+            converged: result.converged,
+            confidence: result.quality,
+            avgIterationLatency: result.metadata.avgIterationTime,
+        });
+        // Store in cache
+        const entry = {
+            input,
+            inputHash: hash,
+            pattern,
+            result: { ...result, patternId: pattern.id },
+            createdAt: Date.now(),
+            accessCount: 1,
+            lastAccessed: Date.now(),
+        };
+        this.cache.set(hash, entry);
+        return pattern.id;
+    }
+    async trackOptimizationTrajectory(input, result) {
+        if (!this.sonaCoordinator)
+            return;
+        try {
+            const ruvllmModule = (0, ruvllm_loader_1.loadRuvLLM)();
+            if (!ruvllmModule)
+                return;
+            const inputText = typeof input === 'string' ? input : JSON.stringify(input);
+            const outputText = typeof result.output === 'string'
+                ? result.output
+                : JSON.stringify(result.output);
+            const trajectory = new ruvllmModule.TrajectoryBuilder()
+                .startStep('query', inputText)
+                .endStep(outputText, result.quality)
+                .complete(result.converged ? 'success' : 'partial');
+            this.sonaCoordinator.recordTrajectory(trajectory);
+        }
+        catch (error) {
+            this.logger.debug('Trajectory tracking failed', { error: error.message });
+        }
+    }
+    updateStats(result) {
+        const n = this.stats.totalOptimizations;
+        this.stats.totalOptimizations++;
+        // Running averages
+        this.stats.avgIterations = (this.stats.avgIterations * n + result.iterations) / (n + 1);
+        this.stats.avgQuality = (this.stats.avgQuality * n + result.quality) / (n + 1);
+        this.stats.avgDuration = (this.stats.avgDuration * n + result.duration) / (n + 1);
+        // Convergence rate
+        const convergedCount = this.stats.convergenceRate * n + (result.converged ? 1 : 0);
+        this.stats.convergenceRate = convergedCount / (n + 1);
+    }
+    hashInput(input) {
+        const str = typeof input === 'string' ? input : JSON.stringify(input);
+        // Simple hash function
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            const char = str.charCodeAt(i);
+            hash = ((hash << 5) - hash) + char;
+            hash = hash & hash;
+        }
+        return `opt-${hash.toString(16)}`;
+    }
+    /**
+     * Generates embeddings for text input.
+     *
+     * When ruvLLM is available, uses proper transformer-based embeddings.
+     * Falls back to a simple character-based heuristic when ruvLLM is unavailable.
+     *
+     * @warning The fallback implementation is a PLACEHOLDER HEURISTIC.
+     * The character-based embedding:
+     * - Maps character codes to 768-dimensional space
+     * - Normalizes to unit magnitude
+     * - Does NOT capture semantic meaning
+     *
+     * This fallback is only used when:
+     * - ruvLLM native module fails to load
+     * - Running in test environment without ruvLLM server
+     *
+     * Production usage should always have ruvLLM available for proper embeddings.
+     */
+    generateEmbedding(text) {
+        // Use ruvLLM if available - proper transformer-based embeddings
+        if (this.ruvllm) {
+            try {
+                return Array.from(this.ruvllm.embed(text));
+            }
+            catch {
+                // Fallback to simple embedding on error
+            }
+        }
+        // HEURISTIC FALLBACK: Simple deterministic embedding
+        // This does NOT capture semantic meaning - only for testing/development
+        const embedding = new Array(768).fill(0);
+        for (let i = 0; i < text.length; i++) {
+            const idx = i % 768;
+            embedding[idx] += text.charCodeAt(i) / 256;
+        }
+        const magnitude = Math.sqrt(embedding.reduce((sum, v) => sum + v * v, 0));
+        return embedding.map((v) => v / (magnitude || 1));
+    }
+    /**
+     * HEURISTIC: Measures text coherence using simple sentence structure analysis.
+     *
+     * @warning This is a PLACEHOLDER HEURISTIC, not a proper ML-based evaluation.
+     * Current implementation uses:
+     * - Average sentence length (normalized to 0-1)
+     * - Sentence count (normalized to 0-1)
+     *
+     * A proper implementation would use:
+     * - Transformer-based coherence models (e.g., sentence embeddings + cosine similarity)
+     * - Discourse structure analysis
+     * - Named entity consistency tracking
+     * - Coreference resolution scoring
+     *
+     * @todo Replace with ML-based coherence scoring in M4
+     */
+    measureCoherence(text) {
+        const sentences = text.split(/[.!?]+/).filter((s) => s.trim().length > 0);
+        if (sentences.length === 0)
+            return 0;
+        const avgSentenceLength = text.length / sentences.length;
+        const normalizedLength = Math.min(avgSentenceLength / 100, 1.0);
+        const sentenceCount = Math.min(sentences.length / 10, 1.0);
+        return (normalizedLength + sentenceCount) / 2;
+    }
+    /**
+     * HEURISTIC: Measures text coverage using unique word ratio.
+     *
+     * @warning This is a PLACEHOLDER HEURISTIC, not a proper ML-based evaluation.
+     * Current implementation uses:
+     * - Ratio of unique words to total words
+     *
+     * A proper implementation would use:
+     * - Topic modeling (LDA, BERTopic) to measure topic coverage
+     * - Information density metrics
+     * - Semantic role coverage analysis
+     * - Requirement traceability scoring
+     *
+     * @todo Replace with ML-based coverage analysis in M4
+     */
+    measureCoverage(text) {
+        const words = text.toLowerCase().split(/\s+/);
+        const uniqueWords = new Set(words);
+        if (words.length === 0)
+            return 0;
+        return Math.min(uniqueWords.size / words.length, 1.0);
+    }
+    /**
+     * HEURISTIC: Measures text diversity using vocabulary variety.
+     *
+     * @warning This is a PLACEHOLDER HEURISTIC, not a proper ML-based evaluation.
+     * Current implementation uses:
+     * - Ratio of unique words (>3 chars) with 2x scaling
+     *
+     * A proper implementation would use:
+     * - Type-token ratio with smoothing
+     * - Lexical diversity indices (MTLD, HD-D, vocd-D)
+     * - N-gram entropy measures
+     * - Semantic embedding cluster analysis
+     *
+     * @todo Replace with ML-based diversity metrics in M4
+     */
+    measureDiversity(text) {
+        const words = text.toLowerCase().split(/\s+/).filter((w) => w.length > 3);
+        const uniqueWords = new Set(words);
+        if (words.length === 0)
+            return 0;
+        return Math.min((uniqueWords.size / words.length) * 2, 1.0);
+    }
+}
+exports.RecursiveOptimizer = RecursiveOptimizer;
+/**
+ * Create a pre-configured RecursiveOptimizer for test generation
+ */
+function createTestGenerationOptimizer() {
+    return new RecursiveOptimizer({
+        maxIterations: 5,
+        convergenceThreshold: 0.9,
+        qualityMetric: 'composite',
+        minQuality: 0.6,
+        enableCache: true,
+        enableSONA: true,
+    });
+}
+/**
+ * Create a pre-configured RecursiveOptimizer for code analysis
+ */
+function createCodeAnalysisOptimizer() {
+    return new RecursiveOptimizer({
+        maxIterations: 3,
+        convergenceThreshold: 0.85,
+        qualityMetric: 'coverage',
+        minQuality: 0.7,
+        enableCache: true,
+        enableSONA: false, // Faster for code analysis
+    });
+}
+//# sourceMappingURL=RecursiveOptimizer.js.map

package/dist/core/optimization/RecursiveOptimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RecursiveOptimizer.js","sourceRoot":"","sources":["../../../src/core/optimization/RecursiveOptimizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAqpBH,sEASC;AAKD,kEASC;AArqBD,sEAAuF;AACvF,+CAA4C;AAC5C,6DAImC;AAwFnC;;;;;GAKG;AACH,MAAa,kBAAkB;IAqB7B,YAAY,MAAiC;QAlBrC,UAAK,GAAiD,IAAI,GAAG,EAAE,CAAC;QAChE,gBAAW,GAAG,KAAK,CAAC;QAE5B,aAAa;QACL,UAAK,GAAG;YACd,kBAAkB,EAAE,CAAC;YACrB,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,aAAa,EAAE,CAAC;YAChB,UAAU,EAAE,CAAC;YACb,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;SACnB,CAAC;QA2aF;;;;;;;;;;;;;;;WAeG;QACK,yBAAoB,GAAG,CAAC,IAAY,EAAE,MAAc,EAAU,EAAE;YACtE,QAAQ,MAAM,EAAE,CAAC;gBACf,KAAK,WAAW;oBACd,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACrC,KAAK,UAAU;oBACb,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;gBACpC,KAAK,WAAW;oBACd,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACrC,KAAK,WAAW;oBACd,OAAO,CACL,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG;wBACjC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,GAAG;wBAChC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG,CAClC,CAAC;gBACJ;oBACE,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACvC,CAAC;QACH,CAAC,CAAC;QArcA,IAAI,CAAC,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG;YACZ,aAAa,EAAE,MAAM,EAAE,aAAa,IAAI,CAAC;YACzC,oBAAoB,EAAE,MAAM,EAAE,oBAAoB,IAAI,IAAI;YAC1D,aAAa,EAAE,MAAM,EAAE,aAAa,IAAI,WAAW;YACnD,UAAU,EAAE,MAAM,EAAE,UAAU,IAAI,GAAG;YACrC,WAAW,EAAE,MAAM,EAAE,WAAW,IAAI,IAAI;YACxC,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,0BAA0B;YAC1D,UAAU,EAAE,MAAM,EAAE,UAAU,IAAI,IAAI;YACtC,QAAQ,EAAE,MAAM,EAAE,QAAQ,IAAI,CAAC;YAC/B,mBAAmB,EAAE,MAAM,EAAE,mBAAmB,IAAI,IAAI;SACzD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;YAC3D,OAAO;QACT,CAAC;QAED,IAAI,CAAC;YACH,8BAA8B;YAC9B,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;gBAC3B,MAAM,YAAY,GAAG,IAAA,0BAAU,GAAE,CAAC;gBAClC,IAAI,YAAY,EAAE,CAAC;oBACjB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC;oBACjE,IAAI,CAAC,eAAe,GAAG,IAAI,YAAY,CAAC,eAAe,EAAE,CAAC;oBAC1D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;gBACpE,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;YAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,gCAAgC,EAAE;gBACjD,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;gBACxC,oBAAoB,EAAE,IAAI,CAAC,MAAM,CAAC,oBAAoB;gBACtD,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;gBACxC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;gBACpC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,UAAU;aACnC,CAAC,CAAC;QAEL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,4CAA4C,EAAE;gBAC7D,KAAK,EAAG,KAAe,CAAC,OAAO;aAChC,CAAC,CAAC;YACH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,QAAQ,CACZ,OAAU,EACV,MAA2B,EAC3B,QAA6B,EAC7B,OAA2C;QAE3C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC;QACvD,MAAM,cAAc,GAAa,EAAE,CAAC;QAEpC,oBAAoB;QACpB,IAAI,eAAe,CAAC,WAAW,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC;gBACvB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,4BAA4B,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBACxF,OAAO,MAAM,CAAC,MAA+B,CAAC;YAChD,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC3B,CAAC;QAED,6BAA6B;QAC7B,IAAI,OAAO,GAAG,OAAO,CAAC;QACtB,IAAI,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,aAAa,CAAC,CAAC;QAC/D,MAAM,cAAc,GAAG,OAAO,CAAC;QAC/B,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE7B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE;YACzC,cAAc;YACd,MAAM,EAAE,eAAe,CAAC,aAAa;YACrC,aAAa,EAAE,eAAe,CAAC,aAAa;SAC7C,CAAC,CAAC;QAEH,4BAA4B;QAC5B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,eAAe,CAAC,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;YAC3E,oBAAoB;YACpB,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAE1D,uBAAuB;YACvB,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,aAAa,CAAC,CAAC;YACpE,MAAM,WAAW,GAAG,UAAU,GAAG,OAAO,CAAC;YACzC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAEhC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,aAAa,SAAS,EAAE,EAAE;gBAC1C,OAAO,EAAE,UAAU;gBACnB,WAAW;gBACX,SAAS,EAAE,WAAW,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC,oBAAoB,CAAC;aACpE,CAAC,CAAC;YAEH,oBAAoB;YACpB,IAAI,WAAW,GAAG,CAAC,CAAC,GAAG,eAAe,CAAC,oBAAoB,CAAC,EAAE,CAAC;gBAC7D,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,wBAAwB,EAAE;oBACzC,UAAU,EAAE,SAAS;oBACrB,YAAY,EAAE,UAAU;oBACxB,WAAW,EAAE,UAAU,GAAG,cAAc;iBACzC,CAAC,CAAC;gBACH,MAAM;YACR,CAAC;YAED,OAAO,GAAG,OAAO,CAAC;YAClB,OAAO,GAAG,UAAU,CAAC;QACvB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAExC,gBAAgB;QAChB,MAAM,MAAM,GAA0B;YACpC,MAAM,EAAE,OAAO;YACf,OAAO;YACP,UAAU,EAAE,SAAS;YACrB,SAAS;YACT,cAAc;YACd,QAAQ;YACR,QAAQ,EAAE;gBACR,MAAM,EAAE,eAAe,CAAC,aAAa;gBACrC,cAAc;gBACd,WAAW,EAAE,OAAO,GAAG,cAAc;gBACrC,gBAAgB,EAAE,QAAQ,GAAG,SAAS;gBACtC,QAAQ,EAAE,KAAK;aAChB;SACF,CAAC;QAEF,mBAAmB;QACnB,IAAI,eAAe,CAAC,WAAW,IAAI,OAAO,IAAI,eAAe,CAAC,UAAU,EAAE,CAAC;YACzE,MAAM,CAAC,SAAS,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;QAED,2BAA2B;QAC3B,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YACnD,MAAM,IAAI,CAAC,2BAA2B,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC1D,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,OAAe,EACf,MAAgC,EAChC,OAA2C;QAE3C,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC;IAC5E,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,KAAU,EACV,MAA2B,EAC3B,QAA6B,EAC7B,OAAoE;QAEpE,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,IAAI,OAAO,EAAE,QAAQ,EAAE,CAAC;YACtB,wBAAwB;YACxB,OAAO,OAAO,CAAC,GAAG,CAChB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CACpE,CAAC;QACJ,CAAC;QAED,0BAA0B;QAC1B,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,aAAa;QAOX,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACxB,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;YAC1F,cAAc,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;gBAChC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM;gBACrE,CAAC,CAAC,CAAC;YACL,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;gBAC7B,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACpD,CAAC,CAAC,CAAC;YACL,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;gBAC7B,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACpD,CAAC,CAAC,CAAC;SACN,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,GAAG;YACX,kBAAkB,EAAE,CAAC;YACrB,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,aAAa,EAAE,CAAC;YAChB,UAAU,EAAE,CAAC;YACb,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;SACnB,CAAC;IACJ,CAAC;IAED,0BAA0B;IAElB,iBAAiB;QACvB,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;IAEO,UAAU,CAAI,KAAQ;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAA0C,CAAC;QAE5E,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,WAAW,EAAE,CAAC;YACpB,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,KAAQ,EACR,MAA6B;QAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,SAAS,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5E,MAAM,UAAU,GAAG,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ;YAClD,CAAC,CAAC,MAAM,CAAC,MAAM;YACf,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAElC,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAErD,qBAAqB;QACrB,MAAM,OAAO,GAAG,IAAA,2CAAqB,EACnC,SAAS,EACT,UAAU,EACV,QAAQ,EACR,SAAS,EACT;YACE,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,aAAa,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAgD;YAC/E,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,UAAU,EAAE,MAAM,CAAC,OAAO;YAC1B,mBAAmB,EAAE,MAAM,CAAC,QAAQ,CAAC,gBAAgB;SACtD,CACF,CAAC;QAEF,iBAAiB;QACjB,MAAM,KAAK,GAA8B;YACvC,KAAK;YACL,SAAS,EAAE,IAAI;YACf,OAAO;YACP,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE;YAC5C,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;SACzB,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAwC,CAAC,CAAC;QAE/D,OAAO,OAAO,CAAC,EAAE,CAAC;IACpB,CAAC;IAEO,KAAK,CAAC,2BAA2B,CACvC,KAAQ,EACR,MAA6B;QAE7B,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO;QAElC,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,IAAA,0BAAU,GAAE,CAAC;YAClC,IAAI,CAAC,YAAY;gBAAE,OAAO;YAE1B,MAAM,SAAS,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC5E,MAAM,UAAU,GAAG,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ;gBAClD,CAAC,CAAC,MAAM,CAAC,MAAM;gBACf,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAElC,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,iBAAiB,EAAE;iBACpD,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC;iBAC7B,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,OAAO,CAAC;iBACnC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAEtD,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAEpD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,4BAA4B,EAAE,EAAE,KAAK,EAAG,KAAe,CAAC,OAAO,EAAE,CAAC,CAAC;QACvF,CAAC;IACH,CAAC;IAEO,WAAW,CAAI,MAA6B;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAEhC,mBAAmB;QACnB,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxF,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAElF,mBAAmB;QACnB,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAEO,SAAS,CAAI,KAAQ;QAC3B,MAAM,GAAG,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACtE,uBAAuB;QACvB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACnC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACK,iBAAiB,CAAC,IAAY;QACpC,gEAAgE;QAChE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC;gBACH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC;YAAC,MAAM,CAAC;gBACP,wCAAwC;YAC1C,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,wEAAwE;QACxE,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;YACpB,SAAS,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAC7C,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAqCD;;;;;;;;;;;;;;;OAeG;IACK,gBAAgB,CAAC,IAAY;QACnC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAErC,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QACzD,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;QAChE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QAE3D,OAAO,CAAC,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,eAAe,CAAC,IAAY;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,gBAAgB,CAAC,IAAY;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAC9D,CAAC;CACF;AAriBD,gDAqiBC;AAED;;GAEG;AACH,SAAgB,6BAA6B;IAC3C,OAAO,IAAI,kBAAkB,CAAC;QAC5B,aAAa,EAAE,CAAC;QAChB,oBAAoB,EAAE,GAAG;QACzB,aAAa,EAAE,WAAW;QAC1B,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,IAAI;QACjB,UAAU,EAAE,IAAI;KACjB,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAgB,2BAA2B;IACzC,OAAO,IAAI,kBAAkB,CAAC;QAC5B,aAAa,EAAE,CAAC;QAChB,oBAAoB,EAAE,IAAI;QAC1B,aAAa,EAAE,UAAU;QACzB,UAAU,EAAE,GAAG;QACf,WAAW,EAAE,IAAI;QACjB,UAAU,EAAE,KAAK,EAAE,2BAA2B;KAC/C,CAAC,CAAC;AACL,CAAC"}

package/dist/core/platform/FileOperations.d.ts

@@ -0,0 +1,124 @@
+/**
+ * FileOperations - Platform-optimized file operations
+ *
+ * Provides file copy/clone operations that leverage platform-specific
+ * features like APFS clonefile (macOS) and reflink (Linux btrfs/xfs)
+ * for 50-100x performance improvements.
+ *
+ * @module core/platform/FileOperations
+ * @version 1.0.0
+ */
+/**
+ * Copy strategy used for a file operation
+ */
+export declare enum CopyStrategy {
+    /** Copy-on-write clone (fastest) */
+    REFLINK = "reflink",
+    /** Filesystem hardlink (instant, shares data) */
+    HARDLINK = "hardlink",
+    /** Kernel-space copy (fast) */
+    KERNEL = "kernel",
+    /** Userspace copy (fallback) */
+    USERSPACE = "userspace"
+}
+/**
+ * Result of a copy operation
+ */
+export interface CopyResult {
+    /** Source path */
+    source: string;
+    /** Destination path */
+    destination: string;
+    /** Strategy used */
+    strategy: CopyStrategy;
+    /** Operation duration in milliseconds */
+    duration: number;
+    /** File size in bytes */
+    size: number;
+    /** Whether operation succeeded */
+    success: boolean;
+    /** Error message if failed */
+    error?: string;
+}
+/**
+ * Options for copy operations
+ */
+export interface CopyOptions {
+    /** Force a specific strategy (skips auto-detection) */
+    strategy?: CopyStrategy;
+    /** Overwrite existing destination */
+    overwrite?: boolean;
+    /** Create parent directories if they don't exist */
+    recursive?: boolean;
+    /** Preserve file timestamps */
+    preserveTimestamps?: boolean;
+}
+/**
+ * Copy a file using the optimal strategy for the platform
+ *
+ * Priority: reflink > kernel copy > userspace copy
+ *
+ * @param source - Source file path
+ * @param destination - Destination file path
+ * @param options - Copy options
+ * @returns Copy result with strategy and timing info
+ */
+export declare function copyFile(source: string, destination: string, options?: CopyOptions): Promise<CopyResult>;
+/**
+ * Copy a directory recursively using optimal strategies
+ *
+ * @param source - Source directory path
+ * @param destination - Destination directory path
+ * @param options - Copy options
+ * @returns Array of copy results for all files
+ */
+export declare function copyDirectory(source: string, destination: string, options?: CopyOptions): Promise<CopyResult[]>;
+/**
+ * Clone a directory for test isolation
+ *
+ * Optimized for creating isolated test workspaces with COW cloning.
+ *
+ * @param source - Source directory path
+ * @param destination - Destination directory path
+ * @returns Clone result summary
+ */
+export declare function cloneForIsolation(source: string, destination: string): Promise<{
+    success: boolean;
+    filesCloned: number;
+    totalSize: number;
+    duration: number;
+    strategy: CopyStrategy;
+    errors: string[];
+}>;
+/**
+ * Create a read-only fixture copy using hardlinks
+ *
+ * Useful for test fixtures that won't be modified.
+ *
+ * @param source - Source file path
+ * @param destination - Destination file path
+ * @returns Copy result
+ */
+export declare function linkFixture(source: string, destination: string): Promise<CopyResult>;
+/**
+ * Get platform copy capabilities summary
+ */
+export declare function getCopyCapabilities(): Promise<{
+    platform: string;
+    filesystem: string;
+    optimalStrategy: CopyStrategy;
+    expectedSpeedup: string;
+}>;
+/**
+ * Benchmark copy operations for the current platform
+ *
+ * @param testPath - Path to run benchmark in
+ * @returns Benchmark results
+ */
+export declare function benchmarkCopy(testPath?: string): Promise<{
+    reflink: number | null;
+    kernel: number | null;
+    userspace: number;
+    improvement: string;
+}>;
+//# sourceMappingURL=FileOperations.d.ts.map

package/dist/core/platform/FileOperations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FileOperations.d.ts","sourceRoot":"","sources":["../../../src/core/platform/FileOperations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH;;GAEG;AACH,oBAAY,YAAY;IACtB,oCAAoC;IACpC,OAAO,YAAY;IACnB,iDAAiD;IACjD,QAAQ,aAAa;IACrB,+BAA+B;IAC/B,MAAM,WAAW;IACjB,gCAAgC;IAChC,SAAS,cAAc;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,kBAAkB;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,uBAAuB;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,oBAAoB;IACpB,QAAQ,EAAE,YAAY,CAAC;IACvB,yCAAyC;IACzC,QAAQ,EAAE,MAAM,CAAC;IACjB,yBAAyB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,kCAAkC;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,8BAA8B;IAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,uDAAuD;IACvD,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB,qCAAqC;IACrC,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,oDAAoD;IACpD,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,+BAA+B;IAC/B,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED;;;;;;;;;GASG;AACH,wBAAsB,QAAQ,CAC5B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,WAAgB,GACxB,OAAO,CAAC,UAAU,CAAC,CAgHrB;AAED;;;;;;;GAOG;AACH,wBAAsB,aAAa,CACjC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,WAAgB,GACxB,OAAO,CAAC,UAAU,EAAE,CAAC,CA8CvB;AAED;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC;IACT,OAAO,EAAE,OAAO,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,YAAY,CAAC;IACvB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAAC,CAkCD;AAED;;;;;;;;GAQG;AACH,wBAAsB,WAAW,CAC/B,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,UAAU,CAAC,CAKrB;AAED;;GAEG;AACH,wBAAsB,mBAAmB,IAAI,OAAO,CAAC;IACnD,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,YAAY,CAAC;IAC9B,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC,CAuBD;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CACjC,QAAQ,GAAE,MAAe,GACxB,OAAO,CAAC;IACT,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB,CAAC,CA0DD"}