@dudousxd/nestjs-durable-store-prisma 0.11.4 → 0.11.6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.cjs +19 -2
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +25 -1
- package/dist/index.d.ts +25 -1
- package/dist/index.js +17 -1
- package/dist/index.js.map +1 -1
- package/package.json +3 -3
- package/prisma/schema.prisma +1 -0
package/dist/index.cjs
CHANGED
|
@@ -21,7 +21,8 @@ var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: tru
|
|
|
21
21
|
// src/index.ts
|
|
22
22
|
var index_exports = {};
|
|
23
23
|
__export(index_exports, {
|
|
24
|
-
PrismaStateStore: () => PrismaStateStore
|
|
24
|
+
PrismaStateStore: () => PrismaStateStore,
|
|
25
|
+
durableManagedTables: () => durableManagedTables
|
|
25
26
|
});
|
|
26
27
|
module.exports = __toCommonJS(index_exports);
|
|
27
28
|
|
|
@@ -412,6 +413,7 @@ function toRunData(run) {
|
|
|
412
413
|
wakeAt: bigOrNull(run.wakeAt),
|
|
413
414
|
lockedBy: run.lockedBy ?? null,
|
|
414
415
|
lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),
|
|
416
|
+
awaitingDecisionTaskId: run.awaitingDecisionTaskId ?? null,
|
|
415
417
|
recoveryAttempts: run.recoveryAttempts ?? null,
|
|
416
418
|
tags: jsonOrNull(run.tags),
|
|
417
419
|
searchAttributes: jsonOrNull(run.searchAttributes),
|
|
@@ -432,6 +434,7 @@ function toRunPatch(patch) {
|
|
|
432
434
|
if ("wakeAt" in patch) data.wakeAt = bigOrNull(patch.wakeAt);
|
|
433
435
|
if ("lockedBy" in patch) data.lockedBy = patch.lockedBy ?? null;
|
|
434
436
|
if ("lockedUntil" in patch) data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);
|
|
437
|
+
if ("awaitingDecisionTaskId" in patch) data.awaitingDecisionTaskId = patch.awaitingDecisionTaskId ?? null;
|
|
435
438
|
if ("recoveryAttempts" in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;
|
|
436
439
|
if ("tags" in patch) data.tags = jsonOrNull(patch.tags);
|
|
437
440
|
if ("searchAttributes" in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);
|
|
@@ -453,6 +456,7 @@ function fromRunRow(row) {
|
|
|
453
456
|
wakeAt: numOrUndef(row.wakeAt),
|
|
454
457
|
lockedBy: row.lockedBy ?? void 0,
|
|
455
458
|
lockedUntil: row.lockedUntil == null ? void 0 : row.lockedUntil.getTime(),
|
|
459
|
+
awaitingDecisionTaskId: row.awaitingDecisionTaskId ?? void 0,
|
|
456
460
|
recoveryAttempts: row.recoveryAttempts ?? void 0,
|
|
457
461
|
tags: row.tags ?? void 0,
|
|
458
462
|
searchAttributes: row.searchAttributes ?? void 0,
|
|
@@ -506,8 +510,21 @@ function fromCheckpointRow(row) {
|
|
|
506
510
|
};
|
|
507
511
|
}
|
|
508
512
|
__name(fromCheckpointRow, "fromCheckpointRow");
|
|
513
|
+
|
|
514
|
+
// src/schema.ts
|
|
515
|
+
function durableManagedTables() {
|
|
516
|
+
return [
|
|
517
|
+
"durable_workflow_runs",
|
|
518
|
+
"durable_step_checkpoints",
|
|
519
|
+
"durable_run_attributes",
|
|
520
|
+
"durable_signal_waiters",
|
|
521
|
+
"durable_buffered_signals"
|
|
522
|
+
];
|
|
523
|
+
}
|
|
524
|
+
__name(durableManagedTables, "durableManagedTables");
|
|
509
525
|
// Annotate the CommonJS export names for ESM import in node:
|
|
510
526
|
0 && (module.exports = {
|
|
511
|
-
PrismaStateStore
|
|
527
|
+
PrismaStateStore,
|
|
528
|
+
durableManagedTables
|
|
512
529
|
});
|
|
513
530
|
//# sourceMappingURL=index.cjs.map
|
package/dist/index.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/index.ts","../src/prisma-state-store.ts"],"sourcesContent":["export * from './prisma-state-store';\n","import {\n type AttributeFilter,\n type RunQuery,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type WorkflowRun,\n attributeColumnFor,\n attributeOperand,\n normalizeAttributeRows,\n} from '@dudousxd/nestjs-durable-core';\n\n/* The Prisma client is generated per-schema, so the adapter can't import a concrete one. Instead\n it depends on this structural surface — the three model delegates and the methods it uses. A\n real `PrismaClient` (with the models from prisma/schema.prisma added) satisfies it. Query-arg\n shapes are Prisma's own generics, so they're left as `any` at this single boundary; the row\n return types are precise, which is what the mapping code below relies on. */\n\ninterface RunRow {\n id: string;\n workflow: string;\n workflowVersion: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n wakeAt: bigint | null;\n lockedBy: string | null;\n lockedUntil: Date | null;\n recoveryAttempts: number | null;\n tags: unknown;\n searchAttributes: unknown;\n priority: number | null;\n createdAt: Date;\n updatedAt: Date;\n}\n\ninterface CheckpointRow {\n runId: string;\n seq: number;\n name: string;\n kind: string;\n stepId: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n events: unknown;\n attempts: number;\n workerGroup: string | null;\n parallelGroup: string | null;\n wakeAt: bigint | null;\n enqueuedAt: Date | null;\n startedAt: Date;\n finishedAt: Date;\n}\n\ninterface WaiterRow {\n token: string;\n runId: string;\n seq: number;\n parallelGroup: string | null;\n}\n\ninterface RunAttributeRow {\n runId: string;\n key: string;\n strValue: string | null;\n numValue: number | null;\n}\n\ninterface BufferedSignalRow {\n id: bigint;\n token: string;\n payload: unknown;\n}\n\n// Prisma's per-model query args are generated generics; left as `any` at this single boundary.\ntype Args = any;\n\ninterface Delegate<Row> {\n create(args: Args): Promise<Row>;\n createMany(args: Args): Promise<{ count: number }>;\n findUnique(args: Args): Promise<Row | null>;\n findFirst(args?: Args): Promise<Row | null>;\n findMany(args?: Args): Promise<Row[]>;\n update(args: Args): Promise<Row>;\n updateMany(args: Args): Promise<{ count: number }>;\n upsert(args: Args): Promise<Row>;\n delete(args: Args): Promise<Row>;\n deleteMany(args?: Args): Promise<{ count: number }>;\n}\n\nexport interface DurablePrismaTx {\n durableWorkflowRun: Delegate<RunRow>;\n durableStepCheckpoint: Delegate<CheckpointRow>;\n durableRunAttribute: Delegate<RunAttributeRow>;\n durableSignalWaiter: Delegate<WaiterRow>;\n durableBufferedSignal: Delegate<BufferedSignalRow>;\n}\n\nexport interface DurablePrismaClient extends DurablePrismaTx {\n /** Prisma's interactive-transaction form: runs `fn` with a tx-scoped client and commits on resolve. */\n $transaction<T>(fn: (tx: DurablePrismaTx) => Promise<T>): Promise<T>;\n}\n\n/**\n * Prisma-backed `StateStore`. Pass your `PrismaClient` after adding the models from\n * `prisma/schema.prisma` to your schema. JSON columns carry the run/step payloads directly;\n * `wakeAt` is a `BigInt` (epoch ms).\n */\nexport class PrismaStateStore implements StateStore {\n constructor(private readonly db: DurablePrismaClient) {}\n\n async createRun(run: WorkflowRun): Promise<void> {\n await this.db.durableWorkflowRun.create({ data: toRunData(run) });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, patch: Partial<WorkflowRun>): Promise<void> {\n await this.db.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n // Keep the side-table in step with the run's attributes whenever they're patched.\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n }\n\n /** Rewrite a run's normalized attribute rows: delete the old set, insert the current one. Mirrors\n * the in-memory store's reindex so the side-table always reflects the run's live searchAttributes. */\n private async reindexAttributes(\n runId: string,\n attributes: WorkflowRun['searchAttributes'],\n ): Promise<void> {\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n const rows = normalizeAttributeRows(runId, attributes);\n if (rows.length) await this.db.durableRunAttribute.createMany({ data: rows });\n }\n\n async getRun(runId: string): Promise<WorkflowRun | null> {\n const row = await this.db.durableWorkflowRun.findUnique({ where: { id: runId } });\n return row ? fromRunRow(row) : null;\n }\n\n async deleteRun(runId: string): Promise<void> {\n // Child rows first, then the run — checkpoints, signal waiters, attribute rows.\n await this.db.durableStepCheckpoint.deleteMany({ where: { runId } });\n await this.db.durableSignalWaiter.deleteMany({ where: { runId } });\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n await this.db.durableWorkflowRun.deleteMany({ where: { id: runId } });\n }\n\n async getCheckpoint(runId: string, seq: number): Promise<StepCheckpoint | null> {\n const row = await this.db.durableStepCheckpoint.findUnique({\n where: { runId_seq: { runId, seq } },\n });\n return row ? fromCheckpointRow(row) : null;\n }\n\n async saveCheckpoint(checkpoint: StepCheckpoint): Promise<void> {\n const data = toCheckpointData(checkpoint);\n await this.db.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: checkpoint.runId, seq: checkpoint.seq } },\n create: data,\n update: data,\n });\n }\n\n async transaction<T>(\n work: (tx: {\n raw: unknown;\n saveCheckpoint: (cp: StepCheckpoint) => Promise<void>;\n }) => Promise<T>,\n ): Promise<T> {\n return this.db.$transaction(async (tx) =>\n work({\n raw: tx,\n saveCheckpoint: async (cp) => {\n const data = toCheckpointData(cp);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: cp.runId, seq: cp.seq } },\n create: data,\n update: data,\n });\n },\n }),\n );\n }\n\n async listIncompleteRuns(): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: { in: ['running', 'cancelling'] } },\n });\n return rows.map(fromRunRow);\n }\n\n async listPendingRuns(limit: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'pending' },\n orderBy: { createdAt: 'asc' }, // FIFO dispatch\n take: limit,\n });\n return rows.map(fromRunRow);\n }\n\n async listDueTimers(nowMs: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'suspended', wakeAt: { not: null, lte: BigInt(nowMs) } },\n });\n return rows.map(fromRunRow);\n }\n\n async tryLockRun(\n runId: string,\n owner: string,\n leaseUntilMs: number,\n nowMs: number,\n ): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: {\n id: runId,\n OR: [{ lockedUntil: null }, { lockedUntil: { lte: new Date(nowMs) } }],\n },\n data: { lockedBy: owner, lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async releaseRunLock(runId: string): Promise<void> {\n // Idempotent by design: releasing the lease on a run that no longer exists is a no-op, not an\n // error. The engine calls this best-effort in a `finally` AFTER the run has settled, so it can\n // race a concurrent purge/teardown — Prisma's `update({ where: { id } })` would throw P2025\n // (\"No record was found for an update\") on that race and, since the call is fire-and-forget on\n // the engine's terminal path, surface as an unhandled rejection. `updateMany` matches a 0-row\n // WHERE to an empty result (no throw), mirroring the in-memory store's `if (run)` guard and the\n // set-where semantics of every sibling adapter (TypeORM/MikroORM/Drizzle).\n await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: { lockedBy: null, lockedUntil: null },\n });\n }\n\n async renewRunLock(runId: string, owner: string, leaseUntilMs: number): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId, lockedBy: owner },\n data: { lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\n const where: Record<string, unknown> = {};\n if (query.workflow) where.workflow = query.workflow;\n // `status IN (...)`; an empty set matches nothing (mirrors the in-memory store). Combined with the\n // single-value `status` via AND when both are present, so the narrower set wins.\n if (query.status && query.statuses) {\n where.AND = [{ status: query.status }, { status: { in: query.statuses } }];\n } else if (query.status) {\n where.status = query.status;\n } else if (query.statuses) {\n where.status = { in: query.statuses };\n }\n if (query.tag) where.tags = { array_contains: query.tag };\n // Typed/range attribute predicates push DOWN into SQL: each filter becomes a relation `some`\n // (EXISTS) on the normalized `durable_run_attributes` side-table, so the DB filters AND paginates\n // — no full scan + in-process filter. ANDed: a run must match every filter, so one `some` each.\n if (query.attributes?.length) {\n const existing = (where.AND as unknown[] | undefined) ?? [];\n where.AND = [...existing, ...query.attributes.map((f) => attributeSome(f))];\n }\n const orderBy = { createdAt: 'desc' as const }; // newest first — recent runs on top in the dashboard\n const rows = await this.db.durableWorkflowRun.findMany({\n where,\n take: query.limit,\n skip: query.offset,\n orderBy,\n });\n return rows.map(fromRunRow);\n }\n\n async listCheckpoints(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async getLatestCheckpointByName(\n runId: string,\n name: string,\n ): Promise<StepCheckpoint | undefined> {\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, name },\n orderBy: { seq: 'desc' },\n });\n return row ? fromCheckpointRow(row) : undefined;\n }\n\n async listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]> {\n if (prefixes.length === 0) return [];\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId, OR: prefixes.map((p) => ({ name: { startsWith: p } })) },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async putSignalWaiter(waiter: SignalWaiter): Promise<void> {\n await this.db.durableSignalWaiter.upsert({\n where: { token: waiter.token },\n create: {\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n update: {\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n });\n }\n\n async takeSignalWaiter(token: string): Promise<SignalWaiter | null> {\n const row = await this.db.durableSignalWaiter.findUnique({ where: { token } });\n if (!row) return null;\n await this.db.durableSignalWaiter.delete({ where: { token } });\n return {\n token: row.token,\n runId: row.runId,\n seq: row.seq,\n parallelGroup: row.parallelGroup ?? undefined,\n };\n }\n\n async listSignalWaiters(prefix: string): Promise<SignalWaiter[]> {\n const rows = await this.db.durableSignalWaiter.findMany({\n where: { token: { startsWith: prefix } },\n });\n return rows.map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async bufferSignal(token: string, payload: unknown): Promise<void> {\n await this.db.durableBufferedSignal.create({ data: { token, payload: jsonOrNull(payload) } });\n }\n\n async takeBufferedSignal(token: string): Promise<{ payload: unknown } | null> {\n const row = await this.db.durableBufferedSignal.findFirst({\n where: { token },\n orderBy: { id: 'asc' },\n });\n if (!row) return null;\n await this.db.durableBufferedSignal.delete({ where: { id: row.id } });\n return { payload: row.payload ?? undefined };\n }\n}\n\n/**\n * One attribute predicate as a Prisma relation `some` filter on the side-table — compiles to an\n * EXISTS, so the predicate runs in SQL. `<>` (ne) maps to `{ not }`, which under `some` also excludes\n * runs where the attribute is absent (the missing-key-never-matches contract): `some` already\n * requires a matching row to exist. Numeric operands compare `numValue`, everything else `strValue`.\n */\nfunction attributeSome(f: AttributeFilter): { attributes: { some: Record<string, unknown> } } {\n const col = attributeColumnFor(f); // 'numValue' | 'strValue'\n const operand = attributeOperand(f);\n const condition =\n f.op === 'eq' ? operand : f.op === 'ne' ? { not: operand } : { [f.op]: operand }; // gt/gte/lt/lte map 1:1 to Prisma operators\n return { attributes: { some: { key: f.key, [col]: condition } } };\n}\n\nconst bigOrNull = (n: number | undefined) => (n == null ? null : BigInt(n));\nconst numOrUndef = (n: bigint | null) => (n == null ? undefined : Number(n));\nconst jsonOrNull = (v: unknown) => v ?? null;\n\nfunction toRunData(run: WorkflowRun) {\n return {\n id: run.id,\n workflow: run.workflow,\n workflowVersion: run.workflowVersion,\n status: run.status,\n input: jsonOrNull(run.input),\n output: jsonOrNull(run.output),\n error: jsonOrNull(run.error),\n wakeAt: bigOrNull(run.wakeAt),\n lockedBy: run.lockedBy ?? null,\n lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),\n recoveryAttempts: run.recoveryAttempts ?? null,\n tags: jsonOrNull(run.tags),\n searchAttributes: jsonOrNull(run.searchAttributes),\n priority: run.priority ?? null,\n createdAt: run.createdAt,\n updatedAt: run.updatedAt,\n };\n}\n\nfunction toRunPatch(patch: Partial<WorkflowRun>) {\n // Map EVERY patchable field, using presence (`'x' in patch`) semantics for the nullable ones so a\n // patch can CLEAR a column (e.g. `{ error: undefined }` on completion sets it to NULL — matching\n // the TypeORM / MikroORM / in-memory stores). The two non-null Date fields use a defined-guard\n // since they are never cleared. Previously only 7 fields were mapped, so `updateRun({ tags })` /\n // `{ lockedBy }` / clearing `error` silently no-opped on this adapter.\n const data: Record<string, unknown> = {};\n if ('workflow' in patch) data.workflow = patch.workflow;\n if ('workflowVersion' in patch) data.workflowVersion = patch.workflowVersion;\n if ('status' in patch) data.status = patch.status;\n if ('input' in patch) data.input = jsonOrNull(patch.input);\n if ('output' in patch) data.output = jsonOrNull(patch.output);\n if ('error' in patch) data.error = jsonOrNull(patch.error);\n if ('wakeAt' in patch) data.wakeAt = bigOrNull(patch.wakeAt);\n if ('lockedBy' in patch) data.lockedBy = patch.lockedBy ?? null;\n if ('lockedUntil' in patch)\n data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);\n if ('recoveryAttempts' in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if ('searchAttributes' in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);\n if ('priority' in patch) data.priority = patch.priority ?? null;\n if (patch.createdAt != null) data.createdAt = patch.createdAt;\n if (patch.updatedAt != null) data.updatedAt = patch.updatedAt;\n return data;\n}\n\nfunction fromRunRow(row: RunRow): WorkflowRun {\n return {\n id: row.id,\n workflow: row.workflow,\n workflowVersion: row.workflowVersion,\n status: row.status as WorkflowRun['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n wakeAt: numOrUndef(row.wakeAt),\n lockedBy: row.lockedBy ?? undefined,\n lockedUntil: row.lockedUntil == null ? undefined : row.lockedUntil.getTime(),\n recoveryAttempts: row.recoveryAttempts ?? undefined,\n tags: (row.tags as string[] | null) ?? undefined,\n searchAttributes:\n (row.searchAttributes as Record<string, string | number | boolean> | null) ?? undefined,\n priority: row.priority ?? undefined,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\n };\n}\n\nfunction toCheckpointData(cp: StepCheckpoint) {\n return {\n runId: cp.runId,\n seq: cp.seq,\n name: cp.name,\n kind: cp.kind,\n stepId: cp.stepId,\n status: cp.status,\n input: jsonOrNull(cp.input),\n output: jsonOrNull(cp.output),\n error: jsonOrNull(cp.error),\n events: jsonOrNull(cp.events),\n attempts: cp.attempts,\n workerGroup: cp.workerGroup ?? null,\n parallelGroup: cp.parallelGroup ?? null,\n wakeAt: bigOrNull(cp.wakeAt),\n enqueuedAt: cp.enqueuedAt,\n startedAt: cp.startedAt,\n finishedAt: cp.finishedAt,\n };\n}\n\nfunction fromCheckpointRow(row: CheckpointRow): StepCheckpoint {\n return {\n runId: row.runId,\n seq: row.seq,\n name: row.name,\n kind: row.kind as StepCheckpoint['kind'],\n stepId: row.stepId,\n status: row.status as StepCheckpoint['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n events: (row.events ?? undefined) as StepEvent[] | undefined,\n attempts: row.attempts,\n workerGroup: row.workerGroup ?? undefined,\n parallelGroup: row.parallelGroup ?? undefined,\n wakeAt: numOrUndef(row.wakeAt),\n enqueuedAt: row.enqueuedAt ?? row.startedAt,\n startedAt: row.startedAt,\n finishedAt: row.finishedAt,\n };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;ACAA,iCAYO;AAqGA,IAAMA,mBAAN,MAAMA;EAjHb,OAiHaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,UAAUC,KAAiC;AAC/C,UAAM,KAAKF,GAAGG,mBAAmBC,OAAO;MAAEC,MAAMC,UAAUJ,GAAAA;IAAK,CAAA;AAC/D,UAAM,KAAKK,kBAAkBL,IAAIM,IAAIN,IAAIO,gBAAgB;EAC3D;EAEA,MAAMC,UAAUC,OAAeC,OAA4C;AACzE,UAAM,KAAKZ,GAAGG,mBAAmBU,OAAO;MAAEC,OAAO;QAAEN,IAAIG;MAAM;MAAGN,MAAMU,WAAWH,KAAAA;IAAO,CAAA;AAExF,QAAI,sBAAsBA,MAAO,OAAM,KAAKL,kBAAkBI,OAAOC,MAAMH,gBAAgB;EAC7F;;;EAIA,MAAcF,kBACZI,OACAK,YACe;AACf,UAAM,KAAKhB,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAMQ,WAAOC,mDAAuBT,OAAOK,UAAAA;AAC3C,QAAIG,KAAKE,OAAQ,OAAM,KAAKrB,GAAGiB,oBAAoBK,WAAW;MAAEjB,MAAMc;IAAK,CAAA;EAC7E;EAEA,MAAMI,OAAOZ,OAA4C;AACvD,UAAMa,MAAM,MAAM,KAAKxB,GAAGG,mBAAmBsB,WAAW;MAAEX,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;AAC/E,WAAOa,MAAME,WAAWF,GAAAA,IAAO;EACjC;EAEA,MAAMG,UAAUhB,OAA8B;AAE5C,UAAM,KAAKX,GAAG4B,sBAAsBV,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKX,GAAG6B,oBAAoBX,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGG,mBAAmBe,WAAW;MAAEJ,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMmB,cAAcnB,OAAeoB,KAA6C;AAC9E,UAAMP,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBH,WAAW;MACzDX,OAAO;QAAEkB,WAAW;UAAErB;UAAOoB;QAAI;MAAE;IACrC,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO;EACxC;EAEA,MAAMU,eAAeC,YAA2C;AAC9D,UAAM9B,OAAO+B,iBAAiBD,UAAAA;AAC9B,UAAM,KAAKnC,GAAG4B,sBAAsBS,OAAO;MACzCvB,OAAO;QAAEkB,WAAW;UAAErB,OAAOwB,WAAWxB;UAAOoB,KAAKI,WAAWJ;QAAI;MAAE;MACrE3B,QAAQC;MACRQ,QAAQR;IACV,CAAA;EACF;EAEA,MAAMiC,YACJC,MAIY;AACZ,WAAO,KAAKvC,GAAGwC,aAAa,OAAOC,OACjCF,KAAK;MACHG,KAAKD;MACLP,gBAAgB,8BAAOS,OAAAA;AACrB,cAAMtC,OAAO+B,iBAAiBO,EAAAA;AAC9B,cAAMF,GAAGb,sBAAsBS,OAAO;UACpCvB,OAAO;YAAEkB,WAAW;cAAErB,OAAOgC,GAAGhC;cAAOoB,KAAKY,GAAGZ;YAAI;UAAE;UACrD3B,QAAQC;UACRQ,QAAQR;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAMuC,qBAA6C;AACjD,UAAMzB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;MAAE;IACrD,CAAA;AACA,WAAO5B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAuC;AAC3D,UAAM/B,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;MAAU;MAC3BK,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAuC;AACzD,UAAMpC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAaU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;MAAE;IAC1E,CAAA;AACA,WAAOpC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMkC,WACJjD,OACAkD,OACAC,cACAP,OACkB;AAClB,UAAMQ,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QACLN,IAAIG;QACJsD,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAER,KAAK,IAAIS,KAAKZ,KAAAA;YAAO;UAAE;;MACtE;MACAlD,MAAM;QAAE+D,UAAUP;QAAOK,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMC,eAAe3D,OAA8B;AAQjD,UAAM,KAAKX,GAAGG,mBAAmB6D,WAAW;MAC1ClD,OAAO;QAAEN,IAAIG;MAAM;MACnBN,MAAM;QAAE+D,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMK,aAAa5D,OAAekD,OAAeC,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QAAEN,IAAIG;QAAOyD,UAAUP;MAAM;MACpCxD,MAAM;QAAE6D,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMG,SAASC,OAAyC;AACtD,UAAM3D,QAAiC,CAAC;AACxC,QAAI2D,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAG3C,QAAID,MAAM3B,UAAU2B,MAAME,UAAU;AAClC7D,YAAM8D,MAAM;QAAC;UAAE9B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAME;UAAS;QAAE;;IAC1E,WAAWF,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAME,UAAU;AACzB7D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAME;MAAS;IACtC;AACA,QAAIF,MAAMI,IAAK/D,OAAMgE,OAAO;MAAEC,gBAAgBN,MAAMI;IAAI;AAIxD,QAAIJ,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM2D,WAAYlE,MAAM8D,OAAiC,CAAA;AACzD9D,YAAM8D,MAAM;WAAII;WAAaP,MAAMzD,WAAWgC,IAAI,CAACiC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,UAAM9B,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B;MACAuC,MAAMoB,MAAMvB;MACZiC,MAAMV,MAAMW;MACZjC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM2D,gBAAgB1E,OAA0C;AAC9D,UAAMQ,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;MAAM;MACfwC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqD,0BACJ3E,OACA4E,MACqC;AACrC,UAAM/D,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsB4D,UAAU;MACxD1E,OAAO;QAAEH;QAAO4E;MAAK;MACrBpC,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAOiE;EACxC;EAEA,MAAMC,4BAA4B/E,OAAegF,UAA+C;AAC9F,QAAIA,SAAStE,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAI0B,SAAS3C,IAAI,CAAC4C,OAAO;UAAEL,MAAM;YAAEM,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEzC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAM6D,gBAAgBC,QAAqC;AACzD,UAAM,KAAK/F,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAEkF,OAAOD,OAAOC;MAAM;MAC7B5F,QAAQ;QACN4F,OAAOD,OAAOC;QACdrF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;MACApF,QAAQ;QACNF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMxE,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACxE,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBsE,OAAO;MAAErF,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOxE,IAAIwE;MACXrF,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACTkE,eAAezE,IAAIyE,iBAAiBR;IACtC;EACF;EAEA,MAAMW,kBAAkBC,QAAyC;AAC/D,UAAMlF,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAEkF,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAOlF,KAAK6B,IAAI,CAACsD,OAAO;MACtBN,OAAOM,EAAEN;MACTrF,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACPkE,eAAeK,EAAEL,iBAAiBR;IACpC,EAAA;EACF;EAEA,MAAMc,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKxG,GAAGyG,sBAAsBrG,OAAO;MAAEC,MAAM;QAAE2F;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMxE,MAAM,MAAM,KAAKxB,GAAGyG,sBAAsBjB,UAAU;MACxD1E,OAAO;QAAEkF;MAAM;MACf7C,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGyG,sBAAsBN,OAAO;MAAErF,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEgG,SAAShF,IAAIgF,WAAWf;IAAU;EAC7C;AACF;AAQA,SAASP,cAAcD,GAAkB;AACvC,QAAM2B,UAAMC,+CAAmB5B,CAAAA;AAC/B,QAAM6B,cAAUC,6CAAiB9B,CAAAA;AACjC,QAAM+B,YACJ/B,EAAEgC,OAAO,OAAOH,UAAU7B,EAAEgC,OAAO,OAAO;IAAExD,KAAKqD;EAAQ,IAAI;IAAE,CAAC7B,EAAEgC,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE9F,YAAY;MAAEkG,MAAM;QAAEC,KAAKlC,EAAEkC;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS9B;AAQT,IAAMkC,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAO1D,OAAO0D,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAO5B,SAAY8B,OAAOF,CAAAA,GAAtD;AACnB,IAAMX,aAAa,wBAACc,MAAeA,KAAK,MAArB;AAEnB,SAASlH,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd+C,iBAAiBvH,IAAIuH;IACrB3E,QAAQ5C,IAAI4C;IACZ4E,OAAOhB,WAAWxG,IAAIwH,KAAK;IAC3BC,QAAQjB,WAAWxG,IAAIyH,MAAM;IAC7BC,OAAOlB,WAAWxG,IAAI0H,KAAK;IAC3BpE,QAAQ4D,UAAUlH,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE2D,kBAAkB3H,IAAI2H,oBAAoB;IAC1C/C,MAAM4B,WAAWxG,IAAI4E,IAAI;IACzBrE,kBAAkBiG,WAAWxG,IAAIO,gBAAgB;IACjDqH,UAAU5H,IAAI4H,YAAY;IAC1B1E,WAAWlD,IAAIkD;IACf2E,WAAW7H,IAAI6H;EACjB;AACF;AAnBSzH;AAqBT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKoH,kBAAkB7G,MAAM6G;AAC7D,MAAI,YAAY7G,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKqH,QAAQhB,WAAW9F,MAAM8G,KAAK;AACzD,MAAI,YAAY9G,MAAOP,MAAKsH,SAASjB,WAAW9F,MAAM+G,MAAM;AAC5D,MAAI,WAAW/G,MAAOP,MAAKuH,QAAQlB,WAAW9F,MAAMgH,KAAK;AACzD,MAAI,YAAYhH,MAAOP,MAAKmD,SAAS4D,UAAUxG,MAAM4C,MAAM;AAC3D,MAAI,cAAc5C,MAAOP,MAAK+D,WAAWxD,MAAMwD,YAAY;AAC3D,MAAI,iBAAiBxD,MACnBP,MAAK6D,cAActD,MAAMsD,eAAe,OAAO,OAAO,IAAIC,KAAKvD,MAAMsD,WAAW;AAClF,MAAI,sBAAsBtD,MAAOP,MAAKwH,mBAAmBjH,MAAMiH,oBAAoB;AACnF,MAAI,UAAUjH,MAAOP,MAAKyE,OAAO4B,WAAW9F,MAAMkE,IAAI;AACtD,MAAI,sBAAsBlE,MAAOP,MAAKI,mBAAmBiG,WAAW9F,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAKyH,WAAWlH,MAAMkH,YAAY;AAC3D,MAAIlH,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMmH,aAAa,KAAM1H,MAAK0H,YAAYnH,MAAMmH;AACpD,SAAO1H;AACT;AAxBSU;AA0BT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd+C,iBAAiBjG,IAAIiG;IACrB3E,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrBjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYqB;IAC1BvB,aAAa1C,IAAI0C,eAAe,OAAOuB,SAAYjE,IAAI0C,YAAY8D,QAAO;IAC1EH,kBAAkBrG,IAAIqG,oBAAoBpC;IAC1CX,MAAOtD,IAAIsD,QAA4BW;IACvChF,kBACGe,IAAIf,oBAAyEgF;IAChFqC,UAAUtG,IAAIsG,YAAYrC;IAC1BrC,WAAW5B,IAAI4B;IACf2E,WAAWvG,IAAIuG;EACjB;AACF;AApBSrG;AAsBT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRwD,MAAM5C,GAAG4C;IACT0C,MAAMtF,GAAGsF;IACTC,QAAQvF,GAAGuF;IACXpF,QAAQH,GAAGG;IACX4E,OAAOhB,WAAW/D,GAAG+E,KAAK;IAC1BC,QAAQjB,WAAW/D,GAAGgF,MAAM;IAC5BC,OAAOlB,WAAW/D,GAAGiF,KAAK;IAC1BO,QAAQzB,WAAW/D,GAAGwF,MAAM;IAC5BC,UAAUzF,GAAGyF;IACbC,aAAa1F,GAAG0F,eAAe;IAC/BpC,eAAetD,GAAGsD,iBAAiB;IACnCzC,QAAQ4D,UAAUzE,GAAGa,MAAM;IAC3B8E,YAAY3F,GAAG2F;IACfC,WAAW5F,GAAG4F;IACdC,YAAY7F,GAAG6F;EACjB;AACF;AApBSpG;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTwD,MAAM/D,IAAI+D;IACV0C,MAAMzG,IAAIyG;IACVC,QAAQ1G,IAAI0G;IACZpF,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrB0C,QAAS3G,IAAI2G,UAAU1C;IACvB2C,UAAU5G,IAAI4G;IACdC,aAAa7G,IAAI6G,eAAe5C;IAChCQ,eAAezE,IAAIyE,iBAAiBR;IACpCjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7B8E,YAAY9G,IAAI8G,cAAc9G,IAAI+G;IAClCA,WAAW/G,IAAI+G;IACfC,YAAYhH,IAAIgH;EAClB;AACF;AApBSvG;","names":["PrismaStateStore","db","createRun","run","durableWorkflowRun","create","data","toRunData","reindexAttributes","id","searchAttributes","updateRun","runId","patch","update","where","toRunPatch","attributes","durableRunAttribute","deleteMany","rows","normalizeAttributeRows","length","createMany","getRun","row","findUnique","fromRunRow","deleteRun","durableStepCheckpoint","durableSignalWaiter","getCheckpoint","seq","runId_seq","fromCheckpointRow","saveCheckpoint","checkpoint","toCheckpointData","upsert","transaction","work","$transaction","tx","raw","cp","listIncompleteRuns","findMany","status","in","map","listPendingRuns","limit","orderBy","createdAt","take","listDueTimers","nowMs","wakeAt","not","lte","BigInt","tryLockRun","owner","leaseUntilMs","result","updateMany","OR","lockedUntil","Date","lockedBy","count","releaseRunLock","renewRunLock","listRuns","query","workflow","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","skip","offset","listCheckpoints","getLatestCheckpointByName","name","findFirst","undefined","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","r","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","Number","v","workflowVersion","input","output","error","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt"]}
|
|
1
|
+
{"version":3,"sources":["../src/index.ts","../src/prisma-state-store.ts","../src/schema.ts"],"sourcesContent":["export * from './prisma-state-store';\nexport * from './schema';\n","import {\n type AttributeFilter,\n type RunQuery,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type WorkflowRun,\n attributeColumnFor,\n attributeOperand,\n normalizeAttributeRows,\n} from '@dudousxd/nestjs-durable-core';\n\n/* The Prisma client is generated per-schema, so the adapter can't import a concrete one. Instead\n it depends on this structural surface — the three model delegates and the methods it uses. A\n real `PrismaClient` (with the models from prisma/schema.prisma added) satisfies it. Query-arg\n shapes are Prisma's own generics, so they're left as `any` at this single boundary; the row\n return types are precise, which is what the mapping code below relies on. */\n\ninterface RunRow {\n id: string;\n workflow: string;\n workflowVersion: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n wakeAt: bigint | null;\n lockedBy: string | null;\n lockedUntil: Date | null;\n awaitingDecisionTaskId: string | null;\n recoveryAttempts: number | null;\n tags: unknown;\n searchAttributes: unknown;\n priority: number | null;\n createdAt: Date;\n updatedAt: Date;\n}\n\ninterface CheckpointRow {\n runId: string;\n seq: number;\n name: string;\n kind: string;\n stepId: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n events: unknown;\n attempts: number;\n workerGroup: string | null;\n parallelGroup: string | null;\n wakeAt: bigint | null;\n enqueuedAt: Date | null;\n startedAt: Date;\n finishedAt: Date;\n}\n\ninterface WaiterRow {\n token: string;\n runId: string;\n seq: number;\n parallelGroup: string | null;\n}\n\ninterface RunAttributeRow {\n runId: string;\n key: string;\n strValue: string | null;\n numValue: number | null;\n}\n\ninterface BufferedSignalRow {\n id: bigint;\n token: string;\n payload: unknown;\n}\n\n// Prisma's per-model query args are generated generics; left as `any` at this single boundary.\ntype Args = any;\n\ninterface Delegate<Row> {\n create(args: Args): Promise<Row>;\n createMany(args: Args): Promise<{ count: number }>;\n findUnique(args: Args): Promise<Row | null>;\n findFirst(args?: Args): Promise<Row | null>;\n findMany(args?: Args): Promise<Row[]>;\n update(args: Args): Promise<Row>;\n updateMany(args: Args): Promise<{ count: number }>;\n upsert(args: Args): Promise<Row>;\n delete(args: Args): Promise<Row>;\n deleteMany(args?: Args): Promise<{ count: number }>;\n}\n\nexport interface DurablePrismaTx {\n durableWorkflowRun: Delegate<RunRow>;\n durableStepCheckpoint: Delegate<CheckpointRow>;\n durableRunAttribute: Delegate<RunAttributeRow>;\n durableSignalWaiter: Delegate<WaiterRow>;\n durableBufferedSignal: Delegate<BufferedSignalRow>;\n}\n\nexport interface DurablePrismaClient extends DurablePrismaTx {\n /** Prisma's interactive-transaction form: runs `fn` with a tx-scoped client and commits on resolve. */\n $transaction<T>(fn: (tx: DurablePrismaTx) => Promise<T>): Promise<T>;\n}\n\n/**\n * Prisma-backed `StateStore`. Pass your `PrismaClient` after adding the models from\n * `prisma/schema.prisma` to your schema. JSON columns carry the run/step payloads directly;\n * `wakeAt` is a `BigInt` (epoch ms).\n */\nexport class PrismaStateStore implements StateStore {\n constructor(private readonly db: DurablePrismaClient) {}\n\n async createRun(run: WorkflowRun): Promise<void> {\n await this.db.durableWorkflowRun.create({ data: toRunData(run) });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, patch: Partial<WorkflowRun>): Promise<void> {\n await this.db.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n // Keep the side-table in step with the run's attributes whenever they're patched.\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n }\n\n /** Rewrite a run's normalized attribute rows: delete the old set, insert the current one. Mirrors\n * the in-memory store's reindex so the side-table always reflects the run's live searchAttributes. */\n private async reindexAttributes(\n runId: string,\n attributes: WorkflowRun['searchAttributes'],\n ): Promise<void> {\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n const rows = normalizeAttributeRows(runId, attributes);\n if (rows.length) await this.db.durableRunAttribute.createMany({ data: rows });\n }\n\n async getRun(runId: string): Promise<WorkflowRun | null> {\n const row = await this.db.durableWorkflowRun.findUnique({ where: { id: runId } });\n return row ? fromRunRow(row) : null;\n }\n\n async deleteRun(runId: string): Promise<void> {\n // Child rows first, then the run — checkpoints, signal waiters, attribute rows.\n await this.db.durableStepCheckpoint.deleteMany({ where: { runId } });\n await this.db.durableSignalWaiter.deleteMany({ where: { runId } });\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n await this.db.durableWorkflowRun.deleteMany({ where: { id: runId } });\n }\n\n async getCheckpoint(runId: string, seq: number): Promise<StepCheckpoint | null> {\n const row = await this.db.durableStepCheckpoint.findUnique({\n where: { runId_seq: { runId, seq } },\n });\n return row ? fromCheckpointRow(row) : null;\n }\n\n async saveCheckpoint(checkpoint: StepCheckpoint): Promise<void> {\n const data = toCheckpointData(checkpoint);\n await this.db.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: checkpoint.runId, seq: checkpoint.seq } },\n create: data,\n update: data,\n });\n }\n\n async transaction<T>(\n work: (tx: {\n raw: unknown;\n saveCheckpoint: (cp: StepCheckpoint) => Promise<void>;\n }) => Promise<T>,\n ): Promise<T> {\n return this.db.$transaction(async (tx) =>\n work({\n raw: tx,\n saveCheckpoint: async (cp) => {\n const data = toCheckpointData(cp);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: cp.runId, seq: cp.seq } },\n create: data,\n update: data,\n });\n },\n }),\n );\n }\n\n async listIncompleteRuns(): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: { in: ['running', 'cancelling'] } },\n });\n return rows.map(fromRunRow);\n }\n\n async listPendingRuns(limit: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'pending' },\n orderBy: { createdAt: 'asc' }, // FIFO dispatch\n take: limit,\n });\n return rows.map(fromRunRow);\n }\n\n async listDueTimers(nowMs: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'suspended', wakeAt: { not: null, lte: BigInt(nowMs) } },\n });\n return rows.map(fromRunRow);\n }\n\n async tryLockRun(\n runId: string,\n owner: string,\n leaseUntilMs: number,\n nowMs: number,\n ): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: {\n id: runId,\n OR: [{ lockedUntil: null }, { lockedUntil: { lte: new Date(nowMs) } }],\n },\n data: { lockedBy: owner, lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async releaseRunLock(runId: string): Promise<void> {\n // Idempotent by design: releasing the lease on a run that no longer exists is a no-op, not an\n // error. The engine calls this best-effort in a `finally` AFTER the run has settled, so it can\n // race a concurrent purge/teardown — Prisma's `update({ where: { id } })` would throw P2025\n // (\"No record was found for an update\") on that race and, since the call is fire-and-forget on\n // the engine's terminal path, surface as an unhandled rejection. `updateMany` matches a 0-row\n // WHERE to an empty result (no throw), mirroring the in-memory store's `if (run)` guard and the\n // set-where semantics of every sibling adapter (TypeORM/MikroORM/Drizzle).\n await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: { lockedBy: null, lockedUntil: null },\n });\n }\n\n async renewRunLock(runId: string, owner: string, leaseUntilMs: number): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId, lockedBy: owner },\n data: { lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\n const where: Record<string, unknown> = {};\n if (query.workflow) where.workflow = query.workflow;\n // `status IN (...)`; an empty set matches nothing (mirrors the in-memory store). Combined with the\n // single-value `status` via AND when both are present, so the narrower set wins.\n if (query.status && query.statuses) {\n where.AND = [{ status: query.status }, { status: { in: query.statuses } }];\n } else if (query.status) {\n where.status = query.status;\n } else if (query.statuses) {\n where.status = { in: query.statuses };\n }\n if (query.tag) where.tags = { array_contains: query.tag };\n // Typed/range attribute predicates push DOWN into SQL: each filter becomes a relation `some`\n // (EXISTS) on the normalized `durable_run_attributes` side-table, so the DB filters AND paginates\n // — no full scan + in-process filter. ANDed: a run must match every filter, so one `some` each.\n if (query.attributes?.length) {\n const existing = (where.AND as unknown[] | undefined) ?? [];\n where.AND = [...existing, ...query.attributes.map((f) => attributeSome(f))];\n }\n const orderBy = { createdAt: 'desc' as const }; // newest first — recent runs on top in the dashboard\n const rows = await this.db.durableWorkflowRun.findMany({\n where,\n take: query.limit,\n skip: query.offset,\n orderBy,\n });\n return rows.map(fromRunRow);\n }\n\n async listCheckpoints(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async getLatestCheckpointByName(\n runId: string,\n name: string,\n ): Promise<StepCheckpoint | undefined> {\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, name },\n orderBy: { seq: 'desc' },\n });\n return row ? fromCheckpointRow(row) : undefined;\n }\n\n async listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]> {\n if (prefixes.length === 0) return [];\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId, OR: prefixes.map((p) => ({ name: { startsWith: p } })) },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async putSignalWaiter(waiter: SignalWaiter): Promise<void> {\n await this.db.durableSignalWaiter.upsert({\n where: { token: waiter.token },\n create: {\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n update: {\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n });\n }\n\n async takeSignalWaiter(token: string): Promise<SignalWaiter | null> {\n const row = await this.db.durableSignalWaiter.findUnique({ where: { token } });\n if (!row) return null;\n await this.db.durableSignalWaiter.delete({ where: { token } });\n return {\n token: row.token,\n runId: row.runId,\n seq: row.seq,\n parallelGroup: row.parallelGroup ?? undefined,\n };\n }\n\n async listSignalWaiters(prefix: string): Promise<SignalWaiter[]> {\n const rows = await this.db.durableSignalWaiter.findMany({\n where: { token: { startsWith: prefix } },\n });\n return rows.map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async bufferSignal(token: string, payload: unknown): Promise<void> {\n await this.db.durableBufferedSignal.create({ data: { token, payload: jsonOrNull(payload) } });\n }\n\n async takeBufferedSignal(token: string): Promise<{ payload: unknown } | null> {\n const row = await this.db.durableBufferedSignal.findFirst({\n where: { token },\n orderBy: { id: 'asc' },\n });\n if (!row) return null;\n await this.db.durableBufferedSignal.delete({ where: { id: row.id } });\n return { payload: row.payload ?? undefined };\n }\n}\n\n/**\n * One attribute predicate as a Prisma relation `some` filter on the side-table — compiles to an\n * EXISTS, so the predicate runs in SQL. `<>` (ne) maps to `{ not }`, which under `some` also excludes\n * runs where the attribute is absent (the missing-key-never-matches contract): `some` already\n * requires a matching row to exist. Numeric operands compare `numValue`, everything else `strValue`.\n */\nfunction attributeSome(f: AttributeFilter): { attributes: { some: Record<string, unknown> } } {\n const col = attributeColumnFor(f); // 'numValue' | 'strValue'\n const operand = attributeOperand(f);\n const condition =\n f.op === 'eq' ? operand : f.op === 'ne' ? { not: operand } : { [f.op]: operand }; // gt/gte/lt/lte map 1:1 to Prisma operators\n return { attributes: { some: { key: f.key, [col]: condition } } };\n}\n\nconst bigOrNull = (n: number | undefined) => (n == null ? null : BigInt(n));\nconst numOrUndef = (n: bigint | null) => (n == null ? undefined : Number(n));\nconst jsonOrNull = (v: unknown) => v ?? null;\n\nfunction toRunData(run: WorkflowRun) {\n return {\n id: run.id,\n workflow: run.workflow,\n workflowVersion: run.workflowVersion,\n status: run.status,\n input: jsonOrNull(run.input),\n output: jsonOrNull(run.output),\n error: jsonOrNull(run.error),\n wakeAt: bigOrNull(run.wakeAt),\n lockedBy: run.lockedBy ?? null,\n lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),\n awaitingDecisionTaskId: run.awaitingDecisionTaskId ?? null,\n recoveryAttempts: run.recoveryAttempts ?? null,\n tags: jsonOrNull(run.tags),\n searchAttributes: jsonOrNull(run.searchAttributes),\n priority: run.priority ?? null,\n createdAt: run.createdAt,\n updatedAt: run.updatedAt,\n };\n}\n\nfunction toRunPatch(patch: Partial<WorkflowRun>) {\n // Map EVERY patchable field, using presence (`'x' in patch`) semantics for the nullable ones so a\n // patch can CLEAR a column (e.g. `{ error: undefined }` on completion sets it to NULL — matching\n // the TypeORM / MikroORM / in-memory stores). The two non-null Date fields use a defined-guard\n // since they are never cleared. Previously only 7 fields were mapped, so `updateRun({ tags })` /\n // `{ lockedBy }` / clearing `error` silently no-opped on this adapter.\n const data: Record<string, unknown> = {};\n if ('workflow' in patch) data.workflow = patch.workflow;\n if ('workflowVersion' in patch) data.workflowVersion = patch.workflowVersion;\n if ('status' in patch) data.status = patch.status;\n if ('input' in patch) data.input = jsonOrNull(patch.input);\n if ('output' in patch) data.output = jsonOrNull(patch.output);\n if ('error' in patch) data.error = jsonOrNull(patch.error);\n if ('wakeAt' in patch) data.wakeAt = bigOrNull(patch.wakeAt);\n if ('lockedBy' in patch) data.lockedBy = patch.lockedBy ?? null;\n if ('lockedUntil' in patch)\n data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);\n if ('awaitingDecisionTaskId' in patch)\n data.awaitingDecisionTaskId = patch.awaitingDecisionTaskId ?? null;\n if ('recoveryAttempts' in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if ('searchAttributes' in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);\n if ('priority' in patch) data.priority = patch.priority ?? null;\n if (patch.createdAt != null) data.createdAt = patch.createdAt;\n if (patch.updatedAt != null) data.updatedAt = patch.updatedAt;\n return data;\n}\n\nfunction fromRunRow(row: RunRow): WorkflowRun {\n return {\n id: row.id,\n workflow: row.workflow,\n workflowVersion: row.workflowVersion,\n status: row.status as WorkflowRun['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n wakeAt: numOrUndef(row.wakeAt),\n lockedBy: row.lockedBy ?? undefined,\n lockedUntil: row.lockedUntil == null ? undefined : row.lockedUntil.getTime(),\n awaitingDecisionTaskId: row.awaitingDecisionTaskId ?? undefined,\n recoveryAttempts: row.recoveryAttempts ?? undefined,\n tags: (row.tags as string[] | null) ?? undefined,\n searchAttributes:\n (row.searchAttributes as Record<string, string | number | boolean> | null) ?? undefined,\n priority: row.priority ?? undefined,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\n };\n}\n\nfunction toCheckpointData(cp: StepCheckpoint) {\n return {\n runId: cp.runId,\n seq: cp.seq,\n name: cp.name,\n kind: cp.kind,\n stepId: cp.stepId,\n status: cp.status,\n input: jsonOrNull(cp.input),\n output: jsonOrNull(cp.output),\n error: jsonOrNull(cp.error),\n events: jsonOrNull(cp.events),\n attempts: cp.attempts,\n workerGroup: cp.workerGroup ?? null,\n parallelGroup: cp.parallelGroup ?? null,\n wakeAt: bigOrNull(cp.wakeAt),\n enqueuedAt: cp.enqueuedAt,\n startedAt: cp.startedAt,\n finishedAt: cp.finishedAt,\n };\n}\n\nfunction fromCheckpointRow(row: CheckpointRow): StepCheckpoint {\n return {\n runId: row.runId,\n seq: row.seq,\n name: row.name,\n kind: row.kind as StepCheckpoint['kind'],\n stepId: row.stepId,\n status: row.status as StepCheckpoint['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n events: (row.events ?? undefined) as StepEvent[] | undefined,\n attempts: row.attempts,\n workerGroup: row.workerGroup ?? undefined,\n parallelGroup: row.parallelGroup ?? undefined,\n wakeAt: numOrUndef(row.wakeAt),\n enqueuedAt: row.enqueuedAt ?? row.startedAt,\n startedAt: row.startedAt,\n finishedAt: row.finishedAt,\n };\n}\n","/**\n * Tables this store's durable models own, physically. UNLIKE the other store adapters, this store\n * doesn't create or manage them at boot: the models in `prisma/schema.prisma` are meant to be copied\n * into YOUR OWN `schema.prisma` (see that file's header comment), and Prisma Migrate diffs whatever\n * models live in your schema — so a consumer who copied the models in already has them accounted for\n * and never needs a denylist for Prisma Migrate itself.\n *\n * This is exported anyway for the same reason the other adapters export it: any OTHER tooling that\n * introspects the database outside of `prisma migrate diff` (a raw schema dump, a second ORM/CLI\n * pointed at the same database, a linter that flags \"table not in any model\") needs the same fixed\n * list of table names this store's models declare via `@@map(...)`.\n *\n * ```ts\n * const skipTables = new Set(durableManagedTables());\n * ```\n *\n * Kept in sync with the `@@map(...)` table names in `prisma/schema.prisma` by `schema.spec.ts`,\n * which parses that file and asserts the two lists match — there is no single TypeScript source to\n * derive from (the schema is a `.prisma` text file copied into the consumer's own schema, not\n * imported at runtime), so the list here is intentionally a literal mirror.\n */\nexport function durableManagedTables(): string[] {\n return [\n 'durable_workflow_runs',\n 'durable_step_checkpoints',\n 'durable_run_attributes',\n 'durable_signal_waiters',\n 'durable_buffered_signals',\n ];\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACAA,iCAYO;AAsGA,IAAMA,mBAAN,MAAMA;EAlHb,OAkHaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,UAAUC,KAAiC;AAC/C,UAAM,KAAKF,GAAGG,mBAAmBC,OAAO;MAAEC,MAAMC,UAAUJ,GAAAA;IAAK,CAAA;AAC/D,UAAM,KAAKK,kBAAkBL,IAAIM,IAAIN,IAAIO,gBAAgB;EAC3D;EAEA,MAAMC,UAAUC,OAAeC,OAA4C;AACzE,UAAM,KAAKZ,GAAGG,mBAAmBU,OAAO;MAAEC,OAAO;QAAEN,IAAIG;MAAM;MAAGN,MAAMU,WAAWH,KAAAA;IAAO,CAAA;AAExF,QAAI,sBAAsBA,MAAO,OAAM,KAAKL,kBAAkBI,OAAOC,MAAMH,gBAAgB;EAC7F;;;EAIA,MAAcF,kBACZI,OACAK,YACe;AACf,UAAM,KAAKhB,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAMQ,WAAOC,mDAAuBT,OAAOK,UAAAA;AAC3C,QAAIG,KAAKE,OAAQ,OAAM,KAAKrB,GAAGiB,oBAAoBK,WAAW;MAAEjB,MAAMc;IAAK,CAAA;EAC7E;EAEA,MAAMI,OAAOZ,OAA4C;AACvD,UAAMa,MAAM,MAAM,KAAKxB,GAAGG,mBAAmBsB,WAAW;MAAEX,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;AAC/E,WAAOa,MAAME,WAAWF,GAAAA,IAAO;EACjC;EAEA,MAAMG,UAAUhB,OAA8B;AAE5C,UAAM,KAAKX,GAAG4B,sBAAsBV,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKX,GAAG6B,oBAAoBX,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGG,mBAAmBe,WAAW;MAAEJ,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMmB,cAAcnB,OAAeoB,KAA6C;AAC9E,UAAMP,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBH,WAAW;MACzDX,OAAO;QAAEkB,WAAW;UAAErB;UAAOoB;QAAI;MAAE;IACrC,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO;EACxC;EAEA,MAAMU,eAAeC,YAA2C;AAC9D,UAAM9B,OAAO+B,iBAAiBD,UAAAA;AAC9B,UAAM,KAAKnC,GAAG4B,sBAAsBS,OAAO;MACzCvB,OAAO;QAAEkB,WAAW;UAAErB,OAAOwB,WAAWxB;UAAOoB,KAAKI,WAAWJ;QAAI;MAAE;MACrE3B,QAAQC;MACRQ,QAAQR;IACV,CAAA;EACF;EAEA,MAAMiC,YACJC,MAIY;AACZ,WAAO,KAAKvC,GAAGwC,aAAa,OAAOC,OACjCF,KAAK;MACHG,KAAKD;MACLP,gBAAgB,8BAAOS,OAAAA;AACrB,cAAMtC,OAAO+B,iBAAiBO,EAAAA;AAC9B,cAAMF,GAAGb,sBAAsBS,OAAO;UACpCvB,OAAO;YAAEkB,WAAW;cAAErB,OAAOgC,GAAGhC;cAAOoB,KAAKY,GAAGZ;YAAI;UAAE;UACrD3B,QAAQC;UACRQ,QAAQR;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAMuC,qBAA6C;AACjD,UAAMzB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;MAAE;IACrD,CAAA;AACA,WAAO5B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAuC;AAC3D,UAAM/B,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;MAAU;MAC3BK,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAuC;AACzD,UAAMpC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAaU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;MAAE;IAC1E,CAAA;AACA,WAAOpC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMkC,WACJjD,OACAkD,OACAC,cACAP,OACkB;AAClB,UAAMQ,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QACLN,IAAIG;QACJsD,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAER,KAAK,IAAIS,KAAKZ,KAAAA;YAAO;UAAE;;MACtE;MACAlD,MAAM;QAAE+D,UAAUP;QAAOK,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMC,eAAe3D,OAA8B;AAQjD,UAAM,KAAKX,GAAGG,mBAAmB6D,WAAW;MAC1ClD,OAAO;QAAEN,IAAIG;MAAM;MACnBN,MAAM;QAAE+D,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMK,aAAa5D,OAAekD,OAAeC,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QAAEN,IAAIG;QAAOyD,UAAUP;MAAM;MACpCxD,MAAM;QAAE6D,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMG,SAASC,OAAyC;AACtD,UAAM3D,QAAiC,CAAC;AACxC,QAAI2D,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAG3C,QAAID,MAAM3B,UAAU2B,MAAME,UAAU;AAClC7D,YAAM8D,MAAM;QAAC;UAAE9B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAME;UAAS;QAAE;;IAC1E,WAAWF,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAME,UAAU;AACzB7D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAME;MAAS;IACtC;AACA,QAAIF,MAAMI,IAAK/D,OAAMgE,OAAO;MAAEC,gBAAgBN,MAAMI;IAAI;AAIxD,QAAIJ,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM2D,WAAYlE,MAAM8D,OAAiC,CAAA;AACzD9D,YAAM8D,MAAM;WAAII;WAAaP,MAAMzD,WAAWgC,IAAI,CAACiC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,UAAM9B,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B;MACAuC,MAAMoB,MAAMvB;MACZiC,MAAMV,MAAMW;MACZjC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM2D,gBAAgB1E,OAA0C;AAC9D,UAAMQ,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;MAAM;MACfwC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqD,0BACJ3E,OACA4E,MACqC;AACrC,UAAM/D,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsB4D,UAAU;MACxD1E,OAAO;QAAEH;QAAO4E;MAAK;MACrBpC,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAOiE;EACxC;EAEA,MAAMC,4BAA4B/E,OAAegF,UAA+C;AAC9F,QAAIA,SAAStE,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAI0B,SAAS3C,IAAI,CAAC4C,OAAO;UAAEL,MAAM;YAAEM,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEzC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAM6D,gBAAgBC,QAAqC;AACzD,UAAM,KAAK/F,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAEkF,OAAOD,OAAOC;MAAM;MAC7B5F,QAAQ;QACN4F,OAAOD,OAAOC;QACdrF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;MACApF,QAAQ;QACNF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMxE,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACxE,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBsE,OAAO;MAAErF,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOxE,IAAIwE;MACXrF,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACTkE,eAAezE,IAAIyE,iBAAiBR;IACtC;EACF;EAEA,MAAMW,kBAAkBC,QAAyC;AAC/D,UAAMlF,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAEkF,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAOlF,KAAK6B,IAAI,CAACsD,OAAO;MACtBN,OAAOM,EAAEN;MACTrF,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACPkE,eAAeK,EAAEL,iBAAiBR;IACpC,EAAA;EACF;EAEA,MAAMc,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKxG,GAAGyG,sBAAsBrG,OAAO;MAAEC,MAAM;QAAE2F;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMxE,MAAM,MAAM,KAAKxB,GAAGyG,sBAAsBjB,UAAU;MACxD1E,OAAO;QAAEkF;MAAM;MACf7C,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGyG,sBAAsBN,OAAO;MAAErF,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEgG,SAAShF,IAAIgF,WAAWf;IAAU;EAC7C;AACF;AAQA,SAASP,cAAcD,GAAkB;AACvC,QAAM2B,UAAMC,+CAAmB5B,CAAAA;AAC/B,QAAM6B,cAAUC,6CAAiB9B,CAAAA;AACjC,QAAM+B,YACJ/B,EAAEgC,OAAO,OAAOH,UAAU7B,EAAEgC,OAAO,OAAO;IAAExD,KAAKqD;EAAQ,IAAI;IAAE,CAAC7B,EAAEgC,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE9F,YAAY;MAAEkG,MAAM;QAAEC,KAAKlC,EAAEkC;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS9B;AAQT,IAAMkC,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAO1D,OAAO0D,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAO5B,SAAY8B,OAAOF,CAAAA,GAAtD;AACnB,IAAMX,aAAa,wBAACc,MAAeA,KAAK,MAArB;AAEnB,SAASlH,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd+C,iBAAiBvH,IAAIuH;IACrB3E,QAAQ5C,IAAI4C;IACZ4E,OAAOhB,WAAWxG,IAAIwH,KAAK;IAC3BC,QAAQjB,WAAWxG,IAAIyH,MAAM;IAC7BC,OAAOlB,WAAWxG,IAAI0H,KAAK;IAC3BpE,QAAQ4D,UAAUlH,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE2D,wBAAwB3H,IAAI2H,0BAA0B;IACtDC,kBAAkB5H,IAAI4H,oBAAoB;IAC1ChD,MAAM4B,WAAWxG,IAAI4E,IAAI;IACzBrE,kBAAkBiG,WAAWxG,IAAIO,gBAAgB;IACjDsH,UAAU7H,IAAI6H,YAAY;IAC1B3E,WAAWlD,IAAIkD;IACf4E,WAAW9H,IAAI8H;EACjB;AACF;AApBS1H;AAsBT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKoH,kBAAkB7G,MAAM6G;AAC7D,MAAI,YAAY7G,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKqH,QAAQhB,WAAW9F,MAAM8G,KAAK;AACzD,MAAI,YAAY9G,MAAOP,MAAKsH,SAASjB,WAAW9F,MAAM+G,MAAM;AAC5D,MAAI,WAAW/G,MAAOP,MAAKuH,QAAQlB,WAAW9F,MAAMgH,KAAK;AACzD,MAAI,YAAYhH,MAAOP,MAAKmD,SAAS4D,UAAUxG,MAAM4C,MAAM;AAC3D,MAAI,cAAc5C,MAAOP,MAAK+D,WAAWxD,MAAMwD,YAAY;AAC3D,MAAI,iBAAiBxD,MACnBP,MAAK6D,cAActD,MAAMsD,eAAe,OAAO,OAAO,IAAIC,KAAKvD,MAAMsD,WAAW;AAClF,MAAI,4BAA4BtD,MAC9BP,MAAKwH,yBAAyBjH,MAAMiH,0BAA0B;AAChE,MAAI,sBAAsBjH,MAAOP,MAAKyH,mBAAmBlH,MAAMkH,oBAAoB;AACnF,MAAI,UAAUlH,MAAOP,MAAKyE,OAAO4B,WAAW9F,MAAMkE,IAAI;AACtD,MAAI,sBAAsBlE,MAAOP,MAAKI,mBAAmBiG,WAAW9F,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAK0H,WAAWnH,MAAMmH,YAAY;AAC3D,MAAInH,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMoH,aAAa,KAAM3H,MAAK2H,YAAYpH,MAAMoH;AACpD,SAAO3H;AACT;AA1BSU;AA4BT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd+C,iBAAiBjG,IAAIiG;IACrB3E,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrBjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYqB;IAC1BvB,aAAa1C,IAAI0C,eAAe,OAAOuB,SAAYjE,IAAI0C,YAAY+D,QAAO;IAC1EJ,wBAAwBrG,IAAIqG,0BAA0BpC;IACtDqC,kBAAkBtG,IAAIsG,oBAAoBrC;IAC1CX,MAAOtD,IAAIsD,QAA4BW;IACvChF,kBACGe,IAAIf,oBAAyEgF;IAChFsC,UAAUvG,IAAIuG,YAAYtC;IAC1BrC,WAAW5B,IAAI4B;IACf4E,WAAWxG,IAAIwG;EACjB;AACF;AArBStG;AAuBT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRwD,MAAM5C,GAAG4C;IACT2C,MAAMvF,GAAGuF;IACTC,QAAQxF,GAAGwF;IACXrF,QAAQH,GAAGG;IACX4E,OAAOhB,WAAW/D,GAAG+E,KAAK;IAC1BC,QAAQjB,WAAW/D,GAAGgF,MAAM;IAC5BC,OAAOlB,WAAW/D,GAAGiF,KAAK;IAC1BQ,QAAQ1B,WAAW/D,GAAGyF,MAAM;IAC5BC,UAAU1F,GAAG0F;IACbC,aAAa3F,GAAG2F,eAAe;IAC/BrC,eAAetD,GAAGsD,iBAAiB;IACnCzC,QAAQ4D,UAAUzE,GAAGa,MAAM;IAC3B+E,YAAY5F,GAAG4F;IACfC,WAAW7F,GAAG6F;IACdC,YAAY9F,GAAG8F;EACjB;AACF;AApBSrG;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTwD,MAAM/D,IAAI+D;IACV2C,MAAM1G,IAAI0G;IACVC,QAAQ3G,IAAI2G;IACZrF,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrB2C,QAAS5G,IAAI4G,UAAU3C;IACvB4C,UAAU7G,IAAI6G;IACdC,aAAa9G,IAAI8G,eAAe7C;IAChCQ,eAAezE,IAAIyE,iBAAiBR;IACpCjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7B+E,YAAY/G,IAAI+G,cAAc/G,IAAIgH;IAClCA,WAAWhH,IAAIgH;IACfC,YAAYjH,IAAIiH;EAClB;AACF;AApBSxG;;;ACxcF,SAASyG,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;;AAEJ;AARgBA;","names":["PrismaStateStore","db","createRun","run","durableWorkflowRun","create","data","toRunData","reindexAttributes","id","searchAttributes","updateRun","runId","patch","update","where","toRunPatch","attributes","durableRunAttribute","deleteMany","rows","normalizeAttributeRows","length","createMany","getRun","row","findUnique","fromRunRow","deleteRun","durableStepCheckpoint","durableSignalWaiter","getCheckpoint","seq","runId_seq","fromCheckpointRow","saveCheckpoint","checkpoint","toCheckpointData","upsert","transaction","work","$transaction","tx","raw","cp","listIncompleteRuns","findMany","status","in","map","listPendingRuns","limit","orderBy","createdAt","take","listDueTimers","nowMs","wakeAt","not","lte","BigInt","tryLockRun","owner","leaseUntilMs","result","updateMany","OR","lockedUntil","Date","lockedBy","count","releaseRunLock","renewRunLock","listRuns","query","workflow","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","skip","offset","listCheckpoints","getLatestCheckpointByName","name","findFirst","undefined","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","r","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","Number","v","workflowVersion","input","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}
|
package/dist/index.d.cts
CHANGED
|
@@ -11,6 +11,7 @@ interface RunRow {
|
|
|
11
11
|
wakeAt: bigint | null;
|
|
12
12
|
lockedBy: string | null;
|
|
13
13
|
lockedUntil: Date | null;
|
|
14
|
+
awaitingDecisionTaskId: string | null;
|
|
14
15
|
recoveryAttempts: number | null;
|
|
15
16
|
tags: unknown;
|
|
16
17
|
searchAttributes: unknown;
|
|
@@ -124,4 +125,27 @@ declare class PrismaStateStore implements StateStore {
|
|
|
124
125
|
} | null>;
|
|
125
126
|
}
|
|
126
127
|
|
|
127
|
-
|
|
128
|
+
/**
|
|
129
|
+
* Tables this store's durable models own, physically. UNLIKE the other store adapters, this store
|
|
130
|
+
* doesn't create or manage them at boot: the models in `prisma/schema.prisma` are meant to be copied
|
|
131
|
+
* into YOUR OWN `schema.prisma` (see that file's header comment), and Prisma Migrate diffs whatever
|
|
132
|
+
* models live in your schema — so a consumer who copied the models in already has them accounted for
|
|
133
|
+
* and never needs a denylist for Prisma Migrate itself.
|
|
134
|
+
*
|
|
135
|
+
* This is exported anyway for the same reason the other adapters export it: any OTHER tooling that
|
|
136
|
+
* introspects the database outside of `prisma migrate diff` (a raw schema dump, a second ORM/CLI
|
|
137
|
+
* pointed at the same database, a linter that flags "table not in any model") needs the same fixed
|
|
138
|
+
* list of table names this store's models declare via `@@map(...)`.
|
|
139
|
+
*
|
|
140
|
+
* ```ts
|
|
141
|
+
* const skipTables = new Set(durableManagedTables());
|
|
142
|
+
* ```
|
|
143
|
+
*
|
|
144
|
+
* Kept in sync with the `@@map(...)` table names in `prisma/schema.prisma` by `schema.spec.ts`,
|
|
145
|
+
* which parses that file and asserts the two lists match — there is no single TypeScript source to
|
|
146
|
+
* derive from (the schema is a `.prisma` text file copied into the consumer's own schema, not
|
|
147
|
+
* imported at runtime), so the list here is intentionally a literal mirror.
|
|
148
|
+
*/
|
|
149
|
+
declare function durableManagedTables(): string[];
|
|
150
|
+
|
|
151
|
+
export { type DurablePrismaClient, type DurablePrismaTx, PrismaStateStore, durableManagedTables };
|
package/dist/index.d.ts
CHANGED
|
@@ -11,6 +11,7 @@ interface RunRow {
|
|
|
11
11
|
wakeAt: bigint | null;
|
|
12
12
|
lockedBy: string | null;
|
|
13
13
|
lockedUntil: Date | null;
|
|
14
|
+
awaitingDecisionTaskId: string | null;
|
|
14
15
|
recoveryAttempts: number | null;
|
|
15
16
|
tags: unknown;
|
|
16
17
|
searchAttributes: unknown;
|
|
@@ -124,4 +125,27 @@ declare class PrismaStateStore implements StateStore {
|
|
|
124
125
|
} | null>;
|
|
125
126
|
}
|
|
126
127
|
|
|
127
|
-
|
|
128
|
+
/**
|
|
129
|
+
* Tables this store's durable models own, physically. UNLIKE the other store adapters, this store
|
|
130
|
+
* doesn't create or manage them at boot: the models in `prisma/schema.prisma` are meant to be copied
|
|
131
|
+
* into YOUR OWN `schema.prisma` (see that file's header comment), and Prisma Migrate diffs whatever
|
|
132
|
+
* models live in your schema — so a consumer who copied the models in already has them accounted for
|
|
133
|
+
* and never needs a denylist for Prisma Migrate itself.
|
|
134
|
+
*
|
|
135
|
+
* This is exported anyway for the same reason the other adapters export it: any OTHER tooling that
|
|
136
|
+
* introspects the database outside of `prisma migrate diff` (a raw schema dump, a second ORM/CLI
|
|
137
|
+
* pointed at the same database, a linter that flags "table not in any model") needs the same fixed
|
|
138
|
+
* list of table names this store's models declare via `@@map(...)`.
|
|
139
|
+
*
|
|
140
|
+
* ```ts
|
|
141
|
+
* const skipTables = new Set(durableManagedTables());
|
|
142
|
+
* ```
|
|
143
|
+
*
|
|
144
|
+
* Kept in sync with the `@@map(...)` table names in `prisma/schema.prisma` by `schema.spec.ts`,
|
|
145
|
+
* which parses that file and asserts the two lists match — there is no single TypeScript source to
|
|
146
|
+
* derive from (the schema is a `.prisma` text file copied into the consumer's own schema, not
|
|
147
|
+
* imported at runtime), so the list here is intentionally a literal mirror.
|
|
148
|
+
*/
|
|
149
|
+
declare function durableManagedTables(): string[];
|
|
150
|
+
|
|
151
|
+
export { type DurablePrismaClient, type DurablePrismaTx, PrismaStateStore, durableManagedTables };
|
package/dist/index.js
CHANGED
|
@@ -388,6 +388,7 @@ function toRunData(run) {
|
|
|
388
388
|
wakeAt: bigOrNull(run.wakeAt),
|
|
389
389
|
lockedBy: run.lockedBy ?? null,
|
|
390
390
|
lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),
|
|
391
|
+
awaitingDecisionTaskId: run.awaitingDecisionTaskId ?? null,
|
|
391
392
|
recoveryAttempts: run.recoveryAttempts ?? null,
|
|
392
393
|
tags: jsonOrNull(run.tags),
|
|
393
394
|
searchAttributes: jsonOrNull(run.searchAttributes),
|
|
@@ -408,6 +409,7 @@ function toRunPatch(patch) {
|
|
|
408
409
|
if ("wakeAt" in patch) data.wakeAt = bigOrNull(patch.wakeAt);
|
|
409
410
|
if ("lockedBy" in patch) data.lockedBy = patch.lockedBy ?? null;
|
|
410
411
|
if ("lockedUntil" in patch) data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);
|
|
412
|
+
if ("awaitingDecisionTaskId" in patch) data.awaitingDecisionTaskId = patch.awaitingDecisionTaskId ?? null;
|
|
411
413
|
if ("recoveryAttempts" in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;
|
|
412
414
|
if ("tags" in patch) data.tags = jsonOrNull(patch.tags);
|
|
413
415
|
if ("searchAttributes" in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);
|
|
@@ -429,6 +431,7 @@ function fromRunRow(row) {
|
|
|
429
431
|
wakeAt: numOrUndef(row.wakeAt),
|
|
430
432
|
lockedBy: row.lockedBy ?? void 0,
|
|
431
433
|
lockedUntil: row.lockedUntil == null ? void 0 : row.lockedUntil.getTime(),
|
|
434
|
+
awaitingDecisionTaskId: row.awaitingDecisionTaskId ?? void 0,
|
|
432
435
|
recoveryAttempts: row.recoveryAttempts ?? void 0,
|
|
433
436
|
tags: row.tags ?? void 0,
|
|
434
437
|
searchAttributes: row.searchAttributes ?? void 0,
|
|
@@ -482,7 +485,20 @@ function fromCheckpointRow(row) {
|
|
|
482
485
|
};
|
|
483
486
|
}
|
|
484
487
|
__name(fromCheckpointRow, "fromCheckpointRow");
|
|
488
|
+
|
|
489
|
+
// src/schema.ts
|
|
490
|
+
function durableManagedTables() {
|
|
491
|
+
return [
|
|
492
|
+
"durable_workflow_runs",
|
|
493
|
+
"durable_step_checkpoints",
|
|
494
|
+
"durable_run_attributes",
|
|
495
|
+
"durable_signal_waiters",
|
|
496
|
+
"durable_buffered_signals"
|
|
497
|
+
];
|
|
498
|
+
}
|
|
499
|
+
__name(durableManagedTables, "durableManagedTables");
|
|
485
500
|
export {
|
|
486
|
-
PrismaStateStore
|
|
501
|
+
PrismaStateStore,
|
|
502
|
+
durableManagedTables
|
|
487
503
|
};
|
|
488
504
|
//# sourceMappingURL=index.js.map
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/prisma-state-store.ts"],"sourcesContent":["import {\n type AttributeFilter,\n type RunQuery,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type WorkflowRun,\n attributeColumnFor,\n attributeOperand,\n normalizeAttributeRows,\n} from '@dudousxd/nestjs-durable-core';\n\n/* The Prisma client is generated per-schema, so the adapter can't import a concrete one. Instead\n it depends on this structural surface — the three model delegates and the methods it uses. A\n real `PrismaClient` (with the models from prisma/schema.prisma added) satisfies it. Query-arg\n shapes are Prisma's own generics, so they're left as `any` at this single boundary; the row\n return types are precise, which is what the mapping code below relies on. */\n\ninterface RunRow {\n id: string;\n workflow: string;\n workflowVersion: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n wakeAt: bigint | null;\n lockedBy: string | null;\n lockedUntil: Date | null;\n recoveryAttempts: number | null;\n tags: unknown;\n searchAttributes: unknown;\n priority: number | null;\n createdAt: Date;\n updatedAt: Date;\n}\n\ninterface CheckpointRow {\n runId: string;\n seq: number;\n name: string;\n kind: string;\n stepId: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n events: unknown;\n attempts: number;\n workerGroup: string | null;\n parallelGroup: string | null;\n wakeAt: bigint | null;\n enqueuedAt: Date | null;\n startedAt: Date;\n finishedAt: Date;\n}\n\ninterface WaiterRow {\n token: string;\n runId: string;\n seq: number;\n parallelGroup: string | null;\n}\n\ninterface RunAttributeRow {\n runId: string;\n key: string;\n strValue: string | null;\n numValue: number | null;\n}\n\ninterface BufferedSignalRow {\n id: bigint;\n token: string;\n payload: unknown;\n}\n\n// Prisma's per-model query args are generated generics; left as `any` at this single boundary.\ntype Args = any;\n\ninterface Delegate<Row> {\n create(args: Args): Promise<Row>;\n createMany(args: Args): Promise<{ count: number }>;\n findUnique(args: Args): Promise<Row | null>;\n findFirst(args?: Args): Promise<Row | null>;\n findMany(args?: Args): Promise<Row[]>;\n update(args: Args): Promise<Row>;\n updateMany(args: Args): Promise<{ count: number }>;\n upsert(args: Args): Promise<Row>;\n delete(args: Args): Promise<Row>;\n deleteMany(args?: Args): Promise<{ count: number }>;\n}\n\nexport interface DurablePrismaTx {\n durableWorkflowRun: Delegate<RunRow>;\n durableStepCheckpoint: Delegate<CheckpointRow>;\n durableRunAttribute: Delegate<RunAttributeRow>;\n durableSignalWaiter: Delegate<WaiterRow>;\n durableBufferedSignal: Delegate<BufferedSignalRow>;\n}\n\nexport interface DurablePrismaClient extends DurablePrismaTx {\n /** Prisma's interactive-transaction form: runs `fn` with a tx-scoped client and commits on resolve. */\n $transaction<T>(fn: (tx: DurablePrismaTx) => Promise<T>): Promise<T>;\n}\n\n/**\n * Prisma-backed `StateStore`. Pass your `PrismaClient` after adding the models from\n * `prisma/schema.prisma` to your schema. JSON columns carry the run/step payloads directly;\n * `wakeAt` is a `BigInt` (epoch ms).\n */\nexport class PrismaStateStore implements StateStore {\n constructor(private readonly db: DurablePrismaClient) {}\n\n async createRun(run: WorkflowRun): Promise<void> {\n await this.db.durableWorkflowRun.create({ data: toRunData(run) });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, patch: Partial<WorkflowRun>): Promise<void> {\n await this.db.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n // Keep the side-table in step with the run's attributes whenever they're patched.\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n }\n\n /** Rewrite a run's normalized attribute rows: delete the old set, insert the current one. Mirrors\n * the in-memory store's reindex so the side-table always reflects the run's live searchAttributes. */\n private async reindexAttributes(\n runId: string,\n attributes: WorkflowRun['searchAttributes'],\n ): Promise<void> {\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n const rows = normalizeAttributeRows(runId, attributes);\n if (rows.length) await this.db.durableRunAttribute.createMany({ data: rows });\n }\n\n async getRun(runId: string): Promise<WorkflowRun | null> {\n const row = await this.db.durableWorkflowRun.findUnique({ where: { id: runId } });\n return row ? fromRunRow(row) : null;\n }\n\n async deleteRun(runId: string): Promise<void> {\n // Child rows first, then the run — checkpoints, signal waiters, attribute rows.\n await this.db.durableStepCheckpoint.deleteMany({ where: { runId } });\n await this.db.durableSignalWaiter.deleteMany({ where: { runId } });\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n await this.db.durableWorkflowRun.deleteMany({ where: { id: runId } });\n }\n\n async getCheckpoint(runId: string, seq: number): Promise<StepCheckpoint | null> {\n const row = await this.db.durableStepCheckpoint.findUnique({\n where: { runId_seq: { runId, seq } },\n });\n return row ? fromCheckpointRow(row) : null;\n }\n\n async saveCheckpoint(checkpoint: StepCheckpoint): Promise<void> {\n const data = toCheckpointData(checkpoint);\n await this.db.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: checkpoint.runId, seq: checkpoint.seq } },\n create: data,\n update: data,\n });\n }\n\n async transaction<T>(\n work: (tx: {\n raw: unknown;\n saveCheckpoint: (cp: StepCheckpoint) => Promise<void>;\n }) => Promise<T>,\n ): Promise<T> {\n return this.db.$transaction(async (tx) =>\n work({\n raw: tx,\n saveCheckpoint: async (cp) => {\n const data = toCheckpointData(cp);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: cp.runId, seq: cp.seq } },\n create: data,\n update: data,\n });\n },\n }),\n );\n }\n\n async listIncompleteRuns(): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: { in: ['running', 'cancelling'] } },\n });\n return rows.map(fromRunRow);\n }\n\n async listPendingRuns(limit: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'pending' },\n orderBy: { createdAt: 'asc' }, // FIFO dispatch\n take: limit,\n });\n return rows.map(fromRunRow);\n }\n\n async listDueTimers(nowMs: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'suspended', wakeAt: { not: null, lte: BigInt(nowMs) } },\n });\n return rows.map(fromRunRow);\n }\n\n async tryLockRun(\n runId: string,\n owner: string,\n leaseUntilMs: number,\n nowMs: number,\n ): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: {\n id: runId,\n OR: [{ lockedUntil: null }, { lockedUntil: { lte: new Date(nowMs) } }],\n },\n data: { lockedBy: owner, lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async releaseRunLock(runId: string): Promise<void> {\n // Idempotent by design: releasing the lease on a run that no longer exists is a no-op, not an\n // error. The engine calls this best-effort in a `finally` AFTER the run has settled, so it can\n // race a concurrent purge/teardown — Prisma's `update({ where: { id } })` would throw P2025\n // (\"No record was found for an update\") on that race and, since the call is fire-and-forget on\n // the engine's terminal path, surface as an unhandled rejection. `updateMany` matches a 0-row\n // WHERE to an empty result (no throw), mirroring the in-memory store's `if (run)` guard and the\n // set-where semantics of every sibling adapter (TypeORM/MikroORM/Drizzle).\n await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: { lockedBy: null, lockedUntil: null },\n });\n }\n\n async renewRunLock(runId: string, owner: string, leaseUntilMs: number): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId, lockedBy: owner },\n data: { lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\n const where: Record<string, unknown> = {};\n if (query.workflow) where.workflow = query.workflow;\n // `status IN (...)`; an empty set matches nothing (mirrors the in-memory store). Combined with the\n // single-value `status` via AND when both are present, so the narrower set wins.\n if (query.status && query.statuses) {\n where.AND = [{ status: query.status }, { status: { in: query.statuses } }];\n } else if (query.status) {\n where.status = query.status;\n } else if (query.statuses) {\n where.status = { in: query.statuses };\n }\n if (query.tag) where.tags = { array_contains: query.tag };\n // Typed/range attribute predicates push DOWN into SQL: each filter becomes a relation `some`\n // (EXISTS) on the normalized `durable_run_attributes` side-table, so the DB filters AND paginates\n // — no full scan + in-process filter. ANDed: a run must match every filter, so one `some` each.\n if (query.attributes?.length) {\n const existing = (where.AND as unknown[] | undefined) ?? [];\n where.AND = [...existing, ...query.attributes.map((f) => attributeSome(f))];\n }\n const orderBy = { createdAt: 'desc' as const }; // newest first — recent runs on top in the dashboard\n const rows = await this.db.durableWorkflowRun.findMany({\n where,\n take: query.limit,\n skip: query.offset,\n orderBy,\n });\n return rows.map(fromRunRow);\n }\n\n async listCheckpoints(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async getLatestCheckpointByName(\n runId: string,\n name: string,\n ): Promise<StepCheckpoint | undefined> {\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, name },\n orderBy: { seq: 'desc' },\n });\n return row ? fromCheckpointRow(row) : undefined;\n }\n\n async listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]> {\n if (prefixes.length === 0) return [];\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId, OR: prefixes.map((p) => ({ name: { startsWith: p } })) },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async putSignalWaiter(waiter: SignalWaiter): Promise<void> {\n await this.db.durableSignalWaiter.upsert({\n where: { token: waiter.token },\n create: {\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n update: {\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n });\n }\n\n async takeSignalWaiter(token: string): Promise<SignalWaiter | null> {\n const row = await this.db.durableSignalWaiter.findUnique({ where: { token } });\n if (!row) return null;\n await this.db.durableSignalWaiter.delete({ where: { token } });\n return {\n token: row.token,\n runId: row.runId,\n seq: row.seq,\n parallelGroup: row.parallelGroup ?? undefined,\n };\n }\n\n async listSignalWaiters(prefix: string): Promise<SignalWaiter[]> {\n const rows = await this.db.durableSignalWaiter.findMany({\n where: { token: { startsWith: prefix } },\n });\n return rows.map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async bufferSignal(token: string, payload: unknown): Promise<void> {\n await this.db.durableBufferedSignal.create({ data: { token, payload: jsonOrNull(payload) } });\n }\n\n async takeBufferedSignal(token: string): Promise<{ payload: unknown } | null> {\n const row = await this.db.durableBufferedSignal.findFirst({\n where: { token },\n orderBy: { id: 'asc' },\n });\n if (!row) return null;\n await this.db.durableBufferedSignal.delete({ where: { id: row.id } });\n return { payload: row.payload ?? undefined };\n }\n}\n\n/**\n * One attribute predicate as a Prisma relation `some` filter on the side-table — compiles to an\n * EXISTS, so the predicate runs in SQL. `<>` (ne) maps to `{ not }`, which under `some` also excludes\n * runs where the attribute is absent (the missing-key-never-matches contract): `some` already\n * requires a matching row to exist. Numeric operands compare `numValue`, everything else `strValue`.\n */\nfunction attributeSome(f: AttributeFilter): { attributes: { some: Record<string, unknown> } } {\n const col = attributeColumnFor(f); // 'numValue' | 'strValue'\n const operand = attributeOperand(f);\n const condition =\n f.op === 'eq' ? operand : f.op === 'ne' ? { not: operand } : { [f.op]: operand }; // gt/gte/lt/lte map 1:1 to Prisma operators\n return { attributes: { some: { key: f.key, [col]: condition } } };\n}\n\nconst bigOrNull = (n: number | undefined) => (n == null ? null : BigInt(n));\nconst numOrUndef = (n: bigint | null) => (n == null ? undefined : Number(n));\nconst jsonOrNull = (v: unknown) => v ?? null;\n\nfunction toRunData(run: WorkflowRun) {\n return {\n id: run.id,\n workflow: run.workflow,\n workflowVersion: run.workflowVersion,\n status: run.status,\n input: jsonOrNull(run.input),\n output: jsonOrNull(run.output),\n error: jsonOrNull(run.error),\n wakeAt: bigOrNull(run.wakeAt),\n lockedBy: run.lockedBy ?? null,\n lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),\n recoveryAttempts: run.recoveryAttempts ?? null,\n tags: jsonOrNull(run.tags),\n searchAttributes: jsonOrNull(run.searchAttributes),\n priority: run.priority ?? null,\n createdAt: run.createdAt,\n updatedAt: run.updatedAt,\n };\n}\n\nfunction toRunPatch(patch: Partial<WorkflowRun>) {\n // Map EVERY patchable field, using presence (`'x' in patch`) semantics for the nullable ones so a\n // patch can CLEAR a column (e.g. `{ error: undefined }` on completion sets it to NULL — matching\n // the TypeORM / MikroORM / in-memory stores). The two non-null Date fields use a defined-guard\n // since they are never cleared. Previously only 7 fields were mapped, so `updateRun({ tags })` /\n // `{ lockedBy }` / clearing `error` silently no-opped on this adapter.\n const data: Record<string, unknown> = {};\n if ('workflow' in patch) data.workflow = patch.workflow;\n if ('workflowVersion' in patch) data.workflowVersion = patch.workflowVersion;\n if ('status' in patch) data.status = patch.status;\n if ('input' in patch) data.input = jsonOrNull(patch.input);\n if ('output' in patch) data.output = jsonOrNull(patch.output);\n if ('error' in patch) data.error = jsonOrNull(patch.error);\n if ('wakeAt' in patch) data.wakeAt = bigOrNull(patch.wakeAt);\n if ('lockedBy' in patch) data.lockedBy = patch.lockedBy ?? null;\n if ('lockedUntil' in patch)\n data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);\n if ('recoveryAttempts' in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if ('searchAttributes' in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);\n if ('priority' in patch) data.priority = patch.priority ?? null;\n if (patch.createdAt != null) data.createdAt = patch.createdAt;\n if (patch.updatedAt != null) data.updatedAt = patch.updatedAt;\n return data;\n}\n\nfunction fromRunRow(row: RunRow): WorkflowRun {\n return {\n id: row.id,\n workflow: row.workflow,\n workflowVersion: row.workflowVersion,\n status: row.status as WorkflowRun['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n wakeAt: numOrUndef(row.wakeAt),\n lockedBy: row.lockedBy ?? undefined,\n lockedUntil: row.lockedUntil == null ? undefined : row.lockedUntil.getTime(),\n recoveryAttempts: row.recoveryAttempts ?? undefined,\n tags: (row.tags as string[] | null) ?? undefined,\n searchAttributes:\n (row.searchAttributes as Record<string, string | number | boolean> | null) ?? undefined,\n priority: row.priority ?? undefined,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\n };\n}\n\nfunction toCheckpointData(cp: StepCheckpoint) {\n return {\n runId: cp.runId,\n seq: cp.seq,\n name: cp.name,\n kind: cp.kind,\n stepId: cp.stepId,\n status: cp.status,\n input: jsonOrNull(cp.input),\n output: jsonOrNull(cp.output),\n error: jsonOrNull(cp.error),\n events: jsonOrNull(cp.events),\n attempts: cp.attempts,\n workerGroup: cp.workerGroup ?? null,\n parallelGroup: cp.parallelGroup ?? null,\n wakeAt: bigOrNull(cp.wakeAt),\n enqueuedAt: cp.enqueuedAt,\n startedAt: cp.startedAt,\n finishedAt: cp.finishedAt,\n };\n}\n\nfunction fromCheckpointRow(row: CheckpointRow): StepCheckpoint {\n return {\n runId: row.runId,\n seq: row.seq,\n name: row.name,\n kind: row.kind as StepCheckpoint['kind'],\n stepId: row.stepId,\n status: row.status as StepCheckpoint['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n events: (row.events ?? undefined) as StepEvent[] | undefined,\n attempts: row.attempts,\n workerGroup: row.workerGroup ?? undefined,\n parallelGroup: row.parallelGroup ?? undefined,\n wakeAt: numOrUndef(row.wakeAt),\n enqueuedAt: row.enqueuedAt ?? row.startedAt,\n startedAt: row.startedAt,\n finishedAt: row.finishedAt,\n };\n}\n"],"mappings":";;;;AAAA,SASEA,oBACAC,kBACAC,8BACK;AAqGA,IAAMC,mBAAN,MAAMA;EAjHb,OAiHaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,UAAUC,KAAiC;AAC/C,UAAM,KAAKF,GAAGG,mBAAmBC,OAAO;MAAEC,MAAMC,UAAUJ,GAAAA;IAAK,CAAA;AAC/D,UAAM,KAAKK,kBAAkBL,IAAIM,IAAIN,IAAIO,gBAAgB;EAC3D;EAEA,MAAMC,UAAUC,OAAeC,OAA4C;AACzE,UAAM,KAAKZ,GAAGG,mBAAmBU,OAAO;MAAEC,OAAO;QAAEN,IAAIG;MAAM;MAAGN,MAAMU,WAAWH,KAAAA;IAAO,CAAA;AAExF,QAAI,sBAAsBA,MAAO,OAAM,KAAKL,kBAAkBI,OAAOC,MAAMH,gBAAgB;EAC7F;;;EAIA,MAAcF,kBACZI,OACAK,YACe;AACf,UAAM,KAAKhB,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAMQ,OAAOC,uBAAuBT,OAAOK,UAAAA;AAC3C,QAAIG,KAAKE,OAAQ,OAAM,KAAKrB,GAAGiB,oBAAoBK,WAAW;MAAEjB,MAAMc;IAAK,CAAA;EAC7E;EAEA,MAAMI,OAAOZ,OAA4C;AACvD,UAAMa,MAAM,MAAM,KAAKxB,GAAGG,mBAAmBsB,WAAW;MAAEX,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;AAC/E,WAAOa,MAAME,WAAWF,GAAAA,IAAO;EACjC;EAEA,MAAMG,UAAUhB,OAA8B;AAE5C,UAAM,KAAKX,GAAG4B,sBAAsBV,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKX,GAAG6B,oBAAoBX,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGG,mBAAmBe,WAAW;MAAEJ,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMmB,cAAcnB,OAAeoB,KAA6C;AAC9E,UAAMP,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBH,WAAW;MACzDX,OAAO;QAAEkB,WAAW;UAAErB;UAAOoB;QAAI;MAAE;IACrC,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO;EACxC;EAEA,MAAMU,eAAeC,YAA2C;AAC9D,UAAM9B,OAAO+B,iBAAiBD,UAAAA;AAC9B,UAAM,KAAKnC,GAAG4B,sBAAsBS,OAAO;MACzCvB,OAAO;QAAEkB,WAAW;UAAErB,OAAOwB,WAAWxB;UAAOoB,KAAKI,WAAWJ;QAAI;MAAE;MACrE3B,QAAQC;MACRQ,QAAQR;IACV,CAAA;EACF;EAEA,MAAMiC,YACJC,MAIY;AACZ,WAAO,KAAKvC,GAAGwC,aAAa,OAAOC,OACjCF,KAAK;MACHG,KAAKD;MACLP,gBAAgB,8BAAOS,OAAAA;AACrB,cAAMtC,OAAO+B,iBAAiBO,EAAAA;AAC9B,cAAMF,GAAGb,sBAAsBS,OAAO;UACpCvB,OAAO;YAAEkB,WAAW;cAAErB,OAAOgC,GAAGhC;cAAOoB,KAAKY,GAAGZ;YAAI;UAAE;UACrD3B,QAAQC;UACRQ,QAAQR;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAMuC,qBAA6C;AACjD,UAAMzB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;MAAE;IACrD,CAAA;AACA,WAAO5B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAuC;AAC3D,UAAM/B,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;MAAU;MAC3BK,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAuC;AACzD,UAAMpC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAaU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;MAAE;IAC1E,CAAA;AACA,WAAOpC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMkC,WACJjD,OACAkD,OACAC,cACAP,OACkB;AAClB,UAAMQ,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QACLN,IAAIG;QACJsD,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAER,KAAK,IAAIS,KAAKZ,KAAAA;YAAO;UAAE;;MACtE;MACAlD,MAAM;QAAE+D,UAAUP;QAAOK,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMC,eAAe3D,OAA8B;AAQjD,UAAM,KAAKX,GAAGG,mBAAmB6D,WAAW;MAC1ClD,OAAO;QAAEN,IAAIG;MAAM;MACnBN,MAAM;QAAE+D,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMK,aAAa5D,OAAekD,OAAeC,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QAAEN,IAAIG;QAAOyD,UAAUP;MAAM;MACpCxD,MAAM;QAAE6D,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMG,SAASC,OAAyC;AACtD,UAAM3D,QAAiC,CAAC;AACxC,QAAI2D,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAG3C,QAAID,MAAM3B,UAAU2B,MAAME,UAAU;AAClC7D,YAAM8D,MAAM;QAAC;UAAE9B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAME;UAAS;QAAE;;IAC1E,WAAWF,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAME,UAAU;AACzB7D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAME;MAAS;IACtC;AACA,QAAIF,MAAMI,IAAK/D,OAAMgE,OAAO;MAAEC,gBAAgBN,MAAMI;IAAI;AAIxD,QAAIJ,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM2D,WAAYlE,MAAM8D,OAAiC,CAAA;AACzD9D,YAAM8D,MAAM;WAAII;WAAaP,MAAMzD,WAAWgC,IAAI,CAACiC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,UAAM9B,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B;MACAuC,MAAMoB,MAAMvB;MACZiC,MAAMV,MAAMW;MACZjC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM2D,gBAAgB1E,OAA0C;AAC9D,UAAMQ,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;MAAM;MACfwC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqD,0BACJ3E,OACA4E,MACqC;AACrC,UAAM/D,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsB4D,UAAU;MACxD1E,OAAO;QAAEH;QAAO4E;MAAK;MACrBpC,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAOiE;EACxC;EAEA,MAAMC,4BAA4B/E,OAAegF,UAA+C;AAC9F,QAAIA,SAAStE,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAI0B,SAAS3C,IAAI,CAAC4C,OAAO;UAAEL,MAAM;YAAEM,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEzC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAM6D,gBAAgBC,QAAqC;AACzD,UAAM,KAAK/F,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAEkF,OAAOD,OAAOC;MAAM;MAC7B5F,QAAQ;QACN4F,OAAOD,OAAOC;QACdrF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;MACApF,QAAQ;QACNF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMxE,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACxE,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBsE,OAAO;MAAErF,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOxE,IAAIwE;MACXrF,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACTkE,eAAezE,IAAIyE,iBAAiBR;IACtC;EACF;EAEA,MAAMW,kBAAkBC,QAAyC;AAC/D,UAAMlF,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAEkF,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAOlF,KAAK6B,IAAI,CAACsD,OAAO;MACtBN,OAAOM,EAAEN;MACTrF,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACPkE,eAAeK,EAAEL,iBAAiBR;IACpC,EAAA;EACF;EAEA,MAAMc,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKxG,GAAGyG,sBAAsBrG,OAAO;MAAEC,MAAM;QAAE2F;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMxE,MAAM,MAAM,KAAKxB,GAAGyG,sBAAsBjB,UAAU;MACxD1E,OAAO;QAAEkF;MAAM;MACf7C,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGyG,sBAAsBN,OAAO;MAAErF,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEgG,SAAShF,IAAIgF,WAAWf;IAAU;EAC7C;AACF;AAQA,SAASP,cAAcD,GAAkB;AACvC,QAAM2B,MAAMC,mBAAmB5B,CAAAA;AAC/B,QAAM6B,UAAUC,iBAAiB9B,CAAAA;AACjC,QAAM+B,YACJ/B,EAAEgC,OAAO,OAAOH,UAAU7B,EAAEgC,OAAO,OAAO;IAAExD,KAAKqD;EAAQ,IAAI;IAAE,CAAC7B,EAAEgC,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE9F,YAAY;MAAEkG,MAAM;QAAEC,KAAKlC,EAAEkC;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS9B;AAQT,IAAMkC,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAO1D,OAAO0D,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAO5B,SAAY8B,OAAOF,CAAAA,GAAtD;AACnB,IAAMX,aAAa,wBAACc,MAAeA,KAAK,MAArB;AAEnB,SAASlH,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd+C,iBAAiBvH,IAAIuH;IACrB3E,QAAQ5C,IAAI4C;IACZ4E,OAAOhB,WAAWxG,IAAIwH,KAAK;IAC3BC,QAAQjB,WAAWxG,IAAIyH,MAAM;IAC7BC,OAAOlB,WAAWxG,IAAI0H,KAAK;IAC3BpE,QAAQ4D,UAAUlH,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE2D,kBAAkB3H,IAAI2H,oBAAoB;IAC1C/C,MAAM4B,WAAWxG,IAAI4E,IAAI;IACzBrE,kBAAkBiG,WAAWxG,IAAIO,gBAAgB;IACjDqH,UAAU5H,IAAI4H,YAAY;IAC1B1E,WAAWlD,IAAIkD;IACf2E,WAAW7H,IAAI6H;EACjB;AACF;AAnBSzH;AAqBT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKoH,kBAAkB7G,MAAM6G;AAC7D,MAAI,YAAY7G,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKqH,QAAQhB,WAAW9F,MAAM8G,KAAK;AACzD,MAAI,YAAY9G,MAAOP,MAAKsH,SAASjB,WAAW9F,MAAM+G,MAAM;AAC5D,MAAI,WAAW/G,MAAOP,MAAKuH,QAAQlB,WAAW9F,MAAMgH,KAAK;AACzD,MAAI,YAAYhH,MAAOP,MAAKmD,SAAS4D,UAAUxG,MAAM4C,MAAM;AAC3D,MAAI,cAAc5C,MAAOP,MAAK+D,WAAWxD,MAAMwD,YAAY;AAC3D,MAAI,iBAAiBxD,MACnBP,MAAK6D,cAActD,MAAMsD,eAAe,OAAO,OAAO,IAAIC,KAAKvD,MAAMsD,WAAW;AAClF,MAAI,sBAAsBtD,MAAOP,MAAKwH,mBAAmBjH,MAAMiH,oBAAoB;AACnF,MAAI,UAAUjH,MAAOP,MAAKyE,OAAO4B,WAAW9F,MAAMkE,IAAI;AACtD,MAAI,sBAAsBlE,MAAOP,MAAKI,mBAAmBiG,WAAW9F,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAKyH,WAAWlH,MAAMkH,YAAY;AAC3D,MAAIlH,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMmH,aAAa,KAAM1H,MAAK0H,YAAYnH,MAAMmH;AACpD,SAAO1H;AACT;AAxBSU;AA0BT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd+C,iBAAiBjG,IAAIiG;IACrB3E,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrBjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYqB;IAC1BvB,aAAa1C,IAAI0C,eAAe,OAAOuB,SAAYjE,IAAI0C,YAAY8D,QAAO;IAC1EH,kBAAkBrG,IAAIqG,oBAAoBpC;IAC1CX,MAAOtD,IAAIsD,QAA4BW;IACvChF,kBACGe,IAAIf,oBAAyEgF;IAChFqC,UAAUtG,IAAIsG,YAAYrC;IAC1BrC,WAAW5B,IAAI4B;IACf2E,WAAWvG,IAAIuG;EACjB;AACF;AApBSrG;AAsBT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRwD,MAAM5C,GAAG4C;IACT0C,MAAMtF,GAAGsF;IACTC,QAAQvF,GAAGuF;IACXpF,QAAQH,GAAGG;IACX4E,OAAOhB,WAAW/D,GAAG+E,KAAK;IAC1BC,QAAQjB,WAAW/D,GAAGgF,MAAM;IAC5BC,OAAOlB,WAAW/D,GAAGiF,KAAK;IAC1BO,QAAQzB,WAAW/D,GAAGwF,MAAM;IAC5BC,UAAUzF,GAAGyF;IACbC,aAAa1F,GAAG0F,eAAe;IAC/BpC,eAAetD,GAAGsD,iBAAiB;IACnCzC,QAAQ4D,UAAUzE,GAAGa,MAAM;IAC3B8E,YAAY3F,GAAG2F;IACfC,WAAW5F,GAAG4F;IACdC,YAAY7F,GAAG6F;EACjB;AACF;AApBSpG;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTwD,MAAM/D,IAAI+D;IACV0C,MAAMzG,IAAIyG;IACVC,QAAQ1G,IAAI0G;IACZpF,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrB0C,QAAS3G,IAAI2G,UAAU1C;IACvB2C,UAAU5G,IAAI4G;IACdC,aAAa7G,IAAI6G,eAAe5C;IAChCQ,eAAezE,IAAIyE,iBAAiBR;IACpCjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7B8E,YAAY9G,IAAI8G,cAAc9G,IAAI+G;IAClCA,WAAW/G,IAAI+G;IACfC,YAAYhH,IAAIgH;EAClB;AACF;AApBSvG;","names":["attributeColumnFor","attributeOperand","normalizeAttributeRows","PrismaStateStore","db","createRun","run","durableWorkflowRun","create","data","toRunData","reindexAttributes","id","searchAttributes","updateRun","runId","patch","update","where","toRunPatch","attributes","durableRunAttribute","deleteMany","rows","normalizeAttributeRows","length","createMany","getRun","row","findUnique","fromRunRow","deleteRun","durableStepCheckpoint","durableSignalWaiter","getCheckpoint","seq","runId_seq","fromCheckpointRow","saveCheckpoint","checkpoint","toCheckpointData","upsert","transaction","work","$transaction","tx","raw","cp","listIncompleteRuns","findMany","status","in","map","listPendingRuns","limit","orderBy","createdAt","take","listDueTimers","nowMs","wakeAt","not","lte","BigInt","tryLockRun","owner","leaseUntilMs","result","updateMany","OR","lockedUntil","Date","lockedBy","count","releaseRunLock","renewRunLock","listRuns","query","workflow","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","skip","offset","listCheckpoints","getLatestCheckpointByName","name","findFirst","undefined","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","r","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","Number","v","workflowVersion","input","output","error","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt"]}
|
|
1
|
+
{"version":3,"sources":["../src/prisma-state-store.ts","../src/schema.ts"],"sourcesContent":["import {\n type AttributeFilter,\n type RunQuery,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type WorkflowRun,\n attributeColumnFor,\n attributeOperand,\n normalizeAttributeRows,\n} from '@dudousxd/nestjs-durable-core';\n\n/* The Prisma client is generated per-schema, so the adapter can't import a concrete one. Instead\n it depends on this structural surface — the three model delegates and the methods it uses. A\n real `PrismaClient` (with the models from prisma/schema.prisma added) satisfies it. Query-arg\n shapes are Prisma's own generics, so they're left as `any` at this single boundary; the row\n return types are precise, which is what the mapping code below relies on. */\n\ninterface RunRow {\n id: string;\n workflow: string;\n workflowVersion: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n wakeAt: bigint | null;\n lockedBy: string | null;\n lockedUntil: Date | null;\n awaitingDecisionTaskId: string | null;\n recoveryAttempts: number | null;\n tags: unknown;\n searchAttributes: unknown;\n priority: number | null;\n createdAt: Date;\n updatedAt: Date;\n}\n\ninterface CheckpointRow {\n runId: string;\n seq: number;\n name: string;\n kind: string;\n stepId: string;\n status: string;\n input: unknown;\n output: unknown;\n error: unknown;\n events: unknown;\n attempts: number;\n workerGroup: string | null;\n parallelGroup: string | null;\n wakeAt: bigint | null;\n enqueuedAt: Date | null;\n startedAt: Date;\n finishedAt: Date;\n}\n\ninterface WaiterRow {\n token: string;\n runId: string;\n seq: number;\n parallelGroup: string | null;\n}\n\ninterface RunAttributeRow {\n runId: string;\n key: string;\n strValue: string | null;\n numValue: number | null;\n}\n\ninterface BufferedSignalRow {\n id: bigint;\n token: string;\n payload: unknown;\n}\n\n// Prisma's per-model query args are generated generics; left as `any` at this single boundary.\ntype Args = any;\n\ninterface Delegate<Row> {\n create(args: Args): Promise<Row>;\n createMany(args: Args): Promise<{ count: number }>;\n findUnique(args: Args): Promise<Row | null>;\n findFirst(args?: Args): Promise<Row | null>;\n findMany(args?: Args): Promise<Row[]>;\n update(args: Args): Promise<Row>;\n updateMany(args: Args): Promise<{ count: number }>;\n upsert(args: Args): Promise<Row>;\n delete(args: Args): Promise<Row>;\n deleteMany(args?: Args): Promise<{ count: number }>;\n}\n\nexport interface DurablePrismaTx {\n durableWorkflowRun: Delegate<RunRow>;\n durableStepCheckpoint: Delegate<CheckpointRow>;\n durableRunAttribute: Delegate<RunAttributeRow>;\n durableSignalWaiter: Delegate<WaiterRow>;\n durableBufferedSignal: Delegate<BufferedSignalRow>;\n}\n\nexport interface DurablePrismaClient extends DurablePrismaTx {\n /** Prisma's interactive-transaction form: runs `fn` with a tx-scoped client and commits on resolve. */\n $transaction<T>(fn: (tx: DurablePrismaTx) => Promise<T>): Promise<T>;\n}\n\n/**\n * Prisma-backed `StateStore`. Pass your `PrismaClient` after adding the models from\n * `prisma/schema.prisma` to your schema. JSON columns carry the run/step payloads directly;\n * `wakeAt` is a `BigInt` (epoch ms).\n */\nexport class PrismaStateStore implements StateStore {\n constructor(private readonly db: DurablePrismaClient) {}\n\n async createRun(run: WorkflowRun): Promise<void> {\n await this.db.durableWorkflowRun.create({ data: toRunData(run) });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, patch: Partial<WorkflowRun>): Promise<void> {\n await this.db.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n // Keep the side-table in step with the run's attributes whenever they're patched.\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n }\n\n /** Rewrite a run's normalized attribute rows: delete the old set, insert the current one. Mirrors\n * the in-memory store's reindex so the side-table always reflects the run's live searchAttributes. */\n private async reindexAttributes(\n runId: string,\n attributes: WorkflowRun['searchAttributes'],\n ): Promise<void> {\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n const rows = normalizeAttributeRows(runId, attributes);\n if (rows.length) await this.db.durableRunAttribute.createMany({ data: rows });\n }\n\n async getRun(runId: string): Promise<WorkflowRun | null> {\n const row = await this.db.durableWorkflowRun.findUnique({ where: { id: runId } });\n return row ? fromRunRow(row) : null;\n }\n\n async deleteRun(runId: string): Promise<void> {\n // Child rows first, then the run — checkpoints, signal waiters, attribute rows.\n await this.db.durableStepCheckpoint.deleteMany({ where: { runId } });\n await this.db.durableSignalWaiter.deleteMany({ where: { runId } });\n await this.db.durableRunAttribute.deleteMany({ where: { runId } });\n await this.db.durableWorkflowRun.deleteMany({ where: { id: runId } });\n }\n\n async getCheckpoint(runId: string, seq: number): Promise<StepCheckpoint | null> {\n const row = await this.db.durableStepCheckpoint.findUnique({\n where: { runId_seq: { runId, seq } },\n });\n return row ? fromCheckpointRow(row) : null;\n }\n\n async saveCheckpoint(checkpoint: StepCheckpoint): Promise<void> {\n const data = toCheckpointData(checkpoint);\n await this.db.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: checkpoint.runId, seq: checkpoint.seq } },\n create: data,\n update: data,\n });\n }\n\n async transaction<T>(\n work: (tx: {\n raw: unknown;\n saveCheckpoint: (cp: StepCheckpoint) => Promise<void>;\n }) => Promise<T>,\n ): Promise<T> {\n return this.db.$transaction(async (tx) =>\n work({\n raw: tx,\n saveCheckpoint: async (cp) => {\n const data = toCheckpointData(cp);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: cp.runId, seq: cp.seq } },\n create: data,\n update: data,\n });\n },\n }),\n );\n }\n\n async listIncompleteRuns(): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: { in: ['running', 'cancelling'] } },\n });\n return rows.map(fromRunRow);\n }\n\n async listPendingRuns(limit: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'pending' },\n orderBy: { createdAt: 'asc' }, // FIFO dispatch\n take: limit,\n });\n return rows.map(fromRunRow);\n }\n\n async listDueTimers(nowMs: number): Promise<WorkflowRun[]> {\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { status: 'suspended', wakeAt: { not: null, lte: BigInt(nowMs) } },\n });\n return rows.map(fromRunRow);\n }\n\n async tryLockRun(\n runId: string,\n owner: string,\n leaseUntilMs: number,\n nowMs: number,\n ): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: {\n id: runId,\n OR: [{ lockedUntil: null }, { lockedUntil: { lte: new Date(nowMs) } }],\n },\n data: { lockedBy: owner, lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async releaseRunLock(runId: string): Promise<void> {\n // Idempotent by design: releasing the lease on a run that no longer exists is a no-op, not an\n // error. The engine calls this best-effort in a `finally` AFTER the run has settled, so it can\n // race a concurrent purge/teardown — Prisma's `update({ where: { id } })` would throw P2025\n // (\"No record was found for an update\") on that race and, since the call is fire-and-forget on\n // the engine's terminal path, surface as an unhandled rejection. `updateMany` matches a 0-row\n // WHERE to an empty result (no throw), mirroring the in-memory store's `if (run)` guard and the\n // set-where semantics of every sibling adapter (TypeORM/MikroORM/Drizzle).\n await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: { lockedBy: null, lockedUntil: null },\n });\n }\n\n async renewRunLock(runId: string, owner: string, leaseUntilMs: number): Promise<boolean> {\n const result = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId, lockedBy: owner },\n data: { lockedUntil: new Date(leaseUntilMs) },\n });\n return result.count === 1;\n }\n\n async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\n const where: Record<string, unknown> = {};\n if (query.workflow) where.workflow = query.workflow;\n // `status IN (...)`; an empty set matches nothing (mirrors the in-memory store). Combined with the\n // single-value `status` via AND when both are present, so the narrower set wins.\n if (query.status && query.statuses) {\n where.AND = [{ status: query.status }, { status: { in: query.statuses } }];\n } else if (query.status) {\n where.status = query.status;\n } else if (query.statuses) {\n where.status = { in: query.statuses };\n }\n if (query.tag) where.tags = { array_contains: query.tag };\n // Typed/range attribute predicates push DOWN into SQL: each filter becomes a relation `some`\n // (EXISTS) on the normalized `durable_run_attributes` side-table, so the DB filters AND paginates\n // — no full scan + in-process filter. ANDed: a run must match every filter, so one `some` each.\n if (query.attributes?.length) {\n const existing = (where.AND as unknown[] | undefined) ?? [];\n where.AND = [...existing, ...query.attributes.map((f) => attributeSome(f))];\n }\n const orderBy = { createdAt: 'desc' as const }; // newest first — recent runs on top in the dashboard\n const rows = await this.db.durableWorkflowRun.findMany({\n where,\n take: query.limit,\n skip: query.offset,\n orderBy,\n });\n return rows.map(fromRunRow);\n }\n\n async listCheckpoints(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async getLatestCheckpointByName(\n runId: string,\n name: string,\n ): Promise<StepCheckpoint | undefined> {\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, name },\n orderBy: { seq: 'desc' },\n });\n return row ? fromCheckpointRow(row) : undefined;\n }\n\n async listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]> {\n if (prefixes.length === 0) return [];\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId, OR: prefixes.map((p) => ({ name: { startsWith: p } })) },\n orderBy: { seq: 'asc' },\n });\n return rows.map(fromCheckpointRow);\n }\n\n async putSignalWaiter(waiter: SignalWaiter): Promise<void> {\n await this.db.durableSignalWaiter.upsert({\n where: { token: waiter.token },\n create: {\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n update: {\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n },\n });\n }\n\n async takeSignalWaiter(token: string): Promise<SignalWaiter | null> {\n const row = await this.db.durableSignalWaiter.findUnique({ where: { token } });\n if (!row) return null;\n await this.db.durableSignalWaiter.delete({ where: { token } });\n return {\n token: row.token,\n runId: row.runId,\n seq: row.seq,\n parallelGroup: row.parallelGroup ?? undefined,\n };\n }\n\n async listSignalWaiters(prefix: string): Promise<SignalWaiter[]> {\n const rows = await this.db.durableSignalWaiter.findMany({\n where: { token: { startsWith: prefix } },\n });\n return rows.map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async bufferSignal(token: string, payload: unknown): Promise<void> {\n await this.db.durableBufferedSignal.create({ data: { token, payload: jsonOrNull(payload) } });\n }\n\n async takeBufferedSignal(token: string): Promise<{ payload: unknown } | null> {\n const row = await this.db.durableBufferedSignal.findFirst({\n where: { token },\n orderBy: { id: 'asc' },\n });\n if (!row) return null;\n await this.db.durableBufferedSignal.delete({ where: { id: row.id } });\n return { payload: row.payload ?? undefined };\n }\n}\n\n/**\n * One attribute predicate as a Prisma relation `some` filter on the side-table — compiles to an\n * EXISTS, so the predicate runs in SQL. `<>` (ne) maps to `{ not }`, which under `some` also excludes\n * runs where the attribute is absent (the missing-key-never-matches contract): `some` already\n * requires a matching row to exist. Numeric operands compare `numValue`, everything else `strValue`.\n */\nfunction attributeSome(f: AttributeFilter): { attributes: { some: Record<string, unknown> } } {\n const col = attributeColumnFor(f); // 'numValue' | 'strValue'\n const operand = attributeOperand(f);\n const condition =\n f.op === 'eq' ? operand : f.op === 'ne' ? { not: operand } : { [f.op]: operand }; // gt/gte/lt/lte map 1:1 to Prisma operators\n return { attributes: { some: { key: f.key, [col]: condition } } };\n}\n\nconst bigOrNull = (n: number | undefined) => (n == null ? null : BigInt(n));\nconst numOrUndef = (n: bigint | null) => (n == null ? undefined : Number(n));\nconst jsonOrNull = (v: unknown) => v ?? null;\n\nfunction toRunData(run: WorkflowRun) {\n return {\n id: run.id,\n workflow: run.workflow,\n workflowVersion: run.workflowVersion,\n status: run.status,\n input: jsonOrNull(run.input),\n output: jsonOrNull(run.output),\n error: jsonOrNull(run.error),\n wakeAt: bigOrNull(run.wakeAt),\n lockedBy: run.lockedBy ?? null,\n lockedUntil: run.lockedUntil == null ? null : new Date(run.lockedUntil),\n awaitingDecisionTaskId: run.awaitingDecisionTaskId ?? null,\n recoveryAttempts: run.recoveryAttempts ?? null,\n tags: jsonOrNull(run.tags),\n searchAttributes: jsonOrNull(run.searchAttributes),\n priority: run.priority ?? null,\n createdAt: run.createdAt,\n updatedAt: run.updatedAt,\n };\n}\n\nfunction toRunPatch(patch: Partial<WorkflowRun>) {\n // Map EVERY patchable field, using presence (`'x' in patch`) semantics for the nullable ones so a\n // patch can CLEAR a column (e.g. `{ error: undefined }` on completion sets it to NULL — matching\n // the TypeORM / MikroORM / in-memory stores). The two non-null Date fields use a defined-guard\n // since they are never cleared. Previously only 7 fields were mapped, so `updateRun({ tags })` /\n // `{ lockedBy }` / clearing `error` silently no-opped on this adapter.\n const data: Record<string, unknown> = {};\n if ('workflow' in patch) data.workflow = patch.workflow;\n if ('workflowVersion' in patch) data.workflowVersion = patch.workflowVersion;\n if ('status' in patch) data.status = patch.status;\n if ('input' in patch) data.input = jsonOrNull(patch.input);\n if ('output' in patch) data.output = jsonOrNull(patch.output);\n if ('error' in patch) data.error = jsonOrNull(patch.error);\n if ('wakeAt' in patch) data.wakeAt = bigOrNull(patch.wakeAt);\n if ('lockedBy' in patch) data.lockedBy = patch.lockedBy ?? null;\n if ('lockedUntil' in patch)\n data.lockedUntil = patch.lockedUntil == null ? null : new Date(patch.lockedUntil);\n if ('awaitingDecisionTaskId' in patch)\n data.awaitingDecisionTaskId = patch.awaitingDecisionTaskId ?? null;\n if ('recoveryAttempts' in patch) data.recoveryAttempts = patch.recoveryAttempts ?? null;\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if ('searchAttributes' in patch) data.searchAttributes = jsonOrNull(patch.searchAttributes);\n if ('priority' in patch) data.priority = patch.priority ?? null;\n if (patch.createdAt != null) data.createdAt = patch.createdAt;\n if (patch.updatedAt != null) data.updatedAt = patch.updatedAt;\n return data;\n}\n\nfunction fromRunRow(row: RunRow): WorkflowRun {\n return {\n id: row.id,\n workflow: row.workflow,\n workflowVersion: row.workflowVersion,\n status: row.status as WorkflowRun['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n wakeAt: numOrUndef(row.wakeAt),\n lockedBy: row.lockedBy ?? undefined,\n lockedUntil: row.lockedUntil == null ? undefined : row.lockedUntil.getTime(),\n awaitingDecisionTaskId: row.awaitingDecisionTaskId ?? undefined,\n recoveryAttempts: row.recoveryAttempts ?? undefined,\n tags: (row.tags as string[] | null) ?? undefined,\n searchAttributes:\n (row.searchAttributes as Record<string, string | number | boolean> | null) ?? undefined,\n priority: row.priority ?? undefined,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\n };\n}\n\nfunction toCheckpointData(cp: StepCheckpoint) {\n return {\n runId: cp.runId,\n seq: cp.seq,\n name: cp.name,\n kind: cp.kind,\n stepId: cp.stepId,\n status: cp.status,\n input: jsonOrNull(cp.input),\n output: jsonOrNull(cp.output),\n error: jsonOrNull(cp.error),\n events: jsonOrNull(cp.events),\n attempts: cp.attempts,\n workerGroup: cp.workerGroup ?? null,\n parallelGroup: cp.parallelGroup ?? null,\n wakeAt: bigOrNull(cp.wakeAt),\n enqueuedAt: cp.enqueuedAt,\n startedAt: cp.startedAt,\n finishedAt: cp.finishedAt,\n };\n}\n\nfunction fromCheckpointRow(row: CheckpointRow): StepCheckpoint {\n return {\n runId: row.runId,\n seq: row.seq,\n name: row.name,\n kind: row.kind as StepCheckpoint['kind'],\n stepId: row.stepId,\n status: row.status as StepCheckpoint['status'],\n input: row.input ?? undefined,\n output: row.output ?? undefined,\n error: (row.error ?? undefined) as StepError | undefined,\n events: (row.events ?? undefined) as StepEvent[] | undefined,\n attempts: row.attempts,\n workerGroup: row.workerGroup ?? undefined,\n parallelGroup: row.parallelGroup ?? undefined,\n wakeAt: numOrUndef(row.wakeAt),\n enqueuedAt: row.enqueuedAt ?? row.startedAt,\n startedAt: row.startedAt,\n finishedAt: row.finishedAt,\n };\n}\n","/**\n * Tables this store's durable models own, physically. UNLIKE the other store adapters, this store\n * doesn't create or manage them at boot: the models in `prisma/schema.prisma` are meant to be copied\n * into YOUR OWN `schema.prisma` (see that file's header comment), and Prisma Migrate diffs whatever\n * models live in your schema — so a consumer who copied the models in already has them accounted for\n * and never needs a denylist for Prisma Migrate itself.\n *\n * This is exported anyway for the same reason the other adapters export it: any OTHER tooling that\n * introspects the database outside of `prisma migrate diff` (a raw schema dump, a second ORM/CLI\n * pointed at the same database, a linter that flags \"table not in any model\") needs the same fixed\n * list of table names this store's models declare via `@@map(...)`.\n *\n * ```ts\n * const skipTables = new Set(durableManagedTables());\n * ```\n *\n * Kept in sync with the `@@map(...)` table names in `prisma/schema.prisma` by `schema.spec.ts`,\n * which parses that file and asserts the two lists match — there is no single TypeScript source to\n * derive from (the schema is a `.prisma` text file copied into the consumer's own schema, not\n * imported at runtime), so the list here is intentionally a literal mirror.\n */\nexport function durableManagedTables(): string[] {\n return [\n 'durable_workflow_runs',\n 'durable_step_checkpoints',\n 'durable_run_attributes',\n 'durable_signal_waiters',\n 'durable_buffered_signals',\n ];\n}\n"],"mappings":";;;;AAAA,SASEA,oBACAC,kBACAC,8BACK;AAsGA,IAAMC,mBAAN,MAAMA;EAlHb,OAkHaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,UAAUC,KAAiC;AAC/C,UAAM,KAAKF,GAAGG,mBAAmBC,OAAO;MAAEC,MAAMC,UAAUJ,GAAAA;IAAK,CAAA;AAC/D,UAAM,KAAKK,kBAAkBL,IAAIM,IAAIN,IAAIO,gBAAgB;EAC3D;EAEA,MAAMC,UAAUC,OAAeC,OAA4C;AACzE,UAAM,KAAKZ,GAAGG,mBAAmBU,OAAO;MAAEC,OAAO;QAAEN,IAAIG;MAAM;MAAGN,MAAMU,WAAWH,KAAAA;IAAO,CAAA;AAExF,QAAI,sBAAsBA,MAAO,OAAM,KAAKL,kBAAkBI,OAAOC,MAAMH,gBAAgB;EAC7F;;;EAIA,MAAcF,kBACZI,OACAK,YACe;AACf,UAAM,KAAKhB,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAMQ,OAAOC,uBAAuBT,OAAOK,UAAAA;AAC3C,QAAIG,KAAKE,OAAQ,OAAM,KAAKrB,GAAGiB,oBAAoBK,WAAW;MAAEjB,MAAMc;IAAK,CAAA;EAC7E;EAEA,MAAMI,OAAOZ,OAA4C;AACvD,UAAMa,MAAM,MAAM,KAAKxB,GAAGG,mBAAmBsB,WAAW;MAAEX,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;AAC/E,WAAOa,MAAME,WAAWF,GAAAA,IAAO;EACjC;EAEA,MAAMG,UAAUhB,OAA8B;AAE5C,UAAM,KAAKX,GAAG4B,sBAAsBV,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKX,GAAG6B,oBAAoBX,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGiB,oBAAoBC,WAAW;MAAEJ,OAAO;QAAEH;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKX,GAAGG,mBAAmBe,WAAW;MAAEJ,OAAO;QAAEN,IAAIG;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMmB,cAAcnB,OAAeoB,KAA6C;AAC9E,UAAMP,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBH,WAAW;MACzDX,OAAO;QAAEkB,WAAW;UAAErB;UAAOoB;QAAI;MAAE;IACrC,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO;EACxC;EAEA,MAAMU,eAAeC,YAA2C;AAC9D,UAAM9B,OAAO+B,iBAAiBD,UAAAA;AAC9B,UAAM,KAAKnC,GAAG4B,sBAAsBS,OAAO;MACzCvB,OAAO;QAAEkB,WAAW;UAAErB,OAAOwB,WAAWxB;UAAOoB,KAAKI,WAAWJ;QAAI;MAAE;MACrE3B,QAAQC;MACRQ,QAAQR;IACV,CAAA;EACF;EAEA,MAAMiC,YACJC,MAIY;AACZ,WAAO,KAAKvC,GAAGwC,aAAa,OAAOC,OACjCF,KAAK;MACHG,KAAKD;MACLP,gBAAgB,8BAAOS,OAAAA;AACrB,cAAMtC,OAAO+B,iBAAiBO,EAAAA;AAC9B,cAAMF,GAAGb,sBAAsBS,OAAO;UACpCvB,OAAO;YAAEkB,WAAW;cAAErB,OAAOgC,GAAGhC;cAAOoB,KAAKY,GAAGZ;YAAI;UAAE;UACrD3B,QAAQC;UACRQ,QAAQR;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAMuC,qBAA6C;AACjD,UAAMzB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;MAAE;IACrD,CAAA;AACA,WAAO5B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAuC;AAC3D,UAAM/B,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;MAAU;MAC3BK,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAuC;AACzD,UAAMpC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAaU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;MAAE;IAC1E,CAAA;AACA,WAAOpC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMkC,WACJjD,OACAkD,OACAC,cACAP,OACkB;AAClB,UAAMQ,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QACLN,IAAIG;QACJsD,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAER,KAAK,IAAIS,KAAKZ,KAAAA;YAAO;UAAE;;MACtE;MACAlD,MAAM;QAAE+D,UAAUP;QAAOK,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMC,eAAe3D,OAA8B;AAQjD,UAAM,KAAKX,GAAGG,mBAAmB6D,WAAW;MAC1ClD,OAAO;QAAEN,IAAIG;MAAM;MACnBN,MAAM;QAAE+D,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMK,aAAa5D,OAAekD,OAAeC,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAK/D,GAAGG,mBAAmB6D,WAAW;MACzDlD,OAAO;QAAEN,IAAIG;QAAOyD,UAAUP;MAAM;MACpCxD,MAAM;QAAE6D,aAAa,IAAIC,KAAKL,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOM,UAAU;EAC1B;EAEA,MAAMG,SAASC,OAAyC;AACtD,UAAM3D,QAAiC,CAAC;AACxC,QAAI2D,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAG3C,QAAID,MAAM3B,UAAU2B,MAAME,UAAU;AAClC7D,YAAM8D,MAAM;QAAC;UAAE9B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAME;UAAS;QAAE;;IAC1E,WAAWF,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAME,UAAU;AACzB7D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAME;MAAS;IACtC;AACA,QAAIF,MAAMI,IAAK/D,OAAMgE,OAAO;MAAEC,gBAAgBN,MAAMI;IAAI;AAIxD,QAAIJ,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM2D,WAAYlE,MAAM8D,OAAiC,CAAA;AACzD9D,YAAM8D,MAAM;WAAII;WAAaP,MAAMzD,WAAWgC,IAAI,CAACiC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,UAAM9B,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B;MACAuC,MAAMoB,MAAMvB;MACZiC,MAAMV,MAAMW;MACZjC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM2D,gBAAgB1E,OAA0C;AAC9D,UAAMQ,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;MAAM;MACfwC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqD,0BACJ3E,OACA4E,MACqC;AACrC,UAAM/D,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsB4D,UAAU;MACxD1E,OAAO;QAAEH;QAAO4E;MAAK;MACrBpC,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAOiE;EACxC;EAEA,MAAMC,4BAA4B/E,OAAegF,UAA+C;AAC9F,QAAIA,SAAStE,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAI0B,SAAS3C,IAAI,CAAC4C,OAAO;UAAEL,MAAM;YAAEM,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEzC,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAM6D,gBAAgBC,QAAqC;AACzD,UAAM,KAAK/F,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAEkF,OAAOD,OAAOC;MAAM;MAC7B5F,QAAQ;QACN4F,OAAOD,OAAOC;QACdrF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;MACApF,QAAQ;QACNF,OAAOoF,OAAOpF;QACdoB,KAAKgE,OAAOhE;QACZkE,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMxE,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACxE,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBsE,OAAO;MAAErF,OAAO;QAAEkF;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOxE,IAAIwE;MACXrF,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACTkE,eAAezE,IAAIyE,iBAAiBR;IACtC;EACF;EAEA,MAAMW,kBAAkBC,QAAyC;AAC/D,UAAMlF,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAEkF,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAOlF,KAAK6B,IAAI,CAACsD,OAAO;MACtBN,OAAOM,EAAEN;MACTrF,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACPkE,eAAeK,EAAEL,iBAAiBR;IACpC,EAAA;EACF;EAEA,MAAMc,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKxG,GAAGyG,sBAAsBrG,OAAO;MAAEC,MAAM;QAAE2F;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMxE,MAAM,MAAM,KAAKxB,GAAGyG,sBAAsBjB,UAAU;MACxD1E,OAAO;QAAEkF;MAAM;MACf7C,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGyG,sBAAsBN,OAAO;MAAErF,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEgG,SAAShF,IAAIgF,WAAWf;IAAU;EAC7C;AACF;AAQA,SAASP,cAAcD,GAAkB;AACvC,QAAM2B,MAAMC,mBAAmB5B,CAAAA;AAC/B,QAAM6B,UAAUC,iBAAiB9B,CAAAA;AACjC,QAAM+B,YACJ/B,EAAEgC,OAAO,OAAOH,UAAU7B,EAAEgC,OAAO,OAAO;IAAExD,KAAKqD;EAAQ,IAAI;IAAE,CAAC7B,EAAEgC,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE9F,YAAY;MAAEkG,MAAM;QAAEC,KAAKlC,EAAEkC;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS9B;AAQT,IAAMkC,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAO1D,OAAO0D,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAO5B,SAAY8B,OAAOF,CAAAA,GAAtD;AACnB,IAAMX,aAAa,wBAACc,MAAeA,KAAK,MAArB;AAEnB,SAASlH,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd+C,iBAAiBvH,IAAIuH;IACrB3E,QAAQ5C,IAAI4C;IACZ4E,OAAOhB,WAAWxG,IAAIwH,KAAK;IAC3BC,QAAQjB,WAAWxG,IAAIyH,MAAM;IAC7BC,OAAOlB,WAAWxG,IAAI0H,KAAK;IAC3BpE,QAAQ4D,UAAUlH,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE2D,wBAAwB3H,IAAI2H,0BAA0B;IACtDC,kBAAkB5H,IAAI4H,oBAAoB;IAC1ChD,MAAM4B,WAAWxG,IAAI4E,IAAI;IACzBrE,kBAAkBiG,WAAWxG,IAAIO,gBAAgB;IACjDsH,UAAU7H,IAAI6H,YAAY;IAC1B3E,WAAWlD,IAAIkD;IACf4E,WAAW9H,IAAI8H;EACjB;AACF;AApBS1H;AAsBT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKoH,kBAAkB7G,MAAM6G;AAC7D,MAAI,YAAY7G,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKqH,QAAQhB,WAAW9F,MAAM8G,KAAK;AACzD,MAAI,YAAY9G,MAAOP,MAAKsH,SAASjB,WAAW9F,MAAM+G,MAAM;AAC5D,MAAI,WAAW/G,MAAOP,MAAKuH,QAAQlB,WAAW9F,MAAMgH,KAAK;AACzD,MAAI,YAAYhH,MAAOP,MAAKmD,SAAS4D,UAAUxG,MAAM4C,MAAM;AAC3D,MAAI,cAAc5C,MAAOP,MAAK+D,WAAWxD,MAAMwD,YAAY;AAC3D,MAAI,iBAAiBxD,MACnBP,MAAK6D,cAActD,MAAMsD,eAAe,OAAO,OAAO,IAAIC,KAAKvD,MAAMsD,WAAW;AAClF,MAAI,4BAA4BtD,MAC9BP,MAAKwH,yBAAyBjH,MAAMiH,0BAA0B;AAChE,MAAI,sBAAsBjH,MAAOP,MAAKyH,mBAAmBlH,MAAMkH,oBAAoB;AACnF,MAAI,UAAUlH,MAAOP,MAAKyE,OAAO4B,WAAW9F,MAAMkE,IAAI;AACtD,MAAI,sBAAsBlE,MAAOP,MAAKI,mBAAmBiG,WAAW9F,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAK0H,WAAWnH,MAAMmH,YAAY;AAC3D,MAAInH,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMoH,aAAa,KAAM3H,MAAK2H,YAAYpH,MAAMoH;AACpD,SAAO3H;AACT;AA1BSU;AA4BT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd+C,iBAAiBjG,IAAIiG;IACrB3E,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrBjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYqB;IAC1BvB,aAAa1C,IAAI0C,eAAe,OAAOuB,SAAYjE,IAAI0C,YAAY+D,QAAO;IAC1EJ,wBAAwBrG,IAAIqG,0BAA0BpC;IACtDqC,kBAAkBtG,IAAIsG,oBAAoBrC;IAC1CX,MAAOtD,IAAIsD,QAA4BW;IACvChF,kBACGe,IAAIf,oBAAyEgF;IAChFsC,UAAUvG,IAAIuG,YAAYtC;IAC1BrC,WAAW5B,IAAI4B;IACf4E,WAAWxG,IAAIwG;EACjB;AACF;AArBStG;AAuBT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRwD,MAAM5C,GAAG4C;IACT2C,MAAMvF,GAAGuF;IACTC,QAAQxF,GAAGwF;IACXrF,QAAQH,GAAGG;IACX4E,OAAOhB,WAAW/D,GAAG+E,KAAK;IAC1BC,QAAQjB,WAAW/D,GAAGgF,MAAM;IAC5BC,OAAOlB,WAAW/D,GAAGiF,KAAK;IAC1BQ,QAAQ1B,WAAW/D,GAAGyF,MAAM;IAC5BC,UAAU1F,GAAG0F;IACbC,aAAa3F,GAAG2F,eAAe;IAC/BrC,eAAetD,GAAGsD,iBAAiB;IACnCzC,QAAQ4D,UAAUzE,GAAGa,MAAM;IAC3B+E,YAAY5F,GAAG4F;IACfC,WAAW7F,GAAG6F;IACdC,YAAY9F,GAAG8F;EACjB;AACF;AApBSrG;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTwD,MAAM/D,IAAI+D;IACV2C,MAAM1G,IAAI0G;IACVC,QAAQ3G,IAAI2G;IACZrF,QAAQtB,IAAIsB;IACZ4E,OAAOlG,IAAIkG,SAASjC;IACpBkC,QAAQnG,IAAImG,UAAUlC;IACtBmC,OAAQpG,IAAIoG,SAASnC;IACrB2C,QAAS5G,IAAI4G,UAAU3C;IACvB4C,UAAU7G,IAAI6G;IACdC,aAAa9G,IAAI8G,eAAe7C;IAChCQ,eAAezE,IAAIyE,iBAAiBR;IACpCjC,QAAQ8D,WAAW9F,IAAIgC,MAAM;IAC7B+E,YAAY/G,IAAI+G,cAAc/G,IAAIgH;IAClCA,WAAWhH,IAAIgH;IACfC,YAAYjH,IAAIiH;EAClB;AACF;AApBSxG;;;ACxcF,SAASyG,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;;AAEJ;AARgBA;","names":["attributeColumnFor","attributeOperand","normalizeAttributeRows","PrismaStateStore","db","createRun","run","durableWorkflowRun","create","data","toRunData","reindexAttributes","id","searchAttributes","updateRun","runId","patch","update","where","toRunPatch","attributes","durableRunAttribute","deleteMany","rows","normalizeAttributeRows","length","createMany","getRun","row","findUnique","fromRunRow","deleteRun","durableStepCheckpoint","durableSignalWaiter","getCheckpoint","seq","runId_seq","fromCheckpointRow","saveCheckpoint","checkpoint","toCheckpointData","upsert","transaction","work","$transaction","tx","raw","cp","listIncompleteRuns","findMany","status","in","map","listPendingRuns","limit","orderBy","createdAt","take","listDueTimers","nowMs","wakeAt","not","lte","BigInt","tryLockRun","owner","leaseUntilMs","result","updateMany","OR","lockedUntil","Date","lockedBy","count","releaseRunLock","renewRunLock","listRuns","query","workflow","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","skip","offset","listCheckpoints","getLatestCheckpointByName","name","findFirst","undefined","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","r","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","Number","v","workflowVersion","input","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@dudousxd/nestjs-durable-store-prisma",
|
|
3
|
-
"version": "0.11.
|
|
3
|
+
"version": "0.11.6",
|
|
4
4
|
"description": "Prisma adapter for the nestjs-durable StateStore",
|
|
5
5
|
"license": "MIT",
|
|
6
6
|
"author": "Davide Carvalho",
|
|
@@ -26,8 +26,8 @@
|
|
|
26
26
|
"prisma": "6.19.3",
|
|
27
27
|
"typescript": "5.9.3",
|
|
28
28
|
"tsup": "8.3.5",
|
|
29
|
-
"@dudousxd/nestjs-durable-core": "^0.
|
|
30
|
-
"@dudousxd/nestjs-durable-testing": "^0.7.
|
|
29
|
+
"@dudousxd/nestjs-durable-core": "^0.50.0",
|
|
30
|
+
"@dudousxd/nestjs-durable-testing": "^0.7.2"
|
|
31
31
|
},
|
|
32
32
|
"module": "./dist/index.js",
|
|
33
33
|
"exports": {
|
package/prisma/schema.prisma
CHANGED
|
@@ -12,6 +12,7 @@ model DurableWorkflowRun {
|
|
|
12
12
|
wakeAt BigInt? @map("wake_at")
|
|
13
13
|
lockedBy String? @map("locked_by")
|
|
14
14
|
lockedUntil DateTime? @map("locked_until")
|
|
15
|
+
awaitingDecisionTaskId String? @map("awaiting_decision_task_id")
|
|
15
16
|
recoveryAttempts Int? @map("recovery_attempts")
|
|
16
17
|
tags Json?
|
|
17
18
|
searchAttributes Json? @map("search_attributes")
|