@keboola/api-client 49.0.0 → 51.0.0

package/dist/{transientRetries-B4iusp69.js.map → transientRetries-BKqmb85B.js.map}

@@ -1 +1 @@
-{"version":3,"file":"transientRetries-B4iusp69.js","names":[],"sources":["../src/utils/async/delay.ts","../src/utils/async/lazy.ts","../src/utils/async/result.ts","../src/utils/async/poll/utils.ts","../src/utils/async/poll/backoff.ts","../src/utils/async/poll/pollLoop.ts","../src/utils/async/poll/poll.ts","../src/domain/jobStatus.ts","../src/clients/transientRetries.ts"],"sourcesContent":["import { createAbortError } from '../createAbortError';\n\nexport const delay = (timeout: number, signal?: AbortSignal) =>\n  new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) return reject(createAbortError(signal.reason));\n\n    const onAbort = () => {\n      clearTimeout(timeoutId);\n      reject(createAbortError(signal?.reason));\n    };\n\n    // `once: true` only detaches the listener once the event fires, so the timeout path has to\n    // detach it explicitly — a caller reusing one signal across many delays (`poll` does) would\n    // otherwise pile up a listener per delay for as long as the signal is alive.\n    const timeoutId = setTimeout(() => {\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    }, timeout);\n\n    signal?.addEventListener('abort', onAbort, { once: true });\n  });\n","import type { TaskFn } from './types';\n\n/**\n * Runs `task` once and replays its promise to every later caller.\n *\n * - A rejection is not cached: the next call retries, so a transient failure never sticks.\n * - Callers that joined the failed run reject with its error.\n */\nexport const lazy = <T>(task: TaskFn<T>): (() => Promise<Awaited<T>>) => {\n  let value: Promise<Awaited<T>> | null = null;\n\n  // async wrapper so a synchronous throw from `task` rejects rather than throws.\n  const runTask = async (): Promise<Awaited<T>> => await task();\n\n  return () => {\n    value ??= runTask().catch((error: unknown) => {\n      value = null;\n      throw error;\n    });\n    return value;\n  };\n};\n","export type Success<T> = { success: true; data: T };\nexport type Failure<E extends Error> = { success: false; error: E };\nexport type Result<T, E extends Error = Error> = Success<T> | Failure<E>;\n\n// A task that returns a promise is a type error: the wrapper would report success before it\n// settles, and the rejection would go unhandled. Use the `*Async` sibling.\ntype NotPromise<T> = T extends PromiseLike<unknown> ? never : T;\n\nexport const asError = (thrown: unknown) =>\n  thrown instanceof Error ? thrown : new Error(String(thrown), { cause: thrown });\n\nconst success = <T>(data: T): Result<T, never> => ({ success: true, data });\nconst failure = <E extends Error>(error: E): Result<never, E> => ({ success: false, error });\nconst isSuccess = <T, E extends Error>(result: Result<T, E>): result is Success<T> =>\n  result.success;\nconst isFailure = <T, E extends Error>(result: Result<T, E>): result is Failure<E> =>\n  !result.success;\n\nconst map = <T, E extends Error, U>(result: Result<T, E>, fn: (data: T) => U): Result<U, E> =>\n  result.success ? success(fn(result.data)) : result;\n\nconst mapError = <T, E extends Error, F extends Error>(\n  result: Result<T, E>,\n  fn: (error: E) => F,\n): Result<T, F> => (result.success ? result : failure(fn(result.error)));\n\nconst andThen = <T, E extends Error, U, F extends Error>(\n  result: Result<T, E>,\n  fn: (data: T) => Result<U, F>,\n): Result<U, E | F> => (result.success ? fn(result.data) : result);\n\nconst match = <T, E extends Error, R>(\n  result: Result<T, E>,\n  onSuccess: (data: T) => R,\n  onFailure: (error: E) => R,\n): R => (result.success ? onSuccess(result.data) : onFailure(result.error));\n\n// A side effect on a success; the result itself passes through untouched, same instance.\nconst tap = <T, E extends Error>(result: Result<T, E>, fn: (data: T) => void): Result<T, E> => {\n  if (result.success) fn(result.data);\n  return result;\n};\n\nconst unwrap = <T, E extends Error>(result: Result<T, E>): T => {\n  if (result.success) return result.data;\n  throw result.error;\n};\n\nconst unwrapOr = <T, E extends Error, U>(result: Result<T, E>, fallback: U): T | U =>\n  result.success ? result.data : fallback;\n\nconst tryCatch = <T>(task: () => NotPromise<T>): Result<T> => {\n  try {\n    return success(task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst tryCatchAsync = async <T>(task: () => T | PromiseLike<T>): Promise<Result<T>> => {\n  try {\n    return success(await task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst fromThrowable =\n  <A extends unknown[], R>(fn: (...args: A) => NotPromise<R>) =>\n  (...args: A): Result<R> =>\n    tryCatch(() => fn(...args));\n\nconst fromThrowableAsync =\n  <A extends unknown[], R>(fn: (...args: A) => R | PromiseLike<R>) =>\n  (...args: A): Promise<Result<R>> =>\n    tryCatchAsync(() => fn(...args));\n\nexport const Result = {\n  success,\n  failure,\n  isSuccess,\n  isFailure,\n  map,\n  mapError,\n  andThen,\n  match,\n  tap,\n  unwrap,\n  unwrapOr,\n  tryCatch,\n  tryCatchAsync,\n  fromThrowable,\n  fromThrowableAsync,\n};\n","/**\n * The longest delay a timer can hold: `setTimeout` takes a 32-bit signed number of milliseconds,\n * about 24.9 days.\n *\n * - Above it the delay wraps: Node warns and fires after 1 ms, so a long wait becomes a busy loop.\n * - It bounds a backoff curve and a poll's timeout alike, since both end up in a timer.\n */\nexport const MAX_TIMER_DELAY = 2 ** 31 - 1;\n\nexport const clamp = (value: number, min: number, max = Infinity) =>\n  Math.min(Math.max(value, min), max);\n\nexport const finiteOr = (value: number, fallback: number) =>\n  Number.isFinite(value) ? value : fallback;\n\n/** A signal that never aborts, so an input nobody gave costs no branch of its own. */\nexport const neverAborts = () => new AbortController().signal;\n","import { clamp, finiteOr, MAX_TIMER_DELAY } from './utils';\n\nexport type Jitter =\n  | 'none' // delay\n  | 'full' // [0, delay)\n  | 'equal'; // [delay / 2, delay)\n\ntype Backoff =\n  | { type: 'constant'; interval: number } //   3000, 3000, 3000, ...\n  | { type: 'linear'; initialInterval: number; step: number } // 1000, 2000, 3000, …\n  | { type: 'exponential'; initialInterval: number; factor?: number }; // 1000, 2000, 4000, 8000, …\n\ntype RandomFn = () => number;\ntype JitterFn = (delay: number) => number;\ntype BackoffFn = (attempt: number) => number;\n\nexport type BackoffDef = {\n  jitter?: Jitter;\n  maxInterval?: number;\n  random?: RandomFn;\n} & Backoff;\n\nconst MIN_STEP = 500;\nconst MIN_FACTOR = 2;\nconst MIN_INTERVAL = 500;\n\nexport const createBackoff = ({\n  jitter = 'none',\n  maxInterval: _maxInterval = MAX_TIMER_DELAY,\n  random = Math.random,\n  ...backoff\n}: BackoffDef): BackoffFn => {\n  const backoffFn: BackoffFn = (attempt) => {\n    if (backoff.type === 'linear') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const step = clamp(finiteOr(backoff.step, MIN_STEP), MIN_STEP);\n\n      return interval + step * (attempt - 1);\n    }\n    if (backoff.type === 'exponential') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const factor = clamp(finiteOr(backoff.factor ?? MIN_FACTOR, MIN_FACTOR), MIN_FACTOR);\n\n      return interval * factor ** (attempt - 1);\n    }\n\n    return clamp(finiteOr(backoff.interval, MIN_INTERVAL), MIN_INTERVAL);\n  };\n\n  const jitterFn: JitterFn = (delay) => {\n    if (jitter === 'none') return delay;\n    if (jitter === 'full') return delay * random();\n    return delay / 2 + (delay / 2) * random(); // equal\n  };\n\n  const maxInterval = clamp(finiteOr(_maxInterval, MAX_TIMER_DELAY), MIN_INTERVAL, MAX_TIMER_DELAY);\n  return (_attempt) => {\n    const attempt = clamp(finiteOr(Math.trunc(_attempt), 1), 1);\n    const capped = Math.min(backoffFn(attempt), maxInterval);\n    // Floored after the jitter, not before: `full` jitter multiplies by a random fraction, so a floor\n    // applied to the curve alone leaves sub-millisecond gaps between attempts.\n    return clamp(finiteOr(jitterFn(capped), MIN_INTERVAL), MIN_INTERVAL, maxInterval);\n  };\n};\n","import { delay } from '../delay';\nimport { Result } from '../result';\n\nimport { type BackoffDef, createBackoff } from './backoff';\nimport { clamp, finiteOr, MAX_TIMER_DELAY, neverAborts } from './utils';\n\ntype Clock = {\n  wait: (ms: number, signal?: AbortSignal) => Promise<void>;\n  now: () => number;\n};\n\nexport type PollContext = {\n  attempt: number;\n  elapsed: number;\n};\n\n/** The context plus the answer it is about: what `until` decides on, and what an ending reports. */\nexport type PollTick<T> = PollContext & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T> = PollTick<T> &\n  (\n    | { state: 'done'; data: T }\n    | { state: 'timedOut' | 'exhausted'; error?: Error }\n    | { state: 'aborted'; reason?: unknown }\n    | { state: 'errored'; error: Error }\n  );\n\nexport type PollOptions<T> = {\n  pollFn: (context: PollContext & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  signal?: AbortSignal;\n  backoff?: BackoffDef;\n  isRetryable?: (error: Error) => boolean;\n  maxAttempts?: number;\n  timeout?: number;\n  clock?: Clock;\n};\n\n/** One constructor per ending, so a result is built the same way wherever a poll ends. */\nexport const pollResult = {\n  done: <T>(data: T, context: PollTick<T>): PollResult<T> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T>(error: Error, context: PollTick<T>): PollResult<T> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T>(context: PollTick<T>, reason: unknown): PollResult<T> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T>({\n  pollFn: _pollFn,\n  until: _until,\n  signal: callerSignal = neverAborts(),\n  backoff: backoffDef = { type: 'constant', interval: 3000 },\n  clock = { wait: (ms, signal) => delay(ms, signal), now: () => performance.now() },\n  isRetryable: _isRetryable = () => false,\n  maxAttempts: _maxAttempts = Infinity,\n  timeout: _timeout = Infinity,\n}: PollOptions<T>): Promise<PollResult<T>> => {\n  // A deadline ends up in a timer, so a finite one is bounded by what a timer can hold. `Infinity`\n  // is answered before the clamp: it means no deadline, and clamping would make it the longest one.\n  const requested = finiteOr(_timeout, Infinity);\n  const timeout = requested === Infinity ? Infinity : clamp(requested, 0, MAX_TIMER_DELAY);\n  const maxAttempts = Math.trunc(clamp(finiteOr(_maxAttempts, Infinity), 0));\n\n  const timeoutSignal = timeout === Infinity ? neverAborts() : AbortSignal.timeout(timeout);\n  const anySignal = AbortSignal.any([callerSignal, timeoutSignal]);\n  const anyAborted = Promise.withResolvers<never>();\n\n  anySignal.addEventListener('abort', () => anyAborted.reject(anySignal.reason), {\n    once: true,\n  });\n  void anyAborted.promise.catch(() => undefined);\n\n  const backoffFn = createBackoff(backoffDef);\n  const startedAt = clock.now();\n\n  const until = Result.fromThrowable(_until);\n  const isRetryable = Result.fromThrowable(_isRetryable);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ attempt: at, elapsed }: PollContext) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([_pollFn({ attempt: at, elapsed, signal: anySignal }), anyAborted.promise]),\n    );\n  const sleep = Result.fromThrowableAsync((ms: number) => clock.wait(ms, anySignal));\n\n  let attempt = 0;\n  // What a retry swallowed: the poll carries it to whichever ending runs out first.\n  let last: T | null = null;\n  let lastError: Error | undefined;\n  const context = (at = clock.now() - startedAt): PollTick<T> => ({\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T>(context());\n\n  while (true) {\n    const before = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(before, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(before, callerSignal.reason);\n\n    attempt++;\n    // The attempt it is, not the one before it — `before` was read to decide whether to make it.\n    const poll = await pollFn({ ...before, attempt });\n\n    // What the attempt produced, recorded before the tick that reports it: on any ending but `done`\n    // these two are the only account of what the poll saw, and reading them one attempt behind is\n    // reading the wrong answer.\n    if (poll.success) last = poll.data;\n    else lastError = poll.error;\n\n    const after = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(after, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(after, callerSignal.reason);\n\n    if (!poll.success) {\n      const canRetry = isRetryable(poll.error);\n\n      // A predicate that throws cannot ask for a retry. The request's own failure stays the reported\n      // one — it is the type a caller's guards expect — and the predicate's rides along as its cause.\n      if (!canRetry.success) {\n        poll.error.cause ??= canRetry.error;\n        return pollResult.errored(poll.error, after);\n      }\n      if (!canRetry.data) return pollResult.errored(poll.error, after);\n    }\n\n    if (poll.success) {\n      const isDone = until({ ...after, data: poll.data });\n      if (!isDone.success) return pollResult.errored(isDone.error, after);\n      if (isDone.data) return pollResult.done(poll.data, after);\n    }\n\n    // exhausted\n    if (attempt >= maxAttempts) return pollResult.exhausted(after, lastError);\n\n    // sleep\n    const backoff = backoffFn(attempt);\n    if (after.elapsed + backoff >= timeout) return pollResult.timedOut(after, lastError);\n\n    const slept = await sleep(backoff);\n    if (!slept.success) {\n      const afterSleep = context();\n      if (timeoutSignal.aborted) return pollResult.timedOut(afterSleep, lastError);\n      if (callerSignal.aborted) return pollResult.aborted(afterSleep, callerSignal.reason);\n\n      return pollResult.errored(slept.error, afterSleep);\n    }\n  }\n};\n","import { createAbortError } from '../../createAbortError';\nimport { createEmitter, createStore } from '../../store';\nimport { lazy } from '../lazy';\nimport { Result } from '../result';\n\nimport {\n  type PollContext,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  pollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollKey = readonly unknown[];\n\n/** `requesting` is the request the poll starts from, before any attempt; `polling` is the attempts. */\nexport type PollState = 'idle' | 'requesting' | 'polling' | PollResultState;\nexport type PollSnapshot<T = unknown> = PollTick<T> & { pollKey: PollKey; state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>, error: Error) => Error | undefined;\n\nexport type Poller<T, S = T> = {\n  readonly state: PollState;\n  start: () => Promise<PollResult<T>>;\n  wait: (onFailure?: OnFailure<T>) => Promise<S>;\n  stop: (reason?: string) => void;\n  subscribe: (listener: (snapshot: PollSnapshot<T>) => void) => () => void;\n  debug: () => PollSnapshot<T>;\n};\n\ntype InitRequest<R> = (signal: AbortSignal) => Promise<R>;\n\nconst isRequest = <R>(init: R | InitRequest<R> | undefined): init is InitRequest<R> =>\n  typeof init === 'function';\n\n/**\n * The loop's options plus what names the poll and what it starts from.\n *\n * - `pollKey` names the poll; the loop never sees it. Given as a function of `init`, it is what the\n *   poll started from that names it, once that is known.\n * - `init` is a value or a request for it (an enqueue), handed to `pollFn`; a request runs first.\n * - `failed` reads a `done` value for `wait`: what it returns, `wait` throws. A client that\n *   knows what gets through declares it as `Poller<T, S>` on its own return.\n */\nexport type PollerOptions<T, K extends PollKey = PollKey, R = undefined> = Omit<\n  PollOptions<T>,\n  'pollFn' | 'until'\n> & {\n  pollKey: K | ((init: R) => K);\n  init?: R | InitRequest<R>;\n  pollFn: (context: PollContext & { init: R; signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  failed?: (data: T) => Error | undefined;\n};\n\nexport type ObservedPoller = Pick<Poller<unknown>, 'stop' | 'subscribe' | 'debug' | 'start'>;\n\nexport const emitter = createEmitter<ObservedPoller>();\n\nexport const failureOf = (result: PollResult<unknown>): Error => {\n  if ('error' in result && result.error) return result.error;\n\n  if (result.state === 'aborted') {\n    if (result.reason instanceof Error) return result.reason;\n\n    return createAbortError(\n      typeof result.reason === 'string' ? result.reason : 'The poll was stopped.',\n    );\n  }\n\n  return new Error(`The poll ${result.state} after ${result.attempt} attempts.`);\n};\n\nexport const poller = <T, K extends PollKey = PollKey, R = undefined>({\n  pollKey,\n  init,\n  signal,\n  pollFn,\n  until,\n  failed,\n  ...pollLoopOptions\n}: PollerOptions<T, K, R>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  const keyOf = (from: R) => (typeof pollKey === 'function' ? pollKey(from) : pollKey);\n  // An absent `init` is the `undefined` that `R` defaults to, which the body cannot prove.\n  const givenInit = (): R => init as R;\n\n  // snapshoting; the key is unknown while a request for `init` is out, so it starts empty then\n  const snapshot = createStore<PollSnapshot<T>>({\n    pollKey: isRequest(init) ? [] : keyOf(givenInit()),\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot<T>>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (tick: PollTick<T> & { data: T }) => {\n    updateSnapshot({ attempt: tick.attempt, elapsed: tick.elapsed, last: tick.data });\n    return until(tick);\n  };\n\n  // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n  const settle = (result: PollResult<T>) => {\n    updateSnapshot({\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  };\n\n  // The request runs under the poller's signal, before the first attempt. The poll's deadline\n  // bounds the polling, not this request.\n  const requestInit = (request: InitRequest<R>) => {\n    updateSnapshot({ state: 'requesting' });\n\n    return Result.tryCatchAsync(() => {\n      anySignal.throwIfAborted();\n      return request(anySignal);\n    });\n  };\n\n  const now = () => pollLoopOptions.clock?.now() ?? performance.now();\n\n  // How a poll ends when its request did: no attempt was made, and a stop reads as an abort.\n  const endedBeforePolling = (error: Error, startedAt: number) => {\n    const before: PollTick<T> = { attempt: 0, elapsed: now() - startedAt, last: null };\n\n    return anySignal.aborted\n      ? pollResult.aborted(before, anySignal.reason)\n      : pollResult.errored(error, before);\n  };\n\n  const start = lazy(async (): Promise<PollResult<T>> => {\n    let resolved = givenInit();\n    if (isRequest(init)) {\n      const startedAt = now();\n      const requested = await requestInit(init);\n      if (!requested.success) return settle(endedBeforePolling(requested.error, startedAt));\n      resolved = requested.data;\n    }\n    updateSnapshot({ pollKey: keyOf(resolved), state: 'polling' });\n\n    return settle(\n      await pollLoop({\n        ...pollLoopOptions,\n        pollFn: (context) => pollFn({ ...context, init: resolved }),\n        until: handleUntil,\n        signal: anySignal,\n      }),\n    );\n  });\n\n  const stop = (reason?: string) => pollerSignal.abort(reason);\n  const subscribe = (listener: (snapshot: PollSnapshot<T>) => void) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug = snapshot.get;\n\n  const wait = async (onFailure?: OnFailure<T>) => {\n    const result = await start();\n    if (result.state === 'done') {\n      const error = failed?.(result.data);\n      if (!error) return result.data;\n      throw onFailure?.(result, error) ?? error;\n    }\n    const error = failureOf(result);\n    throw onFailure?.(result, error) ?? error;\n  };\n\n  const controls = {\n    stop,\n    subscribe,\n    debug,\n    start,\n  };\n\n  emitter.emit(controls);\n\n  return {\n    get state() {\n      return snapshot.get().state;\n    },\n    wait,\n    ...controls,\n  };\n};\n","import type { QueryJobStatus } from '../clients/queryService/types';\nimport type { QueueJobStatus } from '../clients/queue/types';\nimport type { StorageJobStatus } from '../clients/storage/jobs/types';\n\n/**\n * One service's statuses split by what the job is doing.\n *\n * - Groups are disjoint and cover the vocabulary; terminal = successful + failed.\n * - The annotation makes a renamed generated status fail the build here.\n */\ntype StatusGroups<Status extends string> = {\n  running: readonly Status[];\n  successful: readonly Status[];\n  failed: readonly Status[];\n};\n\n/** A service's statuses as named constants — `SUCCESS: 'success'`. */\ntype StatusNames<Status extends string> = { [K in Status as Uppercase<K>]: K };\n\n// Mirrors `StorageJobStatus` in `connection`.\nconst STORAGE: StatusGroups<StorageJobStatus> = {\n  running: ['waiting', 'processing'],\n  successful: ['success'],\n  failed: ['error'],\n};\n\n/**\n * Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.\n *\n * - `terminating` is running until `terminated`.\n * - The split mirrors the job's `isSuccess`; with a job in hand, read `job.isSuccess` instead.\n */\nconst QUEUE: StatusGroups<QueueJobStatus> = {\n  running: ['created', 'waiting', 'processing', 'terminating'],\n  successful: ['success', 'warning'],\n  failed: ['error', 'cancelled', 'terminated'],\n};\n\n// Mirrors `JobState` in `go-monorepo` (`services/query/internal/repository/models`).\n// `canceled` with one `l`, unlike the other services.\nconst QUERY: StatusGroups<QueryJobStatus> = {\n  running: ['created', 'enqueued', 'processing'],\n  successful: ['completed'],\n  failed: ['failed', 'canceled'],\n};\n\n/**\n * One service's status predicates, sets and named constants.\n *\n * - `isSuccessful` / `isFailed` are `false` while running.\n * - `isKnown` narrows an untyped string.\n * - `named` is asserted: `Object.fromEntries` can't prove the key mapping.\n */\nconst forService = <Status extends string>(groups: StatusGroups<Status>) => {\n  const all = [...groups.running, ...groups.successful, ...groups.failed];\n\n  const running: ReadonlySet<Status> = new Set(groups.running);\n  const successful: ReadonlySet<Status> = new Set(groups.successful);\n  const failed: ReadonlySet<Status> = new Set(groups.failed);\n  const terminal: ReadonlySet<Status> = new Set([...groups.successful, ...groups.failed]);\n  const known: ReadonlySet<string> = new Set<string>(all);\n\n  return {\n    isRunning: (status: Status) => running.has(status),\n    isTerminal: (status: Status) => terminal.has(status),\n    isSuccessful: (status: Status) => successful.has(status),\n    isFailed: (status: Status) => failed.has(status),\n    isKnown: (value: string): value is Status => known.has(value),\n    describe: (status: Status) => ({\n      isRunning: running.has(status),\n      isTerminal: terminal.has(status),\n      isSuccessful: successful.has(status),\n      isFailed: failed.has(status),\n    }),\n    statuses: { running, successful, failed, terminal },\n    named: Object.fromEntries(\n      all.map((status) => [status.toUpperCase(), status]),\n    ) as StatusNames<Status>,\n  };\n};\n\n/**\n * Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.\n *\n * - Never merge services: labels overlap but their meaning differs.\n * - `query` covers the query job, not its statements (which have `notExecuted`).\n */\nexport const jobStatus = {\n  storage: forService(STORAGE),\n  queue: forService(QUEUE),\n  query: forService(QUERY),\n};\n","import { isApiError } from '../fetchClient';\n\nconst MAX_CONSECUTIVE_FAILURES = 5;\n\n// A read that failed in transit, or that the service answered with a 5xx or 429. The job runs\n// server-side either way, so a later read can still see it finish.\nconst isTransient = (error: Error) =>\n  error instanceof TypeError ||\n  (isApiError(error) && (error.response.status >= 500 || error.response.status === 429));\n\n/** A job poll's retry rule: a transient read is retried up to five times in a row; one that succeeds resets the count. */\nexport const transientRetries = () => {\n  let failures = 0;\n\n  return {\n    reset: () => {\n      failures = 0;\n    },\n    isRetryable: (error: Error) => isTransient(error) && ++failures < MAX_CONSECUTIVE_FAILURES,\n  };\n};\n"],"mappings":";;;;AAEA,MAAa,SAAS,SAAiB,WACrC,IAAI,SAAe,SAAS,WAAW;CACrC,IAAI,QAAQ,SAAS,OAAO,OAAO,iBAAiB,OAAO,MAAM,CAAC;CAElE,MAAM,gBAAgB;EACpB,aAAa,SAAS;EACtB,OAAO,iBAAiB,QAAQ,MAAM,CAAC;CACzC;CAKA,MAAM,YAAY,iBAAiB;EACjC,QAAQ,oBAAoB,SAAS,OAAO;EAC5C,QAAQ;CACV,GAAG,OAAO;CAEV,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,CAAC;;;;;;;;;ACZH,MAAa,QAAW,SAAiD;CACvE,IAAI,QAAoC;CAGxC,MAAM,UAAU,YAAiC,MAAM,KAAK;CAE5D,aAAa;EACX,UAAU,QAAQ,CAAC,CAAC,OAAO,UAAmB;GAC5C,QAAQ;GACR,MAAM;EACR,CAAC;EACD,OAAO;CACT;AACF;;;ACbA,MAAa,WAAW,WACtB,kBAAkB,QAAQ,SAAS,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AAEhF,MAAM,WAAc,UAA+B;CAAE,SAAS;CAAM;AAAK;AACzE,MAAM,WAA4B,WAAgC;CAAE,SAAS;CAAO;AAAM;AAC1F,MAAM,aAAiC,WACrC,OAAO;AACT,MAAM,aAAiC,WACrC,CAAC,OAAO;AAEV,MAAM,OAA8B,QAAsB,OACxD,OAAO,UAAU,QAAQ,GAAG,OAAO,IAAI,CAAC,IAAI;AAE9C,MAAM,YACJ,QACA,OACkB,OAAO,UAAU,SAAS,QAAQ,GAAG,OAAO,KAAK,CAAC;AAEtE,MAAM,WACJ,QACA,OACsB,OAAO,UAAU,GAAG,OAAO,IAAI,IAAI;AAE3D,MAAM,SACJ,QACA,WACA,cACO,OAAO,UAAU,UAAU,OAAO,IAAI,IAAI,UAAU,OAAO,KAAK;AAGzE,MAAM,OAA2B,QAAsB,OAAwC;CAC7F,IAAI,OAAO,SAAS,GAAG,OAAO,IAAI;CAClC,OAAO;AACT;AAEA,MAAM,UAA8B,WAA4B;CAC9D,IAAI,OAAO,SAAS,OAAO,OAAO;CAClC,MAAM,OAAO;AACf;AAEA,MAAM,YAAmC,QAAsB,aAC7D,OAAO,UAAU,OAAO,OAAO;AAEjC,MAAM,YAAe,SAAyC;CAC5D,IAAI;EACF,OAAO,QAAQ,KAAK,CAAC;CACvB,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,gBAAgB,OAAU,SAAuD;CACrF,IAAI;EACF,OAAO,QAAQ,MAAM,KAAK,CAAC;CAC7B,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,iBACqB,QACxB,GAAG,SACF,eAAe,GAAG,GAAG,IAAI,CAAC;AAE9B,MAAM,sBACqB,QACxB,GAAG,SACF,oBAAoB,GAAG,GAAG,IAAI,CAAC;AAEnC,MAAa,SAAS;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;ACtFA,MAAa,kBAAkB,KAAK,KAAK;AAEzC,MAAa,SAAS,OAAe,KAAa,MAAM,aACtD,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAEpC,MAAa,YAAY,OAAe,aACtC,OAAO,SAAS,KAAK,IAAI,QAAQ;;AAGnC,MAAa,oBAAoB,IAAI,gBAAgB,CAAC,CAAC;;;ACMvD,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,eAAe;AAErB,MAAa,iBAAiB,EAC5B,SAAS,QACT,aAAa,eAAe,iBAC5B,SAAS,KAAK,QACd,GAAG,cACwB;CAC3B,MAAM,aAAwB,YAAY;EACxC,IAAI,QAAQ,SAAS,UAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFD,MAAM,SAAS,QAAQ,MAAM,QAAQ,GAAG,QAEhC,KAAK,UAAU;EAEtC,IAAI,QAAQ,SAAS,eAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFC,MAAM,SAAS,QAAQ,UAAU,YAAY,UAAU,GAAG,UAElD,MAAM,UAAU;EAGzC,OAAO,MAAM,SAAS,QAAQ,UAAU,YAAY,GAAG,YAAY;CACrE;CAEA,MAAM,YAAsB,UAAU;EACpC,IAAI,WAAW,QAAQ,OAAO;EAC9B,IAAI,WAAW,QAAQ,OAAO,QAAQ,OAAO;EAC7C,OAAO,QAAQ,IAAK,QAAQ,IAAK,OAAO;CAC1C;CAEA,MAAM,cAAc,MAAM,SAAS,cAAc,eAAe,GAAG,cAAc,eAAe;CAChG,QAAQ,aAAa;EACnB,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC;EAC1D,MAAM,SAAS,KAAK,IAAI,UAAU,OAAO,GAAG,WAAW;EAGvD,OAAO,MAAM,SAAS,SAAS,MAAM,GAAG,YAAY,GAAG,cAAc,WAAW;CAClF;AACF;;;;ACtBA,MAAa,aAAa;CACxB,OAAU,MAAS,aAAyC;EAC1D,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAa,OAAc,aAAyC;EAClE,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAe,SAAsB,WAAkC;EACrE,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAc,SAAsB,WAAkC;EACpE,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAa,SAAsB,YAAoC;EACrE,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAU,EAChC,QAAQ,SACR,OAAO,QACP,QAAQ,eAAe,YAAY,GACnC,SAAS,aAAa;CAAE,MAAM;CAAY,UAAU;AAAK,GACzD,QAAQ;CAAE,OAAO,IAAI,WAAW,MAAM,IAAI,MAAM;CAAG,WAAW,YAAY,IAAI;AAAE,GAChF,aAAa,qBAAqB,OAClC,aAAa,eAAe,UAC5B,SAAS,WAAW,eACwB;CAG5C,MAAM,YAAY,SAAS,UAAU,QAAQ;CAC7C,MAAM,UAAU,cAAc,WAAW,WAAW,MAAM,WAAW,GAAG,eAAe;CACvF,MAAM,cAAc,KAAK,MAAM,MAAM,SAAS,cAAc,QAAQ,GAAG,CAAC,CAAC;CAEzE,MAAM,gBAAgB,YAAY,WAAW,YAAY,IAAI,YAAY,QAAQ,OAAO;CACxF,MAAM,YAAY,YAAY,IAAI,CAAC,cAAc,aAAa,CAAC;CAC/D,MAAM,aAAa,QAAQ,cAAqB;CAEhD,UAAU,iBAAiB,eAAe,WAAW,OAAO,UAAU,MAAM,GAAG,EAC7E,MAAM,KACR,CAAC;CACD,WAAgB,QAAQ,YAAY,KAAA,CAAS;CAE7C,MAAM,YAAY,cAAc,UAAU;CAC1C,MAAM,YAAY,MAAM,IAAI;CAE5B,MAAM,QAAQ,OAAO,cAAc,MAAM;CACzC,MAAM,cAAc,OAAO,cAAc,YAAY;CAErD,MAAM,UAAU,EAAE,SAAS,IAAI,cAC7B,OAAO,oBACL,QAAQ,KAAK,CAAC,QAAQ;EAAE,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GAAG,WAAW,OAAO,CAAC,CACzF;CACF,MAAM,QAAQ,OAAO,oBAAoB,OAAe,MAAM,KAAK,IAAI,SAAS,CAAC;CAEjF,IAAI,UAAU;CAEd,IAAI,OAAiB;CACrB,IAAI;CACJ,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI,eAA4B;EAC9D;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAa,QAAQ,CAAC;CAEpE,OAAO,MAAM;EACX,MAAM,SAAS,QAAQ;EACvB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,QAAQ,SAAS;EACvE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,QAAQ,aAAa,MAAM;EAE/E;EAEA,MAAM,OAAO,MAAM,OAAO;GAAE,GAAG;GAAQ;EAAQ,CAAC;EAKhD,IAAI,KAAK,SAAS,OAAO,KAAK;OACzB,YAAY,KAAK;EAEtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EACtE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,OAAO,aAAa,MAAM;EAE9E,IAAI,CAAC,KAAK,SAAS;GACjB,MAAM,WAAW,YAAY,KAAK,KAAK;GAIvC,IAAI,CAAC,SAAS,SAAS;IACrB,KAAK,MAAM,UAAU,SAAS;IAC9B,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;GAC7C;GACA,IAAI,CAAC,SAAS,MAAM,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;EACjE;EAEA,IAAI,KAAK,SAAS;GAChB,MAAM,SAAS,MAAM;IAAE,GAAG;IAAO,MAAM,KAAK;GAAK,CAAC;GAClD,IAAI,CAAC,OAAO,SAAS,OAAO,WAAW,QAAQ,OAAO,OAAO,KAAK;GAClE,IAAI,OAAO,MAAM,OAAO,WAAW,KAAK,KAAK,MAAM,KAAK;EAC1D;EAGA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAU,OAAO,SAAS;EAGxE,MAAM,UAAU,UAAU,OAAO;EACjC,IAAI,MAAM,UAAU,WAAW,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EAEnF,MAAM,QAAQ,MAAM,MAAM,OAAO;EACjC,IAAI,CAAC,MAAM,SAAS;GAClB,MAAM,aAAa,QAAQ;GAC3B,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,YAAY,SAAS;GAC3E,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,YAAY,aAAa,MAAM;GAEnF,OAAO,WAAW,QAAQ,MAAM,OAAO,UAAU;EACnD;CACF;AACF;;;ACzIA,MAAM,aAAgB,SACpB,OAAO,SAAS;AAwBlB,MAAa,UAAU,cAA8B;AAErD,MAAa,aAAa,WAAuC;CAC/D,IAAI,WAAW,UAAU,OAAO,OAAO,OAAO,OAAO;CAErD,IAAI,OAAO,UAAU,WAAW;EAC9B,IAAI,OAAO,kBAAkB,OAAO,OAAO,OAAO;EAElD,OAAO,iBACL,OAAO,OAAO,WAAW,WAAW,OAAO,SAAS,uBACtD;CACF;CAEA,uBAAO,IAAI,MAAM,YAAY,OAAO,MAAM,SAAS,OAAO,QAAQ,WAAW;AAC/E;AAEA,MAAa,UAAyD,EACpE,SACA,MACA,QACA,QACA,OACA,QACA,GAAG,sBACoC;CACvC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAErE,MAAM,SAAS,SAAa,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;CAE5E,MAAM,kBAAqB;CAG3B,MAAM,WAAW,YAA6B;EAC5C,SAAS,UAAU,IAAI,IAAI,CAAC,IAAI,MAAM,UAAU,CAAC;EACjD,OAAO;EACP,SAAS;EACT,SAAS;EACT,MAAM;CACR,CAAC;CACD,MAAM,kBAAkB,SACtB,SAAS,IAAI;EAAE,GAAG,SAAS,IAAI;EAAG,GAAG;CAAK,CAAC;CAE7C,MAAM,eAAe,SAAoC;EACvD,eAAe;GAAE,SAAS,KAAK;GAAS,SAAS,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;EAChF,OAAO,MAAM,IAAI;CACnB;CAGA,MAAM,UAAU,WAA0B;EACxC,eAAe;GACb,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT;CAIA,MAAM,eAAe,YAA4B;EAC/C,eAAe,EAAE,OAAO,aAAa,CAAC;EAEtC,OAAO,OAAO,oBAAoB;GAChC,UAAU,eAAe;GACzB,OAAO,QAAQ,SAAS;EAC1B,CAAC;CACH;CAEA,MAAM,YAAY,gBAAgB,OAAO,IAAI,KAAK,YAAY,IAAI;CAGlE,MAAM,sBAAsB,OAAc,cAAsB;EAC9D,MAAM,SAAsB;GAAE,SAAS;GAAG,SAAS,IAAI,IAAI;GAAW,MAAM;EAAK;EAEjF,OAAO,UAAU,UACb,WAAW,QAAQ,QAAQ,UAAU,MAAM,IAC3C,WAAW,QAAQ,OAAO,MAAM;CACtC;CAEA,MAAM,QAAQ,KAAK,YAAoC;EACrD,IAAI,WAAW,UAAU;EACzB,IAAI,UAAU,IAAI,GAAG;GACnB,MAAM,YAAY,IAAI;GACtB,MAAM,YAAY,MAAM,YAAY,IAAI;GACxC,IAAI,CAAC,UAAU,SAAS,OAAO,OAAO,mBAAmB,UAAU,OAAO,SAAS,CAAC;GACpF,WAAW,UAAU;EACvB;EACA,eAAe;GAAE,SAAS,MAAM,QAAQ;GAAG,OAAO;EAAU,CAAC;EAE7D,OAAO,OACL,MAAM,SAAS;GACb,GAAG;GACH,SAAS,YAAY,OAAO;IAAE,GAAG;IAAS,MAAM;GAAS,CAAC;GAC1D,OAAO;GACP,QAAQ;EACV,CAAC,CACH;CACF,CAAC;CAED,MAAM,QAAQ,WAAoB,aAAa,MAAM,MAAM;CAC3D,MAAM,aAAa,aACjB,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAO,OAAO,cAA6B;EAC/C,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ;GAC3B,MAAM,QAAQ,SAAS,OAAO,IAAI;GAClC,IAAI,CAAC,OAAO,OAAO,OAAO;GAC1B,MAAM,YAAY,QAAQ,KAAK,KAAK;EACtC;EACA,MAAM,QAAQ,UAAU,MAAM;EAC9B,MAAM,YAAY,QAAQ,KAAK,KAAK;CACtC;CAEA,MAAM,WAAW;EACf;EACA;EACA;EACA;CACF;CAEA,QAAQ,KAAK,QAAQ;CAErB,OAAO;EACL,IAAI,QAAQ;GACV,OAAO,SAAS,IAAI,CAAC,CAAC;EACxB;EACA;EACA,GAAG;CACL;AACF;;;AC9KA,MAAM,UAA0C;CAC9C,SAAS,CAAC,WAAW,YAAY;CACjC,YAAY,CAAC,SAAS;CACtB,QAAQ,CAAC,OAAO;AAClB;;;;;;;AAQA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAW;EAAc;CAAa;CAC3D,YAAY,CAAC,WAAW,SAAS;CACjC,QAAQ;EAAC;EAAS;EAAa;CAAY;AAC7C;AAIA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAY;CAAY;CAC7C,YAAY,CAAC,WAAW;CACxB,QAAQ,CAAC,UAAU,UAAU;AAC/B;;;;;;;;AASA,MAAM,cAAqC,WAAiC;CAC1E,MAAM,MAAM;EAAC,GAAG,OAAO;EAAS,GAAG,OAAO;EAAY,GAAG,OAAO;CAAM;CAEtE,MAAM,UAA+B,IAAI,IAAI,OAAO,OAAO;CAC3D,MAAM,aAAkC,IAAI,IAAI,OAAO,UAAU;CACjE,MAAM,SAA8B,IAAI,IAAI,OAAO,MAAM;CACzD,MAAM,2BAAgC,IAAI,IAAI,CAAC,GAAG,OAAO,YAAY,GAAG,OAAO,MAAM,CAAC;CACtF,MAAM,QAA6B,IAAI,IAAY,GAAG;CAEtD,OAAO;EACL,YAAY,WAAmB,QAAQ,IAAI,MAAM;EACjD,aAAa,WAAmB,SAAS,IAAI,MAAM;EACnD,eAAe,WAAmB,WAAW,IAAI,MAAM;EACvD,WAAW,WAAmB,OAAO,IAAI,MAAM;EAC/C,UAAU,UAAmC,MAAM,IAAI,KAAK;EAC5D,WAAW,YAAoB;GAC7B,WAAW,QAAQ,IAAI,MAAM;GAC7B,YAAY,SAAS,IAAI,MAAM;GAC/B,cAAc,WAAW,IAAI,MAAM;GACnC,UAAU,OAAO,IAAI,MAAM;EAC7B;EACA,UAAU;GAAE;GAAS;GAAY;GAAQ;EAAS;EAClD,OAAO,OAAO,YACZ,IAAI,KAAK,WAAW,CAAC,OAAO,YAAY,GAAG,MAAM,CAAC,CACpD;CACF;AACF;;;;;;;AAQA,MAAa,YAAY;CACvB,SAAS,WAAW,OAAO;CAC3B,OAAO,WAAW,KAAK;CACvB,OAAO,WAAW,KAAK;AACzB;;;ACzFA,MAAM,2BAA2B;AAIjC,MAAM,eAAe,UACnB,iBAAiB,aAChB,WAAW,KAAK,MAAM,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,WAAW;;AAGnF,MAAa,yBAAyB;CACpC,IAAI,WAAW;CAEf,OAAO;EACL,aAAa;GACX,WAAW;EACb;EACA,cAAc,UAAiB,YAAY,KAAK,KAAK,EAAE,WAAW;CACpE;AACF"}
+{"version":3,"file":"transientRetries-BKqmb85B.js","names":[],"sources":["../src/utils/async/delay.ts","../src/utils/async/lazy.ts","../src/utils/async/result.ts","../src/utils/async/poll/utils.ts","../src/utils/async/poll/backoff.ts","../src/utils/async/poll/pollLoop.ts","../src/utils/async/poll/poll.ts","../src/domain/jobStatus.ts","../src/clients/transientRetries.ts"],"sourcesContent":["import { createAbortError } from '../createAbortError';\n\nexport const delay = (timeout: number, signal?: AbortSignal) =>\n  new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) return reject(createAbortError(signal.reason));\n\n    const onAbort = () => {\n      clearTimeout(timeoutId);\n      reject(createAbortError(signal?.reason));\n    };\n\n    // `once: true` only detaches the listener once the event fires, so the timeout path has to\n    // detach it explicitly — a caller reusing one signal across many delays (`poll` does) would\n    // otherwise pile up a listener per delay for as long as the signal is alive.\n    const timeoutId = setTimeout(() => {\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    }, timeout);\n\n    signal?.addEventListener('abort', onAbort, { once: true });\n  });\n","import type { TaskFn } from './types';\n\n/**\n * Runs `task` once and replays its promise to every later caller.\n *\n * - A rejection is not cached: the next call retries, so a transient failure never sticks.\n * - Callers that joined the failed run reject with its error.\n */\nexport const lazy = <T>(task: TaskFn<T>): (() => Promise<Awaited<T>>) => {\n  let value: Promise<Awaited<T>> | null = null;\n\n  // async wrapper so a synchronous throw from `task` rejects rather than throws.\n  const runTask = async (): Promise<Awaited<T>> => await task();\n\n  return () => {\n    value ??= runTask().catch((error: unknown) => {\n      value = null;\n      throw error;\n    });\n    return value;\n  };\n};\n","export type Success<T> = { success: true; data: T };\nexport type Failure<E extends Error> = { success: false; error: E };\nexport type Result<T, E extends Error = Error> = Success<T> | Failure<E>;\n\n// A task that returns a promise is a type error: the wrapper would report success before it\n// settles, and the rejection would go unhandled. Use the `*Async` sibling.\ntype NotPromise<T> = T extends PromiseLike<unknown> ? never : T;\n\nexport const asError = (thrown: unknown) =>\n  thrown instanceof Error ? thrown : new Error(String(thrown), { cause: thrown });\n\nconst success = <T>(data: T): Result<T, never> => ({ success: true, data });\nconst failure = <E extends Error>(error: E): Result<never, E> => ({ success: false, error });\nconst isSuccess = <T, E extends Error>(result: Result<T, E>): result is Success<T> =>\n  result.success;\nconst isFailure = <T, E extends Error>(result: Result<T, E>): result is Failure<E> =>\n  !result.success;\n\nconst map = <T, E extends Error, U>(result: Result<T, E>, fn: (data: T) => U): Result<U, E> =>\n  result.success ? success(fn(result.data)) : result;\n\nconst mapError = <T, E extends Error, F extends Error>(\n  result: Result<T, E>,\n  fn: (error: E) => F,\n): Result<T, F> => (result.success ? result : failure(fn(result.error)));\n\nconst andThen = <T, E extends Error, U, F extends Error>(\n  result: Result<T, E>,\n  fn: (data: T) => Result<U, F>,\n): Result<U, E | F> => (result.success ? fn(result.data) : result);\n\nconst match = <T, E extends Error, R>(\n  result: Result<T, E>,\n  onSuccess: (data: T) => R,\n  onFailure: (error: E) => R,\n): R => (result.success ? onSuccess(result.data) : onFailure(result.error));\n\n// A side effect on a success; the result itself passes through untouched, same instance.\nconst tap = <T, E extends Error>(result: Result<T, E>, fn: (data: T) => void): Result<T, E> => {\n  if (result.success) fn(result.data);\n  return result;\n};\n\nconst unwrap = <T, E extends Error>(result: Result<T, E>): T => {\n  if (result.success) return result.data;\n  throw result.error;\n};\n\nconst unwrapOr = <T, E extends Error, U>(result: Result<T, E>, fallback: U): T | U =>\n  result.success ? result.data : fallback;\n\nconst tryCatch = <T>(task: () => NotPromise<T>): Result<T> => {\n  try {\n    return success(task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst tryCatchAsync = async <T>(task: () => T | PromiseLike<T>): Promise<Result<T>> => {\n  try {\n    return success(await task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst fromThrowable =\n  <A extends unknown[], R>(fn: (...args: A) => NotPromise<R>) =>\n  (...args: A): Result<R> =>\n    tryCatch(() => fn(...args));\n\nconst fromThrowableAsync =\n  <A extends unknown[], R>(fn: (...args: A) => R | PromiseLike<R>) =>\n  (...args: A): Promise<Result<R>> =>\n    tryCatchAsync(() => fn(...args));\n\nexport const Result = {\n  success,\n  failure,\n  isSuccess,\n  isFailure,\n  map,\n  mapError,\n  andThen,\n  match,\n  tap,\n  unwrap,\n  unwrapOr,\n  tryCatch,\n  tryCatchAsync,\n  fromThrowable,\n  fromThrowableAsync,\n};\n","/**\n * The longest delay a timer can hold: `setTimeout` takes a 32-bit signed number of milliseconds,\n * about 24.9 days.\n *\n * - Above it the delay wraps: Node warns and fires after 1 ms, so a long wait becomes a busy loop.\n * - It bounds a backoff curve and a poll's timeout alike, since both end up in a timer.\n */\nexport const MAX_TIMER_DELAY = 2 ** 31 - 1;\n\nexport const clamp = (value: number, min: number, max = Infinity) =>\n  Math.min(Math.max(value, min), max);\n\nexport const finiteOr = (value: number, fallback: number) =>\n  Number.isFinite(value) ? value : fallback;\n\n/** A signal that never aborts, so an input nobody gave costs no branch of its own. */\nexport const neverAborts = () => new AbortController().signal;\n","import { clamp, finiteOr, MAX_TIMER_DELAY } from './utils';\n\nexport type Jitter =\n  | 'none' // delay\n  | 'full' // [0, delay)\n  | 'equal'; // [delay / 2, delay)\n\ntype Backoff =\n  | { type: 'constant'; interval: number } //   3000, 3000, 3000, ...\n  | { type: 'linear'; initialInterval: number; step: number } // 1000, 2000, 3000, …\n  | { type: 'exponential'; initialInterval: number; factor?: number }; // 1000, 2000, 4000, 8000, …\n\ntype RandomFn = () => number;\ntype JitterFn = (delay: number) => number;\ntype BackoffFn = (attempt: number) => number;\n\nexport type BackoffDef = {\n  jitter?: Jitter;\n  maxInterval?: number;\n  random?: RandomFn;\n} & Backoff;\n\nconst MIN_STEP = 500;\nconst MIN_FACTOR = 2;\nconst MIN_INTERVAL = 500;\n\nexport const createBackoff = ({\n  jitter = 'none',\n  maxInterval: _maxInterval = MAX_TIMER_DELAY,\n  random = Math.random,\n  ...backoff\n}: BackoffDef): BackoffFn => {\n  const backoffFn: BackoffFn = (attempt) => {\n    if (backoff.type === 'linear') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const step = clamp(finiteOr(backoff.step, MIN_STEP), MIN_STEP);\n\n      return interval + step * (attempt - 1);\n    }\n    if (backoff.type === 'exponential') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const factor = clamp(finiteOr(backoff.factor ?? MIN_FACTOR, MIN_FACTOR), MIN_FACTOR);\n\n      return interval * factor ** (attempt - 1);\n    }\n\n    return clamp(finiteOr(backoff.interval, MIN_INTERVAL), MIN_INTERVAL);\n  };\n\n  const jitterFn: JitterFn = (delay) => {\n    if (jitter === 'none') return delay;\n    if (jitter === 'full') return delay * random();\n    return delay / 2 + (delay / 2) * random(); // equal\n  };\n\n  const maxInterval = clamp(finiteOr(_maxInterval, MAX_TIMER_DELAY), MIN_INTERVAL, MAX_TIMER_DELAY);\n  return (_attempt) => {\n    const attempt = clamp(finiteOr(Math.trunc(_attempt), 1), 1);\n    const capped = Math.min(backoffFn(attempt), maxInterval);\n    // Floored after the jitter, not before: `full` jitter multiplies by a random fraction, so a floor\n    // applied to the curve alone leaves sub-millisecond gaps between attempts.\n    return clamp(finiteOr(jitterFn(capped), MIN_INTERVAL), MIN_INTERVAL, maxInterval);\n  };\n};\n","import { delay } from '../delay';\nimport { Result } from '../result';\n\nimport { type BackoffDef, createBackoff } from './backoff';\nimport { clamp, finiteOr, MAX_TIMER_DELAY, neverAborts } from './utils';\n\ntype Clock = {\n  wait: (ms: number, signal?: AbortSignal) => Promise<void>;\n  now: () => number;\n};\n\nexport type PollContext = {\n  attempt: number;\n  elapsed: number;\n};\n\n/** The context plus the answer it is about: what `until` decides on, and what an ending reports. */\nexport type PollTick<T> = PollContext & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T> = PollTick<T> &\n  (\n    | { state: 'done'; data: T }\n    | { state: 'timedOut' | 'exhausted'; error?: Error }\n    | { state: 'aborted'; reason?: unknown }\n    | { state: 'errored'; error: Error }\n  );\n\nexport type PollOptions<T> = {\n  pollFn: (context: PollContext & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  signal?: AbortSignal;\n  backoff?: BackoffDef;\n  isRetryable?: (error: Error) => boolean;\n  maxAttempts?: number;\n  timeout?: number;\n  clock?: Clock;\n};\n\n/** One constructor per ending, so a result is built the same way wherever a poll ends. */\nexport const pollResult = {\n  done: <T>(data: T, context: PollTick<T>): PollResult<T> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T>(error: Error, context: PollTick<T>): PollResult<T> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T>(context: PollTick<T>, reason: unknown): PollResult<T> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T>({\n  pollFn: _pollFn,\n  until: _until,\n  signal: callerSignal = neverAborts(),\n  backoff: backoffDef = { type: 'constant', interval: 3000 },\n  clock = { wait: (ms, signal) => delay(ms, signal), now: () => performance.now() },\n  isRetryable: _isRetryable = () => false,\n  maxAttempts: _maxAttempts = Infinity,\n  timeout: _timeout = Infinity,\n}: PollOptions<T>): Promise<PollResult<T>> => {\n  // A deadline ends up in a timer, so a finite one is bounded by what a timer can hold. `Infinity`\n  // is answered before the clamp: it means no deadline, and clamping would make it the longest one.\n  const requested = finiteOr(_timeout, Infinity);\n  const timeout = requested === Infinity ? Infinity : clamp(requested, 0, MAX_TIMER_DELAY);\n  const maxAttempts = Math.trunc(clamp(finiteOr(_maxAttempts, Infinity), 0));\n\n  const timeoutSignal = timeout === Infinity ? neverAborts() : AbortSignal.timeout(timeout);\n  const anySignal = AbortSignal.any([callerSignal, timeoutSignal]);\n  const anyAborted = Promise.withResolvers<never>();\n\n  anySignal.addEventListener('abort', () => anyAborted.reject(anySignal.reason), {\n    once: true,\n  });\n  void anyAborted.promise.catch(() => undefined);\n\n  const backoffFn = createBackoff(backoffDef);\n  const startedAt = clock.now();\n\n  const until = Result.fromThrowable(_until);\n  const isRetryable = Result.fromThrowable(_isRetryable);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ attempt: at, elapsed }: PollContext) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([_pollFn({ attempt: at, elapsed, signal: anySignal }), anyAborted.promise]),\n    );\n  const sleep = Result.fromThrowableAsync((ms: number) => clock.wait(ms, anySignal));\n\n  let attempt = 0;\n  // What a retry swallowed: the poll carries it to whichever ending runs out first.\n  let last: T | null = null;\n  let lastError: Error | undefined;\n  const context = (at = clock.now() - startedAt): PollTick<T> => ({\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T>(context());\n\n  while (true) {\n    const before = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(before, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(before, callerSignal.reason);\n\n    attempt++;\n    // The attempt it is, not the one before it — `before` was read to decide whether to make it.\n    const poll = await pollFn({ ...before, attempt });\n\n    // What the attempt produced, recorded before the tick that reports it: on any ending but `done`\n    // these two are the only account of what the poll saw, and reading them one attempt behind is\n    // reading the wrong answer.\n    if (poll.success) last = poll.data;\n    else lastError = poll.error;\n\n    const after = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(after, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(after, callerSignal.reason);\n\n    if (!poll.success) {\n      const canRetry = isRetryable(poll.error);\n\n      // A predicate that throws cannot ask for a retry. The request's own failure stays the reported\n      // one — it is the type a caller's guards expect — and the predicate's rides along as its cause.\n      if (!canRetry.success) {\n        poll.error.cause ??= canRetry.error;\n        return pollResult.errored(poll.error, after);\n      }\n      if (!canRetry.data) return pollResult.errored(poll.error, after);\n    }\n\n    if (poll.success) {\n      const isDone = until({ ...after, data: poll.data });\n      if (!isDone.success) return pollResult.errored(isDone.error, after);\n      if (isDone.data) return pollResult.done(poll.data, after);\n    }\n\n    // exhausted\n    if (attempt >= maxAttempts) return pollResult.exhausted(after, lastError);\n\n    // sleep\n    const backoff = backoffFn(attempt);\n    if (after.elapsed + backoff >= timeout) return pollResult.timedOut(after, lastError);\n\n    const slept = await sleep(backoff);\n    if (!slept.success) {\n      const afterSleep = context();\n      if (timeoutSignal.aborted) return pollResult.timedOut(afterSleep, lastError);\n      if (callerSignal.aborted) return pollResult.aborted(afterSleep, callerSignal.reason);\n\n      return pollResult.errored(slept.error, afterSleep);\n    }\n  }\n};\n","import { createAbortError } from '../../createAbortError';\nimport { createEmitter, createStore } from '../../store';\nimport { lazy } from '../lazy';\nimport { Result } from '../result';\n\nimport {\n  type PollContext,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  pollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollKey = readonly unknown[];\n\n/** `requesting` is the request the poll starts from, before any attempt; `polling` is the attempts. */\nexport type PollState = 'idle' | 'requesting' | 'polling' | PollResultState;\nexport type PollSnapshot<T = unknown> = PollTick<T> & { pollKey: PollKey; state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>, error: Error) => Error | undefined;\n\nexport type Poller<T, S = T> = {\n  readonly state: PollState;\n  start: () => Promise<PollResult<T>>;\n  wait: (onFailure?: OnFailure<T>) => Promise<S>;\n  stop: (reason?: string) => void;\n  subscribe: (listener: (snapshot: PollSnapshot<T>) => void) => () => void;\n  debug: () => PollSnapshot<T>;\n};\n\ntype InitRequest<R> = (signal: AbortSignal) => Promise<R>;\n\nconst isRequest = <R>(init: R | InitRequest<R> | undefined): init is InitRequest<R> =>\n  typeof init === 'function';\n\n/**\n * The loop's options plus what names the poll and what it starts from.\n *\n * - `pollKey` names the poll; the loop never sees it. Given as a function of `init`, it is what the\n *   poll started from that names it, once that is known.\n * - `init` is a value or a request for it (an enqueue), handed to `pollFn`; a request runs first.\n * - `failed` reads a `done` value for `wait`: what it returns, `wait` throws. A client that\n *   knows what gets through declares it as `Poller<T, S>` on its own return.\n */\nexport type PollerOptions<T, K extends PollKey = PollKey, R = undefined> = Omit<\n  PollOptions<T>,\n  'pollFn' | 'until'\n> & {\n  pollKey: K | ((init: R) => K);\n  init?: R | InitRequest<R>;\n  pollFn: (context: PollContext & { init: R; signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  failed?: (data: T) => Error | undefined;\n};\n\nexport type ObservedPoller = Pick<Poller<unknown>, 'stop' | 'subscribe' | 'debug' | 'start'>;\n\nexport const emitter = createEmitter<ObservedPoller>();\n\nexport const failureOf = (result: PollResult<unknown>): Error => {\n  if ('error' in result && result.error) return result.error;\n\n  if (result.state === 'aborted') {\n    if (result.reason instanceof Error) return result.reason;\n\n    return createAbortError(\n      typeof result.reason === 'string' ? result.reason : 'The poll was stopped.',\n    );\n  }\n\n  return new Error(`The poll ${result.state} after ${result.attempt} attempts.`);\n};\n\nexport const poller = <T, K extends PollKey = PollKey, R = undefined>({\n  pollKey,\n  init,\n  signal,\n  pollFn,\n  until,\n  failed,\n  ...pollLoopOptions\n}: PollerOptions<T, K, R>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  const keyOf = (from: R) => (typeof pollKey === 'function' ? pollKey(from) : pollKey);\n  // An absent `init` is the `undefined` that `R` defaults to, which the body cannot prove.\n  const givenInit = (): R => init as R;\n\n  // snapshoting; the key is unknown while a request for `init` is out, so it starts empty then\n  const snapshot = createStore<PollSnapshot<T>>({\n    pollKey: isRequest(init) ? [] : keyOf(givenInit()),\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot<T>>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (tick: PollTick<T> & { data: T }) => {\n    updateSnapshot({ attempt: tick.attempt, elapsed: tick.elapsed, last: tick.data });\n    return until(tick);\n  };\n\n  // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n  const settle = (result: PollResult<T>) => {\n    updateSnapshot({\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  };\n\n  // The request runs under the poller's signal, before the first attempt. The poll's deadline\n  // bounds the polling, not this request.\n  const requestInit = (request: InitRequest<R>) => {\n    updateSnapshot({ state: 'requesting' });\n\n    return Result.tryCatchAsync(() => {\n      anySignal.throwIfAborted();\n      return request(anySignal);\n    });\n  };\n\n  const now = () => pollLoopOptions.clock?.now() ?? performance.now();\n\n  // How a poll ends when its request did: no attempt was made, and a stop reads as an abort.\n  const endedBeforePolling = (error: Error, startedAt: number) => {\n    const before: PollTick<T> = { attempt: 0, elapsed: now() - startedAt, last: null };\n\n    return anySignal.aborted\n      ? pollResult.aborted(before, anySignal.reason)\n      : pollResult.errored(error, before);\n  };\n\n  const start = lazy(async (): Promise<PollResult<T>> => {\n    let resolved = givenInit();\n    if (isRequest(init)) {\n      const startedAt = now();\n      const requested = await requestInit(init);\n      if (!requested.success) return settle(endedBeforePolling(requested.error, startedAt));\n      resolved = requested.data;\n    }\n    updateSnapshot({ pollKey: keyOf(resolved), state: 'polling' });\n\n    return settle(\n      await pollLoop({\n        ...pollLoopOptions,\n        pollFn: (context) => pollFn({ ...context, init: resolved }),\n        until: handleUntil,\n        signal: anySignal,\n      }),\n    );\n  });\n\n  const stop = (reason?: string) => pollerSignal.abort(reason);\n  const subscribe = (listener: (snapshot: PollSnapshot<T>) => void) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug = snapshot.get;\n\n  const wait = async (onFailure?: OnFailure<T>) => {\n    const result = await start();\n    if (result.state === 'done') {\n      const error = failed?.(result.data);\n      if (!error) return result.data;\n      throw onFailure?.(result, error) ?? error;\n    }\n    const error = failureOf(result);\n    throw onFailure?.(result, error) ?? error;\n  };\n\n  const controls = {\n    stop,\n    subscribe,\n    debug,\n    start,\n  };\n\n  emitter.emit(controls);\n\n  return {\n    get state() {\n      return snapshot.get().state;\n    },\n    wait,\n    ...controls,\n  };\n};\n","import type { QueryJobStatus } from '../clients/queryService/types';\nimport type { QueueJobStatus } from '../clients/queue/types';\nimport type { StorageJobStatus } from '../clients/storage/jobs/types';\n\n/**\n * One service's statuses split by what the job is doing.\n *\n * - Groups are disjoint and cover the vocabulary; terminal = successful + failed.\n * - The annotation makes a renamed generated status fail the build here.\n */\ntype StatusGroups<Status extends string> = {\n  running: readonly Status[];\n  successful: readonly Status[];\n  failed: readonly Status[];\n};\n\n/** A service's statuses as named constants — `SUCCESS: 'success'`. */\ntype StatusNames<Status extends string> = { [K in Status as Uppercase<K>]: K };\n\n// Mirrors `StorageJobStatus` in `connection`.\nconst STORAGE: StatusGroups<StorageJobStatus> = {\n  running: ['waiting', 'processing'],\n  successful: ['success'],\n  failed: ['error'],\n};\n\n/**\n * Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.\n *\n * - `terminating` is running until `terminated`.\n * - The split mirrors the job's `isSuccess`; with a job in hand, read `job.isSuccess` instead.\n */\nconst QUEUE: StatusGroups<QueueJobStatus> = {\n  running: ['created', 'waiting', 'processing', 'terminating'],\n  successful: ['success', 'warning'],\n  failed: ['error', 'cancelled', 'terminated'],\n};\n\n// Mirrors `JobState` in `go-monorepo` (`services/query/internal/repository/models`).\n// `canceled` with one `l`, unlike the other services.\nconst QUERY: StatusGroups<QueryJobStatus> = {\n  running: ['created', 'enqueued', 'processing'],\n  successful: ['completed'],\n  failed: ['failed', 'canceled'],\n};\n\n/**\n * One service's status predicates, sets and named constants.\n *\n * - `isSuccessful` / `isFailed` are `false` while running.\n * - `isKnown` narrows an untyped string.\n * - `named` is asserted: `Object.fromEntries` can't prove the key mapping.\n */\nconst forService = <Status extends string>(groups: StatusGroups<Status>) => {\n  const all = [...groups.running, ...groups.successful, ...groups.failed];\n\n  const running: ReadonlySet<Status> = new Set(groups.running);\n  const successful: ReadonlySet<Status> = new Set(groups.successful);\n  const failed: ReadonlySet<Status> = new Set(groups.failed);\n  const terminal: ReadonlySet<Status> = new Set([...groups.successful, ...groups.failed]);\n  const known: ReadonlySet<string> = new Set<string>(all);\n\n  return {\n    isRunning: (status: Status) => running.has(status),\n    isTerminal: (status: Status) => terminal.has(status),\n    isSuccessful: (status: Status) => successful.has(status),\n    isFailed: (status: Status) => failed.has(status),\n    isKnown: (value: string): value is Status => known.has(value),\n    describe: (status: Status) => ({\n      isRunning: running.has(status),\n      isTerminal: terminal.has(status),\n      isSuccessful: successful.has(status),\n      isFailed: failed.has(status),\n    }),\n    statuses: { running, successful, failed, terminal },\n    named: Object.fromEntries(\n      all.map((status) => [status.toUpperCase(), status]),\n    ) as StatusNames<Status>,\n  };\n};\n\n/**\n * Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.\n *\n * - Never merge services: labels overlap but their meaning differs.\n * - `query` covers the query job, not its statements (which have `notExecuted`).\n */\nexport const jobStatus = {\n  storage: forService(STORAGE),\n  queue: forService(QUEUE),\n  query: forService(QUERY),\n};\n","import { isApiError } from '../fetchClient';\n\nconst MAX_CONSECUTIVE_FAILURES = 5;\n\n// A read that failed in transit, or that the service answered with a 5xx or 429. The job runs\n// server-side either way, so a later read can still see it finish.\nconst isTransient = (error: Error) =>\n  error instanceof TypeError ||\n  (isApiError(error) && (error.response.status >= 500 || error.response.status === 429));\n\n/** A job poll's retry rule: a transient read is retried up to five times in a row; one that succeeds resets the count. */\nexport const transientRetries = () => {\n  let failures = 0;\n\n  return {\n    reset: () => {\n      failures = 0;\n    },\n    isRetryable: (error: Error) => isTransient(error) && ++failures < MAX_CONSECUTIVE_FAILURES,\n  };\n};\n"],"mappings":";;;;AAEA,MAAa,SAAS,SAAiB,WACrC,IAAI,SAAe,SAAS,WAAW;CACrC,IAAI,QAAQ,SAAS,OAAO,OAAO,iBAAiB,OAAO,MAAM,CAAC;CAElE,MAAM,gBAAgB;EACpB,aAAa,SAAS;EACtB,OAAO,iBAAiB,QAAQ,MAAM,CAAC;CACzC;CAKA,MAAM,YAAY,iBAAiB;EACjC,QAAQ,oBAAoB,SAAS,OAAO;EAC5C,QAAQ;CACV,GAAG,OAAO;CAEV,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,CAAC;;;;;;;;ACZH,MAAa,QAAW,SAAiD;CACvE,IAAI,QAAoC;CAGxC,MAAM,UAAU,YAAiC,MAAM,KAAK;CAE5D,aAAa;EACX,UAAU,QAAQ,CAAC,CAAC,OAAO,UAAmB;GAC5C,QAAQ;GACR,MAAM;EACR,CAAC;EACD,OAAO;CACT;AACF;;ACbA,MAAa,WAAW,WACtB,kBAAkB,QAAQ,SAAS,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AAEhF,MAAM,WAAc,UAA+B;CAAE,SAAS;CAAM;AAAK;AACzE,MAAM,WAA4B,WAAgC;CAAE,SAAS;CAAO;AAAM;AAC1F,MAAM,aAAiC,WACrC,OAAO;AACT,MAAM,aAAiC,WACrC,CAAC,OAAO;AAEV,MAAM,OAA8B,QAAsB,OACxD,OAAO,UAAU,QAAQ,GAAG,OAAO,IAAI,CAAC,IAAI;AAE9C,MAAM,YACJ,QACA,OACkB,OAAO,UAAU,SAAS,QAAQ,GAAG,OAAO,KAAK,CAAC;AAEtE,MAAM,WACJ,QACA,OACsB,OAAO,UAAU,GAAG,OAAO,IAAI,IAAI;AAE3D,MAAM,SACJ,QACA,WACA,cACO,OAAO,UAAU,UAAU,OAAO,IAAI,IAAI,UAAU,OAAO,KAAK;AAGzE,MAAM,OAA2B,QAAsB,OAAwC;CAC7F,IAAI,OAAO,SAAS,GAAG,OAAO,IAAI;CAClC,OAAO;AACT;AAEA,MAAM,UAA8B,WAA4B;CAC9D,IAAI,OAAO,SAAS,OAAO,OAAO;CAClC,MAAM,OAAO;AACf;AAEA,MAAM,YAAmC,QAAsB,aAC7D,OAAO,UAAU,OAAO,OAAO;AAEjC,MAAM,YAAe,SAAyC;CAC5D,IAAI;EACF,OAAO,QAAQ,KAAK,CAAC;CACvB,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,gBAAgB,OAAU,SAAuD;CACrF,IAAI;EACF,OAAO,QAAQ,MAAM,KAAK,CAAC;CAC7B,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,iBACqB,QACxB,GAAG,SACF,eAAe,GAAG,GAAG,IAAI,CAAC;AAE9B,MAAM,sBACqB,QACxB,GAAG,SACF,oBAAoB,GAAG,GAAG,IAAI,CAAC;AAEnC,MAAa,SAAS;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;ACtFA,MAAa,kBAAkB,KAAK,KAAK;AAEzC,MAAa,SAAS,OAAe,KAAa,MAAM,aACtD,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAEpC,MAAa,YAAY,OAAe,aACtC,OAAO,SAAS,KAAK,IAAI,QAAQ;;AAGnC,MAAa,oBAAoB,IAAI,gBAAgB,CAAC,CAAC;;ACMvD,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,eAAe;AAErB,MAAa,iBAAiB,EAC5B,SAAS,QACT,aAAa,eAAe,iBAC5B,SAAS,KAAK,QACd,GAAG,cACwB;CAC3B,MAAM,aAAwB,YAAY;EACxC,IAAI,QAAQ,SAAS,UAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFD,MAAM,SAAS,QAAQ,MAAM,QAAQ,GAAG,QAEhC,KAAK,UAAU;EAEtC,IAAI,QAAQ,SAAS,eAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFC,MAAM,SAAS,QAAQ,UAAU,YAAY,UAAU,GAAG,UAElD,MAAM,UAAU;EAGzC,OAAO,MAAM,SAAS,QAAQ,UAAU,YAAY,GAAG,YAAY;CACrE;CAEA,MAAM,YAAsB,UAAU;EACpC,IAAI,WAAW,QAAQ,OAAO;EAC9B,IAAI,WAAW,QAAQ,OAAO,QAAQ,OAAO;EAC7C,OAAO,QAAQ,IAAK,QAAQ,IAAK,OAAO;CAC1C;CAEA,MAAM,cAAc,MAAM,SAAS,cAAc,eAAe,GAAG,cAAc,eAAe;CAChG,QAAQ,aAAa;EACnB,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC;EAC1D,MAAM,SAAS,KAAK,IAAI,UAAU,OAAO,GAAG,WAAW;EAGvD,OAAO,MAAM,SAAS,SAAS,MAAM,GAAG,YAAY,GAAG,cAAc,WAAW;CAClF;AACF;;;ACtBA,MAAa,aAAa;CACxB,OAAU,MAAS,aAAyC;EAC1D,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAa,OAAc,aAAyC;EAClE,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAe,SAAsB,WAAkC;EACrE,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAc,SAAsB,WAAkC;EACpE,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAa,SAAsB,YAAoC;EACrE,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAU,EAChC,QAAQ,SACR,OAAO,QACP,QAAQ,eAAe,YAAY,GACnC,SAAS,aAAa;CAAE,MAAM;CAAY,UAAU;AAAK,GACzD,QAAQ;CAAE,OAAO,IAAI,WAAW,MAAM,IAAI,MAAM;CAAG,WAAW,YAAY,IAAI;AAAE,GAChF,aAAa,qBAAqB,OAClC,aAAa,eAAe,UAC5B,SAAS,WAAW,eACwB;CAG5C,MAAM,YAAY,SAAS,UAAU,QAAQ;CAC7C,MAAM,UAAU,cAAc,WAAW,WAAW,MAAM,WAAW,GAAG,eAAe;CACvF,MAAM,cAAc,KAAK,MAAM,MAAM,SAAS,cAAc,QAAQ,GAAG,CAAC,CAAC;CAEzE,MAAM,gBAAgB,YAAY,WAAW,YAAY,IAAI,YAAY,QAAQ,OAAO;CACxF,MAAM,YAAY,YAAY,IAAI,CAAC,cAAc,aAAa,CAAC;CAC/D,MAAM,aAAa,QAAQ,cAAqB;CAEhD,UAAU,iBAAiB,eAAe,WAAW,OAAO,UAAU,MAAM,GAAG,EAC7E,MAAM,KACR,CAAC;CACD,WAAgB,QAAQ,YAAY,KAAA,CAAS;CAE7C,MAAM,YAAY,cAAc,UAAU;CAC1C,MAAM,YAAY,MAAM,IAAI;CAE5B,MAAM,QAAQ,OAAO,cAAc,MAAM;CACzC,MAAM,cAAc,OAAO,cAAc,YAAY;CAErD,MAAM,UAAU,EAAE,SAAS,IAAI,cAC7B,OAAO,oBACL,QAAQ,KAAK,CAAC,QAAQ;EAAE,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GAAG,WAAW,OAAO,CAAC,CACzF;CACF,MAAM,QAAQ,OAAO,oBAAoB,OAAe,MAAM,KAAK,IAAI,SAAS,CAAC;CAEjF,IAAI,UAAU;CAEd,IAAI,OAAiB;CACrB,IAAI;CACJ,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI,eAA4B;EAC9D;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAa,QAAQ,CAAC;CAEpE,OAAO,MAAM;EACX,MAAM,SAAS,QAAQ;EACvB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,QAAQ,SAAS;EACvE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,QAAQ,aAAa,MAAM;EAE/E;EAEA,MAAM,OAAO,MAAM,OAAO;GAAE,GAAG;GAAQ;EAAQ,CAAC;EAKhD,IAAI,KAAK,SAAS,OAAO,KAAK;OACzB,YAAY,KAAK;EAEtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EACtE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,OAAO,aAAa,MAAM;EAE9E,IAAI,CAAC,KAAK,SAAS;GACjB,MAAM,WAAW,YAAY,KAAK,KAAK;GAIvC,IAAI,CAAC,SAAS,SAAS;IACrB,KAAK,MAAM,UAAU,SAAS;IAC9B,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;GAC7C;GACA,IAAI,CAAC,SAAS,MAAM,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;EACjE;EAEA,IAAI,KAAK,SAAS;GAChB,MAAM,SAAS,MAAM;IAAE,GAAG;IAAO,MAAM,KAAK;GAAK,CAAC;GAClD,IAAI,CAAC,OAAO,SAAS,OAAO,WAAW,QAAQ,OAAO,OAAO,KAAK;GAClE,IAAI,OAAO,MAAM,OAAO,WAAW,KAAK,KAAK,MAAM,KAAK;EAC1D;EAGA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAU,OAAO,SAAS;EAGxE,MAAM,UAAU,UAAU,OAAO;EACjC,IAAI,MAAM,UAAU,WAAW,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EAEnF,MAAM,QAAQ,MAAM,MAAM,OAAO;EACjC,IAAI,CAAC,MAAM,SAAS;GAClB,MAAM,aAAa,QAAQ;GAC3B,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,YAAY,SAAS;GAC3E,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,YAAY,aAAa,MAAM;GAEnF,OAAO,WAAW,QAAQ,MAAM,OAAO,UAAU;EACnD;CACF;AACF;;ACzIA,MAAM,aAAgB,SACpB,OAAO,SAAS;AAwBlB,MAAa,UAAU,cAA8B;AAErD,MAAa,aAAa,WAAuC;CAC/D,IAAI,WAAW,UAAU,OAAO,OAAO,OAAO,OAAO;CAErD,IAAI,OAAO,UAAU,WAAW;EAC9B,IAAI,OAAO,kBAAkB,OAAO,OAAO,OAAO;EAElD,OAAO,iBACL,OAAO,OAAO,WAAW,WAAW,OAAO,SAAS,uBACtD;CACF;CAEA,uBAAO,IAAI,MAAM,YAAY,OAAO,MAAM,SAAS,OAAO,QAAQ,WAAW;AAC/E;AAEA,MAAa,UAAyD,EACpE,SACA,MACA,QACA,QACA,OACA,QACA,GAAG,sBACoC;CACvC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAErE,MAAM,SAAS,SAAa,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;CAE5E,MAAM,kBAAqB;CAG3B,MAAM,WAAW,YAA6B;EAC5C,SAAS,UAAU,IAAI,IAAI,CAAC,IAAI,MAAM,UAAU,CAAC;EACjD,OAAO;EACP,SAAS;EACT,SAAS;EACT,MAAM;CACR,CAAC;CACD,MAAM,kBAAkB,SACtB,SAAS,IAAI;EAAE,GAAG,SAAS,IAAI;EAAG,GAAG;CAAK,CAAC;CAE7C,MAAM,eAAe,SAAoC;EACvD,eAAe;GAAE,SAAS,KAAK;GAAS,SAAS,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;EAChF,OAAO,MAAM,IAAI;CACnB;CAGA,MAAM,UAAU,WAA0B;EACxC,eAAe;GACb,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT;CAIA,MAAM,eAAe,YAA4B;EAC/C,eAAe,EAAE,OAAO,aAAa,CAAC;EAEtC,OAAO,OAAO,oBAAoB;GAChC,UAAU,eAAe;GACzB,OAAO,QAAQ,SAAS;EAC1B,CAAC;CACH;CAEA,MAAM,YAAY,gBAAgB,OAAO,IAAI,KAAK,YAAY,IAAI;CAGlE,MAAM,sBAAsB,OAAc,cAAsB;EAC9D,MAAM,SAAsB;GAAE,SAAS;GAAG,SAAS,IAAI,IAAI;GAAW,MAAM;EAAK;EAEjF,OAAO,UAAU,UACb,WAAW,QAAQ,QAAQ,UAAU,MAAM,IAC3C,WAAW,QAAQ,OAAO,MAAM;CACtC;CAEA,MAAM,QAAQ,KAAK,YAAoC;EACrD,IAAI,WAAW,UAAU;EACzB,IAAI,UAAU,IAAI,GAAG;GACnB,MAAM,YAAY,IAAI;GACtB,MAAM,YAAY,MAAM,YAAY,IAAI;GACxC,IAAI,CAAC,UAAU,SAAS,OAAO,OAAO,mBAAmB,UAAU,OAAO,SAAS,CAAC;GACpF,WAAW,UAAU;EACvB;EACA,eAAe;GAAE,SAAS,MAAM,QAAQ;GAAG,OAAO;EAAU,CAAC;EAE7D,OAAO,OACL,MAAM,SAAS;GACb,GAAG;GACH,SAAS,YAAY,OAAO;IAAE,GAAG;IAAS,MAAM;GAAS,CAAC;GAC1D,OAAO;GACP,QAAQ;EACV,CAAC,CACH;CACF,CAAC;CAED,MAAM,QAAQ,WAAoB,aAAa,MAAM,MAAM;CAC3D,MAAM,aAAa,aACjB,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAO,OAAO,cAA6B;EAC/C,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ;GAC3B,MAAM,QAAQ,SAAS,OAAO,IAAI;GAClC,IAAI,CAAC,OAAO,OAAO,OAAO;GAC1B,MAAM,YAAY,QAAQ,KAAK,KAAK;EACtC;EACA,MAAM,QAAQ,UAAU,MAAM;EAC9B,MAAM,YAAY,QAAQ,KAAK,KAAK;CACtC;CAEA,MAAM,WAAW;EACf;EACA;EACA;EACA;CACF;CAEA,QAAQ,KAAK,QAAQ;CAErB,OAAO;EACL,IAAI,QAAQ;GACV,OAAO,SAAS,IAAI,CAAC,CAAC;EACxB;EACA;EACA,GAAG;CACL;AACF;;AC9KA,MAAM,UAA0C;CAC9C,SAAS,CAAC,WAAW,YAAY;CACjC,YAAY,CAAC,SAAS;CACtB,QAAQ,CAAC,OAAO;AAClB;;;;;;;AAQA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAW;EAAc;CAAa;CAC3D,YAAY,CAAC,WAAW,SAAS;CACjC,QAAQ;EAAC;EAAS;EAAa;CAAY;AAC7C;AAIA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAY;CAAY;CAC7C,YAAY,CAAC,WAAW;CACxB,QAAQ,CAAC,UAAU,UAAU;AAC/B;;;;;;;;AASA,MAAM,cAAqC,WAAiC;CAC1E,MAAM,MAAM;EAAC,GAAG,OAAO;EAAS,GAAG,OAAO;EAAY,GAAG,OAAO;CAAM;CAEtE,MAAM,UAA+B,IAAI,IAAI,OAAO,OAAO;CAC3D,MAAM,aAAkC,IAAI,IAAI,OAAO,UAAU;CACjE,MAAM,SAA8B,IAAI,IAAI,OAAO,MAAM;CACzD,MAAM,2BAAgC,IAAI,IAAI,CAAC,GAAG,OAAO,YAAY,GAAG,OAAO,MAAM,CAAC;CACtF,MAAM,QAA6B,IAAI,IAAY,GAAG;CAEtD,OAAO;EACL,YAAY,WAAmB,QAAQ,IAAI,MAAM;EACjD,aAAa,WAAmB,SAAS,IAAI,MAAM;EACnD,eAAe,WAAmB,WAAW,IAAI,MAAM;EACvD,WAAW,WAAmB,OAAO,IAAI,MAAM;EAC/C,UAAU,UAAmC,MAAM,IAAI,KAAK;EAC5D,WAAW,YAAoB;GAC7B,WAAW,QAAQ,IAAI,MAAM;GAC7B,YAAY,SAAS,IAAI,MAAM;GAC/B,cAAc,WAAW,IAAI,MAAM;GACnC,UAAU,OAAO,IAAI,MAAM;EAC7B;EACA,UAAU;GAAE;GAAS;GAAY;GAAQ;EAAS;EAClD,OAAO,OAAO,YACZ,IAAI,KAAK,WAAW,CAAC,OAAO,YAAY,GAAG,MAAM,CAAC,CACpD;CACF;AACF;;;;;;;AAQA,MAAa,YAAY;CACvB,SAAS,WAAW,OAAO;CAC3B,OAAO,WAAW,KAAK;CACvB,OAAO,WAAW,KAAK;AACzB;;ACzFA,MAAM,2BAA2B;AAIjC,MAAM,eAAe,UACnB,iBAAiB,aAChB,WAAW,KAAK,MAAM,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,WAAW;;AAGnF,MAAa,yBAAyB;CACpC,IAAI,WAAW;CAEf,OAAO;EACL,aAAa;GACX,WAAW;EACb;EACA,cAAc,UAAiB,YAAY,KAAK,KAAK,EAAE,WAAW;CACpE;AACF"}

