bunqueue 1.0.0

package/dist/application/webhookManager.js

@@ -0,0 +1,109 @@
+/**
+ * Webhook Manager
+ * Manages webhooks and sends HTTP callbacks
+ */
+import { createWebhook, } from '../domain/types/webhook';
+/** HMAC-SHA256 signature */
+async function signPayload(payload, secret) {
+    const encoder = new TextEncoder();
+    const key = await crypto.subtle.importKey('raw', encoder.encode(secret), { name: 'HMAC', hash: 'SHA-256' }, false, ['sign']);
+    const signature = await crypto.subtle.sign('HMAC', key, encoder.encode(payload));
+    return Array.from(new Uint8Array(signature))
+        .map((b) => b.toString(16).padStart(2, '0'))
+        .join('');
+}
+/**
+ * Webhook Manager
+ */
+export class WebhookManager {
+    webhooks = new Map();
+    maxRetries = 3;
+    retryDelay = 1000;
+    /** Add a webhook */
+    add(url, events, queue, secret) {
+        const webhook = createWebhook(url, events, queue, secret);
+        this.webhooks.set(webhook.id, webhook);
+        console.log(`[Webhook] Added webhook ${webhook.id} for ${events.join(', ')}`);
+        return webhook;
+    }
+    /** Remove a webhook */
+    remove(id) {
+        const removed = this.webhooks.delete(id);
+        if (removed) {
+            console.log(`[Webhook] Removed webhook ${id}`);
+        }
+        return removed;
+    }
+    /** Get webhook by ID */
+    get(id) {
+        return this.webhooks.get(id);
+    }
+    /** List all webhooks */
+    list() {
+        return Array.from(this.webhooks.values());
+    }
+    /** Trigger webhooks for an event */
+    async trigger(event, jobId, queue, extra) {
+        const payload = {
+            event,
+            timestamp: Date.now(),
+            jobId,
+            queue,
+            ...extra,
+        };
+        const matchingWebhooks = Array.from(this.webhooks.values()).filter((wh) => wh.enabled && wh.events.includes(event) && (wh.queue === null || wh.queue === queue));
+        // Fire and forget - don't block
+        for (const webhook of matchingWebhooks) {
+            this.sendWebhook(webhook, payload).catch((err) => {
+                console.error(`[Webhook] Failed to send to ${webhook.url}:`, err);
+            });
+        }
+    }
+    /** Send webhook with retries */
+    async sendWebhook(webhook, payload) {
+        const body = JSON.stringify(payload);
+        const headers = {
+            'Content-Type': 'application/json',
+            'X-Webhook-Event': payload.event,
+            'X-Webhook-Timestamp': String(payload.timestamp),
+        };
+        // Add signature if secret is set
+        if (webhook.secret) {
+            headers['X-Webhook-Signature'] = await signPayload(body, webhook.secret);
+        }
+        let lastError = null;
+        for (let attempt = 0; attempt < this.maxRetries; attempt++) {
+            try {
+                const response = await fetch(webhook.url, {
+                    method: 'POST',
+                    headers,
+                    body,
+                    signal: AbortSignal.timeout(10000),
+                });
+                if (response.ok) {
+                    webhook.lastTriggered = Date.now();
+                    webhook.successCount++;
+                    return;
+                }
+                lastError = new Error(`HTTP ${response.status}`);
+            }
+            catch (err) {
+                lastError = err instanceof Error ? err : new Error(String(err));
+            }
+            // Wait before retry
+            if (attempt < this.maxRetries - 1) {
+                await new Promise((r) => setTimeout(r, this.retryDelay * (attempt + 1)));
+            }
+        }
+        webhook.failureCount++;
+        throw lastError ?? new Error('Webhook delivery failed after max retries');
+    }
+    /** Get stats */
+    getStats() {
+        return {
+            total: this.webhooks.size,
+            enabled: Array.from(this.webhooks.values()).filter((w) => w.enabled).length,
+        };
+    }
+}
+//# sourceMappingURL=webhookManager.js.map

