@adonis-agora/durable 0.1.0

package/dist/src/transports/db.js

@@ -0,0 +1,340 @@
+import { randomUUID } from 'node:crypto';
+import { Pollers } from '../pollers.js';
+import { runStepHandler } from '../protocol.js';
+import { TRANSPORT_TABLES, createDurableTransportTables } from './db-schema.js';
+/**
+ * The wire payloads carried in the DB transport's table rows. Everything crossing the DB is plain
+ * JSON — JSON columns are stored as TEXT, so these helpers (de)serialize through
+ * `JSON.stringify`/`JSON.parse`: only JSON-safe values survive (functions, symbols, `undefined`
+ * members are dropped exactly as a real broker would drop them).
+ */
+/** Serialize a value to a JSON string, or `null` for `undefined` (so a TEXT column round-trips). */
+function toJson(value) {
+    return value === undefined ? null : JSON.stringify(value);
+}
+/** Parse a TEXT column we previously wrote with {@link toJson}. `null`/empty → `undefined`. */
+function fromJson(value) {
+    if (value === null || value === undefined || value === '')
+        return undefined;
+    return JSON.parse(value);
+}
+/** Default poll interval (ms) for the result/task/heartbeat/control loops. */
+const DEFAULT_POLL_INTERVAL_MS = 200;
+/** Default lease window (ms): a claimed-but-not-deleted row is reclaimable after this (crash recovery). */
+const DEFAULT_LEASE_MS = 30_000;
+/** Default max rows claimed per poll. */
+const DEFAULT_BATCH_SIZE = 20;
+const DEFAULT_LOG = (err) => console.error('[DbTransport] poll failed', err);
+/**
+ * A poll-based, DB-table-backed {@link Transport} (and best-effort {@link ControlPlane}) over
+ * AdonisJS **Lucid** — DBOS-style. Instead of a broker (Redis/SQS), remote steps are **rows** in the
+ * same database the durable store already uses: `dispatch` inserts a task row; a worker poller claims
+ * unclaimed task rows (atomic conditional `UPDATE … SET claimed_by`), runs the handler via
+ * {@link runStepHandler}, and writes a result row the engine polls. Heartbeats and control messages
+ * ride their own tables. Zero new infrastructure — often the simplest production transport.
+ *
+ * Claiming is portable across SQLite / Postgres / MySQL: it uses a compare-and-set UPDATE on
+ * `claimed_by`/`claimed_at` (no `FOR UPDATE SKIP LOCKED`), so multiple workers never double-process a
+ * row, and a crashed worker's claim is reclaimed once its lease (`leaseMs`) expires.
+ *
+ * Trade-off vs a real broker: throughput is bounded by polling + row contention — great for
+ * workflow/pipeline scale (modest rate, long steps), not for high-fanout firehoses. The
+ * {@link ControlPlane} here is single-consumer (one row → one poller), correct for a single engine
+ * instance but NOT a true broadcast.
+ *
+ * Run one instance engine-side (`onResult` + `dispatch`) and one per worker process (`handle()` for
+ * its group). Call {@link start} to begin the engine-side pollers; `handle()` auto-starts the task
+ * loop. The wire payloads are the documented `RemoteTask`/`StepResult` JSON.
+ *
+ * Usually you don't construct this directly: `config/durable.ts` selects it via
+ * `transports.db({ ... })` and the provider builds it for you.
+ */
+export class DbTransport {
+    #db;
+    #group;
+    #connectionName;
+    #pollIntervalMs;
+    #leaseMs;
+    #batchSize;
+    #autoCreate;
+    #instanceId;
+    #handlers = new Map();
+    #pollers;
+    #schemaReady;
+    #taskLoop;
+    constructor(options) {
+        this.#db = options.db;
+        this.#group = options.group;
+        this.#connectionName = options.connectionName;
+        this.#pollIntervalMs = options.pollIntervalMs ?? DEFAULT_POLL_INTERVAL_MS;
+        this.#leaseMs = options.leaseMs ?? DEFAULT_LEASE_MS;
+        this.#batchSize = options.batchSize ?? DEFAULT_BATCH_SIZE;
+        this.#autoCreate = options.autoCreate ?? true;
+        this.#instanceId = options.instanceId ?? randomUUID();
+        this.#pollers = new Pollers(this.#pollIntervalMs, DEFAULT_LOG);
+    }
+    /** Stable id stamped on heartbeats, control `from`, and `claimed_by`. */
+    get instanceId() {
+        return this.#instanceId;
+    }
+    #client() {
+        return this.#connectionName ? this.#db.connection(this.#connectionName) : this.#db.connection();
+    }
+    #now() {
+        return Date.now();
+    }
+    #ensureSchema() {
+        if (!this.#autoCreate)
+            return Promise.resolve();
+        if (!this.#schemaReady)
+            this.#schemaReady = createDurableTransportTables(this.#db);
+        return this.#schemaReady;
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // engine → worker
+    // ───────────────────────────────────────────────────────────────────────────
+    async dispatch(task) {
+        await this.#ensureSchema();
+        // Idempotent: a redelivered dispatch for the same step_id is ignored (the PK already exists).
+        // `onConflict().ignore()` is a Knex feature not surfaced on Lucid's insert contract, so we use
+        // the underlying Knex builder (`.knexQuery`).
+        await this.#client()
+            .insertQuery()
+            .table(TRANSPORT_TABLES.tasks)
+            .knexQuery.insert({
+            step_id: task.stepId,
+            run_id: task.runId,
+            seq: task.seq,
+            name: task.name,
+            grp: task.group,
+            input: toJson(task.input),
+            traceparent: task.traceparent ?? null,
+            context: toJson(task.context),
+            transport: task.transport ?? null,
+            attempt: task.attempt,
+            claimed_by: null,
+            claimed_at: null,
+            created_at: this.#now(),
+        })
+            .onConflict('step_id')
+            .ignore();
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // worker side — register a handler, claim + run tasks, write results
+    // ───────────────────────────────────────────────────────────────────────────
+    /**
+     * Register a step handler (worker side). Starts this group's task poll loop on the first call —
+     * each claimed task runs through {@link runStepHandler} and its result is written for the engine.
+     */
+    handle(name, fn) {
+        if (!this.#group) {
+            throw new Error('DbTransport needs a `group` option to register handlers');
+        }
+        this.#handlers.set(name, fn);
+        if (!this.#taskLoop) {
+            const group = this.#group;
+            this.#taskLoop = this.#pollers.start(async () => (await this.#drainTasks(group)) > 0);
+        }
+    }
+    /** Worker side: publish a liveness heartbeat for an in-flight long step. */
+    async heartbeat(beat) {
+        await this.#ensureSchema();
+        await this.#client().table(TRANSPORT_TABLES.heartbeats).insert({
+            run_id: beat.runId,
+            seq: beat.seq,
+            step_id: beat.stepId,
+            grp: beat.group,
+            claimed_by: null,
+            claimed_at: null,
+            created_at: this.#now(),
+        });
+    }
+    async #drainTasks(group) {
+        const rows = await this.#claim(TRANSPORT_TABLES.tasks, group);
+        for (const row of rows) {
+            const task = {
+                runId: row.run_id,
+                seq: Number(row.seq),
+                stepId: row.step_id,
+                name: row.name,
+                group,
+                input: fromJson(row.input),
+                attempt: Number(row.attempt),
+                ...(row.traceparent != null ? { traceparent: row.traceparent } : {}),
+                ...(row.context != null ? { context: fromJson(row.context) } : {}),
+                ...(row.transport != null ? { transport: row.transport } : {}),
+            };
+            const result = await runStepHandler(task, this.#handlers.get(task.name));
+            await this.#insertResult(result);
+            await this.#client().from(TRANSPORT_TABLES.tasks).where('step_id', task.stepId).delete();
+        }
+        return rows.length;
+    }
+    async #insertResult(result) {
+        await this.#client()
+            .insertQuery()
+            .table(TRANSPORT_TABLES.results)
+            .knexQuery.insert({
+            step_id: result.stepId,
+            run_id: result.runId,
+            seq: result.seq,
+            status: result.status,
+            output: toJson(result.output),
+            error: toJson(result.error),
+            started_at: result.startedAt ?? null,
+            events: toJson(result.events),
+            claimed_by: null,
+            claimed_at: null,
+            created_at: this.#now(),
+        })
+            .onConflict('step_id')
+            .ignore();
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // worker → engine — the engine polls results + heartbeats
+    // ───────────────────────────────────────────────────────────────────────────
+    onResult(handler) {
+        this.#pollers.start(async () => (await this.#drainResults(handler)) > 0);
+    }
+    onHeartbeat(handler) {
+        this.#pollers.start(async () => (await this.#drainHeartbeats(handler)) > 0);
+    }
+    async #drainResults(handler) {
+        const rows = await this.#claim(TRANSPORT_TABLES.results);
+        for (const row of rows) {
+            const result = {
+                runId: row.run_id,
+                seq: Number(row.seq),
+                stepId: row.step_id,
+                status: row.status,
+                output: fromJson(row.output),
+                error: fromJson(row.error),
+                startedAt: row.started_at == null ? undefined : Number(row.started_at),
+                events: fromJson(row.events),
+            };
+            await handler(result);
+            await this.#client().from(TRANSPORT_TABLES.results).where('step_id', result.stepId).delete();
+        }
+        return rows.length;
+    }
+    async #drainHeartbeats(handler) {
+        const rows = await this.#claim(TRANSPORT_TABLES.heartbeats, undefined, 'id');
+        for (const row of rows) {
+            await handler({
+                runId: row.run_id,
+                seq: Number(row.seq),
+                stepId: row.step_id,
+                group: row.grp,
+            });
+            await this.#client().from(TRANSPORT_TABLES.heartbeats).where('id', row.id).delete();
+        }
+        return rows.length;
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // control plane (best-effort, single-consumer)
+    // ───────────────────────────────────────────────────────────────────────────
+    async publishControl(msg) {
+        await this.#ensureSchema();
+        const stamped = msg.from ? msg : { ...msg, from: this.#instanceId };
+        await this.#client()
+            .table(TRANSPORT_TABLES.control)
+            .insert({
+            payload: JSON.stringify(stamped),
+            claimed_by: null,
+            claimed_at: null,
+            created_at: this.#now(),
+        });
+    }
+    onControl(handler) {
+        this.#pollers.start(async () => (await this.#drainControl(handler)) > 0);
+    }
+    async #drainControl(handler) {
+        const rows = await this.#claim(TRANSPORT_TABLES.control, undefined, 'id');
+        for (const row of rows) {
+            const msg = fromJson(row.payload);
+            if (msg)
+                handler(msg);
+            await this.#client().from(TRANSPORT_TABLES.control).where('id', row.id).delete();
+        }
+        return rows.length;
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // atomic claim — portable compare-and-set (no FOR UPDATE SKIP LOCKED)
+    // ───────────────────────────────────────────────────────────────────────────
+    /**
+     * Atomically claim up to `batchSize` un-leased rows (optionally narrowed by `where`) and stamp them
+     * with this instance's id + a fresh per-round claim timestamp, then SELECT exactly the rows this
+     * round stamped. The single conditional `UPDATE … WHERE claimed_at IS NULL OR claimed_at < stale`
+     * is the concurrency guard: two instances racing the same rows can't both stamp them (the loser's
+     * UPDATE matches nothing for those rows). A crashed claimer's rows are reclaimed once their lease
+     * expires (`claimed_at < now - leaseMs`).
+     *
+     * `claimed_at` is set to a unique, strictly-increasing-per-round value so the SELECT-back is exact
+     * even when the same instance claims several rounds in quick succession.
+     */
+    async #claim(table, group, idCol = 'step_id') {
+        await this.#ensureSchema();
+        // The raw Knex builder — `onConflict`, the `where(cb)` grouping and `whereIn` are cleaner there
+        // than through Lucid's stricter query-builder typings, and we only need plain SQL here.
+        const knex = this.#client().knexQuery();
+        const stale = this.#now() - this.#leaseMs;
+        // Unique claim token for THIS round: instance id + a nanosecond stamp. Stored in `claimed_by` so
+        // the SELECT-back returns only the rows this exact round won (never another round's, even from
+        // the same instance).
+        const token = `${this.#instanceId}:${process.hrtime.bigint().toString(36)}`;
+        const at = this.#now();
+        // 1) Pick candidate ids (unclaimed or stale-lease), oldest first, bounded by batchSize.
+        const candidates = (await knex
+            .from(table)
+            .select(idCol)
+            .modify((q) => {
+            if (group !== undefined)
+                q.where('grp', group);
+        })
+            .where((q) => q.whereNull('claimed_at').orWhere('claimed_at', '<', stale))
+            .orderBy(idCol === 'id' ? 'id' : 'created_at', 'asc')
+            .limit(this.#batchSize));
+        if (candidates.length === 0)
+            return [];
+        const ids = candidates.map((c) => c[idCol]);
+        // 2) Conditionally claim them — only rows STILL un-leased flip to this round's token. A racing
+        //    instance's UPDATE matches nothing for the rows it lost, so no row is claimed twice.
+        await this.#client()
+            .knexQuery()
+            .from(table)
+            .whereIn(idCol, ids)
+            .where((q) => q.whereNull('claimed_at').orWhere('claimed_at', '<', stale))
+            .update({ claimed_by: token, claimed_at: at });
+        // 3) SELECT back exactly the rows this round won.
+        const rows = (await this.#client()
+            .knexQuery()
+            .from(table)
+            .select('*')
+            .where('claimed_by', token)
+            .where('claimed_at', at));
+        return rows;
+    }
+    // ───────────────────────────────────────────────────────────────────────────
+    // poll loop lifecycle (the recursive-timer / drain-burst / stop-all bookkeeping
+    // lives in core's Pollers; here each loop is just a `drain* > 0` tick)
+    // ───────────────────────────────────────────────────────────────────────────
+    /**
+     * No-op convenience: the loops auto-start when `onResult`/`onHeartbeat`/`onControl`/`handle` are
+     * registered. Exposed for symmetry and to mirror broker transports — call it after wiring handlers
+     * if you prefer an explicit start. Returns once the schema is ready.
+     */
+    async start() {
+        this.#pollers.reopen();
+        await this.#ensureSchema();
+    }
+    /** Stop every poll loop. Does not close the shared `Database`. */
+    async stop() {
+        this.#pollers.stopAll();
+        this.#taskLoop = undefined;
+    }
+    /** Stop the pollers (alias of {@link stop} for the `Transport.close` contract). */
+    async close() {
+        await this.stop();
+    }
+}
+//# sourceMappingURL=db.js.map

package/dist/src/transports/db.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"db.js","sourceRoot":"","sources":["../../../src/transports/db.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAczC,OAAO,EAAiB,OAAO,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAoB,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,4BAA4B,EAAE,MAAM,gBAAgB,CAAC;AAEhF;;;;;GAKG;AAEH,oGAAoG;AACpG,SAAS,MAAM,CAAC,KAAc;IAC5B,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5D,CAAC;AAED,+FAA+F;AAC/F,SAAS,QAAQ,CAAI,KAAgC;IACnD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAC5E,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAM,CAAC;AAChC,CAAC;AAID,8EAA8E;AAC9E,MAAM,wBAAwB,GAAG,GAAG,CAAC;AACrC,2GAA2G;AAC3G,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAChC,yCAAyC;AACzC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAuC9B,MAAM,WAAW,GAAG,CAAC,GAAY,EAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,2BAA2B,EAAE,GAAG,CAAC,CAAC;AA4B5F;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,OAAO,WAAW;IACb,GAAG,CAAW;IACd,MAAM,CAAqB;IAC3B,eAAe,CAAqB;IACpC,eAAe,CAAS;IACxB,QAAQ,CAAS;IACjB,UAAU,CAAS;IACnB,WAAW,CAAU;IACrB,WAAW,CAAS;IACpB,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,QAAQ,CAAU;IAC3B,YAAY,CAA4B;IACxC,SAAS,CAAuB;IAEhC,YAAY,OAA2B;QACrC,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5B,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,cAAc,CAAC;QAC9C,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,cAAc,IAAI,wBAAwB,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,IAAI,gBAAgB,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC;QAC1D,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,UAAU,IAAI,IAAI,CAAC;QAC9C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,UAAU,IAAI,UAAU,EAAE,CAAC;QACtD,IAAI,CAAC,QAAQ,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;IACjE,CAAC;IAED,yEAAyE;IACzE,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;IAClG,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IAED,aAAa;QACX,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAChD,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,IAAI,CAAC,YAAY,GAAG,4BAA4B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E,KAAK,CAAC,QAAQ,CAAC,IAAgB;QAC7B,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3B,8FAA8F;QAC9F,+FAA+F;QAC/F,8CAA8C;QAC9C,MAAM,IAAI,CAAC,OAAO,EAAE;aACjB,WAAW,EAAE;aACb,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC;aAC7B,SAAS,CAAC,MAAM,CAAC;YAChB,OAAO,EAAE,IAAI,CAAC,MAAM;YACpB,MAAM,EAAE,IAAI,CAAC,KAAK;YAClB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,EAAE,IAAI,CAAC,KAAK;YACf,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;YACzB,WAAW,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI;YACrC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC;YAC7B,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI;YACjC,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE;SACxB,CAAC;aACD,UAAU,CAAC,SAAS,CAAC;aACrB,MAAM,EAAE,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,qEAAqE;IACrE,8EAA8E;IAE9E;;;OAGG;IACH,MAAM,CAAC,IAAY,EAAE,EAAe;QAClC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;YAC1B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,KAAK,CAAC,SAAS,CAAC,IAAe;QAC7B,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3B,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;YAC7D,MAAM,EAAE,IAAI,CAAC,KAAK;YAClB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,OAAO,EAAE,IAAI,CAAC,MAAM;YACpB,GAAG,EAAE,IAAI,CAAC,KAAK;YACf,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE;SACxB,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,KAAa;QAC7B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAU,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,GAAe;gBACvB,KAAK,EAAE,GAAG,CAAC,MAAM;gBACjB,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBACpB,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,KAAK;gBACL,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC1B,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC;gBAC5B,GAAG,CAAC,GAAG,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpE,GAAG,CAAC,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClE,GAAG,CAAC,GAAG,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC/D,CAAC;YACF,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACzE,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YACjC,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC;QAC3F,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,MAAkB;QACpC,MAAM,IAAI,CAAC,OAAO,EAAE;aACjB,WAAW,EAAE;aACb,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;aAC/B,SAAS,CAAC,MAAM,CAAC;YAChB,OAAO,EAAE,MAAM,CAAC,MAAM;YACtB,MAAM,EAAE,MAAM,CAAC,KAAK;YACpB,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAC3B,UAAU,EAAE,MAAM,CAAC,SAAS,IAAI,IAAI;YACpC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE;SACxB,CAAC;aACD,UAAU,CAAC,SAAS,CAAC;aACrB,MAAM,EAAE,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,0DAA0D;IAC1D,8EAA8E;IAE9E,QAAQ,CAAC,OAA8C;QACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,WAAW,CAAC,OAA2C;QACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,OAA8C;QAChE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAY,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACpE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,MAAM,GAAe;gBACzB,KAAK,EAAE,GAAG,CAAC,MAAM;gBACjB,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBACpB,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,MAAM,EAAE,GAAG,CAAC,MAA8B;gBAC1C,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;gBAC5B,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC1B,SAAS,EAAE,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC;gBACtE,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;aAC7B,CAAC;YACF,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC;YACtB,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC;QAC/F,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,OAA2C;QAChE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAe,gBAAgB,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC3F,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,OAAO,CAAC;gBACZ,KAAK,EAAE,GAAG,CAAC,MAAM;gBACjB,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;gBACpB,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,KAAK,EAAE,GAAG,CAAC,GAAG;aACf,CAAC,CAAC;YACH,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACtF,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,8EAA8E;IAC9E,+CAA+C;IAC/C,8EAA8E;IAE9E,KAAK,CAAC,cAAc,CAAC,GAAmB;QACtC,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAmB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;QACpF,MAAM,IAAI,CAAC,OAAO,EAAE;aACjB,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;aAC/B,MAAM,CAAC;YACN,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YAChC,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE;SACxB,CAAC,CAAC;IACP,CAAC;IAED,SAAS,CAAC,OAAsC;QAC9C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,OAAsC;QACxD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAa,gBAAgB,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACtF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,QAAQ,CAAiB,GAAG,CAAC,OAAO,CAAC,CAAC;YAClD,IAAI,GAAG;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,8EAA8E;IAC9E,sEAAsE;IACtE,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,KAAc,EACd,QAA0B,SAAS;QAEnC,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;QAC3B,gGAAgG;QAChG,wFAAwF;QACxF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1C,iGAAiG;QACjG,+FAA+F;QAC/F,sBAAsB;QACtB,MAAM,KAAK,GAAG,GAAG,IAAI,CAAC,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QAC5E,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAEvB,wFAAwF;QACxF,MAAM,UAAU,GAAG,CAAC,MAAM,IAAI;aAC3B,IAAI,CAAC,KAAK,CAAC;aACX,MAAM,CAAC,KAAK,CAAC;aACb,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,IAAI,KAAK,KAAK,SAAS;gBAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;aACzE,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,EAAE,KAAK,CAAC;aACpD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAmC,CAAC;QAC7D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAoB,CAAC,CAAC;QAE/D,+FAA+F;QAC/F,yFAAyF;QACzF,MAAM,IAAI,CAAC,OAAO,EAAE;aACjB,SAAS,EAAE;aACX,IAAI,CAAC,KAAK,CAAC;aACX,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;aACnB,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;aACzE,MAAM,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QAEjD,kDAAkD;QAClD,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,EAAE;aAC/B,SAAS,EAAE;aACX,IAAI,CAAC,KAAK,CAAC;aACX,MAAM,CAAC,GAAG,CAAC;aACX,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC;aAC1B,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC,CAAQ,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,gFAAgF;IAChF,uEAAuE;IACvE,8EAA8E;IAE9E;;;;OAIG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,CAAC,aAAa,EAAE,CAAC;IAC7B,CAAC;IAED,kEAAkE;IAClE,KAAK,CAAC,IAAI;QACR,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,mFAAmF;IACnF,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IACpB,CAAC;CACF"}

package/dist/src/transports/factory.d.ts

@@ -0,0 +1,79 @@
+import type { AdapterFactory } from '@adonisjs/queue/types';
+import type { ControlPlane, Transport } from '../interfaces.js';
+/**
+ * The minimal application surface a {@link TransportFactory} thunk needs at boot to resolve an
+ * optional peer's service (the Lucid `db`, the queue adapter, etc.). The durable provider passes the
+ * booted `ApplicationService`, which satisfies this structurally — typed here so core stays free of a
+ * hard `@adonisjs/core` dependency.
+ */
+export interface TransportContext {
+    /** The booted application — used to resolve services/connections from the container. */
+    app: {
+        container: {
+            make(service: unknown): Promise<unknown>;
+        };
+        config: {
+            get<T>(key: string, defaultValue?: T): T;
+        };
+    };
+}
+/**
+ * A configured transport: a thunk the durable provider calls at boot to build the {@link Transport}
+ * (often also a {@link ControlPlane}). Each factory lazily imports its peer dependency
+ * (`@adonisjs/queue`, `@adonisjs/lucid`) inside the thunk, so the driver is only loaded when it is
+ * actually selected — keeping those packages optional.
+ */
+export type TransportFactory = (ctx: TransportContext) => Promise<Transport & Partial<ControlPlane>>;
+/** Options for the in-memory transport (no peer dependency). */
+export interface MemoryTransportConfig {
+}
+/** Options for the `@adonisjs/queue` transport. */
+export interface QueueTransportConfig {
+    /**
+     * Name of the `@adonisjs/queue` connection — a key of the `adapters` map in `config/queue.ts` —
+     * whose adapter this transport reads/writes. Omit to use that file's `default` connection. You
+     * configure the driver and its host/credentials once in `config/queue.ts`; durable just references
+     * it by name, exactly like `stores.lucid({ connection })` or `stores.redis({ connection })`.
+     */
+    connection?: string;
+    /**
+     * Escape hatch: pass a raw `@adonisjs/queue` adapter factory directly (e.g. `redis(...)`) instead of
+     * resolving one from `config/queue.ts`. For non-Adonis setups or a bespoke adapter. Takes
+     * precedence over `connection`.
+     */
+    adapter?: AdapterFactory;
+    /** Worker group this instance serves (required on a worker process to register handlers). */
+    group?: string;
+    /** Queue-name prefix so several apps can share one backend without colliding. Default `durable`. */
+    prefix?: string;
+    /** Poll interval (ms) for the result/task/heartbeat/control loops. Default 200ms. */
+    pollIntervalMs?: number;
+    /** Stable id for this process (stamped on heartbeats / control `from`). Default a random id. */
+    instanceId?: string;
+}
+/** Options for the DB-table-backed (`@adonisjs/lucid`) transport. */
+export interface DbTransportConfig {
+    /** Worker group this instance serves (required on a worker process to register handlers). */
+    group?: string;
+    /** Lucid connection name to use. Defaults to the `Database` default connection. */
+    connection?: string;
+    /** Poll interval (ms) for the result/task/heartbeat/control loops. Default 200ms. */
+    pollIntervalMs?: number;
+    /** How long a claimed-but-unfinished row is owned before it's reclaimable (crash recovery). Default 30s. */
+    leaseMs?: number;
+    /** Max rows claimed per poll. Default 20. */
+    batchSize?: number;
+    /** Create the transport tables on first use if missing. Default true. */
+    autoCreate?: boolean;
+    /** Stable id for this process (stamped on heartbeats / control `from` / `claimed_by`). Default random. */
+    instanceId?: string;
+}
+export declare const transports: {
+    /** In-process transport + control plane (single-process, no extra infra). The default. */
+    memory(_config?: MemoryTransportConfig): TransportFactory;
+    /** Run remote steps cross-process over `@adonisjs/queue`, using a connection from `config/queue.ts`. */
+    queue(config?: QueueTransportConfig): TransportFactory;
+    /** Run remote steps cross-process over the app's database, using `@adonisjs/lucid` — no broker. */
+    db(config?: DbTransportConfig): TransportFactory;
+};
+//# sourceMappingURL=factory.d.ts.map

package/dist/src/transports/factory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"factory.d.ts","sourceRoot":"","sources":["../../../src/transports/factory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAGhE;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,wFAAwF;IACxF,GAAG,EAAE;QACH,SAAS,EAAE;YAAE,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;SAAE,CAAC;QACxD,MAAM,EAAE;YAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;SAAE,CAAC;KACtD,CAAC;CACH;AAED;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,CAC7B,GAAG,EAAE,gBAAgB,KAClB,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;AAEhD,gEAAgE;AAChE,MAAM,WAAW,qBAAqB;CAErC;AAED,mDAAmD;AACnD,MAAM,WAAW,oBAAoB;IACnC;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,OAAO,CAAC,EAAE,cAAc,CAAC;IACzB,6FAA6F;IAC7F,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,oGAAoG;IACpG,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,qFAAqF;IACrF,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gGAAgG;IAChG,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,qEAAqE;AACrE,MAAM,WAAW,iBAAiB;IAChC,6FAA6F;IAC7F,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qFAAqF;IACrF,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,4GAA4G;IAC5G,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,6CAA6C;IAC7C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,yEAAyE;IACzE,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,0GAA0G;IAC1G,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAyDD,eAAO,MAAM,UAAU;IACrB,0FAA0F;qBAC1E,qBAAqB,GAAQ,gBAAgB;IAI7D,wGAAwG;mBAC1F,oBAAoB,GAAQ,gBAAgB;IAc1D,mGAAmG;gBACxF,iBAAiB,GAAQ,gBAAgB;CAgBrD,CAAC"}

package/dist/src/transports/factory.js

@@ -0,0 +1,57 @@
+import { InMemoryTransport } from '../testing/in-memory-transport.js';
+/**
+ * Resolve a raw `@adonisjs/queue` adapter factory from `config/queue.ts` by connection name —
+ * mirroring `@adonisjs/queue`'s own `resolveAdapters`: a function entry is the factory; a config
+ * provider is resolved via its `resolver(app)`. Reads only the app config, so it pulls in no
+ * `@adonisjs/queue` runtime code.
+ */
+async function resolveQueueAdapter(ctx, connection) {
+    const queueConfig = ctx.app.config.get('queue', { adapters: {} });
+    const name = connection ?? queueConfig.default;
+    if (!name) {
+        throw new Error('@agora/durable: transports.queue() needs a `connection`, or a `default` in config/queue.ts');
+    }
+    const entry = queueConfig.adapters?.[name];
+    if (!entry) {
+        throw new Error(`@agora/durable: unknown @adonisjs/queue connection "${name}" — check the adapters in config/queue.ts`);
+    }
+    return typeof entry === 'function' ? entry : entry.resolver(ctx.app);
+}
+export const transports = {
+    /** In-process transport + control plane (single-process, no extra infra). The default. */
+    memory(_config = {}) {
+        return async () => new InMemoryTransport();
+    },
+    /** Run remote steps cross-process over `@adonisjs/queue`, using a connection from `config/queue.ts`. */
+    queue(config = {}) {
+        return async (ctx) => {
+            const { QueueTransport } = await import('./queue.js');
+            const adapter = config.adapter ?? (await resolveQueueAdapter(ctx, config.connection));
+            return new QueueTransport({
+                adapter,
+                ...(config.group !== undefined ? { group: config.group } : {}),
+                ...(config.prefix !== undefined ? { prefix: config.prefix } : {}),
+                ...(config.pollIntervalMs !== undefined ? { pollIntervalMs: config.pollIntervalMs } : {}),
+                ...(config.instanceId !== undefined ? { instanceId: config.instanceId } : {}),
+            });
+        };
+    },
+    /** Run remote steps cross-process over the app's database, using `@adonisjs/lucid` — no broker. */
+    db(config = {}) {
+        return async () => {
+            const db = (await import('@adonisjs/lucid/services/db')).default;
+            const { DbTransport } = await import('./db.js');
+            return new DbTransport({
+                db,
+                ...(config.group !== undefined ? { group: config.group } : {}),
+                ...(config.connection !== undefined ? { connectionName: config.connection } : {}),
+                ...(config.pollIntervalMs !== undefined ? { pollIntervalMs: config.pollIntervalMs } : {}),
+                ...(config.leaseMs !== undefined ? { leaseMs: config.leaseMs } : {}),
+                ...(config.batchSize !== undefined ? { batchSize: config.batchSize } : {}),
+                ...(config.autoCreate !== undefined ? { autoCreate: config.autoCreate } : {}),
+                ...(config.instanceId !== undefined ? { instanceId: config.instanceId } : {}),
+            });
+        };
+    },
+};
+//# sourceMappingURL=factory.js.map

package/dist/src/transports/factory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"factory.js","sourceRoot":"","sources":["../../../src/transports/factory.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AAmGtE;;;;;GAKG;AACH,KAAK,UAAU,mBAAmB,CAChC,GAAqB,EACrB,UAAmB;IAEnB,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAGnC,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IAE9B,MAAM,IAAI,GAAG,UAAU,IAAI,WAAW,CAAC,OAAO,CAAC;IAC/C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CACb,4FAA4F,CAC7F,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CACb,uDAAuD,IAAI,2CAA2C,CACvG,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACvE,CAAC;AAED,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,0FAA0F;IAC1F,MAAM,CAAC,UAAiC,EAAE;QACxC,OAAO,KAAK,IAAI,EAAE,CAAC,IAAI,iBAAiB,EAAE,CAAC;IAC7C,CAAC;IAED,wGAAwG;IACxG,KAAK,CAAC,SAA+B,EAAE;QACrC,OAAO,KAAK,EAAE,GAAG,EAAE,EAAE;YACnB,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;YACtD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,mBAAmB,CAAC,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;YACtF,OAAO,IAAI,cAAc,CAAC;gBACxB,OAAO;gBACP,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,GAAG,CAAC,MAAM,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzF,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC9E,CAAC,CAAC;QACL,CAAC,CAAC;IACJ,CAAC;IAED,mGAAmG;IACnG,EAAE,CAAC,SAA4B,EAAE;QAC/B,OAAO,KAAK,IAAI,EAAE;YAChB,MAAM,EAAE,GAAG,CAAC,MAAM,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAC,OAAO,CAAC;YACjE,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;YAChD,OAAO,IAAI,WAAW,CAAC;gBACrB,EAAE;gBACF,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjF,GAAG,CAAC,MAAM,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzF,GAAG,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpE,GAAG,CAAC,MAAM,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7E,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAC9E,CAAC,CAAC;QACL,CAAC,CAAC;IACJ,CAAC;CACF,CAAC"}

package/dist/src/transports/queue-mock-adapter.d.ts

@@ -0,0 +1,39 @@
+import type { AcquiredJob, Adapter, JobData } from '@adonisjs/queue/types';
+/**
+ * A tiny in-memory `@adonisjs/queue` adapter for tests — implements just the surface the
+ * `QueueTransport` touches (push/pop/complete/fail/destroy) as plain FIFO queues, plus throwing
+ * stubs for the rest of the contract. No Redis, no Knex. `popFrom` mimics the real adapters'
+ * atomic move (pending → active) so two transports sharing one instance never double-consume.
+ */
+export declare class MockAdapter implements Adapter {
+    #private;
+    readonly pending: Map<string, JobData[]>;
+    readonly active: Map<string, AcquiredJob>;
+    workerId: string;
+    destroyed: boolean;
+    setWorkerId(id: string): void;
+    pushOn(queue: string, jobData: JobData): Promise<void>;
+    push(jobData: JobData): Promise<void>;
+    popFrom(queue: string): Promise<AcquiredJob | null>;
+    pop(): Promise<AcquiredJob | null>;
+    completeJob(jobId: string): Promise<void>;
+    failJob(jobId: string): Promise<void>;
+    sizeOf(queue: string): Promise<number>;
+    size(): Promise<number>;
+    destroy(): Promise<void>;
+    pushLater: () => Promise<never>;
+    pushLaterOn: () => Promise<never>;
+    pushMany: () => Promise<never>;
+    pushManyOn: () => Promise<never>;
+    recoverStalledJobs: () => Promise<never>;
+    retryJob: () => Promise<never>;
+    getJob: () => Promise<never>;
+    upsertSchedule: () => Promise<never>;
+    createSchedule: () => Promise<never>;
+    getSchedule: () => Promise<never>;
+    listSchedules: () => Promise<never>;
+    updateSchedule: () => Promise<never>;
+    deleteSchedule: () => Promise<never>;
+    claimDueSchedule: () => Promise<never>;
+}
+//# sourceMappingURL=queue-mock-adapter.d.ts.map

package/dist/src/transports/queue-mock-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue-mock-adapter.d.ts","sourceRoot":"","sources":["../../../src/transports/queue-mock-adapter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAE3E;;;;;GAKG;AACH,qBAAa,WAAY,YAAW,OAAO;;IACzC,QAAQ,CAAC,OAAO,yBAAgC;IAChD,QAAQ,CAAC,MAAM,2BAAkC;IACjD,QAAQ,SAAM;IACd,SAAS,UAAS;IAElB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAIvB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAMtD,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrC,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAsBnD,GAAG,IAAI,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAIlC,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIzC,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAItC,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC;IAIvB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;IAM9B,SAAS,QAgBU,OAAO,CAAC,KAAK,CAAC,CAhBU;IAC3C,WAAW,QAeQ,OAAO,CAAC,KAAK,CAAC,CAfc;IAC/C,QAAQ,QAcW,OAAO,CAAC,KAAK,CAAC,CAdQ;IACzC,UAAU,QAaS,OAAO,CAAC,KAAK,CAAC,CAbY;IAC7C,kBAAkB,QAYC,OAAO,CAAC,KAAK,CAAC,CAZ4B;IAC7D,QAAQ,QAWW,OAAO,CAAC,KAAK,CAAC,CAXQ;IACzC,MAAM,QAUa,OAAO,CAAC,KAAK,CAAC,CAVI;IACrC,cAAc,QASK,OAAO,CAAC,KAAK,CAAC,CAToB;IACrD,cAAc,QAQK,OAAO,CAAC,KAAK,CAAC,CARoB;IACrD,WAAW,QAOQ,OAAO,CAAC,KAAK,CAAC,CAPc;IAC/C,aAAa,QAMM,OAAO,CAAC,KAAK,CAAC,CANkB;IACnD,cAAc,QAKK,OAAO,CAAC,KAAK,CAAC,CALoB;IACrD,cAAc,QAIK,OAAO,CAAC,KAAK,CAAC,CAJoB;IACrD,gBAAgB,QAGG,OAAO,CAAC,KAAK,CAAC,CAHwB;CAQ1D"}

package/dist/src/transports/queue-mock-adapter.js

@@ -0,0 +1,86 @@
+/**
+ * A tiny in-memory `@adonisjs/queue` adapter for tests — implements just the surface the
+ * `QueueTransport` touches (push/pop/complete/fail/destroy) as plain FIFO queues, plus throwing
+ * stubs for the rest of the contract. No Redis, no Knex. `popFrom` mimics the real adapters'
+ * atomic move (pending → active) so two transports sharing one instance never double-consume.
+ */
+export class MockAdapter {
+    pending = new Map();
+    active = new Map();
+    workerId = '';
+    destroyed = false;
+    setWorkerId(id) {
+        this.workerId = id;
+    }
+    async pushOn(queue, jobData) {
+        const list = this.pending.get(queue) ?? [];
+        list.push(jobData);
+        this.pending.set(queue, list);
+    }
+    async push(jobData) {
+        await this.pushOn('default', jobData);
+    }
+    async popFrom(queue) {
+        const list = this.pending.get(queue);
+        if (!list || list.length === 0)
+            return null;
+        // Mirror the real adapters' priority ordering: lower `priority` number runs first (default 5 when
+        // absent), FIFO among equal priorities. A plain FIFO queue (no priorities set) is unchanged.
+        const DEFAULT_PRIORITY = 5;
+        let bestIndex = 0;
+        let bestPriority = list[0]?.priority ?? DEFAULT_PRIORITY;
+        for (let i = 1; i < list.length; i += 1) {
+            const candidate = list[i]?.priority ?? DEFAULT_PRIORITY;
+            if (candidate < bestPriority) {
+                bestIndex = i;
+                bestPriority = candidate;
+            }
+        }
+        const [job] = list.splice(bestIndex, 1);
+        if (!job)
+            return null;
+        const acquired = { ...job, acquiredAt: Date.now() };
+        this.active.set(job.id, acquired);
+        return acquired;
+    }
+    async pop() {
+        return this.popFrom('default');
+    }
+    async completeJob(jobId) {
+        this.active.delete(jobId);
+    }
+    async failJob(jobId) {
+        this.active.delete(jobId);
+    }
+    async sizeOf(queue) {
+        return this.pending.get(queue)?.length ?? 0;
+    }
+    async size() {
+        return this.sizeOf('default');
+    }
+    async destroy() {
+        this.destroyed = true;
+    }
+    // --- Unused by the transport: present only to satisfy the Adapter contract. ---
+    /* c8 ignore start */
+    pushLater = this.#unsupported('pushLater');
+    pushLaterOn = this.#unsupported('pushLaterOn');
+    pushMany = this.#unsupported('pushMany');
+    pushManyOn = this.#unsupported('pushManyOn');
+    recoverStalledJobs = this.#unsupported('recoverStalledJobs');
+    retryJob = this.#unsupported('retryJob');
+    getJob = this.#unsupported('getJob');
+    upsertSchedule = this.#unsupported('upsertSchedule');
+    createSchedule = this.#unsupported('createSchedule');
+    getSchedule = this.#unsupported('getSchedule');
+    listSchedules = this.#unsupported('listSchedules');
+    updateSchedule = this.#unsupported('updateSchedule');
+    deleteSchedule = this.#unsupported('deleteSchedule');
+    claimDueSchedule = this.#unsupported('claimDueSchedule');
+    #unsupported(name) {
+        return async () => {
+            throw new Error(`MockAdapter.${name} is not implemented`);
+        };
+    }
+}
+//# sourceMappingURL=queue-mock-adapter.js.map

