@pattern-stack/codegen 0.15.1 → 0.15.2

package/dist/chunk-4RFHUZXU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/jobs/job-orchestrator.memory-backend.ts"],"sourcesContent":["/**\n * MemoryJobOrchestrator — in-process implementation of `IJobOrchestrator`\n * (ADR-022, JOB-4).\n *\n * Exists solely for the unit test suite: reproduces the Drizzle backend's\n * observable behaviour (claim ordering, collision modes, dedupe collapse,\n * memoization cache, replay row-clearing, cascade cancel) without a\n * database. Not production — the single-process mutex is a substitute for\n * Postgres' `FOR UPDATE SKIP LOCKED`; acceptable non-parity is listed in\n * `docs/specs/JOB-4.md` (fsync, query perf, multi-process claim).\n *\n * The `MemoryJobStore` is shared with `MemoryJobRunService` /\n * `MemoryJobStepService` — all three services mutate the same Maps under\n * the orchestrator's mutex.\n */\nimport { randomUUID } from 'node:crypto';\nimport { Inject, Injectable, Logger, Optional } from '@nestjs/common';\nimport { ModuleRef } from '@nestjs/core';\nimport type {\n  JobDefinitionRow,\n  JobRunRow,\n} from './job-orchestration.schema';\nimport type {\n  CancelOptions,\n  IJobOrchestrator,\n  JobPoolDef,\n  JobRun,\n  JobUpsertEntry,\n  StartOptions,\n} from './job-orchestrator.protocol';\nimport type {\n  JobContext,\n  JobHandlerBase,\n  JobHandlerMeta,\n  RetryPolicy,\n  SpawnChildOptions,\n  StepOptions,\n} from './job-handler.base';\nimport { ParentClosePolicy } from './job-handler.base';\nimport {\n  JobCollisionError,\n  JobNotReplayableError,\n  JobTemplateFieldMissingError,\n  JobTypeNotFoundError,\n  MissingTenantIdError,\n} from './jobs-errors';\nimport { MemoryJobStore } from './memory-job-store';\nimport { MemoryJobStepService } from './job-step-service.memory-backend';\nimport { JOBS_MULTI_TENANT } from './jobs-domain.tokens';\n\n/**\n * Sentinel `run_at` for runs that lost the `queue` collision — they stay\n * unclaimable until the incumbent transitions terminal and the orchestrator\n * advances their `run_at` back to `now()`. Mirrors the Drizzle backend's\n * `claim-time gate` behaviour without requiring a separate claim query.\n */\nconst QUEUED_RUN_AT = new Date(8_640_000_000_000_000); // \"distant future\"\nconst TERMINAL_STATUSES: JobRunRow['status'][] = [\n  'completed',\n  'failed',\n  'timed_out',\n  'canceled',\n];\nconst DEDUPE_EXCLUDED_STATUSES: JobRunRow['status'][] = ['canceled', 'failed'];\nconst IN_FLIGHT_STATUSES: JobRunRow['status'][] = ['pending', 'running'];\n\nfunction isTerminal(status: JobRunRow['status']): boolean {\n  return TERMINAL_STATUSES.includes(status);\n}\n\n/**\n * Mirror of `evaluateKeyTemplate` in the Drizzle backend. Kept private here\n * rather than exported so the memory backend has no dependency on the\n * Drizzle module.\n */\nfunction evaluateKeyTemplate(\n  template: string,\n  input: Record<string, unknown>,\n): string {\n  return template.replace(\n    /\\{\\{\\s*([a-zA-Z0-9_]+)\\s*\\}\\}/g,\n    (_m, field: string) => {\n      const value = input[field];\n      if (value === undefined || value === null) {\n        throw new JobTemplateFieldMissingError(template, field);\n      }\n      return String(value);\n    },\n  );\n}\n\n/**\n * Single-promise-chain mutex. Every mutating op on the store goes through\n * `run(...)` so two concurrent `start` calls observe the same sequential\n * consistency Postgres gives us via `FOR UPDATE SKIP LOCKED`. Error\n * swallowing on the chain pointer prevents one failed call from poisoning\n * the queue for subsequent callers.\n *\n * Kept private to this file on purpose — the spec explicitly forbids\n * exporting this; it exists only for the memory backend's internal\n * serialisation.\n */\nclass PromiseMutex {\n  private queue: Promise<void> = Promise.resolve();\n\n  async run<T>(fn: () => Promise<T>): Promise<T> {\n    const next = this.queue.then(() => fn());\n    // Swallow errors on the chain pointer so a throwing `fn` doesn't\n    // permanently reject every future caller.\n    this.queue = next.then(\n      () => undefined,\n      () => undefined,\n    );\n    return next;\n  }\n}\n\n/** Handler registry entry — class + frozen metadata. */\ninterface HandlerRegistration {\n  type: string;\n  meta: JobHandlerMeta<unknown>;\n  handlerClass: new (...args: unknown[]) => JobHandlerBase<unknown>;\n}\n\n@Injectable()\nexport class MemoryJobOrchestrator implements IJobOrchestrator {\n  private readonly logger = new Logger(MemoryJobOrchestrator.name);\n  private readonly mutex = new PromiseMutex();\n  private readonly handlerRegistry = new Map<string, HandlerRegistration>();\n\n  /**\n   * `runId → dependent runId[]` — when a run with `concurrencyKey = K`\n   * blocks on an incumbent, its id is added here under the incumbent's id.\n   * On incumbent terminal transition we advance every dependent's `runAt`\n   * back to `now()` so it becomes claimable.\n   */\n  private readonly queueBlockers = new Map<string, string[]>();\n\n  constructor(\n    // ADR-037 (package-mode DI): explicit `@Inject` tokens on every param —\n    // the published bundle has no `design:paramtypes` metadata (built without\n    // `emitDecoratorMetadata`), so by-type injection would resolve to\n    // `undefined` in package mode. Class tokens (`MemoryJobStore`,\n    // `MemoryJobStepService`, `ModuleRef`) are passed to `@Inject` explicitly.\n    @Inject(MemoryJobStore) private readonly store: MemoryJobStore,\n    @Inject(MemoryJobStepService) private readonly stepService: MemoryJobStepService,\n    @Inject(JOBS_MULTI_TENANT) private readonly multiTenant: boolean,\n    @Optional() @Inject(ModuleRef) private readonly moduleRef?: ModuleRef,\n  ) {}\n\n  /**\n   * JOB-8 — mirror of the Drizzle backend's `resolveTenantId`. Returns the\n   * value to stamp on `tenant_id` / compare against in memory predicates.\n   * Off → always `null`. On + `undefined` → throw. On + `null`/string → pass.\n   */\n  private resolveTenantId(\n    method: string,\n    tenantId: string | null | undefined,\n  ): string | null {\n    if (!this.multiTenant) return null;\n    if (tenantId === undefined) throw new MissingTenantIdError(method);\n    return tenantId;\n  }\n\n  // ==========================================================================\n  // registerHandler — replaces Drizzle's `job` table upsert\n  // ==========================================================================\n\n  /**\n   * Populate the in-memory job definition row plus handler class lookup.\n   * Called by `JobWorkerModule.onModuleInit` in memory mode, or directly by\n   * unit tests that want to seed the registry without NestJS.\n   */\n  registerHandler<TInput>(\n    type: string,\n    meta: JobHandlerMeta<TInput>,\n    handlerClass: new (...args: unknown[]) => JobHandlerBase<TInput>,\n  ): void {\n    const concurrencyKeyTemplate =\n      (meta.concurrency as { key?: string } | undefined)?.key ?? null;\n    const dedupeKeyTemplate =\n      (meta.dedupe as { key?: string } | undefined)?.key ?? null;\n    const dedupeWindowMs = meta.dedupe?.windowMs ?? null;\n    const now = new Date();\n\n    const def: JobDefinitionRow = {\n      type,\n      version: 1,\n      pool: meta.pool ?? 'batch',\n      scopeEntityType: meta.scope?.entity ?? null,\n      retryPolicy: meta.retry ?? {\n        attempts: 1,\n        backoff: 'fixed',\n        baseMs: 0,\n      },\n      timeoutMs: meta.timeoutMs ?? null,\n      concurrencyKeyTemplate:\n        typeof concurrencyKeyTemplate === 'string' ? concurrencyKeyTemplate : null,\n      collisionMode:\n        (meta.concurrency?.collisionMode as JobDefinitionRow['collisionMode']) ??\n        'queue',\n      dedupeKeyTemplate:\n        typeof dedupeKeyTemplate === 'string' ? dedupeKeyTemplate : null,\n      dedupeWindowMs,\n      priorityDefault: 0,\n      replayFrom: meta.replayFrom ?? 'last_checkpoint',\n      createdAt: now,\n      updatedAt: now,\n    };\n\n    this.store.jobs.set(type, def);\n    this.handlerRegistry.set(type, {\n      type,\n      meta: meta as JobHandlerMeta<unknown>,\n      handlerClass: handlerClass as unknown as new (\n        ...args: unknown[]\n      ) => JobHandlerBase<unknown>,\n    });\n  }\n\n  /** Test helper — look up a registered handler without exposing the map. */\n  getHandlerRegistration(type: string): HandlerRegistration | undefined {\n    return this.handlerRegistry.get(type);\n  }\n\n  /**\n   * Boot-time upsert per `IJobOrchestrator.upsertJobRows`. Memory backend\n   * just funnels each entry through `registerHandler`. The validator is\n   * skipped entirely in memory mode (Q4 resolution 2026-04-19), so the\n   * orphaned list is always empty — there are no DB rows to compare against.\n   */\n  async upsertJobRows(\n    entries: JobUpsertEntry[],\n    poolConfig: ReadonlyMap<string, JobPoolDef>,\n  ): Promise<{ orphaned: string[] }> {\n    void poolConfig; // pool validation is the module's responsibility\n    for (const entry of entries) {\n      this.registerHandler(\n        entry.type,\n        entry.meta as JobHandlerMeta<unknown>,\n        entry.handlerClass as new (...args: unknown[]) => JobHandlerBase<unknown>,\n      );\n    }\n    return { orphaned: [] };\n  }\n\n  // ==========================================================================\n  // start\n  // ==========================================================================\n\n  async start(\n    type: string,\n    input: unknown,\n    opts: StartOptions = {},\n    // BRIDGE-7: signature parity with Drizzle backend. The memory backend\n    // has no real transactions (its \"atomic\" boundary is a process-wide\n    // mutex acquired by the body below), so the parameter is intentionally\n    // ignored. Accepting it lets EventFlowService unit tests exercise the\n    // same code path without two stub orchestrators.\n    _tx?: unknown,\n  ): Promise<JobRun> {\n    // JOB-8 — resolve tenant gate outside the mutex so the error throws\n    // synchronously-ish from the caller's stack rather than via the mutex's\n    // deferred chain (matches Drizzle backend's pre-transaction guard).\n    const tenantId = this.resolveTenantId('start', opts.tenantId);\n\n    return this.mutex.run(async () => {\n      const payload = (input ?? {}) as Record<string, unknown>;\n      const definition = this.store.jobs.get(type);\n      if (!definition) throw new JobTypeNotFoundError(type);\n\n      // 1. Dedupe — return existing non-excluded run within the window.\n      if (definition.dedupeKeyTemplate && definition.dedupeWindowMs) {\n        const dedupeKey = evaluateKeyTemplate(\n          definition.dedupeKeyTemplate,\n          payload,\n        );\n        const windowStart = Date.now() - definition.dedupeWindowMs;\n        const existing = this.findDedupeCandidate(type, dedupeKey, windowStart);\n        if (existing) return existing;\n      }\n\n      // 2. Concurrency collision check.\n      let concurrencyKey: string | null = null;\n      let queueBlockedBy: string | null = null;\n      if (definition.concurrencyKeyTemplate) {\n        concurrencyKey = evaluateKeyTemplate(\n          definition.concurrencyKeyTemplate,\n          payload,\n        );\n        const incumbent = this.findInFlightByConcurrencyKey(concurrencyKey);\n        if (incumbent) {\n          switch (definition.collisionMode) {\n            case 'reject':\n              throw new JobCollisionError(type, concurrencyKey, incumbent);\n            case 'replace':\n              // Cancel incumbent (cascading children). Must happen inside\n              // the mutex — call the internal helper, not public `cancel()`\n              // (public `cancel` would re-enter the mutex and deadlock).\n              // Internal replace path sidesteps the tenant gate — it uses\n              // the incumbent's own tenant (same concurrency key implies\n              // same tenant in practice, but the gate is bypassed via\n              // `incumbent.tenantId` to avoid accidental cross-tenant\n              // MissingTenantIdError bubbling from the user's `start` call).\n              this.cancelLocked(\n                incumbent.id,\n                { cascade: true, reason: 'replaced' },\n                incumbent.tenantId,\n              );\n              break;\n            case 'queue':\n              queueBlockedBy = incumbent.id;\n              break;\n          }\n        }\n      }\n\n      // 3. Resolve lineage.\n      const newId = randomUUID();\n      let rootRunId: string = newId;\n      if (opts.parentRunId) {\n        const parent = this.store.runs.get(opts.parentRunId);\n        if (!parent) {\n          throw new Error(\n            `parentRunId ${opts.parentRunId} does not reference an existing job_run`,\n          );\n        }\n        rootRunId = parent.rootRunId;\n      }\n\n      // 4. Compute dedupe key for the persisted row (separate from dedupe\n      //    short-circuit above — we store it even when no prior run matched\n      //    so future dedupe checks see it).\n      const dedupeKey = definition.dedupeKeyTemplate\n        ? evaluateKeyTemplate(definition.dedupeKeyTemplate, payload)\n        : null;\n\n      const now = new Date();\n      const runAt = queueBlockedBy\n        ? QUEUED_RUN_AT\n        : (opts.runAt ?? now);\n\n      const row: JobRunRow = {\n        id: newId,\n        jobType: type,\n        jobVersion: definition.version,\n        parentRunId: opts.parentRunId ?? null,\n        rootRunId,\n        parentClosePolicy: opts.parentClosePolicy ?? 'terminate',\n        scopeEntityType: opts.scope?.entityType ?? null,\n        scopeEntityId: opts.scope?.entityId ?? null,\n        tenantId,\n        tags: opts.tags ?? {},\n        pool: opts.pool ?? definition.pool,\n        priority: opts.priority ?? definition.priorityDefault,\n        concurrencyKey,\n        dedupeKey,\n        status: 'pending',\n        input: payload,\n        output: null,\n        error: null,\n        triggerSource: opts.triggerSource ?? 'manual',\n        triggerRef: opts.triggerRef ?? null,\n        runAt,\n        startedAt: null,\n        finishedAt: null,\n        claimedAt: null,\n        attempts: 0,\n        waitKind: null,\n        resumeToken: null,\n        waitDeadline: null,\n        createdAt: now,\n        updatedAt: now,\n      };\n\n      this.store.runs.set(newId, row);\n      if (queueBlockedBy) {\n        const list = this.queueBlockers.get(queueBlockedBy) ?? [];\n        list.push(newId);\n        this.queueBlockers.set(queueBlockedBy, list);\n      }\n      return row;\n    });\n  }\n\n  // ==========================================================================\n  // cancel\n  // ==========================================================================\n\n  async cancel(runId: string, opts: CancelOptions = {}): Promise<void> {\n    // JOB-8 — strict tenant gate outside the mutex (matches Drizzle path).\n    const tenantId = this.resolveTenantId('cancel', opts.tenantId);\n    await this.mutex.run(async () => {\n      this.cancelLocked(runId, opts, tenantId);\n    });\n  }\n\n  /**\n   * Internal cancel that assumes the caller already holds the mutex.\n   * Synchronous because all store ops are in-memory. Idempotent.\n   *\n   * `tenantForGate` is the already-validated tenant id (or `null`). When\n   * non-null it gates the initial cancellation to that tenant's run; the\n   * cascade step then sweeps descendants on the same `rootRunId` without\n   * re-checking — children of a tenant-gated parent always share the\n   * tenant (enforced at `start` time).\n   */\n  private cancelLocked(\n    runId: string,\n    opts: CancelOptions,\n    tenantForGate: string | null,\n  ): void {\n    const run = this.store.runs.get(runId);\n    if (!run) return;\n    // JOB-8 — cross-tenant cancel is silent no-op.\n    if (this.multiTenant && run.tenantId !== tenantForGate) return;\n    if (isTerminal(run.status)) return;\n\n    const now = new Date();\n\n    // Collect descendants up front so Cancel-policy parents can wait on\n    // children (their `finished_at` is set after children transition).\n    const descendants =\n      opts.cascade === false\n        ? []\n        : Array.from(this.store.runs.values()).filter(\n            (r) =>\n              r.rootRunId === run.rootRunId &&\n              r.id !== runId &&\n              !isTerminal(r.status),\n          );\n\n    // Group by policy stored on the child.\n    const terminateChildren = descendants.filter(\n      (d) => d.parentClosePolicy === ParentClosePolicy.Terminate,\n    );\n    const cancelChildren = descendants.filter(\n      (d) => d.parentClosePolicy === ParentClosePolicy.Cancel,\n    );\n    // 'abandon' → do nothing.\n\n    // Terminate policy: cancel children, then parent.\n    for (const child of terminateChildren) {\n      this.transitionToCanceled(child.id, now);\n    }\n\n    // Cancel policy: cancel children first, then parent (so parent's\n    // finished_at is set only after children transitioned).\n    for (const child of cancelChildren) {\n      this.transitionToCanceled(child.id, now);\n    }\n\n    this.transitionToCanceled(runId, now);\n\n    void opts.reason; // reserved for future audit logging\n  }\n\n  private transitionToCanceled(runId: string, at: Date): void {\n    const run = this.store.runs.get(runId);\n    if (!run) return;\n    if (isTerminal(run.status)) return;\n    const next: JobRunRow = {\n      ...run,\n      status: 'canceled',\n      finishedAt: at,\n      updatedAt: at,\n    };\n    this.store.runs.set(runId, next);\n    this.unblockQueuedDependents(runId);\n  }\n\n  /**\n   * When `runId` transitions to a terminal state, advance every dependent\n   * `queue`-blocked run's `run_at` back to `now()` so `claimNext` picks\n   * them up.\n   */\n  private unblockQueuedDependents(runId: string): void {\n    const dependents = this.queueBlockers.get(runId);\n    if (!dependents || dependents.length === 0) return;\n    const now = new Date();\n    for (const dep of dependents) {\n      const depRun = this.store.runs.get(dep);\n      if (!depRun) continue;\n      if (depRun.status !== 'pending') continue;\n      this.store.runs.set(dep, { ...depRun, runAt: now, updatedAt: now });\n    }\n    this.queueBlockers.delete(runId);\n  }\n\n  // ==========================================================================\n  // claimNext — consumed by JobWorker in memory mode (tests exercise directly)\n  // ==========================================================================\n\n  async claimNext(pool: string): Promise<JobRunRow | null> {\n    return this.mutex.run(async () => {\n      const now = Date.now();\n      const candidates = Array.from(this.store.runs.values()).filter(\n        (r) =>\n          r.status === 'pending' &&\n          r.pool === pool &&\n          r.runAt.getTime() <= now,\n      );\n      if (candidates.length === 0) return null;\n\n      // ORDER BY priority DESC, run_at ASC (Drizzle parity).\n      candidates.sort((a, b) => {\n        if (a.priority !== b.priority) return b.priority - a.priority;\n        return a.runAt.getTime() - b.runAt.getTime();\n      });\n\n      const winner = candidates[0]!;\n      const claimedAt = new Date();\n      const next: JobRunRow = {\n        ...winner,\n        status: 'running',\n        claimedAt,\n        startedAt: claimedAt,\n        updatedAt: claimedAt,\n      };\n      this.store.runs.set(winner.id, next);\n      return next;\n    });\n  }\n\n  // ==========================================================================\n  // replay\n  // ==========================================================================\n\n  async replay(runId: string): Promise<JobRun> {\n    return this.mutex.run(async () => {\n      const run = this.store.runs.get(runId);\n      if (!run) throw new Error(`replay: run ${runId} not found`);\n      if (!isTerminal(run.status)) {\n        throw new JobNotReplayableError(runId, run.status);\n      }\n      const def = this.store.jobs.get(run.jobType);\n      if (!def) throw new JobTypeNotFoundError(run.jobType);\n\n      const mode = def.replayFrom;\n      if (mode === 'scratch') {\n        this.stepService.clearStepsForRun(runId);\n      } else {\n        // `last_step` and `last_checkpoint` collapse to the same semantic\n        // in Phase 1 — delete non-completed rows, preserve memoized ones.\n        // Matches the Drizzle backend exactly (see JOB-3 notes).\n        this.stepService.clearIncompleteSteps(runId);\n      }\n\n      const now = new Date();\n      const next: JobRunRow = {\n        ...run,\n        status: 'pending',\n        attempts: 0,\n        runAt: now,\n        startedAt: null,\n        finishedAt: null,\n        claimedAt: null,\n        error: null,\n        output: null,\n        updatedAt: now,\n      };\n      this.store.runs.set(runId, next);\n      return next;\n    });\n  }\n\n  // ==========================================================================\n  // tick — used by unit tests + memory-mode JobWorker\n  // ==========================================================================\n\n  /**\n   * Execute a single claimed run to completion, retry, or failure. Not on\n   * `IJobOrchestrator` — it's the memory equivalent of the Drizzle\n   * `JobWorker.processRun` code path. The unit tests drive it directly so\n   * they can assert memoization across ticks without spinning up a worker.\n   */\n  async tick(runId: string): Promise<void> {\n    // We load state outside the mutex because handler execution cannot\n    // hold the serialisation lock — `fn()` inside `ctx.step` can call back\n    // into `start` / `spawnChild` which would deadlock. Mutation points\n    // (recordStep, status transition) go through the services or the\n    // orchestrator entry points and re-enter the mutex there.\n    const run = this.store.runs.get(runId);\n    if (!run) throw new Error(`tick: run ${runId} not found`);\n    if (run.status !== 'running') {\n      throw new Error(\n        `tick: run ${runId} must be 'running' (got '${run.status}')`,\n      );\n    }\n\n    const registration = this.handlerRegistry.get(run.jobType);\n    if (!registration) {\n      await this.markFailed(run, new Error(\n        `No handler registered for jobType='${run.jobType}'`,\n      ), (run.attempts ?? 0) + 1);\n      return;\n    }\n    const meta = registration.meta;\n    const HandlerClass = registration.handlerClass;\n    // Match the Drizzle backend: resolve the handler through Nest's\n    // ModuleRef so `@Inject` constructor params work. ModuleRef is\n    // @Optional() — zero-dep test stubs that construct this orchestrator\n    // manually still hit the legacy `new HandlerClass()` path.\n    // `get({ strict: false })` (not `create()`) — the handler must be a\n    // provider in its owning module so cross-module @Inject dependencies\n    // resolve. See job-worker.ts for the full rationale.\n    const handler = this.moduleRef\n      ? (this.moduleRef.get(\n          HandlerClass as unknown as new (...args: unknown[]) => unknown,\n          { strict: false },\n        ) as JobHandlerBase<unknown>)\n      : new HandlerClass();\n\n    const ctx: JobContext<unknown> = {\n      input: run.input,\n      run: run as JobRun,\n      step: this.makeStepFn(run),\n      spawnChild: this.makeSpawnFn(run),\n      logger: new Logger(`JobRun:${run.id}`),\n    };\n\n    const attemptsBefore = run.attempts ?? 0;\n    try {\n      const output = (await handler.run(ctx)) as Record<string, unknown> | undefined;\n      await this.markCompleted(run, output ?? {}, attemptsBefore + 1);\n    } catch (err) {\n      const policy = meta.retry;\n      const decision = classifyError(err, policy, attemptsBefore);\n      const nextAttempts = attemptsBefore + 1;\n      if (decision === 'retry' && policy) {\n        const delay = computeBackoff(policy, nextAttempts);\n        await this.rescheduleForRetry(run, err, nextAttempts, delay);\n      } else {\n        await this.markFailed(run, err, nextAttempts);\n      }\n    }\n  }\n\n  private makeStepFn(run: JobRunRow) {\n    return async <TOutput>(\n      stepId: string,\n      fn: () => Promise<TOutput>,\n      _opts?: StepOptions,\n    ): Promise<TOutput> => {\n      void _opts;\n      const existing = await this.stepService.findStep(run.id, stepId);\n      if (existing?.status === 'completed') {\n        return existing.output as TOutput;\n      }\n      const seq = this.nextStepSeq(run.id);\n      const startedAt = new Date();\n      const nextAttempts = (existing?.attempts ?? 0) + 1;\n      await this.stepService.recordStep({\n        jobRunId: run.id,\n        stepId,\n        kind: 'task',\n        seq,\n        status: 'running',\n        startedAt,\n        attempts: nextAttempts,\n      });\n      try {\n        const output = await fn();\n        await this.stepService.recordStep({\n          jobRunId: run.id,\n          stepId,\n          kind: 'task',\n          seq,\n          status: 'completed',\n          output: output as Record<string, unknown> | undefined,\n          finishedAt: new Date(),\n          attempts: nextAttempts,\n        });\n        return output;\n      } catch (err) {\n        await this.stepService.recordStep({\n          jobRunId: run.id,\n          stepId,\n          kind: 'task',\n          seq,\n          status: 'failed',\n          error: serialiseError(err, nextAttempts, false),\n          finishedAt: new Date(),\n          attempts: nextAttempts,\n        });\n        throw err;\n      }\n    };\n  }\n\n  private makeSpawnFn(run: JobRunRow) {\n    return async (\n      type: string,\n      input: unknown,\n      opts?: SpawnChildOptions,\n    ): Promise<JobRun> => {\n      return this.start(type, input, {\n        parentRunId: run.id,\n        parentClosePolicy: opts?.closePolicy,\n        runAt: opts?.runAt,\n        priority: opts?.priority,\n        tags: opts?.tags,\n        triggerSource: 'parent',\n        triggerRef: run.id,\n      });\n    };\n  }\n\n  private nextStepSeq(runId: string): number {\n    const rows = this.store.steps.get(runId);\n    if (!rows || rows.length === 0) return 1;\n    let max = 0;\n    for (const r of rows) if (r.seq > max) max = r.seq;\n    return max + 1;\n  }\n\n  private async markCompleted(\n    run: JobRunRow,\n    output: Record<string, unknown>,\n    attempts: number,\n  ): Promise<void> {\n    await this.mutex.run(async () => {\n      const current = this.store.runs.get(run.id);\n      if (!current || isTerminal(current.status)) return;\n      const now = new Date();\n      this.store.runs.set(run.id, {\n        ...current,\n        status: 'completed',\n        output,\n        finishedAt: now,\n        updatedAt: now,\n        attempts,\n      });\n      this.unblockQueuedDependents(run.id);\n    });\n  }\n\n  private async markFailed(\n    run: JobRunRow,\n    err: unknown,\n    attempts: number,\n  ): Promise<void> {\n    await this.mutex.run(async () => {\n      const current = this.store.runs.get(run.id);\n      if (!current || isTerminal(current.status)) return;\n      const now = new Date();\n      this.store.runs.set(run.id, {\n        ...current,\n        status: 'failed',\n        finishedAt: now,\n        updatedAt: now,\n        attempts,\n        error: serialiseError(err, attempts, false),\n      });\n      this.unblockQueuedDependents(run.id);\n    });\n\n    // parent_close_policy = 'terminate' cascade mirrors the Drizzle worker\n    // (cancel runs outside its own terminal transition). We pass the run's\n    // own `tenantId` so the cancel passes the multi-tenant gate — this is\n    // system-internal cascade, not a user-initiated call.\n    if (run.parentClosePolicy === 'terminate') {\n      try {\n        await this.cancel(run.id, {\n          cascade: true,\n          reason: 'parent-failed',\n          tenantId: run.tenantId,\n        });\n      } catch (cascadeErr) {\n        this.logger.warn(\n          `cascade on failed run ${run.id}: ${(cascadeErr as Error).message}`,\n        );\n      }\n    }\n  }\n\n  private async rescheduleForRetry(\n    run: JobRunRow,\n    err: unknown,\n    attempts: number,\n    delayMs: number,\n  ): Promise<void> {\n    await this.mutex.run(async () => {\n      const current = this.store.runs.get(run.id);\n      if (!current || isTerminal(current.status)) return;\n      const now = new Date();\n      this.store.runs.set(run.id, {\n        ...current,\n        status: 'pending',\n        attempts,\n        runAt: new Date(Date.now() + delayMs),\n        startedAt: null,\n        claimedAt: null,\n        updatedAt: now,\n        error: serialiseError(err, attempts, true),\n      });\n    });\n  }\n\n  // ==========================================================================\n  // Internal queries — used by start / cancel\n  // ==========================================================================\n\n  private findDedupeCandidate(\n    jobType: string,\n    dedupeKey: string,\n    windowStartMs: number,\n  ): JobRunRow | null {\n    let best: JobRunRow | null = null;\n    for (const r of this.store.runs.values()) {\n      if (r.jobType !== jobType) continue;\n      if (r.dedupeKey !== dedupeKey) continue;\n      if (DEDUPE_EXCLUDED_STATUSES.includes(r.status)) continue;\n      if (r.createdAt.getTime() <= windowStartMs) continue;\n      if (!best || r.createdAt.getTime() > best.createdAt.getTime()) {\n        best = r;\n      }\n    }\n    return best;\n  }\n\n  private findInFlightByConcurrencyKey(key: string): JobRunRow | null {\n    for (const r of this.store.runs.values()) {\n      if (r.concurrencyKey !== key) continue;\n      if (!IN_FLIGHT_STATUSES.includes(r.status)) continue;\n      return r;\n    }\n    return null;\n  }\n}\n\n// ─── Pure helpers (mirrored from JobWorker so memory mode is standalone) ────\n\nfunction classifyError(\n  err: unknown,\n  policy: RetryPolicy | undefined,\n  currentAttempts: number,\n): 'retry' | 'fail' {\n  if (!policy) return 'fail';\n  const errObj = err as { name?: string; code?: string } | undefined;\n  const name = errObj?.name;\n  const code = errObj?.code;\n  const nonRetryable = policy.nonRetryableErrors ?? [];\n  if (nonRetryable.some((n) => n === name || n === code)) return 'fail';\n  if (currentAttempts + 1 >= policy.attempts) return 'fail';\n  return 'retry';\n}\n\nfunction computeBackoff(policy: RetryPolicy, attempts: number): number {\n  const base = Math.max(policy.baseMs, 0);\n  if (policy.backoff === 'fixed') return base;\n  const exponent = Math.max(attempts - 1, 0);\n  if (exponent >= 53) return Number.MAX_SAFE_INTEGER;\n  const raw = base * Math.pow(2, exponent);\n  if (!Number.isFinite(raw) || raw >= Number.MAX_SAFE_INTEGER) {\n    return Number.MAX_SAFE_INTEGER;\n  }\n  return raw;\n}\n\nfunction serialiseError(err: unknown, attempt: number, retryable: boolean) {\n  const e = err as { message?: string; stack?: string } | undefined;\n  return {\n    message: (e?.message ?? String(err)) as string,\n    stack: e?.stack,\n    retryable,\n    attempt,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAeA,SAAS,kBAAkB;AAC3B,SAAS,QAAQ,YAAY,QAAQ,gBAAgB;AACrD,SAAS,iBAAiB;AAuC1B,IAAM,gBAAgB,oBAAI,KAAK,MAAqB;AACpD,IAAM,oBAA2C;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,2BAAkD,CAAC,YAAY,QAAQ;AAC7E,IAAM,qBAA4C,CAAC,WAAW,SAAS;AAEvE,SAAS,WAAW,QAAsC;AACxD,SAAO,kBAAkB,SAAS,MAAM;AAC1C;AAOA,SAAS,oBACP,UACA,OACQ;AACR,SAAO,SAAS;AAAA,IACd;AAAA,IACA,CAAC,IAAI,UAAkB;AACrB,YAAM,QAAQ,MAAM,KAAK;AACzB,UAAI,UAAU,UAAa,UAAU,MAAM;AACzC,cAAM,IAAI,6BAA6B,UAAU,KAAK;AAAA,MACxD;AACA,aAAO,OAAO,KAAK;AAAA,IACrB;AAAA,EACF;AACF;AAaA,IAAM,eAAN,MAAmB;AAAA,EACT,QAAuB,QAAQ,QAAQ;AAAA,EAE/C,MAAM,IAAO,IAAkC;AAC7C,UAAM,OAAO,KAAK,MAAM,KAAK,MAAM,GAAG,CAAC;AAGvC,SAAK,QAAQ,KAAK;AAAA,MAChB,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AACA,WAAO;AAAA,EACT;AACF;AAUO,IAAM,wBAAN,MAAwD;AAAA,EAa7D,YAM2C,OACM,aACH,aACI,WAChD;AAJyC;AACM;AACH;AACI;AAAA,EAC/C;AAAA,EAJwC;AAAA,EACM;AAAA,EACH;AAAA,EACI;AAAA,EArBjC,SAAS,IAAI,OAAO,sBAAsB,IAAI;AAAA,EAC9C,QAAQ,IAAI,aAAa;AAAA,EACzB,kBAAkB,oBAAI,IAAiC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQvD,gBAAgB,oBAAI,IAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBnD,gBACN,QACA,UACe;AACf,QAAI,CAAC,KAAK,YAAa,QAAO;AAC9B,QAAI,aAAa,OAAW,OAAM,IAAI,qBAAqB,MAAM;AACjE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,gBACE,MACA,MACA,cACM;AACN,UAAM,yBACH,KAAK,aAA8C,OAAO;AAC7D,UAAM,oBACH,KAAK,QAAyC,OAAO;AACxD,UAAM,iBAAiB,KAAK,QAAQ,YAAY;AAChD,UAAM,MAAM,oBAAI,KAAK;AAErB,UAAM,MAAwB;AAAA,MAC5B;AAAA,MACA,SAAS;AAAA,MACT,MAAM,KAAK,QAAQ;AAAA,MACnB,iBAAiB,KAAK,OAAO,UAAU;AAAA,MACvC,aAAa,KAAK,SAAS;AAAA,QACzB,UAAU;AAAA,QACV,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AAAA,MACA,WAAW,KAAK,aAAa;AAAA,MAC7B,wBACE,OAAO,2BAA2B,WAAW,yBAAyB;AAAA,MACxE,eACG,KAAK,aAAa,iBACnB;AAAA,MACF,mBACE,OAAO,sBAAsB,WAAW,oBAAoB;AAAA,MAC9D;AAAA,MACA,iBAAiB;AAAA,MACjB,YAAY,KAAK,cAAc;AAAA,MAC/B,WAAW;AAAA,MACX,WAAW;AAAA,IACb;AAEA,SAAK,MAAM,KAAK,IAAI,MAAM,GAAG;AAC7B,SAAK,gBAAgB,IAAI,MAAM;AAAA,MAC7B;AAAA,MACA;AAAA,MACA;AAAA,IAGF,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,uBAAuB,MAA+C;AACpE,WAAO,KAAK,gBAAgB,IAAI,IAAI;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,cACJ,SACA,YACiC;AACjC,SAAK;AACL,eAAW,SAAS,SAAS;AAC3B,WAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO,EAAE,UAAU,CAAC,EAAE;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MACJ,MACA,OACA,OAAqB,CAAC,GAMtB,KACiB;AAIjB,UAAM,WAAW,KAAK,gBAAgB,SAAS,KAAK,QAAQ;AAE5D,WAAO,KAAK,MAAM,IAAI,YAAY;AAChC,YAAM,UAAW,SAAS,CAAC;AAC3B,YAAM,aAAa,KAAK,MAAM,KAAK,IAAI,IAAI;AAC3C,UAAI,CAAC,WAAY,OAAM,IAAI,qBAAqB,IAAI;AAGpD,UAAI,WAAW,qBAAqB,WAAW,gBAAgB;AAC7D,cAAMA,aAAY;AAAA,UAChB,WAAW;AAAA,UACX;AAAA,QACF;AACA,cAAM,cAAc,KAAK,IAAI,IAAI,WAAW;AAC5C,cAAM,WAAW,KAAK,oBAAoB,MAAMA,YAAW,WAAW;AACtE,YAAI,SAAU,QAAO;AAAA,MACvB;AAGA,UAAI,iBAAgC;AACpC,UAAI,iBAAgC;AACpC,UAAI,WAAW,wBAAwB;AACrC,yBAAiB;AAAA,UACf,WAAW;AAAA,UACX;AAAA,QACF;AACA,cAAM,YAAY,KAAK,6BAA6B,cAAc;AAClE,YAAI,WAAW;AACb,kBAAQ,WAAW,eAAe;AAAA,YAChC,KAAK;AACH,oBAAM,IAAI,kBAAkB,MAAM,gBAAgB,SAAS;AAAA,YAC7D,KAAK;AASH,mBAAK;AAAA,gBACH,UAAU;AAAA,gBACV,EAAE,SAAS,MAAM,QAAQ,WAAW;AAAA,gBACpC,UAAU;AAAA,cACZ;AACA;AAAA,YACF,KAAK;AACH,+BAAiB,UAAU;AAC3B;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAGA,YAAM,QAAQ,WAAW;AACzB,UAAI,YAAoB;AACxB,UAAI,KAAK,aAAa;AACpB,cAAM,SAAS,KAAK,MAAM,KAAK,IAAI,KAAK,WAAW;AACnD,YAAI,CAAC,QAAQ;AACX,gBAAM,IAAI;AAAA,YACR,eAAe,KAAK,WAAW;AAAA,UACjC;AAAA,QACF;AACA,oBAAY,OAAO;AAAA,MACrB;AAKA,YAAM,YAAY,WAAW,oBACzB,oBAAoB,WAAW,mBAAmB,OAAO,IACzD;AAEJ,YAAM,MAAM,oBAAI,KAAK;AACrB,YAAM,QAAQ,iBACV,gBACC,KAAK,SAAS;AAEnB,YAAM,MAAiB;AAAA,QACrB,IAAI;AAAA,QACJ,SAAS;AAAA,QACT,YAAY,WAAW;AAAA,QACvB,aAAa,KAAK,eAAe;AAAA,QACjC;AAAA,QACA,mBAAmB,KAAK,qBAAqB;AAAA,QAC7C,iBAAiB,KAAK,OAAO,cAAc;AAAA,QAC3C,eAAe,KAAK,OAAO,YAAY;AAAA,QACvC;AAAA,QACA,MAAM,KAAK,QAAQ,CAAC;AAAA,QACpB,MAAM,KAAK,QAAQ,WAAW;AAAA,QAC9B,UAAU,KAAK,YAAY,WAAW;AAAA,QACtC;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,eAAe,KAAK,iBAAiB;AAAA,QACrC,YAAY,KAAK,cAAc;AAAA,QAC/B;AAAA,QACA,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,UAAU;AAAA,QACV,UAAU;AAAA,QACV,aAAa;AAAA,QACb,cAAc;AAAA,QACd,WAAW;AAAA,QACX,WAAW;AAAA,MACb;AAEA,WAAK,MAAM,KAAK,IAAI,OAAO,GAAG;AAC9B,UAAI,gBAAgB;AAClB,cAAM,OAAO,KAAK,cAAc,IAAI,cAAc,KAAK,CAAC;AACxD,aAAK,KAAK,KAAK;AACf,aAAK,cAAc,IAAI,gBAAgB,IAAI;AAAA,MAC7C;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAe,OAAsB,CAAC,GAAkB;AAEnE,UAAM,WAAW,KAAK,gBAAgB,UAAU,KAAK,QAAQ;AAC7D,UAAM,KAAK,MAAM,IAAI,YAAY;AAC/B,WAAK,aAAa,OAAO,MAAM,QAAQ;AAAA,IACzC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,aACN,OACA,MACA,eACM;AACN,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK;AACrC,QAAI,CAAC,IAAK;AAEV,QAAI,KAAK,eAAe,IAAI,aAAa,cAAe;AACxD,QAAI,WAAW,IAAI,MAAM,EAAG;AAE5B,UAAM,MAAM,oBAAI,KAAK;AAIrB,UAAM,cACJ,KAAK,YAAY,QACb,CAAC,IACD,MAAM,KAAK,KAAK,MAAM,KAAK,OAAO,CAAC,EAAE;AAAA,MACnC,CAAC,MACC,EAAE,cAAc,IAAI,aACpB,EAAE,OAAO,SACT,CAAC,WAAW,EAAE,MAAM;AAAA,IACxB;AAGN,UAAM,oBAAoB,YAAY;AAAA,MACpC,CAAC,MAAM,EAAE;AAAA,IACX;AACA,UAAM,iBAAiB,YAAY;AAAA,MACjC,CAAC,MAAM,EAAE;AAAA,IACX;AAIA,eAAW,SAAS,mBAAmB;AACrC,WAAK,qBAAqB,MAAM,IAAI,GAAG;AAAA,IACzC;AAIA,eAAW,SAAS,gBAAgB;AAClC,WAAK,qBAAqB,MAAM,IAAI,GAAG;AAAA,IACzC;AAEA,SAAK,qBAAqB,OAAO,GAAG;AAEpC,SAAK,KAAK;AAAA,EACZ;AAAA,EAEQ,qBAAqB,OAAe,IAAgB;AAC1D,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK;AACrC,QAAI,CAAC,IAAK;AACV,QAAI,WAAW,IAAI,MAAM,EAAG;AAC5B,UAAM,OAAkB;AAAA,MACtB,GAAG;AAAA,MACH,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,WAAW;AAAA,IACb;AACA,SAAK,MAAM,KAAK,IAAI,OAAO,IAAI;AAC/B,SAAK,wBAAwB,KAAK;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,wBAAwB,OAAqB;AACnD,UAAM,aAAa,KAAK,cAAc,IAAI,KAAK;AAC/C,QAAI,CAAC,cAAc,WAAW,WAAW,EAAG;AAC5C,UAAM,MAAM,oBAAI,KAAK;AACrB,eAAW,OAAO,YAAY;AAC5B,YAAM,SAAS,KAAK,MAAM,KAAK,IAAI,GAAG;AACtC,UAAI,CAAC,OAAQ;AACb,UAAI,OAAO,WAAW,UAAW;AACjC,WAAK,MAAM,KAAK,IAAI,KAAK,EAAE,GAAG,QAAQ,OAAO,KAAK,WAAW,IAAI,CAAC;AAAA,IACpE;AACA,SAAK,cAAc,OAAO,KAAK;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,MAAyC;AACvD,WAAO,KAAK,MAAM,IAAI,YAAY;AAChC,YAAM,MAAM,KAAK,IAAI;AACrB,YAAM,aAAa,MAAM,KAAK,KAAK,MAAM,KAAK,OAAO,CAAC,EAAE;AAAA,QACtD,CAAC,MACC,EAAE,WAAW,aACb,EAAE,SAAS,QACX,EAAE,MAAM,QAAQ,KAAK;AAAA,MACzB;AACA,UAAI,WAAW,WAAW,EAAG,QAAO;AAGpC,iBAAW,KAAK,CAAC,GAAG,MAAM;AACxB,YAAI,EAAE,aAAa,EAAE,SAAU,QAAO,EAAE,WAAW,EAAE;AACrD,eAAO,EAAE,MAAM,QAAQ,IAAI,EAAE,MAAM,QAAQ;AAAA,MAC7C,CAAC;AAED,YAAM,SAAS,WAAW,CAAC;AAC3B,YAAM,YAAY,oBAAI,KAAK;AAC3B,YAAM,OAAkB;AAAA,QACtB,GAAG;AAAA,QACH,QAAQ;AAAA,QACR;AAAA,QACA,WAAW;AAAA,QACX,WAAW;AAAA,MACb;AACA,WAAK,MAAM,KAAK,IAAI,OAAO,IAAI,IAAI;AACnC,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAgC;AAC3C,WAAO,KAAK,MAAM,IAAI,YAAY;AAChC,YAAM,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK;AACrC,UAAI,CAAC,IAAK,OAAM,IAAI,MAAM,eAAe,KAAK,YAAY;AAC1D,UAAI,CAAC,WAAW,IAAI,MAAM,GAAG;AAC3B,cAAM,IAAI,sBAAsB,OAAO,IAAI,MAAM;AAAA,MACnD;AACA,YAAM,MAAM,KAAK,MAAM,KAAK,IAAI,IAAI,OAAO;AAC3C,UAAI,CAAC,IAAK,OAAM,IAAI,qBAAqB,IAAI,OAAO;AAEpD,YAAM,OAAO,IAAI;AACjB,UAAI,SAAS,WAAW;AACtB,aAAK,YAAY,iBAAiB,KAAK;AAAA,MACzC,OAAO;AAIL,aAAK,YAAY,qBAAqB,KAAK;AAAA,MAC7C;AAEA,YAAM,MAAM,oBAAI,KAAK;AACrB,YAAM,OAAkB;AAAA,QACtB,GAAG;AAAA,QACH,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,OAAO;AAAA,QACP,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,WAAW;AAAA,MACb;AACA,WAAK,MAAM,KAAK,IAAI,OAAO,IAAI;AAC/B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,KAAK,OAA8B;AAMvC,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK;AACrC,QAAI,CAAC,IAAK,OAAM,IAAI,MAAM,aAAa,KAAK,YAAY;AACxD,QAAI,IAAI,WAAW,WAAW;AAC5B,YAAM,IAAI;AAAA,QACR,aAAa,KAAK,4BAA4B,IAAI,MAAM;AAAA,MAC1D;AAAA,IACF;AAEA,UAAM,eAAe,KAAK,gBAAgB,IAAI,IAAI,OAAO;AACzD,QAAI,CAAC,cAAc;AACjB,YAAM,KAAK,WAAW,KAAK,IAAI;AAAA,QAC7B,sCAAsC,IAAI,OAAO;AAAA,MACnD,IAAI,IAAI,YAAY,KAAK,CAAC;AAC1B;AAAA,IACF;AACA,UAAM,OAAO,aAAa;AAC1B,UAAM,eAAe,aAAa;AAQlC,UAAM,UAAU,KAAK,YAChB,KAAK,UAAU;AAAA,MACd;AAAA,MACA,EAAE,QAAQ,MAAM;AAAA,IAClB,IACA,IAAI,aAAa;AAErB,UAAM,MAA2B;AAAA,MAC/B,OAAO,IAAI;AAAA,MACX;AAAA,MACA,MAAM,KAAK,WAAW,GAAG;AAAA,MACzB,YAAY,KAAK,YAAY,GAAG;AAAA,MAChC,QAAQ,IAAI,OAAO,UAAU,IAAI,EAAE,EAAE;AAAA,IACvC;AAEA,UAAM,iBAAiB,IAAI,YAAY;AACvC,QAAI;AACF,YAAM,SAAU,MAAM,QAAQ,IAAI,GAAG;AACrC,YAAM,KAAK,cAAc,KAAK,UAAU,CAAC,GAAG,iBAAiB,CAAC;AAAA,IAChE,SAAS,KAAK;AACZ,YAAM,SAAS,KAAK;AACpB,YAAM,WAAW,cAAc,KAAK,QAAQ,cAAc;AAC1D,YAAM,eAAe,iBAAiB;AACtC,UAAI,aAAa,WAAW,QAAQ;AAClC,cAAM,QAAQ,eAAe,QAAQ,YAAY;AACjD,cAAM,KAAK,mBAAmB,KAAK,KAAK,cAAc,KAAK;AAAA,MAC7D,OAAO;AACL,cAAM,KAAK,WAAW,KAAK,KAAK,YAAY;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,WAAW,KAAgB;AACjC,WAAO,OACL,QACA,IACA,UACqB;AACrB,WAAK;AACL,YAAM,WAAW,MAAM,KAAK,YAAY,SAAS,IAAI,IAAI,MAAM;AAC/D,UAAI,UAAU,WAAW,aAAa;AACpC,eAAO,SAAS;AAAA,MAClB;AACA,YAAM,MAAM,KAAK,YAAY,IAAI,EAAE;AACnC,YAAM,YAAY,oBAAI,KAAK;AAC3B,YAAM,gBAAgB,UAAU,YAAY,KAAK;AACjD,YAAM,KAAK,YAAY,WAAW;AAAA,QAChC,UAAU,IAAI;AAAA,QACd;AAAA,QACA,MAAM;AAAA,QACN;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,QACA,UAAU;AAAA,MACZ,CAAC;AACD,UAAI;AACF,cAAM,SAAS,MAAM,GAAG;AACxB,cAAM,KAAK,YAAY,WAAW;AAAA,UAChC,UAAU,IAAI;AAAA,UACd;AAAA,UACA,MAAM;AAAA,UACN;AAAA,UACA,QAAQ;AAAA,UACR;AAAA,UACA,YAAY,oBAAI,KAAK;AAAA,UACrB,UAAU;AAAA,QACZ,CAAC;AACD,eAAO;AAAA,MACT,SAAS,KAAK;AACZ,cAAM,KAAK,YAAY,WAAW;AAAA,UAChC,UAAU,IAAI;AAAA,UACd;AAAA,UACA,MAAM;AAAA,UACN;AAAA,UACA,QAAQ;AAAA,UACR,OAAO,eAAe,KAAK,cAAc,KAAK;AAAA,UAC9C,YAAY,oBAAI,KAAK;AAAA,UACrB,UAAU;AAAA,QACZ,CAAC;AACD,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,YAAY,KAAgB;AAClC,WAAO,OACL,MACA,OACA,SACoB;AACpB,aAAO,KAAK,MAAM,MAAM,OAAO;AAAA,QAC7B,aAAa,IAAI;AAAA,QACjB,mBAAmB,MAAM;AAAA,QACzB,OAAO,MAAM;AAAA,QACb,UAAU,MAAM;AAAA,QAChB,MAAM,MAAM;AAAA,QACZ,eAAe;AAAA,QACf,YAAY,IAAI;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEQ,YAAY,OAAuB;AACzC,UAAM,OAAO,KAAK,MAAM,MAAM,IAAI,KAAK;AACvC,QAAI,CAAC,QAAQ,KAAK,WAAW,EAAG,QAAO;AACvC,QAAI,MAAM;AACV,eAAW,KAAK,KAAM,KAAI,EAAE,MAAM,IAAK,OAAM,EAAE;AAC/C,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,MAAc,cACZ,KACA,QACA,UACe;AACf,UAAM,KAAK,MAAM,IAAI,YAAY;AAC/B,YAAM,UAAU,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;AAC1C,UAAI,CAAC,WAAW,WAAW,QAAQ,MAAM,EAAG;AAC5C,YAAM,MAAM,oBAAI,KAAK;AACrB,WAAK,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,QAC1B,GAAG;AAAA,QACH,QAAQ;AAAA,QACR;AAAA,QACA,YAAY;AAAA,QACZ,WAAW;AAAA,QACX;AAAA,MACF,CAAC;AACD,WAAK,wBAAwB,IAAI,EAAE;AAAA,IACrC,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,WACZ,KACA,KACA,UACe;AACf,UAAM,KAAK,MAAM,IAAI,YAAY;AAC/B,YAAM,UAAU,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;AAC1C,UAAI,CAAC,WAAW,WAAW,QAAQ,MAAM,EAAG;AAC5C,YAAM,MAAM,oBAAI,KAAK;AACrB,WAAK,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,QAC1B,GAAG;AAAA,QACH,QAAQ;AAAA,QACR,YAAY;AAAA,QACZ,WAAW;AAAA,QACX;AAAA,QACA,OAAO,eAAe,KAAK,UAAU,KAAK;AAAA,MAC5C,CAAC;AACD,WAAK,wBAAwB,IAAI,EAAE;AAAA,IACrC,CAAC;AAMD,QAAI,IAAI,sBAAsB,aAAa;AACzC,UAAI;AACF,cAAM,KAAK,OAAO,IAAI,IAAI;AAAA,UACxB,SAAS;AAAA,UACT,QAAQ;AAAA,UACR,UAAU,IAAI;AAAA,QAChB,CAAC;AAAA,MACH,SAAS,YAAY;AACnB,aAAK,OAAO;AAAA,UACV,yBAAyB,IAAI,EAAE,KAAM,WAAqB,OAAO;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,mBACZ,KACA,KACA,UACA,SACe;AACf,UAAM,KAAK,MAAM,IAAI,YAAY;AAC/B,YAAM,UAAU,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;AAC1C,UAAI,CAAC,WAAW,WAAW,QAAQ,MAAM,EAAG;AAC5C,YAAM,MAAM,oBAAI,KAAK;AACrB,WAAK,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,QAC1B,GAAG;AAAA,QACH,QAAQ;AAAA,QACR;AAAA,QACA,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO;AAAA,QACpC,WAAW;AAAA,QACX,WAAW;AAAA,QACX,WAAW;AAAA,QACX,OAAO,eAAe,KAAK,UAAU,IAAI;AAAA,MAC3C,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAMQ,oBACN,SACA,WACA,eACkB;AAClB,QAAI,OAAyB;AAC7B,eAAW,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC,UAAI,EAAE,YAAY,QAAS;AAC3B,UAAI,EAAE,cAAc,UAAW;AAC/B,UAAI,yBAAyB,SAAS,EAAE,MAAM,EAAG;AACjD,UAAI,EAAE,UAAU,QAAQ,KAAK,cAAe;AAC5C,UAAI,CAAC,QAAQ,EAAE,UAAU,QAAQ,IAAI,KAAK,UAAU,QAAQ,GAAG;AAC7D,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,6BAA6B,KAA+B;AAClE,eAAW,KAAK,KAAK,MAAM,KAAK,OAAO,GAAG;AACxC,UAAI,EAAE,mBAAmB,IAAK;AAC9B,UAAI,CAAC,mBAAmB,SAAS,EAAE,MAAM,EAAG;AAC5C,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAhsBa,wBAAN;AAAA,EADN,WAAW;AAAA,EAoBP,0BAAO,cAAc;AAAA,EACrB,0BAAO,oBAAoB;AAAA,EAC3B,0BAAO,iBAAiB;AAAA,EACxB,4BAAS;AAAA,EAAG,0BAAO,SAAS;AAAA,GAtBpB;AAosBb,SAAS,cACP,KACA,QACA,iBACkB;AAClB,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,SAAS;AACf,QAAM,OAAO,QAAQ;AACrB,QAAM,OAAO,QAAQ;AACrB,QAAM,eAAe,OAAO,sBAAsB,CAAC;AACnD,MAAI,aAAa,KAAK,CAAC,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAG,QAAO;AAC/D,MAAI,kBAAkB,KAAK,OAAO,SAAU,QAAO;AACnD,SAAO;AACT;AAEA,SAAS,eAAe,QAAqB,UAA0B;AACrE,QAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,CAAC;AACtC,MAAI,OAAO,YAAY,QAAS,QAAO;AACvC,QAAM,WAAW,KAAK,IAAI,WAAW,GAAG,CAAC;AACzC,MAAI,YAAY,GAAI,QAAO,OAAO;AAClC,QAAM,MAAM,OAAO,KAAK,IAAI,GAAG,QAAQ;AACvC,MAAI,CAAC,OAAO,SAAS,GAAG,KAAK,OAAO,OAAO,kBAAkB;AAC3D,WAAO,OAAO;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAc,SAAiB,WAAoB;AACzE,QAAM,IAAI;AACV,SAAO;AAAA,IACL,SAAU,GAAG,WAAW,OAAO,GAAG;AAAA,IAClC,OAAO,GAAG;AAAA,IACV;AAAA,IACA;AAAA,EACF;AACF;","names":["dedupeKey"]}

