@keboola/api-client 36.0.0 → 40.0.0

package/dist/isLoginPageRedirect-XPwAOKK3.js

@@ -0,0 +1,14 @@
+import { l as isContentEmpty, u as isHtmlResponse } from "./createFetchClient-DXHQK63w.js";
+//#region src/clients/isLoginPageRedirect.ts
+/**
+* Whether a response is Connection's login screen arriving in place of the endpoint's payload.
+*
+* - An expired session `302`s to login; `fetch` follows it and resolves `200 text/html`.
+* - Caller checks the status: HTML on a failure is a real error page.
+* - Content type alone is not enough: Symfony stamps `text/html` on bodyless responses (e.g. `202`).
+*/
+const isLoginPageRedirect = (apiResponse) => isHtmlResponse(apiResponse) && !isContentEmpty(apiResponse);
+//#endregion
+export { isLoginPageRedirect as t };
+
+//# sourceMappingURL=isLoginPageRedirect-XPwAOKK3.js.map

package/dist/isLoginPageRedirect-XPwAOKK3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isLoginPageRedirect-XPwAOKK3.js","names":[],"sources":["../src/clients/isLoginPageRedirect.ts"],"sourcesContent":["import { type ApiResponse, isContentEmpty, isHtmlResponse } from '../fetchClient';\n\n/**\n * Whether a response is Connection's login screen arriving in place of the endpoint's payload.\n *\n * - An expired session `302`s to login; `fetch` follows it and resolves `200 text/html`.\n * - Caller checks the status: HTML on a failure is a real error page.\n * - Content type alone is not enough: Symfony stamps `text/html` on bodyless responses (e.g. `202`).\n */\nexport const isLoginPageRedirect = (apiResponse: ApiResponse) =>\n  isHtmlResponse(apiResponse) && !isContentEmpty(apiResponse);\n"],"mappings":";;;;;;;;;AASA,MAAa,uBAAuB,gBAClC,eAAe,WAAW,KAAK,CAAC,eAAe,WAAW"}

package/dist/isLoginPageRedirect-jQHiLrG7.cjs

@@ -0,0 +1,19 @@
+const require_createFetchClient = require("./createFetchClient-Cwp8max9.cjs");
+//#region src/clients/isLoginPageRedirect.ts
+/**
+* Whether a response is Connection's login screen arriving in place of the endpoint's payload.
+*
+* - An expired session `302`s to login; `fetch` follows it and resolves `200 text/html`.
+* - Caller checks the status: HTML on a failure is a real error page.
+* - Content type alone is not enough: Symfony stamps `text/html` on bodyless responses (e.g. `202`).
+*/
+const isLoginPageRedirect = (apiResponse) => require_createFetchClient.isHtmlResponse(apiResponse) && !require_createFetchClient.isContentEmpty(apiResponse);
+//#endregion
+Object.defineProperty(exports, "isLoginPageRedirect", {
+	enumerable: true,
+	get: function() {
+		return isLoginPageRedirect;
+	}
+});
+
+//# sourceMappingURL=isLoginPageRedirect-jQHiLrG7.cjs.map

package/dist/isLoginPageRedirect-jQHiLrG7.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"isLoginPageRedirect-jQHiLrG7.cjs","names":["isHtmlResponse","isContentEmpty"],"sources":["../src/clients/isLoginPageRedirect.ts"],"sourcesContent":["import { type ApiResponse, isContentEmpty, isHtmlResponse } from '../fetchClient';\n\n/**\n * Whether a response is Connection's login screen arriving in place of the endpoint's payload.\n *\n * - An expired session `302`s to login; `fetch` follows it and resolves `200 text/html`.\n * - Caller checks the status: HTML on a failure is a real error page.\n * - Content type alone is not enough: Symfony stamps `text/html` on bodyless responses (e.g. `202`).\n */\nexport const isLoginPageRedirect = (apiResponse: ApiResponse) =>\n  isHtmlResponse(apiResponse) && !isContentEmpty(apiResponse);\n"],"mappings":";;;;;;;;;AASA,MAAa,uBAAuB,gBAClCA,0BAAAA,eAAe,WAAW,KAAK,CAACC,0BAAAA,eAAe,WAAW"}

package/dist/{jobStatus-0_Y3Sr4i.cjs → jobStatus-BMlsyXWI.cjs}