package/dist/{transientRetries-DdJfH9QK.cjs → transientRetries-CM7rAEXQ.cjs}

@@ -1,7 +1,7 @@
-const require_createAbortError = require("./createAbortError-RendOpo7.cjs");
-const require_store = require("./store-xS-Cu_VS.cjs");
-const require_createFetchClient = require("./createFetchClient-lZ_93Yrb.cjs");
-//#region src/utils/async/delay.ts
+const require_createFetchClient = require("./createFetchClient-DEkUH662.cjs");
+const require_createAbortError = require("./createAbortError-Dzc9yObN.cjs");
+const require_store = require("./store-2OyH1XOP.cjs");
+// src/utils/async/delay.ts
 const delay = (timeout, signal) => new Promise((resolve, reject) => {
 	if (signal?.aborted) return reject(require_createAbortError.createAbortError(signal.reason));
 	const onAbort = () => {
@@ -14,8 +14,7 @@ const delay = (timeout, signal) => new Promise((resolve, reject) => {
 	}, timeout);
 	signal?.addEventListener("abort", onAbort, { once: true });
 });
-//#endregion
-//#region src/utils/async/lazy.ts
+// src/utils/async/lazy.ts
 /**
 * Runs `task` once and replays its promise to every later caller.
 *
@@ -33,8 +32,7 @@ const lazy = (task) => {
 		return value;
 	};
 };
-//#endregion
-//#region src/utils/async/result.ts
+// src/utils/async/result.ts
 const asError = (thrown) => thrown instanceof Error ? thrown : new Error(String(thrown), { cause: thrown });
 const success = (data) => ({
 	success: true,
@@ -92,8 +90,7 @@ const Result = {
 	fromThrowable,
 	fromThrowableAsync
 };
-//#endregion
-//#region src/utils/async/poll/utils.ts
+// src/utils/async/poll/utils.ts
 /**
 * The longest delay a timer can hold: `setTimeout` takes a 32-bit signed number of milliseconds,
 * about 24.9 days.
@@ -106,8 +103,7 @@ const clamp = (value, min, max = Infinity) => Math.min(Math.max(value, min), max
 const finiteOr = (value, fallback) => Number.isFinite(value) ? value : fallback;
 /** A signal that never aborts, so an input nobody gave costs no branch of its own. */
 const neverAborts = () => new AbortController().signal;
-//#endregion
-//#region src/utils/async/poll/backoff.ts
+// src/utils/async/poll/backoff.ts
 const MIN_STEP = 500;
 const MIN_FACTOR = 2;
 const MIN_INTERVAL = 500;
@@ -129,8 +125,7 @@ const createBackoff = ({ jitter = "none", maxInterval: _maxInterval = MAX_TIMER_
 		return clamp(finiteOr(jitterFn(capped), MIN_INTERVAL), MIN_INTERVAL, maxInterval);
 	};
 };
-//#endregion
-//#region src/utils/async/poll/pollLoop.ts
+// src/utils/async/poll/pollLoop.ts
 /** One constructor per ending, so a result is built the same way wherever a poll ends. */
 const pollResult = {
 	done: (data, context) => ({
@@ -236,8 +231,7 @@ const pollLoop = async ({ pollFn: _pollFn, until: _until, signal: callerSignal =
 		}
 	}
 };
-//#endregion
-//#region src/utils/async/poll/poll.ts
+// src/utils/async/poll/poll.ts
 const isRequest = (init) => typeof init === "function";
 const emitter = require_store.createEmitter();
 const failureOf = (result) => {
@@ -348,8 +342,7 @@ const poller = ({ pollKey, init, signal, pollFn, until, failed, ...pollLoopOptio
 		...controls
 	};
 };
-//#endregion
-//#region src/domain/jobStatus.ts
+// src/domain/jobStatus.ts
 const STORAGE = {
 	running: ["waiting", "processing"],
 	successful: ["success"],
@@ -434,8 +427,7 @@ const jobStatus = {
 	queue: forService(QUEUE),
 	query: forService(QUERY)
 };
-//#endregion
-//#region src/clients/transientRetries.ts
+// src/clients/transientRetries.ts
 const MAX_CONSECUTIVE_FAILURES = 5;
 const isTransient = (error) => error instanceof TypeError || require_createFetchClient.isApiError(error) && (error.response.status >= 500 || error.response.status === 429);
 /** A job poll's retry rule: a transient read is retried up to five times in a row; one that succeeds resets the count. */
@@ -448,7 +440,6 @@ const transientRetries = () => {
 		isRetryable: (error) => isTransient(error) && ++failures < MAX_CONSECUTIVE_FAILURES
 	};
 };
-//#endregion
 Object.defineProperty(exports, "Result", {
 	enumerable: true,
 	get: function() {
@@ -516,4 +507,4 @@ Object.defineProperty(exports, "transientRetries", {
 	}
 });
 
-//# sourceMappingURL=transientRetries-DdJfH9QK.cjs.map
+//# sourceMappingURL=transientRetries-CM7rAEXQ.cjs.map

package/dist/{transientRetries-DdJfH9QK.cjs.map → transientRetries-CM7rAEXQ.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"transientRetries-DdJfH9QK.cjs","names":["createAbortError","createEmitter","createAbortError","createStore","isApiError"],"sources":["../src/utils/async/delay.ts","../src/utils/async/lazy.ts","../src/utils/async/result.ts","../src/utils/async/poll/utils.ts","../src/utils/async/poll/backoff.ts","../src/utils/async/poll/pollLoop.ts","../src/utils/async/poll/poll.ts","../src/domain/jobStatus.ts","../src/clients/transientRetries.ts"],"sourcesContent":["import { createAbortError } from '../createAbortError';\n\nexport const delay = (timeout: number, signal?: AbortSignal) =>\n  new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) return reject(createAbortError(signal.reason));\n\n    const onAbort = () => {\n      clearTimeout(timeoutId);\n      reject(createAbortError(signal?.reason));\n    };\n\n    // `once: true` only detaches the listener once the event fires, so the timeout path has to\n    // detach it explicitly — a caller reusing one signal across many delays (`poll` does) would\n    // otherwise pile up a listener per delay for as long as the signal is alive.\n    const timeoutId = setTimeout(() => {\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    }, timeout);\n\n    signal?.addEventListener('abort', onAbort, { once: true });\n  });\n","import type { TaskFn } from './types';\n\n/**\n * Runs `task` once and replays its promise to every later caller.\n *\n * - A rejection is not cached: the next call retries, so a transient failure never sticks.\n * - Callers that joined the failed run reject with its error.\n */\nexport const lazy = <T>(task: TaskFn<T>): (() => Promise<Awaited<T>>) => {\n  let value: Promise<Awaited<T>> | null = null;\n\n  // async wrapper so a synchronous throw from `task` rejects rather than throws.\n  const runTask = async (): Promise<Awaited<T>> => await task();\n\n  return () => {\n    value ??= runTask().catch((error: unknown) => {\n      value = null;\n      throw error;\n    });\n    return value;\n  };\n};\n","export type Success<T> = { success: true; data: T };\nexport type Failure<E extends Error> = { success: false; error: E };\nexport type Result<T, E extends Error = Error> = Success<T> | Failure<E>;\n\n// A task that returns a promise is a type error: the wrapper would report success before it\n// settles, and the rejection would go unhandled. Use the `*Async` sibling.\ntype NotPromise<T> = T extends PromiseLike<unknown> ? never : T;\n\nexport const asError = (thrown: unknown) =>\n  thrown instanceof Error ? thrown : new Error(String(thrown), { cause: thrown });\n\nconst success = <T>(data: T): Result<T, never> => ({ success: true, data });\nconst failure = <E extends Error>(error: E): Result<never, E> => ({ success: false, error });\nconst isSuccess = <T, E extends Error>(result: Result<T, E>): result is Success<T> =>\n  result.success;\nconst isFailure = <T, E extends Error>(result: Result<T, E>): result is Failure<E> =>\n  !result.success;\n\nconst map = <T, E extends Error, U>(result: Result<T, E>, fn: (data: T) => U): Result<U, E> =>\n  result.success ? success(fn(result.data)) : result;\n\nconst mapError = <T, E extends Error, F extends Error>(\n  result: Result<T, E>,\n  fn: (error: E) => F,\n): Result<T, F> => (result.success ? result : failure(fn(result.error)));\n\nconst andThen = <T, E extends Error, U, F extends Error>(\n  result: Result<T, E>,\n  fn: (data: T) => Result<U, F>,\n): Result<U, E | F> => (result.success ? fn(result.data) : result);\n\nconst match = <T, E extends Error, R>(\n  result: Result<T, E>,\n  onSuccess: (data: T) => R,\n  onFailure: (error: E) => R,\n): R => (result.success ? onSuccess(result.data) : onFailure(result.error));\n\n// A side effect on a success; the result itself passes through untouched, same instance.\nconst tap = <T, E extends Error>(result: Result<T, E>, fn: (data: T) => void): Result<T, E> => {\n  if (result.success) fn(result.data);\n  return result;\n};\n\nconst unwrap = <T, E extends Error>(result: Result<T, E>): T => {\n  if (result.success) return result.data;\n  throw result.error;\n};\n\nconst unwrapOr = <T, E extends Error, U>(result: Result<T, E>, fallback: U): T | U =>\n  result.success ? result.data : fallback;\n\nconst tryCatch = <T>(task: () => NotPromise<T>): Result<T> => {\n  try {\n    return success(task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst tryCatchAsync = async <T>(task: () => T | PromiseLike<T>): Promise<Result<T>> => {\n  try {\n    return success(await task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst fromThrowable =\n  <A extends unknown[], R>(fn: (...args: A) => NotPromise<R>) =>\n  (...args: A): Result<R> =>\n    tryCatch(() => fn(...args));\n\nconst fromThrowableAsync =\n  <A extends unknown[], R>(fn: (...args: A) => R | PromiseLike<R>) =>\n  (...args: A): Promise<Result<R>> =>\n    tryCatchAsync(() => fn(...args));\n\nexport const Result = {\n  success,\n  failure,\n  isSuccess,\n  isFailure,\n  map,\n  mapError,\n  andThen,\n  match,\n  tap,\n  unwrap,\n  unwrapOr,\n  tryCatch,\n  tryCatchAsync,\n  fromThrowable,\n  fromThrowableAsync,\n};\n","/**\n * The longest delay a timer can hold: `setTimeout` takes a 32-bit signed number of milliseconds,\n * about 24.9 days.\n *\n * - Above it the delay wraps: Node warns and fires after 1 ms, so a long wait becomes a busy loop.\n * - It bounds a backoff curve and a poll's timeout alike, since both end up in a timer.\n */\nexport const MAX_TIMER_DELAY = 2 ** 31 - 1;\n\nexport const clamp = (value: number, min: number, max = Infinity) =>\n  Math.min(Math.max(value, min), max);\n\nexport const finiteOr = (value: number, fallback: number) =>\n  Number.isFinite(value) ? value : fallback;\n\n/** A signal that never aborts, so an input nobody gave costs no branch of its own. */\nexport const neverAborts = () => new AbortController().signal;\n","import { clamp, finiteOr, MAX_TIMER_DELAY } from './utils';\n\nexport type Jitter =\n  | 'none' // delay\n  | 'full' // [0, delay)\n  | 'equal'; // [delay / 2, delay)\n\ntype Backoff =\n  | { type: 'constant'; interval: number } //   3000, 3000, 3000, ...\n  | { type: 'linear'; initialInterval: number; step: number } // 1000, 2000, 3000, …\n  | { type: 'exponential'; initialInterval: number; factor?: number }; // 1000, 2000, 4000, 8000, …\n\ntype RandomFn = () => number;\ntype JitterFn = (delay: number) => number;\ntype BackoffFn = (attempt: number) => number;\n\nexport type BackoffDef = {\n  jitter?: Jitter;\n  maxInterval?: number;\n  random?: RandomFn;\n} & Backoff;\n\nconst MIN_STEP = 500;\nconst MIN_FACTOR = 2;\nconst MIN_INTERVAL = 500;\n\nexport const createBackoff = ({\n  jitter = 'none',\n  maxInterval: _maxInterval = MAX_TIMER_DELAY,\n  random = Math.random,\n  ...backoff\n}: BackoffDef): BackoffFn => {\n  const backoffFn: BackoffFn = (attempt) => {\n    if (backoff.type === 'linear') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const step = clamp(finiteOr(backoff.step, MIN_STEP), MIN_STEP);\n\n      return interval + step * (attempt - 1);\n    }\n    if (backoff.type === 'exponential') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const factor = clamp(finiteOr(backoff.factor ?? MIN_FACTOR, MIN_FACTOR), MIN_FACTOR);\n\n      return interval * factor ** (attempt - 1);\n    }\n\n    return clamp(finiteOr(backoff.interval, MIN_INTERVAL), MIN_INTERVAL);\n  };\n\n  const jitterFn: JitterFn = (delay) => {\n    if (jitter === 'none') return delay;\n    if (jitter === 'full') return delay * random();\n    return delay / 2 + (delay / 2) * random(); // equal\n  };\n\n  const maxInterval = clamp(finiteOr(_maxInterval, MAX_TIMER_DELAY), MIN_INTERVAL, MAX_TIMER_DELAY);\n  return (_attempt) => {\n    const attempt = clamp(finiteOr(Math.trunc(_attempt), 1), 1);\n    const capped = Math.min(backoffFn(attempt), maxInterval);\n    // Floored after the jitter, not before: `full` jitter multiplies by a random fraction, so a floor\n    // applied to the curve alone leaves sub-millisecond gaps between attempts.\n    return clamp(finiteOr(jitterFn(capped), MIN_INTERVAL), MIN_INTERVAL, maxInterval);\n  };\n};\n","import { delay } from '../delay';\nimport { Result } from '../result';\n\nimport { type BackoffDef, createBackoff } from './backoff';\nimport { clamp, finiteOr, MAX_TIMER_DELAY, neverAborts } from './utils';\n\ntype Clock = {\n  wait: (ms: number, signal?: AbortSignal) => Promise<void>;\n  now: () => number;\n};\n\nexport type PollContext = {\n  attempt: number;\n  elapsed: number;\n};\n\n/** The context plus the answer it is about: what `until` decides on, and what an ending reports. */\nexport type PollTick<T> = PollContext & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T> = PollTick<T> &\n  (\n    | { state: 'done'; data: T }\n    | { state: 'timedOut' | 'exhausted'; error?: Error }\n    | { state: 'aborted'; reason?: unknown }\n    | { state: 'errored'; error: Error }\n  );\n\nexport type PollOptions<T> = {\n  pollFn: (context: PollContext & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  signal?: AbortSignal;\n  backoff?: BackoffDef;\n  isRetryable?: (error: Error) => boolean;\n  maxAttempts?: number;\n  timeout?: number;\n  clock?: Clock;\n};\n\n/** One constructor per ending, so a result is built the same way wherever a poll ends. */\nexport const pollResult = {\n  done: <T>(data: T, context: PollTick<T>): PollResult<T> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T>(error: Error, context: PollTick<T>): PollResult<T> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T>(context: PollTick<T>, reason: unknown): PollResult<T> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T>({\n  pollFn: _pollFn,\n  until: _until,\n  signal: callerSignal = neverAborts(),\n  backoff: backoffDef = { type: 'constant', interval: 3000 },\n  clock = { wait: (ms, signal) => delay(ms, signal), now: () => performance.now() },\n  isRetryable: _isRetryable = () => false,\n  maxAttempts: _maxAttempts = Infinity,\n  timeout: _timeout = Infinity,\n}: PollOptions<T>): Promise<PollResult<T>> => {\n  // A deadline ends up in a timer, so a finite one is bounded by what a timer can hold. `Infinity`\n  // is answered before the clamp: it means no deadline, and clamping would make it the longest one.\n  const requested = finiteOr(_timeout, Infinity);\n  const timeout = requested === Infinity ? Infinity : clamp(requested, 0, MAX_TIMER_DELAY);\n  const maxAttempts = Math.trunc(clamp(finiteOr(_maxAttempts, Infinity), 0));\n\n  const timeoutSignal = timeout === Infinity ? neverAborts() : AbortSignal.timeout(timeout);\n  const anySignal = AbortSignal.any([callerSignal, timeoutSignal]);\n  const anyAborted = Promise.withResolvers<never>();\n\n  anySignal.addEventListener('abort', () => anyAborted.reject(anySignal.reason), {\n    once: true,\n  });\n  void anyAborted.promise.catch(() => undefined);\n\n  const backoffFn = createBackoff(backoffDef);\n  const startedAt = clock.now();\n\n  const until = Result.fromThrowable(_until);\n  const isRetryable = Result.fromThrowable(_isRetryable);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ attempt: at, elapsed }: PollContext) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([_pollFn({ attempt: at, elapsed, signal: anySignal }), anyAborted.promise]),\n    );\n  const sleep = Result.fromThrowableAsync((ms: number) => clock.wait(ms, anySignal));\n\n  let attempt = 0;\n  // What a retry swallowed: the poll carries it to whichever ending runs out first.\n  let last: T | null = null;\n  let lastError: Error | undefined;\n  const context = (at = clock.now() - startedAt): PollTick<T> => ({\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T>(context());\n\n  while (true) {\n    const before = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(before, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(before, callerSignal.reason);\n\n    attempt++;\n    // The attempt it is, not the one before it — `before` was read to decide whether to make it.\n    const poll = await pollFn({ ...before, attempt });\n\n    // What the attempt produced, recorded before the tick that reports it: on any ending but `done`\n    // these two are the only account of what the poll saw, and reading them one attempt behind is\n    // reading the wrong answer.\n    if (poll.success) last = poll.data;\n    else lastError = poll.error;\n\n    const after = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(after, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(after, callerSignal.reason);\n\n    if (!poll.success) {\n      const canRetry = isRetryable(poll.error);\n\n      // A predicate that throws cannot ask for a retry. The request's own failure stays the reported\n      // one — it is the type a caller's guards expect — and the predicate's rides along as its cause.\n      if (!canRetry.success) {\n        poll.error.cause ??= canRetry.error;\n        return pollResult.errored(poll.error, after);\n      }\n      if (!canRetry.data) return pollResult.errored(poll.error, after);\n    }\n\n    if (poll.success) {\n      const isDone = until({ ...after, data: poll.data });\n      if (!isDone.success) return pollResult.errored(isDone.error, after);\n      if (isDone.data) return pollResult.done(poll.data, after);\n    }\n\n    // exhausted\n    if (attempt >= maxAttempts) return pollResult.exhausted(after, lastError);\n\n    // sleep\n    const backoff = backoffFn(attempt);\n    if (after.elapsed + backoff >= timeout) return pollResult.timedOut(after, lastError);\n\n    const slept = await sleep(backoff);\n    if (!slept.success) {\n      const afterSleep = context();\n      if (timeoutSignal.aborted) return pollResult.timedOut(afterSleep, lastError);\n      if (callerSignal.aborted) return pollResult.aborted(afterSleep, callerSignal.reason);\n\n      return pollResult.errored(slept.error, afterSleep);\n    }\n  }\n};\n","import { createAbortError } from '../../createAbortError';\nimport { createEmitter, createStore } from '../../store';\nimport { lazy } from '../lazy';\nimport { Result } from '../result';\n\nimport {\n  type PollContext,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  pollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollKey = readonly unknown[];\n\n/** `requesting` is the request the poll starts from, before any attempt; `polling` is the attempts. */\nexport type PollState = 'idle' | 'requesting' | 'polling' | PollResultState;\nexport type PollSnapshot<T = unknown> = PollTick<T> & { pollKey: PollKey; state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>, error: Error) => Error | undefined;\n\nexport type Poller<T, S = T> = {\n  readonly state: PollState;\n  start: () => Promise<PollResult<T>>;\n  wait: (onFailure?: OnFailure<T>) => Promise<S>;\n  stop: (reason?: string) => void;\n  subscribe: (listener: (snapshot: PollSnapshot<T>) => void) => () => void;\n  debug: () => PollSnapshot<T>;\n};\n\ntype InitRequest<R> = (signal: AbortSignal) => Promise<R>;\n\nconst isRequest = <R>(init: R | InitRequest<R> | undefined): init is InitRequest<R> =>\n  typeof init === 'function';\n\n/**\n * The loop's options plus what names the poll and what it starts from.\n *\n * - `pollKey` names the poll; the loop never sees it. Given as a function of `init`, it is what the\n *   poll started from that names it, once that is known.\n * - `init` is a value or a request for it (an enqueue), handed to `pollFn`; a request runs first.\n * - `failed` reads a `done` value for `wait`: what it returns, `wait` throws. A client that\n *   knows what gets through declares it as `Poller<T, S>` on its own return.\n */\nexport type PollerOptions<T, K extends PollKey = PollKey, R = undefined> = Omit<\n  PollOptions<T>,\n  'pollFn' | 'until'\n> & {\n  pollKey: K | ((init: R) => K);\n  init?: R | InitRequest<R>;\n  pollFn: (context: PollContext & { init: R; signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  failed?: (data: T) => Error | undefined;\n};\n\nexport type ObservedPoller = Pick<Poller<unknown>, 'stop' | 'subscribe' | 'debug' | 'start'>;\n\nexport const emitter = createEmitter<ObservedPoller>();\n\nexport const failureOf = (result: PollResult<unknown>): Error => {\n  if ('error' in result && result.error) return result.error;\n\n  if (result.state === 'aborted') {\n    if (result.reason instanceof Error) return result.reason;\n\n    return createAbortError(\n      typeof result.reason === 'string' ? result.reason : 'The poll was stopped.',\n    );\n  }\n\n  return new Error(`The poll ${result.state} after ${result.attempt} attempts.`);\n};\n\nexport const poller = <T, K extends PollKey = PollKey, R = undefined>({\n  pollKey,\n  init,\n  signal,\n  pollFn,\n  until,\n  failed,\n  ...pollLoopOptions\n}: PollerOptions<T, K, R>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  const keyOf = (from: R) => (typeof pollKey === 'function' ? pollKey(from) : pollKey);\n  // An absent `init` is the `undefined` that `R` defaults to, which the body cannot prove.\n  const givenInit = (): R => init as R;\n\n  // snapshoting; the key is unknown while a request for `init` is out, so it starts empty then\n  const snapshot = createStore<PollSnapshot<T>>({\n    pollKey: isRequest(init) ? [] : keyOf(givenInit()),\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot<T>>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (tick: PollTick<T> & { data: T }) => {\n    updateSnapshot({ attempt: tick.attempt, elapsed: tick.elapsed, last: tick.data });\n    return until(tick);\n  };\n\n  // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n  const settle = (result: PollResult<T>) => {\n    updateSnapshot({\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  };\n\n  // The request runs under the poller's signal, before the first attempt. The poll's deadline\n  // bounds the polling, not this request.\n  const requestInit = (request: InitRequest<R>) => {\n    updateSnapshot({ state: 'requesting' });\n\n    return Result.tryCatchAsync(() => {\n      anySignal.throwIfAborted();\n      return request(anySignal);\n    });\n  };\n\n  const now = () => pollLoopOptions.clock?.now() ?? performance.now();\n\n  // How a poll ends when its request did: no attempt was made, and a stop reads as an abort.\n  const endedBeforePolling = (error: Error, startedAt: number) => {\n    const before: PollTick<T> = { attempt: 0, elapsed: now() - startedAt, last: null };\n\n    return anySignal.aborted\n      ? pollResult.aborted(before, anySignal.reason)\n      : pollResult.errored(error, before);\n  };\n\n  const start = lazy(async (): Promise<PollResult<T>> => {\n    let resolved = givenInit();\n    if (isRequest(init)) {\n      const startedAt = now();\n      const requested = await requestInit(init);\n      if (!requested.success) return settle(endedBeforePolling(requested.error, startedAt));\n      resolved = requested.data;\n    }\n    updateSnapshot({ pollKey: keyOf(resolved), state: 'polling' });\n\n    return settle(\n      await pollLoop({\n        ...pollLoopOptions,\n        pollFn: (context) => pollFn({ ...context, init: resolved }),\n        until: handleUntil,\n        signal: anySignal,\n      }),\n    );\n  });\n\n  const stop = (reason?: string) => pollerSignal.abort(reason);\n  const subscribe = (listener: (snapshot: PollSnapshot<T>) => void) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug = snapshot.get;\n\n  const wait = async (onFailure?: OnFailure<T>) => {\n    const result = await start();\n    if (result.state === 'done') {\n      const error = failed?.(result.data);\n      if (!error) return result.data;\n      throw onFailure?.(result, error) ?? error;\n    }\n    const error = failureOf(result);\n    throw onFailure?.(result, error) ?? error;\n  };\n\n  const controls = {\n    stop,\n    subscribe,\n    debug,\n    start,\n  };\n\n  emitter.emit(controls);\n\n  return {\n    get state() {\n      return snapshot.get().state;\n    },\n    wait,\n    ...controls,\n  };\n};\n","import type { QueryJobStatus } from '../clients/queryService/types';\nimport type { QueueJobStatus } from '../clients/queue/types';\nimport type { StorageJobStatus } from '../clients/storage/jobs/types';\n\n/**\n * One service's statuses split by what the job is doing.\n *\n * - Groups are disjoint and cover the vocabulary; terminal = successful + failed.\n * - The annotation makes a renamed generated status fail the build here.\n */\ntype StatusGroups<Status extends string> = {\n  running: readonly Status[];\n  successful: readonly Status[];\n  failed: readonly Status[];\n};\n\n/** A service's statuses as named constants — `SUCCESS: 'success'`. */\ntype StatusNames<Status extends string> = { [K in Status as Uppercase<K>]: K };\n\n// Mirrors `StorageJobStatus` in `connection`.\nconst STORAGE: StatusGroups<StorageJobStatus> = {\n  running: ['waiting', 'processing'],\n  successful: ['success'],\n  failed: ['error'],\n};\n\n/**\n * Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.\n *\n * - `terminating` is running until `terminated`.\n * - The split mirrors the job's `isSuccess`; with a job in hand, read `job.isSuccess` instead.\n */\nconst QUEUE: StatusGroups<QueueJobStatus> = {\n  running: ['created', 'waiting', 'processing', 'terminating'],\n  successful: ['success', 'warning'],\n  failed: ['error', 'cancelled', 'terminated'],\n};\n\n// Mirrors `JobState` in `go-monorepo` (`services/query/internal/repository/models`).\n// `canceled` with one `l`, unlike the other services.\nconst QUERY: StatusGroups<QueryJobStatus> = {\n  running: ['created', 'enqueued', 'processing'],\n  successful: ['completed'],\n  failed: ['failed', 'canceled'],\n};\n\n/**\n * One service's status predicates, sets and named constants.\n *\n * - `isSuccessful` / `isFailed` are `false` while running.\n * - `isKnown` narrows an untyped string.\n * - `named` is asserted: `Object.fromEntries` can't prove the key mapping.\n */\nconst forService = <Status extends string>(groups: StatusGroups<Status>) => {\n  const all = [...groups.running, ...groups.successful, ...groups.failed];\n\n  const running: ReadonlySet<Status> = new Set(groups.running);\n  const successful: ReadonlySet<Status> = new Set(groups.successful);\n  const failed: ReadonlySet<Status> = new Set(groups.failed);\n  const terminal: ReadonlySet<Status> = new Set([...groups.successful, ...groups.failed]);\n  const known: ReadonlySet<string> = new Set<string>(all);\n\n  return {\n    isRunning: (status: Status) => running.has(status),\n    isTerminal: (status: Status) => terminal.has(status),\n    isSuccessful: (status: Status) => successful.has(status),\n    isFailed: (status: Status) => failed.has(status),\n    isKnown: (value: string): value is Status => known.has(value),\n    describe: (status: Status) => ({\n      isRunning: running.has(status),\n      isTerminal: terminal.has(status),\n      isSuccessful: successful.has(status),\n      isFailed: failed.has(status),\n    }),\n    statuses: { running, successful, failed, terminal },\n    named: Object.fromEntries(\n      all.map((status) => [status.toUpperCase(), status]),\n    ) as StatusNames<Status>,\n  };\n};\n\n/**\n * Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.\n *\n * - Never merge services: labels overlap but their meaning differs.\n * - `query` covers the query job, not its statements (which have `notExecuted`).\n */\nexport const jobStatus = {\n  storage: forService(STORAGE),\n  queue: forService(QUEUE),\n  query: forService(QUERY),\n};\n","import { isApiError } from '../fetchClient';\n\nconst MAX_CONSECUTIVE_FAILURES = 5;\n\n// A read that failed in transit, or that the service answered with a 5xx or 429. The job runs\n// server-side either way, so a later read can still see it finish.\nconst isTransient = (error: Error) =>\n  error instanceof TypeError ||\n  (isApiError(error) && (error.response.status >= 500 || error.response.status === 429));\n\n/** A job poll's retry rule: a transient read is retried up to five times in a row; one that succeeds resets the count. */\nexport const transientRetries = () => {\n  let failures = 0;\n\n  return {\n    reset: () => {\n      failures = 0;\n    },\n    isRetryable: (error: Error) => isTransient(error) && ++failures < MAX_CONSECUTIVE_FAILURES,\n  };\n};\n"],"mappings":";;;;AAEA,MAAa,SAAS,SAAiB,WACrC,IAAI,SAAe,SAAS,WAAW;CACrC,IAAI,QAAQ,SAAS,OAAO,OAAOA,yBAAAA,iBAAiB,OAAO,MAAM,CAAC;CAElE,MAAM,gBAAgB;EACpB,aAAa,SAAS;EACtB,OAAOA,yBAAAA,iBAAiB,QAAQ,MAAM,CAAC;CACzC;CAKA,MAAM,YAAY,iBAAiB;EACjC,QAAQ,oBAAoB,SAAS,OAAO;EAC5C,QAAQ;CACV,GAAG,OAAO;CAEV,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,CAAC;;;;;;;;;ACZH,MAAa,QAAW,SAAiD;CACvE,IAAI,QAAoC;CAGxC,MAAM,UAAU,YAAiC,MAAM,KAAK;CAE5D,aAAa;EACX,UAAU,QAAQ,CAAC,CAAC,OAAO,UAAmB;GAC5C,QAAQ;GACR,MAAM;EACR,CAAC;EACD,OAAO;CACT;AACF;;;ACbA,MAAa,WAAW,WACtB,kBAAkB,QAAQ,SAAS,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AAEhF,MAAM,WAAc,UAA+B;CAAE,SAAS;CAAM;AAAK;AACzE,MAAM,WAA4B,WAAgC;CAAE,SAAS;CAAO;AAAM;AAC1F,MAAM,aAAiC,WACrC,OAAO;AACT,MAAM,aAAiC,WACrC,CAAC,OAAO;AAEV,MAAM,OAA8B,QAAsB,OACxD,OAAO,UAAU,QAAQ,GAAG,OAAO,IAAI,CAAC,IAAI;AAE9C,MAAM,YACJ,QACA,OACkB,OAAO,UAAU,SAAS,QAAQ,GAAG,OAAO,KAAK,CAAC;AAEtE,MAAM,WACJ,QACA,OACsB,OAAO,UAAU,GAAG,OAAO,IAAI,IAAI;AAE3D,MAAM,SACJ,QACA,WACA,cACO,OAAO,UAAU,UAAU,OAAO,IAAI,IAAI,UAAU,OAAO,KAAK;AAGzE,MAAM,OAA2B,QAAsB,OAAwC;CAC7F,IAAI,OAAO,SAAS,GAAG,OAAO,IAAI;CAClC,OAAO;AACT;AAEA,MAAM,UAA8B,WAA4B;CAC9D,IAAI,OAAO,SAAS,OAAO,OAAO;CAClC,MAAM,OAAO;AACf;AAEA,MAAM,YAAmC,QAAsB,aAC7D,OAAO,UAAU,OAAO,OAAO;AAEjC,MAAM,YAAe,SAAyC;CAC5D,IAAI;EACF,OAAO,QAAQ,KAAK,CAAC;CACvB,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,gBAAgB,OAAU,SAAuD;CACrF,IAAI;EACF,OAAO,QAAQ,MAAM,KAAK,CAAC;CAC7B,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,iBACqB,QACxB,GAAG,SACF,eAAe,GAAG,GAAG,IAAI,CAAC;AAE9B,MAAM,sBACqB,QACxB,GAAG,SACF,oBAAoB,GAAG,GAAG,IAAI,CAAC;AAEnC,MAAa,SAAS;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;;ACtFA,MAAa,kBAAkB,KAAK,KAAK;AAEzC,MAAa,SAAS,OAAe,KAAa,MAAM,aACtD,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAEpC,MAAa,YAAY,OAAe,aACtC,OAAO,SAAS,KAAK,IAAI,QAAQ;;AAGnC,MAAa,oBAAoB,IAAI,gBAAgB,CAAC,CAAC;;;ACMvD,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,eAAe;AAErB,MAAa,iBAAiB,EAC5B,SAAS,QACT,aAAa,eAAe,iBAC5B,SAAS,KAAK,QACd,GAAG,cACwB;CAC3B,MAAM,aAAwB,YAAY;EACxC,IAAI,QAAQ,SAAS,UAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFD,MAAM,SAAS,QAAQ,MAAM,QAAQ,GAAG,QAEhC,KAAK,UAAU;EAEtC,IAAI,QAAQ,SAAS,eAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFC,MAAM,SAAS,QAAQ,UAAU,YAAY,UAAU,GAAG,UAElD,MAAM,UAAU;EAGzC,OAAO,MAAM,SAAS,QAAQ,UAAU,YAAY,GAAG,YAAY;CACrE;CAEA,MAAM,YAAsB,UAAU;EACpC,IAAI,WAAW,QAAQ,OAAO;EAC9B,IAAI,WAAW,QAAQ,OAAO,QAAQ,OAAO;EAC7C,OAAO,QAAQ,IAAK,QAAQ,IAAK,OAAO;CAC1C;CAEA,MAAM,cAAc,MAAM,SAAS,cAAc,eAAe,GAAG,cAAc,eAAe;CAChG,QAAQ,aAAa;EACnB,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC;EAC1D,MAAM,SAAS,KAAK,IAAI,UAAU,OAAO,GAAG,WAAW;EAGvD,OAAO,MAAM,SAAS,SAAS,MAAM,GAAG,YAAY,GAAG,cAAc,WAAW;CAClF;AACF;;;;ACtBA,MAAa,aAAa;CACxB,OAAU,MAAS,aAAyC;EAC1D,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAa,OAAc,aAAyC;EAClE,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAe,SAAsB,WAAkC;EACrE,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAc,SAAsB,WAAkC;EACpE,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAa,SAAsB,YAAoC;EACrE,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAU,EAChC,QAAQ,SACR,OAAO,QACP,QAAQ,eAAe,YAAY,GACnC,SAAS,aAAa;CAAE,MAAM;CAAY,UAAU;AAAK,GACzD,QAAQ;CAAE,OAAO,IAAI,WAAW,MAAM,IAAI,MAAM;CAAG,WAAW,YAAY,IAAI;AAAE,GAChF,aAAa,qBAAqB,OAClC,aAAa,eAAe,UAC5B,SAAS,WAAW,eACwB;CAG5C,MAAM,YAAY,SAAS,UAAU,QAAQ;CAC7C,MAAM,UAAU,cAAc,WAAW,WAAW,MAAM,WAAW,GAAG,eAAe;CACvF,MAAM,cAAc,KAAK,MAAM,MAAM,SAAS,cAAc,QAAQ,GAAG,CAAC,CAAC;CAEzE,MAAM,gBAAgB,YAAY,WAAW,YAAY,IAAI,YAAY,QAAQ,OAAO;CACxF,MAAM,YAAY,YAAY,IAAI,CAAC,cAAc,aAAa,CAAC;CAC/D,MAAM,aAAa,QAAQ,cAAqB;CAEhD,UAAU,iBAAiB,eAAe,WAAW,OAAO,UAAU,MAAM,GAAG,EAC7E,MAAM,KACR,CAAC;CACD,WAAgB,QAAQ,YAAY,KAAA,CAAS;CAE7C,MAAM,YAAY,cAAc,UAAU;CAC1C,MAAM,YAAY,MAAM,IAAI;CAE5B,MAAM,QAAQ,OAAO,cAAc,MAAM;CACzC,MAAM,cAAc,OAAO,cAAc,YAAY;CAErD,MAAM,UAAU,EAAE,SAAS,IAAI,cAC7B,OAAO,oBACL,QAAQ,KAAK,CAAC,QAAQ;EAAE,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GAAG,WAAW,OAAO,CAAC,CACzF;CACF,MAAM,QAAQ,OAAO,oBAAoB,OAAe,MAAM,KAAK,IAAI,SAAS,CAAC;CAEjF,IAAI,UAAU;CAEd,IAAI,OAAiB;CACrB,IAAI;CACJ,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI,eAA4B;EAC9D;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAa,QAAQ,CAAC;CAEpE,OAAO,MAAM;EACX,MAAM,SAAS,QAAQ;EACvB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,QAAQ,SAAS;EACvE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,QAAQ,aAAa,MAAM;EAE/E;EAEA,MAAM,OAAO,MAAM,OAAO;GAAE,GAAG;GAAQ;EAAQ,CAAC;EAKhD,IAAI,KAAK,SAAS,OAAO,KAAK;OACzB,YAAY,KAAK;EAEtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EACtE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,OAAO,aAAa,MAAM;EAE9E,IAAI,CAAC,KAAK,SAAS;GACjB,MAAM,WAAW,YAAY,KAAK,KAAK;GAIvC,IAAI,CAAC,SAAS,SAAS;IACrB,KAAK,MAAM,UAAU,SAAS;IAC9B,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;GAC7C;GACA,IAAI,CAAC,SAAS,MAAM,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;EACjE;EAEA,IAAI,KAAK,SAAS;GAChB,MAAM,SAAS,MAAM;IAAE,GAAG;IAAO,MAAM,KAAK;GAAK,CAAC;GAClD,IAAI,CAAC,OAAO,SAAS,OAAO,WAAW,QAAQ,OAAO,OAAO,KAAK;GAClE,IAAI,OAAO,MAAM,OAAO,WAAW,KAAK,KAAK,MAAM,KAAK;EAC1D;EAGA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAU,OAAO,SAAS;EAGxE,MAAM,UAAU,UAAU,OAAO;EACjC,IAAI,MAAM,UAAU,WAAW,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EAEnF,MAAM,QAAQ,MAAM,MAAM,OAAO;EACjC,IAAI,CAAC,MAAM,SAAS;GAClB,MAAM,aAAa,QAAQ;GAC3B,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,YAAY,SAAS;GAC3E,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,YAAY,aAAa,MAAM;GAEnF,OAAO,WAAW,QAAQ,MAAM,OAAO,UAAU;EACnD;CACF;AACF;;;ACzIA,MAAM,aAAgB,SACpB,OAAO,SAAS;AAwBlB,MAAa,UAAUC,cAAAA,cAA8B;AAErD,MAAa,aAAa,WAAuC;CAC/D,IAAI,WAAW,UAAU,OAAO,OAAO,OAAO,OAAO;CAErD,IAAI,OAAO,UAAU,WAAW;EAC9B,IAAI,OAAO,kBAAkB,OAAO,OAAO,OAAO;EAElD,OAAOC,yBAAAA,iBACL,OAAO,OAAO,WAAW,WAAW,OAAO,SAAS,uBACtD;CACF;CAEA,uBAAO,IAAI,MAAM,YAAY,OAAO,MAAM,SAAS,OAAO,QAAQ,WAAW;AAC/E;AAEA,MAAa,UAAyD,EACpE,SACA,MACA,QACA,QACA,OACA,QACA,GAAG,sBACoC;CACvC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAErE,MAAM,SAAS,SAAa,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;CAE5E,MAAM,kBAAqB;CAG3B,MAAM,WAAWC,cAAAA,YAA6B;EAC5C,SAAS,UAAU,IAAI,IAAI,CAAC,IAAI,MAAM,UAAU,CAAC;EACjD,OAAO;EACP,SAAS;EACT,SAAS;EACT,MAAM;CACR,CAAC;CACD,MAAM,kBAAkB,SACtB,SAAS,IAAI;EAAE,GAAG,SAAS,IAAI;EAAG,GAAG;CAAK,CAAC;CAE7C,MAAM,eAAe,SAAoC;EACvD,eAAe;GAAE,SAAS,KAAK;GAAS,SAAS,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;EAChF,OAAO,MAAM,IAAI;CACnB;CAGA,MAAM,UAAU,WAA0B;EACxC,eAAe;GACb,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT;CAIA,MAAM,eAAe,YAA4B;EAC/C,eAAe,EAAE,OAAO,aAAa,CAAC;EAEtC,OAAO,OAAO,oBAAoB;GAChC,UAAU,eAAe;GACzB,OAAO,QAAQ,SAAS;EAC1B,CAAC;CACH;CAEA,MAAM,YAAY,gBAAgB,OAAO,IAAI,KAAK,YAAY,IAAI;CAGlE,MAAM,sBAAsB,OAAc,cAAsB;EAC9D,MAAM,SAAsB;GAAE,SAAS;GAAG,SAAS,IAAI,IAAI;GAAW,MAAM;EAAK;EAEjF,OAAO,UAAU,UACb,WAAW,QAAQ,QAAQ,UAAU,MAAM,IAC3C,WAAW,QAAQ,OAAO,MAAM;CACtC;CAEA,MAAM,QAAQ,KAAK,YAAoC;EACrD,IAAI,WAAW,UAAU;EACzB,IAAI,UAAU,IAAI,GAAG;GACnB,MAAM,YAAY,IAAI;GACtB,MAAM,YAAY,MAAM,YAAY,IAAI;GACxC,IAAI,CAAC,UAAU,SAAS,OAAO,OAAO,mBAAmB,UAAU,OAAO,SAAS,CAAC;GACpF,WAAW,UAAU;EACvB;EACA,eAAe;GAAE,SAAS,MAAM,QAAQ;GAAG,OAAO;EAAU,CAAC;EAE7D,OAAO,OACL,MAAM,SAAS;GACb,GAAG;GACH,SAAS,YAAY,OAAO;IAAE,GAAG;IAAS,MAAM;GAAS,CAAC;GAC1D,OAAO;GACP,QAAQ;EACV,CAAC,CACH;CACF,CAAC;CAED,MAAM,QAAQ,WAAoB,aAAa,MAAM,MAAM;CAC3D,MAAM,aAAa,aACjB,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAO,OAAO,cAA6B;EAC/C,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ;GAC3B,MAAM,QAAQ,SAAS,OAAO,IAAI;GAClC,IAAI,CAAC,OAAO,OAAO,OAAO;GAC1B,MAAM,YAAY,QAAQ,KAAK,KAAK;EACtC;EACA,MAAM,QAAQ,UAAU,MAAM;EAC9B,MAAM,YAAY,QAAQ,KAAK,KAAK;CACtC;CAEA,MAAM,WAAW;EACf;EACA;EACA;EACA;CACF;CAEA,QAAQ,KAAK,QAAQ;CAErB,OAAO;EACL,IAAI,QAAQ;GACV,OAAO,SAAS,IAAI,CAAC,CAAC;EACxB;EACA;EACA,GAAG;CACL;AACF;;;AC9KA,MAAM,UAA0C;CAC9C,SAAS,CAAC,WAAW,YAAY;CACjC,YAAY,CAAC,SAAS;CACtB,QAAQ,CAAC,OAAO;AAClB;;;;;;;AAQA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAW;EAAc;CAAa;CAC3D,YAAY,CAAC,WAAW,SAAS;CACjC,QAAQ;EAAC;EAAS;EAAa;CAAY;AAC7C;AAIA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAY;CAAY;CAC7C,YAAY,CAAC,WAAW;CACxB,QAAQ,CAAC,UAAU,UAAU;AAC/B;;;;;;;;AASA,MAAM,cAAqC,WAAiC;CAC1E,MAAM,MAAM;EAAC,GAAG,OAAO;EAAS,GAAG,OAAO;EAAY,GAAG,OAAO;CAAM;CAEtE,MAAM,UAA+B,IAAI,IAAI,OAAO,OAAO;CAC3D,MAAM,aAAkC,IAAI,IAAI,OAAO,UAAU;CACjE,MAAM,SAA8B,IAAI,IAAI,OAAO,MAAM;CACzD,MAAM,2BAAgC,IAAI,IAAI,CAAC,GAAG,OAAO,YAAY,GAAG,OAAO,MAAM,CAAC;CACtF,MAAM,QAA6B,IAAI,IAAY,GAAG;CAEtD,OAAO;EACL,YAAY,WAAmB,QAAQ,IAAI,MAAM;EACjD,aAAa,WAAmB,SAAS,IAAI,MAAM;EACnD,eAAe,WAAmB,WAAW,IAAI,MAAM;EACvD,WAAW,WAAmB,OAAO,IAAI,MAAM;EAC/C,UAAU,UAAmC,MAAM,IAAI,KAAK;EAC5D,WAAW,YAAoB;GAC7B,WAAW,QAAQ,IAAI,MAAM;GAC7B,YAAY,SAAS,IAAI,MAAM;GAC/B,cAAc,WAAW,IAAI,MAAM;GACnC,UAAU,OAAO,IAAI,MAAM;EAC7B;EACA,UAAU;GAAE;GAAS;GAAY;GAAQ;EAAS;EAClD,OAAO,OAAO,YACZ,IAAI,KAAK,WAAW,CAAC,OAAO,YAAY,GAAG,MAAM,CAAC,CACpD;CACF;AACF;;;;;;;AAQA,MAAa,YAAY;CACvB,SAAS,WAAW,OAAO;CAC3B,OAAO,WAAW,KAAK;CACvB,OAAO,WAAW,KAAK;AACzB;;;ACzFA,MAAM,2BAA2B;AAIjC,MAAM,eAAe,UACnB,iBAAiB,aAChBC,0BAAAA,WAAW,KAAK,MAAM,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,WAAW;;AAGnF,MAAa,yBAAyB;CACpC,IAAI,WAAW;CAEf,OAAO;EACL,aAAa;GACX,WAAW;EACb;EACA,cAAc,UAAiB,YAAY,KAAK,KAAK,EAAE,WAAW;CACpE;AACF"}
+{"version":3,"file":"transientRetries-CM7rAEXQ.cjs","names":["createAbortError","createEmitter","createAbortError","createStore","isApiError"],"sources":["../src/utils/async/delay.ts","../src/utils/async/lazy.ts","../src/utils/async/result.ts","../src/utils/async/poll/utils.ts","../src/utils/async/poll/backoff.ts","../src/utils/async/poll/pollLoop.ts","../src/utils/async/poll/poll.ts","../src/domain/jobStatus.ts","../src/clients/transientRetries.ts"],"sourcesContent":["import { createAbortError } from '../createAbortError';\n\nexport const delay = (timeout: number, signal?: AbortSignal) =>\n  new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) return reject(createAbortError(signal.reason));\n\n    const onAbort = () => {\n      clearTimeout(timeoutId);\n      reject(createAbortError(signal?.reason));\n    };\n\n    // `once: true` only detaches the listener once the event fires, so the timeout path has to\n    // detach it explicitly — a caller reusing one signal across many delays (`poll` does) would\n    // otherwise pile up a listener per delay for as long as the signal is alive.\n    const timeoutId = setTimeout(() => {\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    }, timeout);\n\n    signal?.addEventListener('abort', onAbort, { once: true });\n  });\n","import type { TaskFn } from './types';\n\n/**\n * Runs `task` once and replays its promise to every later caller.\n *\n * - A rejection is not cached: the next call retries, so a transient failure never sticks.\n * - Callers that joined the failed run reject with its error.\n */\nexport const lazy = <T>(task: TaskFn<T>): (() => Promise<Awaited<T>>) => {\n  let value: Promise<Awaited<T>> | null = null;\n\n  // async wrapper so a synchronous throw from `task` rejects rather than throws.\n  const runTask = async (): Promise<Awaited<T>> => await task();\n\n  return () => {\n    value ??= runTask().catch((error: unknown) => {\n      value = null;\n      throw error;\n    });\n    return value;\n  };\n};\n","export type Success<T> = { success: true; data: T };\nexport type Failure<E extends Error> = { success: false; error: E };\nexport type Result<T, E extends Error = Error> = Success<T> | Failure<E>;\n\n// A task that returns a promise is a type error: the wrapper would report success before it\n// settles, and the rejection would go unhandled. Use the `*Async` sibling.\ntype NotPromise<T> = T extends PromiseLike<unknown> ? never : T;\n\nexport const asError = (thrown: unknown) =>\n  thrown instanceof Error ? thrown : new Error(String(thrown), { cause: thrown });\n\nconst success = <T>(data: T): Result<T, never> => ({ success: true, data });\nconst failure = <E extends Error>(error: E): Result<never, E> => ({ success: false, error });\nconst isSuccess = <T, E extends Error>(result: Result<T, E>): result is Success<T> =>\n  result.success;\nconst isFailure = <T, E extends Error>(result: Result<T, E>): result is Failure<E> =>\n  !result.success;\n\nconst map = <T, E extends Error, U>(result: Result<T, E>, fn: (data: T) => U): Result<U, E> =>\n  result.success ? success(fn(result.data)) : result;\n\nconst mapError = <T, E extends Error, F extends Error>(\n  result: Result<T, E>,\n  fn: (error: E) => F,\n): Result<T, F> => (result.success ? result : failure(fn(result.error)));\n\nconst andThen = <T, E extends Error, U, F extends Error>(\n  result: Result<T, E>,\n  fn: (data: T) => Result<U, F>,\n): Result<U, E | F> => (result.success ? fn(result.data) : result);\n\nconst match = <T, E extends Error, R>(\n  result: Result<T, E>,\n  onSuccess: (data: T) => R,\n  onFailure: (error: E) => R,\n): R => (result.success ? onSuccess(result.data) : onFailure(result.error));\n\n// A side effect on a success; the result itself passes through untouched, same instance.\nconst tap = <T, E extends Error>(result: Result<T, E>, fn: (data: T) => void): Result<T, E> => {\n  if (result.success) fn(result.data);\n  return result;\n};\n\nconst unwrap = <T, E extends Error>(result: Result<T, E>): T => {\n  if (result.success) return result.data;\n  throw result.error;\n};\n\nconst unwrapOr = <T, E extends Error, U>(result: Result<T, E>, fallback: U): T | U =>\n  result.success ? result.data : fallback;\n\nconst tryCatch = <T>(task: () => NotPromise<T>): Result<T> => {\n  try {\n    return success(task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst tryCatchAsync = async <T>(task: () => T | PromiseLike<T>): Promise<Result<T>> => {\n  try {\n    return success(await task());\n  } catch (thrown) {\n    return failure(asError(thrown));\n  }\n};\n\nconst fromThrowable =\n  <A extends unknown[], R>(fn: (...args: A) => NotPromise<R>) =>\n  (...args: A): Result<R> =>\n    tryCatch(() => fn(...args));\n\nconst fromThrowableAsync =\n  <A extends unknown[], R>(fn: (...args: A) => R | PromiseLike<R>) =>\n  (...args: A): Promise<Result<R>> =>\n    tryCatchAsync(() => fn(...args));\n\nexport const Result = {\n  success,\n  failure,\n  isSuccess,\n  isFailure,\n  map,\n  mapError,\n  andThen,\n  match,\n  tap,\n  unwrap,\n  unwrapOr,\n  tryCatch,\n  tryCatchAsync,\n  fromThrowable,\n  fromThrowableAsync,\n};\n","/**\n * The longest delay a timer can hold: `setTimeout` takes a 32-bit signed number of milliseconds,\n * about 24.9 days.\n *\n * - Above it the delay wraps: Node warns and fires after 1 ms, so a long wait becomes a busy loop.\n * - It bounds a backoff curve and a poll's timeout alike, since both end up in a timer.\n */\nexport const MAX_TIMER_DELAY = 2 ** 31 - 1;\n\nexport const clamp = (value: number, min: number, max = Infinity) =>\n  Math.min(Math.max(value, min), max);\n\nexport const finiteOr = (value: number, fallback: number) =>\n  Number.isFinite(value) ? value : fallback;\n\n/** A signal that never aborts, so an input nobody gave costs no branch of its own. */\nexport const neverAborts = () => new AbortController().signal;\n","import { clamp, finiteOr, MAX_TIMER_DELAY } from './utils';\n\nexport type Jitter =\n  | 'none' // delay\n  | 'full' // [0, delay)\n  | 'equal'; // [delay / 2, delay)\n\ntype Backoff =\n  | { type: 'constant'; interval: number } //   3000, 3000, 3000, ...\n  | { type: 'linear'; initialInterval: number; step: number } // 1000, 2000, 3000, …\n  | { type: 'exponential'; initialInterval: number; factor?: number }; // 1000, 2000, 4000, 8000, …\n\ntype RandomFn = () => number;\ntype JitterFn = (delay: number) => number;\ntype BackoffFn = (attempt: number) => number;\n\nexport type BackoffDef = {\n  jitter?: Jitter;\n  maxInterval?: number;\n  random?: RandomFn;\n} & Backoff;\n\nconst MIN_STEP = 500;\nconst MIN_FACTOR = 2;\nconst MIN_INTERVAL = 500;\n\nexport const createBackoff = ({\n  jitter = 'none',\n  maxInterval: _maxInterval = MAX_TIMER_DELAY,\n  random = Math.random,\n  ...backoff\n}: BackoffDef): BackoffFn => {\n  const backoffFn: BackoffFn = (attempt) => {\n    if (backoff.type === 'linear') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const step = clamp(finiteOr(backoff.step, MIN_STEP), MIN_STEP);\n\n      return interval + step * (attempt - 1);\n    }\n    if (backoff.type === 'exponential') {\n      const interval = clamp(finiteOr(backoff.initialInterval, MIN_INTERVAL), MIN_INTERVAL);\n      const factor = clamp(finiteOr(backoff.factor ?? MIN_FACTOR, MIN_FACTOR), MIN_FACTOR);\n\n      return interval * factor ** (attempt - 1);\n    }\n\n    return clamp(finiteOr(backoff.interval, MIN_INTERVAL), MIN_INTERVAL);\n  };\n\n  const jitterFn: JitterFn = (delay) => {\n    if (jitter === 'none') return delay;\n    if (jitter === 'full') return delay * random();\n    return delay / 2 + (delay / 2) * random(); // equal\n  };\n\n  const maxInterval = clamp(finiteOr(_maxInterval, MAX_TIMER_DELAY), MIN_INTERVAL, MAX_TIMER_DELAY);\n  return (_attempt) => {\n    const attempt = clamp(finiteOr(Math.trunc(_attempt), 1), 1);\n    const capped = Math.min(backoffFn(attempt), maxInterval);\n    // Floored after the jitter, not before: `full` jitter multiplies by a random fraction, so a floor\n    // applied to the curve alone leaves sub-millisecond gaps between attempts.\n    return clamp(finiteOr(jitterFn(capped), MIN_INTERVAL), MIN_INTERVAL, maxInterval);\n  };\n};\n","import { delay } from '../delay';\nimport { Result } from '../result';\n\nimport { type BackoffDef, createBackoff } from './backoff';\nimport { clamp, finiteOr, MAX_TIMER_DELAY, neverAborts } from './utils';\n\ntype Clock = {\n  wait: (ms: number, signal?: AbortSignal) => Promise<void>;\n  now: () => number;\n};\n\nexport type PollContext = {\n  attempt: number;\n  elapsed: number;\n};\n\n/** The context plus the answer it is about: what `until` decides on, and what an ending reports. */\nexport type PollTick<T> = PollContext & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T> = PollTick<T> &\n  (\n    | { state: 'done'; data: T }\n    | { state: 'timedOut' | 'exhausted'; error?: Error }\n    | { state: 'aborted'; reason?: unknown }\n    | { state: 'errored'; error: Error }\n  );\n\nexport type PollOptions<T> = {\n  pollFn: (context: PollContext & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  signal?: AbortSignal;\n  backoff?: BackoffDef;\n  isRetryable?: (error: Error) => boolean;\n  maxAttempts?: number;\n  timeout?: number;\n  clock?: Clock;\n};\n\n/** One constructor per ending, so a result is built the same way wherever a poll ends. */\nexport const pollResult = {\n  done: <T>(data: T, context: PollTick<T>): PollResult<T> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T>(error: Error, context: PollTick<T>): PollResult<T> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T>(context: PollTick<T>, error?: Error): PollResult<T> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T>(context: PollTick<T>, reason: unknown): PollResult<T> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T>({\n  pollFn: _pollFn,\n  until: _until,\n  signal: callerSignal = neverAborts(),\n  backoff: backoffDef = { type: 'constant', interval: 3000 },\n  clock = { wait: (ms, signal) => delay(ms, signal), now: () => performance.now() },\n  isRetryable: _isRetryable = () => false,\n  maxAttempts: _maxAttempts = Infinity,\n  timeout: _timeout = Infinity,\n}: PollOptions<T>): Promise<PollResult<T>> => {\n  // A deadline ends up in a timer, so a finite one is bounded by what a timer can hold. `Infinity`\n  // is answered before the clamp: it means no deadline, and clamping would make it the longest one.\n  const requested = finiteOr(_timeout, Infinity);\n  const timeout = requested === Infinity ? Infinity : clamp(requested, 0, MAX_TIMER_DELAY);\n  const maxAttempts = Math.trunc(clamp(finiteOr(_maxAttempts, Infinity), 0));\n\n  const timeoutSignal = timeout === Infinity ? neverAborts() : AbortSignal.timeout(timeout);\n  const anySignal = AbortSignal.any([callerSignal, timeoutSignal]);\n  const anyAborted = Promise.withResolvers<never>();\n\n  anySignal.addEventListener('abort', () => anyAborted.reject(anySignal.reason), {\n    once: true,\n  });\n  void anyAborted.promise.catch(() => undefined);\n\n  const backoffFn = createBackoff(backoffDef);\n  const startedAt = clock.now();\n\n  const until = Result.fromThrowable(_until);\n  const isRetryable = Result.fromThrowable(_isRetryable);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ attempt: at, elapsed }: PollContext) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([_pollFn({ attempt: at, elapsed, signal: anySignal }), anyAborted.promise]),\n    );\n  const sleep = Result.fromThrowableAsync((ms: number) => clock.wait(ms, anySignal));\n\n  let attempt = 0;\n  // What a retry swallowed: the poll carries it to whichever ending runs out first.\n  let last: T | null = null;\n  let lastError: Error | undefined;\n  const context = (at = clock.now() - startedAt): PollTick<T> => ({\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T>(context());\n\n  while (true) {\n    const before = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(before, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(before, callerSignal.reason);\n\n    attempt++;\n    // The attempt it is, not the one before it — `before` was read to decide whether to make it.\n    const poll = await pollFn({ ...before, attempt });\n\n    // What the attempt produced, recorded before the tick that reports it: on any ending but `done`\n    // these two are the only account of what the poll saw, and reading them one attempt behind is\n    // reading the wrong answer.\n    if (poll.success) last = poll.data;\n    else lastError = poll.error;\n\n    const after = context();\n    if (timeoutSignal.aborted) return pollResult.timedOut(after, lastError);\n    if (callerSignal.aborted) return pollResult.aborted(after, callerSignal.reason);\n\n    if (!poll.success) {\n      const canRetry = isRetryable(poll.error);\n\n      // A predicate that throws cannot ask for a retry. The request's own failure stays the reported\n      // one — it is the type a caller's guards expect — and the predicate's rides along as its cause.\n      if (!canRetry.success) {\n        poll.error.cause ??= canRetry.error;\n        return pollResult.errored(poll.error, after);\n      }\n      if (!canRetry.data) return pollResult.errored(poll.error, after);\n    }\n\n    if (poll.success) {\n      const isDone = until({ ...after, data: poll.data });\n      if (!isDone.success) return pollResult.errored(isDone.error, after);\n      if (isDone.data) return pollResult.done(poll.data, after);\n    }\n\n    // exhausted\n    if (attempt >= maxAttempts) return pollResult.exhausted(after, lastError);\n\n    // sleep\n    const backoff = backoffFn(attempt);\n    if (after.elapsed + backoff >= timeout) return pollResult.timedOut(after, lastError);\n\n    const slept = await sleep(backoff);\n    if (!slept.success) {\n      const afterSleep = context();\n      if (timeoutSignal.aborted) return pollResult.timedOut(afterSleep, lastError);\n      if (callerSignal.aborted) return pollResult.aborted(afterSleep, callerSignal.reason);\n\n      return pollResult.errored(slept.error, afterSleep);\n    }\n  }\n};\n","import { createAbortError } from '../../createAbortError';\nimport { createEmitter, createStore } from '../../store';\nimport { lazy } from '../lazy';\nimport { Result } from '../result';\n\nimport {\n  type PollContext,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  pollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollKey = readonly unknown[];\n\n/** `requesting` is the request the poll starts from, before any attempt; `polling` is the attempts. */\nexport type PollState = 'idle' | 'requesting' | 'polling' | PollResultState;\nexport type PollSnapshot<T = unknown> = PollTick<T> & { pollKey: PollKey; state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>, error: Error) => Error | undefined;\n\nexport type Poller<T, S = T> = {\n  readonly state: PollState;\n  start: () => Promise<PollResult<T>>;\n  wait: (onFailure?: OnFailure<T>) => Promise<S>;\n  stop: (reason?: string) => void;\n  subscribe: (listener: (snapshot: PollSnapshot<T>) => void) => () => void;\n  debug: () => PollSnapshot<T>;\n};\n\ntype InitRequest<R> = (signal: AbortSignal) => Promise<R>;\n\nconst isRequest = <R>(init: R | InitRequest<R> | undefined): init is InitRequest<R> =>\n  typeof init === 'function';\n\n/**\n * The loop's options plus what names the poll and what it starts from.\n *\n * - `pollKey` names the poll; the loop never sees it. Given as a function of `init`, it is what the\n *   poll started from that names it, once that is known.\n * - `init` is a value or a request for it (an enqueue), handed to `pollFn`; a request runs first.\n * - `failed` reads a `done` value for `wait`: what it returns, `wait` throws. A client that\n *   knows what gets through declares it as `Poller<T, S>` on its own return.\n */\nexport type PollerOptions<T, K extends PollKey = PollKey, R = undefined> = Omit<\n  PollOptions<T>,\n  'pollFn' | 'until'\n> & {\n  pollKey: K | ((init: R) => K);\n  init?: R | InitRequest<R>;\n  pollFn: (context: PollContext & { init: R; signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T> & { data: T }) => boolean;\n  failed?: (data: T) => Error | undefined;\n};\n\nexport type ObservedPoller = Pick<Poller<unknown>, 'stop' | 'subscribe' | 'debug' | 'start'>;\n\nexport const emitter = createEmitter<ObservedPoller>();\n\nexport const failureOf = (result: PollResult<unknown>): Error => {\n  if ('error' in result && result.error) return result.error;\n\n  if (result.state === 'aborted') {\n    if (result.reason instanceof Error) return result.reason;\n\n    return createAbortError(\n      typeof result.reason === 'string' ? result.reason : 'The poll was stopped.',\n    );\n  }\n\n  return new Error(`The poll ${result.state} after ${result.attempt} attempts.`);\n};\n\nexport const poller = <T, K extends PollKey = PollKey, R = undefined>({\n  pollKey,\n  init,\n  signal,\n  pollFn,\n  until,\n  failed,\n  ...pollLoopOptions\n}: PollerOptions<T, K, R>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  const keyOf = (from: R) => (typeof pollKey === 'function' ? pollKey(from) : pollKey);\n  // An absent `init` is the `undefined` that `R` defaults to, which the body cannot prove.\n  const givenInit = (): R => init as R;\n\n  // snapshoting; the key is unknown while a request for `init` is out, so it starts empty then\n  const snapshot = createStore<PollSnapshot<T>>({\n    pollKey: isRequest(init) ? [] : keyOf(givenInit()),\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot<T>>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (tick: PollTick<T> & { data: T }) => {\n    updateSnapshot({ attempt: tick.attempt, elapsed: tick.elapsed, last: tick.data });\n    return until(tick);\n  };\n\n  // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n  const settle = (result: PollResult<T>) => {\n    updateSnapshot({\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  };\n\n  // The request runs under the poller's signal, before the first attempt. The poll's deadline\n  // bounds the polling, not this request.\n  const requestInit = (request: InitRequest<R>) => {\n    updateSnapshot({ state: 'requesting' });\n\n    return Result.tryCatchAsync(() => {\n      anySignal.throwIfAborted();\n      return request(anySignal);\n    });\n  };\n\n  const now = () => pollLoopOptions.clock?.now() ?? performance.now();\n\n  // How a poll ends when its request did: no attempt was made, and a stop reads as an abort.\n  const endedBeforePolling = (error: Error, startedAt: number) => {\n    const before: PollTick<T> = { attempt: 0, elapsed: now() - startedAt, last: null };\n\n    return anySignal.aborted\n      ? pollResult.aborted(before, anySignal.reason)\n      : pollResult.errored(error, before);\n  };\n\n  const start = lazy(async (): Promise<PollResult<T>> => {\n    let resolved = givenInit();\n    if (isRequest(init)) {\n      const startedAt = now();\n      const requested = await requestInit(init);\n      if (!requested.success) return settle(endedBeforePolling(requested.error, startedAt));\n      resolved = requested.data;\n    }\n    updateSnapshot({ pollKey: keyOf(resolved), state: 'polling' });\n\n    return settle(\n      await pollLoop({\n        ...pollLoopOptions,\n        pollFn: (context) => pollFn({ ...context, init: resolved }),\n        until: handleUntil,\n        signal: anySignal,\n      }),\n    );\n  });\n\n  const stop = (reason?: string) => pollerSignal.abort(reason);\n  const subscribe = (listener: (snapshot: PollSnapshot<T>) => void) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug = snapshot.get;\n\n  const wait = async (onFailure?: OnFailure<T>) => {\n    const result = await start();\n    if (result.state === 'done') {\n      const error = failed?.(result.data);\n      if (!error) return result.data;\n      throw onFailure?.(result, error) ?? error;\n    }\n    const error = failureOf(result);\n    throw onFailure?.(result, error) ?? error;\n  };\n\n  const controls = {\n    stop,\n    subscribe,\n    debug,\n    start,\n  };\n\n  emitter.emit(controls);\n\n  return {\n    get state() {\n      return snapshot.get().state;\n    },\n    wait,\n    ...controls,\n  };\n};\n","import type { QueryJobStatus } from '../clients/queryService/types';\nimport type { QueueJobStatus } from '../clients/queue/types';\nimport type { StorageJobStatus } from '../clients/storage/jobs/types';\n\n/**\n * One service's statuses split by what the job is doing.\n *\n * - Groups are disjoint and cover the vocabulary; terminal = successful + failed.\n * - The annotation makes a renamed generated status fail the build here.\n */\ntype StatusGroups<Status extends string> = {\n  running: readonly Status[];\n  successful: readonly Status[];\n  failed: readonly Status[];\n};\n\n/** A service's statuses as named constants — `SUCCESS: 'success'`. */\ntype StatusNames<Status extends string> = { [K in Status as Uppercase<K>]: K };\n\n// Mirrors `StorageJobStatus` in `connection`.\nconst STORAGE: StatusGroups<StorageJobStatus> = {\n  running: ['waiting', 'processing'],\n  successful: ['success'],\n  failed: ['error'],\n};\n\n/**\n * Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.\n *\n * - `terminating` is running until `terminated`.\n * - The split mirrors the job's `isSuccess`; with a job in hand, read `job.isSuccess` instead.\n */\nconst QUEUE: StatusGroups<QueueJobStatus> = {\n  running: ['created', 'waiting', 'processing', 'terminating'],\n  successful: ['success', 'warning'],\n  failed: ['error', 'cancelled', 'terminated'],\n};\n\n// Mirrors `JobState` in `go-monorepo` (`services/query/internal/repository/models`).\n// `canceled` with one `l`, unlike the other services.\nconst QUERY: StatusGroups<QueryJobStatus> = {\n  running: ['created', 'enqueued', 'processing'],\n  successful: ['completed'],\n  failed: ['failed', 'canceled'],\n};\n\n/**\n * One service's status predicates, sets and named constants.\n *\n * - `isSuccessful` / `isFailed` are `false` while running.\n * - `isKnown` narrows an untyped string.\n * - `named` is asserted: `Object.fromEntries` can't prove the key mapping.\n */\nconst forService = <Status extends string>(groups: StatusGroups<Status>) => {\n  const all = [...groups.running, ...groups.successful, ...groups.failed];\n\n  const running: ReadonlySet<Status> = new Set(groups.running);\n  const successful: ReadonlySet<Status> = new Set(groups.successful);\n  const failed: ReadonlySet<Status> = new Set(groups.failed);\n  const terminal: ReadonlySet<Status> = new Set([...groups.successful, ...groups.failed]);\n  const known: ReadonlySet<string> = new Set<string>(all);\n\n  return {\n    isRunning: (status: Status) => running.has(status),\n    isTerminal: (status: Status) => terminal.has(status),\n    isSuccessful: (status: Status) => successful.has(status),\n    isFailed: (status: Status) => failed.has(status),\n    isKnown: (value: string): value is Status => known.has(value),\n    describe: (status: Status) => ({\n      isRunning: running.has(status),\n      isTerminal: terminal.has(status),\n      isSuccessful: successful.has(status),\n      isFailed: failed.has(status),\n    }),\n    statuses: { running, successful, failed, terminal },\n    named: Object.fromEntries(\n      all.map((status) => [status.toUpperCase(), status]),\n    ) as StatusNames<Status>,\n  };\n};\n\n/**\n * Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.\n *\n * - Never merge services: labels overlap but their meaning differs.\n * - `query` covers the query job, not its statements (which have `notExecuted`).\n */\nexport const jobStatus = {\n  storage: forService(STORAGE),\n  queue: forService(QUEUE),\n  query: forService(QUERY),\n};\n","import { isApiError } from '../fetchClient';\n\nconst MAX_CONSECUTIVE_FAILURES = 5;\n\n// A read that failed in transit, or that the service answered with a 5xx or 429. The job runs\n// server-side either way, so a later read can still see it finish.\nconst isTransient = (error: Error) =>\n  error instanceof TypeError ||\n  (isApiError(error) && (error.response.status >= 500 || error.response.status === 429));\n\n/** A job poll's retry rule: a transient read is retried up to five times in a row; one that succeeds resets the count. */\nexport const transientRetries = () => {\n  let failures = 0;\n\n  return {\n    reset: () => {\n      failures = 0;\n    },\n    isRetryable: (error: Error) => isTransient(error) && ++failures < MAX_CONSECUTIVE_FAILURES,\n  };\n};\n"],"mappings":";;;;AAEA,MAAa,SAAS,SAAiB,WACrC,IAAI,SAAe,SAAS,WAAW;CACrC,IAAI,QAAQ,SAAS,OAAO,OAAOA,yBAAAA,iBAAiB,OAAO,MAAM,CAAC;CAElE,MAAM,gBAAgB;EACpB,aAAa,SAAS;EACtB,OAAOA,yBAAAA,iBAAiB,QAAQ,MAAM,CAAC;CACzC;CAKA,MAAM,YAAY,iBAAiB;EACjC,QAAQ,oBAAoB,SAAS,OAAO;EAC5C,QAAQ;CACV,GAAG,OAAO;CAEV,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,CAAC;;;;;;;;ACZH,MAAa,QAAW,SAAiD;CACvE,IAAI,QAAoC;CAGxC,MAAM,UAAU,YAAiC,MAAM,KAAK;CAE5D,aAAa;EACX,UAAU,QAAQ,CAAC,CAAC,OAAO,UAAmB;GAC5C,QAAQ;GACR,MAAM;EACR,CAAC;EACD,OAAO;CACT;AACF;;ACbA,MAAa,WAAW,WACtB,kBAAkB,QAAQ,SAAS,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AAEhF,MAAM,WAAc,UAA+B;CAAE,SAAS;CAAM;AAAK;AACzE,MAAM,WAA4B,WAAgC;CAAE,SAAS;CAAO;AAAM;AAC1F,MAAM,aAAiC,WACrC,OAAO;AACT,MAAM,aAAiC,WACrC,CAAC,OAAO;AAEV,MAAM,OAA8B,QAAsB,OACxD,OAAO,UAAU,QAAQ,GAAG,OAAO,IAAI,CAAC,IAAI;AAE9C,MAAM,YACJ,QACA,OACkB,OAAO,UAAU,SAAS,QAAQ,GAAG,OAAO,KAAK,CAAC;AAEtE,MAAM,WACJ,QACA,OACsB,OAAO,UAAU,GAAG,OAAO,IAAI,IAAI;AAE3D,MAAM,SACJ,QACA,WACA,cACO,OAAO,UAAU,UAAU,OAAO,IAAI,IAAI,UAAU,OAAO,KAAK;AAGzE,MAAM,OAA2B,QAAsB,OAAwC;CAC7F,IAAI,OAAO,SAAS,GAAG,OAAO,IAAI;CAClC,OAAO;AACT;AAEA,MAAM,UAA8B,WAA4B;CAC9D,IAAI,OAAO,SAAS,OAAO,OAAO;CAClC,MAAM,OAAO;AACf;AAEA,MAAM,YAAmC,QAAsB,aAC7D,OAAO,UAAU,OAAO,OAAO;AAEjC,MAAM,YAAe,SAAyC;CAC5D,IAAI;EACF,OAAO,QAAQ,KAAK,CAAC;CACvB,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,gBAAgB,OAAU,SAAuD;CACrF,IAAI;EACF,OAAO,QAAQ,MAAM,KAAK,CAAC;CAC7B,SAAS,QAAQ;EACf,OAAO,QAAQ,QAAQ,MAAM,CAAC;CAChC;AACF;AAEA,MAAM,iBACqB,QACxB,GAAG,SACF,eAAe,GAAG,GAAG,IAAI,CAAC;AAE9B,MAAM,sBACqB,QACxB,GAAG,SACF,oBAAoB,GAAG,GAAG,IAAI,CAAC;AAEnC,MAAa,SAAS;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;ACtFA,MAAa,kBAAkB,KAAK,KAAK;AAEzC,MAAa,SAAS,OAAe,KAAa,MAAM,aACtD,KAAK,IAAI,KAAK,IAAI,OAAO,GAAG,GAAG,GAAG;AAEpC,MAAa,YAAY,OAAe,aACtC,OAAO,SAAS,KAAK,IAAI,QAAQ;;AAGnC,MAAa,oBAAoB,IAAI,gBAAgB,CAAC,CAAC;;ACMvD,MAAM,WAAW;AACjB,MAAM,aAAa;AACnB,MAAM,eAAe;AAErB,MAAa,iBAAiB,EAC5B,SAAS,QACT,aAAa,eAAe,iBAC5B,SAAS,KAAK,QACd,GAAG,cACwB;CAC3B,MAAM,aAAwB,YAAY;EACxC,IAAI,QAAQ,SAAS,UAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFD,MAAM,SAAS,QAAQ,MAAM,QAAQ,GAAG,QAEhC,KAAK,UAAU;EAEtC,IAAI,QAAQ,SAAS,eAInB,OAHiB,MAAM,SAAS,QAAQ,iBAAiB,YAAY,GAAG,YAG1D,IAFC,MAAM,SAAS,QAAQ,UAAU,YAAY,UAAU,GAAG,UAElD,MAAM,UAAU;EAGzC,OAAO,MAAM,SAAS,QAAQ,UAAU,YAAY,GAAG,YAAY;CACrE;CAEA,MAAM,YAAsB,UAAU;EACpC,IAAI,WAAW,QAAQ,OAAO;EAC9B,IAAI,WAAW,QAAQ,OAAO,QAAQ,OAAO;EAC7C,OAAO,QAAQ,IAAK,QAAQ,IAAK,OAAO;CAC1C;CAEA,MAAM,cAAc,MAAM,SAAS,cAAc,eAAe,GAAG,cAAc,eAAe;CAChG,QAAQ,aAAa;EACnB,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC;EAC1D,MAAM,SAAS,KAAK,IAAI,UAAU,OAAO,GAAG,WAAW;EAGvD,OAAO,MAAM,SAAS,SAAS,MAAM,GAAG,YAAY,GAAG,cAAc,WAAW;CAClF;AACF;;;ACtBA,MAAa,aAAa;CACxB,OAAU,MAAS,aAAyC;EAC1D,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAa,OAAc,aAAyC;EAClE,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAe,SAAsB,WAAkC;EACrE,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAc,SAAsB,WAAkC;EACpE,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAa,SAAsB,YAAoC;EACrE,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAU,EAChC,QAAQ,SACR,OAAO,QACP,QAAQ,eAAe,YAAY,GACnC,SAAS,aAAa;CAAE,MAAM;CAAY,UAAU;AAAK,GACzD,QAAQ;CAAE,OAAO,IAAI,WAAW,MAAM,IAAI,MAAM;CAAG,WAAW,YAAY,IAAI;AAAE,GAChF,aAAa,qBAAqB,OAClC,aAAa,eAAe,UAC5B,SAAS,WAAW,eACwB;CAG5C,MAAM,YAAY,SAAS,UAAU,QAAQ;CAC7C,MAAM,UAAU,cAAc,WAAW,WAAW,MAAM,WAAW,GAAG,eAAe;CACvF,MAAM,cAAc,KAAK,MAAM,MAAM,SAAS,cAAc,QAAQ,GAAG,CAAC,CAAC;CAEzE,MAAM,gBAAgB,YAAY,WAAW,YAAY,IAAI,YAAY,QAAQ,OAAO;CACxF,MAAM,YAAY,YAAY,IAAI,CAAC,cAAc,aAAa,CAAC;CAC/D,MAAM,aAAa,QAAQ,cAAqB;CAEhD,UAAU,iBAAiB,eAAe,WAAW,OAAO,UAAU,MAAM,GAAG,EAC7E,MAAM,KACR,CAAC;CACD,WAAgB,QAAQ,YAAY,KAAA,CAAS;CAE7C,MAAM,YAAY,cAAc,UAAU;CAC1C,MAAM,YAAY,MAAM,IAAI;CAE5B,MAAM,QAAQ,OAAO,cAAc,MAAM;CACzC,MAAM,cAAc,OAAO,cAAc,YAAY;CAErD,MAAM,UAAU,EAAE,SAAS,IAAI,cAC7B,OAAO,oBACL,QAAQ,KAAK,CAAC,QAAQ;EAAE,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GAAG,WAAW,OAAO,CAAC,CACzF;CACF,MAAM,QAAQ,OAAO,oBAAoB,OAAe,MAAM,KAAK,IAAI,SAAS,CAAC;CAEjF,IAAI,UAAU;CAEd,IAAI,OAAiB;CACrB,IAAI;CACJ,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI,eAA4B;EAC9D;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAa,QAAQ,CAAC;CAEpE,OAAO,MAAM;EACX,MAAM,SAAS,QAAQ;EACvB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,QAAQ,SAAS;EACvE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,QAAQ,aAAa,MAAM;EAE/E;EAEA,MAAM,OAAO,MAAM,OAAO;GAAE,GAAG;GAAQ;EAAQ,CAAC;EAKhD,IAAI,KAAK,SAAS,OAAO,KAAK;OACzB,YAAY,KAAK;EAEtB,MAAM,QAAQ,QAAQ;EACtB,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EACtE,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,OAAO,aAAa,MAAM;EAE9E,IAAI,CAAC,KAAK,SAAS;GACjB,MAAM,WAAW,YAAY,KAAK,KAAK;GAIvC,IAAI,CAAC,SAAS,SAAS;IACrB,KAAK,MAAM,UAAU,SAAS;IAC9B,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;GAC7C;GACA,IAAI,CAAC,SAAS,MAAM,OAAO,WAAW,QAAQ,KAAK,OAAO,KAAK;EACjE;EAEA,IAAI,KAAK,SAAS;GAChB,MAAM,SAAS,MAAM;IAAE,GAAG;IAAO,MAAM,KAAK;GAAK,CAAC;GAClD,IAAI,CAAC,OAAO,SAAS,OAAO,WAAW,QAAQ,OAAO,OAAO,KAAK;GAClE,IAAI,OAAO,MAAM,OAAO,WAAW,KAAK,KAAK,MAAM,KAAK;EAC1D;EAGA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAU,OAAO,SAAS;EAGxE,MAAM,UAAU,UAAU,OAAO;EACjC,IAAI,MAAM,UAAU,WAAW,SAAS,OAAO,WAAW,SAAS,OAAO,SAAS;EAEnF,MAAM,QAAQ,MAAM,MAAM,OAAO;EACjC,IAAI,CAAC,MAAM,SAAS;GAClB,MAAM,aAAa,QAAQ;GAC3B,IAAI,cAAc,SAAS,OAAO,WAAW,SAAS,YAAY,SAAS;GAC3E,IAAI,aAAa,SAAS,OAAO,WAAW,QAAQ,YAAY,aAAa,MAAM;GAEnF,OAAO,WAAW,QAAQ,MAAM,OAAO,UAAU;EACnD;CACF;AACF;;ACzIA,MAAM,aAAgB,SACpB,OAAO,SAAS;AAwBlB,MAAa,UAAUC,cAAAA,cAA8B;AAErD,MAAa,aAAa,WAAuC;CAC/D,IAAI,WAAW,UAAU,OAAO,OAAO,OAAO,OAAO;CAErD,IAAI,OAAO,UAAU,WAAW;EAC9B,IAAI,OAAO,kBAAkB,OAAO,OAAO,OAAO;EAElD,OAAOC,yBAAAA,iBACL,OAAO,OAAO,WAAW,WAAW,OAAO,SAAS,uBACtD;CACF;CAEA,uBAAO,IAAI,MAAM,YAAY,OAAO,MAAM,SAAS,OAAO,QAAQ,WAAW;AAC/E;AAEA,MAAa,UAAyD,EACpE,SACA,MACA,QACA,QACA,OACA,QACA,GAAG,sBACoC;CACvC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAErE,MAAM,SAAS,SAAa,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;CAE5E,MAAM,kBAAqB;CAG3B,MAAM,WAAWC,cAAAA,YAA6B;EAC5C,SAAS,UAAU,IAAI,IAAI,CAAC,IAAI,MAAM,UAAU,CAAC;EACjD,OAAO;EACP,SAAS;EACT,SAAS;EACT,MAAM;CACR,CAAC;CACD,MAAM,kBAAkB,SACtB,SAAS,IAAI;EAAE,GAAG,SAAS,IAAI;EAAG,GAAG;CAAK,CAAC;CAE7C,MAAM,eAAe,SAAoC;EACvD,eAAe;GAAE,SAAS,KAAK;GAAS,SAAS,KAAK;GAAS,MAAM,KAAK;EAAK,CAAC;EAChF,OAAO,MAAM,IAAI;CACnB;CAGA,MAAM,UAAU,WAA0B;EACxC,eAAe;GACb,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT;CAIA,MAAM,eAAe,YAA4B;EAC/C,eAAe,EAAE,OAAO,aAAa,CAAC;EAEtC,OAAO,OAAO,oBAAoB;GAChC,UAAU,eAAe;GACzB,OAAO,QAAQ,SAAS;EAC1B,CAAC;CACH;CAEA,MAAM,YAAY,gBAAgB,OAAO,IAAI,KAAK,YAAY,IAAI;CAGlE,MAAM,sBAAsB,OAAc,cAAsB;EAC9D,MAAM,SAAsB;GAAE,SAAS;GAAG,SAAS,IAAI,IAAI;GAAW,MAAM;EAAK;EAEjF,OAAO,UAAU,UACb,WAAW,QAAQ,QAAQ,UAAU,MAAM,IAC3C,WAAW,QAAQ,OAAO,MAAM;CACtC;CAEA,MAAM,QAAQ,KAAK,YAAoC;EACrD,IAAI,WAAW,UAAU;EACzB,IAAI,UAAU,IAAI,GAAG;GACnB,MAAM,YAAY,IAAI;GACtB,MAAM,YAAY,MAAM,YAAY,IAAI;GACxC,IAAI,CAAC,UAAU,SAAS,OAAO,OAAO,mBAAmB,UAAU,OAAO,SAAS,CAAC;GACpF,WAAW,UAAU;EACvB;EACA,eAAe;GAAE,SAAS,MAAM,QAAQ;GAAG,OAAO;EAAU,CAAC;EAE7D,OAAO,OACL,MAAM,SAAS;GACb,GAAG;GACH,SAAS,YAAY,OAAO;IAAE,GAAG;IAAS,MAAM;GAAS,CAAC;GAC1D,OAAO;GACP,QAAQ;EACV,CAAC,CACH;CACF,CAAC;CAED,MAAM,QAAQ,WAAoB,aAAa,MAAM,MAAM;CAC3D,MAAM,aAAa,aACjB,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAQ,SAAS;CAEvB,MAAM,OAAO,OAAO,cAA6B;EAC/C,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ;GAC3B,MAAM,QAAQ,SAAS,OAAO,IAAI;GAClC,IAAI,CAAC,OAAO,OAAO,OAAO;GAC1B,MAAM,YAAY,QAAQ,KAAK,KAAK;EACtC;EACA,MAAM,QAAQ,UAAU,MAAM;EAC9B,MAAM,YAAY,QAAQ,KAAK,KAAK;CACtC;CAEA,MAAM,WAAW;EACf;EACA;EACA;EACA;CACF;CAEA,QAAQ,KAAK,QAAQ;CAErB,OAAO;EACL,IAAI,QAAQ;GACV,OAAO,SAAS,IAAI,CAAC,CAAC;EACxB;EACA;EACA,GAAG;CACL;AACF;;AC9KA,MAAM,UAA0C;CAC9C,SAAS,CAAC,WAAW,YAAY;CACjC,YAAY,CAAC,SAAS;CACtB,QAAQ,CAAC,OAAO;AAClB;;;;;;;AAQA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAW;EAAc;CAAa;CAC3D,YAAY,CAAC,WAAW,SAAS;CACjC,QAAQ;EAAC;EAAS;EAAa;CAAY;AAC7C;AAIA,MAAM,QAAsC;CAC1C,SAAS;EAAC;EAAW;EAAY;CAAY;CAC7C,YAAY,CAAC,WAAW;CACxB,QAAQ,CAAC,UAAU,UAAU;AAC/B;;;;;;;;AASA,MAAM,cAAqC,WAAiC;CAC1E,MAAM,MAAM;EAAC,GAAG,OAAO;EAAS,GAAG,OAAO;EAAY,GAAG,OAAO;CAAM;CAEtE,MAAM,UAA+B,IAAI,IAAI,OAAO,OAAO;CAC3D,MAAM,aAAkC,IAAI,IAAI,OAAO,UAAU;CACjE,MAAM,SAA8B,IAAI,IAAI,OAAO,MAAM;CACzD,MAAM,2BAAgC,IAAI,IAAI,CAAC,GAAG,OAAO,YAAY,GAAG,OAAO,MAAM,CAAC;CACtF,MAAM,QAA6B,IAAI,IAAY,GAAG;CAEtD,OAAO;EACL,YAAY,WAAmB,QAAQ,IAAI,MAAM;EACjD,aAAa,WAAmB,SAAS,IAAI,MAAM;EACnD,eAAe,WAAmB,WAAW,IAAI,MAAM;EACvD,WAAW,WAAmB,OAAO,IAAI,MAAM;EAC/C,UAAU,UAAmC,MAAM,IAAI,KAAK;EAC5D,WAAW,YAAoB;GAC7B,WAAW,QAAQ,IAAI,MAAM;GAC7B,YAAY,SAAS,IAAI,MAAM;GAC/B,cAAc,WAAW,IAAI,MAAM;GACnC,UAAU,OAAO,IAAI,MAAM;EAC7B;EACA,UAAU;GAAE;GAAS;GAAY;GAAQ;EAAS;EAClD,OAAO,OAAO,YACZ,IAAI,KAAK,WAAW,CAAC,OAAO,YAAY,GAAG,MAAM,CAAC,CACpD;CACF;AACF;;;;;;;AAQA,MAAa,YAAY;CACvB,SAAS,WAAW,OAAO;CAC3B,OAAO,WAAW,KAAK;CACvB,OAAO,WAAW,KAAK;AACzB;;ACzFA,MAAM,2BAA2B;AAIjC,MAAM,eAAe,UACnB,iBAAiB,aAChBC,0BAAAA,WAAW,KAAK,MAAM,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,WAAW;;AAGnF,MAAa,yBAAyB;CACpC,IAAI,WAAW;CAEf,OAAO;EACL,aAAa;GACX,WAAW;EACb;EACA,cAAc,UAAiB,YAAY,KAAK,KAAK,EAAE,WAAW;CACpE;AACF"}

package/dist/{types-DODAZKEm.d.ts → types--Rp5wvaz.d.ts}

@@ -1,6 +1,5 @@
-import { c as OpenapiQueryType, l as OpenapiReturnType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-BPMr8PQJ.js";
+import { c as OpenapiQueryType, l as OpenapiReturnType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-D1mduJne.js";
 import { z } from "zod";
-//#region src/clients/chat/__generated__/schema.d.ts
 /**
  * This file was auto-generated by openapi-typescript.
  * Do not make direct changes to the file.
@@ -1579,8 +1578,6 @@ type components = {
   headers: never;
   pathItems: never;
 };
-//#endregion
-//#region src/clients/chat/types.d.ts
 type ProjectToolPolicyValue = 'blocked' | 'always_ask';
 type ProjectToolPolicy = Record<string, ProjectToolPolicyValue>;
 declare const askUserQuestionAnswersSchema: z.ZodRecord<z.ZodString, z.ZodString>;
@@ -1629,6 +1626,5 @@ type UpdateUserAgentSettingsRequest = components['schemas']['UpdateUserAgentSett
 type ToolPermissionValue = components['schemas']['ToolPermissionValue'];
 type ToolInfo = components['schemas']['ToolInfo'];
 type ToolsListResponse = components['schemas']['ToolsListResponse'];
-//#endregion
 export { components as A, UserAgentSettings as C, VotesResponse as D, VoteRequest as E, approvalGoneReasonSchema as O, UsageResponse as S, Vote as T, ToolInfo as _, ChatMessage as a, UpdateAgentSettingsRequest as b, ChatWithMessages as c, GetVotesQuery as d, HistoryResponse as f, TextPart as g, ProjectToolPolicyValue as h, Chat as i, askUserQuestionAnswersSchema as k, GetChatPath as l, ProjectToolPolicy as m, ApprovalGoneReason as n, ChatRequest as o, MessageStatus as p, AskUserQuestionAnswers as r, ChatWithMessage as s, AgentSettings as t, GetHistoryQuery as u, ToolPermissionValue as v, UserMessage as w, UpdateUserAgentSettingsRequest as x, ToolsListResponse as y };
-//# sourceMappingURL=types-DODAZKEm.d.ts.map
+//# sourceMappingURL=types--Rp5wvaz.d.ts.map

package/dist/{types-JZ0Bdlpk.d.cts → types-1IBnjBVJ.d.cts}

@@ -1,5 +1,4 @@
-import { c as OpenapiQueryType, l as OpenapiReturnType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-CL4iKFic.cjs";
-//#region src/clients/editor/__generated__/schema.d.ts
+import { c as OpenapiQueryType, l as OpenapiReturnType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-D1mduJne.cjs";
 /**
  * This file was auto-generated by openapi-typescript.
  * Do not make direct changes to the file.
@@ -1382,8 +1381,6 @@ interface operations {
     };
   };
 }
-//#endregion
-//#region src/clients/editor/types.d.ts
 type SqlSession = OpenapiReturnType<paths['/sql/sessions']['post']>;
 type CreateSqlSessionBody = OpenapiBodyType<paths['/sql/sessions']['post']>;
 type GetSqlSessionPath = OpenapiPathType<paths['/sql/sessions/{id}']['get']>;
@@ -1406,6 +1403,5 @@ type PostSqlSessionLoadPath = OpenapiPathType<paths['/sql/sessions/{id}/load']['
 type PostSqlSessionLoadBody = OpenapiBodyType<paths['/sql/sessions/{id}/load']['post']>;
 type PostSqlSessionUnloadPath = OpenapiPathType<paths['/sql/sessions/{id}/unload']['post']>;
 type PostSqlSessionUnloadBody = OpenapiBodyType<paths['/sql/sessions/{id}/unload']['post']>;
-//#endregion
 export { components as C, SqlSession as S, SessionSchema as _, GetSqlSessionTableDdlPath as a, SessionSchemaDatabase as b, PostSqlRunQueryBody as c, PostSqlSessionLoadPath as d, PostSqlSessionUnloadBody as f, Session as g, PostSqlTablePreviewPath as h, GetSqlSessionSchemaQuery as i, PostSqlRunQueryPath as l, PostSqlTablePreviewBody as m, GetSqlSessionPath as n, GetSqlSessionTableDdlQuery as o, PostSqlSessionUnloadPath as p, GetSqlSessionSchemaPath as r, GetSqlSessionsQuery as s, CreateSqlSessionBody as t, PostSqlSessionLoadBody as u, SessionSchemaBucket as v, SessionSchemaTable as x, SessionSchemaColumn as y };
-//# sourceMappingURL=types-JZ0Bdlpk.d.cts.map
+//# sourceMappingURL=types-1IBnjBVJ.d.cts.map

package/dist/{types-BZ--6pIt.d.ts → types-37vwxse4.d.cts}

@@ -1,5 +1,4 @@
-import { c as OpenapiQueryType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-BPMr8PQJ.js";
-//#region src/clients/componentsMcp/__generated__/schema.d.ts
+import { c as OpenapiQueryType, r as OpenapiBodyType, s as OpenapiPathType } from "./index-D1mduJne.cjs";
 /**
  * This file was auto-generated by openapi-typescript.
  * Do not make direct changes to the file.
@@ -2101,11 +2100,8 @@ interface operations {
     };
   };
 }
-//#endregion
-//#region src/clients/componentsMcp/types.d.ts
 type GetConnectorsQuery = NonNullable<OpenapiQueryType<paths['/connectors']['get']>>;
 type SetConnectorCredentialsPath = OpenapiPathType<paths['/connectors/{connector_id}/credentials']['put']>;
 type SetConnectorCredentialsBody = OpenapiBodyType<paths['/connectors/{connector_id}/credentials']['put']>;
-//#endregion
 export { SetConnectorCredentialsBody as n, SetConnectorCredentialsPath as r, GetConnectorsQuery as t };
-//# sourceMappingURL=types-BZ--6pIt.d.ts.map
+//# sourceMappingURL=types-37vwxse4.d.cts.map

package/dist/{types-RogkWzOu.d.ts → types-6T04_qUf.d.ts}

@@ -1,5 +1,4 @@
-import { l as OpenapiReturnType, r as OpenapiBodyType } from "./index-BPMr8PQJ.js";
-//#region src/clients/telemetry/__generated__/schema.d.ts
+import { l as OpenapiReturnType, r as OpenapiBodyType } from "./index-D1mduJne.js";
 /**
  * This file was auto-generated by openapi-typescript.
  * Do not make direct changes to the file.
@@ -279,11 +278,8 @@ type components = {
   headers: never;
   pathItems: never;
 };
-//#endregion
-//#region src/clients/telemetry/types.d.ts
 /** `project_type` is a free-form passthrough into the JWT claim — the service validates it nowhere. */
 type GetProvisioningTokenBody = NonNullable<OpenapiBodyType<paths['/token']['post']>>;
 type ProvisioningToken = OpenapiReturnType<paths['/token']['post']>;
-//#endregion
 export { ProvisioningToken as n, GetProvisioningTokenBody as t };
-//# sourceMappingURL=types-RogkWzOu.d.ts.map
+//# sourceMappingURL=types-6T04_qUf.d.ts.map