@pattern-stack/codegen 0.15.1 → 0.15.3

package/dist/chunk-RC23QROE.js

@@ -0,0 +1,447 @@
+import {
+  JOB_HANDLER_REGISTRY
+} from "./chunk-CO6LUM72.js";
+import {
+  JOB_ORCHESTRATOR,
+  JOB_RUN_SERVICE,
+  JOB_STEP_SERVICE
+} from "./chunk-BIO6F7YI.js";
+import {
+  jobRuns
+} from "./chunk-OKXZ63IA.js";
+import {
+  tokenKey
+} from "./chunk-GYGNEQSC.js";
+import {
+  DRIZZLE
+} from "./chunk-U64T4YZE.js";
+import {
+  __decorateClass,
+  __decorateParam
+} from "./chunk-2E224ZSN.js";
+
+// runtime/subsystems/jobs/job-worker.ts
+import { Inject, Injectable, Logger } from "@nestjs/common";
+import { and, asc, desc, eq, inArray, lt, lte, sql } from "drizzle-orm";
+var JOB_WORKER_OPTIONS = Symbol.for(tokenKey("jobs", "worker-options"));
+var DEFAULT_POLL_INTERVAL_MS = 1e3;
+var DEFAULT_STALE_SWEEPER_INTERVAL_MS = 6e4;
+var DEFAULT_STALE_THRESHOLD_MS = 5 * 6e4;
+var DEFAULT_SHUTDOWN_TIMEOUT_MS = 3e4;
+var TERMINAL_STATUSES = [
+  "completed",
+  "failed",
+  "timed_out",
+  "canceled"
+];
+function computeBackoff(policy, attempts) {
+  const base = Math.max(policy.baseMs, 0);
+  if (policy.backoff === "fixed") {
+    return base;
+  }
+  const exponent = Math.max(attempts - 1, 0);
+  if (exponent >= 53) return Number.MAX_SAFE_INTEGER;
+  const raw = base * Math.pow(2, exponent);
+  if (!Number.isFinite(raw) || raw >= Number.MAX_SAFE_INTEGER) {
+    return Number.MAX_SAFE_INTEGER;
+  }
+  return raw;
+}
+function classifyError(err, policy, currentAttempts) {
+  if (!policy) return "fail";
+  const errObj = err;
+  const name = errObj?.name;
+  const code = errObj?.code;
+  const nonRetryable = policy.nonRetryableErrors ?? [];
+  if (nonRetryable.some((n) => n === name || n === code)) return "fail";
+  if (currentAttempts + 1 >= policy.attempts) return "fail";
+  return "retry";
+}
+function buildClaimQuery(db, pool) {
+  return db.select({ id: jobRuns.id }).from(jobRuns).where(
+    and(
+      eq(jobRuns.status, "pending"),
+      eq(jobRuns.pool, pool),
+      lte(jobRuns.runAt, /* @__PURE__ */ new Date())
+    )
+  ).orderBy(desc(jobRuns.priority), asc(jobRuns.runAt)).limit(1).for("update", { skipLocked: true });
+}
+function buildStaleSweepQuery(db, staleThresholdMs) {
+  const threshold = new Date(Date.now() - staleThresholdMs);
+  return db.select({ id: jobRuns.id }).from(jobRuns).where(
+    and(
+      eq(jobRuns.status, "running"),
+      lt(jobRuns.claimedAt, threshold)
+    )
+  ).for("update", { skipLocked: true });
+}
+function serialiseError(err, attempt, retryable) {
+  const e = err;
+  return {
+    message: e?.message ?? String(err),
+    stack: e?.stack,
+    retryable,
+    attempt
+  };
+}
+var JobWorker = class {
+  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;
+    this.shutdownTimeoutMs = options.shutdownTimeoutMs ?? DEFAULT_SHUTDOWN_TIMEOUT_MS;
+    this.sigtermHandler = () => {
+      if (this.sigtermHandled) return;
+      this.sigtermHandled = true;
+      void this.onModuleDestroy();
+    };
+    void this.runService;
+  }
+  db;
+  orchestrator;
+  runService;
+  stepService;
+  options;
+  moduleRef;
+  logger = new Logger(JobWorker.name);
+  shuttingDown = false;
+  inFlight = /* @__PURE__ */ new Set();
+  pollTimer = null;
+  sweeperTimer = null;
+  sigtermHandled = false;
+  sigtermHandler;
+  pollIntervalMs;
+  staleSweeperIntervalMs;
+  staleThresholdMs;
+  shutdownTimeoutMs;
+  // ============================================================================
+  // Lifecycle
+  // ============================================================================
+  onModuleInit() {
+    this.pollTimer = setInterval(() => {
+      void this.pollAndProcess();
+    }, this.pollIntervalMs);
+    this.sweeperTimer = setInterval(() => {
+      void this.sweepStaleClaims();
+    }, this.staleSweeperIntervalMs);
+    process.on("SIGTERM", this.sigtermHandler);
+  }
+  async onModuleDestroy() {
+    if (this.shuttingDown) {
+      await this.drainInFlight();
+      return;
+    }
+    this.shuttingDown = true;
+    if (this.pollTimer) {
+      clearInterval(this.pollTimer);
+      this.pollTimer = null;
+    }
+    if (this.sweeperTimer) {
+      clearInterval(this.sweeperTimer);
+      this.sweeperTimer = null;
+    }
+    process.removeListener("SIGTERM", this.sigtermHandler);
+    await this.drainInFlight();
+    try {
+      await this.db.update(jobRuns).set({ status: "pending", claimedAt: null, startedAt: null }).where(
+        and(eq(jobRuns.status, "running"), eq(jobRuns.pool, this.options.pool))
+      );
+    } catch (err) {
+      this.logger.error(`shutdown reset failed: ${err.message}`);
+    }
+  }
+  async drainInFlight() {
+    if (this.inFlight.size === 0) return;
+    const timeout = new Promise(
+      (resolve) => setTimeout(resolve, this.shutdownTimeoutMs)
+    );
+    await Promise.race([
+      Promise.allSettled([...this.inFlight]).then(() => void 0),
+      timeout
+    ]);
+  }
+  // ============================================================================
+  // Poll loop
+  // ============================================================================
+  async pollAndProcess() {
+    if (this.shuttingDown) return;
+    if (this.inFlight.size >= this.options.concurrency) return;
+    let claimed;
+    try {
+      claimed = await this.claimNext(this.options.pool);
+    } catch (err) {
+      this.logger.error(`claimNext failed: ${err.message}`);
+      return;
+    }
+    if (!claimed) return;
+    const run = claimed;
+    const promise = this.processRun(run).catch((err) => {
+      this.logger.error(
+        `processRun(${run.id}) unhandled: ${err.message}`
+      );
+    });
+    this.inFlight.add(promise);
+    promise.finally(() => {
+      this.inFlight.delete(promise);
+    });
+  }
+  /**
+   * Claim the next runnable row from the pool. Transaction ensures the
+   * select-candidate + update-to-running pair is atomic; FOR UPDATE SKIP
+   * LOCKED lets multiple workers share the table without serialising.
+   */
+  async claimNext(pool) {
+    return this.db.transaction(async (tx) => {
+      const candidates = await tx.select({ id: jobRuns.id }).from(jobRuns).where(
+        and(
+          eq(jobRuns.status, "pending"),
+          eq(jobRuns.pool, pool),
+          lte(jobRuns.runAt, /* @__PURE__ */ new Date())
+        )
+      ).orderBy(desc(jobRuns.priority), asc(jobRuns.runAt)).limit(1).for("update", { skipLocked: true });
+      const candidate = candidates[0];
+      if (!candidate) return null;
+      const [claimed] = await tx.update(jobRuns).set({
+        status: "running",
+        claimedAt: /* @__PURE__ */ new Date(),
+        startedAt: /* @__PURE__ */ new Date(),
+        updatedAt: /* @__PURE__ */ new Date()
+      }).where(eq(jobRuns.id, candidate.id)).returning();
+      return claimed ?? null;
+    });
+  }
+  // ============================================================================
+  // Stale claim sweeper
+  // ============================================================================
+  /**
+   * Release rows whose `claimed_at` is older than the threshold. Safe to
+   * run concurrently across workers — the two-phase tx (select-for-update
+   * then update) guarantees each stranded row is only reset once.
+   */
+  async sweepStaleClaims() {
+    if (this.shuttingDown) return;
+    try {
+      await this.db.transaction(async (tx) => {
+        const threshold = new Date(Date.now() - this.staleThresholdMs);
+        const stale = await tx.select({ id: jobRuns.id }).from(jobRuns).where(
+          and(eq(jobRuns.status, "running"), lt(jobRuns.claimedAt, threshold))
+        ).for("update", { skipLocked: true });
+        if (stale.length === 0) return;
+        const ids = stale.map((r) => r.id);
+        await tx.update(jobRuns).set({ status: "pending", claimedAt: null, startedAt: null }).where(inArray(jobRuns.id, ids));
+        for (const id of ids) {
+          this.logger.warn(`Recovered stale claim on run ${id}`);
+        }
+      });
+    } catch (err) {
+      this.logger.error(`sweepStaleClaims failed: ${err.message}`);
+    }
+  }
+  // ============================================================================
+  // processRun
+  // ============================================================================
+  async processRun(claimed) {
+    const registryEntry = JOB_HANDLER_REGISTRY.get(claimed.jobType);
+    if (!registryEntry) {
+      this.logger.error(
+        `No handler registered for jobType='${claimed.jobType}' (run ${claimed.id})`
+      );
+      await this.markFailed(
+        claimed,
+        new Error(`No handler registered for jobType='${claimed.jobType}'`),
+        /*finalAttempts*/
+        (claimed.attempts ?? 0) + 1
+      );
+      return;
+    }
+    if (claimed.concurrencyKey) {
+      const inflight = await this.db.select({ id: jobRuns.id }).from(jobRuns).where(
+        and(
+          eq(jobRuns.concurrencyKey, claimed.concurrencyKey),
+          eq(jobRuns.status, "running")
+        )
+      );
+      const other = inflight.find((r) => r.id !== claimed.id);
+      if (other) {
+        await this.db.update(jobRuns).set({
+          status: "pending",
+          claimedAt: null,
+          startedAt: null,
+          updatedAt: /* @__PURE__ */ new Date()
+        }).where(eq(jobRuns.id, claimed.id));
+        return;
+      }
+    }
+    const meta = registryEntry.meta;
+    const HandlerClass = registryEntry.handlerClass;
+    const handler = this.moduleRef.get(
+      HandlerClass,
+      { strict: false }
+    );
+    const ctx = {
+      input: claimed.input,
+      run: claimed,
+      step: this.makeStepFn(claimed),
+      spawnChild: this.makeSpawnFn(claimed),
+      logger: new Logger(`JobRun:${claimed.id}`)
+    };
+    const attemptsBefore = claimed.attempts ?? 0;
+    try {
+      const output = await handler.run(ctx);
+      await this.db.update(jobRuns).set({
+        status: "completed",
+        output: output ?? {},
+        finishedAt: /* @__PURE__ */ new Date(),
+        updatedAt: /* @__PURE__ */ new Date(),
+        attempts: attemptsBefore + 1
+      }).where(eq(jobRuns.id, claimed.id));
+    } catch (err) {
+      const policy = meta.retry;
+      const decision = classifyError(err, policy, attemptsBefore);
+      const nextAttempts = attemptsBefore + 1;
+      if (decision === "retry" && policy) {
+        const delay = computeBackoff(policy, nextAttempts);
+        await this.db.update(jobRuns).set({
+          status: "pending",
+          attempts: nextAttempts,
+          runAt: new Date(Date.now() + delay),
+          startedAt: null,
+          claimedAt: null,
+          error: serialiseError(err, nextAttempts, true),
+          updatedAt: /* @__PURE__ */ new Date()
+        }).where(eq(jobRuns.id, claimed.id));
+      } else {
+        await this.markFailed(claimed, err, nextAttempts);
+      }
+    }
+  }
+  async markFailed(claimed, err, finalAttempts) {
+    await this.db.update(jobRuns).set({
+      status: "failed",
+      attempts: finalAttempts,
+      finishedAt: /* @__PURE__ */ new Date(),
+      error: serialiseError(err, finalAttempts, false),
+      updatedAt: /* @__PURE__ */ new Date()
+    }).where(eq(jobRuns.id, claimed.id));
+    if (claimed.parentClosePolicy === "terminate") {
+      try {
+        await this.orchestrator.cancel(claimed.id, {
+          cascade: true,
+          reason: "parent-failed",
+          tenantId: claimed.tenantId
+        });
+      } catch (cascadeErr) {
+        this.logger.warn(
+          `cascade on failed run ${claimed.id}: ${cascadeErr.message}`
+        );
+      }
+    }
+  }
+  // ============================================================================
+  // ctx.step / ctx.spawnChild builders
+  // ============================================================================
+  makeStepFn(run) {
+    return async (stepId, fn, _opts) => {
+      void _opts;
+      const existing = await this.stepService.findStep(run.id, stepId);
+      if (existing?.status === "completed") {
+        return existing.output;
+      }
+      const seq = await this.nextStepSeq(run.id);
+      const startedAt = /* @__PURE__ */ new Date();
+      const nextAttempts = (existing?.attempts ?? 0) + 1;
+      await this.stepService.recordStep({
+        jobRunId: run.id,
+        stepId,
+        kind: "task",
+        seq,
+        status: "running",
+        startedAt,
+        attempts: nextAttempts
+      });
+      try {
+        const output = await fn();
+        await this.stepService.recordStep({
+          jobRunId: run.id,
+          stepId,
+          kind: "task",
+          seq,
+          status: "completed",
+          output,
+          finishedAt: /* @__PURE__ */ new Date(),
+          attempts: nextAttempts
+        });
+        return output;
+      } catch (err) {
+        await this.stepService.recordStep({
+          jobRunId: run.id,
+          stepId,
+          kind: "task",
+          seq,
+          status: "failed",
+          error: serialiseError(err, nextAttempts, false),
+          finishedAt: /* @__PURE__ */ new Date(),
+          attempts: nextAttempts
+        });
+        throw err;
+      }
+    };
+  }
+  makeSpawnFn(run) {
+    return async (type, input, opts) => {
+      return this.orchestrator.start(type, input, {
+        parentRunId: run.id,
+        parentClosePolicy: opts?.closePolicy,
+        runAt: opts?.runAt,
+        priority: opts?.priority,
+        tags: opts?.tags,
+        triggerSource: "parent",
+        triggerRef: run.id
+      });
+    };
+  }
+  /**
+   * Allocate the next `seq` for a given run. SELECT-max approach — runs
+   * typically have <100 steps so the scan is cheap, and correctness across
+   * retries is more important than the microseconds saved by an in-memory
+   * counter (which would drift if the worker crashes mid-run and another
+   * worker resumes via stale-claim sweep).
+   */
+  async nextStepSeq(runId) {
+    const result = await this.db.execute(
+      sql`SELECT COALESCE(MAX(seq), 0) + 1 AS next FROM job_step WHERE job_run_id = ${runId}`
+    );
+    const raw = result;
+    const rows = Array.isArray(raw) ? raw : Array.isArray(raw?.rows) ? raw.rows : [];
+    const next = rows[0]?.next;
+    return typeof next === "undefined" ? 1 : Number(next);
+  }
+  // ============================================================================
+  // (suppress unused-import noise)
+  // ============================================================================
+};
+JobWorker = __decorateClass([
+  Injectable(),
+  __decorateParam(0, Inject(DRIZZLE)),
+  __decorateParam(1, Inject(JOB_ORCHESTRATOR)),
+  __decorateParam(2, Inject(JOB_RUN_SERVICE)),
+  __decorateParam(3, Inject(JOB_STEP_SERVICE)),
+  __decorateParam(4, Inject(JOB_WORKER_OPTIONS))
+], JobWorker);
+
+export {
+  JOB_WORKER_OPTIONS,
+  TERMINAL_STATUSES,
+  computeBackoff,
+  classifyError,
+  buildClaimQuery,
+  buildStaleSweepQuery,
+  JobWorker
+};
+//# sourceMappingURL=chunk-RC23QROE.js.map

