agents 0.27.0 → 0.28.0

package/dist/queue/index.d.ts

@@ -3,7 +3,7 @@ import {
   d as LifecycleRouteContext,
   s as LifecycleCapability,
   v as LifecycleJobOutcome
-} from "../capability-runner-O5VbQzqg.js";
+} from "../capability-runner-BiVUtjqC.js";
 import { t as RetryOptions } from "../retries-CV6AkXmQ.js";
 import {
   a as QueuePayload,

package/dist/queue/index.js

@@ -1,2 +1,2 @@
-import { t as Queue } from "../queue-BB-zfIYF.js";
+import { t as Queue } from "../queue-CcIjVYTE.js";
 export { Queue };

package/dist/{queue-BB-zfIYF.js → queue-CcIjVYTE.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 _classPrivateMethodInitSpec } from "./classPrivateMethodInitSpec-qMjJ6sHQ.js";
-import { t as LifecycleCapability } from "./capability-B4WbF81e.js";
+import { t as LifecycleCapability } from "./capability-DBAKc6UZ.js";
 import { isDurableObjectCodeUpdateReset, isPlatformFailure, resolveRetryConfig, tryN, validateRetryOptions } from "./retries.js";
 //#region src/queue/queue.ts
 /**
@@ -403,4 +403,4 @@ function _emit(type, payload) {
 //#endregion
 export { setQueueCallbackResolver as n, Queue as t };
 
-//# sourceMappingURL=queue-BB-zfIYF.js.map
+//# sourceMappingURL=queue-CcIjVYTE.js.map

package/dist/{queue-BB-zfIYF.js.map → queue-CcIjVYTE.js.map}

@@ -1 +1 @@
-{"version":3,"file":"queue-BB-zfIYF.js","names":[],"sources":["../src/queue/queue.ts"],"sourcesContent":["/**\n * Lifecycle background-work vocabulary. Queue validates items, resolves\n * named callbacks, and pushes jobs due immediately into the Lifecycle-owned\n * job queue; Lifecycle runs the alarm event loop, retry policy, and physical\n * alarm arming. Queue owns no storage of its own — each item is one job\n * whose `fn` is the callback name and whose payload carries the item's\n * payload and owner.\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 { QueueEventType, QueueOptions } from \"./options\";\nimport type {\n  QueueCallbacks,\n  QueueCriteria,\n  QueueHandlers,\n  QueueItem,\n  QueuePayload,\n  QueuePushOptions,\n  QueueStorageRow\n} from \"./types\";\n\n/** A resolved fallback handler for a callback name outside the registered map. */\ntype ResolvedQueueCallback = (\n  payload: unknown,\n  item: QueueItem<unknown>\n) => unknown;\n\nconst queueCallbackResolvers = new WeakMap<\n  object,\n  (name: string) => ResolvedQueueCallback | 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 queue\n * API (`this.queue(\"methodName\", payload)`) working: the resolver looks the\n * method up on the Agent, and the resolved handler still runs inside the\n * Lifecycle host boundary.\n */\nexport function setQueueCallbackResolver(\n  queue: Queue<never>,\n  resolver: (name: string) => ResolvedQueueCallback | undefined\n): void {\n  queueCallbackResolvers.set(queue, resolver);\n}\n\nconst QUEUE_SCHEMA_VERSION_KEY = \"cf_agents:queue_schema_version\";\n/** Version 1: queue items live in the Lifecycle job queue. */\nconst CURRENT_QUEUE_SCHEMA_VERSION = 1;\n\nconst DEFAULT_RETRY: Required<RetryOptions> = {\n  maxAttempts: 3,\n  baseDelayMs: 100,\n  maxDelayMs: 3000\n};\n\n/** What a Queue job's payload carries: the item payload and its owner. */\ntype QueueJobPayload = {\n  readonly payload: unknown;\n  readonly owner_path: string | null;\n  readonly owner_path_key: string | null;\n};\n\ntype QueueRouteMessage =\n  | {\n      readonly type: \"push\";\n      readonly callback: string;\n      readonly payload: unknown;\n      readonly options?: QueuePushOptions;\n    }\n  | { readonly type: \"get\" | \"cancel\"; readonly id: string }\n  | { readonly type: \"list\"; readonly criteria?: QueueCriteria }\n  | { readonly type: \"cancelAll\"; readonly callback?: string }\n  | {\n      readonly type: \"dispatch\";\n      readonly item: QueueItem<unknown>;\n    };\n\nfunction isQueueJobPayload(value: unknown): value is QueueJobPayload {\n  // `payload` is absent after a JSON round trip when the item carried none.\n  return typeof value === \"object\" && value !== null && \"owner_path\" in value;\n}\n\n/**\n * Durable background work for a Lifecycle Object.\n *\n * Register callbacks in the constructor and install the instance with\n * `Lifecycle.use()`. Each pushed item becomes a job due immediately in the\n * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm event\n * loop, drives items one at a time in push order, retries a throwing\n * callback per its retry policy, and Queue runs registered callbacks through\n * Lifecycle's host invocation boundary. An item that still fails after its\n * last attempt is dropped after `queue:error` and the `onError` hook.\n *\n * Items survive the Durable Object leaving memory: an isolate that dies mid\n * callback wakes again on the Lifecycle deadman alarm and resumes the queue.\n * Callbacks should therefore be idempotent.\n *\n * @experimental The API surface may change before stabilizing.\n */\nexport class Queue<\n  Handlers extends QueueHandlers = QueueCallbacks\n> extends LifecycleCapability {\n  readonly #handlers: QueueHandlers;\n  readonly #retryDefaults: Required<RetryOptions>;\n  readonly #onError: ((error: unknown) => void | Promise<void>) | undefined;\n  /**\n   * Last due time handed to a job. The Lifecycle driver dispatches due jobs\n   * in due-time order, so pushes get strictly increasing times to keep push\n   * order (FIFO) even within one millisecond. Seeded from the persisted\n   * queue tail on first use so a fresh instance never sorts a new item ahead\n   * of items an earlier instance already queued.\n   */\n  #lastTime: number | null = null;\n\n  /**\n   * Create a durable Queue.\n   *\n   * @param options - Registered callbacks plus optional retry and error\n   * policy. Registering `callbacks` types {@link push} against the map —\n   * names and payloads are checked where the handlers are declared and where\n   * they are pushed. Names outside the map are rejected unless a\n   * composition-root resolver supplies them — the internal aperture behind\n   * `Agent`'s name-based queue API.\n   */\n  constructor(options: QueueOptions<Handlers> = {}) {\n    super(\"queue\");\n    this.#handlers = options.callbacks ?? {};\n    // Retry defaults are resolved, not validated, here: invalid defaults\n    // surface per execution as queue:error instead of bricking the object at\n    // construction. Per-item retry overrides are validated when pushed.\n    this.#retryDefaults = resolveRetryConfig(options.retry, DEFAULT_RETRY);\n    this.#onError = options.onError;\n  }\n\n  // ── Lifecycle capability hooks ───────────────────────────────────────────\n\n  /** Migrate legacy `cf_agents_queues` rows into the Lifecycle job queue. */\n  async onStart(): Promise<void> {\n    const storage = this.lifecycle.storage;\n    const version = (await storage.get<number>(QUEUE_SCHEMA_VERSION_KEY)) ?? 0;\n    if (version >= CURRENT_QUEUE_SCHEMA_VERSION) return;\n\n    await this.#migrateLegacyQueueTable(storage);\n    await storage.put(QUEUE_SCHEMA_VERSION_KEY, CURRENT_QUEUE_SCHEMA_VERSION);\n  }\n\n  /**\n   * Move every `cf_agents_queues` row into the job queue and drop the\n   * table. Idempotent: a missing table means a fresh object or a completed\n   * migration. Rows keep their insertion order.\n   *\n   * TEMPORARY: one-shot upgrade path for objects that had queued items when\n   * this release landed. Remove in the next minor release (with the schema\n   * version bump that gates it), once every deployed object has migrated.\n   */\n  async #migrateLegacyQueueTable(storage: DurableObjectStorage): Promise<void> {\n    const tables = storage.sql\n      .exec(\n        \"SELECT name FROM sqlite_master WHERE type='table' AND name='cf_agents_queues'\"\n      )\n      .toArray();\n    if (tables.length === 0) return;\n\n    const rows = storage.sql\n      .exec(\"SELECT * FROM cf_agents_queues ORDER BY created_at ASC, rowid ASC\")\n      .toArray() as unknown as QueueStorageRow[];\n    for (const row of rows) {\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 queue item \"${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: this.#nextTime(),\n        payload: {\n          payload,\n          owner_path: null,\n          owner_path_key: null\n        } satisfies QueueJobPayload,\n        retry: resolveRetryConfig(retry, this.#retryDefaults)\n      });\n    }\n    storage.sql.exec(\"DROP TABLE cf_agents_queues\");\n  }\n\n  /** Drive one due item dispatched by the Lifecycle event loop. */\n  async onJob(\n    context: LifecycleJobContext\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job, attempt } = context;\n    if (!isQueueJobPayload(job.payload)) {\n      console.error(`Malformed queue item ${job.id}; dropping it`);\n      return undefined;\n    }\n    const item = this.#jobToItem(job, job.payload);\n\n    if (attempt > 1) {\n      this.#emit(\"queue: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 (job.payload.owner_path) {\n      // A routed item 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: job.payload.owner_path_key ?? job.payload.owner_path,\n            data: job.payload.owner_path\n          },\n          { type: \"dispatch\", item } satisfies QueueRouteMessage\n        );\n      } catch (error) {\n        if (isPlatformFailure(error)) {\n          // Preserve the item; Lifecycle defers platform-class failures to\n          // a fresh invocation or the memory-limit breaker.\n          throw error;\n        }\n        console.error(`error dispatching queue callback \"${job.fn}\"`, error);\n        this.#emit(\"queue: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 item 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 undefined;\n    }\n\n    const handler = this.#resolveCallback(job.fn);\n    if (!handler) {\n      console.error(`callback ${job.fn} not found`);\n      return undefined;\n    }\n    await this.lifecycle.runInHostContext(() => handler(item.payload, item));\n    return undefined;\n  }\n\n  /** Observe one item's terminal application failure; the item is dropped. */\n  async onJobError(\n    context: LifecycleJobContext,\n    error: unknown\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job } = context;\n    const { maxAttempts } = resolveRetryConfig(job.retry, this.#retryDefaults);\n    console.error(\n      `queue callback \"${job.fn}\" failed after ${maxAttempts} attempts`,\n      error\n    );\n    this.#emit(\"queue: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 undefined;\n  }\n\n  /** Handle Queue protocol messages routed by another Lifecycle. */\n  async onRoute(context: LifecycleRouteContext): Promise<unknown> {\n    const message = context.payload as QueueRouteMessage;\n    const owner = context.source ?? null;\n    switch (message.type) {\n      case \"push\":\n        return this.#insert(\n          owner,\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 \"cancelAll\":\n        return this.#cancelAllForOwner(owner, message.callback);\n      case \"dispatch\":\n        await this.#executeRouted(message.item);\n        return true;\n      default:\n        throw new Error(\"Unknown routed Queue message\");\n    }\n  }\n\n  /**\n   * Execute a routed item locally with the historical retry handling. Runs\n   * on the owning (facet) Queue, outside the root's event loop, so it applies\n   * its own in-process retry budget. Platform-class failures re-throw so the\n   * root preserves the item and the durable alarm retries on a fresh\n   * invocation.\n   */\n  async #executeRouted(item: QueueItem<unknown>): Promise<void> {\n    const handler = this.#resolveCallback(item.callback);\n    if (!handler) {\n      console.error(`callback ${item.callback} not found`);\n      return;\n    }\n    const { maxAttempts, baseDelayMs, maxDelayMs } = resolveRetryConfig(\n      item.retry,\n      this.#retryDefaults\n    );\n    try {\n      await tryN(\n        maxAttempts,\n        async (attempt) => {\n          if (attempt > 1) {\n            this.#emit(\"queue:retry\", {\n              callback: item.callback,\n              id: item.id,\n              attempt,\n              maxAttempts\n            });\n          }\n          await this.lifecycle.runInHostContext(() =>\n            handler(item.payload, item)\n          );\n        },\n        {\n          baseDelayMs,\n          maxDelayMs,\n          shouldRetry: (error) => !isDurableObjectCodeUpdateReset(error)\n        }\n      );\n    } catch (error) {\n      if (isPlatformFailure(error)) {\n        throw error;\n      }\n      console.error(\n        `queue callback \"${item.callback}\" failed after ${maxAttempts} attempts`,\n        error\n      );\n      this.#emit(\"queue:error\", {\n        callback: item.callback,\n        id: item.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  // ── Queue API ────────────────────────────────────────────────────────────\n\n  /**\n   * Push one item for a registered callback. The item is due immediately;\n   * the Lifecycle alarm event loop runs it in push order after this call\n   * returns.\n   *\n   * Once the Lifecycle has started (and this Queue is not routed through\n   * another Lifecycle), the item row is written synchronously before this\n   * method's promise is even returned, so a caller may pair a push with its\n   * own writes in one synchronous block — the item then commits atomically\n   * with them.\n   */\n  async push<Name extends keyof Handlers & string>(\n    callback: Name,\n    payload?: QueuePayload<Handlers[Name]>,\n    options?: QueuePushOptions\n  ): Promise<QueueItem<QueuePayload<Handlers[Name]>>> {\n    if (this.lifecycle.status() !== \"started\") await this.lifecycle.ready();\n    this.#validatePush(callback, options);\n    const item = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"push\",\n          callback,\n          payload,\n          options\n        } satisfies QueueRouteMessage)) as QueueItem<\n          QueuePayload<Handlers[Name]>\n        >)\n      : await this.#insert<QueuePayload<Handlers[Name]>>(\n          null,\n          callback,\n          payload,\n          options\n        );\n    this.#emit(\"queue:create\", { callback, id: item.id });\n    return item;\n  }\n\n  /** Cancel one pending item. Returns false when no item matched. */\n  async cancel(id: string): Promise<boolean> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"cancel\",\n        id\n      } satisfies QueueRouteMessage)) as boolean;\n    }\n    return this.#cancelForOwner(null, id);\n  }\n\n  /** Cancel every pending item, or every item for one callback. Returns the count. */\n  async cancelAll(callback?: string): Promise<number> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"cancelAll\",\n        callback\n      } satisfies QueueRouteMessage)) as number;\n    }\n    return this.#cancelAllForOwner(null, callback);\n  }\n\n  /** Read one pending item. */\n  async get<T = unknown>(id: string): Promise<QueueItem<T> | undefined> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"get\",\n        id\n      } satisfies QueueRouteMessage)) as QueueItem<T> | undefined;\n    }\n    return this.#getForOwner<T>(null, id);\n  }\n\n  /** List pending items in push order, optionally filtered by callback. */\n  async list<T = unknown>(criteria?: QueueCriteria): Promise<QueueItem<T>[]> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"list\",\n        criteria\n      } satisfies QueueRouteMessage)) as QueueItem<T>[];\n    }\n    return this.#listForOwner<T>(null, criteria);\n  }\n\n  // ── Internals ────────────────────────────────────────────────────────────\n\n  #validatePush(callback: string, options?: QueuePushOptions): 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 queue callback \"${callback}\": not registered on this Queue`\n      );\n    }\n    if (options?.retry)\n      validateRetryOptions(options.retry, this.#retryDefaults);\n    if (options?.id !== undefined && options.id.trim() === \"\") {\n      throw new Error(\"Queue item ids must be non-empty\");\n    }\n  }\n\n  /** Resolve a name to its registered or composition-root-supplied handler. */\n  #resolveCallback(name: string): ResolvedQueueCallback | 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 ResolvedQueueCallback;\n    }\n    return queueCallbackResolvers.get(this)?.(name);\n  }\n\n  #hasCallback(name: string): boolean {\n    return this.#resolveCallback(name) !== undefined;\n  }\n\n  /** The next strictly increasing due time, never before now. */\n  #nextTime(): number {\n    if (this.#lastTime === null) {\n      this.#lastTime = this.#ownedJobs().reduce(\n        (lastTime, { job }) => Math.max(lastTime, job.time),\n        0\n      );\n    }\n    const time = Math.max(Date.now(), this.#lastTime + 1);\n    this.#lastTime = time;\n    return time;\n  }\n\n  async #insert<T>(\n    owner: LifecycleRouteAddress | null,\n    callback: string,\n    payload: unknown,\n    options?: QueuePushOptions\n  ): Promise<QueueItem<T>> {\n    // A stable-id push replaces the item in place: it keeps the existing\n    // item's due time, and so its position in the queue.\n    const existing =\n      options?.id !== undefined\n        ? this.lifecycle.jobs.get(options.id)\n        : undefined;\n    const keepTime =\n      existing !== undefined &&\n      this.#getForOwner(owner, existing.id) !== undefined;\n    const job = await this.lifecycle.jobs.push({\n      id: options?.id,\n      fn: callback,\n      time: keepTime ? existing.time : this.#nextTime(),\n      payload: {\n        payload,\n        owner_path: owner?.data ?? null,\n        owner_path_key: owner?.key ?? null\n      } satisfies QueueJobPayload,\n      retry: resolveRetryConfig(options?.retry, this.#retryDefaults)\n    });\n    return this.#jobToItem<T>(job, job.payload as QueueJobPayload);\n  }\n\n  #jobToItem<T>(job: LifecycleJob, envelope: QueueJobPayload): QueueItem<T> {\n    return {\n      id: job.id,\n      callback: job.fn,\n      payload: envelope.payload as T,\n      createdAt: job.createdAt,\n      retry: job.retry\n    };\n  }\n\n  /** Every queue job this Queue owns, in push order. */\n  #ownedJobs(): Array<{ job: LifecycleJob; envelope: QueueJobPayload }> {\n    const owned: Array<{ job: LifecycleJob; envelope: QueueJobPayload }> = [];\n    for (const job of this.lifecycle.jobs.list()) {\n      if (isQueueJobPayload(job.payload)) {\n        owned.push({ job, envelope: job.payload });\n      }\n    }\n    return owned;\n  }\n\n  #getForOwner<T>(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): QueueItem<T> | undefined {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isQueueJobPayload(job.payload)) return undefined;\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) return undefined;\n    return this.#jobToItem<T>(job, job.payload);\n  }\n\n  #listForOwner<T>(\n    owner: LifecycleRouteAddress | null,\n    criteria: QueueCriteria = {}\n  ): QueueItem<T>[] {\n    const ownerKey = owner?.key ?? null;\n    const items: QueueItem<T>[] = [];\n    for (const { job, envelope } of this.#ownedJobs()) {\n      if ((envelope.owner_path_key ?? null) !== ownerKey) continue;\n      if (criteria.callback && job.fn !== criteria.callback) continue;\n      items.push(this.#jobToItem<T>(job, envelope));\n    }\n    return items;\n  }\n\n  async #cancelForOwner(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Promise<boolean> {\n    if (!this.#getForOwner(owner, id)) return false;\n    return this.lifecycle.jobs.cancel(id);\n  }\n\n  async #cancelAllForOwner(\n    owner: LifecycleRouteAddress | null,\n    callback?: string\n  ): Promise<number> {\n    let cancelled = 0;\n    for (const item of this.#listForOwner(owner, { callback })) {\n      if (await this.lifecycle.jobs.cancel(item.id)) cancelled++;\n    }\n    return cancelled;\n  }\n\n  /** @internal Remove items owned by one routed Lifecycle subtree. */\n  async __DO_NOT_USE_WILL_BREAK__cleanupRoutePrefix(\n    prefix: string\n  ): Promise<void> {\n    for (const { job, envelope } of this.#ownedJobs()) {\n      const ownerKey = envelope.owner_path_key ?? envelope.owner_path;\n      if (!envelope.owner_path || ownerKey === null) continue;\n      if (ownerKey !== prefix && !ownerKey.startsWith(`${prefix}/`)) continue;\n      await this.lifecycle.jobs.cancel(job.id);\n    }\n  }\n\n  // ── Events ───────────────────────────────────────────────────────────────\n\n  #emit(type: QueueEventType, payload: Record<string, unknown>): void {\n    this.lifecycle.events.emit(type, payload);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AA4CA,MAAM,yCAAyB,IAAI,QAGjC;;;;;;;;AASF,SAAgB,yBACd,OACA,UACM;CACN,uBAAuB,IAAI,OAAO,QAAQ;AAC5C;AAEA,MAAM,2BAA2B;;AAEjC,MAAM,+BAA+B;AAErC,MAAM,gBAAwC;CAC5C,aAAa;CACb,aAAa;CACb,YAAY;AACd;AAwBA,SAAS,kBAAkB,OAA0C;CAEnE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,gBAAgB;AACxE;;;;;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,QAAb,cAEU,oBAAoB;;;;;;;;;;;CAuB5B,YAAY,UAAkC,CAAC,GAAG;EAChD,MAAM,OAAO;;;;;8CAbY,IAAA;EAczB,uBAAA,WAAA,MAAiB,QAAQ,aAAa,CAAC,CAAA;EAIvC,uBAAA,gBAAA,MAAsB,mBAAmB,QAAQ,OAAO,aAAa,CAAA;EACrE,uBAAA,UAAA,MAAgB,QAAQ,OAAA;CAC1B;;CAKA,MAAM,UAAyB;EAC7B,MAAM,UAAU,KAAK,UAAU;EAE/B,KADiB,MAAM,QAAQ,IAAY,wBAAwB,KAAM,MAC1D,8BAA8B;EAE7C,MAAA,kBAAA,cAAM,MAAA,wBAAA,CAAA,CAAA,KAAA,MAA8B,OAAO;EAC3C,MAAM,QAAQ,IAAI,0BAA0B,4BAA4B;CAC1E;;CA4DA,MAAM,MACJ,SACqC;EACrC,MAAM,EAAE,KAAK,YAAY;EACzB,IAAI,CAAC,kBAAkB,IAAI,OAAO,GAAG;GACnC,QAAQ,MAAM,wBAAwB,IAAI,GAAG,cAAc;GAC3D;EACF;EACA,MAAM,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAgB,KAAK,IAAI,OAAO;EAE7C,IAAI,UAAU,GACZ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,UAAU,IAAI;GACd,IAAI,IAAI;GACR;GACA,aAAa,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB,CAAC,CAC5D;EACL,CAAC;EAGH,IAAI,IAAI,QAAQ,YAAY;GAG1B,IAAI;IACF,MAAM,KAAK,UAAU,OAAO,GAC1B;KACE,KAAK,IAAI,QAAQ,kBAAkB,IAAI,QAAQ;KAC/C,MAAM,IAAI,QAAQ;IACpB,GACA;KAAE,MAAM;KAAY;IAAK,CAC3B;GACF,SAAS,OAAO;IACd,IAAI,kBAAkB,KAAK,GAGzB,MAAM;IAER,QAAQ,MAAM,qCAAqC,IAAI,GAAG,IAAI,KAAK;IACnE,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;KACxB,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;EACF;EAEA,MAAM,UAAA,kBAAA,cAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,EAAE;EAC5C,IAAI,CAAC,SAAS;GACZ,QAAQ,MAAM,YAAY,IAAI,GAAG,WAAW;GAC5C;EACF;EACA,MAAM,KAAK,UAAU,uBAAuB,QAAQ,KAAK,SAAS,IAAI,CAAC;CAEzE;;CAGA,MAAM,WACJ,SACA,OACqC;EACrC,MAAM,EAAE,QAAQ;EAChB,MAAM,EAAE,gBAAgB,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACzE,QAAQ,MACN,mBAAmB,IAAI,GAAG,iBAAiB,YAAY,YACvD,KACF;EACA,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,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;CAEF;;CAGA,MAAM,QAAQ,SAAkD;EAC9D,MAAM,UAAU,QAAQ;EACxB,MAAM,QAAQ,QAAQ,UAAU;EAChC,QAAQ,QAAQ,MAAhB;GACE,KAAK,QACH,OAAA,kBAAA,cAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,OACH,OAAA,kBAAA,cAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,QAAQ,EAAE;GAC5C,KAAK,QACH,OAAA,kBAAA,cAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,QAAQ,QAAQ;GACnD,KAAK,UACH,OAAA,kBAAA,cAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,OAAO,QAAQ,EAAE;GAC/C,KAAK,aACH,OAAA,kBAAA,cAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,OAAO,QAAQ,QAAQ;GACxD,KAAK;IACH,MAAA,kBAAA,cAAM,MAAA,cAAA,CAAA,CAAA,KAAA,MAAoB,QAAQ,IAAI;IACtC,OAAO;GACT,SACE,MAAM,IAAI,MAAM,8BAA8B;EAClD;CACF;;;;;;;;;;;;CA4EA,MAAM,KACJ,UACA,SACA,SACkD;EAClD,IAAI,KAAK,UAAU,OAAO,MAAM,WAAW,MAAM,KAAK,UAAU,MAAM;EACtE,kBAAA,cAAA,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,UAAU,OAAO;EACpC,MAAM,OAAO,KAAK,UAAU,OAAO,SAC7B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;EACF,CAA6B,IAG7B,MAAA,kBAAA,cAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,UACA,SACA,OACF;EACJ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,gBAAgB;GAAE;GAAU,IAAI,KAAK;EAAG,CAAC;EACpD,OAAO;CACT;;CAGA,MAAM,OAAO,IAA8B;EACzC,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;CACtC;;CAGA,MAAM,UAAU,UAAoC;EAClD,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM,QAAQ;CAC/C;;CAGA,MAAM,IAAiB,IAA+C;EACpE,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;CACtC;;CAGA,MAAM,KAAkB,UAAmD;EACzE,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAsB,MAAM,QAAQ;CAC7C;;CAgJA,MAAM,4CACJ,QACe;EACf,KAAK,MAAM,EAAE,KAAK,cAAA,kBAAA,cAAc,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;GACjD,MAAM,WAAW,SAAS,kBAAkB,SAAS;GACrD,IAAI,CAAC,SAAS,cAAc,aAAa,MAAM;GAC/C,IAAI,aAAa,UAAU,CAAC,SAAS,WAAW,GAAG,OAAO,EAAE,GAAG;GAC/D,MAAM,KAAK,UAAU,KAAK,OAAO,IAAI,EAAE;EACzC;CACF;AAOF;;;;;;;;;;AAzdE,eAAA,yBAA+B,SAA8C;CAM3E,IALe,QAAQ,IACpB,KACC,+EACF,CAAC,CACA,QACM,CAAC,CAAC,WAAW,GAAG;CAEzB,MAAM,OAAO,QAAQ,IAClB,KAAK,mEAAmE,CAAC,CACzE,QAAQ;CACX,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI;EACJ,IAAI;GACF,UACE,OAAO,IAAI,YAAY,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAA;EAChE,SAAS,OAAO;GACd,QAAQ,MACN,wBAAwB,IAAI,GAAG,8DAE/B,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,MAAA,kBAAA,cAAM,MAAA,SAAA,CAAA,CAAA,KAAA,IAAe;GACrB,SAAS;IACP;IACA,YAAY;IACZ,gBAAgB;GAClB;GACA,OAAO,mBAAmB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACtD,CAAC;CACH;CACA,QAAQ,IAAI,KAAK,6BAA6B;AAChD;;;;;;;;AAgIA,eAAA,eAAqB,MAAyC;CAC5D,MAAM,UAAA,kBAAA,cAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,KAAK,QAAQ;CACnD,IAAI,CAAC,SAAS;EACZ,QAAQ,MAAM,YAAY,KAAK,SAAS,WAAW;EACnD;CACF;CACA,MAAM,EAAE,aAAa,aAAa,eAAe,mBAC/C,KAAK,OAAA,uBAAA,gBACL,IAAA,CACF;CACA,IAAI;EACF,MAAM,KACJ,aACA,OAAO,YAAY;GACjB,IAAI,UAAU,GACZ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;IACxB,UAAU,KAAK;IACf,IAAI,KAAK;IACT;IACA;GACF,CAAC;GAEH,MAAM,KAAK,UAAU,uBACnB,QAAQ,KAAK,SAAS,IAAI,CAC5B;EACF,GACA;GACE;GACA;GACA,cAAc,UAAU,CAAC,+BAA+B,KAAK;EAC/D,CACF;CACF,SAAS,OAAO;EACd,IAAI,kBAAkB,KAAK,GACzB,MAAM;EAER,QAAQ,MACN,mBAAmB,KAAK,SAAS,iBAAiB,YAAY,YAC9D,KACF;EACA,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,UAAU,KAAK;GACf,IAAI,KAAK;GACT,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;AA2FA,SAAA,cAAc,UAAkB,SAAkC;CAChE,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,cAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,2BAA2B,SAAS,gCACtC;CAEF,IAAI,SAAS,OACX,qBAAqB,QAAQ,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CACzD,IAAI,SAAS,OAAO,KAAA,KAAa,QAAQ,GAAG,KAAK,MAAM,IACrD,MAAM,IAAI,MAAM,kCAAkC;AAEtD;;AAGA,SAAA,iBAAiB,MAAiD;CAChE,MAAM,UAAA,uBAAA,WAAU,IAAA,CAAA,CAAe;CAC/B,IAAI,SAIF,OAAO;CAET,OAAO,uBAAuB,IAAI,IAAI,CAAC,GAAG,IAAI;AAChD;AAEA,SAAA,aAAa,MAAuB;CAClC,OAAA,kBAAA,cAAO,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,MAAM,KAAA;AACzC;;AAGA,SAAA,YAAoB;CAClB,IAAA,uBAAA,WAAI,IAAA,MAAmB,MACrB,uBAAA,WAAA,MAAA,kBAAA,cAAiB,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,CAAC,CAAC,QAChC,UAAU,EAAE,UAAU,KAAK,IAAI,UAAU,IAAI,IAAI,GAClD,CACF,CAAA;CAEF,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,GAAA,uBAAA,WAAG,IAAA,IAAiB,CAAC;CACpD,uBAAA,WAAA,MAAiB,IAAA;CACjB,OAAO;AACT;AAEA,eAAA,QACE,OACA,UACA,SACA,SACuB;CAGvB,MAAM,WACJ,SAAS,OAAO,KAAA,IACZ,KAAK,UAAU,KAAK,IAAI,QAAQ,EAAE,IAClC,KAAA;CACN,MAAM,WACJ,aAAa,KAAA,KAAA,kBAAA,cACb,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,SAAS,EAAE,MAAM,KAAA;CAC5C,MAAM,MAAM,MAAM,KAAK,UAAU,KAAK,KAAK;EACzC,IAAI,SAAS;EACb,IAAI;EACJ,MAAM,WAAW,SAAS,OAAA,kBAAA,cAAO,MAAA,SAAA,CAAA,CAAA,KAAA,IAAe;EAChD,SAAS;GACP;GACA,YAAY,OAAO,QAAQ;GAC3B,gBAAgB,OAAO,OAAO;EAChC;EACA,OAAO,mBAAmB,SAAS,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CAC/D,CAAC;CACD,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,IAAI,OAA0B;AAC/D;AAEA,SAAA,WAAc,KAAmB,UAAyC;CACxE,OAAO;EACL,IAAI,IAAI;EACR,UAAU,IAAI;EACd,SAAS,SAAS;EAClB,WAAW,IAAI;EACf,OAAO,IAAI;CACb;AACF;;AAGA,SAAA,aAAsE;CACpE,MAAM,QAAiE,CAAC;CACxE,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,GACzC,IAAI,kBAAkB,IAAI,OAAO,GAC/B,MAAM,KAAK;EAAE;EAAK,UAAU,IAAI;CAAQ,CAAC;CAG7C,OAAO;AACT;AAEA,SAAA,aACE,OACA,IAC0B;CAC1B,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,kBAAkB,IAAI,OAAO,GAAG,OAAO,KAAA;CACpD,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAAU,OAAO,KAAA;CAC9D,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,IAAI,OAAO;AAC5C;AAEA,SAAA,cACE,OACA,WAA0B,CAAC,GACX;CAChB,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,QAAwB,CAAC;CAC/B,KAAK,MAAM,EAAE,KAAK,cAAA,kBAAA,cAAc,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EACjD,KAAK,SAAS,kBAAkB,UAAU,UAAU;EACpD,IAAI,SAAS,YAAY,IAAI,OAAO,SAAS,UAAU;EACvD,MAAM,KAAA,kBAAA,cAAK,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,QAAQ,CAAC;CAC9C;CACA,OAAO;AACT;AAEA,eAAA,gBACE,OACA,IACkB;CAClB,IAAI,CAAA,kBAAA,cAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,EAAE,GAAG,OAAO;CAC1C,OAAO,KAAK,UAAU,KAAK,OAAO,EAAE;AACtC;AAEA,eAAA,mBACE,OACA,UACiB;CACjB,IAAI,YAAY;CAChB,KAAK,MAAM,QAAA,kBAAA,cAAQ,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,EAAE,SAAS,CAAC,GACvD,IAAI,MAAM,KAAK,UAAU,KAAK,OAAO,KAAK,EAAE,GAAG;CAEjD,OAAO;AACT;AAgBA,SAAA,MAAM,MAAsB,SAAwC;CAClE,KAAK,UAAU,OAAO,KAAK,MAAM,OAAO;AAC1C"}
+{"version":3,"file":"queue-CcIjVYTE.js","names":[],"sources":["../src/queue/queue.ts"],"sourcesContent":["/**\n * Lifecycle background-work vocabulary. Queue validates items, resolves\n * named callbacks, and pushes jobs due immediately into the Lifecycle-owned\n * job queue; Lifecycle runs the alarm event loop, retry policy, and physical\n * alarm arming. Queue owns no storage of its own — each item is one job\n * whose `fn` is the callback name and whose payload carries the item's\n * payload and owner.\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 { QueueEventType, QueueOptions } from \"./options\";\nimport type {\n  QueueCallbacks,\n  QueueCriteria,\n  QueueHandlers,\n  QueueItem,\n  QueuePayload,\n  QueuePushOptions,\n  QueueStorageRow\n} from \"./types\";\n\n/** A resolved fallback handler for a callback name outside the registered map. */\ntype ResolvedQueueCallback = (\n  payload: unknown,\n  item: QueueItem<unknown>\n) => unknown;\n\nconst queueCallbackResolvers = new WeakMap<\n  object,\n  (name: string) => ResolvedQueueCallback | 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 queue\n * API (`this.queue(\"methodName\", payload)`) working: the resolver looks the\n * method up on the Agent, and the resolved handler still runs inside the\n * Lifecycle host boundary.\n */\nexport function setQueueCallbackResolver(\n  queue: Queue<never>,\n  resolver: (name: string) => ResolvedQueueCallback | undefined\n): void {\n  queueCallbackResolvers.set(queue, resolver);\n}\n\nconst QUEUE_SCHEMA_VERSION_KEY = \"cf_agents:queue_schema_version\";\n/** Version 1: queue items live in the Lifecycle job queue. */\nconst CURRENT_QUEUE_SCHEMA_VERSION = 1;\n\nconst DEFAULT_RETRY: Required<RetryOptions> = {\n  maxAttempts: 3,\n  baseDelayMs: 100,\n  maxDelayMs: 3000\n};\n\n/** What a Queue job's payload carries: the item payload and its owner. */\ntype QueueJobPayload = {\n  readonly payload: unknown;\n  readonly owner_path: string | null;\n  readonly owner_path_key: string | null;\n};\n\ntype QueueRouteMessage =\n  | {\n      readonly type: \"push\";\n      readonly callback: string;\n      readonly payload: unknown;\n      readonly options?: QueuePushOptions;\n    }\n  | { readonly type: \"get\" | \"cancel\"; readonly id: string }\n  | { readonly type: \"list\"; readonly criteria?: QueueCriteria }\n  | { readonly type: \"cancelAll\"; readonly callback?: string }\n  | {\n      readonly type: \"dispatch\";\n      readonly item: QueueItem<unknown>;\n    };\n\nfunction isQueueJobPayload(value: unknown): value is QueueJobPayload {\n  // `payload` is absent after a JSON round trip when the item carried none.\n  return typeof value === \"object\" && value !== null && \"owner_path\" in value;\n}\n\n/**\n * Durable background work for a Lifecycle Object.\n *\n * Register callbacks in the constructor and install the instance with\n * `Lifecycle.use()`. Each pushed item becomes a job due immediately in the\n * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm event\n * loop, drives items one at a time in push order, retries a throwing\n * callback per its retry policy, and Queue runs registered callbacks through\n * Lifecycle's host invocation boundary. An item that still fails after its\n * last attempt is dropped after `queue:error` and the `onError` hook.\n *\n * Items survive the Durable Object leaving memory: an isolate that dies mid\n * callback wakes again on the Lifecycle deadman alarm and resumes the queue.\n * Callbacks should therefore be idempotent.\n *\n * @experimental The API surface may change before stabilizing.\n */\nexport class Queue<\n  Handlers extends QueueHandlers = QueueCallbacks\n> extends LifecycleCapability {\n  readonly #handlers: QueueHandlers;\n  readonly #retryDefaults: Required<RetryOptions>;\n  readonly #onError: ((error: unknown) => void | Promise<void>) | undefined;\n  /**\n   * Last due time handed to a job. The Lifecycle driver dispatches due jobs\n   * in due-time order, so pushes get strictly increasing times to keep push\n   * order (FIFO) even within one millisecond. Seeded from the persisted\n   * queue tail on first use so a fresh instance never sorts a new item ahead\n   * of items an earlier instance already queued.\n   */\n  #lastTime: number | null = null;\n\n  /**\n   * Create a durable Queue.\n   *\n   * @param options - Registered callbacks plus optional retry and error\n   * policy. Registering `callbacks` types {@link push} against the map —\n   * names and payloads are checked where the handlers are declared and where\n   * they are pushed. Names outside the map are rejected unless a\n   * composition-root resolver supplies them — the internal aperture behind\n   * `Agent`'s name-based queue API.\n   */\n  constructor(options: QueueOptions<Handlers> = {}) {\n    super(\"queue\");\n    this.#handlers = options.callbacks ?? {};\n    // Retry defaults are resolved, not validated, here: invalid defaults\n    // surface per execution as queue:error instead of bricking the object at\n    // construction. Per-item retry overrides are validated when pushed.\n    this.#retryDefaults = resolveRetryConfig(options.retry, DEFAULT_RETRY);\n    this.#onError = options.onError;\n  }\n\n  // ── Lifecycle capability hooks ───────────────────────────────────────────\n\n  /** Migrate legacy `cf_agents_queues` rows into the Lifecycle job queue. */\n  async onStart(): Promise<void> {\n    const storage = this.lifecycle.storage;\n    const version = (await storage.get<number>(QUEUE_SCHEMA_VERSION_KEY)) ?? 0;\n    if (version >= CURRENT_QUEUE_SCHEMA_VERSION) return;\n\n    await this.#migrateLegacyQueueTable(storage);\n    await storage.put(QUEUE_SCHEMA_VERSION_KEY, CURRENT_QUEUE_SCHEMA_VERSION);\n  }\n\n  /**\n   * Move every `cf_agents_queues` row into the job queue and drop the\n   * table. Idempotent: a missing table means a fresh object or a completed\n   * migration. Rows keep their insertion order.\n   *\n   * TEMPORARY: one-shot upgrade path for objects that had queued items when\n   * this release landed. Remove in the next minor release (with the schema\n   * version bump that gates it), once every deployed object has migrated.\n   */\n  async #migrateLegacyQueueTable(storage: DurableObjectStorage): Promise<void> {\n    const tables = storage.sql\n      .exec(\n        \"SELECT name FROM sqlite_master WHERE type='table' AND name='cf_agents_queues'\"\n      )\n      .toArray();\n    if (tables.length === 0) return;\n\n    const rows = storage.sql\n      .exec(\"SELECT * FROM cf_agents_queues ORDER BY created_at ASC, rowid ASC\")\n      .toArray() as unknown as QueueStorageRow[];\n    for (const row of rows) {\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 queue item \"${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: this.#nextTime(),\n        payload: {\n          payload,\n          owner_path: null,\n          owner_path_key: null\n        } satisfies QueueJobPayload,\n        retry: resolveRetryConfig(retry, this.#retryDefaults)\n      });\n    }\n    storage.sql.exec(\"DROP TABLE cf_agents_queues\");\n  }\n\n  /** Drive one due item dispatched by the Lifecycle event loop. */\n  async onJob(\n    context: LifecycleJobContext\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job, attempt } = context;\n    if (!isQueueJobPayload(job.payload)) {\n      console.error(`Malformed queue item ${job.id}; dropping it`);\n      return undefined;\n    }\n    const item = this.#jobToItem(job, job.payload);\n\n    if (attempt > 1) {\n      this.#emit(\"queue: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 (job.payload.owner_path) {\n      // A routed item 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: job.payload.owner_path_key ?? job.payload.owner_path,\n            data: job.payload.owner_path\n          },\n          { type: \"dispatch\", item } satisfies QueueRouteMessage\n        );\n      } catch (error) {\n        if (isPlatformFailure(error)) {\n          // Preserve the item; Lifecycle defers platform-class failures to\n          // a fresh invocation or the memory-limit breaker.\n          throw error;\n        }\n        console.error(`error dispatching queue callback \"${job.fn}\"`, error);\n        this.#emit(\"queue: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 item 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 undefined;\n    }\n\n    const handler = this.#resolveCallback(job.fn);\n    if (!handler) {\n      console.error(`callback ${job.fn} not found`);\n      return undefined;\n    }\n    await this.lifecycle.runInHostContext(() => handler(item.payload, item));\n    return undefined;\n  }\n\n  /** Observe one item's terminal application failure; the item is dropped. */\n  async onJobError(\n    context: LifecycleJobContext,\n    error: unknown\n  ): Promise<LifecycleJobOutcome | void> {\n    const { job } = context;\n    const { maxAttempts } = resolveRetryConfig(job.retry, this.#retryDefaults);\n    console.error(\n      `queue callback \"${job.fn}\" failed after ${maxAttempts} attempts`,\n      error\n    );\n    this.#emit(\"queue: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 undefined;\n  }\n\n  /** Handle Queue protocol messages routed by another Lifecycle. */\n  async onRoute(context: LifecycleRouteContext): Promise<unknown> {\n    const message = context.payload as QueueRouteMessage;\n    const owner = context.source ?? null;\n    switch (message.type) {\n      case \"push\":\n        return this.#insert(\n          owner,\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 \"cancelAll\":\n        return this.#cancelAllForOwner(owner, message.callback);\n      case \"dispatch\":\n        await this.#executeRouted(message.item);\n        return true;\n      default:\n        throw new Error(\"Unknown routed Queue message\");\n    }\n  }\n\n  /**\n   * Execute a routed item locally with the historical retry handling. Runs\n   * on the owning (facet) Queue, outside the root's event loop, so it applies\n   * its own in-process retry budget. Platform-class failures re-throw so the\n   * root preserves the item and the durable alarm retries on a fresh\n   * invocation.\n   */\n  async #executeRouted(item: QueueItem<unknown>): Promise<void> {\n    const handler = this.#resolveCallback(item.callback);\n    if (!handler) {\n      console.error(`callback ${item.callback} not found`);\n      return;\n    }\n    const { maxAttempts, baseDelayMs, maxDelayMs } = resolveRetryConfig(\n      item.retry,\n      this.#retryDefaults\n    );\n    try {\n      await tryN(\n        maxAttempts,\n        async (attempt) => {\n          if (attempt > 1) {\n            this.#emit(\"queue:retry\", {\n              callback: item.callback,\n              id: item.id,\n              attempt,\n              maxAttempts\n            });\n          }\n          await this.lifecycle.runInHostContext(() =>\n            handler(item.payload, item)\n          );\n        },\n        {\n          baseDelayMs,\n          maxDelayMs,\n          shouldRetry: (error) => !isDurableObjectCodeUpdateReset(error)\n        }\n      );\n    } catch (error) {\n      if (isPlatformFailure(error)) {\n        throw error;\n      }\n      console.error(\n        `queue callback \"${item.callback}\" failed after ${maxAttempts} attempts`,\n        error\n      );\n      this.#emit(\"queue:error\", {\n        callback: item.callback,\n        id: item.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  // ── Queue API ────────────────────────────────────────────────────────────\n\n  /**\n   * Push one item for a registered callback. The item is due immediately;\n   * the Lifecycle alarm event loop runs it in push order after this call\n   * returns.\n   *\n   * Once the Lifecycle has started (and this Queue is not routed through\n   * another Lifecycle), the item row is written synchronously before this\n   * method's promise is even returned, so a caller may pair a push with its\n   * own writes in one synchronous block — the item then commits atomically\n   * with them.\n   */\n  async push<Name extends keyof Handlers & string>(\n    callback: Name,\n    payload?: QueuePayload<Handlers[Name]>,\n    options?: QueuePushOptions\n  ): Promise<QueueItem<QueuePayload<Handlers[Name]>>> {\n    if (this.lifecycle.status() !== \"started\") await this.lifecycle.ready();\n    this.#validatePush(callback, options);\n    const item = this.lifecycle.routes.source\n      ? ((await this.lifecycle.routes.toRoot({\n          type: \"push\",\n          callback,\n          payload,\n          options\n        } satisfies QueueRouteMessage)) as QueueItem<\n          QueuePayload<Handlers[Name]>\n        >)\n      : await this.#insert<QueuePayload<Handlers[Name]>>(\n          null,\n          callback,\n          payload,\n          options\n        );\n    this.#emit(\"queue:create\", { callback, id: item.id });\n    return item;\n  }\n\n  /** Cancel one pending item. Returns false when no item matched. */\n  async cancel(id: string): Promise<boolean> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"cancel\",\n        id\n      } satisfies QueueRouteMessage)) as boolean;\n    }\n    return this.#cancelForOwner(null, id);\n  }\n\n  /** Cancel every pending item, or every item for one callback. Returns the count. */\n  async cancelAll(callback?: string): Promise<number> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"cancelAll\",\n        callback\n      } satisfies QueueRouteMessage)) as number;\n    }\n    return this.#cancelAllForOwner(null, callback);\n  }\n\n  /** Read one pending item. */\n  async get<T = unknown>(id: string): Promise<QueueItem<T> | undefined> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"get\",\n        id\n      } satisfies QueueRouteMessage)) as QueueItem<T> | undefined;\n    }\n    return this.#getForOwner<T>(null, id);\n  }\n\n  /** List pending items in push order, optionally filtered by callback. */\n  async list<T = unknown>(criteria?: QueueCriteria): Promise<QueueItem<T>[]> {\n    await this.lifecycle.ready();\n    if (this.lifecycle.routes.source) {\n      return (await this.lifecycle.routes.toRoot({\n        type: \"list\",\n        criteria\n      } satisfies QueueRouteMessage)) as QueueItem<T>[];\n    }\n    return this.#listForOwner<T>(null, criteria);\n  }\n\n  // ── Internals ────────────────────────────────────────────────────────────\n\n  #validatePush(callback: string, options?: QueuePushOptions): 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 queue callback \"${callback}\": not registered on this Queue`\n      );\n    }\n    if (options?.retry)\n      validateRetryOptions(options.retry, this.#retryDefaults);\n    if (options?.id !== undefined && options.id.trim() === \"\") {\n      throw new Error(\"Queue item ids must be non-empty\");\n    }\n  }\n\n  /** Resolve a name to its registered or composition-root-supplied handler. */\n  #resolveCallback(name: string): ResolvedQueueCallback | 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 ResolvedQueueCallback;\n    }\n    return queueCallbackResolvers.get(this)?.(name);\n  }\n\n  #hasCallback(name: string): boolean {\n    return this.#resolveCallback(name) !== undefined;\n  }\n\n  /** The next strictly increasing due time, never before now. */\n  #nextTime(): number {\n    if (this.#lastTime === null) {\n      this.#lastTime = this.#ownedJobs().reduce(\n        (lastTime, { job }) => Math.max(lastTime, job.time),\n        0\n      );\n    }\n    const time = Math.max(Date.now(), this.#lastTime + 1);\n    this.#lastTime = time;\n    return time;\n  }\n\n  async #insert<T>(\n    owner: LifecycleRouteAddress | null,\n    callback: string,\n    payload: unknown,\n    options?: QueuePushOptions\n  ): Promise<QueueItem<T>> {\n    // A stable-id push replaces the item in place: it keeps the existing\n    // item's due time, and so its position in the queue.\n    const existing =\n      options?.id !== undefined\n        ? this.lifecycle.jobs.get(options.id)\n        : undefined;\n    const keepTime =\n      existing !== undefined &&\n      this.#getForOwner(owner, existing.id) !== undefined;\n    const job = await this.lifecycle.jobs.push({\n      id: options?.id,\n      fn: callback,\n      time: keepTime ? existing.time : this.#nextTime(),\n      payload: {\n        payload,\n        owner_path: owner?.data ?? null,\n        owner_path_key: owner?.key ?? null\n      } satisfies QueueJobPayload,\n      retry: resolveRetryConfig(options?.retry, this.#retryDefaults)\n    });\n    return this.#jobToItem<T>(job, job.payload as QueueJobPayload);\n  }\n\n  #jobToItem<T>(job: LifecycleJob, envelope: QueueJobPayload): QueueItem<T> {\n    return {\n      id: job.id,\n      callback: job.fn,\n      payload: envelope.payload as T,\n      createdAt: job.createdAt,\n      retry: job.retry\n    };\n  }\n\n  /** Every queue job this Queue owns, in push order. */\n  #ownedJobs(): Array<{ job: LifecycleJob; envelope: QueueJobPayload }> {\n    const owned: Array<{ job: LifecycleJob; envelope: QueueJobPayload }> = [];\n    for (const job of this.lifecycle.jobs.list()) {\n      if (isQueueJobPayload(job.payload)) {\n        owned.push({ job, envelope: job.payload });\n      }\n    }\n    return owned;\n  }\n\n  #getForOwner<T>(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): QueueItem<T> | undefined {\n    const ownerKey = owner?.key ?? null;\n    const job = this.lifecycle.jobs.get(id);\n    if (!job || !isQueueJobPayload(job.payload)) return undefined;\n    if ((job.payload.owner_path_key ?? null) !== ownerKey) return undefined;\n    return this.#jobToItem<T>(job, job.payload);\n  }\n\n  #listForOwner<T>(\n    owner: LifecycleRouteAddress | null,\n    criteria: QueueCriteria = {}\n  ): QueueItem<T>[] {\n    const ownerKey = owner?.key ?? null;\n    const items: QueueItem<T>[] = [];\n    for (const { job, envelope } of this.#ownedJobs()) {\n      if ((envelope.owner_path_key ?? null) !== ownerKey) continue;\n      if (criteria.callback && job.fn !== criteria.callback) continue;\n      items.push(this.#jobToItem<T>(job, envelope));\n    }\n    return items;\n  }\n\n  async #cancelForOwner(\n    owner: LifecycleRouteAddress | null,\n    id: string\n  ): Promise<boolean> {\n    if (!this.#getForOwner(owner, id)) return false;\n    return this.lifecycle.jobs.cancel(id);\n  }\n\n  async #cancelAllForOwner(\n    owner: LifecycleRouteAddress | null,\n    callback?: string\n  ): Promise<number> {\n    let cancelled = 0;\n    for (const item of this.#listForOwner(owner, { callback })) {\n      if (await this.lifecycle.jobs.cancel(item.id)) cancelled++;\n    }\n    return cancelled;\n  }\n\n  /** @internal Remove items owned by one routed Lifecycle subtree. */\n  async __DO_NOT_USE_WILL_BREAK__cleanupRoutePrefix(\n    prefix: string\n  ): Promise<void> {\n    for (const { job, envelope } of this.#ownedJobs()) {\n      const ownerKey = envelope.owner_path_key ?? envelope.owner_path;\n      if (!envelope.owner_path || ownerKey === null) continue;\n      if (ownerKey !== prefix && !ownerKey.startsWith(`${prefix}/`)) continue;\n      await this.lifecycle.jobs.cancel(job.id);\n    }\n  }\n\n  // ── Events ───────────────────────────────────────────────────────────────\n\n  #emit(type: QueueEventType, payload: Record<string, unknown>): void {\n    this.lifecycle.events.emit(type, payload);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AA4CA,MAAM,yCAAyB,IAAI,QAGjC;;;;;;;;AASF,SAAgB,yBACd,OACA,UACM;CACN,uBAAuB,IAAI,OAAO,QAAQ;AAC5C;AAEA,MAAM,2BAA2B;;AAEjC,MAAM,+BAA+B;AAErC,MAAM,gBAAwC;CAC5C,aAAa;CACb,aAAa;CACb,YAAY;AACd;AAwBA,SAAS,kBAAkB,OAA0C;CAEnE,OAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,gBAAgB;AACxE;;;;;;;;;;;;;;;;;;;;;;;AAmBA,IAAa,QAAb,cAEU,oBAAoB;;;;;;;;;;;CAuB5B,YAAY,UAAkC,CAAC,GAAG;EAChD,MAAM,OAAO;;;;;8CAbY,IAAA;EAczB,uBAAA,WAAA,MAAiB,QAAQ,aAAa,CAAC,CAAA;EAIvC,uBAAA,gBAAA,MAAsB,mBAAmB,QAAQ,OAAO,aAAa,CAAA;EACrE,uBAAA,UAAA,MAAgB,QAAQ,OAAA;CAC1B;;CAKA,MAAM,UAAyB;EAC7B,MAAM,UAAU,KAAK,UAAU;EAE/B,KADiB,MAAM,QAAQ,IAAY,wBAAwB,KAAM,MAC1D,8BAA8B;EAE7C,MAAA,kBAAA,cAAM,MAAA,wBAAA,CAAA,CAAA,KAAA,MAA8B,OAAO;EAC3C,MAAM,QAAQ,IAAI,0BAA0B,4BAA4B;CAC1E;;CA4DA,MAAM,MACJ,SACqC;EACrC,MAAM,EAAE,KAAK,YAAY;EACzB,IAAI,CAAC,kBAAkB,IAAI,OAAO,GAAG;GACnC,QAAQ,MAAM,wBAAwB,IAAI,GAAG,cAAc;GAC3D;EACF;EACA,MAAM,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAgB,KAAK,IAAI,OAAO;EAE7C,IAAI,UAAU,GACZ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,UAAU,IAAI;GACd,IAAI,IAAI;GACR;GACA,aAAa,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB,CAAC,CAC5D;EACL,CAAC;EAGH,IAAI,IAAI,QAAQ,YAAY;GAG1B,IAAI;IACF,MAAM,KAAK,UAAU,OAAO,GAC1B;KACE,KAAK,IAAI,QAAQ,kBAAkB,IAAI,QAAQ;KAC/C,MAAM,IAAI,QAAQ;IACpB,GACA;KAAE,MAAM;KAAY;IAAK,CAC3B;GACF,SAAS,OAAO;IACd,IAAI,kBAAkB,KAAK,GAGzB,MAAM;IAER,QAAQ,MAAM,qCAAqC,IAAI,GAAG,IAAI,KAAK;IACnE,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;KACxB,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;EACF;EAEA,MAAM,UAAA,kBAAA,cAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,EAAE;EAC5C,IAAI,CAAC,SAAS;GACZ,QAAQ,MAAM,YAAY,IAAI,GAAG,WAAW;GAC5C;EACF;EACA,MAAM,KAAK,UAAU,uBAAuB,QAAQ,KAAK,SAAS,IAAI,CAAC;CAEzE;;CAGA,MAAM,WACJ,SACA,OACqC;EACrC,MAAM,EAAE,QAAQ;EAChB,MAAM,EAAE,gBAAgB,mBAAmB,IAAI,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACzE,QAAQ,MACN,mBAAmB,IAAI,GAAG,iBAAiB,YAAY,YACvD,KACF;EACA,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,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;CAEF;;CAGA,MAAM,QAAQ,SAAkD;EAC9D,MAAM,UAAU,QAAQ;EACxB,MAAM,QAAQ,QAAQ,UAAU;EAChC,QAAQ,QAAQ,MAAhB;GACE,KAAK,QACH,OAAA,kBAAA,cAAO,MAAA,OAAA,CAAA,CAAA,KAAA,MACL,OACA,QAAQ,UACR,QAAQ,SACR,QAAQ,OACV;GACF,KAAK,OACH,OAAA,kBAAA,cAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,QAAQ,EAAE;GAC5C,KAAK,QACH,OAAA,kBAAA,cAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,QAAQ,QAAQ;GACnD,KAAK,UACH,OAAA,kBAAA,cAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,OAAO,QAAQ,EAAE;GAC/C,KAAK,aACH,OAAA,kBAAA,cAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,OAAO,QAAQ,QAAQ;GACxD,KAAK;IACH,MAAA,kBAAA,cAAM,MAAA,cAAA,CAAA,CAAA,KAAA,MAAoB,QAAQ,IAAI;IACtC,OAAO;GACT,SACE,MAAM,IAAI,MAAM,8BAA8B;EAClD;CACF;;;;;;;;;;;;CA4EA,MAAM,KACJ,UACA,SACA,SACkD;EAClD,IAAI,KAAK,UAAU,OAAO,MAAM,WAAW,MAAM,KAAK,UAAU,MAAM;EACtE,kBAAA,cAAA,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,UAAU,OAAO;EACpC,MAAM,OAAO,KAAK,UAAU,OAAO,SAC7B,MAAM,KAAK,UAAU,OAAO,OAAO;GACnC,MAAM;GACN;GACA;GACA;EACF,CAA6B,IAG7B,MAAA,kBAAA,cAAM,MAAA,OAAA,CAAA,CAAA,KAAA,MACJ,MACA,UACA,SACA,OACF;EACJ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,gBAAgB;GAAE;GAAU,IAAI,KAAK;EAAG,CAAC;EACpD,OAAO;CACT;;CAGA,MAAM,OAAO,IAA8B;EACzC,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,eAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;CACtC;;CAGA,MAAM,UAAU,UAAoC;EAClD,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,kBAAA,CAAA,CAAA,KAAA,MAAwB,MAAM,QAAQ;CAC/C;;CAGA,MAAM,IAAiB,IAA+C;EACpE,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,YAAA,CAAA,CAAA,KAAA,MAAqB,MAAM,EAAE;CACtC;;CAGA,MAAM,KAAkB,UAAmD;EACzE,MAAM,KAAK,UAAU,MAAM;EAC3B,IAAI,KAAK,UAAU,OAAO,QACxB,OAAQ,MAAM,KAAK,UAAU,OAAO,OAAO;GACzC,MAAM;GACN;EACF,CAA6B;EAE/B,OAAA,kBAAA,cAAO,MAAA,aAAA,CAAA,CAAA,KAAA,MAAsB,MAAM,QAAQ;CAC7C;;CAgJA,MAAM,4CACJ,QACe;EACf,KAAK,MAAM,EAAE,KAAK,cAAA,kBAAA,cAAc,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;GACjD,MAAM,WAAW,SAAS,kBAAkB,SAAS;GACrD,IAAI,CAAC,SAAS,cAAc,aAAa,MAAM;GAC/C,IAAI,aAAa,UAAU,CAAC,SAAS,WAAW,GAAG,OAAO,EAAE,GAAG;GAC/D,MAAM,KAAK,UAAU,KAAK,OAAO,IAAI,EAAE;EACzC;CACF;AAOF;;;;;;;;;;AAzdE,eAAA,yBAA+B,SAA8C;CAM3E,IALe,QAAQ,IACpB,KACC,+EACF,CAAC,CACA,QACM,CAAC,CAAC,WAAW,GAAG;CAEzB,MAAM,OAAO,QAAQ,IAClB,KAAK,mEAAmE,CAAC,CACzE,QAAQ;CACX,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI;EACJ,IAAI;GACF,UACE,OAAO,IAAI,YAAY,WAAW,KAAK,MAAM,IAAI,OAAO,IAAI,KAAA;EAChE,SAAS,OAAO;GACd,QAAQ,MACN,wBAAwB,IAAI,GAAG,8DAE/B,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,MAAA,kBAAA,cAAM,MAAA,SAAA,CAAA,CAAA,KAAA,IAAe;GACrB,SAAS;IACP;IACA,YAAY;IACZ,gBAAgB;GAClB;GACA,OAAO,mBAAmB,OAAA,uBAAA,gBAAO,IAAA,CAAmB;EACtD,CAAC;CACH;CACA,QAAQ,IAAI,KAAK,6BAA6B;AAChD;;;;;;;;AAgIA,eAAA,eAAqB,MAAyC;CAC5D,MAAM,UAAA,kBAAA,cAAU,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,KAAK,QAAQ;CACnD,IAAI,CAAC,SAAS;EACZ,QAAQ,MAAM,YAAY,KAAK,SAAS,WAAW;EACnD;CACF;CACA,MAAM,EAAE,aAAa,aAAa,eAAe,mBAC/C,KAAK,OAAA,uBAAA,gBACL,IAAA,CACF;CACA,IAAI;EACF,MAAM,KACJ,aACA,OAAO,YAAY;GACjB,IAAI,UAAU,GACZ,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;IACxB,UAAU,KAAK;IACf,IAAI,KAAK;IACT;IACA;GACF,CAAC;GAEH,MAAM,KAAK,UAAU,uBACnB,QAAQ,KAAK,SAAS,IAAI,CAC5B;EACF,GACA;GACE;GACA;GACA,cAAc,UAAU,CAAC,+BAA+B,KAAK;EAC/D,CACF;CACF,SAAS,OAAO;EACd,IAAI,kBAAkB,KAAK,GACzB,MAAM;EAER,QAAQ,MACN,mBAAmB,KAAK,SAAS,iBAAiB,YAAY,YAC9D,KACF;EACA,kBAAA,cAAA,MAAA,KAAA,CAAA,CAAA,KAAA,MAAW,eAAe;GACxB,UAAU,KAAK;GACf,IAAI,KAAK;GACT,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;AA2FA,SAAA,cAAc,UAAkB,SAAkC;CAChE,IAAI,OAAO,aAAa,UACtB,MAAM,IAAI,MAAM,2BAA2B;CAE7C,IAAI,CAAA,kBAAA,cAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,QAAQ,GAC7B,MAAM,IAAI,MACR,2BAA2B,SAAS,gCACtC;CAEF,IAAI,SAAS,OACX,qBAAqB,QAAQ,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CACzD,IAAI,SAAS,OAAO,KAAA,KAAa,QAAQ,GAAG,KAAK,MAAM,IACrD,MAAM,IAAI,MAAM,kCAAkC;AAEtD;;AAGA,SAAA,iBAAiB,MAAiD;CAChE,MAAM,UAAA,uBAAA,WAAU,IAAA,CAAA,CAAe;CAC/B,IAAI,SAIF,OAAO;CAET,OAAO,uBAAuB,IAAI,IAAI,CAAC,GAAG,IAAI;AAChD;AAEA,SAAA,aAAa,MAAuB;CAClC,OAAA,kBAAA,cAAO,MAAA,gBAAA,CAAA,CAAA,KAAA,MAAsB,IAAI,MAAM,KAAA;AACzC;;AAGA,SAAA,YAAoB;CAClB,IAAA,uBAAA,WAAI,IAAA,MAAmB,MACrB,uBAAA,WAAA,MAAA,kBAAA,cAAiB,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,CAAC,CAAC,QAChC,UAAU,EAAE,UAAU,KAAK,IAAI,UAAU,IAAI,IAAI,GAClD,CACF,CAAA;CAEF,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI,GAAA,uBAAA,WAAG,IAAA,IAAiB,CAAC;CACpD,uBAAA,WAAA,MAAiB,IAAA;CACjB,OAAO;AACT;AAEA,eAAA,QACE,OACA,UACA,SACA,SACuB;CAGvB,MAAM,WACJ,SAAS,OAAO,KAAA,IACZ,KAAK,UAAU,KAAK,IAAI,QAAQ,EAAE,IAClC,KAAA;CACN,MAAM,WACJ,aAAa,KAAA,KAAA,kBAAA,cACb,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,SAAS,EAAE,MAAM,KAAA;CAC5C,MAAM,MAAM,MAAM,KAAK,UAAU,KAAK,KAAK;EACzC,IAAI,SAAS;EACb,IAAI;EACJ,MAAM,WAAW,SAAS,OAAA,kBAAA,cAAO,MAAA,SAAA,CAAA,CAAA,KAAA,IAAe;EAChD,SAAS;GACP;GACA,YAAY,OAAO,QAAQ;GAC3B,gBAAgB,OAAO,OAAO;EAChC;EACA,OAAO,mBAAmB,SAAS,OAAA,uBAAA,gBAAO,IAAA,CAAmB;CAC/D,CAAC;CACD,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,IAAI,OAA0B;AAC/D;AAEA,SAAA,WAAc,KAAmB,UAAyC;CACxE,OAAO;EACL,IAAI,IAAI;EACR,UAAU,IAAI;EACd,SAAS,SAAS;EAClB,WAAW,IAAI;EACf,OAAO,IAAI;CACb;AACF;;AAGA,SAAA,aAAsE;CACpE,MAAM,QAAiE,CAAC;CACxE,KAAK,MAAM,OAAO,KAAK,UAAU,KAAK,KAAK,GACzC,IAAI,kBAAkB,IAAI,OAAO,GAC/B,MAAM,KAAK;EAAE;EAAK,UAAU,IAAI;CAAQ,CAAC;CAG7C,OAAO;AACT;AAEA,SAAA,aACE,OACA,IAC0B;CAC1B,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE;CACtC,IAAI,CAAC,OAAO,CAAC,kBAAkB,IAAI,OAAO,GAAG,OAAO,KAAA;CACpD,KAAK,IAAI,QAAQ,kBAAkB,UAAU,UAAU,OAAO,KAAA;CAC9D,OAAA,kBAAA,cAAO,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,IAAI,OAAO;AAC5C;AAEA,SAAA,cACE,OACA,WAA0B,CAAC,GACX;CAChB,MAAM,WAAW,OAAO,OAAO;CAC/B,MAAM,QAAwB,CAAC;CAC/B,KAAK,MAAM,EAAE,KAAK,cAAA,kBAAA,cAAc,MAAA,UAAA,CAAA,CAAA,KAAA,IAAgB,GAAG;EACjD,KAAK,SAAS,kBAAkB,UAAU,UAAU;EACpD,IAAI,SAAS,YAAY,IAAI,OAAO,SAAS,UAAU;EACvD,MAAM,KAAA,kBAAA,cAAK,MAAA,UAAA,CAAA,CAAA,KAAA,MAAmB,KAAK,QAAQ,CAAC;CAC9C;CACA,OAAO;AACT;AAEA,eAAA,gBACE,OACA,IACkB;CAClB,IAAI,CAAA,kBAAA,cAAC,MAAA,YAAA,CAAA,CAAA,KAAA,MAAkB,OAAO,EAAE,GAAG,OAAO;CAC1C,OAAO,KAAK,UAAU,KAAK,OAAO,EAAE;AACtC;AAEA,eAAA,mBACE,OACA,UACiB;CACjB,IAAI,YAAY;CAChB,KAAK,MAAM,QAAA,kBAAA,cAAQ,MAAA,aAAA,CAAA,CAAA,KAAA,MAAmB,OAAO,EAAE,SAAS,CAAC,GACvD,IAAI,MAAM,KAAK,UAAU,KAAK,OAAO,KAAK,EAAE,GAAG;CAEjD,OAAO;AACT;AAgBA,SAAA,MAAM,MAAsB,SAAwC;CAClE,KAAK,UAAU,OAAO,KAAK,MAAM,OAAO;AAC1C"}

package/dist/react.d.ts

@@ -2,7 +2,7 @@ import {
   C as MCPServersState,
   J as AgentToolRunPart,
   Y as AgentToolRunState
-} from "./agent-routing-Bhdbvf7s.js";
+} from "./agent-routing-QDcchcQP.js";
 import { ClientParameters } from "./serializable.js";
 import { t as AgentTransport } from "./transport-protocol-ZTew5Wso.js";
 import {
@@ -15,7 +15,7 @@ import {
   p as RequiredAgentMethods,
   s as AgentStub,
   v as createStubProxy
-} from "./client-DS3Dz9l0.js";
+} from "./client-BGIQKJhX.js";
 import { PartySocket } from "partysocket";
 import { usePartySocket } from "partysocket/react";
 