package/dist/application/webhookManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"webhookManager.js","sourceRoot":"","sources":["../../src/application/webhookManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAKL,aAAa,GACd,MAAM,yBAAyB,CAAC;AAEjC,4BAA4B;AAC5B,KAAK,UAAU,WAAW,CAAC,OAAe,EAAE,MAAc;IACxD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;IAClC,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,CACvC,KAAK,EACL,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EACtB,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EACjC,KAAK,EACL,CAAC,MAAM,CAAC,CACT,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACjF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SAC3C,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,cAAc;IACjB,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IACzC,UAAU,GAAG,CAAC,CAAC;IACf,UAAU,GAAG,IAAI,CAAC;IAE1B,oBAAoB;IACpB,GAAG,CAAC,GAAW,EAAE,MAAgB,EAAE,KAAc,EAAE,MAAe;QAChE,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACvC,OAAO,CAAC,GAAG,CAAC,2BAA2B,OAAO,CAAC,EAAE,QAAQ,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC9E,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uBAAuB;IACvB,MAAM,CAAC,EAAa;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,GAAG,CAAC,6BAA6B,EAAE,EAAE,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,wBAAwB;IACxB,GAAG,CAAC,EAAa;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,wBAAwB;IACxB,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,oCAAoC;IACpC,KAAK,CAAC,OAAO,CACX,KAAmB,EACnB,KAAa,EACb,KAAa,EACb,KAA6D;QAE7D,MAAM,OAAO,GAAmB;YAC9B,KAAK;YACL,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,KAAK;YACL,KAAK;YACL,GAAG,KAAK;SACT,CAAC;QAEF,MAAM,gBAAgB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAChE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,EAAE,CAAC,KAAK,KAAK,KAAK,CAAC,CAC7F,CAAC;QAEF,gCAAgC;QAChC,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;gBACxD,OAAO,CAAC,KAAK,CAAC,+BAA+B,OAAO,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gCAAgC;IACxB,KAAK,CAAC,WAAW,CAAC,OAAgB,EAAE,OAAuB;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,OAAO,GAA2B;YACtC,cAAc,EAAE,kBAAkB;YAClC,iBAAiB,EAAE,OAAO,CAAC,KAAK;YAChC,qBAAqB,EAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;SACjD,CAAC;QAEF,iCAAiC;QACjC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,OAAO,CAAC,qBAAqB,CAAC,GAAG,MAAM,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,SAAS,GAAiB,IAAI,CAAC;QACnC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;YAC3D,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE;oBACxC,MAAM,EAAE,MAAM;oBACd,OAAO;oBACP,IAAI;oBACJ,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC;iBACnC,CAAC,CAAC;gBAEH,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBAChB,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBACnC,OAAO,CAAC,YAAY,EAAE,CAAC;oBACvB,OAAO;gBACT,CAAC;gBAED,SAAS,GAAG,IAAI,KAAK,CAAC,QAAQ,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;YACnD,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,SAAS,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,CAAC;YAED,oBAAoB;YACpB,IAAI,OAAO,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QAED,OAAO,CAAC,YAAY,EAAE,CAAC;QACvB,MAAM,SAAS,IAAI,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAC5E,CAAC;IAED,gBAAgB;IAChB,QAAQ;QACN,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YACzB,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM;SAC5E,CAAC;IACJ,CAAC;CACF"}

package/dist/application/workerManager.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Worker Manager
+ * Tracks connected workers and their status
+ */
+import { type Worker, type WorkerId } from '../domain/types/worker';
+/**
+ * Worker Manager
+ */
+export declare class WorkerManager {
+    private workers;
+    private cleanupInterval;
+    constructor();
+    /** Register a new worker */
+    register(name: string, queues: string[]): Worker;
+    /** Unregister a worker */
+    unregister(id: WorkerId): boolean;
+    /** Get worker by ID */
+    get(id: WorkerId): Worker | undefined;
+    /** Update worker last seen time */
+    heartbeat(id: WorkerId): boolean;
+    /** Increment active jobs count */
+    incrementActive(id: WorkerId): void;
+    /** Decrement active jobs and increment processed */
+    jobCompleted(id: WorkerId): void;
+    /** Decrement active jobs and increment failed */
+    jobFailed(id: WorkerId): void;
+    /** List all workers */
+    list(): Worker[];
+    /** List active workers (seen recently) */
+    listActive(): Worker[];
+    /** Get workers for a specific queue */
+    getForQueue(queue: string): Worker[];
+    /** Start cleanup interval */
+    private startCleanup;
+    /** Remove stale workers */
+    private cleanupStale;
+    /** Stop cleanup */
+    stop(): void;
+    /** Get stats */
+    getStats(): {
+        total: number;
+        active: number;
+        totalProcessed: number;
+        totalFailed: number;
+        activeJobs: number;
+    };
+}
+//# sourceMappingURL=workerManager.d.ts.map

