@dudousxd/nestjs-durable-store-prisma 0.16.0 → 0.17.0

package/dist/index.cjs

@@ -233,19 +233,26 @@ var PrismaStateStore = class {
     const where = {
       ...namespaceWhere(query.namespace)
     };
+    const and = [];
     if (query.workflow) where.workflow = query.workflow;
+    if (query.workflows) and.push(anyOf(query.workflows.map((w) => ({
+      workflow: w
+    }))));
+    if (query.namespaces) and.push(anyOf(query.namespaces.map((n) => ({
+      namespace: n
+    }))));
     if (query.origin !== void 0) where.origin = query.origin;
+    if (query.origins) and.push(anyOf(query.origins.map((o) => ({
+      origin: o
+    }))));
     if (query.status && query.statuses) {
-      where.AND = [
-        {
-          status: query.status
-        },
-        {
-          status: {
-            in: query.statuses
-          }
+      and.push({
+        status: query.status
+      }, {
+        status: {
+          in: query.statuses
         }
-      ];
+      });
     } else if (query.status) {
       where.status = query.status;
     } else if (query.statuses) {
@@ -256,13 +263,13 @@ var PrismaStateStore = class {
     if (query.tag) where.tags = {
       array_contains: query.tag
     };
-    if (query.attributes?.length) {
-      const existing = where.AND ?? [];
-      where.AND = [
-        ...existing,
-        ...query.attributes.map((f) => attributeSome(f))
-      ];
-    }
+    if (query.tags) and.push(anyOf(query.tags.map((t) => ({
+      tags: {
+        array_contains: t
+      }
+    }))));
+    if (query.attributes?.length) and.push(...query.attributes.map((f) => attributeSome(f)));
+    if (and.length) where.AND = and;
     return where;
   }
   async listRuns(query) {
@@ -297,6 +304,32 @@ var PrismaStateStore = class {
       count: r._count._all
     })));
   }