package/dist/src/transports/queue-mock-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue-mock-adapter.js","sourceRoot":"","sources":["../../../src/transports/queue-mock-adapter.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,OAAO,WAAW;IACb,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;IACvC,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,QAAQ,GAAG,EAAE,CAAC;IACd,SAAS,GAAG,KAAK,CAAC;IAElB,WAAW,CAAC,EAAU;QACpB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAAgB;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,OAAgB;QACzB,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,KAAa;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,kGAAkG;QAClG,6FAA6F;QAC7F,MAAM,gBAAgB,GAAG,CAAC,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,gBAAgB,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,gBAAgB,CAAC;YACxD,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;gBAC7B,SAAS,GAAG,CAAC,CAAC;gBACd,YAAY,GAAG,SAAS,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,MAAM,QAAQ,GAAgB,EAAE,GAAG,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACjE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,GAAG;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,KAAa;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,KAAa;QACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,IAAI;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,iFAAiF;IACjF,qBAAqB;IACrB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;IAC3C,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;IAC/C,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;IACzC,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;IAC7C,kBAAkB,GAAG,IAAI,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC;IAC7D,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;IACzC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IACrD,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IACrD,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;IAC/C,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;IACnD,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IACrD,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;IACrD,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC;IAEzD,YAAY,CAAC,IAAY;QACvB,OAAO,KAAK,IAAoB,EAAE;YAChC,MAAM,IAAI,KAAK,CAAC,eAAe,IAAI,qBAAqB,CAAC,CAAC;QAC5D,CAAC,CAAC;IACJ,CAAC;CAEF"}