@bitfab/sdk 0.33.4 → 0.33.6

package/dist/{chunk-HWQB73HK.js → chunk-DPV6PBWE.js}

@@ -463,8 +463,11 @@ function toJsonSafeInner(value, depth, seen, dropped) {
 }
 
 // src/replay.ts
+function dbBranchEnabled(dbBranch) {
+  return dbBranch !== void 0 && dbBranch !== false;
+}
 function resolveDbBranchSettings(dbBranch) {
-  if (!dbBranch) {
+  if (!dbBranch || dbBranch === true) {
     return void 0;
   }
   const { minCu, maxCu, warmupSql } = dbBranch;
@@ -734,7 +737,7 @@ async function replay(httpClient, serviceUrl, traceFunctionKey, fn, options, reg
     options?.name,
     codeChangeDescription,
     codeChangeFiles,
-    options?.dbBranch !== void 0,
+    dbBranchEnabled(options?.dbBranch),
     // includeDbBranchLease
     options?.experimentGroupId,
     options?.datasetId,
@@ -757,7 +760,7 @@ async function replay(httpClient, serviceUrl, traceFunctionKey, fn, options, reg
       mockStrategy,
       resolvedOverrides,
       replayedTraceIds[index],
-      options?.dbBranch !== void 0,
+      dbBranchEnabled(options?.dbBranch),
       resolveDbBranchSettings(options?.dbBranch),
       options?.adaptInputs
     )
@@ -910,4 +913,4 @@ export {
   reportReplayProgress,
   replay
 };
-//# sourceMappingURL=chunk-HWQB73HK.js.map
+//# sourceMappingURL=chunk-DPV6PBWE.js.map

package/dist/chunk-DPV6PBWE.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/codeChange.ts","../src/errors.ts","../src/mockOverride.ts","../src/warnOnce.ts","../src/randomUuid.ts","../src/asyncStorage.ts","../src/replayContext.ts","../src/serialize.ts","../src/replay.ts"],"sourcesContent":["import type { CodeChangeFile } from \"./http\"\n\n/**\n * Auto-capture the code change to attach to a replay, when the caller passed\n * none explicitly.\n *\n * This lives in the SDK (not a wrapper) on purpose: `replay()` is the only point\n * guaranteed to run on every replay, so capturing here works no matter how the\n * replay was launched (plugin wrapper, a hand-run script, CI). Precedence:\n *\n *   1. `BITFAB_CODE_CHANGE_PATH` file  — an override a caller/tool can inject.\n *   2. `git diff` vs trunk             — the default fallback.\n *\n * Both are best-effort and browser-safe: any failure (no git, no fs, not a repo,\n * bad JSON) yields `null` and the replay proceeds with no code change. The diff\n * is cumulative (whole branch vs trunk), not per-experiment; an explicit\n * `codeChangeFiles` on `replay()` always wins over this and is what carries a\n * precise per-experiment before/after.\n */\n\nexport interface ResolvedCodeChange {\n  description?: string\n  files?: CodeChangeFile[]\n}\n\n// Bounds so a large delta never bloats the experiment payload.\nconst MAX_FILES = 60\nconst MAX_FILE_BYTES = 500_000\nconst MAX_TOTAL_BYTES = 2_000_000\n\n// Candidate trunk refs, tried in order, when no explicit base is supplied.\nconst TRUNK_CANDIDATES = [\n  \"origin/HEAD\",\n  \"origin/main\",\n  \"origin/master\",\n  \"main\",\n  \"master\",\n]\n\nconst NUL = String.fromCharCode(0)\n\n/**\n * Resolve an auto code change: the `BITFAB_CODE_CHANGE_PATH` override first,\n * then the git-vs-trunk diff. Returns null when neither yields anything.\n */\nexport async function resolveAutoCodeChange(\n  label?: string,\n): Promise<ResolvedCodeChange | null> {\n  if (typeof process === \"undefined\") {\n    return null\n  }\n  if (process.env?.BITFAB_DISABLE_CODE_CHANGE_CAPTURE) {\n    return null\n  }\n  const fromEnv = await readCodeChangeFile()\n  if (fromEnv) {\n    return fromEnv\n  }\n  return captureCodeChangeFromGit(process.cwd?.() ?? \".\", label)\n}\n\nasync function readCodeChangeFile(): Promise<ResolvedCodeChange | null> {\n  const path = process.env?.BITFAB_CODE_CHANGE_PATH\n  if (!path) {\n    return null\n  }\n  try {\n    const { readFile } = await import(\"node:fs/promises\")\n    const parsed = JSON.parse(await readFile(path, \"utf8\"))\n    // A malformed payload (non-array, or entries that aren't objects) must yield\n    // no code change, never forward a bad shape to the start-replay request.\n    const files =\n      Array.isArray(parsed?.files) &&\n      parsed.files.every(\n        (f: unknown) =>\n          typeof f === \"object\" && f !== null && !Array.isArray(f),\n      )\n        ? parsed.files\n        : undefined\n    const description =\n      typeof parsed?.description === \"string\" ? parsed.description : undefined\n    if (!files && description === undefined) {\n      return null\n    }\n    return { description, files }\n  } catch {\n    return null\n  }\n}\n\nasync function captureCodeChangeFromGit(\n  cwd: string,\n  label?: string,\n): Promise<ResolvedCodeChange | null> {\n  let execFile: typeof import(\"node:child_process\").execFile\n  let readFile: typeof import(\"node:fs/promises\").readFile\n  try {\n    ;({ execFile } = await import(\"node:child_process\"))\n    ;({ readFile } = await import(\"node:fs/promises\"))\n  } catch {\n    // No child_process / fs (e.g. a browser bundle): capture is a no-op.\n    return null\n  }\n\n  const git = (dir: string, args: string[]): Promise<string | null> =>\n    new Promise((resolve) => {\n      execFile(\n        \"git\",\n        args,\n        // 30s timeout so a hung git (e.g. a network-touching ref op) can't\n        // block the whole replay indefinitely.\n        { cwd: dir, maxBuffer: 64 * 1024 * 1024, timeout: 30_000 },\n        (err, stdout) => resolve(err ? null : stdout),\n      )\n    })\n\n  try {\n    const root = (await git(cwd, [\"rev-parse\", \"--show-toplevel\"]))?.trim()\n    if (!root) {\n      return null\n    }\n\n    const resolved = await resolveBase(git, root)\n    if (!resolved) {\n      return null\n    }\n    const { base, fromTrunk } = resolved\n\n    // Size of a path on either side WITHOUT reading its contents: the git blob\n    // size for `before`, a stat for the working `after`. Lets us skip an\n    // oversized file before loading it into memory.\n    const blobBytes = async (ref: string, path: string): Promise<number> => {\n      const out = await git(root, [\"cat-file\", \"-s\", `${ref}:${path}`])\n      const n = out ? Number.parseInt(out.trim(), 10) : Number.NaN\n      return Number.isFinite(n) ? n : 0\n    }\n    const workingBytes = async (path: string): Promise<number> => {\n      try {\n        const { stat } = await import(\"node:fs/promises\")\n        const { join } = await import(\"node:path\")\n        return (await stat(join(root, path))).size\n      } catch {\n        return 0\n      }\n    }\n\n    // Tracked changes vs base. `:!.bitfab` keeps replay artifacts out.\n    const tracked = await git(root, [\n      \"diff\",\n      \"--name-status\",\n      \"--no-renames\",\n      \"-z\",\n      base,\n      \"--\",\n      \":!.bitfab\",\n    ])\n    // Untracked-but-not-ignored files (the diff above omits these).\n    const untracked = await git(root, [\n      \"ls-files\",\n      \"--others\",\n      \"--exclude-standard\",\n      \"-z\",\n      \"--\",\n      \":!.bitfab\",\n    ])\n\n    const entries: Array<{ status: string; path: string }> = [\n      ...parseNameStatusZ(tracked ?? \"\"),\n      ...(untracked ?? \"\")\n        .split(NUL)\n        .filter((p) => p.length > 0)\n        .map((path) => ({ status: \"A\", path })),\n    ]\n    if (entries.length === 0) {\n      return null\n    }\n\n    const files: CodeChangeFile[] = []\n    let totalBytes = 0\n    for (const { status, path } of entries) {\n      if (files.length >= MAX_FILES) {\n        break\n      }\n      // Skip oversized files by size BEFORE reading their full contents, so a\n      // huge changed file can't OOM/stall the replay just to be discarded.\n      const beforeBytes = status === \"A\" ? 0 : await blobBytes(base, path)\n      const afterBytes = status === \"D\" ? 0 : await workingBytes(path)\n      if (beforeBytes > MAX_FILE_BYTES || afterBytes > MAX_FILE_BYTES) {\n        continue\n      }\n      // Normalize CRLF -> LF on both sides: git's blob is already LF-normalized\n      // (autocrlf clean), so a raw CRLF working file would otherwise skew every\n      // line as changed. Comparing/storing LF keeps the diff meaningful.\n      const before = (\n        status === \"A\"\n          ? \"\"\n          : ((await git(root, [\"show\", `${base}:${path}`])) ?? \"\")\n      ).replace(/\\r\\n/g, \"\\n\")\n      const after = (\n        status === \"D\" ? \"\" : await readWorkingFile(readFile, root, path)\n      ).replace(/\\r\\n/g, \"\\n\")\n      if (before === after) {\n        continue\n      }\n      // Bytes, not chars: a multi-byte source file must count against the byte\n      // cap the same way Ruby's `bytesize` does.\n      const size =\n        Buffer.byteLength(before, \"utf8\") + Buffer.byteLength(after, \"utf8\")\n      if (\n        totalBytes + size > MAX_TOTAL_BYTES ||\n        looksBinary(before) ||\n        looksBinary(after)\n      ) {\n        continue\n      }\n      totalBytes += size\n      files.push({ path, before, after })\n    }\n\n    if (files.length === 0) {\n      return null\n    }\n\n    const subject = (\n      await git(root, [\"log\", \"-1\", \"--format=%s\", \"HEAD\"])\n    )?.trim()\n    const fileWord = files.length === 1 ? \"file\" : \"files\"\n    const head = label?.trim() || subject || \"Working-tree change\"\n    // \"vs trunk\" only when we actually diffed against a trunk merge-base; the\n    // HEAD fallback captures uncommitted work only, so label it honestly.\n    const against = fromTrunk ? \"vs trunk\" : \"uncommitted (vs HEAD)\"\n    return {\n      description: `${head} (${files.length} ${fileWord} changed ${against})`,\n      files,\n    }\n  } catch {\n    return null\n  }\n}\n\nasync function resolveBase(\n  git: (dir: string, args: string[]) => Promise<string | null>,\n  root: string,\n): Promise<{ base: string; fromTrunk: boolean } | null> {\n  const forced = process.env?.BITFAB_CODE_CHANGE_BASE\n  if (forced && (await refExists(git, root, forced))) {\n    const base =\n      (await git(root, [\"merge-base\", \"HEAD\", forced]))?.trim() ||\n      (await git(root, [\"rev-parse\", \"--verify\", forced]))?.trim() ||\n      null\n    return base ? { base, fromTrunk: true } : null\n  }\n  for (const candidate of TRUNK_CANDIDATES) {\n    if (!(await refExists(git, root, candidate))) {\n      continue\n    }\n    const mb = (await git(root, [\"merge-base\", \"HEAD\", candidate]))?.trim()\n    if (mb) {\n      return { base: mb, fromTrunk: true }\n    }\n  }\n  return (await refExists(git, root, \"HEAD\"))\n    ? { base: \"HEAD\", fromTrunk: false }\n    : null\n}\n\nasync function refExists(\n  git: (dir: string, args: string[]) => Promise<string | null>,\n  root: string,\n  ref: string,\n): Promise<boolean> {\n  return (\n    (await git(root, [\"rev-parse\", \"--verify\", `${ref}^{object}`])) !== null\n  )\n}\n\nasync function readWorkingFile(\n  readFile: typeof import(\"node:fs/promises\").readFile,\n  root: string,\n  path: string,\n): Promise<string> {\n  try {\n    const { join } = await import(\"node:path\")\n    return await readFile(join(root, path), \"utf8\")\n  } catch {\n    return \"\"\n  }\n}\n\nfunction parseNameStatusZ(\n  raw: string,\n): Array<{ status: string; path: string }> {\n  const parts = raw.split(NUL).filter((p) => p.length > 0)\n  const out: Array<{ status: string; path: string }> = []\n  for (let i = 0; i + 1 < parts.length; i += 2) {\n    out.push({ status: parts[i].charAt(0), path: parts[i + 1] })\n  }\n  return out\n}\n\nfunction looksBinary(s: string): boolean {\n  return s.slice(0, 8000).includes(NUL)\n}\n","/**\n * Shared error type for Bitfab SDK runtime errors. Lives in its own\n * module to avoid import cycles between `http.ts` and modules that need\n * to throw structured errors (e.g. `dbSnapshot.ts` validation).\n */\n\nexport class BitfabError extends Error {\n  constructor(\n    message: string,\n    public readonly url?: string,\n  ) {\n    super(message)\n    this.name = \"BitfabError\"\n  }\n}\n","/**\n * Selective mock overrides for replay.\n *\n * A mock override injects a custom value into a specific span (node) during\n * replay: the matched span short-circuits its real execution and returns the\n * value you supply, so downstream real code runs against the substituted\n * output. This is a third mock mode alongside \"run real code\" and \"replay\n * recorded output\" (see {@link MockStrategy}).\n *\n * The matcher and value are deliberately separate so matching stays cheap\n * (structural metadata only, no output fetch) and the recorded output is\n * fetched lazily - and only if the value function actually asks for it via\n * {@link MockOverrideCtx.getOriginalOutput}.\n */\n\n/**\n * Structural identity of a span during replay, passed to a {@link NodeMatcher}.\n * Carries no output payload - matching must not depend on the recorded output,\n * so the output fetch stays lazy and gated.\n */\nexport interface SpanNodeMeta {\n  /** The `withSpan` key of the executing span (its code-side identity). */\n  traceFunctionKey: string\n  /** Resolved span name: `options.name ?? fn.name ?? traceFunctionKey`. */\n  spanName: string\n  /** Span type, e.g. \"llm\", \"agent\", \"tool\", \"custom\". */\n  type: string\n  /**\n   * The id of this span in the original (replayed) trace, when it exists in\n   * that trace's tree. Undefined when the live span has no recorded\n   * counterpart (e.g. a span the changed code newly introduced).\n   */\n  originalSpanId?: string\n}\n\n/** Context passed to a {@link MockValue} function for a matched span. */\nexport interface MockOverrideCtx {\n  /** The matched span's structural metadata. */\n  node: SpanNodeMeta\n  /** The live replay args passed to the wrapped function this run. */\n  inputs: unknown[]\n  /**\n   * Lazily fetch this span's ORIGINAL recorded output (deserialized). The fetch\n   * happens only when called and is memoized per replay item, so a purely flat\n   * override that never calls it triggers zero output round trips. Rejects if\n   * the span has no recorded counterpart. Being async, it is only usable for\n   * spans wrapping async functions.\n   */\n  getOriginalOutput: () => Promise<unknown>\n}\n\n/** Selects which spans an override applies to. Runs on structural metadata. */\nexport type NodeMatcher = (node: SpanNodeMeta) => boolean\n\n/** The function form of {@link MockValue}, receiving the override context. */\nexport type MockValueFn = (ctx: MockOverrideCtx) => unknown | Promise<unknown>\n\n/**\n * The value injected for a matched span: either a flat value used as-is, or a\n * function of the {@link MockOverrideCtx} that returns one (or a Promise of\n * one). Full replacement - the value IS the span's output, no merge with the\n * recorded output.\n *\n * The flat side is spelled out (rather than `unknown`) so an inline function\n * still gets a typed `ctx`: `unknown | Fn` would collapse to `unknown` and drop\n * the contextual type. To inject a value that is itself a function, wrap it:\n * `value: () => theFunction`.\n */\nexport type MockValue =\n  | MockValueFn\n  | string\n  | number\n  | boolean\n  | bigint\n  | symbol\n  | object\n  | null\n  | undefined\n\n/** One (match, value) pair. */\nexport interface MockOverride {\n  match: NodeMatcher\n  value: MockValue\n}\n\n/**\n * Resolve an override's `value`: call it with `ctx` when it's a function, else\n * use it as-is (a flat value).\n */\nexport function resolveMockValue(\n  value: MockValue,\n  ctx: MockOverrideCtx,\n): unknown | Promise<unknown> {\n  return typeof value === \"function\"\n    ? (value as (c: MockOverrideCtx) => unknown | Promise<unknown>)(ctx)\n    : value\n}\n\n/**\n * Normalize the per-call `mockOverride` option (a single override, an array, or\n * nothing) into an array. First match wins downstream, so order is preserved.\n */\nexport function normalizeMockOverrides(\n  mockOverride?: MockOverride | MockOverride[],\n): MockOverride[] {\n  if (mockOverride === undefined) {\n    return []\n  }\n  return Array.isArray(mockOverride) ? mockOverride : [mockOverride]\n}\n","/**\n * Emit a `console.warn` at most once per distinct `key` for the life of the\n * process.\n *\n * The SDK must NEVER crash a host app, so every failure on the user's path\n * degrades silently (a span is dropped, a call runs untraced, a payload is\n * stubbed). Silent is safe but undebuggable: a user who suddenly has no traces,\n * or sees `<unserializable>` in a span, has no signal as to why. A one-time\n * warning per distinct issue restores that signal without spamming the console\n * from a hot path.\n *\n * Keys should identify the specific degradation (e.g. include the traced\n * function key) so each distinct issue warns once, not just the first one seen.\n */\nconst warned = new Set<string>()\n\nexport function warnOnce(key: string, message: string): void {\n  if (warned.has(key)) {\n    return\n  }\n  warned.add(key)\n  try {\n    console.warn(`[bitfab] ${message}`)\n  } catch {\n    // Logging must never crash the host app (e.g. a closed/replaced console).\n  }\n}\n\n/** Test-only: clear the dedup set so a warning can fire again. */\nexport function _resetWarnOnce(): void {\n  warned.clear()\n}\n","/**\n * Generate a UUID v4 without assuming a global `crypto`.\n *\n * `crypto.randomUUID()` is the fast path and exists in every mainstream modern\n * runtime (Node >= 19, all browsers, Deno, Vercel edge, Cloudflare Workers).\n * But the SDK must NEVER crash a host app, and a few runtimes it can legitimately\n * run in lack a global `crypto` or `crypto.randomUUID` (Node < 19 without a\n * polyfill, older React Native, some sandboxes). There, an unguarded\n * `crypto.randomUUID()` throws on the user's call path. This helper falls back\n * to a `Math.random()`-based v4 string instead.\n *\n * The fallback is NOT cryptographically secure. That is fine: trace and span\n * IDs only need to be unique enough to correlate the spans of one trace; they\n * are never security-sensitive.\n */\nimport { warnOnce } from \"./warnOnce.js\"\n\nexport function randomUuid(): string {\n  const globalCrypto = (\n    globalThis as { crypto?: { randomUUID?: () => string } }\n  ).crypto\n  if (typeof globalCrypto?.randomUUID === \"function\") {\n    try {\n      return globalCrypto.randomUUID()\n    } catch {\n      // Fall through to the manual generator below.\n    }\n  }\n  warnOnce(\n    \"crypto-unavailable\",\n    \"global crypto.randomUUID is unavailable; using a non-cryptographic fallback for trace/span ids. Tracing works normally (ids are correlation-only, not security-sensitive).\",\n  )\n  return fallbackUuidV4()\n}\n\n/**\n * RFC 4122 version 4 layout filled from `Math.random()`. Used only when a usable\n * global `crypto.randomUUID` is unavailable.\n */\nfunction fallbackUuidV4(): string {\n  return \"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx\".replace(/[xy]/g, (char) => {\n    const rand = (Math.random() * 16) | 0\n    const value = char === \"x\" ? rand : (rand & 0x3) | 0x8\n    return value.toString(16)\n  })\n}\n","/**\n * Shared AsyncLocalStorage loader.\n *\n * Provides two ways to initialize AsyncLocalStorage:\n *\n * 1. **Synchronous registration** (preferred for Node.js):\n *    `asyncStorageNode.ts` calls `registerAsyncLocalStorageClass()` at module\n *    evaluation time, so the class is available immediately - no async gap.\n *    The `node.ts` entry point imports it before anything else.\n *\n * 2. **Async dynamic import** (fallback for the default entry point):\n *    Loads `node:async_hooks` via a bundler-safe dynamic import. This is used\n *    by the default `index.ts` entry point so the SDK works in browsers\n *    (where the import silently fails) and in Node.js when imported via the\n *    default entry point.\n *\n * ## Why the dynamic import looks like this\n *\n * We need to handle three environments:\n *\n * 1. **Pure Node.js** - `import(\"node:async_hooks\")` works natively.\n * 2. **Webpack/Turbopack (Next.js server)** - The bundler processes\n *    `import()` calls at build time. The `webpackIgnore` magic comment tells\n *    webpack (and turbopack) to emit a native `import()` call instead of\n *    trying to resolve it, so Node.js handles it at runtime.\n * 3. **Browsers / Edge** - The `process.versions?.node` guard prevents\n *    execution entirely. If it somehow runs, `.catch(() => {})` swallows\n *    the failure.\n */\n\nexport interface AsyncLocalStorageLike<T> {\n  getStore(): T | undefined\n  run<R>(store: T, fn: () => R): R\n}\n\nlet AsyncLocalStorageClass: (new () => AsyncLocalStorageLike<unknown>) | null =\n  null\nlet initDone = false\n\n/**\n * Register the AsyncLocalStorage class synchronously.\n *\n * Called by `asyncStorageNode.ts` at module evaluation time so the class\n * is available before any span is created - no async gap, no race condition.\n *\n * Safe to call multiple times; subsequent calls are no-ops.\n */\nexport function registerAsyncLocalStorageClass(\n  cls: new () => AsyncLocalStorageLike<unknown>,\n): void {\n  if (!AsyncLocalStorageClass) {\n    AsyncLocalStorageClass = cls\n  }\n  initDone = true\n}\n\n/**\n * Assert that AsyncLocalStorage was registered successfully.\n *\n * Called by `node.ts` after importing `asyncStorageNode.ts` to catch\n * import-order bugs at startup rather than silently degrading to the\n * browser fallback (flat spans with no nesting).\n *\n * This should ONLY be called from the Node.js entry point where we\n * know `node:async_hooks` must be available.\n */\nexport function assertAsyncStorageRegistered(): void {\n  if (!AsyncLocalStorageClass) {\n    console.warn(\n      \"Bitfab: AsyncLocalStorage not available - nested span context will not propagate.\",\n    )\n  }\n}\n\nexport const asyncStorageReady: Promise<void> = (\n  typeof process !== \"undefined\" && process.versions?.node\n    ? // The join trick hides \"node:async_hooks\" from static analysis so\n      // bundlers that ban Node.js built-ins don't fail at build time.\n      // webpackIgnore tells webpack/turbopack to emit a native import()\n      // so Node.js can resolve the module at runtime.\n      import(\n        /* webpackIgnore: true */\n        [\"node\", \"async_hooks\"].join(\":\")\n      )\n        .then(\n          (mod: {\n            AsyncLocalStorage: new () => AsyncLocalStorageLike<unknown>\n          }) => {\n            registerAsyncLocalStorageClass(mod.AsyncLocalStorage)\n          },\n        )\n        .catch(() => {})\n    : Promise.resolve()\n).then(() => {\n  initDone = true\n})\n\nexport function isAsyncStorageInitDone(): boolean {\n  return initDone\n}\n\nexport function createAsyncLocalStorage<T>(): AsyncLocalStorageLike<T> | null {\n  return AsyncLocalStorageClass\n    ? (new AsyncLocalStorageClass() as AsyncLocalStorageLike<T>)\n    : null\n}\n","/**\n * Replay context propagation via AsyncLocalStorage.\n *\n * When set, the withSpan wrapper injects testRunId into the span payload\n * so that new spans created during replay are linked to the test run.\n * Optionally carries a mock tree so child spans can return historical\n * outputs instead of executing.\n */\n\nimport {\n  type AsyncLocalStorageLike,\n  asyncStorageReady,\n  createAsyncLocalStorage,\n} from \"./asyncStorage.js\"\nimport type { MockOverride } from \"./mockOverride.js\"\n\n/**\n * A single span entry in the mock tree.\n *\n * Under the eager path (`mock: \"all\"`) `output`/`outputMeta` are populated\n * inline. Under the lazy path (`marked` / overrides) they are absent and the\n * recorded output is fetched on demand via `externalSpanId` - see\n * {@link ReplayContext.fetchSpanOutput}.\n */\nexport interface MockSpan {\n  sourceSpanId: string\n  /** Row id accepted by `getExternalSpan`, for the lazy per-span output fetch. */\n  externalSpanId?: string\n  output?: unknown\n  outputMeta?: unknown\n}\n\n/**\n * Per-item DB branch resolved by the Bitfab service from the source\n * trace's `dbSnapshotRef`. Carried on the replay context so that\n * customer code reads `databaseUrl` through `getCurrentReplayBranch()`, and so\n * the process-isolated replay runner can materialize it into a `.env`\n * overlay file before customer code initializes its DB client.\n *\n * `neonBranchId` is the literal Neon branch id; passing it to\n * `releaseDbBranchLease` deletes that branch.\n */\nexport interface DbBranchLease {\n  neonBranchId: string\n  /** Env var name the customer's app reads, e.g. \"DATABASE_URL\". */\n  envKey: string\n  databaseUrl: string\n  expiresAt: string\n  /**\n   * The instant the branch was pinned to (the source trace's wall clock).\n   * Echoed back in `db_snapshot_usage` on the replayed trace's completion.\n   */\n  snapshotTimestamp?: string\n  providerConsoleUrl?: string\n  readOnly?: boolean\n  /**\n   * The branch's region, e.g. `aws-us-east-1`. A compute runs in its project's\n   * region, so a runner elsewhere pays that round trip on every query.\n   */\n  region?: string\n}\n\n/**\n * Wire shape of the caller's `ReplayOptions.dbBranch`, sent to\n * `/api/sdk/replay/start` and applied per lease.\n */\nexport interface DbBranchSettings {\n  minCu?: number\n  maxCu?: number\n  warmupSql?: string\n}\n\n/**\n * Pre-built lookup table of historical span outputs.\n * Keys are `${traceFunctionKey}:${spanName}:${callIndex}` so that repeated\n * calls with the same (key, name) are matched by call order, but spans\n * sharing only the traceFunctionKey (different name) do not collide.\n */\nexport interface MockTree {\n  spans: Map<string, MockSpan>\n}\n\nexport interface ReplayContext {\n  testRunId: string\n  traceId?: string\n  inputSourceSpanId?: string\n  /**\n   * External trace ID from `external_traces.id`. Used for span-chain\n   * lookup against the source platform's trace tree (Braintrust, etc.).\n   * NOT the same as the Bitfab `traceId` - see `sourceBitfabTraceId`.\n   */\n  inputSourceTraceId?: string\n  /**\n   * The Bitfab `traces.id` of the historical trace that produced this\n   * replay item's input. This is what customer-facing surfaces (e.g.\n   * `ReplayBranch.traceId`) should expose, since it's the ID the\n   * customer sees in the Bitfab dashboard.\n   */\n  sourceBitfabTraceId?: string\n  mockTree?: MockTree\n  callCounters?: Map<string, number>\n  mockStrategy?: \"none\" | \"all\" | \"marked\"\n  /**\n   * Resolved override chain for this replay, per-call overrides first then\n   * registered ones (first matcher wins). Empty/absent when no overrides apply.\n   */\n  mockOverrides?: MockOverride[]\n  /**\n   * Memoized lazy fetch of a span's recorded output (deserialized), keyed by\n   * `externalSpanId`. Present ONLY on the lazy path (`marked` / overrides);\n   * absent under `mock: \"all\"`, where outputs are inline on the mock tree. Its\n   * presence is the signal that outputs must be fetched rather than read inline.\n   */\n  fetchSpanOutput?: (externalSpanId: string) => Promise<unknown>\n  dbBranchLease?: DbBranchLease\n  /**\n   * Set to true by `ReplayBranch` the first time customer code actually\n   * obtains `databaseUrl` for this item. Reported on the trace completion inside\n   * `db_snapshot_usage` so the server can distinguish \"branch was\n   * provisioned and exposed\" from \"branch URL was actually consumed\".\n   * Any future consumption path that hands the URL to customer code by\n   * other means (e.g. a process-isolated runner writing an env overlay)\n   * must also set this.\n   */\n  dbSnapshotAccessed?: boolean\n  /**\n   * Collector for the replay item's trace-persistence work. When present,\n   * the root span's send path pushes a promise that resolves only after\n   * every span upload AND the trace completion have been sent (registered\n   * synchronously at send time, so the replay runner can await it after\n   * the wrapped fn resolves). This is what lets replay guarantee traces\n   * are persisted server-side before `completeReplay` builds the\n   * trace-ID mapping. Absent outside replay, where sends stay\n   * fire-and-forget.\n   */\n  pendingPersistence?: Promise<unknown>[]\n}\n\nlet replayContextStorage: AsyncLocalStorageLike<ReplayContext | null> | null =\n  null\nconst REPLAY_CONTEXT_STORAGE_SYMBOL = Symbol.for(\"bitfab.replayContextStorage\")\n\nexport const replayContextReady: Promise<void> = asyncStorageReady.then(() => {\n  const shared = globalThis as typeof globalThis & Record<symbol, unknown>\n  const existing = shared[REPLAY_CONTEXT_STORAGE_SYMBOL] as\n    | AsyncLocalStorageLike<ReplayContext | null>\n    | undefined\n  if (existing) {\n    replayContextStorage = existing\n    return\n  }\n  const created = createAsyncLocalStorage<ReplayContext | null>()\n  if (created) {\n    shared[REPLAY_CONTEXT_STORAGE_SYMBOL] = created\n    replayContextStorage = created\n  }\n})\n\n/** Get the current replay context, if any. */\nexport function getReplayContext(): ReplayContext | null {\n  return replayContextStorage?.getStore() ?? null\n}\n\n/** Run a function within a replay context. */\nexport function runWithReplayContext<T>(ctx: ReplayContext, fn: () => T): T {\n  if (replayContextStorage) {\n    return replayContextStorage.run(ctx, fn)\n  }\n  return fn()\n}\n","/**\n * Serialization utilities for Bitfab SDK.\n *\n * This module provides serialization with type metadata preservation,\n * using superjson for handling special JavaScript types like Date, Map,\n * Set, BigInt, undefined, etc.\n */\n\nimport superjson from \"superjson\"\nimport { warnOnce } from \"./warnOnce.js\"\n\n/**\n * Serialized value with JSON data and optional superjson meta for type preservation.\n *\n * The json field contains the JSON-serializable data.\n * The meta field (if present) contains superjson type information for deserializing\n * special types like Date, Map, Set, BigInt, etc.\n */\nexport interface SerializedValue {\n  json: unknown\n  meta?: unknown\n}\n\n// Cap on serialized payload size. superjson can succeed on values like SDK\n// client instances (OpenAI, etc.) and produce hundreds of KB to MB of useless\n// internal state. Anything beyond this is replaced with a stub so the span\n// still ships and the trace isn't dropped server-side.\nconst MAX_SERIALIZED_BYTES = 512_000\n\n// A higher cap for the framework-capture path (toJsonSafe). Agent/graph states\n// (LangGraph, Claude Agent SDK) are legitimately larger than a single\n// function's args/return, so this ceiling preserves real detail while still\n// bounding the payload so the wire-side JSON.stringify can't blow up or get the\n// span rejected server-side.\nconst MAX_FRAMEWORK_SERIALIZED_BYTES = 2_000_000\n\nfunction describeValue(value: unknown): string {\n  try {\n    const ctorName = (value as { constructor?: { name?: string } })?.constructor\n      ?.name\n    if (ctorName && ctorName !== \"Object\") {\n      return ctorName\n    }\n  } catch {\n    // Property access on `value` can throw (Proxy, poisoned getter).\n  }\n  return typeof value\n}\n\nfunction unserializableStub(value: unknown, reason: string): SerializedValue {\n  // Normalize the byte count out of the key so a too_large warning dedups\n  // across differently-sized payloads instead of warning once per size.\n  warnOnce(\n    `serialize:${reason.replace(/\\d+/g, \"N\")}`,\n    `a value could not be fully serialized for a span (${reason}); it was replaced with a placeholder. The span still ships, but its captured input/output is incomplete.`,\n  )\n  let summary: string\n  try {\n    summary = `<unserializable: ${describeValue(value)} (${reason})>`\n  } catch {\n    summary = `<unserializable (${reason})>`\n  }\n  return { json: summary }\n}\n\n/**\n * Serialize a value using superjson for trace storage.\n *\n * Handles arbitrary JavaScript values including:\n * - Date, RegExp, Error\n * - Map, Set\n * - BigInt\n * - undefined (in objects/arrays)\n * - Circular references\n *\n * Guarantees:\n * - Never throws. Pathological inputs (SDK clients, proxies, poisoned\n *   getters, circular graphs that defeat superjson) return a stub string.\n * - Never returns a payload larger than MAX_SERIALIZED_BYTES; oversized\n *   inputs are replaced with a stub. Without this the wire-side\n *   `JSON.stringify` in http.ts can produce a request that times out or\n *   gets rejected, leaving a trace with zero spans.\n *\n * @param value - Any JavaScript value to serialize\n * @returns SerializedValue with 'json' field containing the data.\n *          If type metadata is needed for reconstruction, includes 'meta' field.\n *\n * @example\n * ```typescript\n * const result = serializeValue(new Date('2024-01-15T10:30:00Z'))\n * // result.json contains the ISO string\n * // result.meta contains type info for Date reconstruction\n * ```\n */\nexport function serializeValue(value: unknown): SerializedValue {\n  try {\n    const { json, meta } = superjson.serialize(value)\n\n    let size: number\n    try {\n      size = JSON.stringify(json).length\n    } catch {\n      return unserializableStub(value, \"stringify_failed_after_superjson\")\n    }\n    if (size > MAX_SERIALIZED_BYTES) {\n      return unserializableStub(value, `too_large_${size}_bytes`)\n    }\n\n    return meta ? { json, meta } : { json }\n  } catch {\n    try {\n      return { json: JSON.parse(JSON.stringify(value)) }\n    } catch {\n      return unserializableStub(value, \"json_stringify_failed\")\n    }\n  }\n}\n\n/**\n * Deserialize a value that was serialized with serializeValue.\n *\n * @param serialized - A SerializedValue object with 'json' and optional 'meta'\n * @returns The reconstructed JavaScript value\n *\n * @example\n * ```typescript\n * const serialized = serializeValue(new Date('2024-01-15'))\n * const date = deserializeValue(serialized)\n * // date is a Date object\n * ```\n */\nexport function deserializeValue(serialized: SerializedValue): unknown {\n  if (serialized.meta === undefined) {\n    // No metadata, return as-is\n    return serialized.json\n  }\n\n  // Use superjson to deserialize with type reconstruction\n  // Cast json to the expected superjson type\n  type SuperJSONResult = Parameters<typeof superjson.deserialize>[0]\n  return superjson.deserialize({\n    json: serialized.json as SuperJSONResult[\"json\"],\n    meta: serialized.meta as SuperJSONResult[\"meta\"],\n  })\n}\n\nconst MAX_SAFE_DEPTH = 6\n\n/**\n * Convert any value to JSON-safe primitives, never throwing.\n *\n * Produces plain objects/arrays/scalars, recursing through `toJSON()` and\n * own-enumerable properties so no raw non-serializable value (a class, a\n * BigInt-bearing object) survives into a span payload. Cycles collapse to a\n * `<cycle ...>` marker; depth is capped.\n *\n * This is the single shared \"safe serialize\" used by the framework\n * integrations that capture raw objects (LangGraph, Claude Agent SDK). Keeping\n * the recurse-the-dump logic here, in one place, is what stops a new\n * integration from reintroducing the \"dump without recursing\" bug - see\n * `serializationInvariant.test.ts`.\n */\nexport function toJsonSafe(value: unknown): unknown {\n  return toJsonSafeReport(value).safe\n}\n\n/**\n * Like {@link toJsonSafe}, but also reports what could not be faithfully\n * captured.\n *\n * Returns `{ safe, dropped }` where `dropped` lists the type name behind every\n * placeholder the walker had to emit: a cycle, a max-depth cut, an oversized\n * payload, or a value that could only be stringified (a function/symbol) or\n * stubbed after a throw. A non-empty `dropped` means the captured input/output\n * is lossy. Framework handlers carry it to the send boundary so a degraded\n * capture is marked non-replayable (`serialization_degraded`) instead of being\n * shipped as if it round-trips - mirrors the Python SDK's `to_json_safe_report`\n * + `finalize_span_payload`.\n */\nexport function toJsonSafeReport(value: unknown): {\n  safe: unknown\n  dropped: string[]\n} {\n  const dropped: string[] = []\n  const safe = toJsonSafeInner(value, 0, new WeakSet(), dropped)\n  // Cap output size for parity with serializeValue. A multi-MB framework\n  // payload (a large LangGraph state, a long message history) would otherwise\n  // be JSON.stringify'd synchronously on the user's thread in http.ts and may\n  // be rejected server-side, leaving a trace with zero spans. Stub it instead\n  // so the span still ships. toJsonSafeInner produces only plain\n  // objects/arrays/scalars/strings, so JSON.stringify here cannot throw; the\n  // try is belt-and-suspenders.\n  try {\n    const size = JSON.stringify(safe)?.length ?? 0\n    if (size > MAX_FRAMEWORK_SERIALIZED_BYTES) {\n      warnOnce(\n        \"toJsonSafe:too_large\",\n        `a framework payload exceeded ${MAX_FRAMEWORK_SERIALIZED_BYTES} bytes and was replaced with a placeholder so the span still ships. The captured state for this span is incomplete.`,\n      )\n      // Keep any drops already accumulated by the walk (cycles, functions,\n      // depth cuts); a payload can be both lossy AND oversized, and the\n      // non-replayable marking needs the real types, not just the size stub.\n      return {\n        safe: `<unserializable: too_large_${size}_bytes>`,\n        dropped: [...dropped, `too_large_${size}_bytes`],\n      }\n    }\n  } catch {\n    // Keep the recursed value; the http-layer sanitizer is the final backstop.\n  }\n  return { safe, dropped }\n}\n\nfunction toJsonSafeInner(\n  value: unknown,\n  depth: number,\n  seen: WeakSet<object>,\n  dropped: string[],\n): unknown {\n  if (value === null || value === undefined) {\n    return value\n  }\n  if (\n    typeof value === \"string\" ||\n    typeof value === \"number\" ||\n    typeof value === \"boolean\"\n  ) {\n    return value\n  }\n\n  const className =\n    (value as { constructor?: { name?: string } })?.constructor?.name ??\n    typeof value\n  if (depth > MAX_SAFE_DEPTH) {\n    dropped.push(className)\n    return `<${className}>`\n  }\n\n  // Non-object composites (bigint, function, symbol) stringify directly. A\n  // bigint stringifies faithfully; a function/symbol becomes a lossy summary,\n  // so those are reported as dropped.\n  if (typeof value !== \"object\") {\n    if (typeof value === \"function\" || typeof value === \"symbol\") {\n      dropped.push(className)\n    }\n    try {\n      return String(value)\n    } catch {\n      dropped.push(className)\n      return `<${className}>`\n    }\n  }\n\n  if (seen.has(value as object)) {\n    dropped.push(className)\n    return `<cycle ${className}>`\n  }\n  seen.add(value as object)\n\n  let result: unknown\n  if (Array.isArray(value)) {\n    result = value.map((item) =>\n      toJsonSafeInner(item, depth + 1, seen, dropped),\n    )\n  } else if (typeof (value as Record<string, unknown>).toJSON === \"function\") {\n    // Recurse toJSON() output: it can still hold non-serializable values (e.g.\n    // a LangChain tool whose schema is a class) that would otherwise survive\n    // into the span payload and crash the wire-side JSON.stringify.\n    try {\n      result = toJsonSafeInner(\n        (value as { toJSON(): unknown }).toJSON(),\n        depth + 1,\n        seen,\n        dropped,\n      )\n    } catch {\n      dropped.push(className)\n      result = `<${className}>`\n    }\n  } else {\n    try {\n      const obj: Record<string, unknown> = {}\n      for (const [k, v] of Object.entries(value)) {\n        if (!k.startsWith(\"_\")) {\n          obj[k] = toJsonSafeInner(v, depth + 1, seen, dropped)\n        }\n      }\n      result = obj\n    } catch {\n      dropped.push(className)\n      result = `<${className}>`\n    }\n  }\n\n  // Backtrack: keep only ancestors on the current path in `seen`, so a shared\n  // (DAG) reference under sibling keys is serialized again rather than stubbed\n  // as a false cycle. Real cycles (an ancestor referencing itself) are still\n  // caught above.\n  seen.delete(value as object)\n  return result\n}\n","/**\n * Replay historical traces through a function and create a test run.\n *\n * The replay flow has three phases:\n * 1. Start: fetches historical traces from the server and creates a test run\n * 2. Execute: re-runs each trace's inputs through the provided function locally\n * 3. Complete: marks the test run as completed on the server\n */\n\nimport { resolveAutoCodeChange } from \"./codeChange.js\"\nimport type { DbSnapshotRef } from \"./dbSnapshot.js\"\nimport { BitfabError } from \"./errors.js\"\nimport type {\n  CodeChangeFile,\n  HttpClient,\n  SpanTreeNode,\n  TokenUsage,\n} from \"./http.js\"\nimport type { MockOverride } from \"./mockOverride.js\"\nimport { normalizeMockOverrides } from \"./mockOverride.js\"\nimport { randomUuid } from \"./randomUuid.js\"\nimport type {\n  DbBranchLease,\n  DbBranchSettings,\n  MockSpan,\n  MockTree,\n} from \"./replayContext.js\"\nimport { replayContextReady, runWithReplayContext } from \"./replayContext.js\"\nimport { deserializeValue } from \"./serialize.js\"\n\nexport type MockStrategy = \"none\" | \"all\" | \"marked\"\n\n/**\n * How the DB-snapshot branch each replay item runs against is sized and warmed.\n *\n * Every field is optional, so this object is only worth passing when you want\n * to override the mirror project's own sizing. To branch with those defaults,\n * pass `dbBranch: true` instead of an empty object.\n */\nexport interface DbBranchOptions {\n  /**\n   * Autoscaling floor for the branch's compute, in Neon Compute Units (0.25 to\n   * 56). Omit to keep the mirror project's own default. Raise it when the\n   * mirror is provisioned smaller than the database it stands in for, so\n   * replay latency reflects your code rather than a cold, undersized branch.\n   */\n  minCu?: number\n  /**\n   * Autoscaling ceiling for the branch's compute, in Neon Compute Units.\n   * Setting it equal to `minCu` pins the size, which keeps items comparable:\n   * otherwise a later item can run against an endpoint that has already\n   * scaled up and post a better number for the same code.\n   */\n  maxCu?: number\n  /**\n   * SQL that warms the branch's cache. The server appends it to the branch's\n   * readiness check, so it runs BEFORE your function sees the branch and its\n   * time is not charged to the replayed call. Invalid SQL fails the branch\n   * rather than silently leaving it cold.\n   */\n  warmupSql?: string\n}\n\n/**\n * Whether the caller asked for database branching. `true` and a settings object\n * both turn it on; `false` and omission leave it off. Kept separate from\n * `resolveDbBranchSettings` because `dbBranch: true` enables branching while\n * contributing no settings, so presence of settings can't stand in for the\n * switch.\n */\nfunction dbBranchEnabled(\n  dbBranch: DbBranchOptions | boolean | undefined,\n): boolean {\n  return dbBranch !== undefined && dbBranch !== false\n}\n\n/**\n * Narrow the caller's branch options to the wire shape, dropping the object\n * entirely when nothing was set so the request stays byte-identical to what\n * older SDKs send. Booleans carry no settings: they only move the switch.\n */\nfunction resolveDbBranchSettings(\n  dbBranch: DbBranchOptions | boolean | undefined,\n): DbBranchSettings | undefined {\n  if (!dbBranch || dbBranch === true) {\n    return undefined\n  }\n  const { minCu, maxCu, warmupSql } = dbBranch\n  const settings: DbBranchSettings = {\n    ...(minCu === undefined ? {} : { minCu }),\n    ...(maxCu === undefined ? {} : { maxCu }),\n    ...(warmupSql === undefined ? {} : { warmupSql }),\n  }\n  return Object.keys(settings).length === 0 ? undefined : settings\n}\n\nexport interface ReplayOptions {\n  /**\n   * Maximum number of traces to replay (1-100, default 5). Ignored when\n   * `traceIds` is passed (with a warning): an explicit ID list already\n   * determines how many traces replay.\n   */\n  limit?: number\n  /** Optional list of specific trace IDs to replay (max 100). */\n  traceIds?: string[]\n  /** Optional display name for the resulting experiment/test run. */\n  name?: string\n  /** Maximum number of items to process in parallel. Set to 1 for sequential. Default 10. */\n  maxConcurrency?: number\n  /**\n   * Description of the code change being tested in this replay. Stored on\n   * the resulting experiment so the change can be reviewed alongside results.\n   * Supplying a description without `codeChangeFiles` preserves this text\n   * while the SDK automatically captures the files.\n   * Pass `null` when the replay should have no description; use\n   * `codeChangeFiles: null` to suppress automatic file capture.\n   */\n  codeChangeDescription?: string | null\n  /**\n   * Files edited as part of this code change. Each entry holds the file path\n   * and the full `before`/`after` contents. The agent reads each file before\n   * and after editing and passes the two strings. Use `\"\"` for newly created\n   * files (`before`) or deleted files (`after`). Omit this field to capture\n   * automatically, or pass `null` to suppress file capture for this replay.\n   */\n  codeChangeFiles?: CodeChangeFile[] | null\n  /**\n   * Mock strategy for child spans during replay.\n   * - \"marked\": only spans tagged with { mockOnReplay: true } in SpanOptions are mocked (default)\n   * - \"none\": everything runs real code\n   * - \"all\": every child withSpan returns historical output\n   */\n  mock?: MockStrategy\n  /**\n   * Selective mock overrides: inject custom values into specific spans during\n   * replay, so downstream real code runs against the substituted output. Each\n   * override is a `{ match, value }` pair; the first matcher that\n   * matches a span wins. These take precedence over any overrides registered on\n   * the client via `registerMockOverride`, and over the base `mock` strategy - a\n   * span no override matches falls back to that strategy. See {@link MockOverride}.\n   */\n  mockOverride?: MockOverride | MockOverride[]\n  /**\n   * Run each item against a database branch restored to the state its source\n   * trace saw. Pass `true` to branch with the mirror project's own sizing, or a\n   * {@link DbBranchOptions} object to tune how each branch is sized and warmed.\n   * `false` and omission leave branching off. Inside `fn`, read the resolved\n   * branch with `getCurrentReplayBranch()`.\n   *\n   * Items whose source trace carried no DB snapshot reference get no branch and\n   * run against the live database. An item whose branch was requested but could\n   * not be resolved fails instead of running, so a replay never silently\n   * reports a result that did not use the historical data you asked for.\n   */\n  dbBranch?: DbBranchOptions | boolean\n  /** Group ID to associate this replay with an experiment group for live streaming in Studio. */\n  experimentGroupId?: string\n  /**\n   * Dataset this replay runs against. When set, the resulting experiment is\n   * durably attributed to the dataset (stored on the test run), so it appears\n   * under the dataset's experiments even if the trace lineage can't be\n   * reconstructed. Validated server-side against the org.\n   */\n  datasetId?: string\n  /**\n   * Graders to attach directly to this experiment (test run), independent of any\n   * graders already on the dataset. The resulting experiment is graded by the\n   * union of these and the dataset's runnable graders at completion, so use this\n   * to grade a single run with a check you don't want to add to the dataset\n   * permanently. Each id must be an active/live grader belonging to the same\n   * organization and trace function, otherwise the server rejects the replay.\n   */\n  graderIds?: string[]\n  /**\n   * Reshape recorded inputs before they are spread into `fn`.\n   *\n   * Replay pulls each trace's inputs exactly as they were captured against the\n   * function's signature AT TRACE TIME. When the function's shape has since\n   * changed (params renamed, reordered, collapsed into an options object, etc.),\n   * the recorded inputs no longer line up and `fn(...inputs)` throws. This hook\n   * lets a caller map the recorded inputs onto the current signature so replay\n   * can still run.\n   *\n   * Receives the deserialized recorded inputs and a per-trace {@link AdaptContext}\n   * (so a table-driven adapter can look up the adapted inputs by `traceId`), and\n   * returns the array actually spread into `fn`. The returned array is also what\n   * `ReplayItem.input` reports, so the experiment shows what was really run.\n   *\n   * Runs per item, inside the same try/catch as `fn`: if the adapter throws, the\n   * failure is surfaced on that item's `error` rather than crashing the run.\n   * Omit it to spread the recorded inputs unchanged.\n   */\n  adaptInputs?: (inputs: unknown[], ctx: AdaptContext) => unknown[]\n  /**\n   * Called once per item as it finishes, in completion order (not input\n   * order), with running totals for the whole run. Use it to render replay\n   * progress, for example a terminal progress bar. Replay does not know\n   * pass/fail at this point (verdicts are assigned later), so the totals only\n   * distinguish items whose function ran (`succeeded`) from items that threw\n   * (`errored`).\n   *\n   * Invoked synchronously right after each item settles, so keep it cheap. A\n   * throwing callback never crashes the run: the error is swallowed so progress\n   * UI can't break replay.\n   */\n  onProgress?: (progress: ReplayProgress) => void\n}\n\n/** Running totals reported to {@link ReplayOptions.onProgress} as replay proceeds. */\nexport interface ReplayProgress {\n  /**\n   * Event kind. Omitted (or `\"item\"`) for the per-trace settle events streamed\n   * during the run. `\"complete\"` marks the single terminal event emitted once\n   * the run has settled and been enriched server-side; it carries the full\n   * {@link ReplayProgress.result} and has no `item`. The Bitfab plugin reads\n   * that terminal event to build the run's final result without parsing stdout.\n   */\n  type?: \"item\" | \"complete\"\n  /**\n   * The full {@link ReplayResult}, present only on the terminal `\"complete\"`\n   * event. Lets the plugin ingest the enriched result (server-aggregated tokens,\n   * server trace ids) over the same channel as progress, so a dependency logging\n   * to stdout can never block it.\n   */\n  result?: ReplayResult<unknown>\n  /** Test run ID created for this replay. */\n  testRunId?: string\n  /** Items that have finished so far, whether they succeeded or errored. */\n  completed: number\n  /** Total number of items in this replay run. */\n  total: number\n  /** Of the completed items, how many ran the function without throwing. */\n  succeeded: number\n  /** Of the completed items, how many threw (their `item.error` is set). */\n  errored: number\n  /**\n   * The single item that just settled to produce this event. `traceId` is null\n   * at this stage (the server replay id isn't known until the run completes);\n   * `originalTraceId` is the original (historical) trace that was replayed (so\n   * a UI can identify or link it); `error` is its replay error, or null when it\n   * ran ok; `durationMs` is how long this one trace took to replay. Lets a\n   * progress UI show per-trace pass/fail and timing as the run streams, without\n   * waiting for the full {@link ReplayResult}.\n   */\n  item?: {\n    /** Trace ID of the new replay trace (null during the run; the server id arrives at completion). */\n    traceId?: string | null\n    /** Bitfab trace ID of the original (historical) trace being replayed. */\n    originalTraceId: string | null\n    /** External span ID the recorded inputs were read from (the original root span). */\n    originalSpanId?: string | null\n    /** @deprecated alias for `originalTraceId`. */\n    sourceTraceId: string | null\n    /** @deprecated alias for `originalSpanId`. */\n    sourceSpanId?: string | null\n    /** Deserialized inputs from the original trace. */\n    input?: unknown[]\n    /** The result returned by the replayed function, or undefined on error. */\n    result?: unknown\n    /** The original output from the historical trace. */\n    originalOutput?: unknown\n    error: string | null\n    durationMs: number | null\n    tokens?: TokenUsage | null\n    model?: string | null\n    dbSnapshotRef?: DbSnapshotRef | null\n  }\n}\n\n/**\n * Wire prefix the Bitfab plugin scans for. Each line {@link reportReplayProgress}\n * writes is this prefix followed by the JSON of the running totals (plus the\n * settled `item`). The plugin polls these lines to report live progress while a\n * replay runs in the background; keep the SDK emitter and the plugin parser in\n * sync.\n */\nexport const BITFAB_PROGRESS_PREFIX = \"@@bitfab:progress \"\n\n/**\n * A ready-made {@link ReplayOptions.onProgress} callback for replay scripts.\n * Pass it straight in:\n *\n * ```ts\n * await bitfab.replay(\"my-fn\", fn, { limit, onProgress: reportReplayProgress })\n * ```\n *\n * It writes one `@@bitfab:progress` line per trace to stderr, which the Bitfab\n * plugin polls to report live progress while the replay runs in the background,\n * so scripts never hand-format the wire protocol.\n * stdout is left untouched for direct-run ReplayResult JSON. Outside Node (no\n * `process.stderr`, e.g. a browser) it is a no-op, and a write failure is\n * swallowed so progress can never crash a run.\n */\nexport function reportReplayProgress(progress: ReplayProgress): void {\n  const stderr = typeof process !== \"undefined\" ? process.stderr : undefined\n  if (!stderr) {\n    return\n  }\n  try {\n    stderr.write(`${BITFAB_PROGRESS_PREFIX}${JSON.stringify(progress)}\\n`)\n  } catch {\n    // A progress reporter must never crash the replay run.\n  }\n}\n\n/** Per-trace context passed to {@link ReplayOptions.adaptInputs}. */\nexport interface AdaptContext {\n  /** Bitfab trace ID of the original (historical) trace being replayed. */\n  originalTraceId: string\n  /** External span ID the recorded inputs were read from. */\n  originalSpanId: string\n  /** @deprecated alias for {@link AdaptContext.originalTraceId}. */\n  sourceTraceId: string\n  /** @deprecated alias for {@link AdaptContext.originalSpanId}. */\n  sourceSpanId: string\n}\n\n/**\n * The shape an adapter module must export as `adaptInputs`.\n *\n * Author an adapter in its own file (e.g. `scripts/replay-adapters/<name>.ts`),\n * import it in your replay script, and pass it to `replay({ adaptInputs })`:\n *\n * ```ts\n * import type { AdaptInputsFn } from \"@bitfab/sdk\"\n * export const adaptInputs: AdaptInputsFn = (inputs, ctx) => [reshape(inputs)]\n * ```\n */\nexport type AdaptInputsFn = (inputs: unknown[], ctx: AdaptContext) => unknown[]\n\nexport interface ReplayItem<T> {\n  /**\n   * Server trace ID of the new replay trace this item produced. Written in by\n   * `replay()` from the complete-replay response once the server has minted the\n   * trace row; the client-side id used to correlate spans during the run is\n   * never surfaced here. Null until completion, on older servers that omit the\n   * mapping, or if the item produced no trace. Not the verdict-persistence key:\n   * that is the original-trace lineage (`originalTraceId` + `testRunId`).\n   */\n  traceId: string | null\n  /** Bitfab trace ID of the original (historical) trace being replayed. */\n  originalTraceId: string\n  /** External span ID the recorded inputs were read from (the original root span). */\n  originalSpanId: string\n  /** @deprecated alias for {@link ReplayItem.originalTraceId}. */\n  sourceTraceId: string\n  /** @deprecated alias for {@link ReplayItem.originalSpanId}. */\n  sourceSpanId: string\n  /** Deserialized inputs from the original trace. */\n  input: unknown[]\n  /** The result returned by the function during replay, or undefined on error. */\n  result: T | undefined\n  /** The original output from the historical trace. */\n  originalOutput: unknown\n  /** Error message if the function threw, or null on success. */\n  error: string | null\n  /** Original trace duration in milliseconds, or null if timestamps are missing. */\n  durationMs: number | null\n  /**\n   * Token usage from the REPLAYED run (this item's new execution), aggregated\n   * server-side from the spans it produced, or null if the run captured no\n   * token data. This is the \"new\" side of a token delta: compare it against\n   * the original trace's recorded usage to see how the code change moved cost.\n   * Matches what Studio's experiments view shows.\n   */\n  tokens: TokenUsage | null\n  /** Model name from the original trace, or null if not captured. */\n  model: string | null\n  /**\n   * The DB snapshot ref the SDK captured at trace open. Useful for debugging\n   * (\"what state was this trace pinned to?\") and for customers building\n   * their own resolvers. Undefined when the source trace was captured\n   * without `dbSnapshot` configured.\n   */\n  dbSnapshotRef: DbSnapshotRef | null\n}\n\nexport type { CodeChangeFile, TokenUsage }\n\nexport interface ReplayResult<T> {\n  /** Individual replay items with inputs, results, and comparison data. */\n  items: ReplayItem<T>[]\n  /** The test run ID created on the server. */\n  testRunId: string\n  /** Full URL to view the test run in the dashboard. */\n  testRunUrl: string\n}\n\n/**\n * Deserialize inputs from a historical span's rawData.\n *\n * Prefers superjson-serialized `input_meta` for type preservation,\n * falls back to the raw `input` field.\n */\nfunction deserializeInputs(spanData: Record<string, unknown>): unknown[] {\n  const inputMeta = spanData.input_meta as unknown\n  const rawInput = spanData.input\n\n  // If superjson meta is available, deserialize with type reconstruction\n  if (inputMeta !== undefined && inputMeta !== null) {\n    const deserialized = deserializeValue({ json: rawInput, meta: inputMeta })\n    if (Array.isArray(deserialized)) {\n      return deserialized\n    }\n    return deserialized !== undefined && deserialized !== null\n      ? [deserialized]\n      : []\n  }\n\n  // Fall back to raw input\n  if (Array.isArray(rawInput)) {\n    return rawInput\n  }\n  return rawInput !== undefined && rawInput !== null ? [rawInput] : []\n}\n\n/**\n * Deserialize the original output from a historical span's rawData.\n */\nfunction deserializeOutput(spanData: Record<string, unknown>): unknown {\n  const outputMeta = spanData.output_meta as unknown\n  const rawOutput = spanData.output\n\n  if (outputMeta !== undefined && outputMeta !== null) {\n    return deserializeValue({ json: rawOutput, meta: outputMeta })\n  }\n\n  return rawOutput\n}\n\n/**\n * Walk the children of a root span tree node in depth-first order and build\n * a MockTree keyed by `${traceFunctionKey}:${spanName}:${callIndex}`.\n *\n * The historical root itself is NOT walked. At replay time the runtime root\n * span has `isRootSpan === true` and never queries the mockTree (mock\n * interception is skipped for root spans by design), so the root has nothing\n * to look up. Walking it would just leave an unreachable entry in the table.\n *\n * The (key, name) compound match is what disambiguates same-key spans:\n *   - A wrapped function's children commonly share its traceFunctionKey via\n *     the fluent `getFunction(key).withSpan({ name }, ...)` pattern. They\n *     disambiguate by `name`, never colliding with each other.\n *   - Recursion: same (key, name) at every depth. callIndex per (key, name)\n *     orders them correctly without leaking the historical root into the\n *     nested call's slot.\n *   - Outer-wrapper replay scripts: the outer wrapper's `name` is distinct\n *     from anything in the historical tree (it only exists at replay), so\n *     its presence never disturbs counters or lookups for spans that do\n *     exist in the historical tree.\n */\nfunction buildMockTree(rootNode: SpanTreeNode): MockTree {\n  const spans = new Map<string, MockSpan>()\n  const counters = new Map<string, number>()\n\n  function walk(node: SpanTreeNode): void {\n    const key = node.traceFunctionKey\n    if (key) {\n      const name = node.spanName || key\n      const counterKey = `${key}:${name}`\n      const index = counters.get(counterKey) ?? 0\n      counters.set(counterKey, index + 1)\n      // `output`/`outputMeta` are undefined on a payload-free (lazy) tree;\n      // `externalSpanId` is what the lazy path fetches them by. Both are copied\n      // verbatim so eager and lazy trees build through the same walk.\n      spans.set(`${counterKey}:${index}`, {\n        sourceSpanId: node.sourceSpanId,\n        externalSpanId: node.externalSpanId,\n        output: node.output,\n        outputMeta: node.outputMeta,\n      })\n    }\n    for (const child of node.children) {\n      walk(child)\n    }\n  }\n\n  for (const child of rootNode.children) {\n    walk(child)\n  }\n\n  return { spans }\n}\n\n/**\n * Execute a single replay item: fetch span data, deserialize inputs, call\n * the function within a replay context that injects testRunId into new spans.\n */\nasync function processItem<TReturn>(\n  httpClient: HttpClient,\n  serverItem: {\n    originalTraceId?: string\n    originalSpanId?: string\n    /** @deprecated alias emitted by servers that predate the originalTraceId rename. */\n    sourceTraceId: string\n    /** @deprecated alias emitted by servers that predate the originalSpanId rename. */\n    sourceSpanId: string\n    durationMs: number | null\n    model: string | null\n    dbSnapshotRef?: DbSnapshotRef\n    dbBranchLease?: DbBranchLease\n    dbBranchLeaseError?: { code: string; message: string }\n  },\n  // biome-ignore lint/suspicious/noExplicitAny: replay deserializes inputs from historical data\n  fn: (...args: any[]) => TReturn | Promise<TReturn>,\n  testRunId: string,\n  mockStrategy: MockStrategy,\n  resolvedOverrides: MockOverride[],\n  replayedTraceId: string,\n  includeDbBranchLease: boolean,\n  dbBranchSettings: DbBranchSettings | undefined,\n  adaptInputs:\n    | ((inputs: unknown[], ctx: AdaptContext) => unknown[])\n    | undefined,\n): Promise<ReplayItem<TReturn>> {\n  // The server-side resolver materializes a Neon preview branch per item\n  // during `/api/sdk/replay/start` (when the customer passed `dbBranch`,\n  // which triggers `includeDbBranchLease: true`). The lease arrives on the\n  // server item; we just attach it to the replay context and release the\n  // branch in `finally` so any throw (in fetch, mock-tree build, or the\n  // customer fn) frees the Neon resource. Items whose source trace had no\n  // snapshot ref arrive without a lease; `getCurrentReplayBranch()` returns\n  // null for those, and replaying against the live database is correct.\n  let lease = includeDbBranchLease ? serverItem.dbBranchLease : undefined\n  // A resolve that was attempted and FAILED is different: the caller asked for\n  // a branch, so running their function against live data would produce a\n  // result that looks valid and isn't. Fail this item instead, loudly.\n  let leaseError = includeDbBranchLease\n    ? serverItem.dbBranchLeaseError\n    : undefined\n  let dbSnapshotRef = serverItem.dbSnapshotRef\n\n  let inputs: unknown[] = []\n  let originalOutput: unknown\n  let result: TReturn | undefined\n  let error: string | null = null\n  // Collects the root span's full persistence chain (span uploads + trace\n  // completion). Awaited below so this item's trace is on the server before\n  // replay() calls completeReplay. Otherwise the server's trace-ID mapping\n  // races the uploads and item.traceId nulls out.\n  const pendingPersistence: Promise<unknown>[] = []\n\n  // The ORIGINAL (historical) trace/span this item replays. Canonical server\n  // keys are originalTraceId/originalSpanId; older servers only send the\n  // deprecated sourceTraceId/sourceSpanId aliases.\n  const originalTraceId = serverItem.originalTraceId ?? serverItem.sourceTraceId\n  const originalSpanId = serverItem.originalSpanId ?? serverItem.sourceSpanId\n\n  try {\n    if (includeDbBranchLease && !lease && !leaseError) {\n      const resolved = await httpClient.resolveDbBranchLease(\n        testRunId,\n        originalTraceId,\n        dbBranchSettings,\n      )\n      lease = resolved.lease ?? undefined\n      leaseError = resolved.leaseError ?? undefined\n      dbSnapshotRef = resolved.dbSnapshotRef ?? dbSnapshotRef\n    }\n\n    if (leaseError) {\n      throw new BitfabError(\n        `Replay requested a database branch for trace ${originalTraceId} but it could not be resolved (${leaseError.code}): ${leaseError.message}. The function was not run, because replaying it against the live database would produce a result that looks valid but did not use the historical data you asked for.`,\n      )\n    }\n\n    const span = await httpClient.getExternalSpan(originalSpanId)\n    const spanData = (span.rawData?.span_data ?? {}) as Record<string, unknown>\n\n    inputs = deserializeInputs(spanData)\n    originalOutput = deserializeOutput(spanData)\n\n    // Reshape the recorded inputs onto the current signature when an adapter\n    // is supplied. Runs before the mock tree / fn call so the adapted array is\n    // what fn receives and what `item.input` reports.\n    if (adaptInputs) {\n      inputs = adaptInputs(inputs, {\n        originalTraceId,\n        originalSpanId,\n        // Deprecated aliases for originalTraceId/originalSpanId.\n        sourceTraceId: originalTraceId,\n        sourceSpanId: originalSpanId,\n      })\n    }\n\n    // Build the mock tree whenever mocking could apply: any non-\"none\" strategy,\n    // OR overrides are present (overrides substitute even under \"none\" - the\n    // \"run real code but replace node X\" case). Only \"all\" needs outputs inline;\n    // \"marked\"/overrides fetch a payload-free tree and pull outputs lazily so we\n    // never drag down every span's recorded output when only a few get mocked.\n    const hasOverrides = resolvedOverrides.length > 0\n    const needTree =\n      mockStrategy === \"all\" || mockStrategy === \"marked\" || hasOverrides\n    const includeOutputs = mockStrategy === \"all\"\n\n    let mockTree: MockTree | undefined\n    if (needTree) {\n      try {\n        const treeResponse = await httpClient.getSpanTree(originalSpanId, {\n          includeOutputs,\n        })\n        if (treeResponse.root) {\n          mockTree = buildMockTree(treeResponse.root)\n        } else if (mockStrategy === \"all\" || hasOverrides) {\n          throw new BitfabError(\n            `Replay mock strategy \"${mockStrategy}\"${hasOverrides ? \" with overrides\" : \"\"} requires a span tree root for original span ${originalSpanId}.`,\n          )\n        } else {\n          mockTree = undefined\n        }\n      } catch (e) {\n        // \"all\" and overrides both depend on the tree (\"all\" mocks every span\n        // from it; overrides gate on its call-counter machinery), so a fetch\n        // failure surfaces on the item rather than silently running real with\n        // the overrides dropped. Bare \"marked\" degrades to no mocking (its\n        // marked spans just re-run). Mirrors the Python/Ruby SDKs.\n        if (mockStrategy === \"all\" || hasOverrides) {\n          throw e\n        }\n        mockTree = undefined\n      }\n    }\n\n    // Lazy per-span output fetch, memoized per item so a span read twice (once\n    // as a marked mock, once via an override's getOriginalOutput) fetches once.\n    // Present only when outputs were NOT fetched inline (not the eager \"all\"\n    // path); its presence signals the mock path to fetch on demand.\n    const outputCache = new Map<string, Promise<unknown>>()\n    const fetchSpanOutput =\n      mockTree && !includeOutputs\n        ? (externalSpanId: string): Promise<unknown> => {\n            let pending = outputCache.get(externalSpanId)\n            if (!pending) {\n              pending = httpClient\n                .getExternalSpan(externalSpanId)\n                .then((s) =>\n                  deserializeOutput(\n                    (s.rawData?.span_data ?? {}) as Record<string, unknown>,\n                  ),\n                )\n              outputCache.set(externalSpanId, pending)\n            }\n            return pending\n          }\n        : undefined\n\n    const maybePromise = runWithReplayContext(\n      {\n        testRunId,\n        traceId: replayedTraceId,\n        inputSourceSpanId: span.id,\n        inputSourceTraceId: span.externalTraceId,\n        sourceBitfabTraceId: originalTraceId,\n        mockTree,\n        callCounters: mockTree ? new Map() : undefined,\n        mockStrategy,\n        mockOverrides: hasOverrides ? resolvedOverrides : undefined,\n        fetchSpanOutput,\n        dbBranchLease: lease,\n        pendingPersistence,\n      },\n      () => fn(...inputs),\n    )\n    result = maybePromise instanceof Promise ? await maybePromise : maybePromise\n  } catch (e) {\n    error = e instanceof Error ? e.message : String(e)\n  } finally {\n    // Wait for this item's trace (spans + completion) to be fully persisted\n    // before the item resolves. Runs on the error path too. A throwing fn\n    // still emits a root span whose trace must land before completeReplay.\n    await Promise.allSettled(pendingPersistence)\n    if (lease) {\n      try {\n        await httpClient.releaseDbBranchLease(lease.neonBranchId)\n      } catch (e) {\n        try {\n          console.warn(\n            `Bitfab: failed to release DB branch ${lease.neonBranchId} (TTL janitor will catch it): ${\n              e instanceof Error ? e.message : String(e)\n            }`,\n          )\n        } catch {\n          // Never crash the host\n        }\n      }\n    }\n  }\n\n  return {\n    // Written in by replay() from the complete-replay response once the server\n    // has minted this replay trace's row. Null until then: the client-side\n    // correlation id (replayedTraceId) is never surfaced as the item's traceId.\n    traceId: null,\n    originalTraceId,\n    originalSpanId,\n    // Deprecated aliases for originalTraceId/originalSpanId.\n    sourceTraceId: originalTraceId,\n    sourceSpanId: originalSpanId,\n    input: inputs,\n    result,\n    originalOutput,\n    error,\n    durationMs: serverItem.durationMs ?? null,\n    // Filled in by replay() from the complete-replay response once the\n    // replay traces are persisted and their spans aggregated server-side.\n    // Null here (and on older servers) means \"replay tokens not known\".\n    tokens: null,\n    model: serverItem.model ?? null,\n    dbSnapshotRef: dbSnapshotRef ?? null,\n  }\n}\n\n/**\n * Run async tasks with a concurrency limit.\n * Each task factory is called when a slot opens; results preserve input order.\n */\nasync function mapWithConcurrency<T>(\n  tasks: Array<() => Promise<T>>,\n  maxConcurrency: number,\n  onSettled?: (result: T, index: number) => void,\n): Promise<T[]> {\n  const results: T[] = new Array(tasks.length)\n  let nextIndex = 0\n\n  async function worker(): Promise<void> {\n    while (nextIndex < tasks.length) {\n      const index = nextIndex++\n      const result = await tasks[index]()\n      results[index] = result\n      onSettled?.(result, index)\n    }\n  }\n\n  const workers = Array.from(\n    { length: Math.min(maxConcurrency, tasks.length) },\n    () => worker(),\n  )\n  await Promise.all(workers)\n  return results\n}\n\n/**\n * Replay historical traces through a function and create a test run.\n *\n * @internal Called by Bitfab.replay, not part of the public API.\n */\nexport async function replay<TReturn>(\n  httpClient: HttpClient,\n  serviceUrl: string,\n  traceFunctionKey: string,\n  // biome-ignore lint/suspicious/noExplicitAny: replay deserializes inputs from historical data\n  fn: (...args: any[]) => TReturn | Promise<TReturn>,\n  options?: ReplayOptions,\n  registeredOverrides: MockOverride[] = [],\n): Promise<ReplayResult<TReturn>> {\n  if (options?.traceIds !== undefined) {\n    if (options.traceIds.length === 0) {\n      throw new BitfabError(\"traceIds must contain at least one trace ID.\")\n    }\n    if (options.traceIds.length > 100) {\n      throw new BitfabError(\n        `traceIds supports at most 100 trace IDs per replay (got ${options.traceIds.length}).`,\n      )\n    }\n  }\n  if (options?.limit !== undefined && options?.traceIds !== undefined) {\n    try {\n      console.warn(\n        \"Bitfab: limit is ignored when traceIds is passed: the explicit trace ID list already determines how many traces replay.\",\n      )\n    } catch {\n      // Never crash the host app\n    }\n  }\n\n  await replayContextReady\n\n  // Resolve the code change to attach to this experiment. codeChangeFiles is\n  // the capture control: omitted auto-captures, an array wins, and null opts\n  // out. A caller-supplied description is preserved when files are captured.\n  let codeChangeDescription = options?.codeChangeDescription\n  let codeChangeFiles = options?.codeChangeFiles\n  if (codeChangeFiles === undefined) {\n    const captured = await resolveAutoCodeChange(options?.name)\n    if (captured) {\n      codeChangeFiles = captured.files\n      if (codeChangeDescription === undefined) {\n        codeChangeDescription = captured.description\n      }\n    }\n  }\n\n  const {\n    testRunId,\n    testRunUrl,\n    items: serverItems,\n  } = await httpClient.startReplay(\n    traceFunctionKey,\n    // limit is meaningless with explicit traceIds (the ID list determines\n    // the count), so it's omitted from the request entirely.\n    options?.traceIds ? undefined : (options?.limit ?? 5),\n    options?.traceIds,\n    options?.name,\n    codeChangeDescription,\n    codeChangeFiles,\n    dbBranchEnabled(options?.dbBranch), // includeDbBranchLease\n    options?.experimentGroupId,\n    options?.datasetId,\n    options?.graderIds,\n    resolveDbBranchSettings(options?.dbBranch),\n  )\n\n  const mockStrategy: MockStrategy = options?.mock ?? \"marked\"\n  const maxConcurrency = options?.maxConcurrency ?? 10\n\n  // Per-call overrides take precedence over registered ones: concatenating them\n  // first means the first-match-wins scan hits per-call overrides before the\n  // client-registered chain, and both before the base mock strategy.\n  const resolvedOverrides = [\n    ...normalizeMockOverrides(options?.mockOverride),\n    ...registeredOverrides,\n  ]\n\n  // One client-side replay trace id per item. It tags that item's replay spans\n  // during the run so the server can echo back the row id it minted for them\n  // (resolved in the complete-replay mapping below). Kept out of the public\n  // ReplayItem: it's a correlation handle, never an id callers use.\n  const replayedTraceIds = serverItems.map(() => randomUuid())\n  const tasks = serverItems.map(\n    (serverItem, index) => () =>\n      processItem(\n        httpClient,\n        serverItem,\n        fn,\n        testRunId,\n        mockStrategy,\n        resolvedOverrides,\n        replayedTraceIds[index],\n        dbBranchEnabled(options?.dbBranch),\n        resolveDbBranchSettings(options?.dbBranch),\n        options?.adaptInputs,\n      ),\n  )\n  const total = tasks.length\n  let completed = 0\n  let succeeded = 0\n  let errored = 0\n  const resultItems = await mapWithConcurrency(\n    tasks,\n    maxConcurrency,\n    options?.onProgress\n      ? (item) => {\n          completed += 1\n          if (item.error === null) {\n            succeeded += 1\n          } else {\n            errored += 1\n          }\n          try {\n            options?.onProgress?.({\n              testRunId,\n              completed,\n              total,\n              succeeded,\n              errored,\n              item: {\n                // The server replay trace id isn't known until completeReplay\n                // runs (below), so it can't be reported mid-run and we never\n                // emit the client-side placeholder. originalTraceId (the\n                // historical trace) is known now and is what a UI keys on to\n                // identify what just settled.\n                traceId: null,\n                originalTraceId: item.originalTraceId ?? null,\n                originalSpanId: item.originalSpanId ?? null,\n                // Deprecated aliases for originalTraceId/originalSpanId.\n                sourceTraceId: item.originalTraceId ?? null,\n                sourceSpanId: item.originalSpanId ?? null,\n                input: item.input,\n                result: item.result,\n                originalOutput: item.originalOutput,\n                error: item.error,\n                durationMs: item.durationMs,\n                tokens: item.tokens,\n                model: item.model,\n                dbSnapshotRef: item.dbSnapshotRef,\n              },\n            })\n          } catch {\n            // Progress UI must never crash the replay run.\n          }\n        }\n      : undefined,\n  )\n\n  // Every item awaited its own trace persistence (spans + completion) in\n  // processItem, so all replay traces are on the server by now. No flush\n  // needed. completeReplay finalizes the test run and returns the token/\n  // diagnostic mapping; its failures propagate loudly because a run that never\n  // completed can't be finalized and callers must hear about it.\n  const completeResult = await httpClient.completeReplay(testRunId)\n  const serverTraceIds = completeResult.traceIds\n  // Per-replay-trace token usage, keyed by server trace id. The REPLAYED run's\n  // tokens (span-aggregated server-side), used below to fill each item.tokens.\n  const replayTokens = completeResult.tokens\n\n  // `serverTraceIds` maps each item's client-side replay trace id (its entry in\n  // `replayedTraceIds`, which tagged that item's spans during the run) to the\n  // server's trace row id. We use it to (a) write the real server replay trace\n  // id into `item.traceId` now that the row exists, (b) attach each item's\n  // server-aggregated token usage, and (c) detect a systemic upload failure\n  // early. Verdict persistence does NOT use this map: it is keyed by the\n  // original-trace lineage (`originalTraceId` + `testRunId`), which needs no\n  // client-held server id. Older servers that omit the map yield no replay\n  // tokens and leave `item.traceId` null.\n  if (serverTraceIds !== undefined) {\n    const missing: string[] = []\n    let completedCount = 0\n    for (let index = 0; index < resultItems.length; index += 1) {\n      const item = resultItems[index]\n      const localId = replayedTraceIds[index]\n      const mapped = localId ? serverTraceIds[localId] : undefined\n      // Write the real server replay trace id in as it comes back; the item\n      // held null until now (the client placeholder is never surfaced).\n      item.traceId = mapped ?? null\n      if (item.error === null) {\n        completedCount += 1\n        if (mapped === undefined) {\n          missing.push(localId ?? item.originalTraceId)\n        }\n      }\n      if (mapped !== undefined) {\n        item.tokens = replayTokens?.[mapped] ?? null\n      }\n    }\n    // ALL completed items missing → systemic (the replayed function isn't\n    // wrapped with withSpan, or uploads are wholesale broken). Throw; the run's\n    // traces never persisted, so nothing can be labeled and silence here is the\n    // exact bug this guarantee exists to prevent.\n    if (completedCount > 0 && missing.length === completedCount) {\n      const serverCount =\n        completeResult.traceCount !== undefined\n          ? ` The server persisted ${completeResult.traceCount} trace(s) for this run.`\n          : \"\"\n      throw new BitfabError(\n        `Replay completed but the server has no persisted trace for any of the ${completedCount} completed item(s) (testRunId ${testRunId}).${serverCount} ` +\n          `Trace uploads were awaited, so either the uploads failed (check for \"Bitfab: Failed to create\" errors above) or the replayed function is not wrapped with withSpan.`,\n      )\n    }\n    // SOME completed items missing → per-item upload failure (transient blip,\n    // one oversized payload). Log it, but return the run; the items that landed\n    // can still be labeled via their lineage.\n    if (missing.length > 0) {\n      try {\n        console.error(\n          `Bitfab: server has no persisted trace for ${missing.length} of ${completedCount} completed replay item(s) (testRunId ${testRunId}). Their replay token usage is unavailable and they cannot be labeled.`,\n        )\n      } catch {\n        // Never crash the host app\n      }\n    }\n  }\n\n  const result: ReplayResult<TReturn> = {\n    items: resultItems,\n    testRunId,\n    testRunUrl: `${serviceUrl}${testRunUrl}`,\n  }\n  // Persist the enriched result two ways so the Bitfab plugin never has to parse\n  // the replay's stdout (which a dependency's logging can corrupt): write it to\n  // BITFAB_REPLAY_RESULT_PATH when the plugin set that env var, and stream a\n  // terminal `complete` progress event. The plugin prefers the streamed event\n  // and falls back to the file. The event routes through onProgress so only\n  // progress-reporting runs emit it: a run with no reporter stays silent.\n  await writeReplayResultFile(result)\n  try {\n    options?.onProgress?.({\n      type: \"complete\",\n      testRunId,\n      completed: total,\n      total,\n      succeeded,\n      errored,\n      result,\n    })\n  } catch {\n    // A progress reporter must never crash the replay run.\n  }\n  return result\n}\n\nasync function writeReplayResultFile(result: unknown): Promise<void> {\n  const resultPath =\n    typeof process !== \"undefined\"\n      ? process.env?.BITFAB_REPLAY_RESULT_PATH\n      : undefined\n  if (!resultPath) {\n    return\n  }\n\n  try {\n    const [{ dirname }, { mkdir, writeFile }] = await Promise.all([\n      import(\"node:path\"),\n      import(\"node:fs/promises\"),\n    ])\n    await mkdir(dirname(resultPath), { recursive: true })\n    await writeFile(resultPath, `${JSON.stringify(result, null, 2)}\\n`)\n  } catch (err) {\n    try {\n      console.warn(\n        `Bitfab: failed to write replay result to BITFAB_REPLAY_RESULT_PATH (${resultPath}): ${\n          err instanceof Error ? err.message : String(err)\n        }`,\n      )\n    } catch {\n      // Never crash the host app.\n    }\n  }\n}\n"],"mappings":";;;;;;;;;AA0BA,IAAM,YAAY;AAClB,IAAM,iBAAiB;AACvB,IAAM,kBAAkB;AAGxB,IAAM,mBAAmB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,MAAM,OAAO,aAAa,CAAC;AAMjC,eAAsB,sBACpB,OACoC;AACpC,MAAI,OAAO,YAAY,aAAa;AAClC,WAAO;AAAA,EACT;AACA,MAAI,QAAQ,KAAK,oCAAoC;AACnD,WAAO;AAAA,EACT;AACA,QAAM,UAAU,MAAM,mBAAmB;AACzC,MAAI,SAAS;AACX,WAAO;AAAA,EACT;AACA,SAAO,yBAAyB,QAAQ,MAAM,KAAK,KAAK,KAAK;AAC/D;AAEA,eAAe,qBAAyD;AACtE,QAAM,OAAO,QAAQ,KAAK;AAC1B,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AACA,MAAI;AACF,UAAM,EAAE,SAAS,IAAI,MAAM,OAAO,aAAkB;AACpD,UAAM,SAAS,KAAK,MAAM,MAAM,SAAS,MAAM,MAAM,CAAC;AAGtD,UAAM,QACJ,MAAM,QAAQ,QAAQ,KAAK,KAC3B,OAAO,MAAM;AAAA,MACX,CAAC,MACC,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAAA,IAC3D,IACI,OAAO,QACP;AACN,UAAM,cACJ,OAAO,QAAQ,gBAAgB,WAAW,OAAO,cAAc;AACjE,QAAI,CAAC,SAAS,gBAAgB,QAAW;AACvC,aAAO;AAAA,IACT;AACA,WAAO,EAAE,aAAa,MAAM;AAAA,EAC9B,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,yBACb,KACA,OACoC;AACpC,MAAI;AACJ,MAAI;AACJ,MAAI;AACF;AAAC,KAAC,EAAE,SAAS,IAAI,MAAM,OAAO,eAAoB;AACjD,KAAC,EAAE,SAAS,IAAI,MAAM,OAAO,aAAkB;AAAA,EAClD,QAAQ;AAEN,WAAO;AAAA,EACT;AAEA,QAAM,MAAM,CAAC,KAAa,SACxB,IAAI,QAAQ,CAAC,YAAY;AACvB;AAAA,MACE;AAAA,MACA;AAAA;AAAA;AAAA,MAGA,EAAE,KAAK,KAAK,WAAW,KAAK,OAAO,MAAM,SAAS,IAAO;AAAA,MACzD,CAAC,KAAK,WAAW,QAAQ,MAAM,OAAO,MAAM;AAAA,IAC9C;AAAA,EACF,CAAC;AAEH,MAAI;AACF,UAAM,QAAQ,MAAM,IAAI,KAAK,CAAC,aAAa,iBAAiB,CAAC,IAAI,KAAK;AACtE,QAAI,CAAC,MAAM;AACT,aAAO;AAAA,IACT;AAEA,UAAM,WAAW,MAAM,YAAY,KAAK,IAAI;AAC5C,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,IACT;AACA,UAAM,EAAE,MAAM,UAAU,IAAI;AAK5B,UAAM,YAAY,OAAO,KAAa,SAAkC;AACtE,YAAM,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;AAChE,YAAM,IAAI,MAAM,OAAO,SAAS,IAAI,KAAK,GAAG,EAAE,IAAI,OAAO;AACzD,aAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAAA,IAClC;AACA,UAAM,eAAe,OAAO,SAAkC;AAC5D,UAAI;AACF,cAAM,EAAE,KAAK,IAAI,MAAM,OAAO,aAAkB;AAChD,cAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAW;AACzC,gBAAQ,MAAM,KAAK,KAAK,MAAM,IAAI,CAAC,GAAG;AAAA,MACxC,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAGA,UAAM,UAAU,MAAM,IAAI,MAAM;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,UAAM,YAAY,MAAM,IAAI,MAAM;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,UAAM,UAAmD;AAAA,MACvD,GAAG,iBAAiB,WAAW,EAAE;AAAA,MACjC,IAAI,aAAa,IACd,MAAM,GAAG,EACT,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAC1B,IAAI,CAAC,UAAU,EAAE,QAAQ,KAAK,KAAK,EAAE;AAAA,IAC1C;AACA,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,IACT;AAEA,UAAM,QAA0B,CAAC;AACjC,QAAI,aAAa;AACjB,eAAW,EAAE,QAAQ,KAAK,KAAK,SAAS;AACtC,UAAI,MAAM,UAAU,WAAW;AAC7B;AAAA,MACF;AAGA,YAAM,cAAc,WAAW,MAAM,IAAI,MAAM,UAAU,MAAM,IAAI;AACnE,YAAM,aAAa,WAAW,MAAM,IAAI,MAAM,aAAa,IAAI;AAC/D,UAAI,cAAc,kBAAkB,aAAa,gBAAgB;AAC/D;AAAA,MACF;AAIA,YAAM,UACJ,WAAW,MACP,KACE,MAAM,IAAI,MAAM,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,KAAM,IACvD,QAAQ,SAAS,IAAI;AACvB,YAAM,SACJ,WAAW,MAAM,KAAK,MAAM,gBAAgB,UAAU,MAAM,IAAI,GAChE,QAAQ,SAAS,IAAI;AACvB,UAAI,WAAW,OAAO;AACpB;AAAA,MACF;AAGA,YAAM,OACJ,OAAO,WAAW,QAAQ,MAAM,IAAI,OAAO,WAAW,OAAO,MAAM;AACrE,UACE,aAAa,OAAO,mBACpB,YAAY,MAAM,KAClB,YAAY,KAAK,GACjB;AACA;AAAA,MACF;AACA,oBAAc;AACd,YAAM,KAAK,EAAE,MAAM,QAAQ,MAAM,CAAC;AAAA,IACpC;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AAEA,UAAM,WACJ,MAAM,IAAI,MAAM,CAAC,OAAO,MAAM,eAAe,MAAM,CAAC,IACnD,KAAK;AACR,UAAM,WAAW,MAAM,WAAW,IAAI,SAAS;AAC/C,UAAM,OAAO,OAAO,KAAK,KAAK,WAAW;AAGzC,UAAM,UAAU,YAAY,aAAa;AACzC,WAAO;AAAA,MACL,aAAa,GAAG,IAAI,KAAK,MAAM,MAAM,IAAI,QAAQ,YAAY,OAAO;AAAA,MACpE;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,YACb,KACA,MACsD;AACtD,QAAM,SAAS,QAAQ,KAAK;AAC5B,MAAI,UAAW,MAAM,UAAU,KAAK,MAAM,MAAM,GAAI;AAClD,UAAM,QACH,MAAM,IAAI,MAAM,CAAC,cAAc,QAAQ,MAAM,CAAC,IAAI,KAAK,MACvD,MAAM,IAAI,MAAM,CAAC,aAAa,YAAY,MAAM,CAAC,IAAI,KAAK,KAC3D;AACF,WAAO,OAAO,EAAE,MAAM,WAAW,KAAK,IAAI;AAAA,EAC5C;AACA,aAAW,aAAa,kBAAkB;AACxC,QAAI,CAAE,MAAM,UAAU,KAAK,MAAM,SAAS,GAAI;AAC5C;AAAA,IACF;AACA,UAAM,MAAM,MAAM,IAAI,MAAM,CAAC,cAAc,QAAQ,SAAS,CAAC,IAAI,KAAK;AACtE,QAAI,IAAI;AACN,aAAO,EAAE,MAAM,IAAI,WAAW,KAAK;AAAA,IACrC;AAAA,EACF;AACA,SAAQ,MAAM,UAAU,KAAK,MAAM,MAAM,IACrC,EAAE,MAAM,QAAQ,WAAW,MAAM,IACjC;AACN;AAEA,eAAe,UACb,KACA,MACA,KACkB;AAClB,SACG,MAAM,IAAI,MAAM,CAAC,aAAa,YAAY,GAAG,GAAG,WAAW,CAAC,MAAO;AAExE;AAEA,eAAe,gBACb,UACA,MACA,MACiB;AACjB,MAAI;AACF,UAAM,EAAE,KAAK,IAAI,MAAM,OAAO,MAAW;AACzC,WAAO,MAAM,SAAS,KAAK,MAAM,IAAI,GAAG,MAAM;AAAA,EAChD,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,iBACP,KACyC;AACzC,QAAM,QAAQ,IAAI,MAAM,GAAG,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AACvD,QAAM,MAA+C,CAAC;AACtD,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG;AAC5C,QAAI,KAAK,EAAE,QAAQ,MAAM,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAAA,EAC7D;AACA,SAAO;AACT;AAEA,SAAS,YAAY,GAAoB;AACvC,SAAO,EAAE,MAAM,GAAG,GAAI,EAAE,SAAS,GAAG;AACtC;;;ACxSO,IAAM,cAAN,cAA0B,MAAM;AAAA,EACrC,YACE,SACgB,KAChB;AACA,UAAM,OAAO;AAFG;AAGhB,SAAK,OAAO;AAAA,EACd;AACF;;;AC2EO,SAAS,iBACd,OACA,KAC4B;AAC5B,SAAO,OAAO,UAAU,aACnB,MAA6D,GAAG,IACjE;AACN;AAMO,SAAS,uBACd,cACgB;AAChB,MAAI,iBAAiB,QAAW;AAC9B,WAAO,CAAC;AAAA,EACV;AACA,SAAO,MAAM,QAAQ,YAAY,IAAI,eAAe,CAAC,YAAY;AACnE;;;AC/FA,IAAM,SAAS,oBAAI,IAAY;AAExB,SAAS,SAAS,KAAa,SAAuB;AAC3D,MAAI,OAAO,IAAI,GAAG,GAAG;AACnB;AAAA,EACF;AACA,SAAO,IAAI,GAAG;AACd,MAAI;AACF,YAAQ,KAAK,YAAY,OAAO,EAAE;AAAA,EACpC,QAAQ;AAAA,EAER;AACF;;;ACTO,SAAS,aAAqB;AACnC,QAAM,eACJ,WACA;AACF,MAAI,OAAO,cAAc,eAAe,YAAY;AAClD,QAAI;AACF,aAAO,aAAa,WAAW;AAAA,IACjC,QAAQ;AAAA,IAER;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA;AAAA,EACF;AACA,SAAO,eAAe;AACxB;AAMA,SAAS,iBAAyB;AAChC,SAAO,uCAAuC,QAAQ,SAAS,CAAC,SAAS;AACvE,UAAM,OAAQ,KAAK,OAAO,IAAI,KAAM;AACpC,UAAM,QAAQ,SAAS,MAAM,OAAQ,OAAO,IAAO;AACnD,WAAO,MAAM,SAAS,EAAE;AAAA,EAC1B,CAAC;AACH;;;ACVA,IAAI,yBACF;AACF,IAAI,WAAW;AAUR,SAAS,+BACd,KACM;AACN,MAAI,CAAC,wBAAwB;AAC3B,6BAAyB;AAAA,EAC3B;AACA,aAAW;AACb;AAYO,SAAS,+BAAqC;AACnD,MAAI,CAAC,wBAAwB;AAC3B,YAAQ;AAAA,MACN;AAAA,IACF;AAAA,EACF;AACF;AAEO,IAAM,qBACX,OAAO,YAAY,eAAe,QAAQ,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA,EAKhD;AAAA;AAAA,IAEE,CAAC,QAAQ,aAAa,EAAE,KAAK,GAAG;AAAA,IAE/B;AAAA,IACC,CAAC,QAEK;AACJ,qCAA+B,IAAI,iBAAiB;AAAA,IACtD;AAAA,EACF,EACC,MAAM,MAAM;AAAA,EAAC,CAAC;AAAA,IACjB,QAAQ,QAAQ,GACpB,KAAK,MAAM;AACX,aAAW;AACb,CAAC;AAEM,SAAS,yBAAkC;AAChD,SAAO;AACT;AAEO,SAAS,0BAA8D;AAC5E,SAAO,yBACF,IAAI,uBAAuB,IAC5B;AACN;;;ACiCA,IAAI,uBACF;AACF,IAAM,gCAAgC,uBAAO,IAAI,6BAA6B;AAEvE,IAAM,qBAAoC,kBAAkB,KAAK,MAAM;AAC5E,QAAM,SAAS;AACf,QAAM,WAAW,OAAO,6BAA6B;AAGrD,MAAI,UAAU;AACZ,2BAAuB;AACvB;AAAA,EACF;AACA,QAAM,UAAU,wBAA8C;AAC9D,MAAI,SAAS;AACX,WAAO,6BAA6B,IAAI;AACxC,2BAAuB;AAAA,EACzB;AACF,CAAC;AAGM,SAAS,mBAAyC;AACvD,SAAO,sBAAsB,SAAS,KAAK;AAC7C;AAGO,SAAS,qBAAwB,KAAoB,IAAgB;AAC1E,MAAI,sBAAsB;AACxB,WAAO,qBAAqB,IAAI,KAAK,EAAE;AAAA,EACzC;AACA,SAAO,GAAG;AACZ;;;ACjKA,OAAO,eAAe;AAmBtB,IAAM,uBAAuB;AAO7B,IAAM,iCAAiC;AAEvC,SAAS,cAAc,OAAwB;AAC7C,MAAI;AACF,UAAM,WAAY,OAA+C,aAC7D;AACJ,QAAI,YAAY,aAAa,UAAU;AACrC,aAAO;AAAA,IACT;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO,OAAO;AAChB;AAEA,SAAS,mBAAmB,OAAgB,QAAiC;AAG3E;AAAA,IACE,aAAa,OAAO,QAAQ,QAAQ,GAAG,CAAC;AAAA,IACxC,qDAAqD,MAAM;AAAA,EAC7D;AACA,MAAI;AACJ,MAAI;AACF,cAAU,oBAAoB,cAAc,KAAK,CAAC,KAAK,MAAM;AAAA,EAC/D,QAAQ;AACN,cAAU,oBAAoB,MAAM;AAAA,EACtC;AACA,SAAO,EAAE,MAAM,QAAQ;AACzB;AA+BO,SAAS,eAAe,OAAiC;AAC9D,MAAI;AACF,UAAM,EAAE,MAAM,KAAK,IAAI,UAAU,UAAU,KAAK;AAEhD,QAAI;AACJ,QAAI;AACF,aAAO,KAAK,UAAU,IAAI,EAAE;AAAA,IAC9B,QAAQ;AACN,aAAO,mBAAmB,OAAO,kCAAkC;AAAA,IACrE;AACA,QAAI,OAAO,sBAAsB;AAC/B,aAAO,mBAAmB,OAAO,aAAa,IAAI,QAAQ;AAAA,IAC5D;AAEA,WAAO,OAAO,EAAE,MAAM,KAAK,IAAI,EAAE,KAAK;AAAA,EACxC,QAAQ;AACN,QAAI;AACF,aAAO,EAAE,MAAM,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC,EAAE;AAAA,IACnD,QAAQ;AACN,aAAO,mBAAmB,OAAO,uBAAuB;AAAA,IAC1D;AAAA,EACF;AACF;AAeO,SAAS,iBAAiB,YAAsC;AACrE,MAAI,WAAW,SAAS,QAAW;AAEjC,WAAO,WAAW;AAAA,EACpB;AAKA,SAAO,UAAU,YAAY;AAAA,IAC3B,MAAM,WAAW;AAAA,IACjB,MAAM,WAAW;AAAA,EACnB,CAAC;AACH;AAEA,IAAM,iBAAiB;AAgBhB,SAAS,WAAW,OAAyB;AAClD,SAAO,iBAAiB,KAAK,EAAE;AACjC;AAeO,SAAS,iBAAiB,OAG/B;AACA,QAAM,UAAoB,CAAC;AAC3B,QAAM,OAAO,gBAAgB,OAAO,GAAG,oBAAI,QAAQ,GAAG,OAAO;AAQ7D,MAAI;AACF,UAAM,OAAO,KAAK,UAAU,IAAI,GAAG,UAAU;AAC7C,QAAI,OAAO,gCAAgC;AACzC;AAAA,QACE;AAAA,QACA,gCAAgC,8BAA8B;AAAA,MAChE;AAIA,aAAO;AAAA,QACL,MAAM,8BAA8B,IAAI;AAAA,QACxC,SAAS,CAAC,GAAG,SAAS,aAAa,IAAI,QAAQ;AAAA,MACjD;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO,EAAE,MAAM,QAAQ;AACzB;AAEA,SAAS,gBACP,OACA,OACA,MACA,SACS;AACT,MAAI,UAAU,QAAQ,UAAU,QAAW;AACzC,WAAO;AAAA,EACT;AACA,MACE,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,WACjB;AACA,WAAO;AAAA,EACT;AAEA,QAAM,YACH,OAA+C,aAAa,QAC7D,OAAO;AACT,MAAI,QAAQ,gBAAgB;AAC1B,YAAQ,KAAK,SAAS;AACtB,WAAO,IAAI,SAAS;AAAA,EACtB;AAKA,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,OAAO,UAAU,cAAc,OAAO,UAAU,UAAU;AAC5D,cAAQ,KAAK,SAAS;AAAA,IACxB;AACA,QAAI;AACF,aAAO,OAAO,KAAK;AAAA,IACrB,QAAQ;AACN,cAAQ,KAAK,SAAS;AACtB,aAAO,IAAI,SAAS;AAAA,IACtB;AAAA,EACF;AAEA,MAAI,KAAK,IAAI,KAAe,GAAG;AAC7B,YAAQ,KAAK,SAAS;AACtB,WAAO,UAAU,SAAS;AAAA,EAC5B;AACA,OAAK,IAAI,KAAe;AAExB,MAAI;AACJ,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAS,MAAM;AAAA,MAAI,CAAC,SAClB,gBAAgB,MAAM,QAAQ,GAAG,MAAM,OAAO;AAAA,IAChD;AAAA,EACF,WAAW,OAAQ,MAAkC,WAAW,YAAY;AAI1E,QAAI;AACF,eAAS;AAAA,QACN,MAAgC,OAAO;AAAA,QACxC,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,cAAQ,KAAK,SAAS;AACtB,eAAS,IAAI,SAAS;AAAA,IACxB;AAAA,EACF,OAAO;AACL,QAAI;AACF,YAAM,MAA+B,CAAC;AACtC,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC1C,YAAI,CAAC,EAAE,WAAW,GAAG,GAAG;AACtB,cAAI,CAAC,IAAI,gBAAgB,GAAG,QAAQ,GAAG,MAAM,OAAO;AAAA,QACtD;AAAA,MACF;AACA,eAAS;AAAA,IACX,QAAQ;AACN,cAAQ,KAAK,SAAS;AACtB,eAAS,IAAI,SAAS;AAAA,IACxB;AAAA,EACF;AAMA,OAAK,OAAO,KAAe;AAC3B,SAAO;AACT;;;ACtOA,SAAS,gBACP,UACS;AACT,SAAO,aAAa,UAAa,aAAa;AAChD;AAOA,SAAS,wBACP,UAC8B;AAC9B,MAAI,CAAC,YAAY,aAAa,MAAM;AAClC,WAAO;AAAA,EACT;AACA,QAAM,EAAE,OAAO,OAAO,UAAU,IAAI;AACpC,QAAM,WAA6B;AAAA,IACjC,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,IACvC,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,IACvC,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU;AAAA,EACjD;AACA,SAAO,OAAO,KAAK,QAAQ,EAAE,WAAW,IAAI,SAAY;AAC1D;AAsLO,IAAM,yBAAyB;AAiB/B,SAAS,qBAAqB,UAAgC;AACnE,QAAM,SAAS,OAAO,YAAY,cAAc,QAAQ,SAAS;AACjE,MAAI,CAAC,QAAQ;AACX;AAAA,EACF;AACA,MAAI;AACF,WAAO,MAAM,GAAG,sBAAsB,GAAG,KAAK,UAAU,QAAQ,CAAC;AAAA,CAAI;AAAA,EACvE,QAAQ;AAAA,EAER;AACF;AA2FA,SAAS,kBAAkB,UAA8C;AACvE,QAAM,YAAY,SAAS;AAC3B,QAAM,WAAW,SAAS;AAG1B,MAAI,cAAc,UAAa,cAAc,MAAM;AACjD,UAAM,eAAe,iBAAiB,EAAE,MAAM,UAAU,MAAM,UAAU,CAAC;AACzE,QAAI,MAAM,QAAQ,YAAY,GAAG;AAC/B,aAAO;AAAA,IACT;AACA,WAAO,iBAAiB,UAAa,iBAAiB,OAClD,CAAC,YAAY,IACb,CAAC;AAAA,EACP;AAGA,MAAI,MAAM,QAAQ,QAAQ,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,aAAa,UAAa,aAAa,OAAO,CAAC,QAAQ,IAAI,CAAC;AACrE;AAKA,SAAS,kBAAkB,UAA4C;AACrE,QAAM,aAAa,SAAS;AAC5B,QAAM,YAAY,SAAS;AAE3B,MAAI,eAAe,UAAa,eAAe,MAAM;AACnD,WAAO,iBAAiB,EAAE,MAAM,WAAW,MAAM,WAAW,CAAC;AAAA,EAC/D;AAEA,SAAO;AACT;AAuBA,SAAS,cAAc,UAAkC;AACvD,QAAM,QAAQ,oBAAI,IAAsB;AACxC,QAAM,WAAW,oBAAI,IAAoB;AAEzC,WAAS,KAAK,MAA0B;AACtC,UAAM,MAAM,KAAK;AACjB,QAAI,KAAK;AACP,YAAM,OAAO,KAAK,YAAY;AAC9B,YAAM,aAAa,GAAG,GAAG,IAAI,IAAI;AACjC,YAAM,QAAQ,SAAS,IAAI,UAAU,KAAK;AAC1C,eAAS,IAAI,YAAY,QAAQ,CAAC;AAIlC,YAAM,IAAI,GAAG,UAAU,IAAI,KAAK,IAAI;AAAA,QAClC,cAAc,KAAK;AAAA,QACnB,gBAAgB,KAAK;AAAA,QACrB,QAAQ,KAAK;AAAA,QACb,YAAY,KAAK;AAAA,MACnB,CAAC;AAAA,IACH;AACA,eAAW,SAAS,KAAK,UAAU;AACjC,WAAK,KAAK;AAAA,IACZ;AAAA,EACF;AAEA,aAAW,SAAS,SAAS,UAAU;AACrC,SAAK,KAAK;AAAA,EACZ;AAEA,SAAO,EAAE,MAAM;AACjB;AAMA,eAAe,YACb,YACA,YAcA,IACA,WACA,cACA,mBACA,iBACA,sBACA,kBACA,aAG8B;AAS9B,MAAI,QAAQ,uBAAuB,WAAW,gBAAgB;AAI9D,MAAI,aAAa,uBACb,WAAW,qBACX;AACJ,MAAI,gBAAgB,WAAW;AAE/B,MAAI,SAAoB,CAAC;AACzB,MAAI;AACJ,MAAI;AACJ,MAAI,QAAuB;AAK3B,QAAM,qBAAyC,CAAC;AAKhD,QAAM,kBAAkB,WAAW,mBAAmB,WAAW;AACjE,QAAM,iBAAiB,WAAW,kBAAkB,WAAW;AAE/D,MAAI;AACF,QAAI,wBAAwB,CAAC,SAAS,CAAC,YAAY;AACjD,YAAM,WAAW,MAAM,WAAW;AAAA,QAChC;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,SAAS,SAAS;AAC1B,mBAAa,SAAS,cAAc;AACpC,sBAAgB,SAAS,iBAAiB;AAAA,IAC5C;AAEA,QAAI,YAAY;AACd,YAAM,IAAI;AAAA,QACR,gDAAgD,eAAe,kCAAkC,WAAW,IAAI,MAAM,WAAW,OAAO;AAAA,MAC1I;AAAA,IACF;AAEA,UAAM,OAAO,MAAM,WAAW,gBAAgB,cAAc;AAC5D,UAAM,WAAY,KAAK,SAAS,aAAa,CAAC;AAE9C,aAAS,kBAAkB,QAAQ;AACnC,qBAAiB,kBAAkB,QAAQ;AAK3C,QAAI,aAAa;AACf,eAAS,YAAY,QAAQ;AAAA,QAC3B;AAAA,QACA;AAAA;AAAA,QAEA,eAAe;AAAA,QACf,cAAc;AAAA,MAChB,CAAC;AAAA,IACH;AAOA,UAAM,eAAe,kBAAkB,SAAS;AAChD,UAAM,WACJ,iBAAiB,SAAS,iBAAiB,YAAY;AACzD,UAAM,iBAAiB,iBAAiB;AAExC,QAAI;AACJ,QAAI,UAAU;AACZ,UAAI;AACF,cAAM,eAAe,MAAM,WAAW,YAAY,gBAAgB;AAAA,UAChE;AAAA,QACF,CAAC;AACD,YAAI,aAAa,MAAM;AACrB,qBAAW,cAAc,aAAa,IAAI;AAAA,QAC5C,WAAW,iBAAiB,SAAS,cAAc;AACjD,gBAAM,IAAI;AAAA,YACR,yBAAyB,YAAY,IAAI,eAAe,oBAAoB,EAAE,gDAAgD,cAAc;AAAA,UAC9I;AAAA,QACF,OAAO;AACL,qBAAW;AAAA,QACb;AAAA,MACF,SAAS,GAAG;AAMV,YAAI,iBAAiB,SAAS,cAAc;AAC1C,gBAAM;AAAA,QACR;AACA,mBAAW;AAAA,MACb;AAAA,IACF;AAMA,UAAM,cAAc,oBAAI,IAA8B;AACtD,UAAM,kBACJ,YAAY,CAAC,iBACT,CAAC,mBAA6C;AAC5C,UAAI,UAAU,YAAY,IAAI,cAAc;AAC5C,UAAI,CAAC,SAAS;AACZ,kBAAU,WACP,gBAAgB,cAAc,EAC9B;AAAA,UAAK,CAAC,MACL;AAAA,YACG,EAAE,SAAS,aAAa,CAAC;AAAA,UAC5B;AAAA,QACF;AACF,oBAAY,IAAI,gBAAgB,OAAO;AAAA,MACzC;AACA,aAAO;AAAA,IACT,IACA;AAEN,UAAM,eAAe;AAAA,MACnB;AAAA,QACE;AAAA,QACA,SAAS;AAAA,QACT,mBAAmB,KAAK;AAAA,QACxB,oBAAoB,KAAK;AAAA,QACzB,qBAAqB;AAAA,QACrB;AAAA,QACA,cAAc,WAAW,oBAAI,IAAI,IAAI;AAAA,QACrC;AAAA,QACA,eAAe,eAAe,oBAAoB;AAAA,QAClD;AAAA,QACA,eAAe;AAAA,QACf;AAAA,MACF;AAAA,MACA,MAAM,GAAG,GAAG,MAAM;AAAA,IACpB;AACA,aAAS,wBAAwB,UAAU,MAAM,eAAe;AAAA,EAClE,SAAS,GAAG;AACV,YAAQ,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;AAAA,EACnD,UAAE;AAIA,UAAM,QAAQ,WAAW,kBAAkB;AAC3C,QAAI,OAAO;AACT,UAAI;AACF,cAAM,WAAW,qBAAqB,MAAM,YAAY;AAAA,MAC1D,SAAS,GAAG;AACV,YAAI;AACF,kBAAQ;AAAA,YACN,uCAAuC,MAAM,YAAY,iCACvD,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAC3C;AAAA,UACF;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA;AAAA;AAAA;AAAA,IAIL,SAAS;AAAA,IACT;AAAA,IACA;AAAA;AAAA,IAEA,eAAe;AAAA,IACf,cAAc;AAAA,IACd,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,WAAW,cAAc;AAAA;AAAA;AAAA;AAAA,IAIrC,QAAQ;AAAA,IACR,OAAO,WAAW,SAAS;AAAA,IAC3B,eAAe,iBAAiB;AAAA,EAClC;AACF;AAMA,eAAe,mBACb,OACA,gBACA,WACc;AACd,QAAM,UAAe,IAAI,MAAM,MAAM,MAAM;AAC3C,MAAI,YAAY;AAEhB,iBAAe,SAAwB;AACrC,WAAO,YAAY,MAAM,QAAQ;AAC/B,YAAM,QAAQ;AACd,YAAM,SAAS,MAAM,MAAM,KAAK,EAAE;AAClC,cAAQ,KAAK,IAAI;AACjB,kBAAY,QAAQ,KAAK;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,UAAU,MAAM;AAAA,IACpB,EAAE,QAAQ,KAAK,IAAI,gBAAgB,MAAM,MAAM,EAAE;AAAA,IACjD,MAAM,OAAO;AAAA,EACf;AACA,QAAM,QAAQ,IAAI,OAAO;AACzB,SAAO;AACT;AAOA,eAAsB,OACpB,YACA,YACA,kBAEA,IACA,SACA,sBAAsC,CAAC,GACP;AAChC,MAAI,SAAS,aAAa,QAAW;AACnC,QAAI,QAAQ,SAAS,WAAW,GAAG;AACjC,YAAM,IAAI,YAAY,8CAA8C;AAAA,IACtE;AACA,QAAI,QAAQ,SAAS,SAAS,KAAK;AACjC,YAAM,IAAI;AAAA,QACR,2DAA2D,QAAQ,SAAS,MAAM;AAAA,MACpF;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,UAAU,UAAa,SAAS,aAAa,QAAW;AACnE,QAAI;AACF,cAAQ;AAAA,QACN;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,QAAM;AAKN,MAAI,wBAAwB,SAAS;AACrC,MAAI,kBAAkB,SAAS;AAC/B,MAAI,oBAAoB,QAAW;AACjC,UAAM,WAAW,MAAM,sBAAsB,SAAS,IAAI;AAC1D,QAAI,UAAU;AACZ,wBAAkB,SAAS;AAC3B,UAAI,0BAA0B,QAAW;AACvC,gCAAwB,SAAS;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAEA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,OAAO;AAAA,EACT,IAAI,MAAM,WAAW;AAAA,IACnB;AAAA;AAAA;AAAA,IAGA,SAAS,WAAW,SAAa,SAAS,SAAS;AAAA,IACnD,SAAS;AAAA,IACT,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA,gBAAgB,SAAS,QAAQ;AAAA;AAAA,IACjC,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,IACT,wBAAwB,SAAS,QAAQ;AAAA,EAC3C;AAEA,QAAM,eAA6B,SAAS,QAAQ;AACpD,QAAM,iBAAiB,SAAS,kBAAkB;AAKlD,QAAM,oBAAoB;AAAA,IACxB,GAAG,uBAAuB,SAAS,YAAY;AAAA,IAC/C,GAAG;AAAA,EACL;AAMA,QAAM,mBAAmB,YAAY,IAAI,MAAM,WAAW,CAAC;AAC3D,QAAM,QAAQ,YAAY;AAAA,IACxB,CAAC,YAAY,UAAU,MACrB;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,iBAAiB,KAAK;AAAA,MACtB,gBAAgB,SAAS,QAAQ;AAAA,MACjC,wBAAwB,SAAS,QAAQ;AAAA,MACzC,SAAS;AAAA,IACX;AAAA,EACJ;AACA,QAAM,QAAQ,MAAM;AACpB,MAAI,YAAY;AAChB,MAAI,YAAY;AAChB,MAAI,UAAU;AACd,QAAM,cAAc,MAAM;AAAA,IACxB;AAAA,IACA;AAAA,IACA,SAAS,aACL,CAAC,SAAS;AACR,mBAAa;AACb,UAAI,KAAK,UAAU,MAAM;AACvB,qBAAa;AAAA,MACf,OAAO;AACL,mBAAW;AAAA,MACb;AACA,UAAI;AACF,iBAAS,aAAa;AAAA,UACpB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAMJ,SAAS;AAAA,YACT,iBAAiB,KAAK,mBAAmB;AAAA,YACzC,gBAAgB,KAAK,kBAAkB;AAAA;AAAA,YAEvC,eAAe,KAAK,mBAAmB;AAAA,YACvC,cAAc,KAAK,kBAAkB;AAAA,YACrC,OAAO,KAAK;AAAA,YACZ,QAAQ,KAAK;AAAA,YACb,gBAAgB,KAAK;AAAA,YACrB,OAAO,KAAK;AAAA,YACZ,YAAY,KAAK;AAAA,YACjB,QAAQ,KAAK;AAAA,YACb,OAAO,KAAK;AAAA,YACZ,eAAe,KAAK;AAAA,UACtB;AAAA,QACF,CAAC;AAAA,MACH,QAAQ;AAAA,MAER;AAAA,IACF,IACA;AAAA,EACN;AAOA,QAAM,iBAAiB,MAAM,WAAW,eAAe,SAAS;AAChE,QAAM,iBAAiB,eAAe;AAGtC,QAAM,eAAe,eAAe;AAWpC,MAAI,mBAAmB,QAAW;AAChC,UAAM,UAAoB,CAAC;AAC3B,QAAI,iBAAiB;AACrB,aAAS,QAAQ,GAAG,QAAQ,YAAY,QAAQ,SAAS,GAAG;AAC1D,YAAM,OAAO,YAAY,KAAK;AAC9B,YAAM,UAAU,iBAAiB,KAAK;AACtC,YAAM,SAAS,UAAU,eAAe,OAAO,IAAI;AAGnD,WAAK,UAAU,UAAU;AACzB,UAAI,KAAK,UAAU,MAAM;AACvB,0BAAkB;AAClB,YAAI,WAAW,QAAW;AACxB,kBAAQ,KAAK,WAAW,KAAK,eAAe;AAAA,QAC9C;AAAA,MACF;AACA,UAAI,WAAW,QAAW;AACxB,aAAK,SAAS,eAAe,MAAM,KAAK;AAAA,MAC1C;AAAA,IACF;AAKA,QAAI,iBAAiB,KAAK,QAAQ,WAAW,gBAAgB;AAC3D,YAAM,cACJ,eAAe,eAAe,SAC1B,yBAAyB,eAAe,UAAU,4BAClD;AACN,YAAM,IAAI;AAAA,QACR,yEAAyE,cAAc,iCAAiC,SAAS,KAAK,WAAW;AAAA,MAEnJ;AAAA,IACF;AAIA,QAAI,QAAQ,SAAS,GAAG;AACtB,UAAI;AACF,gBAAQ;AAAA,UACN,6CAA6C,QAAQ,MAAM,OAAO,cAAc,wCAAwC,SAAS;AAAA,QACnI;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAEA,QAAM,SAAgC;AAAA,IACpC,OAAO;AAAA,IACP;AAAA,IACA,YAAY,GAAG,UAAU,GAAG,UAAU;AAAA,EACxC;AAOA,QAAM,sBAAsB,MAAM;AAClC,MAAI;AACF,aAAS,aAAa;AAAA,MACpB,MAAM;AAAA,MACN;AAAA,MACA,WAAW;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,eAAe,sBAAsB,QAAgC;AACnE,QAAM,aACJ,OAAO,YAAY,cACf,QAAQ,KAAK,4BACb;AACN,MAAI,CAAC,YAAY;AACf;AAAA,EACF;AAEA,MAAI;AACF,UAAM,CAAC,EAAE,QAAQ,GAAG,EAAE,OAAO,UAAU,CAAC,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC5D,OAAO,MAAW;AAAA,MAClB,OAAO,aAAkB;AAAA,IAC3B,CAAC;AACD,UAAM,MAAM,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AACpD,UAAM,UAAU,YAAY,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,CAAI;AAAA,EACpE,SAAS,KAAK;AACZ,QAAI;AACF,cAAQ;AAAA,QACN,uEAAuE,UAAU,MAC/E,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-OMW6EFXC.js → chunk-JANSX65W.js}

@@ -14,10 +14,10 @@ import {
   toJsonSafe,
   toJsonSafeReport,
   warnOnce
-} from "./chunk-HWQB73HK.js";
+} from "./chunk-DPV6PBWE.js";
 
 // src/version.generated.ts
-var __version__ = "0.33.4";
+var __version__ = "0.33.6";
 
 // src/constants.ts
 var DEFAULT_SERVICE_URL = "https://bitfab.ai";
@@ -3840,7 +3840,7 @@ var Bitfab = class {
         `Function is wrapped with trace function key '${wrappedKey}' but replay was called with '${traceFunctionKey}'. Pass matching keys, or pass the unwrapped function to replay it under the explicit key.`
       );
     }
-    const { replay: doReplay } = await import("./replay-4Y23OZYE.js");
+    const { replay: doReplay } = await import("./replay-SRQI4QMY.js");
     return doReplay(
       this.httpClient,
       this.serviceUrl,
@@ -4060,4 +4060,4 @@ export {
   BitfabFunction,
   finalizers
 };
-//# sourceMappingURL=chunk-OMW6EFXC.js.map
+//# sourceMappingURL=chunk-JANSX65W.js.map