package/dist/application/workerManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workerManager.d.ts","sourceRoot":"","sources":["../../src/application/workerManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,MAAM,EAAE,KAAK,QAAQ,EAAgB,MAAM,wBAAwB,CAAC;AAKlF;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAA+B;IAC9C,OAAO,CAAC,eAAe,CAA+C;;IAMtE,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAShD,0BAA0B;IAC1B,UAAU,CAAC,EAAE,EAAE,QAAQ,GAAG,OAAO;IAQjC,uBAAuB;IACvB,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,MAAM,GAAG,SAAS;IAIrC,mCAAmC;IACnC,SAAS,CAAC,EAAE,EAAE,QAAQ,GAAG,OAAO;IAOhC,kCAAkC;IAClC,eAAe,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI;IAQnC,oDAAoD;IACpD,YAAY,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI;IAShC,iDAAiD;IACjD,SAAS,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI;IAS7B,uBAAuB;IACvB,IAAI,IAAI,MAAM,EAAE;IAIhB,0CAA0C;IAC1C,UAAU,IAAI,MAAM,EAAE;IAKtB,uCAAuC;IACvC,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE;IAIpC,6BAA6B;IAC7B,OAAO,CAAC,YAAY;IAMpB,2BAA2B;IAC3B,OAAO,CAAC,YAAY;IAYpB,mBAAmB;IACnB,IAAI,IAAI,IAAI;IAOZ,gBAAgB;IAChB,QAAQ;;;;;;;CAaT"}

package/dist/application/workerManager.js

@@ -0,0 +1,121 @@
+/**
+ * Worker Manager
+ * Tracks connected workers and their status
+ */
+import { createWorker } from '../domain/types/worker';
+/** Worker timeout - consider dead after this many ms without heartbeat */
+const WORKER_TIMEOUT_MS = 30_000;
+/**
+ * Worker Manager
+ */
+export class WorkerManager {
+    workers = new Map();
+    cleanupInterval = null;
+    constructor() {
+        this.startCleanup();
+    }
+    /** Register a new worker */
+    register(name, queues) {
+        const worker = createWorker(name, queues);
+        this.workers.set(worker.id, worker);
+        console.log(`[Worker] Registered worker ${worker.id} (${name}) for queues: ${queues.join(', ')}`);
+        return worker;
+    }
+    /** Unregister a worker */
+    unregister(id) {
+        const removed = this.workers.delete(id);
+        if (removed) {
+            console.log(`[Worker] Unregistered worker ${id}`);
+        }
+        return removed;
+    }
+    /** Get worker by ID */
+    get(id) {
+        return this.workers.get(id);
+    }
+    /** Update worker last seen time */
+    heartbeat(id) {
+        const worker = this.workers.get(id);
+        if (!worker)
+            return false;
+        worker.lastSeen = Date.now();
+        return true;
+    }
+    /** Increment active jobs count */
+    incrementActive(id) {
+        const worker = this.workers.get(id);
+        if (worker) {
+            worker.activeJobs++;
+            worker.lastSeen = Date.now();
+        }
+    }
+    /** Decrement active jobs and increment processed */
+    jobCompleted(id) {
+        const worker = this.workers.get(id);
+        if (worker) {
+            worker.activeJobs = Math.max(0, worker.activeJobs - 1);
+            worker.processedJobs++;
+            worker.lastSeen = Date.now();
+        }
+    }
+    /** Decrement active jobs and increment failed */
+    jobFailed(id) {
+        const worker = this.workers.get(id);
+        if (worker) {
+            worker.activeJobs = Math.max(0, worker.activeJobs - 1);
+            worker.failedJobs++;
+            worker.lastSeen = Date.now();
+        }
+    }
+    /** List all workers */
+    list() {
+        return Array.from(this.workers.values());
+    }
+    /** List active workers (seen recently) */
+    listActive() {
+        const now = Date.now();
+        return Array.from(this.workers.values()).filter((w) => now - w.lastSeen < WORKER_TIMEOUT_MS);
+    }
+    /** Get workers for a specific queue */
+    getForQueue(queue) {
+        return Array.from(this.workers.values()).filter((w) => w.queues.includes(queue));
+    }
+    /** Start cleanup interval */
+    startCleanup() {
+        this.cleanupInterval = setInterval(() => {
+            this.cleanupStale();
+        }, 60_000);
+    }
+    /** Remove stale workers */
+    cleanupStale() {
+        const now = Date.now();
+        const staleTimeout = WORKER_TIMEOUT_MS * 3; // Give extra time before removal
+        for (const [id, worker] of this.workers) {
+            if (now - worker.lastSeen > staleTimeout) {
+                this.workers.delete(id);
+                console.log(`[Worker] Removed stale worker ${id} (${worker.name})`);
+            }
+        }
+    }
+    /** Stop cleanup */
+    stop() {
+        if (this.cleanupInterval) {
+            clearInterval(this.cleanupInterval);
+            this.cleanupInterval = null;
+        }
+    }
+    /** Get stats */
+    getStats() {
+        const workers = Array.from(this.workers.values());
+        const now = Date.now();
+        const active = workers.filter((w) => now - w.lastSeen < WORKER_TIMEOUT_MS);
+        return {
+            total: workers.length,
+            active: active.length,
+            totalProcessed: workers.reduce((sum, w) => sum + w.processedJobs, 0),
+            totalFailed: workers.reduce((sum, w) => sum + w.failedJobs, 0),
+            activeJobs: workers.reduce((sum, w) => sum + w.activeJobs, 0),
+        };
+    }
+}
+//# sourceMappingURL=workerManager.js.map

