experimental-a2 0.19.0 → 0.21.1

package/dist/contract-BYKASlCV.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"contract-BYKASlCV.js","names":[],"sources":["../src/contract.ts"],"sourcesContent":["import {\n  makeReducerBuilder,\n  type Reducer,\n  type RegisteredReducer,\n} from './reducer.ts'\nimport { RESERVED_EVENT_PREFIX } from './session-clear.ts'\nimport type { StandardSchemaV1 } from './standard-schema.ts'\nimport { assertSyncSchema } from './validate.ts'\n\n/** The event vocabulary shape: event name → payload schema. */\nexport type EventDefs = Record<string, StandardSchemaV1>\n\n/** The presence vocabulary shape: field name → value schema. */\nexport type PresenceDefs = Record<string, StandardSchemaV1>\n\n/** One event of a contract, narrowed to type `K`. */\nexport type ContractEvent<\n  D extends EventDefs,\n  K extends keyof D & string = keyof D & string,\n> = {\n  [T in keyof D & string]: {\n    id: string\n    type: T\n    payload: StandardSchemaV1.InferOutput<D[T]>\n    index: number\n    sessionId: string\n    createdAt: Date\n  }\n}[K]\n\n/** Input to `append`/`push`, typed against the contract's schemas. */\nexport type AppendInput<D extends EventDefs> = {\n  [T in keyof D & string]: {\n    type: T\n    payload: StandardSchemaV1.InferInput<D[T]>\n    id?: string\n  }\n}[keyof D & string]\n\nexport type EventBatchFactory<D extends EventDefs> = <\n  const E extends readonly AppendInput<D>[],\n>(\n  ...events: E\n) => E\n\n/**\n * One presence update: a participant's changed fields (`null` marks a\n * cleared one), stamped with the sender's stream frontier (`seen`).\n * This is what `stream({ presence: true })` interleaves with events.\n */\nexport type PresencePatch<P extends PresenceDefs = PresenceDefs> = {\n  participant: string\n  values: {\n    [F in keyof P & string]?: StandardSchemaV1.InferOutput<P[F]> | null\n  }\n  seen: number\n  at: Date\n}\n\n/**\n * The replicated ephemeral map: participant → field → latest value,\n * last-writer-wins per field. Never stored in the log; how long a\n * value stays painted is view logic, decided at render time against\n * `at`.\n */\nexport type PresenceMap<P extends PresenceDefs = PresenceDefs> = {\n  [participant: string]: {\n    [F in keyof P & string]?: {\n      value: StandardSchemaV1.InferOutput<P[F]>\n      seen: number\n      at: Date\n    }\n  }\n}\n\n/**\n * The one item a presence stream yields before live patches: the\n * current pruned map, per-field stamps exact. Discriminate\n * structurally (`'snapshot' in item`).\n */\nexport type PresenceSnapshot<P extends PresenceDefs = PresenceDefs> = {\n  snapshot: PresenceMap<P>\n}\n\n/**\n * Intersect into a surface type to add `Members` only when the\n * contract declares presence fields — on presence-less contracts the\n * members do not exist, a type error rather than a runtime throw.\n */\nexport type WithPresence<\n  P extends PresenceDefs,\n  Members,\n> = keyof P extends never ? unknown : Members\n\nexport type ReducerOptions<Seed, S> = {\n  /**\n   * Identity and snapshot cache key. Rename it when the fold's logic\n   * changes — snapshots under the old name are ignored and refolded.\n   */\n  name: string\n  /**\n   * The seed the fold starts from. With a `stateSchema`, it's typed as\n   * the schema's *input*: validated at definition, and the validated\n   * output (defaults applied) is what the fold actually starts from.\n   */\n  initialState: Seed\n  /**\n   * Optional: declares the state's shape (the fold's state type becomes\n   * the schema's output) and guards cached folds — server snapshots and\n   * the browser cache reject mismatching shapes and refold.\n   */\n  stateSchema?: StandardSchemaV1<Seed, S>\n}\n\nexport type Contract<\n  D extends EventDefs = EventDefs,\n  P extends PresenceDefs = Record<never, never>,\n  R = RegisteredReducer<D, P> | undefined,\n> = {\n  /** Identity — prefixes storage keys and queue messages. */\n  readonly name: string\n  /** The vocabulary. */\n  readonly events: Readonly<D>\n  /** The presence vocabulary — empty unless declared. */\n  readonly presence: Readonly<P>\n  /** Preserve literal types for a handler-returned event batch. */\n  readonly batch: EventBatchFactory<D>\n  readonly reducer: R\n}\n\n/**\n * Define a contract: a name plus the events it understands. Validators\n * must be synchronous — async ones are rejected here, at definition\n * time. The result is a plain, importable, isomorphic value.\n */\ntype ContractOptions<D extends EventDefs, P extends PresenceDefs> = {\n  name: string\n  events: D\n  presence?: P\n}\n\nexport function contract<\n  D extends EventDefs,\n  P extends PresenceDefs = Record<never, never>,\n  Schema extends StandardSchemaV1 = StandardSchemaV1,\n>(\n  options: ContractOptions<D, P> & {\n    reducer: {\n      name: string\n      initialState: StandardSchemaV1.InferInput<NoInfer<Schema>>\n      stateSchema: Schema\n      fold: (\n        state: StandardSchemaV1.InferOutput<Schema>,\n        event: ContractEvent<NoInfer<D>>,\n      ) => StandardSchemaV1.InferOutput<Schema>\n    }\n  },\n): Contract<D, P, Reducer<D, StandardSchemaV1.InferOutput<Schema>, P>>\nexport function contract<\n  D extends EventDefs,\n  P extends PresenceDefs = Record<never, never>,\n  S = unknown,\n>(\n  options: ContractOptions<D, P> & {\n    reducer: {\n      name: string\n      initialState: S\n      fold: (state: NoInfer<S>, event: ContractEvent<NoInfer<D>>) => NoInfer<S>\n    }\n  },\n): Contract<D, P, Reducer<D, S, P>>\nexport function contract<\n  D extends EventDefs,\n  P extends PresenceDefs = Record<never, never>,\n  R extends RegisteredReducer<D, P> = RegisteredReducer<D, P>,\n>(options: ContractOptions<D, P> & { reducer: R }): Contract<D, P, R>\nexport function contract<\n  D extends EventDefs,\n  P extends PresenceDefs = Record<never, never>,\n>(\n  options: ContractOptions<D, P> & { reducer?: undefined },\n): Contract<D, P, undefined>\nexport function contract(options: AnyContractOptions): unknown {\n  for (const type of Object.keys(options.events ?? {})) {\n    if (type.startsWith(RESERVED_EVENT_PREFIX)) {\n      throw new TypeError(\n        `contract '${String(options.name)}': event types starting with '${RESERVED_EVENT_PREFIX}' are reserved`,\n      )\n    }\n  }\n  return defineContract(options)\n}\n\n/** A2's own contracts, which may declare reserved `a2.` event types. */\nexport const internalContract: typeof contract =\n  defineContract as typeof contract\n\ntype AnyContractOptions = ContractOptions<EventDefs, PresenceDefs> & {\n  reducer?:\n    | (ReducerOptions<unknown, unknown> & {\n        fold: (state: never, event: never) => unknown\n      })\n    | undefined\n}\n\nfunction defineContract(options: AnyContractOptions): unknown {\n  const { name } = options\n  if (typeof name !== 'string' || name.length === 0) {\n    throw new TypeError('contract name must be a non-empty string')\n  }\n  if (name.includes('\\u001f')) {\n    throw new TypeError('contract name contains a reserved control character')\n  }\n  const defs = options.events\n  for (const [type, schema] of Object.entries(defs)) {\n    if (typeof schema?.['~standard']?.validate !== 'function') {\n      throw new TypeError(\n        `contract '${name}': the value for '${type}' is not a Standard Schema (expected an object with '~standard')`,\n      )\n    }\n    assertSyncSchema(schema, `event '${type}'`)\n  }\n  const events = Object.freeze({ ...defs })\n\n  const presenceDefs = options.presence ?? {}\n  for (const [field, schema] of Object.entries(presenceDefs)) {\n    if (typeof schema?.['~standard']?.validate !== 'function') {\n      throw new TypeError(\n        `contract '${name}': the value for presence field '${field}' is not a Standard Schema (expected an object with '~standard')`,\n      )\n    }\n    assertSyncSchema(schema, `presence field '${field}'`)\n  }\n  const presence = Object.freeze({ ...presenceDefs })\n\n  return {\n    name,\n    events,\n    presence,\n    batch: <const E extends readonly AppendInput<EventDefs>[]>(\n      ...items: E\n    ): E => items,\n    reducer:\n      options.reducer === undefined\n        ? undefined\n        : {\n            ...options.reducer,\n            ...makeReducerBuilder(events, presence, options.reducer).fold(\n              options.reducer.fold as (\n                state: unknown,\n                event: ContractEvent<EventDefs>,\n              ) => unknown,\n            ),\n          },\n  }\n}\n"],"mappings":";;AAsLA,SAAgB,SAAS,SAAsC;CAC7D,KAAK,MAAM,QAAQ,OAAO,KAAK,QAAQ,UAAU,CAAC,CAAC,GACjD,IAAI,KAAK,WAAA,KAAgC,GACvC,MAAM,IAAI,UACR,aAAa,OAAO,QAAQ,IAAI,EAAE,gDACpC;CAGJ,OAAO,eAAe,OAAO;AAC/B;;AAGA,MAAa,mBACX;AAUF,SAAS,eAAe,SAAsC;CAC5D,MAAM,EAAE,SAAS;CACjB,IAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAC9C,MAAM,IAAI,UAAU,0CAA0C;CAEhE,IAAI,KAAK,SAAS,GAAQ,GACxB,MAAM,IAAI,UAAU,qDAAqD;CAE3E,MAAM,OAAO,QAAQ;CACrB,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,IAAI,GAAG;EACjD,IAAI,OAAO,SAAS,YAAY,EAAE,aAAa,YAC7C,MAAM,IAAI,UACR,aAAa,KAAK,oBAAoB,KAAK,iEAC7C;EAEF,iBAAiB,QAAQ,UAAU,KAAK,EAAE;CAC5C;CACA,MAAM,SAAS,OAAO,OAAO,EAAE,GAAG,KAAK,CAAC;CAExC,MAAM,eAAe,QAAQ,YAAY,CAAC;CAC1C,KAAK,MAAM,CAAC,OAAO,WAAW,OAAO,QAAQ,YAAY,GAAG;EAC1D,IAAI,OAAO,SAAS,YAAY,EAAE,aAAa,YAC7C,MAAM,IAAI,UACR,aAAa,KAAK,mCAAmC,MAAM,iEAC7D;EAEF,iBAAiB,QAAQ,mBAAmB,MAAM,EAAE;CACtD;CACA,MAAM,WAAW,OAAO,OAAO,EAAE,GAAG,aAAa,CAAC;CAElD,OAAO;EACL;EACA;EACA;EACA,QACE,GAAG,UACG;EACR,SACE,QAAQ,YAAY,KAAA,IAChB,KAAA,IACA;GACE,GAAG,QAAQ;GACX,GAAG,mBAAmB,QAAQ,UAAU,QAAQ,OAAO,CAAC,CAAC,KACvD,QAAQ,QAAQ,IAIlB;EACF;CACR;AACF"}

