bunqueue 1.1.3 → 1.2.0

package/README.md

@@ -59,6 +59,8 @@ bunqueue
 docker run -p 6789:6789 -p 6790:6790 ghcr.io/egeominotti/bunqueue
 ```
 
+<img src=".github/terminal.png" alt="bunqueue server running" width="600" />
+
 ### Production Setup
 
 For production, enable **persistence** and **authentication**:
@@ -672,6 +674,41 @@ curl -X POST http://localhost:6790/cron \
 | `DATA_PATH` | - | SQLite database path (in-memory if not set) |
 | `CORS_ALLOW_ORIGIN` | * | Allowed CORS origins |
 
+### S3 Backup Configuration
+
+| Variable | Default | Description |
+|----------|---------|-------------|
+| `S3_BACKUP_ENABLED` | 0 | Enable automated S3 backups (1/true) |
+| `S3_ACCESS_KEY_ID` | - | S3 access key |
+| `S3_SECRET_ACCESS_KEY` | - | S3 secret key |
+| `S3_BUCKET` | - | S3 bucket name |
+| `S3_REGION` | us-east-1 | S3 region |
+| `S3_ENDPOINT` | - | Custom endpoint for S3-compatible services |
+| `S3_BACKUP_INTERVAL` | 21600000 | Backup interval in ms (default: 6 hours) |
+| `S3_BACKUP_RETENTION` | 7 | Number of backups to retain |
+| `S3_BACKUP_PREFIX` | backups/ | Prefix for backup files |
+
+**Supported S3 Providers:**
+- AWS S3
+- Cloudflare R2: `S3_ENDPOINT=https://<account-id>.r2.cloudflarestorage.com`
+- MinIO: `S3_ENDPOINT=http://localhost:9000`
+- DigitalOcean Spaces: `S3_ENDPOINT=https://<region>.digitaloceanspaces.com`
+
+**CLI Commands:**
+```bash
+# Create backup immediately
+bunqueue backup now
+
+# List available backups
+bunqueue backup list
+
+# Restore from backup (requires --force)
+bunqueue backup restore backups/bunqueue-2024-01-15.db --force
+
+# Show backup status
+bunqueue backup status
+```
+
 ### Authentication
 
 Enable authentication by setting `AUTH_TOKENS`:

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