package/dist/application/workerManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workerManager.js","sourceRoot":"","sources":["../../src/application/workerManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAA8B,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAElF,0EAA0E;AAC1E,MAAM,iBAAiB,GAAG,MAAM,CAAC;AAEjC;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IACtC,eAAe,GAA0C,IAAI,CAAC;IAEtE;QACE,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,4BAA4B;IAC5B,QAAQ,CAAC,IAAY,EAAE,MAAgB;QACrC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CACT,8BAA8B,MAAM,CAAC,EAAE,KAAK,IAAI,iBAAiB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACrF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0BAA0B;IAC1B,UAAU,CAAC,EAAY;QACrB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,GAAG,CAAC,gCAAgC,EAAE,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uBAAuB;IACvB,GAAG,CAAC,EAAY;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,mCAAmC;IACnC,SAAS,CAAC,EAAY;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC1B,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,kCAAkC;IAClC,eAAe,CAAC,EAAY;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,YAAY,CAAC,EAAY;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,aAAa,EAAE,CAAC;YACvB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,SAAS,CAAC,EAAY;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YACvD,MAAM,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,IAAI;QACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,0CAA0C;IAC1C,UAAU;QACR,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC;IAC/F,CAAC;IAED,uCAAuC;IACvC,WAAW,CAAC,KAAa;QACvB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,6BAA6B;IACrB,YAAY;QAClB,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,EAAE;YACtC,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,CAAC,EAAE,MAAM,CAAC,CAAC;IACb,CAAC;IAED,2BAA2B;IACnB,YAAY;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,YAAY,GAAG,iBAAiB,GAAG,CAAC,CAAC,CAAC,iCAAiC;QAE7E,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,GAAG,YAAY,EAAE,CAAC;gBACzC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,iCAAiC,EAAE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,IAAI;QACF,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,aAAa,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YACpC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,gBAAgB;IAChB,QAAQ;QACN,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAClD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC;QAE3E,OAAO;YACL,KAAK,EAAE,OAAO,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,cAAc,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;YACpE,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YAC9D,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;SAC9D,CAAC;IACJ,CAAC;CACF"}

package/dist/domain/queue/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Queue domain barrel export
+ */
+export * from './priorityQueue';
+export * from './shard';
+//# sourceMappingURL=index.d.ts.map

package/dist/domain/queue/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/domain/queue/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,SAAS,CAAC"}

package/dist/domain/queue/index.js

@@ -0,0 +1,6 @@
+/**
+ * Queue domain barrel export
+ */
+export * from './priorityQueue';
+export * from './shard';
+//# sourceMappingURL=index.js.map

package/dist/domain/queue/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/domain/queue/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,iBAAiB,CAAC;AAChC,cAAc,SAAS,CAAC"}