@@ -18,20 +18,10 @@ const delay = (timeout, signal) => new Promise((resolve, reject) => {
 //#endregion
 //#region src/utils/async/lazy.ts
 /**
-* Computes `task` on first call and hands that one value to every later caller —
-* the async `Lazy<T>`. While the first run is in flight every call shares it; once
-* it resolves, every call — right after, or long after — replays the same promise.
-* (Contrast `dedupe`, which shares only an *in-flight* run and lets the next
-* trigger start a fresh one, success or not.)
+* Runs `task` once and replays its promise to every later caller.
 *
-* A rejection is *not* kept: the slot is cleared, so the next call starts a fresh
-* run. Lazy init over the network — a stack index, JWKS, feature flags — must not
-* be bricked forever by one transient failure. Callers that joined the failed run
-* all reject with its error; only a call made after it settles retries.
-*
-* @returns a getter; each call returns the promise of the computed value.
-* @throws The returned promise rejects with whatever `task` throws or rejects
-* with — the caller handles it (try/catch, or `.catch` on `void get()`).
+* - A rejection is not cached: the next call retries, so a transient failure never sticks.
+* - Callers that joined the failed run reject with its error.
 */
 const lazy = (task) => {
 	let value = null;
@@ -61,6 +51,10 @@ const map = (result, fn) => result.success ? success(fn(result.data)) : result;
 const mapError = (result, fn) => result.success ? result : failure(fn(result.error));
 const andThen = (result, fn) => result.success ? fn(result.data) : result;
 const match = (result, onSuccess, onFailure) => result.success ? onSuccess(result.data) : onFailure(result.error);
+const tap = (result, fn) => {
+	if (result.success) fn(result.data);
+	return result;
+};
 const unwrap = (result) => {
 	if (result.success) return result.data;
 	throw result.error;
@@ -91,6 +85,7 @@ const Result = {
 	mapError,
 	andThen,
 	match,
+	tap,
 	unwrap,
 	unwrapOr,
 	tryCatch,
@@ -335,13 +330,10 @@ const STORAGE = {
 	failed: ["error"]
 };
 /**
-* `PlainJobInterface` in `job-queue-internal-api-php-client`.
+* Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.
 *
-* - `terminating` is running, not terminal: the job is still being killed and keeps reporting until
-*   `terminated`.
-* - `warning` is a success — the run produced its output and only added a non-fatal notice, which is
-*   why a flow keeps going past it. The backend declares no such split (`STATUSES_FINISHED` is its
-*   only grouping), so dividing it into success and failure is ours.
+* - `terminating` is running until `terminated`.
+* - `warning` is a success; the backend has no success/failure split.
 */
 const QUEUE = {
 	running: [
@@ -367,20 +359,11 @@ const QUERY = {
 	failed: ["failed", "canceled"]
 };
 /**
-* One service's view of its statuses: a predicate per question, with the data a level down.
+* One service's status predicates, sets and named constants.
 *
-* - `isSuccessful` / `isFailed` are `false` while the job is still running, so read them together
-*   with `isTerminal` where that distinction matters.
-* - `isKnown` narrows an untyped string — one read out of an MCP tool result or a URL, say. A status
-*   that arrived on a typed response needs no guard. Its `Set<string>` is what takes the wider type
-*   the caller has, so the guard needs no assertion of its own.
-* - `describe` answers every question about one status at once, for a caller that needs more than
-*   one of them.
-* - `statuses.terminal` is `successful` plus `failed` — the group a poll loop stops on.
-* - `named` is asserted, not proven: `Object.fromEntries` types its result as an index signature,
-*   and no expression convinces TypeScript that uppercasing every status produces exactly
-*   `StatusNames<Status>`. The alternative is writing all three maps out by hand, which is the
-*   duplication this file exists to avoid.
+* - `isSuccessful` / `isFailed` are `false` while running.
+* - `isKnown` narrows an untyped string.
+* - `named` is asserted: `Object.fromEntries` can't prove the key mapping.
 */
 const forService = (groups) => {
 	const all = [
@@ -415,19 +398,10 @@ const forService = (groups) => {
 	};
 };
 /**
-* Job statuses per service: `jobStatus.queue.isFailed(status)` is the question about one job,
-* `jobStatus.queue.statuses.failed` the statuses behind it,
-* `jobStatus.queue.named.ERROR` one of them by name.
-*
-* One entry per service, never one over the union: the vocabularies overlap by label — `processing`
-* belongs to all three, `created` to queue and query — while which statuses exist and what each
-* implies differ per service. A shared entry would take another service's status and answer by its
-* rules.
+* Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.
 *
-* - `storage` and `queue` describe a job; `query` describes a query job, not its statements. A
-*   statement has its own state, including a terminal `notExecuted` with no job-level equivalent.
-* - Spread a group where an array is wanted — an API `status` filter, or a UI list that mixes job
-*   statuses with its own.
+* - Never merge services: labels overlap but their meaning differs.
+* - `query` covers the query job, not its statements (which have `notExecuted`).
 */
 const jobStatus = {
 	storage: forService(STORAGE),
@@ -508,4 +482,4 @@ Object.defineProperty(exports, "poller", {
 	}
 });
 
-//# sourceMappingURL=jobStatus-0_Y3Sr4i.cjs.map
+//# sourceMappingURL=jobStatus-BMlsyXWI.cjs.map

package/dist/jobStatus-BMlsyXWI.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"jobStatus-BMlsyXWI.cjs","names":["createEmitter","createStore"],"sources":["../src/utils/createAbortError.ts","../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"],"sourcesContent":["export const createAbortError = (reason?: string) => new DOMException(reason, 'AbortError');\n","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 PollKey = readonly unknown[];\n\nexport type PollContext<K extends PollKey = PollKey> = {\n  pollKey: K;\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, K extends PollKey = PollKey> = PollContext<K> & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T, K extends PollKey = PollKey> = PollTick<T, K> &\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, K extends PollKey = PollKey> = {\n  pollKey?: K;\n  pollFn: (context: PollContext<K> & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T, K> & { 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\nconst pollResult = {\n  done: <T, K extends PollKey>(data: T, context: PollTick<T, K>): PollResult<T, K> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T, K extends PollKey>(error: Error, context: PollTick<T, K>): PollResult<T, K> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T, K extends PollKey>(context: PollTick<T, K>, error?: Error): PollResult<T, K> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T, K extends PollKey>(context: PollTick<T, K>, error?: Error): PollResult<T, K> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T, K extends PollKey>(context: PollTick<T, K>, reason: unknown): PollResult<T, K> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T, K extends PollKey = PollKey>({\n  pollKey,\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, K>): Promise<PollResult<T, K>> => {\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  // A poll without a key has an empty one, and `K` is opaque in here — the one place the absent\n  // case is materialised is the one place it has to be asserted.\n  const key = pollKey ?? ([] as unknown as K);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ pollKey: key, attempt: at, elapsed }: PollContext<K>) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([\n        _pollFn({ pollKey: key, attempt: at, elapsed, signal: anySignal }),\n        anyAborted.promise,\n      ]),\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, K> => ({\n    pollKey: key,\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T, K>(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';\n\nimport {\n  type PollKey,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollState = 'idle' | 'polling' | PollResultState;\nexport type PollSnapshot = PollTick<unknown> & { state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>) => Error | undefined;\n\nexport type PollerStartFn<T> = () => Promise<PollResult<T>>;\nexport type PollerStopFn = (reason?: string) => void;\ntype PollerSubscribeFn = (listener: (snapshot: PollSnapshot) => void) => () => void;\ntype PollerDebugFn = () => PollSnapshot;\ntype PollerUnwrapFn<T> = (onFailure?: OnFailure<T>) => Promise<T>;\nexport type Poller<T> = {\n  readonly state: PollState;\n  start: PollerStartFn<T>;\n  unwrap: PollerUnwrapFn<T>;\n  stop: PollerStopFn;\n  subscribe: PollerSubscribeFn;\n  debug: PollerDebugFn;\n};\n\nexport type PollTask<T> = Promise<PollResult<T>> &\n  Pick<Poller<T>, 'unwrap' | 'stop' | 'subscribe' | 'debug'>;\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>({\n  pollKey,\n  signal,\n  until,\n  ...pollLoopOptions\n}: PollOptions<T, K>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  // snapshoting\n  const snapshot = createStore<PollSnapshot>({\n    pollKey: pollKey ?? [],\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (context: PollTick<T, K> & { data: T }) => {\n    updateSnapshot({ attempt: context.attempt, elapsed: context.elapsed, last: context.data });\n    return until(context);\n  };\n\n  const start: PollerStartFn<T> = lazy(async () => {\n    updateSnapshot({ state: 'polling' });\n    const result = await pollLoop({\n      ...pollLoopOptions,\n      pollKey,\n      until: handleUntil,\n      signal: anySignal,\n    });\n    // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n    snapshot.set({\n      pollKey: result.pollKey,\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  });\n\n  const stop: PollerStopFn = (reason) => pollerSignal.abort(reason);\n  const subscribe: PollerSubscribeFn = (listener) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug: PollerDebugFn = snapshot.get;\n\n  const unwrap: PollerUnwrapFn<T> = async (onFailure) => {\n    const result = await start();\n    if (result.state === 'done') return result.data;\n    throw onFailure?.(result) ?? failureOf(result);\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    unwrap,\n    ...controls,\n  };\n};\n\nexport const poll = <T, K extends PollKey = PollKey>(options: PollOptions<T, K>): PollTask<T> => {\n  const p = poller(options);\n\n  return Object.assign(p.start(), {\n    unwrap: p.unwrap,\n    stop: p.stop,\n    subscribe: p.subscribe,\n    debug: p.debug,\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 * - `warning` is a success; the backend has no success/failure split.\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"],"mappings":";;AAAA,MAAa,oBAAoB,WAAoB,IAAI,aAAa,QAAQ,YAAY;;;ACE1F,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;;;ACnBA,MAAM,aAAa;CACjB,OAA6B,MAAS,aAA+C;EACnF,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAgC,OAAc,aAA+C;EAC3F,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAkC,SAAyB,WAAqC;EAC9F,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAiC,SAAyB,WAAqC;EAC7F,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAgC,SAAyB,YAAuC;EAC9F,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAuC,EAC7D,SACA,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,eAC8B;CAGlD,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;CAGrD,MAAM,MAAM,WAAY,CAAC;CAEzB,MAAM,UAAU,EAAE,SAAS,KAAK,SAAS,IAAI,cAC3C,OAAO,oBACL,QAAQ,KAAK,CACX,QAAQ;EAAE,SAAS;EAAK,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GACjE,WAAW,OACb,CAAC,CACH;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,eAA+B;EACjE,SAAS;EACT;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAgB,QAAQ,CAAC;CAEvE,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;;;ACjJA,MAAa,UAAUA,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,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,UAA0C,EACrD,SACA,QACA,OACA,GAAG,sBAC+B;CAClC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAGrE,MAAM,WAAWC,cAAAA,YAA0B;EACzC,SAAS,WAAW,CAAC;EACrB,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,YAA0C;EAC7D,eAAe;GAAE,SAAS,QAAQ;GAAS,SAAS,QAAQ;GAAS,MAAM,QAAQ;EAAK,CAAC;EACzF,OAAO,MAAM,OAAO;CACtB;CAEA,MAAM,QAA0B,KAAK,YAAY;EAC/C,eAAe,EAAE,OAAO,UAAU,CAAC;EACnC,MAAM,SAAS,MAAM,SAAS;GAC5B,GAAG;GACH;GACA,OAAO;GACP,QAAQ;EACV,CAAC;EAED,SAAS,IAAI;GACX,SAAS,OAAO;GAChB,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT,CAAC;CAED,MAAM,QAAsB,WAAW,aAAa,MAAM,MAAM;CAChE,MAAM,aAAgC,aACpC,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAuB,SAAS;CAEtC,MAAM,SAA4B,OAAO,cAAc;EACrD,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ,OAAO,OAAO;EAC3C,MAAM,YAAY,MAAM,KAAK,UAAU,MAAM;CAC/C;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;AAEA,MAAa,QAAwC,YAA4C;CAC/F,MAAM,IAAI,OAAO,OAAO;CAExB,OAAO,OAAO,OAAO,EAAE,MAAM,GAAG;EAC9B,QAAQ,EAAE;EACV,MAAM,EAAE;EACR,WAAW,EAAE;EACb,OAAO,EAAE;CACX,CAAC;AACH;;;ACrHA,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"}

package/dist/{jobStatus-PSZJMTiA.js → jobStatus-CfRtsIpv.js}

@@ -18,20 +18,10 @@ const delay = (timeout, signal) => new Promise((resolve, reject) => {
 //#endregion
 //#region src/utils/async/lazy.ts
 /**
-* Computes `task` on first call and hands that one value to every later caller —
-* the async `Lazy<T>`. While the first run is in flight every call shares it; once
-* it resolves, every call — right after, or long after — replays the same promise.
-* (Contrast `dedupe`, which shares only an *in-flight* run and lets the next
-* trigger start a fresh one, success or not.)
+* Runs `task` once and replays its promise to every later caller.
 *
-* A rejection is *not* kept: the slot is cleared, so the next call starts a fresh
-* run. Lazy init over the network — a stack index, JWKS, feature flags — must not
-* be bricked forever by one transient failure. Callers that joined the failed run
-* all reject with its error; only a call made after it settles retries.
-*
-* @returns a getter; each call returns the promise of the computed value.
-* @throws The returned promise rejects with whatever `task` throws or rejects
-* with — the caller handles it (try/catch, or `.catch` on `void get()`).
+* - A rejection is not cached: the next call retries, so a transient failure never sticks.
+* - Callers that joined the failed run reject with its error.
 */
 const lazy = (task) => {
 	let value = null;
@@ -61,6 +51,10 @@ const map = (result, fn) => result.success ? success(fn(result.data)) : result;
 const mapError = (result, fn) => result.success ? result : failure(fn(result.error));
 const andThen = (result, fn) => result.success ? fn(result.data) : result;
 const match = (result, onSuccess, onFailure) => result.success ? onSuccess(result.data) : onFailure(result.error);
+const tap = (result, fn) => {
+	if (result.success) fn(result.data);
+	return result;
+};
 const unwrap = (result) => {
 	if (result.success) return result.data;
 	throw result.error;
@@ -91,6 +85,7 @@ const Result = {
 	mapError,
 	andThen,
 	match,
+	tap,
 	unwrap,
 	unwrapOr,
 	tryCatch,
@@ -335,13 +330,10 @@ const STORAGE = {
 	failed: ["error"]
 };
 /**
-* `PlainJobInterface` in `job-queue-internal-api-php-client`.
+* Mirrors `PlainJobInterface` in `job-queue-internal-api-php-client`.
 *
-* - `terminating` is running, not terminal: the job is still being killed and keeps reporting until
-*   `terminated`.
-* - `warning` is a success — the run produced its output and only added a non-fatal notice, which is
-*   why a flow keeps going past it. The backend declares no such split (`STATUSES_FINISHED` is its
-*   only grouping), so dividing it into success and failure is ours.
+* - `terminating` is running until `terminated`.
+* - `warning` is a success; the backend has no success/failure split.
 */
 const QUEUE = {
 	running: [
@@ -367,20 +359,11 @@ const QUERY = {
 	failed: ["failed", "canceled"]
 };
 /**
-* One service's view of its statuses: a predicate per question, with the data a level down.
+* One service's status predicates, sets and named constants.
 *
-* - `isSuccessful` / `isFailed` are `false` while the job is still running, so read them together
-*   with `isTerminal` where that distinction matters.
-* - `isKnown` narrows an untyped string — one read out of an MCP tool result or a URL, say. A status
-*   that arrived on a typed response needs no guard. Its `Set<string>` is what takes the wider type
-*   the caller has, so the guard needs no assertion of its own.
-* - `describe` answers every question about one status at once, for a caller that needs more than
-*   one of them.
-* - `statuses.terminal` is `successful` plus `failed` — the group a poll loop stops on.
-* - `named` is asserted, not proven: `Object.fromEntries` types its result as an index signature,
-*   and no expression convinces TypeScript that uppercasing every status produces exactly
-*   `StatusNames<Status>`. The alternative is writing all three maps out by hand, which is the
-*   duplication this file exists to avoid.
+* - `isSuccessful` / `isFailed` are `false` while running.
+* - `isKnown` narrows an untyped string.
+* - `named` is asserted: `Object.fromEntries` can't prove the key mapping.
 */
 const forService = (groups) => {
 	const all = [
@@ -415,19 +398,10 @@ const forService = (groups) => {
 	};
 };
 /**
-* Job statuses per service: `jobStatus.queue.isFailed(status)` is the question about one job,
-* `jobStatus.queue.statuses.failed` the statuses behind it,
-* `jobStatus.queue.named.ERROR` one of them by name.
-*
-* One entry per service, never one over the union: the vocabularies overlap by label — `processing`
-* belongs to all three, `created` to queue and query — while which statuses exist and what each
-* implies differ per service. A shared entry would take another service's status and answer by its
-* rules.
+* Job statuses per service, e.g. `jobStatus.queue.isFailed(status)`.
 *
-* - `storage` and `queue` describe a job; `query` describes a query job, not its statements. A
-*   statement has its own state, including a terminal `notExecuted` with no job-level equivalent.
-* - Spread a group where an array is wanted — an API `status` filter, or a UI list that mixes job
-*   statuses with its own.
+* - Never merge services: labels overlap but their meaning differs.
+* - `query` covers the query job, not its statements (which have `notExecuted`).
 */
 const jobStatus = {
 	storage: forService(STORAGE),
@@ -437,4 +411,4 @@ const jobStatus = {
 //#endregion
 export { poller as a, Result as c, delay as d, createAbortError as f, poll as i, asError as l, emitter as n, clamp as o, failureOf as r, finiteOr as s, jobStatus as t, lazy as u };
 
-//# sourceMappingURL=jobStatus-PSZJMTiA.js.map
+//# sourceMappingURL=jobStatus-CfRtsIpv.js.map

package/dist/jobStatus-CfRtsIpv.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jobStatus-CfRtsIpv.js","names":[],"sources":["../src/utils/createAbortError.ts","../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"],"sourcesContent":["export const createAbortError = (reason?: string) => new DOMException(reason, 'AbortError');\n","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 PollKey = readonly unknown[];\n\nexport type PollContext<K extends PollKey = PollKey> = {\n  pollKey: K;\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, K extends PollKey = PollKey> = PollContext<K> & { last: T | null };\n\nexport type PollResultState = 'done' | 'timedOut' | 'exhausted' | 'aborted' | 'errored';\n\nexport type PollResult<T, K extends PollKey = PollKey> = PollTick<T, K> &\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, K extends PollKey = PollKey> = {\n  pollKey?: K;\n  pollFn: (context: PollContext<K> & { signal: AbortSignal }) => Promise<T>;\n  until: (tick: PollTick<T, K> & { 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\nconst pollResult = {\n  done: <T, K extends PollKey>(data: T, context: PollTick<T, K>): PollResult<T, K> => ({\n    state: 'done',\n    data,\n    ...context,\n    last: data,\n  }),\n  errored: <T, K extends PollKey>(error: Error, context: PollTick<T, K>): PollResult<T, K> => ({\n    state: 'errored',\n    error,\n    ...context,\n  }),\n  exhausted: <T, K extends PollKey>(context: PollTick<T, K>, error?: Error): PollResult<T, K> => ({\n    state: 'exhausted',\n    error,\n    ...context,\n  }),\n  timedOut: <T, K extends PollKey>(context: PollTick<T, K>, error?: Error): PollResult<T, K> => ({\n    state: 'timedOut',\n    error,\n    ...context,\n  }),\n  aborted: <T, K extends PollKey>(context: PollTick<T, K>, reason: unknown): PollResult<T, K> => ({\n    state: 'aborted',\n    reason,\n    ...context,\n  }),\n};\n\nexport const pollLoop = async <T, K extends PollKey = PollKey>({\n  pollKey,\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, K>): Promise<PollResult<T, K>> => {\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  // A poll without a key has an empty one, and `K` is opaque in here — the one place the absent\n  // case is materialised is the one place it has to be asserted.\n  const key = pollKey ?? ([] as unknown as K);\n  // Only what the context declares: a request is not handed the tick's `last` as well.\n  const pollFn = ({ pollKey: key, attempt: at, elapsed }: PollContext<K>) =>\n    Result.tryCatchAsync(() =>\n      Promise.race([\n        _pollFn({ pollKey: key, attempt: at, elapsed, signal: anySignal }),\n        anyAborted.promise,\n      ]),\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, K> => ({\n    pollKey: key,\n    attempt,\n    elapsed: at,\n    last,\n  });\n\n  if (attempt >= maxAttempts) return pollResult.exhausted<T, K>(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';\n\nimport {\n  type PollKey,\n  pollLoop,\n  type PollOptions,\n  type PollResult,\n  type PollResultState,\n  type PollTick,\n} from './pollLoop';\nimport { neverAborts } from './utils';\n\nexport type PollState = 'idle' | 'polling' | PollResultState;\nexport type PollSnapshot = PollTick<unknown> & { state: PollState };\n\ntype OnFailure<T> = (result: PollResult<T>) => Error | undefined;\n\nexport type PollerStartFn<T> = () => Promise<PollResult<T>>;\nexport type PollerStopFn = (reason?: string) => void;\ntype PollerSubscribeFn = (listener: (snapshot: PollSnapshot) => void) => () => void;\ntype PollerDebugFn = () => PollSnapshot;\ntype PollerUnwrapFn<T> = (onFailure?: OnFailure<T>) => Promise<T>;\nexport type Poller<T> = {\n  readonly state: PollState;\n  start: PollerStartFn<T>;\n  unwrap: PollerUnwrapFn<T>;\n  stop: PollerStopFn;\n  subscribe: PollerSubscribeFn;\n  debug: PollerDebugFn;\n};\n\nexport type PollTask<T> = Promise<PollResult<T>> &\n  Pick<Poller<T>, 'unwrap' | 'stop' | 'subscribe' | 'debug'>;\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>({\n  pollKey,\n  signal,\n  until,\n  ...pollLoopOptions\n}: PollOptions<T, K>): Poller<T> => {\n  const callerSignal = signal ?? neverAborts();\n  const pollerSignal = new AbortController();\n  const anySignal = AbortSignal.any([pollerSignal.signal, callerSignal]);\n\n  // snapshoting\n  const snapshot = createStore<PollSnapshot>({\n    pollKey: pollKey ?? [],\n    state: 'idle',\n    attempt: 0,\n    elapsed: 0,\n    last: null,\n  });\n  const updateSnapshot = (next: Partial<PollSnapshot>) =>\n    snapshot.set({ ...snapshot.get(), ...next });\n\n  const handleUntil = (context: PollTick<T, K> & { data: T }) => {\n    updateSnapshot({ attempt: context.attempt, elapsed: context.elapsed, last: context.data });\n    return until(context);\n  };\n\n  const start: PollerStartFn<T> = lazy(async () => {\n    updateSnapshot({ state: 'polling' });\n    const result = await pollLoop({\n      ...pollLoopOptions,\n      pollKey,\n      until: handleUntil,\n      signal: anySignal,\n    });\n    // The result knows what a tick cannot: attempts that failed, and the time the ending itself took.\n    snapshot.set({\n      pollKey: result.pollKey,\n      state: result.state,\n      attempt: result.attempt,\n      elapsed: result.elapsed,\n      last: result.last,\n    });\n    return result;\n  });\n\n  const stop: PollerStopFn = (reason) => pollerSignal.abort(reason);\n  const subscribe: PollerSubscribeFn = (listener) =>\n    snapshot.subscribe(() => listener(snapshot.get()));\n  const debug: PollerDebugFn = snapshot.get;\n\n  const unwrap: PollerUnwrapFn<T> = async (onFailure) => {\n    const result = await start();\n    if (result.state === 'done') return result.data;\n    throw onFailure?.(result) ?? failureOf(result);\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    unwrap,\n    ...controls,\n  };\n};\n\nexport const poll = <T, K extends PollKey = PollKey>(options: PollOptions<T, K>): PollTask<T> => {\n  const p = poller(options);\n\n  return Object.assign(p.start(), {\n    unwrap: p.unwrap,\n    stop: p.stop,\n    subscribe: p.subscribe,\n    debug: p.debug,\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 * - `warning` is a success; the backend has no success/failure split.\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"],"mappings":";;AAAA,MAAa,oBAAoB,WAAoB,IAAI,aAAa,QAAQ,YAAY;;;ACE1F,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;;;ACnBA,MAAM,aAAa;CACjB,OAA6B,MAAS,aAA+C;EACnF,OAAO;EACP;EACA,GAAG;EACH,MAAM;CACR;CACA,UAAgC,OAAc,aAA+C;EAC3F,OAAO;EACP;EACA,GAAG;CACL;CACA,YAAkC,SAAyB,WAAqC;EAC9F,OAAO;EACP;EACA,GAAG;CACL;CACA,WAAiC,SAAyB,WAAqC;EAC7F,OAAO;EACP;EACA,GAAG;CACL;CACA,UAAgC,SAAyB,YAAuC;EAC9F,OAAO;EACP;EACA,GAAG;CACL;AACF;AAEA,MAAa,WAAW,OAAuC,EAC7D,SACA,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,eAC8B;CAGlD,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;CAGrD,MAAM,MAAM,WAAY,CAAC;CAEzB,MAAM,UAAU,EAAE,SAAS,KAAK,SAAS,IAAI,cAC3C,OAAO,oBACL,QAAQ,KAAK,CACX,QAAQ;EAAE,SAAS;EAAK,SAAS;EAAI;EAAS,QAAQ;CAAU,CAAC,GACjE,WAAW,OACb,CAAC,CACH;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,eAA+B;EACjE,SAAS;EACT;EACA,SAAS;EACT;CACF;CAEA,IAAI,WAAW,aAAa,OAAO,WAAW,UAAgB,QAAQ,CAAC;CAEvE,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;;;ACjJA,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,UAA0C,EACrD,SACA,QACA,OACA,GAAG,sBAC+B;CAClC,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,IAAI,gBAAgB;CACzC,MAAM,YAAY,YAAY,IAAI,CAAC,aAAa,QAAQ,YAAY,CAAC;CAGrE,MAAM,WAAW,YAA0B;EACzC,SAAS,WAAW,CAAC;EACrB,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,YAA0C;EAC7D,eAAe;GAAE,SAAS,QAAQ;GAAS,SAAS,QAAQ;GAAS,MAAM,QAAQ;EAAK,CAAC;EACzF,OAAO,MAAM,OAAO;CACtB;CAEA,MAAM,QAA0B,KAAK,YAAY;EAC/C,eAAe,EAAE,OAAO,UAAU,CAAC;EACnC,MAAM,SAAS,MAAM,SAAS;GAC5B,GAAG;GACH;GACA,OAAO;GACP,QAAQ;EACV,CAAC;EAED,SAAS,IAAI;GACX,SAAS,OAAO;GAChB,OAAO,OAAO;GACd,SAAS,OAAO;GAChB,SAAS,OAAO;GAChB,MAAM,OAAO;EACf,CAAC;EACD,OAAO;CACT,CAAC;CAED,MAAM,QAAsB,WAAW,aAAa,MAAM,MAAM;CAChE,MAAM,aAAgC,aACpC,SAAS,gBAAgB,SAAS,SAAS,IAAI,CAAC,CAAC;CACnD,MAAM,QAAuB,SAAS;CAEtC,MAAM,SAA4B,OAAO,cAAc;EACrD,MAAM,SAAS,MAAM,MAAM;EAC3B,IAAI,OAAO,UAAU,QAAQ,OAAO,OAAO;EAC3C,MAAM,YAAY,MAAM,KAAK,UAAU,MAAM;CAC/C;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;AAEA,MAAa,QAAwC,YAA4C;CAC/F,MAAM,IAAI,OAAO,OAAO;CAExB,OAAO,OAAO,OAAO,EAAE,MAAM,GAAG;EAC9B,QAAQ,EAAE;EACV,MAAM,EAAE;EACR,WAAW,EAAE;EACb,OAAO,EAAE;CACX,CAAC;AACH;;;ACrHA,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"}

package/dist/kaiAgent/index.cjs

@@ -1,3 +1,3 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_kaiAgent = require("../kaiAgent-B_TaUPRt.cjs");
+const require_kaiAgent = require("../kaiAgent-QNoeVKPs.cjs");
 exports.createKaiAgentClient = require_kaiAgent.createKaiAgentClient;

package/dist/kaiAgent/index.d.cts

@@ -1,2 +1,3 @@
-import { r as createKaiAgentClient } from "../kaiAgentClient-DhTaM3GC.cjs";
-export { createKaiAgentClient };
+import { h as ProjectToolPolicyValue, m as ProjectToolPolicy } from "../types-ByLH46Dt.cjs";
+import { a as createKaiAgentClient, i as UserAgentSettings, t as AgentSettings } from "../index-DNThyEej.cjs";
+export { type AgentSettings, type ProjectToolPolicy, type ProjectToolPolicyValue, type UserAgentSettings, createKaiAgentClient };

package/dist/kaiAgent/index.d.ts

@@ -1,2 +1,3 @@
-import { r as createKaiAgentClient } from "../kaiAgentClient-BJj_2aqt.js";
-export { createKaiAgentClient };
+import { h as ProjectToolPolicyValue, m as ProjectToolPolicy } from "../types-DlQw6FCi.js";
+import { a as createKaiAgentClient, i as UserAgentSettings, t as AgentSettings } from "../index-Qb7X6-ph.js";
+export { type AgentSettings, type ProjectToolPolicy, type ProjectToolPolicyValue, type UserAgentSettings, createKaiAgentClient };

package/dist/kaiAgent/index.js

@@ -1,2 +1,2 @@
-import { t as createKaiAgentClient } from "../kaiAgent-8LNzGhZc.js";
+import { t as createKaiAgentClient } from "../kaiAgent-Dp20HLTh.js";
 export { createKaiAgentClient };

package/dist/kaiAgent/types.d.cts

@@ -1,2 +1,2 @@
-import { a as GetHistoryQuery, c as VoteRequest, i as GetChatPath, n as ChatRequest, o as GetVotesQuery, r as ChatWithMessages, s as UsageResponse, t as ApprovalBody } from "../types-f8W_j6qD.cjs";
-export { ApprovalBody, ChatRequest, ChatWithMessages, GetChatPath, GetHistoryQuery, GetVotesQuery, UsageResponse, VoteRequest };
+import { a as ChatWithMessages, c as GetChatPath, d as PrepareChatRequest, f as UsageResponse, i as ChatRequest, l as GetHistoryQuery, n as ArtifactListResponse, o as GetArtifactPath, p as VoteRequest, r as ArtifactResponse, s as GetArtifactsQuery, t as ApprovalBody, u as GetVotesQuery } from "../types-DinIJ1D_.cjs";
+export { ApprovalBody, ArtifactListResponse, ArtifactResponse, ChatRequest, ChatWithMessages, GetArtifactPath, GetArtifactsQuery, GetChatPath, GetHistoryQuery, GetVotesQuery, PrepareChatRequest, UsageResponse, VoteRequest };

package/dist/kaiAgent/types.d.ts

@@ -1,2 +1,2 @@
-import { a as GetHistoryQuery, c as VoteRequest, i as GetChatPath, n as ChatRequest, o as GetVotesQuery, r as ChatWithMessages, s as UsageResponse, t as ApprovalBody } from "../types-BupPADSm.js";
-export { ApprovalBody, ChatRequest, ChatWithMessages, GetChatPath, GetHistoryQuery, GetVotesQuery, UsageResponse, VoteRequest };
+import { a as ChatWithMessages, c as GetChatPath, d as PrepareChatRequest, f as UsageResponse, i as ChatRequest, l as GetHistoryQuery, n as ArtifactListResponse, o as GetArtifactPath, p as VoteRequest, r as ArtifactResponse, s as GetArtifactsQuery, t as ApprovalBody, u as GetVotesQuery } from "../types-n4PTnLii.js";
+export { ApprovalBody, ArtifactListResponse, ArtifactResponse, ChatRequest, ChatWithMessages, GetArtifactPath, GetArtifactsQuery, GetChatPath, GetHistoryQuery, GetVotesQuery, PrepareChatRequest, UsageResponse, VoteRequest };

package/dist/{kaiAgent-8LNzGhZc.js → kaiAgent-Dp20HLTh.js}

@@ -1,11 +1,15 @@
-import { t as createGenericFetchClient } from "./createGenericFetchClient-rxvUUbap.js";
-import { t as createOpenapiFetchClient } from "./createOpenapiFetchClient-BVSc9ibR.js";
-import { t as createAuthHeaders } from "./auth-aItmDu45.js";
+import { m as HttpStatus, r as isApiError } from "./createFetchClient-DXHQK63w.js";
+import { t as createGenericFetchClient } from "./createGenericFetchClient-Dg1rgzmG.js";
+import { t as createOpenapiFetchClient } from "./createOpenapiFetchClient-DZUOVupy.js";
+import { t as createAuthHeaders } from "./auth-DworfoPy.js";
 import { z } from "zod";
 //#region src/clients/kaiAgent/kaiAgentClient.ts
+const projectToolPolicyValueSchema = z.enum(["blocked", "always_ask"]);
 const agentSettingsSchema = z.object({
 	projectId: z.string(),
 	customInstructions: z.string().nullable(),
+	toolPermissions: z.record(z.string(), projectToolPolicyValueSchema).nullable().optional(),
+	canWriteToolPolicy: z.boolean().optional(),
 	createdAt: z.string(),
 	updatedAt: z.string()
 });
@@ -19,6 +23,7 @@ const userAgentSettingsSchema = z.object({
 	userId: z.string(),
 	customInstructions: z.string().nullable(),
 	toolPermissions: z.record(z.string(), toolPermissionValueSchema).nullable(),
+	projectToolPermissions: z.record(z.string(), projectToolPolicyValueSchema).nullable().optional(),
 	createdAt: z.string(),
 	updatedAt: z.string()
 });
@@ -91,8 +96,8 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 	};
 	const client = createOpenapiFetchClient(clientOptions);
 	const genericClient = createGenericFetchClient(clientOptions);
-	const getHistory = async (params) => {
-		const { data } = await client.get("/api/history", { query: params });
+	const getHistory = async (params, signal) => {
+		const { data } = await client.get("/api/history", { query: params }, { signal });
 		return data;
 	};
 	const getChat = async (chatId, signal) => {
@@ -116,9 +121,32 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 	const submitVote = async (params) => {
 		await client.patch("/api/vote", { body: params });
 	};
+	/**
+	* Every artifact a chat produced, oldest first.
+	*
+	* - Read-only by design: artifacts are derived server-side at the end of a turn, so there is
+	*   no write route to pair with this.
+	* - The chat is the authorization — a chat the caller cannot read has no artifacts.
+	*/
+	const getArtifacts = async (chatId, signal) => {
+		const { data } = await client.get("/api/artifacts", { query: { chatId } }, { signal });
+		return data;
+	};
+	const getArtifact = async (artifactId, signal) => {
+		const { data } = await client.get("/api/artifacts/{id}", { path: { id: artifactId } }, { signal });
+		return data;
+	};
 	const getUsage = async (signal) => {
 		const { data } = await client.get("/api/usage", {}, { signal });
-		return data;
+		const parsed = z.object({ freeAllowance: z.object({
+			grantedPpu: z.number(),
+			remainingPpu: z.number()
+		}).nullable().optional() }).safeParse(data);
+		const freeAllowance = parsed.success ? parsed.data.freeAllowance ?? null : null;
+		return {
+			...data,
+			freeAllowance
+		};
 	};
 	const approveToolCall = async (chatId, body) => {
 		await client.post("/api/chat/{id}/approval", {
@@ -136,6 +164,24 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 		const { data } = await client.post("/api/chat/{id}/stop", { path: { id: chatId } });
 		return data;
 	};
+	/**
+	* Ask the engine to build this chat's sandbox before a turn needs one.
+	*
+	* - The work continues after the response.
+	* - A host that does not pre-warm answers 404, returned as `{ started: false }`.
+	*/
+	const prepareChat = async (chatId, signal, body = {}) => {
+		try {
+			const { data } = await client.post("/api/chat/{id}/prepare", {
+				path: { id: chatId },
+				body
+			}, { signal });
+			return data;
+		} catch (error) {
+			if (isApiError(error) && error.response.status === HttpStatus.NOT_FOUND) return { started: false };
+			throw error;
+		}
+	};
 	const getSuggestions = async (request, signal) => {
 		const { data } = await client.post("/api/suggestions", { body: request }, { signal });
 		return data;
@@ -152,6 +198,12 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 		if (!result.success) throw new Error("Invalid agent settings response format");
 		return result.data;
 	};
+	const updateProjectToolPolicy = async (toolPermissions, signal) => {
+		const { data } = await genericClient.put("/api/settings/tool-permissions", { body: { toolPermissions } }, { signal });
+		const result = agentSettingsSchema.safeParse(data);
+		if (!result.success) throw new Error("Invalid agent settings response format");
+		return result.data;
+	};
 	const getUserAgentSettings = async (signal) => {
 		const { data } = await genericClient.get("/api/settings/user", {}, { signal });
 		const result = userAgentSettingsSchema.safeParse(data);
@@ -235,12 +287,16 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 		getVotes,
 		submitVote,
 		getUsage,
+		getArtifacts,
+		getArtifact,
 		approveToolCall,
 		submitToolOutput,
 		stopChat,
+		prepareChat,
 		getSuggestions,
 		getAgentSettings,
 		updateAgentSettings,
+		updateProjectToolPolicy,
 		getUserAgentSettings,
 		updateUserAgentSettings,
 		getSpendCaps,
@@ -258,4 +314,4 @@ const createKaiAgentClient = ({ baseUrl, middlewares, auth }) => {
 //#endregion
 export { createKaiAgentClient as t };
 
-//# sourceMappingURL=kaiAgent-8LNzGhZc.js.map
+//# sourceMappingURL=kaiAgent-Dp20HLTh.js.map