package/dist/chunk-5A432NZJ.js

@@ -0,0 +1,7 @@
+// runtime/subsystems/bridge/generated/registry.ts
+var bridgeRegistry = {};
+
+export {
+  bridgeRegistry
+};
+//# sourceMappingURL=chunk-5A432NZJ.js.map

package/dist/chunk-5A432NZJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/bridge/generated/registry.ts"],"sourcesContent":["// AUTO-GENERATED by @pattern-stack/codegen. Do not edit.\n// Run `codegen entity new --all` to refresh.\n\nimport type { BridgeRegistry } from '../bridge.protocol';\n\nexport const bridgeRegistry: BridgeRegistry = {};\n"],"mappings":";AAKO,IAAM,iBAAiC,CAAC;","names":[]}

package/dist/chunk-5Y7W3XR6.js

@@ -0,0 +1,356 @@
+import {
+  JobCollisionError,
+  JobNotReplayableError,
+  JobTemplateFieldMissingError,
+  JobTypeNotFoundError,
+  MissingTenantIdError
+} from "./chunk-T4BIIU5E.js";
+import {
+  JOBS_MULTI_TENANT
+} from "./chunk-BIO6F7YI.js";
+import {
+  jobRuns,
+  jobSteps,
+  jobs
+} from "./chunk-OKXZ63IA.js";
+import {
+  DRIZZLE
+} from "./chunk-U64T4YZE.js";
+import {
+  __decorateClass,
+  __decorateParam
+} from "./chunk-2E224ZSN.js";
+
+// runtime/subsystems/jobs/job-orchestrator.drizzle-backend.ts
+import { randomUUID } from "crypto";
+import { Inject, Injectable, Logger } from "@nestjs/common";
+import { and, desc, eq, gt, inArray, isNotNull, ne, notInArray, sql } from "drizzle-orm";
+var TERMINAL_STATUSES = [
+  "completed",
+  "failed",
+  "timed_out",
+  "canceled"
+];
+var DEDUPE_EXCLUDED_STATUSES = ["canceled", "failed"];
+var IN_FLIGHT_STATUSES = ["pending", "running"];
+function evaluateKeyTemplate(template, input) {
+  return template.replace(/\{\{\s*([a-zA-Z0-9_]+)\s*\}\}/g, (_match, field) => {
+    const value = input[field];
+    if (value === void 0 || value === null) {
+      throw new JobTemplateFieldMissingError(template, field);
+    }
+    return String(value);
+  });
+}
+var DrizzleJobOrchestrator = class {
+  constructor(db, multiTenant) {
+    this.db = db;
+    this.multiTenant = multiTenant;
+  }
+  db;
+  multiTenant;
+  // TODO(logging-subsystem): swap to ILogger once ADR-028 lands
+  logger = new Logger(DrizzleJobOrchestrator.name);
+  /**
+   * JOB-8 — resolve `tenantId` for a mutating / targeted-read call.
+   * Returns the tenant value that should be written to the row (or compared
+   * against in a WHERE clause). When `multiTenant` is off, the column is
+   * forced to `null` regardless of what callers pass. When on, `undefined`
+   * throws; `null` and strings pass through untouched.
+   */
+  resolveTenantId(method, tenantId) {
+    if (!this.multiTenant) return null;
+    if (tenantId === void 0) throw new MissingTenantIdError(method);
+    return tenantId;
+  }
+  // ==========================================================================
+  // start
+  // ==========================================================================
+  async start(type, input, opts = {}, tx) {
+    const payload = input ?? {};
+    const tenantId = this.resolveTenantId("start", opts.tenantId);
+    const client = tx ?? this.db;
+    const [def] = await client.select().from(jobs).where(eq(jobs.type, type)).limit(1);
+    if (!def) throw new JobTypeNotFoundError(type);
+    const definition = def;
+    if (definition.dedupeKeyTemplate && definition.dedupeWindowMs) {
+      const dedupeKey2 = evaluateKeyTemplate(definition.dedupeKeyTemplate, payload);
+      const windowStart = new Date(Date.now() - definition.dedupeWindowMs);
+      const existing = await client.select().from(jobRuns).where(
+        and(
+          eq(jobRuns.jobType, type),
+          eq(jobRuns.dedupeKey, dedupeKey2),
+          gt(jobRuns.createdAt, windowStart),
+          // status NOT IN ('canceled', 'failed')
+          notInStatus(DEDUPE_EXCLUDED_STATUSES)
+        )
+      ).orderBy(desc(jobRuns.createdAt)).limit(1);
+      if (existing.length > 0) {
+        return existing[0];
+      }
+    }
+    let concurrencyKey = null;
+    if (definition.concurrencyKeyTemplate) {
+      concurrencyKey = evaluateKeyTemplate(
+        definition.concurrencyKeyTemplate,
+        payload
+      );
+      const inFlight = await client.select().from(jobRuns).where(
+        and(
+          eq(jobRuns.concurrencyKey, concurrencyKey),
+          inArray(jobRuns.status, IN_FLIGHT_STATUSES)
+        )
+      ).limit(1);
+      if (inFlight.length > 0) {
+        const incumbent = inFlight[0];
+        switch (definition.collisionMode) {
+          case "reject":
+            throw new JobCollisionError(type, concurrencyKey, incumbent);
+          case "replace":
+            await this.cancel(incumbent.id, {
+              cascade: true,
+              reason: "replaced",
+              tenantId: incumbent.tenantId
+            });
+            break;
+          case "queue":
+            break;
+        }
+      }
+    }
+    const newId = randomUUID();
+    let rootRunId = newId;
+    if (opts.parentRunId) {
+      const [parent] = await client.select({ rootRunId: jobRuns.rootRunId }).from(jobRuns).where(eq(jobRuns.id, opts.parentRunId)).limit(1);
+      if (!parent) {
+        throw new Error(
+          `parentRunId ${opts.parentRunId} does not reference an existing job_run`
+        );
+      }
+      rootRunId = parent.rootRunId;
+    }
+    const dedupeKey = definition.dedupeKeyTemplate ? evaluateKeyTemplate(definition.dedupeKeyTemplate, payload) : null;
+    const [inserted] = await client.insert(jobRuns).values({
+      id: newId,
+      jobType: type,
+      jobVersion: definition.version,
+      parentRunId: opts.parentRunId ?? null,
+      rootRunId,
+      parentClosePolicy: opts.parentClosePolicy ?? "terminate",
+      scopeEntityType: opts.scope?.entityType ?? null,
+      scopeEntityId: opts.scope?.entityId ?? null,
+      tenantId,
+      tags: opts.tags ?? {},
+      pool: opts.pool ?? definition.pool,
+      priority: opts.priority ?? definition.priorityDefault,
+      concurrencyKey,
+      dedupeKey,
+      status: "pending",
+      input: payload,
+      output: null,
+      error: null,
+      triggerSource: opts.triggerSource ?? "manual",
+      triggerRef: opts.triggerRef ?? null,
+      runAt: opts.runAt ?? /* @__PURE__ */ new Date(),
+      startedAt: null,
+      finishedAt: null,
+      claimedAt: null,
+      attempts: 0
+    }).returning();
+    return inserted;
+  }
+  // ==========================================================================
+  // cancel
+  // ==========================================================================
+  async cancel(runId, opts = {}) {
+    const tenantId = this.resolveTenantId("cancel", opts.tenantId);
+    const [target] = await this.db.select().from(jobRuns).where(eq(jobRuns.id, runId)).limit(1);
+    if (!target) return;
+    if (this.multiTenant && target.tenantId !== tenantId) return;
+    if (TERMINAL_STATUSES.includes(target.status)) {
+      return;
+    }
+    const [cancelled] = await this.db.update(jobRuns).set({
+      status: "canceled",
+      finishedAt: /* @__PURE__ */ new Date(),
+      updatedAt: /* @__PURE__ */ new Date()
+    }).where(
+      and(eq(jobRuns.id, runId), notInStatus([...TERMINAL_STATUSES]))
+    ).returning();
+    if (!cancelled) return;
+    if (opts.cascade === false) return;
+    const descendants = await this.db.select().from(jobRuns).where(
+      and(
+        eq(jobRuns.rootRunId, target.rootRunId),
+        ne(jobRuns.id, runId),
+        notInStatus([...TERMINAL_STATUSES])
+      )
+    );
+    for (const child of descendants) {
+      const policy = child.parentClosePolicy;
+      if (policy === "abandon") continue;
+      await this.db.update(jobRuns).set({
+        status: "canceled",
+        finishedAt: /* @__PURE__ */ new Date(),
+        updatedAt: /* @__PURE__ */ new Date()
+      }).where(
+        and(
+          eq(jobRuns.id, child.id),
+          notInStatus([...TERMINAL_STATUSES])
+        )
+      );
+    }
+    void opts.reason;
+  }
+  // ==========================================================================
+  // replay
+  // ==========================================================================
+  async replay(runId) {
+    const [target] = await this.db.select().from(jobRuns).where(eq(jobRuns.id, runId)).limit(1);
+    if (!target) {
+      throw new Error(`replay: run ${runId} not found`);
+    }
+    const run = target;
+    if (!TERMINAL_STATUSES.includes(run.status)) {
+      throw new JobNotReplayableError(runId, run.status);
+    }
+    const [def] = await this.db.select().from(jobs).where(eq(jobs.type, run.jobType)).limit(1);
+    if (!def) throw new JobTypeNotFoundError(run.jobType);
+    const mode = def.replayFrom;
+    const result = await this.db.transaction(async (tx) => {
+      if (mode === "scratch") {
+        await tx.delete(jobSteps).where(eq(jobSteps.jobRunId, runId));
+      } else if (mode === "last_step") {
+        await tx.delete(jobSteps).where(
+          and(eq(jobSteps.jobRunId, runId), ne(jobSteps.status, "completed"))
+        );
+      } else {
+        await tx.delete(jobSteps).where(
+          and(eq(jobSteps.jobRunId, runId), ne(jobSteps.status, "completed"))
+        );
+      }
+      const [updated] = await tx.update(jobRuns).set({
+        status: "pending",
+        attempts: 0,
+        runAt: /* @__PURE__ */ new Date(),
+        startedAt: null,
+        finishedAt: null,
+        claimedAt: null,
+        error: null,
+        output: null,
+        updatedAt: /* @__PURE__ */ new Date()
+      }).where(eq(jobRuns.id, runId)).returning();
+      return updated;
+    });
+    return result;
+  }
+  // ==========================================================================
+  // upsertJobRows — boot-time materialisation of `job` definitions
+  // ==========================================================================
+  /**
+   * Hash-gated `INSERT … ON CONFLICT (type) DO UPDATE … WHERE` per Q3
+   * resolution (2026-04-19): the `UPDATE` branch executes only when one
+   * of the persisted metadata fields differs from the incoming payload;
+   * `version` bumps only on real change; concurrent boots with identical
+   * content are idempotent no-ops.
+   *
+   * Why this shape (not `DO NOTHING`, not advisory locks):
+   *   - `DO NOTHING` would let an old-version instance leave a stale row
+   *     that a new-version instance can't overwrite during a rolling deploy.
+   *   - Advisory locks add latency and leak risk under crashes.
+   *   - The `WHERE … IS DISTINCT FROM …` clause makes the conditional
+   *     atomic — no read-modify-write race on `version` between concurrent
+   *     boots.
+   *
+   * Orphan detection: a single `SELECT type FROM job WHERE type NOT IN (...)`
+   * returns the types present in DB but absent from `entries`. Caller (boot
+   * validator) decides whether to throw `BootValidationError`.
+   */
+  async upsertJobRows(entries, poolConfig) {
+    void poolConfig;
+    for (const entry of entries) {
+      const meta = entry.meta;
+      const pool = meta.pool ?? "batch";
+      const retryPolicy = meta.retry ?? {
+        attempts: 1,
+        backoff: "fixed",
+        baseMs: 0
+      };
+      const concurrencyKeyTemplate = meta.concurrency?.key;
+      const concurrencyKeyTemplateStr = typeof concurrencyKeyTemplate === "string" ? concurrencyKeyTemplate : null;
+      const collisionMode = meta.concurrency?.collisionMode ?? "queue";
+      const dedupeKeyTemplate = meta.dedupe?.key;
+      const dedupeKeyTemplateStr = typeof dedupeKeyTemplate === "string" ? dedupeKeyTemplate : null;
+      const dedupeWindowMs = meta.dedupe?.windowMs ?? null;
+      const timeoutMs = meta.timeoutMs ?? null;
+      const replayFrom = meta.replayFrom ?? "last_checkpoint";
+      const scopeEntityType = meta.scope?.entity ?? null;
+      const priorityDefault = 0;
+      await this.db.insert(jobs).values({
+        type: entry.type,
+        version: 1,
+        pool,
+        scopeEntityType,
+        retryPolicy,
+        timeoutMs,
+        concurrencyKeyTemplate: concurrencyKeyTemplateStr,
+        collisionMode,
+        dedupeKeyTemplate: dedupeKeyTemplateStr,
+        dedupeWindowMs,
+        priorityDefault,
+        replayFrom
+      }).onConflictDoUpdate({
+        target: jobs.type,
+        set: {
+          pool: sql`EXCLUDED.pool`,
+          scopeEntityType: sql`EXCLUDED.scope_entity_type`,
+          retryPolicy: sql`EXCLUDED.retry_policy`,
+          timeoutMs: sql`EXCLUDED.timeout_ms`,
+          concurrencyKeyTemplate: sql`EXCLUDED.concurrency_key_template`,
+          collisionMode: sql`EXCLUDED.collision_mode`,
+          dedupeKeyTemplate: sql`EXCLUDED.dedupe_key_template`,
+          dedupeWindowMs: sql`EXCLUDED.dedupe_window_ms`,
+          priorityDefault: sql`EXCLUDED.priority_default`,
+          replayFrom: sql`EXCLUDED.replay_from`,
+          version: sql`${jobs.version} + 1`,
+          updatedAt: sql`now()`
+        },
+        // The hash gate: every field listed in the Q3 resolution appears
+        // here. `IS DISTINCT FROM` is the null-safe inequality operator;
+        // jsonb cast to text gives stable comparison without invoking a
+        // dedicated hash column (avoids a JOB-1 schema migration).
+        setWhere: sql`
+            ${jobs.pool} IS DISTINCT FROM EXCLUDED.pool OR
+            ${jobs.retryPolicy}::text IS DISTINCT FROM EXCLUDED.retry_policy::text OR
+            ${jobs.timeoutMs} IS DISTINCT FROM EXCLUDED.timeout_ms OR
+            ${jobs.concurrencyKeyTemplate} IS DISTINCT FROM EXCLUDED.concurrency_key_template OR
+            ${jobs.collisionMode} IS DISTINCT FROM EXCLUDED.collision_mode OR
+            ${jobs.dedupeKeyTemplate} IS DISTINCT FROM EXCLUDED.dedupe_key_template OR
+            ${jobs.dedupeWindowMs} IS DISTINCT FROM EXCLUDED.dedupe_window_ms OR
+            ${jobs.priorityDefault} IS DISTINCT FROM EXCLUDED.priority_default OR
+            ${jobs.replayFrom} IS DISTINCT FROM EXCLUDED.replay_from OR
+            ${jobs.scopeEntityType} IS DISTINCT FROM EXCLUDED.scope_entity_type
+          `
+      });
+    }
+    const types = entries.map((e) => e.type);
+    const orphans = types.length === 0 ? await this.db.select({ type: jobs.type }).from(jobs) : await this.db.select({ type: jobs.type }).from(jobs).where(notInArray(jobs.type, types));
+    return { orphaned: orphans.map((o) => o.type) };
+  }
+};
+DrizzleJobOrchestrator = __decorateClass([
+  Injectable(),
+  __decorateParam(0, Inject(DRIZZLE)),
+  __decorateParam(1, Inject(JOBS_MULTI_TENANT))
+], DrizzleJobOrchestrator);
+function notInStatus(statuses) {
+  const negated = statuses.map((s) => ne(jobRuns.status, s));
+  return and(...negated);
+}
+
+export {
+  TERMINAL_STATUSES,
+  evaluateKeyTemplate,
+  DrizzleJobOrchestrator
+};
+//# sourceMappingURL=chunk-5Y7W3XR6.js.map