package/dist/domain/queue/priorityQueue.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Indexed Priority Queue
+ * Combines binary heap for O(log n) priority operations
+ * with Map for O(1) lookups by job ID
+ */
+import type { Job, JobId } from '../types/job';
+/**
+ * Indexed Priority Queue implementation
+ * O(log n) push, pop, update
+ * O(1) find, has
+ */
+export declare class IndexedPriorityQueue {
+    private heap;
+    private index;
+    private generation;
+    /** Get current size */
+    get size(): number;
+    /** Check if empty */
+    get isEmpty(): boolean;
+    /** Push a job into the queue */
+    push(job: Job): void;
+    /** Pop the highest priority job */
+    pop(): Job | null;
+    /** Peek at the highest priority job without removing */
+    peek(): Job | null;
+    /** Find a job by ID - O(1) */
+    find(jobId: JobId): Job | null;
+    /** Check if job exists - O(1) */
+    has(jobId: JobId): boolean;
+    /** Remove a job by ID - O(1) for index, heap cleans lazily */
+    remove(jobId: JobId): Job | null;
+    /** Update job priority - O(log n) */
+    updatePriority(jobId: JobId, newPriority: number): boolean;
+    /** Update job runAt (for delay changes) - O(log n) */
+    updateRunAt(jobId: JobId, newRunAt: number): boolean;
+    /** Get all jobs (for iteration) */
+    values(): Job[];
+    /** Clear the queue */
+    clear(): void;
+    private removeTop;
+    private bubbleUp;
+    private bubbleDown;
+    private swap;
+}
+//# sourceMappingURL=priorityQueue.d.ts.map

package/dist/domain/queue/priorityQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priorityQueue.d.ts","sourceRoot":"","sources":["../../../src/domain/queue/priorityQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AA+B/C;;;;GAIG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,IAAI,CAAmB;IAC/B,OAAO,CAAC,KAAK,CAA2D;IACxE,OAAO,CAAC,UAAU,CAAM;IAExB,uBAAuB;IACvB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,qBAAqB;IACrB,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,gCAAgC;IAChC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI;IAkBpB,mCAAmC;IACnC,GAAG,IAAI,GAAG,GAAG,IAAI;IAmBjB,wDAAwD;IACxD,IAAI,IAAI,GAAG,GAAG,IAAI;IAgBlB,8BAA8B;IAC9B,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,GAAG,IAAI;IAI9B,iCAAiC;IACjC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO;IAI1B,8DAA8D;IAC9D,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,GAAG,IAAI;IAShC,qCAAqC;IACrC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAyB1D,sDAAsD;IACtD,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAyBpD,mCAAmC;IACnC,MAAM,IAAI,GAAG,EAAE;IAIf,sBAAsB;IACtB,KAAK,IAAI,IAAI;IAQb,OAAO,CAAC,SAAS;IASjB,OAAO,CAAC,QAAQ;IAWhB,OAAO,CAAC,UAAU;IAoBlB,OAAO,CAAC,IAAI;CAKb"}

package/dist/domain/queue/priorityQueue.js

