@pattern-stack/codegen 0.4.2 → 0.4.3

package/dist/runtime/subsystems/jobs/job-orchestrator.memory-backend.d.ts

@@ -1,3 +1,4 @@
+import { ModuleRef } from '@nestjs/core';
 import { JobRunRow } from './job-orchestration.schema.js';
 import { I as IJobOrchestrator, g as JobHandlerMeta, f as JobHandlerBase, j as JobUpsertEntry, h as JobPoolDef, l as StartOptions, i as JobRun, C as CancelOptions } from '../../../job-orchestrator.protocol-BwsBd37o.js';
 import { MemoryJobStore } from './memory-job-store.js';
@@ -20,6 +21,7 @@ declare class MemoryJobOrchestrator implements IJobOrchestrator {
     private readonly store;
     private readonly stepService;
     private readonly multiTenant;
+    private readonly moduleRef?;
     private readonly logger;
     private readonly mutex;
     private readonly handlerRegistry;
@@ -30,7 +32,7 @@ declare class MemoryJobOrchestrator implements IJobOrchestrator {
      * back to `now()` so it becomes claimable.
      */
     private readonly queueBlockers;
-    constructor(store: MemoryJobStore, stepService: MemoryJobStepService, multiTenant: boolean);
+    constructor(store: MemoryJobStore, stepService: MemoryJobStepService, multiTenant: boolean, moduleRef?: ModuleRef | undefined);
     /**
      * JOB-8 — mirror of the Drizzle backend's `resolveTenantId`. Returns the
      * value to stamp on `tenant_id` / compare against in memory predicates.

package/dist/runtime/subsystems/jobs/job-orchestrator.memory-backend.js

@@ -12,7 +12,7 @@ var __decorateParam = (index, decorator) => (target, key) => decorator(target, k
 
 // runtime/subsystems/jobs/job-orchestrator.memory-backend.ts
 import { randomUUID } from "crypto";
-import { Inject, Injectable, Logger } from "@nestjs/common";
+import { Inject, Injectable, Logger, Optional } from "@nestjs/common";
 
 // runtime/subsystems/jobs/job-handler.base.ts
 var JOB_HANDLER_REGISTRY = /* @__PURE__ */ new Map();
@@ -126,14 +126,16 @@ var PromiseMutex = class {
   }
 };
 var MemoryJobOrchestrator = class {
-  constructor(store, stepService, multiTenant) {
+  constructor(store, stepService, multiTenant, moduleRef) {
     this.store = store;
     this.stepService = stepService;
     this.multiTenant = multiTenant;
+    this.moduleRef = moduleRef;
   }
   store;
   stepService;
   multiTenant;
+  moduleRef;
   logger = new Logger(MemoryJobOrchestrator.name);
   mutex = new PromiseMutex();
   handlerRegistry = /* @__PURE__ */ new Map();
@@ -474,7 +476,9 @@ var MemoryJobOrchestrator = class {
     }
     const meta = registration.meta;
     const HandlerClass = registration.handlerClass;
-    const handler = new HandlerClass();
+    const handler = this.moduleRef ? await this.moduleRef.create(
+      HandlerClass
+    ) : new HandlerClass();
     const ctx = {
       input: run.input,
       run,
@@ -654,7 +658,8 @@ var MemoryJobOrchestrator = class {
 };
 MemoryJobOrchestrator = __decorateClass([
   Injectable(),
-  __decorateParam(2, Inject(JOBS_MULTI_TENANT))
+  __decorateParam(2, Inject(JOBS_MULTI_TENANT)),
+  __decorateParam(3, Optional())
 ], MemoryJobOrchestrator);
 function classifyError(err, policy, currentAttempts) {
   if (!policy) return "fail";

package/dist/runtime/subsystems/jobs/job-orchestrator.memory-backend.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../runtime/subsystems/jobs/job-orchestrator.memory-backend.ts","../../../../runtime/subsystems/jobs/job-handler.base.ts","../../../../runtime/subsystems/jobs/jobs-errors.ts","../../../../runtime/subsystems/jobs/jobs-domain.tokens.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 } from '@nestjs/common';\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    private readonly store: MemoryJobStore,\n    private readonly stepService: MemoryJobStepService,\n    @Inject(JOBS_MULTI_TENANT) private readonly multiTenant: boolean,\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    const handler = 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","/**\n * Handler base class, JobContext, @JobHandler decorator, and policy types\n * for the job orchestration domain (ADR-022, JOB-2).\n *\n * User-authored jobs subclass `JobHandlerBase<TInput, TOutput>` and decorate\n * the class with `@JobHandler<TInput>('job_type', meta)`. The decorator\n *   1. stores metadata via `Reflect.defineMetadata` so Nest's reflector can\n *      pick it up at module boot, and\n *   2. populates `JOB_HANDLER_REGISTRY` — a module-singleton map consumed by\n *      `JobWorkerModule` (JOB-5) to materialise `job` rows and resolve\n *      handler classes during claim/execute.\n *\n * No runtime orchestration lives here; this file is a pure type + decorator\n * surface so downstream PRs (JOB-3..JOB-5) can implement against a stable\n * shape.\n */\n// TODO(logging-subsystem): swap to ILogger once ADR-028 lands\nimport type { Logger } from '@nestjs/common';\nimport type { JobRun } from './job-orchestrator.protocol';\n\n// ─── ParentClosePolicy ──────────────────────────────────────────────────────\n\n/**\n * What happens to running child runs when a parent enters a terminal state.\n * Stored on the child at spawn; changes to the parent after spawn do NOT\n * retroactively rewrite children.\n */\nexport enum ParentClosePolicy {\n  Terminate = 'terminate',\n  Cancel = 'cancel',\n  Abandon = 'abandon',\n}\n\n// ─── Policy types ───────────────────────────────────────────────────────────\n\nexport interface RetryPolicy {\n  attempts: number;\n  backoff: 'fixed' | 'exponential';\n  baseMs: number;\n  nonRetryableErrors?: string[];\n}\n\nexport interface ConcurrencyPolicy<TInput> {\n  key: (input: TInput) => string;\n  collisionMode: 'queue' | 'reject' | 'replace';\n}\n\nexport interface DedupePolicy<TInput> {\n  key: (input: TInput) => string;\n  windowMs: number;\n}\n\n/**\n * Declarative scope reference. `TScope` is parameterised so JOB-7 can narrow\n * `entity` to the generated `ScopeEntityType` union at the call site without\n * modifying this file (OQ-1 resolution, 2026-04-20).\n */\nexport interface ScopeRef<TInput, TScope extends string = string> {\n  entity: TScope;\n  from: (input: TInput) => string;\n}\n\nexport interface JobHandlerMeta<TInput> {\n  pool?: string;\n  scope?: ScopeRef<TInput>;\n  retry?: RetryPolicy;\n  concurrency?: ConcurrencyPolicy<TInput>;\n  dedupe?: DedupePolicy<TInput>;\n  timeoutMs?: number;\n  replayFrom?: 'scratch' | 'last_step' | 'last_checkpoint';\n}\n\n// ─── Runtime option shapes ──────────────────────────────────────────────────\n\nexport interface StepOptions {\n  retry?: RetryPolicy;\n  timeoutMs?: number;\n}\n\nexport interface SpawnChildOptions {\n  closePolicy?: ParentClosePolicy;\n  runAt?: Date;\n  priority?: number;\n  tags?: Record<string, string>;\n}\n\n// ─── JobContext ─────────────────────────────────────────────────────────────\n\nexport interface JobContext<TInput> {\n  readonly input: TInput;\n  readonly run: JobRun;\n  step<TOutput>(\n    stepId: string,\n    fn: () => Promise<TOutput>,\n    opts?: StepOptions,\n  ): Promise<TOutput>;\n  spawnChild(type: string, input: unknown, opts?: SpawnChildOptions): Promise<JobRun>;\n  readonly logger: Logger;\n  // NOT in Phase 1 — deferred to ADR-025:\n  //   waitFor(kind, token, opts)\n  //   signal(token, payload)\n  //   sleep(ms)\n}\n\n// ─── JobHandlerBase ─────────────────────────────────────────────────────────\n\nexport abstract class JobHandlerBase<TInput, TOutput = unknown> {\n  abstract run(ctx: JobContext<TInput>): Promise<TOutput>;\n}\n\n// ─── Registry + decorator ───────────────────────────────────────────────────\n\n/**\n * Module-singleton map keyed by job type. Populated by the `@JobHandler`\n * decorator at class definition time; consumed by `JobWorkerModule` (JOB-5)\n * to upsert `job` rows and resolve handler classes during claim/execute.\n */\nexport const JOB_HANDLER_REGISTRY = new Map<\n  string,\n  {\n    type: string;\n    meta: JobHandlerMeta<unknown>;\n    handlerClass: new (...args: unknown[]) => JobHandlerBase<unknown>;\n  }\n>();\n\nexport const JOB_HANDLER_METADATA_KEY = Symbol('JobHandlerMeta');\n\n/**\n * Class decorator that registers a handler with the job type, the full\n * metadata shape, and the target class constructor.\n *\n * Duplicate-type behaviour (OQ-3, resolved 2026-04-18):\n *   - `NODE_ENV === 'production'` → throw; silent overwrite in prod is a\n *     correctness bug.\n *   - `NODE_ENV === 'test'`       → silent overwrite (tests intentionally\n *     re-register handlers).\n *   - otherwise (dev)             → `console.warn` + overwrite. `console`\n *     is used intentionally instead of the Nest `Logger` — decorators run\n *     at module-load time before any Nest container exists.\n */\nexport function JobHandler<TInput>(\n  type: string,\n  meta: JobHandlerMeta<TInput>,\n): ClassDecorator {\n  return (target) => {\n    if (JOB_HANDLER_REGISTRY.has(type)) {\n      const env = process.env.NODE_ENV;\n      if (env === 'production') {\n        throw new Error(\n          `[JobHandler] Duplicate registration for job type '${type}'. ` +\n            `Each @JobHandler must declare a unique type.`,\n        );\n      }\n      if (env !== 'test') {\n        // eslint-disable-next-line no-console\n        console.warn(\n          `[JobHandler] Duplicate registration for job type '${type}'. ` +\n            `Overwriting previous handler — this is almost certainly a bug.`,\n        );\n      }\n    }\n\n    Reflect.defineMetadata(JOB_HANDLER_METADATA_KEY, { type, meta }, target);\n    JOB_HANDLER_REGISTRY.set(type, {\n      type,\n      meta: meta as JobHandlerMeta<unknown>,\n      handlerClass: target as unknown as new (\n        ...args: unknown[]\n      ) => JobHandlerBase<unknown>,\n    });\n  };\n}\n\n// ─── HandlerRegistry — read helpers consumed by JobWorkerModule (JOB-5) ─────\n\n/**\n * Single entry shape returned by `HandlerRegistry.getAll()` / `.get()` and\n * exposed to `JobWorkerModule.onModuleInit` for boot-time upserts.\n *\n * Structurally compatible with `IJobOrchestrator.upsertJobRows`'s\n * `JobUpsertEntry` so the worker module can pass entries through verbatim\n * without re-mapping.\n */\nexport interface HandlerRegistryEntry {\n  type: string;\n  meta: JobHandlerMeta<unknown>;\n  handlerClass: new (...args: unknown[]) => JobHandlerBase<unknown>;\n}\n\n/**\n * Read facade over `JOB_HANDLER_REGISTRY`. The decorator's write path is\n * unchanged; this namespace exists so consumers (the worker module, tests)\n * don't import the raw `Map` and accidentally mutate it.\n */\nexport namespace HandlerRegistry {\n  /** All registered entries in insertion order. */\n  export function getAll(): HandlerRegistryEntry[] {\n    return Array.from(JOB_HANDLER_REGISTRY.values());\n  }\n\n  /** Lookup by job type, or `undefined` if no `@JobHandler` is registered. */\n  export function get(type: string): HandlerRegistryEntry | undefined {\n    return JOB_HANDLER_REGISTRY.get(type);\n  }\n}\n","/**\n * Typed errors for the job orchestration domain (ADR-022, JOB-3).\n *\n * All thrown by the Drizzle orchestrator (and mirrored by the Memory\n * backend in JOB-4). They exist as classes so consumers can `instanceof`\n * them in catch blocks and exception filters can map them to HTTP codes.\n */\nimport type { JobRun } from './job-orchestrator.protocol';\n\n/**\n * `start(type, …)` was called for a job type that has no row in the `job`\n * table. At runtime this usually means the handler was not decorated or the\n * boot validator (JOB-5) has not registered it yet.\n */\nexport class JobTypeNotFoundError extends Error {\n  override readonly name = 'JobTypeNotFoundError';\n  constructor(public readonly jobType: string) {\n    super(`No job definition registered for type '${jobType}'.`);\n  }\n}\n\n/**\n * Thrown by `start` when `collision_mode === 'reject'` and a non-terminal\n * run with the same `concurrency_key` already exists. Carries the incumbent\n * so callers can surface its id or subscribe to its completion event.\n */\nexport class JobCollisionError extends Error {\n  override readonly name = 'JobCollisionError';\n  constructor(\n    public readonly jobType: string,\n    public readonly concurrencyKey: string,\n    public readonly incumbent: JobRun,\n  ) {\n    super(\n      `Job type '${jobType}' has an in-flight run with concurrency_key ` +\n        `'${concurrencyKey}' (incumbent ${incumbent.id}); collision_mode=reject.`,\n    );\n  }\n}\n\n/**\n * `replay` was called on a run that is not in a replayable terminal state\n * (i.e. still `pending` / `running` / `waiting`). Replay always spawns\n * fresh execution and therefore requires the source run to be settled.\n */\nexport class JobNotReplayableError extends Error {\n  override readonly name = 'JobNotReplayableError';\n  constructor(\n    public readonly runId: string,\n    public readonly currentStatus: string,\n  ) {\n    super(\n      `Run ${runId} is not replayable from status '${currentStatus}'. ` +\n        `Only 'completed', 'failed', 'timed_out', and 'canceled' are eligible.`,\n    );\n  }\n}\n\n/**\n * A `concurrency_key_template` or `dedupe_key_template` referenced a field\n * that is not present on the input payload. Caught at `start` time so the\n * caller sees the misconfiguration synchronously rather than at claim time.\n */\nexport class JobTemplateFieldMissingError extends Error {\n  override readonly name = 'JobTemplateFieldMissingError';\n  constructor(\n    public readonly template: string,\n    public readonly field: string,\n  ) {\n    super(\n      `Template '${template}' references input field '${field}' which is ` +\n        `missing or undefined on the payload.`,\n    );\n  }\n}\n\n/**\n * Thrown by the four multi-tenant-aware service-layer backends (JOB-8)\n * when `JobsDomainModule` was configured with `multiTenant: true` but the\n * caller did not pass a `tenantId` in the relevant options object.\n *\n * **Strict enforcement rationale (resolved 2026-04-18).** Cross-tenant data\n * leakage is the worst class of bug a multi-tenant system can ship; surfacing\n * the misuse loudly at the call site (rather than silently defaulting to\n * `null` or to the \"last tenant seen\") prevents both accidental global\n * writes and sneaky reads that return a union of tenants.\n *\n * - `undefined` `tenantId` → throw this error.\n * - Explicit `null` `tenantId` → passes; opts the call into cross-tenant\n *   background work (e.g. a nightly housekeeping job that must scan all\n *   tenants). The row is persisted with `tenant_id = NULL`.\n */\nexport class MissingTenantIdError extends Error {\n  override readonly name = 'MissingTenantIdError';\n  constructor(public readonly method: string) {\n    super(\n      `MissingTenantIdError: JobsDomainModule was configured with ` +\n        `multiTenant=true but ${method} was called without tenantId ` +\n        `(undefined). Pass an explicit tenantId, or pass null for ` +\n        `cross-tenant work.`,\n    );\n  }\n}\n\n/**\n * Thrown by `JobWorkerModule.onModuleInit` (Drizzle backend only) when the\n * `job` table contains type rows for which no `@JobHandler` is registered\n * in the running process. Surfaces every orphaned type at once so a single\n * boot tells the operator everything to clean up.\n *\n * Skipped entirely in memory mode (Q4 resolution 2026-04-19) — the memory\n * backend has no DB rows to validate; `MemoryJobOrchestrator.start()`\n * throws `JobTypeNotFoundError` synchronously for unknown types instead.\n */\nexport class BootValidationError extends Error {\n  override readonly name = 'BootValidationError';\n  constructor(public readonly missingHandlers: string[]) {\n    super(\n      `BootValidationError: ${missingHandlers.length} orphaned job type(s) ` +\n        `in 'job' table with no matching @JobHandler in the running process: ` +\n        `[${missingHandlers.join(', ')}]. Either register the handler(s) or ` +\n        `remove the rows.`,\n    );\n  }\n}\n\n/**\n * Thrown by `JobWorkerModule.onModuleInit` when one or more `@JobHandler`\n * classes target a `reserved: true` pool from the resolved pool config\n * (the three `events_*` pools are reserved for the events subsystem\n * outbox drain). Listing every offender on a single boot avoids the\n * fix-one-restart-fix-next loop.\n */\nexport class ReservedPoolViolationError extends Error {\n  override readonly name = 'ReservedPoolViolationError';\n  constructor(\n    public readonly offenders: ReadonlyArray<{\n      handlerClass: string;\n      pool: string;\n    }>,\n  ) {\n    super(\n      `ReservedPoolViolationError: ${offenders.length} @JobHandler(s) target ` +\n        `reserved pools — reserved pools are framework-only:\\n` +\n        offenders\n          .map((o) => `  - ${o.handlerClass} → pool='${o.pool}'`)\n          .join('\\n'),\n    );\n  }\n}\n","/**\n * Injection tokens for the job orchestration domain layer (ADR-022, JOB-2).\n *\n * Consumer code injects these symbols via `@Inject(JOB_ORCHESTRATOR)` etc.;\n * concrete backends (JOB-3 Drizzle, JOB-4 Memory) provide the implementations\n * through `JobsDomainModule.forRoot({ backend })` in JOB-5.\n *\n * Each token is a unique `Symbol` — guaranteed distinct from every other\n * Symbol at runtime, which is exactly the uniqueness guarantee Nest's DI\n * container relies on for token-based lookup.\n */\nexport const JOB_ORCHESTRATOR = Symbol('JOB_ORCHESTRATOR');\nexport const JOB_RUN_SERVICE = Symbol('JOB_RUN_SERVICE');\nexport const JOB_STEP_SERVICE = Symbol('JOB_STEP_SERVICE');\n\n/**\n * Multi-tenancy opt-in flag (JOB-8). Bound to the boolean passed in via\n * `JobsDomainModule.forRoot({ multiTenant })`, defaulting to `false`.\n *\n * When `true`, the four service-layer backends (Drizzle + Memory orchestrator\n * and run-service) enforce `tenantId` on every mutating / targeted-read call:\n * `start`, `cancel`, `listForScope`, `cancelForScope`, `rescheduleForScope`.\n * Missing (`undefined`) `tenantId` throws `MissingTenantIdError`; explicit\n * `null` opts into cross-tenant background work and passes through.\n *\n * The JobWorker claim loop is **cross-tenant by design** — the worker has no\n * tenant context; `tenantId` is populated at write time and enforced on\n * targeted reads. See docs/specs/JOB-8.md.\n */\nexport const JOBS_MULTI_TENANT = Symbol('JOBS_MULTI_TENANT');\n"],"mappings":";;;;;;;;;;;;;AAeA,SAAS,kBAAkB;AAC3B,SAAS,QAAQ,YAAY,cAAc;;;ACqGpC,IAAM,uBAAuB,oBAAI,IAOtC;AAuEK,IAAU;AAAA,CAAV,CAAUA,qBAAV;AAEE,WAAS,SAAiC;AAC/C,WAAO,MAAM,KAAK,qBAAqB,OAAO,CAAC;AAAA,EACjD;AAFO,EAAAA,iBAAS;AAKT,WAAS,IAAI,MAAgD;AAClE,WAAO,qBAAqB,IAAI,IAAI;AAAA,EACtC;AAFO,EAAAA,iBAAS;AAAA,GAPD;;;ACrLV,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAE9C,YAA4B,SAAiB;AAC3C,UAAM,0CAA0C,OAAO,IAAI;AADjC;AAAA,EAE5B;AAAA,EAF4B;AAAA,EADV,OAAO;AAI3B;AAOO,IAAM,oBAAN,cAAgC,MAAM;AAAA,EAE3C,YACkB,SACA,gBACA,WAChB;AACA;AAAA,MACE,aAAa,OAAO,gDACd,cAAc,gBAAgB,UAAU,EAAE;AAAA,IAClD;AAPgB;AACA;AACA;AAAA,EAMlB;AAAA,EARkB;AAAA,EACA;AAAA,EACA;AAAA,EAJA,OAAO;AAW3B;AAOO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAE/C,YACkB,OACA,eAChB;AACA;AAAA,MACE,OAAO,KAAK,mCAAmC,aAAa;AAAA,IAE9D;AANgB;AACA;AAAA,EAMlB;AAAA,EAPkB;AAAA,EACA;AAAA,EAHA,OAAO;AAU3B;AAOO,IAAM,+BAAN,cAA2C,MAAM;AAAA,EAEtD,YACkB,UACA,OAChB;AACA;AAAA,MACE,aAAa,QAAQ,6BAA6B,KAAK;AAAA,IAEzD;AANgB;AACA;AAAA,EAMlB;AAAA,EAPkB;AAAA,EACA;AAAA,EAHA,OAAO;AAU3B;AAkBO,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAE9C,YAA4B,QAAgB;AAC1C;AAAA,MACE,mFAC0B,MAAM;AAAA,IAGlC;AAN0B;AAAA,EAO5B;AAAA,EAP4B;AAAA,EADV,OAAO;AAS3B;;;ACzEO,IAAM,oBAAoB,uBAAO,mBAAmB;;;AH0B3D,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,YACmB,OACA,aAC2B,aAC5C;AAHiB;AACA;AAC2B;AAAA,EAC3C;AAAA,EAHgB;AAAA,EACA;AAAA,EAC2B;AAAA,EAf7B,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,EAanD,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,cAAMC,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;AAClC,UAAM,UAAU,IAAI,aAAa;AAEjC,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;AA9qBa,wBAAN;AAAA,EADN,WAAW;AAAA,EAiBP,0BAAO,iBAAiB;AAAA,GAhBhB;AAkrBb,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":["HandlerRegistry","dedupeKey"]}
+{"version":3,"sources":["../../../../runtime/subsystems/jobs/job-orchestrator.memory-backend.ts","../../../../runtime/subsystems/jobs/job-handler.base.ts","../../../../runtime/subsystems/jobs/jobs-errors.ts","../../../../runtime/subsystems/jobs/jobs-domain.tokens.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    private readonly store: MemoryJobStore,\n    private readonly stepService: MemoryJobStepService,\n    @Inject(JOBS_MULTI_TENANT) private readonly multiTenant: boolean,\n    @Optional() 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    const handler = this.moduleRef\n      ? ((await this.moduleRef.create(\n          HandlerClass as unknown as new (...args: unknown[]) => unknown,\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","/**\n * Handler base class, JobContext, @JobHandler decorator, and policy types\n * for the job orchestration domain (ADR-022, JOB-2).\n *\n * User-authored jobs subclass `JobHandlerBase<TInput, TOutput>` and decorate\n * the class with `@JobHandler<TInput>('job_type', meta)`. The decorator\n *   1. stores metadata via `Reflect.defineMetadata` so Nest's reflector can\n *      pick it up at module boot, and\n *   2. populates `JOB_HANDLER_REGISTRY` — a module-singleton map consumed by\n *      `JobWorkerModule` (JOB-5) to materialise `job` rows and resolve\n *      handler classes during claim/execute.\n *\n * No runtime orchestration lives here; this file is a pure type + decorator\n * surface so downstream PRs (JOB-3..JOB-5) can implement against a stable\n * shape.\n */\n// TODO(logging-subsystem): swap to ILogger once ADR-028 lands\nimport type { Logger } from '@nestjs/common';\nimport type { JobRun } from './job-orchestrator.protocol';\n\n// ─── ParentClosePolicy ──────────────────────────────────────────────────────\n\n/**\n * What happens to running child runs when a parent enters a terminal state.\n * Stored on the child at spawn; changes to the parent after spawn do NOT\n * retroactively rewrite children.\n */\nexport enum ParentClosePolicy {\n  Terminate = 'terminate',\n  Cancel = 'cancel',\n  Abandon = 'abandon',\n}\n\n// ─── Policy types ───────────────────────────────────────────────────────────\n\nexport interface RetryPolicy {\n  attempts: number;\n  backoff: 'fixed' | 'exponential';\n  baseMs: number;\n  nonRetryableErrors?: string[];\n}\n\nexport interface ConcurrencyPolicy<TInput> {\n  key: (input: TInput) => string;\n  collisionMode: 'queue' | 'reject' | 'replace';\n}\n\nexport interface DedupePolicy<TInput> {\n  key: (input: TInput) => string;\n  windowMs: number;\n}\n\n/**\n * Declarative scope reference. `TScope` is parameterised so JOB-7 can narrow\n * `entity` to the generated `ScopeEntityType` union at the call site without\n * modifying this file (OQ-1 resolution, 2026-04-20).\n */\nexport interface ScopeRef<TInput, TScope extends string = string> {\n  entity: TScope;\n  from: (input: TInput) => string;\n}\n\nexport interface JobHandlerMeta<TInput> {\n  pool?: string;\n  scope?: ScopeRef<TInput>;\n  retry?: RetryPolicy;\n  concurrency?: ConcurrencyPolicy<TInput>;\n  dedupe?: DedupePolicy<TInput>;\n  timeoutMs?: number;\n  replayFrom?: 'scratch' | 'last_step' | 'last_checkpoint';\n}\n\n// ─── Runtime option shapes ──────────────────────────────────────────────────\n\nexport interface StepOptions {\n  retry?: RetryPolicy;\n  timeoutMs?: number;\n}\n\nexport interface SpawnChildOptions {\n  closePolicy?: ParentClosePolicy;\n  runAt?: Date;\n  priority?: number;\n  tags?: Record<string, string>;\n}\n\n// ─── JobContext ─────────────────────────────────────────────────────────────\n\nexport interface JobContext<TInput> {\n  readonly input: TInput;\n  readonly run: JobRun;\n  step<TOutput>(\n    stepId: string,\n    fn: () => Promise<TOutput>,\n    opts?: StepOptions,\n  ): Promise<TOutput>;\n  spawnChild(type: string, input: unknown, opts?: SpawnChildOptions): Promise<JobRun>;\n  readonly logger: Logger;\n  // NOT in Phase 1 — deferred to ADR-025:\n  //   waitFor(kind, token, opts)\n  //   signal(token, payload)\n  //   sleep(ms)\n}\n\n// ─── JobHandlerBase ─────────────────────────────────────────────────────────\n\nexport abstract class JobHandlerBase<TInput, TOutput = unknown> {\n  abstract run(ctx: JobContext<TInput>): Promise<TOutput>;\n}\n\n// ─── Registry + decorator ───────────────────────────────────────────────────\n\n/**\n * Module-singleton map keyed by job type. Populated by the `@JobHandler`\n * decorator at class definition time; consumed by `JobWorkerModule` (JOB-5)\n * to upsert `job` rows and resolve handler classes during claim/execute.\n */\nexport const JOB_HANDLER_REGISTRY = new Map<\n  string,\n  {\n    type: string;\n    meta: JobHandlerMeta<unknown>;\n    handlerClass: new (...args: unknown[]) => JobHandlerBase<unknown>;\n  }\n>();\n\nexport const JOB_HANDLER_METADATA_KEY = Symbol('JobHandlerMeta');\n\n/**\n * Class decorator that registers a handler with the job type, the full\n * metadata shape, and the target class constructor.\n *\n * Duplicate-type behaviour (OQ-3, resolved 2026-04-18):\n *   - `NODE_ENV === 'production'` → throw; silent overwrite in prod is a\n *     correctness bug.\n *   - `NODE_ENV === 'test'`       → silent overwrite (tests intentionally\n *     re-register handlers).\n *   - otherwise (dev)             → `console.warn` + overwrite. `console`\n *     is used intentionally instead of the Nest `Logger` — decorators run\n *     at module-load time before any Nest container exists.\n */\nexport function JobHandler<TInput>(\n  type: string,\n  meta: JobHandlerMeta<TInput>,\n): ClassDecorator {\n  return (target) => {\n    if (JOB_HANDLER_REGISTRY.has(type)) {\n      const env = process.env.NODE_ENV;\n      if (env === 'production') {\n        throw new Error(\n          `[JobHandler] Duplicate registration for job type '${type}'. ` +\n            `Each @JobHandler must declare a unique type.`,\n        );\n      }\n      if (env !== 'test') {\n        // eslint-disable-next-line no-console\n        console.warn(\n          `[JobHandler] Duplicate registration for job type '${type}'. ` +\n            `Overwriting previous handler — this is almost certainly a bug.`,\n        );\n      }\n    }\n\n    Reflect.defineMetadata(JOB_HANDLER_METADATA_KEY, { type, meta }, target);\n    JOB_HANDLER_REGISTRY.set(type, {\n      type,\n      meta: meta as JobHandlerMeta<unknown>,\n      handlerClass: target as unknown as new (\n        ...args: unknown[]\n      ) => JobHandlerBase<unknown>,\n    });\n  };\n}\n\n// ─── HandlerRegistry — read helpers consumed by JobWorkerModule (JOB-5) ─────\n\n/**\n * Single entry shape returned by `HandlerRegistry.getAll()` / `.get()` and\n * exposed to `JobWorkerModule.onModuleInit` for boot-time upserts.\n *\n * Structurally compatible with `IJobOrchestrator.upsertJobRows`'s\n * `JobUpsertEntry` so the worker module can pass entries through verbatim\n * without re-mapping.\n */\nexport interface HandlerRegistryEntry {\n  type: string;\n  meta: JobHandlerMeta<unknown>;\n  handlerClass: new (...args: unknown[]) => JobHandlerBase<unknown>;\n}\n\n/**\n * Read facade over `JOB_HANDLER_REGISTRY`. The decorator's write path is\n * unchanged; this namespace exists so consumers (the worker module, tests)\n * don't import the raw `Map` and accidentally mutate it.\n */\nexport namespace HandlerRegistry {\n  /** All registered entries in insertion order. */\n  export function getAll(): HandlerRegistryEntry[] {\n    return Array.from(JOB_HANDLER_REGISTRY.values());\n  }\n\n  /** Lookup by job type, or `undefined` if no `@JobHandler` is registered. */\n  export function get(type: string): HandlerRegistryEntry | undefined {\n    return JOB_HANDLER_REGISTRY.get(type);\n  }\n}\n","/**\n * Typed errors for the job orchestration domain (ADR-022, JOB-3).\n *\n * All thrown by the Drizzle orchestrator (and mirrored by the Memory\n * backend in JOB-4). They exist as classes so consumers can `instanceof`\n * them in catch blocks and exception filters can map them to HTTP codes.\n */\nimport type { JobRun } from './job-orchestrator.protocol';\n\n/**\n * `start(type, …)` was called for a job type that has no row in the `job`\n * table. At runtime this usually means the handler was not decorated or the\n * boot validator (JOB-5) has not registered it yet.\n */\nexport class JobTypeNotFoundError extends Error {\n  override readonly name = 'JobTypeNotFoundError';\n  constructor(public readonly jobType: string) {\n    super(`No job definition registered for type '${jobType}'.`);\n  }\n}\n\n/**\n * Thrown by `start` when `collision_mode === 'reject'` and a non-terminal\n * run with the same `concurrency_key` already exists. Carries the incumbent\n * so callers can surface its id or subscribe to its completion event.\n */\nexport class JobCollisionError extends Error {\n  override readonly name = 'JobCollisionError';\n  constructor(\n    public readonly jobType: string,\n    public readonly concurrencyKey: string,\n    public readonly incumbent: JobRun,\n  ) {\n    super(\n      `Job type '${jobType}' has an in-flight run with concurrency_key ` +\n        `'${concurrencyKey}' (incumbent ${incumbent.id}); collision_mode=reject.`,\n    );\n  }\n}\n\n/**\n * `replay` was called on a run that is not in a replayable terminal state\n * (i.e. still `pending` / `running` / `waiting`). Replay always spawns\n * fresh execution and therefore requires the source run to be settled.\n */\nexport class JobNotReplayableError extends Error {\n  override readonly name = 'JobNotReplayableError';\n  constructor(\n    public readonly runId: string,\n    public readonly currentStatus: string,\n  ) {\n    super(\n      `Run ${runId} is not replayable from status '${currentStatus}'. ` +\n        `Only 'completed', 'failed', 'timed_out', and 'canceled' are eligible.`,\n    );\n  }\n}\n\n/**\n * A `concurrency_key_template` or `dedupe_key_template` referenced a field\n * that is not present on the input payload. Caught at `start` time so the\n * caller sees the misconfiguration synchronously rather than at claim time.\n */\nexport class JobTemplateFieldMissingError extends Error {\n  override readonly name = 'JobTemplateFieldMissingError';\n  constructor(\n    public readonly template: string,\n    public readonly field: string,\n  ) {\n    super(\n      `Template '${template}' references input field '${field}' which is ` +\n        `missing or undefined on the payload.`,\n    );\n  }\n}\n\n/**\n * Thrown by the four multi-tenant-aware service-layer backends (JOB-8)\n * when `JobsDomainModule` was configured with `multiTenant: true` but the\n * caller did not pass a `tenantId` in the relevant options object.\n *\n * **Strict enforcement rationale (resolved 2026-04-18).** Cross-tenant data\n * leakage is the worst class of bug a multi-tenant system can ship; surfacing\n * the misuse loudly at the call site (rather than silently defaulting to\n * `null` or to the \"last tenant seen\") prevents both accidental global\n * writes and sneaky reads that return a union of tenants.\n *\n * - `undefined` `tenantId` → throw this error.\n * - Explicit `null` `tenantId` → passes; opts the call into cross-tenant\n *   background work (e.g. a nightly housekeeping job that must scan all\n *   tenants). The row is persisted with `tenant_id = NULL`.\n */\nexport class MissingTenantIdError extends Error {\n  override readonly name = 'MissingTenantIdError';\n  constructor(public readonly method: string) {\n    super(\n      `MissingTenantIdError: JobsDomainModule was configured with ` +\n        `multiTenant=true but ${method} was called without tenantId ` +\n        `(undefined). Pass an explicit tenantId, or pass null for ` +\n        `cross-tenant work.`,\n    );\n  }\n}\n\n/**\n * Thrown by `JobWorkerModule.onModuleInit` (Drizzle backend only) when the\n * `job` table contains type rows for which no `@JobHandler` is registered\n * in the running process. Surfaces every orphaned type at once so a single\n * boot tells the operator everything to clean up.\n *\n * Skipped entirely in memory mode (Q4 resolution 2026-04-19) — the memory\n * backend has no DB rows to validate; `MemoryJobOrchestrator.start()`\n * throws `JobTypeNotFoundError` synchronously for unknown types instead.\n */\nexport class BootValidationError extends Error {\n  override readonly name = 'BootValidationError';\n  constructor(public readonly missingHandlers: string[]) {\n    super(\n      `BootValidationError: ${missingHandlers.length} orphaned job type(s) ` +\n        `in 'job' table with no matching @JobHandler in the running process: ` +\n        `[${missingHandlers.join(', ')}]. Either register the handler(s) or ` +\n        `remove the rows.`,\n    );\n  }\n}\n\n/**\n * Thrown by `JobWorkerModule.onModuleInit` when one or more `@JobHandler`\n * classes target a `reserved: true` pool from the resolved pool config\n * (the three `events_*` pools are reserved for the events subsystem\n * outbox drain). Listing every offender on a single boot avoids the\n * fix-one-restart-fix-next loop.\n */\nexport class ReservedPoolViolationError extends Error {\n  override readonly name = 'ReservedPoolViolationError';\n  constructor(\n    public readonly offenders: ReadonlyArray<{\n      handlerClass: string;\n      pool: string;\n    }>,\n  ) {\n    super(\n      `ReservedPoolViolationError: ${offenders.length} @JobHandler(s) target ` +\n        `reserved pools — reserved pools are framework-only:\\n` +\n        offenders\n          .map((o) => `  - ${o.handlerClass} → pool='${o.pool}'`)\n          .join('\\n'),\n    );\n  }\n}\n","/**\n * Injection tokens for the job orchestration domain layer (ADR-022, JOB-2).\n *\n * Consumer code injects these symbols via `@Inject(JOB_ORCHESTRATOR)` etc.;\n * concrete backends (JOB-3 Drizzle, JOB-4 Memory) provide the implementations\n * through `JobsDomainModule.forRoot({ backend })` in JOB-5.\n *\n * Each token is a unique `Symbol` — guaranteed distinct from every other\n * Symbol at runtime, which is exactly the uniqueness guarantee Nest's DI\n * container relies on for token-based lookup.\n */\nexport const JOB_ORCHESTRATOR = Symbol('JOB_ORCHESTRATOR');\nexport const JOB_RUN_SERVICE = Symbol('JOB_RUN_SERVICE');\nexport const JOB_STEP_SERVICE = Symbol('JOB_STEP_SERVICE');\n\n/**\n * Multi-tenancy opt-in flag (JOB-8). Bound to the boolean passed in via\n * `JobsDomainModule.forRoot({ multiTenant })`, defaulting to `false`.\n *\n * When `true`, the four service-layer backends (Drizzle + Memory orchestrator\n * and run-service) enforce `tenantId` on every mutating / targeted-read call:\n * `start`, `cancel`, `listForScope`, `cancelForScope`, `rescheduleForScope`.\n * Missing (`undefined`) `tenantId` throws `MissingTenantIdError`; explicit\n * `null` opts into cross-tenant background work and passes through.\n *\n * The JobWorker claim loop is **cross-tenant by design** — the worker has no\n * tenant context; `tenantId` is populated at write time and enforced on\n * targeted reads. See docs/specs/JOB-8.md.\n */\nexport const JOBS_MULTI_TENANT = Symbol('JOBS_MULTI_TENANT');\n"],"mappings":";;;;;;;;;;;;;AAeA,SAAS,kBAAkB;AAC3B,SAAS,QAAQ,YAAY,QAAQ,gBAAgB;;;ACqG9C,IAAM,uBAAuB,oBAAI,IAOtC;AAuEK,IAAU;AAAA,CAAV,CAAUA,qBAAV;AAEE,WAAS,SAAiC;AAC/C,WAAO,MAAM,KAAK,qBAAqB,OAAO,CAAC;AAAA,EACjD;AAFO,EAAAA,iBAAS;AAKT,WAAS,IAAI,MAAgD;AAClE,WAAO,qBAAqB,IAAI,IAAI;AAAA,EACtC;AAFO,EAAAA,iBAAS;AAAA,GAPD;;;ACrLV,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAE9C,YAA4B,SAAiB;AAC3C,UAAM,0CAA0C,OAAO,IAAI;AADjC;AAAA,EAE5B;AAAA,EAF4B;AAAA,EADV,OAAO;AAI3B;AAOO,IAAM,oBAAN,cAAgC,MAAM;AAAA,EAE3C,YACkB,SACA,gBACA,WAChB;AACA;AAAA,MACE,aAAa,OAAO,gDACd,cAAc,gBAAgB,UAAU,EAAE;AAAA,IAClD;AAPgB;AACA;AACA;AAAA,EAMlB;AAAA,EARkB;AAAA,EACA;AAAA,EACA;AAAA,EAJA,OAAO;AAW3B;AAOO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAE/C,YACkB,OACA,eAChB;AACA;AAAA,MACE,OAAO,KAAK,mCAAmC,aAAa;AAAA,IAE9D;AANgB;AACA;AAAA,EAMlB;AAAA,EAPkB;AAAA,EACA;AAAA,EAHA,OAAO;AAU3B;AAOO,IAAM,+BAAN,cAA2C,MAAM;AAAA,EAEtD,YACkB,UACA,OAChB;AACA;AAAA,MACE,aAAa,QAAQ,6BAA6B,KAAK;AAAA,IAEzD;AANgB;AACA;AAAA,EAMlB;AAAA,EAPkB;AAAA,EACA;AAAA,EAHA,OAAO;AAU3B;AAkBO,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAE9C,YAA4B,QAAgB;AAC1C;AAAA,MACE,mFAC0B,MAAM;AAAA,IAGlC;AAN0B;AAAA,EAO5B;AAAA,EAP4B;AAAA,EADV,OAAO;AAS3B;;;ACzEO,IAAM,oBAAoB,uBAAO,mBAAmB;;;AH2B3D,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,YACmB,OACA,aAC2B,aACf,WAC7B;AAJiB;AACA;AAC2B;AACf;AAAA,EAC5B;AAAA,EAJgB;AAAA,EACA;AAAA,EAC2B;AAAA,EACf;AAAA,EAhBd,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,EAcnD,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,cAAMC,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;AAKlC,UAAM,UAAU,KAAK,YACf,MAAM,KAAK,UAAU;AAAA,MACrB;AAAA,IACF,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;AAvrBa,wBAAN;AAAA,EADN,WAAW;AAAA,EAiBP,0BAAO,iBAAiB;AAAA,EACxB,4BAAS;AAAA,GAjBD;AA2rBb,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":["HandlerRegistry","dedupeKey"]}

package/dist/runtime/subsystems/jobs/job-worker.d.ts

@@ -1,5 +1,6 @@
 import * as drizzle_orm_pg_core from 'drizzle-orm/pg-core';
 import { OnModuleInit, OnModuleDestroy } from '@nestjs/common';
+import { ModuleRef } from '@nestjs/core';
 import { DrizzleClient } from '../../types/drizzle.js';
 import { JobRunRow } from './job-orchestration.schema.js';
 import { I as IJobOrchestrator, R as RetryPolicy } from '../../../job-orchestrator.protocol-BwsBd37o.js';
@@ -140,6 +141,7 @@ declare class JobWorker implements OnModuleInit, OnModuleDestroy {
     private readonly runService;
     private readonly stepService;
     private readonly options;
+    private readonly moduleRef;
     private readonly logger;
     private shuttingDown;
     private readonly inFlight;
@@ -151,7 +153,7 @@ declare class JobWorker implements OnModuleInit, OnModuleDestroy {
     private readonly staleSweeperIntervalMs;
     private readonly staleThresholdMs;
     private readonly shutdownTimeoutMs;
-    constructor(db: DrizzleClient, orchestrator: IJobOrchestrator, runService: IJobRunService, stepService: IJobStepService, options: JobWorkerOptions);
+    constructor(db: DrizzleClient, orchestrator: IJobOrchestrator, runService: IJobRunService, stepService: IJobStepService, options: JobWorkerOptions, moduleRef: ModuleRef);
     onModuleInit(): void;
     onModuleDestroy(): Promise<void>;
     private drainInFlight;

package/dist/runtime/subsystems/jobs/job-worker.js

@@ -253,12 +253,13 @@ function serialiseError(err, attempt, retryable) {
   };
 }
 var JobWorker = class {
-  constructor(db, orchestrator, runService, stepService, options) {
+  constructor(db, orchestrator, runService, stepService, options, moduleRef) {
     this.db = db;
     this.orchestrator = orchestrator;
     this.runService = runService;
     this.stepService = stepService;
     this.options = options;
+    this.moduleRef = moduleRef;
     this.pollIntervalMs = options.pollIntervalMs ?? DEFAULT_POLL_INTERVAL_MS;
     this.staleSweeperIntervalMs = options.staleSweeperIntervalMs ?? DEFAULT_STALE_SWEEPER_INTERVAL_MS;
     this.staleThresholdMs = options.staleThresholdMs ?? DEFAULT_STALE_THRESHOLD_MS;
@@ -275,6 +276,7 @@ var JobWorker = class {
   runService;
   stepService;
   options;
+  moduleRef;
   logger = new Logger(JobWorker.name);
   shuttingDown = false;
   inFlight = /* @__PURE__ */ new Set();
@@ -446,7 +448,9 @@ var JobWorker = class {
     }
     const meta = registryEntry.meta;
     const HandlerClass = registryEntry.handlerClass;
-    const handler = new HandlerClass();
+    const handler = await this.moduleRef.create(
+      HandlerClass
+    );
     const ctx = {
       input: claimed.input,
       run: claimed,