agents 0.24.0 → 0.26.0

package/dist/{retries-D9B2UCq3.d.ts → retries-CV6AkXmQ.d.ts}

@@ -86,6 +86,14 @@ declare function isDurableObjectCodeUpdateReset(error: unknown): boolean;
  * deliberately do not qualify.
  */
 declare function isDurableObjectStorageReset(error: unknown): boolean;
+/**
+ * Whether an error (or anything in its `cause` chain) is a Durable Object
+ * reset — a superseded isolate ({@link isDurableObjectCodeUpdateReset}) or a
+ * storage reset ({@link isDurableObjectStorageReset}). The isolate is going
+ * away, so live chat recovery must not schedule a retry for it: the restart's
+ * own recovery owns the turn.
+ */
+declare function isDurableObjectResetError(error: unknown): boolean;
 /**
  * Whether an error (or anything in its `cause` chain, or a raw error-message
  * string) is a Durable Object memory-limit reset — see
@@ -129,16 +137,17 @@ declare function isPlatformFailure(error: unknown): boolean;
 declare function isPlatformTransientError(error: unknown): boolean;
 //#endregion
 export {
-  isErrorRetryable as a,
-  jitterBackoff as c,
-  validateRetryOptions as d,
-  isDurableObjectStorageReset as i,
-  resolveRetryConfig as l,
+  isDurableObjectStorageReset as a,
+  isPlatformTransientError as c,
+  tryN as d,
+  validateRetryOptions as f,
+  isDurableObjectResetError as i,
+  jitterBackoff as l,
   isDurableObjectCodeUpdateReset as n,
-  isPlatformFailure as o,
+  isErrorRetryable as o,
   isDurableObjectMemoryLimitReset as r,
-  isPlatformTransientError as s,
+  isPlatformFailure as s,
   RetryOptions as t,
-  tryN as u
+  resolveRetryConfig as u
 };
-//# sourceMappingURL=retries-D9B2UCq3.d.ts.map
+//# sourceMappingURL=retries-CV6AkXmQ.d.ts.map

package/dist/retries.d.ts

@@ -1,20 +1,22 @@
 import {
-  a as isErrorRetryable,
-  c as jitterBackoff,
-  d as validateRetryOptions,
-  i as isDurableObjectStorageReset,
-  l as resolveRetryConfig,
+  a as isDurableObjectStorageReset,
+  c as isPlatformTransientError,
+  d as tryN,
+  f as validateRetryOptions,
+  i as isDurableObjectResetError,
+  l as jitterBackoff,
   n as isDurableObjectCodeUpdateReset,
-  o as isPlatformFailure,
+  o as isErrorRetryable,
   r as isDurableObjectMemoryLimitReset,
-  s as isPlatformTransientError,
+  s as isPlatformFailure,
   t as RetryOptions,
-  u as tryN
-} from "./retries-D9B2UCq3.js";
+  u as resolveRetryConfig
+} from "./retries-CV6AkXmQ.js";
 export {
   RetryOptions,
   isDurableObjectCodeUpdateReset,
   isDurableObjectMemoryLimitReset,
+  isDurableObjectResetError,
   isDurableObjectStorageReset,
   isErrorRetryable,
   isPlatformFailure,

package/dist/retries.js

@@ -189,6 +189,16 @@ function isDurableObjectStorageReset(error) {
 	return false;
 }
 /**
+* Whether an error (or anything in its `cause` chain) is a Durable Object
+* reset — a superseded isolate ({@link isDurableObjectCodeUpdateReset}) or a
+* storage reset ({@link isDurableObjectStorageReset}). The isolate is going
+* away, so live chat recovery must not schedule a retry for it: the restart's
+* own recovery owns the turn.
+*/
+function isDurableObjectResetError(error) {
+	return isDurableObjectCodeUpdateReset(error) || isDurableObjectStorageReset(error);
+}
+/**
 * Whether an error (or anything in its `cause` chain, or a raw error-message
 * string) is a Durable Object memory-limit reset — see
 * {@link MEMORY_LIMIT_RESET_PATTERN}. Unlike {@link isPlatformTransientError},
@@ -244,6 +254,6 @@ function isPlatformTransientError(error) {
 	return false;
 }
 //#endregion
-export { isDurableObjectCodeUpdateReset, isDurableObjectMemoryLimitReset, isDurableObjectStorageReset, isErrorRetryable, isPlatformFailure, isPlatformTransientError, jitterBackoff, resolveRetryConfig, tryN, validateRetryOptions };
+export { isDurableObjectCodeUpdateReset, isDurableObjectMemoryLimitReset, isDurableObjectResetError, isDurableObjectStorageReset, isErrorRetryable, isPlatformFailure, isPlatformTransientError, jitterBackoff, resolveRetryConfig, tryN, validateRetryOptions };
 
 //# sourceMappingURL=retries.js.map

package/dist/retries.js.map

@@ -1 +1 @@
-{"version":3,"file":"retries.js","names":[],"sources":["../src/retries.ts"],"sourcesContent":["/**\n * Retry options for schedule(), scheduleEvery(), queue(), and this.retry().\n */\nexport interface RetryOptions {\n  /** Max number of attempts (including the first). Default: 3 */\n  maxAttempts?: number;\n  /** Base delay in ms for exponential backoff. Default: 100 */\n  baseDelayMs?: number;\n  /** Max delay cap in ms. Default: 3000 */\n  maxDelayMs?: number;\n}\n\n/**\n * Internal options for tryN -- extends RetryOptions with a shouldRetry predicate.\n */\ninterface TryNOptions extends RetryOptions {\n  /**\n   * Predicate to determine if an error should be retried.\n   * Receives the error and the next attempt number (so callers can\n   * make attempt-aware decisions).\n   * If not provided, all errors are retried.\n   */\n  shouldRetry?: (err: unknown, nextAttempt: number) => boolean;\n}\n\n/**\n * Validate retry options eagerly so invalid config fails at enqueue/schedule time\n * rather than at execution time. Checks individual field ranges, enforces integer\n * maxAttempts, and validates cross-field constraints after resolving against\n * defaults when provided.\n */\n/** Fill unset per-call retry options from a required set of defaults. */\nexport function resolveRetryConfig(\n  retry: RetryOptions | undefined,\n  defaults: Required<RetryOptions>\n): Required<RetryOptions> {\n  return {\n    maxAttempts: retry?.maxAttempts ?? defaults.maxAttempts,\n    baseDelayMs: retry?.baseDelayMs ?? defaults.baseDelayMs,\n    maxDelayMs: retry?.maxDelayMs ?? defaults.maxDelayMs\n  };\n}\n\nexport function validateRetryOptions(\n  options: RetryOptions,\n  defaults?: Required<RetryOptions>\n): void {\n  if (options.maxAttempts !== undefined) {\n    if (!Number.isFinite(options.maxAttempts) || options.maxAttempts < 1) {\n      throw new Error(\"retry.maxAttempts must be >= 1\");\n    }\n    if (!Number.isInteger(options.maxAttempts)) {\n      throw new Error(\"retry.maxAttempts must be an integer\");\n    }\n  }\n  if (options.baseDelayMs !== undefined) {\n    if (!Number.isFinite(options.baseDelayMs) || options.baseDelayMs <= 0) {\n      throw new Error(\"retry.baseDelayMs must be > 0\");\n    }\n  }\n  if (options.maxDelayMs !== undefined) {\n    if (!Number.isFinite(options.maxDelayMs) || options.maxDelayMs <= 0) {\n      throw new Error(\"retry.maxDelayMs must be > 0\");\n    }\n  }\n\n  // Resolve against defaults (when provided) so that cross-field checks\n  // catch e.g. { baseDelayMs: 5000 } against default maxDelayMs: 3000.\n  const resolvedBase = options.baseDelayMs ?? defaults?.baseDelayMs;\n  const resolvedMax = options.maxDelayMs ?? defaults?.maxDelayMs;\n  if (\n    resolvedBase !== undefined &&\n    resolvedMax !== undefined &&\n    resolvedBase > resolvedMax\n  ) {\n    throw new Error(\"retry.baseDelayMs must be <= retry.maxDelayMs\");\n  }\n}\n\n/**\n * Returns the number of milliseconds to wait before retrying a request.\n * Uses the \"Full Jitter\" approach from\n * https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/\n *\n * @param attempt The current attempt number (1-indexed).\n * @param baseDelayMs Base delay multiplier in ms.\n * @param maxDelayMs Maximum delay cap in ms.\n * @returns Milliseconds to wait before retrying.\n */\nexport function jitterBackoff(\n  attempt: number,\n  baseDelayMs: number,\n  maxDelayMs: number\n): number {\n  const upperBoundMs = Math.min(2 ** attempt * baseDelayMs, maxDelayMs);\n  return Math.floor(Math.random() * upperBoundMs);\n}\n\n/**\n * Retry an async function up to `n` total attempts with jittered exponential backoff.\n *\n * @param n Total number of attempts (must be a finite integer >= 1).\n * @param fn The async function to retry. Receives the current attempt number (1-indexed).\n * @param options Retry configuration.\n * @returns The result of `fn` on success.\n * @throws The last error if all attempts fail or `shouldRetry` returns false.\n */\nexport async function tryN<T>(\n  n: number,\n  fn: (attempt: number) => Promise<T>,\n  options?: TryNOptions\n): Promise<T> {\n  if (!Number.isFinite(n) || n < 1) {\n    throw new Error(\"retry.maxAttempts must be >= 1\");\n  }\n  n = Math.floor(n);\n\n  const rawBase = options?.baseDelayMs ?? 100;\n  const rawMax = options?.maxDelayMs ?? 3000;\n\n  if (!Number.isFinite(rawBase) || rawBase <= 0) {\n    throw new Error(\"retry.baseDelayMs must be > 0\");\n  }\n  if (!Number.isFinite(rawMax) || rawMax <= 0) {\n    throw new Error(\"retry.maxDelayMs must be > 0\");\n  }\n\n  const baseDelayMs = Math.floor(rawBase);\n  const maxDelayMs = Math.floor(rawMax);\n\n  if (baseDelayMs > maxDelayMs) {\n    throw new Error(\"retry.baseDelayMs must be <= retry.maxDelayMs\");\n  }\n\n  let attempt = 1;\n  while (true) {\n    try {\n      return await fn(attempt);\n    } catch (err) {\n      const nextAttempt = attempt + 1;\n      if (\n        nextAttempt > n ||\n        (options?.shouldRetry && !options.shouldRetry(err, nextAttempt))\n      ) {\n        throw err;\n      }\n      const delay = jitterBackoff(attempt, baseDelayMs, maxDelayMs);\n      await new Promise((resolve) => setTimeout(resolve, delay));\n      attempt = nextAttempt;\n    }\n  }\n}\n\n/**\n * Returns true if the given error is retryable according to Durable Object error handling.\n * See https://developers.cloudflare.com/durable-objects/best-practices/error-handling/\n *\n * An error is retryable if it has `retryable: true` but is NOT an overloaded error.\n */\nexport function isErrorRetryable(err: unknown): boolean {\n  if (typeof err !== \"object\" || err === null) {\n    return false;\n  }\n  const msg = String(err);\n  const typed = err as { retryable?: boolean; overloaded?: boolean };\n  return (\n    Boolean(typed.retryable) &&\n    !typed.overloaded &&\n    !msg.includes(\"Durable Object is overloaded\")\n  );\n}\n\n/**\n * The \"superseded isolate\" platform messages — the invocation is running on an\n * isolate the platform has replaced with a new version (a deploy / code\n * update). For the rest of that invocation every operation throws the same\n * error (code never reloads mid-invocation), so in-process retries are futile;\n * but the next fresh invocation runs the new code and succeeds.\n *\n * workerd surfaces this as a plain `Error` with one of a few messages, all the\n * same failure class — a message match is the only signal:\n *   - \"Durable Object reset because its code was updated.\"  (DO storage op on a\n *     superseded isolate / deploy bounce)\n *   - \"This script has been upgraded. Please send a new request to connect to\n *     the new version.\"  (a stub/connection to a superseded script; the message\n *     literally instructs the caller to retry on the new version)\n *\n * The match stays close to the verbatim platform strings (rather than a loose\n * \"upgraded\"/\"reset\" substring) so an ordinary application error that happens\n * to mention those words is NOT misclassified as a supersede.\n */\nconst SUPERSEDED_ISOLATE_PATTERN =\n  /reset because its code was updated|this script has been upgraded/i;\n\n/**\n * The \"Network connection lost.\" platform transient — the connection between\n * the isolate and its storage (or another DO) dropped. Unlike a supersede this\n * MAY succeed on an in-process retry (a momentary blip), so it must not skip\n * the in-process retry budget — but during a deploy-reset window it never\n * succeeds in-process and surfaces interleaved with the supersede messages\n * (SQL ops throw `SqlError: SQL query failed: Network connection lost.` while\n * KV ops throw the reset message), so on retry exhaustion it must be treated\n * as the platform's failure, not the callback's.\n */\nconst CONNECTION_LOST_PATTERN = /network connection lost/i;\n\n/**\n * The exact Durable Object storage-reset platform signal. Keep this narrow:\n * ordinary SQL and generic internal errors are application failures. This is a\n * transient storage reset, not a memory-limit poison pill.\n */\nconst STORAGE_RESET_PATTERN =\n  /Internal error in Durable Object storage caused object to be reset/i;\n\n/**\n * The Durable Object memory-limit reset — the isolate exceeded its 128 MB limit\n * and was reset by the platform (workerd surfaces this verbatim as\n * \"Durable Object's isolate exceeded its memory limit and was reset.\"; the D1\n * sibling is \"D1 DB's isolate exceeded its memory limit and was reset.\").\n *\n * The match is the broad shared fragment \"exceeded its memory limit\" rather than\n * the full \"...and was reset\" sentence: real-world surfacings truncate or reword\n * the tail (some log pipelines clip the message; D1/storage wrappers re-prefix\n * it), and a customer-reported loop (#1825) showed lines carrying only the\n * \"exceeded its memory limit\" fragment. Missing a surfacing here means the\n * circuit breaker never engages, so we err toward the broader match — and even a\n * false positive is fail-safe (a tightly-bounded retry-then-seal, not data loss).\n *\n * This is DELIBERATELY a separate class from `SUPERSEDED_ISOLATE_PATTERN` /\n * {@link isPlatformTransientError}, and is NOT folded into them. A supersede or\n * connection-lost transient means \"re-run the same work and it succeeds on a\n * healthy isolate\" — those classes can be deferred and retried *indefinitely*. A\n * memory-limit reset is the opposite: re-running the SAME memory-heavy work\n * deterministically re-OOMs (the footprint, not the platform, is the cause), so\n * deferring it indefinitely would PRESERVE the one-shot row and re-run the\n * doomed work forever (amplifying the loop and cost — see #1825). It is a\n * poison-pill signal: callers must bound retries tightly and then SEAL.\n *\n * Accordingly the schedule executor (`_executeScheduleCallback`) and the\n * alarm-boundary circuit breaker (`Agent.alarm`) treat it as its OWN class: a\n * memory-limit reset is re-thrown (row preserved) so it reaches the breaker,\n * which tolerates a few strikes (`maxAlarmMemoryLimitStrikes`) and then seals +\n * purges the looping row — i.e. *bounded* deferral, never the unbounded deferral\n * the transient classes get.\n */\nconst MEMORY_LIMIT_RESET_PATTERN = /exceeded its memory limit/i;\n\nfunction errorMessageOf(error: unknown): string {\n  return error instanceof Error\n    ? error.message\n    : typeof error === \"string\"\n      ? error\n      : \"\";\n}\n\n/**\n * Iterate an error and its `cause` chain (depth-limited so a cyclic chain\n * can't spin). Wrappers like `SqlError` carry the original platform error in\n * `cause` and may not propagate signal properties (e.g. the CF `retryable`\n * flag), so classification must look through them.\n */\nfunction* selfAndCauses(error: unknown): Generator<unknown> {\n  let current = error;\n  for (let depth = 0; depth < 8 && current != null; depth++) {\n    yield current;\n    current =\n      typeof current === \"object\"\n        ? (current as { cause?: unknown }).cause\n        : undefined;\n  }\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) is a transient\n * \"superseded isolate\" failure — see `SUPERSEDED_ISOLATE_PATTERN`. In-process\n * retries are futile for this class; the work must be deferred to a fresh\n * invocation, which runs the new code and succeeds.\n */\nexport function isDurableObjectCodeUpdateReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (SUPERSEDED_ISOLATE_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) carries the exact\n * Durable Object storage-reset platform fragment. Generic SQL/internal errors\n * deliberately do not qualify.\n */\nexport function isDurableObjectStorageReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (STORAGE_RESET_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain, or a raw error-message\n * string) is a Durable Object memory-limit reset — see\n * {@link MEMORY_LIMIT_RESET_PATTERN}. Unlike {@link isPlatformTransientError},\n * re-running the same work re-OOMs deterministically, so callers must NOT defer\n * it like a transient; they should bound retries tightly and then seal (#1825).\n */\nexport function isDurableObjectMemoryLimitReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (MEMORY_LIMIT_RESET_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) is a transient failure\n * of the PLATFORM rather than of the code that threw it:\n *\n *   - a superseded-isolate reset (\"reset because its code was updated\" /\n *     \"this script has been upgraded\") — a deploy replaced the isolate;\n *   - an error the platform itself flags `retryable: true` (excluding\n *     overloaded errors, where retrying the same object won't help) — see\n *     `isErrorRetryable`;\n *   - \"Network connection lost.\" — the storage/stub connection dropped. The\n *     CF `retryable` flag does not survive error wrappers (e.g. `SqlError`\n *     copies only the message + `cause`) and is absent in some local-dev\n *     shapes, so the verbatim message is matched as well;\n *   - the exact \"Internal error in Durable Object storage caused object to be\n *     reset\" platform fragment. Generic internal and SQL errors remain fatal.\n *\n * Used to decide whether failed work should be RE-RUN LATER (platform\n * transient — the same work succeeds once the platform recovers, typically\n * seconds after a deploy) versus ABANDONED as genuinely failing (application\n * error — re-running yields the same failure). A genuine application error\n * carries none of these signals, so it is never misclassified by this check.\n */\n/**\n * Whether a failure is the PLATFORM's rather than the application's — any\n * platform transient (see {@link isPlatformTransientError}, which includes\n * superseded-isolate resets) or a memory-limit reset. Failed work in this\n * class must be PRESERVED and deferred, never completed as an application\n * failure. The two sub-classes defer differently: transients re-run\n * indefinitely (the platform recovers), while memory-limit deferral is\n * bounded by the alarm circuit breaker (#1825).\n */\nexport function isPlatformFailure(error: unknown): boolean {\n  return (\n    isPlatformTransientError(error) || isDurableObjectMemoryLimitReset(error)\n  );\n}\n\nexport function isPlatformTransientError(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    const message = errorMessageOf(e);\n    if (SUPERSEDED_ISOLATE_PATTERN.test(message)) return true;\n    if (CONNECTION_LOST_PATTERN.test(message)) return true;\n    if (STORAGE_RESET_PATTERN.test(message)) return true;\n    if (isErrorRetryable(e)) return true;\n  }\n  return false;\n}\n"],"mappings":";;;;;;;;AAgCA,SAAgB,mBACd,OACA,UACwB;CACxB,OAAO;EACL,aAAa,OAAO,eAAe,SAAS;EAC5C,aAAa,OAAO,eAAe,SAAS;EAC5C,YAAY,OAAO,cAAc,SAAS;CAC5C;AACF;AAEA,SAAgB,qBACd,SACA,UACM;CACN,IAAI,QAAQ,gBAAgB,KAAA,GAAW;EACrC,IAAI,CAAC,OAAO,SAAS,QAAQ,WAAW,KAAK,QAAQ,cAAc,GACjE,MAAM,IAAI,MAAM,gCAAgC;EAElD,IAAI,CAAC,OAAO,UAAU,QAAQ,WAAW,GACvC,MAAM,IAAI,MAAM,sCAAsC;CAE1D;CACA,IAAI,QAAQ,gBAAgB,KAAA;MACtB,CAAC,OAAO,SAAS,QAAQ,WAAW,KAAK,QAAQ,eAAe,GAClE,MAAM,IAAI,MAAM,+BAA+B;CAAA;CAGnD,IAAI,QAAQ,eAAe,KAAA;MACrB,CAAC,OAAO,SAAS,QAAQ,UAAU,KAAK,QAAQ,cAAc,GAChE,MAAM,IAAI,MAAM,8BAA8B;CAAA;CAMlD,MAAM,eAAe,QAAQ,eAAe,UAAU;CACtD,MAAM,cAAc,QAAQ,cAAc,UAAU;CACpD,IACE,iBAAiB,KAAA,KACjB,gBAAgB,KAAA,KAChB,eAAe,aAEf,MAAM,IAAI,MAAM,+CAA+C;AAEnE;;;;;;;;;;;AAYA,SAAgB,cACd,SACA,aACA,YACQ;CACR,MAAM,eAAe,KAAK,IAAI,KAAK,UAAU,aAAa,UAAU;CACpE,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,YAAY;AAChD;;;;;;;;;;AAWA,eAAsB,KACpB,GACA,IACA,SACY;CACZ,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,GAC7B,MAAM,IAAI,MAAM,gCAAgC;CAElD,IAAI,KAAK,MAAM,CAAC;CAEhB,MAAM,UAAU,SAAS,eAAe;CACxC,MAAM,SAAS,SAAS,cAAc;CAEtC,IAAI,CAAC,OAAO,SAAS,OAAO,KAAK,WAAW,GAC1C,MAAM,IAAI,MAAM,+BAA+B;CAEjD,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GACxC,MAAM,IAAI,MAAM,8BAA8B;CAGhD,MAAM,cAAc,KAAK,MAAM,OAAO;CACtC,MAAM,aAAa,KAAK,MAAM,MAAM;CAEpC,IAAI,cAAc,YAChB,MAAM,IAAI,MAAM,+CAA+C;CAGjE,IAAI,UAAU;CACd,OAAO,MACL,IAAI;EACF,OAAO,MAAM,GAAG,OAAO;CACzB,SAAS,KAAK;EACZ,MAAM,cAAc,UAAU;EAC9B,IACE,cAAc,KACb,SAAS,eAAe,CAAC,QAAQ,YAAY,KAAK,WAAW,GAE9D,MAAM;EAER,MAAM,QAAQ,cAAc,SAAS,aAAa,UAAU;EAC5D,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,KAAK,CAAC;EACzD,UAAU;CACZ;AAEJ;;;;;;;AAQA,SAAgB,iBAAiB,KAAuB;CACtD,IAAI,OAAO,QAAQ,YAAY,QAAQ,MACrC,OAAO;CAET,MAAM,MAAM,OAAO,GAAG;CACtB,MAAM,QAAQ;CACd,OACE,QAAQ,MAAM,SAAS,KACvB,CAAC,MAAM,cACP,CAAC,IAAI,SAAS,8BAA8B;AAEhD;;;;;;;;;;;;;;;;;;;;AAqBA,MAAM,6BACJ;;;;;;;;;;;AAYF,MAAM,0BAA0B;;;;;;AAOhC,MAAM,wBACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCF,MAAM,6BAA6B;AAEnC,SAAS,eAAe,OAAwB;CAC9C,OAAO,iBAAiB,QACpB,MAAM,UACN,OAAO,UAAU,WACf,QACA;AACR;;;;;;;AAQA,UAAU,cAAc,OAAoC;CAC1D,IAAI,UAAU;CACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,WAAW,MAAM,SAAS;EACzD,MAAM;EACN,UACE,OAAO,YAAY,WACd,QAAgC,QACjC,KAAA;CACR;AACF;;;;;;;AAQA,SAAgB,+BAA+B,OAAyB;CACtE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,2BAA2B,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAEjE,OAAO;AACT;;;;;;AAOA,SAAgB,4BAA4B,OAAyB;CACnE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,sBAAsB,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAE5D,OAAO;AACT;;;;;;;;AASA,SAAgB,gCAAgC,OAAyB;CACvE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,2BAA2B,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAEjE,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCA,SAAgB,kBAAkB,OAAyB;CACzD,OACE,yBAAyB,KAAK,KAAK,gCAAgC,KAAK;AAE5E;AAEA,SAAgB,yBAAyB,OAAyB;CAChE,KAAK,MAAM,KAAK,cAAc,KAAK,GAAG;EACpC,MAAM,UAAU,eAAe,CAAC;EAChC,IAAI,2BAA2B,KAAK,OAAO,GAAG,OAAO;EACrD,IAAI,wBAAwB,KAAK,OAAO,GAAG,OAAO;EAClD,IAAI,sBAAsB,KAAK,OAAO,GAAG,OAAO;EAChD,IAAI,iBAAiB,CAAC,GAAG,OAAO;CAClC;CACA,OAAO;AACT"}
+{"version":3,"file":"retries.js","names":[],"sources":["../src/retries.ts"],"sourcesContent":["/**\n * Retry options for schedule(), scheduleEvery(), queue(), and this.retry().\n */\nexport interface RetryOptions {\n  /** Max number of attempts (including the first). Default: 3 */\n  maxAttempts?: number;\n  /** Base delay in ms for exponential backoff. Default: 100 */\n  baseDelayMs?: number;\n  /** Max delay cap in ms. Default: 3000 */\n  maxDelayMs?: number;\n}\n\n/**\n * Internal options for tryN -- extends RetryOptions with a shouldRetry predicate.\n */\ninterface TryNOptions extends RetryOptions {\n  /**\n   * Predicate to determine if an error should be retried.\n   * Receives the error and the next attempt number (so callers can\n   * make attempt-aware decisions).\n   * If not provided, all errors are retried.\n   */\n  shouldRetry?: (err: unknown, nextAttempt: number) => boolean;\n}\n\n/**\n * Validate retry options eagerly so invalid config fails at enqueue/schedule time\n * rather than at execution time. Checks individual field ranges, enforces integer\n * maxAttempts, and validates cross-field constraints after resolving against\n * defaults when provided.\n */\n/** Fill unset per-call retry options from a required set of defaults. */\nexport function resolveRetryConfig(\n  retry: RetryOptions | undefined,\n  defaults: Required<RetryOptions>\n): Required<RetryOptions> {\n  return {\n    maxAttempts: retry?.maxAttempts ?? defaults.maxAttempts,\n    baseDelayMs: retry?.baseDelayMs ?? defaults.baseDelayMs,\n    maxDelayMs: retry?.maxDelayMs ?? defaults.maxDelayMs\n  };\n}\n\nexport function validateRetryOptions(\n  options: RetryOptions,\n  defaults?: Required<RetryOptions>\n): void {\n  if (options.maxAttempts !== undefined) {\n    if (!Number.isFinite(options.maxAttempts) || options.maxAttempts < 1) {\n      throw new Error(\"retry.maxAttempts must be >= 1\");\n    }\n    if (!Number.isInteger(options.maxAttempts)) {\n      throw new Error(\"retry.maxAttempts must be an integer\");\n    }\n  }\n  if (options.baseDelayMs !== undefined) {\n    if (!Number.isFinite(options.baseDelayMs) || options.baseDelayMs <= 0) {\n      throw new Error(\"retry.baseDelayMs must be > 0\");\n    }\n  }\n  if (options.maxDelayMs !== undefined) {\n    if (!Number.isFinite(options.maxDelayMs) || options.maxDelayMs <= 0) {\n      throw new Error(\"retry.maxDelayMs must be > 0\");\n    }\n  }\n\n  // Resolve against defaults (when provided) so that cross-field checks\n  // catch e.g. { baseDelayMs: 5000 } against default maxDelayMs: 3000.\n  const resolvedBase = options.baseDelayMs ?? defaults?.baseDelayMs;\n  const resolvedMax = options.maxDelayMs ?? defaults?.maxDelayMs;\n  if (\n    resolvedBase !== undefined &&\n    resolvedMax !== undefined &&\n    resolvedBase > resolvedMax\n  ) {\n    throw new Error(\"retry.baseDelayMs must be <= retry.maxDelayMs\");\n  }\n}\n\n/**\n * Returns the number of milliseconds to wait before retrying a request.\n * Uses the \"Full Jitter\" approach from\n * https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/\n *\n * @param attempt The current attempt number (1-indexed).\n * @param baseDelayMs Base delay multiplier in ms.\n * @param maxDelayMs Maximum delay cap in ms.\n * @returns Milliseconds to wait before retrying.\n */\nexport function jitterBackoff(\n  attempt: number,\n  baseDelayMs: number,\n  maxDelayMs: number\n): number {\n  const upperBoundMs = Math.min(2 ** attempt * baseDelayMs, maxDelayMs);\n  return Math.floor(Math.random() * upperBoundMs);\n}\n\n/**\n * Retry an async function up to `n` total attempts with jittered exponential backoff.\n *\n * @param n Total number of attempts (must be a finite integer >= 1).\n * @param fn The async function to retry. Receives the current attempt number (1-indexed).\n * @param options Retry configuration.\n * @returns The result of `fn` on success.\n * @throws The last error if all attempts fail or `shouldRetry` returns false.\n */\nexport async function tryN<T>(\n  n: number,\n  fn: (attempt: number) => Promise<T>,\n  options?: TryNOptions\n): Promise<T> {\n  if (!Number.isFinite(n) || n < 1) {\n    throw new Error(\"retry.maxAttempts must be >= 1\");\n  }\n  n = Math.floor(n);\n\n  const rawBase = options?.baseDelayMs ?? 100;\n  const rawMax = options?.maxDelayMs ?? 3000;\n\n  if (!Number.isFinite(rawBase) || rawBase <= 0) {\n    throw new Error(\"retry.baseDelayMs must be > 0\");\n  }\n  if (!Number.isFinite(rawMax) || rawMax <= 0) {\n    throw new Error(\"retry.maxDelayMs must be > 0\");\n  }\n\n  const baseDelayMs = Math.floor(rawBase);\n  const maxDelayMs = Math.floor(rawMax);\n\n  if (baseDelayMs > maxDelayMs) {\n    throw new Error(\"retry.baseDelayMs must be <= retry.maxDelayMs\");\n  }\n\n  let attempt = 1;\n  while (true) {\n    try {\n      return await fn(attempt);\n    } catch (err) {\n      const nextAttempt = attempt + 1;\n      if (\n        nextAttempt > n ||\n        (options?.shouldRetry && !options.shouldRetry(err, nextAttempt))\n      ) {\n        throw err;\n      }\n      const delay = jitterBackoff(attempt, baseDelayMs, maxDelayMs);\n      await new Promise((resolve) => setTimeout(resolve, delay));\n      attempt = nextAttempt;\n    }\n  }\n}\n\n/**\n * Returns true if the given error is retryable according to Durable Object error handling.\n * See https://developers.cloudflare.com/durable-objects/best-practices/error-handling/\n *\n * An error is retryable if it has `retryable: true` but is NOT an overloaded error.\n */\nexport function isErrorRetryable(err: unknown): boolean {\n  if (typeof err !== \"object\" || err === null) {\n    return false;\n  }\n  const msg = String(err);\n  const typed = err as { retryable?: boolean; overloaded?: boolean };\n  return (\n    Boolean(typed.retryable) &&\n    !typed.overloaded &&\n    !msg.includes(\"Durable Object is overloaded\")\n  );\n}\n\n/**\n * The \"superseded isolate\" platform messages — the invocation is running on an\n * isolate the platform has replaced with a new version (a deploy / code\n * update). For the rest of that invocation every operation throws the same\n * error (code never reloads mid-invocation), so in-process retries are futile;\n * but the next fresh invocation runs the new code and succeeds.\n *\n * workerd surfaces this as a plain `Error` with one of a few messages, all the\n * same failure class — a message match is the only signal:\n *   - \"Durable Object reset because its code was updated.\"  (DO storage op on a\n *     superseded isolate / deploy bounce)\n *   - \"This script has been upgraded. Please send a new request to connect to\n *     the new version.\"  (a stub/connection to a superseded script; the message\n *     literally instructs the caller to retry on the new version)\n *\n * The match stays close to the verbatim platform strings (rather than a loose\n * \"upgraded\"/\"reset\" substring) so an ordinary application error that happens\n * to mention those words is NOT misclassified as a supersede.\n */\nconst SUPERSEDED_ISOLATE_PATTERN =\n  /reset because its code was updated|this script has been upgraded/i;\n\n/**\n * The \"Network connection lost.\" platform transient — the connection between\n * the isolate and its storage (or another DO) dropped. Unlike a supersede this\n * MAY succeed on an in-process retry (a momentary blip), so it must not skip\n * the in-process retry budget — but during a deploy-reset window it never\n * succeeds in-process and surfaces interleaved with the supersede messages\n * (SQL ops throw `SqlError: SQL query failed: Network connection lost.` while\n * KV ops throw the reset message), so on retry exhaustion it must be treated\n * as the platform's failure, not the callback's.\n */\nconst CONNECTION_LOST_PATTERN = /network connection lost/i;\n\n/**\n * The exact Durable Object storage-reset platform signal. Keep this narrow:\n * ordinary SQL and generic internal errors are application failures. This is a\n * transient storage reset, not a memory-limit poison pill.\n */\nconst STORAGE_RESET_PATTERN =\n  /Internal error in Durable Object storage caused object to be reset/i;\n\n/**\n * The Durable Object memory-limit reset — the isolate exceeded its 128 MB limit\n * and was reset by the platform (workerd surfaces this verbatim as\n * \"Durable Object's isolate exceeded its memory limit and was reset.\"; the D1\n * sibling is \"D1 DB's isolate exceeded its memory limit and was reset.\").\n *\n * The match is the broad shared fragment \"exceeded its memory limit\" rather than\n * the full \"...and was reset\" sentence: real-world surfacings truncate or reword\n * the tail (some log pipelines clip the message; D1/storage wrappers re-prefix\n * it), and a customer-reported loop (#1825) showed lines carrying only the\n * \"exceeded its memory limit\" fragment. Missing a surfacing here means the\n * circuit breaker never engages, so we err toward the broader match — and even a\n * false positive is fail-safe (a tightly-bounded retry-then-seal, not data loss).\n *\n * This is DELIBERATELY a separate class from `SUPERSEDED_ISOLATE_PATTERN` /\n * {@link isPlatformTransientError}, and is NOT folded into them. A supersede or\n * connection-lost transient means \"re-run the same work and it succeeds on a\n * healthy isolate\" — those classes can be deferred and retried *indefinitely*. A\n * memory-limit reset is the opposite: re-running the SAME memory-heavy work\n * deterministically re-OOMs (the footprint, not the platform, is the cause), so\n * deferring it indefinitely would PRESERVE the one-shot row and re-run the\n * doomed work forever (amplifying the loop and cost — see #1825). It is a\n * poison-pill signal: callers must bound retries tightly and then SEAL.\n *\n * Accordingly the schedule executor (`_executeScheduleCallback`) and the\n * alarm-boundary circuit breaker (`Agent.alarm`) treat it as its OWN class: a\n * memory-limit reset is re-thrown (row preserved) so it reaches the breaker,\n * which tolerates a few strikes (`maxAlarmMemoryLimitStrikes`) and then seals +\n * purges the looping row — i.e. *bounded* deferral, never the unbounded deferral\n * the transient classes get.\n */\nconst MEMORY_LIMIT_RESET_PATTERN = /exceeded its memory limit/i;\n\nfunction errorMessageOf(error: unknown): string {\n  return error instanceof Error\n    ? error.message\n    : typeof error === \"string\"\n      ? error\n      : \"\";\n}\n\n/**\n * Iterate an error and its `cause` chain (depth-limited so a cyclic chain\n * can't spin). Wrappers like `SqlError` carry the original platform error in\n * `cause` and may not propagate signal properties (e.g. the CF `retryable`\n * flag), so classification must look through them.\n */\nfunction* selfAndCauses(error: unknown): Generator<unknown> {\n  let current = error;\n  for (let depth = 0; depth < 8 && current != null; depth++) {\n    yield current;\n    current =\n      typeof current === \"object\"\n        ? (current as { cause?: unknown }).cause\n        : undefined;\n  }\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) is a transient\n * \"superseded isolate\" failure — see `SUPERSEDED_ISOLATE_PATTERN`. In-process\n * retries are futile for this class; the work must be deferred to a fresh\n * invocation, which runs the new code and succeeds.\n */\nexport function isDurableObjectCodeUpdateReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (SUPERSEDED_ISOLATE_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) carries the exact\n * Durable Object storage-reset platform fragment. Generic SQL/internal errors\n * deliberately do not qualify.\n */\nexport function isDurableObjectStorageReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (STORAGE_RESET_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) is a Durable Object\n * reset — a superseded isolate ({@link isDurableObjectCodeUpdateReset}) or a\n * storage reset ({@link isDurableObjectStorageReset}). The isolate is going\n * away, so live chat recovery must not schedule a retry for it: the restart's\n * own recovery owns the turn.\n */\nexport function isDurableObjectResetError(error: unknown): boolean {\n  return (\n    isDurableObjectCodeUpdateReset(error) || isDurableObjectStorageReset(error)\n  );\n}\n\n/**\n * Whether an error (or anything in its `cause` chain, or a raw error-message\n * string) is a Durable Object memory-limit reset — see\n * {@link MEMORY_LIMIT_RESET_PATTERN}. Unlike {@link isPlatformTransientError},\n * re-running the same work re-OOMs deterministically, so callers must NOT defer\n * it like a transient; they should bound retries tightly and then seal (#1825).\n */\nexport function isDurableObjectMemoryLimitReset(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    if (MEMORY_LIMIT_RESET_PATTERN.test(errorMessageOf(e))) return true;\n  }\n  return false;\n}\n\n/**\n * Whether an error (or anything in its `cause` chain) is a transient failure\n * of the PLATFORM rather than of the code that threw it:\n *\n *   - a superseded-isolate reset (\"reset because its code was updated\" /\n *     \"this script has been upgraded\") — a deploy replaced the isolate;\n *   - an error the platform itself flags `retryable: true` (excluding\n *     overloaded errors, where retrying the same object won't help) — see\n *     `isErrorRetryable`;\n *   - \"Network connection lost.\" — the storage/stub connection dropped. The\n *     CF `retryable` flag does not survive error wrappers (e.g. `SqlError`\n *     copies only the message + `cause`) and is absent in some local-dev\n *     shapes, so the verbatim message is matched as well;\n *   - the exact \"Internal error in Durable Object storage caused object to be\n *     reset\" platform fragment. Generic internal and SQL errors remain fatal.\n *\n * Used to decide whether failed work should be RE-RUN LATER (platform\n * transient — the same work succeeds once the platform recovers, typically\n * seconds after a deploy) versus ABANDONED as genuinely failing (application\n * error — re-running yields the same failure). A genuine application error\n * carries none of these signals, so it is never misclassified by this check.\n */\n/**\n * Whether a failure is the PLATFORM's rather than the application's — any\n * platform transient (see {@link isPlatformTransientError}, which includes\n * superseded-isolate resets) or a memory-limit reset. Failed work in this\n * class must be PRESERVED and deferred, never completed as an application\n * failure. The two sub-classes defer differently: transients re-run\n * indefinitely (the platform recovers), while memory-limit deferral is\n * bounded by the alarm circuit breaker (#1825).\n */\nexport function isPlatformFailure(error: unknown): boolean {\n  return (\n    isPlatformTransientError(error) || isDurableObjectMemoryLimitReset(error)\n  );\n}\n\nexport function isPlatformTransientError(error: unknown): boolean {\n  for (const e of selfAndCauses(error)) {\n    const message = errorMessageOf(e);\n    if (SUPERSEDED_ISOLATE_PATTERN.test(message)) return true;\n    if (CONNECTION_LOST_PATTERN.test(message)) return true;\n    if (STORAGE_RESET_PATTERN.test(message)) return true;\n    if (isErrorRetryable(e)) return true;\n  }\n  return false;\n}\n"],"mappings":";;;;;;;;AAgCA,SAAgB,mBACd,OACA,UACwB;CACxB,OAAO;EACL,aAAa,OAAO,eAAe,SAAS;EAC5C,aAAa,OAAO,eAAe,SAAS;EAC5C,YAAY,OAAO,cAAc,SAAS;CAC5C;AACF;AAEA,SAAgB,qBACd,SACA,UACM;CACN,IAAI,QAAQ,gBAAgB,KAAA,GAAW;EACrC,IAAI,CAAC,OAAO,SAAS,QAAQ,WAAW,KAAK,QAAQ,cAAc,GACjE,MAAM,IAAI,MAAM,gCAAgC;EAElD,IAAI,CAAC,OAAO,UAAU,QAAQ,WAAW,GACvC,MAAM,IAAI,MAAM,sCAAsC;CAE1D;CACA,IAAI,QAAQ,gBAAgB,KAAA;MACtB,CAAC,OAAO,SAAS,QAAQ,WAAW,KAAK,QAAQ,eAAe,GAClE,MAAM,IAAI,MAAM,+BAA+B;CAAA;CAGnD,IAAI,QAAQ,eAAe,KAAA;MACrB,CAAC,OAAO,SAAS,QAAQ,UAAU,KAAK,QAAQ,cAAc,GAChE,MAAM,IAAI,MAAM,8BAA8B;CAAA;CAMlD,MAAM,eAAe,QAAQ,eAAe,UAAU;CACtD,MAAM,cAAc,QAAQ,cAAc,UAAU;CACpD,IACE,iBAAiB,KAAA,KACjB,gBAAgB,KAAA,KAChB,eAAe,aAEf,MAAM,IAAI,MAAM,+CAA+C;AAEnE;;;;;;;;;;;AAYA,SAAgB,cACd,SACA,aACA,YACQ;CACR,MAAM,eAAe,KAAK,IAAI,KAAK,UAAU,aAAa,UAAU;CACpE,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,YAAY;AAChD;;;;;;;;;;AAWA,eAAsB,KACpB,GACA,IACA,SACY;CACZ,IAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,GAC7B,MAAM,IAAI,MAAM,gCAAgC;CAElD,IAAI,KAAK,MAAM,CAAC;CAEhB,MAAM,UAAU,SAAS,eAAe;CACxC,MAAM,SAAS,SAAS,cAAc;CAEtC,IAAI,CAAC,OAAO,SAAS,OAAO,KAAK,WAAW,GAC1C,MAAM,IAAI,MAAM,+BAA+B;CAEjD,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GACxC,MAAM,IAAI,MAAM,8BAA8B;CAGhD,MAAM,cAAc,KAAK,MAAM,OAAO;CACtC,MAAM,aAAa,KAAK,MAAM,MAAM;CAEpC,IAAI,cAAc,YAChB,MAAM,IAAI,MAAM,+CAA+C;CAGjE,IAAI,UAAU;CACd,OAAO,MACL,IAAI;EACF,OAAO,MAAM,GAAG,OAAO;CACzB,SAAS,KAAK;EACZ,MAAM,cAAc,UAAU;EAC9B,IACE,cAAc,KACb,SAAS,eAAe,CAAC,QAAQ,YAAY,KAAK,WAAW,GAE9D,MAAM;EAER,MAAM,QAAQ,cAAc,SAAS,aAAa,UAAU;EAC5D,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,KAAK,CAAC;EACzD,UAAU;CACZ;AAEJ;;;;;;;AAQA,SAAgB,iBAAiB,KAAuB;CACtD,IAAI,OAAO,QAAQ,YAAY,QAAQ,MACrC,OAAO;CAET,MAAM,MAAM,OAAO,GAAG;CACtB,MAAM,QAAQ;CACd,OACE,QAAQ,MAAM,SAAS,KACvB,CAAC,MAAM,cACP,CAAC,IAAI,SAAS,8BAA8B;AAEhD;;;;;;;;;;;;;;;;;;;;AAqBA,MAAM,6BACJ;;;;;;;;;;;AAYF,MAAM,0BAA0B;;;;;;AAOhC,MAAM,wBACJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCF,MAAM,6BAA6B;AAEnC,SAAS,eAAe,OAAwB;CAC9C,OAAO,iBAAiB,QACpB,MAAM,UACN,OAAO,UAAU,WACf,QACA;AACR;;;;;;;AAQA,UAAU,cAAc,OAAoC;CAC1D,IAAI,UAAU;CACd,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,WAAW,MAAM,SAAS;EACzD,MAAM;EACN,UACE,OAAO,YAAY,WACd,QAAgC,QACjC,KAAA;CACR;AACF;;;;;;;AAQA,SAAgB,+BAA+B,OAAyB;CACtE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,2BAA2B,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAEjE,OAAO;AACT;;;;;;AAOA,SAAgB,4BAA4B,OAAyB;CACnE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,sBAAsB,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAE5D,OAAO;AACT;;;;;;;;AASA,SAAgB,0BAA0B,OAAyB;CACjE,OACE,+BAA+B,KAAK,KAAK,4BAA4B,KAAK;AAE9E;;;;;;;;AASA,SAAgB,gCAAgC,OAAyB;CACvE,KAAK,MAAM,KAAK,cAAc,KAAK,GACjC,IAAI,2BAA2B,KAAK,eAAe,CAAC,CAAC,GAAG,OAAO;CAEjE,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCA,SAAgB,kBAAkB,OAAyB;CACzD,OACE,yBAAyB,KAAK,KAAK,gCAAgC,KAAK;AAE5E;AAEA,SAAgB,yBAAyB,OAAyB;CAChE,KAAK,MAAM,KAAK,cAAc,KAAK,GAAG;EACpC,MAAM,UAAU,eAAe,CAAC;EAChC,IAAI,2BAA2B,KAAK,OAAO,GAAG,OAAO;EACrD,IAAI,wBAAwB,KAAK,OAAO,GAAG,OAAO;EAClD,IAAI,sBAAsB,KAAK,OAAO,GAAG,OAAO;EAChD,IAAI,iBAAiB,CAAC,GAAG,OAAO;CAClC;CACA,OAAO;AACT"}

package/dist/routing/index.d.ts

@@ -2,7 +2,7 @@ import {
   r as CapabilityWebSocketUpgradeContext,
   s as LifecycleCapability,
   t as CapabilityRequestContext
-} from "../capability-runner-BUBa6Ake.js";
+} from "../capability-runner-DBAnGr6L.js";
 import {
   a as routeAgentRequest,
   c as Agent,
@@ -10,7 +10,7 @@ import {
   n as AgentOptions,
   r as RoutingRetryOptions,
   t as AgentGetOptions
-} from "../agent-routing-B2XLNMxq.js";
+} from "../agent-routing-0DR0Tk2v.js";
 
 //#region src/routing/routed-agents.d.ts
 /** A public entry in an {@link RoutedAgents}. */

package/dist/routing/index.js

@@ -1,7 +1,7 @@
 import { getAgentByName, routeAgentRequest } from "../agent-routing.js";
 import { i as _classPrivateFieldInitSpec, n as _classPrivateFieldSet2, r as _assertClassBrand, t as _classPrivateFieldGet2 } from "../classPrivateFieldGet2-DZBYAB34.js";
-import { t as LifecycleCapability } from "../capability-B4WbF81e.js";
 import { t as _classPrivateMethodInitSpec } from "../classPrivateMethodInitSpec-qMjJ6sHQ.js";
+import { t as LifecycleCapability } from "../capability-B4WbF81e.js";
 //#region src/routing/routed-agents.ts
 /**
 * Catalog of the entries an owning Durable Object has created, keyed by

package/dist/{scheduler-D_KHqxBa.js → scheduler-DZ3xQfeK.js}

@@ -1,6 +1,6 @@
 import { i as _classPrivateFieldInitSpec, n as _classPrivateFieldSet2, r as _assertClassBrand, t as _classPrivateFieldGet2 } from "./classPrivateFieldGet2-DZBYAB34.js";
-import { t as LifecycleCapability } from "./capability-B4WbF81e.js";
 import { t as _classPrivateMethodInitSpec } from "./classPrivateMethodInitSpec-qMjJ6sHQ.js";
+import { t as LifecycleCapability } from "./capability-B4WbF81e.js";
 import { isDurableObjectCodeUpdateReset, isPlatformFailure, resolveRetryConfig, tryN, validateRetryOptions } from "./retries.js";
 import { parseCronExpression } from "cron-schedule";
 //#region src/schedules/schedule-timing.ts
@@ -655,4 +655,4 @@ function _emitCreated(result) {
 //#endregion
 export { setSchedulerCallbackResolver as n, Scheduler as t };
 
-//# sourceMappingURL=scheduler-D_KHqxBa.js.map
+//# sourceMappingURL=scheduler-DZ3xQfeK.js.map

package/dist/{scheduler-D_KHqxBa.js.map → scheduler-DZ3xQfeK.js.map}

@@ -1 +1 @@
-{"version":3,"file":"scheduler-D_KHqxBa.js","names":[],"sources":["../src/schedules/schedule-timing.ts","../src/schedules/scheduler.ts"],"sourcesContent":["/**\n * Pure timing rules for persistent schedules.\n *\n * A `ScheduleTiming` is the parsed \"when and how it runs\" half of a\n * `Schedule` — everything except identity, callback, and payload. Parsing\n * user-facing inputs here keeps Scheduler's storage code to one insert path.\n */\n\nimport { parseCronExpression } from \"cron-schedule\";\n\n/** Longest allowed gap between interval executions: 30 days. */\nexport const MAX_INTERVAL_SECONDS = 30 * 24 * 60 * 60;\n\n/** When and how one schedule runs; a `Schedule` minus identity and payload. */\nexport type ScheduleTiming =\n  | {\n      /** One-time execution at a specific date. */\n      readonly type: \"scheduled\";\n      /** Unix timestamp in seconds. */\n      readonly time: number;\n    }\n  | {\n      /** One-time execution after a relative delay. */\n      readonly type: \"delayed\";\n      /** Unix timestamp in seconds. */\n      readonly time: number;\n      /** Delay from creation in seconds. */\n      readonly delayInSeconds: number;\n    }\n  | {\n      /** Recurring execution from a cron expression. */\n      readonly type: \"cron\";\n      /** Unix timestamp in seconds for the next execution. */\n      readonly time: number;\n      /** Cron expression defining the recurrence. */\n      readonly cron: string;\n    }\n  | {\n      /** Recurring execution at a fixed interval. */\n      readonly type: \"interval\";\n      /** Unix timestamp in seconds for the next execution. */\n      readonly time: number;\n      /** Number of seconds between executions. */\n      readonly intervalSeconds: number;\n    };\n\n/** True when this timing repeats and therefore deduplicates by default. */\nexport function isRecurring(timing: ScheduleTiming): boolean {\n  return timing.type === \"cron\" || timing.type === \"interval\";\n}\n\n/**\n * Next wall-clock execution time for a cron expression.\n *\n * @param cron - A standard cron expression.\n * @param nowMs - Current epoch time in milliseconds.\n * @returns The next execution epoch time in milliseconds.\n * @throws For an unparseable cron expression.\n */\nexport function nextCronTimeMs(cron: string, nowMs: number): number {\n  return parseCronExpression(cron).getNextDate(new Date(nowMs)).getTime();\n}\n\n/**\n * Parse a user-facing `when` into schedule timing.\n *\n * A `Date` runs once at that date, a number runs once after that many\n * seconds, and a string is a recurring cron expression.\n *\n * @param when - The requested execution time or recurrence.\n * @param nowMs - Current epoch time in milliseconds.\n * @param callback - Callback name, used only in error messages.\n * @returns The parsed timing.\n * @throws For a `when` value that is not a `Date`, number, or string.\n */\nexport function parseWhen(\n  when: Date | string | number,\n  nowMs: number,\n  callback: string\n): ScheduleTiming {\n  if (when instanceof Date) {\n    return { type: \"scheduled\", time: Math.floor(when.getTime() / 1000) };\n  }\n  if (typeof when === \"number\") {\n    return {\n      type: \"delayed\",\n      time: Math.floor((nowMs + when * 1000) / 1000),\n      delayInSeconds: when\n    };\n  }\n  if (typeof when === \"string\") {\n    return {\n      type: \"cron\",\n      time: Math.floor(nextCronTimeMs(when, nowMs) / 1000),\n      cron: when\n    };\n  }\n  throw new Error(\n    `Invalid schedule type: ${JSON.stringify(when)}(${typeof when}) trying to schedule ${callback}`\n  );\n}\n\n/**\n * Reject an interval outside the supported range.\n *\n * @param intervalSeconds - The requested gap between executions.\n * @throws For a non-positive interval or one longer than 30 days.\n */\nexport function validateIntervalSeconds(intervalSeconds: number): void {\n  if (typeof intervalSeconds !== \"number\" || intervalSeconds <= 0) {\n    throw new Error(\"intervalSeconds must be a positive number\");\n  }\n  if (intervalSeconds > MAX_INTERVAL_SECONDS) {\n    throw new Error(\n      `intervalSeconds cannot exceed ${MAX_INTERVAL_SECONDS} seconds (30 days)`\n    );\n  }\n}\n\n/**\n * Parse a fixed interval into schedule timing.\n *\n * @param intervalSeconds - Seconds between executions.\n * @param nowMs - Current epoch time in milliseconds.\n * @returns The parsed timing with the first execution one interval from now.\n * @throws For an interval outside the supported range.\n */\nexport function parseInterval(\n  intervalSeconds: number,\n  nowMs: number\n): ScheduleTiming {\n  validateIntervalSeconds(intervalSeconds);\n  return {\n    type: \"interval\",\n    time: Math.floor((nowMs + intervalSeconds * 1000) / 1000),\n    intervalSeconds\n  };\n}\n","/**\n * Lifecycle scheduling vocabulary. Scheduler validates schedules, resolves\n * named callbacks, and pushes jobs into the Lifecycle-owned job queue;\n * Lifecycle runs the alarm event loop, retry policy, and physical alarm\n * arming. Scheduler owns no storage of its own — each schedule is one job\n * whose `fn` is the callback name and whose payload carries the schedule's\n * timing vocabulary.\n */\n\nimport {\n  LifecycleCapability,\n  type LifecycleRouteAddress,\n  type LifecycleRouteContext\n} from \"../lifecycle/capability\";\nimport type {\n  LifecycleJob,\n  LifecycleJobContext,\n  LifecycleJobOutcome\n} from \"../lifecycle/job-queue\";\nimport {\n  isDurableObjectCodeUpdateReset,\n  isPlatformFailure,\n  resolveRetryConfig,\n  tryN,\n  validateRetryOptions\n} from \"../retries\";\nimport type { RetryOptions } from \"../retries\";\nimport type { SchedulerEventType, SchedulerOptions } from \"./options\";\nimport {\n  isRecurring,\n  nextCronTimeMs,\n  parseInterval,\n  parseWhen,\n  validateIntervalSeconds,\n  type ScheduleTiming\n} from \"./schedule-timing\";\nimport type {\n  RecoveryLoopScheduleOptions,\n  Schedule,\n  ScheduleCriteria,\n  ScheduleOptions,\n  ScheduleStorageRow,\n  SchedulerCallbacks,\n  SchedulerHandlers,\n  SchedulerPayload\n} from \"./types\";\n\n/**\n * A resolved fallback handler for a callback name outside the registered map.\n */\ntype ResolvedSchedulerCallback = (\n  payload: unknown,\n  schedule: Schedule<unknown>\n) => unknown;\n\nconst schedulerCallbackResolvers = new WeakMap<\n  object,\n  (name: string) => ResolvedSchedulerCallback | undefined\n>();\n\n/**\n * @internal Supply a composition-root fallback for callback names outside the\n * registered map. Agent uses this to keep its historical name-based\n * scheduling API (`this.schedule(60, \"methodName\")`) working: the resolver\n * looks the method up on the Agent, and the resolved handler still runs\n * inside the Lifecycle host boundary.\n */\nexport function setSchedulerCallbackResolver(\n  scheduler: Scheduler<never>,\n  resolver: (name: string) => ResolvedSchedulerCallback | undefined\n): void {\n  schedulerCallbackResolvers.set(scheduler, resolver);\n}\n\nconst SCHEDULE_SCHEMA_VERSION_KEY = \"cf_agents:schedules_schema_version\";\n/** Version 2: schedule rows live in the Lifecycle job queue. */\nconst CURRENT_SCHEDULE_SCHEMA_VERSION = 2;\n\n/**\n * Legacy schedule callbacks whose rows drive chat recovery loops from before\n * the job queue carried breaker membership. The migration is the one place\n * allowed to know legacy names (it already drops `_cf_keepAliveHeartbeat`\n * rows by name): a recovery row migrated without its `recoveryLoop` flag\n * would escape the alarm memory-limit breaker (#1825) and could re-trigger\n * a doomed loop on an upgraded object.\n */\nconst LEGACY_RECOVERY_LOOP_CALLBACKS = new Set([\n  \"_chatRecoveryContinue\",\n  \"_chatRecoveryRetry\"\n]);\n\nconst DEFAULT_RETRY: Required<RetryOptions> = {\n  maxAttempts: 3,\n  baseDelayMs: 100,\n  maxDelayMs: 3000\n};\n\n/**\n * The schedule timing vocabulary carried in one job's payload. The callback\n * name is the job's `fn`; the user payload rides in `payload`.\n */\ntype SchedulerJobPayload = {\n  readonly payload: unknown;\n  readonly type: \"scheduled\" | \"delayed\" | \"cron\" | \"interval\";\n  /** The caller-supplied retry override, unresolved, for public projection.\n      The job's own retry options are fully resolved against the Scheduler\n      defaults at push so the Lifecycle driver applies the configured\n      policy. */\n  readonly retry?: RetryOptions;\n  readonly delayInSeconds?: number;\n  readonly cron?: string;\n  readonly intervalSeconds?: number;\n  readonly owner_path?: string | null;\n  readonly owner_path_key?: string | null;\n};\n\ntype SchedulerRouteMessage =\n  | {\n      readonly type: \"schedule\";\n      readonly when: Date | string | number;\n      readonly callback: string;\n      readonly payload?: unknown;\n      readonly options?: ScheduleOptions;\n    }\n  | {\n      readonly type: \"every\";\n      readonly intervalSeconds: number;\n      readonly callback: string;\n      readonly payload?: unknown;\n      readonly options?: ScheduleOptions;\n    }\n  | { readonly type: \"get\" | \"cancel\"; readonly id: string }\n  | { readonly type: \"list\"; readonly criteria?: ScheduleCriteria }\n  | {\n      readonly type: \"dispatch\";\n      readonly id: string;\n      readonly fn: string;\n      readonly job: SchedulerJobPayload;\n      readonly retry?: RetryOptions;\n    };\n\ntype InsertResult<T> = {\n  readonly schedule: Schedule<T>;\n  readonly created: boolean;\n};\n\nfunction isSchedulerJobPayload(value: unknown): value is SchedulerJobPayload {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    typeof (value as SchedulerJobPayload).type === \"string\"\n  );\n}\n\n/**\n * Persistent task scheduling for a Lifecycle Object.\n *\n * Register callbacks in the constructor and install the instance with\n * `Lifecycle.use()`. Scheduler validates schedules and pushes them into the\n * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm\n * event loop, and Scheduler runs registered callbacks through Lifecycle's\n * host invocation boundary when its jobs come due.\n *\n * @experimental The API surface may change before stabilizing.\n */\nexport class Scheduler<\n  Handlers extends SchedulerHandlers = SchedulerCallbacks\n> extends LifecycleCapability {\n  readonly #handlers: SchedulerHandlers;\n  readonly #retryDefaults: Required<RetryOptions>;\n  readonly #hungScheduleTimeoutSeconds: number;\n  readonly #onError: ((error: unknown) => void | Promise<void>) | undefined;\n  readonly #warnedStartupCallbacks = new Set<string>();\n\n  /**\n   * Create a persistent Scheduler.\n   *\n   * @param options - Registered callbacks plus optional retry,\n   * hung-interval, and error policy. Registering `callbacks` types\n   * {@link set} and {@link every} against the map — names and\n   * payloads are checked where the handlers are declared and where they are\n   * scheduled. Names outside the map are rejected unless a composition-root\n   * resolver supplies them — the internal aperture behind `Agent`'s\n   * name-based scheduling API.\n   */\n  constructor(options: SchedulerOptions<Handlers> = {}) {\n    super(\"scheduler\");\n    this.#handlers = options.callbacks ?? {};\n    // Retry defaults are resolved, not validated, here: a host whose\n    // historically tolerated invalid retry config throws at construction\n    // would brick every entry point of its Durable Object. Invalid defaults\n    // surface per execution as schedule:error instead, and per-schedule\n    // retry overrides are still validated when each schedule is created.\n    this.#retryDefaults = resolveRetryConfig(options.retry, DEFAULT_RETRY);\n    this.#hungScheduleTimeoutSeconds = options.hungScheduleTimeoutSeconds ?? 30;\n    this.#onError = options.onError;\n  }\n\n  // ── Lifecycle capability hooks ───────────────────────────────────────────\n\n  /** Migrate legacy schedule storage into the Lifecycle job queue. */\n  async onStart(): Promise<void> {\n    this.#warnedStartupCallbacks.clear();\n    const storage = this.lifecycle.storage;\n    const version =\n      (await storage.get<number>(SCHEDULE_SCHEMA_VERSION_KEY)) ?? 0;\n    if (version >= CURRENT_SCHEDULE_SCHEMA_VERSION) return;\n\n    await this.#migrateLegacyScheduleTable(storage);\n    await storage.put(\n      SCHEDULE_SCHEMA_VERSION_KEY,\n      CURRENT_SCHEDULE_SCHEMA_VERSION\n    );\n  }\n\n  /**\n   * Move every `cf_agents_schedules` row into the job queue and drop the\n   * table. Idempotent: a missing table means a fresh object or a completed\n   * migration. Times convert from epoch seconds to epoch milliseconds.\n   */\n  async #migrateLegacyScheduleTable(\n    storage: DurableObjectStorage\n  ): Promise<void> {\n    const tables = storage.sql\n      .exec(\n        \"SELECT name FROM sqlite_master WHERE type='table' AND name='cf_agents_schedules'\"\n      )\n      .toArray();\n    if (tables.length === 0) return;\n\n    const rows = storage.sql\n      .exec(\"SELECT * FROM cf_agents_schedules\")\n      .toArray() as unknown as ScheduleStorageRow[];\n    for (const row of rows) {\n      // Keep-alive heartbeats stopped using schedule rows long ago; drop\n      // orphans instead of migrating them.\n      if (row.callback === \"_cf_keepAliveHeartbeat\") continue;\n      let payload: unknown;\n      try {\n        payload =\n          typeof row.payload === \"string\" ? JSON.parse(row.payload) : undefined;\n      } catch (error) {\n        console.error(\n          `Skipping schedule \"${row.id}\" during job-queue migration: ` +\n            \"its payload is not valid JSON\",\n          error\n        );\n        continue;\n      }\n      let retry: RetryOptions | undefined;\n      try {\n        retry =\n          typeof row.retry_options === \"string\"\n            ? (JSON.parse(row.retry_options) as RetryOptions)\n            : undefined;\n      } catch {\n        retry = undefined;\n      }\n      await this.lifecycle.jobs.push({\n        id: row.id,\n        fn: row.callback,\n        time: row.time * 1000,\n        payload: {\n          payload,\n          retry,\n          type: row.type,\n          delayInSeconds: row.delayInSeconds ?? undefined,\n          cron: row.cron ?? undefined,\n          intervalSeconds: row.intervalSeconds ?? undefined,\n          owner_path: row.owner_path ?? null,\n          owner_path_key: row.owner_path_key ?? null\n        } satisfies SchedulerJobPayload,\n        retry: resolveRetryConfig(retry, this.#retryDefaults),\n        singleflight: row.type === \"interval\",\n        hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n        recoveryLoop: LEGACY_RECOVERY_LOOP_CALLBACKS.has(row.callback)\n      });\n    }\n    storage.sql.exec(\"DROP TABLE cf_agents_schedules\");\n  }\n\n  /** Drive one due schedule job dispatched by the Lifecycle event loop. */\n  async onJob(\n    context: LifecycleJobContext\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job, attempt } = context;\n    const timing = job.payload;\n    if (!isSchedulerJobPayload(timing)) {\n      console.error(`Malformed schedule job ${job.id}; dropping it`);\n      return undefined;\n    }\n\n    if (attempt === 1) {\n      this.#emit(\"schedule:execute\", { callback: job.fn, id: job.id });\n    } else {\n      this.#emit(\"schedule:retry\", {\n        callback: job.fn,\n        id: job.id,\n        attempt,\n        maxAttempts: resolveRetryConfig(job.retry, this.#retryDefaults)\n          .maxAttempts\n      });\n    }\n\n    if (timing.owner_path) {\n      // A routed schedule executes inside its owning Lifecycle; retries run\n      // there too, so this dispatch is a single routed attempt.\n      try {\n        await this.lifecycle.routes.to(\n          {\n            key: timing.owner_path_key ?? timing.owner_path,\n            data: timing.owner_path\n          },\n          {\n            type: \"dispatch\",\n            id: job.id,\n            fn: job.fn,\n            job: timing,\n            retry: job.retry\n          } satisfies SchedulerRouteMessage\n        );\n      } catch (error) {\n        if (isPlatformFailure(error)) {\n          // Preserve the job; Lifecycle defers platform-class failures to a\n          // fresh invocation or the memory-limit breaker.\n          throw error;\n        }\n        console.error(\n          `error dispatching scheduled callback \"${job.fn}\"`,\n          error\n        );\n        this.#emit(\"schedule:error\", {\n          callback: job.fn,\n          id: job.id,\n          error: error instanceof Error ? error.message : String(error),\n          attempts: 0\n        });\n        try {\n          await this.#onError?.(error);\n        } catch {\n          // swallow onError errors\n        }\n        // Leave the job due so a later alarm cycle can retry dispatch, for\n        // example once a transport can resolve its owner again.\n        return \"yield\";\n      }\n      return this.#recurrenceOutcome(timing);\n    }\n\n    const handler = this.#resolveCallback(job.fn);\n    if (!handler) {\n      console.error(`callback ${job.fn} not found`);\n      return this.#recurrenceOutcome(timing);\n    }\n    const schedule = this.#jobToSchedule<unknown>(job, timing);\n    await this.lifecycle.runInHostContext(() =>\n      handler(timing.payload, schedule)\n    );\n    return this.#recurrenceOutcome(timing);\n  }\n\n  /** Observe one schedule's terminal application failure. */\n  async onJobError(\n    context: LifecycleJobContext,\n    error: unknown\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job } = context;\n    const timing = job.payload;\n    if (!isSchedulerJobPayload(timing)) return undefined;\n    const { maxAttempts } = resolveRetryConfig(job.retry, this.#retryDefaults);\n    console.error(\n      `error executing callback \"${job.fn}\" after ${maxAttempts} attempts`,\n      error\n    );\n    this.#emit(\"schedule:error\", {\n      callback: job.fn,\n      id: job.id,\n      error: error instanceof Error ? error.message : String(error),\n      attempts: maxAttempts\n    });\n    try {\n      await this.#onError?.(error);\n    } catch {\n      // swallow onError errors\n    }\n    return this.#recurrenceOutcome(timing);\n  }\n\n  /** Advance a recurring schedule; complete a one-shot. */\n  #recurrenceOutcome(timing: SchedulerJobPayload): LifecycleJobOutcome {\n    if (timing.type === \"cron\") {\n      return { rescheduleAt: nextCronTimeMs(timing.cron ?? \"\", Date.now()) };\n    }\n    if (timing.type === \"interval\") {\n      return {\n        rescheduleAt: Date.now() + (timing.intervalSeconds ?? 0) * 1000\n      };\n    }\n    return undefined;\n  }\n\n  /** Handle Scheduler protocol messages routed by another Lifecycle. */\n  async onRoute(context: LifecycleRouteContext): Promise<unknown> {\n    const message = context.payload as SchedulerRouteMessage;\n    const owner = context.source ?? null;\n    switch (message.type) {\n      case \"schedule\":\n        return this.#insert(\n          owner,\n          parseWhen(message.when, Date.now(), message.callback),\n          message.callback,\n          message.payload,\n          message.options\n        );\n      case \"every\":\n        return this.#insert(\n          owner,\n          parseInterval(message.intervalSeconds, Date.now()),\n          message.callback,\n          message.payload,\n          message.options\n        );\n      case \"get\":\n        return this.#getForOwner(owner, message.id);\n      case \"list\":\n        return this.#listForOwner(owner, message.criteria);\n      case \"cancel\":\n        return this.#cancelForOwner(owner, message.id);\n      case \"dispatch\":\n        await this.#executeRouted(\n          message.id,\n          message.fn,\n          message.job,\n          message.retry\n        );\n        return true;\n      default:\n        throw new Error(\"Unknown routed Scheduler message\");\n    }\n  }\n\n  /**\n   * Execute a routed schedule locally with the historical retry handling.\n   * Runs on the owning (facet) Scheduler, outside the root's event loop, so\n   * it applies its own in-process retry budget. Platform-class failures on a\n   * one-shot re-throw so the root preserves the job and the durable alarm\n   * retries on a fresh invocation.\n   */\n  async #executeRouted(\n    id: string,\n    fn: string,\n    timing: SchedulerJobPayload,\n    retry: RetryOptions | undefined\n  ): Promise<void> {\n    const handler = this.#resolveCallback(fn);\n    if (!handler) {\n      console.error(`callback ${fn} not found`);\n      return;\n    }\n    const { maxAttempts, baseDelayMs, maxDelayMs } = resolveRetryConfig(\n      retry,\n      this.#retryDefaults\n    );\n    const isOneShot = timing.type === \"delayed\" || timing.type === \"scheduled\";\n    const schedule = this.#payloadToSchedule<unknown>(id, fn, timing);\n    try {\n      await tryN(\n        maxAttempts,\n        async (attempt) => {\n          if (attempt > 1) {\n            this.#emit(\"schedule:retry\", {\n              callback: fn,\n              id,\n              attempt,\n              maxAttempts\n            });\n          }\n          await this.lifecycle.runInHostContext(() =>\n            handler(timing.payload, schedule)\n          );\n        },\n        {\n          baseDelayMs,\n          maxDelayMs,\n          shouldRetry: (error) =>\n            !(isOneShot && isDurableObjectCodeUpdateReset(error))\n        }\n      );\n    } catch (error) {\n      if (isOneShot && isPlatformFailure(error)) {\n        throw error;\n      }\n      console.error(\n        `error executing callback \"${fn}\" after ${maxAttempts} attempts`,\n        error\n      );\n      this.#emit(\"schedule:error\", {\n        callback: fn,\n        id,\n        error: error instanceof Error ? error.message : String(error),\n        attempts: maxAttempts\n      });\n      try {\n        await this.#onError?.(error);\n      } catch {\n        // swallow onError errors\n      }\n    }\n  }\n\n  // ── Scheduling API ───────────────────────────────────────────────────────\n\n  /** Set a delayed, dated, or cron schedule for a registered callback. */\n  async set<Name extends keyof Handlers & string>(\n    when: Date | string | number,\n    callback: Name,\n    payload?: SchedulerPayload<Handlers[Name]>,\n    options?: ScheduleOptions\n  ): Promise<Schedule<SchedulerPayload<Handlers[Name]>>> {\n    await this.lifecycle.ready();\n    this.#validateSchedule(when, callback, options);\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"schedule\",\n          when,\n          callback,\n          payload,\n          options\n        } satisfies SchedulerRouteMessage)) as InsertResult<\n          SchedulerPayload<Handlers[Name]>\n        >)\n      : await this.#insert<SchedulerPayload<Handlers[Name]>>(\n          null,\n          parseWhen(when, Date.now(), callback),\n          callback,\n          payload,\n          options\n        );\n    this.#emitCreated(result);\n    return result.schedule;\n  }\n\n  /** Set a fixed-interval schedule for a registered callback. */\n  async every<Name extends keyof Handlers & string>(\n    intervalSeconds: number,\n    callback: Name,\n    payload?: SchedulerPayload<Handlers[Name]>,\n    options?: ScheduleOptions\n  ): Promise<Schedule<SchedulerPayload<Handlers[Name]>>> {\n    await this.lifecycle.ready();\n    this.#validateInterval(intervalSeconds, callback, options?.retry);\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"every\",\n          intervalSeconds,\n          callback,\n          payload,\n          options\n        } satisfies SchedulerRouteMessage)) as InsertResult<\n          SchedulerPayload<Handlers[Name]>\n        >)\n      : await this.#insert<SchedulerPayload<Handlers[Name]>>(\n          null,\n          parseInterval(intervalSeconds, Date.now()),\n          callback,\n          payload,\n          options\n        );\n    this.#emitCreated(result);\n    return result.schedule;\n  }\n\n  /** Get a schedule by ID. Works inside routed sub-agents. */\n  async get(id: string): Promise<Schedule<unknown> | undefined> {\n    await this.lifecycle.ready();\n    return this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"get\",\n          id\n        } satisfies SchedulerRouteMessage)) as Schedule<unknown> | undefined)\n      : this.#getForOwner(null, id);\n  }\n\n  /** List schedules matching criteria. Works inside routed sub-agents. */\n  async list(criteria: ScheduleCriteria = {}): Promise<Schedule<unknown>[]> {\n    await this.lifecycle.ready();\n    return this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"list\",\n          criteria\n        } satisfies SchedulerRouteMessage)) as Schedule<unknown>[])\n      : this.#listForOwner(null, criteria);\n  }\n\n  /**\n   * Cancel one schedule owned by this Scheduler.\n   *\n   * @param id - ID of the schedule to cancel.\n   * @returns True when a schedule was cancelled, false when none matched.\n   */\n  async cancel(id: string): Promise<boolean> {\n    await this.lifecycle.ready();\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"cancel\",\n          id\n        } satisfies SchedulerRouteMessage)) as {\n          ok: boolean;\n          callback?: string;\n        })\n      : await this.#cancelForOwner(null, id);\n    if (result.ok && result.callback) {\n      this.#emit(\"schedule:cancel\", { callback: result.callback, id });\n    }\n    return result.ok;\n  }\n\n  // ── Host-owned policy apertures ──────────────────────────────────────────\n\n  /**\n   * @internal Synchronous read backing Agent's deprecated `getSchedule()`.\n   * Not part of the primitive's contract — use {@link get}. Cannot cross\n   * Durable Object boundaries and throws inside routed sub-agents.\n   */\n  __DO_NOT_USE_WILL_REMOVE__getSchedule<T = string>(\n    id: string\n  ): Schedule<T> | undefined {\n    if (this.lifecycle.routes.source) {\n      throw new Error(\n        \"getSchedule() is synchronous and cannot read routed schedule storage. \" +\n          \"Use await getScheduleById(id) on Agent, or await scheduler.get(id) \" +\n          \"on a standalone Scheduler.\"\n      );\n    }\n    return this.#getForOwner(null, id);\n  }\n\n  /**\n   * @internal Synchronous read backing Agent's deprecated `getSchedules()`.\n   * Not part of the primitive's contract — use {@link list}. Cannot cross\n   * Durable Object boundaries and throws inside routed sub-agents.\n   */\n  __DO_NOT_USE_WILL_REMOVE__getSchedules<T = string>(\n    criteria: ScheduleCriteria = {}\n  ): Schedule<T>[] {\n    if (this.lifecycle.routes.source) {\n      throw new Error(\n        \"getSchedules() is synchronous and cannot read routed schedule storage. \" +\n          \"Use await listSchedules(criteria) on Agent, or await \" +\n          \"scheduler.list(criteria) on a standalone Scheduler.\"\n      );\n    }\n    return this.#listForOwner(null, criteria);\n  }\n\n  /** @internal Remove schedules owned by one routed Lifecycle subtree. */\n  async __DO_NOT_USE_WILL_BREAK__cleanupRoutePrefix(\n    prefix: string\n  ): Promise<void> {\n    for (const { job, timing } of this.#ownedJobs()) {\n      const ownerKey = timing.owner_path_key ?? timing.owner_path;\n      if (!timing.owner_path || ownerKey === null || ownerKey === undefined) {\n        continue;\n      }\n      if (ownerKey !== prefix && !ownerKey.startsWith(`${prefix}/`)) continue;\n      this.#emit(\"schedule:cancel\", { callback: job.fn, id: job.id });\n      await this.lifecycle.jobs.cancel(job.id);\n    }\n  }\n\n  // ── Validation ───────────────────────────────────────────────────────────\n\n  #validateSchedule(\n    when: Date | string | number,\n    callback: string,\n    options?: ScheduleOptions\n  ): void {\n    if (typeof callback !== \"string\") {\n      throw new Error(\"Callback must be a string\");\n    }\n    if (!this.#hasCallback(callback)) {\n      throw new Error(\n        `Unknown scheduled callback \"${callback}\": not registered on this Scheduler`\n      );\n    }\n    if (options?.retry) {\n      validateRetryOptions(options.retry, this.#retryDefaults);\n    }\n    if (\n      !(when instanceof Date) &&\n      typeof when !== \"number\" &&\n      typeof when !== \"string\"\n    ) {\n      throw new Error(\n        `Invalid schedule type: ${JSON.stringify(when)}(${typeof when}) trying to schedule ${callback}`\n      );\n    }\n    this.#warnWhenScheduledDuringStartup(when, callback, options);\n  }\n\n  #validateInterval(\n    intervalSeconds: number,\n    callback: string,\n    retry?: RetryOptions\n  ): void {\n    validateIntervalSeconds(intervalSeconds);\n    if (typeof callback !== \"string\") {\n      throw new Error(\"Callback must be a string\");\n    }\n    if (!this.#hasCallback(callback)) {\n      throw new Error(\n        `Unknown scheduled callback \"${callback}\": not registered on this Scheduler`\n      );\n    }\n    if (retry) validateRetryOptions(retry, this.#retryDefaults);\n  }\n\n  /**\n   * A non-idempotent one-shot created during startup accumulates one row per\n   * Durable Object wake, whether it came from the host's onStart or another\n   * startup hook. Warn once per callback; an explicit `idempotent` choice\n   * (either value) opts out.\n   */\n  #warnWhenScheduledDuringStartup(\n    when: Date | string | number,\n    callback: string,\n    options?: ScheduleOptions\n  ): void {\n    if (this.lifecycle.status() !== \"starting\") return;\n    if (options?.idempotent !== undefined) return;\n    if (typeof when === \"string\") return;\n    if (this.#warnedStartupCallbacks.has(callback)) return;\n    this.#warnedStartupCallbacks.add(callback);\n    console.warn(\n      `Scheduling \"${callback}\" during startup (e.g. onStart()) without ` +\n        `{ idempotent: true } creates a new row on every Durable Object ` +\n        `restart, which can cause duplicate executions. Pass ` +\n        `{ idempotent: true } to deduplicate, or use an interval schedule ` +\n        `for recurring tasks.`\n    );\n  }\n\n  /** Resolve a name to its registered or composition-root-supplied handler. */\n  #resolveCallback(name: string): ResolvedSchedulerCallback | undefined {\n    const handler = this.#handlers[name];\n    if (handler) {\n      // SAFETY: registered handlers are constrained with `never` parameters\n      // so concrete handler types satisfy the map under contravariance; the\n      // payload passed at dispatch was persisted with this handler's name.\n      return handler as ResolvedSchedulerCallback;\n    }\n    return schedulerCallbackResolvers.get(this)?.(name);\n  }\n\n  /** True when a name resolves to a runnable callback. */\n  #hasCallback(name: string): boolean {\n    return this.#resolveCallback(name) !== undefined;\n  }\n\n  // ── Jobs ─────────────────────────────────────────────────────────────────\n\n  /** Every schedule job this Scheduler owns, with its parsed vocabulary. */\n  #ownedJobs(): Array<{ job: LifecycleJob; timing: SchedulerJobPayload }> {\n    const owned: Array<{ job: LifecycleJob; timing: SchedulerJobPayload }> = [];\n    for (const job of this.lifecycle.jobs.list()) {\n      if (isSchedulerJobPayload(job.payload)) {\n        owned.push({ job, timing: job.payload });\n      }\n    }\n    return owned;\n  }\n\n  /**\n   * Push a schedule job for the given owner, or return the existing job\n   * when an idempotent request matches one. One-shot timings deduplicate only\n   * when `idempotent: true` is passed; recurring timings deduplicate unless\n   * `idempotent: false` opts out. `created: false` marks a dedup hit so\n   * callers suppress the `schedule:create` event.\n   */\n  async #insert<T = string>(\n    owner: LifecycleRouteAddress | null,\n    timing: ScheduleTiming,\n    callback: string,\n    payload: unknown,\n    options?: ScheduleOptions\n  ): Promise<InsertResult<T>> {\n    // Recurring timings deduplicate unless explicitly opted out; one-shot\n    // timings deduplicate on any truthy value (historic Agent behavior).\n    const idempotent = isRecurring(timing)\n      ? options?.idempotent !== false\n      : Boolean(options?.idempotent);\n    // Not part of public ScheduleOptions. See RecoveryLoopScheduleOptions.\n    const recoveryLoop = (\n      options as Partial<RecoveryLoopScheduleOptions> | undefined\n    )?.recoveryLoop;\n\n    if (idempotent) {\n      const existing = this.#findMatchingJob(\n        owner?.key ?? null,\n        timing,\n        callback,\n        JSON.stringify(payload)\n      );\n      if (existing) {\n        // A dedup hit onto a row without breaker membership the caller asks\n        // for (a row migrated from the legacy schedule table) re-pushes the\n        // same durable intent in place with the flag — otherwise the row\n        // would escape the alarm memory-limit breaker (#1825) forever.\n        if (recoveryLoop && !existing.job.recoveryLoop) {\n          await this.lifecycle.jobs.push({\n            id: existing.job.id,\n            fn: existing.job.fn,\n            time: existing.job.time,\n            payload: existing.job.payload,\n            retry: existing.job.retry,\n            singleflight: existing.job.singleflight,\n            exclusive: existing.job.exclusive,\n            hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n            recoveryLoop: true\n          });\n        }\n        // A dedup hit still re-arms so a lost physical alarm recovers, as\n        // idempotent re-scheduling on startup historically guaranteed.\n        await this.lifecycle.jobs.rearm();\n        return {\n          schedule: this.#jobToSchedule<T>(existing.job, existing.timing),\n          created: false\n        };\n      }\n    }\n\n    const jobPayload: SchedulerJobPayload = {\n      payload,\n      retry: options?.retry,\n      type: timing.type,\n      delayInSeconds:\n        timing.type === \"delayed\" ? timing.delayInSeconds : undefined,\n      cron: timing.type === \"cron\" ? timing.cron : undefined,\n      intervalSeconds:\n        timing.type === \"interval\" ? timing.intervalSeconds : undefined,\n      owner_path: owner?.data ?? null,\n      owner_path_key: owner?.key ?? null\n    };\n    const job = await this.lifecycle.jobs.push({\n      fn: callback,\n      time: timing.time * 1000,\n      payload: jobPayload,\n      retry: resolveRetryConfig(options?.retry, this.#retryDefaults),\n      singleflight: timing.type === \"interval\",\n      hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n      recoveryLoop\n    });\n\n    return {\n      schedule: {\n        id: job.id,\n        callback,\n        // SAFETY: payload is optional at the call site; historical API shape\n        // types an omitted payload as the schedule's payload type.\n        payload: payload as T,\n        retry: options?.retry,\n        ...timing\n      },\n      created: true\n    };\n  }\n\n  /** Find the job an idempotent insert deduplicates onto, if any. */\n  #findMatchingJob(\n    ownerKey: string | null,\n    timing: ScheduleTiming,\n    callback: string,\n    payloadJson: string\n  ): { job: LifecycleJob; timing: SchedulerJobPayload } | undefined {\n    for (const owned of this.#ownedJobs()) {\n      const { job, timing: candidate } = owned;\n      if (candidate.type !== timing.type) continue;\n      if (job.fn !== callback) continue;\n      if ((candidate.owner_path_key ?? null) !== ownerKey) continue;\n      if (JSON.stringify(candidate.payload) !== payloadJson) continue;\n      if (timing.type === \"cron\" && candidate.cron !== timing.cron) continue;\n      if (\n        timing.type === \"interval\" &&\n        candidate.intervalSeconds !== timing.intervalSeconds\n      ) {\n        continue;\n      }\n      return owned;\n    }\n    return undefined;\n  }\n\n  #jobToSchedule<T>(\n    job: LifecycleJob,\n    timing: SchedulerJobPayload\n  ): Schedule<T> {\n    return this.#payloadToSchedule<T>(\n      job.id,\n      job.fn,\n      timing,\n      Math.floor(job.time / 1000)\n    );\n  }\n\n  #payloadToSchedule<T>(\n    id: string,\n    fn: string,\n    timing: SchedulerJobPayload,\n    timeSeconds?: number\n  ): Schedule<T> {\n    const base = {\n      callback: fn,\n      id,\n      payload: timing.payload as T,\n      retry: timing.retry\n    };\n    const time = timeSeconds ?? 0;\n    switch (timing.type) {\n      case \"scheduled\":\n        return { ...base, time, type: \"scheduled\" };\n      case \"delayed\":\n        return {\n          ...base,\n          delayInSeconds: timing.delayInSeconds ?? 0,\n          time,\n          type: \"delayed\"\n        };\n      case \"cron\":\n        return { ...base, cron: timing.cron ?? \"\", time, type: \"cron\" };\n      case \"interval\":\n        return {\n          ...base,\n          intervalSeconds: timing.intervalSeconds ?? 0,\n          time,\n          type: \"interval\"\n        };\n    }\n  }\n\n  #getForOwner<T = string>(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Schedule<T> | undefined {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isSchedulerJobPayload(job.payload)) return undefined;\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) return undefined;\n    return this.#jobToSchedule<T>(job, job.payload);\n  }\n\n  #listForOwner<T = string>(\n    owner: LifecycleRouteAddress | null,\n    criteria: ScheduleCriteria = {}\n  ): Schedule<T>[] {\n    const ownerKey = owner?.key ?? null;\n    const startSeconds = criteria.timeRange\n      ? Math.floor((criteria.timeRange.start ?? new Date(0)).getTime() / 1000)\n      : null;\n    const endSeconds = criteria.timeRange\n      ? Math.floor(\n          (criteria.timeRange.end ?? new Date(999999999999999)).getTime() / 1000\n        )\n      : null;\n\n    const schedules: Schedule<T>[] = [];\n    for (const { job, timing } of this.#ownedJobs()) {\n      if ((timing.owner_path_key ?? null) !== ownerKey) continue;\n      if (criteria.id && job.id !== criteria.id) continue;\n      if (criteria.type && timing.type !== criteria.type) continue;\n      const timeSeconds = Math.floor(job.time / 1000);\n      if (startSeconds !== null && timeSeconds < startSeconds) continue;\n      if (endSeconds !== null && timeSeconds > endSeconds) continue;\n      schedules.push(this.#jobToSchedule<T>(job, timing));\n    }\n    return schedules;\n  }\n\n  async #cancelForOwner(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Promise<{ ok: boolean; callback?: string }> {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isSchedulerJobPayload(job.payload)) return { ok: false };\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) {\n      return { ok: false };\n    }\n    const callback = job.fn;\n    await this.lifecycle.jobs.cancel(id);\n    return { ok: true, callback };\n  }\n\n  // ── Events ───────────────────────────────────────────────────────────────\n\n  #emit(type: SchedulerEventType, payload: Record<string, unknown>): void {\n    this.lifecycle.events.emit(type, payload);\n  }\n\n  #emitCreated(result: InsertResult<unknown>): void {\n    if (!result.created) return;\n    this.#emit(\"schedule:create\", {\n      callback: result.schedule.callback,\n      id: result.schedule.id\n    });\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AAWA,MAAa,uBAAuB,MAAU,KAAK;;AAoCnD,SAAgB,YAAY,QAAiC;CAC3D,OAAO,OAAO,SAAS,UAAU,OAAO,SAAS;AACnD;;;;;;;;;AAUA,SAAgB,eAAe,MAAc,OAAuB;CAClE,OAAO,oBAAoB,IAAI,CAAC,CAAC,YAAY,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ;AACxE;;;;;;;;;;;;;AAcA,SAAgB,UACd,MACA,OACA,UACgB;CAChB,IAAI,gBAAgB,MAClB,OAAO;EAAE,MAAM;EAAa,MAAM,KAAK,MAAM,KAAK,QAAQ,IAAI,GAAI;CAAE;CAEtE,IAAI,OAAO,SAAS,UAClB,OAAO;EACL,MAAM;EACN,MAAM,KAAK,OAAO,QAAQ,OAAO,OAAQ,GAAI;EAC7C,gBAAgB;CAClB;CAEF,IAAI,OAAO,SAAS,UAClB,OAAO;EACL,MAAM;EACN,MAAM,KAAK,MAAM,eAAe,MAAM,KAAK,IAAI,GAAI;EACnD,MAAM;CACR;CAEF,MAAM,IAAI,MACR,0BAA0B,KAAK,UAAU,IAAI,EAAE,GAAG,OAAO,KAAK,uBAAuB,UACvF;AACF;;;;;;;AAQA,SAAgB,wBAAwB,iBAA+B;CACrE,IAAI,OAAO,oBAAoB,YAAY,mBAAmB,GAC5D,MAAM,IAAI,MAAM,2CAA2C;CAE7D,IAAI,kBAAA,QACF,MAAM,IAAI,MACR,iCAAiC,qBAAqB,mBACxD;AAEJ;;;;;;;;;AAUA,SAAgB,cACd,iBACA,OACgB;CAChB,wBAAwB,eAAe;CACvC,OAAO;EACL,MAAM;EACN,MAAM,KAAK,OAAO,QAAQ,kBAAkB,OAAQ,GAAI;EACxD;CACF;AACF;;;;;;;;;;;AClFA,MAAM,6CAA6B,IAAI,QAGrC;;;;;;;;AASF,SAAgB,6BACd,WACA,UACM;CACN,2BAA2B,IAAI,WAAW,QAAQ;AACpD;AAEA,MAAM,8BAA8B;;AAEpC,MAAM,kCAAkC;;;;;;;;;AAUxC,MAAM,iDAAiC,IAAI,IAAI,CAC7C,yBACA,oBACF,CAAC;AAED,MAAM,gBAAwC;CAC5C,aAAa;CACb,aAAa;CACb,YAAY;AACd;AAmDA,SAAS,sBAAsB,OAA8C;CAC3E,OACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA8B,SAAS;AAEnD;;;;;;;;;;;;;;;;;;AAaA,IAAa,YAAb,cAEU,oBAAoB;;;;;;;;;;;;CAkB5B,YAAY,UAAsC,CAAC,GAAG;EACpD,MAAM,WAAW;;;;;;4EAdgB,IAAI,IAAY,CAAA;EAejD,uBAAA,WAAA,MAAiB,QAAQ,aAAa,CAAC,CAAA;EAMvC,uBAAA,gBAAA,MAAsB,mBAAmB,QAAQ,OAAO,aAAa,CAAA;EACrE,uBAAA,6BAAA,MAAmC,QAAQ,8BAA8B,EAAA;EACzE,uBAAA,UAAA,MAAgB,QAAQ,OAAA;CAC1B;;CAKA,MAAM,UAAyB;EAC7B,uBAAA,yBAAA,IAAA,CAAA,CAA6B,MAAM;EACnC,MAAM,UAAU,KAAK,UAAU;EAG/B,KADG,MAAM,QAAQ,IAAY,2BAA2B,KAAM,MAC/C,iCAAiC;EAEhD,MAAA,kBAAA,kBAAM,MAAA,2BAAA,CAAA,CAAA,KAAA,MAAiC,OAAO;EAC9C,MAAM,QAAQ,IACZ,6BACA,+BACF;CACF;;CAqEA,MAAM,MACJ,SACqC;EACrC,MAAM,EAAE,KAAK,YAAY;EACzB,MAAM,SAAS,IAAI;EACnB,IAAI,CAAC,sBAAsB,MAAM,GAAG;GAClC,QAAQ,MAAM,0BAA0B,IAAI,GAAG,cAAc;GAC7D;EACF;EAEA,IAAI,YAAY,GACd,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,oBAAoB;GAAE,UAAU,IAAI;GAAI,IAAI,IAAI;EAAG,CAAC;OAE/D,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU,IAAI;GACd,IAAI,IAAI;GACR;GACA,aAAa,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB,CAAC,CAC5D;EACL,CAAC;EAGH,IAAI,OAAO,YAAY;GAGrB,IAAI;IACF,MAAM,KAAK,UAAU,OAAO,GAC1B;KACE,KAAK,OAAO,kBAAkB,OAAO;KACrC,MAAM,OAAO;IACf,GACA;KACE,MAAM;KACN,IAAI,IAAI;KACR,IAAI,IAAI;KACR,KAAK;KACL,OAAO,IAAI;IACb,CACF;GACF,SAAS,OAAO;IACd,IAAI,kBAAkB,KAAK,GAGzB,MAAM;IAER,QAAQ,MACN,yCAAyC,IAAI,GAAG,IAChD,KACF;IACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;KAC3B,UAAU,IAAI;KACd,IAAI,IAAI;KACR,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;KAC5D,UAAU;IACZ,CAAC;IACD,IAAI;KACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;IAC7B,QAAQ,CAER;IAGA,OAAO;GACT;GACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;EACvC;EAEA,MAAM,UAAA,kBAAA,kBAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,EAAE;EAC5C,IAAI,CAAC,SAAS;GACZ,QAAQ,MAAM,YAAY,IAAI,GAAG,WAAW;GAC5C,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;EACvC;EACA,MAAM,WAAA,kBAAA,kBAAW,MAAA,cAAA,CAAA,CAAA,KAAA,MAA6B,KAAK,MAAM;EACzD,MAAM,KAAK,UAAU,uBACnB,QAAQ,OAAO,SAAS,QAAQ,CAClC;EACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;CACvC;;CAGA,MAAM,WACJ,SACA,OACqC;EACrC,MAAM,EAAE,QAAQ;EAChB,MAAM,SAAS,IAAI;EACnB,IAAI,CAAC,sBAAsB,MAAM,GAAG,OAAO,KAAA;EAC3C,MAAM,EAAE,gBAAgB,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACzE,QAAQ,MACN,6BAA6B,IAAI,GAAG,UAAU,YAAY,YAC1D,KACF;EACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU,IAAI;GACd,IAAI,IAAI;GACR,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAC5D,UAAU;EACZ,CAAC;EACD,IAAI;GACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;EAC7B,QAAQ,CAER;EACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;CACvC;;CAgBA,MAAM,QAAQ,SAAkD;EAC9D,MAAM,UAAU,QAAQ;EACxB,MAAM,QAAQ,QAAQ,UAAU;EAChC,QAAQ,QAAQ,MAAhB;GACE,KAAK,YACH,OAAA,kBAAA,kBAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,UAAU,QAAQ,MAAM,KAAK,IAAI,GAAG,QAAQ,QAAQ,GACpD,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,SACH,OAAA,kBAAA,kBAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,cAAc,QAAQ,iBAAiB,KAAK,IAAI,CAAC,GACjD,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,OACH,OAAA,kBAAA,kBAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,QAAQ,EAAE;GAC5C,KAAK,QACH,OAAA,kBAAA,kBAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,QAAQ,QAAQ;GACnD,KAAK,UACH,OAAA,kBAAA,kBAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,OAAO,QAAQ,EAAE;GAC/C,KAAK;IACH,MAAA,kBAAA,kBAAM,MAAA,cAAA,CAAA,CAAA,KAAA,MACJ,QAAQ,IACR,QAAQ,IACR,QAAQ,KACR,QAAQ,KACV;IACA,OAAO;GACT,SACE,MAAM,IAAI,MAAM,kCAAkC;EACtD;CACF;;CA0EA,MAAM,IACJ,MACA,UACA,SACA,SACqD;EACrD,MAAM,KAAK,UAAU,MAAM;EAC3B,kBAAA,kBAAA,MAAA,iBAAA,CAAA,CAAA,KAAA,MAAuB,MAAM,UAAU,OAAO;EAC9C,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;GACA;EACF,CAAiC,IAGjC,MAAA,kBAAA,kBAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,UAAU,MAAM,KAAK,IAAI,GAAG,QAAQ,GACpC,UACA,SACA,OACF;EACJ,kBAAA,kBAAA,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM;EACxB,OAAO,OAAO;CAChB;;CAGA,MAAM,MACJ,iBACA,UACA,SACA,SACqD;EACrD,MAAM,KAAK,UAAU,MAAM;EAC3B,kBAAA,kBAAA,MAAA,iBAAA,CAAA,CAAA,KAAA,MAAuB,iBAAiB,UAAU,SAAS,KAAK;EAChE,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;GACA;EACF,CAAiC,IAGjC,MAAA,kBAAA,kBAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,cAAc,iBAAiB,KAAK,IAAI,CAAC,GACzC,UACA,SACA,OACF;EACJ,kBAAA,kBAAA,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM;EACxB,OAAO,OAAO;CAChB;;CAGA,MAAM,IAAI,IAAoD;EAC5D,MAAM,KAAK,UAAU,MAAM;EAC3B,OAAO,KAAK,UAAU,OAAO,SACvB,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAAA,kBAAA,kBACjC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM,EAAE;CAChC;;CAGA,MAAM,KAAK,WAA6B,CAAC,GAAiC;EACxE,MAAM,KAAK,UAAU,MAAM;EAC3B,OAAO,KAAK,UAAU,OAAO,SACvB,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAAA,kBAAA,kBACjC,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,MAAM,QAAQ;CACvC;;;;;;;CAQA,MAAM,OAAO,IAA8B;EACzC,MAAM,KAAK,UAAU,MAAM;EAC3B,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAIjC,MAAA,kBAAA,kBAAM,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;EACvC,IAAI,OAAO,MAAM,OAAO,UACtB,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;GAAE,UAAU,OAAO;GAAU;EAAG,CAAC;EAEjE,OAAO,OAAO;CAChB;;;;;;CASA,sCACE,IACyB;EACzB,IAAI,KAAK,UAAU,OAAO,QACxB,MAAM,IAAI,MACR,qKAGF;EAEF,OAAA,kBAAA,kBAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM,EAAE;CACnC;;;;;;CAOA,uCACE,WAA6B,CAAC,GACf;EACf,IAAI,KAAK,UAAU,OAAO,QACxB,MAAM,IAAI,MACR,iLAGF;EAEF,OAAA,kBAAA,kBAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,MAAM,QAAQ;CAC1C;;CAGA,MAAM,4CACJ,QACe;EACf,KAAK,MAAM,EAAE,KAAK,YAAA,kBAAA,kBAAY,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;GAC/C,MAAM,WAAW,OAAO,kBAAkB,OAAO;GACjD,IAAI,CAAC,OAAO,cAAc,aAAa,QAAQ,aAAa,KAAA,GAC1D;GAEF,IAAI,aAAa,UAAU,CAAC,SAAS,WAAW,GAAG,OAAO,EAAE,GAAG;GAC/D,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;IAAE,UAAU,IAAI;IAAI,IAAI,IAAI;GAAG,CAAC;GAC9D,MAAM,KAAK,UAAU,KAAK,OAAO,IAAI,EAAE;EACzC;CACF;AAiVF;;;;;;AAjxBE,eAAA,4BACE,SACe;CAMf,IALe,QAAQ,IACpB,KACC,kFACF,CAAC,CACA,QACM,CAAC,CAAC,WAAW,GAAG;CAEzB,MAAM,OAAO,QAAQ,IAClB,KAAK,mCAAmC,CAAC,CACzC,QAAQ;CACX,KAAK,MAAM,OAAO,MAAM;EAGtB,IAAI,IAAI,aAAa,0BAA0B;EAC/C,IAAI;EACJ,IAAI;GACF,UACE,OAAO,IAAI,YAAY,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAA;EAChE,SAAS,OAAO;GACd,QAAQ,MACN,sBAAsB,IAAI,GAAG,8DAE7B,KACF;GACA;EACF;EACA,IAAI;EACJ,IAAI;GACF,QACE,OAAO,IAAI,kBAAkB,WACxB,KAAK,MAAM,IAAI,aAAa,IAC7B,KAAA;EACR,QAAQ;GACN,QAAQ,KAAA;EACV;EACA,MAAM,KAAK,UAAU,KAAK,KAAK;GAC7B,IAAI,IAAI;GACR,IAAI,IAAI;GACR,MAAM,IAAI,OAAO;GACjB,SAAS;IACP;IACA;IACA,MAAM,IAAI;IACV,gBAAgB,IAAI,kBAAkB,KAAA;IACtC,MAAM,IAAI,QAAQ,KAAA;IAClB,iBAAiB,IAAI,mBAAmB,KAAA;IACxC,YAAY,IAAI,cAAc;IAC9B,gBAAgB,IAAI,kBAAkB;GACxC;GACA,OAAO,mBAAmB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;GACpD,cAAc,IAAI,SAAS;GAC3B,oBAAA,uBAAA,6BAAoB,IAAA;GACpB,cAAc,+BAA+B,IAAI,IAAI,QAAQ;EAC/D,CAAC;CACH;CACA,QAAQ,IAAI,KAAK,gCAAgC;AACnD;;AA8GA,SAAA,mBAAmB,QAAkD;CACnE,IAAI,OAAO,SAAS,QAClB,OAAO,EAAE,cAAc,eAAe,OAAO,QAAQ,IAAI,KAAK,IAAI,CAAC,EAAE;CAEvE,IAAI,OAAO,SAAS,YAClB,OAAO,EACL,cAAc,KAAK,IAAI,KAAK,OAAO,mBAAmB,KAAK,IAC7D;AAGJ;;;;;;;;AAiDA,eAAA,eACE,IACA,IACA,QACA,OACe;CACf,MAAM,UAAA,kBAAA,kBAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,EAAE;CACxC,IAAI,CAAC,SAAS;EACZ,QAAQ,MAAM,YAAY,GAAG,WAAW;EACxC;CACF;CACA,MAAM,EAAE,aAAa,aAAa,eAAe,mBAC/C,OAAA,uBAAA,gBACA,IAAA,CACF;CACA,MAAM,YAAY,OAAO,SAAS,aAAa,OAAO,SAAS;CAC/D,MAAM,WAAA,kBAAA,kBAAW,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAiC,IAAI,IAAI,MAAM;CAChE,IAAI;EACF,MAAM,KACJ,aACA,OAAO,YAAY;GACjB,IAAI,UAAU,GACZ,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;IAC3B,UAAU;IACV;IACA;IACA;GACF,CAAC;GAEH,MAAM,KAAK,UAAU,uBACnB,QAAQ,OAAO,SAAS,QAAQ,CAClC;EACF,GACA;GACE;GACA;GACA,cAAc,UACZ,EAAE,aAAa,+BAA+B,KAAK;EACvD,CACF;CACF,SAAS,OAAO;EACd,IAAI,aAAa,kBAAkB,KAAK,GACtC,MAAM;EAER,QAAQ,MACN,6BAA6B,GAAG,UAAU,YAAY,YACtD,KACF;EACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU;GACV;GACA,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAC5D,UAAU;EACZ,CAAC;EACD,IAAI;GACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;EAC7B,QAAQ,CAER;CACF;AACF;AAoKA,SAAA,kBACE,MACA,UACA,SACM;CACN,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,kBAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,+BAA+B,SAAS,oCAC1C;CAEF,IAAI,SAAS,OACX,qBAAqB,QAAQ,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CAEzD,IACE,EAAE,gBAAgB,SAClB,OAAO,SAAS,YAChB,OAAO,SAAS,UAEhB,MAAM,IAAI,MACR,0BAA0B,KAAK,UAAU,IAAI,EAAE,GAAG,OAAO,KAAK,uBAAuB,UACvF;CAEF,kBAAA,kBAAA,MAAA,+BAAA,CAAA,CAAA,KAAA,MAAqC,MAAM,UAAU,OAAO;AAC9D;AAEA,SAAA,kBACE,iBACA,UACA,OACM;CACN,wBAAwB,eAAe;CACvC,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,kBAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,+BAA+B,SAAS,oCAC1C;CAEF,IAAI,OAAO,qBAAqB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;AAC5D;;;;;;;AAQA,SAAA,gCACE,MACA,UACA,SACM;CACN,IAAI,KAAK,UAAU,OAAO,MAAM,YAAY;CAC5C,IAAI,SAAS,eAAe,KAAA,GAAW;CACvC,IAAI,OAAO,SAAS,UAAU;CAC9B,IAAA,uBAAA,yBAAI,IAAA,CAAA,CAA6B,IAAI,QAAQ,GAAG;CAChD,uBAAA,yBAAA,IAAA,CAAA,CAA6B,IAAI,QAAQ;CACzC,QAAQ,KACN,eAAe,SAAS,mPAK1B;AACF;;AAGA,SAAA,iBAAiB,MAAqD;CACpE,MAAM,UAAA,uBAAA,WAAU,IAAA,CAAA,CAAe;CAC/B,IAAI,SAIF,OAAO;CAET,OAAO,2BAA2B,IAAI,IAAI,CAAC,GAAG,IAAI;AACpD;;AAGA,SAAA,aAAa,MAAuB;CAClC,OAAA,kBAAA,kBAAO,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,MAAM,KAAA;AACzC;;AAKA,SAAA,aAAwE;CACtE,MAAM,QAAmE,CAAC;CAC1E,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,GACzC,IAAI,sBAAsB,IAAI,OAAO,GACnC,MAAM,KAAK;EAAE;EAAK,QAAQ,IAAI;CAAQ,CAAC;CAG3C,OAAO;AACT;;;;;;;;AASA,eAAA,QACE,OACA,QACA,UACA,SACA,SAC0B;CAG1B,MAAM,aAAa,YAAY,MAAM,IACjC,SAAS,eAAe,QACxB,QAAQ,SAAS,UAAU;CAE/B,MAAM,eACJ,SACC;CAEH,IAAI,YAAY;EACd,MAAM,WAAA,kBAAA,kBAAW,MAAA,gBAAA,CAAA,CAAA,KAAA,MACf,OAAO,OAAO,MACd,QACA,UACA,KAAK,UAAU,OAAO,CACxB;EACA,IAAI,UAAU;GAKZ,IAAI,gBAAgB,CAAC,SAAS,IAAI,cAChC,MAAM,KAAK,UAAU,KAAK,KAAK;IAC7B,IAAI,SAAS,IAAI;IACjB,IAAI,SAAS,IAAI;IACjB,MAAM,SAAS,IAAI;IACnB,SAAS,SAAS,IAAI;IACtB,OAAO,SAAS,IAAI;IACpB,cAAc,SAAS,IAAI;IAC3B,WAAW,SAAS,IAAI;IACxB,oBAAA,uBAAA,6BAAoB,IAAA;IACpB,cAAc;GAChB,CAAC;GAIH,MAAM,KAAK,UAAU,KAAK,MAAM;GAChC,OAAO;IACL,UAAA,kBAAA,kBAAU,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,SAAS,KAAK,SAAS,MAAM;IAC9D,SAAS;GACX;EACF;CACF;CAEA,MAAM,aAAkC;EACtC;EACA,OAAO,SAAS;EAChB,MAAM,OAAO;EACb,gBACE,OAAO,SAAS,YAAY,OAAO,iBAAiB,KAAA;EACtD,MAAM,OAAO,SAAS,SAAS,OAAO,OAAO,KAAA;EAC7C,iBACE,OAAO,SAAS,aAAa,OAAO,kBAAkB,KAAA;EACxD,YAAY,OAAO,QAAQ;EAC3B,gBAAgB,OAAO,OAAO;CAChC;CAWA,OAAO;EACL,UAAU;GACR,KAAI,MAZU,KAAK,UAAU,KAAK,KAAK;IACzC,IAAI;IACJ,MAAM,OAAO,OAAO;IACpB,SAAS;IACT,OAAO,mBAAmB,SAAS,OAAA,uBAAA,gBAAO,IAAA,CAAmB;IAC7D,cAAc,OAAO,SAAS;IAC9B,oBAAA,uBAAA,6BAAoB,IAAA;IACpB;GACF,CAAC,EAAA,CAIW;GACR;GAGS;GACT,OAAO,SAAS;GAChB,GAAG;EACL;EACA,SAAS;CACX;AACF;;AAGA,SAAA,iBACE,UACA,QACA,UACA,aACgE;CAChE,KAAK,MAAM,SAAA,kBAAA,kBAAS,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EACrC,MAAM,EAAE,KAAK,QAAQ,cAAc;EACnC,IAAI,UAAU,SAAS,OAAO,MAAM;EACpC,IAAI,IAAI,OAAO,UAAU;EACzB,KAAK,UAAU,kBAAkB,UAAU,UAAU;EACrD,IAAI,KAAK,UAAU,UAAU,OAAO,MAAM,aAAa;EACvD,IAAI,OAAO,SAAS,UAAU,UAAU,SAAS,OAAO,MAAM;EAC9D,IACE,OAAO,SAAS,cAChB,UAAU,oBAAoB,OAAO,iBAErC;EAEF,OAAO;CACT;AAEF;AAEA,SAAA,eACE,KACA,QACa;CACb,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MACL,IAAI,IACJ,IAAI,IACJ,QACA,KAAK,MAAM,IAAI,OAAO,GAAI,CAC5B;AACF;AAEA,SAAA,mBACE,IACA,IACA,QACA,aACa;CACb,MAAM,OAAO;EACX,UAAU;EACV;EACA,SAAS,OAAO;EAChB,OAAO,OAAO;CAChB;CACA,MAAM,OAAO,eAAe;CAC5B,QAAQ,OAAO,MAAf;EACE,KAAK,aACH,OAAO;GAAE,GAAG;GAAM;GAAM,MAAM;EAAY;EAC5C,KAAK,WACH,OAAO;GACL,GAAG;GACH,gBAAgB,OAAO,kBAAkB;GACzC;GACA,MAAM;EACR;EACF,KAAK,QACH,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO,QAAQ;GAAI;GAAM,MAAM;EAAO;EAChE,KAAK,YACH,OAAO;GACL,GAAG;GACH,iBAAiB,OAAO,mBAAmB;GAC3C;GACA,MAAM;EACR;CACJ;AACF;AAEA,SAAA,aACE,OACA,IACyB;CACzB,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,sBAAsB,IAAI,OAAO,GAAG,OAAO,KAAA;CACxD,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAAU,OAAO,KAAA;CAC9D,OAAA,kBAAA,kBAAO,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,KAAK,IAAI,OAAO;AAChD;AAEA,SAAA,cACE,OACA,WAA6B,CAAC,GACf;CACf,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,eAAe,SAAS,YAC1B,KAAK,OAAO,SAAS,UAAU,yBAAS,IAAI,KAAK,CAAC,EAAA,CAAG,QAAQ,IAAI,GAAI,IACrE;CACJ,MAAM,aAAa,SAAS,YACxB,KAAK,OACF,SAAS,UAAU,uBAAO,IAAI,KAAK,eAAe,EAAA,CAAG,QAAQ,IAAI,GACpE,IACA;CAEJ,MAAM,YAA2B,CAAC;CAClC,KAAK,MAAM,EAAE,KAAK,YAAA,kBAAA,kBAAY,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EAC/C,KAAK,OAAO,kBAAkB,UAAU,UAAU;EAClD,IAAI,SAAS,MAAM,IAAI,OAAO,SAAS,IAAI;EAC3C,IAAI,SAAS,QAAQ,OAAO,SAAS,SAAS,MAAM;EACpD,MAAM,cAAc,KAAK,MAAM,IAAI,OAAO,GAAI;EAC9C,IAAI,iBAAiB,QAAQ,cAAc,cAAc;EACzD,IAAI,eAAe,QAAQ,cAAc,YAAY;EACrD,UAAU,KAAA,kBAAA,kBAAK,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,KAAK,MAAM,CAAC;CACpD;CACA,OAAO;AACT;AAEA,eAAA,gBACE,OACA,IAC6C;CAC7C,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,sBAAsB,IAAI,OAAO,GAAG,OAAO,EAAE,IAAI,MAAM;CACpE,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAC3C,OAAO,EAAE,IAAI,MAAM;CAErB,MAAM,WAAW,IAAI;CACrB,MAAM,KAAK,UAAU,KAAK,OAAO,EAAE;CACnC,OAAO;EAAE,IAAI;EAAM;CAAS;AAC9B;AAIA,SAAA,MAAM,MAA0B,SAAwC;CACtE,KAAK,UAAU,OAAO,KAAK,MAAM,OAAO;AAC1C;AAEA,SAAA,aAAa,QAAqC;CAChD,IAAI,CAAC,OAAO,SAAS;CACrB,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;EAC5B,UAAU,OAAO,SAAS;EAC1B,IAAI,OAAO,SAAS;CACtB,CAAC;AACH"}
+{"version":3,"file":"scheduler-DZ3xQfeK.js","names":[],"sources":["../src/schedules/schedule-timing.ts","../src/schedules/scheduler.ts"],"sourcesContent":["/**\n * Pure timing rules for persistent schedules.\n *\n * A `ScheduleTiming` is the parsed \"when and how it runs\" half of a\n * `Schedule` — everything except identity, callback, and payload. Parsing\n * user-facing inputs here keeps Scheduler's storage code to one insert path.\n */\n\nimport { parseCronExpression } from \"cron-schedule\";\n\n/** Longest allowed gap between interval executions: 30 days. */\nexport const MAX_INTERVAL_SECONDS = 30 * 24 * 60 * 60;\n\n/** When and how one schedule runs; a `Schedule` minus identity and payload. */\nexport type ScheduleTiming =\n  | {\n      /** One-time execution at a specific date. */\n      readonly type: \"scheduled\";\n      /** Unix timestamp in seconds. */\n      readonly time: number;\n    }\n  | {\n      /** One-time execution after a relative delay. */\n      readonly type: \"delayed\";\n      /** Unix timestamp in seconds. */\n      readonly time: number;\n      /** Delay from creation in seconds. */\n      readonly delayInSeconds: number;\n    }\n  | {\n      /** Recurring execution from a cron expression. */\n      readonly type: \"cron\";\n      /** Unix timestamp in seconds for the next execution. */\n      readonly time: number;\n      /** Cron expression defining the recurrence. */\n      readonly cron: string;\n    }\n  | {\n      /** Recurring execution at a fixed interval. */\n      readonly type: \"interval\";\n      /** Unix timestamp in seconds for the next execution. */\n      readonly time: number;\n      /** Number of seconds between executions. */\n      readonly intervalSeconds: number;\n    };\n\n/** True when this timing repeats and therefore deduplicates by default. */\nexport function isRecurring(timing: ScheduleTiming): boolean {\n  return timing.type === \"cron\" || timing.type === \"interval\";\n}\n\n/**\n * Next wall-clock execution time for a cron expression.\n *\n * @param cron - A standard cron expression.\n * @param nowMs - Current epoch time in milliseconds.\n * @returns The next execution epoch time in milliseconds.\n * @throws For an unparseable cron expression.\n */\nexport function nextCronTimeMs(cron: string, nowMs: number): number {\n  return parseCronExpression(cron).getNextDate(new Date(nowMs)).getTime();\n}\n\n/**\n * Parse a user-facing `when` into schedule timing.\n *\n * A `Date` runs once at that date, a number runs once after that many\n * seconds, and a string is a recurring cron expression.\n *\n * @param when - The requested execution time or recurrence.\n * @param nowMs - Current epoch time in milliseconds.\n * @param callback - Callback name, used only in error messages.\n * @returns The parsed timing.\n * @throws For a `when` value that is not a `Date`, number, or string.\n */\nexport function parseWhen(\n  when: Date | string | number,\n  nowMs: number,\n  callback: string\n): ScheduleTiming {\n  if (when instanceof Date) {\n    return { type: \"scheduled\", time: Math.floor(when.getTime() / 1000) };\n  }\n  if (typeof when === \"number\") {\n    return {\n      type: \"delayed\",\n      time: Math.floor((nowMs + when * 1000) / 1000),\n      delayInSeconds: when\n    };\n  }\n  if (typeof when === \"string\") {\n    return {\n      type: \"cron\",\n      time: Math.floor(nextCronTimeMs(when, nowMs) / 1000),\n      cron: when\n    };\n  }\n  throw new Error(\n    `Invalid schedule type: ${JSON.stringify(when)}(${typeof when}) trying to schedule ${callback}`\n  );\n}\n\n/**\n * Reject an interval outside the supported range.\n *\n * @param intervalSeconds - The requested gap between executions.\n * @throws For a non-positive interval or one longer than 30 days.\n */\nexport function validateIntervalSeconds(intervalSeconds: number): void {\n  if (typeof intervalSeconds !== \"number\" || intervalSeconds <= 0) {\n    throw new Error(\"intervalSeconds must be a positive number\");\n  }\n  if (intervalSeconds > MAX_INTERVAL_SECONDS) {\n    throw new Error(\n      `intervalSeconds cannot exceed ${MAX_INTERVAL_SECONDS} seconds (30 days)`\n    );\n  }\n}\n\n/**\n * Parse a fixed interval into schedule timing.\n *\n * @param intervalSeconds - Seconds between executions.\n * @param nowMs - Current epoch time in milliseconds.\n * @returns The parsed timing with the first execution one interval from now.\n * @throws For an interval outside the supported range.\n */\nexport function parseInterval(\n  intervalSeconds: number,\n  nowMs: number\n): ScheduleTiming {\n  validateIntervalSeconds(intervalSeconds);\n  return {\n    type: \"interval\",\n    time: Math.floor((nowMs + intervalSeconds * 1000) / 1000),\n    intervalSeconds\n  };\n}\n","/**\n * Lifecycle scheduling vocabulary. Scheduler validates schedules, resolves\n * named callbacks, and pushes jobs into the Lifecycle-owned job queue;\n * Lifecycle runs the alarm event loop, retry policy, and physical alarm\n * arming. Scheduler owns no storage of its own — each schedule is one job\n * whose `fn` is the callback name and whose payload carries the schedule's\n * timing vocabulary.\n */\n\nimport {\n  LifecycleCapability,\n  type LifecycleRouteAddress,\n  type LifecycleRouteContext\n} from \"../lifecycle/capability\";\nimport type {\n  LifecycleJob,\n  LifecycleJobContext,\n  LifecycleJobOutcome\n} from \"../lifecycle/job-queue\";\nimport {\n  isDurableObjectCodeUpdateReset,\n  isPlatformFailure,\n  resolveRetryConfig,\n  tryN,\n  validateRetryOptions\n} from \"../retries\";\nimport type { RetryOptions } from \"../retries\";\nimport type { SchedulerEventType, SchedulerOptions } from \"./options\";\nimport {\n  isRecurring,\n  nextCronTimeMs,\n  parseInterval,\n  parseWhen,\n  validateIntervalSeconds,\n  type ScheduleTiming\n} from \"./schedule-timing\";\nimport type {\n  RecoveryLoopScheduleOptions,\n  Schedule,\n  ScheduleCriteria,\n  ScheduleOptions,\n  ScheduleStorageRow,\n  SchedulerCallbacks,\n  SchedulerHandlers,\n  SchedulerPayload\n} from \"./types\";\n\n/**\n * A resolved fallback handler for a callback name outside the registered map.\n */\ntype ResolvedSchedulerCallback = (\n  payload: unknown,\n  schedule: Schedule<unknown>\n) => unknown;\n\nconst schedulerCallbackResolvers = new WeakMap<\n  object,\n  (name: string) => ResolvedSchedulerCallback | undefined\n>();\n\n/**\n * @internal Supply a composition-root fallback for callback names outside the\n * registered map. Agent uses this to keep its historical name-based\n * scheduling API (`this.schedule(60, \"methodName\")`) working: the resolver\n * looks the method up on the Agent, and the resolved handler still runs\n * inside the Lifecycle host boundary.\n */\nexport function setSchedulerCallbackResolver(\n  scheduler: Scheduler<never>,\n  resolver: (name: string) => ResolvedSchedulerCallback | undefined\n): void {\n  schedulerCallbackResolvers.set(scheduler, resolver);\n}\n\nconst SCHEDULE_SCHEMA_VERSION_KEY = \"cf_agents:schedules_schema_version\";\n/** Version 2: schedule rows live in the Lifecycle job queue. */\nconst CURRENT_SCHEDULE_SCHEMA_VERSION = 2;\n\n/**\n * Legacy schedule callbacks whose rows drive chat recovery loops from before\n * the job queue carried breaker membership. The migration is the one place\n * allowed to know legacy names (it already drops `_cf_keepAliveHeartbeat`\n * rows by name): a recovery row migrated without its `recoveryLoop` flag\n * would escape the alarm memory-limit breaker (#1825) and could re-trigger\n * a doomed loop on an upgraded object.\n */\nconst LEGACY_RECOVERY_LOOP_CALLBACKS = new Set([\n  \"_chatRecoveryContinue\",\n  \"_chatRecoveryRetry\"\n]);\n\nconst DEFAULT_RETRY: Required<RetryOptions> = {\n  maxAttempts: 3,\n  baseDelayMs: 100,\n  maxDelayMs: 3000\n};\n\n/**\n * The schedule timing vocabulary carried in one job's payload. The callback\n * name is the job's `fn`; the user payload rides in `payload`.\n */\ntype SchedulerJobPayload = {\n  readonly payload: unknown;\n  readonly type: \"scheduled\" | \"delayed\" | \"cron\" | \"interval\";\n  /** The caller-supplied retry override, unresolved, for public projection.\n      The job's own retry options are fully resolved against the Scheduler\n      defaults at push so the Lifecycle driver applies the configured\n      policy. */\n  readonly retry?: RetryOptions;\n  readonly delayInSeconds?: number;\n  readonly cron?: string;\n  readonly intervalSeconds?: number;\n  readonly owner_path?: string | null;\n  readonly owner_path_key?: string | null;\n};\n\ntype SchedulerRouteMessage =\n  | {\n      readonly type: \"schedule\";\n      readonly when: Date | string | number;\n      readonly callback: string;\n      readonly payload?: unknown;\n      readonly options?: ScheduleOptions;\n    }\n  | {\n      readonly type: \"every\";\n      readonly intervalSeconds: number;\n      readonly callback: string;\n      readonly payload?: unknown;\n      readonly options?: ScheduleOptions;\n    }\n  | { readonly type: \"get\" | \"cancel\"; readonly id: string }\n  | { readonly type: \"list\"; readonly criteria?: ScheduleCriteria }\n  | {\n      readonly type: \"dispatch\";\n      readonly id: string;\n      readonly fn: string;\n      readonly job: SchedulerJobPayload;\n      readonly retry?: RetryOptions;\n    };\n\ntype InsertResult<T> = {\n  readonly schedule: Schedule<T>;\n  readonly created: boolean;\n};\n\nfunction isSchedulerJobPayload(value: unknown): value is SchedulerJobPayload {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    typeof (value as SchedulerJobPayload).type === \"string\"\n  );\n}\n\n/**\n * Persistent task scheduling for a Lifecycle Object.\n *\n * Register callbacks in the constructor and install the instance with\n * `Lifecycle.use()`. Scheduler validates schedules and pushes them into the\n * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm\n * event loop, and Scheduler runs registered callbacks through Lifecycle's\n * host invocation boundary when its jobs come due.\n *\n * @experimental The API surface may change before stabilizing.\n */\nexport class Scheduler<\n  Handlers extends SchedulerHandlers = SchedulerCallbacks\n> extends LifecycleCapability {\n  readonly #handlers: SchedulerHandlers;\n  readonly #retryDefaults: Required<RetryOptions>;\n  readonly #hungScheduleTimeoutSeconds: number;\n  readonly #onError: ((error: unknown) => void | Promise<void>) | undefined;\n  readonly #warnedStartupCallbacks = new Set<string>();\n\n  /**\n   * Create a persistent Scheduler.\n   *\n   * @param options - Registered callbacks plus optional retry,\n   * hung-interval, and error policy. Registering `callbacks` types\n   * {@link set} and {@link every} against the map — names and\n   * payloads are checked where the handlers are declared and where they are\n   * scheduled. Names outside the map are rejected unless a composition-root\n   * resolver supplies them — the internal aperture behind `Agent`'s\n   * name-based scheduling API.\n   */\n  constructor(options: SchedulerOptions<Handlers> = {}) {\n    super(\"scheduler\");\n    this.#handlers = options.callbacks ?? {};\n    // Retry defaults are resolved, not validated, here: a host whose\n    // historically tolerated invalid retry config throws at construction\n    // would brick every entry point of its Durable Object. Invalid defaults\n    // surface per execution as schedule:error instead, and per-schedule\n    // retry overrides are still validated when each schedule is created.\n    this.#retryDefaults = resolveRetryConfig(options.retry, DEFAULT_RETRY);\n    this.#hungScheduleTimeoutSeconds = options.hungScheduleTimeoutSeconds ?? 30;\n    this.#onError = options.onError;\n  }\n\n  // ── Lifecycle capability hooks ───────────────────────────────────────────\n\n  /** Migrate legacy schedule storage into the Lifecycle job queue. */\n  async onStart(): Promise<void> {\n    this.#warnedStartupCallbacks.clear();\n    const storage = this.lifecycle.storage;\n    const version =\n      (await storage.get<number>(SCHEDULE_SCHEMA_VERSION_KEY)) ?? 0;\n    if (version >= CURRENT_SCHEDULE_SCHEMA_VERSION) return;\n\n    await this.#migrateLegacyScheduleTable(storage);\n    await storage.put(\n      SCHEDULE_SCHEMA_VERSION_KEY,\n      CURRENT_SCHEDULE_SCHEMA_VERSION\n    );\n  }\n\n  /**\n   * Move every `cf_agents_schedules` row into the job queue and drop the\n   * table. Idempotent: a missing table means a fresh object or a completed\n   * migration. Times convert from epoch seconds to epoch milliseconds.\n   */\n  async #migrateLegacyScheduleTable(\n    storage: DurableObjectStorage\n  ): Promise<void> {\n    const tables = storage.sql\n      .exec(\n        \"SELECT name FROM sqlite_master WHERE type='table' AND name='cf_agents_schedules'\"\n      )\n      .toArray();\n    if (tables.length === 0) return;\n\n    const rows = storage.sql\n      .exec(\"SELECT * FROM cf_agents_schedules\")\n      .toArray() as unknown as ScheduleStorageRow[];\n    for (const row of rows) {\n      // Keep-alive heartbeats stopped using schedule rows long ago; drop\n      // orphans instead of migrating them.\n      if (row.callback === \"_cf_keepAliveHeartbeat\") continue;\n      let payload: unknown;\n      try {\n        payload =\n          typeof row.payload === \"string\" ? JSON.parse(row.payload) : undefined;\n      } catch (error) {\n        console.error(\n          `Skipping schedule \"${row.id}\" during job-queue migration: ` +\n            \"its payload is not valid JSON\",\n          error\n        );\n        continue;\n      }\n      let retry: RetryOptions | undefined;\n      try {\n        retry =\n          typeof row.retry_options === \"string\"\n            ? (JSON.parse(row.retry_options) as RetryOptions)\n            : undefined;\n      } catch {\n        retry = undefined;\n      }\n      await this.lifecycle.jobs.push({\n        id: row.id,\n        fn: row.callback,\n        time: row.time * 1000,\n        payload: {\n          payload,\n          retry,\n          type: row.type,\n          delayInSeconds: row.delayInSeconds ?? undefined,\n          cron: row.cron ?? undefined,\n          intervalSeconds: row.intervalSeconds ?? undefined,\n          owner_path: row.owner_path ?? null,\n          owner_path_key: row.owner_path_key ?? null\n        } satisfies SchedulerJobPayload,\n        retry: resolveRetryConfig(retry, this.#retryDefaults),\n        singleflight: row.type === \"interval\",\n        hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n        recoveryLoop: LEGACY_RECOVERY_LOOP_CALLBACKS.has(row.callback)\n      });\n    }\n    storage.sql.exec(\"DROP TABLE cf_agents_schedules\");\n  }\n\n  /** Drive one due schedule job dispatched by the Lifecycle event loop. */\n  async onJob(\n    context: LifecycleJobContext\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job, attempt } = context;\n    const timing = job.payload;\n    if (!isSchedulerJobPayload(timing)) {\n      console.error(`Malformed schedule job ${job.id}; dropping it`);\n      return undefined;\n    }\n\n    if (attempt === 1) {\n      this.#emit(\"schedule:execute\", { callback: job.fn, id: job.id });\n    } else {\n      this.#emit(\"schedule:retry\", {\n        callback: job.fn,\n        id: job.id,\n        attempt,\n        maxAttempts: resolveRetryConfig(job.retry, this.#retryDefaults)\n          .maxAttempts\n      });\n    }\n\n    if (timing.owner_path) {\n      // A routed schedule executes inside its owning Lifecycle; retries run\n      // there too, so this dispatch is a single routed attempt.\n      try {\n        await this.lifecycle.routes.to(\n          {\n            key: timing.owner_path_key ?? timing.owner_path,\n            data: timing.owner_path\n          },\n          {\n            type: \"dispatch\",\n            id: job.id,\n            fn: job.fn,\n            job: timing,\n            retry: job.retry\n          } satisfies SchedulerRouteMessage\n        );\n      } catch (error) {\n        if (isPlatformFailure(error)) {\n          // Preserve the job; Lifecycle defers platform-class failures to a\n          // fresh invocation or the memory-limit breaker.\n          throw error;\n        }\n        console.error(\n          `error dispatching scheduled callback \"${job.fn}\"`,\n          error\n        );\n        this.#emit(\"schedule:error\", {\n          callback: job.fn,\n          id: job.id,\n          error: error instanceof Error ? error.message : String(error),\n          attempts: 0\n        });\n        try {\n          await this.#onError?.(error);\n        } catch {\n          // swallow onError errors\n        }\n        // Leave the job due so a later alarm cycle can retry dispatch, for\n        // example once a transport can resolve its owner again.\n        return \"yield\";\n      }\n      return this.#recurrenceOutcome(timing);\n    }\n\n    const handler = this.#resolveCallback(job.fn);\n    if (!handler) {\n      console.error(`callback ${job.fn} not found`);\n      return this.#recurrenceOutcome(timing);\n    }\n    const schedule = this.#jobToSchedule<unknown>(job, timing);\n    await this.lifecycle.runInHostContext(() =>\n      handler(timing.payload, schedule)\n    );\n    return this.#recurrenceOutcome(timing);\n  }\n\n  /** Observe one schedule's terminal application failure. */\n  async onJobError(\n    context: LifecycleJobContext,\n    error: unknown\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job } = context;\n    const timing = job.payload;\n    if (!isSchedulerJobPayload(timing)) return undefined;\n    const { maxAttempts } = resolveRetryConfig(job.retry, this.#retryDefaults);\n    console.error(\n      `error executing callback \"${job.fn}\" after ${maxAttempts} attempts`,\n      error\n    );\n    this.#emit(\"schedule:error\", {\n      callback: job.fn,\n      id: job.id,\n      error: error instanceof Error ? error.message : String(error),\n      attempts: maxAttempts\n    });\n    try {\n      await this.#onError?.(error);\n    } catch {\n      // swallow onError errors\n    }\n    return this.#recurrenceOutcome(timing);\n  }\n\n  /** Advance a recurring schedule; complete a one-shot. */\n  #recurrenceOutcome(timing: SchedulerJobPayload): LifecycleJobOutcome {\n    if (timing.type === \"cron\") {\n      return { rescheduleAt: nextCronTimeMs(timing.cron ?? \"\", Date.now()) };\n    }\n    if (timing.type === \"interval\") {\n      return {\n        rescheduleAt: Date.now() + (timing.intervalSeconds ?? 0) * 1000\n      };\n    }\n    return undefined;\n  }\n\n  /** Handle Scheduler protocol messages routed by another Lifecycle. */\n  async onRoute(context: LifecycleRouteContext): Promise<unknown> {\n    const message = context.payload as SchedulerRouteMessage;\n    const owner = context.source ?? null;\n    switch (message.type) {\n      case \"schedule\":\n        return this.#insert(\n          owner,\n          parseWhen(message.when, Date.now(), message.callback),\n          message.callback,\n          message.payload,\n          message.options\n        );\n      case \"every\":\n        return this.#insert(\n          owner,\n          parseInterval(message.intervalSeconds, Date.now()),\n          message.callback,\n          message.payload,\n          message.options\n        );\n      case \"get\":\n        return this.#getForOwner(owner, message.id);\n      case \"list\":\n        return this.#listForOwner(owner, message.criteria);\n      case \"cancel\":\n        return this.#cancelForOwner(owner, message.id);\n      case \"dispatch\":\n        await this.#executeRouted(\n          message.id,\n          message.fn,\n          message.job,\n          message.retry\n        );\n        return true;\n      default:\n        throw new Error(\"Unknown routed Scheduler message\");\n    }\n  }\n\n  /**\n   * Execute a routed schedule locally with the historical retry handling.\n   * Runs on the owning (facet) Scheduler, outside the root's event loop, so\n   * it applies its own in-process retry budget. Platform-class failures on a\n   * one-shot re-throw so the root preserves the job and the durable alarm\n   * retries on a fresh invocation.\n   */\n  async #executeRouted(\n    id: string,\n    fn: string,\n    timing: SchedulerJobPayload,\n    retry: RetryOptions | undefined\n  ): Promise<void> {\n    const handler = this.#resolveCallback(fn);\n    if (!handler) {\n      console.error(`callback ${fn} not found`);\n      return;\n    }\n    const { maxAttempts, baseDelayMs, maxDelayMs } = resolveRetryConfig(\n      retry,\n      this.#retryDefaults\n    );\n    const isOneShot = timing.type === \"delayed\" || timing.type === \"scheduled\";\n    const schedule = this.#payloadToSchedule<unknown>(id, fn, timing);\n    try {\n      await tryN(\n        maxAttempts,\n        async (attempt) => {\n          if (attempt > 1) {\n            this.#emit(\"schedule:retry\", {\n              callback: fn,\n              id,\n              attempt,\n              maxAttempts\n            });\n          }\n          await this.lifecycle.runInHostContext(() =>\n            handler(timing.payload, schedule)\n          );\n        },\n        {\n          baseDelayMs,\n          maxDelayMs,\n          shouldRetry: (error) =>\n            !(isOneShot && isDurableObjectCodeUpdateReset(error))\n        }\n      );\n    } catch (error) {\n      if (isOneShot && isPlatformFailure(error)) {\n        throw error;\n      }\n      console.error(\n        `error executing callback \"${fn}\" after ${maxAttempts} attempts`,\n        error\n      );\n      this.#emit(\"schedule:error\", {\n        callback: fn,\n        id,\n        error: error instanceof Error ? error.message : String(error),\n        attempts: maxAttempts\n      });\n      try {\n        await this.#onError?.(error);\n      } catch {\n        // swallow onError errors\n      }\n    }\n  }\n\n  // ── Scheduling API ───────────────────────────────────────────────────────\n\n  /** Set a delayed, dated, or cron schedule for a registered callback. */\n  async set<Name extends keyof Handlers & string>(\n    when: Date | string | number,\n    callback: Name,\n    payload?: SchedulerPayload<Handlers[Name]>,\n    options?: ScheduleOptions\n  ): Promise<Schedule<SchedulerPayload<Handlers[Name]>>> {\n    await this.lifecycle.ready();\n    this.#validateSchedule(when, callback, options);\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"schedule\",\n          when,\n          callback,\n          payload,\n          options\n        } satisfies SchedulerRouteMessage)) as InsertResult<\n          SchedulerPayload<Handlers[Name]>\n        >)\n      : await this.#insert<SchedulerPayload<Handlers[Name]>>(\n          null,\n          parseWhen(when, Date.now(), callback),\n          callback,\n          payload,\n          options\n        );\n    this.#emitCreated(result);\n    return result.schedule;\n  }\n\n  /** Set a fixed-interval schedule for a registered callback. */\n  async every<Name extends keyof Handlers & string>(\n    intervalSeconds: number,\n    callback: Name,\n    payload?: SchedulerPayload<Handlers[Name]>,\n    options?: ScheduleOptions\n  ): Promise<Schedule<SchedulerPayload<Handlers[Name]>>> {\n    await this.lifecycle.ready();\n    this.#validateInterval(intervalSeconds, callback, options?.retry);\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"every\",\n          intervalSeconds,\n          callback,\n          payload,\n          options\n        } satisfies SchedulerRouteMessage)) as InsertResult<\n          SchedulerPayload<Handlers[Name]>\n        >)\n      : await this.#insert<SchedulerPayload<Handlers[Name]>>(\n          null,\n          parseInterval(intervalSeconds, Date.now()),\n          callback,\n          payload,\n          options\n        );\n    this.#emitCreated(result);\n    return result.schedule;\n  }\n\n  /** Get a schedule by ID. Works inside routed sub-agents. */\n  async get(id: string): Promise<Schedule<unknown> | undefined> {\n    await this.lifecycle.ready();\n    return this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"get\",\n          id\n        } satisfies SchedulerRouteMessage)) as Schedule<unknown> | undefined)\n      : this.#getForOwner(null, id);\n  }\n\n  /** List schedules matching criteria. Works inside routed sub-agents. */\n  async list(criteria: ScheduleCriteria = {}): Promise<Schedule<unknown>[]> {\n    await this.lifecycle.ready();\n    return this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"list\",\n          criteria\n        } satisfies SchedulerRouteMessage)) as Schedule<unknown>[])\n      : this.#listForOwner(null, criteria);\n  }\n\n  /**\n   * Cancel one schedule owned by this Scheduler.\n   *\n   * @param id - ID of the schedule to cancel.\n   * @returns True when a schedule was cancelled, false when none matched.\n   */\n  async cancel(id: string): Promise<boolean> {\n    await this.lifecycle.ready();\n    const result = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"cancel\",\n          id\n        } satisfies SchedulerRouteMessage)) as {\n          ok: boolean;\n          callback?: string;\n        })\n      : await this.#cancelForOwner(null, id);\n    if (result.ok && result.callback) {\n      this.#emit(\"schedule:cancel\", { callback: result.callback, id });\n    }\n    return result.ok;\n  }\n\n  // ── Host-owned policy apertures ──────────────────────────────────────────\n\n  /**\n   * @internal Synchronous read backing Agent's deprecated `getSchedule()`.\n   * Not part of the primitive's contract — use {@link get}. Cannot cross\n   * Durable Object boundaries and throws inside routed sub-agents.\n   */\n  __DO_NOT_USE_WILL_REMOVE__getSchedule<T = string>(\n    id: string\n  ): Schedule<T> | undefined {\n    if (this.lifecycle.routes.source) {\n      throw new Error(\n        \"getSchedule() is synchronous and cannot read routed schedule storage. \" +\n          \"Use await getScheduleById(id) on Agent, or await scheduler.get(id) \" +\n          \"on a standalone Scheduler.\"\n      );\n    }\n    return this.#getForOwner(null, id);\n  }\n\n  /**\n   * @internal Synchronous read backing Agent's deprecated `getSchedules()`.\n   * Not part of the primitive's contract — use {@link list}. Cannot cross\n   * Durable Object boundaries and throws inside routed sub-agents.\n   */\n  __DO_NOT_USE_WILL_REMOVE__getSchedules<T = string>(\n    criteria: ScheduleCriteria = {}\n  ): Schedule<T>[] {\n    if (this.lifecycle.routes.source) {\n      throw new Error(\n        \"getSchedules() is synchronous and cannot read routed schedule storage. \" +\n          \"Use await listSchedules(criteria) on Agent, or await \" +\n          \"scheduler.list(criteria) on a standalone Scheduler.\"\n      );\n    }\n    return this.#listForOwner(null, criteria);\n  }\n\n  /** @internal Remove schedules owned by one routed Lifecycle subtree. */\n  async __DO_NOT_USE_WILL_BREAK__cleanupRoutePrefix(\n    prefix: string\n  ): Promise<void> {\n    for (const { job, timing } of this.#ownedJobs()) {\n      const ownerKey = timing.owner_path_key ?? timing.owner_path;\n      if (!timing.owner_path || ownerKey === null || ownerKey === undefined) {\n        continue;\n      }\n      if (ownerKey !== prefix && !ownerKey.startsWith(`${prefix}/`)) continue;\n      this.#emit(\"schedule:cancel\", { callback: job.fn, id: job.id });\n      await this.lifecycle.jobs.cancel(job.id);\n    }\n  }\n\n  // ── Validation ───────────────────────────────────────────────────────────\n\n  #validateSchedule(\n    when: Date | string | number,\n    callback: string,\n    options?: ScheduleOptions\n  ): void {\n    if (typeof callback !== \"string\") {\n      throw new Error(\"Callback must be a string\");\n    }\n    if (!this.#hasCallback(callback)) {\n      throw new Error(\n        `Unknown scheduled callback \"${callback}\": not registered on this Scheduler`\n      );\n    }\n    if (options?.retry) {\n      validateRetryOptions(options.retry, this.#retryDefaults);\n    }\n    if (\n      !(when instanceof Date) &&\n      typeof when !== \"number\" &&\n      typeof when !== \"string\"\n    ) {\n      throw new Error(\n        `Invalid schedule type: ${JSON.stringify(when)}(${typeof when}) trying to schedule ${callback}`\n      );\n    }\n    this.#warnWhenScheduledDuringStartup(when, callback, options);\n  }\n\n  #validateInterval(\n    intervalSeconds: number,\n    callback: string,\n    retry?: RetryOptions\n  ): void {\n    validateIntervalSeconds(intervalSeconds);\n    if (typeof callback !== \"string\") {\n      throw new Error(\"Callback must be a string\");\n    }\n    if (!this.#hasCallback(callback)) {\n      throw new Error(\n        `Unknown scheduled callback \"${callback}\": not registered on this Scheduler`\n      );\n    }\n    if (retry) validateRetryOptions(retry, this.#retryDefaults);\n  }\n\n  /**\n   * A non-idempotent one-shot created during startup accumulates one row per\n   * Durable Object wake, whether it came from the host's onStart or another\n   * startup hook. Warn once per callback; an explicit `idempotent` choice\n   * (either value) opts out.\n   */\n  #warnWhenScheduledDuringStartup(\n    when: Date | string | number,\n    callback: string,\n    options?: ScheduleOptions\n  ): void {\n    if (this.lifecycle.status() !== \"starting\") return;\n    if (options?.idempotent !== undefined) return;\n    if (typeof when === \"string\") return;\n    if (this.#warnedStartupCallbacks.has(callback)) return;\n    this.#warnedStartupCallbacks.add(callback);\n    console.warn(\n      `Scheduling \"${callback}\" during startup (e.g. onStart()) without ` +\n        `{ idempotent: true } creates a new row on every Durable Object ` +\n        `restart, which can cause duplicate executions. Pass ` +\n        `{ idempotent: true } to deduplicate, or use an interval schedule ` +\n        `for recurring tasks.`\n    );\n  }\n\n  /** Resolve a name to its registered or composition-root-supplied handler. */\n  #resolveCallback(name: string): ResolvedSchedulerCallback | undefined {\n    const handler = this.#handlers[name];\n    if (handler) {\n      // SAFETY: registered handlers are constrained with `never` parameters\n      // so concrete handler types satisfy the map under contravariance; the\n      // payload passed at dispatch was persisted with this handler's name.\n      return handler as ResolvedSchedulerCallback;\n    }\n    return schedulerCallbackResolvers.get(this)?.(name);\n  }\n\n  /** True when a name resolves to a runnable callback. */\n  #hasCallback(name: string): boolean {\n    return this.#resolveCallback(name) !== undefined;\n  }\n\n  // ── Jobs ─────────────────────────────────────────────────────────────────\n\n  /** Every schedule job this Scheduler owns, with its parsed vocabulary. */\n  #ownedJobs(): Array<{ job: LifecycleJob; timing: SchedulerJobPayload }> {\n    const owned: Array<{ job: LifecycleJob; timing: SchedulerJobPayload }> = [];\n    for (const job of this.lifecycle.jobs.list()) {\n      if (isSchedulerJobPayload(job.payload)) {\n        owned.push({ job, timing: job.payload });\n      }\n    }\n    return owned;\n  }\n\n  /**\n   * Push a schedule job for the given owner, or return the existing job\n   * when an idempotent request matches one. One-shot timings deduplicate only\n   * when `idempotent: true` is passed; recurring timings deduplicate unless\n   * `idempotent: false` opts out. `created: false` marks a dedup hit so\n   * callers suppress the `schedule:create` event.\n   */\n  async #insert<T = string>(\n    owner: LifecycleRouteAddress | null,\n    timing: ScheduleTiming,\n    callback: string,\n    payload: unknown,\n    options?: ScheduleOptions\n  ): Promise<InsertResult<T>> {\n    // Recurring timings deduplicate unless explicitly opted out; one-shot\n    // timings deduplicate on any truthy value (historic Agent behavior).\n    const idempotent = isRecurring(timing)\n      ? options?.idempotent !== false\n      : Boolean(options?.idempotent);\n    // Not part of public ScheduleOptions. See RecoveryLoopScheduleOptions.\n    const recoveryLoop = (\n      options as Partial<RecoveryLoopScheduleOptions> | undefined\n    )?.recoveryLoop;\n\n    if (idempotent) {\n      const existing = this.#findMatchingJob(\n        owner?.key ?? null,\n        timing,\n        callback,\n        JSON.stringify(payload)\n      );\n      if (existing) {\n        // A dedup hit onto a row without breaker membership the caller asks\n        // for (a row migrated from the legacy schedule table) re-pushes the\n        // same durable intent in place with the flag — otherwise the row\n        // would escape the alarm memory-limit breaker (#1825) forever.\n        if (recoveryLoop && !existing.job.recoveryLoop) {\n          await this.lifecycle.jobs.push({\n            id: existing.job.id,\n            fn: existing.job.fn,\n            time: existing.job.time,\n            payload: existing.job.payload,\n            retry: existing.job.retry,\n            singleflight: existing.job.singleflight,\n            exclusive: existing.job.exclusive,\n            hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n            recoveryLoop: true\n          });\n        }\n        // A dedup hit still re-arms so a lost physical alarm recovers, as\n        // idempotent re-scheduling on startup historically guaranteed.\n        await this.lifecycle.jobs.rearm();\n        return {\n          schedule: this.#jobToSchedule<T>(existing.job, existing.timing),\n          created: false\n        };\n      }\n    }\n\n    const jobPayload: SchedulerJobPayload = {\n      payload,\n      retry: options?.retry,\n      type: timing.type,\n      delayInSeconds:\n        timing.type === \"delayed\" ? timing.delayInSeconds : undefined,\n      cron: timing.type === \"cron\" ? timing.cron : undefined,\n      intervalSeconds:\n        timing.type === \"interval\" ? timing.intervalSeconds : undefined,\n      owner_path: owner?.data ?? null,\n      owner_path_key: owner?.key ?? null\n    };\n    const job = await this.lifecycle.jobs.push({\n      fn: callback,\n      time: timing.time * 1000,\n      payload: jobPayload,\n      retry: resolveRetryConfig(options?.retry, this.#retryDefaults),\n      singleflight: timing.type === \"interval\",\n      hungTimeoutSeconds: this.#hungScheduleTimeoutSeconds,\n      recoveryLoop\n    });\n\n    return {\n      schedule: {\n        id: job.id,\n        callback,\n        // SAFETY: payload is optional at the call site; historical API shape\n        // types an omitted payload as the schedule's payload type.\n        payload: payload as T,\n        retry: options?.retry,\n        ...timing\n      },\n      created: true\n    };\n  }\n\n  /** Find the job an idempotent insert deduplicates onto, if any. */\n  #findMatchingJob(\n    ownerKey: string | null,\n    timing: ScheduleTiming,\n    callback: string,\n    payloadJson: string\n  ): { job: LifecycleJob; timing: SchedulerJobPayload } | undefined {\n    for (const owned of this.#ownedJobs()) {\n      const { job, timing: candidate } = owned;\n      if (candidate.type !== timing.type) continue;\n      if (job.fn !== callback) continue;\n      if ((candidate.owner_path_key ?? null) !== ownerKey) continue;\n      if (JSON.stringify(candidate.payload) !== payloadJson) continue;\n      if (timing.type === \"cron\" && candidate.cron !== timing.cron) continue;\n      if (\n        timing.type === \"interval\" &&\n        candidate.intervalSeconds !== timing.intervalSeconds\n      ) {\n        continue;\n      }\n      return owned;\n    }\n    return undefined;\n  }\n\n  #jobToSchedule<T>(\n    job: LifecycleJob,\n    timing: SchedulerJobPayload\n  ): Schedule<T> {\n    return this.#payloadToSchedule<T>(\n      job.id,\n      job.fn,\n      timing,\n      Math.floor(job.time / 1000)\n    );\n  }\n\n  #payloadToSchedule<T>(\n    id: string,\n    fn: string,\n    timing: SchedulerJobPayload,\n    timeSeconds?: number\n  ): Schedule<T> {\n    const base = {\n      callback: fn,\n      id,\n      payload: timing.payload as T,\n      retry: timing.retry\n    };\n    const time = timeSeconds ?? 0;\n    switch (timing.type) {\n      case \"scheduled\":\n        return { ...base, time, type: \"scheduled\" };\n      case \"delayed\":\n        return {\n          ...base,\n          delayInSeconds: timing.delayInSeconds ?? 0,\n          time,\n          type: \"delayed\"\n        };\n      case \"cron\":\n        return { ...base, cron: timing.cron ?? \"\", time, type: \"cron\" };\n      case \"interval\":\n        return {\n          ...base,\n          intervalSeconds: timing.intervalSeconds ?? 0,\n          time,\n          type: \"interval\"\n        };\n    }\n  }\n\n  #getForOwner<T = string>(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Schedule<T> | undefined {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isSchedulerJobPayload(job.payload)) return undefined;\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) return undefined;\n    return this.#jobToSchedule<T>(job, job.payload);\n  }\n\n  #listForOwner<T = string>(\n    owner: LifecycleRouteAddress | null,\n    criteria: ScheduleCriteria = {}\n  ): Schedule<T>[] {\n    const ownerKey = owner?.key ?? null;\n    const startSeconds = criteria.timeRange\n      ? Math.floor((criteria.timeRange.start ?? new Date(0)).getTime() / 1000)\n      : null;\n    const endSeconds = criteria.timeRange\n      ? Math.floor(\n          (criteria.timeRange.end ?? new Date(999999999999999)).getTime() / 1000\n        )\n      : null;\n\n    const schedules: Schedule<T>[] = [];\n    for (const { job, timing } of this.#ownedJobs()) {\n      if ((timing.owner_path_key ?? null) !== ownerKey) continue;\n      if (criteria.id && job.id !== criteria.id) continue;\n      if (criteria.type && timing.type !== criteria.type) continue;\n      const timeSeconds = Math.floor(job.time / 1000);\n      if (startSeconds !== null && timeSeconds < startSeconds) continue;\n      if (endSeconds !== null && timeSeconds > endSeconds) continue;\n      schedules.push(this.#jobToSchedule<T>(job, timing));\n    }\n    return schedules;\n  }\n\n  async #cancelForOwner(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Promise<{ ok: boolean; callback?: string }> {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isSchedulerJobPayload(job.payload)) return { ok: false };\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) {\n      return { ok: false };\n    }\n    const callback = job.fn;\n    await this.lifecycle.jobs.cancel(id);\n    return { ok: true, callback };\n  }\n\n  // ── Events ───────────────────────────────────────────────────────────────\n\n  #emit(type: SchedulerEventType, payload: Record<string, unknown>): void {\n    this.lifecycle.events.emit(type, payload);\n  }\n\n  #emitCreated(result: InsertResult<unknown>): void {\n    if (!result.created) return;\n    this.#emit(\"schedule:create\", {\n      callback: result.schedule.callback,\n      id: result.schedule.id\n    });\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AAWA,MAAa,uBAAuB,MAAU,KAAK;;AAoCnD,SAAgB,YAAY,QAAiC;CAC3D,OAAO,OAAO,SAAS,UAAU,OAAO,SAAS;AACnD;;;;;;;;;AAUA,SAAgB,eAAe,MAAc,OAAuB;CAClE,OAAO,oBAAoB,IAAI,CAAC,CAAC,YAAY,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ;AACxE;;;;;;;;;;;;;AAcA,SAAgB,UACd,MACA,OACA,UACgB;CAChB,IAAI,gBAAgB,MAClB,OAAO;EAAE,MAAM;EAAa,MAAM,KAAK,MAAM,KAAK,QAAQ,IAAI,GAAI;CAAE;CAEtE,IAAI,OAAO,SAAS,UAClB,OAAO;EACL,MAAM;EACN,MAAM,KAAK,OAAO,QAAQ,OAAO,OAAQ,GAAI;EAC7C,gBAAgB;CAClB;CAEF,IAAI,OAAO,SAAS,UAClB,OAAO;EACL,MAAM;EACN,MAAM,KAAK,MAAM,eAAe,MAAM,KAAK,IAAI,GAAI;EACnD,MAAM;CACR;CAEF,MAAM,IAAI,MACR,0BAA0B,KAAK,UAAU,IAAI,EAAE,GAAG,OAAO,KAAK,uBAAuB,UACvF;AACF;;;;;;;AAQA,SAAgB,wBAAwB,iBAA+B;CACrE,IAAI,OAAO,oBAAoB,YAAY,mBAAmB,GAC5D,MAAM,IAAI,MAAM,2CAA2C;CAE7D,IAAI,kBAAA,QACF,MAAM,IAAI,MACR,iCAAiC,qBAAqB,mBACxD;AAEJ;;;;;;;;;AAUA,SAAgB,cACd,iBACA,OACgB;CAChB,wBAAwB,eAAe;CACvC,OAAO;EACL,MAAM;EACN,MAAM,KAAK,OAAO,QAAQ,kBAAkB,OAAQ,GAAI;EACxD;CACF;AACF;;;;;;;;;;;AClFA,MAAM,6CAA6B,IAAI,QAGrC;;;;;;;;AASF,SAAgB,6BACd,WACA,UACM;CACN,2BAA2B,IAAI,WAAW,QAAQ;AACpD;AAEA,MAAM,8BAA8B;;AAEpC,MAAM,kCAAkC;;;;;;;;;AAUxC,MAAM,iDAAiC,IAAI,IAAI,CAC7C,yBACA,oBACF,CAAC;AAED,MAAM,gBAAwC;CAC5C,aAAa;CACb,aAAa;CACb,YAAY;AACd;AAmDA,SAAS,sBAAsB,OAA8C;CAC3E,OACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA8B,SAAS;AAEnD;;;;;;;;;;;;;;;;;;AAaA,IAAa,YAAb,cAEU,oBAAoB;;;;;;;;;;;;CAkB5B,YAAY,UAAsC,CAAC,GAAG;EACpD,MAAM,WAAW;;;;;;4EAdgB,IAAI,IAAY,CAAA;EAejD,uBAAA,WAAA,MAAiB,QAAQ,aAAa,CAAC,CAAA;EAMvC,uBAAA,gBAAA,MAAsB,mBAAmB,QAAQ,OAAO,aAAa,CAAA;EACrE,uBAAA,6BAAA,MAAmC,QAAQ,8BAA8B,EAAA;EACzE,uBAAA,UAAA,MAAgB,QAAQ,OAAA;CAC1B;;CAKA,MAAM,UAAyB;EAC7B,uBAAA,yBAAA,IAAA,CAAA,CAA6B,MAAM;EACnC,MAAM,UAAU,KAAK,UAAU;EAG/B,KADG,MAAM,QAAQ,IAAY,2BAA2B,KAAM,MAC/C,iCAAiC;EAEhD,MAAA,kBAAA,kBAAM,MAAA,2BAAA,CAAA,CAAA,KAAA,MAAiC,OAAO;EAC9C,MAAM,QAAQ,IACZ,6BACA,+BACF;CACF;;CAqEA,MAAM,MACJ,SACqC;EACrC,MAAM,EAAE,KAAK,YAAY;EACzB,MAAM,SAAS,IAAI;EACnB,IAAI,CAAC,sBAAsB,MAAM,GAAG;GAClC,QAAQ,MAAM,0BAA0B,IAAI,GAAG,cAAc;GAC7D;EACF;EAEA,IAAI,YAAY,GACd,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,oBAAoB;GAAE,UAAU,IAAI;GAAI,IAAI,IAAI;EAAG,CAAC;OAE/D,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU,IAAI;GACd,IAAI,IAAI;GACR;GACA,aAAa,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB,CAAC,CAC5D;EACL,CAAC;EAGH,IAAI,OAAO,YAAY;GAGrB,IAAI;IACF,MAAM,KAAK,UAAU,OAAO,GAC1B;KACE,KAAK,OAAO,kBAAkB,OAAO;KACrC,MAAM,OAAO;IACf,GACA;KACE,MAAM;KACN,IAAI,IAAI;KACR,IAAI,IAAI;KACR,KAAK;KACL,OAAO,IAAI;IACb,CACF;GACF,SAAS,OAAO;IACd,IAAI,kBAAkB,KAAK,GAGzB,MAAM;IAER,QAAQ,MACN,yCAAyC,IAAI,GAAG,IAChD,KACF;IACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;KAC3B,UAAU,IAAI;KACd,IAAI,IAAI;KACR,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;KAC5D,UAAU;IACZ,CAAC;IACD,IAAI;KACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;IAC7B,QAAQ,CAER;IAGA,OAAO;GACT;GACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;EACvC;EAEA,MAAM,UAAA,kBAAA,kBAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,EAAE;EAC5C,IAAI,CAAC,SAAS;GACZ,QAAQ,MAAM,YAAY,IAAI,GAAG,WAAW;GAC5C,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;EACvC;EACA,MAAM,WAAA,kBAAA,kBAAW,MAAA,cAAA,CAAA,CAAA,KAAA,MAA6B,KAAK,MAAM;EACzD,MAAM,KAAK,UAAU,uBACnB,QAAQ,OAAO,SAAS,QAAQ,CAClC;EACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;CACvC;;CAGA,MAAM,WACJ,SACA,OACqC;EACrC,MAAM,EAAE,QAAQ;EAChB,MAAM,SAAS,IAAI;EACnB,IAAI,CAAC,sBAAsB,MAAM,GAAG,OAAO,KAAA;EAC3C,MAAM,EAAE,gBAAgB,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACzE,QAAQ,MACN,6BAA6B,IAAI,GAAG,UAAU,YAAY,YAC1D,KACF;EACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU,IAAI;GACd,IAAI,IAAI;GACR,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAC5D,UAAU;EACZ,CAAC;EACD,IAAI;GACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;EAC7B,QAAQ,CAER;EACA,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM;CACvC;;CAgBA,MAAM,QAAQ,SAAkD;EAC9D,MAAM,UAAU,QAAQ;EACxB,MAAM,QAAQ,QAAQ,UAAU;EAChC,QAAQ,QAAQ,MAAhB;GACE,KAAK,YACH,OAAA,kBAAA,kBAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,UAAU,QAAQ,MAAM,KAAK,IAAI,GAAG,QAAQ,QAAQ,GACpD,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,SACH,OAAA,kBAAA,kBAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,cAAc,QAAQ,iBAAiB,KAAK,IAAI,CAAC,GACjD,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,OACH,OAAA,kBAAA,kBAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,QAAQ,EAAE;GAC5C,KAAK,QACH,OAAA,kBAAA,kBAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,QAAQ,QAAQ;GACnD,KAAK,UACH,OAAA,kBAAA,kBAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,OAAO,QAAQ,EAAE;GAC/C,KAAK;IACH,MAAA,kBAAA,kBAAM,MAAA,cAAA,CAAA,CAAA,KAAA,MACJ,QAAQ,IACR,QAAQ,IACR,QAAQ,KACR,QAAQ,KACV;IACA,OAAO;GACT,SACE,MAAM,IAAI,MAAM,kCAAkC;EACtD;CACF;;CA0EA,MAAM,IACJ,MACA,UACA,SACA,SACqD;EACrD,MAAM,KAAK,UAAU,MAAM;EAC3B,kBAAA,kBAAA,MAAA,iBAAA,CAAA,CAAA,KAAA,MAAuB,MAAM,UAAU,OAAO;EAC9C,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;GACA;EACF,CAAiC,IAGjC,MAAA,kBAAA,kBAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,UAAU,MAAM,KAAK,IAAI,GAAG,QAAQ,GACpC,UACA,SACA,OACF;EACJ,kBAAA,kBAAA,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM;EACxB,OAAO,OAAO;CAChB;;CAGA,MAAM,MACJ,iBACA,UACA,SACA,SACqD;EACrD,MAAM,KAAK,UAAU,MAAM;EAC3B,kBAAA,kBAAA,MAAA,iBAAA,CAAA,CAAA,KAAA,MAAuB,iBAAiB,UAAU,SAAS,KAAK;EAChE,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;GACA;EACF,CAAiC,IAGjC,MAAA,kBAAA,kBAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,cAAc,iBAAiB,KAAK,IAAI,CAAC,GACzC,UACA,SACA,OACF;EACJ,kBAAA,kBAAA,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM;EACxB,OAAO,OAAO;CAChB;;CAGA,MAAM,IAAI,IAAoD;EAC5D,MAAM,KAAK,UAAU,MAAM;EAC3B,OAAO,KAAK,UAAU,OAAO,SACvB,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAAA,kBAAA,kBACjC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM,EAAE;CAChC;;CAGA,MAAM,KAAK,WAA6B,CAAC,GAAiC;EACxE,MAAM,KAAK,UAAU,MAAM;EAC3B,OAAO,KAAK,UAAU,OAAO,SACvB,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAAA,kBAAA,kBACjC,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,MAAM,QAAQ;CACvC;;;;;;;CAQA,MAAM,OAAO,IAA8B;EACzC,MAAM,KAAK,UAAU,MAAM;EAC3B,MAAM,SAAS,KAAK,UAAU,OAAO,SAC/B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;EACF,CAAiC,IAIjC,MAAA,kBAAA,kBAAM,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;EACvC,IAAI,OAAO,MAAM,OAAO,UACtB,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;GAAE,UAAU,OAAO;GAAU;EAAG,CAAC;EAEjE,OAAO,OAAO;CAChB;;;;;;CASA,sCACE,IACyB;EACzB,IAAI,KAAK,UAAU,OAAO,QACxB,MAAM,IAAI,MACR,qKAGF;EAEF,OAAA,kBAAA,kBAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,MAAM,EAAE;CACnC;;;;;;CAOA,uCACE,WAA6B,CAAC,GACf;EACf,IAAI,KAAK,UAAU,OAAO,QACxB,MAAM,IAAI,MACR,iLAGF;EAEF,OAAA,kBAAA,kBAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,MAAM,QAAQ;CAC1C;;CAGA,MAAM,4CACJ,QACe;EACf,KAAK,MAAM,EAAE,KAAK,YAAA,kBAAA,kBAAY,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;GAC/C,MAAM,WAAW,OAAO,kBAAkB,OAAO;GACjD,IAAI,CAAC,OAAO,cAAc,aAAa,QAAQ,aAAa,KAAA,GAC1D;GAEF,IAAI,aAAa,UAAU,CAAC,SAAS,WAAW,GAAG,OAAO,EAAE,GAAG;GAC/D,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;IAAE,UAAU,IAAI;IAAI,IAAI,IAAI;GAAG,CAAC;GAC9D,MAAM,KAAK,UAAU,KAAK,OAAO,IAAI,EAAE;EACzC;CACF;AAiVF;;;;;;AAjxBE,eAAA,4BACE,SACe;CAMf,IALe,QAAQ,IACpB,KACC,kFACF,CAAC,CACA,QACM,CAAC,CAAC,WAAW,GAAG;CAEzB,MAAM,OAAO,QAAQ,IAClB,KAAK,mCAAmC,CAAC,CACzC,QAAQ;CACX,KAAK,MAAM,OAAO,MAAM;EAGtB,IAAI,IAAI,aAAa,0BAA0B;EAC/C,IAAI;EACJ,IAAI;GACF,UACE,OAAO,IAAI,YAAY,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAA;EAChE,SAAS,OAAO;GACd,QAAQ,MACN,sBAAsB,IAAI,GAAG,8DAE7B,KACF;GACA;EACF;EACA,IAAI;EACJ,IAAI;GACF,QACE,OAAO,IAAI,kBAAkB,WACxB,KAAK,MAAM,IAAI,aAAa,IAC7B,KAAA;EACR,QAAQ;GACN,QAAQ,KAAA;EACV;EACA,MAAM,KAAK,UAAU,KAAK,KAAK;GAC7B,IAAI,IAAI;GACR,IAAI,IAAI;GACR,MAAM,IAAI,OAAO;GACjB,SAAS;IACP;IACA;IACA,MAAM,IAAI;IACV,gBAAgB,IAAI,kBAAkB,KAAA;IACtC,MAAM,IAAI,QAAQ,KAAA;IAClB,iBAAiB,IAAI,mBAAmB,KAAA;IACxC,YAAY,IAAI,cAAc;IAC9B,gBAAgB,IAAI,kBAAkB;GACxC;GACA,OAAO,mBAAmB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;GACpD,cAAc,IAAI,SAAS;GAC3B,oBAAA,uBAAA,6BAAoB,IAAA;GACpB,cAAc,+BAA+B,IAAI,IAAI,QAAQ;EAC/D,CAAC;CACH;CACA,QAAQ,IAAI,KAAK,gCAAgC;AACnD;;AA8GA,SAAA,mBAAmB,QAAkD;CACnE,IAAI,OAAO,SAAS,QAClB,OAAO,EAAE,cAAc,eAAe,OAAO,QAAQ,IAAI,KAAK,IAAI,CAAC,EAAE;CAEvE,IAAI,OAAO,SAAS,YAClB,OAAO,EACL,cAAc,KAAK,IAAI,KAAK,OAAO,mBAAmB,KAAK,IAC7D;AAGJ;;;;;;;;AAiDA,eAAA,eACE,IACA,IACA,QACA,OACe;CACf,MAAM,UAAA,kBAAA,kBAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,EAAE;CACxC,IAAI,CAAC,SAAS;EACZ,QAAQ,MAAM,YAAY,GAAG,WAAW;EACxC;CACF;CACA,MAAM,EAAE,aAAa,aAAa,eAAe,mBAC/C,OAAA,uBAAA,gBACA,IAAA,CACF;CACA,MAAM,YAAY,OAAO,SAAS,aAAa,OAAO,SAAS;CAC/D,MAAM,WAAA,kBAAA,kBAAW,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAiC,IAAI,IAAI,MAAM;CAChE,IAAI;EACF,MAAM,KACJ,aACA,OAAO,YAAY;GACjB,IAAI,UAAU,GACZ,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;IAC3B,UAAU;IACV;IACA;IACA;GACF,CAAC;GAEH,MAAM,KAAK,UAAU,uBACnB,QAAQ,OAAO,SAAS,QAAQ,CAClC;EACF,GACA;GACE;GACA;GACA,cAAc,UACZ,EAAE,aAAa,+BAA+B,KAAK;EACvD,CACF;CACF,SAAS,OAAO;EACd,IAAI,aAAa,kBAAkB,KAAK,GACtC,MAAM;EAER,QAAQ,MACN,6BAA6B,GAAG,UAAU,YAAY,YACtD,KACF;EACA,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,kBAAkB;GAC3B,UAAU;GACV;GACA,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAC5D,UAAU;EACZ,CAAC;EACD,IAAI;GACF,MAAA,uBAAA,UAAM,IAAA,CAAA,EAAA,KAAA,MAAgB,KAAK;EAC7B,QAAQ,CAER;CACF;AACF;AAoKA,SAAA,kBACE,MACA,UACA,SACM;CACN,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,kBAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,+BAA+B,SAAS,oCAC1C;CAEF,IAAI,SAAS,OACX,qBAAqB,QAAQ,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CAEzD,IACE,EAAE,gBAAgB,SAClB,OAAO,SAAS,YAChB,OAAO,SAAS,UAEhB,MAAM,IAAI,MACR,0BAA0B,KAAK,UAAU,IAAI,EAAE,GAAG,OAAO,KAAK,uBAAuB,UACvF;CAEF,kBAAA,kBAAA,MAAA,+BAAA,CAAA,CAAA,KAAA,MAAqC,MAAM,UAAU,OAAO;AAC9D;AAEA,SAAA,kBACE,iBACA,UACA,OACM;CACN,wBAAwB,eAAe;CACvC,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,kBAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,+BAA+B,SAAS,oCAC1C;CAEF,IAAI,OAAO,qBAAqB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;AAC5D;;;;;;;AAQA,SAAA,gCACE,MACA,UACA,SACM;CACN,IAAI,KAAK,UAAU,OAAO,MAAM,YAAY;CAC5C,IAAI,SAAS,eAAe,KAAA,GAAW;CACvC,IAAI,OAAO,SAAS,UAAU;CAC9B,IAAA,uBAAA,yBAAI,IAAA,CAAA,CAA6B,IAAI,QAAQ,GAAG;CAChD,uBAAA,yBAAA,IAAA,CAAA,CAA6B,IAAI,QAAQ;CACzC,QAAQ,KACN,eAAe,SAAS,mPAK1B;AACF;;AAGA,SAAA,iBAAiB,MAAqD;CACpE,MAAM,UAAA,uBAAA,WAAU,IAAA,CAAA,CAAe;CAC/B,IAAI,SAIF,OAAO;CAET,OAAO,2BAA2B,IAAI,IAAI,CAAC,GAAG,IAAI;AACpD;;AAGA,SAAA,aAAa,MAAuB;CAClC,OAAA,kBAAA,kBAAO,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,MAAM,KAAA;AACzC;;AAKA,SAAA,aAAwE;CACtE,MAAM,QAAmE,CAAC;CAC1E,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,GACzC,IAAI,sBAAsB,IAAI,OAAO,GACnC,MAAM,KAAK;EAAE;EAAK,QAAQ,IAAI;CAAQ,CAAC;CAG3C,OAAO;AACT;;;;;;;;AASA,eAAA,QACE,OACA,QACA,UACA,SACA,SAC0B;CAG1B,MAAM,aAAa,YAAY,MAAM,IACjC,SAAS,eAAe,QACxB,QAAQ,SAAS,UAAU;CAE/B,MAAM,eACJ,SACC;CAEH,IAAI,YAAY;EACd,MAAM,WAAA,kBAAA,kBAAW,MAAA,gBAAA,CAAA,CAAA,KAAA,MACf,OAAO,OAAO,MACd,QACA,UACA,KAAK,UAAU,OAAO,CACxB;EACA,IAAI,UAAU;GAKZ,IAAI,gBAAgB,CAAC,SAAS,IAAI,cAChC,MAAM,KAAK,UAAU,KAAK,KAAK;IAC7B,IAAI,SAAS,IAAI;IACjB,IAAI,SAAS,IAAI;IACjB,MAAM,SAAS,IAAI;IACnB,SAAS,SAAS,IAAI;IACtB,OAAO,SAAS,IAAI;IACpB,cAAc,SAAS,IAAI;IAC3B,WAAW,SAAS,IAAI;IACxB,oBAAA,uBAAA,6BAAoB,IAAA;IACpB,cAAc;GAChB,CAAC;GAIH,MAAM,KAAK,UAAU,KAAK,MAAM;GAChC,OAAO;IACL,UAAA,kBAAA,kBAAU,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,SAAS,KAAK,SAAS,MAAM;IAC9D,SAAS;GACX;EACF;CACF;CAEA,MAAM,aAAkC;EACtC;EACA,OAAO,SAAS;EAChB,MAAM,OAAO;EACb,gBACE,OAAO,SAAS,YAAY,OAAO,iBAAiB,KAAA;EACtD,MAAM,OAAO,SAAS,SAAS,OAAO,OAAO,KAAA;EAC7C,iBACE,OAAO,SAAS,aAAa,OAAO,kBAAkB,KAAA;EACxD,YAAY,OAAO,QAAQ;EAC3B,gBAAgB,OAAO,OAAO;CAChC;CAWA,OAAO;EACL,UAAU;GACR,KAAI,MAZU,KAAK,UAAU,KAAK,KAAK;IACzC,IAAI;IACJ,MAAM,OAAO,OAAO;IACpB,SAAS;IACT,OAAO,mBAAmB,SAAS,OAAA,uBAAA,gBAAO,IAAA,CAAmB;IAC7D,cAAc,OAAO,SAAS;IAC9B,oBAAA,uBAAA,6BAAoB,IAAA;IACpB;GACF,CAAC,EAAA,CAIW;GACR;GAGS;GACT,OAAO,SAAS;GAChB,GAAG;EACL;EACA,SAAS;CACX;AACF;;AAGA,SAAA,iBACE,UACA,QACA,UACA,aACgE;CAChE,KAAK,MAAM,SAAA,kBAAA,kBAAS,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EACrC,MAAM,EAAE,KAAK,QAAQ,cAAc;EACnC,IAAI,UAAU,SAAS,OAAO,MAAM;EACpC,IAAI,IAAI,OAAO,UAAU;EACzB,KAAK,UAAU,kBAAkB,UAAU,UAAU;EACrD,IAAI,KAAK,UAAU,UAAU,OAAO,MAAM,aAAa;EACvD,IAAI,OAAO,SAAS,UAAU,UAAU,SAAS,OAAO,MAAM;EAC9D,IACE,OAAO,SAAS,cAChB,UAAU,oBAAoB,OAAO,iBAErC;EAEF,OAAO;CACT;AAEF;AAEA,SAAA,eACE,KACA,QACa;CACb,OAAA,kBAAA,kBAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MACL,IAAI,IACJ,IAAI,IACJ,QACA,KAAK,MAAM,IAAI,OAAO,GAAI,CAC5B;AACF;AAEA,SAAA,mBACE,IACA,IACA,QACA,aACa;CACb,MAAM,OAAO;EACX,UAAU;EACV;EACA,SAAS,OAAO;EAChB,OAAO,OAAO;CAChB;CACA,MAAM,OAAO,eAAe;CAC5B,QAAQ,OAAO,MAAf;EACE,KAAK,aACH,OAAO;GAAE,GAAG;GAAM;GAAM,MAAM;EAAY;EAC5C,KAAK,WACH,OAAO;GACL,GAAG;GACH,gBAAgB,OAAO,kBAAkB;GACzC;GACA,MAAM;EACR;EACF,KAAK,QACH,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO,QAAQ;GAAI;GAAM,MAAM;EAAO;EAChE,KAAK,YACH,OAAO;GACL,GAAG;GACH,iBAAiB,OAAO,mBAAmB;GAC3C;GACA,MAAM;EACR;CACJ;AACF;AAEA,SAAA,aACE,OACA,IACyB;CACzB,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,sBAAsB,IAAI,OAAO,GAAG,OAAO,KAAA;CACxD,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAAU,OAAO,KAAA;CAC9D,OAAA,kBAAA,kBAAO,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,KAAK,IAAI,OAAO;AAChD;AAEA,SAAA,cACE,OACA,WAA6B,CAAC,GACf;CACf,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,eAAe,SAAS,YAC1B,KAAK,OAAO,SAAS,UAAU,yBAAS,IAAI,KAAK,CAAC,EAAA,CAAG,QAAQ,IAAI,GAAI,IACrE;CACJ,MAAM,aAAa,SAAS,YACxB,KAAK,OACF,SAAS,UAAU,uBAAO,IAAI,KAAK,eAAe,EAAA,CAAG,QAAQ,IAAI,GACpE,IACA;CAEJ,MAAM,YAA2B,CAAC;CAClC,KAAK,MAAM,EAAE,KAAK,YAAA,kBAAA,kBAAY,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EAC/C,KAAK,OAAO,kBAAkB,UAAU,UAAU;EAClD,IAAI,SAAS,MAAM,IAAI,OAAO,SAAS,IAAI;EAC3C,IAAI,SAAS,QAAQ,OAAO,SAAS,SAAS,MAAM;EACpD,MAAM,cAAc,KAAK,MAAM,IAAI,OAAO,GAAI;EAC9C,IAAI,iBAAiB,QAAQ,cAAc,cAAc;EACzD,IAAI,eAAe,QAAQ,cAAc,YAAY;EACrD,UAAU,KAAA,kBAAA,kBAAK,MAAA,cAAA,CAAA,CAAA,KAAA,MAAuB,KAAK,MAAM,CAAC;CACpD;CACA,OAAO;AACT;AAEA,eAAA,gBACE,OACA,IAC6C;CAC7C,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,sBAAsB,IAAI,OAAO,GAAG,OAAO,EAAE,IAAI,MAAM;CACpE,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAC3C,OAAO,EAAE,IAAI,MAAM;CAErB,MAAM,WAAW,IAAI;CACrB,MAAM,KAAK,UAAU,KAAK,OAAO,EAAE;CACnC,OAAO;EAAE,IAAI;EAAM;CAAS;AAC9B;AAIA,SAAA,MAAM,MAA0B,SAAwC;CACtE,KAAK,UAAU,OAAO,KAAK,MAAM,OAAO;AAC1C;AAEA,SAAA,aAAa,QAAqC;CAChD,IAAI,CAAC,OAAO,SAAS;CACrB,kBAAA,kBAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,mBAAmB;EAC5B,UAAU,OAAO,SAAS;EAC1B,IAAI,OAAO,SAAS;CACtB,CAAC;AACH"}

package/dist/{scheduler-BGq6M5Kd.d.ts → scheduler-RdACNXDP.d.ts}

@@ -3,8 +3,8 @@ import {
   d as LifecycleRouteContext,
   s as LifecycleCapability,
   v as LifecycleJobOutcome
-} from "./capability-runner-BUBa6Ake.js";
-import { t as RetryOptions } from "./retries-D9B2UCq3.js";
+} from "./capability-runner-DBAnGr6L.js";
+import { t as RetryOptions } from "./retries-CV6AkXmQ.js";
 
 //#region src/schedules/types.d.ts
 /**
@@ -220,4 +220,4 @@ export {
   SchedulerCallbacks as s,
   Scheduler as t
 };
-//# sourceMappingURL=scheduler-BGq6M5Kd.d.ts.map
+//# sourceMappingURL=scheduler-RdACNXDP.d.ts.map

package/dist/schedules/index.d.ts

@@ -8,7 +8,7 @@ import {
   r as SchedulerOptions,
   s as SchedulerCallbacks,
   t as Scheduler
-} from "../scheduler-BGq6M5Kd.js";
+} from "../scheduler-RdACNXDP.js";
 export {
   type Schedule,
   type ScheduleCriteria,

package/dist/schedules/index.js

@@ -1,2 +1,2 @@
-import { t as Scheduler } from "../scheduler-D_KHqxBa.js";
+import { t as Scheduler } from "../scheduler-DZ3xQfeK.js";
 export { Scheduler };

package/dist/serializable.d.ts

@@ -1,4 +1,4 @@
-import { k as StreamingResponse } from "./agent-routing-B2XLNMxq.js";
+import { k as StreamingResponse } from "./agent-routing-0DR0Tk2v.js";
 
 //#region src/serializable.d.ts
 type SerializablePrimitive = undefined | null | string | number | boolean;