@@ -0,0 +1,203 @@
+/**
+ * Indexed Priority Queue
+ * Combines binary heap for O(log n) priority operations
+ * with Map for O(1) lookups by job ID
+ */
+/**
+ * Compare two heap entries
+ * Order: higher priority first, earlier runAt first, LIFO/FIFO by ID
+ */
+function compareEntries(a, b) {
+    // Higher priority first
+    if (a.priority !== b.priority) {
+        return b.priority - a.priority;
+    }
+    // Earlier runAt first (for delayed jobs)
+    if (a.runAt !== b.runAt) {
+        return a.runAt - b.runAt;
+    }
+    // LIFO: higher ID first, FIFO: lower ID first
+    if (a.lifo) {
+        return Number(b.jobId - a.jobId);
+    }
+    return Number(a.jobId - b.jobId);
+}
+/**
+ * Indexed Priority Queue implementation
+ * O(log n) push, pop, update
+ * O(1) find, has
+ */
+export class IndexedPriorityQueue {
+    heap = [];
+    index = new Map();
+    generation = 0n;
+    /** Get current size */
+    get size() {
+        return this.index.size;
+    }
+    /** Check if empty */
+    get isEmpty() {
+        return this.index.size === 0;
+    }
+    /** Push a job into the queue */
+    push(job) {
+        const gen = Number(this.generation++);
+        // Store in index
+        this.index.set(job.id, { job, generation: gen });
+        // Add to heap
+        const entry = {
+            jobId: job.id,
+            priority: job.priority,
+            runAt: job.runAt,
+            lifo: job.lifo,
+            generation: gen,
+        };
+        this.heap.push(entry);
+        this.bubbleUp(this.heap.length - 1);
+    }
+    /** Pop the highest priority job */
+    pop() {
+        while (this.heap.length > 0) {
+            const entry = this.heap[0];
+            const indexed = this.index.get(entry.jobId);
+            // Skip stale entries (generation mismatch = updated or removed)
+            if (indexed?.generation !== entry.generation) {
+                this.removeTop();
+                continue;
+            }
+            // Remove from both structures
+            this.removeTop();
+            this.index.delete(entry.jobId);
+            return indexed.job;
+        }
+        return null;
+    }
+    /** Peek at the highest priority job without removing */
+    peek() {
+        while (this.heap.length > 0) {
+            const entry = this.heap[0];
+            const indexed = this.index.get(entry.jobId);
+            // Skip stale entries
+            if (indexed?.generation !== entry.generation) {
+                this.removeTop();
+                continue;
+            }
+            return indexed.job;
+        }
+        return null;
+    }
+    /** Find a job by ID - O(1) */
+    find(jobId) {
+        return this.index.get(jobId)?.job ?? null;
+    }
+    /** Check if job exists - O(1) */
+    has(jobId) {
+        return this.index.has(jobId);
+    }
+    /** Remove a job by ID - O(1) for index, heap cleans lazily */
+    remove(jobId) {
+        const indexed = this.index.get(jobId);
+        if (!indexed)
+            return null;
+        this.index.delete(jobId);
+        // Heap entry becomes stale, will be skipped on pop
+        return indexed.job;
+    }
+    /** Update job priority - O(log n) */
+    updatePriority(jobId, newPriority) {
+        const indexed = this.index.get(jobId);
+        if (!indexed)
+            return false;
+        // Update job
+        const job = indexed.job;
+        job.priority = newPriority;
+        // Create new heap entry with new generation
+        const gen = Number(this.generation++);
+        indexed.generation = gen;
+        const entry = {
+            jobId: job.id,
+            priority: newPriority,
+            runAt: job.runAt,
+            lifo: job.lifo,
+            generation: gen,
+        };
+        this.heap.push(entry);
+        this.bubbleUp(this.heap.length - 1);
+        return true;
+    }
+    /** Update job runAt (for delay changes) - O(log n) */
+    updateRunAt(jobId, newRunAt) {
+        const indexed = this.index.get(jobId);
+        if (!indexed)
+            return false;
+        // Update job
+        const job = indexed.job;
+        job.runAt = newRunAt;
+        // Create new heap entry
+        const gen = Number(this.generation++);
+        indexed.generation = gen;
+        const entry = {
+            jobId: job.id,
+            priority: job.priority,
+            runAt: newRunAt,
+            lifo: job.lifo,
+            generation: gen,
+        };
+        this.heap.push(entry);
+        this.bubbleUp(this.heap.length - 1);
+        return true;
+    }
+    /** Get all jobs (for iteration) */
+    values() {
+        return Array.from(this.index.values()).map((v) => v.job);
+    }
+    /** Clear the queue */
+    clear() {
+        this.heap = [];
+        this.index.clear();
+        this.generation = 0n;
+    }
+    // ============ Heap Operations ============
+    removeTop() {
+        if (this.heap.length <= 1) {
+            this.heap.pop();
+            return;
+        }
+        this.heap[0] = this.heap.pop();
+        this.bubbleDown(0);
+    }
+    bubbleUp(idx) {
+        while (idx > 0) {
+            const parentIdx = Math.floor((idx - 1) / 2);
+            if (compareEntries(this.heap[idx], this.heap[parentIdx]) >= 0) {
+                break;
+            }
+            this.swap(idx, parentIdx);
+            idx = parentIdx;
+        }
+    }
+    bubbleDown(idx) {
+        const length = this.heap.length;
+        while (true) {
+            const leftIdx = 2 * idx + 1;
+            const rightIdx = 2 * idx + 2;
+            let smallest = idx;
+            if (leftIdx < length && compareEntries(this.heap[leftIdx], this.heap[smallest]) < 0) {
+                smallest = leftIdx;
+            }
+            if (rightIdx < length && compareEntries(this.heap[rightIdx], this.heap[smallest]) < 0) {
+                smallest = rightIdx;
+            }
+            if (smallest === idx)
+                break;
+            this.swap(idx, smallest);
+            idx = smallest;
+        }
+    }
+    swap(i, j) {
+        const temp = this.heap[i];
+        this.heap[i] = this.heap[j];
+        this.heap[j] = temp;
+    }
+}
+//# sourceMappingURL=priorityQueue.js.map

