agentic-qe 1.9.4 → 2.1.0

package/dist/core/orchestration/AdaptiveScheduler.js

@@ -0,0 +1,460 @@
+"use strict";
+/**
+ * AdaptiveScheduler - Intelligent Task Scheduling
+ *
+ * Provides dynamic scheduling with optimization feedback, backpressure handling,
+ * and predictive queue management for QE agent swarms.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AdaptiveScheduler = void 0;
+const events_1 = require("events");
+const Logger_js_1 = require("../../utils/Logger.js");
+const PriorityQueue_js_1 = require("./PriorityQueue.js");
+/**
+ * Adaptive Scheduler Implementation
+ */
+class AdaptiveScheduler extends events_1.EventEmitter {
+    constructor(config) {
+        super();
+        this.agents = new Map();
+        this.pendingTasks = new Map();
+        this.completedTasks = new Map();
+        this.metrics = {
+            scheduled: 0,
+            completed: 0,
+            failed: 0,
+            totalWaitTime: 0,
+            totalSchedulingTime: 0,
+        };
+        this.roundRobinIndex = 0;
+        this.isRunning = false;
+        this.logger = Logger_js_1.Logger.getInstance();
+        this.config = {
+            strategy: 'adaptive',
+            maxQueueDepth: 1000,
+            highPressureThreshold: 0.7,
+            criticalPressureThreshold: 0.9,
+            enablePrediction: true,
+            predictionWindow: 60000, // 1 minute
+            enableWorkStealing: true,
+            workStealingThreshold: 0.3,
+            ...config,
+        };
+        this.taskQueue = new PriorityQueue_js_1.PriorityQueue();
+    }
+    /**
+     * Start the scheduler
+     */
+    start() {
+        if (this.isRunning)
+            return;
+        this.isRunning = true;
+        this.schedulerLoop = setInterval(() => this.processQueue(), 100);
+        this.emit('started');
+        this.logger.info('AdaptiveScheduler started');
+    }
+    /**
+     * Stop the scheduler
+     */
+    stop() {
+        this.isRunning = false;
+        if (this.schedulerLoop) {
+            clearInterval(this.schedulerLoop);
+            this.schedulerLoop = undefined;
+        }
+        this.emit('stopped');
+        this.logger.info('AdaptiveScheduler stopped');
+    }
+    /**
+     * Enqueue a task for scheduling
+     */
+    enqueue(task) {
+        // Check backpressure
+        const pressure = this.getPressureLevel();
+        if (pressure === 'critical' && task.priority !== 'critical') {
+            throw new Error('Queue at critical pressure, only critical tasks accepted');
+        }
+        const scheduledTask = {
+            ...task,
+            scheduledAt: new Date(),
+            retryCount: 0,
+            schedulingScore: this.calculateSchedulingScore(task),
+        };
+        // Calculate priority value for queue
+        const priorityValue = this.calculatePriorityValue(scheduledTask);
+        this.taskQueue.enqueue(scheduledTask, priorityValue);
+        this.pendingTasks.set(task.id, scheduledTask);
+        this.emit('task:enqueued', { taskId: task.id, priority: task.priority, queueDepth: this.taskQueue.size() });
+        return scheduledTask;
+    }
+    /**
+     * Register an agent
+     */
+    registerAgent(agent) {
+        const trackedAgent = {
+            ...agent,
+            assignedTasks: [],
+            completedTasks: 0,
+            failedTasks: 0,
+            averageTaskDuration: 0,
+        };
+        this.agents.set(agent.id, trackedAgent);
+        this.emit('agent:registered', { agentId: agent.id });
+    }
+    /**
+     * Unregister an agent
+     */
+    unregisterAgent(agentId) {
+        const agent = this.agents.get(agentId);
+        if (agent) {
+            // Re-queue any assigned tasks
+            for (const taskId of agent.assignedTasks) {
+                const task = this.pendingTasks.get(taskId);
+                if (task) {
+                    task.assignedAgent = undefined;
+                    task.retryCount++;
+                    this.taskQueue.enqueue(task, this.calculatePriorityValue(task));
+                }
+            }
+            this.agents.delete(agentId);
+            this.emit('agent:unregistered', { agentId });
+        }
+    }
+    /**
+     * Mark task as completed
+     */
+    completeTask(taskId, duration) {
+        const task = this.pendingTasks.get(taskId);
+        if (!task)
+            return;
+        this.pendingTasks.delete(taskId);
+        this.completedTasks.set(taskId, task);
+        this.metrics.completed++;
+        // Update agent stats
+        if (task.assignedAgent) {
+            const agent = this.agents.get(task.assignedAgent);
+            if (agent) {
+                agent.assignedTasks = agent.assignedTasks.filter(id => id !== taskId);
+                agent.completedTasks++;
+                agent.lastTaskTime = new Date();
+                agent.currentLoad = Math.max(0, agent.currentLoad - 0.1);
+                // Update average duration
+                const prevTotal = agent.averageTaskDuration * (agent.completedTasks - 1);
+                agent.averageTaskDuration = (prevTotal + duration) / agent.completedTasks;
+            }
+        }
+        const waitTime = task.actualStartTime
+            ? task.actualStartTime.getTime() - task.scheduledAt.getTime()
+            : 0;
+        this.metrics.totalWaitTime += waitTime;
+        this.emit('task:completed', { taskId, duration, waitTime });
+    }
+    /**
+     * Mark task as failed
+     */
+    failTask(taskId, error) {
+        const task = this.pendingTasks.get(taskId);
+        if (!task)
+            return;
+        // Update agent stats
+        if (task.assignedAgent) {
+            const agent = this.agents.get(task.assignedAgent);
+            if (agent) {
+                agent.assignedTasks = agent.assignedTasks.filter(id => id !== taskId);
+                agent.failedTasks++;
+                agent.currentLoad = Math.max(0, agent.currentLoad - 0.1);
+                agent.performanceScore = Math.max(0, agent.performanceScore - 0.05);
+            }
+        }
+        // Retry if possible
+        if (task.retryCount < 3) {
+            task.retryCount++;
+            task.assignedAgent = undefined;
+            this.taskQueue.enqueue(task, this.calculatePriorityValue(task));
+            this.emit('task:retrying', { taskId, retryCount: task.retryCount });
+        }
+        else {
+            this.pendingTasks.delete(taskId);
+            this.metrics.failed++;
+            this.emit('task:failed', { taskId, error, retryCount: task.retryCount });
+        }
+    }
+    /**
+     * Get current metrics
+     */
+    getMetrics() {
+        const agentUtilization = new Map();
+        for (const [id, agent] of this.agents) {
+            agentUtilization.set(id, agent.currentLoad);
+        }
+        const elapsed = Date.now() - (this.completedTasks.values().next().value?.scheduledAt?.getTime() || Date.now());
+        const throughput = elapsed > 0 ? (this.metrics.completed / (elapsed / 1000)) : 0;
+        return {
+            queueDepth: this.taskQueue.size(),
+            queueCapacity: this.config.maxQueueDepth,
+            pressureLevel: this.getPressureLevel(),
+            scheduledCount: this.metrics.scheduled,
+            completedCount: this.metrics.completed,
+            failedCount: this.metrics.failed,
+            averageWaitTime: this.metrics.completed > 0
+                ? this.metrics.totalWaitTime / this.metrics.completed
+                : 0,
+            averageSchedulingTime: this.metrics.scheduled > 0
+                ? this.metrics.totalSchedulingTime / this.metrics.scheduled
+                : 0,
+            throughput,
+            agentUtilization,
+        };
+    }
+    /**
+     * Get queue pressure level
+     */
+    getPressureLevel() {
+        const ratio = this.taskQueue.size() / this.config.maxQueueDepth;
+        if (ratio >= this.config.criticalPressureThreshold)
+            return 'critical';
+        if (ratio >= this.config.highPressureThreshold)
+            return 'high';
+        if (ratio >= 0.4)
+            return 'medium';
+        return 'low';
+    }
+    /**
+     * Get available agents
+     */
+    getAvailableAgents() {
+        return Array.from(this.agents.values())
+            .filter(a => a.isAvailable && a.currentLoad < 0.9);
+    }
+    /**
+     * Process queue and assign tasks
+     */
+    processQueue() {
+        if (!this.isRunning)
+            return;
+        const availableAgents = this.getAvailableAgents();
+        if (availableAgents.length === 0 || this.taskQueue.isEmpty())
+            return;
+        // Work stealing if enabled
+        if (this.config.enableWorkStealing) {
+            this.performWorkStealing(availableAgents);
+        }
+        // Assign tasks to available agents
+        while (!this.taskQueue.isEmpty() && availableAgents.length > 0) {
+            const task = this.taskQueue.peek();
+            if (!task)
+                break;
+            const decision = this.makeSchedulingDecision(task, availableAgents);
+            if (!decision)
+                break;
+            // Dequeue and assign
+            this.taskQueue.dequeue();
+            this.assignTask(task, decision);
+            // Update agent availability
+            const agentIndex = availableAgents.findIndex(a => a.id === decision.agentId);
+            if (agentIndex >= 0) {
+                const agent = availableAgents[agentIndex];
+                if (agent.currentLoad >= 0.9) {
+                    availableAgents.splice(agentIndex, 1);
+                }
+            }
+        }
+    }
+    /**
+     * Make scheduling decision for a task
+     */
+    makeSchedulingDecision(task, availableAgents) {
+        if (availableAgents.length === 0)
+            return null;
+        const startTime = Date.now();
+        let decision;
+        switch (this.config.strategy) {
+            case 'round-robin':
+                decision = this.roundRobinSchedule(task, availableAgents);
+                break;
+            case 'least-loaded':
+                decision = this.leastLoadedSchedule(task, availableAgents);
+                break;
+            case 'capability-match':
+                decision = this.capabilityMatchSchedule(task, availableAgents);
+                break;
+            case 'performance-based':
+                decision = this.performanceBasedSchedule(task, availableAgents);
+                break;
+            case 'adaptive':
+            default:
+                decision = this.adaptiveSchedule(task, availableAgents);
+        }
+        this.metrics.totalSchedulingTime += Date.now() - startTime;
+        return decision;
+    }
+    /**
+     * Round-robin scheduling
+     */
+    roundRobinSchedule(task, agents) {
+        const agent = agents[this.roundRobinIndex % agents.length];
+        this.roundRobinIndex++;
+        return {
+            taskId: task.id,
+            agentId: agent.id,
+            strategy: 'round-robin',
+            score: 0.5,
+            reason: 'Round-robin selection',
+            estimatedDuration: task.estimatedDuration,
+        };
+    }
+    /**
+     * Least-loaded scheduling
+     */
+    leastLoadedSchedule(task, agents) {
+        const agent = agents.reduce((min, a) => a.currentLoad < min.currentLoad ? a : min);
+        return {
+            taskId: task.id,
+            agentId: agent.id,
+            strategy: 'least-loaded',
+            score: 1 - agent.currentLoad,
+            reason: `Lowest load: ${(agent.currentLoad * 100).toFixed(1)}%`,
+            estimatedDuration: task.estimatedDuration,
+        };
+    }
+    /**
+     * Capability-match scheduling
+     */
+    capabilityMatchSchedule(task, agents) {
+        // Score agents by capability match
+        const scored = agents.map(agent => {
+            const requiredCaps = task.requiredCapabilities || [];
+            const matchCount = requiredCaps.filter(cap => agent.capabilities.includes(cap)).length;
+            const score = requiredCaps.length > 0
+                ? matchCount / requiredCaps.length
+                : 0.5;
+            return { agent, score };
+        });
+        scored.sort((a, b) => b.score - a.score);
+        const best = scored[0];
+        return {
+            taskId: task.id,
+            agentId: best.agent.id,
+            strategy: 'capability-match',
+            score: best.score,
+            reason: `Capability match: ${(best.score * 100).toFixed(1)}%`,
+            estimatedDuration: task.estimatedDuration,
+        };
+    }
+    /**
+     * Performance-based scheduling
+     */
+    performanceBasedSchedule(task, agents) {
+        const agent = agents.reduce((best, a) => a.performanceScore > best.performanceScore ? a : best);
+        return {
+            taskId: task.id,
+            agentId: agent.id,
+            strategy: 'performance-based',
+            score: agent.performanceScore,
+            reason: `Best performance: ${(agent.performanceScore * 100).toFixed(1)}%`,
+            estimatedDuration: task.estimatedDuration / agent.performanceScore,
+        };
+    }
+    /**
+     * Adaptive scheduling (combines all strategies)
+     */
+    adaptiveSchedule(task, agents) {
+        const pressure = this.getPressureLevel();
+        // Under high pressure, prefer fastest agents
+        if (pressure === 'critical' || pressure === 'high') {
+            return this.performanceBasedSchedule(task, agents);
+        }
+        // For capability-heavy tasks, match capabilities
+        if (task.requiredCapabilities && task.requiredCapabilities.length > 2) {
+            return this.capabilityMatchSchedule(task, agents);
+        }
+        // Default to least-loaded
+        return this.leastLoadedSchedule(task, agents);
+    }
+    /**
+     * Assign task to agent
+     */
+    assignTask(task, decision) {
+        const agent = this.agents.get(decision.agentId);
+        if (!agent)
+            return;
+        task.assignedAgent = decision.agentId;
+        task.actualStartTime = new Date();
+        task.estimatedEndTime = new Date(Date.now() + decision.estimatedDuration);
+        agent.assignedTasks.push(task.id);
+        agent.currentLoad = Math.min(1, agent.currentLoad + 0.1 + (task.complexity * 0.1));
+        this.metrics.scheduled++;
+        this.emit('task:assigned', {
+            taskId: task.id,
+            agentId: agent.id,
+            strategy: decision.strategy,
+            score: decision.score,
+        });
+    }
+    /**
+     * Perform work stealing
+     */
+    performWorkStealing(availableAgents) {
+        // Find overloaded and underloaded agents
+        const underloaded = availableAgents.filter(a => a.currentLoad < 0.3);
+        const overloaded = Array.from(this.agents.values()).filter(a => a.currentLoad > 0.8 && a.assignedTasks.length > 1);
+        if (underloaded.length === 0 || overloaded.length === 0)
+            return;
+        for (const heavy of overloaded) {
+            const light = underloaded.find(a => heavy.currentLoad - a.currentLoad > this.config.workStealingThreshold);
+            if (light && heavy.assignedTasks.length > 1) {
+                // Steal one task
+                const taskId = heavy.assignedTasks[heavy.assignedTasks.length - 1];
+                const task = this.pendingTasks.get(taskId);
+                if (task && !task.actualStartTime) {
+                    // Task hasn't started, can be stolen
+                    heavy.assignedTasks.pop();
+                    heavy.currentLoad = Math.max(0, heavy.currentLoad - 0.15);
+                    task.assignedAgent = light.id;
+                    light.assignedTasks.push(taskId);
+                    light.currentLoad = Math.min(1, light.currentLoad + 0.15);
+                    this.emit('task:stolen', {
+                        taskId,
+                        fromAgent: heavy.id,
+                        toAgent: light.id,
+                    });
+                }
+            }
+        }
+    }
+    /**
+     * Calculate scheduling score for a task
+     */
+    calculateSchedulingScore(task) {
+        const priorityScores = { critical: 1.0, high: 0.75, medium: 0.5, low: 0.25 };
+        const priorityScore = priorityScores[task.priority] || 0.5;
+        const complexityScore = 1 - task.complexity;
+        const dependencyScore = task.dependencies.length === 0 ? 1 : 0.5;
+        return (priorityScore * 0.5) + (complexityScore * 0.3) + (dependencyScore * 0.2);
+    }
+    /**
+     * Calculate priority value for queue ordering
+     */
+    calculatePriorityValue(task) {
+        const priorityValues = { critical: 100, high: 75, medium: 50, low: 25 };
+        const basePriority = priorityValues[task.priority] || 50;
+        // Boost priority for retries
+        const retryBoost = task.retryCount * 10;
+        // Boost priority based on wait time (age)
+        const waitTime = Date.now() - task.scheduledAt.getTime();
+        const ageBoost = Math.min(20, waitTime / 60000); // Max 20 point boost for waiting
+        return basePriority + retryBoost + ageBoost;
+    }
+    /**
+     * Cleanup
+     */
+    destroy() {
+        this.stop();
+        this.removeAllListeners();
+        this.agents.clear();
+        this.pendingTasks.clear();
+        this.completedTasks.clear();
+    }
+}
+exports.AdaptiveScheduler = AdaptiveScheduler;
+//# sourceMappingURL=AdaptiveScheduler.js.map