+  /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table
+  *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and
+  *  attribute axes live outside the row (json column / side table) and are counted from a bounded
+  *  page of runs instead — see `RunValueFacetOptions.scan`. */
+  async runValueFacets(axis, query, opts) {
+    if (!(0, import_nestjs_durable_core.axisIsRunColumn)(axis)) {
+      const runs = await this.listRuns({
+        ...query,
+        limit: opts?.scan ?? import_nestjs_durable_core.RUN_VALUE_FACET_SCAN
+      });
+      return (0, import_nestjs_durable_core.runValueFacetsFromRuns)(runs, axis, opts);
+    }
+    const rows = await this.db.durableWorkflowRun.groupBy({
+      by: [
+        axis.field
+      ],
+      where: this.runWhere(query),
+      _count: {
+        _all: true
+      }
+    });
+    return (0, import_nestjs_durable_core.mergeRunValueFacetRows)(rows.map((r) => ({
+      value: r[axis.field] ?? null,
+      count: r._count._all
+    })), opts);
+  }
   async listCheckpoints(runId) {
     const rows = await this.db.durableStepCheckpoint.findMany({
       where: {
@@ -461,23 +494,35 @@ var PrismaStateStore = class {
   }
 };
 function attributeSome(f) {
-  const col = (0, import_nestjs_durable_core.attributeColumnFor)(f);
-  const operand = (0, import_nestjs_durable_core.attributeOperand)(f);
-  const condition = f.op === "eq" ? operand : f.op === "ne" ? {
-    not: operand
-  } : {
-    [f.op]: operand
-  };
+  const comparisons = (0, import_nestjs_durable_core.attributePredicateOperands)(f).map(({ column, comparator, operand }) => ({
+    [column]: comparator === "=" ? operand : comparator === "<>" ? {
+      not: operand
+    } : {
+      [f.op]: operand
+    }
+  }));
+  if (comparisons.length === 0) return MATCHES_NOTHING;
   return {
     attributes: {
       some: {
         key: f.key,
-        [col]: condition
+        ...anyOf(comparisons)
       }
     }
   };
 }
 __name(attributeSome, "attributeSome");
+var MATCHES_NOTHING = {
+  id: {
+    in: []
+  }
+};
+function anyOf(branches) {
+  return branches.length ? {
+    OR: branches
+  } : MATCHES_NOTHING;
+}
+__name(anyOf, "anyOf");
 var bigOrNull = /* @__PURE__ */ __name((n) => n == null ? null : BigInt(n), "bigOrNull");
 var numOrUndef = /* @__PURE__ */ __name((n) => n == null ? void 0 : Number(n), "numOrUndef");
 var jsonOrNull = /* @__PURE__ */ __name((v) => v ?? null, "jsonOrNull");

package/dist/index.cjs.map

@@ -1 +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 RunFacetQuery,\n  type RunFacetRow,\n  type RunQuery,\n  type RunStatus,\n  type SignalWaiter,\n  type StateStore,\n  type StepCheckpoint,\n  type StepError,\n  type StepEvent,\n  type WorkflowRun,\n  attributeColumnFor,\n  attributeOperand,\n  mergeRunFacetRows,\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  /** NOT NULL in the schema (defaulted to `'default'`), so every row carries a real namespace. */\n  namespace: string;\n  origin: string | 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\ninterface BufferedEventRow {\n  id: string;\n  name: string;\n  payload: unknown;\n  publishedAt: bigint;\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  /** Aggregate form — used only by `runFacets`, whose rows are `(status, origin, count)` cells, not\n   *  model rows, so the result type is stated at the call site rather than derived from `Row`. */\n  groupBy(args: Args): Promise<Record<string, unknown>[]>;\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  durableBufferedEvent: Delegate<BufferedEventRow>;\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 * The `namespace` read boundary as a spreadable Prisma `where` fragment.\n *\n * `undefined` means NO RESTRICTION — `{}` — because that is the operator (control-plane) view that\n * sees every tenant, and it is what the engine passes when it runs unscoped. It does NOT mean\n * \"namespace IS NULL\": the column is NOT NULL, so `{ namespace: undefined }` would be Prisma's\n * \"ignore this predicate\" anyway, but `{ namespace: null }` would match nothing in production while\n * still looking correct in a single-tenant test where every worker polls unscoped.\n *\n * A named namespace is plain equality, so a worker sees only its own tenant's rows — the boundary\n * {@link WorkflowRun.namespace} promises for the four worker paths (pick up, recover, resume timers,\n * time out).\n */\nfunction namespaceWhere(namespace?: string): { namespace?: string } {\n  if (namespace === undefined) return {};\n  return { namespace };\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 *\n * Every path a worker acts on is namespace-scoped when it is given one — `listPendingRuns` (pick up),\n * `listIncompleteRuns` (recover), `listDueTimers` (resume timers) and `listRuns`'s `namespace`\n * (the engine's timeout sweep). Omit it for the operator view across all tenants. Point-reads\n * (`getRun`, checkpoints) are deliberately NOT scoped, per {@link StateStore}.\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(namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: { in: ['running', 'cancelling'] }, ...namespaceWhere(namespace) },\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listPendingRuns(limit: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: 'pending', ...namespaceWhere(namespace) },\n      orderBy: { createdAt: 'asc' }, // FIFO dispatch\n      take: limit,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listDueTimers(nowMs: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: {\n        status: 'suspended',\n        wakeAt: { not: null, lte: BigInt(nowMs) },\n        ...namespaceWhere(namespace),\n      },\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  /** The `where` every run query shares — {@link listRuns} pages it, {@link runFacets} groups it. */\n  private runWhere(query: RunQuery): Record<string, unknown> {\n    // The tenant boundary, and NOT only a dashboard facet: the engine's `sweepTimeouts` finds the runs\n    // it may cancel through `listRuns({ workflow, status, namespace })`, so an unfiltered `namespace`\n    // here lets a worker serving one tenant time out another tenant's runs — a write, not a stale\n    // read. Same `undefined` = no restriction rule as the poll paths above (see `namespaceWhere`),\n    // which is what keeps the operator's dashboard showing every tenant by default.\n    const where: Record<string, unknown> = { ...namespaceWhere(query.namespace) };\n    if (query.workflow) where.workflow = query.workflow;\n    // Which library registered the workflow. Plain equality, so a run whose origin is NULL (created\n    // before the column existed, or registered through a path the derivation could not classify)\n    // matches NO origin value — it is never folded into a bucket to make the facet look complete.\n    // Unknown-origin runs are reachable only with the filter OFF, so \"all origins\" must stay the\n    // default view; a dashboard that filtered by default would make those runs look deleted.\n    // Passing `null` asks for exactly the unattributed bucket (`origin IS NULL`) — Prisma spells that\n    // as the same equality — which is how a paginated console can offer an \"unknown\" chip.\n    if (query.origin !== undefined) where.origin = query.origin;\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    return where;\n  }\n\n  async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\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: this.runWhere(query),\n      take: query.limit,\n      skip: query.offset,\n      orderBy,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  /** `GROUP BY status, origin` over the same predicates {@link listRuns} pages — one aggregate, so a\n   *  console can show whole-set counts next to a bounded page instead of downloading every run to\n   *  count them in the browser. */\n  async runFacets(query: RunFacetQuery): Promise<RunFacetRow[]> {\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: ['status', 'origin'],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as { status: RunStatus; origin: string | null; _count: { _all: number } }[];\n    return mergeRunFacetRows(\n      rows.map((r) => ({ status: r.status, origin: r.origin, count: r._count._all })),\n    );\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 removeSignalWaiter(waiter: SignalWaiter): Promise<void> {\n    // Exact-match delete (token AND runId AND seq): `token` is the only unique column, so a plain\n    // `delete({ where: { token } })` would remove whatever row currently owns it, even if a different\n    // run has since claimed the same token — `deleteMany` with all three fields is a safe no-op then.\n    await this.db.durableSignalWaiter.deleteMany({\n      where: { token: waiter.token, runId: waiter.runId, seq: waiter.seq },\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  async bufferEvent(input: {\n    name: string;\n    payload: unknown;\n    id: string;\n    publishedAt: number;\n  }): Promise<void> {\n    await this.db.durableBufferedEvent.create({\n      data: {\n        id: input.id,\n        name: input.name,\n        payload: jsonOrNull(input.payload),\n        publishedAt: BigInt(input.publishedAt),\n      },\n    });\n  }\n\n  async listBufferedEvents(\n    name: string,\n    limit: number,\n  ): Promise<Array<{ id: string; payload: unknown; publishedAt: number }>> {\n    const rows = await this.db.durableBufferedEvent.findMany({\n      where: { name },\n      orderBy: { publishedAt: 'asc' }, // oldest first\n      take: limit,\n    });\n    return rows.map((r) => ({\n      id: r.id,\n      payload: r.payload ?? undefined,\n      publishedAt: Number(r.publishedAt),\n    }));\n  }\n\n  async removeBufferedEvent(id: string): Promise<boolean> {\n    // deleteMany's `where: { id }` matches at most one row (id is the PK) and is a safe no-op if it's\n    // already gone — unlike `delete({ where: { id } })`, which throws P2025 on a missing row (the same\n    // reasoning as releaseRunLock's updateMany above).\n    const result = await this.db.durableBufferedEvent.deleteMany({ where: { id } });\n    return result.count === 1;\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    // An absent namespace IS `'default'` — unlike `origin` below, this is a reconstruction and not a\n    // guess: an engine started without a namespace stamps its runs and routes its workers as\n    // `'default'`, so writing anything else (or NULL) would put the run in a partition no worker polls.\n    namespace: run.namespace ?? 'default',\n    // Absent origin stays SQL NULL — \"unknown\", never coerced into a real-looking library name.\n    origin: run.origin ?? 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  // `?? 'default'` rather than `?? null` like its neighbours: the column is NOT NULL, and clearing a\n  // run's namespace means \"back to the unscoped partition\", which is what `'default'` names. A patch\n  // that does not mention `namespace` leaves the stored one alone — a status update must never move a\n  // run between tenants.\n  if ('namespace' in patch) data.namespace = patch.namespace ?? 'default';\n  if ('origin' in patch) data.origin = patch.origin ?? 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    // Read back verbatim, with NO `?? 'default'` fallback. The column is NOT NULL and the migration\n    // back-fills old rows, so there is nothing legitimate to fall back FROM; a fallback would only fire\n    // on a deployment that added the column nullable without back-filling, and there it would lie —\n    // the dashboard would show `default` for a row whose stored NULL keeps every `default` worker's\n    // `WHERE namespace = 'default'` from ever picking it up.\n    namespace: row.namespace,\n    // NULL (a row written before the column existed) surfaces as `undefined` = unknown origin.\n    origin: row.origin ?? 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    'durable_buffered_events',\n  ];\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACAA,iCAgBO;AA4HP,SAASA,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EA3Jb,OA2JaA;;;;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,mBAAmB/C,WAA4C;AACnE,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGnD,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOsB,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAerD,WAA4C;AAC/E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAW,GAAGlD,eAAeC,SAAAA;MAAW;MACzDsD,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAe1D,WAA4C;AAC7E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QACLgC,QAAQ;QACRU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;QACxC,GAAG3D,eAAeC,SAAAA;MACpB;IACF,CAAA;AACA,WAAOsB,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;;EAGQG,SAASC,OAA0C;AAMzD,UAAM3D,QAAiC;MAAE,GAAGlB,eAAe6E,MAAM5E,SAAS;IAAE;AAC5E,QAAI4E,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAQ3C,QAAID,MAAME,WAAW7E,OAAWgB,OAAM6D,SAASF,MAAME;AAGrD,QAAIF,MAAM3B,UAAU2B,MAAMG,UAAU;AAClC9D,YAAM+D,MAAM;QAAC;UAAE/B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAMG;UAAS;QAAE;;IAC1E,WAAWH,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAMG,UAAU;AACzB9D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAMG;MAAS;IACtC;AACA,QAAIH,MAAMK,IAAKhE,OAAMiE,OAAO;MAAEC,gBAAgBP,MAAMK;IAAI;AAIxD,QAAIL,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM4D,WAAYnE,MAAM+D,OAAiC,CAAA;AACzD/D,YAAM+D,MAAM;WAAII;WAAaR,MAAMzD,WAAWgC,IAAI,CAACkC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,WAAOpE;EACT;EAEA,MAAMsE,SAASX,OAAyC;AACtD,UAAMtB,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO,KAAK0D,SAASC,KAAAA;MACrBpB,MAAMoB,MAAMvB;MACZmC,MAAMZ,MAAMa;MACZnC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;;;;EAKA,MAAM6D,UAAUd,OAA8C;AAC5D,UAAMtD,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmBqF,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACf3E,OAAO,KAAK0D,SAASC,KAAAA;MACrBiB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOC,8CACLzE,KAAK6B,IAAI,CAAC6C,OAAO;MAAE/C,QAAQ+C,EAAE/C;MAAQ6B,QAAQkB,EAAElB;MAAQN,OAAOwB,EAAEH,OAAOC;IAAK,EAAA,CAAA;EAEhF;EAEA,MAAMG,gBAAgBnF,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,MAAM8D,0BACJpF,OACAqF,MACqC;AACrC,UAAMxE,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBqE,UAAU;MACxDnF,OAAO;QAAEH;QAAOqF;MAAK;MACrB7C,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO1B;EACxC;EAEA,MAAMoG,4BAA4BvF,OAAewF,UAA+C;AAC9F,QAAIA,SAAS9E,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAIkC,SAASnD,IAAI,CAACoD,OAAO;UAAEJ,MAAM;YAAEK,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEjD,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqE,gBAAgBC,QAAqC;AACzD,UAAM,KAAKvG,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAE0F,OAAOD,OAAOC;MAAM;MAC7BpG,QAAQ;QACNoG,OAAOD,OAAOC;QACd7F,OAAO4F,OAAO5F;QACdoB,KAAKwE,OAAOxE;QACZ0E,eAAeF,OAAOE,iBAAiB;MACzC;MACA5F,QAAQ;QACNF,OAAO4F,OAAO5F;QACdoB,KAAKwE,OAAOxE;QACZ0E,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMhF,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAE0F;MAAM;IAAE,CAAA;AAC5E,QAAI,CAAChF,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoB8E,OAAO;MAAE7F,OAAO;QAAE0F;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOhF,IAAIgF;MACX7F,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACT0E,eAAejF,IAAIiF,iBAAiB3G;IACtC;EACF;EAEA,MAAM8G,kBAAkBC,QAAyC;AAC/D,UAAM1F,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAE0F,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAO1F,KAAK6B,IAAI,CAAC6C,OAAO;MACtBW,OAAOX,EAAEW;MACT7F,OAAOkF,EAAElF;MACToB,KAAK8D,EAAE9D;MACP0E,eAAeZ,EAAEY,iBAAiB3G;IACpC,EAAA;EACF;EAEA,MAAMgH,mBAAmBP,QAAqC;AAI5D,UAAM,KAAKvG,GAAG6B,oBAAoBX,WAAW;MAC3CJ,OAAO;QAAE0F,OAAOD,OAAOC;QAAO7F,OAAO4F,OAAO5F;QAAOoB,KAAKwE,OAAOxE;MAAI;IACrE,CAAA;EACF;EAEA,MAAMgF,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKhH,GAAGiH,sBAAsB7G,OAAO;MAAEC,MAAM;QAAEmG;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMhF,MAAM,MAAM,KAAKxB,GAAGiH,sBAAsBhB,UAAU;MACxDnF,OAAO;QAAE0F;MAAM;MACfrD,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGiH,sBAAsBN,OAAO;MAAE7F,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEwG,SAASxF,IAAIwF,WAAWlH;IAAU;EAC7C;EAEA,MAAMsH,YAAYC,OAKA;AAChB,UAAM,KAAKrH,GAAGsH,qBAAqBlH,OAAO;MACxCC,MAAM;QACJG,IAAI6G,MAAM7G;QACVwF,MAAMqB,MAAMrB;QACZgB,SAASE,WAAWG,MAAML,OAAO;QACjCO,aAAa5D,OAAO0D,MAAME,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJxB,MACA9C,OACuE;AACvE,UAAM/B,OAAO,MAAM,KAAKnB,GAAGsH,qBAAqBzE,SAAS;MACvD/B,OAAO;QAAEkF;MAAK;MACd7C,SAAS;QAAEoE,aAAa;MAAM;MAC9BlE,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAI,CAAC6C,OAAO;MACtBrF,IAAIqF,EAAErF;MACNwG,SAASnB,EAAEmB,WAAWlH;MACtByH,aAAaE,OAAO5B,EAAE0B,WAAW;IACnC,EAAA;EACF;EAEA,MAAMG,oBAAoBlH,IAA8B;AAItD,UAAMuD,SAAS,MAAM,KAAK/D,GAAGsH,qBAAqBpG,WAAW;MAAEJ,OAAO;QAAEN;MAAG;IAAE,CAAA;AAC7E,WAAOuD,OAAOM,UAAU;EAC1B;AACF;AAQA,SAASc,cAAcD,GAAkB;AACvC,QAAMyC,UAAMC,+CAAmB1C,CAAAA;AAC/B,QAAM2C,cAAUC,6CAAiB5C,CAAAA;AACjC,QAAM6C,YACJ7C,EAAE8C,OAAO,OAAOH,UAAU3C,EAAE8C,OAAO,OAAO;IAAEvE,KAAKoE;EAAQ,IAAI;IAAE,CAAC3C,EAAE8C,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE7G,YAAY;MAAEiH,MAAM;QAAEC,KAAKhD,EAAEgD;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS5C;AAQT,IAAMgD,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAOzE,OAAOyE,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAOtI,SAAY2H,OAAOW,CAAAA,GAAtD;AACnB,IAAMlB,aAAa,wBAACoB,MAAeA,KAAK,MAArB;AAEnB,SAAShI,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd6D,iBAAiBrI,IAAIqI;IACrBzF,QAAQ5C,IAAI4C;IACZuE,OAAOH,WAAWhH,IAAImH,KAAK;IAC3BmB,QAAQtB,WAAWhH,IAAIsI,MAAM;IAC7BC,OAAOvB,WAAWhH,IAAIuI,KAAK;IAC3BjF,QAAQ2E,UAAUjI,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtEwE,wBAAwBxI,IAAIwI,0BAA0B;IACtDC,kBAAkBzI,IAAIyI,oBAAoB;IAC1C5D,MAAMmC,WAAWhH,IAAI6E,IAAI;IACzBtE,kBAAkByG,WAAWhH,IAAIO,gBAAgB;IACjDmI,UAAU1I,IAAI0I,YAAY;;;;IAI1B/I,WAAWK,IAAIL,aAAa;;IAE5B8E,QAAQzE,IAAIyE,UAAU;IACtBvB,WAAWlD,IAAIkD;IACfyF,WAAW3I,IAAI2I;EACjB;AACF;AA1BSvI;AA4BT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKkI,kBAAkB3H,MAAM2H;AAC7D,MAAI,YAAY3H,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKgH,QAAQH,WAAWtG,MAAMyG,KAAK;AACzD,MAAI,YAAYzG,MAAOP,MAAKmI,SAAStB,WAAWtG,MAAM4H,MAAM;AAC5D,MAAI,WAAW5H,MAAOP,MAAKoI,QAAQvB,WAAWtG,MAAM6H,KAAK;AACzD,MAAI,YAAY7H,MAAOP,MAAKmD,SAAS2E,UAAUvH,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,MAAKqI,yBAAyB9H,MAAM8H,0BAA0B;AAChE,MAAI,sBAAsB9H,MAAOP,MAAKsI,mBAAmB/H,MAAM+H,oBAAoB;AACnF,MAAI,UAAU/H,MAAOP,MAAK0E,OAAOmC,WAAWtG,MAAMmE,IAAI;AACtD,MAAI,sBAAsBnE,MAAOP,MAAKI,mBAAmByG,WAAWtG,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAKuI,WAAWhI,MAAMgI,YAAY;AAK3D,MAAI,eAAehI,MAAOP,MAAKR,YAAYe,MAAMf,aAAa;AAC9D,MAAI,YAAYe,MAAOP,MAAKsE,SAAS/D,MAAM+D,UAAU;AACrD,MAAI/D,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMiI,aAAa,KAAMxI,MAAKwI,YAAYjI,MAAMiI;AACpD,SAAOxI;AACT;AAhCSU;AAkCT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd6D,iBAAiB/G,IAAI+G;IACrBzF,QAAQtB,IAAIsB;IACZuE,OAAO7F,IAAI6F,SAASvH;IACpB0I,QAAQhH,IAAIgH,UAAU1I;IACtB2I,OAAQjH,IAAIiH,SAAS3I;IACrB0D,QAAQ6E,WAAW7G,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYtE;IAC1BoE,aAAa1C,IAAI0C,eAAe,OAAOpE,SAAY0B,IAAI0C,YAAY4E,QAAO;IAC1EJ,wBAAwBlH,IAAIkH,0BAA0B5I;IACtD6I,kBAAkBnH,IAAImH,oBAAoB7I;IAC1CiF,MAAOvD,IAAIuD,QAA4BjF;IACvCW,kBACGe,IAAIf,oBAAyEX;IAChF8I,UAAUpH,IAAIoH,YAAY9I;;;;;;IAM1BD,WAAW2B,IAAI3B;;IAEf8E,QAAQnD,IAAImD,UAAU7E;IACtBsD,WAAW5B,IAAI4B;IACfyF,WAAWrH,IAAIqH;EACjB;AACF;AA7BSnH;AA+BT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRiE,MAAMrD,GAAGqD;IACT+C,MAAMpG,GAAGoG;IACTC,QAAQrG,GAAGqG;IACXlG,QAAQH,GAAGG;IACXuE,OAAOH,WAAWvE,GAAG0E,KAAK;IAC1BmB,QAAQtB,WAAWvE,GAAG6F,MAAM;IAC5BC,OAAOvB,WAAWvE,GAAG8F,KAAK;IAC1BQ,QAAQ/B,WAAWvE,GAAGsG,MAAM;IAC5BC,UAAUvG,GAAGuG;IACbC,aAAaxG,GAAGwG,eAAe;IAC/B1C,eAAe9D,GAAG8D,iBAAiB;IACnCjD,QAAQ2E,UAAUxF,GAAGa,MAAM;IAC3B4F,YAAYzG,GAAGyG;IACfC,WAAW1G,GAAG0G;IACdC,YAAY3G,GAAG2G;EACjB;AACF;AApBSlH;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTiE,MAAMxE,IAAIwE;IACV+C,MAAMvH,IAAIuH;IACVC,QAAQxH,IAAIwH;IACZlG,QAAQtB,IAAIsB;IACZuE,OAAO7F,IAAI6F,SAASvH;IACpB0I,QAAQhH,IAAIgH,UAAU1I;IACtB2I,OAAQjH,IAAIiH,SAAS3I;IACrBmJ,QAASzH,IAAIyH,UAAUnJ;IACvBoJ,UAAU1H,IAAI0H;IACdC,aAAa3H,IAAI2H,eAAerJ;IAChC2G,eAAejF,IAAIiF,iBAAiB3G;IACpC0D,QAAQ6E,WAAW7G,IAAIgC,MAAM;IAC7B4F,YAAY5H,IAAI4H,cAAc5H,IAAI6H;IAClCA,WAAW7H,IAAI6H;IACfC,YAAY9H,IAAI8H;EAClB;AACF;AApBSrH;;;AC1lBF,SAASsH,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;;AAEJ;AATgBA;","names":["namespaceWhere","namespace","undefined","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","runWhere","query","workflow","origin","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","listRuns","skip","offset","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","r","listCheckpoints","getLatestCheckpointByName","name","findFirst","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","bufferEvent","input","durableBufferedEvent","publishedAt","listBufferedEvents","Number","removeBufferedEvent","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","v","workflowVersion","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}
+{"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  RUN_VALUE_FACET_SCAN,\n  type RunFacetQuery,\n  type RunFacetRow,\n  type RunQuery,\n  type RunStatus,\n  type RunValueAxis,\n  type RunValueFacetOptions,\n  type RunValueFacetRow,\n  type SignalWaiter,\n  type StateStore,\n  type StepCheckpoint,\n  type StepError,\n  type StepEvent,\n  type WorkflowRun,\n  attributePredicateOperands,\n  axisIsRunColumn,\n  mergeRunFacetRows,\n  mergeRunValueFacetRows,\n  normalizeAttributeRows,\n  runValueFacetsFromRuns,\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  /** NOT NULL in the schema (defaulted to `'default'`), so every row carries a real namespace. */\n  namespace: string;\n  origin: string | 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\ninterface BufferedEventRow {\n  id: string;\n  name: string;\n  payload: unknown;\n  publishedAt: bigint;\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  /** Aggregate form — used only by `runFacets`, whose rows are `(status, origin, count)` cells, not\n   *  model rows, so the result type is stated at the call site rather than derived from `Row`. */\n  groupBy(args: Args): Promise<Record<string, unknown>[]>;\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  durableBufferedEvent: Delegate<BufferedEventRow>;\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 * The `namespace` read boundary as a spreadable Prisma `where` fragment.\n *\n * `undefined` means NO RESTRICTION — `{}` — because that is the operator (control-plane) view that\n * sees every tenant, and it is what the engine passes when it runs unscoped. It does NOT mean\n * \"namespace IS NULL\": the column is NOT NULL, so `{ namespace: undefined }` would be Prisma's\n * \"ignore this predicate\" anyway, but `{ namespace: null }` would match nothing in production while\n * still looking correct in a single-tenant test where every worker polls unscoped.\n *\n * A named namespace is plain equality, so a worker sees only its own tenant's rows — the boundary\n * {@link WorkflowRun.namespace} promises for the four worker paths (pick up, recover, resume timers,\n * time out).\n */\nfunction namespaceWhere(namespace?: string): { namespace?: string } {\n  if (namespace === undefined) return {};\n  return { namespace };\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 *\n * Every path a worker acts on is namespace-scoped when it is given one — `listPendingRuns` (pick up),\n * `listIncompleteRuns` (recover), `listDueTimers` (resume timers) and `listRuns`'s `namespace`\n * (the engine's timeout sweep). Omit it for the operator view across all tenants. Point-reads\n * (`getRun`, checkpoints) are deliberately NOT scoped, per {@link StateStore}.\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(namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: { in: ['running', 'cancelling'] }, ...namespaceWhere(namespace) },\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listPendingRuns(limit: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: 'pending', ...namespaceWhere(namespace) },\n      orderBy: { createdAt: 'asc' }, // FIFO dispatch\n      take: limit,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listDueTimers(nowMs: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: {\n        status: 'suspended',\n        wakeAt: { not: null, lte: BigInt(nowMs) },\n        ...namespaceWhere(namespace),\n      },\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  /** The `where` every run query shares — {@link listRuns} pages it, {@link runFacets} groups it. */\n  private runWhere(query: RunQuery): Record<string, unknown> {\n    // The tenant boundary, and NOT only a dashboard facet: the engine's `sweepTimeouts` finds the runs\n    // it may cancel through `listRuns({ workflow, status, namespace })`, so an unfiltered `namespace`\n    // here lets a worker serving one tenant time out another tenant's runs — a write, not a stale\n    // read. Same `undefined` = no restriction rule as the poll paths above (see `namespaceWhere`),\n    // which is what keeps the operator's dashboard showing every tenant by default.\n    const where: Record<string, unknown> = { ...namespaceWhere(query.namespace) };\n    // The plural predicates below can't sit on `where` directly (a key holds one condition, and the\n    // single form may already own it), so they accumulate here and are ANDed at the end. Each is ORed\n    // within itself and matches NOTHING when empty — the contract `statuses` already had.\n    const and: Record<string, unknown>[] = [];\n    if (query.workflow) where.workflow = query.workflow;\n    if (query.workflows) and.push(anyOf(query.workflows.map((w) => ({ workflow: w }))));\n    if (query.namespaces) and.push(anyOf(query.namespaces.map((n) => ({ namespace: n }))));\n    // Which library registered the workflow. Plain equality, so a run whose origin is NULL (created\n    // before the column existed, or registered through a path the derivation could not classify)\n    // matches NO origin value — it is never folded into a bucket to make the facet look complete.\n    // Unknown-origin runs are reachable only with the filter OFF, so \"all origins\" must stay the\n    // default view; a dashboard that filtered by default would make those runs look deleted.\n    // Passing `null` asks for exactly the unattributed bucket (`origin IS NULL`) — Prisma spells that\n    // as the same equality — which is how a paginated console can offer an \"unknown\" chip.\n    if (query.origin !== undefined) where.origin = query.origin;\n    // `null` is a member like any other in a set of origins — Prisma spells `origin IS NULL` as the\n    // same equality — so one branch per value covers both the named ones and the unattributed bucket.\n    if (query.origins) and.push(anyOf(query.origins.map((o) => ({ origin: o }))));\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      and.push({ 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    if (query.tags) and.push(anyOf(query.tags.map((t) => ({ tags: { array_contains: t } }))));\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) and.push(...query.attributes.map((f) => attributeSome(f)));\n    if (and.length) where.AND = and;\n    return where;\n  }\n\n  async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\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: this.runWhere(query),\n      take: query.limit,\n      skip: query.offset,\n      orderBy,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  /** `GROUP BY status, origin` over the same predicates {@link listRuns} pages — one aggregate, so a\n   *  console can show whole-set counts next to a bounded page instead of downloading every run to\n   *  count them in the browser. */\n  async runFacets(query: RunFacetQuery): Promise<RunFacetRow[]> {\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: ['status', 'origin'],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as { status: RunStatus; origin: string | null; _count: { _all: number } }[];\n    return mergeRunFacetRows(\n      rows.map((r) => ({ status: r.status, origin: r.origin, count: r._count._all })),\n    );\n  }\n\n  /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table\n   *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and\n   *  attribute axes live outside the row (json column / side table) and are counted from a bounded\n   *  page of runs instead — see `RunValueFacetOptions.scan`. */\n  async runValueFacets(\n    axis: RunValueAxis,\n    query: RunFacetQuery,\n    opts?: RunValueFacetOptions,\n  ): Promise<RunValueFacetRow[]> {\n    if (!axisIsRunColumn(axis)) {\n      const runs = await this.listRuns({ ...query, limit: opts?.scan ?? RUN_VALUE_FACET_SCAN });\n      return runValueFacetsFromRuns(runs, axis, opts);\n    }\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: [axis.field],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as (Record<string, string | null> & { _count: { _all: number } })[];\n    return mergeRunValueFacetRows(\n      rows.map((r) => ({ value: r[axis.field] ?? null, count: r._count._all })),\n      opts,\n    );\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 removeSignalWaiter(waiter: SignalWaiter): Promise<void> {\n    // Exact-match delete (token AND runId AND seq): `token` is the only unique column, so a plain\n    // `delete({ where: { token } })` would remove whatever row currently owns it, even if a different\n    // run has since claimed the same token — `deleteMany` with all three fields is a safe no-op then.\n    await this.db.durableSignalWaiter.deleteMany({\n      where: { token: waiter.token, runId: waiter.runId, seq: waiter.seq },\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  async bufferEvent(input: {\n    name: string;\n    payload: unknown;\n    id: string;\n    publishedAt: number;\n  }): Promise<void> {\n    await this.db.durableBufferedEvent.create({\n      data: {\n        id: input.id,\n        name: input.name,\n        payload: jsonOrNull(input.payload),\n        publishedAt: BigInt(input.publishedAt),\n      },\n    });\n  }\n\n  async listBufferedEvents(\n    name: string,\n    limit: number,\n  ): Promise<Array<{ id: string; payload: unknown; publishedAt: number }>> {\n    const rows = await this.db.durableBufferedEvent.findMany({\n      where: { name },\n      orderBy: { publishedAt: 'asc' }, // oldest first\n      take: limit,\n    });\n    return rows.map((r) => ({\n      id: r.id,\n      payload: r.payload ?? undefined,\n      publishedAt: Number(r.publishedAt),\n    }));\n  }\n\n  async removeBufferedEvent(id: string): Promise<boolean> {\n    // deleteMany's `where: { id }` matches at most one row (id is the PK) and is a safe no-op if it's\n    // already gone — unlike `delete({ where: { id } })`, which throws P2025 on a missing row (the same\n    // reasoning as releaseRunLock's updateMany above).\n    const result = await this.db.durableBufferedEvent.deleteMany({ where: { id } });\n    return result.count === 1;\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): Record<string, unknown> {\n  // One comparison for a scalar op, one per member for `in` — ORed inside the single `some`, since\n  // `in`'s operands may be of mixed types and so land in different typed columns. No comparisons at\n  // all (an `in` over no values) can match no run, which is a run-level fact, not a side-table one.\n  const comparisons = attributePredicateOperands(f).map(({ column, comparator, operand }) => ({\n    [column]:\n      comparator === '=' ? operand : comparator === '<>' ? { not: operand } : { [f.op]: operand },\n  }));\n  if (comparisons.length === 0) return MATCHES_NOTHING;\n  return { attributes: { some: { key: f.key, ...anyOf(comparisons) } } };\n}\n\n/** A where fragment no run satisfies — what a plural predicate over an EMPTY set means. Spelled as an\n *  impossible `id` rather than `OR: []` so it does not depend on how a Prisma version reads an empty\n *  disjunction. */\nconst MATCHES_NOTHING: Record<string, unknown> = { id: { in: [] as string[] } };\n\n/** OR a set of where fragments, where an EMPTY set matches nothing rather than everything. */\nfunction anyOf(branches: Record<string, unknown>[]): Record<string, unknown> {\n  return branches.length ? { OR: branches } : MATCHES_NOTHING;\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    // An absent namespace IS `'default'` — unlike `origin` below, this is a reconstruction and not a\n    // guess: an engine started without a namespace stamps its runs and routes its workers as\n    // `'default'`, so writing anything else (or NULL) would put the run in a partition no worker polls.\n    namespace: run.namespace ?? 'default',\n    // Absent origin stays SQL NULL — \"unknown\", never coerced into a real-looking library name.\n    origin: run.origin ?? 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  // `?? 'default'` rather than `?? null` like its neighbours: the column is NOT NULL, and clearing a\n  // run's namespace means \"back to the unscoped partition\", which is what `'default'` names. A patch\n  // that does not mention `namespace` leaves the stored one alone — a status update must never move a\n  // run between tenants.\n  if ('namespace' in patch) data.namespace = patch.namespace ?? 'default';\n  if ('origin' in patch) data.origin = patch.origin ?? 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    // Read back verbatim, with NO `?? 'default'` fallback. The column is NOT NULL and the migration\n    // back-fills old rows, so there is nothing legitimate to fall back FROM; a fallback would only fire\n    // on a deployment that added the column nullable without back-filling, and there it would lie —\n    // the dashboard would show `default` for a row whose stored NULL keeps every `default` worker's\n    // `WHERE namespace = 'default'` from ever picking it up.\n    namespace: row.namespace,\n    // NULL (a row written before the column existed) surfaces as `undefined` = unknown origin.\n    origin: row.origin ?? 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    'durable_buffered_events',\n  ];\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACAA,iCAsBO;AA4HP,SAASA,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EAjKb,OAiKaA;;;;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,mBAAmB/C,WAA4C;AACnE,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGnD,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOsB,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAerD,WAA4C;AAC/E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAW,GAAGlD,eAAeC,SAAAA;MAAW;MACzDsD,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAe1D,WAA4C;AAC7E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QACLgC,QAAQ;QACRU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;QACxC,GAAG3D,eAAeC,SAAAA;MACpB;IACF,CAAA;AACA,WAAOsB,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;;EAGQG,SAASC,OAA0C;AAMzD,UAAM3D,QAAiC;MAAE,GAAGlB,eAAe6E,MAAM5E,SAAS;IAAE;AAI5E,UAAM6E,MAAiC,CAAA;AACvC,QAAID,MAAME,SAAU7D,OAAM6D,WAAWF,MAAME;AAC3C,QAAIF,MAAMG,UAAWF,KAAIG,KAAKC,MAAML,MAAMG,UAAU5B,IAAI,CAAC+B,OAAO;MAAEJ,UAAUI;IAAE,EAAA,CAAA,CAAA;AAC9E,QAAIN,MAAMO,WAAYN,KAAIG,KAAKC,MAAML,MAAMO,WAAWhC,IAAI,CAACiC,OAAO;MAAEpF,WAAWoF;IAAE,EAAA,CAAA,CAAA;AAQjF,QAAIR,MAAMS,WAAWpF,OAAWgB,OAAMoE,SAAST,MAAMS;AAGrD,QAAIT,MAAMU,QAAST,KAAIG,KAAKC,MAAML,MAAMU,QAAQnC,IAAI,CAACoC,OAAO;MAAEF,QAAQE;IAAE,EAAA,CAAA,CAAA;AAGxE,QAAIX,MAAM3B,UAAU2B,MAAMY,UAAU;AAClCX,UAAIG,KAAK;QAAE/B,QAAQ2B,MAAM3B;MAAO,GAAG;QAAEA,QAAQ;UAAEC,IAAI0B,MAAMY;QAAS;MAAE,CAAA;IACtE,WAAWZ,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAMY,UAAU;AACzBvE,YAAMgC,SAAS;QAAEC,IAAI0B,MAAMY;MAAS;IACtC;AACA,QAAIZ,MAAMa,IAAKxE,OAAMyE,OAAO;MAAEC,gBAAgBf,MAAMa;IAAI;AACxD,QAAIb,MAAMc,KAAMb,KAAIG,KAAKC,MAAML,MAAMc,KAAKvC,IAAI,CAACyC,OAAO;MAAEF,MAAM;QAAEC,gBAAgBC;MAAE;IAAE,EAAA,CAAA,CAAA;AAIpF,QAAIhB,MAAMzD,YAAYK,OAAQqD,KAAIG,KAAI,GAAIJ,MAAMzD,WAAWgC,IAAI,CAAC0C,MAAMC,cAAcD,CAAAA,CAAAA,CAAAA;AACpF,QAAIhB,IAAIrD,OAAQP,OAAM8E,MAAMlB;AAC5B,WAAO5D;EACT;EAEA,MAAM+E,SAASpB,OAAyC;AACtD,UAAMtB,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO,KAAK0D,SAASC,KAAAA;MACrBpB,MAAMoB,MAAMvB;MACZ4C,MAAMrB,MAAMsB;MACZ5C;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;;;;EAKA,MAAMsE,UAAUvB,OAA8C;AAC5D,UAAMtD,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmB8F,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACfpF,OAAO,KAAK0D,SAASC,KAAAA;MACrB0B,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOC,8CACLlF,KAAK6B,IAAI,CAACsD,OAAO;MAAExD,QAAQwD,EAAExD;MAAQoC,QAAQoB,EAAEpB;MAAQb,OAAOiC,EAAEH,OAAOC;IAAK,EAAA,CAAA;EAEhF;;;;;EAMA,MAAMG,eACJC,MACA/B,OACAgC,MAC6B;AAC7B,QAAI,KAACC,4CAAgBF,IAAAA,GAAO;AAC1B,YAAMG,OAAO,MAAM,KAAKd,SAAS;QAAE,GAAGpB;QAAOvB,OAAOuD,MAAMG,QAAQC;MAAqB,CAAA;AACvF,iBAAOC,mDAAuBH,MAAMH,MAAMC,IAAAA;IAC5C;AACA,UAAMtF,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmB8F,QAAQ;MACrDC,IAAI;QAACM,KAAKO;;MACVjG,OAAO,KAAK0D,SAASC,KAAAA;MACrB0B,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOY,mDACL7F,KAAK6B,IAAI,CAACsD,OAAO;MAAEW,OAAOX,EAAEE,KAAKO,KAAK,KAAK;MAAM1C,OAAOiC,EAAEH,OAAOC;IAAK,EAAA,GACtEK,IAAAA;EAEJ;EAEA,MAAMS,gBAAgBvG,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,MAAMkF,0BACJxG,OACAyG,MACqC;AACrC,UAAM5F,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsByF,UAAU;MACxDvG,OAAO;QAAEH;QAAOyG;MAAK;MACrBjE,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO1B;EACxC;EAEA,MAAMwH,4BAA4B3G,OAAe4G,UAA+C;AAC9F,QAAIA,SAASlG,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAIsD,SAASvE,IAAI,CAACwE,OAAO;UAAEJ,MAAM;YAAEK,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvErE,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMyF,gBAAgBC,QAAqC;AACzD,UAAM,KAAK3H,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAE8G,OAAOD,OAAOC;MAAM;MAC7BxH,QAAQ;QACNwH,OAAOD,OAAOC;QACdjH,OAAOgH,OAAOhH;QACdoB,KAAK4F,OAAO5F;QACZ8F,eAAeF,OAAOE,iBAAiB;MACzC;MACAhH,QAAQ;QACNF,OAAOgH,OAAOhH;QACdoB,KAAK4F,OAAO5F;QACZ8F,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMpG,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAE8G;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACpG,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBkG,OAAO;MAAEjH,OAAO;QAAE8G;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOpG,IAAIoG;MACXjH,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACT8F,eAAerG,IAAIqG,iBAAiB/H;IACtC;EACF;EAEA,MAAMkI,kBAAkBC,QAAyC;AAC/D,UAAM9G,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAE8G,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAO9G,KAAK6B,IAAI,CAACsD,OAAO;MACtBsB,OAAOtB,EAAEsB;MACTjH,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACP8F,eAAevB,EAAEuB,iBAAiB/H;IACpC,EAAA;EACF;EAEA,MAAMoI,mBAAmBP,QAAqC;AAI5D,UAAM,KAAK3H,GAAG6B,oBAAoBX,WAAW;MAC3CJ,OAAO;QAAE8G,OAAOD,OAAOC;QAAOjH,OAAOgH,OAAOhH;QAAOoB,KAAK4F,OAAO5F;MAAI;IACrE,CAAA;EACF;EAEA,MAAMoG,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKpI,GAAGqI,sBAAsBjI,OAAO;MAAEC,MAAM;QAAEuH;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMpG,MAAM,MAAM,KAAKxB,GAAGqI,sBAAsBhB,UAAU;MACxDvG,OAAO;QAAE8G;MAAM;MACfzE,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGqI,sBAAsBN,OAAO;MAAEjH,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAE4H,SAAS5G,IAAI4G,WAAWtI;IAAU;EAC7C;EAEA,MAAM0I,YAAYC,OAKA;AAChB,UAAM,KAAKzI,GAAG0I,qBAAqBtI,OAAO;MACxCC,MAAM;QACJG,IAAIiI,MAAMjI;QACV4G,MAAMqB,MAAMrB;QACZgB,SAASE,WAAWG,MAAML,OAAO;QACjCO,aAAahF,OAAO8E,MAAME,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJxB,MACAlE,OACuE;AACvE,UAAM/B,OAAO,MAAM,KAAKnB,GAAG0I,qBAAqB7F,SAAS;MACvD/B,OAAO;QAAEsG;MAAK;MACdjE,SAAS;QAAEwF,aAAa;MAAM;MAC9BtF,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAI,CAACsD,OAAO;MACtB9F,IAAI8F,EAAE9F;MACN4H,SAAS9B,EAAE8B,WAAWtI;MACtB6I,aAAaE,OAAOvC,EAAEqC,WAAW;IACnC,EAAA;EACF;EAEA,MAAMG,oBAAoBtI,IAA8B;AAItD,UAAMuD,SAAS,MAAM,KAAK/D,GAAG0I,qBAAqBxH,WAAW;MAAEJ,OAAO;QAAEN;MAAG;IAAE,CAAA;AAC7E,WAAOuD,OAAOM,UAAU;EAC1B;AACF;AAQA,SAASsB,cAAcD,GAAkB;AAIvC,QAAMqD,kBAAcC,uDAA2BtD,CAAAA,EAAG1C,IAAI,CAAC,EAAEiG,QAAQC,YAAYC,QAAO,OAAQ;IAC1F,CAACF,MAAAA,GACCC,eAAe,MAAMC,UAAUD,eAAe,OAAO;MAAEzF,KAAK0F;IAAQ,IAAI;MAAE,CAACzD,EAAE0D,EAAE,GAAGD;IAAQ;EAC9F,EAAA;AACA,MAAIJ,YAAY1H,WAAW,EAAG,QAAOgI;AACrC,SAAO;IAAErI,YAAY;MAAEsI,MAAM;QAAEC,KAAK7D,EAAE6D;QAAK,GAAGzE,MAAMiE,WAAAA;MAAa;IAAE;EAAE;AACvE;AAVSpD;AAeT,IAAM0D,kBAA2C;EAAE7I,IAAI;IAAEuC,IAAI,CAAA;EAAe;AAAE;AAG9E,SAAS+B,MAAM0E,UAAmC;AAChD,SAAOA,SAASnI,SAAS;IAAE4C,IAAIuF;EAAS,IAAIH;AAC9C;AAFSvE;AAIT,IAAM2E,YAAY,wBAACxE,MAA2BA,KAAK,OAAO,OAAOtB,OAAOsB,CAAAA,GAAtD;AAClB,IAAMyE,aAAa,wBAACzE,MAAsBA,KAAK,OAAOnF,SAAY+I,OAAO5D,CAAAA,GAAtD;AACnB,IAAMqD,aAAa,wBAACqB,MAAeA,KAAK,MAArB;AAEnB,SAASrJ,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRmE,UAAUzE,IAAIyE;IACdiF,iBAAiB1J,IAAI0J;IACrB9G,QAAQ5C,IAAI4C;IACZ2F,OAAOH,WAAWpI,IAAIuI,KAAK;IAC3BoB,QAAQvB,WAAWpI,IAAI2J,MAAM;IAC7BC,OAAOxB,WAAWpI,IAAI4J,KAAK;IAC3BtG,QAAQiG,UAAUvJ,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE6F,wBAAwB7J,IAAI6J,0BAA0B;IACtDC,kBAAkB9J,IAAI8J,oBAAoB;IAC1CzE,MAAM+C,WAAWpI,IAAIqF,IAAI;IACzB9E,kBAAkB6H,WAAWpI,IAAIO,gBAAgB;IACjDwJ,UAAU/J,IAAI+J,YAAY;;;;IAI1BpK,WAAWK,IAAIL,aAAa;;IAE5BqF,QAAQhF,IAAIgF,UAAU;IACtB9B,WAAWlD,IAAIkD;IACf8G,WAAWhK,IAAIgK;EACjB;AACF;AA1BS5J;AA4BT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKsE,WAAW/D,MAAM+D;AAC/C,MAAI,qBAAqB/D,MAAOP,MAAKuJ,kBAAkBhJ,MAAMgJ;AAC7D,MAAI,YAAYhJ,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKoI,QAAQH,WAAW1H,MAAM6H,KAAK;AACzD,MAAI,YAAY7H,MAAOP,MAAKwJ,SAASvB,WAAW1H,MAAMiJ,MAAM;AAC5D,MAAI,WAAWjJ,MAAOP,MAAKyJ,QAAQxB,WAAW1H,MAAMkJ,KAAK;AACzD,MAAI,YAAYlJ,MAAOP,MAAKmD,SAASiG,UAAU7I,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,MAAK0J,yBAAyBnJ,MAAMmJ,0BAA0B;AAChE,MAAI,sBAAsBnJ,MAAOP,MAAK2J,mBAAmBpJ,MAAMoJ,oBAAoB;AACnF,MAAI,UAAUpJ,MAAOP,MAAKkF,OAAO+C,WAAW1H,MAAM2E,IAAI;AACtD,MAAI,sBAAsB3E,MAAOP,MAAKI,mBAAmB6H,WAAW1H,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAK4J,WAAWrJ,MAAMqJ,YAAY;AAK3D,MAAI,eAAerJ,MAAOP,MAAKR,YAAYe,MAAMf,aAAa;AAC9D,MAAI,YAAYe,MAAOP,MAAK6E,SAAStE,MAAMsE,UAAU;AACrD,MAAItE,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMsJ,aAAa,KAAM7J,MAAK6J,YAAYtJ,MAAMsJ;AACpD,SAAO7J;AACT;AAhCSU;AAkCT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRmE,UAAUnD,IAAImD;IACdiF,iBAAiBpI,IAAIoI;IACrB9G,QAAQtB,IAAIsB;IACZ2F,OAAOjH,IAAIiH,SAAS3I;IACpB+J,QAAQrI,IAAIqI,UAAU/J;IACtBgK,OAAQtI,IAAIsI,SAAShK;IACrB0D,QAAQkG,WAAWlI,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYtE;IAC1BoE,aAAa1C,IAAI0C,eAAe,OAAOpE,SAAY0B,IAAI0C,YAAYiG,QAAO;IAC1EJ,wBAAwBvI,IAAIuI,0BAA0BjK;IACtDkK,kBAAkBxI,IAAIwI,oBAAoBlK;IAC1CyF,MAAO/D,IAAI+D,QAA4BzF;IACvCW,kBACGe,IAAIf,oBAAyEX;IAChFmK,UAAUzI,IAAIyI,YAAYnK;;;;;;IAM1BD,WAAW2B,IAAI3B;;IAEfqF,QAAQ1D,IAAI0D,UAAUpF;IACtBsD,WAAW5B,IAAI4B;IACf8G,WAAW1I,IAAI0I;EACjB;AACF;AA7BSxI;AA+BT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRqF,MAAMzE,GAAGyE;IACTgD,MAAMzH,GAAGyH;IACTC,QAAQ1H,GAAG0H;IACXvH,QAAQH,GAAGG;IACX2F,OAAOH,WAAW3F,GAAG8F,KAAK;IAC1BoB,QAAQvB,WAAW3F,GAAGkH,MAAM;IAC5BC,OAAOxB,WAAW3F,GAAGmH,KAAK;IAC1BQ,QAAQhC,WAAW3F,GAAG2H,MAAM;IAC5BC,UAAU5H,GAAG4H;IACbC,aAAa7H,GAAG6H,eAAe;IAC/B3C,eAAelF,GAAGkF,iBAAiB;IACnCrE,QAAQiG,UAAU9G,GAAGa,MAAM;IAC3BiH,YAAY9H,GAAG8H;IACfC,WAAW/H,GAAG+H;IACdC,YAAYhI,GAAGgI;EACjB;AACF;AApBSvI;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTqF,MAAM5F,IAAI4F;IACVgD,MAAM5I,IAAI4I;IACVC,QAAQ7I,IAAI6I;IACZvH,QAAQtB,IAAIsB;IACZ2F,OAAOjH,IAAIiH,SAAS3I;IACpB+J,QAAQrI,IAAIqI,UAAU/J;IACtBgK,OAAQtI,IAAIsI,SAAShK;IACrBwK,QAAS9I,IAAI8I,UAAUxK;IACvByK,UAAU/I,IAAI+I;IACdC,aAAahJ,IAAIgJ,eAAe1K;IAChC+H,eAAerG,IAAIqG,iBAAiB/H;IACpC0D,QAAQkG,WAAWlI,IAAIgC,MAAM;IAC7BiH,YAAYjJ,IAAIiJ,cAAcjJ,IAAIkJ;IAClCA,WAAWlJ,IAAIkJ;IACfC,YAAYnJ,IAAImJ;EAClB;AACF;AApBS1I;;;AC9oBF,SAAS2I,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;;AAEJ;AATgBA;","names":["namespaceWhere","namespace","undefined","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","runWhere","query","and","workflow","workflows","push","anyOf","w","namespaces","n","origin","origins","o","statuses","tag","tags","array_contains","t","f","attributeSome","AND","listRuns","skip","offset","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","r","runValueFacets","axis","opts","axisIsRunColumn","runs","scan","RUN_VALUE_FACET_SCAN","runValueFacetsFromRuns","field","mergeRunValueFacetRows","value","listCheckpoints","getLatestCheckpointByName","name","findFirst","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","bufferEvent","input","durableBufferedEvent","publishedAt","listBufferedEvents","Number","removeBufferedEvent","comparisons","attributePredicateOperands","column","comparator","operand","op","MATCHES_NOTHING","some","key","branches","bigOrNull","numOrUndef","v","workflowVersion","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-import { StateStore, WorkflowRun, StepCheckpoint, RunQuery, RunFacetQuery, RunFacetRow, SignalWaiter } from '@dudousxd/nestjs-durable-core';
+import { StateStore, WorkflowRun, StepCheckpoint, RunQuery, RunFacetQuery, RunFacetRow, RunValueAxis, RunValueFacetOptions, RunValueFacetRow, SignalWaiter } from '@dudousxd/nestjs-durable-core';
 
 interface RunRow {
     id: string;
@@ -137,6 +137,11 @@ declare class PrismaStateStore implements StateStore {
      *  console can show whole-set counts next to a bounded page instead of downloading every run to
      *  count them in the browser. */
     runFacets(query: RunFacetQuery): Promise<RunFacetRow[]>;
+    /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table
+     *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and
+     *  attribute axes live outside the row (json column / side table) and are counted from a bounded
+     *  page of runs instead — see `RunValueFacetOptions.scan`. */
+    runValueFacets(axis: RunValueAxis, query: RunFacetQuery, opts?: RunValueFacetOptions): Promise<RunValueFacetRow[]>;
     listCheckpoints(runId: string): Promise<StepCheckpoint[]>;
     getLatestCheckpointByName(runId: string, name: string): Promise<StepCheckpoint | undefined>;
     listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]>;

package/dist/index.d.ts

@@ -1,4 +1,4 @@
-import { StateStore, WorkflowRun, StepCheckpoint, RunQuery, RunFacetQuery, RunFacetRow, SignalWaiter } from '@dudousxd/nestjs-durable-core';
+import { StateStore, WorkflowRun, StepCheckpoint, RunQuery, RunFacetQuery, RunFacetRow, RunValueAxis, RunValueFacetOptions, RunValueFacetRow, SignalWaiter } from '@dudousxd/nestjs-durable-core';
 
 interface RunRow {
     id: string;
@@ -137,6 +137,11 @@ declare class PrismaStateStore implements StateStore {
      *  console can show whole-set counts next to a bounded page instead of downloading every run to
      *  count them in the browser. */
     runFacets(query: RunFacetQuery): Promise<RunFacetRow[]>;
+    /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table
+     *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and
+     *  attribute axes live outside the row (json column / side table) and are counted from a bounded
+     *  page of runs instead — see `RunValueFacetOptions.scan`. */
+    runValueFacets(axis: RunValueAxis, query: RunFacetQuery, opts?: RunValueFacetOptions): Promise<RunValueFacetRow[]>;
     listCheckpoints(runId: string): Promise<StepCheckpoint[]>;
     getLatestCheckpointByName(runId: string, name: string): Promise<StepCheckpoint | undefined>;
     listCheckpointsByNamePrefix(runId: string, prefixes: string[]): Promise<StepCheckpoint[]>;

package/dist/index.js

@@ -2,7 +2,7 @@ var __defProp = Object.defineProperty;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
 
 // src/prisma-state-store.ts
-import { attributeColumnFor, attributeOperand, mergeRunFacetRows, normalizeAttributeRows } from "@dudousxd/nestjs-durable-core";
+import { RUN_VALUE_FACET_SCAN, attributePredicateOperands, axisIsRunColumn, mergeRunFacetRows, mergeRunValueFacetRows, normalizeAttributeRows, runValueFacetsFromRuns } from "@dudousxd/nestjs-durable-core";
 function namespaceWhere(namespace) {
   if (namespace === void 0) return {};
   return {
@@ -208,19 +208,26 @@ var PrismaStateStore = class {
     const where = {
       ...namespaceWhere(query.namespace)
     };
+    const and = [];
     if (query.workflow) where.workflow = query.workflow;
+    if (query.workflows) and.push(anyOf(query.workflows.map((w) => ({
+      workflow: w
+    }))));
+    if (query.namespaces) and.push(anyOf(query.namespaces.map((n) => ({
+      namespace: n
+    }))));
     if (query.origin !== void 0) where.origin = query.origin;
+    if (query.origins) and.push(anyOf(query.origins.map((o) => ({
+      origin: o
+    }))));
     if (query.status && query.statuses) {
-      where.AND = [
-        {
-          status: query.status
-        },
-        {
-          status: {
-            in: query.statuses
-          }
+      and.push({
+        status: query.status
+      }, {
+        status: {
+          in: query.statuses
         }
-      ];
+      });
     } else if (query.status) {
       where.status = query.status;
     } else if (query.statuses) {
@@ -231,13 +238,13 @@ var PrismaStateStore = class {
     if (query.tag) where.tags = {
       array_contains: query.tag
     };
-    if (query.attributes?.length) {
-      const existing = where.AND ?? [];
-      where.AND = [
-        ...existing,
-        ...query.attributes.map((f) => attributeSome(f))
-      ];
-    }
+    if (query.tags) and.push(anyOf(query.tags.map((t) => ({
+      tags: {
+        array_contains: t
+      }
+    }))));
+    if (query.attributes?.length) and.push(...query.attributes.map((f) => attributeSome(f)));
+    if (and.length) where.AND = and;
     return where;
   }
   async listRuns(query) {
@@ -272,6 +279,32 @@ var PrismaStateStore = class {
       count: r._count._all
     })));
   }
+  /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table
+  *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and
+  *  attribute axes live outside the row (json column / side table) and are counted from a bounded
+  *  page of runs instead — see `RunValueFacetOptions.scan`. */
+  async runValueFacets(axis, query, opts) {
+    if (!axisIsRunColumn(axis)) {
+      const runs = await this.listRuns({
+        ...query,
+        limit: opts?.scan ?? RUN_VALUE_FACET_SCAN
+      });
+      return runValueFacetsFromRuns(runs, axis, opts);
+    }
+    const rows = await this.db.durableWorkflowRun.groupBy({
+      by: [
+        axis.field
+      ],
+      where: this.runWhere(query),
+      _count: {
+        _all: true
+      }
+    });
+    return mergeRunValueFacetRows(rows.map((r) => ({
+      value: r[axis.field] ?? null,
+      count: r._count._all
+    })), opts);
+  }
   async listCheckpoints(runId) {
     const rows = await this.db.durableStepCheckpoint.findMany({
       where: {
@@ -436,23 +469,35 @@ var PrismaStateStore = class {
   }
 };
 function attributeSome(f) {
-  const col = attributeColumnFor(f);
-  const operand = attributeOperand(f);
-  const condition = f.op === "eq" ? operand : f.op === "ne" ? {
-    not: operand
-  } : {
-    [f.op]: operand
-  };
+  const comparisons = attributePredicateOperands(f).map(({ column, comparator, operand }) => ({
+    [column]: comparator === "=" ? operand : comparator === "<>" ? {
+      not: operand
+    } : {
+      [f.op]: operand
+    }
+  }));
+  if (comparisons.length === 0) return MATCHES_NOTHING;
   return {
     attributes: {
       some: {
         key: f.key,
-        [col]: condition
+        ...anyOf(comparisons)
       }
     }
   };
 }
 __name(attributeSome, "attributeSome");
+var MATCHES_NOTHING = {
+  id: {
+    in: []
+  }
+};
+function anyOf(branches) {
+  return branches.length ? {
+    OR: branches
+  } : MATCHES_NOTHING;
+}
+__name(anyOf, "anyOf");
 var bigOrNull = /* @__PURE__ */ __name((n) => n == null ? null : BigInt(n), "bigOrNull");
 var numOrUndef = /* @__PURE__ */ __name((n) => n == null ? void 0 : Number(n), "numOrUndef");
 var jsonOrNull = /* @__PURE__ */ __name((v) => v ?? null, "jsonOrNull");

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/prisma-state-store.ts","../src/schema.ts"],"sourcesContent":["import {\n  type AttributeFilter,\n  type RunFacetQuery,\n  type RunFacetRow,\n  type RunQuery,\n  type RunStatus,\n  type SignalWaiter,\n  type StateStore,\n  type StepCheckpoint,\n  type StepError,\n  type StepEvent,\n  type WorkflowRun,\n  attributeColumnFor,\n  attributeOperand,\n  mergeRunFacetRows,\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  /** NOT NULL in the schema (defaulted to `'default'`), so every row carries a real namespace. */\n  namespace: string;\n  origin: string | 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\ninterface BufferedEventRow {\n  id: string;\n  name: string;\n  payload: unknown;\n  publishedAt: bigint;\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  /** Aggregate form — used only by `runFacets`, whose rows are `(status, origin, count)` cells, not\n   *  model rows, so the result type is stated at the call site rather than derived from `Row`. */\n  groupBy(args: Args): Promise<Record<string, unknown>[]>;\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  durableBufferedEvent: Delegate<BufferedEventRow>;\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 * The `namespace` read boundary as a spreadable Prisma `where` fragment.\n *\n * `undefined` means NO RESTRICTION — `{}` — because that is the operator (control-plane) view that\n * sees every tenant, and it is what the engine passes when it runs unscoped. It does NOT mean\n * \"namespace IS NULL\": the column is NOT NULL, so `{ namespace: undefined }` would be Prisma's\n * \"ignore this predicate\" anyway, but `{ namespace: null }` would match nothing in production while\n * still looking correct in a single-tenant test where every worker polls unscoped.\n *\n * A named namespace is plain equality, so a worker sees only its own tenant's rows — the boundary\n * {@link WorkflowRun.namespace} promises for the four worker paths (pick up, recover, resume timers,\n * time out).\n */\nfunction namespaceWhere(namespace?: string): { namespace?: string } {\n  if (namespace === undefined) return {};\n  return { namespace };\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 *\n * Every path a worker acts on is namespace-scoped when it is given one — `listPendingRuns` (pick up),\n * `listIncompleteRuns` (recover), `listDueTimers` (resume timers) and `listRuns`'s `namespace`\n * (the engine's timeout sweep). Omit it for the operator view across all tenants. Point-reads\n * (`getRun`, checkpoints) are deliberately NOT scoped, per {@link StateStore}.\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(namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: { in: ['running', 'cancelling'] }, ...namespaceWhere(namespace) },\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listPendingRuns(limit: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: 'pending', ...namespaceWhere(namespace) },\n      orderBy: { createdAt: 'asc' }, // FIFO dispatch\n      take: limit,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listDueTimers(nowMs: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: {\n        status: 'suspended',\n        wakeAt: { not: null, lte: BigInt(nowMs) },\n        ...namespaceWhere(namespace),\n      },\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  /** The `where` every run query shares — {@link listRuns} pages it, {@link runFacets} groups it. */\n  private runWhere(query: RunQuery): Record<string, unknown> {\n    // The tenant boundary, and NOT only a dashboard facet: the engine's `sweepTimeouts` finds the runs\n    // it may cancel through `listRuns({ workflow, status, namespace })`, so an unfiltered `namespace`\n    // here lets a worker serving one tenant time out another tenant's runs — a write, not a stale\n    // read. Same `undefined` = no restriction rule as the poll paths above (see `namespaceWhere`),\n    // which is what keeps the operator's dashboard showing every tenant by default.\n    const where: Record<string, unknown> = { ...namespaceWhere(query.namespace) };\n    if (query.workflow) where.workflow = query.workflow;\n    // Which library registered the workflow. Plain equality, so a run whose origin is NULL (created\n    // before the column existed, or registered through a path the derivation could not classify)\n    // matches NO origin value — it is never folded into a bucket to make the facet look complete.\n    // Unknown-origin runs are reachable only with the filter OFF, so \"all origins\" must stay the\n    // default view; a dashboard that filtered by default would make those runs look deleted.\n    // Passing `null` asks for exactly the unattributed bucket (`origin IS NULL`) — Prisma spells that\n    // as the same equality — which is how a paginated console can offer an \"unknown\" chip.\n    if (query.origin !== undefined) where.origin = query.origin;\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    return where;\n  }\n\n  async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\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: this.runWhere(query),\n      take: query.limit,\n      skip: query.offset,\n      orderBy,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  /** `GROUP BY status, origin` over the same predicates {@link listRuns} pages — one aggregate, so a\n   *  console can show whole-set counts next to a bounded page instead of downloading every run to\n   *  count them in the browser. */\n  async runFacets(query: RunFacetQuery): Promise<RunFacetRow[]> {\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: ['status', 'origin'],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as { status: RunStatus; origin: string | null; _count: { _all: number } }[];\n    return mergeRunFacetRows(\n      rows.map((r) => ({ status: r.status, origin: r.origin, count: r._count._all })),\n    );\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 removeSignalWaiter(waiter: SignalWaiter): Promise<void> {\n    // Exact-match delete (token AND runId AND seq): `token` is the only unique column, so a plain\n    // `delete({ where: { token } })` would remove whatever row currently owns it, even if a different\n    // run has since claimed the same token — `deleteMany` with all three fields is a safe no-op then.\n    await this.db.durableSignalWaiter.deleteMany({\n      where: { token: waiter.token, runId: waiter.runId, seq: waiter.seq },\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  async bufferEvent(input: {\n    name: string;\n    payload: unknown;\n    id: string;\n    publishedAt: number;\n  }): Promise<void> {\n    await this.db.durableBufferedEvent.create({\n      data: {\n        id: input.id,\n        name: input.name,\n        payload: jsonOrNull(input.payload),\n        publishedAt: BigInt(input.publishedAt),\n      },\n    });\n  }\n\n  async listBufferedEvents(\n    name: string,\n    limit: number,\n  ): Promise<Array<{ id: string; payload: unknown; publishedAt: number }>> {\n    const rows = await this.db.durableBufferedEvent.findMany({\n      where: { name },\n      orderBy: { publishedAt: 'asc' }, // oldest first\n      take: limit,\n    });\n    return rows.map((r) => ({\n      id: r.id,\n      payload: r.payload ?? undefined,\n      publishedAt: Number(r.publishedAt),\n    }));\n  }\n\n  async removeBufferedEvent(id: string): Promise<boolean> {\n    // deleteMany's `where: { id }` matches at most one row (id is the PK) and is a safe no-op if it's\n    // already gone — unlike `delete({ where: { id } })`, which throws P2025 on a missing row (the same\n    // reasoning as releaseRunLock's updateMany above).\n    const result = await this.db.durableBufferedEvent.deleteMany({ where: { id } });\n    return result.count === 1;\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    // An absent namespace IS `'default'` — unlike `origin` below, this is a reconstruction and not a\n    // guess: an engine started without a namespace stamps its runs and routes its workers as\n    // `'default'`, so writing anything else (or NULL) would put the run in a partition no worker polls.\n    namespace: run.namespace ?? 'default',\n    // Absent origin stays SQL NULL — \"unknown\", never coerced into a real-looking library name.\n    origin: run.origin ?? 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  // `?? 'default'` rather than `?? null` like its neighbours: the column is NOT NULL, and clearing a\n  // run's namespace means \"back to the unscoped partition\", which is what `'default'` names. A patch\n  // that does not mention `namespace` leaves the stored one alone — a status update must never move a\n  // run between tenants.\n  if ('namespace' in patch) data.namespace = patch.namespace ?? 'default';\n  if ('origin' in patch) data.origin = patch.origin ?? 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    // Read back verbatim, with NO `?? 'default'` fallback. The column is NOT NULL and the migration\n    // back-fills old rows, so there is nothing legitimate to fall back FROM; a fallback would only fire\n    // on a deployment that added the column nullable without back-filling, and there it would lie —\n    // the dashboard would show `default` for a row whose stored NULL keeps every `default` worker's\n    // `WHERE namespace = 'default'` from ever picking it up.\n    namespace: row.namespace,\n    // NULL (a row written before the column existed) surfaces as `undefined` = unknown origin.\n    origin: row.origin ?? 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    'durable_buffered_events',\n  ];\n}\n"],"mappings":";;;;AAAA,SAYEA,oBACAC,kBACAC,mBACAC,8BACK;AA4HP,SAASC,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EA3Jb,OA2JaA;;;;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,mBAAmB/C,WAA4C;AACnE,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGnD,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOsB,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAerD,WAA4C;AAC/E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAW,GAAGlD,eAAeC,SAAAA;MAAW;MACzDsD,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAe1D,WAA4C;AAC7E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QACLgC,QAAQ;QACRU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;QACxC,GAAG3D,eAAeC,SAAAA;MACpB;IACF,CAAA;AACA,WAAOsB,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;;EAGQG,SAASC,OAA0C;AAMzD,UAAM3D,QAAiC;MAAE,GAAGlB,eAAe6E,MAAM5E,SAAS;IAAE;AAC5E,QAAI4E,MAAMC,SAAU5D,OAAM4D,WAAWD,MAAMC;AAQ3C,QAAID,MAAME,WAAW7E,OAAWgB,OAAM6D,SAASF,MAAME;AAGrD,QAAIF,MAAM3B,UAAU2B,MAAMG,UAAU;AAClC9D,YAAM+D,MAAM;QAAC;UAAE/B,QAAQ2B,MAAM3B;QAAO;QAAG;UAAEA,QAAQ;YAAEC,IAAI0B,MAAMG;UAAS;QAAE;;IAC1E,WAAWH,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAMG,UAAU;AACzB9D,YAAMgC,SAAS;QAAEC,IAAI0B,MAAMG;MAAS;IACtC;AACA,QAAIH,MAAMK,IAAKhE,OAAMiE,OAAO;MAAEC,gBAAgBP,MAAMK;IAAI;AAIxD,QAAIL,MAAMzD,YAAYK,QAAQ;AAC5B,YAAM4D,WAAYnE,MAAM+D,OAAiC,CAAA;AACzD/D,YAAM+D,MAAM;WAAII;WAAaR,MAAMzD,WAAWgC,IAAI,CAACkC,MAAMC,cAAcD,CAAAA,CAAAA;;IACzE;AACA,WAAOpE;EACT;EAEA,MAAMsE,SAASX,OAAyC;AACtD,UAAMtB,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO,KAAK0D,SAASC,KAAAA;MACrBpB,MAAMoB,MAAMvB;MACZmC,MAAMZ,MAAMa;MACZnC;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;;;;EAKA,MAAM6D,UAAUd,OAA8C;AAC5D,UAAMtD,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmBqF,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACf3E,OAAO,KAAK0D,SAASC,KAAAA;MACrBiB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,WAAOC,kBACLzE,KAAK6B,IAAI,CAAC6C,OAAO;MAAE/C,QAAQ+C,EAAE/C;MAAQ6B,QAAQkB,EAAElB;MAAQN,OAAOwB,EAAEH,OAAOC;IAAK,EAAA,CAAA;EAEhF;EAEA,MAAMG,gBAAgBnF,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,MAAM8D,0BACJpF,OACAqF,MACqC;AACrC,UAAMxE,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsBqE,UAAU;MACxDnF,OAAO;QAAEH;QAAOqF;MAAK;MACrB7C,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO1B;EACxC;EAEA,MAAMoG,4BAA4BvF,OAAewF,UAA+C;AAC9F,QAAIA,SAAS9E,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAIkC,SAASnD,IAAI,CAACoD,OAAO;UAAEJ,MAAM;YAAEK,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEjD,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMqE,gBAAgBC,QAAqC;AACzD,UAAM,KAAKvG,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAE0F,OAAOD,OAAOC;MAAM;MAC7BpG,QAAQ;QACNoG,OAAOD,OAAOC;QACd7F,OAAO4F,OAAO5F;QACdoB,KAAKwE,OAAOxE;QACZ0E,eAAeF,OAAOE,iBAAiB;MACzC;MACA5F,QAAQ;QACNF,OAAO4F,OAAO5F;QACdoB,KAAKwE,OAAOxE;QACZ0E,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMhF,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAE0F;MAAM;IAAE,CAAA;AAC5E,QAAI,CAAChF,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoB8E,OAAO;MAAE7F,OAAO;QAAE0F;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOhF,IAAIgF;MACX7F,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACT0E,eAAejF,IAAIiF,iBAAiB3G;IACtC;EACF;EAEA,MAAM8G,kBAAkBC,QAAyC;AAC/D,UAAM1F,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAE0F,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAO1F,KAAK6B,IAAI,CAAC6C,OAAO;MACtBW,OAAOX,EAAEW;MACT7F,OAAOkF,EAAElF;MACToB,KAAK8D,EAAE9D;MACP0E,eAAeZ,EAAEY,iBAAiB3G;IACpC,EAAA;EACF;EAEA,MAAMgH,mBAAmBP,QAAqC;AAI5D,UAAM,KAAKvG,GAAG6B,oBAAoBX,WAAW;MAC3CJ,OAAO;QAAE0F,OAAOD,OAAOC;QAAO7F,OAAO4F,OAAO5F;QAAOoB,KAAKwE,OAAOxE;MAAI;IACrE,CAAA;EACF;EAEA,MAAMgF,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKhH,GAAGiH,sBAAsB7G,OAAO;MAAEC,MAAM;QAAEmG;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMhF,MAAM,MAAM,KAAKxB,GAAGiH,sBAAsBhB,UAAU;MACxDnF,OAAO;QAAE0F;MAAM;MACfrD,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGiH,sBAAsBN,OAAO;MAAE7F,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEwG,SAASxF,IAAIwF,WAAWlH;IAAU;EAC7C;EAEA,MAAMsH,YAAYC,OAKA;AAChB,UAAM,KAAKrH,GAAGsH,qBAAqBlH,OAAO;MACxCC,MAAM;QACJG,IAAI6G,MAAM7G;QACVwF,MAAMqB,MAAMrB;QACZgB,SAASE,WAAWG,MAAML,OAAO;QACjCO,aAAa5D,OAAO0D,MAAME,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJxB,MACA9C,OACuE;AACvE,UAAM/B,OAAO,MAAM,KAAKnB,GAAGsH,qBAAqBzE,SAAS;MACvD/B,OAAO;QAAEkF;MAAK;MACd7C,SAAS;QAAEoE,aAAa;MAAM;MAC9BlE,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAI,CAAC6C,OAAO;MACtBrF,IAAIqF,EAAErF;MACNwG,SAASnB,EAAEmB,WAAWlH;MACtByH,aAAaE,OAAO5B,EAAE0B,WAAW;IACnC,EAAA;EACF;EAEA,MAAMG,oBAAoBlH,IAA8B;AAItD,UAAMuD,SAAS,MAAM,KAAK/D,GAAGsH,qBAAqBpG,WAAW;MAAEJ,OAAO;QAAEN;MAAG;IAAE,CAAA;AAC7E,WAAOuD,OAAOM,UAAU;EAC1B;AACF;AAQA,SAASc,cAAcD,GAAkB;AACvC,QAAMyC,MAAMC,mBAAmB1C,CAAAA;AAC/B,QAAM2C,UAAUC,iBAAiB5C,CAAAA;AACjC,QAAM6C,YACJ7C,EAAE8C,OAAO,OAAOH,UAAU3C,EAAE8C,OAAO,OAAO;IAAEvE,KAAKoE;EAAQ,IAAI;IAAE,CAAC3C,EAAE8C,EAAE,GAAGH;EAAQ;AACjF,SAAO;IAAE7G,YAAY;MAAEiH,MAAM;QAAEC,KAAKhD,EAAEgD;QAAK,CAACP,GAAAA,GAAMI;MAAU;IAAE;EAAE;AAClE;AANS5C;AAQT,IAAMgD,YAAY,wBAACC,MAA2BA,KAAK,OAAO,OAAOzE,OAAOyE,CAAAA,GAAtD;AAClB,IAAMC,aAAa,wBAACD,MAAsBA,KAAK,OAAOtI,SAAY2H,OAAOW,CAAAA,GAAtD;AACnB,IAAMlB,aAAa,wBAACoB,MAAeA,KAAK,MAArB;AAEnB,SAAShI,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRkE,UAAUxE,IAAIwE;IACd6D,iBAAiBrI,IAAIqI;IACrBzF,QAAQ5C,IAAI4C;IACZuE,OAAOH,WAAWhH,IAAImH,KAAK;IAC3BmB,QAAQtB,WAAWhH,IAAIsI,MAAM;IAC7BC,OAAOvB,WAAWhH,IAAIuI,KAAK;IAC3BjF,QAAQ2E,UAAUjI,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtEwE,wBAAwBxI,IAAIwI,0BAA0B;IACtDC,kBAAkBzI,IAAIyI,oBAAoB;IAC1C5D,MAAMmC,WAAWhH,IAAI6E,IAAI;IACzBtE,kBAAkByG,WAAWhH,IAAIO,gBAAgB;IACjDmI,UAAU1I,IAAI0I,YAAY;;;;IAI1B/I,WAAWK,IAAIL,aAAa;;IAE5B8E,QAAQzE,IAAIyE,UAAU;IACtBvB,WAAWlD,IAAIkD;IACfyF,WAAW3I,IAAI2I;EACjB;AACF;AA1BSvI;AA4BT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKqE,WAAW9D,MAAM8D;AAC/C,MAAI,qBAAqB9D,MAAOP,MAAKkI,kBAAkB3H,MAAM2H;AAC7D,MAAI,YAAY3H,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKgH,QAAQH,WAAWtG,MAAMyG,KAAK;AACzD,MAAI,YAAYzG,MAAOP,MAAKmI,SAAStB,WAAWtG,MAAM4H,MAAM;AAC5D,MAAI,WAAW5H,MAAOP,MAAKoI,QAAQvB,WAAWtG,MAAM6H,KAAK;AACzD,MAAI,YAAY7H,MAAOP,MAAKmD,SAAS2E,UAAUvH,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,MAAKqI,yBAAyB9H,MAAM8H,0BAA0B;AAChE,MAAI,sBAAsB9H,MAAOP,MAAKsI,mBAAmB/H,MAAM+H,oBAAoB;AACnF,MAAI,UAAU/H,MAAOP,MAAK0E,OAAOmC,WAAWtG,MAAMmE,IAAI;AACtD,MAAI,sBAAsBnE,MAAOP,MAAKI,mBAAmByG,WAAWtG,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAKuI,WAAWhI,MAAMgI,YAAY;AAK3D,MAAI,eAAehI,MAAOP,MAAKR,YAAYe,MAAMf,aAAa;AAC9D,MAAI,YAAYe,MAAOP,MAAKsE,SAAS/D,MAAM+D,UAAU;AACrD,MAAI/D,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMiI,aAAa,KAAMxI,MAAKwI,YAAYjI,MAAMiI;AACpD,SAAOxI;AACT;AAhCSU;AAkCT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRkE,UAAUlD,IAAIkD;IACd6D,iBAAiB/G,IAAI+G;IACrBzF,QAAQtB,IAAIsB;IACZuE,OAAO7F,IAAI6F,SAASvH;IACpB0I,QAAQhH,IAAIgH,UAAU1I;IACtB2I,OAAQjH,IAAIiH,SAAS3I;IACrB0D,QAAQ6E,WAAW7G,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYtE;IAC1BoE,aAAa1C,IAAI0C,eAAe,OAAOpE,SAAY0B,IAAI0C,YAAY4E,QAAO;IAC1EJ,wBAAwBlH,IAAIkH,0BAA0B5I;IACtD6I,kBAAkBnH,IAAImH,oBAAoB7I;IAC1CiF,MAAOvD,IAAIuD,QAA4BjF;IACvCW,kBACGe,IAAIf,oBAAyEX;IAChF8I,UAAUpH,IAAIoH,YAAY9I;;;;;;IAM1BD,WAAW2B,IAAI3B;;IAEf8E,QAAQnD,IAAImD,UAAU7E;IACtBsD,WAAW5B,IAAI4B;IACfyF,WAAWrH,IAAIqH;EACjB;AACF;AA7BSnH;AA+BT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRiE,MAAMrD,GAAGqD;IACT+C,MAAMpG,GAAGoG;IACTC,QAAQrG,GAAGqG;IACXlG,QAAQH,GAAGG;IACXuE,OAAOH,WAAWvE,GAAG0E,KAAK;IAC1BmB,QAAQtB,WAAWvE,GAAG6F,MAAM;IAC5BC,OAAOvB,WAAWvE,GAAG8F,KAAK;IAC1BQ,QAAQ/B,WAAWvE,GAAGsG,MAAM;IAC5BC,UAAUvG,GAAGuG;IACbC,aAAaxG,GAAGwG,eAAe;IAC/B1C,eAAe9D,GAAG8D,iBAAiB;IACnCjD,QAAQ2E,UAAUxF,GAAGa,MAAM;IAC3B4F,YAAYzG,GAAGyG;IACfC,WAAW1G,GAAG0G;IACdC,YAAY3G,GAAG2G;EACjB;AACF;AApBSlH;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTiE,MAAMxE,IAAIwE;IACV+C,MAAMvH,IAAIuH;IACVC,QAAQxH,IAAIwH;IACZlG,QAAQtB,IAAIsB;IACZuE,OAAO7F,IAAI6F,SAASvH;IACpB0I,QAAQhH,IAAIgH,UAAU1I;IACtB2I,OAAQjH,IAAIiH,SAAS3I;IACrBmJ,QAASzH,IAAIyH,UAAUnJ;IACvBoJ,UAAU1H,IAAI0H;IACdC,aAAa3H,IAAI2H,eAAerJ;IAChC2G,eAAejF,IAAIiF,iBAAiB3G;IACpC0D,QAAQ6E,WAAW7G,IAAIgC,MAAM;IAC7B4F,YAAY5H,IAAI4H,cAAc5H,IAAI6H;IAClCA,WAAW7H,IAAI6H;IACfC,YAAY9H,IAAI8H;EAClB;AACF;AApBSrH;;;AC1lBF,SAASsH,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;;AAEJ;AATgBA;","names":["attributeColumnFor","attributeOperand","mergeRunFacetRows","normalizeAttributeRows","namespaceWhere","namespace","undefined","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","runWhere","query","workflow","origin","statuses","AND","tag","tags","array_contains","existing","f","attributeSome","listRuns","skip","offset","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","r","listCheckpoints","getLatestCheckpointByName","name","findFirst","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","bufferEvent","input","durableBufferedEvent","publishedAt","listBufferedEvents","Number","removeBufferedEvent","col","attributeColumnFor","operand","attributeOperand","condition","op","some","key","bigOrNull","n","numOrUndef","v","workflowVersion","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}
+{"version":3,"sources":["../src/prisma-state-store.ts","../src/schema.ts"],"sourcesContent":["import {\n  type AttributeFilter,\n  RUN_VALUE_FACET_SCAN,\n  type RunFacetQuery,\n  type RunFacetRow,\n  type RunQuery,\n  type RunStatus,\n  type RunValueAxis,\n  type RunValueFacetOptions,\n  type RunValueFacetRow,\n  type SignalWaiter,\n  type StateStore,\n  type StepCheckpoint,\n  type StepError,\n  type StepEvent,\n  type WorkflowRun,\n  attributePredicateOperands,\n  axisIsRunColumn,\n  mergeRunFacetRows,\n  mergeRunValueFacetRows,\n  normalizeAttributeRows,\n  runValueFacetsFromRuns,\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  /** NOT NULL in the schema (defaulted to `'default'`), so every row carries a real namespace. */\n  namespace: string;\n  origin: string | 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\ninterface BufferedEventRow {\n  id: string;\n  name: string;\n  payload: unknown;\n  publishedAt: bigint;\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  /** Aggregate form — used only by `runFacets`, whose rows are `(status, origin, count)` cells, not\n   *  model rows, so the result type is stated at the call site rather than derived from `Row`. */\n  groupBy(args: Args): Promise<Record<string, unknown>[]>;\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  durableBufferedEvent: Delegate<BufferedEventRow>;\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 * The `namespace` read boundary as a spreadable Prisma `where` fragment.\n *\n * `undefined` means NO RESTRICTION — `{}` — because that is the operator (control-plane) view that\n * sees every tenant, and it is what the engine passes when it runs unscoped. It does NOT mean\n * \"namespace IS NULL\": the column is NOT NULL, so `{ namespace: undefined }` would be Prisma's\n * \"ignore this predicate\" anyway, but `{ namespace: null }` would match nothing in production while\n * still looking correct in a single-tenant test where every worker polls unscoped.\n *\n * A named namespace is plain equality, so a worker sees only its own tenant's rows — the boundary\n * {@link WorkflowRun.namespace} promises for the four worker paths (pick up, recover, resume timers,\n * time out).\n */\nfunction namespaceWhere(namespace?: string): { namespace?: string } {\n  if (namespace === undefined) return {};\n  return { namespace };\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 *\n * Every path a worker acts on is namespace-scoped when it is given one — `listPendingRuns` (pick up),\n * `listIncompleteRuns` (recover), `listDueTimers` (resume timers) and `listRuns`'s `namespace`\n * (the engine's timeout sweep). Omit it for the operator view across all tenants. Point-reads\n * (`getRun`, checkpoints) are deliberately NOT scoped, per {@link StateStore}.\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(namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: { in: ['running', 'cancelling'] }, ...namespaceWhere(namespace) },\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listPendingRuns(limit: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: { status: 'pending', ...namespaceWhere(namespace) },\n      orderBy: { createdAt: 'asc' }, // FIFO dispatch\n      take: limit,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  async listDueTimers(nowMs: number, namespace?: string): Promise<WorkflowRun[]> {\n    const rows = await this.db.durableWorkflowRun.findMany({\n      where: {\n        status: 'suspended',\n        wakeAt: { not: null, lte: BigInt(nowMs) },\n        ...namespaceWhere(namespace),\n      },\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  /** The `where` every run query shares — {@link listRuns} pages it, {@link runFacets} groups it. */\n  private runWhere(query: RunQuery): Record<string, unknown> {\n    // The tenant boundary, and NOT only a dashboard facet: the engine's `sweepTimeouts` finds the runs\n    // it may cancel through `listRuns({ workflow, status, namespace })`, so an unfiltered `namespace`\n    // here lets a worker serving one tenant time out another tenant's runs — a write, not a stale\n    // read. Same `undefined` = no restriction rule as the poll paths above (see `namespaceWhere`),\n    // which is what keeps the operator's dashboard showing every tenant by default.\n    const where: Record<string, unknown> = { ...namespaceWhere(query.namespace) };\n    // The plural predicates below can't sit on `where` directly (a key holds one condition, and the\n    // single form may already own it), so they accumulate here and are ANDed at the end. Each is ORed\n    // within itself and matches NOTHING when empty — the contract `statuses` already had.\n    const and: Record<string, unknown>[] = [];\n    if (query.workflow) where.workflow = query.workflow;\n    if (query.workflows) and.push(anyOf(query.workflows.map((w) => ({ workflow: w }))));\n    if (query.namespaces) and.push(anyOf(query.namespaces.map((n) => ({ namespace: n }))));\n    // Which library registered the workflow. Plain equality, so a run whose origin is NULL (created\n    // before the column existed, or registered through a path the derivation could not classify)\n    // matches NO origin value — it is never folded into a bucket to make the facet look complete.\n    // Unknown-origin runs are reachable only with the filter OFF, so \"all origins\" must stay the\n    // default view; a dashboard that filtered by default would make those runs look deleted.\n    // Passing `null` asks for exactly the unattributed bucket (`origin IS NULL`) — Prisma spells that\n    // as the same equality — which is how a paginated console can offer an \"unknown\" chip.\n    if (query.origin !== undefined) where.origin = query.origin;\n    // `null` is a member like any other in a set of origins — Prisma spells `origin IS NULL` as the\n    // same equality — so one branch per value covers both the named ones and the unattributed bucket.\n    if (query.origins) and.push(anyOf(query.origins.map((o) => ({ origin: o }))));\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      and.push({ 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    if (query.tags) and.push(anyOf(query.tags.map((t) => ({ tags: { array_contains: t } }))));\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) and.push(...query.attributes.map((f) => attributeSome(f)));\n    if (and.length) where.AND = and;\n    return where;\n  }\n\n  async listRuns(query: RunQuery): Promise<WorkflowRun[]> {\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: this.runWhere(query),\n      take: query.limit,\n      skip: query.offset,\n      orderBy,\n    });\n    return rows.map(fromRunRow);\n  }\n\n  /** `GROUP BY status, origin` over the same predicates {@link listRuns} pages — one aggregate, so a\n   *  console can show whole-set counts next to a bounded page instead of downloading every run to\n   *  count them in the browser. */\n  async runFacets(query: RunFacetQuery): Promise<RunFacetRow[]> {\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: ['status', 'origin'],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as { status: RunStatus; origin: string | null; _count: { _all: number } }[];\n    return mergeRunFacetRows(\n      rows.map((r) => ({ status: r.status, origin: r.origin, count: r._count._all })),\n    );\n  }\n\n  /** Distinct values of one filter axis over the same predicates {@link listRuns} pages. A run-table\n   *  column is a `groupBy` like {@link runFacets}, exact over the whole matching set; the tag and\n   *  attribute axes live outside the row (json column / side table) and are counted from a bounded\n   *  page of runs instead — see `RunValueFacetOptions.scan`. */\n  async runValueFacets(\n    axis: RunValueAxis,\n    query: RunFacetQuery,\n    opts?: RunValueFacetOptions,\n  ): Promise<RunValueFacetRow[]> {\n    if (!axisIsRunColumn(axis)) {\n      const runs = await this.listRuns({ ...query, limit: opts?.scan ?? RUN_VALUE_FACET_SCAN });\n      return runValueFacetsFromRuns(runs, axis, opts);\n    }\n    const rows = (await this.db.durableWorkflowRun.groupBy({\n      by: [axis.field],\n      where: this.runWhere(query),\n      _count: { _all: true },\n    })) as (Record<string, string | null> & { _count: { _all: number } })[];\n    return mergeRunValueFacetRows(\n      rows.map((r) => ({ value: r[axis.field] ?? null, count: r._count._all })),\n      opts,\n    );\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 removeSignalWaiter(waiter: SignalWaiter): Promise<void> {\n    // Exact-match delete (token AND runId AND seq): `token` is the only unique column, so a plain\n    // `delete({ where: { token } })` would remove whatever row currently owns it, even if a different\n    // run has since claimed the same token — `deleteMany` with all three fields is a safe no-op then.\n    await this.db.durableSignalWaiter.deleteMany({\n      where: { token: waiter.token, runId: waiter.runId, seq: waiter.seq },\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  async bufferEvent(input: {\n    name: string;\n    payload: unknown;\n    id: string;\n    publishedAt: number;\n  }): Promise<void> {\n    await this.db.durableBufferedEvent.create({\n      data: {\n        id: input.id,\n        name: input.name,\n        payload: jsonOrNull(input.payload),\n        publishedAt: BigInt(input.publishedAt),\n      },\n    });\n  }\n\n  async listBufferedEvents(\n    name: string,\n    limit: number,\n  ): Promise<Array<{ id: string; payload: unknown; publishedAt: number }>> {\n    const rows = await this.db.durableBufferedEvent.findMany({\n      where: { name },\n      orderBy: { publishedAt: 'asc' }, // oldest first\n      take: limit,\n    });\n    return rows.map((r) => ({\n      id: r.id,\n      payload: r.payload ?? undefined,\n      publishedAt: Number(r.publishedAt),\n    }));\n  }\n\n  async removeBufferedEvent(id: string): Promise<boolean> {\n    // deleteMany's `where: { id }` matches at most one row (id is the PK) and is a safe no-op if it's\n    // already gone — unlike `delete({ where: { id } })`, which throws P2025 on a missing row (the same\n    // reasoning as releaseRunLock's updateMany above).\n    const result = await this.db.durableBufferedEvent.deleteMany({ where: { id } });\n    return result.count === 1;\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): Record<string, unknown> {\n  // One comparison for a scalar op, one per member for `in` — ORed inside the single `some`, since\n  // `in`'s operands may be of mixed types and so land in different typed columns. No comparisons at\n  // all (an `in` over no values) can match no run, which is a run-level fact, not a side-table one.\n  const comparisons = attributePredicateOperands(f).map(({ column, comparator, operand }) => ({\n    [column]:\n      comparator === '=' ? operand : comparator === '<>' ? { not: operand } : { [f.op]: operand },\n  }));\n  if (comparisons.length === 0) return MATCHES_NOTHING;\n  return { attributes: { some: { key: f.key, ...anyOf(comparisons) } } };\n}\n\n/** A where fragment no run satisfies — what a plural predicate over an EMPTY set means. Spelled as an\n *  impossible `id` rather than `OR: []` so it does not depend on how a Prisma version reads an empty\n *  disjunction. */\nconst MATCHES_NOTHING: Record<string, unknown> = { id: { in: [] as string[] } };\n\n/** OR a set of where fragments, where an EMPTY set matches nothing rather than everything. */\nfunction anyOf(branches: Record<string, unknown>[]): Record<string, unknown> {\n  return branches.length ? { OR: branches } : MATCHES_NOTHING;\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    // An absent namespace IS `'default'` — unlike `origin` below, this is a reconstruction and not a\n    // guess: an engine started without a namespace stamps its runs and routes its workers as\n    // `'default'`, so writing anything else (or NULL) would put the run in a partition no worker polls.\n    namespace: run.namespace ?? 'default',\n    // Absent origin stays SQL NULL — \"unknown\", never coerced into a real-looking library name.\n    origin: run.origin ?? 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  // `?? 'default'` rather than `?? null` like its neighbours: the column is NOT NULL, and clearing a\n  // run's namespace means \"back to the unscoped partition\", which is what `'default'` names. A patch\n  // that does not mention `namespace` leaves the stored one alone — a status update must never move a\n  // run between tenants.\n  if ('namespace' in patch) data.namespace = patch.namespace ?? 'default';\n  if ('origin' in patch) data.origin = patch.origin ?? 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    // Read back verbatim, with NO `?? 'default'` fallback. The column is NOT NULL and the migration\n    // back-fills old rows, so there is nothing legitimate to fall back FROM; a fallback would only fire\n    // on a deployment that added the column nullable without back-filling, and there it would lie —\n    // the dashboard would show `default` for a row whose stored NULL keeps every `default` worker's\n    // `WHERE namespace = 'default'` from ever picking it up.\n    namespace: row.namespace,\n    // NULL (a row written before the column existed) surfaces as `undefined` = unknown origin.\n    origin: row.origin ?? 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    'durable_buffered_events',\n  ];\n}\n"],"mappings":";;;;AAAA,SAEEA,sBAcAC,4BACAC,iBACAC,mBACAC,wBACAC,wBACAC,8BACK;AA4HP,SAASC,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EAjKb,OAiKaA;;;;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,mBAAmB/C,WAA4C;AACnE,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGnD,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOsB,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAMuB,gBAAgBC,OAAerD,WAA4C;AAC/E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QAAEgC,QAAQ;QAAW,GAAGlD,eAAeC,SAAAA;MAAW;MACzDsD,SAAS;QAAEC,WAAW;MAAM;MAC5BC,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAItB,UAAAA;EAClB;EAEA,MAAM4B,cAAcC,OAAe1D,WAA4C;AAC7E,UAAMsB,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO;QACLgC,QAAQ;QACRU,QAAQ;UAAEC,KAAK;UAAMC,KAAKC,OAAOJ,KAAAA;QAAO;QACxC,GAAG3D,eAAeC,SAAAA;MACpB;IACF,CAAA;AACA,WAAOsB,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;;EAGQG,SAASC,OAA0C;AAMzD,UAAM3D,QAAiC;MAAE,GAAGlB,eAAe6E,MAAM5E,SAAS;IAAE;AAI5E,UAAM6E,MAAiC,CAAA;AACvC,QAAID,MAAME,SAAU7D,OAAM6D,WAAWF,MAAME;AAC3C,QAAIF,MAAMG,UAAWF,KAAIG,KAAKC,MAAML,MAAMG,UAAU5B,IAAI,CAAC+B,OAAO;MAAEJ,UAAUI;IAAE,EAAA,CAAA,CAAA;AAC9E,QAAIN,MAAMO,WAAYN,KAAIG,KAAKC,MAAML,MAAMO,WAAWhC,IAAI,CAACiC,OAAO;MAAEpF,WAAWoF;IAAE,EAAA,CAAA,CAAA;AAQjF,QAAIR,MAAMS,WAAWpF,OAAWgB,OAAMoE,SAAST,MAAMS;AAGrD,QAAIT,MAAMU,QAAST,KAAIG,KAAKC,MAAML,MAAMU,QAAQnC,IAAI,CAACoC,OAAO;MAAEF,QAAQE;IAAE,EAAA,CAAA,CAAA;AAGxE,QAAIX,MAAM3B,UAAU2B,MAAMY,UAAU;AAClCX,UAAIG,KAAK;QAAE/B,QAAQ2B,MAAM3B;MAAO,GAAG;QAAEA,QAAQ;UAAEC,IAAI0B,MAAMY;QAAS;MAAE,CAAA;IACtE,WAAWZ,MAAM3B,QAAQ;AACvBhC,YAAMgC,SAAS2B,MAAM3B;IACvB,WAAW2B,MAAMY,UAAU;AACzBvE,YAAMgC,SAAS;QAAEC,IAAI0B,MAAMY;MAAS;IACtC;AACA,QAAIZ,MAAMa,IAAKxE,OAAMyE,OAAO;MAAEC,gBAAgBf,MAAMa;IAAI;AACxD,QAAIb,MAAMc,KAAMb,KAAIG,KAAKC,MAAML,MAAMc,KAAKvC,IAAI,CAACyC,OAAO;MAAEF,MAAM;QAAEC,gBAAgBC;MAAE;IAAE,EAAA,CAAA,CAAA;AAIpF,QAAIhB,MAAMzD,YAAYK,OAAQqD,KAAIG,KAAI,GAAIJ,MAAMzD,WAAWgC,IAAI,CAAC0C,MAAMC,cAAcD,CAAAA,CAAAA,CAAAA;AACpF,QAAIhB,IAAIrD,OAAQP,OAAM8E,MAAMlB;AAC5B,WAAO5D;EACT;EAEA,MAAM+E,SAASpB,OAAyC;AACtD,UAAMtB,UAAU;MAAEC,WAAW;IAAgB;AAC7C,UAAMjC,OAAO,MAAM,KAAKnB,GAAGG,mBAAmB0C,SAAS;MACrD/B,OAAO,KAAK0D,SAASC,KAAAA;MACrBpB,MAAMoB,MAAMvB;MACZ4C,MAAMrB,MAAMsB;MACZ5C;IACF,CAAA;AACA,WAAOhC,KAAK6B,IAAItB,UAAAA;EAClB;;;;EAKA,MAAMsE,UAAUvB,OAA8C;AAC5D,UAAMtD,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmB8F,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACfpF,OAAO,KAAK0D,SAASC,KAAAA;MACrB0B,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,WAAOC,kBACLlF,KAAK6B,IAAI,CAACsD,OAAO;MAAExD,QAAQwD,EAAExD;MAAQoC,QAAQoB,EAAEpB;MAAQb,OAAOiC,EAAEH,OAAOC;IAAK,EAAA,CAAA;EAEhF;;;;;EAMA,MAAMG,eACJC,MACA/B,OACAgC,MAC6B;AAC7B,QAAI,CAACC,gBAAgBF,IAAAA,GAAO;AAC1B,YAAMG,OAAO,MAAM,KAAKd,SAAS;QAAE,GAAGpB;QAAOvB,OAAOuD,MAAMG,QAAQC;MAAqB,CAAA;AACvF,aAAOC,uBAAuBH,MAAMH,MAAMC,IAAAA;IAC5C;AACA,UAAMtF,OAAQ,MAAM,KAAKnB,GAAGG,mBAAmB8F,QAAQ;MACrDC,IAAI;QAACM,KAAKO;;MACVjG,OAAO,KAAK0D,SAASC,KAAAA;MACrB0B,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,WAAOY,uBACL7F,KAAK6B,IAAI,CAACsD,OAAO;MAAEW,OAAOX,EAAEE,KAAKO,KAAK,KAAK;MAAM1C,OAAOiC,EAAEH,OAAOC;IAAK,EAAA,GACtEK,IAAAA;EAEJ;EAEA,MAAMS,gBAAgBvG,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,MAAMkF,0BACJxG,OACAyG,MACqC;AACrC,UAAM5F,MAAM,MAAM,KAAKxB,GAAG4B,sBAAsByF,UAAU;MACxDvG,OAAO;QAAEH;QAAOyG;MAAK;MACrBjE,SAAS;QAAEpB,KAAK;MAAO;IACzB,CAAA;AACA,WAAOP,MAAMS,kBAAkBT,GAAAA,IAAO1B;EACxC;EAEA,MAAMwH,4BAA4B3G,OAAe4G,UAA+C;AAC9F,QAAIA,SAASlG,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMF,OAAO,MAAM,KAAKnB,GAAG4B,sBAAsBiB,SAAS;MACxD/B,OAAO;QAAEH;QAAOsD,IAAIsD,SAASvE,IAAI,CAACwE,OAAO;UAAEJ,MAAM;YAAEK,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvErE,SAAS;QAAEpB,KAAK;MAAM;IACxB,CAAA;AACA,WAAOZ,KAAK6B,IAAIf,iBAAAA;EAClB;EAEA,MAAMyF,gBAAgBC,QAAqC;AACzD,UAAM,KAAK3H,GAAG6B,oBAAoBQ,OAAO;MACvCvB,OAAO;QAAE8G,OAAOD,OAAOC;MAAM;MAC7BxH,QAAQ;QACNwH,OAAOD,OAAOC;QACdjH,OAAOgH,OAAOhH;QACdoB,KAAK4F,OAAO5F;QACZ8F,eAAeF,OAAOE,iBAAiB;MACzC;MACAhH,QAAQ;QACNF,OAAOgH,OAAOhH;QACdoB,KAAK4F,OAAO5F;QACZ8F,eAAeF,OAAOE,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMC,iBAAiBF,OAA6C;AAClE,UAAMpG,MAAM,MAAM,KAAKxB,GAAG6B,oBAAoBJ,WAAW;MAAEX,OAAO;QAAE8G;MAAM;IAAE,CAAA;AAC5E,QAAI,CAACpG,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAG6B,oBAAoBkG,OAAO;MAAEjH,OAAO;QAAE8G;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAOpG,IAAIoG;MACXjH,OAAOa,IAAIb;MACXoB,KAAKP,IAAIO;MACT8F,eAAerG,IAAIqG,iBAAiB/H;IACtC;EACF;EAEA,MAAMkI,kBAAkBC,QAAyC;AAC/D,UAAM9G,OAAO,MAAM,KAAKnB,GAAG6B,oBAAoBgB,SAAS;MACtD/B,OAAO;QAAE8G,OAAO;UAAEH,YAAYQ;QAAO;MAAE;IACzC,CAAA;AACA,WAAO9G,KAAK6B,IAAI,CAACsD,OAAO;MACtBsB,OAAOtB,EAAEsB;MACTjH,OAAO2F,EAAE3F;MACToB,KAAKuE,EAAEvE;MACP8F,eAAevB,EAAEuB,iBAAiB/H;IACpC,EAAA;EACF;EAEA,MAAMoI,mBAAmBP,QAAqC;AAI5D,UAAM,KAAK3H,GAAG6B,oBAAoBX,WAAW;MAC3CJ,OAAO;QAAE8G,OAAOD,OAAOC;QAAOjH,OAAOgH,OAAOhH;QAAOoB,KAAK4F,OAAO5F;MAAI;IACrE,CAAA;EACF;EAEA,MAAMoG,aAAaP,OAAeQ,SAAiC;AACjE,UAAM,KAAKpI,GAAGqI,sBAAsBjI,OAAO;MAAEC,MAAM;QAAEuH;QAAOQ,SAASE,WAAWF,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAMG,mBAAmBX,OAAqD;AAC5E,UAAMpG,MAAM,MAAM,KAAKxB,GAAGqI,sBAAsBhB,UAAU;MACxDvG,OAAO;QAAE8G;MAAM;MACfzE,SAAS;QAAE3C,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAACgB,IAAK,QAAO;AACjB,UAAM,KAAKxB,GAAGqI,sBAAsBN,OAAO;MAAEjH,OAAO;QAAEN,IAAIgB,IAAIhB;MAAG;IAAE,CAAA;AACnE,WAAO;MAAE4H,SAAS5G,IAAI4G,WAAWtI;IAAU;EAC7C;EAEA,MAAM0I,YAAYC,OAKA;AAChB,UAAM,KAAKzI,GAAG0I,qBAAqBtI,OAAO;MACxCC,MAAM;QACJG,IAAIiI,MAAMjI;QACV4G,MAAMqB,MAAMrB;QACZgB,SAASE,WAAWG,MAAML,OAAO;QACjCO,aAAahF,OAAO8E,MAAME,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJxB,MACAlE,OACuE;AACvE,UAAM/B,OAAO,MAAM,KAAKnB,GAAG0I,qBAAqB7F,SAAS;MACvD/B,OAAO;QAAEsG;MAAK;MACdjE,SAAS;QAAEwF,aAAa;MAAM;MAC9BtF,MAAMH;IACR,CAAA;AACA,WAAO/B,KAAK6B,IAAI,CAACsD,OAAO;MACtB9F,IAAI8F,EAAE9F;MACN4H,SAAS9B,EAAE8B,WAAWtI;MACtB6I,aAAaE,OAAOvC,EAAEqC,WAAW;IACnC,EAAA;EACF;EAEA,MAAMG,oBAAoBtI,IAA8B;AAItD,UAAMuD,SAAS,MAAM,KAAK/D,GAAG0I,qBAAqBxH,WAAW;MAAEJ,OAAO;QAAEN;MAAG;IAAE,CAAA;AAC7E,WAAOuD,OAAOM,UAAU;EAC1B;AACF;AAQA,SAASsB,cAAcD,GAAkB;AAIvC,QAAMqD,cAAcC,2BAA2BtD,CAAAA,EAAG1C,IAAI,CAAC,EAAEiG,QAAQC,YAAYC,QAAO,OAAQ;IAC1F,CAACF,MAAAA,GACCC,eAAe,MAAMC,UAAUD,eAAe,OAAO;MAAEzF,KAAK0F;IAAQ,IAAI;MAAE,CAACzD,EAAE0D,EAAE,GAAGD;IAAQ;EAC9F,EAAA;AACA,MAAIJ,YAAY1H,WAAW,EAAG,QAAOgI;AACrC,SAAO;IAAErI,YAAY;MAAEsI,MAAM;QAAEC,KAAK7D,EAAE6D;QAAK,GAAGzE,MAAMiE,WAAAA;MAAa;IAAE;EAAE;AACvE;AAVSpD;AAeT,IAAM0D,kBAA2C;EAAE7I,IAAI;IAAEuC,IAAI,CAAA;EAAe;AAAE;AAG9E,SAAS+B,MAAM0E,UAAmC;AAChD,SAAOA,SAASnI,SAAS;IAAE4C,IAAIuF;EAAS,IAAIH;AAC9C;AAFSvE;AAIT,IAAM2E,YAAY,wBAACxE,MAA2BA,KAAK,OAAO,OAAOtB,OAAOsB,CAAAA,GAAtD;AAClB,IAAMyE,aAAa,wBAACzE,MAAsBA,KAAK,OAAOnF,SAAY+I,OAAO5D,CAAAA,GAAtD;AACnB,IAAMqD,aAAa,wBAACqB,MAAeA,KAAK,MAArB;AAEnB,SAASrJ,UAAUJ,KAAgB;AACjC,SAAO;IACLM,IAAIN,IAAIM;IACRmE,UAAUzE,IAAIyE;IACdiF,iBAAiB1J,IAAI0J;IACrB9G,QAAQ5C,IAAI4C;IACZ2F,OAAOH,WAAWpI,IAAIuI,KAAK;IAC3BoB,QAAQvB,WAAWpI,IAAI2J,MAAM;IAC7BC,OAAOxB,WAAWpI,IAAI4J,KAAK;IAC3BtG,QAAQiG,UAAUvJ,IAAIsD,MAAM;IAC5BY,UAAUlE,IAAIkE,YAAY;IAC1BF,aAAahE,IAAIgE,eAAe,OAAO,OAAO,IAAIC,KAAKjE,IAAIgE,WAAW;IACtE6F,wBAAwB7J,IAAI6J,0BAA0B;IACtDC,kBAAkB9J,IAAI8J,oBAAoB;IAC1CzE,MAAM+C,WAAWpI,IAAIqF,IAAI;IACzB9E,kBAAkB6H,WAAWpI,IAAIO,gBAAgB;IACjDwJ,UAAU/J,IAAI+J,YAAY;;;;IAI1BpK,WAAWK,IAAIL,aAAa;;IAE5BqF,QAAQhF,IAAIgF,UAAU;IACtB9B,WAAWlD,IAAIkD;IACf8G,WAAWhK,IAAIgK;EACjB;AACF;AA1BS5J;AA4BT,SAASS,WAAWH,OAA2B;AAM7C,QAAMP,OAAgC,CAAC;AACvC,MAAI,cAAcO,MAAOP,MAAKsE,WAAW/D,MAAM+D;AAC/C,MAAI,qBAAqB/D,MAAOP,MAAKuJ,kBAAkBhJ,MAAMgJ;AAC7D,MAAI,YAAYhJ,MAAOP,MAAKyC,SAASlC,MAAMkC;AAC3C,MAAI,WAAWlC,MAAOP,MAAKoI,QAAQH,WAAW1H,MAAM6H,KAAK;AACzD,MAAI,YAAY7H,MAAOP,MAAKwJ,SAASvB,WAAW1H,MAAMiJ,MAAM;AAC5D,MAAI,WAAWjJ,MAAOP,MAAKyJ,QAAQxB,WAAW1H,MAAMkJ,KAAK;AACzD,MAAI,YAAYlJ,MAAOP,MAAKmD,SAASiG,UAAU7I,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,MAAK0J,yBAAyBnJ,MAAMmJ,0BAA0B;AAChE,MAAI,sBAAsBnJ,MAAOP,MAAK2J,mBAAmBpJ,MAAMoJ,oBAAoB;AACnF,MAAI,UAAUpJ,MAAOP,MAAKkF,OAAO+C,WAAW1H,MAAM2E,IAAI;AACtD,MAAI,sBAAsB3E,MAAOP,MAAKI,mBAAmB6H,WAAW1H,MAAMH,gBAAgB;AAC1F,MAAI,cAAcG,MAAOP,MAAK4J,WAAWrJ,MAAMqJ,YAAY;AAK3D,MAAI,eAAerJ,MAAOP,MAAKR,YAAYe,MAAMf,aAAa;AAC9D,MAAI,YAAYe,MAAOP,MAAK6E,SAAStE,MAAMsE,UAAU;AACrD,MAAItE,MAAMwC,aAAa,KAAM/C,MAAK+C,YAAYxC,MAAMwC;AACpD,MAAIxC,MAAMsJ,aAAa,KAAM7J,MAAK6J,YAAYtJ,MAAMsJ;AACpD,SAAO7J;AACT;AAhCSU;AAkCT,SAASW,WAAWF,KAAW;AAC7B,SAAO;IACLhB,IAAIgB,IAAIhB;IACRmE,UAAUnD,IAAImD;IACdiF,iBAAiBpI,IAAIoI;IACrB9G,QAAQtB,IAAIsB;IACZ2F,OAAOjH,IAAIiH,SAAS3I;IACpB+J,QAAQrI,IAAIqI,UAAU/J;IACtBgK,OAAQtI,IAAIsI,SAAShK;IACrB0D,QAAQkG,WAAWlI,IAAIgC,MAAM;IAC7BY,UAAU5C,IAAI4C,YAAYtE;IAC1BoE,aAAa1C,IAAI0C,eAAe,OAAOpE,SAAY0B,IAAI0C,YAAYiG,QAAO;IAC1EJ,wBAAwBvI,IAAIuI,0BAA0BjK;IACtDkK,kBAAkBxI,IAAIwI,oBAAoBlK;IAC1CyF,MAAO/D,IAAI+D,QAA4BzF;IACvCW,kBACGe,IAAIf,oBAAyEX;IAChFmK,UAAUzI,IAAIyI,YAAYnK;;;;;;IAM1BD,WAAW2B,IAAI3B;;IAEfqF,QAAQ1D,IAAI0D,UAAUpF;IACtBsD,WAAW5B,IAAI4B;IACf8G,WAAW1I,IAAI0I;EACjB;AACF;AA7BSxI;AA+BT,SAASU,iBAAiBO,IAAkB;AAC1C,SAAO;IACLhC,OAAOgC,GAAGhC;IACVoB,KAAKY,GAAGZ;IACRqF,MAAMzE,GAAGyE;IACTgD,MAAMzH,GAAGyH;IACTC,QAAQ1H,GAAG0H;IACXvH,QAAQH,GAAGG;IACX2F,OAAOH,WAAW3F,GAAG8F,KAAK;IAC1BoB,QAAQvB,WAAW3F,GAAGkH,MAAM;IAC5BC,OAAOxB,WAAW3F,GAAGmH,KAAK;IAC1BQ,QAAQhC,WAAW3F,GAAG2H,MAAM;IAC5BC,UAAU5H,GAAG4H;IACbC,aAAa7H,GAAG6H,eAAe;IAC/B3C,eAAelF,GAAGkF,iBAAiB;IACnCrE,QAAQiG,UAAU9G,GAAGa,MAAM;IAC3BiH,YAAY9H,GAAG8H;IACfC,WAAW/H,GAAG+H;IACdC,YAAYhI,GAAGgI;EACjB;AACF;AApBSvI;AAsBT,SAASH,kBAAkBT,KAAkB;AAC3C,SAAO;IACLb,OAAOa,IAAIb;IACXoB,KAAKP,IAAIO;IACTqF,MAAM5F,IAAI4F;IACVgD,MAAM5I,IAAI4I;IACVC,QAAQ7I,IAAI6I;IACZvH,QAAQtB,IAAIsB;IACZ2F,OAAOjH,IAAIiH,SAAS3I;IACpB+J,QAAQrI,IAAIqI,UAAU/J;IACtBgK,OAAQtI,IAAIsI,SAAShK;IACrBwK,QAAS9I,IAAI8I,UAAUxK;IACvByK,UAAU/I,IAAI+I;IACdC,aAAahJ,IAAIgJ,eAAe1K;IAChC+H,eAAerG,IAAIqG,iBAAiB/H;IACpC0D,QAAQkG,WAAWlI,IAAIgC,MAAM;IAC7BiH,YAAYjJ,IAAIiJ,cAAcjJ,IAAIkJ;IAClCA,WAAWlJ,IAAIkJ;IACfC,YAAYnJ,IAAImJ;EAClB;AACF;AApBS1I;;;AC9oBF,SAAS2I,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;;AAEJ;AATgBA;","names":["RUN_VALUE_FACET_SCAN","attributePredicateOperands","axisIsRunColumn","mergeRunFacetRows","mergeRunValueFacetRows","normalizeAttributeRows","runValueFacetsFromRuns","namespaceWhere","namespace","undefined","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","runWhere","query","and","workflow","workflows","push","anyOf","w","namespaces","n","origin","origins","o","statuses","tag","tags","array_contains","t","f","attributeSome","AND","listRuns","skip","offset","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","r","runValueFacets","axis","opts","axisIsRunColumn","runs","scan","RUN_VALUE_FACET_SCAN","runValueFacetsFromRuns","field","mergeRunValueFacetRows","value","listCheckpoints","getLatestCheckpointByName","name","findFirst","listCheckpointsByNamePrefix","prefixes","p","startsWith","putSignalWaiter","waiter","token","parallelGroup","takeSignalWaiter","delete","listSignalWaiters","prefix","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","jsonOrNull","takeBufferedSignal","bufferEvent","input","durableBufferedEvent","publishedAt","listBufferedEvents","Number","removeBufferedEvent","comparisons","attributePredicateOperands","column","comparator","operand","op","MATCHES_NOTHING","some","key","branches","bigOrNull","numOrUndef","v","workflowVersion","output","error","awaitingDecisionTaskId","recoveryAttempts","priority","updatedAt","getTime","kind","stepId","events","attempts","workerGroup","enqueuedAt","startedAt","finishedAt","durableManagedTables"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dudousxd/nestjs-durable-store-prisma",
-  "version": "0.16.0",
+  "version": "0.17.0",
   "description": "Prisma adapter for the nestjs-durable StateStore",
   "license": "MIT",
   "author": "Davide Carvalho",
@@ -26,8 +26,8 @@
     "prisma": "6.19.3",
     "typescript": "5.9.3",
     "tsup": "8.3.5",
-    "@dudousxd/nestjs-durable-core": "^0.67.0",
-    "@dudousxd/nestjs-durable-testing": "^0.13.0"
+    "@dudousxd/nestjs-durable-core": "^0.68.0",
+    "@dudousxd/nestjs-durable-testing": "^0.14.0"
   },
   "module": "./dist/index.js",
   "exports": {