package/dist/domain/queue/priorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priorityQueue.js","sourceRoot":"","sources":["../../../src/domain/queue/priorityQueue.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAaH;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAY,EAAE,CAAY;IAChD,wBAAwB;IACxB,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC9B,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;IACjC,CAAC;IACD,yCAAyC;IACzC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,8CAA8C;IAC9C,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACX,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IACvB,IAAI,GAAgB,EAAE,CAAC;IACvB,KAAK,GAAiD,IAAI,GAAG,EAAE,CAAC;IAChE,UAAU,GAAG,EAAE,CAAC;IAExB,uBAAuB;IACvB,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,qBAAqB;IACrB,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,gCAAgC;IAChC,IAAI,CAAC,GAAQ;QACX,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QAEtC,iBAAiB;QACjB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAEjD,cAAc;QACd,MAAM,KAAK,GAAc;YACvB,KAAK,EAAE,GAAG,CAAC,EAAE;YACb,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG;SAChB,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,mCAAmC;IACnC,GAAG;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAE5C,gEAAgE;YAChE,IAAI,OAAO,EAAE,UAAU,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjB,SAAS;YACX,CAAC;YAED,8BAA8B;YAC9B,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/B,OAAO,OAAO,CAAC,GAAG,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wDAAwD;IACxD,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAE5C,qBAAqB;YACrB,IAAI,OAAO,EAAE,UAAU,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjB,SAAS;YACX,CAAC;YAED,OAAO,OAAO,CAAC,GAAG,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8BAA8B;IAC9B,IAAI,CAAC,KAAY;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC;IAC5C,CAAC;IAED,iCAAiC;IACjC,GAAG,CAAC,KAAY;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,8DAA8D;IAC9D,MAAM,CAAC,KAAY;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC;QAE1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzB,mDAAmD;QACnD,OAAO,OAAO,CAAC,GAAG,CAAC;IACrB,CAAC;IAED,qCAAqC;IACrC,cAAc,CAAC,KAAY,EAAE,WAAmB;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,aAAa;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QACvB,GAA4B,CAAC,QAAQ,GAAG,WAAW,CAAC;QAErD,4CAA4C;QAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACtC,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC;QAEzB,MAAM,KAAK,GAAc;YACvB,KAAK,EAAE,GAAG,CAAC,EAAE;YACb,QAAQ,EAAE,WAAW;YACrB,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG;SAChB,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sDAAsD;IACtD,WAAW,CAAC,KAAY,EAAE,QAAgB;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,aAAa;QACb,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QACxB,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC;QAErB,wBAAwB;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACtC,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC;QAEzB,MAAM,KAAK,GAAc;YACvB,KAAK,EAAE,GAAG,CAAC,EAAE;YACb,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,KAAK,EAAE,QAAQ;YACf,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG;SAChB,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEpC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mCAAmC;IACnC,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,sBAAsB;IACtB,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IAED,4CAA4C;IAEpC,SAAS;QACf,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAEO,QAAQ,CAAC,GAAW;QAC1B,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,MAAM;YACR,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;YAC1B,GAAG,GAAG,SAAS,CAAC;QAClB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,GAAW;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YAC5B,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YAC7B,IAAI,QAAQ,GAAG,GAAG,CAAC;YAEnB,IAAI,OAAO,GAAG,MAAM,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpF,QAAQ,GAAG,OAAO,CAAC;YACrB,CAAC;YACD,IAAI,QAAQ,GAAG,MAAM,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtF,QAAQ,GAAG,QAAQ,CAAC;YACtB,CAAC;YAED,IAAI,QAAQ,KAAK,GAAG;gBAAE,MAAM;YAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzB,GAAG,GAAG,QAAQ,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,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"}