package/dist/core/orchestration/AdaptiveScheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AdaptiveScheduler.js","sourceRoot":"","sources":["../../../src/core/orchestration/AdaptiveScheduler.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,mCAAsC;AACtC,qDAA+C;AAC/C,yDAAmD;AA4FnD;;GAEG;AACH,MAAa,iBAAkB,SAAQ,qBAAY;IAqBjD,YAAY,MAAyC;QACnD,KAAK,EAAE,CAAC;QAjBF,WAAM,GAA8B,IAAI,GAAG,EAAE,CAAC;QAC9C,iBAAY,GAA+B,IAAI,GAAG,EAAE,CAAC;QACrD,mBAAc,GAA+B,IAAI,GAAG,EAAE,CAAC;QAEvD,YAAO,GAAG;YAChB,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,CAAC;YACT,aAAa,EAAE,CAAC;YAChB,mBAAmB,EAAE,CAAC;SACvB,CAAC;QAEM,oBAAe,GAAG,CAAC,CAAC;QACpB,cAAS,GAAG,KAAK,CAAC;QAMxB,IAAI,CAAC,MAAM,GAAG,kBAAM,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG;YACZ,QAAQ,EAAE,UAAU;YACpB,aAAa,EAAE,IAAI;YACnB,qBAAqB,EAAE,GAAG;YAC1B,yBAAyB,EAAE,GAAG;YAC9B,gBAAgB,EAAE,IAAI;YACtB,gBAAgB,EAAE,KAAK,EAAE,WAAW;YACpC,kBAAkB,EAAE,IAAI;YACxB,qBAAqB,EAAE,GAAG;YAC1B,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,CAAC,SAAS,GAAG,IAAI,gCAAa,EAAiB,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAE3B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,CAAC;QACjE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClC,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAU;QAChB,qBAAqB;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACzC,IAAI,QAAQ,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,aAAa,GAAkB;YACnC,GAAG,IAAI;YACP,WAAW,EAAE,IAAI,IAAI,EAAE;YACvB,UAAU,EAAE,CAAC;YACb,eAAe,EAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC;SACrD,CAAC;QAEF,qCAAqC;QACrC,MAAM,aAAa,GAAG,IAAI,CAAC,sBAAsB,CAAC,aAAa,CAAC,CAAC;QAEjE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QACrD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;QAE9C,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5G,OAAO,aAAa,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,KAAY;QACxB,MAAM,YAAY,GAAiB;YACjC,GAAG,KAAK;YACR,aAAa,EAAE,EAAE;YACjB,cAAc,EAAE,CAAC;YACjB,WAAW,EAAE,CAAC;YACd,mBAAmB,EAAE,CAAC;SACvB,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,OAAe;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,KAAK,EAAE,CAAC;YACV,8BAA8B;YAC9B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3C,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;oBAC/B,IAAI,CAAC,UAAU,EAAE,CAAC;oBAClB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC;gBAClE,CAAC;YACH,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc,EAAE,QAAgB;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAEzB,qBAAqB;QACrB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;gBACtE,KAAK,CAAC,cAAc,EAAE,CAAC;gBACvB,KAAK,CAAC,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC;gBAChC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;gBAEzD,0BAA0B;gBAC1B,MAAM,SAAS,GAAG,KAAK,CAAC,mBAAmB,GAAG,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;gBACzE,KAAK,CAAC,mBAAmB,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,GAAG,KAAK,CAAC,cAAc,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe;YACnC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE;YAC7D,CAAC,CAAC,CAAC,CAAC;QACN,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,QAAQ,CAAC;QAEvC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAc,EAAE,KAAa;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,qBAAqB;QACrB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;gBACtE,KAAK,CAAC,WAAW,EAAE,CAAC;gBACpB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;gBACzD,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC;YAChE,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACtE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU;QACR,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/G,MAAM,UAAU,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjF,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;YACjC,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACxC,aAAa,EAAE,IAAI,CAAC,gBAAgB,EAAE;YACtC,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;YACtC,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;YACtC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YAChC,eAAe,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC;gBACzC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS;gBACrD,CAAC,CAAC,CAAC;YACL,qBAAqB,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC;gBAC/C,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS;gBAC3D,CAAC,CAAC,CAAC;YACL,UAAU;YACV,gBAAgB;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QAEhE,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,yBAAyB;YAAE,OAAO,UAAU,CAAC;QACtE,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,qBAAqB;YAAE,OAAO,MAAM,CAAC;QAC9D,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO,QAAQ,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO;QAE5B,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;YAAE,OAAO;QAErE,2BAA2B;QAC3B,IAAI,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC;YACnC,IAAI,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC;QAC5C,CAAC;QAED,mCAAmC;QACnC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI;gBAAE,MAAM;YAEjB,MAAM,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;YACpE,IAAI,CAAC,QAAQ;gBAAE,MAAM;YAErB,qBAAqB;YACrB,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAEhC,4BAA4B;YAC5B,MAAM,UAAU,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC7E,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,WAAW,IAAI,GAAG,EAAE,CAAC;oBAC7B,eAAe,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,IAAmB,EACnB,eAA+B;QAE/B,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAE9C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,QAA4B,CAAC;QAEjC,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC7B,KAAK,aAAa;gBAChB,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAC1D,MAAM;YACR,KAAK,cAAc;gBACjB,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAC3D,MAAM;YACR,KAAK,kBAAkB;gBACrB,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAC/D,MAAM;YACR,KAAK,mBAAmB;gBACtB,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAChE,MAAM;YACR,KAAK,UAAU,CAAC;YAChB;gBACE,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,mBAAmB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAC3D,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,kBAAkB,CACxB,IAAmB,EACnB,MAAsB;QAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,CAAC,eAAe,EAAE,CAAC;QAEvB,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,QAAQ,EAAE,aAAa;YACvB,KAAK,EAAE,GAAG;YACV,MAAM,EAAE,uBAAuB;YAC/B,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;SAC1C,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,IAAmB,EACnB,MAAsB;QAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CACrC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAC1C,CAAC;QAEF,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,QAAQ,EAAE,cAAc;YACxB,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW;YAC5B,MAAM,EAAE,gBAAgB,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;YAC/D,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;SAC1C,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,IAAmB,EACnB,MAAsB;QAEtB,mCAAmC;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAChC,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,IAAI,EAAE,CAAC;YACrD,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAC3C,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CACjC,CAAC,MAAM,CAAC;YACT,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC;gBACnC,CAAC,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM;gBAClC,CAAC,CAAC,GAAG,CAAC;YAER,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAEvB,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YACtB,QAAQ,EAAE,kBAAkB;YAC5B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,qBAAqB,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;YAC7D,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;SAC1C,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,IAAmB,EACnB,MAAsB;QAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CACtC,CAAC,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CACtD,CAAC;QAEF,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,QAAQ,EAAE,mBAAmB;YAC7B,KAAK,EAAE,KAAK,CAAC,gBAAgB;YAC7B,MAAM,EAAE,qBAAqB,CAAC,KAAK,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;YACzE,iBAAiB,EAAE,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC,gBAAgB;SACnE,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,IAAmB,EACnB,MAAsB;QAEtB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAEzC,6CAA6C;QAC7C,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrD,CAAC;QAED,iDAAiD;QACjD,IAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtE,OAAO,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpD,CAAC;QAED,0BAA0B;QAC1B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAmB,EAAE,QAA4B;QAClE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC;QACtC,IAAI,CAAC,eAAe,GAAG,IAAI,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;QAE1E,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;QAEnF,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAEzB,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE;YACzB,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,KAAK,EAAE,QAAQ,CAAC,KAAK;SACtB,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,eAA+B;QACzD,yCAAyC;QACzC,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;QACrE,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC7D,CAAC,CAAC,WAAW,GAAG,GAAG,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAClD,CAAC;QAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEhE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACjC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CACtE,CAAC;YAEF,IAAI,KAAK,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5C,iBAAiB;gBACjB,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACnE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAE3C,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;oBAClC,qCAAqC;oBACrC,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;oBAC1B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;oBAE1D,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,EAAE,CAAC;oBAC9B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACjC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;oBAE1D,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;wBACvB,MAAM;wBACN,SAAS,EAAE,KAAK,CAAC,EAAE;wBACnB,OAAO,EAAE,KAAK,CAAC,EAAE;qBAClB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,IAAU;QACzC,MAAM,cAAc,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC7E,MAAM,aAAa,GAAG,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;QAC3D,MAAM,eAAe,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5C,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAEjE,OAAO,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,CAAC;IACnF,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,IAAmB;QAChD,MAAM,cAAc,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;QACxE,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAEzD,6BAA6B;QAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAExC,0CAA0C;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,iCAAiC;QAElF,OAAO,YAAY,GAAG,UAAU,GAAG,QAAQ,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,OAAO;QACL,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;IAC9B,CAAC;CACF;AAxhBD,8CAwhBC"}