package/dist/idempotent-replay-JdgMQRRm.js

@@ -1,21 +0,0 @@
-import { i as A2Error } from "./session-clear-DGI4jTQ5.js";
-//#region src/idempotent-replay.ts
-const canonicalJson = (value) => JSON.stringify(value, (_key, candidate) => {
-	if (candidate === null || typeof candidate !== "object" || Array.isArray(candidate)) return candidate;
-	return Object.fromEntries(Object.entries(candidate).toSorted(([left], [right]) => left < right ? -1 : left > right ? 1 : 0));
-}) ?? "null";
-const idempotentReplay = (events, existing) => {
-	const byId = new Map(existing.map((event) => [event.id, event]));
-	const ordered = events.map((event) => event.id === void 0 ? void 0 : byId.get(event.id));
-	const firstIndex = ordered[0]?.index;
-	const batchSize = events[0]?.cause?.batchSize;
-	if (firstIndex === void 0 || batchSize !== void 0 && batchSize !== events.length || ordered.some((stored, index) => {
-		const event = events[index];
-		return stored === void 0 || stored.index !== firstIndex + index || stored.type !== event.type || stored.lane !== (event.lane ?? null) || stored.cause?.batchSize !== event.cause?.batchSize || canonicalJson(stored.payload) !== canonicalJson(event.payload);
-	})) throw new A2Error("PARTIAL_DUPLICATE_BATCH", "already-appended events do not match the retried batch");
-	return ordered;
-};
-//#endregion
-export { idempotentReplay as t };
-
-//# sourceMappingURL=idempotent-replay-JdgMQRRm.js.map