@@ -1 +1 @@
-{"version":3,"file":"dlqManager.d.ts","sourceRoot":"","sources":["../../src/application/dlqManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAGnD,iCAAiC;AACjC,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;CACnC;AAED,wBAAwB;AACxB,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,CAIhF;AAED,0BAA0B;AAC1B,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CA6BlF;AAED,8BAA8B;AAC9B,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM,CAGnE"}
+{"version":3,"file":"dlqManager.d.ts","sourceRoot":"","sources":["../../src/application/dlqManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAGnD,iCAAiC;AACjC,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;CACnC;AAED,wBAAwB;AACxB,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,GAAG,EAAE,CAIhF;AAED,0BAA0B;AAC1B,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,MAAM,CAqClF;AAED,8BAA8B;AAC9B,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM,CAGnE"}

package/dist/application/dlqManager.js

@@ -13,25 +13,33 @@ export function getDlqJobs(queue, ctx, count) {
 export function retryDlqJobs(queue, ctx, jobId) {
     const idx = shardIndex(queue);
     const shard = ctx.shards[idx];
+    const now = Date.now();
     if (jobId) {
+        // removeFromDlq already decrements dlq counter
         const job = shard.removeFromDlq(queue, jobId);
         if (job) {
             job.attempts = 0;
-            job.runAt = Date.now();
+            job.runAt = now;
             shard.getQueue(queue).push(job);
+            // Update running counters for O(1) stats and temporal index
+            const isDelayed = job.runAt > now;
+            shard.incrementQueued(job.id, isDelayed, job.createdAt, queue);
             ctx.jobIndex.set(job.id, { type: 'queue', shardIdx: idx, queueName: queue });
             return 1;
         }
         return 0;
     }
-    // Retry all
+    // Retry all - clearDlq already decrements dlq counter
     const jobs = shard.getDlq(queue);
     const count = jobs.length;
     shard.clearDlq(queue);
     for (const job of jobs) {
         job.attempts = 0;
-        job.runAt = Date.now();
+        job.runAt = now;
         shard.getQueue(queue).push(job);
+        // Update running counters for O(1) stats and temporal index
+        const isDelayed = job.runAt > now;
+        shard.incrementQueued(job.id, isDelayed, job.createdAt, queue);
         ctx.jobIndex.set(job.id, { type: 'queue', shardIdx: idx, queueName: queue });
     }
     return count;

package/dist/application/dlqManager.js.map

@@ -1 +1 @@
-{"version":3,"file":"dlqManager.js","sourceRoot":"","sources":["../../src/application/dlqManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAQ5C,wBAAwB;AACxB,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,GAAe,EAAE,KAAc;IACvE,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7C,CAAC;AAED,0BAA0B;AAC1B,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,GAAe,EAAE,KAAa;IACxE,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAE9B,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,GAAG,EAAE,CAAC;YACR,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;YACjB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;YAC7E,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,YAAY;IACZ,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;QACjB,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8BAA8B;AAC9B,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,GAAe;IACzD,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC"}
+{"version":3,"file":"dlqManager.js","sourceRoot":"","sources":["../../src/application/dlqManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAQ5C,wBAAwB;AACxB,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,GAAe,EAAE,KAAc;IACvE,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3C,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7C,CAAC;AAED,0BAA0B;AAC1B,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,GAAe,EAAE,KAAa;IACxE,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,IAAI,KAAK,EAAE,CAAC;QACV,+CAA+C;QAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,GAAG,EAAE,CAAC;YACR,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;YACjB,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC;YAChB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,4DAA4D;YAC5D,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC;YAClC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC/D,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;YAC7E,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sDAAsD;IACtD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAEtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;QACjB,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC;QAChB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,4DAA4D;QAC5D,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC;QAClC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC/D,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8BAA8B;AAC9B,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,GAAe;IACzD,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC"}

package/dist/application/eventsManager.d.ts

@@ -11,12 +11,21 @@ export type EventSubscriber = (event: JobEvent) => void;
 export declare class EventsManager {
     private readonly webhookManager;
     private readonly subscribers;
+    /** Waiters for specific job completions - for efficient WaitJob implementation */
+    private readonly completionWaiters;
     constructor(webhookManager: WebhookManager);
     /** Subscribe to job events */
     subscribe(callback: EventSubscriber): () => void;
     /** Clear all subscribers (for shutdown) */
     clear(): void;
-    /** Broadcast event to all subscribers */
+    /**
+     * Wait for a specific job to complete - event-driven, no polling
+     * Returns true if job completed, false if timeout
+     */
+    waitForJobCompletion(jobId: JobId, timeoutMs: number): Promise<boolean>;
+    /** Check if broadcast has any listeners - for batch optimizations */
+    needsBroadcast(): boolean;
+    /** Broadcast event to all subscribers - optimized to skip work when no listeners */
     broadcast(event: Partial<JobEvent> & {
         eventType: EventType;
         queue: string;

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

@@ -1 +1 @@
-{"version":3,"file":"eventsManager.d.ts","sourceRoot":"","sources":["../../src/application/eventsManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAIvD,gCAAgC;AAChC,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,QAAQ,KAAK,IAAI,CAAC;AAExD,2BAA2B;AAC3B,qBAAa,aAAa;IAGZ,OAAO,CAAC,QAAQ,CAAC,cAAc;IAF3C,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAyB;gBAExB,cAAc,EAAE,cAAc;IAE3D,8BAA8B;IAC9B,SAAS,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,IAAI;IAQhD,2CAA2C;IAC3C,KAAK,IAAI,IAAI;IAIb,yCAAyC;IACzC,SAAS,CACP,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG;QACzB,SAAS,EAAE,SAAS,CAAC;QACrB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,KAAK,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,GACA,IAAI;IA6BP,+CAA+C;IAC/C,OAAO,CAAC,iBAAiB;CAgB1B"}
+{"version":3,"file":"eventsManager.d.ts","sourceRoot":"","sources":["../../src/application/eventsManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjE,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAIvD,gCAAgC;AAChC,MAAM,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,QAAQ,KAAK,IAAI,CAAC;AAExD,2BAA2B;AAC3B,qBAAa,aAAa;IAKZ,OAAO,CAAC,QAAQ,CAAC,cAAc;IAJ3C,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAyB;IACrD,kFAAkF;IAClF,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAwC;gBAE7C,cAAc,EAAE,cAAc;IAE3D,8BAA8B;IAC9B,SAAS,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,IAAI;IAQhD,2CAA2C;IAC3C,KAAK,IAAI,IAAI;IAWb;;;OAGG;IACH,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA8BvE,qEAAqE;IACrE,cAAc,IAAI,OAAO;IAQzB,oFAAoF;IACpF,SAAS,CACP,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG;QACzB,SAAS,EAAE,SAAS,CAAC;QACrB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,KAAK,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,GACA,IAAI;IAuDP,+CAA+C;IAC/C,OAAO,CAAC,iBAAiB;CAgB1B"}

package/dist/application/eventsManager.js

@@ -7,6 +7,8 @@ import { webhookLog } from '../shared/logger';
 export class EventsManager {
     webhookManager;
     subscribers = [];
+    /** Waiters for specific job completions - for efficient WaitJob implementation */
+    completionWaiters = new Map();
     constructor(webhookManager) {
         this.webhookManager = webhookManager;
     }
@@ -22,34 +24,102 @@ export class EventsManager {
     /** Clear all subscribers (for shutdown) */
     clear() {
         this.subscribers.length = 0;
+        // Clear all waiters
+        for (const waiters of this.completionWaiters.values()) {
+            for (const resolve of waiters) {
+                resolve();
+            }
+        }
+        this.completionWaiters.clear();
+    }
+    /**
+     * Wait for a specific job to complete - event-driven, no polling
+     * Returns true if job completed, false if timeout
+     */
+    waitForJobCompletion(jobId, timeoutMs) {
+        const jobKey = String(jobId);
+        return new Promise((resolve) => {
+            const timer = setTimeout(() => {
+                // Timeout - remove from waiters
+                const waiters = this.completionWaiters.get(jobKey);
+                if (waiters) {
+                    const idx = waiters.indexOf(resolveWaiter);
+                    if (idx !== -1)
+                        waiters.splice(idx, 1);
+                    if (waiters.length === 0)
+                        this.completionWaiters.delete(jobKey);
+                }
+                resolve(false);
+            }, timeoutMs);
+            const resolveWaiter = () => {
+                clearTimeout(timer);
+                resolve(true);
+            };
+            // Add to waiters
+            let waiters = this.completionWaiters.get(jobKey);
+            if (!waiters) {
+                waiters = [];
+                this.completionWaiters.set(jobKey, waiters);
+            }
+            waiters.push(resolveWaiter);
+        });
     }
-    /** Broadcast event to all subscribers */
+    /** Check if broadcast has any listeners - for batch optimizations */
+    needsBroadcast() {
+        return (this.subscribers.length > 0 ||
+            this.webhookManager.hasEnabledWebhooks() ||
+            this.completionWaiters.size > 0);
+    }
+    /** Broadcast event to all subscribers - optimized to skip work when no listeners */
     broadcast(event) {
+        const hasSubscribers = this.subscribers.length > 0;
+        const hasWebhooks = this.webhookManager.hasEnabledWebhooks();
+        const isCompletion = event.eventType === "completed" /* EventType.Completed */;
+        const hasWaiters = isCompletion && this.completionWaiters.size > 0;
+        // Fast path: nothing to notify
+        if (!hasSubscribers && !hasWebhooks && !hasWaiters) {
+            return;
+        }
         // Notify subscribers
-        for (const sub of this.subscribers) {
-            try {
-                sub(event);
+        if (hasSubscribers) {
+            for (const sub of this.subscribers) {
+                try {
+                    sub(event);
+                }
+                catch {
+                    // Ignore subscriber errors
+                }
             }
-            catch {
-                // Ignore subscriber errors
+        }
+        // Notify completion waiters for WaitJob - O(1) lookup
+        if (hasWaiters) {
+            const jobKey = String(event.jobId);
+            const waiters = this.completionWaiters.get(jobKey);
+            if (waiters) {
+                this.completionWaiters.delete(jobKey);
+                for (const resolve of waiters) {
+                    resolve();
+                }
             }
         }
-        // Trigger webhooks
-        const webhookEvent = this.mapEventToWebhook(event.eventType);
-        if (webhookEvent) {
-            this.webhookManager
-                .trigger(webhookEvent, String(event.jobId), event.queue, {
-                data: event.data,
-                error: event.error,
-            })
-                .catch((err) => {
-                webhookLog.error('Webhook trigger failed', {
-                    event: webhookEvent,
-                    jobId: String(event.jobId),
-                    queue: event.queue,
-                    error: String(err),
+        // Trigger webhooks - only if there are enabled webhooks
+        if (hasWebhooks) {
+            const webhookEvent = this.mapEventToWebhook(event.eventType);
+            if (webhookEvent) {
+                this.webhookManager
+                    .trigger(webhookEvent, String(event.jobId), event.queue, {
+                    data: event.data,
+                    error: event.error,
+                })
+                    .catch((err) => {
+                    webhookLog.error('Webhook trigger failed', {
+                        event: webhookEvent,
+                        jobId: String(event.jobId),
+                        queue: event.queue,
+                        error: String(err),
+                    });
                 });
-            });
+            }
         }
     }
     /** Map internal event type to webhook event */

package/dist/application/eventsManager.js.map

@@ -1 +1 @@
-{"version":3,"file":"eventsManager.js","sourceRoot":"","sources":["../../src/application/eventsManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAK9C,2BAA2B;AAC3B,MAAM,OAAO,aAAa;IAGK;IAFZ,WAAW,GAAsB,EAAE,CAAC;IAErD,YAA6B,cAA8B;QAA9B,mBAAc,GAAd,cAAc,CAAgB;IAAG,CAAC;IAE/D,8BAA8B;IAC9B,SAAS,CAAC,QAAyB;QACjC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,OAAO,GAAG,EAAE;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC/C,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;IACJ,CAAC;IAED,2CAA2C;IAC3C,KAAK;QACH,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,yCAAyC;IACzC,SAAS,CACP,KAMC;QAED,qBAAqB;QACrB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACnC,IAAI,CAAC;gBACH,GAAG,CAAC,KAAiB,CAAC,CAAC;YACzB,CAAC;YAAC,MAAM,CAAC;gBACP,2BAA2B;YAC7B,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC7D,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,cAAc;iBAChB,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE;gBACvD,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,KAAK,EAAE,KAAK,CAAC,KAAK;aACnB,CAAC;iBACD,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;gBACtB,UAAU,CAAC,KAAK,CAAC,wBAAwB,EAAE;oBACzC,KAAK,EAAE,YAAY;oBACnB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;oBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC;iBACnB,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IAED,+CAA+C;IACvC,iBAAiB,CAAC,SAAoB;QAC5C,QAAQ,SAAS,EAAE,CAAC;YAClB;gBACE,OAAO,YAAY,CAAC;YACtB;gBACE,OAAO,aAAa,CAAC;YACvB;gBACE,OAAO,eAAe,CAAC;YACzB;gBACE,OAAO,YAAY,CAAC;YACtB,yCAAwB;YACxB;gBACE,2CAA2C;gBAC3C,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"eventsManager.js","sourceRoot":"","sources":["../../src/application/eventsManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAK9C,2BAA2B;AAC3B,MAAM,OAAO,aAAa;IAKK;IAJZ,WAAW,GAAsB,EAAE,CAAC;IACrD,kFAAkF;IACjE,iBAAiB,GAAG,IAAI,GAAG,EAA6B,CAAC;IAE1E,YAA6B,cAA8B;QAA9B,mBAAc,GAAd,cAAc,CAAgB;IAAG,CAAC;IAE/D,8BAA8B;IAC9B,SAAS,CAAC,QAAyB;QACjC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,OAAO,GAAG,EAAE;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC/C,IAAI,GAAG,KAAK,CAAC,CAAC;gBAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;IACJ,CAAC;IAED,2CAA2C;IAC3C,KAAK;QACH,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,oBAAoB;QACpB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,EAAE,CAAC;YACtD,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;gBAC9B,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,KAAY,EAAE,SAAiB;QAClD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAE7B,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC5B,gCAAgC;gBAChC,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACnD,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;oBAC3C,IAAI,GAAG,KAAK,CAAC,CAAC;wBAAE,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;wBAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAClE,CAAC;gBACD,OAAO,CAAC,KAAK,CAAC,CAAC;YACjB,CAAC,EAAE,SAAS,CAAC,CAAC;YAEd,MAAM,aAAa,GAAG,GAAG,EAAE;gBACzB,YAAY,CAAC,KAAK,CAAC,CAAC;gBACpB,OAAO,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC,CAAC;YAEF,iBAAiB;YACjB,IAAI,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC9C,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,qEAAqE;IACrE,cAAc;QACZ,OAAO,CACL,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YAC3B,IAAI,CAAC,cAAc,CAAC,kBAAkB,EAAE;YACxC,IAAI,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAChC,CAAC;IACJ,CAAC;IAED,oFAAoF;IACpF,SAAS,CACP,KAMC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACnD,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,kBAAkB,EAAE,CAAC;QAC7D,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS,0CAAwB,CAAC;QAC7D,MAAM,UAAU,GAAG,YAAY,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC;QAEnE,+BAA+B;QAC/B,IAAI,CAAC,cAAc,IAAI,CAAC,WAAW,IAAI,CAAC,UAAU,EAAE,CAAC;YACnD,OAAO;QACT,CAAC;QAED,qBAAqB;QACrB,IAAI,cAAc,EAAE,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACnC,IAAI,CAAC;oBACH,GAAG,CAAC,KAAiB,CAAC,CAAC;gBACzB,CAAC;gBAAC,MAAM,CAAC;oBACP,2BAA2B;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACtC,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;oBAC9B,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAC7D,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,CAAC,cAAc;qBAChB,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE;oBACvD,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,KAAK,EAAE,KAAK,CAAC,KAAK;iBACnB,CAAC;qBACD,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE;oBACtB,UAAU,CAAC,KAAK,CAAC,wBAAwB,EAAE;wBACzC,KAAK,EAAE,YAAY;wBACnB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;wBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;wBAClB,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC;qBACnB,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;YACP,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IACvC,iBAAiB,CAAC,SAAoB;QAC5C,QAAQ,SAAS,EAAE,CAAC;YAClB;gBACE,OAAO,YAAY,CAAC;YACtB;gBACE,OAAO,aAAa,CAAC;YACvB;gBACE,OAAO,eAAe,CAAC;YACzB;gBACE,OAAO,YAAY,CAAC;YACtB,yCAAwB;YACxB;gBACE,2CAA2C;gBAC3C,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;CACF"}

package/dist/application/operations/ack.d.ts

@@ -33,6 +33,12 @@ export interface AckContext {
         error?: string;
     }) => void;
     onJobCompleted: (jobId: JobId) => void;
+    /** Batch notify completions - more efficient than per-job calls */
+    onJobsCompleted?: (jobIds: JobId[]) => void;
+    /** Fast check if broadcast is needed - avoids function call overhead */
+    needsBroadcast?: () => boolean;
+    /** Check if any jobs are waiting for dependencies */
+    hasPendingDeps?: () => boolean;
 }
 /**
  * Acknowledge job completion
@@ -43,7 +49,16 @@ export declare function ackJob(jobId: JobId, result: unknown, ctx: AckContext):
  */
 export declare function failJob(jobId: JobId, error: string | undefined, ctx: AckContext): Promise<void>;
 /**
- * Acknowledge multiple jobs
+ * Acknowledge multiple jobs - optimized batch processing
+ * Groups jobs by shard to minimize lock acquisitions: O(shards) instead of O(n)
  */
 export declare function ackJobBatch(jobIds: JobId[], ctx: AckContext): Promise<void>;
+/**
+ * Acknowledge multiple jobs with individual results - optimized batch processing
+ * Same as ackJobBatch but supports passing result data for each job
+ */
+export declare function ackJobBatchWithResults(items: Array<{
+    id: JobId;
+    result: unknown;
+}>, ctx: AckContext): Promise<void>;
 //# sourceMappingURL=ack.d.ts.map

package/dist/application/operations/ack.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ack.d.ts","sourceRoot":"","sources":["../../../src/application/operations/ack.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,KAAK,EAA8B,MAAM,wBAAwB,CAAC;AAC1F,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yCAAyC,CAAC;AAC7E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEzD,4BAA4B;AAC5B,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,aAAa,GAAG,IAAI,CAAC;IAC9B,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,gBAAgB,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;IACpC,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IAC9B,UAAU,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAClC,cAAc,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAClC,WAAW,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/B,SAAS,EAAE,CAAC,KAAK,EAAE;QACjB,SAAS,EAAE,SAAS,CAAC;QACrB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,KAAK,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,CAAC,EAAE,OAAO,CAAC;QACf,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,KAAK,IAAI,CAAC;IACX,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC;CACxC;AAED;;GAEG;AACH,wBAAsB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAgD1F;AAED;;GAEG;AACH,wBAAsB,OAAO,CAC3B,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,GAAG,EAAE,UAAU,GACd,OAAO,CAAC,IAAI,CAAC,CAoDf;AAED;;GAEG;AACH,wBAAsB,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAIjF"}
+{"version":3,"file":"ack.d.ts","sourceRoot":"","sources":["../../../src/application/operations/ack.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,KAAK,EAA8B,MAAM,wBAAwB,CAAC;AAC1F,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yCAAyC,CAAC;AAC7E,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEzD,4BAA4B;AAC5B,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,aAAa,GAAG,IAAI,CAAC;IAC9B,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,gBAAgB,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;IACpC,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,aAAa,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IAC9B,UAAU,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,QAAQ,EAAE,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAClC,cAAc,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAClC,WAAW,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAC/B,SAAS,EAAE,CAAC,KAAK,EAAE;QACjB,SAAS,EAAE,SAAS,CAAC;QACrB,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,KAAK,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,CAAC,EAAE,OAAO,CAAC;QACf,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,KAAK,IAAI,CAAC;IACX,cAAc,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC;IACvC,mEAAmE;IACnE,eAAe,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;IAC5C,wEAAwE;IACxE,cAAc,CAAC,EAAE,MAAM,OAAO,CAAC;IAC/B,qDAAqD;IACrD,cAAc,CAAC,EAAE,MAAM,OAAO,CAAC;CAChC;AAED;;GAEG;AACH,wBAAsB,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAgD1F;AAED;;GAEG;AACH,wBAAsB,OAAO,CAC3B,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,GAAG,EAAE,UAAU,GACd,OAAO,CAAC,IAAI,CAAC,CAuDf;AAKD;;;GAGG;AAEH,wBAAsB,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CA8JjF;AAED;;;GAGG;AAEH,wBAAsB,sBAAsB,CAC1C,KAAK,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CAAC,EAC5C,GAAG,EAAE,UAAU,GACd,OAAO,CAAC,IAAI,CAAC,CA2If"}

package/dist/application/operations/ack.js

@@ -76,8 +76,11 @@ export async function failJob(jobId, error, ctx) {
         shard.releaseJobResources(job.queue, job.uniqueKey, job.groupId);
         if (canRetry(job)) {
             // Retry with exponential backoff
-            job.runAt = Date.now() + calculateBackoff(job);
+            const now = Date.now();
+            job.runAt = now + calculateBackoff(job);
             shard.getQueue(job.queue).push(job);
+            // Update running counters for O(1) stats (retry jobs are always delayed)
+            shard.incrementQueued(jobId, true, job.createdAt, job.queue);
             ctx.jobIndex.set(jobId, { type: 'queue', shardIdx: idx, queueName: job.queue });
             ctx.storage?.updateForRetry(job);
         }
@@ -88,7 +91,7 @@ export async function failJob(jobId, error, ctx) {
             ctx.totalFailed.value++;
         }
         else {
-            // Move to DLQ
+            // Move to DLQ (addToDlq already updates dlq counter)
             shard.addToDlq(job);
             ctx.jobIndex.set(jobId, { type: 'dlq', queueName: job.queue });
             ctx.storage?.markFailed(job, error ?? null);
@@ -104,12 +107,273 @@ export async function failJob(jobId, error, ctx) {
         error,
     });
 }
+/** Debug flag for ackBatch timing */
+const DEBUG_ACK_BATCH = process.env.DEBUG_ACK_BATCH === '1';
 /**
- * Acknowledge multiple jobs
+ * Acknowledge multiple jobs - optimized batch processing
+ * Groups jobs by shard to minimize lock acquisitions: O(shards) instead of O(n)
  */
+// eslint-disable-next-line complexity
 export async function ackJobBatch(jobIds, ctx) {
-    for (const id of jobIds) {
-        await ackJob(id, undefined, ctx);
+    if (jobIds.length === 0)
+        return;
+    // Small batches - use parallel individual acks (overhead of grouping not worth it)
+    if (jobIds.length <= 4) {
+        await Promise.all(jobIds.map((id) => ackJob(id, undefined, ctx)));
+        return;
+    }
+    const t0 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 1: Group jobs by processing shard
+    const byProcShard = new Map();
+    for (const jobId of jobIds) {
+        const procIdx = processingShardIndex(jobId);
+        let group = byProcShard.get(procIdx);
+        if (!group) {
+            group = [];
+            byProcShard.set(procIdx, group);
+        }
+        group.push(jobId);
+    }
+    const t1 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 2: Extract all jobs from processing shards (one lock per shard)
+    // Use arrays instead of Map for faster iteration in step 5
+    const extractedJobs = [];
+    await Promise.all(Array.from(byProcShard.entries()).map(async ([procIdx, ids]) => {
+        await withWriteLock(ctx.processingLocks[procIdx], () => {
+            for (const jobId of ids) {
+                const job = ctx.processingShards[procIdx].get(jobId);
+                if (job) {
+                    ctx.processingShards[procIdx].delete(jobId);
+                    extractedJobs.push({ id: jobId, job });
+                }
+            }
+        });
+    }));
+    const t2 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 3: Group extracted jobs by queue shard
+    const byQueueShard = new Map();
+    for (let i = 0; i < extractedJobs.length; i++) {
+        const job = extractedJobs[i].job;
+        const idx = shardIndex(job.queue);
+        let group = byQueueShard.get(idx);
+        if (!group) {
+            group = [];
+            byQueueShard.set(idx, group);
+        }
+        group.push(job);
+    }
+    const t3 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 4: Release resources for each queue shard (one lock per shard)
+    await Promise.all(Array.from(byQueueShard.entries()).map(async ([idx, jobs]) => {
+        await withWriteLock(ctx.shardLocks[idx], () => {
+            const shard = ctx.shards[idx];
+            for (const job of jobs) {
+                shard.releaseJobResources(job.queue, job.uniqueKey, job.groupId);
+            }
+        });
+    }));
+    const t4 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 5: Update indexes and metrics (no locks needed - single-threaded)
+    // Optimized: use indexed for loop (faster than for-of), minimize function calls
+    const now = Date.now();
+    const completedLocation = { type: 'completed' };
+    const storage = ctx.storage;
+    const hasStorage = storage !== null;
+    const jobCount = extractedJobs.length;
+    // Pre-check flags (check once, not per job)
+    const needsBroadcast = ctx.needsBroadcast?.() ?? true;
+    const hasPendingDeps = ctx.hasPendingDeps?.() ?? true;
+    const t5a = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Batch counter update (single BigInt operation instead of N increments)
+    ctx.totalCompleted.value += BigInt(jobCount);
+    const t5b = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Main loop - indexed for loop is faster than for-of on arrays
+    for (let i = 0; i < jobCount; i++) {
+        const { id: jobId, job } = extractedJobs[i];
+        if (!job.removeOnComplete) {
+            ctx.completedJobs.add(jobId);
+            ctx.jobIndex.set(jobId, completedLocation);
+            if (hasStorage)
+                storage.markCompleted(jobId, now);
+        }
+        else {
+            ctx.jobIndex.delete(jobId);
+            if (hasStorage)
+                storage.deleteJob(jobId);
+        }
+    }
+    const t5c = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Broadcast events (only if listeners exist)
+    if (needsBroadcast) {
+        const event = {
+            eventType: 'completed',
+            queue: '',
+            jobId: '',
+            timestamp: now,
+        };
+        for (let i = 0; i < jobCount; i++) {
+            const { id: jobId, job } = extractedJobs[i];
+            event.queue = job.queue;
+            event.jobId = jobId;
+            ctx.broadcast(event);
+        }
+    }
+    const t5d = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Batch notify completions (for dependency checking)
+    if (hasPendingDeps && ctx.onJobsCompleted) {
+        const completedIds = extractedJobs.map((e) => e.id);
+        ctx.onJobsCompleted(completedIds);
+    }
+    else if (hasPendingDeps) {
+        for (let i = 0; i < jobCount; i++) {
+            ctx.onJobCompleted(extractedJobs[i].id);
+        }
+    }
+    const t5 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    if (DEBUG_ACK_BATCH) {
+        console.log(`  Step 5 details:`);
+        console.log(`    5a checks:         ${(t5b - t5a).toFixed(2)}ms`);
+        console.log(`    5b main loop:      ${(t5c - t5b).toFixed(2)}ms`);
+        console.log(`    5c broadcast:      ${(t5d - t5c).toFixed(2)}ms (needsBroadcast=${needsBroadcast})`);
+        console.log(`    5d deps:           ${(t5 - t5d).toFixed(2)}ms (hasPendingDeps=${hasPendingDeps})`);
+    }
+    if (DEBUG_ACK_BATCH) {
+        console.log(`ackBatch timing (${jobIds.length} jobs):`);
+        console.log(`  Step 1 (group proc):    ${(t1 - t0).toFixed(2)}ms`);
+        console.log(`  Step 2 (extract):       ${(t2 - t1).toFixed(2)}ms`);
+        console.log(`  Step 3 (group queue):   ${(t3 - t2).toFixed(2)}ms`);
+        console.log(`  Step 4 (release):       ${(t4 - t3).toFixed(2)}ms`);
+        console.log(`  Step 5 (update idx):    ${(t5 - t4).toFixed(2)}ms`);
+        console.log(`  Total:                  ${(t5 - t0).toFixed(2)}ms`);
+    }
+}
+/**
+ * Acknowledge multiple jobs with individual results - optimized batch processing
+ * Same as ackJobBatch but supports passing result data for each job
+ */
+// eslint-disable-next-line complexity
+export async function ackJobBatchWithResults(items, ctx) {
+    if (items.length === 0)
+        return;
+    // Small batches - use parallel individual acks
+    if (items.length <= 4) {
+        await Promise.all(items.map((item) => ackJob(item.id, item.result, ctx)));
+        return;
+    }
+    const t0 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 1: Group jobs by processing shard
+    const byProcShard = new Map();
+    for (const item of items) {
+        const procIdx = processingShardIndex(item.id);
+        let group = byProcShard.get(procIdx);
+        if (!group) {
+            group = [];
+            byProcShard.set(procIdx, group);
+        }
+        group.push(item);
+    }
+    const t1 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 2: Extract all jobs from processing shards (one lock per shard)
+    // Keep result with each extracted job
+    const extractedJobs = [];
+    await Promise.all(Array.from(byProcShard.entries()).map(async ([procIdx, itemsInShard]) => {
+        await withWriteLock(ctx.processingLocks[procIdx], () => {
+            for (const item of itemsInShard) {
+                const job = ctx.processingShards[procIdx].get(item.id);
+                if (job) {
+                    ctx.processingShards[procIdx].delete(item.id);
+                    extractedJobs.push({ id: item.id, job, result: item.result });
+                }
+            }
+        });
+    }));
+    const t2 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 3: Group extracted jobs by queue shard
+    const byQueueShard = new Map();
+    for (let i = 0; i < extractedJobs.length; i++) {
+        const job = extractedJobs[i].job;
+        const idx = shardIndex(job.queue);
+        let group = byQueueShard.get(idx);
+        if (!group) {
+            group = [];
+            byQueueShard.set(idx, group);
+        }
+        group.push(job);
+    }
+    const t3 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 4: Release resources for each queue shard (one lock per shard)
+    await Promise.all(Array.from(byQueueShard.entries()).map(async ([idx, jobs]) => {
+        await withWriteLock(ctx.shardLocks[idx], () => {
+            const shard = ctx.shards[idx];
+            for (const job of jobs) {
+                shard.releaseJobResources(job.queue, job.uniqueKey, job.groupId);
+            }
+        });
+    }));
+    const t4 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    // Step 5: Update indexes, store results, and metrics
+    const now = Date.now();
+    const completedLocation = { type: 'completed' };
+    const storage = ctx.storage;
+    const hasStorage = storage !== null;
+    const jobCount = extractedJobs.length;
+    // Pre-check flags
+    const needsBroadcast = ctx.needsBroadcast?.() ?? true;
+    const hasPendingDeps = ctx.hasPendingDeps?.() ?? true;
+    // Batch counter update
+    ctx.totalCompleted.value += BigInt(jobCount);
+    // Main loop with result storage
+    for (let i = 0; i < jobCount; i++) {
+        const { id: jobId, job, result } = extractedJobs[i];
+        if (!job.removeOnComplete) {
+            ctx.completedJobs.add(jobId);
+            if (result !== undefined) {
+                ctx.jobResults.set(jobId, result);
+                if (hasStorage)
+                    storage.storeResult(jobId, result);
+            }
+            ctx.jobIndex.set(jobId, completedLocation);
+            if (hasStorage)
+                storage.markCompleted(jobId, now);
+        }
+        else {
+            ctx.jobIndex.delete(jobId);
+            if (hasStorage)
+                storage.deleteJob(jobId);
+        }
+    }
+    // Broadcast events with results (only if listeners exist)
+    if (needsBroadcast) {
+        for (let i = 0; i < jobCount; i++) {
+            const { id: jobId, job, result } = extractedJobs[i];
+            ctx.broadcast({
+                eventType: 'completed',
+                queue: job.queue,
+                jobId,
+                timestamp: now,
+                data: result,
+            });
+        }
+    }
+    // Batch notify completions (for dependency checking)
+    if (hasPendingDeps && ctx.onJobsCompleted) {
+        const completedIds = extractedJobs.map((e) => e.id);
+        ctx.onJobsCompleted(completedIds);
+    }
+    else if (hasPendingDeps) {
+        for (let i = 0; i < jobCount; i++) {
+            ctx.onJobCompleted(extractedJobs[i].id);
+        }
+    }
+    const t5 = DEBUG_ACK_BATCH ? performance.now() : 0;
+    if (DEBUG_ACK_BATCH) {
+        console.log(`ackBatchWithResults timing (${items.length} jobs):`);
+        console.log(`  Step 1 (group proc):    ${(t1 - t0).toFixed(2)}ms`);
+        console.log(`  Step 2 (extract):       ${(t2 - t1).toFixed(2)}ms`);
+        console.log(`  Step 3 (group queue):   ${(t3 - t2).toFixed(2)}ms`);
+        console.log(`  Step 4 (release):       ${(t4 - t3).toFixed(2)}ms`);
+        console.log(`  Step 5 (update+store):  ${(t5 - t4).toFixed(2)}ms`);
+        console.log(`  Total:                  ${(t5 - t0).toFixed(2)}ms`);
     }
 }
 //# sourceMappingURL=ack.js.map