package/dist/core/orchestration/PriorityQueue.d.ts

@@ -0,0 +1,54 @@
+/**
+ * PriorityQueue - Heap-based priority queue implementation
+ *
+ * Uses a binary min-heap for O(log n) enqueue/dequeue operations.
+ * Higher priority values indicate higher priority (will be dequeued first).
+ */
+export declare class PriorityQueue<T> {
+    private heap;
+    /**
+     * Add an item to the queue with the given priority
+     * @param item Item to add
+     * @param priority Priority value (higher = higher priority)
+     */
+    enqueue(item: T, priority: number): void;
+    /**
+     * Remove and return the highest priority item
+     * @returns The item with highest priority, or undefined if empty
+     */
+    dequeue(): T | undefined;
+    /**
+     * View the highest priority item without removing it
+     * @returns The item with highest priority, or undefined if empty
+     */
+    peek(): T | undefined;
+    /**
+     * Check if the queue is empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Get the number of items in the queue
+     */
+    size(): number;
+    /**
+     * Clear all items from the queue
+     */
+    clear(): void;
+    /**
+     * Convert queue to array (ordered by priority)
+     */
+    toArray(): T[];
+    /**
+     * Bubble up an element to maintain heap property
+     */
+    private bubbleUp;
+    /**
+     * Bubble down an element to maintain heap property
+     */
+    private bubbleDown;
+    /**
+     * Swap two elements in the heap
+     */
+    private swap;
+}
+//# sourceMappingURL=PriorityQueue.d.ts.map