package/dist/idempotent-replay-JdgMQRRm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"idempotent-replay-JdgMQRRm.js","names":[],"sources":["../src/idempotent-replay.ts"],"sourcesContent":["import { A2Error } from './errors.ts'\nimport type { AppendEvent, StoredEvent } from './store.ts'\n\nconst canonicalJson = (value: unknown): string =>\n  JSON.stringify(value, (_key, candidate: unknown) => {\n    if (\n      candidate === null ||\n      typeof candidate !== 'object' ||\n      Array.isArray(candidate)\n    ) {\n      return candidate\n    }\n    return Object.fromEntries(\n      Object.entries(candidate).toSorted(([left], [right]) =>\n        left < right ? -1 : left > right ? 1 : 0,\n      ),\n    )\n  }) ?? 'null'\n\nexport const idempotentReplay = (\n  events: readonly AppendEvent[],\n  existing: readonly StoredEvent[],\n): StoredEvent[] => {\n  const byId = new Map(existing.map((event) => [event.id, event]))\n  const ordered = events.map((event) =>\n    event.id === undefined ? undefined : byId.get(event.id),\n  )\n  const firstIndex = ordered[0]?.index\n  const batchSize = events[0]?.cause?.batchSize\n\n  if (\n    firstIndex === undefined ||\n    (batchSize !== undefined && batchSize !== events.length) ||\n    ordered.some((stored, index) => {\n      const event = events[index]!\n      return (\n        stored === undefined ||\n        stored.index !== firstIndex + index ||\n        stored.type !== event.type ||\n        stored.lane !== (event.lane ?? null) ||\n        stored.cause?.batchSize !== event.cause?.batchSize ||\n        canonicalJson(stored.payload) !== canonicalJson(event.payload)\n      )\n    })\n  ) {\n    throw new A2Error(\n      'PARTIAL_DUPLICATE_BATCH',\n      'already-appended events do not match the retried batch',\n    )\n  }\n\n  return ordered as StoredEvent[]\n}\n"],"mappings":";;AAGA,MAAM,iBAAiB,UACrB,KAAK,UAAU,QAAQ,MAAM,cAAuB;CAClD,IACE,cAAc,QACd,OAAO,cAAc,YACrB,MAAM,QAAQ,SAAS,GAEvB,OAAO;CAET,OAAO,OAAO,YACZ,OAAO,QAAQ,SAAS,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,WAC3C,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI,CACzC,CACF;AACF,CAAC,KAAK;AAER,MAAa,oBACX,QACA,aACkB;CAClB,MAAM,OAAO,IAAI,IAAI,SAAS,KAAK,UAAU,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;CAC/D,MAAM,UAAU,OAAO,KAAK,UAC1B,MAAM,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,IAAI,MAAM,EAAE,CACxD;CACA,MAAM,aAAa,QAAQ,EAAE,EAAE;CAC/B,MAAM,YAAY,OAAO,EAAE,EAAE,OAAO;CAEpC,IACE,eAAe,KAAA,KACd,cAAc,KAAA,KAAa,cAAc,OAAO,UACjD,QAAQ,MAAM,QAAQ,UAAU;EAC9B,MAAM,QAAQ,OAAO;EACrB,OACE,WAAW,KAAA,KACX,OAAO,UAAU,aAAa,SAC9B,OAAO,SAAS,MAAM,QACtB,OAAO,UAAU,MAAM,QAAQ,SAC/B,OAAO,OAAO,cAAc,MAAM,OAAO,aACzC,cAAc,OAAO,OAAO,MAAM,cAAc,MAAM,OAAO;CAEjE,CAAC,GAED,MAAM,IAAI,QACR,2BACA,wDACF;CAGF,OAAO;AACT"}