package/dist/routing/index.d.ts

@@ -2,7 +2,7 @@ import {
   r as CapabilityWebSocketUpgradeContext,
   s as LifecycleCapability,
   t as CapabilityRequestContext
-} from "../capability-runner-O5VbQzqg.js";
+} from "../capability-runner-BiVUtjqC.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-Bhdbvf7s.js";
+} from "../agent-routing-QDcchcQP.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 _classPrivateMethodInitSpec } from "../classPrivateMethodInitSpec-qMjJ6sHQ.js";
-import { t as LifecycleCapability } from "../capability-B4WbF81e.js";
+import { t as LifecycleCapability } from "../capability-DBAKc6UZ.js";
 //#region src/routing/routed-agents.ts
 /**
 * Catalog of the entries an owning Durable Object has created, keyed by

package/dist/{scheduler-CrFCnv_J.d.ts → scheduler-BCLESHSC.d.ts}

@@ -3,7 +3,7 @@ import {
   d as LifecycleRouteContext,
   s as LifecycleCapability,
   v as LifecycleJobOutcome
-} from "./capability-runner-O5VbQzqg.js";
+} from "./capability-runner-BiVUtjqC.js";
 import { t as RetryOptions } from "./retries-CV6AkXmQ.js";
 
 //#region src/schedules/types.d.ts
@@ -41,8 +41,6 @@ type Schedule<T = string> = {
 /**
  * Constraint for a Scheduler's registered callback map: named handlers
  * receiving the parsed payload and the schedule that fired.
- *
- * @experimental The API surface may change before stabilizing.
  */
 type SchedulerHandlers = Record<
   string,
