queue-inspector-mcp 0.1.0

package/CHANGELOG.md

@@ -0,0 +1,24 @@
+# Changelog
+
+All notable changes to this project are documented here. The format follows
+[Keep a Changelog](https://keepachangelog.com/en/1.1.0/), and the project uses
+[Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [0.1.0] - 2026-07-08
+
+Initial release.
+
+### Added
+
+- MCP server (`stdio`) exposing six tools: `list_queues`, `queue_stats`,
+  `list_jobs`, `get_job`, `retry_job`, `delete_job`.
+- Asynq backend. Reads the protobuf `TaskMessage` stored in each task hash and
+  reports the pending / active / scheduled / retry / archived / completed states.
+  Retry and delete run Asynq's own `RunTask` and `DeleteTask` scripts.
+- BullMQ backend. Reports the waiting / active / delayed / prioritized /
+  waiting-children / paused / completed / failed states. Retry and delete run
+  BullMQ's own `reprocessJob` and `removeJob` scripts.
+- Read-only mode via `--read-only` or `QUEUE_INSPECTOR_READ_ONLY=1`, which skips
+  the mutating tools.
+- Configurable Redis URL and key prefixes (`REDIS_URL`, `ASYNQ_PREFIX`,
+  `BULL_PREFIX`) and backend selection (`QUEUE_INSPECTOR_BACKENDS`).

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Yusuf İhsan Görgel
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,148 @@
+# queue-inspector-mcp
+
+An MCP server that lets an agent inspect and operate Redis-backed job queues. It
+speaks to two backends today, [Asynq](https://github.com/hibiken/asynq) (Go) and
+[BullMQ](https://github.com/taskforcesh/bullmq) (Node), reporting per-state
+counts, individual job detail, and moving jobs between states.
+
+## Why
+
+When a queue misbehaves in production, the useful questions are about jobs, not
+keys: how many tasks are stuck in retry, what error a specific job failed with,
+how many attempts it has left, whether a dead job can be requeued. A plain Redis
+MCP server can only show you keys and raw values; it does not know that an Asynq
+task message is protobuf, that a BullMQ job's state is decided by which sorted
+set it sits in, or how either library moves a job back to the front of the line.
+This server encodes that knowledge so an agent can reason about queue state and
+take safe, state-aware actions.
+
+## Install
+
+Requires Node.js 18 or newer and a reachable Redis.
+
+```bash
+npm install -g queue-inspector-mcp
+# or run without installing:
+npx queue-inspector-mcp
+```
+
+## Configure
+
+The server talks MCP over stdio, so it works with any MCP client. Point your
+client at the `queue-inspector-mcp` binary and set `REDIS_URL`.
+
+Claude Desktop (`claude_desktop_config.json`):
+
+```json
+{
+  "mcpServers": {
+    "queues": {
+      "command": "npx",
+      "args": ["-y", "queue-inspector-mcp"],
+      "env": { "REDIS_URL": "redis://localhost:6379" }
+    }
+  }
+}
+```
+
+Claude Code (project `.mcp.json`, or `claude mcp add`):
+
+```json
+{
+  "mcpServers": {
+    "queues": {
+      "command": "npx",
+      "args": ["-y", "queue-inspector-mcp"],
+      "env": { "REDIS_URL": "redis://localhost:6379", "QUEUE_INSPECTOR_READ_ONLY": "1" }
+    }
+  }
+}
+```
+
+### Configuration
+
+| Variable | Default | Purpose |
+| --- | --- | --- |
+| `REDIS_URL` | `redis://localhost:6379` | Redis connection string. Include a database number, e.g. `redis://localhost:6379/2`. |
+| `ASYNQ_PREFIX` | `asynq` | Key prefix Asynq was configured with. |
+| `BULL_PREFIX` | `bull` | Key prefix BullMQ was configured with. |
+| `QUEUE_INSPECTOR_BACKENDS` | `asynq,bullmq` | Restrict which backends are scanned. |
+| `QUEUE_INSPECTOR_READ_ONLY` | unset | Set to `1` (or pass `--read-only`) to omit the mutating tools. |
+
+## Tools
+
+| Tool | Mutating | Behavior |
+| --- | --- | --- |
+| `list_queues` | no | List every detected queue, tagged with its backend. |
+| `queue_stats` | no | Count jobs per state for a queue, using the backend's own state names. |
+| `list_jobs` | no | Page through jobs in one state; returns id, type, attempts, and a truncated last error. |
+| `get_job` | no | Full detail for one job: payload, attempts, retry ceiling, last error, timestamps. |
+| `retry_job` | yes | Move a failed or dead job back to pending/wait so it runs again. |
+| `delete_job` | yes | Permanently delete a job. Active jobs are refused. |
+
+When a queue name is unique across the enabled backends, the `backend` argument
+is optional; the server resolves it. If the same name exists in both backends,
+pass `backend` explicitly.
+
+## Read-only mode
+
+With `--read-only` or `QUEUE_INSPECTOR_READ_ONLY=1`, the server never registers
+`retry_job` or `delete_job`. The mutating tools are absent from `tools/list`
+entirely, so a client cannot call them by mistake. This is the recommended
+configuration for pointing an agent at a production database.
+
+## Backend state names
+
+The two libraries model job lifecycles differently, so this server does not
+invent a shared vocabulary. It reports each backend's own state names, and each
+state maps to a specific Redis structure.
+
+Asynq:
+
+| State | Meaning | Redis structure |
+| --- | --- | --- |
+| `pending` | Ready to run, waiting for a worker | list `asynq:{q}:pending` |
+| `active` | Currently being processed | list `asynq:{q}:active` |
+| `scheduled` | Enqueued for a future time | zset `asynq:{q}:scheduled` |
+| `retry` | Failed, waiting to be retried | zset `asynq:{q}:retry` |
+| `archived` | Retries exhausted (the "dead" state) | zset `asynq:{q}:archived` |
+| `completed` | Finished, kept for its retention window | zset `asynq:{q}:completed` |
+
+BullMQ:
+
+| State | Meaning | Redis structure |
+| --- | --- | --- |
+| `waiting` | Ready to run | list `bull:q:wait` |
+| `active` | Currently being processed | list `bull:q:active` |
+| `delayed` | Scheduled for a future time | zset `bull:q:delayed` |
+| `prioritized` | Waiting, ordered by priority | zset `bull:q:prioritized` |
+| `waiting-children` | Blocked on child jobs (flows) | zset `bull:q:waiting-children` |
+| `paused` | Held while the queue is paused | list `bull:q:paused` |
+| `completed` | Finished successfully | zset `bull:q:completed` |
+| `failed` | Failed after exhausting attempts | zset `bull:q:failed` |
+
+Asynq's `archived` is what most people mean by a "dead" job. `list_jobs` returns
+Asynq's terminal sets in Redis (score) order and BullMQ's `completed`/`failed`
+sets most-recent-first.
+
+## What this doesn't do
+
+- Only Asynq and BullMQ are supported. Sidekiq, Celery, RQ and others are not.
+- No web UI. This is an MCP server for programmatic use; it is not a dashboard.
+- No streaming or watch. Each tool call is a point-in-time read; there is no
+  subscription to queue events.
+- `retry_job` and `delete_job` faithfully replicate each library's own mechanism
+  rather than reimplementing it. Retry runs Asynq's `Inspector.RunTask` script
+  and BullMQ's `Job.retry` (`reprocessJob`) script; delete runs Asynq's
+  `Inspector.DeleteTask` script and BullMQ's `Job.remove` (`removeJob`) script.
+  As a result the semantics match the libraries: retrying a BullMQ job applies
+  only to `failed`/`completed` jobs and does not reset `attemptsMade` (matching
+  `Job.retry()`); neither backend can retry or delete an `active` job.
+- `delete_job` removes a single BullMQ job and does not cascade into a flow's
+  children.
+- Asynq group aggregation (the `aggregating` state) is not surfaced in this
+  release.
+
+## License
+
+MIT © Yusuf İhsan Görgel

package/dist/backends/asynq-proto.d.ts

@@ -0,0 +1,16 @@
+export interface AsynqTaskMessage {
+    type: string;
+    payload: Buffer;
+    id: string;
+    queue: string;
+    maxRetry: number;
+    retried: number;
+    errorMsg: string;
+    timeoutSecs: number;
+    deadlineUnix: number;
+    lastFailedAtUnix: number;
+    retentionSecs: number;
+    completedAtUnix: number;
+    groupKey: string;
+}
+export declare function decodeTaskMessage(buf: Buffer): AsynqTaskMessage;

package/dist/backends/asynq-proto.js

@@ -0,0 +1,144 @@
+// Asynq stores each task's metadata as a protobuf-encoded TaskMessage in the
+// `msg` field of its task hash. Rather than pull in a full protobuf runtime for
+// one flat message, this reads the handful of scalar fields the inspector needs
+// straight off the wire. Field numbers come from the vendored schema in
+// ./proto/asynq_task.proto (from hibiken/asynq, MIT). They are deliberately
+// non-sequential upstream (last_failed_at is 11, not 8), so they are pinned by
+// number here, not inferred from order.
+const FIELD = {
+    type: 1,
+    payload: 2,
+    id: 3,
+    queue: 4,
+    retry: 5,
+    retried: 6,
+    errorMsg: 7,
+    timeout: 8,
+    deadline: 9,
+    uniqueKey: 10,
+    lastFailedAt: 11,
+    retention: 12,
+    completedAt: 13,
+    groupKey: 14,
+};
+class Reader {
+    buf;
+    pos = 0;
+    constructor(buf) {
+        this.buf = buf;
+    }
+    get done() {
+        return this.pos >= this.buf.length;
+    }
+    /** Reads a base-128 varint. Values used here (ids, counts, unix seconds) stay
+     *  well inside Number.MAX_SAFE_INTEGER, so a plain number is safe. */
+    varint() {
+        let result = 0;
+        let shift = 0;
+        for (;;) {
+            if (this.pos >= this.buf.length)
+                throw new Error("truncated varint");
+            const byte = this.buf[this.pos++];
+            result += (byte & 0x7f) * 2 ** shift;
+            if ((byte & 0x80) === 0)
+                return result;
+            shift += 7;
+        }
+    }
+    bytes() {
+        const len = this.varint();
+        const end = this.pos + len;
+        if (end > this.buf.length)
+            throw new Error("length-delimited field runs past end of buffer");
+        const out = this.buf.subarray(this.pos, end);
+        this.pos = end;
+        return Buffer.from(out);
+    }
+    /** Advances past a field whose number we do not care about. */
+    skip(wireType) {
+        switch (wireType) {
+            case 0:
+                this.varint();
+                return;
+            case 1:
+                this.pos += 8;
+                return;
+            case 2:
+                this.pos += this.varint();
+                return;
+            case 5:
+                this.pos += 4;
+                return;
+            default:
+                throw new Error(`unsupported protobuf wire type ${wireType}`);
+        }
+    }
+}
+export function decodeTaskMessage(buf) {
+    const msg = {
+        type: "",
+        payload: Buffer.alloc(0),
+        id: "",
+        queue: "",
+        maxRetry: 0,
+        retried: 0,
+        errorMsg: "",
+        timeoutSecs: 0,
+        deadlineUnix: 0,
+        lastFailedAtUnix: 0,
+        retentionSecs: 0,
+        completedAtUnix: 0,
+        groupKey: "",
+    };
+    const r = new Reader(buf);
+    while (!r.done) {
+        const tag = r.varint();
+        const field = tag >> 3;
+        const wireType = tag & 0x07;
+        switch (field) {
+            case FIELD.type:
+                msg.type = r.bytes().toString("utf8");
+                break;
+            case FIELD.payload:
+                msg.payload = r.bytes();
+                break;
+            case FIELD.id:
+                msg.id = r.bytes().toString("utf8");
+                break;
+            case FIELD.queue:
+                msg.queue = r.bytes().toString("utf8");
+                break;
+            case FIELD.retry:
+                msg.maxRetry = r.varint();
+                break;
+            case FIELD.retried:
+                msg.retried = r.varint();
+                break;
+            case FIELD.errorMsg:
+                msg.errorMsg = r.bytes().toString("utf8");
+                break;
+            case FIELD.timeout:
+                msg.timeoutSecs = r.varint();
+                break;
+            case FIELD.deadline:
+                msg.deadlineUnix = r.varint();
+                break;
+            case FIELD.lastFailedAt:
+                msg.lastFailedAtUnix = r.varint();
+                break;
+            case FIELD.retention:
+                msg.retentionSecs = r.varint();
+                break;
+            case FIELD.completedAt:
+                msg.completedAtUnix = r.varint();
+                break;
+            case FIELD.groupKey:
+                msg.groupKey = r.bytes().toString("utf8");
+                break;
+            default:
+                r.skip(wireType);
+        }
+    }
+    return msg;
+}
+//# sourceMappingURL=asynq-proto.js.map

package/dist/backends/asynq-proto.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"asynq-proto.js","sourceRoot":"","sources":["../../src/backends/asynq-proto.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,wEAAwE;AACxE,4EAA4E;AAC5E,+EAA+E;AAC/E,wCAAwC;AAkBxC,MAAM,KAAK,GAAG;IACZ,IAAI,EAAE,CAAC;IACP,OAAO,EAAE,CAAC;IACV,EAAE,EAAE,CAAC;IACL,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,CAAC;IACR,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,CAAC;IACV,QAAQ,EAAE,CAAC;IACX,SAAS,EAAE,EAAE;IACb,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,EAAE;IACb,WAAW,EAAE,EAAE;IACf,QAAQ,EAAE,EAAE;CACJ,CAAC;AAEX,MAAM,MAAM;IAEmB;IADrB,GAAG,GAAG,CAAC,CAAC;IAChB,YAA6B,GAAW;QAAX,QAAG,GAAH,GAAG,CAAQ;IAAG,CAAC;IAE5C,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACrC,CAAC;IAED;0EACsE;IACtE,MAAM;QACJ,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,SAAS,CAAC;YACR,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;YACrE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAE,CAAC;YACnC,MAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;YACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,MAAM,CAAC;YACvC,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IAED,KAAK;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAC3B,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC7F,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,+DAA+D;IAC/D,IAAI,CAAC,QAAgB;QACnB,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,CAAC;gBACJ,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO;YACT,KAAK,CAAC;gBACJ,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACd,OAAO;YACT,KAAK,CAAC;gBACJ,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,OAAO;YACT,KAAK,CAAC;gBACJ,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;gBACd,OAAO;YACT;gBACE,MAAM,IAAI,KAAK,CAAC,kCAAkC,QAAQ,EAAE,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;CACF;AAED,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,MAAM,GAAG,GAAqB;QAC5B,IAAI,EAAE,EAAE;QACR,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACxB,EAAE,EAAE,EAAE;QACN,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;QACV,QAAQ,EAAE,EAAE;QACZ,WAAW,EAAE,CAAC;QACd,YAAY,EAAE,CAAC;QACf,gBAAgB,EAAE,CAAC;QACnB,aAAa,EAAE,CAAC;QAChB,eAAe,EAAE,CAAC;QAClB,QAAQ,EAAE,EAAE;KACb,CAAC;IAEF,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC;QACvB,MAAM,QAAQ,GAAG,GAAG,GAAG,IAAI,CAAC;QAE5B,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,KAAK,CAAC,IAAI;gBACb,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACtC,MAAM;YACR,KAAK,KAAK,CAAC,OAAO;gBAChB,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM;YACR,KAAK,KAAK,CAAC,EAAE;gBACX,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACpC,MAAM;YACR,KAAK,KAAK,CAAC,KAAK;gBACd,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACvC,MAAM;YACR,KAAK,KAAK,CAAC,KAAK;gBACd,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC1B,MAAM;YACR,KAAK,KAAK,CAAC,OAAO;gBAChB,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACzB,MAAM;YACR,KAAK,KAAK,CAAC,QAAQ;gBACjB,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAC1C,MAAM;YACR,KAAK,KAAK,CAAC,OAAO;gBAChB,GAAG,CAAC,WAAW,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM;YACR,KAAK,KAAK,CAAC,QAAQ;gBACjB,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM;YACR,KAAK,KAAK,CAAC,YAAY;gBACrB,GAAG,CAAC,gBAAgB,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAClC,MAAM;YACR,KAAK,KAAK,CAAC,SAAS;gBAClB,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM;YACR,KAAK,KAAK,CAAC,WAAW;gBACpB,GAAG,CAAC,eAAe,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;gBACjC,MAAM;YACR,KAAK,KAAK,CAAC,QAAQ;gBACjB,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAC1C,MAAM;YACR;gBACE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/backends/asynq.d.ts

@@ -0,0 +1,45 @@
+import type { Redis } from "ioredis";
+import { type JobDetail, type JobSummary, type PageOpts, type QueueBackend, type StateCounts } from "../types.js";
+/**
+ * Adapter for queues managed by Asynq (github.com/hibiken/asynq).
+ *
+ * Key layout, verified against a running Asynq worker:
+ *   asynq:queues                     SET   of queue names
+ *   asynq:{<q>}:pending / :active    LIST  of task ids
+ *   asynq:{<q>}:scheduled/:retry/    ZSET  task id -> unix seconds (process-at,
+ *     :archived/:completed                 next retry, last failure, or expiry)
+ *   asynq:{<q>}:t:<id>               HASH  { msg: protobuf TaskMessage, state,
+ *                                            pending_since }
+ * Task metadata is a protobuf TaskMessage; see ./asynq-proto.ts.
+ */
+export declare class AsynqBackend implements QueueBackend {
+    private readonly redis;
+    private readonly prefix;
+    readonly name: "asynq";
+    readonly states: readonly ["pending", "active", "scheduled", "retry", "archived", "completed"];
+    private readonly scripts;
+    constructor(redis: Redis, prefix?: string);
+    private queuesKey;
+    private queuePrefix;
+    private taskKey;
+    private stateKey;
+    detectQueues(): Promise<string[]>;
+    private assertQueue;
+    stats(queue: string): Promise<StateCounts>;
+    private assertState;
+    listJobs(queue: string, rawState: string, page: PageOpts): Promise<JobSummary[]>;
+    getJob(queue: string, id: string): Promise<JobDetail | null>;
+    private readTask;
+    private readTaskDetail;
+    /** Asynq's TaskMessage carries no enqueue time; a pending task does record a
+     *  `pending_since` field in nanoseconds, which is the closest equivalent. */
+    private enqueuedAt;
+    retryJob(queue: string, id: string): Promise<{
+        ok: true;
+        message: string;
+    }>;
+    deleteJob(queue: string, id: string): Promise<{
+        ok: true;
+        message: string;
+    }>;
+}

package/dist/backends/asynq.js

@@ -0,0 +1,183 @@
+import { BackendError, } from "../types.js";
+import { decodePayload, isoFromUnixSeconds, truncate } from "../format.js";
+import { decodeTaskMessage } from "./asynq-proto.js";
+import { attachScripts } from "./scripting.js";
+// State names as Asynq itself uses them, in a natural lifecycle order. Group
+// aggregation ("aggregating") is an advanced feature not surfaced in v0.1.
+const STATES = ["pending", "active", "scheduled", "retry", "archived", "completed"];
+const LIST_STATES = new Set(["pending", "active"]);
+/**
+ * Adapter for queues managed by Asynq (github.com/hibiken/asynq).
+ *
+ * Key layout, verified against a running Asynq worker:
+ *   asynq:queues                     SET   of queue names
+ *   asynq:{<q>}:pending / :active    LIST  of task ids
+ *   asynq:{<q>}:scheduled/:retry/    ZSET  task id -> unix seconds (process-at,
+ *     :archived/:completed                 next retry, last failure, or expiry)
+ *   asynq:{<q>}:t:<id>               HASH  { msg: protobuf TaskMessage, state,
+ *                                            pending_since }
+ * Task metadata is a protobuf TaskMessage; see ./asynq-proto.ts.
+ */
+export class AsynqBackend {
+    redis;
+    prefix;
+    name = "asynq";
+    states = STATES;
+    scripts;
+    constructor(redis, prefix = "asynq") {
+        this.redis = redis;
+        this.prefix = prefix;
+        this.scripts = attachScripts(redis);
+    }
+    queuesKey() {
+        return `${this.prefix}:queues`;
+    }
+    queuePrefix(queue) {
+        return `${this.prefix}:{${queue}}:`;
+    }
+    taskKey(queue, id) {
+        return `${this.queuePrefix(queue)}t:${id}`;
+    }
+    stateKey(queue, state) {
+        return `${this.queuePrefix(queue)}${state}`;
+    }
+    async detectQueues() {
+        const queues = await this.redis.smembers(this.queuesKey());
+        return queues.sort();
+    }
+    async assertQueue(queue) {
+        const known = await this.redis.sismember(this.queuesKey(), queue);
+        if (!known) {
+            throw new BackendError(`asynq queue "${queue}" was not found`, "queue_not_found");
+        }
+    }
+    async stats(queue) {
+        await this.assertQueue(queue);
+        const counts = {};
+        for (const state of STATES) {
+            const key = this.stateKey(queue, state);
+            counts[state] = LIST_STATES.has(state)
+                ? await this.redis.llen(key)
+                : await this.redis.zcard(key);
+        }
+        return counts;
+    }
+    assertState(state) {
+        if (!STATES.includes(state)) {
+            throw new BackendError(`unknown asynq state "${state}"; expected one of ${STATES.join(", ")}`, "invalid_state");
+        }
+        return state;
+    }
+    async listJobs(queue, rawState, page) {
+        await this.assertQueue(queue);
+        const state = this.assertState(rawState);
+        const key = this.stateKey(queue, state);
+        const stop = page.offset + page.limit - 1;
+        const ids = LIST_STATES.has(state)
+            ? await this.redis.lrange(key, page.offset, stop)
+            : await this.redis.zrange(key, page.offset, stop);
+        const summaries = [];
+        for (const id of ids) {
+            const detail = await this.readTask(queue, id, state);
+            if (detail)
+                summaries.push(detail);
+        }
+        return summaries;
+    }
+    async getJob(queue, id) {
+        await this.assertQueue(queue);
+        const state = (await this.redis.hget(this.taskKey(queue, id), "state"));
+        if (state === null)
+            return null;
+        return this.readTaskDetail(queue, id, state);
+    }
+    async readTask(queue, id, state) {
+        const raw = await this.redis.hgetBuffer(this.taskKey(queue, id), "msg");
+        if (raw === null)
+            return null;
+        const msg = decodeTaskMessage(raw);
+        return {
+            id,
+            type: msg.type,
+            state,
+            enqueuedAt: await this.enqueuedAt(queue, id, state),
+            attempts: msg.retried,
+            maxRetries: msg.maxRetry,
+            lastError: msg.errorMsg ? truncate(msg.errorMsg) : null,
+        };
+    }
+    async readTaskDetail(queue, id, state) {
+        const raw = await this.redis.hgetBuffer(this.taskKey(queue, id), "msg");
+        if (raw === null)
+            return null;
+        const msg = decodeTaskMessage(raw);
+        const decoded = decodePayload(msg.payload);
+        const timestamps = {
+            enqueuedAt: await this.enqueuedAt(queue, id, state),
+            lastFailedAt: isoFromUnixSeconds(msg.lastFailedAtUnix),
+            completedAt: isoFromUnixSeconds(msg.completedAtUnix),
+            deadline: isoFromUnixSeconds(msg.deadlineUnix),
+        };
+        if (state === "scheduled" || state === "retry") {
+            const score = await this.redis.zscore(this.stateKey(queue, state), id);
+            timestamps.nextProcessAt = score ? isoFromUnixSeconds(Number(score)) : null;
+        }
+        return {
+            id,
+            queue,
+            backend: this.name,
+            type: msg.type,
+            state,
+            enqueuedAt: timestamps.enqueuedAt ?? null,
+            attempts: msg.retried,
+            maxRetries: msg.maxRetry,
+            lastError: msg.errorMsg ? truncate(msg.errorMsg) : null,
+            fullError: msg.errorMsg || null,
+            timestamps,
+            ...decoded,
+        };
+    }
+    /** Asynq's TaskMessage carries no enqueue time; a pending task does record a
+     *  `pending_since` field in nanoseconds, which is the closest equivalent. */
+    async enqueuedAt(queue, id, state) {
+        if (state !== "pending")
+            return null;
+        const ns = await this.redis.hget(this.taskKey(queue, id), "pending_since");
+        if (!ns)
+            return null;
+        return new Date(Number(ns) / 1e6).toISOString();
+    }
+    async retryJob(queue, id) {
+        await this.assertQueue(queue);
+        const prefix = this.queuePrefix(queue);
+        const result = await this.scripts.runTask([this.taskKey(queue, id), `${prefix}pending`, `${prefix}groups`], [id, prefix, `${prefix}g:`]);
+        switch (result) {
+            case 1:
+                return { ok: true, message: `asynq task ${id} moved to pending in queue "${queue}"` };
+            case 0:
+                throw new BackendError(`asynq task "${id}" was not found in queue "${queue}"`, "job_not_found");
+            case -1:
+                throw new BackendError(`asynq task "${id}" is currently active and cannot be retried`, "invalid_state");
+            case -2:
+                throw new BackendError(`asynq task "${id}" is already pending`, "invalid_state");
+            default:
+                throw new BackendError(`asynq retry returned unexpected code ${result}`, "invalid_state");
+        }
+    }
+    async deleteJob(queue, id) {
+        await this.assertQueue(queue);
+        const prefix = this.queuePrefix(queue);
+        const result = await this.scripts.deleteTask([this.taskKey(queue, id), `${prefix}groups`], [id, prefix, `${prefix}g:`]);
+        switch (result) {
+            case 1:
+                return { ok: true, message: `asynq task ${id} deleted from queue "${queue}"` };
+            case 0:
+                throw new BackendError(`asynq task "${id}" was not found in queue "${queue}"`, "job_not_found");
+            case -1:
+                throw new BackendError(`asynq task "${id}" is currently active and cannot be deleted`, "invalid_state");
+            default:
+                throw new BackendError(`asynq delete returned unexpected code ${result}`, "invalid_state");
+        }
+    }
+}
+//# sourceMappingURL=asynq.js.map

package/dist/backends/asynq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"asynq.js","sourceRoot":"","sources":["../../src/backends/asynq.ts"],"names":[],"mappings":"AACA,OAAO,EACL,YAAY,GAMb,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,aAAa,EAAkB,MAAM,gBAAgB,CAAC;AAE/D,6EAA6E;AAC7E,2EAA2E;AAC3E,MAAM,MAAM,GAAG,CAAC,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,CAAU,CAAC;AAG7F,MAAM,WAAW,GAAG,IAAI,GAAG,CAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE1D;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,YAAY;IAMJ;IACA;IANV,IAAI,GAAG,OAAgB,CAAC;IACxB,MAAM,GAAG,MAAM,CAAC;IACR,OAAO,CAAY;IAEpC,YACmB,KAAY,EACZ,SAAS,OAAO;QADhB,UAAK,GAAL,KAAK,CAAO;QACZ,WAAM,GAAN,MAAM,CAAU;QAEjC,IAAI,CAAC,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAEO,SAAS;QACf,OAAO,GAAG,IAAI,CAAC,MAAM,SAAS,CAAC;IACjC,CAAC;IAEO,WAAW,CAAC,KAAa;QAC/B,OAAO,GAAG,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC;IACtC,CAAC;IAEO,OAAO,CAAC,KAAa,EAAE,EAAU;QACvC,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;IAC7C,CAAC;IAEO,QAAQ,CAAC,KAAa,EAAE,KAAY;QAC1C,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3D,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IAEO,KAAK,CAAC,WAAW,CAAC,KAAa;QACrC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,YAAY,CAAC,gBAAgB,KAAK,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,KAAa;QACvB,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;gBACpC,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;gBAC5B,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,WAAW,CAAC,KAAa;QAC/B,IAAI,CAAE,MAA4B,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,YAAY,CACpB,wBAAwB,KAAK,sBAAsB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EACtE,eAAe,CAChB,CAAC;QACJ,CAAC;QACD,OAAO,KAAc,CAAC;IACxB,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,QAAgB,EAAE,IAAc;QAC5D,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;YAChC,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;YACjD,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEpD,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YACrD,IAAI,MAAM;gBAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,EAAU;QACpC,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,CAAiB,CAAC;QACxF,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAChC,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAEO,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,EAAU,EAAE,KAAY;QAC5D,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC9B,MAAM,GAAG,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO;YACL,EAAE;YACF,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,KAAK;YACL,UAAU,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC;YACnD,QAAQ,EAAE,GAAG,CAAC,OAAO;YACrB,UAAU,EAAE,GAAG,CAAC,QAAQ;YACxB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;SACxD,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,cAAc,CAAC,KAAa,EAAE,EAAU,EAAE,KAAY;QAClE,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAC9B,MAAM,GAAG,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAE3C,MAAM,UAAU,GAAkC;YAChD,UAAU,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC;YACnD,YAAY,EAAE,kBAAkB,CAAC,GAAG,CAAC,gBAAgB,CAAC;YACtD,WAAW,EAAE,kBAAkB,CAAC,GAAG,CAAC,eAAe,CAAC;YACpD,QAAQ,EAAE,kBAAkB,CAAC,GAAG,CAAC,YAAY,CAAC;SAC/C,CAAC;QACF,IAAI,KAAK,KAAK,WAAW,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACvE,UAAU,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9E,CAAC;QAED,OAAO;YACL,EAAE;YACF,KAAK;YACL,OAAO,EAAE,IAAI,CAAC,IAAI;YAClB,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,KAAK;YACL,UAAU,EAAE,UAAU,CAAC,UAAU,IAAI,IAAI;YACzC,QAAQ,EAAE,GAAG,CAAC,OAAO;YACrB,UAAU,EAAE,GAAG,CAAC,QAAQ;YACxB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;YACvD,SAAS,EAAE,GAAG,CAAC,QAAQ,IAAI,IAAI;YAC/B,UAAU;YACV,GAAG,OAAO;SACX,CAAC;IACJ,CAAC;IAED;iFAC6E;IACrE,KAAK,CAAC,UAAU,CAAC,KAAa,EAAE,EAAU,EAAE,KAAY;QAC9D,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACrC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC;QAC3E,IAAI,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC;QACrB,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAClD,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAa,EAAE,EAAU;QACtC,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CACvC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,MAAM,SAAS,EAAE,GAAG,MAAM,QAAQ,CAAC,EAChE,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAC5B,CAAC;QACF,QAAQ,MAAM,EAAE,CAAC;YACf,KAAK,CAAC;gBACJ,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,+BAA+B,KAAK,GAAG,EAAE,CAAC;YACxF,KAAK,CAAC;gBACJ,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,6BAA6B,KAAK,GAAG,EAAE,eAAe,CAAC,CAAC;YAClG,KAAK,CAAC,CAAC;gBACL,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,6CAA6C,EAAE,eAAe,CAAC,CAAC;YAC1G,KAAK,CAAC,CAAC;gBACL,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,sBAAsB,EAAE,eAAe,CAAC,CAAC;YACnF;gBACE,MAAM,IAAI,YAAY,CAAC,wCAAwC,MAAM,EAAE,EAAE,eAAe,CAAC,CAAC;QAC9F,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,KAAa,EAAE,EAAU;QACvC,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAC1C,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,GAAG,MAAM,QAAQ,CAAC,EAC5C,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,CAC5B,CAAC;QACF,QAAQ,MAAM,EAAE,CAAC;YACf,KAAK,CAAC;gBACJ,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,wBAAwB,KAAK,GAAG,EAAE,CAAC;YACjF,KAAK,CAAC;gBACJ,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,6BAA6B,KAAK,GAAG,EAAE,eAAe,CAAC,CAAC;YAClG,KAAK,CAAC,CAAC;gBACL,MAAM,IAAI,YAAY,CAAC,eAAe,EAAE,6CAA6C,EAAE,eAAe,CAAC,CAAC;YAC1G;gBACE,MAAM,IAAI,YAAY,CAAC,yCAAyC,MAAM,EAAE,EAAE,eAAe,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;CACF"}

package/dist/backends/bullmq.d.ts

@@ -0,0 +1,46 @@
+import type { Redis } from "ioredis";
+import { type JobDetail, type JobSummary, type PageOpts, type QueueBackend, type StateCounts } from "../types.js";
+/**
+ * Adapter for queues managed by BullMQ (github.com/taskforcesh/bullmq).
+ *
+ * Key layout, verified against a running BullMQ worker:
+ *   bull:<q>:meta                         HASH  queue metadata (version, paused)
+ *   bull:<q>:wait / :active / :paused     LIST  of job ids
+ *   bull:<q>:delayed / :prioritized /     ZSET  of job ids
+ *     :completed / :failed
+ *   bull:<q>:<id>                         HASH  { name, data, opts, timestamp,
+ *                                                 atm, failedReason, ... }
+ * Mutations run BullMQ's own vendored scripts; see ./lua and ./scripting.ts.
+ */
+export declare class BullmqBackend implements QueueBackend {
+    private readonly redis;
+    private readonly prefix;
+    readonly name: "bullmq";
+    readonly states: readonly ["waiting", "active", "delayed", "prioritized", "waiting-children", "paused", "completed", "failed"];
+    private readonly scripts;
+    constructor(redis: Redis, prefix?: string);
+    private key;
+    private jobKey;
+    detectQueues(): Promise<string[]>;
+    private assertQueue;
+    stats(queue: string): Promise<StateCounts>;
+    private assertState;
+    private idsForState;
+    listJobs(queue: string, rawState: string, page: PageOpts): Promise<JobSummary[]>;
+    getJob(queue: string, id: string): Promise<JobDetail | null>;
+    private readHash;
+    private toSummary;
+    private maxRetries;
+    private isLifo;
+    /** Determines a job's current state by membership, mirroring BullMQ's own
+     *  getState: check the terminal and scheduling sets, then the lists. */
+    private resolveState;
+    retryJob(queue: string, id: string): Promise<{
+        ok: true;
+        message: string;
+    }>;
+    deleteJob(queue: string, id: string): Promise<{
+        ok: true;
+        message: string;
+    }>;
+}