package/dist/initial-snapshot-Bx-c0pDP.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"initial-snapshot-Bx-c0pDP.d.ts","names":[],"sources":["../src/errors.ts","../src/initial-snapshot.ts"],"mappings":";;KAAY;KAaA,cACV;cAEW,gBAAgB;WAClB,MAAM;;WAEN;EAET,YACE,MAAM,aACN,iBACA;IAAY;IAAmB;;;;;;;;;;;cA2CtB,0BAA0B;EACrC,YAAY,iBAAiB;IAAY;;;;;KClE/B,gBAAgB,KACxB,cAAc,wBAGd,QAAQ,cAAc"}

package/dist/internal-CscSY7K_.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"internal-CscSY7K_.js","names":[],"sources":["../src/internal.ts"],"sourcesContent":["/**\n * Private seams shared by a2 entry points and a2's own tests. Not exported\n * from the package. Nothing here is public API.\n */\n\nimport type { ScheduledEvent } from './scheduler-task.ts'\nimport type { DrainableServer } from './server.ts'\nimport type { Event } from './store.ts'\n\nexport type DrainOutcome = 'busy' | 'stalled' | 'settled'\n\n/**\n * A null-prototype record for maps keyed by caller-controlled strings\n * (participant ids, presence field names). On a normal object,\n * assigning to '__proto__' rewrites the prototype instead of creating\n * an own property — the prototype-pollution class. Null-prototype\n * objects still satisfy Record types and JSON.stringify cleanly.\n */\nexport function nullProtoRecord<T extends object>(): T {\n  return Object.create(null) as T\n}\n\n/**\n * ECMA-262's maximum Date value (±8.64e15 ms). A presence stamp past\n * it becomes an Invalid Date whose toISOString throws — one hostile\n * stamp would poison every subscriber's snapshot frame — so both\n * seams bound `at` to the representable range.\n */\nexport const MAX_DATE_MS = 8_640_000_000_000_000\n\n/**\n * Participant ids that collide with Object.prototype plumbing.\n * Null-prototype construction already defuses them, but they are\n * rejected at both seams (`parsePushBody`, `setPresence`) so a hostile\n * id never propagates into userland maps either.\n */\nexport const RESERVED_PARTICIPANT_IDS: ReadonlySet<string> = new Set([\n  '__proto__',\n  'constructor',\n  'prototype',\n])\n\nexport type DrainResult = {\n  settled: boolean\n  outcome: DrainOutcome\n  /** Existing successor arm a scheduler callback may join before acking. */\n  schedulerArm?: Promise<void>\n}\n\nexport type ServerInternals = {\n  /**\n   * Await every in-flight background drain this machine has scheduled,\n   * including ones scheduled while waiting. Lets tests flush the\n   * fire-and-forget inline path deterministically — no sleeps.\n   */\n  settle(): Promise<void>\n  /** The public `server.drain()` result deliberately remains `{ settled }`. */\n  schedulerDrain(\n    sessionId: string,\n    opts?: { watchdogDueAt?: number },\n  ): Promise<DrainResult>\n  /** Deliver a scheduler-owned delayed append through the normal root path. */\n  schedulerAppend(\n    sessionId: string,\n    events: readonly ScheduledEvent[],\n    originIndex?: number,\n  ): Promise<void>\n  /** Deliver a scheduler-owned conditional clear, deletion included. */\n  schedulerClear(sessionId: string, ifLastIndex: number): Promise<void>\n  /** `session.history` with clear markers kept; reads start at the latest one. */\n  historyWithMarkers(sessionId: string, gte: number): Promise<Event[]>\n}\n\nexport const serverInternals: WeakMap<object, ServerInternals> = new WeakMap()\n\n/**\n * Handler contexts whose previous attempt ended in a failure the handler\n * threw, as opposed to a claim that lapsed (a crash, a timeout, a frozen\n * process). Only the attempt's own outcome is known, not how far it got.\n */\nexport const failedPreviousAttempt: WeakSet<object> = new WeakSet()\n\nconst objectLike = (value: unknown): value is object =>\n  (typeof value === 'object' && value !== null) || typeof value === 'function'\n\n/** The ambient value delivered to `handlerContext` during a tool execution. */\nexport type AmbientToolScope = {\n  /** Executing server identity; a test scope from `runWithHandlerContext` has none. */\n  contract?: { readonly name: string }\n  context: unknown\n}\n\n/**\n * Structural AsyncLocalStorage surface for the ambient tool scope. The\n * instance is created by the server-only AI entry point (the only place\n * `node:async_hooks` may be imported) and shared through a global\n * symbol slot, so `handlerContext` in the isomorphic AI entry point and\n * independently bundled A2 copies all read the same scope.\n */\nexport type AmbientToolScopeStorage = {\n  getStore(): AmbientToolScope | undefined\n  run<R>(store: AmbientToolScope, callback: () => R): R\n}\n\nconst TOOL_SCOPE_STORAGE = Symbol.for('experimental-a2.ai.tool-scope')\n\nexport function ambientToolScopeStorage(): AmbientToolScopeStorage | undefined {\n  const value = Reflect.get(globalThis, TOOL_SCOPE_STORAGE)\n  if (\n    !objectLike(value) ||\n    typeof Reflect.get(value, 'getStore') !== 'function' ||\n    typeof Reflect.get(value, 'run') !== 'function'\n  ) {\n    return undefined\n  }\n  return value as AmbientToolScopeStorage\n}\n\nexport function installAmbientToolScopeStorage(\n  create: () => AmbientToolScopeStorage,\n): AmbientToolScopeStorage {\n  const existing = ambientToolScopeStorage()\n  if (existing !== undefined) return existing\n  const storage = create()\n  Reflect.set(globalThis, TOOL_SCOPE_STORAGE, storage)\n  return storage\n}\n\nexport type SchedulerSendFailureDisposition = 'retryable' | 'terminal'\n\ntype SchedulerSendFailureMarker = {\n  readonly version: 1\n  readonly pending: SchedulerSendFailureDisposition[]\n  readonly active: SchedulerSendFailureDisposition[]\n}\n\nconst SCHEDULER_SEND_FAILURE = Symbol.for(\n  'experimental-a2.scheduler.send-failure',\n)\n\nconst schedulerSendFailureMarker = (\n  value: unknown,\n): SchedulerSendFailureMarker | undefined => {\n  if (!objectLike(value)) return undefined\n  const marker = Reflect.get(value, SCHEDULER_SEND_FAILURE)\n  if (\n    !objectLike(marker) ||\n    Reflect.get(marker, 'version') !== 1 ||\n    !Array.isArray(Reflect.get(marker, 'pending')) ||\n    !Array.isArray(Reflect.get(marker, 'active'))\n  ) {\n    return undefined\n  }\n  return marker as SchedulerSendFailureMarker\n}\n\nconst schedulerFailureObject = (error: unknown): object => {\n  if (\n    objectLike(error) &&\n    (schedulerSendFailureMarker(error) !== undefined ||\n      Object.isExtensible(error))\n  ) {\n    return error\n  }\n  return new Error(String(error), { cause: error })\n}\n\nconst schedulerSendFailureState = (\n  error: object,\n): SchedulerSendFailureMarker => {\n  const existing = schedulerSendFailureMarker(error)\n  if (existing !== undefined) return existing\n  const marker: SchedulerSendFailureMarker = {\n    version: 1,\n    pending: [],\n    active: [],\n  }\n  Object.defineProperty(error, SCHEDULER_SEND_FAILURE, {\n    value: marker,\n    enumerable: false,\n    configurable: true,\n    writable: false,\n  })\n  return marker\n}\n\nconst clearSchedulerSendFailureState = (\n  error: object,\n  marker: SchedulerSendFailureMarker,\n): void => {\n  if (marker.pending.length === 0 && marker.active.length === 0) {\n    Reflect.deleteProperty(error, SCHEDULER_SEND_FAILURE)\n  }\n}\n\n/**\n * Classify an adapter error before throwing it. Unclassified adapter failures\n * are retryable because the caller cannot know whether a remote send landed.\n */\nexport function classifySchedulerSendFailure(\n  error: unknown,\n  disposition: SchedulerSendFailureDisposition,\n): unknown {\n  const classified = schedulerFailureObject(error)\n  schedulerSendFailureState(classified).pending.push(disposition)\n  return classified\n}\n\n/** Consume a pending adapter classification and count this rejected send. */\nexport function markSchedulerSendFailure(error: unknown): unknown {\n  const marked = schedulerFailureObject(error)\n  const marker = schedulerSendFailureState(marked)\n  marker.active.push(marker.pending.pop() ?? 'retryable')\n  return marked\n}\n\nexport function consumeSchedulerSendFailure(\n  error: unknown,\n): SchedulerSendFailureDisposition | undefined {\n  if (!objectLike(error)) return undefined\n  const marker = schedulerSendFailureMarker(error)\n  const disposition = marker?.active.pop()\n  if (marker !== undefined) clearSchedulerSendFailureState(error, marker)\n  return disposition\n}\n\nconst isDrainableServer = (value: unknown): value is DrainableServer => {\n  if (value === null || typeof value !== 'object') return false\n  const contract = Reflect.get(value, 'contract')\n  return (\n    contract !== null &&\n    typeof contract === 'object' &&\n    typeof Reflect.get(contract, 'name') === 'string' &&\n    typeof Reflect.get(value, 'drain') === 'function'\n  )\n}\n\n/**\n * Validate the server list captured by a scheduler route at construction time.\n * The seam stays structural so custom scheduler integrations can supply their\n * own drainable targets.\n */\nexport function assertSchedulerTargets(\n  servers: readonly unknown[],\n): asserts servers is readonly DrainableServer[] {\n  const contracts = new Set<string>()\n  for (const target of servers) {\n    if (!isDrainableServer(target)) {\n      throw new TypeError('a2 scheduler: expected a server from createServer()')\n    }\n    const name = target.contract.name\n    if (contracts.has(name)) {\n      throw new TypeError(\n        `a2 scheduler: duplicate server contract '${name}' in one handler`,\n      )\n    }\n    contracts.add(name)\n  }\n}\n\n/**\n * Drain timing knobs. Mutable only as a white-box test seam. Claim\n * heartbeats run on real timers, so tests shrink these to keep suites\n * fast. Production always uses the defaults.\n */\nexport const DRAIN_TIMINGS: {\n  /** How long a claim lives without renewal. */\n  claimTtlMs: number\n  /** Heartbeat cadence while a handler is running. */\n  claimHeartbeatMs: number\n  /** Base delay before retrying a failed renewal while the lease lives. */\n  renewRetryMs: number\n  /** Delay between a claim's expiry and its scheduler watchdog. */\n  watchdogGraceMs: number\n  /** Maximum time a top-level append waits for its initial scheduler arm. */\n  schedulerArmTimeoutMs: number\n  /** First retry delay after a caught failure, doubling per failure. */\n  failureRetryBaseMs: number\n  /** Ceiling of the caught-failure retry delay. */\n  failureRetryMaxMs: number\n} = {\n  claimTtlMs: 5_000,\n  claimHeartbeatMs: 2_000,\n  renewRetryMs: 400,\n  watchdogGraceMs: 1_000,\n  schedulerArmTimeoutMs: 2_000,\n  failureRetryBaseMs: 1_000,\n  failureRetryMaxMs: 30_000,\n}\n\n/**\n * Stream liveness knobs — the server-side SSE heartbeat and the\n * client-side stall watchdog. Paired by design: the client declares a\n * connection dead after roughly two missed heartbeats. Mutable only as\n * a white-box test seam; production always uses the defaults.\n */\n/**\n * Poll cadence for the poll-based store streams (sqlite, postgres) —\n * owned, not configurable: adaptive polling removed the operator's\n * reason to tune it (the floor keeps active streams smooth; the\n * ceiling bounds idle cost). Mutable only as a white-box test seam so\n * suites don't wait out real idle gaps.\n */\nexport const POLL_TIMINGS: {\n  /** Gap between polls while a session is producing events. */\n  activeFloorMs: number\n  /** The idle ceiling — the longest gap between polls. */\n  idleCeilingMs: number\n} = {\n  activeFloorMs: 25,\n  idleCeilingMs: 2_000,\n}\n\n/**\n * Safety-read cadence for the notify-driven redis live stream. A\n * parked feed re-reads the store at this interval even without a\n * pub/sub wake-up, so a lost notification (subscriber reconnect gap,\n * dropped PUBLISH) costs latency, never an event. Mutable only as a\n * white-box test seam.\n */\nexport const NOTIFY_TIMINGS: {\n  safetyReadMs: number\n} = {\n  safetyReadMs: 10_000,\n}\n\n/**\n * Bounds for each server instance's in-memory reducer-state cache. Sizes are\n * encoded JSON lengths, re-measured every `measureEvery` folded events, so\n * the byte budget is approximate. Mutable only as a white-box test seam.\n */\nexport const STATE_CACHE: {\n  maxEntries: number\n  maxBytes: number\n  /** Events a cached state may advance before it writes a snapshot. */\n  snapshotEvery: number\n  /** Events a warm read may fold; longer tails read the stored snapshot. */\n  maxTail: number\n  /** Events folded between re-measuring a cached state's encoded size. */\n  measureEvery: number\n} = {\n  maxEntries: 1_000,\n  maxBytes: 32 * 1024 * 1024,\n  snapshotEvery: 128,\n  maxTail: 255,\n  measureEvery: 16,\n}\n\n/**\n * Warm state-read tails for stores that can serve one in a single request:\n * events from `fromIndex` (inclusive) through `throughIndex` or the newest\n * event, or null when that needs more than one request. Like every store\n * read, a tail starts no lower than the latest clear marker. Keyed by the exact\n * store object, so a wrapper built by spreading or proxying a store reads\n * through its own `readHistory` instead.\n */\nexport const stateTailReaders: WeakMap<\n  object,\n  (\n    sessionId: string,\n    fromIndex: number,\n    throughIndex?: number,\n  ) => Promise<Event[] | null>\n> = new WeakMap()\n\nexport const STREAM_TIMINGS: {\n  /** Cadence of `: ping` comment frames from `sseResponse`. */\n  sseHeartbeatMs: number\n  /** How far ahead of an invocation deadline an SSE response closes. */\n  sseDeadlineGraceMs: number\n  /** Client: silence longer than this means the connection is dead. */\n  stallTimeoutMs: number\n  /** Client reconnect backoff: first retry delay, doubling per attempt. */\n  reconnectBaseMs: number\n  /** Client reconnect backoff ceiling. */\n  reconnectMaxMs: number\n} = {\n  sseHeartbeatMs: 15_000,\n  sseDeadlineGraceMs: 1_000,\n  stallTimeoutMs: 35_000,\n  reconnectBaseMs: 500,\n  reconnectMaxMs: 5_000,\n}\n\n/**\n * WebSocket down-pump backpressure — `sessionsSocket` parks its pull\n * loop while the socket reports more buffered bytes than the\n * high-water mark and re-checks on the poll cadence, so a slow reader\n * applies backpressure to the store subscription instead of buffering\n * without bound in the socket. Acks and heartbeats stay exempt: they\n * are small and correctness-relevant. Mutable only as a white-box test\n * seam.\n */\nexport const SOCKET_TIMINGS: {\n  highWaterMarkBytes: number\n  resumePollMs: number\n  /** Up-lane bound: concurrent push/presence handlers per socket. POST\n   * gets per-request platform limits for free; the socket must bring\n   * its own. Over the cap, pushes are answered with a retryable error\n   * ack and presence frames are shed (that plane repaints). */\n  maxInFlightMessages: number\n  /** Hard ceiling on `bufferedAmount`: past it the peer is a\n   * non-reader (acks and pings are park-exempt, so only a peer that\n   * never reads can reach it) and the socket closes 1008. */\n  disconnectWaterMarkBytes: number\n} = {\n  highWaterMarkBytes: 1_048_576,\n  resumePollMs: 25,\n  maxInFlightMessages: 32,\n  disconnectWaterMarkBytes: 8_388_608,\n}\n\n/**\n * Client presence send cadence — a leading send immediately, then at\n * most one merged send per interval (~15Hz). Owned, not configurable\n * (decision #36's rule): coupling the cadence to the POST ack tied\n * remote cursor smoothness to RTT, and the ack serves no correctness\n * purpose on a fire-and-forget LWW plane. Mutable only as a white-box\n * test seam.\n */\nexport const PRESENCE_TIMINGS: {\n  sendIntervalMs: number\n} = {\n  sendIntervalMs: 66,\n}\n"],"mappings":";;;;;;;;AAkBA,SAAgB,kBAAuC;CACrD,OAAO,OAAO,OAAO,IAAI;AAC3B;;;;;;;AAQA,MAAa,cAAc;;;;;;;AAQ3B,MAAa,2CAAgD,IAAI,IAAI;CACnE;CACA;CACA;AACF,CAAC;AAiCD,MAAa,kCAAoD,IAAI,QAAQ;;;;;;AAO7E,MAAa,wCAAyC,IAAI,QAAQ;AAElE,MAAM,cAAc,UACjB,OAAO,UAAU,YAAY,UAAU,QAAS,OAAO,UAAU;AAqBpE,MAAM,qBAAqB,OAAO,IAAI,+BAA+B;AAErE,SAAgB,0BAA+D;CAC7E,MAAM,QAAQ,QAAQ,IAAI,YAAY,kBAAkB;CACxD,IACE,CAAC,WAAW,KAAK,KACjB,OAAO,QAAQ,IAAI,OAAO,UAAU,MAAM,cAC1C,OAAO,QAAQ,IAAI,OAAO,KAAK,MAAM,YAErC;CAEF,OAAO;AACT;AAEA,SAAgB,+BACd,QACyB;CACzB,MAAM,WAAW,wBAAwB;CACzC,IAAI,aAAa,KAAA,GAAW,OAAO;CACnC,MAAM,UAAU,OAAO;CACvB,QAAQ,IAAI,YAAY,oBAAoB,OAAO;CACnD,OAAO;AACT;AAUA,MAAM,yBAAyB,OAAO,IACpC,wCACF;AAEA,MAAM,8BACJ,UAC2C;CAC3C,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO,KAAA;CAC/B,MAAM,SAAS,QAAQ,IAAI,OAAO,sBAAsB;CACxD,IACE,CAAC,WAAW,MAAM,KAClB,QAAQ,IAAI,QAAQ,SAAS,MAAM,KACnC,CAAC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,SAAS,CAAC,KAC7C,CAAC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,QAAQ,CAAC,GAE5C;CAEF,OAAO;AACT;AAEA,MAAM,0BAA0B,UAA2B;CACzD,IACE,WAAW,KAAK,MACf,2BAA2B,KAAK,MAAM,KAAA,KACrC,OAAO,aAAa,KAAK,IAE3B,OAAO;CAET,OAAO,IAAI,MAAM,OAAO,KAAK,GAAG,EAAE,OAAO,MAAM,CAAC;AAClD;AAEA,MAAM,6BACJ,UAC+B;CAC/B,MAAM,WAAW,2BAA2B,KAAK;CACjD,IAAI,aAAa,KAAA,GAAW,OAAO;CACnC,MAAM,SAAqC;EACzC,SAAS;EACT,SAAS,CAAC;EACV,QAAQ,CAAC;CACX;CACA,OAAO,eAAe,OAAO,wBAAwB;EACnD,OAAO;EACP,YAAY;EACZ,cAAc;EACd,UAAU;CACZ,CAAC;CACD,OAAO;AACT;AAEA,MAAM,kCACJ,OACA,WACS;CACT,IAAI,OAAO,QAAQ,WAAW,KAAK,OAAO,OAAO,WAAW,GAC1D,QAAQ,eAAe,OAAO,sBAAsB;AAExD;;;;;AAMA,SAAgB,6BACd,OACA,aACS;CACT,MAAM,aAAa,uBAAuB,KAAK;CAC/C,0BAA0B,UAAU,CAAC,CAAC,QAAQ,KAAK,WAAW;CAC9D,OAAO;AACT;;AAGA,SAAgB,yBAAyB,OAAyB;CAChE,MAAM,SAAS,uBAAuB,KAAK;CAC3C,MAAM,SAAS,0BAA0B,MAAM;CAC/C,OAAO,OAAO,KAAK,OAAO,QAAQ,IAAI,KAAK,WAAW;CACtD,OAAO;AACT;AAEA,SAAgB,4BACd,OAC6C;CAC7C,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO,KAAA;CAC/B,MAAM,SAAS,2BAA2B,KAAK;CAC/C,MAAM,cAAc,QAAQ,OAAO,IAAI;CACvC,IAAI,WAAW,KAAA,GAAW,+BAA+B,OAAO,MAAM;CACtE,OAAO;AACT;AAEA,MAAM,qBAAqB,UAA6C;CACtE,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,MAAM,WAAW,QAAQ,IAAI,OAAO,UAAU;CAC9C,OACE,aAAa,QACb,OAAO,aAAa,YACpB,OAAO,QAAQ,IAAI,UAAU,MAAM,MAAM,YACzC,OAAO,QAAQ,IAAI,OAAO,OAAO,MAAM;AAE3C;;;;;;AAOA,SAAgB,uBACd,SAC+C;CAC/C,MAAM,4BAAY,IAAI,IAAY;CAClC,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,CAAC,kBAAkB,MAAM,GAC3B,MAAM,IAAI,UAAU,qDAAqD;EAE3E,MAAM,OAAO,OAAO,SAAS;EAC7B,IAAI,UAAU,IAAI,IAAI,GACpB,MAAM,IAAI,UACR,4CAA4C,KAAK,iBACnD;EAEF,UAAU,IAAI,IAAI;CACpB;AACF;;;;;;AAOA,MAAa,gBAeT;CACF,YAAY;CACZ,kBAAkB;CAClB,cAAc;CACd,iBAAiB;CACjB,uBAAuB;CACvB,oBAAoB;CACpB,mBAAmB;AACrB;;;;;;;;;;;;;;AAeA,MAAa,eAKT;CACF,eAAe;CACf,eAAe;AACjB;;;;;;;;AASA,MAAa,iBAET,EACF,cAAc,IAChB;;;;;;AAOA,MAAa,cAST;CACF,YAAY;CACZ,UAAU;CACV,eAAe;CACf,SAAS;CACT,cAAc;AAChB;;;;;;;;;AAUA,MAAa,mCAOT,IAAI,QAAQ;AAEhB,MAAa,iBAWT;CACF,gBAAgB;CAChB,oBAAoB;CACpB,gBAAgB;CAChB,iBAAiB;CACjB,gBAAgB;AAClB;;;;;;;;;;AAWA,MAAa,iBAYT;CACF,oBAAoB;CACpB,cAAc;CACd,qBAAqB;CACrB,0BAA0B;AAC5B;;;;;;;;;AAUA,MAAa,mBAET,EACF,gBAAgB,GAClB"}