package/dist/core/orchestration/PriorityQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.d.ts","sourceRoot":"","sources":["../../../src/core/orchestration/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAOH,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAsB;IAElC;;;;OAIG;IACH,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAKxC;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS;IAgBxB;;;OAGG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;OAEG;IACH,OAAO,IAAI,CAAC,EAAE;IASd;;OAEG;IACH,OAAO,CAAC,QAAQ;IAchB;;OAEG;IACH,OAAO,CAAC,UAAU;IA8BlB;;OAEG;IACH,OAAO,CAAC,IAAI;CAKb"}

package/dist/core/orchestration/PriorityQueue.js

@@ -0,0 +1,122 @@
+"use strict";
+/**
+ * PriorityQueue - Heap-based priority queue implementation
+ *
+ * Uses a binary min-heap for O(log n) enqueue/dequeue operations.
+ * Higher priority values indicate higher priority (will be dequeued first).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PriorityQueue = void 0;
+class PriorityQueue {
+    constructor() {
+        this.heap = [];
+    }
+    /**
+     * Add an item to the queue with the given priority
+     * @param item Item to add
+     * @param priority Priority value (higher = higher priority)
+     */
+    enqueue(item, priority) {
+        this.heap.push({ item, priority });
+        this.bubbleUp(this.heap.length - 1);
+    }
+    /**
+     * Remove and return the highest priority item
+     * @returns The item with highest priority, or undefined if empty
+     */
+    dequeue() {
+        if (this.heap.length === 0) {
+            return undefined;
+        }
+        if (this.heap.length === 1) {
+            return this.heap.pop().item;
+        }
+        const result = this.heap[0].item;
+        this.heap[0] = this.heap.pop();
+        this.bubbleDown(0);
+        return result;
+    }
+    /**
+     * View the highest priority item without removing it
+     * @returns The item with highest priority, or undefined if empty
+     */
+    peek() {
+        return this.heap.length > 0 ? this.heap[0].item : undefined;
+    }
+    /**
+     * Check if the queue is empty
+     */
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    /**
+     * Get the number of items in the queue
+     */
+    size() {
+        return this.heap.length;
+    }
+    /**
+     * Clear all items from the queue
+     */
+    clear() {
+        this.heap = [];
+    }
+    /**
+     * Convert queue to array (ordered by priority)
+     */
+    toArray() {
+        // Create a copy and sort by priority (highest first)
+        return [...this.heap]
+            .sort((a, b) => b.priority - a.priority)
+            .map(item => item.item);
+    }
+    // ============= PRIVATE HEAP OPERATIONS =============
+    /**
+     * Bubble up an element to maintain heap property
+     */
+    bubbleUp(index) {
+        while (index > 0) {
+            const parentIndex = Math.floor((index - 1) / 2);
+            // Max heap: parent should have higher priority
+            if (this.heap[parentIndex].priority >= this.heap[index].priority) {
+                break;
+            }
+            this.swap(index, parentIndex);
+            index = parentIndex;
+        }
+    }
+    /**
+     * Bubble down an element to maintain heap property
+     */
+    bubbleDown(index) {
+        while (true) {
+            const leftChild = 2 * index + 1;
+            const rightChild = 2 * index + 2;
+            let largest = index;
+            // Find largest among node and its children
+            if (leftChild < this.heap.length &&
+                this.heap[leftChild].priority > this.heap[largest].priority) {
+                largest = leftChild;
+            }
+            if (rightChild < this.heap.length &&
+                this.heap[rightChild].priority > this.heap[largest].priority) {
+                largest = rightChild;
+            }
+            if (largest === index) {
+                break;
+            }
+            this.swap(index, largest);
+            index = largest;
+        }
+    }
+    /**
+     * Swap two elements in the heap
+     */
+    swap(i, j) {
+        const temp = this.heap[i];
+        this.heap[i] = this.heap[j];
+        this.heap[j] = temp;
+    }
+}
+exports.PriorityQueue = PriorityQueue;
+//# sourceMappingURL=PriorityQueue.js.map

package/dist/core/orchestration/PriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../../src/core/orchestration/PriorityQueue.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAOH,MAAa,aAAa;IAA1B;QACU,SAAI,GAAmB,EAAE,CAAC;IAmIpC,CAAC;IAjIC;;;;OAIG;IACH,OAAO,CAAC,IAAO,EAAE,QAAgB;QAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC,IAAI,CAAC;QAC/B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAEnB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,OAAO;QACL,qDAAqD;QACrD,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;aAClB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,sDAAsD;IAEtD;;OAEG;IACK,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhD,+CAA+C;YAC/C,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACjE,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YAC9B,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAa;QAC9B,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAChC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACjC,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,2CAA2C;YAC3C,IACE,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC5B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC3D,CAAC;gBACD,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;YAED,IACE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBAC7B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAC5D,CAAC;gBACD,OAAO,GAAG,UAAU,CAAC;YACvB,CAAC;YAED,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;gBACtB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1B,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACtB,CAAC;CACF;AApID,sCAoIC"}