@dudousxd/nestjs-durable-store-prisma 0.24.6 → 0.24.7
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.cjs +49 -11
- package/dist/index.cjs.map +1 -1
- package/dist/index.js +50 -12
- package/dist/index.js.map +1 -1
- package/package.json +4 -4
package/dist/index.cjs.map
CHANGED
|
@@ -1 +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 CheckpointNameKind,\n type CheckpointQuery,\n type CheckpointStat,\n type ChildWait,\n type OwnedLeaseReclaim,\n RUN_VALUE_FACET_SCAN,\n type RetentionPolicy,\n type RunFacetQuery,\n type RunFacetRow,\n type RunQuery,\n type RunStatus,\n type RunValueAxis,\n type RunValueFacetOptions,\n type RunValueFacetRow,\n SINGLETON_ACTIVE_STATUSES,\n type ScheduleQuery,\n type ScheduleRecord,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type StepSettlement,\n type BufferedSignalRow as StoreBufferedSignalRow,\n TERMINAL_RUN_STATUSES,\n type WorkflowRun,\n attributePredicateOperands,\n axisIsRunColumn,\n clearTerminalSingletonAdmission,\n mergeRunFacetRows,\n mergeRunValueFacetRows,\n normalizeAttributeRows,\n parseDuration,\n runValueFacetsFromRuns,\n singletonAdmissionDenialPatch,\n singletonAdmissionTags,\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 count(args?: Args): Promise<number>;\n /** Aggregate form — used by the run facets and `checkpointStats`, whose rows are aggregate cells,\n * not 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\ninterface ScheduleRow {\n id: string;\n namespace: string;\n workflow: string;\n paused: boolean;\n nextFireAt: bigint | null;\n tags: unknown;\n spec: unknown;\n state: unknown;\n createdAt: Date;\n updatedAt: Date;\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 /** Only needed for persisted schedules (`engine.schedules`) — add the `DurableSchedule` model. */\n durableSchedule?: Delegate<ScheduleRow>;\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 tryAdmitSingleton(\n runId: string,\n tag: string,\n workflow: string,\n limit: number,\n retryWakeAt?: number,\n ): Promise<boolean> {\n return this.db.$transaction(async (tx) => {\n const where = { workflow, status: { in: SINGLETON_ACTIVE_STATUSES } };\n // A locking write first: concurrent claims cannot read the same free slot.\n await tx.durableWorkflowRun.updateMany({ where, data: { workflow } });\n const rows = await tx.durableWorkflowRun.findMany({ where });\n const runs = rows.map(fromRunRow);\n const tags = singletonAdmissionTags(runs, runId, tag, workflow, limit);\n if (!tags) {\n const patch = singletonAdmissionDenialPatch(runs, runId, tag, workflow, retryWakeAt);\n if (patch)\n await tx.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n return false;\n }\n await tx.durableWorkflowRun.update({ where: { id: runId }, data: { tags } });\n return true;\n });\n }\n\n async createRun(run: WorkflowRun): Promise<void> {\n // One INSERT: `create` also reads the row back to return it, in a transaction on MySQL.\n await this.db.durableWorkflowRun.createMany({ data: [toRunData(run)] });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, inputPatch: Partial<WorkflowRun>): Promise<void> {\n const patch =\n inputPatch.status && TERMINAL_RUN_STATUSES.includes(inputPatch.status)\n ? await clearTerminalSingletonAdmission(runId, inputPatch, (id) => this.getRun(id))\n : inputPatch;\n // One UPDATE: `update` also reads the row back to return it, in a transaction on MySQL. A run\n // that does not exist still throws, as `update` does.\n const { count } = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: toRunPatch(patch),\n });\n if (count === 0 && !(await this.db.durableWorkflowRun.findUnique({ where: { id: runId } }))) {\n throw new Error(`run ${runId} not found`);\n }\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 async updateRunIf(\n runId: string,\n expectedStatuses: RunStatus[],\n inputPatch: Partial<WorkflowRun>,\n ): Promise<boolean> {\n if (expectedStatuses.length === 0) return false;\n const patch =\n inputPatch.status && TERMINAL_RUN_STATUSES.includes(inputPatch.status)\n ? await clearTerminalSingletonAdmission(runId, inputPatch, (id) => this.getRun(id))\n : inputPatch;\n // One conditional `updateMany` (`UPDATE … WHERE id = ? AND status IN (…)`): the status\n // predicate is the compare, the row count the answer, and a missing row matches nothing.\n const where = { id: runId, status: { in: expectedStatuses } };\n const data = toRunPatch(patch);\n // Nothing to write but (maybe) the attribute side-table: the compare is a read (an `updateMany`\n // with no data would report zero rows even on a match).\n const count = Object.keys(data).length\n ? (await this.db.durableWorkflowRun.updateMany({ where, data })).count\n : await this.db.durableWorkflowRun.count({ where });\n if (count === 0) return false;\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n return true;\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 getRuns(runIds: string[]): Promise<WorkflowRun[]> {\n if (runIds.length === 0) return [];\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { id: { in: [...new Set(runIds)] } },\n });\n return rows.map(fromRunRow);\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 deleteRuns(runIds: string[]): Promise<void> {\n if (runIds.length === 0) return;\n // Same cascade as deleteRun, one `IN (...)` per table, atomically.\n await this.db.$transaction(async (tx) => {\n await tx.durableStepCheckpoint.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableSignalWaiter.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableRunAttribute.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableWorkflowRun.deleteMany({ where: { id: { in: runIds } } });\n });\n }\n\n async pruneTerminalRuns(policy: RetentionPolicy, nowMs: number, limit: number): Promise<number> {\n // Only terminal statuses are ever eligible — a policy naming a live status would race the engine.\n const statuses = policy.statuses.filter((s) => TERMINAL_RUN_STATUSES.includes(s));\n if (statuses.length === 0 || limit <= 0) return 0;\n if (policy.maxAge == null && policy.maxCount == null) return 0;\n // A scoped policy only ever sees (and, for maxCount, counts) the runs its scope matches.\n const scoped = this.runWhere({ ...(policy.scope ?? {}), statuses });\n const ids = new Set<string>();\n if (policy.maxAge != null) {\n const cutoff = new Date(nowMs - parseDuration(policy.maxAge));\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { AND: [scoped, { updatedAt: { lt: cutoff } }] },\n select: { id: true },\n orderBy: { updatedAt: 'asc' }, // oldest first\n take: limit,\n });\n for (const r of rows) ids.add(r.id);\n }\n if (policy.maxCount != null && ids.size < limit) {\n // Everything past the newest `maxCount` rows of the scoped status set (skipped by OFFSET).\n const rows = await this.db.durableWorkflowRun.findMany({\n where: scoped,\n select: { id: true },\n orderBy: [{ updatedAt: 'desc' }, { id: 'desc' }],\n skip: policy.maxCount,\n take: limit,\n });\n for (const r of rows) {\n if (ids.size >= limit) break;\n ids.add(r.id);\n }\n }\n const doomed = [...ids].slice(0, limit);\n await this.deleteRuns(doomed);\n return doomed.length;\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 getCheckpoints(runId: string, seqs: number[]): Promise<StepCheckpoint[]> {\n const unique = [...new Set(seqs)];\n const rows = [];\n for (let at = 0; at < unique.length; at += 500) {\n rows.push(\n ...(await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: unique.slice(at, at + 500) } },\n })),\n );\n }\n return rows.sort((a, b) => a.seq - b.seq).map(fromCheckpointRow);\n }\n\n async getCheckpointsForSettle(runId: string, seqs: number[]): Promise<StepCheckpoint[]> {\n const unique = [...new Set(seqs)];\n const rows = [];\n for (let at = 0; at < unique.length; at += 500) {\n rows.push(\n ...(await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: unique.slice(at, at + 500) } },\n select: CHECKPOINT_SELECT_WITHOUT_INPUT,\n })),\n );\n }\n return rows\n .sort((a, b) => a.seq - b.seq)\n .map((row) => fromCheckpointRow({ ...row, input: 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 saveCheckpointIfPending(checkpoint: StepCheckpoint): Promise<boolean> {\n // One conditional `updateMany` (`UPDATE … WHERE run_id = ? AND seq = ? AND status = 'pending'`):\n // the status predicate is the compare, the row count the answer, and a missing row is never made.\n const { runId, seq, ...data } = toCheckpointData(checkpoint);\n const { count } = await this.db.durableStepCheckpoint.updateMany({\n where: { runId, seq, status: 'pending' },\n data,\n });\n return count > 0;\n }\n\n async saveCheckpointsIfPending(checkpoints: StepCheckpoint[]): Promise<boolean[]> {\n if (checkpoints.length === 0) return [];\n // Prisma has no multi-row conditional update, so in one transaction: read the batch's rows that\n // are still `pending`, decide each entry in order against them (an entry that settles a row makes\n // a later entry for it lose), then replace each winning row with its last winning entry: one\n // `deleteMany` that only deletes rows still `pending`, and one `createMany`. A row settled by\n // someone else between the read and the delete fails the batch (rolled back, so nothing is\n // written), and the engine settles its entries one by one.\n return this.db.$transaction(async (tx) => {\n const pending = new Set<string>();\n for (const [runId, seqs] of seqsByRun(checkpoints)) {\n for (let at = 0; at < seqs.length; at += 500) {\n const rows = await tx.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: seqs.slice(at, at + 500) }, status: 'pending' },\n select: { runId: true, seq: true },\n });\n for (const row of rows) pending.add(checkpointKey(row.runId, row.seq));\n }\n }\n const { wrote, writes } = decideIfPending(checkpoints, pending);\n for (const [runId, seqs] of seqsByRun(writes)) {\n for (let at = 0; at < seqs.length; at += 500) {\n const chunk = seqs.slice(at, at + 500);\n const { count } = await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { in: chunk }, status: 'pending' },\n });\n if (count !== chunk.length) {\n throw new Error('a checkpoint of the batch was settled while the batch was written');\n }\n }\n }\n for (let at = 0; at < writes.length; at += 500) {\n await tx.durableStepCheckpoint.createMany({\n data: writes.slice(at, at + 500).map(toCheckpointData),\n });\n }\n return wrote;\n });\n }\n\n async settleCheckpointsIfPending(settlements: StepSettlement[]): Promise<boolean[]> {\n const wrote = settlements.map(() => false);\n if (settlements.length === 0) return wrote;\n // A settlement never leaves its row `pending`, so only the first entry for a row can win.\n const seen = new Set<string>();\n const firsts: number[] = [];\n settlements.forEach((s, i) => {\n const key = checkpointKey(s.runId, s.seq);\n if (seen.has(key)) return;\n seen.add(key);\n firsts.push(i);\n });\n const dialect = rawSettleDialect(this.db);\n if (!dialect) {\n // One conditional `updateMany` per entry, in one transaction: the row count is its answer.\n const settle = async (db: Pick<DurablePrismaClient, 'durableStepCheckpoint'>) => {\n for (const i of firsts) {\n const s = settlements[i] as StepSettlement;\n const { count } = await db.durableStepCheckpoint.updateMany({\n where: { runId: s.runId, seq: s.seq, status: 'pending' },\n data: {\n status: s.status,\n output: jsonOrNull(s.output),\n error: jsonOrNull(s.error),\n events: jsonOrNull(s.events),\n startedAt: s.startedAt,\n finishedAt: s.finishedAt,\n },\n });\n wrote[i] = count > 0;\n }\n };\n if (firsts.length === 1) await settle(this.db);\n else await this.db.$transaction((tx) => settle(tx));\n return wrote;\n }\n // Prisma has no multi-row update with a value per row, so a batch is settled with raw SQL on the\n // models' fixed table and column names, 500 rows a statement, in one transaction.\n await this.db.$transaction(async (tx) => {\n const raw = tx as unknown as RawPrismaClient;\n for (let at = 0; at < firsts.length; at += 500) {\n const chunk = firsts.slice(at, at + 500);\n const won = await dialect(\n raw,\n chunk.map((i) => settlements[i] as StepSettlement),\n );\n for (const i of chunk) {\n const s = settlements[i] as StepSettlement;\n wrote[i] = won.has(checkpointKey(s.runId, s.seq));\n }\n }\n });\n return wrote;\n }\n\n async saveCheckpoints(checkpoints: StepCheckpoint[]): Promise<void> {\n if (checkpoints.length === 0) return;\n await this.db.$transaction((tx) => replaceCheckpoints(tx, checkpoints));\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 listOrphanedRuns(\n nowMs: number,\n limit: number,\n namespace?: string,\n ownedBy?: OwnedLeaseReclaim,\n ): Promise<WorkflowRun[]> {\n if (limit <= 0) return [];\n const rows = await this.db.durableWorkflowRun.findMany({\n where: {\n status: { in: ['running', 'cancelling'] },\n OR: [\n { lockedUntil: null },\n { lockedUntil: { lte: new Date(nowMs) } },\n // A live lease left by a previous process with the caller's own instance id.\n ...(ownedBy\n ? [{ lockedBy: ownedBy.owner, lockedUntil: { lt: new Date(ownedBy.lockedBefore) } }]\n : []),\n ],\n ...namespaceWhere(namespace),\n },\n orderBy: { createdAt: 'asc' },\n take: limit,\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, limit?: number): 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 orderBy: { wakeAt: 'asc' },\n ...(limit !== undefined ? { take: limit } : {}),\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, owner?: 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: owner === undefined ? { id: runId } : { id: runId, lockedBy: owner },\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 async countRuns(query: Omit<RunQuery, 'limit' | 'offset'>): Promise<number> {\n return this.db.durableWorkflowRun.count({ where: this.runWhere(query) });\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 // ---- persisted schedules ----------------------------------------------------------------------\n\n private schedules(): Delegate<ScheduleRow> {\n const delegate = this.db.durableSchedule;\n if (!delegate) {\n throw new Error(\n 'persisted schedules need the DurableSchedule model — copy it from prisma/schema.prisma into your schema and re-run `prisma generate`',\n );\n }\n return delegate;\n }\n\n async saveSchedule(record: ScheduleRecord): Promise<void> {\n const data = toScheduleData(record);\n await this.schedules().upsert({ where: { id: record.id }, create: data, update: data });\n }\n\n async getSchedule(id: string): Promise<ScheduleRecord | null> {\n const row = await this.schedules().findUnique({ where: { id } });\n return row ? fromScheduleRow(row) : null;\n }\n\n /** One conditional `updateMany`: the compare-and-set on `next_fire_at` is a single statement. */\n async updateSchedule(\n id: string,\n patch: Partial<Omit<ScheduleRecord, 'id' | 'createdAt'>>,\n expectedNextFireAt?: number | null,\n ): Promise<boolean> {\n const data: Record<string, unknown> = {};\n if (patch.namespace !== undefined) data.namespace = patch.namespace;\n if (patch.workflow !== undefined) data.workflow = patch.workflow;\n if (patch.paused !== undefined) data.paused = patch.paused;\n if ('nextFireAt' in patch)\n data.nextFireAt = patch.nextFireAt == null ? null : BigInt(patch.nextFireAt);\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if (patch.spec !== undefined) data.spec = patch.spec;\n if (patch.state !== undefined) data.state = patch.state;\n if (patch.updatedAt !== undefined) data.updatedAt = patch.updatedAt;\n if (!Object.keys(data).length) return (await this.getSchedule(id)) !== null;\n const where: Record<string, unknown> = { id };\n if (expectedNextFireAt !== undefined)\n where.nextFireAt = expectedNextFireAt === null ? null : BigInt(expectedNextFireAt);\n const { count } = await this.schedules().updateMany({ where, data });\n return count > 0;\n }\n\n async deleteSchedule(id: string): Promise<boolean> {\n const { count } = await this.schedules().deleteMany({ where: { id } });\n return count > 0;\n }\n\n async listSchedules(query: ScheduleQuery): Promise<ScheduleRecord[]> {\n const where: Record<string, unknown> = {};\n if (query.namespace !== undefined) where.namespace = query.namespace;\n if (query.workflow !== undefined) where.workflow = query.workflow;\n if (query.paused !== undefined) where.paused = query.paused;\n if (query.tag !== undefined) where.tags = { array_contains: query.tag };\n if (query.dueBy !== undefined) {\n where.AND = [{ paused: false }, { nextFireAt: { lte: BigInt(query.dueBy) } }];\n }\n const rows = await this.schedules().findMany({\n where,\n // Soonest-due first, never-firing (NULL) last, id as the stable tie-break.\n orderBy: [{ nextFireAt: { sort: 'asc', nulls: 'last' } }, { id: 'asc' }],\n take: query.limit,\n skip: query.offset,\n });\n return rows.map(fromScheduleRow);\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 listCheckpointsForReplay(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n select: CHECKPOINT_SELECT_WITHOUT_INPUT,\n });\n // An open or failed step keeps its input; read by seq, so a row settled since is still filled.\n const open = rows.filter((row) => row.status !== 'completed').map((row) => row.seq);\n const inputs = new Map<number, unknown>();\n for (let at = 0; at < open.length; at += 500) {\n const found = await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: open.slice(at, at + 500) } },\n select: { seq: true, input: true },\n });\n for (const row of found) inputs.set(row.seq, row.input);\n }\n return rows.map((row) => fromCheckpointRow({ ...row, input: inputs.get(row.seq) ?? null }));\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 hasCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n statuses: StepCheckpoint['status'][],\n ): Promise<boolean> {\n if (statuses.length === 0) return false;\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, seq: { gte: fromSeq, lte: toSeq }, status: { in: statuses } },\n select: { seq: true },\n orderBy: { seq: 'desc' },\n });\n return row !== null;\n }\n\n async countCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n statuses: StepCheckpoint['status'][],\n ): Promise<number> {\n if (statuses.length === 0) return 0;\n return this.db.durableStepCheckpoint.count({\n where: { runId, seq: { gte: fromSeq, lte: toSeq }, status: { in: statuses } },\n });\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 // On some providers (SQLite) `startsWith` compiles to a `LIKE` that reads `_` and `%` as wildcards,\n // so it can match more than the prefix: keep only the exact matches.\n return rows.filter((r) => prefixes.some((p) => r.name.startsWith(p))).map(fromCheckpointRow);\n }\n\n /**\n * One `groupBy(parallelGroup, status)` per {@link CheckpointNameKind}, each narrowed to its kind by\n * a name-prefix predicate, run concurrently — Prisma cannot group by a `CASE`, so the kind is the\n * `where` instead. `minEnqueuedAt` reads a NULL `enqueuedAt` as `startedAt` (as\n * {@link fromCheckpointRow} does): a bucket whose non-null `enqueuedAt` count falls short of its\n * row count has such rows, and only for those kinds is the NULL subset's `min(startedAt)` asked for.\n *\n * On SQLite `startsWith` is a case-insensitive `LIKE`, as in {@link listCheckpointsByNamePrefix};\n * the kind prefixes are lower-case and wildcard-free, so only a step whose name starts with one of\n * them in another case would be classified differently there.\n */\n async checkpointStats(\n runId: string,\n opts?: { group?: string | undefined },\n ): Promise<CheckpointStat[]> {\n const scope = opts?.group === undefined ? { runId } : { runId, parallelGroup: opts.group };\n const grouped = await Promise.all(\n NAME_KINDS.map(async ({ kind, where }) => ({\n kind,\n where,\n rows: (await this.db.durableStepCheckpoint.groupBy({\n by: ['parallelGroup', 'status'],\n where: { ...scope, ...where },\n _count: { _all: true, enqueuedAt: true },\n _min: { seq: true, name: true, enqueuedAt: true, startedAt: true },\n _max: { seq: true, name: true, startedAt: true, finishedAt: true },\n _sum: { attempts: true },\n })) as CheckpointStatRow[],\n })),\n );\n const stats = await Promise.all(\n grouped.map(async ({ kind, where, rows }) => {\n const unenqueued = rows.some((r) => r._count.enqueuedAt < r._count._all)\n ? await this.unenqueuedStartedAt({ ...scope, ...where })\n : new Map<string, Date>();\n return rows.map((r) => toCheckpointStat(kind, r, unenqueued));\n }),\n );\n return stats.flat();\n }\n\n /** `min(startedAt)` per `(parallelGroup, status)` over the rows whose `enqueuedAt` is NULL. */\n private async unenqueuedStartedAt(where: Record<string, unknown>): Promise<Map<string, Date>> {\n const rows = (await this.db.durableStepCheckpoint.groupBy({\n by: ['parallelGroup', 'status'],\n where: { ...where, enqueuedAt: null },\n _min: { startedAt: true },\n })) as { parallelGroup: string | null; status: string; _min: { startedAt: Date } }[];\n return new Map(rows.map((r) => [bucketKey(r.parallelGroup, r.status), r._min.startedAt]));\n }\n\n /** {@link CheckpointQuery} as one `findMany`, in `seq` order, paged by `skip`/`take`. Ungrouped rows\n * are kept past `excludeGroups` explicitly: `NOT IN` alone drops a NULL `parallelGroup`. */\n async queryCheckpoints(runId: string, query: CheckpointQuery): Promise<StepCheckpoint[]> {\n if (query.statuses?.length === 0 || query.namePrefixes?.length === 0) return [];\n const and: Record<string, unknown>[] = [];\n if (query.excludeGroups?.length) {\n and.push({\n OR: [{ parallelGroup: null }, { parallelGroup: { notIn: query.excludeGroups } }],\n });\n }\n if (query.namePrefixes) {\n and.push({ OR: query.namePrefixes.map((p) => ({ name: { startsWith: p } })) });\n }\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: {\n runId,\n ...(query.group === undefined ? {} : { parallelGroup: query.group }),\n ...(query.statuses ? { status: { in: query.statuses } } : {}),\n ...(and.length ? { AND: and } : {}),\n },\n orderBy: { seq: 'asc' },\n skip: query.offset,\n take: query.limit,\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 // On some providers (SQLite) `startsWith` compiles to a `LIKE` that reads `_` and `%` as wildcards,\n // so it can match more than the prefix: keep only the exact matches.\n return rows\n .filter((r) => r.token.startsWith(prefix))\n .map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async registerChildWaits(entries: ChildWait[]): Promise<void> {\n if (entries.length === 0) return;\n // Prisma has no multi-row upsert: replace the waiters and the placeholders, one `deleteMany`\n // and one `createMany` per chunk of each, inside a single transaction.\n await this.db.$transaction(async (tx) => {\n for (let at = 0; at < entries.length; at += 500) {\n const chunk = entries.slice(at, at + 500);\n await tx.durableSignalWaiter.deleteMany({\n where: { token: { in: chunk.map(({ waiter }) => waiter.token) } },\n });\n await tx.durableSignalWaiter.createMany({\n data: chunk.map(({ waiter }) => ({\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n })),\n });\n }\n await replaceCheckpoints(\n tx,\n entries.map(({ checkpoint }) => checkpoint),\n );\n });\n }\n\n async compactCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n into: StepCheckpoint,\n ): Promise<void> {\n await this.db.$transaction(async (tx) => {\n await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { gte: fromSeq, lte: toSeq } },\n });\n const data = toCheckpointData(into);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: into.runId, seq: into.seq } },\n create: data,\n update: data,\n });\n });\n }\n\n async listSignalWaitersByRun(runIds: string[]): Promise<SignalWaiter[]> {\n if (runIds.length === 0) return [];\n const rows = await this.db.durableSignalWaiter.findMany({ where: { runId: { in: runIds } } });\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 hasSignalWaiter(runId: string, tokenPrefix: string): Promise<boolean> {\n // On SQLite, Prisma's `startsWith` is a bare `LIKE`: `_`/`%` in the prefix act as wildcards and\n // case is ignored. So a hit is confirmed in JS; only a pattern match that is not a real prefix\n // match pays for the full read.\n const where = { runId, token: { startsWith: tokenPrefix } };\n const first = await this.db.durableSignalWaiter.findFirst({ where, select: { token: true } });\n if (!first) return false;\n if (first.token.startsWith(tokenPrefix)) return true;\n const rows = await this.db.durableSignalWaiter.findMany({ where, select: { token: true } });\n return rows.some((r) => r.token.startsWith(tokenPrefix));\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 listBufferedSignals(\n tokenPrefix: string,\n afterId: string | undefined,\n limit: number,\n ): Promise<StoreBufferedSignalRow[]> {\n // Ids as numbers: Prisma takes a number for a `BigInt` column too, and the SQLite test schema's\n // id is an `Int`. An auto-increment stays far below 2^53.\n const rows = await this.db.durableBufferedSignal.findMany({\n where: {\n token: { startsWith: tokenPrefix },\n ...(afterId !== undefined ? { id: { gt: Number(afterId) } } : {}),\n },\n orderBy: { id: 'asc' },\n take: limit,\n });\n // `startsWith` becomes a `LIKE`, which on SQLite still reads `_`/`%` as wildcards: keep only the\n // real prefix matches.\n return rows\n .filter((r) => r.token.startsWith(tokenPrefix))\n .map((r) => ({ id: String(r.id), token: r.token, payload: r.payload ?? undefined }));\n }\n\n async deleteBufferedSignals(ids: string[]): Promise<void> {\n if (ids.length === 0) return;\n await this.db.durableBufferedSignal.deleteMany({ where: { id: { in: ids.map(Number) } } });\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', // '' is the default pool too\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\n/** The name prefix each non-`step` {@link CheckpointNameKind} is, as `checkpointNameKind` reads it. */\nconst KIND_PREFIXES: [CheckpointNameKind, string][] = [\n ['child', 'signal:child:'],\n ['folded', 'fan:'],\n ['spawn', 'spawn:'],\n];\n\n/** Each {@link CheckpointNameKind} as the `where` that selects its rows; `step` is \"none of the others\". */\nconst NAME_KINDS: { kind: CheckpointNameKind; where: Record<string, unknown> }[] = [\n ...KIND_PREFIXES.map(([kind, prefix]) => ({ kind, where: { name: { startsWith: prefix } } })),\n {\n kind: 'step',\n where: { NOT: KIND_PREFIXES.map(([, prefix]) => ({ name: { startsWith: prefix } })) },\n },\n];\n\n/** One `groupBy` row of {@link PrismaStateStore.checkpointStats}. */\ntype CheckpointStatRow = {\n parallelGroup: string | null;\n status: string;\n _count: { _all: number; enqueuedAt: number };\n _min: { seq: number; name: string; enqueuedAt: Date | null; startedAt: Date };\n _max: { seq: number; name: string; startedAt: Date; finishedAt: Date };\n _sum: { attempts: number | bigint | null };\n};\n\nfunction bucketKey(group: string | null, status: string): string {\n return JSON.stringify([group, status]);\n}\n\nfunction toCheckpointStat(\n nameKind: CheckpointNameKind,\n r: CheckpointStatRow,\n unenqueued: Map<string, Date>,\n): CheckpointStat {\n const fallback = unenqueued.get(bucketKey(r.parallelGroup, r.status));\n const enqueued = r._min.enqueuedAt;\n const minEnqueuedAt =\n enqueued && fallback ? (enqueued < fallback ? enqueued : fallback) : (enqueued ?? fallback);\n return {\n group: r.parallelGroup,\n status: r.status as StepCheckpoint['status'],\n nameKind,\n count: r._count._all,\n minSeq: r._min.seq,\n maxSeq: r._max.seq,\n minName: r._min.name,\n maxName: r._max.name,\n // Every row has `enqueuedAt` or is in the NULL subset, so one of the two is set.\n minEnqueuedAt: minEnqueuedAt as Date,\n minStartedAt: r._min.startedAt,\n maxStartedAt: r._max.startedAt,\n maxFinishedAt: r._max.finishedAt,\n sumAttempts: Number(r._sum.attempts ?? 0),\n };\n}\n\n/** `checkpoints`' distinct seqs, by run. */\nfunction seqsByRun(checkpoints: { runId: string; seq: number }[]): Map<string, number[]> {\n const byRun = new Map<string, Set<number>>();\n for (const { runId, seq } of checkpoints) {\n const seqs = byRun.get(runId) ?? new Set<number>();\n seqs.add(seq);\n byRun.set(runId, seqs);\n }\n return new Map([...byRun].map(([runId, seqs]) => [runId, [...seqs]]));\n}\n\nconst checkpointKey = (runId: string, seq: number): string => `${runId}\\u0000${seq}`;\n\n/**\n * `saveCheckpointsIfPending`'s answers for `checkpoints` against the rows that were `pending` before\n * the batch (`pending`, by {@link checkpointKey}), in order: an entry wins while its row is still\n * pending, and an entry that is not `pending` itself settles the row. `writes` holds each row's\n * last winning entry.\n */\nfunction decideIfPending(\n checkpoints: StepCheckpoint[],\n pending: Set<string>,\n): { wrote: boolean[]; writes: StepCheckpoint[] } {\n const wrote: boolean[] = [];\n const writes = new Map<string, StepCheckpoint>();\n for (const checkpoint of checkpoints) {\n const key = checkpointKey(checkpoint.runId, checkpoint.seq);\n if (!pending.has(key)) {\n wrote.push(false);\n continue;\n }\n wrote.push(true);\n writes.set(key, checkpoint);\n if (checkpoint.status !== 'pending') pending.delete(key);\n }\n return { wrote, writes: [...writes.values()] };\n}\n\n/**\n * Write `checkpoints` (distinct rows), inserting or overwriting each. Prisma has no multi-row\n * upsert, so the rows are replaced: one `deleteMany` and one `createMany` per chunk. Call inside a\n * transaction.\n */\nasync function replaceCheckpoints(\n tx: DurablePrismaTx,\n checkpoints: StepCheckpoint[],\n): Promise<void> {\n for (const [runId, seqs] of seqsByRun(checkpoints)) {\n for (let at = 0; at < seqs.length; at += 500) {\n await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { in: seqs.slice(at, at + 500) } },\n });\n }\n }\n for (let at = 0; at < checkpoints.length; at += 500) {\n await tx.durableStepCheckpoint.createMany({\n data: checkpoints.slice(at, at + 500).map(toCheckpointData),\n });\n }\n}\n\n/** Every checkpoint column but `input`, as a Prisma `select`. */\nconst CHECKPOINT_SELECT_WITHOUT_INPUT = {\n runId: true,\n seq: true,\n name: true,\n kind: true,\n stepId: true,\n status: true,\n output: true,\n error: true,\n events: true,\n attempts: true,\n workerGroup: true,\n parallelGroup: true,\n wakeAt: true,\n enqueuedAt: true,\n startedAt: true,\n finishedAt: true,\n} satisfies Record<Exclude<keyof CheckpointRow, 'input'>, true>;\n\n/** The raw-query half of a Prisma client (or of its interactive-transaction client). */\ninterface RawPrismaClient {\n $queryRawUnsafe<T = unknown>(query: string, ...values: unknown[]): Promise<T>;\n $executeRawUnsafe(query: string, ...values: unknown[]): Promise<number>;\n}\n\n/** Settles distinct rows with raw SQL and resolves the keys ({@link checkpointKey}) it wrote. */\ntype RawSettle = (db: RawPrismaClient, settlements: StepSettlement[]) => Promise<Set<string>>;\n\nconst jsonText = (v: unknown): string | null => (v == null ? null : JSON.stringify(v));\n\n/**\n * The raw settle for the client's database, or `undefined` (a client without raw queries, or a\n * provider without one here), which settles row by row through `updateMany`.\n */\nfunction rawSettleDialect(db: DurablePrismaClient): RawSettle | undefined {\n const client = db as unknown as Partial<RawPrismaClient> & { _activeProvider?: string };\n if (typeof client.$queryRawUnsafe !== 'function') return undefined;\n if (client._activeProvider === 'postgresql') return settleRowsPostgres;\n if (client._activeProvider === 'mysql') return settleRowsMysql;\n if (client._activeProvider === 'sqlite') return settleRowsSqlite;\n return undefined;\n}\n\n/**\n * One `UPDATE … FROM (VALUES …) WHERE status = 'pending' RETURNING`: the predicate is each row's\n * compare-and-set, and `RETURNING` names the rows written. Prisma's `DateTime` is a `timestamp(3)`\n * holding UTC, hence the conversion from the exact instant.\n */\nconst settleRowsPostgres: RawSettle = async (db, settlements) => {\n const values: unknown[] = [];\n const rows = settlements.map((s) => {\n const n = values.length;\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n s.startedAt.toISOString(),\n s.finishedAt.toISOString(),\n );\n const p = (k: number) => `$${n + k}`;\n return `(${p(1)}::text, ${p(2)}::integer, ${p(3)}::text, ${p(4)}::jsonb, ${p(5)}::jsonb, ${p(6)}::jsonb, (${p(7)}::timestamptz AT TIME ZONE 'UTC'), (${p(8)}::timestamptz AT TIME ZONE 'UTC'))`;\n });\n const written = await db.$queryRawUnsafe<{ run_id: string; seq: number }[]>(\n `UPDATE \"durable_step_checkpoints\" AS c SET status = v.status, output = v.output,\n error = v.error, events = v.events, started_at = v.started_at, finished_at = v.finished_at\n FROM (VALUES ${rows.join(', ')}) AS v(run_id, seq, status, output, error, events, started_at,\n finished_at)\n WHERE c.run_id = v.run_id AND c.seq = v.seq AND c.status = 'pending'\n RETURNING c.run_id, c.seq`,\n ...values,\n );\n return new Set(written.map((row) => checkpointKey(row.run_id, Number(row.seq))));\n};\n\n/**\n * MySQL has no `RETURNING`: lock the rows still `pending` (`SELECT … FOR UPDATE`), then update\n * those from a derived table of the values. Prisma's `DateTime` is a `DATETIME(3)` holding UTC.\n */\nconst settleRowsMysql: RawSettle = async (db, settlements) => {\n const pending = new Set<string>();\n for (const [runId, seqs] of seqsByRun(settlements)) {\n const rows = await db.$queryRawUnsafe<{ run_id: string; seq: number }[]>(\n `SELECT run_id, seq FROM durable_step_checkpoints WHERE run_id = ? AND seq IN (${seqs\n .map(() => '?')\n .join(', ')}) AND status = 'pending' FOR UPDATE`,\n runId,\n ...seqs,\n );\n for (const row of rows) pending.add(checkpointKey(row.run_id, Number(row.seq)));\n }\n const won = settlements.filter((s) => pending.has(checkpointKey(s.runId, s.seq)));\n if (won.length === 0) return pending;\n const at = (d: Date) => d.toISOString().replace('T', ' ').replace('Z', '');\n const values: unknown[] = [];\n const rows = won.map((s, i) => {\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n at(s.startedAt),\n at(s.finishedAt),\n );\n return i === 0\n ? 'SELECT ? AS run_id, ? AS seq, ? AS status, ? AS output, ? AS error, ? AS events, ? AS started_at, ? AS finished_at'\n : 'SELECT ?, ?, ?, ?, ?, ?, ?, ?';\n });\n const updated = await db.$executeRawUnsafe(\n `UPDATE durable_step_checkpoints AS c JOIN (${rows.join(' UNION ALL ')}) AS v\n ON c.run_id = v.run_id AND c.seq = v.seq\n SET c.status = v.status, c.output = CAST(v.output AS JSON), c.error = CAST(v.error AS JSON),\n c.events = CAST(v.events AS JSON), c.started_at = v.started_at, c.finished_at = v.finished_at\n WHERE c.status = 'pending'`,\n ...values,\n );\n if (updated !== won.length) {\n throw new Error('a checkpoint of the batch was settled while the batch was written');\n }\n return pending;\n};\n\n/**\n * SQLite's `UPDATE … FROM … RETURNING` (3.35+), as on Postgres. Prisma keeps a `DateTime` as epoch\n * milliseconds and a `Json` as text there.\n */\nconst settleRowsSqlite: RawSettle = async (db, settlements) => {\n const values: unknown[] = [];\n const rows = settlements.map((s) => {\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n s.startedAt.getTime(),\n s.finishedAt.getTime(),\n );\n return '(?, ?, ?, ?, ?, ?, ?, ?)';\n });\n const written = await db.$queryRawUnsafe<{ run_id: string; seq: number | bigint }[]>(\n `WITH v(run_id, seq, status, output, error, events, started_at, finished_at) AS (VALUES ${rows.join(', ')})\n UPDATE durable_step_checkpoints SET status = v.status, output = v.output, error = v.error,\n events = v.events, started_at = v.started_at, finished_at = v.finished_at\n FROM v\n WHERE durable_step_checkpoints.run_id = v.run_id AND durable_step_checkpoints.seq = v.seq\n AND durable_step_checkpoints.status = 'pending'\n RETURNING run_id, seq`,\n ...values,\n );\n return new Set(written.map((row) => checkpointKey(row.run_id, Number(row.seq))));\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\nfunction toScheduleData(r: ScheduleRecord) {\n return {\n id: r.id,\n namespace: r.namespace,\n workflow: r.workflow,\n paused: r.paused,\n nextFireAt: r.nextFireAt == null ? null : BigInt(r.nextFireAt),\n tags: jsonOrNull(r.tags),\n spec: r.spec,\n state: r.state,\n createdAt: r.createdAt,\n updatedAt: r.updatedAt,\n };\n}\n\nfunction fromScheduleRow(row: ScheduleRow): ScheduleRecord {\n const tags = Array.isArray(row.tags) ? (row.tags as string[]) : undefined;\n return {\n id: row.id,\n namespace: row.namespace,\n workflow: row.workflow,\n paused: row.paused,\n nextFireAt: row.nextFireAt == null ? null : Number(row.nextFireAt),\n ...(tags?.length ? { tags } : {}),\n spec: (row.spec ?? {}) as Record<string, unknown>,\n state: (row.state ?? {}) as Record<string, unknown>,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\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 'durable_schedules',\n ];\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACAA,iCAsCO;AA4IP,SAASA,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EAjMb,OAiMaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,kBACJC,OACAC,KACAC,UACAC,OACAC,aACkB;AAClB,WAAO,KAAKN,GAAGO,aAAa,OAAOC,OAAAA;AACjC,YAAMC,QAAQ;QAAEL;QAAUM,QAAQ;UAAEC,IAAIC;QAA0B;MAAE;AAEpE,YAAMJ,GAAGK,mBAAmBC,WAAW;QAAEL;QAAOM,MAAM;UAAEX;QAAS;MAAE,CAAA;AACnE,YAAMY,OAAO,MAAMR,GAAGK,mBAAmBI,SAAS;QAAER;MAAM,CAAA;AAC1D,YAAMS,OAAOF,KAAKG,IAAIC,UAAAA;AACtB,YAAMC,WAAOC,mDAAuBJ,MAAMhB,OAAOC,KAAKC,UAAUC,KAAAA;AAChE,UAAI,CAACgB,MAAM;AACT,cAAME,YAAQC,0DAA8BN,MAAMhB,OAAOC,KAAKC,UAAUE,WAAAA;AACxE,YAAIiB,MACF,OAAMf,GAAGK,mBAAmBY,OAAO;UAAEhB,OAAO;YAAEiB,IAAIxB;UAAM;UAAGa,MAAMY,WAAWJ,KAAAA;QAAO,CAAA;AACrF,eAAO;MACT;AACA,YAAMf,GAAGK,mBAAmBY,OAAO;QAAEhB,OAAO;UAAEiB,IAAIxB;QAAM;QAAGa,MAAM;UAAEM;QAAK;MAAE,CAAA;AAC1E,aAAO;IACT,CAAA;EACF;EAEA,MAAMO,UAAUC,KAAiC;AAE/C,UAAM,KAAK7B,GAAGa,mBAAmBiB,WAAW;MAAEf,MAAM;QAACgB,UAAUF,GAAAA;;IAAM,CAAA;AACrE,UAAM,KAAKG,kBAAkBH,IAAIH,IAAIG,IAAII,gBAAgB;EAC3D;EAEA,MAAMC,UAAUhC,OAAeiC,YAAiD;AAC9E,UAAMZ,QACJY,WAAWzB,UAAU0B,iDAAsBC,SAASF,WAAWzB,MAAM,IACjE,UAAM4B,4DAAgCpC,OAAOiC,YAAY,CAACT,OAAO,KAAKa,OAAOb,EAAAA,CAAAA,IAC7ES;AAGN,UAAM,EAAEK,MAAK,IAAK,MAAM,KAAKxC,GAAGa,mBAAmBC,WAAW;MAC5DL,OAAO;QAAEiB,IAAIxB;MAAM;MACnBa,MAAMY,WAAWJ,KAAAA;IACnB,CAAA;AACA,QAAIiB,UAAU,KAAK,CAAE,MAAM,KAAKxC,GAAGa,mBAAmB4B,WAAW;MAAEhC,OAAO;QAAEiB,IAAIxB;MAAM;IAAE,CAAA,GAAK;AAC3F,YAAM,IAAIwC,MAAM,OAAOxC,KAAAA,YAAiB;IAC1C;AAEA,QAAI,sBAAsBqB,MAAO,OAAM,KAAKS,kBAAkB9B,OAAOqB,MAAMU,gBAAgB;EAC7F;EAEA,MAAMU,YACJzC,OACA0C,kBACAT,YACkB;AAClB,QAAIS,iBAAiBC,WAAW,EAAG,QAAO;AAC1C,UAAMtB,QACJY,WAAWzB,UAAU0B,iDAAsBC,SAASF,WAAWzB,MAAM,IACjE,UAAM4B,4DAAgCpC,OAAOiC,YAAY,CAACT,OAAO,KAAKa,OAAOb,EAAAA,CAAAA,IAC7ES;AAGN,UAAM1B,QAAQ;MAAEiB,IAAIxB;MAAOQ,QAAQ;QAAEC,IAAIiC;MAAiB;IAAE;AAC5D,UAAM7B,OAAOY,WAAWJ,KAAAA;AAGxB,UAAMiB,QAAQM,OAAOC,KAAKhC,IAAAA,EAAM8B,UAC3B,MAAM,KAAK7C,GAAGa,mBAAmBC,WAAW;MAAEL;MAAOM;IAAK,CAAA,GAAIyB,QAC/D,MAAM,KAAKxC,GAAGa,mBAAmB2B,MAAM;MAAE/B;IAAM,CAAA;AACnD,QAAI+B,UAAU,EAAG,QAAO;AACxB,QAAI,sBAAsBjB,MAAO,OAAM,KAAKS,kBAAkB9B,OAAOqB,MAAMU,gBAAgB;AAC3F,WAAO;EACT;;;EAIA,MAAcD,kBACZ9B,OACA8C,YACe;AACf,UAAM,KAAKhD,GAAGiD,oBAAoBC,WAAW;MAAEzC,OAAO;QAAEP;MAAM;IAAE,CAAA;AAChE,UAAMc,WAAOmC,mDAAuBjD,OAAO8C,UAAAA;AAC3C,QAAIhC,KAAK6B,OAAQ,OAAM,KAAK7C,GAAGiD,oBAAoBnB,WAAW;MAAEf,MAAMC;IAAK,CAAA;EAC7E;EAEA,MAAMuB,OAAOrC,OAA4C;AACvD,UAAMkD,MAAM,MAAM,KAAKpD,GAAGa,mBAAmB4B,WAAW;MAAEhC,OAAO;QAAEiB,IAAIxB;MAAM;IAAE,CAAA;AAC/E,WAAOkD,MAAMhC,WAAWgC,GAAAA,IAAO;EACjC;EAEA,MAAMC,QAAQC,QAA0C;AACtD,QAAIA,OAAOT,WAAW,EAAG,QAAO,CAAA;AAChC,UAAM7B,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO;QAAEiB,IAAI;UAAEf,IAAI;eAAI,IAAI4C,IAAID,MAAAA;;QAAS;MAAE;IAC5C,CAAA;AACA,WAAOtC,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAMoC,UAAUtD,OAA8B;AAE5C,UAAM,KAAKF,GAAGyD,sBAAsBP,WAAW;MAAEzC,OAAO;QAAEP;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKF,GAAG0D,oBAAoBR,WAAW;MAAEzC,OAAO;QAAEP;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKF,GAAGiD,oBAAoBC,WAAW;MAAEzC,OAAO;QAAEP;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKF,GAAGa,mBAAmBqC,WAAW;MAAEzC,OAAO;QAAEiB,IAAIxB;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMyD,WAAWL,QAAiC;AAChD,QAAIA,OAAOT,WAAW,EAAG;AAEzB,UAAM,KAAK7C,GAAGO,aAAa,OAAOC,OAAAA;AAChC,YAAMA,GAAGiD,sBAAsBP,WAAW;QAAEzC,OAAO;UAAEP,OAAO;YAAES,IAAI2C;UAAO;QAAE;MAAE,CAAA;AAC7E,YAAM9C,GAAGkD,oBAAoBR,WAAW;QAAEzC,OAAO;UAAEP,OAAO;YAAES,IAAI2C;UAAO;QAAE;MAAE,CAAA;AAC3E,YAAM9C,GAAGyC,oBAAoBC,WAAW;QAAEzC,OAAO;UAAEP,OAAO;YAAES,IAAI2C;UAAO;QAAE;MAAE,CAAA;AAC3E,YAAM9C,GAAGK,mBAAmBqC,WAAW;QAAEzC,OAAO;UAAEiB,IAAI;YAAEf,IAAI2C;UAAO;QAAE;MAAE,CAAA;IACzE,CAAA;EACF;EAEA,MAAMM,kBAAkBC,QAAyBC,OAAezD,OAAgC;AAE9F,UAAM0D,WAAWF,OAAOE,SAASC,OAAO,CAACC,MAAM7B,iDAAsBC,SAAS4B,CAAAA,CAAAA;AAC9E,QAAIF,SAASlB,WAAW,KAAKxC,SAAS,EAAG,QAAO;AAChD,QAAIwD,OAAOK,UAAU,QAAQL,OAAOM,YAAY,KAAM,QAAO;AAE7D,UAAMC,SAAS,KAAKC,SAAS;MAAE,GAAIR,OAAOS,SAAS,CAAC;MAAIP;IAAS,CAAA;AACjE,UAAMQ,MAAM,oBAAIhB,IAAAA;AAChB,QAAIM,OAAOK,UAAU,MAAM;AACzB,YAAMM,SAAS,IAAIC,KAAKX,YAAQY,0CAAcb,OAAOK,MAAM,CAAA;AAC3D,YAAMlD,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;QACrDR,OAAO;UAAEkE,KAAK;YAACP;YAAQ;cAAEQ,WAAW;gBAAEC,IAAIL;cAAO;YAAE;;QAAG;QACtDM,QAAQ;UAAEpD,IAAI;QAAK;QACnBqD,SAAS;UAAEH,WAAW;QAAM;QAC5BI,MAAM3E;MACR,CAAA;AACA,iBAAW4E,KAAKjE,KAAMuD,KAAIW,IAAID,EAAEvD,EAAE;IACpC;AACA,QAAImC,OAAOM,YAAY,QAAQI,IAAIY,OAAO9E,OAAO;AAE/C,YAAMW,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;QACrDR,OAAO2D;QACPU,QAAQ;UAAEpD,IAAI;QAAK;QACnBqD,SAAS;UAAC;YAAEH,WAAW;UAAO;UAAG;YAAElD,IAAI;UAAO;;QAC9C0D,MAAMvB,OAAOM;QACba,MAAM3E;MACR,CAAA;AACA,iBAAW4E,KAAKjE,MAAM;AACpB,YAAIuD,IAAIY,QAAQ9E,MAAO;AACvBkE,YAAIW,IAAID,EAAEvD,EAAE;MACd;IACF;AACA,UAAM2D,SAAS;SAAId;MAAKe,MAAM,GAAGjF,KAAAA;AACjC,UAAM,KAAKsD,WAAW0B,MAAAA;AACtB,WAAOA,OAAOxC;EAChB;EAEA,MAAM0C,cAAcrF,OAAesF,KAA6C;AAC9E,UAAMpC,MAAM,MAAM,KAAKpD,GAAGyD,sBAAsBhB,WAAW;MACzDhC,OAAO;QAAEgF,WAAW;UAAEvF;UAAOsF;QAAI;MAAE;IACrC,CAAA;AACA,WAAOpC,MAAMsC,kBAAkBtC,GAAAA,IAAO;EACxC;EAEA,MAAMuC,eAAezF,OAAe0F,MAA2C;AAC7E,UAAMC,SAAS;SAAI,IAAItC,IAAIqC,IAAAA;;AAC3B,UAAM5E,OAAO,CAAA;AACb,aAAS8E,KAAK,GAAGA,KAAKD,OAAOhD,QAAQiD,MAAM,KAAK;AAC9C9E,WAAK+E,KAAI,GACH,MAAM,KAAK/F,GAAGyD,sBAAsBxC,SAAS;QAC/CR,OAAO;UAAEP;UAAOsF,KAAK;YAAE7E,IAAIkF,OAAOP,MAAMQ,IAAIA,KAAK,GAAA;UAAK;QAAE;MAC1D,CAAA,CAAA;IAEJ;AACA,WAAO9E,KAAKgF,KAAK,CAACC,GAAGC,MAAMD,EAAET,MAAMU,EAAEV,GAAG,EAAErE,IAAIuE,iBAAAA;EAChD;EAEA,MAAMS,wBAAwBjG,OAAe0F,MAA2C;AACtF,UAAMC,SAAS;SAAI,IAAItC,IAAIqC,IAAAA;;AAC3B,UAAM5E,OAAO,CAAA;AACb,aAAS8E,KAAK,GAAGA,KAAKD,OAAOhD,QAAQiD,MAAM,KAAK;AAC9C9E,WAAK+E,KAAI,GACH,MAAM,KAAK/F,GAAGyD,sBAAsBxC,SAAS;QAC/CR,OAAO;UAAEP;UAAOsF,KAAK;YAAE7E,IAAIkF,OAAOP,MAAMQ,IAAIA,KAAK,GAAA;UAAK;QAAE;QACxDhB,QAAQsB;MACV,CAAA,CAAA;IAEJ;AACA,WAAOpF,KACJgF,KAAK,CAACC,GAAGC,MAAMD,EAAET,MAAMU,EAAEV,GAAG,EAC5BrE,IAAI,CAACiC,QAAQsC,kBAAkB;MAAE,GAAGtC;MAAKiD,OAAO;IAAK,CAAA,CAAA;EAC1D;EAEA,MAAMC,eAAeC,YAA2C;AAC9D,UAAMxF,OAAOyF,iBAAiBD,UAAAA;AAC9B,UAAM,KAAKvG,GAAGyD,sBAAsBgD,OAAO;MACzChG,OAAO;QAAEgF,WAAW;UAAEvF,OAAOqG,WAAWrG;UAAOsF,KAAKe,WAAWf;QAAI;MAAE;MACrEkB,QAAQ3F;MACRU,QAAQV;IACV,CAAA;EACF;EAEA,MAAM4F,wBAAwBJ,YAA8C;AAG1E,UAAM,EAAErG,OAAOsF,KAAK,GAAGzE,KAAAA,IAASyF,iBAAiBD,UAAAA;AACjD,UAAM,EAAE/D,MAAK,IAAK,MAAM,KAAKxC,GAAGyD,sBAAsB3C,WAAW;MAC/DL,OAAO;QAAEP;QAAOsF;QAAK9E,QAAQ;MAAU;MACvCK;IACF,CAAA;AACA,WAAOyB,QAAQ;EACjB;EAEA,MAAMoE,yBAAyBC,aAAmD;AAChF,QAAIA,YAAYhE,WAAW,EAAG,QAAO,CAAA;AAOrC,WAAO,KAAK7C,GAAGO,aAAa,OAAOC,OAAAA;AACjC,YAAMsG,UAAU,oBAAIvD,IAAAA;AACpB,iBAAW,CAACrD,OAAO0F,IAAAA,KAASmB,UAAUF,WAAAA,GAAc;AAClD,iBAASf,KAAK,GAAGA,KAAKF,KAAK/C,QAAQiD,MAAM,KAAK;AAC5C,gBAAM9E,OAAO,MAAMR,GAAGiD,sBAAsBxC,SAAS;YACnDR,OAAO;cAAEP;cAAOsF,KAAK;gBAAE7E,IAAIiF,KAAKN,MAAMQ,IAAIA,KAAK,GAAA;cAAK;cAAGpF,QAAQ;YAAU;YACzEoE,QAAQ;cAAE5E,OAAO;cAAMsF,KAAK;YAAK;UACnC,CAAA;AACA,qBAAWpC,OAAOpC,KAAM8F,SAAQ5B,IAAI8B,cAAc5D,IAAIlD,OAAOkD,IAAIoC,GAAG,CAAA;QACtE;MACF;AACA,YAAM,EAAEyB,OAAOC,OAAM,IAAKC,gBAAgBN,aAAaC,OAAAA;AACvD,iBAAW,CAAC5G,OAAO0F,IAAAA,KAASmB,UAAUG,MAAAA,GAAS;AAC7C,iBAASpB,KAAK,GAAGA,KAAKF,KAAK/C,QAAQiD,MAAM,KAAK;AAC5C,gBAAMsB,QAAQxB,KAAKN,MAAMQ,IAAIA,KAAK,GAAA;AAClC,gBAAM,EAAEtD,MAAK,IAAK,MAAMhC,GAAGiD,sBAAsBP,WAAW;YAC1DzC,OAAO;cAAEP;cAAOsF,KAAK;gBAAE7E,IAAIyG;cAAM;cAAG1G,QAAQ;YAAU;UACxD,CAAA;AACA,cAAI8B,UAAU4E,MAAMvE,QAAQ;AAC1B,kBAAM,IAAIH,MAAM,mEAAA;UAClB;QACF;MACF;AACA,eAASoD,KAAK,GAAGA,KAAKoB,OAAOrE,QAAQiD,MAAM,KAAK;AAC9C,cAAMtF,GAAGiD,sBAAsB3B,WAAW;UACxCf,MAAMmG,OAAO5B,MAAMQ,IAAIA,KAAK,GAAA,EAAK3E,IAAIqF,gBAAAA;QACvC,CAAA;MACF;AACA,aAAOS;IACT,CAAA;EACF;EAEA,MAAMI,2BAA2BC,aAAmD;AAClF,UAAML,QAAQK,YAAYnG,IAAI,MAAM,KAAA;AACpC,QAAImG,YAAYzE,WAAW,EAAG,QAAOoE;AAErC,UAAMM,OAAO,oBAAIhE,IAAAA;AACjB,UAAMiE,SAAmB,CAAA;AACzBF,gBAAYG,QAAQ,CAACxD,GAAGyD,MAAAA;AACtB,YAAMC,MAAMX,cAAc/C,EAAE/D,OAAO+D,EAAEuB,GAAG;AACxC,UAAI+B,KAAKK,IAAID,GAAAA,EAAM;AACnBJ,WAAKrC,IAAIyC,GAAAA;AACTH,aAAOzB,KAAK2B,CAAAA;IACd,CAAA;AACA,UAAMG,UAAUC,iBAAiB,KAAK9H,EAAE;AACxC,QAAI,CAAC6H,SAAS;AAEZ,YAAME,SAAS,8BAAO/H,OAAAA;AACpB,mBAAW0H,KAAKF,QAAQ;AACtB,gBAAMvD,IAAIqD,YAAYI,CAAAA;AACtB,gBAAM,EAAElF,MAAK,IAAK,MAAMxC,GAAGyD,sBAAsB3C,WAAW;YAC1DL,OAAO;cAAEP,OAAO+D,EAAE/D;cAAOsF,KAAKvB,EAAEuB;cAAK9E,QAAQ;YAAU;YACvDK,MAAM;cACJL,QAAQuD,EAAEvD;cACVsH,QAAQC,WAAWhE,EAAE+D,MAAM;cAC3BE,OAAOD,WAAWhE,EAAEiE,KAAK;cACzBC,QAAQF,WAAWhE,EAAEkE,MAAM;cAC3BC,WAAWnE,EAAEmE;cACbC,YAAYpE,EAAEoE;YAChB;UACF,CAAA;AACApB,gBAAMS,CAAAA,IAAKlF,QAAQ;QACrB;MACF,GAhBe;AAiBf,UAAIgF,OAAO3E,WAAW,EAAG,OAAMkF,OAAO,KAAK/H,EAAE;UACxC,OAAM,KAAKA,GAAGO,aAAa,CAACC,OAAOuH,OAAOvH,EAAAA,CAAAA;AAC/C,aAAOyG;IACT;AAGA,UAAM,KAAKjH,GAAGO,aAAa,OAAOC,OAAAA;AAChC,YAAM8H,MAAM9H;AACZ,eAASsF,KAAK,GAAGA,KAAK0B,OAAO3E,QAAQiD,MAAM,KAAK;AAC9C,cAAMsB,QAAQI,OAAOlC,MAAMQ,IAAIA,KAAK,GAAA;AACpC,cAAMyC,MAAM,MAAMV,QAChBS,KACAlB,MAAMjG,IAAI,CAACuG,MAAMJ,YAAYI,CAAAA,CAAE,CAAA;AAEjC,mBAAWA,KAAKN,OAAO;AACrB,gBAAMnD,IAAIqD,YAAYI,CAAAA;AACtBT,gBAAMS,CAAAA,IAAKa,IAAIX,IAAIZ,cAAc/C,EAAE/D,OAAO+D,EAAEuB,GAAG,CAAA;QACjD;MACF;IACF,CAAA;AACA,WAAOyB;EACT;EAEA,MAAMuB,gBAAgB3B,aAA8C;AAClE,QAAIA,YAAYhE,WAAW,EAAG;AAC9B,UAAM,KAAK7C,GAAGO,aAAa,CAACC,OAAOiI,mBAAmBjI,IAAIqG,WAAAA,CAAAA;EAC5D;EAEA,MAAM6B,YACJC,MAIY;AACZ,WAAO,KAAK3I,GAAGO,aAAa,OAAOC,OACjCmI,KAAK;MACHL,KAAK9H;MACL8F,gBAAgB,8BAAOsC,OAAAA;AACrB,cAAM7H,OAAOyF,iBAAiBoC,EAAAA;AAC9B,cAAMpI,GAAGiD,sBAAsBgD,OAAO;UACpChG,OAAO;YAAEgF,WAAW;cAAEvF,OAAO0I,GAAG1I;cAAOsF,KAAKoD,GAAGpD;YAAI;UAAE;UACrDkB,QAAQ3F;UACRU,QAAQV;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAM8H,mBAAmBhJ,WAA4C;AACnE,UAAMmB,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO;QAAEC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGf,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOmB,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAM0H,iBACJhF,OACAzD,OACAR,WACAkJ,SACwB;AACxB,QAAI1I,SAAS,EAAG,QAAO,CAAA;AACvB,UAAMW,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO;QACLC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QACxCqI,IAAI;UACF;YAAEC,aAAa;UAAK;UACpB;YAAEA,aAAa;cAAEC,KAAK,IAAIzE,KAAKX,KAAAA;YAAO;UAAE;;aAEpCiF,UACA;YAAC;cAAEI,UAAUJ,QAAQK;cAAOH,aAAa;gBAAEpE,IAAI,IAAIJ,KAAKsE,QAAQM,YAAY;cAAE;YAAE;cAChF,CAAA;;QAEN,GAAGzJ,eAAeC,SAAAA;MACpB;MACAkF,SAAS;QAAEuE,WAAW;MAAM;MAC5BtE,MAAM3E;IACR,CAAA;AACA,WAAOW,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAMmI,gBAAgBlJ,OAAeR,WAA4C;AAC/E,UAAMmB,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO;QAAEC,QAAQ;QAAW,GAAGd,eAAeC,SAAAA;MAAW;MACzDkF,SAAS;QAAEuE,WAAW;MAAM;MAC5BtE,MAAM3E;IACR,CAAA;AACA,WAAOW,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAMoI,cAAc1F,OAAejE,WAAoBQ,OAAwC;AAC7F,UAAMW,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO;QACLC,QAAQ;QACR+I,QAAQ;UAAEC,KAAK;UAAMR,KAAKS,OAAO7F,KAAAA;QAAO;QACxC,GAAGlE,eAAeC,SAAAA;MACpB;MACAkF,SAAS;QAAE0E,QAAQ;MAAM;MACzB,GAAIpJ,UAAUP,SAAY;QAAEkF,MAAM3E;MAAM,IAAI,CAAC;IAC/C,CAAA;AACA,WAAOW,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAMwI,WACJ1J,OACAkJ,OACAS,cACA/F,OACkB;AAClB,UAAMgG,SAAS,MAAM,KAAK9J,GAAGa,mBAAmBC,WAAW;MACzDL,OAAO;QACLiB,IAAIxB;QACJ8I,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAEC,KAAK,IAAIzE,KAAKX,KAAAA;YAAO;UAAE;;MACtE;MACA/C,MAAM;QAAEoI,UAAUC;QAAOH,aAAa,IAAIxE,KAAKoF,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOtH,UAAU;EAC1B;EAEA,MAAMuH,eAAe7J,OAAekJ,OAA+B;AAQjE,UAAM,KAAKpJ,GAAGa,mBAAmBC,WAAW;MAC1CL,OAAO2I,UAAUtJ,SAAY;QAAE4B,IAAIxB;MAAM,IAAI;QAAEwB,IAAIxB;QAAOiJ,UAAUC;MAAM;MAC1ErI,MAAM;QAAEoI,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMe,aAAa9J,OAAekJ,OAAeS,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAK9J,GAAGa,mBAAmBC,WAAW;MACzDL,OAAO;QAAEiB,IAAIxB;QAAOiJ,UAAUC;MAAM;MACpCrI,MAAM;QAAEkI,aAAa,IAAIxE,KAAKoF,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOtH,UAAU;EAC1B;;EAGQ6B,SAAS4F,OAA0C;AAMzD,UAAMxJ,QAAiC;MAAE,GAAGb,eAAeqK,MAAMpK,SAAS;IAAE;AAI5E,UAAMqK,MAAiC,CAAA;AACvC,QAAID,MAAM7J,SAAUK,OAAML,WAAW6J,MAAM7J;AAC3C,QAAI6J,MAAME,UAAWD,KAAInE,KAAKqE,MAAMH,MAAME,UAAUhJ,IAAI,CAACkJ,OAAO;MAAEjK,UAAUiK;IAAE,EAAA,CAAA,CAAA;AAC9E,QAAIJ,MAAMK,WAAYJ,KAAInE,KAAKqE,MAAMH,MAAMK,WAAWnJ,IAAI,CAACoJ,OAAO;MAAE1K,WAAW0K;IAAE,EAAA,CAAA,CAAA;AAQjF,QAAIN,MAAMO,WAAW1K,OAAWW,OAAM+J,SAASP,MAAMO;AAGrD,QAAIP,MAAMQ,QAASP,KAAInE,KAAKqE,MAAMH,MAAMQ,QAAQtJ,IAAI,CAACuJ,OAAO;MAAEF,QAAQE;IAAE,EAAA,CAAA,CAAA;AAGxE,QAAIT,MAAMvJ,UAAUuJ,MAAMlG,UAAU;AAClCmG,UAAInE,KAAK;QAAErF,QAAQuJ,MAAMvJ;MAAO,GAAG;QAAEA,QAAQ;UAAEC,IAAIsJ,MAAMlG;QAAS;MAAE,CAAA;IACtE,WAAWkG,MAAMvJ,QAAQ;AACvBD,YAAMC,SAASuJ,MAAMvJ;IACvB,WAAWuJ,MAAMlG,UAAU;AACzBtD,YAAMC,SAAS;QAAEC,IAAIsJ,MAAMlG;MAAS;IACtC;AACA,QAAIkG,MAAM9J,IAAKM,OAAMY,OAAO;MAAEsJ,gBAAgBV,MAAM9J;IAAI;AACxD,QAAI8J,MAAM5I,KAAM6I,KAAInE,KAAKqE,MAAMH,MAAM5I,KAAKF,IAAI,CAACyJ,OAAO;MAAEvJ,MAAM;QAAEsJ,gBAAgBC;MAAE;IAAE,EAAA,CAAA,CAAA;AAIpF,QAAIX,MAAMjH,YAAYH,OAAQqH,KAAInE,KAAI,GAAIkE,MAAMjH,WAAW7B,IAAI,CAAC0J,MAAMC,cAAcD,CAAAA,CAAAA,CAAAA;AACpF,QAAIX,IAAIrH,OAAQpC,OAAMkE,MAAMuF;AAC5B,WAAOzJ;EACT;EAEA,MAAMsK,SAASd,OAAyC;AACtD,UAAMlF,UAAU;MAAEuE,WAAW;IAAgB;AAC7C,UAAMtI,OAAO,MAAM,KAAKhB,GAAGa,mBAAmBI,SAAS;MACrDR,OAAO,KAAK4D,SAAS4F,KAAAA;MACrBjF,MAAMiF,MAAM5J;MACZ+E,MAAM6E,MAAMe;MACZjG;IACF,CAAA;AACA,WAAO/D,KAAKG,IAAIC,UAAAA;EAClB;EAEA,MAAM6J,UAAUhB,OAA4D;AAC1E,WAAO,KAAKjK,GAAGa,mBAAmB2B,MAAM;MAAE/B,OAAO,KAAK4D,SAAS4F,KAAAA;IAAO,CAAA;EACxE;;;;EAKA,MAAMiB,UAAUjB,OAA8C;AAC5D,UAAMjJ,OAAQ,MAAM,KAAKhB,GAAGa,mBAAmBsK,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACf3K,OAAO,KAAK4D,SAAS4F,KAAAA;MACrBoB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOC,8CACLvK,KAAKG,IAAI,CAAC8D,OAAO;MAAEvE,QAAQuE,EAAEvE;MAAQ8J,QAAQvF,EAAEuF;MAAQhI,OAAOyC,EAAEoG,OAAOC;IAAK,EAAA,CAAA;EAEhF;;;;;EAMA,MAAME,eACJC,MACAxB,OACAyB,MAC6B;AAC7B,QAAI,KAACC,4CAAgBF,IAAAA,GAAO;AAC1B,YAAMvK,OAAO,MAAM,KAAK6J,SAAS;QAAE,GAAGd;QAAO5J,OAAOqL,MAAME,QAAQC;MAAqB,CAAA;AACvF,iBAAOC,mDAAuB5K,MAAMuK,MAAMC,IAAAA;IAC5C;AACA,UAAM1K,OAAQ,MAAM,KAAKhB,GAAGa,mBAAmBsK,QAAQ;MACrDC,IAAI;QAACK,KAAKM;;MACVtL,OAAO,KAAK4D,SAAS4F,KAAAA;MACrBoB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOU,mDACLhL,KAAKG,IAAI,CAAC8D,OAAO;MAAEgH,OAAOhH,EAAEwG,KAAKM,KAAK,KAAK;MAAMvJ,OAAOyC,EAAEoG,OAAOC;IAAK,EAAA,GACtEI,IAAAA;EAEJ;;EAIQQ,YAAmC;AACzC,UAAMC,WAAW,KAAKnM,GAAGoM;AACzB,QAAI,CAACD,UAAU;AACb,YAAM,IAAIzJ,MACR,2IAAA;IAEJ;AACA,WAAOyJ;EACT;EAEA,MAAME,aAAaC,QAAuC;AACxD,UAAMvL,OAAOwL,eAAeD,MAAAA;AAC5B,UAAM,KAAKJ,UAAS,EAAGzF,OAAO;MAAEhG,OAAO;QAAEiB,IAAI4K,OAAO5K;MAAG;MAAGgF,QAAQ3F;MAAMU,QAAQV;IAAK,CAAA;EACvF;EAEA,MAAMyL,YAAY9K,IAA4C;AAC5D,UAAM0B,MAAM,MAAM,KAAK8I,UAAS,EAAGzJ,WAAW;MAAEhC,OAAO;QAAEiB;MAAG;IAAE,CAAA;AAC9D,WAAO0B,MAAMqJ,gBAAgBrJ,GAAAA,IAAO;EACtC;;EAGA,MAAMsJ,eACJhL,IACAH,OACAoL,oBACkB;AAClB,UAAM5L,OAAgC,CAAC;AACvC,QAAIQ,MAAM1B,cAAcC,OAAWiB,MAAKlB,YAAY0B,MAAM1B;AAC1D,QAAI0B,MAAMnB,aAAaN,OAAWiB,MAAKX,WAAWmB,MAAMnB;AACxD,QAAImB,MAAMqL,WAAW9M,OAAWiB,MAAK6L,SAASrL,MAAMqL;AACpD,QAAI,gBAAgBrL,MAClBR,MAAK8L,aAAatL,MAAMsL,cAAc,OAAO,OAAOlD,OAAOpI,MAAMsL,UAAU;AAC7E,QAAI,UAAUtL,MAAOR,MAAKM,OAAO4G,WAAW1G,MAAMF,IAAI;AACtD,QAAIE,MAAMuL,SAAShN,OAAWiB,MAAK+L,OAAOvL,MAAMuL;AAChD,QAAIvL,MAAMwL,UAAUjN,OAAWiB,MAAKgM,QAAQxL,MAAMwL;AAClD,QAAIxL,MAAMqD,cAAc9E,OAAWiB,MAAK6D,YAAYrD,MAAMqD;AAC1D,QAAI,CAAC9B,OAAOC,KAAKhC,IAAAA,EAAM8B,OAAQ,QAAQ,MAAM,KAAK2J,YAAY9K,EAAAA,MAAS;AACvE,UAAMjB,QAAiC;MAAEiB;IAAG;AAC5C,QAAIiL,uBAAuB7M,OACzBW,OAAMoM,aAAaF,uBAAuB,OAAO,OAAOhD,OAAOgD,kBAAAA;AACjE,UAAM,EAAEnK,MAAK,IAAK,MAAM,KAAK0J,UAAS,EAAGpL,WAAW;MAAEL;MAAOM;IAAK,CAAA;AAClE,WAAOyB,QAAQ;EACjB;EAEA,MAAMwK,eAAetL,IAA8B;AACjD,UAAM,EAAEc,MAAK,IAAK,MAAM,KAAK0J,UAAS,EAAGhJ,WAAW;MAAEzC,OAAO;QAAEiB;MAAG;IAAE,CAAA;AACpE,WAAOc,QAAQ;EACjB;EAEA,MAAMyK,cAAchD,OAAiD;AACnE,UAAMxJ,QAAiC,CAAC;AACxC,QAAIwJ,MAAMpK,cAAcC,OAAWW,OAAMZ,YAAYoK,MAAMpK;AAC3D,QAAIoK,MAAM7J,aAAaN,OAAWW,OAAML,WAAW6J,MAAM7J;AACzD,QAAI6J,MAAM2C,WAAW9M,OAAWW,OAAMmM,SAAS3C,MAAM2C;AACrD,QAAI3C,MAAM9J,QAAQL,OAAWW,OAAMY,OAAO;MAAEsJ,gBAAgBV,MAAM9J;IAAI;AACtE,QAAI8J,MAAMiD,UAAUpN,QAAW;AAC7BW,YAAMkE,MAAM;QAAC;UAAEiI,QAAQ;QAAM;QAAG;UAAEC,YAAY;YAAE3D,KAAKS,OAAOM,MAAMiD,KAAK;UAAE;QAAE;;IAC7E;AACA,UAAMlM,OAAO,MAAM,KAAKkL,UAAS,EAAGjL,SAAS;MAC3CR;;MAEAsE,SAAS;QAAC;UAAE8H,YAAY;YAAE7G,MAAM;YAAOmH,OAAO;UAAO;QAAE;QAAG;UAAEzL,IAAI;QAAM;;MACtEsD,MAAMiF,MAAM5J;MACZ+E,MAAM6E,MAAMe;IACd,CAAA;AACA,WAAOhK,KAAKG,IAAIsL,eAAAA;EAClB;EAEA,MAAMW,gBAAgBlN,OAA0C;AAC9D,UAAMc,OAAO,MAAM,KAAKhB,GAAGyD,sBAAsBxC,SAAS;MACxDR,OAAO;QAAEP;MAAM;MACf6E,SAAS;QAAES,KAAK;MAAM;IACxB,CAAA;AACA,WAAOxE,KAAKG,IAAIuE,iBAAAA;EAClB;EAEA,MAAM2H,yBAAyBnN,OAA0C;AACvE,UAAMc,OAAO,MAAM,KAAKhB,GAAGyD,sBAAsBxC,SAAS;MACxDR,OAAO;QAAEP;MAAM;MACf6E,SAAS;QAAES,KAAK;MAAM;MACtBV,QAAQsB;IACV,CAAA;AAEA,UAAMkH,OAAOtM,KAAKgD,OAAO,CAACZ,QAAQA,IAAI1C,WAAW,WAAA,EAAaS,IAAI,CAACiC,QAAQA,IAAIoC,GAAG;AAClF,UAAM+H,SAAS,oBAAIC,IAAAA;AACnB,aAAS1H,KAAK,GAAGA,KAAKwH,KAAKzK,QAAQiD,MAAM,KAAK;AAC5C,YAAM2H,QAAQ,MAAM,KAAKzN,GAAGyD,sBAAsBxC,SAAS;QACzDR,OAAO;UAAEP;UAAOsF,KAAK;YAAE7E,IAAI2M,KAAKhI,MAAMQ,IAAIA,KAAK,GAAA;UAAK;QAAE;QACtDhB,QAAQ;UAAEU,KAAK;UAAMa,OAAO;QAAK;MACnC,CAAA;AACA,iBAAWjD,OAAOqK,MAAOF,QAAOG,IAAItK,IAAIoC,KAAKpC,IAAIiD,KAAK;IACxD;AACA,WAAOrF,KAAKG,IAAI,CAACiC,QAAQsC,kBAAkB;MAAE,GAAGtC;MAAKiD,OAAOkH,OAAOI,IAAIvK,IAAIoC,GAAG,KAAK;IAAK,CAAA,CAAA;EAC1F;EAEA,MAAMoI,0BACJ1N,OACA2N,MACqC;AACrC,UAAMzK,MAAM,MAAM,KAAKpD,GAAGyD,sBAAsBqK,UAAU;MACxDrN,OAAO;QAAEP;QAAO2N;MAAK;MACrB9I,SAAS;QAAES,KAAK;MAAO;IACzB,CAAA;AACA,WAAOpC,MAAMsC,kBAAkBtC,GAAAA,IAAOtD;EACxC;EAEA,MAAMiO,eACJ7N,OACA8N,SACAC,OACAlK,UACkB;AAClB,QAAIA,SAASlB,WAAW,EAAG,QAAO;AAClC,UAAMO,MAAM,MAAM,KAAKpD,GAAGyD,sBAAsBqK,UAAU;MACxDrN,OAAO;QAAEP;QAAOsF,KAAK;UAAE0I,KAAKF;UAAS9E,KAAK+E;QAAM;QAAGvN,QAAQ;UAAEC,IAAIoD;QAAS;MAAE;MAC5Ee,QAAQ;QAAEU,KAAK;MAAK;MACpBT,SAAS;QAAES,KAAK;MAAO;IACzB,CAAA;AACA,WAAOpC,QAAQ;EACjB;EAEA,MAAM+K,iBACJjO,OACA8N,SACAC,OACAlK,UACiB;AACjB,QAAIA,SAASlB,WAAW,EAAG,QAAO;AAClC,WAAO,KAAK7C,GAAGyD,sBAAsBjB,MAAM;MACzC/B,OAAO;QAAEP;QAAOsF,KAAK;UAAE0I,KAAKF;UAAS9E,KAAK+E;QAAM;QAAGvN,QAAQ;UAAEC,IAAIoD;QAAS;MAAE;IAC9E,CAAA;EACF;EAEA,MAAMqK,4BAA4BlO,OAAemO,UAA+C;AAC9F,QAAIA,SAASxL,WAAW,EAAG,QAAO,CAAA;AAClC,UAAM7B,OAAO,MAAM,KAAKhB,GAAGyD,sBAAsBxC,SAAS;MACxDR,OAAO;QAAEP;QAAO8I,IAAIqF,SAASlN,IAAI,CAACmN,OAAO;UAAET,MAAM;YAAEU,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEvJ,SAAS;QAAES,KAAK;MAAM;IACxB,CAAA;AAGA,WAAOxE,KAAKgD,OAAO,CAACiB,MAAMoJ,SAASG,KAAK,CAACF,MAAMrJ,EAAE4I,KAAKU,WAAWD,CAAAA,CAAAA,CAAAA,EAAKnN,IAAIuE,iBAAAA;EAC5E;;;;;;;;;;;;EAaA,MAAM+I,gBACJvO,OACAwL,MAC2B;AAC3B,UAAMpH,QAAQoH,MAAMgD,UAAU5O,SAAY;MAAEI;IAAM,IAAI;MAAEA;MAAOyO,eAAejD,KAAKgD;IAAM;AACzF,UAAME,UAAU,MAAMC,QAAQC,IAC5BC,WAAW5N,IAAI,OAAO,EAAE6N,MAAMvO,MAAK,OAAQ;MACzCuO;MACAvO;MACAO,MAAO,MAAM,KAAKhB,GAAGyD,sBAAsB0H,QAAQ;QACjDC,IAAI;UAAC;UAAiB;;QACtB3K,OAAO;UAAE,GAAG6D;UAAO,GAAG7D;QAAM;QAC5B4K,QAAQ;UAAEC,MAAM;UAAM2D,YAAY;QAAK;QACvCC,MAAM;UAAE1J,KAAK;UAAMqI,MAAM;UAAMoB,YAAY;UAAM7G,WAAW;QAAK;QACjE+G,MAAM;UAAE3J,KAAK;UAAMqI,MAAM;UAAMzF,WAAW;UAAMC,YAAY;QAAK;QACjE+G,MAAM;UAAEC,UAAU;QAAK;MACzB,CAAA;IACF,EAAA,CAAA;AAEF,UAAMC,QAAQ,MAAMT,QAAQC,IAC1BF,QAAQzN,IAAI,OAAO,EAAE6N,MAAMvO,OAAOO,KAAI,MAAE;AACtC,YAAMuO,aAAavO,KAAKwN,KAAK,CAACvJ,MAAMA,EAAEoG,OAAO4D,aAAahK,EAAEoG,OAAOC,IAAI,IACnE,MAAM,KAAKkE,oBAAoB;QAAE,GAAGlL;QAAO,GAAG7D;MAAM,CAAA,IACpD,oBAAI+M,IAAAA;AACR,aAAOxM,KAAKG,IAAI,CAAC8D,MAAMwK,iBAAiBT,MAAM/J,GAAGsK,UAAAA,CAAAA;IACnD,CAAA,CAAA;AAEF,WAAOD,MAAMI,KAAI;EACnB;;EAGA,MAAcF,oBAAoB/O,OAA4D;AAC5F,UAAMO,OAAQ,MAAM,KAAKhB,GAAGyD,sBAAsB0H,QAAQ;MACxDC,IAAI;QAAC;QAAiB;;MACtB3K,OAAO;QAAE,GAAGA;QAAOwO,YAAY;MAAK;MACpCC,MAAM;QAAE9G,WAAW;MAAK;IAC1B,CAAA;AACA,WAAO,IAAIoF,IAAIxM,KAAKG,IAAI,CAAC8D,MAAM;MAAC0K,UAAU1K,EAAE0J,eAAe1J,EAAEvE,MAAM;MAAGuE,EAAEiK,KAAK9G;KAAU,CAAA;EACzF;;;EAIA,MAAMwH,iBAAiB1P,OAAe+J,OAAmD;AACvF,QAAIA,MAAMlG,UAAUlB,WAAW,KAAKoH,MAAM4F,cAAchN,WAAW,EAAG,QAAO,CAAA;AAC7E,UAAMqH,MAAiC,CAAA;AACvC,QAAID,MAAM6F,eAAejN,QAAQ;AAC/BqH,UAAInE,KAAK;QACPiD,IAAI;UAAC;YAAE2F,eAAe;UAAK;UAAG;YAAEA,eAAe;cAAEoB,OAAO9F,MAAM6F;YAAc;UAAE;;MAChF,CAAA;IACF;AACA,QAAI7F,MAAM4F,cAAc;AACtB3F,UAAInE,KAAK;QAAEiD,IAAIiB,MAAM4F,aAAa1O,IAAI,CAACmN,OAAO;UAAET,MAAM;YAAEU,YAAYD;UAAE;QAAE,EAAA;MAAI,CAAA;IAC9E;AACA,UAAMtN,OAAO,MAAM,KAAKhB,GAAGyD,sBAAsBxC,SAAS;MACxDR,OAAO;QACLP;QACA,GAAI+J,MAAMyE,UAAU5O,SAAY,CAAC,IAAI;UAAE6O,eAAe1E,MAAMyE;QAAM;QAClE,GAAIzE,MAAMlG,WAAW;UAAErD,QAAQ;YAAEC,IAAIsJ,MAAMlG;UAAS;QAAE,IAAI,CAAC;QAC3D,GAAImG,IAAIrH,SAAS;UAAE8B,KAAKuF;QAAI,IAAI,CAAC;MACnC;MACAnF,SAAS;QAAES,KAAK;MAAM;MACtBJ,MAAM6E,MAAMe;MACZhG,MAAMiF,MAAM5J;IACd,CAAA;AACA,WAAOW,KAAKG,IAAIuE,iBAAAA;EAClB;EAEA,MAAMsK,gBAAgBC,QAAqC;AACzD,UAAM,KAAKjQ,GAAG0D,oBAAoB+C,OAAO;MACvChG,OAAO;QAAEyP,OAAOD,OAAOC;MAAM;MAC7BxJ,QAAQ;QACNwJ,OAAOD,OAAOC;QACdhQ,OAAO+P,OAAO/P;QACdsF,KAAKyK,OAAOzK;QACZmJ,eAAesB,OAAOtB,iBAAiB;MACzC;MACAlN,QAAQ;QACNvB,OAAO+P,OAAO/P;QACdsF,KAAKyK,OAAOzK;QACZmJ,eAAesB,OAAOtB,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMwB,iBAAiBD,OAA6C;AAClE,UAAM9M,MAAM,MAAM,KAAKpD,GAAG0D,oBAAoBjB,WAAW;MAAEhC,OAAO;QAAEyP;MAAM;IAAE,CAAA;AAC5E,QAAI,CAAC9M,IAAK,QAAO;AACjB,UAAM,KAAKpD,GAAG0D,oBAAoB0M,OAAO;MAAE3P,OAAO;QAAEyP;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAO9M,IAAI8M;MACXhQ,OAAOkD,IAAIlD;MACXsF,KAAKpC,IAAIoC;MACTmJ,eAAevL,IAAIuL,iBAAiB7O;IACtC;EACF;EAEA,MAAMuQ,kBAAkBC,QAAyC;AAC/D,UAAMtP,OAAO,MAAM,KAAKhB,GAAG0D,oBAAoBzC,SAAS;MACtDR,OAAO;QAAEyP,OAAO;UAAE3B,YAAY+B;QAAO;MAAE;IACzC,CAAA;AAGA,WAAOtP,KACJgD,OAAO,CAACiB,MAAMA,EAAEiL,MAAM3B,WAAW+B,MAAAA,CAAAA,EACjCnP,IAAI,CAAC8D,OAAO;MACXiL,OAAOjL,EAAEiL;MACThQ,OAAO+E,EAAE/E;MACTsF,KAAKP,EAAEO;MACPmJ,eAAe1J,EAAE0J,iBAAiB7O;IACpC,EAAA;EACJ;EAEA,MAAMyQ,mBAAmBC,SAAqC;AAC5D,QAAIA,QAAQ3N,WAAW,EAAG;AAG1B,UAAM,KAAK7C,GAAGO,aAAa,OAAOC,OAAAA;AAChC,eAASsF,KAAK,GAAGA,KAAK0K,QAAQ3N,QAAQiD,MAAM,KAAK;AAC/C,cAAMsB,QAAQoJ,QAAQlL,MAAMQ,IAAIA,KAAK,GAAA;AACrC,cAAMtF,GAAGkD,oBAAoBR,WAAW;UACtCzC,OAAO;YAAEyP,OAAO;cAAEvP,IAAIyG,MAAMjG,IAAI,CAAC,EAAE8O,OAAM,MAAOA,OAAOC,KAAK;YAAE;UAAE;QAClE,CAAA;AACA,cAAM1P,GAAGkD,oBAAoB5B,WAAW;UACtCf,MAAMqG,MAAMjG,IAAI,CAAC,EAAE8O,OAAM,OAAQ;YAC/BC,OAAOD,OAAOC;YACdhQ,OAAO+P,OAAO/P;YACdsF,KAAKyK,OAAOzK;YACZmJ,eAAesB,OAAOtB,iBAAiB;UACzC,EAAA;QACF,CAAA;MACF;AACA,YAAMlG,mBACJjI,IACAgQ,QAAQrP,IAAI,CAAC,EAAEoF,WAAU,MAAOA,UAAAA,CAAAA;IAEpC,CAAA;EACF;EAEA,MAAMkK,mBACJvQ,OACA8N,SACAC,OACAyC,MACe;AACf,UAAM,KAAK1Q,GAAGO,aAAa,OAAOC,OAAAA;AAChC,YAAMA,GAAGiD,sBAAsBP,WAAW;QACxCzC,OAAO;UAAEP;UAAOsF,KAAK;YAAE0I,KAAKF;YAAS9E,KAAK+E;UAAM;QAAE;MACpD,CAAA;AACA,YAAMlN,OAAOyF,iBAAiBkK,IAAAA;AAC9B,YAAMlQ,GAAGiD,sBAAsBgD,OAAO;QACpChG,OAAO;UAAEgF,WAAW;YAAEvF,OAAOwQ,KAAKxQ;YAAOsF,KAAKkL,KAAKlL;UAAI;QAAE;QACzDkB,QAAQ3F;QACRU,QAAQV;MACV,CAAA;IACF,CAAA;EACF;EAEA,MAAM4P,uBAAuBrN,QAA2C;AACtE,QAAIA,OAAOT,WAAW,EAAG,QAAO,CAAA;AAChC,UAAM7B,OAAO,MAAM,KAAKhB,GAAG0D,oBAAoBzC,SAAS;MAAER,OAAO;QAAEP,OAAO;UAAES,IAAI2C;QAAO;MAAE;IAAE,CAAA;AAC3F,WAAOtC,KAAKG,IAAI,CAAC8D,OAAO;MACtBiL,OAAOjL,EAAEiL;MACThQ,OAAO+E,EAAE/E;MACTsF,KAAKP,EAAEO;MACPmJ,eAAe1J,EAAE0J,iBAAiB7O;IACpC,EAAA;EACF;EAEA,MAAM8Q,gBAAgB1Q,OAAe2Q,aAAuC;AAI1E,UAAMpQ,QAAQ;MAAEP;MAAOgQ,OAAO;QAAE3B,YAAYsC;MAAY;IAAE;AAC1D,UAAMC,QAAQ,MAAM,KAAK9Q,GAAG0D,oBAAoBoK,UAAU;MAAErN;MAAOqE,QAAQ;QAAEoL,OAAO;MAAK;IAAE,CAAA;AAC3F,QAAI,CAACY,MAAO,QAAO;AACnB,QAAIA,MAAMZ,MAAM3B,WAAWsC,WAAAA,EAAc,QAAO;AAChD,UAAM7P,OAAO,MAAM,KAAKhB,GAAG0D,oBAAoBzC,SAAS;MAAER;MAAOqE,QAAQ;QAAEoL,OAAO;MAAK;IAAE,CAAA;AACzF,WAAOlP,KAAKwN,KAAK,CAACvJ,MAAMA,EAAEiL,MAAM3B,WAAWsC,WAAAA,CAAAA;EAC7C;EAEA,MAAME,mBAAmBd,QAAqC;AAI5D,UAAM,KAAKjQ,GAAG0D,oBAAoBR,WAAW;MAC3CzC,OAAO;QAAEyP,OAAOD,OAAOC;QAAOhQ,OAAO+P,OAAO/P;QAAOsF,KAAKyK,OAAOzK;MAAI;IACrE,CAAA;EACF;EAEA,MAAMwL,aAAad,OAAee,SAAiC;AACjE,UAAM,KAAKjR,GAAGkR,sBAAsBxK,OAAO;MAAE3F,MAAM;QAAEmP;QAAOe,SAAShJ,WAAWgJ,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAME,mBAAmBjB,OAAqD;AAC5E,UAAM9M,MAAM,MAAM,KAAKpD,GAAGkR,sBAAsBpD,UAAU;MACxDrN,OAAO;QAAEyP;MAAM;MACfnL,SAAS;QAAErD,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAAC0B,IAAK,QAAO;AACjB,UAAM,KAAKpD,GAAGkR,sBAAsBd,OAAO;MAAE3P,OAAO;QAAEiB,IAAI0B,IAAI1B;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEuP,SAAS7N,IAAI6N,WAAWnR;IAAU;EAC7C;EAEA,MAAMsR,oBACJP,aACAQ,SACAhR,OACmC;AAGnC,UAAMW,OAAO,MAAM,KAAKhB,GAAGkR,sBAAsBjQ,SAAS;MACxDR,OAAO;QACLyP,OAAO;UAAE3B,YAAYsC;QAAY;QACjC,GAAIQ,YAAYvR,SAAY;UAAE4B,IAAI;YAAE4P,IAAIC,OAAOF,OAAAA;UAAS;QAAE,IAAI,CAAC;MACjE;MACAtM,SAAS;QAAErD,IAAI;MAAM;MACrBsD,MAAM3E;IACR,CAAA;AAGA,WAAOW,KACJgD,OAAO,CAACiB,MAAMA,EAAEiL,MAAM3B,WAAWsC,WAAAA,CAAAA,EACjC1P,IAAI,CAAC8D,OAAO;MAAEvD,IAAI8P,OAAOvM,EAAEvD,EAAE;MAAGwO,OAAOjL,EAAEiL;MAAOe,SAAShM,EAAEgM,WAAWnR;IAAU,EAAA;EACrF;EAEA,MAAM2R,sBAAsBlN,KAA8B;AACxD,QAAIA,IAAI1B,WAAW,EAAG;AACtB,UAAM,KAAK7C,GAAGkR,sBAAsBhO,WAAW;MAAEzC,OAAO;QAAEiB,IAAI;UAAEf,IAAI4D,IAAIpD,IAAIoQ,MAAAA;QAAQ;MAAE;IAAE,CAAA;EAC1F;EAEA,MAAMG,YAAYrL,OAKA;AAChB,UAAM,KAAKrG,GAAG2R,qBAAqBjL,OAAO;MACxC3F,MAAM;QACJW,IAAI2E,MAAM3E;QACVmM,MAAMxH,MAAMwH;QACZoD,SAAShJ,WAAW5B,MAAM4K,OAAO;QACjCW,aAAajI,OAAOtD,MAAMuL,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJhE,MACAxN,OACuE;AACvE,UAAMW,OAAO,MAAM,KAAKhB,GAAG2R,qBAAqB1Q,SAAS;MACvDR,OAAO;QAAEoN;MAAK;MACd9I,SAAS;QAAE6M,aAAa;MAAM;MAC9B5M,MAAM3E;IACR,CAAA;AACA,WAAOW,KAAKG,IAAI,CAAC8D,OAAO;MACtBvD,IAAIuD,EAAEvD;MACNuP,SAAShM,EAAEgM,WAAWnR;MACtB8R,aAAaL,OAAOtM,EAAE2M,WAAW;IACnC,EAAA;EACF;EAEA,MAAME,oBAAoBpQ,IAA8B;AAItD,UAAMoI,SAAS,MAAM,KAAK9J,GAAG2R,qBAAqBzO,WAAW;MAAEzC,OAAO;QAAEiB;MAAG;IAAE,CAAA;AAC7E,WAAOoI,OAAOtH,UAAU;EAC1B;AACF;AAQA,SAASsI,cAAcD,GAAkB;AAIvC,QAAMkH,kBAAcC,uDAA2BnH,CAAAA,EAAG1J,IAAI,CAAC,EAAE8Q,QAAQC,YAAYC,QAAO,OAAQ;IAC1F,CAACF,MAAAA,GACCC,eAAe,MAAMC,UAAUD,eAAe,OAAO;MAAExI,KAAKyI;IAAQ,IAAI;MAAE,CAACtH,EAAEuH,EAAE,GAAGD;IAAQ;EAC9F,EAAA;AACA,MAAIJ,YAAYlP,WAAW,EAAG,QAAOwP;AACrC,SAAO;IAAErP,YAAY;MAAEwL,MAAM;QAAE7G,KAAKkD,EAAElD;QAAK,GAAGyC,MAAM2H,WAAAA;MAAa;IAAE;EAAE;AACvE;AAVSjH;AAeT,IAAMuH,kBAA2C;EAAE3Q,IAAI;IAAEf,IAAI,CAAA;EAAe;AAAE;AAG9E,SAASyJ,MAAMkI,UAAmC;AAChD,SAAOA,SAASzP,SAAS;IAAEmG,IAAIsJ;EAAS,IAAID;AAC9C;AAFSjI;AAIT,IAAMmI,YAAY,wBAAChI,MAA2BA,KAAK,OAAO,OAAOZ,OAAOY,CAAAA,GAAtD;AAClB,IAAMiI,aAAa,wBAACjI,MAAsBA,KAAK,OAAOzK,SAAYyR,OAAOhH,CAAAA,GAAtD;AACnB,IAAMtC,aAAa,wBAACwK,MAAeA,KAAK,MAArB;AAEnB,SAAS1Q,UAAUF,KAAgB;AACjC,SAAO;IACLH,IAAIG,IAAIH;IACRtB,UAAUyB,IAAIzB;IACdsS,iBAAiB7Q,IAAI6Q;IACrBhS,QAAQmB,IAAInB;IACZ2F,OAAO4B,WAAWpG,IAAIwE,KAAK;IAC3B2B,QAAQC,WAAWpG,IAAImG,MAAM;IAC7BE,OAAOD,WAAWpG,IAAIqG,KAAK;IAC3BuB,QAAQ8I,UAAU1Q,IAAI4H,MAAM;IAC5BN,UAAUtH,IAAIsH,YAAY;IAC1BF,aAAapH,IAAIoH,eAAe,OAAO,OAAO,IAAIxE,KAAK5C,IAAIoH,WAAW;IACtE0J,wBAAwB9Q,IAAI8Q,0BAA0B;IACtDC,kBAAkB/Q,IAAI+Q,oBAAoB;IAC1CvR,MAAM4G,WAAWpG,IAAIR,IAAI;IACzBY,kBAAkBgG,WAAWpG,IAAII,gBAAgB;IACjD4Q,UAAUhR,IAAIgR,YAAY;;;;IAI1BhT,WAAWgC,IAAIhC,aAAa;;IAE5B2K,QAAQ3I,IAAI2I,UAAU;IACtBlB,WAAWzH,IAAIyH;IACf1E,WAAW/C,IAAI+C;EACjB;AACF;AA1BS7C;AA4BT,SAASJ,WAAWJ,OAA2B;AAM7C,QAAMR,OAAgC,CAAC;AACvC,MAAI,cAAcQ,MAAOR,MAAKX,WAAWmB,MAAMnB;AAC/C,MAAI,qBAAqBmB,MAAOR,MAAK2R,kBAAkBnR,MAAMmR;AAC7D,MAAI,YAAYnR,MAAOR,MAAKL,SAASa,MAAMb;AAC3C,MAAI,WAAWa,MAAOR,MAAKsF,QAAQ4B,WAAW1G,MAAM8E,KAAK;AACzD,MAAI,YAAY9E,MAAOR,MAAKiH,SAASC,WAAW1G,MAAMyG,MAAM;AAC5D,MAAI,WAAWzG,MAAOR,MAAKmH,QAAQD,WAAW1G,MAAM2G,KAAK;AACzD,MAAI,YAAY3G,MAAOR,MAAK0I,SAAS8I,UAAUhR,MAAMkI,MAAM;AAC3D,MAAI,cAAclI,MAAOR,MAAKoI,WAAW5H,MAAM4H,YAAY;AAC3D,MAAI,iBAAiB5H,MACnBR,MAAKkI,cAAc1H,MAAM0H,eAAe,OAAO,OAAO,IAAIxE,KAAKlD,MAAM0H,WAAW;AAClF,MAAI,4BAA4B1H,MAC9BR,MAAK4R,yBAAyBpR,MAAMoR,0BAA0B;AAChE,MAAI,sBAAsBpR,MAAOR,MAAK6R,mBAAmBrR,MAAMqR,oBAAoB;AACnF,MAAI,UAAUrR,MAAOR,MAAKM,OAAO4G,WAAW1G,MAAMF,IAAI;AACtD,MAAI,sBAAsBE,MAAOR,MAAKkB,mBAAmBgG,WAAW1G,MAAMU,gBAAgB;AAC1F,MAAI,cAAcV,MAAOR,MAAK8R,WAAWtR,MAAMsR,YAAY;AAK3D,MAAI,eAAetR,MAAOR,MAAKlB,YAAY0B,MAAM1B,aAAa;AAC9D,MAAI,YAAY0B,MAAOR,MAAKyJ,SAASjJ,MAAMiJ,UAAU;AACrD,MAAIjJ,MAAM+H,aAAa,KAAMvI,MAAKuI,YAAY/H,MAAM+H;AACpD,MAAI/H,MAAMqD,aAAa,KAAM7D,MAAK6D,YAAYrD,MAAMqD;AACpD,SAAO7D;AACT;AAhCSY;AAkCT,SAASP,WAAWgC,KAAW;AAC7B,SAAO;IACL1B,IAAI0B,IAAI1B;IACRtB,UAAUgD,IAAIhD;IACdsS,iBAAiBtP,IAAIsP;IACrBhS,QAAQ0C,IAAI1C;IACZ2F,OAAOjD,IAAIiD,SAASvG;IACpBkI,QAAQ5E,IAAI4E,UAAUlI;IACtBoI,OAAQ9E,IAAI8E,SAASpI;IACrB2J,QAAQ+I,WAAWpP,IAAIqG,MAAM;IAC7BN,UAAU/F,IAAI+F,YAAYrJ;IAC1BmJ,aAAa7F,IAAI6F,eAAe,OAAOnJ,SAAYsD,IAAI6F,YAAY6J,QAAO;IAC1EH,wBAAwBvP,IAAIuP,0BAA0B7S;IACtD8S,kBAAkBxP,IAAIwP,oBAAoB9S;IAC1CuB,MAAO+B,IAAI/B,QAA4BvB;IACvCmC,kBACGmB,IAAInB,oBAAyEnC;IAChF+S,UAAUzP,IAAIyP,YAAY/S;;;;;;IAM1BD,WAAWuD,IAAIvD;;IAEf2K,QAAQpH,IAAIoH,UAAU1K;IACtBwJ,WAAWlG,IAAIkG;IACf1E,WAAWxB,IAAIwB;EACjB;AACF;AA7BSxD;AAgCT,IAAM2R,gBAAgD;EACpD;IAAC;IAAS;;EACV;IAAC;IAAU;;EACX;IAAC;IAAS;;;AAIZ,IAAMhE,aAA6E;KAC9EgE,cAAc5R,IAAI,CAAC,CAAC6N,MAAMsB,MAAAA,OAAa;IAAEtB;IAAMvO,OAAO;MAAEoN,MAAM;QAAEU,YAAY+B;MAAO;IAAE;EAAE,EAAA;EAC1F;IACEtB,MAAM;IACNvO,OAAO;MAAEuS,KAAKD,cAAc5R,IAAI,CAAC,CAAA,EAAGmP,MAAAA,OAAa;QAAEzC,MAAM;UAAEU,YAAY+B;QAAO;MAAE,EAAA;IAAI;EACtF;;AAaF,SAASX,UAAUjB,OAAsBhO,QAAc;AACrD,SAAOuS,KAAKC,UAAU;IAACxE;IAAOhO;GAAO;AACvC;AAFSiP;AAIT,SAASF,iBACP0D,UACAlO,GACAsK,YAA6B;AAE7B,QAAM6D,WAAW7D,WAAW5B,IAAIgC,UAAU1K,EAAE0J,eAAe1J,EAAEvE,MAAM,CAAA;AACnE,QAAM2S,WAAWpO,EAAEiK,KAAKD;AACxB,QAAMqE,gBACJD,YAAYD,WAAYC,WAAWD,WAAWC,WAAWD,WAAaC,YAAYD;AACpF,SAAO;IACL1E,OAAOzJ,EAAE0J;IACTjO,QAAQuE,EAAEvE;IACVyS;IACA3Q,OAAOyC,EAAEoG,OAAOC;IAChBiI,QAAQtO,EAAEiK,KAAK1J;IACfgO,QAAQvO,EAAEkK,KAAK3J;IACfiO,SAASxO,EAAEiK,KAAKrB;IAChB6F,SAASzO,EAAEkK,KAAKtB;;IAEhByF;IACAK,cAAc1O,EAAEiK,KAAK9G;IACrBwL,cAAc3O,EAAEkK,KAAK/G;IACrByL,eAAe5O,EAAEkK,KAAK9G;IACtByL,aAAavC,OAAOtM,EAAEmK,KAAKC,YAAY,CAAA;EACzC;AACF;AAzBSI;AA4BT,SAAS1I,UAAUF,aAA6C;AAC9D,QAAMkN,QAAQ,oBAAIvG,IAAAA;AAClB,aAAW,EAAEtN,OAAOsF,IAAG,KAAMqB,aAAa;AACxC,UAAMjB,OAAOmO,MAAMpG,IAAIzN,KAAAA,KAAU,oBAAIqD,IAAAA;AACrCqC,SAAKV,IAAIM,GAAAA;AACTuO,UAAMrG,IAAIxN,OAAO0F,IAAAA;EACnB;AACA,SAAO,IAAI4H,IAAI;OAAIuG;IAAO5S,IAAI,CAAC,CAACjB,OAAO0F,IAAAA,MAAU;IAAC1F;IAAO;SAAI0F;;GAAM,CAAA;AACrE;AARSmB;AAUT,IAAMC,gBAAgB,wBAAC9G,OAAesF,QAAwB,GAAGtF,KAAAA,KAAcsF,GAAAA,IAAzD;AAQtB,SAAS2B,gBACPN,aACAC,SAAoB;AAEpB,QAAMG,QAAmB,CAAA;AACzB,QAAMC,SAAS,oBAAIsG,IAAAA;AACnB,aAAWjH,cAAcM,aAAa;AACpC,UAAMc,MAAMX,cAAcT,WAAWrG,OAAOqG,WAAWf,GAAG;AAC1D,QAAI,CAACsB,QAAQc,IAAID,GAAAA,GAAM;AACrBV,YAAMlB,KAAK,KAAA;AACX;IACF;AACAkB,UAAMlB,KAAK,IAAA;AACXmB,WAAOwG,IAAI/F,KAAKpB,UAAAA;AAChB,QAAIA,WAAW7F,WAAW,UAAWoG,SAAQsJ,OAAOzI,GAAAA;EACtD;AACA,SAAO;IAAEV;IAAOC,QAAQ;SAAIA,OAAO8M,OAAM;;EAAI;AAC/C;AAjBS7M;AAwBT,eAAesB,mBACbjI,IACAqG,aAA6B;AAE7B,aAAW,CAAC3G,OAAO0F,IAAAA,KAASmB,UAAUF,WAAAA,GAAc;AAClD,aAASf,KAAK,GAAGA,KAAKF,KAAK/C,QAAQiD,MAAM,KAAK;AAC5C,YAAMtF,GAAGiD,sBAAsBP,WAAW;QACxCzC,OAAO;UAAEP;UAAOsF,KAAK;YAAE7E,IAAIiF,KAAKN,MAAMQ,IAAIA,KAAK,GAAA;UAAK;QAAE;MACxD,CAAA;IACF;EACF;AACA,WAASA,KAAK,GAAGA,KAAKe,YAAYhE,QAAQiD,MAAM,KAAK;AACnD,UAAMtF,GAAGiD,sBAAsB3B,WAAW;MACxCf,MAAM8F,YAAYvB,MAAMQ,IAAIA,KAAK,GAAA,EAAK3E,IAAIqF,gBAAAA;IAC5C,CAAA;EACF;AACF;AAhBeiC;AAmBf,IAAMrC,kCAAkC;EACtClG,OAAO;EACPsF,KAAK;EACLqI,MAAM;EACNmB,MAAM;EACNiF,QAAQ;EACRvT,QAAQ;EACRsH,QAAQ;EACRE,OAAO;EACPC,QAAQ;EACRkH,UAAU;EACV6E,aAAa;EACbvF,eAAe;EACflF,QAAQ;EACRwF,YAAY;EACZ7G,WAAW;EACXC,YAAY;AACd;AAWA,IAAM8L,WAAW,wBAAC1B,MAA+BA,KAAK,OAAO,OAAOQ,KAAKC,UAAUT,CAAAA,GAAlE;AAMjB,SAAS3K,iBAAiB9H,IAAuB;AAC/C,QAAMoU,SAASpU;AACf,MAAI,OAAOoU,OAAOC,oBAAoB,WAAY,QAAOvU;AACzD,MAAIsU,OAAOE,oBAAoB,aAAc,QAAOC;AACpD,MAAIH,OAAOE,oBAAoB,QAAS,QAAOE;AAC/C,MAAIJ,OAAOE,oBAAoB,SAAU,QAAOG;AAChD,SAAO3U;AACT;AAPSgI;AAcT,IAAMyM,qBAAgC,8BAAOvU,IAAIsH,gBAAAA;AAC/C,QAAM0M,SAAoB,CAAA;AAC1B,QAAMhT,OAAOsG,YAAYnG,IAAI,CAAC8C,MAAAA;AAC5B,UAAMsG,IAAIyJ,OAAOnR;AACjBmR,WAAOjO,KACL9B,EAAE/D,OACF+D,EAAEuB,KACFvB,EAAEvD,QACFyT,SAASlQ,EAAE+D,MAAM,GACjBmM,SAASlQ,EAAEiE,KAAK,GAChBiM,SAASlQ,EAAEkE,MAAM,GACjBlE,EAAEmE,UAAUsM,YAAW,GACvBzQ,EAAEoE,WAAWqM,YAAW,CAAA;AAE1B,UAAMpG,IAAI,wBAACqG,MAAc,IAAIpK,IAAIoK,CAAAA,IAAvB;AACV,WAAO,IAAIrG,EAAE,CAAA,CAAA,WAAaA,EAAE,CAAA,CAAA,cAAgBA,EAAE,CAAA,CAAA,WAAaA,EAAE,CAAA,CAAA,YAAcA,EAAE,CAAA,CAAA,YAAcA,EAAE,CAAA,CAAA,aAAeA,EAAE,CAAA,CAAA,uCAAyCA,EAAE,CAAA,CAAA;EAC3J,CAAA;AACA,QAAMsG,UAAU,MAAM5U,GAAGqU,gBACvB;;mBAEerT,KAAK6T,KAAK,IAAA,CAAA;;;gCAGC,GACvBb,MAAAA;AAEL,SAAO,IAAIzQ,IAAIqR,QAAQzT,IAAI,CAACiC,QAAQ4D,cAAc5D,IAAI0R,QAAQvD,OAAOnO,IAAIoC,GAAG,CAAA,CAAA,CAAA;AAC9E,GA3BsC;AAiCtC,IAAMgP,kBAA6B,8BAAOxU,IAAIsH,gBAAAA;AAC5C,QAAMR,UAAU,oBAAIvD,IAAAA;AACpB,aAAW,CAACrD,OAAO0F,IAAAA,KAASmB,UAAUO,WAAAA,GAAc;AAClD,UAAMtG,QAAO,MAAMhB,GAAGqU,gBACpB,iFAAiFzO,KAC9EzE,IAAI,MAAM,GAAA,EACV0T,KAAK,IAAA,CAAA,uCACR3U,OAAAA,GACG0F,IAAAA;AAEL,eAAWxC,OAAOpC,MAAM8F,SAAQ5B,IAAI8B,cAAc5D,IAAI0R,QAAQvD,OAAOnO,IAAIoC,GAAG,CAAA,CAAA;EAC9E;AACA,QAAM+C,MAAMjB,YAAYtD,OAAO,CAACC,MAAM6C,QAAQc,IAAIZ,cAAc/C,EAAE/D,OAAO+D,EAAEuB,GAAG,CAAA,CAAA;AAC9E,MAAI+C,IAAI1F,WAAW,EAAG,QAAOiE;AAC7B,QAAMhB,KAAK,wBAACiP,MAAYA,EAAEL,YAAW,EAAGM,QAAQ,KAAK,GAAA,EAAKA,QAAQ,KAAK,EAAA,GAA5D;AACX,QAAMhB,SAAoB,CAAA;AAC1B,QAAMhT,OAAOuH,IAAIpH,IAAI,CAAC8C,GAAGyD,MAAAA;AACvBsM,WAAOjO,KACL9B,EAAE/D,OACF+D,EAAEuB,KACFvB,EAAEvD,QACFyT,SAASlQ,EAAE+D,MAAM,GACjBmM,SAASlQ,EAAEiE,KAAK,GAChBiM,SAASlQ,EAAEkE,MAAM,GACjBrC,GAAG7B,EAAEmE,SAAS,GACdtC,GAAG7B,EAAEoE,UAAU,CAAA;AAEjB,WAAOX,MAAM,IACT,uHACA;EACN,CAAA;AACA,QAAMuN,UAAU,MAAMjV,GAAGkV,kBACvB,8CAA8ClU,KAAK6T,KAAK,aAAA,CAAA;;;;iCAI7B,GACxBb,MAAAA;AAEL,MAAIiB,YAAY1M,IAAI1F,QAAQ;AAC1B,UAAM,IAAIH,MAAM,mEAAA;EAClB;AACA,SAAOoE;AACT,GA3CmC;AAiDnC,IAAM2N,mBAA8B,8BAAOzU,IAAIsH,gBAAAA;AAC7C,QAAM0M,SAAoB,CAAA;AAC1B,QAAMhT,OAAOsG,YAAYnG,IAAI,CAAC8C,MAAAA;AAC5B+P,WAAOjO,KACL9B,EAAE/D,OACF+D,EAAEuB,KACFvB,EAAEvD,QACFyT,SAASlQ,EAAE+D,MAAM,GACjBmM,SAASlQ,EAAEiE,KAAK,GAChBiM,SAASlQ,EAAEkE,MAAM,GACjBlE,EAAEmE,UAAU0K,QAAO,GACnB7O,EAAEoE,WAAWyK,QAAO,CAAA;AAEtB,WAAO;EACT,CAAA;AACA,QAAM8B,UAAU,MAAM5U,GAAGqU,gBACvB,0FAA0FrT,KAAK6T,KAAK,IAAA,CAAA;;;;;;4BAM9E,GACnBb,MAAAA;AAEL,SAAO,IAAIzQ,IAAIqR,QAAQzT,IAAI,CAACiC,QAAQ4D,cAAc5D,IAAI0R,QAAQvD,OAAOnO,IAAIoC,GAAG,CAAA,CAAA,CAAA;AAC9E,GA1BoC;AA4BpC,SAASgB,iBAAiBoC,IAAkB;AAC1C,SAAO;IACL1I,OAAO0I,GAAG1I;IACVsF,KAAKoD,GAAGpD;IACRqI,MAAMjF,GAAGiF;IACTmB,MAAMpG,GAAGoG;IACTiF,QAAQrL,GAAGqL;IACXvT,QAAQkI,GAAGlI;IACX2F,OAAO4B,WAAWW,GAAGvC,KAAK;IAC1B2B,QAAQC,WAAWW,GAAGZ,MAAM;IAC5BE,OAAOD,WAAWW,GAAGV,KAAK;IAC1BC,QAAQF,WAAWW,GAAGT,MAAM;IAC5BkH,UAAUzG,GAAGyG;IACb6E,aAAatL,GAAGsL,eAAe;IAC/BvF,eAAe/F,GAAG+F,iBAAiB;IACnClF,QAAQ8I,UAAU3J,GAAGa,MAAM;IAC3BwF,YAAYrG,GAAGqG;IACf7G,WAAWQ,GAAGR;IACdC,YAAYO,GAAGP;EACjB;AACF;AApBS7B;AAsBT,SAASd,kBAAkBtC,KAAkB;AAC3C,SAAO;IACLlD,OAAOkD,IAAIlD;IACXsF,KAAKpC,IAAIoC;IACTqI,MAAMzK,IAAIyK;IACVmB,MAAM5L,IAAI4L;IACViF,QAAQ7Q,IAAI6Q;IACZvT,QAAQ0C,IAAI1C;IACZ2F,OAAOjD,IAAIiD,SAASvG;IACpBkI,QAAQ5E,IAAI4E,UAAUlI;IACtBoI,OAAQ9E,IAAI8E,SAASpI;IACrBqI,QAAS/E,IAAI+E,UAAUrI;IACvBuP,UAAUjM,IAAIiM;IACd6E,aAAa9Q,IAAI8Q,eAAepU;IAChC6O,eAAevL,IAAIuL,iBAAiB7O;IACpC2J,QAAQ+I,WAAWpP,IAAIqG,MAAM;IAC7BwF,YAAY7L,IAAI6L,cAAc7L,IAAIgF;IAClCA,WAAWhF,IAAIgF;IACfC,YAAYjF,IAAIiF;EAClB;AACF;AApBS3C;AAsBT,SAAS6G,eAAetH,GAAiB;AACvC,SAAO;IACLvD,IAAIuD,EAAEvD;IACN7B,WAAWoF,EAAEpF;IACbO,UAAU6E,EAAE7E;IACZwM,QAAQ3H,EAAE2H;IACVC,YAAY5H,EAAE4H,cAAc,OAAO,OAAOlD,OAAO1E,EAAE4H,UAAU;IAC7DxL,MAAM4G,WAAWhD,EAAE5D,IAAI;IACvByL,MAAM7H,EAAE6H;IACRC,OAAO9H,EAAE8H;IACTzD,WAAWrE,EAAEqE;IACb1E,WAAWK,EAAEL;EACf;AACF;AAbS2H;AAeT,SAASE,gBAAgBrJ,KAAgB;AACvC,QAAM/B,OAAO8T,MAAMC,QAAQhS,IAAI/B,IAAI,IAAK+B,IAAI/B,OAAoBvB;AAChE,SAAO;IACL4B,IAAI0B,IAAI1B;IACR7B,WAAWuD,IAAIvD;IACfO,UAAUgD,IAAIhD;IACdwM,QAAQxJ,IAAIwJ;IACZC,YAAYzJ,IAAIyJ,cAAc,OAAO,OAAO0E,OAAOnO,IAAIyJ,UAAU;IACjE,GAAIxL,MAAMwB,SAAS;MAAExB;IAAK,IAAI,CAAC;IAC/ByL,MAAO1J,IAAI0J,QAAQ,CAAC;IACpBC,OAAQ3J,IAAI2J,SAAS,CAAC;IACtBzD,WAAWlG,IAAIkG;IACf1E,WAAWxB,IAAIwB;EACjB;AACF;AAdS6H;;;ACjjDF,SAAS4I,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA;;AAEJ;AAVgBA;","names":["namespaceWhere","namespace","undefined","PrismaStateStore","db","tryAdmitSingleton","runId","tag","workflow","limit","retryWakeAt","$transaction","tx","where","status","in","SINGLETON_ACTIVE_STATUSES","durableWorkflowRun","updateMany","data","rows","findMany","runs","map","fromRunRow","tags","singletonAdmissionTags","patch","singletonAdmissionDenialPatch","update","id","toRunPatch","createRun","run","createMany","toRunData","reindexAttributes","searchAttributes","updateRun","inputPatch","TERMINAL_RUN_STATUSES","includes","clearTerminalSingletonAdmission","getRun","count","findUnique","Error","updateRunIf","expectedStatuses","length","Object","keys","attributes","durableRunAttribute","deleteMany","normalizeAttributeRows","row","getRuns","runIds","Set","deleteRun","durableStepCheckpoint","durableSignalWaiter","deleteRuns","pruneTerminalRuns","policy","nowMs","statuses","filter","s","maxAge","maxCount","scoped","runWhere","scope","ids","cutoff","Date","parseDuration","AND","updatedAt","lt","select","orderBy","take","r","add","size","skip","doomed","slice","getCheckpoint","seq","runId_seq","fromCheckpointRow","getCheckpoints","seqs","unique","at","push","sort","a","b","getCheckpointsForSettle","CHECKPOINT_SELECT_WITHOUT_INPUT","input","saveCheckpoint","checkpoint","toCheckpointData","upsert","create","saveCheckpointIfPending","saveCheckpointsIfPending","checkpoints","pending","seqsByRun","checkpointKey","wrote","writes","decideIfPending","chunk","settleCheckpointsIfPending","settlements","seen","firsts","forEach","i","key","has","dialect","rawSettleDialect","settle","output","jsonOrNull","error","events","startedAt","finishedAt","raw","won","saveCheckpoints","replaceCheckpoints","transaction","work","cp","listIncompleteRuns","listOrphanedRuns","ownedBy","OR","lockedUntil","lte","lockedBy","owner","lockedBefore","createdAt","listPendingRuns","listDueTimers","wakeAt","not","BigInt","tryLockRun","leaseUntilMs","result","releaseRunLock","renewRunLock","query","and","workflows","anyOf","w","namespaces","n","origin","origins","o","array_contains","t","f","attributeSome","listRuns","offset","countRuns","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","runValueFacets","axis","opts","axisIsRunColumn","scan","RUN_VALUE_FACET_SCAN","runValueFacetsFromRuns","field","mergeRunValueFacetRows","value","schedules","delegate","durableSchedule","saveSchedule","record","toScheduleData","getSchedule","fromScheduleRow","updateSchedule","expectedNextFireAt","paused","nextFireAt","spec","state","deleteSchedule","listSchedules","dueBy","nulls","listCheckpoints","listCheckpointsForReplay","open","inputs","Map","found","set","get","getLatestCheckpointByName","name","findFirst","hasCheckpoints","fromSeq","toSeq","gte","countCheckpoints","listCheckpointsByNamePrefix","prefixes","p","startsWith","some","checkpointStats","group","parallelGroup","grouped","Promise","all","NAME_KINDS","kind","enqueuedAt","_min","_max","_sum","attempts","stats","unenqueued","unenqueuedStartedAt","toCheckpointStat","flat","bucketKey","queryCheckpoints","namePrefixes","excludeGroups","notIn","putSignalWaiter","waiter","token","takeSignalWaiter","delete","listSignalWaiters","prefix","registerChildWaits","entries","compactCheckpoints","into","listSignalWaitersByRun","hasSignalWaiter","tokenPrefix","first","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","takeBufferedSignal","listBufferedSignals","afterId","gt","Number","String","deleteBufferedSignals","bufferEvent","durableBufferedEvent","publishedAt","listBufferedEvents","removeBufferedEvent","comparisons","attributePredicateOperands","column","comparator","operand","op","MATCHES_NOTHING","branches","bigOrNull","numOrUndef","v","workflowVersion","awaitingDecisionTaskId","recoveryAttempts","priority","getTime","KIND_PREFIXES","NOT","JSON","stringify","nameKind","fallback","enqueued","minEnqueuedAt","minSeq","maxSeq","minName","maxName","minStartedAt","maxStartedAt","maxFinishedAt","sumAttempts","byRun","values","stepId","workerGroup","jsonText","client","$queryRawUnsafe","_activeProvider","settleRowsPostgres","settleRowsMysql","settleRowsSqlite","toISOString","k","written","join","run_id","d","replace","updated","$executeRawUnsafe","Array","isArray","durableManagedTables"]}
|
|
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 CheckpointNameKind,\n type CheckpointQuery,\n type CheckpointStat,\n type ChildWait,\n type OwnedLeaseReclaim,\n RUN_VALUE_FACET_SCAN,\n type RetentionPolicy,\n type RunFacetQuery,\n type RunFacetRow,\n type RunQuery,\n type RunStatus,\n type RunValueAxis,\n type RunValueFacetOptions,\n type RunValueFacetRow,\n SINGLETON_ACTIVE_STATUSES,\n SINGLETON_LOCK_CHUNK,\n type ScheduleQuery,\n type ScheduleRecord,\n type SignalWaiter,\n type StateStore,\n type StepCheckpoint,\n type StepError,\n type StepEvent,\n type StepSettlement,\n type BufferedSignalRow as StoreBufferedSignalRow,\n TERMINAL_RUN_STATUSES,\n type WorkflowRun,\n attributePredicateOperands,\n axisIsRunColumn,\n clearTerminalSingletonAdmission,\n mergeRunFacetRows,\n mergeRunValueFacetRows,\n normalizeAttributeRows,\n parseDuration,\n runValueFacetsFromRuns,\n singletonAdmissionDenialPatch,\n singletonAdmissionTags,\n singletonClaimantIds,\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 count(args?: Args): Promise<number>;\n /** Aggregate form — used by the run facets and `checkpointStats`, whose rows are aggregate cells,\n * not 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\ninterface ScheduleRow {\n id: string;\n namespace: string;\n workflow: string;\n paused: boolean;\n nextFireAt: bigint | null;\n tags: unknown;\n spec: unknown;\n state: unknown;\n createdAt: Date;\n updatedAt: Date;\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 /** Only needed for persisted schedules (`engine.schedules`) — add the `DurableSchedule` model. */\n durableSchedule?: Delegate<ScheduleRow>;\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 tryAdmitSingleton(\n runId: string,\n tag: string,\n workflow: string,\n limit: number,\n retryWakeAt?: number,\n ): Promise<boolean> {\n const where = { workflow, status: { in: SINGLETON_ACTIVE_STATUSES } };\n const lockRows = rowLockDialect(this.db);\n const claimants = lockRows\n ? singletonClaimantIds(\n // The primary, under the read-replicas extension: a lagging replica would leave rows out.\n await primaryOf(this.db).durableWorkflowRun.findMany({\n where,\n select: { id: true, tags: true },\n orderBy: { id: 'asc' },\n }),\n tag,\n )\n : [];\n return this.db.$transaction(async (tx) => {\n // Lock first, so concurrent claims cannot read the same free slot: this key's rows in one\n // global order, so claims queue instead of deadlocking, or, on a store with a single writer,\n // a locking write that takes its lock.\n if (lockRows) {\n for (let at = 0; at < claimants.length; at += SINGLETON_LOCK_CHUNK) {\n await lockRows(\n tx as unknown as RawPrismaClient,\n claimants.slice(at, at + SINGLETON_LOCK_CHUNK),\n );\n }\n } else {\n await tx.durableWorkflowRun.updateMany({ where, data: { workflow } });\n }\n const rows = await tx.durableWorkflowRun.findMany({ where });\n const runs = rows.map(fromRunRow);\n const tags = singletonAdmissionTags(runs, runId, tag, workflow, limit);\n if (!tags) {\n const patch = singletonAdmissionDenialPatch(runs, runId, tag, workflow, retryWakeAt);\n if (patch)\n await tx.durableWorkflowRun.update({ where: { id: runId }, data: toRunPatch(patch) });\n return false;\n }\n await tx.durableWorkflowRun.update({ where: { id: runId }, data: { tags } });\n return true;\n });\n }\n\n async createRun(run: WorkflowRun): Promise<void> {\n // One INSERT: `create` also reads the row back to return it, in a transaction on MySQL.\n await this.db.durableWorkflowRun.createMany({ data: [toRunData(run)] });\n await this.reindexAttributes(run.id, run.searchAttributes);\n }\n\n async updateRun(runId: string, inputPatch: Partial<WorkflowRun>): Promise<void> {\n const patch =\n inputPatch.status && TERMINAL_RUN_STATUSES.includes(inputPatch.status)\n ? await clearTerminalSingletonAdmission(runId, inputPatch, (id) => this.getRun(id))\n : inputPatch;\n // One UPDATE: `update` also reads the row back to return it, in a transaction on MySQL. A run\n // that does not exist still throws, as `update` does.\n const { count } = await this.db.durableWorkflowRun.updateMany({\n where: { id: runId },\n data: toRunPatch(patch),\n });\n if (count === 0 && !(await this.db.durableWorkflowRun.findUnique({ where: { id: runId } }))) {\n throw new Error(`run ${runId} not found`);\n }\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 async updateRunIf(\n runId: string,\n expectedStatuses: RunStatus[],\n inputPatch: Partial<WorkflowRun>,\n ): Promise<boolean> {\n if (expectedStatuses.length === 0) return false;\n const patch =\n inputPatch.status && TERMINAL_RUN_STATUSES.includes(inputPatch.status)\n ? await clearTerminalSingletonAdmission(runId, inputPatch, (id) => this.getRun(id))\n : inputPatch;\n // One conditional `updateMany` (`UPDATE … WHERE id = ? AND status IN (…)`): the status\n // predicate is the compare, the row count the answer, and a missing row matches nothing.\n const where = { id: runId, status: { in: expectedStatuses } };\n const data = toRunPatch(patch);\n // Nothing to write but (maybe) the attribute side-table: the compare is a read (an `updateMany`\n // with no data would report zero rows even on a match).\n const count = Object.keys(data).length\n ? (await this.db.durableWorkflowRun.updateMany({ where, data })).count\n : await this.db.durableWorkflowRun.count({ where });\n if (count === 0) return false;\n if ('searchAttributes' in patch) await this.reindexAttributes(runId, patch.searchAttributes);\n return true;\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 getRuns(runIds: string[]): Promise<WorkflowRun[]> {\n if (runIds.length === 0) return [];\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { id: { in: [...new Set(runIds)] } },\n });\n return rows.map(fromRunRow);\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 deleteRuns(runIds: string[]): Promise<void> {\n if (runIds.length === 0) return;\n // Same cascade as deleteRun, one `IN (...)` per table, atomically.\n await this.db.$transaction(async (tx) => {\n await tx.durableStepCheckpoint.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableSignalWaiter.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableRunAttribute.deleteMany({ where: { runId: { in: runIds } } });\n await tx.durableWorkflowRun.deleteMany({ where: { id: { in: runIds } } });\n });\n }\n\n async pruneTerminalRuns(policy: RetentionPolicy, nowMs: number, limit: number): Promise<number> {\n // Only terminal statuses are ever eligible — a policy naming a live status would race the engine.\n const statuses = policy.statuses.filter((s) => TERMINAL_RUN_STATUSES.includes(s));\n if (statuses.length === 0 || limit <= 0) return 0;\n if (policy.maxAge == null && policy.maxCount == null) return 0;\n // A scoped policy only ever sees (and, for maxCount, counts) the runs its scope matches.\n const scoped = this.runWhere({ ...(policy.scope ?? {}), statuses });\n const ids = new Set<string>();\n if (policy.maxAge != null) {\n const cutoff = new Date(nowMs - parseDuration(policy.maxAge));\n const rows = await this.db.durableWorkflowRun.findMany({\n where: { AND: [scoped, { updatedAt: { lt: cutoff } }] },\n select: { id: true },\n orderBy: { updatedAt: 'asc' }, // oldest first\n take: limit,\n });\n for (const r of rows) ids.add(r.id);\n }\n if (policy.maxCount != null && ids.size < limit) {\n // Everything past the newest `maxCount` rows of the scoped status set (skipped by OFFSET).\n const rows = await this.db.durableWorkflowRun.findMany({\n where: scoped,\n select: { id: true },\n orderBy: [{ updatedAt: 'desc' }, { id: 'desc' }],\n skip: policy.maxCount,\n take: limit,\n });\n for (const r of rows) {\n if (ids.size >= limit) break;\n ids.add(r.id);\n }\n }\n const doomed = [...ids].slice(0, limit);\n await this.deleteRuns(doomed);\n return doomed.length;\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 getCheckpoints(runId: string, seqs: number[]): Promise<StepCheckpoint[]> {\n const unique = [...new Set(seqs)];\n const rows = [];\n for (let at = 0; at < unique.length; at += 500) {\n rows.push(\n ...(await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: unique.slice(at, at + 500) } },\n })),\n );\n }\n return rows.sort((a, b) => a.seq - b.seq).map(fromCheckpointRow);\n }\n\n async getCheckpointsForSettle(runId: string, seqs: number[]): Promise<StepCheckpoint[]> {\n const unique = [...new Set(seqs)];\n const rows = [];\n for (let at = 0; at < unique.length; at += 500) {\n rows.push(\n ...(await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: unique.slice(at, at + 500) } },\n select: CHECKPOINT_SELECT_WITHOUT_INPUT,\n })),\n );\n }\n return rows\n .sort((a, b) => a.seq - b.seq)\n .map((row) => fromCheckpointRow({ ...row, input: 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 saveCheckpointIfPending(checkpoint: StepCheckpoint): Promise<boolean> {\n // One conditional `updateMany` (`UPDATE … WHERE run_id = ? AND seq = ? AND status = 'pending'`):\n // the status predicate is the compare, the row count the answer, and a missing row is never made.\n const { runId, seq, ...data } = toCheckpointData(checkpoint);\n const { count } = await this.db.durableStepCheckpoint.updateMany({\n where: { runId, seq, status: 'pending' },\n data,\n });\n return count > 0;\n }\n\n async saveCheckpointsIfPending(checkpoints: StepCheckpoint[]): Promise<boolean[]> {\n if (checkpoints.length === 0) return [];\n // Prisma has no multi-row conditional update, so in one transaction: read the batch's rows that\n // are still `pending`, decide each entry in order against them (an entry that settles a row makes\n // a later entry for it lose), then replace each winning row with its last winning entry: one\n // `deleteMany` that only deletes rows still `pending`, and one `createMany`. A row settled by\n // someone else between the read and the delete fails the batch (rolled back, so nothing is\n // written), and the engine settles its entries one by one.\n return this.db.$transaction(async (tx) => {\n const pending = new Set<string>();\n for (const [runId, seqs] of seqsByRun(checkpoints)) {\n for (let at = 0; at < seqs.length; at += 500) {\n const rows = await tx.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: seqs.slice(at, at + 500) }, status: 'pending' },\n select: { runId: true, seq: true },\n });\n for (const row of rows) pending.add(checkpointKey(row.runId, row.seq));\n }\n }\n const { wrote, writes } = decideIfPending(checkpoints, pending);\n for (const [runId, seqs] of seqsByRun(writes)) {\n for (let at = 0; at < seqs.length; at += 500) {\n const chunk = seqs.slice(at, at + 500);\n const { count } = await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { in: chunk }, status: 'pending' },\n });\n if (count !== chunk.length) {\n throw new Error('a checkpoint of the batch was settled while the batch was written');\n }\n }\n }\n for (let at = 0; at < writes.length; at += 500) {\n await tx.durableStepCheckpoint.createMany({\n data: writes.slice(at, at + 500).map(toCheckpointData),\n });\n }\n return wrote;\n });\n }\n\n async settleCheckpointsIfPending(settlements: StepSettlement[]): Promise<boolean[]> {\n const wrote = settlements.map(() => false);\n if (settlements.length === 0) return wrote;\n // A settlement never leaves its row `pending`, so only the first entry for a row can win.\n const seen = new Set<string>();\n const firsts: number[] = [];\n settlements.forEach((s, i) => {\n const key = checkpointKey(s.runId, s.seq);\n if (seen.has(key)) return;\n seen.add(key);\n firsts.push(i);\n });\n const dialect = rawSettleDialect(this.db);\n if (!dialect) {\n // One conditional `updateMany` per entry, in one transaction: the row count is its answer.\n const settle = async (db: Pick<DurablePrismaClient, 'durableStepCheckpoint'>) => {\n for (const i of firsts) {\n const s = settlements[i] as StepSettlement;\n const { count } = await db.durableStepCheckpoint.updateMany({\n where: { runId: s.runId, seq: s.seq, status: 'pending' },\n data: {\n status: s.status,\n output: jsonOrNull(s.output),\n error: jsonOrNull(s.error),\n events: jsonOrNull(s.events),\n startedAt: s.startedAt,\n finishedAt: s.finishedAt,\n },\n });\n wrote[i] = count > 0;\n }\n };\n if (firsts.length === 1) await settle(this.db);\n else await this.db.$transaction((tx) => settle(tx));\n return wrote;\n }\n // Prisma has no multi-row update with a value per row, so a batch is settled with raw SQL on the\n // models' fixed table and column names, 500 rows a statement, in one transaction.\n await this.db.$transaction(async (tx) => {\n const raw = tx as unknown as RawPrismaClient;\n for (let at = 0; at < firsts.length; at += 500) {\n const chunk = firsts.slice(at, at + 500);\n const won = await dialect(\n raw,\n chunk.map((i) => settlements[i] as StepSettlement),\n );\n for (const i of chunk) {\n const s = settlements[i] as StepSettlement;\n wrote[i] = won.has(checkpointKey(s.runId, s.seq));\n }\n }\n });\n return wrote;\n }\n\n async saveCheckpoints(checkpoints: StepCheckpoint[]): Promise<void> {\n if (checkpoints.length === 0) return;\n await this.db.$transaction((tx) => replaceCheckpoints(tx, checkpoints));\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 listOrphanedRuns(\n nowMs: number,\n limit: number,\n namespace?: string,\n ownedBy?: OwnedLeaseReclaim,\n ): Promise<WorkflowRun[]> {\n if (limit <= 0) return [];\n const rows = await this.db.durableWorkflowRun.findMany({\n where: {\n status: { in: ['running', 'cancelling'] },\n OR: [\n { lockedUntil: null },\n { lockedUntil: { lte: new Date(nowMs) } },\n // A live lease left by a previous process with the caller's own instance id.\n ...(ownedBy\n ? [{ lockedBy: ownedBy.owner, lockedUntil: { lt: new Date(ownedBy.lockedBefore) } }]\n : []),\n ],\n ...namespaceWhere(namespace),\n },\n orderBy: { createdAt: 'asc' },\n take: limit,\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, limit?: number): 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 orderBy: { wakeAt: 'asc' },\n ...(limit !== undefined ? { take: limit } : {}),\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, owner?: 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: owner === undefined ? { id: runId } : { id: runId, lockedBy: owner },\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 async countRuns(query: Omit<RunQuery, 'limit' | 'offset'>): Promise<number> {\n return this.db.durableWorkflowRun.count({ where: this.runWhere(query) });\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 // ---- persisted schedules ----------------------------------------------------------------------\n\n private schedules(): Delegate<ScheduleRow> {\n const delegate = this.db.durableSchedule;\n if (!delegate) {\n throw new Error(\n 'persisted schedules need the DurableSchedule model — copy it from prisma/schema.prisma into your schema and re-run `prisma generate`',\n );\n }\n return delegate;\n }\n\n async saveSchedule(record: ScheduleRecord): Promise<void> {\n const data = toScheduleData(record);\n await this.schedules().upsert({ where: { id: record.id }, create: data, update: data });\n }\n\n async getSchedule(id: string): Promise<ScheduleRecord | null> {\n const row = await this.schedules().findUnique({ where: { id } });\n return row ? fromScheduleRow(row) : null;\n }\n\n /** One conditional `updateMany`: the compare-and-set on `next_fire_at` is a single statement. */\n async updateSchedule(\n id: string,\n patch: Partial<Omit<ScheduleRecord, 'id' | 'createdAt'>>,\n expectedNextFireAt?: number | null,\n ): Promise<boolean> {\n const data: Record<string, unknown> = {};\n if (patch.namespace !== undefined) data.namespace = patch.namespace;\n if (patch.workflow !== undefined) data.workflow = patch.workflow;\n if (patch.paused !== undefined) data.paused = patch.paused;\n if ('nextFireAt' in patch)\n data.nextFireAt = patch.nextFireAt == null ? null : BigInt(patch.nextFireAt);\n if ('tags' in patch) data.tags = jsonOrNull(patch.tags);\n if (patch.spec !== undefined) data.spec = patch.spec;\n if (patch.state !== undefined) data.state = patch.state;\n if (patch.updatedAt !== undefined) data.updatedAt = patch.updatedAt;\n if (!Object.keys(data).length) return (await this.getSchedule(id)) !== null;\n const where: Record<string, unknown> = { id };\n if (expectedNextFireAt !== undefined)\n where.nextFireAt = expectedNextFireAt === null ? null : BigInt(expectedNextFireAt);\n const { count } = await this.schedules().updateMany({ where, data });\n return count > 0;\n }\n\n async deleteSchedule(id: string): Promise<boolean> {\n const { count } = await this.schedules().deleteMany({ where: { id } });\n return count > 0;\n }\n\n async listSchedules(query: ScheduleQuery): Promise<ScheduleRecord[]> {\n const where: Record<string, unknown> = {};\n if (query.namespace !== undefined) where.namespace = query.namespace;\n if (query.workflow !== undefined) where.workflow = query.workflow;\n if (query.paused !== undefined) where.paused = query.paused;\n if (query.tag !== undefined) where.tags = { array_contains: query.tag };\n if (query.dueBy !== undefined) {\n where.AND = [{ paused: false }, { nextFireAt: { lte: BigInt(query.dueBy) } }];\n }\n const rows = await this.schedules().findMany({\n where,\n // Soonest-due first, never-firing (NULL) last, id as the stable tie-break.\n orderBy: [{ nextFireAt: { sort: 'asc', nulls: 'last' } }, { id: 'asc' }],\n take: query.limit,\n skip: query.offset,\n });\n return rows.map(fromScheduleRow);\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 listCheckpointsForReplay(runId: string): Promise<StepCheckpoint[]> {\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: { runId },\n orderBy: { seq: 'asc' },\n select: CHECKPOINT_SELECT_WITHOUT_INPUT,\n });\n // An open or failed step keeps its input; read by seq, so a row settled since is still filled.\n const open = rows.filter((row) => row.status !== 'completed').map((row) => row.seq);\n const inputs = new Map<number, unknown>();\n for (let at = 0; at < open.length; at += 500) {\n const found = await this.db.durableStepCheckpoint.findMany({\n where: { runId, seq: { in: open.slice(at, at + 500) } },\n select: { seq: true, input: true },\n });\n for (const row of found) inputs.set(row.seq, row.input);\n }\n return rows.map((row) => fromCheckpointRow({ ...row, input: inputs.get(row.seq) ?? null }));\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 hasCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n statuses: StepCheckpoint['status'][],\n ): Promise<boolean> {\n if (statuses.length === 0) return false;\n const row = await this.db.durableStepCheckpoint.findFirst({\n where: { runId, seq: { gte: fromSeq, lte: toSeq }, status: { in: statuses } },\n select: { seq: true },\n orderBy: { seq: 'desc' },\n });\n return row !== null;\n }\n\n async countCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n statuses: StepCheckpoint['status'][],\n ): Promise<number> {\n if (statuses.length === 0) return 0;\n return this.db.durableStepCheckpoint.count({\n where: { runId, seq: { gte: fromSeq, lte: toSeq }, status: { in: statuses } },\n });\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 // On some providers (SQLite) `startsWith` compiles to a `LIKE` that reads `_` and `%` as wildcards,\n // so it can match more than the prefix: keep only the exact matches.\n return rows.filter((r) => prefixes.some((p) => r.name.startsWith(p))).map(fromCheckpointRow);\n }\n\n /**\n * One `groupBy(parallelGroup, status)` per {@link CheckpointNameKind}, each narrowed to its kind by\n * a name-prefix predicate, run concurrently — Prisma cannot group by a `CASE`, so the kind is the\n * `where` instead. `minEnqueuedAt` reads a NULL `enqueuedAt` as `startedAt` (as\n * {@link fromCheckpointRow} does): a bucket whose non-null `enqueuedAt` count falls short of its\n * row count has such rows, and only for those kinds is the NULL subset's `min(startedAt)` asked for.\n *\n * On SQLite `startsWith` is a case-insensitive `LIKE`, as in {@link listCheckpointsByNamePrefix};\n * the kind prefixes are lower-case and wildcard-free, so only a step whose name starts with one of\n * them in another case would be classified differently there.\n */\n async checkpointStats(\n runId: string,\n opts?: { group?: string | undefined },\n ): Promise<CheckpointStat[]> {\n const scope = opts?.group === undefined ? { runId } : { runId, parallelGroup: opts.group };\n const grouped = await Promise.all(\n NAME_KINDS.map(async ({ kind, where }) => ({\n kind,\n where,\n rows: (await this.db.durableStepCheckpoint.groupBy({\n by: ['parallelGroup', 'status'],\n where: { ...scope, ...where },\n _count: { _all: true, enqueuedAt: true },\n _min: { seq: true, name: true, enqueuedAt: true, startedAt: true },\n _max: { seq: true, name: true, startedAt: true, finishedAt: true },\n _sum: { attempts: true },\n })) as CheckpointStatRow[],\n })),\n );\n const stats = await Promise.all(\n grouped.map(async ({ kind, where, rows }) => {\n const unenqueued = rows.some((r) => r._count.enqueuedAt < r._count._all)\n ? await this.unenqueuedStartedAt({ ...scope, ...where })\n : new Map<string, Date>();\n return rows.map((r) => toCheckpointStat(kind, r, unenqueued));\n }),\n );\n return stats.flat();\n }\n\n /** `min(startedAt)` per `(parallelGroup, status)` over the rows whose `enqueuedAt` is NULL. */\n private async unenqueuedStartedAt(where: Record<string, unknown>): Promise<Map<string, Date>> {\n const rows = (await this.db.durableStepCheckpoint.groupBy({\n by: ['parallelGroup', 'status'],\n where: { ...where, enqueuedAt: null },\n _min: { startedAt: true },\n })) as { parallelGroup: string | null; status: string; _min: { startedAt: Date } }[];\n return new Map(rows.map((r) => [bucketKey(r.parallelGroup, r.status), r._min.startedAt]));\n }\n\n /** {@link CheckpointQuery} as one `findMany`, in `seq` order, paged by `skip`/`take`. Ungrouped rows\n * are kept past `excludeGroups` explicitly: `NOT IN` alone drops a NULL `parallelGroup`. */\n async queryCheckpoints(runId: string, query: CheckpointQuery): Promise<StepCheckpoint[]> {\n if (query.statuses?.length === 0 || query.namePrefixes?.length === 0) return [];\n const and: Record<string, unknown>[] = [];\n if (query.excludeGroups?.length) {\n and.push({\n OR: [{ parallelGroup: null }, { parallelGroup: { notIn: query.excludeGroups } }],\n });\n }\n if (query.namePrefixes) {\n and.push({ OR: query.namePrefixes.map((p) => ({ name: { startsWith: p } })) });\n }\n const rows = await this.db.durableStepCheckpoint.findMany({\n where: {\n runId,\n ...(query.group === undefined ? {} : { parallelGroup: query.group }),\n ...(query.statuses ? { status: { in: query.statuses } } : {}),\n ...(and.length ? { AND: and } : {}),\n },\n orderBy: { seq: 'asc' },\n skip: query.offset,\n take: query.limit,\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 // On some providers (SQLite) `startsWith` compiles to a `LIKE` that reads `_` and `%` as wildcards,\n // so it can match more than the prefix: keep only the exact matches.\n return rows\n .filter((r) => r.token.startsWith(prefix))\n .map((r) => ({\n token: r.token,\n runId: r.runId,\n seq: r.seq,\n parallelGroup: r.parallelGroup ?? undefined,\n }));\n }\n\n async registerChildWaits(entries: ChildWait[]): Promise<void> {\n if (entries.length === 0) return;\n // Prisma has no multi-row upsert: replace the waiters and the placeholders, one `deleteMany`\n // and one `createMany` per chunk of each, inside a single transaction.\n await this.db.$transaction(async (tx) => {\n for (let at = 0; at < entries.length; at += 500) {\n const chunk = entries.slice(at, at + 500);\n await tx.durableSignalWaiter.deleteMany({\n where: { token: { in: chunk.map(({ waiter }) => waiter.token) } },\n });\n await tx.durableSignalWaiter.createMany({\n data: chunk.map(({ waiter }) => ({\n token: waiter.token,\n runId: waiter.runId,\n seq: waiter.seq,\n parallelGroup: waiter.parallelGroup ?? null,\n })),\n });\n }\n await replaceCheckpoints(\n tx,\n entries.map(({ checkpoint }) => checkpoint),\n );\n });\n }\n\n async compactCheckpoints(\n runId: string,\n fromSeq: number,\n toSeq: number,\n into: StepCheckpoint,\n ): Promise<void> {\n await this.db.$transaction(async (tx) => {\n await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { gte: fromSeq, lte: toSeq } },\n });\n const data = toCheckpointData(into);\n await tx.durableStepCheckpoint.upsert({\n where: { runId_seq: { runId: into.runId, seq: into.seq } },\n create: data,\n update: data,\n });\n });\n }\n\n async listSignalWaitersByRun(runIds: string[]): Promise<SignalWaiter[]> {\n if (runIds.length === 0) return [];\n const rows = await this.db.durableSignalWaiter.findMany({ where: { runId: { in: runIds } } });\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 hasSignalWaiter(runId: string, tokenPrefix: string): Promise<boolean> {\n // On SQLite, Prisma's `startsWith` is a bare `LIKE`: `_`/`%` in the prefix act as wildcards and\n // case is ignored. So a hit is confirmed in JS; only a pattern match that is not a real prefix\n // match pays for the full read.\n const where = { runId, token: { startsWith: tokenPrefix } };\n const first = await this.db.durableSignalWaiter.findFirst({ where, select: { token: true } });\n if (!first) return false;\n if (first.token.startsWith(tokenPrefix)) return true;\n const rows = await this.db.durableSignalWaiter.findMany({ where, select: { token: true } });\n return rows.some((r) => r.token.startsWith(tokenPrefix));\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 listBufferedSignals(\n tokenPrefix: string,\n afterId: string | undefined,\n limit: number,\n ): Promise<StoreBufferedSignalRow[]> {\n // Ids as numbers: Prisma takes a number for a `BigInt` column too, and the SQLite test schema's\n // id is an `Int`. An auto-increment stays far below 2^53.\n const rows = await this.db.durableBufferedSignal.findMany({\n where: {\n token: { startsWith: tokenPrefix },\n ...(afterId !== undefined ? { id: { gt: Number(afterId) } } : {}),\n },\n orderBy: { id: 'asc' },\n take: limit,\n });\n // `startsWith` becomes a `LIKE`, which on SQLite still reads `_`/`%` as wildcards: keep only the\n // real prefix matches.\n return rows\n .filter((r) => r.token.startsWith(tokenPrefix))\n .map((r) => ({ id: String(r.id), token: r.token, payload: r.payload ?? undefined }));\n }\n\n async deleteBufferedSignals(ids: string[]): Promise<void> {\n if (ids.length === 0) return;\n await this.db.durableBufferedSignal.deleteMany({ where: { id: { in: ids.map(Number) } } });\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', // '' is the default pool too\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\n/** The name prefix each non-`step` {@link CheckpointNameKind} is, as `checkpointNameKind` reads it. */\nconst KIND_PREFIXES: [CheckpointNameKind, string][] = [\n ['child', 'signal:child:'],\n ['folded', 'fan:'],\n ['spawn', 'spawn:'],\n];\n\n/** Each {@link CheckpointNameKind} as the `where` that selects its rows; `step` is \"none of the others\". */\nconst NAME_KINDS: { kind: CheckpointNameKind; where: Record<string, unknown> }[] = [\n ...KIND_PREFIXES.map(([kind, prefix]) => ({ kind, where: { name: { startsWith: prefix } } })),\n {\n kind: 'step',\n where: { NOT: KIND_PREFIXES.map(([, prefix]) => ({ name: { startsWith: prefix } })) },\n },\n];\n\n/** One `groupBy` row of {@link PrismaStateStore.checkpointStats}. */\ntype CheckpointStatRow = {\n parallelGroup: string | null;\n status: string;\n _count: { _all: number; enqueuedAt: number };\n _min: { seq: number; name: string; enqueuedAt: Date | null; startedAt: Date };\n _max: { seq: number; name: string; startedAt: Date; finishedAt: Date };\n _sum: { attempts: number | bigint | null };\n};\n\nfunction bucketKey(group: string | null, status: string): string {\n return JSON.stringify([group, status]);\n}\n\nfunction toCheckpointStat(\n nameKind: CheckpointNameKind,\n r: CheckpointStatRow,\n unenqueued: Map<string, Date>,\n): CheckpointStat {\n const fallback = unenqueued.get(bucketKey(r.parallelGroup, r.status));\n const enqueued = r._min.enqueuedAt;\n const minEnqueuedAt =\n enqueued && fallback ? (enqueued < fallback ? enqueued : fallback) : (enqueued ?? fallback);\n return {\n group: r.parallelGroup,\n status: r.status as StepCheckpoint['status'],\n nameKind,\n count: r._count._all,\n minSeq: r._min.seq,\n maxSeq: r._max.seq,\n minName: r._min.name,\n maxName: r._max.name,\n // Every row has `enqueuedAt` or is in the NULL subset, so one of the two is set.\n minEnqueuedAt: minEnqueuedAt as Date,\n minStartedAt: r._min.startedAt,\n maxStartedAt: r._max.startedAt,\n maxFinishedAt: r._max.finishedAt,\n sumAttempts: Number(r._sum.attempts ?? 0),\n };\n}\n\n/** `checkpoints`' distinct seqs, by run. */\nfunction seqsByRun(checkpoints: { runId: string; seq: number }[]): Map<string, number[]> {\n const byRun = new Map<string, Set<number>>();\n for (const { runId, seq } of checkpoints) {\n const seqs = byRun.get(runId) ?? new Set<number>();\n seqs.add(seq);\n byRun.set(runId, seqs);\n }\n return new Map([...byRun].map(([runId, seqs]) => [runId, [...seqs]]));\n}\n\nconst checkpointKey = (runId: string, seq: number): string => `${runId}\\u0000${seq}`;\n\n/**\n * `saveCheckpointsIfPending`'s answers for `checkpoints` against the rows that were `pending` before\n * the batch (`pending`, by {@link checkpointKey}), in order: an entry wins while its row is still\n * pending, and an entry that is not `pending` itself settles the row. `writes` holds each row's\n * last winning entry.\n */\nfunction decideIfPending(\n checkpoints: StepCheckpoint[],\n pending: Set<string>,\n): { wrote: boolean[]; writes: StepCheckpoint[] } {\n const wrote: boolean[] = [];\n const writes = new Map<string, StepCheckpoint>();\n for (const checkpoint of checkpoints) {\n const key = checkpointKey(checkpoint.runId, checkpoint.seq);\n if (!pending.has(key)) {\n wrote.push(false);\n continue;\n }\n wrote.push(true);\n writes.set(key, checkpoint);\n if (checkpoint.status !== 'pending') pending.delete(key);\n }\n return { wrote, writes: [...writes.values()] };\n}\n\n/**\n * Write `checkpoints` (distinct rows), inserting or overwriting each. Prisma has no multi-row\n * upsert, so the rows are replaced: one `deleteMany` and one `createMany` per chunk. Call inside a\n * transaction.\n */\nasync function replaceCheckpoints(\n tx: DurablePrismaTx,\n checkpoints: StepCheckpoint[],\n): Promise<void> {\n for (const [runId, seqs] of seqsByRun(checkpoints)) {\n for (let at = 0; at < seqs.length; at += 500) {\n await tx.durableStepCheckpoint.deleteMany({\n where: { runId, seq: { in: seqs.slice(at, at + 500) } },\n });\n }\n }\n for (let at = 0; at < checkpoints.length; at += 500) {\n await tx.durableStepCheckpoint.createMany({\n data: checkpoints.slice(at, at + 500).map(toCheckpointData),\n });\n }\n}\n\n/** Every checkpoint column but `input`, as a Prisma `select`. */\nconst CHECKPOINT_SELECT_WITHOUT_INPUT = {\n runId: true,\n seq: true,\n name: true,\n kind: true,\n stepId: true,\n status: true,\n output: true,\n error: true,\n events: true,\n attempts: true,\n workerGroup: true,\n parallelGroup: true,\n wakeAt: true,\n enqueuedAt: true,\n startedAt: true,\n finishedAt: true,\n} satisfies Record<Exclude<keyof CheckpointRow, 'input'>, true>;\n\n/** The raw-query half of a Prisma client (or of its interactive-transaction client). */\ninterface RawPrismaClient {\n $queryRawUnsafe<T = unknown>(query: string, ...values: unknown[]): Promise<T>;\n $executeRawUnsafe(query: string, ...values: unknown[]): Promise<number>;\n}\n\n/** Settles distinct rows with raw SQL and resolves the keys ({@link checkpointKey}) it wrote. */\ntype RawSettle = (db: RawPrismaClient, settlements: StepSettlement[]) => Promise<Set<string>>;\n\nconst jsonText = (v: unknown): string | null => (v == null ? null : JSON.stringify(v));\n\n/**\n * The raw settle for the client's database, or `undefined` (a client without raw queries, or a\n * provider without one here), which settles row by row through `updateMany`.\n */\n/** `$primary()` when `@prisma/extension-read-replicas` is on the client, else the client itself. */\nfunction primaryOf(db: DurablePrismaClient): DurablePrismaClient {\n const client = db as unknown as { $primary?: () => DurablePrismaClient };\n return typeof client.$primary === 'function' ? client.$primary() : db;\n}\n\n/** `SELECT … ORDER BY id FOR UPDATE` on the run rows, where the provider has row locks. */\nfunction rowLockDialect(\n db: DurablePrismaClient,\n): ((tx: RawPrismaClient, ids: string[]) => Promise<unknown>) | undefined {\n const client = db as unknown as Partial<RawPrismaClient> & { _activeProvider?: string };\n if (typeof client.$queryRawUnsafe !== 'function') return undefined;\n if (client._activeProvider === 'postgresql') {\n return (tx, ids) =>\n tx.$queryRawUnsafe(\n `SELECT id FROM \"durable_workflow_runs\" WHERE id IN (${ids\n .map((_, i) => `$${i + 1}`)\n .join(', ')}) ORDER BY id FOR UPDATE`,\n ...ids,\n );\n }\n if (client._activeProvider === 'mysql') {\n return (tx, ids) =>\n tx.$queryRawUnsafe(\n `SELECT id FROM durable_workflow_runs WHERE id IN (${ids\n .map(() => '?')\n .join(', ')}) ORDER BY id FOR UPDATE`,\n ...ids,\n );\n }\n return undefined;\n}\n\nfunction rawSettleDialect(db: DurablePrismaClient): RawSettle | undefined {\n const client = db as unknown as Partial<RawPrismaClient> & { _activeProvider?: string };\n if (typeof client.$queryRawUnsafe !== 'function') return undefined;\n if (client._activeProvider === 'postgresql') return settleRowsPostgres;\n if (client._activeProvider === 'mysql') return settleRowsMysql;\n if (client._activeProvider === 'sqlite') return settleRowsSqlite;\n return undefined;\n}\n\n/**\n * One `UPDATE … FROM (VALUES …) WHERE status = 'pending' RETURNING`: the predicate is each row's\n * compare-and-set, and `RETURNING` names the rows written. Prisma's `DateTime` is a `timestamp(3)`\n * holding UTC, hence the conversion from the exact instant.\n */\nconst settleRowsPostgres: RawSettle = async (db, settlements) => {\n const values: unknown[] = [];\n const rows = settlements.map((s) => {\n const n = values.length;\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n s.startedAt.toISOString(),\n s.finishedAt.toISOString(),\n );\n const p = (k: number) => `$${n + k}`;\n return `(${p(1)}::text, ${p(2)}::integer, ${p(3)}::text, ${p(4)}::jsonb, ${p(5)}::jsonb, ${p(6)}::jsonb, (${p(7)}::timestamptz AT TIME ZONE 'UTC'), (${p(8)}::timestamptz AT TIME ZONE 'UTC'))`;\n });\n const written = await db.$queryRawUnsafe<{ run_id: string; seq: number }[]>(\n `UPDATE \"durable_step_checkpoints\" AS c SET status = v.status, output = v.output,\n error = v.error, events = v.events, started_at = v.started_at, finished_at = v.finished_at\n FROM (VALUES ${rows.join(', ')}) AS v(run_id, seq, status, output, error, events, started_at,\n finished_at)\n WHERE c.run_id = v.run_id AND c.seq = v.seq AND c.status = 'pending'\n RETURNING c.run_id, c.seq`,\n ...values,\n );\n return new Set(written.map((row) => checkpointKey(row.run_id, Number(row.seq))));\n};\n\n/**\n * MySQL has no `RETURNING`: lock the rows still `pending` (`SELECT … FOR UPDATE`), then update\n * those from a derived table of the values. Prisma's `DateTime` is a `DATETIME(3)` holding UTC.\n */\nconst settleRowsMysql: RawSettle = async (db, settlements) => {\n const pending = new Set<string>();\n for (const [runId, seqs] of seqsByRun(settlements)) {\n const rows = await db.$queryRawUnsafe<{ run_id: string; seq: number }[]>(\n `SELECT run_id, seq FROM durable_step_checkpoints WHERE run_id = ? AND seq IN (${seqs\n .map(() => '?')\n .join(', ')}) AND status = 'pending' FOR UPDATE`,\n runId,\n ...seqs,\n );\n for (const row of rows) pending.add(checkpointKey(row.run_id, Number(row.seq)));\n }\n const won = settlements.filter((s) => pending.has(checkpointKey(s.runId, s.seq)));\n if (won.length === 0) return pending;\n const at = (d: Date) => d.toISOString().replace('T', ' ').replace('Z', '');\n const values: unknown[] = [];\n const rows = won.map((s, i) => {\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n at(s.startedAt),\n at(s.finishedAt),\n );\n return i === 0\n ? 'SELECT ? AS run_id, ? AS seq, ? AS status, ? AS output, ? AS error, ? AS events, ? AS started_at, ? AS finished_at'\n : 'SELECT ?, ?, ?, ?, ?, ?, ?, ?';\n });\n const updated = await db.$executeRawUnsafe(\n `UPDATE durable_step_checkpoints AS c JOIN (${rows.join(' UNION ALL ')}) AS v\n ON c.run_id = v.run_id AND c.seq = v.seq\n SET c.status = v.status, c.output = CAST(v.output AS JSON), c.error = CAST(v.error AS JSON),\n c.events = CAST(v.events AS JSON), c.started_at = v.started_at, c.finished_at = v.finished_at\n WHERE c.status = 'pending'`,\n ...values,\n );\n if (updated !== won.length) {\n throw new Error('a checkpoint of the batch was settled while the batch was written');\n }\n return pending;\n};\n\n/**\n * SQLite's `UPDATE … FROM … RETURNING` (3.35+), as on Postgres. Prisma keeps a `DateTime` as epoch\n * milliseconds and a `Json` as text there.\n */\nconst settleRowsSqlite: RawSettle = async (db, settlements) => {\n const values: unknown[] = [];\n const rows = settlements.map((s) => {\n values.push(\n s.runId,\n s.seq,\n s.status,\n jsonText(s.output),\n jsonText(s.error),\n jsonText(s.events),\n s.startedAt.getTime(),\n s.finishedAt.getTime(),\n );\n return '(?, ?, ?, ?, ?, ?, ?, ?)';\n });\n const written = await db.$queryRawUnsafe<{ run_id: string; seq: number | bigint }[]>(\n `WITH v(run_id, seq, status, output, error, events, started_at, finished_at) AS (VALUES ${rows.join(', ')})\n UPDATE durable_step_checkpoints SET status = v.status, output = v.output, error = v.error,\n events = v.events, started_at = v.started_at, finished_at = v.finished_at\n FROM v\n WHERE durable_step_checkpoints.run_id = v.run_id AND durable_step_checkpoints.seq = v.seq\n AND durable_step_checkpoints.status = 'pending'\n RETURNING run_id, seq`,\n ...values,\n );\n return new Set(written.map((row) => checkpointKey(row.run_id, Number(row.seq))));\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\nfunction toScheduleData(r: ScheduleRecord) {\n return {\n id: r.id,\n namespace: r.namespace,\n workflow: r.workflow,\n paused: r.paused,\n nextFireAt: r.nextFireAt == null ? null : BigInt(r.nextFireAt),\n tags: jsonOrNull(r.tags),\n spec: r.spec,\n state: r.state,\n createdAt: r.createdAt,\n updatedAt: r.updatedAt,\n };\n}\n\nfunction fromScheduleRow(row: ScheduleRow): ScheduleRecord {\n const tags = Array.isArray(row.tags) ? (row.tags as string[]) : undefined;\n return {\n id: row.id,\n namespace: row.namespace,\n workflow: row.workflow,\n paused: row.paused,\n nextFireAt: row.nextFireAt == null ? null : Number(row.nextFireAt),\n ...(tags?.length ? { tags } : {}),\n spec: (row.spec ?? {}) as Record<string, unknown>,\n state: (row.state ?? {}) as Record<string, unknown>,\n createdAt: row.createdAt,\n updatedAt: row.updatedAt,\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 'durable_schedules',\n ];\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACAA,iCAwCO;AA4IP,SAASA,eAAeC,WAAkB;AACxC,MAAIA,cAAcC,OAAW,QAAO,CAAC;AACrC,SAAO;IAAED;EAAU;AACrB;AAHSD;AAeF,IAAMG,mBAAN,MAAMA;EAnMb,OAmMaA;;;;EACX,YAA6BC,IAAyB;SAAzBA,KAAAA;EAA0B;EAEvD,MAAMC,kBACJC,OACAC,KACAC,UACAC,OACAC,aACkB;AAClB,UAAMC,QAAQ;MAAEH;MAAUI,QAAQ;QAAEC,IAAIC;MAA0B;IAAE;AACpE,UAAMC,WAAWC,eAAe,KAAKZ,EAAE;AACvC,UAAMa,YAAYF,eACdG;;MAEE,MAAMC,UAAU,KAAKf,EAAE,EAAEgB,mBAAmBC,SAAS;QACnDV;QACAW,QAAQ;UAAEC,IAAI;UAAMC,MAAM;QAAK;QAC/BC,SAAS;UAAEF,IAAI;QAAM;MACvB,CAAA;MACAhB;IAAAA,IAEF,CAAA;AACJ,WAAO,KAAKH,GAAGsB,aAAa,OAAOC,OAAAA;AAIjC,UAAIZ,UAAU;AACZ,iBAASa,KAAK,GAAGA,KAAKX,UAAUY,QAAQD,MAAME,iDAAsB;AAClE,gBAAMf,SACJY,IACAV,UAAUc,MAAMH,IAAIA,KAAKE,+CAAAA,CAAAA;QAE7B;MACF,OAAO;AACL,cAAMH,GAAGP,mBAAmBY,WAAW;UAAErB;UAAOsB,MAAM;YAAEzB;UAAS;QAAE,CAAA;MACrE;AACA,YAAM0B,OAAO,MAAMP,GAAGP,mBAAmBC,SAAS;QAAEV;MAAM,CAAA;AAC1D,YAAMwB,OAAOD,KAAKE,IAAIC,UAAAA;AACtB,YAAMb,WAAOc,mDAAuBH,MAAM7B,OAAOC,KAAKC,UAAUC,KAAAA;AAChE,UAAI,CAACe,MAAM;AACT,cAAMe,YAAQC,0DAA8BL,MAAM7B,OAAOC,KAAKC,UAAUE,WAAAA;AACxE,YAAI6B,MACF,OAAMZ,GAAGP,mBAAmBqB,OAAO;UAAE9B,OAAO;YAAEY,IAAIjB;UAAM;UAAG2B,MAAMS,WAAWH,KAAAA;QAAO,CAAA;AACrF,eAAO;MACT;AACA,YAAMZ,GAAGP,mBAAmBqB,OAAO;QAAE9B,OAAO;UAAEY,IAAIjB;QAAM;QAAG2B,MAAM;UAAET;QAAK;MAAE,CAAA;AAC1E,aAAO;IACT,CAAA;EACF;EAEA,MAAMmB,UAAUC,KAAiC;AAE/C,UAAM,KAAKxC,GAAGgB,mBAAmByB,WAAW;MAAEZ,MAAM;QAACa,UAAUF,GAAAA;;IAAM,CAAA;AACrE,UAAM,KAAKG,kBAAkBH,IAAIrB,IAAIqB,IAAII,gBAAgB;EAC3D;EAEA,MAAMC,UAAU3C,OAAe4C,YAAiD;AAC9E,UAAMX,QACJW,WAAWtC,UAAUuC,iDAAsBC,SAASF,WAAWtC,MAAM,IACjE,UAAMyC,4DAAgC/C,OAAO4C,YAAY,CAAC3B,OAAO,KAAK+B,OAAO/B,EAAAA,CAAAA,IAC7E2B;AAGN,UAAM,EAAEK,MAAK,IAAK,MAAM,KAAKnD,GAAGgB,mBAAmBY,WAAW;MAC5DrB,OAAO;QAAEY,IAAIjB;MAAM;MACnB2B,MAAMS,WAAWH,KAAAA;IACnB,CAAA;AACA,QAAIgB,UAAU,KAAK,CAAE,MAAM,KAAKnD,GAAGgB,mBAAmBoC,WAAW;MAAE7C,OAAO;QAAEY,IAAIjB;MAAM;IAAE,CAAA,GAAK;AAC3F,YAAM,IAAImD,MAAM,OAAOnD,KAAAA,YAAiB;IAC1C;AAEA,QAAI,sBAAsBiC,MAAO,OAAM,KAAKQ,kBAAkBzC,OAAOiC,MAAMS,gBAAgB;EAC7F;EAEA,MAAMU,YACJpD,OACAqD,kBACAT,YACkB;AAClB,QAAIS,iBAAiB9B,WAAW,EAAG,QAAO;AAC1C,UAAMU,QACJW,WAAWtC,UAAUuC,iDAAsBC,SAASF,WAAWtC,MAAM,IACjE,UAAMyC,4DAAgC/C,OAAO4C,YAAY,CAAC3B,OAAO,KAAK+B,OAAO/B,EAAAA,CAAAA,IAC7E2B;AAGN,UAAMvC,QAAQ;MAAEY,IAAIjB;MAAOM,QAAQ;QAAEC,IAAI8C;MAAiB;IAAE;AAC5D,UAAM1B,OAAOS,WAAWH,KAAAA;AAGxB,UAAMgB,QAAQK,OAAOC,KAAK5B,IAAAA,EAAMJ,UAC3B,MAAM,KAAKzB,GAAGgB,mBAAmBY,WAAW;MAAErB;MAAOsB;IAAK,CAAA,GAAIsB,QAC/D,MAAM,KAAKnD,GAAGgB,mBAAmBmC,MAAM;MAAE5C;IAAM,CAAA;AACnD,QAAI4C,UAAU,EAAG,QAAO;AACxB,QAAI,sBAAsBhB,MAAO,OAAM,KAAKQ,kBAAkBzC,OAAOiC,MAAMS,gBAAgB;AAC3F,WAAO;EACT;;;EAIA,MAAcD,kBACZzC,OACAwD,YACe;AACf,UAAM,KAAK1D,GAAG2D,oBAAoBC,WAAW;MAAErD,OAAO;QAAEL;MAAM;IAAE,CAAA;AAChE,UAAM4B,WAAO+B,mDAAuB3D,OAAOwD,UAAAA;AAC3C,QAAI5B,KAAKL,OAAQ,OAAM,KAAKzB,GAAG2D,oBAAoBlB,WAAW;MAAEZ,MAAMC;IAAK,CAAA;EAC7E;EAEA,MAAMoB,OAAOhD,OAA4C;AACvD,UAAM4D,MAAM,MAAM,KAAK9D,GAAGgB,mBAAmBoC,WAAW;MAAE7C,OAAO;QAAEY,IAAIjB;MAAM;IAAE,CAAA;AAC/E,WAAO4D,MAAM7B,WAAW6B,GAAAA,IAAO;EACjC;EAEA,MAAMC,QAAQC,QAA0C;AACtD,QAAIA,OAAOvC,WAAW,EAAG,QAAO,CAAA;AAChC,UAAMK,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO;QAAEY,IAAI;UAAEV,IAAI;eAAI,IAAIwD,IAAID,MAAAA;;QAAS;MAAE;IAC5C,CAAA;AACA,WAAOlC,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAMiC,UAAUhE,OAA8B;AAE5C,UAAM,KAAKF,GAAGmE,sBAAsBP,WAAW;MAAErD,OAAO;QAAEL;MAAM;IAAE,CAAA;AAClE,UAAM,KAAKF,GAAGoE,oBAAoBR,WAAW;MAAErD,OAAO;QAAEL;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKF,GAAG2D,oBAAoBC,WAAW;MAAErD,OAAO;QAAEL;MAAM;IAAE,CAAA;AAChE,UAAM,KAAKF,GAAGgB,mBAAmB4C,WAAW;MAAErD,OAAO;QAAEY,IAAIjB;MAAM;IAAE,CAAA;EACrE;EAEA,MAAMmE,WAAWL,QAAiC;AAChD,QAAIA,OAAOvC,WAAW,EAAG;AAEzB,UAAM,KAAKzB,GAAGsB,aAAa,OAAOC,OAAAA;AAChC,YAAMA,GAAG4C,sBAAsBP,WAAW;QAAErD,OAAO;UAAEL,OAAO;YAAEO,IAAIuD;UAAO;QAAE;MAAE,CAAA;AAC7E,YAAMzC,GAAG6C,oBAAoBR,WAAW;QAAErD,OAAO;UAAEL,OAAO;YAAEO,IAAIuD;UAAO;QAAE;MAAE,CAAA;AAC3E,YAAMzC,GAAGoC,oBAAoBC,WAAW;QAAErD,OAAO;UAAEL,OAAO;YAAEO,IAAIuD;UAAO;QAAE;MAAE,CAAA;AAC3E,YAAMzC,GAAGP,mBAAmB4C,WAAW;QAAErD,OAAO;UAAEY,IAAI;YAAEV,IAAIuD;UAAO;QAAE;MAAE,CAAA;IACzE,CAAA;EACF;EAEA,MAAMM,kBAAkBC,QAAyBC,OAAenE,OAAgC;AAE9F,UAAMoE,WAAWF,OAAOE,SAASC,OAAO,CAACC,MAAM5B,iDAAsBC,SAAS2B,CAAAA,CAAAA;AAC9E,QAAIF,SAAShD,WAAW,KAAKpB,SAAS,EAAG,QAAO;AAChD,QAAIkE,OAAOK,UAAU,QAAQL,OAAOM,YAAY,KAAM,QAAO;AAE7D,UAAMC,SAAS,KAAKC,SAAS;MAAE,GAAIR,OAAOS,SAAS,CAAC;MAAIP;IAAS,CAAA;AACjE,UAAMQ,MAAM,oBAAIhB,IAAAA;AAChB,QAAIM,OAAOK,UAAU,MAAM;AACzB,YAAMM,SAAS,IAAIC,KAAKX,YAAQY,0CAAcb,OAAOK,MAAM,CAAA;AAC3D,YAAM9C,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;QACrDV,OAAO;UAAE8E,KAAK;YAACP;YAAQ;cAAEQ,WAAW;gBAAEC,IAAIL;cAAO;YAAE;;QAAG;QACtDhE,QAAQ;UAAEC,IAAI;QAAK;QACnBE,SAAS;UAAEiE,WAAW;QAAM;QAC5BE,MAAMnF;MACR,CAAA;AACA,iBAAWoF,KAAK3D,KAAMmD,KAAIS,IAAID,EAAEtE,EAAE;IACpC;AACA,QAAIoD,OAAOM,YAAY,QAAQI,IAAIU,OAAOtF,OAAO;AAE/C,YAAMyB,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;QACrDV,OAAOuE;QACP5D,QAAQ;UAAEC,IAAI;QAAK;QACnBE,SAAS;UAAC;YAAEiE,WAAW;UAAO;UAAG;YAAEnE,IAAI;UAAO;;QAC9CyE,MAAMrB,OAAOM;QACbW,MAAMnF;MACR,CAAA;AACA,iBAAWoF,KAAK3D,MAAM;AACpB,YAAImD,IAAIU,QAAQtF,MAAO;AACvB4E,YAAIS,IAAID,EAAEtE,EAAE;MACd;IACF;AACA,UAAM0E,SAAS;SAAIZ;MAAKtD,MAAM,GAAGtB,KAAAA;AACjC,UAAM,KAAKgE,WAAWwB,MAAAA;AACtB,WAAOA,OAAOpE;EAChB;EAEA,MAAMqE,cAAc5F,OAAe6F,KAA6C;AAC9E,UAAMjC,MAAM,MAAM,KAAK9D,GAAGmE,sBAAsBf,WAAW;MACzD7C,OAAO;QAAEyF,WAAW;UAAE9F;UAAO6F;QAAI;MAAE;IACrC,CAAA;AACA,WAAOjC,MAAMmC,kBAAkBnC,GAAAA,IAAO;EACxC;EAEA,MAAMoC,eAAehG,OAAeiG,MAA2C;AAC7E,UAAMC,SAAS;SAAI,IAAInC,IAAIkC,IAAAA;;AAC3B,UAAMrE,OAAO,CAAA;AACb,aAASN,KAAK,GAAGA,KAAK4E,OAAO3E,QAAQD,MAAM,KAAK;AAC9CM,WAAKuE,KAAI,GACH,MAAM,KAAKrG,GAAGmE,sBAAsBlD,SAAS;QAC/CV,OAAO;UAAEL;UAAO6F,KAAK;YAAEtF,IAAI2F,OAAOzE,MAAMH,IAAIA,KAAK,GAAA;UAAK;QAAE;MAC1D,CAAA,CAAA;IAEJ;AACA,WAAOM,KAAKwE,KAAK,CAACC,GAAGC,MAAMD,EAAER,MAAMS,EAAET,GAAG,EAAE/D,IAAIiE,iBAAAA;EAChD;EAEA,MAAMQ,wBAAwBvG,OAAeiG,MAA2C;AACtF,UAAMC,SAAS;SAAI,IAAInC,IAAIkC,IAAAA;;AAC3B,UAAMrE,OAAO,CAAA;AACb,aAASN,KAAK,GAAGA,KAAK4E,OAAO3E,QAAQD,MAAM,KAAK;AAC9CM,WAAKuE,KAAI,GACH,MAAM,KAAKrG,GAAGmE,sBAAsBlD,SAAS;QAC/CV,OAAO;UAAEL;UAAO6F,KAAK;YAAEtF,IAAI2F,OAAOzE,MAAMH,IAAIA,KAAK,GAAA;UAAK;QAAE;QACxDN,QAAQwF;MACV,CAAA,CAAA;IAEJ;AACA,WAAO5E,KACJwE,KAAK,CAACC,GAAGC,MAAMD,EAAER,MAAMS,EAAET,GAAG,EAC5B/D,IAAI,CAAC8B,QAAQmC,kBAAkB;MAAE,GAAGnC;MAAK6C,OAAO;IAAK,CAAA,CAAA;EAC1D;EAEA,MAAMC,eAAeC,YAA2C;AAC9D,UAAMhF,OAAOiF,iBAAiBD,UAAAA;AAC9B,UAAM,KAAK7G,GAAGmE,sBAAsB4C,OAAO;MACzCxG,OAAO;QAAEyF,WAAW;UAAE9F,OAAO2G,WAAW3G;UAAO6F,KAAKc,WAAWd;QAAI;MAAE;MACrEiB,QAAQnF;MACRQ,QAAQR;IACV,CAAA;EACF;EAEA,MAAMoF,wBAAwBJ,YAA8C;AAG1E,UAAM,EAAE3G,OAAO6F,KAAK,GAAGlE,KAAAA,IAASiF,iBAAiBD,UAAAA;AACjD,UAAM,EAAE1D,MAAK,IAAK,MAAM,KAAKnD,GAAGmE,sBAAsBvC,WAAW;MAC/DrB,OAAO;QAAEL;QAAO6F;QAAKvF,QAAQ;MAAU;MACvCqB;IACF,CAAA;AACA,WAAOsB,QAAQ;EACjB;EAEA,MAAM+D,yBAAyBC,aAAmD;AAChF,QAAIA,YAAY1F,WAAW,EAAG,QAAO,CAAA;AAOrC,WAAO,KAAKzB,GAAGsB,aAAa,OAAOC,OAAAA;AACjC,YAAM6F,UAAU,oBAAInD,IAAAA;AACpB,iBAAW,CAAC/D,OAAOiG,IAAAA,KAASkB,UAAUF,WAAAA,GAAc;AAClD,iBAAS3F,KAAK,GAAGA,KAAK2E,KAAK1E,QAAQD,MAAM,KAAK;AAC5C,gBAAMM,OAAO,MAAMP,GAAG4C,sBAAsBlD,SAAS;YACnDV,OAAO;cAAEL;cAAO6F,KAAK;gBAAEtF,IAAI0F,KAAKxE,MAAMH,IAAIA,KAAK,GAAA;cAAK;cAAGhB,QAAQ;YAAU;YACzEU,QAAQ;cAAEhB,OAAO;cAAM6F,KAAK;YAAK;UACnC,CAAA;AACA,qBAAWjC,OAAOhC,KAAMsF,SAAQ1B,IAAI4B,cAAcxD,IAAI5D,OAAO4D,IAAIiC,GAAG,CAAA;QACtE;MACF;AACA,YAAM,EAAEwB,OAAOC,OAAM,IAAKC,gBAAgBN,aAAaC,OAAAA;AACvD,iBAAW,CAAClH,OAAOiG,IAAAA,KAASkB,UAAUG,MAAAA,GAAS;AAC7C,iBAAShG,KAAK,GAAGA,KAAK2E,KAAK1E,QAAQD,MAAM,KAAK;AAC5C,gBAAMkG,QAAQvB,KAAKxE,MAAMH,IAAIA,KAAK,GAAA;AAClC,gBAAM,EAAE2B,MAAK,IAAK,MAAM5B,GAAG4C,sBAAsBP,WAAW;YAC1DrD,OAAO;cAAEL;cAAO6F,KAAK;gBAAEtF,IAAIiH;cAAM;cAAGlH,QAAQ;YAAU;UACxD,CAAA;AACA,cAAI2C,UAAUuE,MAAMjG,QAAQ;AAC1B,kBAAM,IAAI4B,MAAM,mEAAA;UAClB;QACF;MACF;AACA,eAAS7B,KAAK,GAAGA,KAAKgG,OAAO/F,QAAQD,MAAM,KAAK;AAC9C,cAAMD,GAAG4C,sBAAsB1B,WAAW;UACxCZ,MAAM2F,OAAO7F,MAAMH,IAAIA,KAAK,GAAA,EAAKQ,IAAI8E,gBAAAA;QACvC,CAAA;MACF;AACA,aAAOS;IACT,CAAA;EACF;EAEA,MAAMI,2BAA2BC,aAAmD;AAClF,UAAML,QAAQK,YAAY5F,IAAI,MAAM,KAAA;AACpC,QAAI4F,YAAYnG,WAAW,EAAG,QAAO8F;AAErC,UAAMM,OAAO,oBAAI5D,IAAAA;AACjB,UAAM6D,SAAmB,CAAA;AACzBF,gBAAYG,QAAQ,CAACpD,GAAGqD,MAAAA;AACtB,YAAMC,MAAMX,cAAc3C,EAAEzE,OAAOyE,EAAEoB,GAAG;AACxC,UAAI8B,KAAKK,IAAID,GAAAA,EAAM;AACnBJ,WAAKnC,IAAIuC,GAAAA;AACTH,aAAOzB,KAAK2B,CAAAA;IACd,CAAA;AACA,UAAMG,UAAUC,iBAAiB,KAAKpI,EAAE;AACxC,QAAI,CAACmI,SAAS;AAEZ,YAAME,SAAS,8BAAOrI,OAAAA;AACpB,mBAAWgI,KAAKF,QAAQ;AACtB,gBAAMnD,IAAIiD,YAAYI,CAAAA;AACtB,gBAAM,EAAE7E,MAAK,IAAK,MAAMnD,GAAGmE,sBAAsBvC,WAAW;YAC1DrB,OAAO;cAAEL,OAAOyE,EAAEzE;cAAO6F,KAAKpB,EAAEoB;cAAKvF,QAAQ;YAAU;YACvDqB,MAAM;cACJrB,QAAQmE,EAAEnE;cACV8H,QAAQC,WAAW5D,EAAE2D,MAAM;cAC3BE,OAAOD,WAAW5D,EAAE6D,KAAK;cACzBC,QAAQF,WAAW5D,EAAE8D,MAAM;cAC3BC,WAAW/D,EAAE+D;cACbC,YAAYhE,EAAEgE;YAChB;UACF,CAAA;AACApB,gBAAMS,CAAAA,IAAK7E,QAAQ;QACrB;MACF,GAhBe;AAiBf,UAAI2E,OAAOrG,WAAW,EAAG,OAAM4G,OAAO,KAAKrI,EAAE;UACxC,OAAM,KAAKA,GAAGsB,aAAa,CAACC,OAAO8G,OAAO9G,EAAAA,CAAAA;AAC/C,aAAOgG;IACT;AAGA,UAAM,KAAKvH,GAAGsB,aAAa,OAAOC,OAAAA;AAChC,YAAMqH,MAAMrH;AACZ,eAASC,KAAK,GAAGA,KAAKsG,OAAOrG,QAAQD,MAAM,KAAK;AAC9C,cAAMkG,QAAQI,OAAOnG,MAAMH,IAAIA,KAAK,GAAA;AACpC,cAAMqH,MAAM,MAAMV,QAChBS,KACAlB,MAAM1F,IAAI,CAACgG,MAAMJ,YAAYI,CAAAA,CAAE,CAAA;AAEjC,mBAAWA,KAAKN,OAAO;AACrB,gBAAM/C,IAAIiD,YAAYI,CAAAA;AACtBT,gBAAMS,CAAAA,IAAKa,IAAIX,IAAIZ,cAAc3C,EAAEzE,OAAOyE,EAAEoB,GAAG,CAAA;QACjD;MACF;IACF,CAAA;AACA,WAAOwB;EACT;EAEA,MAAMuB,gBAAgB3B,aAA8C;AAClE,QAAIA,YAAY1F,WAAW,EAAG;AAC9B,UAAM,KAAKzB,GAAGsB,aAAa,CAACC,OAAOwH,mBAAmBxH,IAAI4F,WAAAA,CAAAA;EAC5D;EAEA,MAAM6B,YACJC,MAIY;AACZ,WAAO,KAAKjJ,GAAGsB,aAAa,OAAOC,OACjC0H,KAAK;MACHL,KAAKrH;MACLqF,gBAAgB,8BAAOsC,OAAAA;AACrB,cAAMrH,OAAOiF,iBAAiBoC,EAAAA;AAC9B,cAAM3H,GAAG4C,sBAAsB4C,OAAO;UACpCxG,OAAO;YAAEyF,WAAW;cAAE9F,OAAOgJ,GAAGhJ;cAAO6F,KAAKmD,GAAGnD;YAAI;UAAE;UACrDiB,QAAQnF;UACRQ,QAAQR;QACV,CAAA;MACF,GAPgB;IAQlB,CAAA,CAAA;EAEJ;EAEA,MAAMsH,mBAAmBtJ,WAA4C;AACnE,UAAMiC,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO;QAAEC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QAAG,GAAGb,eAAeC,SAAAA;MAAW;IACnF,CAAA;AACA,WAAOiC,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAMmH,iBACJ5E,OACAnE,OACAR,WACAwJ,SACwB;AACxB,QAAIhJ,SAAS,EAAG,QAAO,CAAA;AACvB,UAAMyB,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO;QACLC,QAAQ;UAAEC,IAAI;YAAC;YAAW;;QAAc;QACxC6I,IAAI;UACF;YAAEC,aAAa;UAAK;UACpB;YAAEA,aAAa;cAAEC,KAAK,IAAIrE,KAAKX,KAAAA;YAAO;UAAE;;aAEpC6E,UACA;YAAC;cAAEI,UAAUJ,QAAQK;cAAOH,aAAa;gBAAEhE,IAAI,IAAIJ,KAAKkE,QAAQM,YAAY;cAAE;YAAE;cAChF,CAAA;;QAEN,GAAG/J,eAAeC,SAAAA;MACpB;MACAwB,SAAS;QAAEuI,WAAW;MAAM;MAC5BpE,MAAMnF;IACR,CAAA;AACA,WAAOyB,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAM4H,gBAAgBxJ,OAAeR,WAA4C;AAC/E,UAAMiC,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO;QAAEC,QAAQ;QAAW,GAAGZ,eAAeC,SAAAA;MAAW;MACzDwB,SAAS;QAAEuI,WAAW;MAAM;MAC5BpE,MAAMnF;IACR,CAAA;AACA,WAAOyB,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAM6H,cAActF,OAAe3E,WAAoBQ,OAAwC;AAC7F,UAAMyB,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO;QACLC,QAAQ;QACRuJ,QAAQ;UAAEC,KAAK;UAAMR,KAAKS,OAAOzF,KAAAA;QAAO;QACxC,GAAG5E,eAAeC,SAAAA;MACpB;MACAwB,SAAS;QAAE0I,QAAQ;MAAM;MACzB,GAAI1J,UAAUP,SAAY;QAAE0F,MAAMnF;MAAM,IAAI,CAAC;IAC/C,CAAA;AACA,WAAOyB,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAMiI,WACJhK,OACAwJ,OACAS,cACA3F,OACkB;AAClB,UAAM4F,SAAS,MAAM,KAAKpK,GAAGgB,mBAAmBY,WAAW;MACzDrB,OAAO;QACLY,IAAIjB;QACJoJ,IAAI;UAAC;YAAEC,aAAa;UAAK;UAAG;YAAEA,aAAa;cAAEC,KAAK,IAAIrE,KAAKX,KAAAA;YAAO;UAAE;;MACtE;MACA3C,MAAM;QAAE4H,UAAUC;QAAOH,aAAa,IAAIpE,KAAKgF,YAAAA;MAAc;IAC/D,CAAA;AACA,WAAOC,OAAOjH,UAAU;EAC1B;EAEA,MAAMkH,eAAenK,OAAewJ,OAA+B;AAQjE,UAAM,KAAK1J,GAAGgB,mBAAmBY,WAAW;MAC1CrB,OAAOmJ,UAAU5J,SAAY;QAAEqB,IAAIjB;MAAM,IAAI;QAAEiB,IAAIjB;QAAOuJ,UAAUC;MAAM;MAC1E7H,MAAM;QAAE4H,UAAU;QAAMF,aAAa;MAAK;IAC5C,CAAA;EACF;EAEA,MAAMe,aAAapK,OAAewJ,OAAeS,cAAwC;AACvF,UAAMC,SAAS,MAAM,KAAKpK,GAAGgB,mBAAmBY,WAAW;MACzDrB,OAAO;QAAEY,IAAIjB;QAAOuJ,UAAUC;MAAM;MACpC7H,MAAM;QAAE0H,aAAa,IAAIpE,KAAKgF,YAAAA;MAAc;IAC9C,CAAA;AACA,WAAOC,OAAOjH,UAAU;EAC1B;;EAGQ4B,SAASwF,OAA0C;AAMzD,UAAMhK,QAAiC;MAAE,GAAGX,eAAe2K,MAAM1K,SAAS;IAAE;AAI5E,UAAM2K,MAAiC,CAAA;AACvC,QAAID,MAAMnK,SAAUG,OAAMH,WAAWmK,MAAMnK;AAC3C,QAAImK,MAAME,UAAWD,KAAInE,KAAKqE,MAAMH,MAAME,UAAUzI,IAAI,CAAC2I,OAAO;MAAEvK,UAAUuK;IAAE,EAAA,CAAA,CAAA;AAC9E,QAAIJ,MAAMK,WAAYJ,KAAInE,KAAKqE,MAAMH,MAAMK,WAAW5I,IAAI,CAAC6I,OAAO;MAAEhL,WAAWgL;IAAE,EAAA,CAAA,CAAA;AAQjF,QAAIN,MAAMO,WAAWhL,OAAWS,OAAMuK,SAASP,MAAMO;AAGrD,QAAIP,MAAMQ,QAASP,KAAInE,KAAKqE,MAAMH,MAAMQ,QAAQ/I,IAAI,CAACgJ,OAAO;MAAEF,QAAQE;IAAE,EAAA,CAAA,CAAA;AAGxE,QAAIT,MAAM/J,UAAU+J,MAAM9F,UAAU;AAClC+F,UAAInE,KAAK;QAAE7F,QAAQ+J,MAAM/J;MAAO,GAAG;QAAEA,QAAQ;UAAEC,IAAI8J,MAAM9F;QAAS;MAAE,CAAA;IACtE,WAAW8F,MAAM/J,QAAQ;AACvBD,YAAMC,SAAS+J,MAAM/J;IACvB,WAAW+J,MAAM9F,UAAU;AACzBlE,YAAMC,SAAS;QAAEC,IAAI8J,MAAM9F;MAAS;IACtC;AACA,QAAI8F,MAAMpK,IAAKI,OAAMa,OAAO;MAAE6J,gBAAgBV,MAAMpK;IAAI;AACxD,QAAIoK,MAAMnJ,KAAMoJ,KAAInE,KAAKqE,MAAMH,MAAMnJ,KAAKY,IAAI,CAACkJ,OAAO;MAAE9J,MAAM;QAAE6J,gBAAgBC;MAAE;IAAE,EAAA,CAAA,CAAA;AAIpF,QAAIX,MAAM7G,YAAYjC,OAAQ+I,KAAInE,KAAI,GAAIkE,MAAM7G,WAAW1B,IAAI,CAACmJ,MAAMC,cAAcD,CAAAA,CAAAA,CAAAA;AACpF,QAAIX,IAAI/I,OAAQlB,OAAM8E,MAAMmF;AAC5B,WAAOjK;EACT;EAEA,MAAM8K,SAASd,OAAyC;AACtD,UAAMlJ,UAAU;MAAEuI,WAAW;IAAgB;AAC7C,UAAM9H,OAAO,MAAM,KAAK9B,GAAGgB,mBAAmBC,SAAS;MACrDV,OAAO,KAAKwE,SAASwF,KAAAA;MACrB/E,MAAM+E,MAAMlK;MACZuF,MAAM2E,MAAMe;MACZjK;IACF,CAAA;AACA,WAAOS,KAAKE,IAAIC,UAAAA;EAClB;EAEA,MAAMsJ,UAAUhB,OAA4D;AAC1E,WAAO,KAAKvK,GAAGgB,mBAAmBmC,MAAM;MAAE5C,OAAO,KAAKwE,SAASwF,KAAAA;IAAO,CAAA;EACxE;;;;EAKA,MAAMiB,UAAUjB,OAA8C;AAC5D,UAAMzI,OAAQ,MAAM,KAAK9B,GAAGgB,mBAAmByK,QAAQ;MACrDC,IAAI;QAAC;QAAU;;MACfnL,OAAO,KAAKwE,SAASwF,KAAAA;MACrBoB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOC,8CACL/J,KAAKE,IAAI,CAACyD,OAAO;MAAEjF,QAAQiF,EAAEjF;MAAQsK,QAAQrF,EAAEqF;MAAQ3H,OAAOsC,EAAEkG,OAAOC;IAAK,EAAA,CAAA;EAEhF;;;;;EAMA,MAAME,eACJC,MACAxB,OACAyB,MAC6B;AAC7B,QAAI,KAACC,4CAAgBF,IAAAA,GAAO;AAC1B,YAAMhK,OAAO,MAAM,KAAKsJ,SAAS;QAAE,GAAGd;QAAOlK,OAAO2L,MAAME,QAAQC;MAAqB,CAAA;AACvF,iBAAOC,mDAAuBrK,MAAMgK,MAAMC,IAAAA;IAC5C;AACA,UAAMlK,OAAQ,MAAM,KAAK9B,GAAGgB,mBAAmByK,QAAQ;MACrDC,IAAI;QAACK,KAAKM;;MACV9L,OAAO,KAAKwE,SAASwF,KAAAA;MACrBoB,QAAQ;QAAEC,MAAM;MAAK;IACvB,CAAA;AACA,eAAOU,mDACLxK,KAAKE,IAAI,CAACyD,OAAO;MAAE8G,OAAO9G,EAAEsG,KAAKM,KAAK,KAAK;MAAMlJ,OAAOsC,EAAEkG,OAAOC;IAAK,EAAA,GACtEI,IAAAA;EAEJ;;EAIQQ,YAAmC;AACzC,UAAMC,WAAW,KAAKzM,GAAG0M;AACzB,QAAI,CAACD,UAAU;AACb,YAAM,IAAIpJ,MACR,2IAAA;IAEJ;AACA,WAAOoJ;EACT;EAEA,MAAME,aAAaC,QAAuC;AACxD,UAAM/K,OAAOgL,eAAeD,MAAAA;AAC5B,UAAM,KAAKJ,UAAS,EAAGzF,OAAO;MAAExG,OAAO;QAAEY,IAAIyL,OAAOzL;MAAG;MAAG6F,QAAQnF;MAAMQ,QAAQR;IAAK,CAAA;EACvF;EAEA,MAAMiL,YAAY3L,IAA4C;AAC5D,UAAM2C,MAAM,MAAM,KAAK0I,UAAS,EAAGpJ,WAAW;MAAE7C,OAAO;QAAEY;MAAG;IAAE,CAAA;AAC9D,WAAO2C,MAAMiJ,gBAAgBjJ,GAAAA,IAAO;EACtC;;EAGA,MAAMkJ,eACJ7L,IACAgB,OACA8K,oBACkB;AAClB,UAAMpL,OAAgC,CAAC;AACvC,QAAIM,MAAMtC,cAAcC,OAAW+B,MAAKhC,YAAYsC,MAAMtC;AAC1D,QAAIsC,MAAM/B,aAAaN,OAAW+B,MAAKzB,WAAW+B,MAAM/B;AACxD,QAAI+B,MAAM+K,WAAWpN,OAAW+B,MAAKqL,SAAS/K,MAAM+K;AACpD,QAAI,gBAAgB/K,MAClBN,MAAKsL,aAAahL,MAAMgL,cAAc,OAAO,OAAOlD,OAAO9H,MAAMgL,UAAU;AAC7E,QAAI,UAAUhL,MAAON,MAAKT,OAAOmH,WAAWpG,MAAMf,IAAI;AACtD,QAAIe,MAAMiL,SAAStN,OAAW+B,MAAKuL,OAAOjL,MAAMiL;AAChD,QAAIjL,MAAMkL,UAAUvN,OAAW+B,MAAKwL,QAAQlL,MAAMkL;AAClD,QAAIlL,MAAMmD,cAAcxF,OAAW+B,MAAKyD,YAAYnD,MAAMmD;AAC1D,QAAI,CAAC9B,OAAOC,KAAK5B,IAAAA,EAAMJ,OAAQ,QAAQ,MAAM,KAAKqL,YAAY3L,EAAAA,MAAS;AACvE,UAAMZ,QAAiC;MAAEY;IAAG;AAC5C,QAAI8L,uBAAuBnN,OACzBS,OAAM4M,aAAaF,uBAAuB,OAAO,OAAOhD,OAAOgD,kBAAAA;AACjE,UAAM,EAAE9J,MAAK,IAAK,MAAM,KAAKqJ,UAAS,EAAG5K,WAAW;MAAErB;MAAOsB;IAAK,CAAA;AAClE,WAAOsB,QAAQ;EACjB;EAEA,MAAMmK,eAAenM,IAA8B;AACjD,UAAM,EAAEgC,MAAK,IAAK,MAAM,KAAKqJ,UAAS,EAAG5I,WAAW;MAAErD,OAAO;QAAEY;MAAG;IAAE,CAAA;AACpE,WAAOgC,QAAQ;EACjB;EAEA,MAAMoK,cAAchD,OAAiD;AACnE,UAAMhK,QAAiC,CAAC;AACxC,QAAIgK,MAAM1K,cAAcC,OAAWS,OAAMV,YAAY0K,MAAM1K;AAC3D,QAAI0K,MAAMnK,aAAaN,OAAWS,OAAMH,WAAWmK,MAAMnK;AACzD,QAAImK,MAAM2C,WAAWpN,OAAWS,OAAM2M,SAAS3C,MAAM2C;AACrD,QAAI3C,MAAMpK,QAAQL,OAAWS,OAAMa,OAAO;MAAE6J,gBAAgBV,MAAMpK;IAAI;AACtE,QAAIoK,MAAMiD,UAAU1N,QAAW;AAC7BS,YAAM8E,MAAM;QAAC;UAAE6H,QAAQ;QAAM;QAAG;UAAEC,YAAY;YAAE3D,KAAKS,OAAOM,MAAMiD,KAAK;UAAE;QAAE;;IAC7E;AACA,UAAM1L,OAAO,MAAM,KAAK0K,UAAS,EAAGvL,SAAS;MAC3CV;;MAEAc,SAAS;QAAC;UAAE8L,YAAY;YAAE7G,MAAM;YAAOmH,OAAO;UAAO;QAAE;QAAG;UAAEtM,IAAI;QAAM;;MACtEqE,MAAM+E,MAAMlK;MACZuF,MAAM2E,MAAMe;IACd,CAAA;AACA,WAAOxJ,KAAKE,IAAI+K,eAAAA;EAClB;EAEA,MAAMW,gBAAgBxN,OAA0C;AAC9D,UAAM4B,OAAO,MAAM,KAAK9B,GAAGmE,sBAAsBlD,SAAS;MACxDV,OAAO;QAAEL;MAAM;MACfmB,SAAS;QAAE0E,KAAK;MAAM;IACxB,CAAA;AACA,WAAOjE,KAAKE,IAAIiE,iBAAAA;EAClB;EAEA,MAAM0H,yBAAyBzN,OAA0C;AACvE,UAAM4B,OAAO,MAAM,KAAK9B,GAAGmE,sBAAsBlD,SAAS;MACxDV,OAAO;QAAEL;MAAM;MACfmB,SAAS;QAAE0E,KAAK;MAAM;MACtB7E,QAAQwF;IACV,CAAA;AAEA,UAAMkH,OAAO9L,KAAK4C,OAAO,CAACZ,QAAQA,IAAItD,WAAW,WAAA,EAAawB,IAAI,CAAC8B,QAAQA,IAAIiC,GAAG;AAClF,UAAM8H,SAAS,oBAAIC,IAAAA;AACnB,aAAStM,KAAK,GAAGA,KAAKoM,KAAKnM,QAAQD,MAAM,KAAK;AAC5C,YAAMuM,QAAQ,MAAM,KAAK/N,GAAGmE,sBAAsBlD,SAAS;QACzDV,OAAO;UAAEL;UAAO6F,KAAK;YAAEtF,IAAImN,KAAKjM,MAAMH,IAAIA,KAAK,GAAA;UAAK;QAAE;QACtDN,QAAQ;UAAE6E,KAAK;UAAMY,OAAO;QAAK;MACnC,CAAA;AACA,iBAAW7C,OAAOiK,MAAOF,QAAOG,IAAIlK,IAAIiC,KAAKjC,IAAI6C,KAAK;IACxD;AACA,WAAO7E,KAAKE,IAAI,CAAC8B,QAAQmC,kBAAkB;MAAE,GAAGnC;MAAK6C,OAAOkH,OAAOI,IAAInK,IAAIiC,GAAG,KAAK;IAAK,CAAA,CAAA;EAC1F;EAEA,MAAMmI,0BACJhO,OACAiO,MACqC;AACrC,UAAMrK,MAAM,MAAM,KAAK9D,GAAGmE,sBAAsBiK,UAAU;MACxD7N,OAAO;QAAEL;QAAOiO;MAAK;MACrB9M,SAAS;QAAE0E,KAAK;MAAO;IACzB,CAAA;AACA,WAAOjC,MAAMmC,kBAAkBnC,GAAAA,IAAOhE;EACxC;EAEA,MAAMuO,eACJnO,OACAoO,SACAC,OACA9J,UACkB;AAClB,QAAIA,SAAShD,WAAW,EAAG,QAAO;AAClC,UAAMqC,MAAM,MAAM,KAAK9D,GAAGmE,sBAAsBiK,UAAU;MACxD7N,OAAO;QAAEL;QAAO6F,KAAK;UAAEyI,KAAKF;UAAS9E,KAAK+E;QAAM;QAAG/N,QAAQ;UAAEC,IAAIgE;QAAS;MAAE;MAC5EvD,QAAQ;QAAE6E,KAAK;MAAK;MACpB1E,SAAS;QAAE0E,KAAK;MAAO;IACzB,CAAA;AACA,WAAOjC,QAAQ;EACjB;EAEA,MAAM2K,iBACJvO,OACAoO,SACAC,OACA9J,UACiB;AACjB,QAAIA,SAAShD,WAAW,EAAG,QAAO;AAClC,WAAO,KAAKzB,GAAGmE,sBAAsBhB,MAAM;MACzC5C,OAAO;QAAEL;QAAO6F,KAAK;UAAEyI,KAAKF;UAAS9E,KAAK+E;QAAM;QAAG/N,QAAQ;UAAEC,IAAIgE;QAAS;MAAE;IAC9E,CAAA;EACF;EAEA,MAAMiK,4BAA4BxO,OAAeyO,UAA+C;AAC9F,QAAIA,SAASlN,WAAW,EAAG,QAAO,CAAA;AAClC,UAAMK,OAAO,MAAM,KAAK9B,GAAGmE,sBAAsBlD,SAAS;MACxDV,OAAO;QAAEL;QAAOoJ,IAAIqF,SAAS3M,IAAI,CAAC4M,OAAO;UAAET,MAAM;YAAEU,YAAYD;UAAE;QAAE,EAAA;MAAI;MACvEvN,SAAS;QAAE0E,KAAK;MAAM;IACxB,CAAA;AAGA,WAAOjE,KAAK4C,OAAO,CAACe,MAAMkJ,SAASG,KAAK,CAACF,MAAMnJ,EAAE0I,KAAKU,WAAWD,CAAAA,CAAAA,CAAAA,EAAK5M,IAAIiE,iBAAAA;EAC5E;;;;;;;;;;;;EAaA,MAAM8I,gBACJ7O,OACA8L,MAC2B;AAC3B,UAAMhH,QAAQgH,MAAMgD,UAAUlP,SAAY;MAAEI;IAAM,IAAI;MAAEA;MAAO+O,eAAejD,KAAKgD;IAAM;AACzF,UAAME,UAAU,MAAMC,QAAQC,IAC5BC,WAAWrN,IAAI,OAAO,EAAEsN,MAAM/O,MAAK,OAAQ;MACzC+O;MACA/O;MACAuB,MAAO,MAAM,KAAK9B,GAAGmE,sBAAsBsH,QAAQ;QACjDC,IAAI;UAAC;UAAiB;;QACtBnL,OAAO;UAAE,GAAGyE;UAAO,GAAGzE;QAAM;QAC5BoL,QAAQ;UAAEC,MAAM;UAAM2D,YAAY;QAAK;QACvCC,MAAM;UAAEzJ,KAAK;UAAMoI,MAAM;UAAMoB,YAAY;UAAM7G,WAAW;QAAK;QACjE+G,MAAM;UAAE1J,KAAK;UAAMoI,MAAM;UAAMzF,WAAW;UAAMC,YAAY;QAAK;QACjE+G,MAAM;UAAEC,UAAU;QAAK;MACzB,CAAA;IACF,EAAA,CAAA;AAEF,UAAMC,QAAQ,MAAMT,QAAQC,IAC1BF,QAAQlN,IAAI,OAAO,EAAEsN,MAAM/O,OAAOuB,KAAI,MAAE;AACtC,YAAM+N,aAAa/N,KAAKgN,KAAK,CAACrJ,MAAMA,EAAEkG,OAAO4D,aAAa9J,EAAEkG,OAAOC,IAAI,IACnE,MAAM,KAAKkE,oBAAoB;QAAE,GAAG9K;QAAO,GAAGzE;MAAM,CAAA,IACpD,oBAAIuN,IAAAA;AACR,aAAOhM,KAAKE,IAAI,CAACyD,MAAMsK,iBAAiBT,MAAM7J,GAAGoK,UAAAA,CAAAA;IACnD,CAAA,CAAA;AAEF,WAAOD,MAAMI,KAAI;EACnB;;EAGA,MAAcF,oBAAoBvP,OAA4D;AAC5F,UAAMuB,OAAQ,MAAM,KAAK9B,GAAGmE,sBAAsBsH,QAAQ;MACxDC,IAAI;QAAC;QAAiB;;MACtBnL,OAAO;QAAE,GAAGA;QAAOgP,YAAY;MAAK;MACpCC,MAAM;QAAE9G,WAAW;MAAK;IAC1B,CAAA;AACA,WAAO,IAAIoF,IAAIhM,KAAKE,IAAI,CAACyD,MAAM;MAACwK,UAAUxK,EAAEwJ,eAAexJ,EAAEjF,MAAM;MAAGiF,EAAE+J,KAAK9G;KAAU,CAAA;EACzF;;;EAIA,MAAMwH,iBAAiBhQ,OAAeqK,OAAmD;AACvF,QAAIA,MAAM9F,UAAUhD,WAAW,KAAK8I,MAAM4F,cAAc1O,WAAW,EAAG,QAAO,CAAA;AAC7E,UAAM+I,MAAiC,CAAA;AACvC,QAAID,MAAM6F,eAAe3O,QAAQ;AAC/B+I,UAAInE,KAAK;QACPiD,IAAI;UAAC;YAAE2F,eAAe;UAAK;UAAG;YAAEA,eAAe;cAAEoB,OAAO9F,MAAM6F;YAAc;UAAE;;MAChF,CAAA;IACF;AACA,QAAI7F,MAAM4F,cAAc;AACtB3F,UAAInE,KAAK;QAAEiD,IAAIiB,MAAM4F,aAAanO,IAAI,CAAC4M,OAAO;UAAET,MAAM;YAAEU,YAAYD;UAAE;QAAE,EAAA;MAAI,CAAA;IAC9E;AACA,UAAM9M,OAAO,MAAM,KAAK9B,GAAGmE,sBAAsBlD,SAAS;MACxDV,OAAO;QACLL;QACA,GAAIqK,MAAMyE,UAAUlP,SAAY,CAAC,IAAI;UAAEmP,eAAe1E,MAAMyE;QAAM;QAClE,GAAIzE,MAAM9F,WAAW;UAAEjE,QAAQ;YAAEC,IAAI8J,MAAM9F;UAAS;QAAE,IAAI,CAAC;QAC3D,GAAI+F,IAAI/I,SAAS;UAAE4D,KAAKmF;QAAI,IAAI,CAAC;MACnC;MACAnJ,SAAS;QAAE0E,KAAK;MAAM;MACtBH,MAAM2E,MAAMe;MACZ9F,MAAM+E,MAAMlK;IACd,CAAA;AACA,WAAOyB,KAAKE,IAAIiE,iBAAAA;EAClB;EAEA,MAAMqK,gBAAgBC,QAAqC;AACzD,UAAM,KAAKvQ,GAAGoE,oBAAoB2C,OAAO;MACvCxG,OAAO;QAAEiQ,OAAOD,OAAOC;MAAM;MAC7BxJ,QAAQ;QACNwJ,OAAOD,OAAOC;QACdtQ,OAAOqQ,OAAOrQ;QACd6F,KAAKwK,OAAOxK;QACZkJ,eAAesB,OAAOtB,iBAAiB;MACzC;MACA5M,QAAQ;QACNnC,OAAOqQ,OAAOrQ;QACd6F,KAAKwK,OAAOxK;QACZkJ,eAAesB,OAAOtB,iBAAiB;MACzC;IACF,CAAA;EACF;EAEA,MAAMwB,iBAAiBD,OAA6C;AAClE,UAAM1M,MAAM,MAAM,KAAK9D,GAAGoE,oBAAoBhB,WAAW;MAAE7C,OAAO;QAAEiQ;MAAM;IAAE,CAAA;AAC5E,QAAI,CAAC1M,IAAK,QAAO;AACjB,UAAM,KAAK9D,GAAGoE,oBAAoBsM,OAAO;MAAEnQ,OAAO;QAAEiQ;MAAM;IAAE,CAAA;AAC5D,WAAO;MACLA,OAAO1M,IAAI0M;MACXtQ,OAAO4D,IAAI5D;MACX6F,KAAKjC,IAAIiC;MACTkJ,eAAenL,IAAImL,iBAAiBnP;IACtC;EACF;EAEA,MAAM6Q,kBAAkBC,QAAyC;AAC/D,UAAM9O,OAAO,MAAM,KAAK9B,GAAGoE,oBAAoBnD,SAAS;MACtDV,OAAO;QAAEiQ,OAAO;UAAE3B,YAAY+B;QAAO;MAAE;IACzC,CAAA;AAGA,WAAO9O,KACJ4C,OAAO,CAACe,MAAMA,EAAE+K,MAAM3B,WAAW+B,MAAAA,CAAAA,EACjC5O,IAAI,CAACyD,OAAO;MACX+K,OAAO/K,EAAE+K;MACTtQ,OAAOuF,EAAEvF;MACT6F,KAAKN,EAAEM;MACPkJ,eAAexJ,EAAEwJ,iBAAiBnP;IACpC,EAAA;EACJ;EAEA,MAAM+Q,mBAAmBC,SAAqC;AAC5D,QAAIA,QAAQrP,WAAW,EAAG;AAG1B,UAAM,KAAKzB,GAAGsB,aAAa,OAAOC,OAAAA;AAChC,eAASC,KAAK,GAAGA,KAAKsP,QAAQrP,QAAQD,MAAM,KAAK;AAC/C,cAAMkG,QAAQoJ,QAAQnP,MAAMH,IAAIA,KAAK,GAAA;AACrC,cAAMD,GAAG6C,oBAAoBR,WAAW;UACtCrD,OAAO;YAAEiQ,OAAO;cAAE/P,IAAIiH,MAAM1F,IAAI,CAAC,EAAEuO,OAAM,MAAOA,OAAOC,KAAK;YAAE;UAAE;QAClE,CAAA;AACA,cAAMjP,GAAG6C,oBAAoB3B,WAAW;UACtCZ,MAAM6F,MAAM1F,IAAI,CAAC,EAAEuO,OAAM,OAAQ;YAC/BC,OAAOD,OAAOC;YACdtQ,OAAOqQ,OAAOrQ;YACd6F,KAAKwK,OAAOxK;YACZkJ,eAAesB,OAAOtB,iBAAiB;UACzC,EAAA;QACF,CAAA;MACF;AACA,YAAMlG,mBACJxH,IACAuP,QAAQ9O,IAAI,CAAC,EAAE6E,WAAU,MAAOA,UAAAA,CAAAA;IAEpC,CAAA;EACF;EAEA,MAAMkK,mBACJ7Q,OACAoO,SACAC,OACAyC,MACe;AACf,UAAM,KAAKhR,GAAGsB,aAAa,OAAOC,OAAAA;AAChC,YAAMA,GAAG4C,sBAAsBP,WAAW;QACxCrD,OAAO;UAAEL;UAAO6F,KAAK;YAAEyI,KAAKF;YAAS9E,KAAK+E;UAAM;QAAE;MACpD,CAAA;AACA,YAAM1M,OAAOiF,iBAAiBkK,IAAAA;AAC9B,YAAMzP,GAAG4C,sBAAsB4C,OAAO;QACpCxG,OAAO;UAAEyF,WAAW;YAAE9F,OAAO8Q,KAAK9Q;YAAO6F,KAAKiL,KAAKjL;UAAI;QAAE;QACzDiB,QAAQnF;QACRQ,QAAQR;MACV,CAAA;IACF,CAAA;EACF;EAEA,MAAMoP,uBAAuBjN,QAA2C;AACtE,QAAIA,OAAOvC,WAAW,EAAG,QAAO,CAAA;AAChC,UAAMK,OAAO,MAAM,KAAK9B,GAAGoE,oBAAoBnD,SAAS;MAAEV,OAAO;QAAEL,OAAO;UAAEO,IAAIuD;QAAO;MAAE;IAAE,CAAA;AAC3F,WAAOlC,KAAKE,IAAI,CAACyD,OAAO;MACtB+K,OAAO/K,EAAE+K;MACTtQ,OAAOuF,EAAEvF;MACT6F,KAAKN,EAAEM;MACPkJ,eAAexJ,EAAEwJ,iBAAiBnP;IACpC,EAAA;EACF;EAEA,MAAMoR,gBAAgBhR,OAAeiR,aAAuC;AAI1E,UAAM5Q,QAAQ;MAAEL;MAAOsQ,OAAO;QAAE3B,YAAYsC;MAAY;IAAE;AAC1D,UAAMC,QAAQ,MAAM,KAAKpR,GAAGoE,oBAAoBgK,UAAU;MAAE7N;MAAOW,QAAQ;QAAEsP,OAAO;MAAK;IAAE,CAAA;AAC3F,QAAI,CAACY,MAAO,QAAO;AACnB,QAAIA,MAAMZ,MAAM3B,WAAWsC,WAAAA,EAAc,QAAO;AAChD,UAAMrP,OAAO,MAAM,KAAK9B,GAAGoE,oBAAoBnD,SAAS;MAAEV;MAAOW,QAAQ;QAAEsP,OAAO;MAAK;IAAE,CAAA;AACzF,WAAO1O,KAAKgN,KAAK,CAACrJ,MAAMA,EAAE+K,MAAM3B,WAAWsC,WAAAA,CAAAA;EAC7C;EAEA,MAAME,mBAAmBd,QAAqC;AAI5D,UAAM,KAAKvQ,GAAGoE,oBAAoBR,WAAW;MAC3CrD,OAAO;QAAEiQ,OAAOD,OAAOC;QAAOtQ,OAAOqQ,OAAOrQ;QAAO6F,KAAKwK,OAAOxK;MAAI;IACrE,CAAA;EACF;EAEA,MAAMuL,aAAad,OAAee,SAAiC;AACjE,UAAM,KAAKvR,GAAGwR,sBAAsBxK,OAAO;MAAEnF,MAAM;QAAE2O;QAAOe,SAAShJ,WAAWgJ,OAAAA;MAAS;IAAE,CAAA;EAC7F;EAEA,MAAME,mBAAmBjB,OAAqD;AAC5E,UAAM1M,MAAM,MAAM,KAAK9D,GAAGwR,sBAAsBpD,UAAU;MACxD7N,OAAO;QAAEiQ;MAAM;MACfnP,SAAS;QAAEF,IAAI;MAAM;IACvB,CAAA;AACA,QAAI,CAAC2C,IAAK,QAAO;AACjB,UAAM,KAAK9D,GAAGwR,sBAAsBd,OAAO;MAAEnQ,OAAO;QAAEY,IAAI2C,IAAI3C;MAAG;IAAE,CAAA;AACnE,WAAO;MAAEoQ,SAASzN,IAAIyN,WAAWzR;IAAU;EAC7C;EAEA,MAAM4R,oBACJP,aACAQ,SACAtR,OACmC;AAGnC,UAAMyB,OAAO,MAAM,KAAK9B,GAAGwR,sBAAsBvQ,SAAS;MACxDV,OAAO;QACLiQ,OAAO;UAAE3B,YAAYsC;QAAY;QACjC,GAAIQ,YAAY7R,SAAY;UAAEqB,IAAI;YAAEyQ,IAAIC,OAAOF,OAAAA;UAAS;QAAE,IAAI,CAAC;MACjE;MACAtQ,SAAS;QAAEF,IAAI;MAAM;MACrBqE,MAAMnF;IACR,CAAA;AAGA,WAAOyB,KACJ4C,OAAO,CAACe,MAAMA,EAAE+K,MAAM3B,WAAWsC,WAAAA,CAAAA,EACjCnP,IAAI,CAACyD,OAAO;MAAEtE,IAAI2Q,OAAOrM,EAAEtE,EAAE;MAAGqP,OAAO/K,EAAE+K;MAAOe,SAAS9L,EAAE8L,WAAWzR;IAAU,EAAA;EACrF;EAEA,MAAMiS,sBAAsB9M,KAA8B;AACxD,QAAIA,IAAIxD,WAAW,EAAG;AACtB,UAAM,KAAKzB,GAAGwR,sBAAsB5N,WAAW;MAAErD,OAAO;QAAEY,IAAI;UAAEV,IAAIwE,IAAIjD,IAAI6P,MAAAA;QAAQ;MAAE;IAAE,CAAA;EAC1F;EAEA,MAAMG,YAAYrL,OAKA;AAChB,UAAM,KAAK3G,GAAGiS,qBAAqBjL,OAAO;MACxCnF,MAAM;QACJV,IAAIwF,MAAMxF;QACVgN,MAAMxH,MAAMwH;QACZoD,SAAShJ,WAAW5B,MAAM4K,OAAO;QACjCW,aAAajI,OAAOtD,MAAMuL,WAAW;MACvC;IACF,CAAA;EACF;EAEA,MAAMC,mBACJhE,MACA9N,OACuE;AACvE,UAAMyB,OAAO,MAAM,KAAK9B,GAAGiS,qBAAqBhR,SAAS;MACvDV,OAAO;QAAE4N;MAAK;MACd9M,SAAS;QAAE6Q,aAAa;MAAM;MAC9B1M,MAAMnF;IACR,CAAA;AACA,WAAOyB,KAAKE,IAAI,CAACyD,OAAO;MACtBtE,IAAIsE,EAAEtE;MACNoQ,SAAS9L,EAAE8L,WAAWzR;MACtBoS,aAAaL,OAAOpM,EAAEyM,WAAW;IACnC,EAAA;EACF;EAEA,MAAME,oBAAoBjR,IAA8B;AAItD,UAAMiJ,SAAS,MAAM,KAAKpK,GAAGiS,qBAAqBrO,WAAW;MAAErD,OAAO;QAAEY;MAAG;IAAE,CAAA;AAC7E,WAAOiJ,OAAOjH,UAAU;EAC1B;AACF;AAQA,SAASiI,cAAcD,GAAkB;AAIvC,QAAMkH,kBAAcC,uDAA2BnH,CAAAA,EAAGnJ,IAAI,CAAC,EAAEuQ,QAAQC,YAAYC,QAAO,OAAQ;IAC1F,CAACF,MAAAA,GACCC,eAAe,MAAMC,UAAUD,eAAe,OAAO;MAAExI,KAAKyI;IAAQ,IAAI;MAAE,CAACtH,EAAEuH,EAAE,GAAGD;IAAQ;EAC9F,EAAA;AACA,MAAIJ,YAAY5Q,WAAW,EAAG,QAAOkR;AACrC,SAAO;IAAEjP,YAAY;MAAEoL,MAAM;QAAE7G,KAAKkD,EAAElD;QAAK,GAAGyC,MAAM2H,WAAAA;MAAa;IAAE;EAAE;AACvE;AAVSjH;AAeT,IAAMuH,kBAA2C;EAAExR,IAAI;IAAEV,IAAI,CAAA;EAAe;AAAE;AAG9E,SAASiK,MAAMkI,UAAmC;AAChD,SAAOA,SAASnR,SAAS;IAAE6H,IAAIsJ;EAAS,IAAID;AAC9C;AAFSjI;AAIT,IAAMmI,YAAY,wBAAChI,MAA2BA,KAAK,OAAO,OAAOZ,OAAOY,CAAAA,GAAtD;AAClB,IAAMiI,aAAa,wBAACjI,MAAsBA,KAAK,OAAO/K,SAAY+R,OAAOhH,CAAAA,GAAtD;AACnB,IAAMtC,aAAa,wBAACwK,MAAeA,KAAK,MAArB;AAEnB,SAASrQ,UAAUF,KAAgB;AACjC,SAAO;IACLrB,IAAIqB,IAAIrB;IACRf,UAAUoC,IAAIpC;IACd4S,iBAAiBxQ,IAAIwQ;IACrBxS,QAAQgC,IAAIhC;IACZmG,OAAO4B,WAAW/F,IAAImE,KAAK;IAC3B2B,QAAQC,WAAW/F,IAAI8F,MAAM;IAC7BE,OAAOD,WAAW/F,IAAIgG,KAAK;IAC3BuB,QAAQ8I,UAAUrQ,IAAIuH,MAAM;IAC5BN,UAAUjH,IAAIiH,YAAY;IAC1BF,aAAa/G,IAAI+G,eAAe,OAAO,OAAO,IAAIpE,KAAK3C,IAAI+G,WAAW;IACtE0J,wBAAwBzQ,IAAIyQ,0BAA0B;IACtDC,kBAAkB1Q,IAAI0Q,oBAAoB;IAC1C9R,MAAMmH,WAAW/F,IAAIpB,IAAI;IACzBwB,kBAAkB2F,WAAW/F,IAAII,gBAAgB;IACjDuQ,UAAU3Q,IAAI2Q,YAAY;;;;IAI1BtT,WAAW2C,IAAI3C,aAAa;;IAE5BiL,QAAQtI,IAAIsI,UAAU;IACtBlB,WAAWpH,IAAIoH;IACftE,WAAW9C,IAAI8C;EACjB;AACF;AA1BS5C;AA4BT,SAASJ,WAAWH,OAA2B;AAM7C,QAAMN,OAAgC,CAAC;AACvC,MAAI,cAAcM,MAAON,MAAKzB,WAAW+B,MAAM/B;AAC/C,MAAI,qBAAqB+B,MAAON,MAAKmR,kBAAkB7Q,MAAM6Q;AAC7D,MAAI,YAAY7Q,MAAON,MAAKrB,SAAS2B,MAAM3B;AAC3C,MAAI,WAAW2B,MAAON,MAAK8E,QAAQ4B,WAAWpG,MAAMwE,KAAK;AACzD,MAAI,YAAYxE,MAAON,MAAKyG,SAASC,WAAWpG,MAAMmG,MAAM;AAC5D,MAAI,WAAWnG,MAAON,MAAK2G,QAAQD,WAAWpG,MAAMqG,KAAK;AACzD,MAAI,YAAYrG,MAAON,MAAKkI,SAAS8I,UAAU1Q,MAAM4H,MAAM;AAC3D,MAAI,cAAc5H,MAAON,MAAK4H,WAAWtH,MAAMsH,YAAY;AAC3D,MAAI,iBAAiBtH,MACnBN,MAAK0H,cAAcpH,MAAMoH,eAAe,OAAO,OAAO,IAAIpE,KAAKhD,MAAMoH,WAAW;AAClF,MAAI,4BAA4BpH,MAC9BN,MAAKoR,yBAAyB9Q,MAAM8Q,0BAA0B;AAChE,MAAI,sBAAsB9Q,MAAON,MAAKqR,mBAAmB/Q,MAAM+Q,oBAAoB;AACnF,MAAI,UAAU/Q,MAAON,MAAKT,OAAOmH,WAAWpG,MAAMf,IAAI;AACtD,MAAI,sBAAsBe,MAAON,MAAKe,mBAAmB2F,WAAWpG,MAAMS,gBAAgB;AAC1F,MAAI,cAAcT,MAAON,MAAKsR,WAAWhR,MAAMgR,YAAY;AAK3D,MAAI,eAAehR,MAAON,MAAKhC,YAAYsC,MAAMtC,aAAa;AAC9D,MAAI,YAAYsC,MAAON,MAAKiJ,SAAS3I,MAAM2I,UAAU;AACrD,MAAI3I,MAAMyH,aAAa,KAAM/H,MAAK+H,YAAYzH,MAAMyH;AACpD,MAAIzH,MAAMmD,aAAa,KAAMzD,MAAKyD,YAAYnD,MAAMmD;AACpD,SAAOzD;AACT;AAhCSS;AAkCT,SAASL,WAAW6B,KAAW;AAC7B,SAAO;IACL3C,IAAI2C,IAAI3C;IACRf,UAAU0D,IAAI1D;IACd4S,iBAAiBlP,IAAIkP;IACrBxS,QAAQsD,IAAItD;IACZmG,OAAO7C,IAAI6C,SAAS7G;IACpBwI,QAAQxE,IAAIwE,UAAUxI;IACtB0I,OAAQ1E,IAAI0E,SAAS1I;IACrBiK,QAAQ+I,WAAWhP,IAAIiG,MAAM;IAC7BN,UAAU3F,IAAI2F,YAAY3J;IAC1ByJ,aAAazF,IAAIyF,eAAe,OAAOzJ,SAAYgE,IAAIyF,YAAY6J,QAAO;IAC1EH,wBAAwBnP,IAAImP,0BAA0BnT;IACtDoT,kBAAkBpP,IAAIoP,oBAAoBpT;IAC1CsB,MAAO0C,IAAI1C,QAA4BtB;IACvC8C,kBACGkB,IAAIlB,oBAAyE9C;IAChFqT,UAAUrP,IAAIqP,YAAYrT;;;;;;IAM1BD,WAAWiE,IAAIjE;;IAEfiL,QAAQhH,IAAIgH,UAAUhL;IACtB8J,WAAW9F,IAAI8F;IACftE,WAAWxB,IAAIwB;EACjB;AACF;AA7BSrD;AAgCT,IAAMoR,gBAAgD;EACpD;IAAC;IAAS;;EACV;IAAC;IAAU;;EACX;IAAC;IAAS;;;AAIZ,IAAMhE,aAA6E;KAC9EgE,cAAcrR,IAAI,CAAC,CAACsN,MAAMsB,MAAAA,OAAa;IAAEtB;IAAM/O,OAAO;MAAE4N,MAAM;QAAEU,YAAY+B;MAAO;IAAE;EAAE,EAAA;EAC1F;IACEtB,MAAM;IACN/O,OAAO;MAAE+S,KAAKD,cAAcrR,IAAI,CAAC,CAAA,EAAG4O,MAAAA,OAAa;QAAEzC,MAAM;UAAEU,YAAY+B;QAAO;MAAE,EAAA;IAAI;EACtF;;AAaF,SAASX,UAAUjB,OAAsBxO,QAAc;AACrD,SAAO+S,KAAKC,UAAU;IAACxE;IAAOxO;GAAO;AACvC;AAFSyP;AAIT,SAASF,iBACP0D,UACAhO,GACAoK,YAA6B;AAE7B,QAAM6D,WAAW7D,WAAW5B,IAAIgC,UAAUxK,EAAEwJ,eAAexJ,EAAEjF,MAAM,CAAA;AACnE,QAAMmT,WAAWlO,EAAE+J,KAAKD;AACxB,QAAMqE,gBACJD,YAAYD,WAAYC,WAAWD,WAAWC,WAAWD,WAAaC,YAAYD;AACpF,SAAO;IACL1E,OAAOvJ,EAAEwJ;IACTzO,QAAQiF,EAAEjF;IACViT;IACAtQ,OAAOsC,EAAEkG,OAAOC;IAChBiI,QAAQpO,EAAE+J,KAAKzJ;IACf+N,QAAQrO,EAAEgK,KAAK1J;IACfgO,SAAStO,EAAE+J,KAAKrB;IAChB6F,SAASvO,EAAEgK,KAAKtB;;IAEhByF;IACAK,cAAcxO,EAAE+J,KAAK9G;IACrBwL,cAAczO,EAAEgK,KAAK/G;IACrByL,eAAe1O,EAAEgK,KAAK9G;IACtByL,aAAavC,OAAOpM,EAAEiK,KAAKC,YAAY,CAAA;EACzC;AACF;AAzBSI;AA4BT,SAAS1I,UAAUF,aAA6C;AAC9D,QAAMkN,QAAQ,oBAAIvG,IAAAA;AAClB,aAAW,EAAE5N,OAAO6F,IAAG,KAAMoB,aAAa;AACxC,UAAMhB,OAAOkO,MAAMpG,IAAI/N,KAAAA,KAAU,oBAAI+D,IAAAA;AACrCkC,SAAKT,IAAIK,GAAAA;AACTsO,UAAMrG,IAAI9N,OAAOiG,IAAAA;EACnB;AACA,SAAO,IAAI2H,IAAI;OAAIuG;IAAOrS,IAAI,CAAC,CAAC9B,OAAOiG,IAAAA,MAAU;IAACjG;IAAO;SAAIiG;;GAAM,CAAA;AACrE;AARSkB;AAUT,IAAMC,gBAAgB,wBAACpH,OAAe6F,QAAwB,GAAG7F,KAAAA,KAAc6F,GAAAA,IAAzD;AAQtB,SAAS0B,gBACPN,aACAC,SAAoB;AAEpB,QAAMG,QAAmB,CAAA;AACzB,QAAMC,SAAS,oBAAIsG,IAAAA;AACnB,aAAWjH,cAAcM,aAAa;AACpC,UAAMc,MAAMX,cAAcT,WAAW3G,OAAO2G,WAAWd,GAAG;AAC1D,QAAI,CAACqB,QAAQc,IAAID,GAAAA,GAAM;AACrBV,YAAMlB,KAAK,KAAA;AACX;IACF;AACAkB,UAAMlB,KAAK,IAAA;AACXmB,WAAOwG,IAAI/F,KAAKpB,UAAAA;AAChB,QAAIA,WAAWrG,WAAW,UAAW4G,SAAQsJ,OAAOzI,GAAAA;EACtD;AACA,SAAO;IAAEV;IAAOC,QAAQ;SAAIA,OAAO8M,OAAM;;EAAI;AAC/C;AAjBS7M;AAwBT,eAAesB,mBACbxH,IACA4F,aAA6B;AAE7B,aAAW,CAACjH,OAAOiG,IAAAA,KAASkB,UAAUF,WAAAA,GAAc;AAClD,aAAS3F,KAAK,GAAGA,KAAK2E,KAAK1E,QAAQD,MAAM,KAAK;AAC5C,YAAMD,GAAG4C,sBAAsBP,WAAW;QACxCrD,OAAO;UAAEL;UAAO6F,KAAK;YAAEtF,IAAI0F,KAAKxE,MAAMH,IAAIA,KAAK,GAAA;UAAK;QAAE;MACxD,CAAA;IACF;EACF;AACA,WAASA,KAAK,GAAGA,KAAK2F,YAAY1F,QAAQD,MAAM,KAAK;AACnD,UAAMD,GAAG4C,sBAAsB1B,WAAW;MACxCZ,MAAMsF,YAAYxF,MAAMH,IAAIA,KAAK,GAAA,EAAKQ,IAAI8E,gBAAAA;IAC5C,CAAA;EACF;AACF;AAhBeiC;AAmBf,IAAMrC,kCAAkC;EACtCxG,OAAO;EACP6F,KAAK;EACLoI,MAAM;EACNmB,MAAM;EACNiF,QAAQ;EACR/T,QAAQ;EACR8H,QAAQ;EACRE,OAAO;EACPC,QAAQ;EACRkH,UAAU;EACV6E,aAAa;EACbvF,eAAe;EACflF,QAAQ;EACRwF,YAAY;EACZ7G,WAAW;EACXC,YAAY;AACd;AAWA,IAAM8L,WAAW,wBAAC1B,MAA+BA,KAAK,OAAO,OAAOQ,KAAKC,UAAUT,CAAAA,GAAlE;AAOjB,SAAShS,UAAUf,IAAuB;AACxC,QAAM0U,SAAS1U;AACf,SAAO,OAAO0U,OAAOC,aAAa,aAAaD,OAAOC,SAAQ,IAAK3U;AACrE;AAHSe;AAMT,SAASH,eACPZ,IAAuB;AAEvB,QAAM0U,SAAS1U;AACf,MAAI,OAAO0U,OAAOE,oBAAoB,WAAY,QAAO9U;AACzD,MAAI4U,OAAOG,oBAAoB,cAAc;AAC3C,WAAO,CAACtT,IAAI0D,QACV1D,GAAGqT,gBACD,uDAAuD3P,IACpDjD,IAAI,CAAC8S,GAAG9M,MAAM,IAAIA,IAAI,CAAA,EAAG,EACzB+M,KAAK,IAAA,CAAA,4BAA+B,GACpC9P,GAAAA;EAET;AACA,MAAIyP,OAAOG,oBAAoB,SAAS;AACtC,WAAO,CAACtT,IAAI0D,QACV1D,GAAGqT,gBACD,qDAAqD3P,IAClDjD,IAAI,MAAM,GAAA,EACV+S,KAAK,IAAA,CAAA,4BAA+B,GACpC9P,GAAAA;EAET;AACA,SAAOnF;AACT;AAxBSc;AA0BT,SAASwH,iBAAiBpI,IAAuB;AAC/C,QAAM0U,SAAS1U;AACf,MAAI,OAAO0U,OAAOE,oBAAoB,WAAY,QAAO9U;AACzD,MAAI4U,OAAOG,oBAAoB,aAAc,QAAOG;AACpD,MAAIN,OAAOG,oBAAoB,QAAS,QAAOI;AAC/C,MAAIP,OAAOG,oBAAoB,SAAU,QAAOK;AAChD,SAAOpV;AACT;AAPSsI;AAcT,IAAM4M,qBAAgC,8BAAOhV,IAAI4H,gBAAAA;AAC/C,QAAM0M,SAAoB,CAAA;AAC1B,QAAMxS,OAAO8F,YAAY5F,IAAI,CAAC2C,MAAAA;AAC5B,UAAMkG,IAAIyJ,OAAO7S;AACjB6S,WAAOjO,KACL1B,EAAEzE,OACFyE,EAAEoB,KACFpB,EAAEnE,QACFiU,SAAS9P,EAAE2D,MAAM,GACjBmM,SAAS9P,EAAE6D,KAAK,GAChBiM,SAAS9P,EAAE8D,MAAM,GACjB9D,EAAE+D,UAAUyM,YAAW,GACvBxQ,EAAEgE,WAAWwM,YAAW,CAAA;AAE1B,UAAMvG,IAAI,wBAACwG,MAAc,IAAIvK,IAAIuK,CAAAA,IAAvB;AACV,WAAO,IAAIxG,EAAE,CAAA,CAAA,WAAaA,EAAE,CAAA,CAAA,cAAgBA,EAAE,CAAA,CAAA,WAAaA,EAAE,CAAA,CAAA,YAAcA,EAAE,CAAA,CAAA,YAAcA,EAAE,CAAA,CAAA,aAAeA,EAAE,CAAA,CAAA,uCAAyCA,EAAE,CAAA,CAAA;EAC3J,CAAA;AACA,QAAMyG,UAAU,MAAMrV,GAAG4U,gBACvB;;mBAEe9S,KAAKiT,KAAK,IAAA,CAAA;;;gCAGC,GACvBT,MAAAA;AAEL,SAAO,IAAIrQ,IAAIoR,QAAQrT,IAAI,CAAC8B,QAAQwD,cAAcxD,IAAIwR,QAAQzD,OAAO/N,IAAIiC,GAAG,CAAA,CAAA,CAAA;AAC9E,GA3BsC;AAiCtC,IAAMkP,kBAA6B,8BAAOjV,IAAI4H,gBAAAA;AAC5C,QAAMR,UAAU,oBAAInD,IAAAA;AACpB,aAAW,CAAC/D,OAAOiG,IAAAA,KAASkB,UAAUO,WAAAA,GAAc;AAClD,UAAM9F,QAAO,MAAM9B,GAAG4U,gBACpB,iFAAiFzO,KAC9EnE,IAAI,MAAM,GAAA,EACV+S,KAAK,IAAA,CAAA,uCACR7U,OAAAA,GACGiG,IAAAA;AAEL,eAAWrC,OAAOhC,MAAMsF,SAAQ1B,IAAI4B,cAAcxD,IAAIwR,QAAQzD,OAAO/N,IAAIiC,GAAG,CAAA,CAAA;EAC9E;AACA,QAAM8C,MAAMjB,YAAYlD,OAAO,CAACC,MAAMyC,QAAQc,IAAIZ,cAAc3C,EAAEzE,OAAOyE,EAAEoB,GAAG,CAAA,CAAA;AAC9E,MAAI8C,IAAIpH,WAAW,EAAG,QAAO2F;AAC7B,QAAM5F,KAAK,wBAAC+T,MAAYA,EAAEJ,YAAW,EAAGK,QAAQ,KAAK,GAAA,EAAKA,QAAQ,KAAK,EAAA,GAA5D;AACX,QAAMlB,SAAoB,CAAA;AAC1B,QAAMxS,OAAO+G,IAAI7G,IAAI,CAAC2C,GAAGqD,MAAAA;AACvBsM,WAAOjO,KACL1B,EAAEzE,OACFyE,EAAEoB,KACFpB,EAAEnE,QACFiU,SAAS9P,EAAE2D,MAAM,GACjBmM,SAAS9P,EAAE6D,KAAK,GAChBiM,SAAS9P,EAAE8D,MAAM,GACjBjH,GAAGmD,EAAE+D,SAAS,GACdlH,GAAGmD,EAAEgE,UAAU,CAAA;AAEjB,WAAOX,MAAM,IACT,uHACA;EACN,CAAA;AACA,QAAMyN,UAAU,MAAMzV,GAAG0V,kBACvB,8CAA8C5T,KAAKiT,KAAK,aAAA,CAAA;;;;iCAI7B,GACxBT,MAAAA;AAEL,MAAImB,YAAY5M,IAAIpH,QAAQ;AAC1B,UAAM,IAAI4B,MAAM,mEAAA;EAClB;AACA,SAAO+D;AACT,GA3CmC;AAiDnC,IAAM8N,mBAA8B,8BAAOlV,IAAI4H,gBAAAA;AAC7C,QAAM0M,SAAoB,CAAA;AAC1B,QAAMxS,OAAO8F,YAAY5F,IAAI,CAAC2C,MAAAA;AAC5B2P,WAAOjO,KACL1B,EAAEzE,OACFyE,EAAEoB,KACFpB,EAAEnE,QACFiU,SAAS9P,EAAE2D,MAAM,GACjBmM,SAAS9P,EAAE6D,KAAK,GAChBiM,SAAS9P,EAAE8D,MAAM,GACjB9D,EAAE+D,UAAU0K,QAAO,GACnBzO,EAAEgE,WAAWyK,QAAO,CAAA;AAEtB,WAAO;EACT,CAAA;AACA,QAAMiC,UAAU,MAAMrV,GAAG4U,gBACvB,0FAA0F9S,KAAKiT,KAAK,IAAA,CAAA;;;;;;4BAM9E,GACnBT,MAAAA;AAEL,SAAO,IAAIrQ,IAAIoR,QAAQrT,IAAI,CAAC8B,QAAQwD,cAAcxD,IAAIwR,QAAQzD,OAAO/N,IAAIiC,GAAG,CAAA,CAAA,CAAA;AAC9E,GA1BoC;AA4BpC,SAASe,iBAAiBoC,IAAkB;AAC1C,SAAO;IACLhJ,OAAOgJ,GAAGhJ;IACV6F,KAAKmD,GAAGnD;IACRoI,MAAMjF,GAAGiF;IACTmB,MAAMpG,GAAGoG;IACTiF,QAAQrL,GAAGqL;IACX/T,QAAQ0I,GAAG1I;IACXmG,OAAO4B,WAAWW,GAAGvC,KAAK;IAC1B2B,QAAQC,WAAWW,GAAGZ,MAAM;IAC5BE,OAAOD,WAAWW,GAAGV,KAAK;IAC1BC,QAAQF,WAAWW,GAAGT,MAAM;IAC5BkH,UAAUzG,GAAGyG;IACb6E,aAAatL,GAAGsL,eAAe;IAC/BvF,eAAe/F,GAAG+F,iBAAiB;IACnClF,QAAQ8I,UAAU3J,GAAGa,MAAM;IAC3BwF,YAAYrG,GAAGqG;IACf7G,WAAWQ,GAAGR;IACdC,YAAYO,GAAGP;EACjB;AACF;AApBS7B;AAsBT,SAASb,kBAAkBnC,KAAkB;AAC3C,SAAO;IACL5D,OAAO4D,IAAI5D;IACX6F,KAAKjC,IAAIiC;IACToI,MAAMrK,IAAIqK;IACVmB,MAAMxL,IAAIwL;IACViF,QAAQzQ,IAAIyQ;IACZ/T,QAAQsD,IAAItD;IACZmG,OAAO7C,IAAI6C,SAAS7G;IACpBwI,QAAQxE,IAAIwE,UAAUxI;IACtB0I,OAAQ1E,IAAI0E,SAAS1I;IACrB2I,QAAS3E,IAAI2E,UAAU3I;IACvB6P,UAAU7L,IAAI6L;IACd6E,aAAa1Q,IAAI0Q,eAAe1U;IAChCmP,eAAenL,IAAImL,iBAAiBnP;IACpCiK,QAAQ+I,WAAWhP,IAAIiG,MAAM;IAC7BwF,YAAYzL,IAAIyL,cAAczL,IAAI4E;IAClCA,WAAW5E,IAAI4E;IACfC,YAAY7E,IAAI6E;EAClB;AACF;AApBS1C;AAsBT,SAAS4G,eAAepH,GAAiB;AACvC,SAAO;IACLtE,IAAIsE,EAAEtE;IACNtB,WAAW4F,EAAE5F;IACbO,UAAUqF,EAAErF;IACZ8M,QAAQzH,EAAEyH;IACVC,YAAY1H,EAAE0H,cAAc,OAAO,OAAOlD,OAAOxE,EAAE0H,UAAU;IAC7D/L,MAAMmH,WAAW9C,EAAErE,IAAI;IACvBgM,MAAM3H,EAAE2H;IACRC,OAAO5H,EAAE4H;IACTzD,WAAWnE,EAAEmE;IACbtE,WAAWG,EAAEH;EACf;AACF;AAbSuH;AAeT,SAASE,gBAAgBjJ,KAAgB;AACvC,QAAM1C,OAAOuU,MAAMC,QAAQ9R,IAAI1C,IAAI,IAAK0C,IAAI1C,OAAoBtB;AAChE,SAAO;IACLqB,IAAI2C,IAAI3C;IACRtB,WAAWiE,IAAIjE;IACfO,UAAU0D,IAAI1D;IACd8M,QAAQpJ,IAAIoJ;IACZC,YAAYrJ,IAAIqJ,cAAc,OAAO,OAAO0E,OAAO/N,IAAIqJ,UAAU;IACjE,GAAI/L,MAAMK,SAAS;MAAEL;IAAK,IAAI,CAAC;IAC/BgM,MAAOtJ,IAAIsJ,QAAQ,CAAC;IACpBC,OAAQvJ,IAAIuJ,SAAS,CAAC;IACtBzD,WAAW9F,IAAI8F;IACftE,WAAWxB,IAAIwB;EACjB;AACF;AAdSyH;;;AC3mDF,SAAS8I,uBAAAA;AACd,SAAO;IACL;IACA;IACA;IACA;IACA;IACA;IACA;;AAEJ;AAVgBA;","names":["namespaceWhere","namespace","undefined","PrismaStateStore","db","tryAdmitSingleton","runId","tag","workflow","limit","retryWakeAt","where","status","in","SINGLETON_ACTIVE_STATUSES","lockRows","rowLockDialect","claimants","singletonClaimantIds","primaryOf","durableWorkflowRun","findMany","select","id","tags","orderBy","$transaction","tx","at","length","SINGLETON_LOCK_CHUNK","slice","updateMany","data","rows","runs","map","fromRunRow","singletonAdmissionTags","patch","singletonAdmissionDenialPatch","update","toRunPatch","createRun","run","createMany","toRunData","reindexAttributes","searchAttributes","updateRun","inputPatch","TERMINAL_RUN_STATUSES","includes","clearTerminalSingletonAdmission","getRun","count","findUnique","Error","updateRunIf","expectedStatuses","Object","keys","attributes","durableRunAttribute","deleteMany","normalizeAttributeRows","row","getRuns","runIds","Set","deleteRun","durableStepCheckpoint","durableSignalWaiter","deleteRuns","pruneTerminalRuns","policy","nowMs","statuses","filter","s","maxAge","maxCount","scoped","runWhere","scope","ids","cutoff","Date","parseDuration","AND","updatedAt","lt","take","r","add","size","skip","doomed","getCheckpoint","seq","runId_seq","fromCheckpointRow","getCheckpoints","seqs","unique","push","sort","a","b","getCheckpointsForSettle","CHECKPOINT_SELECT_WITHOUT_INPUT","input","saveCheckpoint","checkpoint","toCheckpointData","upsert","create","saveCheckpointIfPending","saveCheckpointsIfPending","checkpoints","pending","seqsByRun","checkpointKey","wrote","writes","decideIfPending","chunk","settleCheckpointsIfPending","settlements","seen","firsts","forEach","i","key","has","dialect","rawSettleDialect","settle","output","jsonOrNull","error","events","startedAt","finishedAt","raw","won","saveCheckpoints","replaceCheckpoints","transaction","work","cp","listIncompleteRuns","listOrphanedRuns","ownedBy","OR","lockedUntil","lte","lockedBy","owner","lockedBefore","createdAt","listPendingRuns","listDueTimers","wakeAt","not","BigInt","tryLockRun","leaseUntilMs","result","releaseRunLock","renewRunLock","query","and","workflows","anyOf","w","namespaces","n","origin","origins","o","array_contains","t","f","attributeSome","listRuns","offset","countRuns","runFacets","groupBy","by","_count","_all","mergeRunFacetRows","runValueFacets","axis","opts","axisIsRunColumn","scan","RUN_VALUE_FACET_SCAN","runValueFacetsFromRuns","field","mergeRunValueFacetRows","value","schedules","delegate","durableSchedule","saveSchedule","record","toScheduleData","getSchedule","fromScheduleRow","updateSchedule","expectedNextFireAt","paused","nextFireAt","spec","state","deleteSchedule","listSchedules","dueBy","nulls","listCheckpoints","listCheckpointsForReplay","open","inputs","Map","found","set","get","getLatestCheckpointByName","name","findFirst","hasCheckpoints","fromSeq","toSeq","gte","countCheckpoints","listCheckpointsByNamePrefix","prefixes","p","startsWith","some","checkpointStats","group","parallelGroup","grouped","Promise","all","NAME_KINDS","kind","enqueuedAt","_min","_max","_sum","attempts","stats","unenqueued","unenqueuedStartedAt","toCheckpointStat","flat","bucketKey","queryCheckpoints","namePrefixes","excludeGroups","notIn","putSignalWaiter","waiter","token","takeSignalWaiter","delete","listSignalWaiters","prefix","registerChildWaits","entries","compactCheckpoints","into","listSignalWaitersByRun","hasSignalWaiter","tokenPrefix","first","removeSignalWaiter","bufferSignal","payload","durableBufferedSignal","takeBufferedSignal","listBufferedSignals","afterId","gt","Number","String","deleteBufferedSignals","bufferEvent","durableBufferedEvent","publishedAt","listBufferedEvents","removeBufferedEvent","comparisons","attributePredicateOperands","column","comparator","operand","op","MATCHES_NOTHING","branches","bigOrNull","numOrUndef","v","workflowVersion","awaitingDecisionTaskId","recoveryAttempts","priority","getTime","KIND_PREFIXES","NOT","JSON","stringify","nameKind","fallback","enqueued","minEnqueuedAt","minSeq","maxSeq","minName","maxName","minStartedAt","maxStartedAt","maxFinishedAt","sumAttempts","byRun","values","stepId","workerGroup","jsonText","client","$primary","$queryRawUnsafe","_activeProvider","_","join","settleRowsPostgres","settleRowsMysql","settleRowsSqlite","toISOString","k","written","run_id","d","replace","updated","$executeRawUnsafe","Array","isArray","durableManagedTables"]}
|