package/dist/chunk-5Y7W3XR6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/jobs/job-orchestrator.drizzle-backend.ts"],"sourcesContent":["/**\n * DrizzleJobOrchestrator — Postgres-backed implementation of\n * `IJobOrchestrator` (ADR-022, JOB-3).\n *\n * Single-layer architecture: `start` writes a single `job_run` row; the\n * `JobWorker` polling loop claims it directly via `FOR UPDATE SKIP LOCKED`.\n * No `job_queue` table, no executor port. See `docs/specs/JOB-3.md`.\n */\nimport { randomUUID } from 'node:crypto';\nimport { Inject, Injectable, Logger } from '@nestjs/common';\nimport { and, desc, eq, gt, inArray, isNotNull, ne, notInArray, sql } from 'drizzle-orm';\nimport type { DrizzleClient } from '../../types/drizzle';\nimport type { DrizzleTransaction } from '../events/event-bus.protocol';\nimport { DRIZZLE } from '../../constants/tokens';\nimport {\n  jobRuns,\n  jobs,\n  type JobDefinitionRow,\n  type JobRunRow,\n} from './job-orchestration.schema';\nimport type {\n  CancelOptions,\n  IJobOrchestrator,\n  JobPoolDef,\n  JobRun,\n  JobUpsertEntry,\n  StartOptions,\n} from './job-orchestrator.protocol';\nimport {\n  JobCollisionError,\n  JobNotReplayableError,\n  JobTemplateFieldMissingError,\n  JobTypeNotFoundError,\n  MissingTenantIdError,\n} from './jobs-errors';\nimport { jobSteps } from './job-orchestration.schema';\nimport { JOBS_MULTI_TENANT } from './jobs-domain.tokens';\n\n/**\n * Terminal statuses — transitions into these are final. Used by `cancel`\n * (to short-circuit idempotently) and by `replay` (as the guard gate).\n */\nexport const TERMINAL_STATUSES = [\n  'completed',\n  'failed',\n  'timed_out',\n  'canceled',\n] as const;\ntype TerminalStatus = (typeof TERMINAL_STATUSES)[number];\ntype JobRunStatus = JobRunRow['status'];\n\n/** Statuses excluded from dedupe window matches per ADR-022. */\nconst DEDUPE_EXCLUDED_STATUSES: JobRunStatus[] = ['canceled', 'failed'];\n/** Statuses that count as in-flight for concurrency collision checks. */\nconst IN_FLIGHT_STATUSES: JobRunStatus[] = ['pending', 'running'];\n\n/**\n * Substitute `{{field}}` placeholders against the input payload.\n *\n * Implementation decision (JOB-3, 2026-04-19): simple `{{field}}` single-key\n * substitution, no dotted paths, no Mustache/Handlebars dependency. A missing\n * field throws `JobTemplateFieldMissingError` synchronously — cheaper than\n * discovering the misconfiguration at claim time.\n */\nexport function evaluateKeyTemplate(\n  template: string,\n  input: Record<string, unknown>,\n): string {\n  return template.replace(/\\{\\{\\s*([a-zA-Z0-9_]+)\\s*\\}\\}/g, (_match, field: string) => {\n    const value = input[field];\n    if (value === undefined || value === null) {\n      throw new JobTemplateFieldMissingError(template, field);\n    }\n    return String(value);\n  });\n}\n\n@Injectable()\nexport class DrizzleJobOrchestrator implements IJobOrchestrator {\n  // TODO(logging-subsystem): swap to ILogger once ADR-028 lands\n  private readonly logger = new Logger(DrizzleJobOrchestrator.name);\n\n  constructor(\n    @Inject(DRIZZLE) private readonly db: DrizzleClient,\n    @Inject(JOBS_MULTI_TENANT) private readonly multiTenant: boolean,\n  ) {}\n\n  /**\n   * JOB-8 — resolve `tenantId` for a mutating / targeted-read call.\n   * Returns the tenant value that should be written to the row (or compared\n   * against in a WHERE clause). When `multiTenant` is off, the column is\n   * forced to `null` regardless of what callers pass. When on, `undefined`\n   * throws; `null` and strings pass through untouched.\n   */\n  private resolveTenantId(\n    method: string,\n    tenantId: string | null | undefined,\n  ): string | null {\n    if (!this.multiTenant) return null;\n    if (tenantId === undefined) throw new MissingTenantIdError(method);\n    return tenantId;\n  }\n\n  // ==========================================================================\n  // start\n  // ==========================================================================\n\n  async start(\n    type: string,\n    input: unknown,\n    opts: StartOptions = {},\n    tx?: DrizzleTransaction,\n  ): Promise<JobRun> {\n    const payload = (input ?? {}) as Record<string, unknown>;\n\n    // JOB-8 — resolve tenant gate up front so `multi_tenant=true` +\n    // undefined surfaces before any row is touched.\n    const tenantId = this.resolveTenantId('start', opts.tenantId);\n\n    // BRIDGE-7: thread the optional caller tx through every read/write\n    // in this method so EventFlowService.publishAndStart can bundle the\n    // outbox insert, the eager job_run insert, and (for Case B) the\n    // bridge_delivery pre-write into a single transaction.\n    const client = (tx ?? this.db) as DrizzleClient;\n\n    // 1a. Load job definition.\n    const [def] = await client\n      .select()\n      .from(jobs)\n      .where(eq(jobs.type, type))\n      .limit(1);\n    if (!def) throw new JobTypeNotFoundError(type);\n    const definition = def as JobDefinitionRow;\n\n    // 1b. Dedupe check.\n    if (definition.dedupeKeyTemplate && definition.dedupeWindowMs) {\n      const dedupeKey = evaluateKeyTemplate(definition.dedupeKeyTemplate, payload);\n      const windowStart = new Date(Date.now() - definition.dedupeWindowMs);\n      const existing = await client\n        .select()\n        .from(jobRuns)\n        .where(\n          and(\n            eq(jobRuns.jobType, type),\n            eq(jobRuns.dedupeKey, dedupeKey),\n            gt(jobRuns.createdAt, windowStart),\n            // status NOT IN ('canceled', 'failed')\n            notInStatus(DEDUPE_EXCLUDED_STATUSES),\n          ),\n        )\n        .orderBy(desc(jobRuns.createdAt))\n        .limit(1);\n      if (existing.length > 0) {\n        return existing[0] as JobRun;\n      }\n    }\n\n    // 1c. Concurrency collision check.\n    let concurrencyKey: string | null = null;\n    if (definition.concurrencyKeyTemplate) {\n      concurrencyKey = evaluateKeyTemplate(\n        definition.concurrencyKeyTemplate,\n        payload,\n      );\n      const inFlight = await client\n        .select()\n        .from(jobRuns)\n        .where(\n          and(\n            eq(jobRuns.concurrencyKey, concurrencyKey),\n            inArray(jobRuns.status, IN_FLIGHT_STATUSES),\n          ),\n        )\n        .limit(1);\n      if (inFlight.length > 0) {\n        const incumbent = inFlight[0] as JobRun;\n        switch (definition.collisionMode) {\n          case 'reject':\n            throw new JobCollisionError(type, concurrencyKey, incumbent);\n          case 'replace':\n            // JOB-8 — thread the incumbent's own tenantId through the\n            // internal cascade. Without this, every `replace`-collision\n            // start() under multiTenant=true throws MissingTenantIdError\n            // from the inner cancel() call instead of cancelling the\n            // incumbent. Mirrors the memory backend's `cancelLocked(\n            // incumbent.id, ..., incumbent.tenantId)` pattern.\n            await this.cancel(incumbent.id, {\n              cascade: true,\n              reason: 'replaced',\n              tenantId: incumbent.tenantId,\n            });\n            break;\n          case 'queue':\n            // Fall through — row is inserted; claim query gates it until\n            // the incumbent transitions (see JobWorker.processRun queue gate).\n            break;\n        }\n      }\n    }\n\n    // 1d. Resolve id + rootRunId, INSERT.\n    const newId = randomUUID();\n    let rootRunId: string = newId;\n    if (opts.parentRunId) {\n      const [parent] = await client\n        .select({ rootRunId: jobRuns.rootRunId })\n        .from(jobRuns)\n        .where(eq(jobRuns.id, opts.parentRunId))\n        .limit(1);\n      if (!parent) {\n        throw new Error(\n          `parentRunId ${opts.parentRunId} does not reference an existing job_run`,\n        );\n      }\n      rootRunId = parent.rootRunId;\n    }\n\n    const dedupeKey =\n      definition.dedupeKeyTemplate\n        ? evaluateKeyTemplate(definition.dedupeKeyTemplate, payload)\n        : null;\n\n    const [inserted] = await client\n      .insert(jobRuns)\n      .values({\n        id: newId,\n        jobType: type,\n        jobVersion: definition.version,\n        parentRunId: opts.parentRunId ?? null,\n        rootRunId,\n        parentClosePolicy: opts.parentClosePolicy ?? 'terminate',\n        scopeEntityType: opts.scope?.entityType ?? null,\n        scopeEntityId: opts.scope?.entityId ?? null,\n        tenantId,\n        tags: opts.tags ?? {},\n        pool: opts.pool ?? definition.pool,\n        priority: opts.priority ?? definition.priorityDefault,\n        concurrencyKey,\n        dedupeKey,\n        status: 'pending',\n        input: payload,\n        output: null,\n        error: null,\n        triggerSource: opts.triggerSource ?? 'manual',\n        triggerRef: opts.triggerRef ?? null,\n        runAt: opts.runAt ?? new Date(),\n        startedAt: null,\n        finishedAt: null,\n        claimedAt: null,\n        attempts: 0,\n      })\n      .returning();\n\n    return inserted as JobRun;\n  }\n\n  // ==========================================================================\n  // cancel\n  // ==========================================================================\n\n  async cancel(runId: string, opts: CancelOptions = {}): Promise<void> {\n    // JOB-8 — resolve tenant gate up front (strict undefined-throws).\n    const tenantId = this.resolveTenantId('cancel', opts.tenantId);\n\n    // Load target.\n    const [target] = await this.db\n      .select()\n      .from(jobRuns)\n      .where(eq(jobRuns.id, runId))\n      .limit(1);\n    if (!target) return;\n    // JOB-8 — cross-tenant cancel is a silent no-op (no existence leak).\n    if (this.multiTenant && target.tenantId !== tenantId) return;\n    if (TERMINAL_STATUSES.includes(target.status as TerminalStatus)) {\n      return; // idempotent\n    }\n\n    // Atomic transition, guarded against concurrent terminal moves.\n    const [cancelled] = await this.db\n      .update(jobRuns)\n      .set({\n        status: 'canceled',\n        finishedAt: new Date(),\n        updatedAt: new Date(),\n      })\n      .where(\n        and(eq(jobRuns.id, runId), notInStatus([...TERMINAL_STATUSES])),\n      )\n      .returning();\n\n    if (!cancelled) return; // lost the race; already terminal\n\n    if (opts.cascade === false) return;\n\n    // Fetch descendants and branch on parent_close_policy.\n    const descendants = await this.db\n      .select()\n      .from(jobRuns)\n      .where(\n        and(\n          eq(jobRuns.rootRunId, target.rootRunId),\n          ne(jobRuns.id, runId),\n          notInStatus([...TERMINAL_STATUSES]),\n        ),\n      );\n\n    for (const child of descendants) {\n      const policy = (child as JobRunRow).parentClosePolicy;\n      if (policy === 'abandon') continue;\n      // 'terminate' | 'cancel' — both transition the child to canceled.\n      await this.db\n        .update(jobRuns)\n        .set({\n          status: 'canceled',\n          finishedAt: new Date(),\n          updatedAt: new Date(),\n        })\n        .where(\n          and(\n            eq(jobRuns.id, (child as JobRunRow).id),\n            notInStatus([...TERMINAL_STATUSES]),\n          ),\n        );\n    }\n\n    void opts.reason; // reserved for future audit logging\n  }\n\n  // ==========================================================================\n  // replay\n  // ==========================================================================\n\n  async replay(runId: string): Promise<JobRun> {\n    // Load target + its job definition (we need replay_from).\n    const [target] = await this.db\n      .select()\n      .from(jobRuns)\n      .where(eq(jobRuns.id, runId))\n      .limit(1);\n    if (!target) {\n      throw new Error(`replay: run ${runId} not found`);\n    }\n    const run = target as JobRunRow;\n    if (!TERMINAL_STATUSES.includes(run.status as TerminalStatus)) {\n      throw new JobNotReplayableError(runId, run.status);\n    }\n\n    const [def] = await this.db\n      .select()\n      .from(jobs)\n      .where(eq(jobs.type, run.jobType))\n      .limit(1);\n    if (!def) throw new JobTypeNotFoundError(run.jobType);\n    const mode = (def as JobDefinitionRow).replayFrom;\n\n    // Atomic: step reset + run reset must commit together.\n    const result = await this.db.transaction(async (tx) => {\n      if (mode === 'scratch') {\n        await tx.delete(jobSteps).where(eq(jobSteps.jobRunId, runId));\n      } else if (mode === 'last_step') {\n        // Delete only non-completed step rows — completed steps stay memoised.\n        await tx\n          .delete(jobSteps)\n          .where(\n            and(eq(jobSteps.jobRunId, runId), ne(jobSteps.status, 'completed')),\n          );\n      } else {\n        // 'last_checkpoint' — Phase 1 has no explicit checkpoint markers, so\n        // behaviour collapses to `last_step`. See docs/specs/JOB-3.md\n        // \"Implementation Decisions\" — planned divergence in a later phase.\n        await tx\n          .delete(jobSteps)\n          .where(\n            and(eq(jobSteps.jobRunId, runId), ne(jobSteps.status, 'completed')),\n          );\n      }\n\n      const [updated] = await tx\n        .update(jobRuns)\n        .set({\n          status: 'pending',\n          attempts: 0,\n          runAt: new Date(),\n          startedAt: null,\n          finishedAt: null,\n          claimedAt: null,\n          error: null,\n          output: null,\n          updatedAt: new Date(),\n        })\n        .where(eq(jobRuns.id, runId))\n        .returning();\n      return updated as JobRunRow;\n    });\n\n    return result as JobRun;\n  }\n\n  // ==========================================================================\n  // upsertJobRows — boot-time materialisation of `job` definitions\n  // ==========================================================================\n\n  /**\n   * Hash-gated `INSERT … ON CONFLICT (type) DO UPDATE … WHERE` per Q3\n   * resolution (2026-04-19): the `UPDATE` branch executes only when one\n   * of the persisted metadata fields differs from the incoming payload;\n   * `version` bumps only on real change; concurrent boots with identical\n   * content are idempotent no-ops.\n   *\n   * Why this shape (not `DO NOTHING`, not advisory locks):\n   *   - `DO NOTHING` would let an old-version instance leave a stale row\n   *     that a new-version instance can't overwrite during a rolling deploy.\n   *   - Advisory locks add latency and leak risk under crashes.\n   *   - The `WHERE … IS DISTINCT FROM …` clause makes the conditional\n   *     atomic — no read-modify-write race on `version` between concurrent\n   *     boots.\n   *\n   * Orphan detection: a single `SELECT type FROM job WHERE type NOT IN (...)`\n   * returns the types present in DB but absent from `entries`. Caller (boot\n   * validator) decides whether to throw `BootValidationError`.\n   */\n  async upsertJobRows(\n    entries: JobUpsertEntry[],\n    poolConfig: ReadonlyMap<string, JobPoolDef>,\n  ): Promise<{ orphaned: string[] }> {\n    void poolConfig; // pool validation is the module's responsibility; orchestrator just persists\n\n    for (const entry of entries) {\n      const meta = entry.meta;\n      const pool = meta.pool ?? 'batch';\n      const retryPolicy = meta.retry ?? {\n        attempts: 1,\n        backoff: 'fixed' as const,\n        baseMs: 0,\n      };\n      const concurrencyKeyTemplate =\n        (meta.concurrency as { key?: unknown } | undefined)?.key;\n      const concurrencyKeyTemplateStr =\n        typeof concurrencyKeyTemplate === 'string' ? concurrencyKeyTemplate : null;\n      const collisionMode =\n        (meta.concurrency?.collisionMode as JobDefinitionRow['collisionMode']) ??\n        'queue';\n      const dedupeKeyTemplate =\n        (meta.dedupe as { key?: unknown } | undefined)?.key;\n      const dedupeKeyTemplateStr =\n        typeof dedupeKeyTemplate === 'string' ? dedupeKeyTemplate : null;\n      const dedupeWindowMs = meta.dedupe?.windowMs ?? null;\n      const timeoutMs = meta.timeoutMs ?? null;\n      const replayFrom = meta.replayFrom ?? 'last_checkpoint';\n      const scopeEntityType = meta.scope?.entity ?? null;\n      // Q3 resolution: priority_default and replay_from are part of the\n      // hashed metadata even though they aren't currently set via decorator\n      // metadata above (priority_default has no `@JobHandler` field yet).\n      // Default to 0 to keep UPDATE branch quiet across deploys.\n      const priorityDefault = 0;\n\n      // Hash-gated upsert: every metadata column appears in the WHERE clause\n      // so the UPDATE branch only fires on a real change. `version` bumps\n      // exactly when the WHERE matches.\n      await this.db\n        .insert(jobs)\n        .values({\n          type: entry.type,\n          version: 1,\n          pool,\n          scopeEntityType,\n          retryPolicy,\n          timeoutMs,\n          concurrencyKeyTemplate: concurrencyKeyTemplateStr,\n          collisionMode,\n          dedupeKeyTemplate: dedupeKeyTemplateStr,\n          dedupeWindowMs,\n          priorityDefault,\n          replayFrom,\n        })\n        .onConflictDoUpdate({\n          target: jobs.type,\n          set: {\n            pool: sql`EXCLUDED.pool`,\n            scopeEntityType: sql`EXCLUDED.scope_entity_type`,\n            retryPolicy: sql`EXCLUDED.retry_policy`,\n            timeoutMs: sql`EXCLUDED.timeout_ms`,\n            concurrencyKeyTemplate: sql`EXCLUDED.concurrency_key_template`,\n            collisionMode: sql`EXCLUDED.collision_mode`,\n            dedupeKeyTemplate: sql`EXCLUDED.dedupe_key_template`,\n            dedupeWindowMs: sql`EXCLUDED.dedupe_window_ms`,\n            priorityDefault: sql`EXCLUDED.priority_default`,\n            replayFrom: sql`EXCLUDED.replay_from`,\n            version: sql`${jobs.version} + 1`,\n            updatedAt: sql`now()`,\n          },\n          // The hash gate: every field listed in the Q3 resolution appears\n          // here. `IS DISTINCT FROM` is the null-safe inequality operator;\n          // jsonb cast to text gives stable comparison without invoking a\n          // dedicated hash column (avoids a JOB-1 schema migration).\n          setWhere: sql`\n            ${jobs.pool} IS DISTINCT FROM EXCLUDED.pool OR\n            ${jobs.retryPolicy}::text IS DISTINCT FROM EXCLUDED.retry_policy::text OR\n            ${jobs.timeoutMs} IS DISTINCT FROM EXCLUDED.timeout_ms OR\n            ${jobs.concurrencyKeyTemplate} IS DISTINCT FROM EXCLUDED.concurrency_key_template OR\n            ${jobs.collisionMode} IS DISTINCT FROM EXCLUDED.collision_mode OR\n            ${jobs.dedupeKeyTemplate} IS DISTINCT FROM EXCLUDED.dedupe_key_template OR\n            ${jobs.dedupeWindowMs} IS DISTINCT FROM EXCLUDED.dedupe_window_ms OR\n            ${jobs.priorityDefault} IS DISTINCT FROM EXCLUDED.priority_default OR\n            ${jobs.replayFrom} IS DISTINCT FROM EXCLUDED.replay_from OR\n            ${jobs.scopeEntityType} IS DISTINCT FROM EXCLUDED.scope_entity_type\n          `,\n        });\n    }\n\n    // Orphan detection: any `job` row whose type is not in the registry.\n    const types = entries.map((e) => e.type);\n    const orphans =\n      types.length === 0\n        ? await this.db.select({ type: jobs.type }).from(jobs)\n        : await this.db\n            .select({ type: jobs.type })\n            .from(jobs)\n            .where(notInArray(jobs.type, types));\n\n    return { orphaned: orphans.map((o) => o.type) };\n  }\n}\n\n// ─── Helpers ────────────────────────────────────────────────────────────────\n\nfunction notInStatus(statuses: JobRunStatus[]) {\n  // Drizzle's inArray composes with `not` via negation helper; use raw sql\n  // to stay readable. `inArray` + `.not()` isn't idiomatic in 0.45.\n  const negated = statuses.map((s) => ne(jobRuns.status, s));\n  return and(...negated);\n}\n\n// `isNotNull` + `gt` imports are retained for potential future use; silence\n// unused-import lint by re-exporting via `void`.\nvoid isNotNull;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAQA,SAAS,kBAAkB;AAC3B,SAAS,QAAQ,YAAY,cAAc;AAC3C,SAAS,KAAK,MAAM,IAAI,IAAI,SAAS,WAAW,IAAI,YAAY,WAAW;AAgCpE,IAAM,oBAAoB;AAAA,EAC/B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKA,IAAM,2BAA2C,CAAC,YAAY,QAAQ;AAEtE,IAAM,qBAAqC,CAAC,WAAW,SAAS;AAUzD,SAAS,oBACd,UACA,OACQ;AACR,SAAO,SAAS,QAAQ,kCAAkC,CAAC,QAAQ,UAAkB;AACnF,UAAM,QAAQ,MAAM,KAAK;AACzB,QAAI,UAAU,UAAa,UAAU,MAAM;AACzC,YAAM,IAAI,6BAA6B,UAAU,KAAK;AAAA,IACxD;AACA,WAAO,OAAO,KAAK;AAAA,EACrB,CAAC;AACH;AAGO,IAAM,yBAAN,MAAyD;AAAA,EAI9D,YACoC,IACU,aAC5C;AAFkC;AACU;AAAA,EAC3C;AAAA,EAFiC;AAAA,EACU;AAAA;AAAA,EAJ7B,SAAS,IAAI,OAAO,uBAAuB,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcxD,gBACN,QACA,UACe;AACf,QAAI,CAAC,KAAK,YAAa,QAAO;AAC9B,QAAI,aAAa,OAAW,OAAM,IAAI,qBAAqB,MAAM;AACjE,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MACJ,MACA,OACA,OAAqB,CAAC,GACtB,IACiB;AACjB,UAAM,UAAW,SAAS,CAAC;AAI3B,UAAM,WAAW,KAAK,gBAAgB,SAAS,KAAK,QAAQ;AAM5D,UAAM,SAAU,MAAM,KAAK;AAG3B,UAAM,CAAC,GAAG,IAAI,MAAM,OACjB,OAAO,EACP,KAAK,IAAI,EACT,MAAM,GAAG,KAAK,MAAM,IAAI,CAAC,EACzB,MAAM,CAAC;AACV,QAAI,CAAC,IAAK,OAAM,IAAI,qBAAqB,IAAI;AAC7C,UAAM,aAAa;AAGnB,QAAI,WAAW,qBAAqB,WAAW,gBAAgB;AAC7D,YAAMA,aAAY,oBAAoB,WAAW,mBAAmB,OAAO;AAC3E,YAAM,cAAc,IAAI,KAAK,KAAK,IAAI,IAAI,WAAW,cAAc;AACnE,YAAM,WAAW,MAAM,OACpB,OAAO,EACP,KAAK,OAAO,EACZ;AAAA,QACC;AAAA,UACE,GAAG,QAAQ,SAAS,IAAI;AAAA,UACxB,GAAG,QAAQ,WAAWA,UAAS;AAAA,UAC/B,GAAG,QAAQ,WAAW,WAAW;AAAA;AAAA,UAEjC,YAAY,wBAAwB;AAAA,QACtC;AAAA,MACF,EACC,QAAQ,KAAK,QAAQ,SAAS,CAAC,EAC/B,MAAM,CAAC;AACV,UAAI,SAAS,SAAS,GAAG;AACvB,eAAO,SAAS,CAAC;AAAA,MACnB;AAAA,IACF;AAGA,QAAI,iBAAgC;AACpC,QAAI,WAAW,wBAAwB;AACrC,uBAAiB;AAAA,QACf,WAAW;AAAA,QACX;AAAA,MACF;AACA,YAAM,WAAW,MAAM,OACpB,OAAO,EACP,KAAK,OAAO,EACZ;AAAA,QACC;AAAA,UACE,GAAG,QAAQ,gBAAgB,cAAc;AAAA,UACzC,QAAQ,QAAQ,QAAQ,kBAAkB;AAAA,QAC5C;AAAA,MACF,EACC,MAAM,CAAC;AACV,UAAI,SAAS,SAAS,GAAG;AACvB,cAAM,YAAY,SAAS,CAAC;AAC5B,gBAAQ,WAAW,eAAe;AAAA,UAChC,KAAK;AACH,kBAAM,IAAI,kBAAkB,MAAM,gBAAgB,SAAS;AAAA,UAC7D,KAAK;AAOH,kBAAM,KAAK,OAAO,UAAU,IAAI;AAAA,cAC9B,SAAS;AAAA,cACT,QAAQ;AAAA,cACR,UAAU,UAAU;AAAA,YACtB,CAAC;AACD;AAAA,UACF,KAAK;AAGH;AAAA,QACJ;AAAA,MACF;AAAA,IACF;AAGA,UAAM,QAAQ,WAAW;AACzB,QAAI,YAAoB;AACxB,QAAI,KAAK,aAAa;AACpB,YAAM,CAAC,MAAM,IAAI,MAAM,OACpB,OAAO,EAAE,WAAW,QAAQ,UAAU,CAAC,EACvC,KAAK,OAAO,EACZ,MAAM,GAAG,QAAQ,IAAI,KAAK,WAAW,CAAC,EACtC,MAAM,CAAC;AACV,UAAI,CAAC,QAAQ;AACX,cAAM,IAAI;AAAA,UACR,eAAe,KAAK,WAAW;AAAA,QACjC;AAAA,MACF;AACA,kBAAY,OAAO;AAAA,IACrB;AAEA,UAAM,YACJ,WAAW,oBACP,oBAAoB,WAAW,mBAAmB,OAAO,IACzD;AAEN,UAAM,CAAC,QAAQ,IAAI,MAAM,OACtB,OAAO,OAAO,EACd,OAAO;AAAA,MACN,IAAI;AAAA,MACJ,SAAS;AAAA,MACT,YAAY,WAAW;AAAA,MACvB,aAAa,KAAK,eAAe;AAAA,MACjC;AAAA,MACA,mBAAmB,KAAK,qBAAqB;AAAA,MAC7C,iBAAiB,KAAK,OAAO,cAAc;AAAA,MAC3C,eAAe,KAAK,OAAO,YAAY;AAAA,MACvC;AAAA,MACA,MAAM,KAAK,QAAQ,CAAC;AAAA,MACpB,MAAM,KAAK,QAAQ,WAAW;AAAA,MAC9B,UAAU,KAAK,YAAY,WAAW;AAAA,MACtC;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,eAAe,KAAK,iBAAiB;AAAA,MACrC,YAAY,KAAK,cAAc;AAAA,MAC/B,OAAO,KAAK,SAAS,oBAAI,KAAK;AAAA,MAC9B,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,IACZ,CAAC,EACA,UAAU;AAEb,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAe,OAAsB,CAAC,GAAkB;AAEnE,UAAM,WAAW,KAAK,gBAAgB,UAAU,KAAK,QAAQ;AAG7D,UAAM,CAAC,MAAM,IAAI,MAAM,KAAK,GACzB,OAAO,EACP,KAAK,OAAO,EACZ,MAAM,GAAG,QAAQ,IAAI,KAAK,CAAC,EAC3B,MAAM,CAAC;AACV,QAAI,CAAC,OAAQ;AAEb,QAAI,KAAK,eAAe,OAAO,aAAa,SAAU;AACtD,QAAI,kBAAkB,SAAS,OAAO,MAAwB,GAAG;AAC/D;AAAA,IACF;AAGA,UAAM,CAAC,SAAS,IAAI,MAAM,KAAK,GAC5B,OAAO,OAAO,EACd,IAAI;AAAA,MACH,QAAQ;AAAA,MACR,YAAY,oBAAI,KAAK;AAAA,MACrB,WAAW,oBAAI,KAAK;AAAA,IACtB,CAAC,EACA;AAAA,MACC,IAAI,GAAG,QAAQ,IAAI,KAAK,GAAG,YAAY,CAAC,GAAG,iBAAiB,CAAC,CAAC;AAAA,IAChE,EACC,UAAU;AAEb,QAAI,CAAC,UAAW;AAEhB,QAAI,KAAK,YAAY,MAAO;AAG5B,UAAM,cAAc,MAAM,KAAK,GAC5B,OAAO,EACP,KAAK,OAAO,EACZ;AAAA,MACC;AAAA,QACE,GAAG,QAAQ,WAAW,OAAO,SAAS;AAAA,QACtC,GAAG,QAAQ,IAAI,KAAK;AAAA,QACpB,YAAY,CAAC,GAAG,iBAAiB,CAAC;AAAA,MACpC;AAAA,IACF;AAEF,eAAW,SAAS,aAAa;AAC/B,YAAM,SAAU,MAAoB;AACpC,UAAI,WAAW,UAAW;AAE1B,YAAM,KAAK,GACR,OAAO,OAAO,EACd,IAAI;AAAA,QACH,QAAQ;AAAA,QACR,YAAY,oBAAI,KAAK;AAAA,QACrB,WAAW,oBAAI,KAAK;AAAA,MACtB,CAAC,EACA;AAAA,QACC;AAAA,UACE,GAAG,QAAQ,IAAK,MAAoB,EAAE;AAAA,UACtC,YAAY,CAAC,GAAG,iBAAiB,CAAC;AAAA,QACpC;AAAA,MACF;AAAA,IACJ;AAEA,SAAK,KAAK;AAAA,EACZ;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAgC;AAE3C,UAAM,CAAC,MAAM,IAAI,MAAM,KAAK,GACzB,OAAO,EACP,KAAK,OAAO,EACZ,MAAM,GAAG,QAAQ,IAAI,KAAK,CAAC,EAC3B,MAAM,CAAC;AACV,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,eAAe,KAAK,YAAY;AAAA,IAClD;AACA,UAAM,MAAM;AACZ,QAAI,CAAC,kBAAkB,SAAS,IAAI,MAAwB,GAAG;AAC7D,YAAM,IAAI,sBAAsB,OAAO,IAAI,MAAM;AAAA,IACnD;AAEA,UAAM,CAAC,GAAG,IAAI,MAAM,KAAK,GACtB,OAAO,EACP,KAAK,IAAI,EACT,MAAM,GAAG,KAAK,MAAM,IAAI,OAAO,CAAC,EAChC,MAAM,CAAC;AACV,QAAI,CAAC,IAAK,OAAM,IAAI,qBAAqB,IAAI,OAAO;AACpD,UAAM,OAAQ,IAAyB;AAGvC,UAAM,SAAS,MAAM,KAAK,GAAG,YAAY,OAAO,OAAO;AACrD,UAAI,SAAS,WAAW;AACtB,cAAM,GAAG,OAAO,QAAQ,EAAE,MAAM,GAAG,SAAS,UAAU,KAAK,CAAC;AAAA,MAC9D,WAAW,SAAS,aAAa;AAE/B,cAAM,GACH,OAAO,QAAQ,EACf;AAAA,UACC,IAAI,GAAG,SAAS,UAAU,KAAK,GAAG,GAAG,SAAS,QAAQ,WAAW,CAAC;AAAA,QACpE;AAAA,MACJ,OAAO;AAIL,cAAM,GACH,OAAO,QAAQ,EACf;AAAA,UACC,IAAI,GAAG,SAAS,UAAU,KAAK,GAAG,GAAG,SAAS,QAAQ,WAAW,CAAC;AAAA,QACpE;AAAA,MACJ;AAEA,YAAM,CAAC,OAAO,IAAI,MAAM,GACrB,OAAO,OAAO,EACd,IAAI;AAAA,QACH,QAAQ;AAAA,QACR,UAAU;AAAA,QACV,OAAO,oBAAI,KAAK;AAAA,QAChB,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,WAAW;AAAA,QACX,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,WAAW,oBAAI,KAAK;AAAA,MACtB,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,KAAK,CAAC,EAC3B,UAAU;AACb,aAAO;AAAA,IACT,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,MAAM,cACJ,SACA,YACiC;AACjC,SAAK;AAEL,eAAW,SAAS,SAAS;AAC3B,YAAM,OAAO,MAAM;AACnB,YAAM,OAAO,KAAK,QAAQ;AAC1B,YAAM,cAAc,KAAK,SAAS;AAAA,QAChC,UAAU;AAAA,QACV,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AACA,YAAM,yBACH,KAAK,aAA+C;AACvD,YAAM,4BACJ,OAAO,2BAA2B,WAAW,yBAAyB;AACxE,YAAM,gBACH,KAAK,aAAa,iBACnB;AACF,YAAM,oBACH,KAAK,QAA0C;AAClD,YAAM,uBACJ,OAAO,sBAAsB,WAAW,oBAAoB;AAC9D,YAAM,iBAAiB,KAAK,QAAQ,YAAY;AAChD,YAAM,YAAY,KAAK,aAAa;AACpC,YAAM,aAAa,KAAK,cAAc;AACtC,YAAM,kBAAkB,KAAK,OAAO,UAAU;AAK9C,YAAM,kBAAkB;AAKxB,YAAM,KAAK,GACR,OAAO,IAAI,EACX,OAAO;AAAA,QACN,MAAM,MAAM;AAAA,QACZ,SAAS;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,wBAAwB;AAAA,QACxB;AAAA,QACA,mBAAmB;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC,EACA,mBAAmB;AAAA,QAClB,QAAQ,KAAK;AAAA,QACb,KAAK;AAAA,UACH,MAAM;AAAA,UACN,iBAAiB;AAAA,UACjB,aAAa;AAAA,UACb,WAAW;AAAA,UACX,wBAAwB;AAAA,UACxB,eAAe;AAAA,UACf,mBAAmB;AAAA,UACnB,gBAAgB;AAAA,UAChB,iBAAiB;AAAA,UACjB,YAAY;AAAA,UACZ,SAAS,MAAM,KAAK,OAAO;AAAA,UAC3B,WAAW;AAAA,QACb;AAAA;AAAA;AAAA;AAAA;AAAA,QAKA,UAAU;AAAA,cACN,KAAK,IAAI;AAAA,cACT,KAAK,WAAW;AAAA,cAChB,KAAK,SAAS;AAAA,cACd,KAAK,sBAAsB;AAAA,cAC3B,KAAK,aAAa;AAAA,cAClB,KAAK,iBAAiB;AAAA,cACtB,KAAK,cAAc;AAAA,cACnB,KAAK,eAAe;AAAA,cACpB,KAAK,UAAU;AAAA,cACf,KAAK,eAAe;AAAA;AAAA,MAE1B,CAAC;AAAA,IACL;AAGA,UAAM,QAAQ,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI;AACvC,UAAM,UACJ,MAAM,WAAW,IACb,MAAM,KAAK,GAAG,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC,EAAE,KAAK,IAAI,IACnD,MAAM,KAAK,GACR,OAAO,EAAE,MAAM,KAAK,KAAK,CAAC,EAC1B,KAAK,IAAI,EACT,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC;AAE3C,WAAO,EAAE,UAAU,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE;AAAA,EAChD;AACF;AA5ba,yBAAN;AAAA,EADN,WAAW;AAAA,EAMP,0BAAO,OAAO;AAAA,EACd,0BAAO,iBAAiB;AAAA,GANhB;AAgcb,SAAS,YAAY,UAA0B;AAG7C,QAAM,UAAU,SAAS,IAAI,CAAC,MAAM,GAAG,QAAQ,QAAQ,CAAC,CAAC;AACzD,SAAO,IAAI,GAAG,OAAO;AACvB;","names":["dedupeKey"]}

package/dist/chunk-6DWFJNIK.js

@@ -0,0 +1,15 @@
+import {
+  MissingTenantIdError
+} from "./chunk-NXXDZ6ZF.js";
+
+// runtime/subsystems/bridge/assert-tenant-id.ts
+function assertTenantId(site, multiTenant, tenantId) {
+  if (multiTenant && tenantId === void 0) {
+    throw new MissingTenantIdError(site);
+  }
+}
+
+export {
+  assertTenantId
+};
+//# sourceMappingURL=chunk-6DWFJNIK.js.map

package/dist/chunk-6DWFJNIK.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/bridge/assert-tenant-id.ts"],"sourcesContent":["/**\n * `assertTenantId` — shared multi-tenancy enforcement helper for the\n * bridge subsystem (BRIDGE-8, ADR-023 §Multi-tenancy null-tenantId).\n *\n * Single source of truth for the three enforcement sites named in\n * ADR-023 §Multi-tenancy and the BRIDGE-2 spec:\n *\n *   (a) `EventFlowService.publishAndStart`           — request-path entry\n *   (b) `BridgeDeliveryHandler.run`                  — wrapper handler entry\n *   (c) `DrizzleBridgeDeliveryRepo.insertDelivery`   — last-line repo defense\n *\n * Contract (mirrors JOB-8 / SYNC-6 — locked 2026-04-18 for jobs and\n * carried into the bridge here):\n *\n *   - `multiTenant === false`           → no-op (always passes).\n *   - `multiTenant === true`,\n *      `tenantId === undefined`         → throw `MissingTenantIdError(site)`.\n *   - `multiTenant === true`,\n *      `tenantId === null`              → passes; opts the call into\n *                                          cross-tenant work (system\n *                                          housekeeping, framework events\n *                                          with no owning tenant). Persists\n *                                          to the DB as `tenant_id = NULL`.\n *   - `multiTenant === true`,\n *      `tenantId` is a string           → passes.\n *\n * The strict `undefined`-vs-`null` discrimination is the entire point —\n * silent defaulting is exactly the failure mode that lets cross-tenant\n * leaks ship.\n */\nimport { MissingTenantIdError } from './bridge-errors';\n\n/**\n * Throws `MissingTenantIdError(site)` if `multiTenant === true` and\n * `tenantId === undefined`. Explicit `null` always passes.\n *\n * @param site         Canonical site name — one of:\n *                     `'EventFlowService.publishAndStart'`,\n *                     `'BridgeDeliveryHandler.run'`,\n *                     `'DrizzleBridgeDeliveryRepo.insertDelivery'`.\n *                     Stable strings; ops dashboards / review reports key\n *                     on these. Use the same string the existing tests\n *                     and `MissingTenantIdError` JSDoc enumerate.\n * @param multiTenant  Resolved `BRIDGE_MULTI_TENANT` flag (from\n *                     `BridgeModule.forRoot({ multiTenant })`).\n * @param tenantId     The tenantId the caller supplied (or didn't).\n */\nexport function assertTenantId(\n  site: string,\n  multiTenant: boolean,\n  tenantId: string | null | undefined,\n): void {\n  if (multiTenant && tenantId === undefined) {\n    throw new MissingTenantIdError(site);\n  }\n  // explicit null passes — opts into cross-tenant work\n}\n"],"mappings":";;;;;AA+CO,SAAS,eACd,MACA,aACA,UACM;AACN,MAAI,eAAe,aAAa,QAAW;AACzC,UAAM,IAAI,qBAAqB,IAAI;AAAA,EACrC;AAEF;","names":[]}

package/dist/chunk-6I7ULIN6.js

@@ -0,0 +1,15 @@
+import {
+  tokenKey
+} from "./chunk-GYGNEQSC.js";
+
+// runtime/subsystems/analytics/analytics.tokens.ts
+var ANALYTICS_QUERY = "ANALYTICS_QUERY";
+var CUBE_API_URL = Symbol.for(tokenKey("analytics", "cube-api-url"));
+var CUBE_API_SECRET = Symbol.for(tokenKey("analytics", "cube-api-secret"));
+
+export {
+  ANALYTICS_QUERY,
+  CUBE_API_URL,
+  CUBE_API_SECRET
+};
+//# sourceMappingURL=chunk-6I7ULIN6.js.map

package/dist/chunk-6I7ULIN6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/analytics/analytics.tokens.ts"],"sourcesContent":["/**\n * Injection tokens for the analytics subsystem.\n *\n * String constants (not Symbols) so they match by value across import\n * boundaries — same convention as events.tokens.ts.\n *\n * Usage in services:\n * ```typescript\n * constructor(@Inject(ANALYTICS_QUERY) private readonly analytics: IAnalyticsQuery) {}\n * ```\n */\nimport { tokenKey } from '../token-key';\n\nexport const ANALYTICS_QUERY = 'ANALYTICS_QUERY' as const;\n\n// ADR-037: namespaced `Symbol.for(...)` keys (via `tokenKey()`) so these tokens\n// match by value across import boundaries (package vs vendored runtime copy).\n/**\n * Injection token for the cube.js API URL.\n * Provided automatically by AnalyticsModule.forRoot({ backend: 'cube' }).\n */\nexport const CUBE_API_URL = Symbol.for(tokenKey('analytics', 'cube-api-url'));\n\n/**\n * Injection token for the cube.js API secret.\n * Provided automatically by AnalyticsModule.forRoot({ backend: 'cube' }).\n */\nexport const CUBE_API_SECRET = Symbol.for(tokenKey('analytics', 'cube-api-secret'));\n"],"mappings":";;;;;AAaO,IAAM,kBAAkB;AAQxB,IAAM,eAAe,OAAO,IAAI,SAAS,aAAa,cAAc,CAAC;AAMrE,IAAM,kBAAkB,OAAO,IAAI,SAAS,aAAa,iBAAiB,CAAC;","names":[]}

package/dist/chunk-6XY6ZMMD.js

@@ -0,0 +1,25 @@
+import {
+  tokenKey
+} from "./chunk-GYGNEQSC.js";
+
+// runtime/subsystems/auth/auth.tokens.ts
+var ENCRYPTION_KEY = Symbol.for(tokenKey("auth", "encryption-key"));
+var OAUTH_STATE_STORE = Symbol.for(tokenKey("auth", "oauth-state-store"));
+var AUTH_CONNECTION_READER = Symbol.for(tokenKey("auth", "connection-reader"));
+var AUTH_CONNECTION_TOKEN_WRITER = Symbol.for(tokenKey("auth", "connection-token-writer"));
+var AUTH_CONNECTION_GRANT_SINK = Symbol.for(tokenKey("auth", "connection-grant-sink"));
+var AUTH_USER_CONTEXT = Symbol.for(tokenKey("auth", "user-context"));
+var STRATEGY_REGISTRY = Symbol.for(tokenKey("auth", "strategy-registry"));
+var AUTH_OPTIONS = Symbol.for(tokenKey("auth", "options"));
+
+export {
+  ENCRYPTION_KEY,
+  OAUTH_STATE_STORE,
+  AUTH_CONNECTION_READER,
+  AUTH_CONNECTION_TOKEN_WRITER,
+  AUTH_CONNECTION_GRANT_SINK,
+  AUTH_USER_CONTEXT,
+  STRATEGY_REGISTRY,
+  AUTH_OPTIONS
+};
+//# sourceMappingURL=chunk-6XY6ZMMD.js.map

package/dist/chunk-6XY6ZMMD.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/auth/auth.tokens.ts"],"sourcesContent":["/**\n * Auth subsystem — injection tokens.\n *\n * Following ADR-008 guidance: `Symbol()` tokens for type safety and collision\n * avoidance. Consumers inject these via `@Inject(...)` against the matching\n * protocol interface.\n *\n * Usage:\n * ```typescript\n * constructor(\n *   @Inject(ENCRYPTION_KEY) private readonly key: IEncryptionKey,\n *   @Inject(OAUTH_STATE_STORE) private readonly states: IOAuthStateStore,\n *   @Inject(AUTH_CONNECTION_READER) private readonly reader: IConnectionReader,\n *   @Inject(AUTH_CONNECTION_TOKEN_WRITER) private readonly writer: IConnectionTokenWriter,\n *   @Inject(AUTH_CONNECTION_GRANT_SINK) private readonly grants: IConnectionGrantSink,\n *   @Inject(AUTH_USER_CONTEXT) private readonly userCtx: IUserContext,\n *   @Inject(STRATEGY_REGISTRY) private readonly registry: ProviderStrategyRegistry,\n * ) {}\n * ```\n *\n * `IAuthStrategy` implementations are provider-specific and registered under\n * provider-specific tokens (e.g. `SALESFORCE_AUTH_STRATEGY`,\n * `HUBSPOT_AUTH_STRATEGY`) by each connection module — this subsystem does\n * not mandate a single `AUTH_STRATEGY` token because an app typically has\n * many concurrent strategies, one per provider. They are dispatched through\n * `STRATEGY_REGISTRY` (a `ReadonlyMap<slug, IProviderStrategy>`), populated\n * by per-provider modules via a `useFactory` provider.\n */\nimport { tokenKey } from '../token-key';\n\n// ADR-037: namespaced `Symbol.for(...)` keys so a token matches by VALUE across\n// import boundaries — the package copy and a (legacy) vendored copy resolve to\n// the SAME symbol, eliminating the dual-package DI-token identity hazard that\n// crashed boot once the emitter began emitting `STRATEGY_REGISTRY` as a runtime\n// value (RFC-0003 R5). Matches the convention surface packages already use.\nexport const ENCRYPTION_KEY = Symbol.for(tokenKey('auth', 'encryption-key'));\nexport const OAUTH_STATE_STORE = Symbol.for(tokenKey('auth', 'oauth-state-store'));\nexport const AUTH_CONNECTION_READER = Symbol.for(tokenKey('auth', 'connection-reader'));\nexport const AUTH_CONNECTION_TOKEN_WRITER = Symbol.for(tokenKey('auth', 'connection-token-writer'));\nexport const AUTH_CONNECTION_GRANT_SINK = Symbol.for(tokenKey('auth', 'connection-grant-sink'));\nexport const AUTH_USER_CONTEXT = Symbol.for(tokenKey('auth', 'user-context'));\nexport const STRATEGY_REGISTRY = Symbol.for(tokenKey('auth', 'strategy-registry'));\n/**\n * Holds the resolved `AuthModuleOptions` (used by `AuthController` to read\n * `redirectUriBase` for building per-provider callback URIs).\n */\nexport const AUTH_OPTIONS = Symbol.for(tokenKey('auth', 'options'));\n"],"mappings":";;;;;AAmCO,IAAM,iBAAiB,OAAO,IAAI,SAAS,QAAQ,gBAAgB,CAAC;AACpE,IAAM,oBAAoB,OAAO,IAAI,SAAS,QAAQ,mBAAmB,CAAC;AAC1E,IAAM,yBAAyB,OAAO,IAAI,SAAS,QAAQ,mBAAmB,CAAC;AAC/E,IAAM,+BAA+B,OAAO,IAAI,SAAS,QAAQ,yBAAyB,CAAC;AAC3F,IAAM,6BAA6B,OAAO,IAAI,SAAS,QAAQ,uBAAuB,CAAC;AACvF,IAAM,oBAAoB,OAAO,IAAI,SAAS,QAAQ,cAAc,CAAC;AACrE,IAAM,oBAAoB,OAAO,IAAI,SAAS,QAAQ,mBAAmB,CAAC;AAK1E,IAAM,eAAe,OAAO,IAAI,SAAS,QAAQ,SAAS,CAAC;","names":[]}