bullmq 5.80.12 → 5.81.1

package/README.md

@@ -186,6 +186,8 @@ $ yarn add bullmq
 
 If you use the node-redis adapter (`createNodeRedisClient`), install `redis` v5 or newer (`redis >= 5.0.0`).
 
+If you use the Valkey Glide adapter (`createValkeyGlideClient`), install `@valkey/valkey-glide`.
+
 Add jobs to the queue:
 
 ```ts

package/dist/cjs/classes/index.js

@@ -11,6 +11,7 @@ tslib_1.__exportStar(require("./flow-producer"), exports);
 tslib_1.__exportStar(require("./ioredis-client"), exports);
 tslib_1.__exportStar(require("./node-redis-client"), exports);
 tslib_1.__exportStar(require("./bun-redis-client"), exports);
+tslib_1.__exportStar(require("./valkey-glide-client"), exports);
 tslib_1.__exportStar(require("./job"), exports);
 tslib_1.__exportStar(require("./job-scheduler"), exports);
 // export * from './main'; this file must not be exported

package/dist/cjs/classes/queue-getters.js

@@ -389,8 +389,13 @@ class QueueGetters extends queue_base_1.QueueBase {
      */
     async getJobs(types, start = 0, end = -1, asc = false) {
         const currentTypes = this.sanitizeJobTypes(types);
-        const jobIds = await this.getRanges(currentTypes, start, end, asc);
-        return Promise.all(jobIds.map(jobId => this.Job.fromId(this, jobId)));
+        const jobDataByType = await this.scripts.getJobs(currentTypes, start, end, asc);
+        return jobDataByType.reduce((jobs, jobData) => {
+            for (const [jobId, jobHashFields] of jobData || []) {
+                jobs.push(this.Job.fromJSON(this, (0, utils_1.array2obj)(jobHashFields), jobId));
+            }
+            return jobs;
+        }, []);
     }
     /**
      * Returns the logs for a given Job.

package/dist/cjs/classes/scripts.js

@@ -15,6 +15,13 @@ const enums_1 = require("../enums");
 const utils_1 = require("../utils");
 const version_1 = require("../version");
 const errors_1 = require("./errors");
+/**
+ * Upper bound on the number of forward backfill iterations the `getJobs` Lua
+ * script performs to replace skipped ids (missing job hashes) within a bounded
+ * range. It caps the work done per call so a range full of missing jobs cannot
+ * scan the whole state unboundedly.
+ */
+const GET_JOBS_MAX_BACKFILL_ITERATIONS = 5;
 class Scripts {
     constructor(queue) {
         this.queue = queue;
@@ -612,6 +619,32 @@ class Scripts {
         const args = this.getRangesArgs(types, start, end, asc);
         return await this.execCommand(client, 'getRanges', args);
     }
+    getJobsArgs(types, start, end, asc) {
+        const queueKeys = this.queue.keys;
+        const transformedTypes = [
+            ...new Set(types.map(type => (type === 'waiting' ? 'wait' : type))),
+        ];
+        const keys = [queueKeys['']];
+        const args = [
+            start,
+            end,
+            asc ? '1' : '0',
+            GET_JOBS_MAX_BACKFILL_ITERATIONS,
+            ...transformedTypes,
+        ];
+        return keys.concat(args);
+    }
+    /**
+     * Fetches job ids and their job hashes for the provided states in a single
+     * script, skipping ids whose job hash is missing (for example the deprecated
+     * wait list marker or jobs removed after their id was read). Each returned
+     * entry is a `[jobId, jobHashFields]` tuple grouped per requested type.
+     */
+    async getJobs(types, start = 0, end = -1, asc = false) {
+        const client = await this.queue.client;
+        const args = this.getJobsArgs(types, start, end, asc);
+        return await this.execCommand(client, 'getJobs', args);
+    }
     getCountsArgs(types) {
         const queueKeys = this.queue.keys;
         const transformedTypes = types.map(type => {