package/dist/chunk-RC23QROE.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../runtime/subsystems/jobs/job-worker.ts"],"sourcesContent":["/**\n * JobWorker — backend-agnostic tick loop for the job orchestration domain\n * (ADR-022, JOB-3).\n *\n * One worker instance per active pool. On `onModuleInit` it starts two\n * intervals: the poll loop (claim → process → repeat) and the stale-claim\n * sweeper. On `onModuleDestroy` / SIGTERM it drains in-flight work and\n * releases still-`running` rows back to `pending` so a replacement worker\n * can resume with step memoization intact.\n *\n * The claim query is the beating heart: `SELECT … FOR UPDATE SKIP LOCKED`\n * inside a single transaction. Multiple worker processes share the table\n * without serialising on row locks.\n */\n// TODO(logging-subsystem): swap to ILogger once ADR-028 lands\nimport { Inject, Injectable, Logger, type OnModuleDestroy, type OnModuleInit } from '@nestjs/common';\nimport { ModuleRef } from '@nestjs/core';\nimport { and, asc, desc, eq, inArray, lt, lte, sql } from 'drizzle-orm';\nimport type { DrizzleClient } from '../../types/drizzle';\nimport { tokenKey } from '../token-key';\nimport { DRIZZLE } from '../../constants/tokens';\nimport { jobRuns, type JobRunRow } from './job-orchestration.schema';\nimport type { IJobOrchestrator, JobRun } from './job-orchestrator.protocol';\nimport type { IJobRunService } from './job-run-service.protocol';\nimport type { IJobStepService } from './job-step-service.protocol';\nimport {\n  JOB_ORCHESTRATOR,\n  JOB_RUN_SERVICE,\n  JOB_STEP_SERVICE,\n} from './jobs-domain.tokens';\nimport {\n  JOB_HANDLER_REGISTRY,\n  JobHandlerBase,\n  type JobContext,\n  type JobHandlerMeta,\n  type RetryPolicy,\n  type SpawnChildOptions,\n  type StepOptions,\n} from './job-handler.base';\n\n/**\n * Options accepted by `JobWorker`. JOB-5 threads these through module\n * `.forRoot()` config; supplied here as a plain DI-constructor argument\n * so the worker compiles standalone.\n */\nexport interface JobWorkerOptions {\n  /** Pool name this worker claims from. Matches `job.pool`. */\n  pool: string;\n  /** Max concurrent in-flight `processRun` calls. */\n  concurrency: number;\n  /** Poll interval in ms. Default 1000. */\n  pollIntervalMs?: number;\n  /** Stale sweep interval in ms. Default 60_000. */\n  staleSweeperIntervalMs?: number;\n  /**\n   * Threshold beyond which a `running` row is presumed stranded by a\n   * crashed worker. Default 5 min. Must be >= 2× max handler duration.\n   */\n  staleThresholdMs?: number;\n  /** Max ms to wait for in-flight drain on SIGTERM. Default 30_000. */\n  shutdownTimeoutMs?: number;\n}\n\n// ADR-037: namespaced `Symbol.for(...)` (via `tokenKey()`) — matches by value\n// across runtime copies.\nexport const JOB_WORKER_OPTIONS = Symbol.for(tokenKey('jobs', 'worker-options'));\n\nconst DEFAULT_POLL_INTERVAL_MS = 1_000;\nconst DEFAULT_STALE_SWEEPER_INTERVAL_MS = 60_000;\nconst DEFAULT_STALE_THRESHOLD_MS = 5 * 60_000;\nconst DEFAULT_SHUTDOWN_TIMEOUT_MS = 30_000;\n\nconst TERMINAL_STATUSES: JobRunRow['status'][] = [\n  'completed',\n  'failed',\n  'timed_out',\n  'canceled',\n];\n\n// ─── Pure helpers (exported for unit tests) ────────────────────────────────\n\n/**\n * Backoff delay in ms for the Nth attempt (1-indexed). Supports both\n * policy modes. Exponential is capped at `Number.MAX_SAFE_INTEGER` so\n * pathological attempt counts don't overflow.\n */\nexport function computeBackoff(policy: RetryPolicy, attempts: number): number {\n  const base = Math.max(policy.baseMs, 0);\n  if (policy.backoff === 'fixed') {\n    return base;\n  }\n  // exponential: baseMs * 2^(attempts-1)\n  const exponent = Math.max(attempts - 1, 0);\n  if (exponent >= 53) return Number.MAX_SAFE_INTEGER; // 2^53 overflow guard\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\n/**\n * Decide whether an error should be retried under the given policy.\n * Matches `nonRetryableErrors` by `.name` OR `.code`. Returns\n *   - `'retry'` if attempts remain and the error isn't blacklisted,\n *   - `'fail'` otherwise (terminal failure).\n */\nexport function 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\n/**\n * Build the raw claim-candidate select. Exported so tests can inspect\n * `.toSQL()` without spinning up the full worker. Matches JOB-3 §4 and\n * ADR-022 \"Claim query (Drizzle backend)\".\n */\nexport function buildClaimQuery(db: DrizzleClient, pool: string) {\n  return db\n    .select({ id: jobRuns.id })\n    .from(jobRuns)\n    .where(\n      and(\n        eq(jobRuns.status, 'pending'),\n        eq(jobRuns.pool, pool),\n        lte(jobRuns.runAt, new Date()),\n      ),\n    )\n    .orderBy(desc(jobRuns.priority), asc(jobRuns.runAt))\n    .limit(1)\n    .for('update', { skipLocked: true });\n}\n\n/**\n * Build the stale-claim sweep candidate select. `FOR UPDATE SKIP LOCKED`\n * per OQ-2 resolution (2026-04-19): per-worker sweeper, safe without\n * leader election because the update is self-gating.\n */\nexport function buildStaleSweepQuery(\n  db: DrizzleClient,\n  staleThresholdMs: number,\n) {\n  const threshold = new Date(Date.now() - staleThresholdMs);\n  return db\n    .select({ id: jobRuns.id })\n    .from(jobRuns)\n    .where(\n      and(\n        eq(jobRuns.status, 'running'),\n        lt(jobRuns.claimedAt, threshold),\n      ),\n    )\n    .for('update', { skipLocked: true });\n}\n\n// ─── Error serialisation ───────────────────────────────────────────────────\n\nfunction serialiseError(err: unknown, attempt: number, retryable: boolean) {\n  const e = err as { message?: string; stack?: string; code?: string } | undefined;\n  return {\n    message: (e?.message ?? String(err)) as string,\n    stack: e?.stack,\n    retryable,\n    attempt,\n  };\n}\n\n// ─── JobWorker ─────────────────────────────────────────────────────────────\n\n@Injectable()\nexport class JobWorker implements OnModuleInit, OnModuleDestroy {\n  private readonly logger = new Logger(JobWorker.name);\n  private shuttingDown = false;\n  private readonly inFlight = new Set<Promise<void>>();\n  private pollTimer: ReturnType<typeof setInterval> | null = null;\n  private sweeperTimer: ReturnType<typeof setInterval> | null = null;\n  private sigtermHandled = false;\n  private readonly sigtermHandler: () => void;\n\n  private readonly pollIntervalMs: number;\n  private readonly staleSweeperIntervalMs: number;\n  private readonly staleThresholdMs: number;\n  private readonly shutdownTimeoutMs: number;\n\n  constructor(\n    @Inject(DRIZZLE) private readonly db: DrizzleClient,\n    @Inject(JOB_ORCHESTRATOR) private readonly orchestrator: IJobOrchestrator,\n    @Inject(JOB_RUN_SERVICE) private readonly runService: IJobRunService,\n    @Inject(JOB_STEP_SERVICE) private readonly stepService: IJobStepService,\n    @Inject(JOB_WORKER_OPTIONS) private readonly options: JobWorkerOptions,\n    private readonly moduleRef: ModuleRef,\n  ) {\n    this.pollIntervalMs = options.pollIntervalMs ?? DEFAULT_POLL_INTERVAL_MS;\n    this.staleSweeperIntervalMs =\n      options.staleSweeperIntervalMs ?? DEFAULT_STALE_SWEEPER_INTERVAL_MS;\n    this.staleThresholdMs = options.staleThresholdMs ?? DEFAULT_STALE_THRESHOLD_MS;\n    this.shutdownTimeoutMs =\n      options.shutdownTimeoutMs ?? DEFAULT_SHUTDOWN_TIMEOUT_MS;\n\n    this.sigtermHandler = () => {\n      if (this.sigtermHandled) return;\n      this.sigtermHandled = true;\n      void this.onModuleDestroy();\n    };\n    void this.runService; // reserved for future scope-aware cancellation paths\n  }\n\n  // ============================================================================\n  // Lifecycle\n  // ============================================================================\n\n  onModuleInit(): void {\n    this.pollTimer = setInterval(() => {\n      void this.pollAndProcess();\n    }, this.pollIntervalMs);\n    this.sweeperTimer = setInterval(() => {\n      void this.sweepStaleClaims();\n    }, this.staleSweeperIntervalMs);\n    process.on('SIGTERM', this.sigtermHandler);\n  }\n\n  async onModuleDestroy(): Promise<void> {\n    if (this.shuttingDown) {\n      // Still drain, but don't tear intervals down twice.\n      await this.drainInFlight();\n      return;\n    }\n    this.shuttingDown = true;\n    if (this.pollTimer) {\n      clearInterval(this.pollTimer);\n      this.pollTimer = null;\n    }\n    if (this.sweeperTimer) {\n      clearInterval(this.sweeperTimer);\n      this.sweeperTimer = null;\n    }\n    process.removeListener('SIGTERM', this.sigtermHandler);\n\n    await this.drainInFlight();\n\n    // Any rows still `running` past timeout → release back to pending.\n    try {\n      await this.db\n        .update(jobRuns)\n        .set({ status: 'pending', claimedAt: null, startedAt: null })\n        .where(\n          and(eq(jobRuns.status, 'running'), eq(jobRuns.pool, this.options.pool)),\n        );\n    } catch (err) {\n      this.logger.error(`shutdown reset failed: ${(err as Error).message}`);\n    }\n  }\n\n  private async drainInFlight(): Promise<void> {\n    if (this.inFlight.size === 0) return;\n    const timeout = new Promise<void>((resolve) =>\n      setTimeout(resolve, this.shutdownTimeoutMs),\n    );\n    await Promise.race([\n      Promise.allSettled([...this.inFlight]).then(() => undefined),\n      timeout,\n    ]);\n  }\n\n  // ============================================================================\n  // Poll loop\n  // ============================================================================\n\n  async pollAndProcess(): Promise<void> {\n    if (this.shuttingDown) return;\n    if (this.inFlight.size >= this.options.concurrency) return;\n\n    let claimed: JobRunRow | null;\n    try {\n      claimed = await this.claimNext(this.options.pool);\n    } catch (err) {\n      this.logger.error(`claimNext failed: ${(err as Error).message}`);\n      return;\n    }\n    if (!claimed) return;\n\n    const run = claimed;\n    const promise = this.processRun(run).catch((err) => {\n      this.logger.error(\n        `processRun(${run.id}) unhandled: ${(err as Error).message}`,\n      );\n    });\n    this.inFlight.add(promise);\n    promise.finally(() => {\n      this.inFlight.delete(promise);\n    });\n  }\n\n  /**\n   * Claim the next runnable row from the pool. Transaction ensures the\n   * select-candidate + update-to-running pair is atomic; FOR UPDATE SKIP\n   * LOCKED lets multiple workers share the table without serialising.\n   */\n  async claimNext(pool: string): Promise<JobRunRow | null> {\n    return this.db.transaction(async (tx) => {\n      const candidates = await tx\n        .select({ id: jobRuns.id })\n        .from(jobRuns)\n        .where(\n          and(\n            eq(jobRuns.status, 'pending'),\n            eq(jobRuns.pool, pool),\n            lte(jobRuns.runAt, new Date()),\n          ),\n        )\n        .orderBy(desc(jobRuns.priority), asc(jobRuns.runAt))\n        .limit(1)\n        .for('update', { skipLocked: true });\n      const candidate = candidates[0];\n      if (!candidate) return null;\n\n      const [claimed] = await tx\n        .update(jobRuns)\n        .set({\n          status: 'running',\n          claimedAt: new Date(),\n          startedAt: new Date(),\n          updatedAt: new Date(),\n        })\n        .where(eq(jobRuns.id, candidate.id))\n        .returning();\n      return (claimed ?? null) as JobRunRow | null;\n    });\n  }\n\n  // ============================================================================\n  // Stale claim sweeper\n  // ============================================================================\n\n  /**\n   * Release rows whose `claimed_at` is older than the threshold. Safe to\n   * run concurrently across workers — the two-phase tx (select-for-update\n   * then update) guarantees each stranded row is only reset once.\n   */\n  async sweepStaleClaims(): Promise<void> {\n    if (this.shuttingDown) return;\n    try {\n      await this.db.transaction(async (tx) => {\n        const threshold = new Date(Date.now() - this.staleThresholdMs);\n        const stale = await tx\n          .select({ id: jobRuns.id })\n          .from(jobRuns)\n          .where(\n            and(eq(jobRuns.status, 'running'), lt(jobRuns.claimedAt, threshold)),\n          )\n          .for('update', { skipLocked: true });\n        if (stale.length === 0) return;\n        const ids = stale.map((r) => r.id);\n        await tx\n          .update(jobRuns)\n          .set({ status: 'pending', claimedAt: null, startedAt: null })\n          .where(inArray(jobRuns.id, ids));\n        for (const id of ids) {\n          this.logger.warn(`Recovered stale claim on run ${id}`);\n        }\n      });\n    } catch (err) {\n      this.logger.error(`sweepStaleClaims failed: ${(err as Error).message}`);\n    }\n  }\n\n  // ============================================================================\n  // processRun\n  // ============================================================================\n\n  private async processRun(claimed: JobRunRow): Promise<void> {\n    const registryEntry = JOB_HANDLER_REGISTRY.get(claimed.jobType);\n\n    // (a) Missing handler — defensive; JOB-5 boot validator should have caught.\n    if (!registryEntry) {\n      this.logger.error(\n        `No handler registered for jobType='${claimed.jobType}' (run ${claimed.id})`,\n      );\n      await this.markFailed(\n        claimed,\n        new Error(`No handler registered for jobType='${claimed.jobType}'`),\n        /*finalAttempts*/ (claimed.attempts ?? 0) + 1,\n      );\n      return;\n    }\n\n    // (b) Concurrency-queue release gate — defer if another run with the\n    //     same key is already `running`.\n    if (claimed.concurrencyKey) {\n      const inflight = await this.db\n        .select({ id: jobRuns.id })\n        .from(jobRuns)\n        .where(\n          and(\n            eq(jobRuns.concurrencyKey, claimed.concurrencyKey),\n            eq(jobRuns.status, 'running'),\n          ),\n        );\n      const other = inflight.find((r) => r.id !== claimed.id);\n      if (other) {\n        await this.db\n          .update(jobRuns)\n          .set({\n            status: 'pending',\n            claimedAt: null,\n            startedAt: null,\n            updatedAt: new Date(),\n          })\n          .where(eq(jobRuns.id, claimed.id));\n        return;\n      }\n    }\n\n    const meta = registryEntry.meta as JobHandlerMeta<unknown>;\n    const HandlerClass = registryEntry.handlerClass;\n\n    // (c) Build JobContext. Resolve the handler instance from Nest's DI\n    //     graph so its `@Inject` constructor params (which may come from\n    //     any module in the app graph) are satisfied. `moduleRef.create()`\n    //     would otherwise instantiate a fresh class within JobWorkerModule's\n    //     scope only — which blows up with \"not a provider of the current\n    //     module\" for any handler that consumes a service from a peer\n    //     module (e.g. CrmSyncJob injecting CrmSyncFactory from CrmModule).\n    //     Consequence: handlers MUST be registered as providers in their\n    //     owning module (@Injectable + `providers: [HandlerClass]`). The\n    //     @JobHandler decorator handles registry registration only, not DI.\n    //     See the jobs skill's handler-authoring.md for the registration\n    //     rule.\n    const handler = this.moduleRef.get(\n      HandlerClass as unknown as new (...args: unknown[]) => unknown,\n      { strict: false },\n    ) as JobHandlerBase<unknown>;\n    const ctx: JobContext<unknown> = {\n      input: claimed.input,\n      run: claimed as JobRun,\n      step: this.makeStepFn(claimed),\n      spawnChild: this.makeSpawnFn(claimed),\n      logger: new Logger(`JobRun:${claimed.id}`),\n    };\n\n    const attemptsBefore = claimed.attempts ?? 0;\n    try {\n      // (d) Run the handler.\n      const output = (await handler.run(ctx)) as Record<string, unknown> | undefined;\n      // (e) Success.\n      await this.db\n        .update(jobRuns)\n        .set({\n          status: 'completed',\n          output: (output ?? {}) as Record<string, unknown>,\n          finishedAt: new Date(),\n          updatedAt: new Date(),\n          attempts: attemptsBefore + 1,\n        })\n        .where(eq(jobRuns.id, claimed.id));\n    } catch (err) {\n      // (f) Error classification + retry/fail.\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.db\n          .update(jobRuns)\n          .set({\n            status: 'pending',\n            attempts: nextAttempts,\n            runAt: new Date(Date.now() + delay),\n            startedAt: null,\n            claimedAt: null,\n            error: serialiseError(err, nextAttempts, true),\n            updatedAt: new Date(),\n          })\n          .where(eq(jobRuns.id, claimed.id));\n      } else {\n        await this.markFailed(claimed, err, nextAttempts);\n      }\n    }\n  }\n\n  private async markFailed(\n    claimed: JobRunRow,\n    err: unknown,\n    finalAttempts: number,\n  ): Promise<void> {\n    await this.db\n      .update(jobRuns)\n      .set({\n        status: 'failed',\n        attempts: finalAttempts,\n        finishedAt: new Date(),\n        error: serialiseError(err, finalAttempts, false),\n        updatedAt: new Date(),\n      })\n      .where(eq(jobRuns.id, claimed.id));\n\n    // Parent-close-policy cascade: if this run has children under the same\n    // root_run_id and this run's own parentClosePolicy is 'terminate', cascade.\n    if (claimed.parentClosePolicy === 'terminate') {\n      try {\n        // JOB-8 — thread the run's own tenantId so the orchestrator's\n        // multi-tenant gate passes. Without this, every terminate-policy\n        // cascade throws MissingTenantIdError under multiTenant=true and\n        // the outer catch silently swallows it — children never cancel.\n        await this.orchestrator.cancel(claimed.id, {\n          cascade: true,\n          reason: 'parent-failed',\n          tenantId: claimed.tenantId,\n        });\n      } catch (cascadeErr) {\n        // cancel is idempotent; failure here is unusual but not fatal.\n        this.logger.warn(\n          `cascade on failed run ${claimed.id}: ${(cascadeErr as Error).message}`,\n        );\n      }\n    }\n  }\n\n  // ============================================================================\n  // ctx.step / ctx.spawnChild builders\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\n      const seq = await 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.orchestrator.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  /**\n   * Allocate the next `seq` for a given run. SELECT-max approach — runs\n   * typically have <100 steps so the scan is cheap, and correctness across\n   * retries is more important than the microseconds saved by an in-memory\n   * counter (which would drift if the worker crashes mid-run and another\n   * worker resumes via stale-claim sweep).\n   */\n  private async nextStepSeq(runId: string): Promise<number> {\n    const result = await this.db.execute(\n      sql`SELECT COALESCE(MAX(seq), 0) + 1 AS next FROM job_step WHERE job_run_id = ${runId}`,\n    );\n    // Driver shape varies and is NOT uniformly array-iterable, so we must\n    // never array-destructure the raw result (that throws `{} is not iterable`\n    // on the node-postgres `Result` object, which exposes `.rows` instead of\n    // being an array — first hit by package-mode bridge deliveries on\n    // `drizzle-orm/node-postgres`). Normalise to a row array first, then read.\n    //   - node-postgres `db.execute(sql)` → `{ rows: [{ next }], ... }`\n    //   - some drivers / future shapes → a plain `[{ next }]` array\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    const raw = result as any;\n    const rows: Array<{ next?: unknown }> = Array.isArray(raw)\n      ? raw\n      : Array.isArray(raw?.rows)\n        ? raw.rows\n        : [];\n    const next = rows[0]?.next;\n    return typeof next === 'undefined' ? 1 : Number(next);\n  }\n\n  // ============================================================================\n  // (suppress unused-import noise)\n  // ============================================================================\n}\n\n// Terminal statuses re-exported for JOB-4 parity imports.\nexport { TERMINAL_STATUSES };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAeA,SAAS,QAAQ,YAAY,cAAuD;AAEpF,SAAS,KAAK,KAAK,MAAM,IAAI,SAAS,IAAI,KAAK,WAAW;AAgDnD,IAAM,qBAAqB,OAAO,IAAI,SAAS,QAAQ,gBAAgB,CAAC;AAE/E,IAAM,2BAA2B;AACjC,IAAM,oCAAoC;AAC1C,IAAM,6BAA6B,IAAI;AACvC,IAAM,8BAA8B;AAEpC,IAAM,oBAA2C;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AASO,SAAS,eAAe,QAAqB,UAA0B;AAC5E,QAAM,OAAO,KAAK,IAAI,OAAO,QAAQ,CAAC;AACtC,MAAI,OAAO,YAAY,SAAS;AAC9B,WAAO;AAAA,EACT;AAEA,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;AAQO,SAAS,cACd,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;AAOO,SAAS,gBAAgB,IAAmB,MAAc;AAC/D,SAAO,GACJ,OAAO,EAAE,IAAI,QAAQ,GAAG,CAAC,EACzB,KAAK,OAAO,EACZ;AAAA,IACC;AAAA,MACE,GAAG,QAAQ,QAAQ,SAAS;AAAA,MAC5B,GAAG,QAAQ,MAAM,IAAI;AAAA,MACrB,IAAI,QAAQ,OAAO,oBAAI,KAAK,CAAC;AAAA,IAC/B;AAAA,EACF,EACC,QAAQ,KAAK,QAAQ,QAAQ,GAAG,IAAI,QAAQ,KAAK,CAAC,EAClD,MAAM,CAAC,EACP,IAAI,UAAU,EAAE,YAAY,KAAK,CAAC;AACvC;AAOO,SAAS,qBACd,IACA,kBACA;AACA,QAAM,YAAY,IAAI,KAAK,KAAK,IAAI,IAAI,gBAAgB;AACxD,SAAO,GACJ,OAAO,EAAE,IAAI,QAAQ,GAAG,CAAC,EACzB,KAAK,OAAO,EACZ;AAAA,IACC;AAAA,MACE,GAAG,QAAQ,QAAQ,SAAS;AAAA,MAC5B,GAAG,QAAQ,WAAW,SAAS;AAAA,IACjC;AAAA,EACF,EACC,IAAI,UAAU,EAAE,YAAY,KAAK,CAAC;AACvC;AAIA,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;AAKO,IAAM,YAAN,MAAyD;AAAA,EAc9D,YACoC,IACS,cACD,YACC,aACE,SAC5B,WACjB;AANkC;AACS;AACD;AACC;AACE;AAC5B;AAEjB,SAAK,iBAAiB,QAAQ,kBAAkB;AAChD,SAAK,yBACH,QAAQ,0BAA0B;AACpC,SAAK,mBAAmB,QAAQ,oBAAoB;AACpD,SAAK,oBACH,QAAQ,qBAAqB;AAE/B,SAAK,iBAAiB,MAAM;AAC1B,UAAI,KAAK,eAAgB;AACzB,WAAK,iBAAiB;AACtB,WAAK,KAAK,gBAAgB;AAAA,IAC5B;AACA,SAAK,KAAK;AAAA,EACZ;AAAA,EApBoC;AAAA,EACS;AAAA,EACD;AAAA,EACC;AAAA,EACE;AAAA,EAC5B;AAAA,EAnBF,SAAS,IAAI,OAAO,UAAU,IAAI;AAAA,EAC3C,eAAe;AAAA,EACN,WAAW,oBAAI,IAAmB;AAAA,EAC3C,YAAmD;AAAA,EACnD,eAAsD;AAAA,EACtD,iBAAiB;AAAA,EACR;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA,EA6BjB,eAAqB;AACnB,SAAK,YAAY,YAAY,MAAM;AACjC,WAAK,KAAK,eAAe;AAAA,IAC3B,GAAG,KAAK,cAAc;AACtB,SAAK,eAAe,YAAY,MAAM;AACpC,WAAK,KAAK,iBAAiB;AAAA,IAC7B,GAAG,KAAK,sBAAsB;AAC9B,YAAQ,GAAG,WAAW,KAAK,cAAc;AAAA,EAC3C;AAAA,EAEA,MAAM,kBAAiC;AACrC,QAAI,KAAK,cAAc;AAErB,YAAM,KAAK,cAAc;AACzB;AAAA,IACF;AACA,SAAK,eAAe;AACpB,QAAI,KAAK,WAAW;AAClB,oBAAc,KAAK,SAAS;AAC5B,WAAK,YAAY;AAAA,IACnB;AACA,QAAI,KAAK,cAAc;AACrB,oBAAc,KAAK,YAAY;AAC/B,WAAK,eAAe;AAAA,IACtB;AACA,YAAQ,eAAe,WAAW,KAAK,cAAc;AAErD,UAAM,KAAK,cAAc;AAGzB,QAAI;AACF,YAAM,KAAK,GACR,OAAO,OAAO,EACd,IAAI,EAAE,QAAQ,WAAW,WAAW,MAAM,WAAW,KAAK,CAAC,EAC3D;AAAA,QACC,IAAI,GAAG,QAAQ,QAAQ,SAAS,GAAG,GAAG,QAAQ,MAAM,KAAK,QAAQ,IAAI,CAAC;AAAA,MACxE;AAAA,IACJ,SAAS,KAAK;AACZ,WAAK,OAAO,MAAM,0BAA2B,IAAc,OAAO,EAAE;AAAA,IACtE;AAAA,EACF;AAAA,EAEA,MAAc,gBAA+B;AAC3C,QAAI,KAAK,SAAS,SAAS,EAAG;AAC9B,UAAM,UAAU,IAAI;AAAA,MAAc,CAAC,YACjC,WAAW,SAAS,KAAK,iBAAiB;AAAA,IAC5C;AACA,UAAM,QAAQ,KAAK;AAAA,MACjB,QAAQ,WAAW,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,KAAK,MAAM,MAAS;AAAA,MAC3D;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,iBAAgC;AACpC,QAAI,KAAK,aAAc;AACvB,QAAI,KAAK,SAAS,QAAQ,KAAK,QAAQ,YAAa;AAEpD,QAAI;AACJ,QAAI;AACF,gBAAU,MAAM,KAAK,UAAU,KAAK,QAAQ,IAAI;AAAA,IAClD,SAAS,KAAK;AACZ,WAAK,OAAO,MAAM,qBAAsB,IAAc,OAAO,EAAE;AAC/D;AAAA,IACF;AACA,QAAI,CAAC,QAAS;AAEd,UAAM,MAAM;AACZ,UAAM,UAAU,KAAK,WAAW,GAAG,EAAE,MAAM,CAAC,QAAQ;AAClD,WAAK,OAAO;AAAA,QACV,cAAc,IAAI,EAAE,gBAAiB,IAAc,OAAO;AAAA,MAC5D;AAAA,IACF,CAAC;AACD,SAAK,SAAS,IAAI,OAAO;AACzB,YAAQ,QAAQ,MAAM;AACpB,WAAK,SAAS,OAAO,OAAO;AAAA,IAC9B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,UAAU,MAAyC;AACvD,WAAO,KAAK,GAAG,YAAY,OAAO,OAAO;AACvC,YAAM,aAAa,MAAM,GACtB,OAAO,EAAE,IAAI,QAAQ,GAAG,CAAC,EACzB,KAAK,OAAO,EACZ;AAAA,QACC;AAAA,UACE,GAAG,QAAQ,QAAQ,SAAS;AAAA,UAC5B,GAAG,QAAQ,MAAM,IAAI;AAAA,UACrB,IAAI,QAAQ,OAAO,oBAAI,KAAK,CAAC;AAAA,QAC/B;AAAA,MACF,EACC,QAAQ,KAAK,QAAQ,QAAQ,GAAG,IAAI,QAAQ,KAAK,CAAC,EAClD,MAAM,CAAC,EACP,IAAI,UAAU,EAAE,YAAY,KAAK,CAAC;AACrC,YAAM,YAAY,WAAW,CAAC;AAC9B,UAAI,CAAC,UAAW,QAAO;AAEvB,YAAM,CAAC,OAAO,IAAI,MAAM,GACrB,OAAO,OAAO,EACd,IAAI;AAAA,QACH,QAAQ;AAAA,QACR,WAAW,oBAAI,KAAK;AAAA,QACpB,WAAW,oBAAI,KAAK;AAAA,QACpB,WAAW,oBAAI,KAAK;AAAA,MACtB,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,UAAU,EAAE,CAAC,EAClC,UAAU;AACb,aAAQ,WAAW;AAAA,IACrB,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,mBAAkC;AACtC,QAAI,KAAK,aAAc;AACvB,QAAI;AACF,YAAM,KAAK,GAAG,YAAY,OAAO,OAAO;AACtC,cAAM,YAAY,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,gBAAgB;AAC7D,cAAM,QAAQ,MAAM,GACjB,OAAO,EAAE,IAAI,QAAQ,GAAG,CAAC,EACzB,KAAK,OAAO,EACZ;AAAA,UACC,IAAI,GAAG,QAAQ,QAAQ,SAAS,GAAG,GAAG,QAAQ,WAAW,SAAS,CAAC;AAAA,QACrE,EACC,IAAI,UAAU,EAAE,YAAY,KAAK,CAAC;AACrC,YAAI,MAAM,WAAW,EAAG;AACxB,cAAM,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;AACjC,cAAM,GACH,OAAO,OAAO,EACd,IAAI,EAAE,QAAQ,WAAW,WAAW,MAAM,WAAW,KAAK,CAAC,EAC3D,MAAM,QAAQ,QAAQ,IAAI,GAAG,CAAC;AACjC,mBAAW,MAAM,KAAK;AACpB,eAAK,OAAO,KAAK,gCAAgC,EAAE,EAAE;AAAA,QACvD;AAAA,MACF,CAAC;AAAA,IACH,SAAS,KAAK;AACZ,WAAK,OAAO,MAAM,4BAA6B,IAAc,OAAO,EAAE;AAAA,IACxE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,WAAW,SAAmC;AAC1D,UAAM,gBAAgB,qBAAqB,IAAI,QAAQ,OAAO;AAG9D,QAAI,CAAC,eAAe;AAClB,WAAK,OAAO;AAAA,QACV,sCAAsC,QAAQ,OAAO,UAAU,QAAQ,EAAE;AAAA,MAC3E;AACA,YAAM,KAAK;AAAA,QACT;AAAA,QACA,IAAI,MAAM,sCAAsC,QAAQ,OAAO,GAAG;AAAA;AAAA,SAC/C,QAAQ,YAAY,KAAK;AAAA,MAC9C;AACA;AAAA,IACF;AAIA,QAAI,QAAQ,gBAAgB;AAC1B,YAAM,WAAW,MAAM,KAAK,GACzB,OAAO,EAAE,IAAI,QAAQ,GAAG,CAAC,EACzB,KAAK,OAAO,EACZ;AAAA,QACC;AAAA,UACE,GAAG,QAAQ,gBAAgB,QAAQ,cAAc;AAAA,UACjD,GAAG,QAAQ,QAAQ,SAAS;AAAA,QAC9B;AAAA,MACF;AACF,YAAM,QAAQ,SAAS,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ,EAAE;AACtD,UAAI,OAAO;AACT,cAAM,KAAK,GACR,OAAO,OAAO,EACd,IAAI;AAAA,UACH,QAAQ;AAAA,UACR,WAAW;AAAA,UACX,WAAW;AAAA,UACX,WAAW,oBAAI,KAAK;AAAA,QACtB,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,QAAQ,EAAE,CAAC;AACnC;AAAA,MACF;AAAA,IACF;AAEA,UAAM,OAAO,cAAc;AAC3B,UAAM,eAAe,cAAc;AAcnC,UAAM,UAAU,KAAK,UAAU;AAAA,MAC7B;AAAA,MACA,EAAE,QAAQ,MAAM;AAAA,IAClB;AACA,UAAM,MAA2B;AAAA,MAC/B,OAAO,QAAQ;AAAA,MACf,KAAK;AAAA,MACL,MAAM,KAAK,WAAW,OAAO;AAAA,MAC7B,YAAY,KAAK,YAAY,OAAO;AAAA,MACpC,QAAQ,IAAI,OAAO,UAAU,QAAQ,EAAE,EAAE;AAAA,IAC3C;AAEA,UAAM,iBAAiB,QAAQ,YAAY;AAC3C,QAAI;AAEF,YAAM,SAAU,MAAM,QAAQ,IAAI,GAAG;AAErC,YAAM,KAAK,GACR,OAAO,OAAO,EACd,IAAI;AAAA,QACH,QAAQ;AAAA,QACR,QAAS,UAAU,CAAC;AAAA,QACpB,YAAY,oBAAI,KAAK;AAAA,QACrB,WAAW,oBAAI,KAAK;AAAA,QACpB,UAAU,iBAAiB;AAAA,MAC7B,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,QAAQ,EAAE,CAAC;AAAA,IACrC,SAAS,KAAK;AAEZ,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,GACR,OAAO,OAAO,EACd,IAAI;AAAA,UACH,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK;AAAA,UAClC,WAAW;AAAA,UACX,WAAW;AAAA,UACX,OAAO,eAAe,KAAK,cAAc,IAAI;AAAA,UAC7C,WAAW,oBAAI,KAAK;AAAA,QACtB,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,QAAQ,EAAE,CAAC;AAAA,MACrC,OAAO;AACL,cAAM,KAAK,WAAW,SAAS,KAAK,YAAY;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,WACZ,SACA,KACA,eACe;AACf,UAAM,KAAK,GACR,OAAO,OAAO,EACd,IAAI;AAAA,MACH,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,YAAY,oBAAI,KAAK;AAAA,MACrB,OAAO,eAAe,KAAK,eAAe,KAAK;AAAA,MAC/C,WAAW,oBAAI,KAAK;AAAA,IACtB,CAAC,EACA,MAAM,GAAG,QAAQ,IAAI,QAAQ,EAAE,CAAC;AAInC,QAAI,QAAQ,sBAAsB,aAAa;AAC7C,UAAI;AAKF,cAAM,KAAK,aAAa,OAAO,QAAQ,IAAI;AAAA,UACzC,SAAS;AAAA,UACT,QAAQ;AAAA,UACR,UAAU,QAAQ;AAAA,QACpB,CAAC;AAAA,MACH,SAAS,YAAY;AAEnB,aAAK,OAAO;AAAA,UACV,yBAAyB,QAAQ,EAAE,KAAM,WAAqB,OAAO;AAAA,QACvE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAMQ,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;AAEA,YAAM,MAAM,MAAM,KAAK,YAAY,IAAI,EAAE;AACzC,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,aAAa,MAAM,MAAM,OAAO;AAAA,QAC1C,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;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,YAAY,OAAgC;AACxD,UAAM,SAAS,MAAM,KAAK,GAAG;AAAA,MAC3B,gFAAgF,KAAK;AAAA,IACvF;AASA,UAAM,MAAM;AACZ,UAAM,OAAkC,MAAM,QAAQ,GAAG,IACrD,MACA,MAAM,QAAQ,KAAK,IAAI,IACrB,IAAI,OACJ,CAAC;AACP,UAAM,OAAO,KAAK,CAAC,GAAG;AACtB,WAAO,OAAO,SAAS,cAAc,IAAI,OAAO,IAAI;AAAA,EACtD;AAAA;AAAA;AAAA;AAKF;AAvca,YAAN;AAAA,EADN,WAAW;AAAA,EAgBP,0BAAO,OAAO;AAAA,EACd,0BAAO,gBAAgB;AAAA,EACvB,0BAAO,eAAe;AAAA,EACtB,0BAAO,gBAAgB;AAAA,EACvB,0BAAO,kBAAkB;AAAA,GAnBjB;","names":[]}