@@ -54,8 +52,6 @@ type SchedulerHandlers = Record<
  * must be registered or supplied by a composition-root resolver (the
  * aperture behind Agent's name-based scheduling API); a bare Scheduler
  * rejects it otherwise.
- *
- * @experimental The API surface may change before stabilizing.
  */
 type SchedulerCallbacks = Record<
   string,
@@ -63,8 +59,6 @@ type SchedulerCallbacks = Record<
 >;
 /**
  * The payload type a registered scheduler callback accepts.
- *
- * @experimental The API surface may change before stabilizing.
  */
 type SchedulerPayload<Handler> = Handler extends (
   payload: infer Payload,
@@ -103,8 +97,6 @@ type SchedulerEventType =
   | "schedule:duplicate_warning";
 /**
  * Optional callbacks and policy for a Scheduler capability.
- *
- * @experimental The API surface may change before stabilizing.
  */
 interface SchedulerOptions<
   Handlers extends SchedulerHandlers = SchedulerCallbacks
@@ -134,8 +126,6 @@ interface SchedulerOptions<
  * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm
  * event loop, and Scheduler runs registered callbacks through Lifecycle's
  * host invocation boundary when its jobs come due.
- *
- * @experimental The API surface may change before stabilizing.
  */
 declare class Scheduler<
   Handlers extends SchedulerHandlers = SchedulerCallbacks
@@ -220,4 +210,4 @@ export {
   SchedulerCallbacks as s,
   Scheduler as t
 };
-//# sourceMappingURL=scheduler-CrFCnv_J.d.ts.map
+//# sourceMappingURL=scheduler-BCLESHSC.d.ts.map

package/dist/{scheduler-DZ3xQfeK.js → scheduler-FIHv2-kJ.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 _classPrivateMethodInitSpec } from "./classPrivateMethodInitSpec-qMjJ6sHQ.js";
-import { t as LifecycleCapability } from "./capability-B4WbF81e.js";
+import { t as LifecycleCapability } from "./capability-DBAKc6UZ.js";
 import { isDurableObjectCodeUpdateReset, isPlatformFailure, resolveRetryConfig, tryN, validateRetryOptions } from "./retries.js";
 import { parseCronExpression } from "cron-schedule";
 //#region src/schedules/schedule-timing.ts
@@ -138,8 +138,6 @@ var _Scheduler_brand = /* @__PURE__ */ new WeakSet();
 * Lifecycle job queue; Lifecycle owns the physical alarm and the alarm
 * event loop, and Scheduler runs registered callbacks through Lifecycle's
 * host invocation boundary when its jobs come due.
-*
-* @experimental The API surface may change before stabilizing.
 */
 var Scheduler = class extends LifecycleCapability {
 	/**
@@ -655,4 +653,4 @@ function _emitCreated(result) {
 //#endregion
 export { setSchedulerCallbackResolver as n, Scheduler as t };
 
-//# sourceMappingURL=scheduler-DZ3xQfeK.js.map
+//# sourceMappingURL=scheduler-FIHv2-kJ.js.map

package/dist/scheduler-FIHv2-kJ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler-FIHv2-kJ.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 */\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;;;;;;;;;;;;;;;;AAWA,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/schedules/index.d.ts

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

package/dist/schedules/index.js

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

package/dist/serializable.d.ts

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