experimental-a2 0.6.0 → 0.7.0

package/dist/server-DgXmORIq.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"server-DgXmORIq.d.ts","names":[],"sources":["../src/session-socket.ts","../src/server-fetch.ts","../src/scheduler-task.ts","../src/server.ts"],"mappings":";;;;;;;;;;;KAmCY;EACV,KAAK;EACL,GAAG,kBAAkB,WAAW;EAChC,GAAG,gBAAgB;EACnB,GAAG,gBAAgB,WAAW;EAC9B,MAAM,eAAe;;;EAGrB;;;;KCpBG,mBAAmB,UAAU,oBACzB,wBAAwB;KAE5B,wBAAwB,UAAU,gBAAgB,YAClD,WAAW,2BAA0B;KAG9B,YAAY,UAAU,YAAY;WACnC,MAAM,mBAAmB;WACzB;WACA;;KAGC,eAAe,UAAU,eAAe;WACzC;WACA,QAAQ,wBAAwB;WAChC;WACA;;KAGC,YACV,UAAU,YAAY,WACtB,UAAU,eAAe;WAGZ;WACA;WACA;WACA;;WAGA;WACA;WACA;WACA;WACA;;WAGA;WACA;WACA,iBAAiB,YAAY;WAC7B,WAAW,eAAe;WAC1B;;KAGH,oBACV,SAAS,QAAQ,sBACd,WAAW,QAAQ;KAEZ,mBACV,UAAU,YAAY,WACtB,UAAU,eAAe;EAEzB,aAAa,WAAW,YAAY,GAAG,iBAAiB;EACxD,mBAAmB;;;;;KC5ET;EACV;EACA;EACA;;;KAIU;EACV;EACA;EACA;EACA;;EAEA;;;KAIU;EACV;EACA;;EAEA;EACA;EACA;;EAEA;EACA,iBAAiB;;;KAIP,gBAAgB,qBAAqB;;;;KC4CrC,eACV,UAAU,WACV,gBAAgB,mBAAmB,YACnC,UAAU,eAAe;;EAGzB,OAAO,cAAc,GAAG;;EAExB;;EAEA,SAAS,QAAQ,GAAG,cAAc,IAAI;;EAEtC,QAAQ;;KAGE,QACV,UAAU,WACV,gBAAgB,mBAAmB,YACnC,UAAU,eAAe,yBAEzB,KAAK,eAAe,GAAG,GAAG,OACvB,eAAe,YAAY,cAAc,YAAY;KAE9C,YACV,UAAU,WACV,gBAAgB,mBAAmB;EAEnC;EACA,OAAO,KAAK,cAAc,GAAG;IAA4B;;;KAG/C,KACV,UAAU,WACV,gBAAgB,mBAAmB,yBACtB,SAAS,YAAY,GAAG;KAE3B,gBAAgB,UAAU,iBACjC,QAAQ,YAAY,SACpB,QAAQ,cAAc;KAEf,cAAc,UAAU,aAAa,gBAAgB;;EAE/D,UAAU,gBAAgB;;KAGhB,cAAc,UAAU,cAClC,iBACG,QAAQ,YAAY,SACpB,QAAQ,cAAc;KAEf;KAEA;EACR,OAAO;EAAe;;EAAiB,IAAI;EAAM;;KAEzC,gBAAgB,UAAU,cACpC,cACA,QAAQ,mBACL,QAAQ,YAAY,SACpB;;;;;;;;KASO,gBAAgB,UAAU,WAAW,UAAU;;;;;;EAMzD,OAAO;IACL;IACA;MACE,cAAc,cAAc,KAAK,cAAc,KAAK,iBAAiB;;;;;;;EAOzE,YAAY;IACV;IACA,QAAQ,cAAc;IACtB;IACA;MACE;;EAEJ,YAAY,QAAQ,YAAY;;;KAItB,QACV,UAAU,WACV,SAAS,cAAc,IACvB,UAAU,eAAe,wBACvB,aAAa,GAAG,gBAAgB,GAAG;WAC5B;EACT,QAAQ;EACR,UAAU,gBAAgB;EAC1B,QAAQ;IAAY;IAAc;MAAiB,QAAQ,cAAc;EACzE,MAAM,GAAG,SAAS,QAAQ,GAAG,KAAK;IAAU,OAAO;IAAG;;;;;;EAKtD,OAAO;IAAS;MAAwB,cAAc,cAAc;;;;;;;KAQ1D;WACD;aAAqB;;EAC9B,MAAM,oBAAoB;IAAU;;;;;;;;;;;;KAY1B;EACV,SAAS,MAAM,gBAAgB;EAC/B,WAAW,SAAS,qBAAqB,KAAK,YAAY,QAAQ;;KAGxD,SACV,UAAU,WACV,UAAU,eAAe;;WAGhB,UAAU,SAAS,GAAG;WACtB;KACN,SAAS,UAAU,QAAQ;KAC3B,SAAS,SAAS,SAAS,mBAAmB,GAAG,KAAK,QAAQ;;EAEjE,QAAQ,aAAa,QAAQ,GAAG,cAAc,IAAI;;;;;EAKlD,MAAM,oBAAoB;IAAU;;;;;;;;iBAiBhB,uBACpB,QAAQ,iBACR,MAAM,sBACL;;;;;;;;;KAuBS,UAAU,UAAU,WAAW,gBAAgB,cACvD,YAAY,iBAET,WAAW,uBAGN,OAAO,cAAc,GAAG,IACxB,SAAS,cAAc,GAAG,IAC1B;EAAW;;KAIX,aACV,UAAU,WACV,gBAAgB,mBAAmB,YACnC,UAAU,eAAe,wBAEvB,QAAQ,GAAG,GAAG;EAEZ,UAAU,UAAU,GAAG;;EAEvB,OAAO,KAAK,GAAG;EACf,SAAS,QAAQ,GAAG,GAAG;;KAGjB,cACV,UAAU,WACV,UAAU,eAAe;;EAGzB,UAAU,SAAS,GAAG;;EAEtB,QAAQ;;;;;;;EAOR,YAAY;;EAEZ,YAAY;;;;;;EAMZ;IAAa;;;;;;;;EAOb,cAAc,WAAW,cAAc,aAAa,GAAG,GAAG;;;iBA2K5C,aACd,UAAU,WACV,UAAU,eAAe,sBACzB,SAAS,cAAc,GAAG,KAAK,SAAS,GAAG"}

package/dist/server.d.ts

@@ -1,4 +1,4 @@
 import { a as EventDefs, c as PresencePatch, l as PresenceSnapshot, n as Contract, o as PresenceDefs, r as ContractEvent, s as PresenceMap, t as AppendInput } from "./contract-jIfaR085.js";
-import { a as Event, c as IdSource, d as StoreClaimAvailableResult, f as StoreStateRead, g as StoredSnapshot, h as StoredSessionSummary, i as Clock, l as PresenceRow, m as StoredSessionPage, n as A2StoreInspection, o as EventCause, p as StoredEvent, r as AppendEvent, s as FailAttemptResult, t as A2Store, u as StoreAppendResult } from "./store-DysUkTH3.js";
-import { C as deliverSchedulerAppend, D as SchedulerTask, E as SchedulerDrainTask, S as createServer, T as SchedulerAppendTask, _ as Session, a as Handler, b as SessionPresence, c as HandlerEntry, d as PushValidationContext, f as PushedEvent, g as ServerOptions, h as ScheduleTiming, i as DrainableServer, l as Lane, m as ScheduleDelay, n as A2Server, o as HandlerAppend, p as PushedPresence, r as AbortSpec, s as HandlerContext, t as A2Scheduler, u as LaneContext, v as SessionAppend, w as ScheduledEvent, x as SessionSchedule, y as SessionDispatch } from "./server-DpvjhdoE.js";
-export { A2Scheduler, A2Server, type A2Store, type A2StoreInspection, AbortSpec, type AppendEvent, type AppendInput, type Clock, type Contract, type ContractEvent, DrainableServer, type Event, type EventCause, type EventDefs, type FailAttemptResult, Handler, HandlerAppend, HandlerContext, HandlerEntry, type IdSource, Lane, LaneContext, type PresenceDefs, type PresenceMap, type PresencePatch, type PresenceRow, type PresenceSnapshot, PushValidationContext, PushedEvent, PushedPresence, ScheduleDelay, ScheduleTiming, type ScheduledEvent, type SchedulerAppendTask, type SchedulerDrainTask, type SchedulerTask, ServerOptions, Session, SessionAppend, SessionDispatch, SessionPresence, SessionSchedule, type StoreAppendResult, type StoreClaimAvailableResult, type StoreStateRead, type StoredEvent, type StoredSessionPage, type StoredSessionSummary, type StoredSnapshot, createServer, deliverSchedulerAppend };
+import { a as EventCause, c as PresenceRow, d as StoreStateRead, f as StoredEvent, i as Event, l as StoreAppendResult, n as AppendEvent, o as FailAttemptResult, r as Clock, s as IdSource, t as A2Store, u as StoreClaimAvailableResult } from "./store-flRz1OWh.js";
+import { A as A2Socket, C as SchedulerDrainTask, D as A2PushPresence, E as A2PushEvent, O as ServerFetchOptions, S as SchedulerAppendTask, T as A2Operation, _ as SessionPresence, a as Handler, b as deliverSchedulerAppend, c as HandlerEntry, d as ScheduleDelay, f as ScheduleTiming, g as SessionDispatch, h as SessionAppend, i as DrainableServer, k as UpgradeWebSocket, l as Lane, m as Session, n as A2Server, o as HandlerAppend, p as ServerOptions, r as AbortSpec, s as HandlerContext, t as A2Scheduler, u as LaneContext, v as SessionSchedule, w as SchedulerTask, x as ScheduledEvent, y as createServer } from "./server-DgXmORIq.js";
+export { type A2Operation, type A2PushEvent, type A2PushPresence, A2Scheduler, A2Server, type A2Socket, type A2Store, AbortSpec, type AppendEvent, type AppendInput, type Clock, type Contract, type ContractEvent, DrainableServer, type Event, type EventCause, type EventDefs, type FailAttemptResult, Handler, HandlerAppend, HandlerContext, HandlerEntry, type IdSource, Lane, LaneContext, type PresenceDefs, type PresenceMap, type PresencePatch, type PresenceRow, type PresenceSnapshot, ScheduleDelay, ScheduleTiming, type ScheduledEvent, type SchedulerAppendTask, type SchedulerDrainTask, type SchedulerTask, type ServerFetchOptions, ServerOptions, Session, SessionAppend, SessionDispatch, SessionPresence, SessionSchedule, type StoreAppendResult, type StoreClaimAvailableResult, type StoreStateRead, type StoredEvent, type UpgradeWebSocket, createServer, deliverSchedulerAppend };

package/dist/server.js

@@ -1,2 +1,2 @@
-import { n as deliverSchedulerAppend, t as createServer } from "./server-Duw6MVlB.js";
+import { n as deliverSchedulerAppend, t as createServer } from "./server-286j79Mt.js";
 export { createServer, deliverSchedulerAppend };

package/dist/store-N8PXxDAS.js.map

@@ -1 +1 @@
-{"version":3,"file":"store-N8PXxDAS.js","names":[],"sources":["../src/store.ts"],"sourcesContent":["/**\n * The A2Store interface — the storage contract every store backend\n * implements. See specs/a2-implementation.md §2–3.\n *\n * This is the whole storage contract: append, read, dispatch claims,\n * failure markers, snapshots, and the live stream. The scheduler\n * needs nothing extra — the armed queue message is its own state, and\n * the store is the only thing it consults.\n */\n\nimport type { PresencePatch } from './contract.ts'\n\n/** A stored event, as the public API exposes it. */\nexport type Event = {\n  id: string\n  type: string\n  payload: unknown\n  /** Position in the session's event log, from 1. */\n  index: number\n  sessionId: string\n  createdAt: Date\n}\n\n/** The handler dispatch whose append first persisted a child event. */\nexport type EventCause = {\n  index: number\n  attempt: number\n  /** Size of one named handler append, used to reject truncated retries. */\n  batchSize?: number\n}\n\n/**\n * What the store persists: immutable event history, including its causal edge,\n * plus derived dispatch and failure bookkeeping. The bookkeeping is disposable;\n * the event and its cause are not.\n */\nexport type StoredEvent = Event & {\n  /** Same-session handler dispatch that appended this event; null means root. */\n  cause: EventCause | null\n  /** Session-scoped serial execution key resolved when the event is appended. */\n  lane: string | null\n  /** Adapter clock time recorded by append settlement, completion, or manual skip; null while pending. */\n  processedAt: Date | null\n  /** Dispatch attempt that completed this event; null without dispatch or while pending. */\n  processedByAttempt: number | null\n  /** Exact ordered child ids atomically returned by the completing attempt. */\n  returnedEventIds: string[] | null\n  /** Adapter clock time recorded by the first durable dispatch claim. */\n  firstClaimedAt: Date | null\n  /** Adapter clock time recorded by the most recent durable dispatch claim. */\n  lastClaimedAt: Date | null\n  /** Durable dispatch claims, including claims abandoned by hard kills. */\n  attemptCount: number\n  /** Current dispatch holder; null when the event is not claimed. */\n  claimHolder: string | null\n  /** Adapter clock expiry for the current dispatch claim. */\n  claimExpiresAt: Date | null\n  /** Caught handler failures. This alone drives dead-lettering. */\n  failureCount: number\n  /** Adapter clock time recorded by the most recent caught handler failure. */\n  lastFailedAt: Date | null\n  /** Dispatch attempt that produced the most recent caught handler failure. */\n  lastFailedAttempt: number | null\n  /** The last handler failure, stringified. */\n  lastError: string | null\n  /** Adapter clock time recorded when dead-lettered; null otherwise. */\n  failedAt: Date | null\n}\n\n/** Durable, read-only session metadata for administrative inspection. */\nexport type StoredSessionSummary = {\n  sessionId: string\n  eventCount: number\n  pendingCount: number\n  failedCount: number\n  /** Durable dispatch claims across every event in the session. */\n  attemptCount: number\n  /** Caught handler failures across every event in the session. */\n  failureCount: number\n  firstEventAt: Date\n  updatedAt: Date\n}\n\n/**\n * One live presence value, as `A2Store.presence.read` returns it. The\n * row is the LWW unit — one participant's one field. `at` is the\n * sender's stamp, the LWW comparator. `expiresAt` is the storage's\n * own clock at the applied set plus its `ttlMs` — never derived from\n * the sender stamp; a row is live strictly before it.\n */\nexport type PresenceRow = {\n  participant: string\n  field: string\n  value: unknown\n  seen: number\n  at: Date\n  expiresAt: Date\n}\n\n/** Metadata for the latest cached fold of one reducer. */\nexport type StoredSnapshot = {\n  reducerName: string\n  index: number\n  updatedAt: Date\n}\n\n/** One consistent cache-plus-tail read for a reducer fold. */\nexport type StoreStateRead = {\n  /** The latest cached fold for this reducer, if one exists. */\n  snapshot: { index: number; state: unknown } | null\n  /** Immutable events strictly after `snapshot.index`, or the full log on a miss. */\n  events: Event[]\n}\n\nexport type StoredSessionPage = {\n  sessions: StoredSessionSummary[]\n  /** Opaque backend cursor; null means there is no next page. */\n  cursor: string | null\n}\n\nexport type StoredEventPage = {\n  events: StoredEvent[]\n  /** Fixed inclusive log frontier shared by every page in one inspection. */\n  throughIndex: number\n}\n\n/**\n * Optional read-only administration implemented by A2's shipped stores.\n * It is separate from the correctness contract so custom stores do not\n * need to expose storage-wide discovery merely to process events.\n */\nexport type A2StoreInspection = {\n  listSessions(options: {\n    /** Storage namespace prefix, including the contract separator. */\n    prefix: string\n    cursor?: string\n    limit: number\n  }): Promise<StoredSessionPage>\n  /**\n   * A bounded event page for read-only administration. The first page captures\n   * `throughIndex`; callers pass it back so concurrent appends cannot extend a\n   * walk indefinitely. Optional for custom stores; A2 falls back to `read()`.\n   */\n  readEvents?(\n    sessionId: string,\n    options: { afterIndex: number; throughIndex?: number; limit: number },\n  ): Promise<StoredEventPage>\n  listSnapshots(sessionId: string): Promise<StoredSnapshot[]>\n}\n\n/** The result of atomically claiming every currently eligible event. */\nexport type StoreClaimAvailableResult =\n  | { outcome: 'claimed'; events: StoredEvent[] }\n  | { outcome: 'busy'; retryAt: Date }\n  | { outcome: 'settled' }\n\n/** A completion may lose to a newer claim or an earlier completion. */\nexport type CompleteAttemptResult =\n  { outcome: 'completed'; events: StoredEvent[] } | { outcome: 'superseded' }\n\n/** The result of one claim-renewal heartbeat, both lists in append order. */\nexport type RenewClaimsResult = {\n  /** Listed claims that remain owned by the holder. */\n  renewed: number[]\n  /** Listed claims whose event a newer attempt has durably taken. */\n  superseded: number[]\n}\n\n/** The result of atomically recording a caught handler failure. */\nexport type FailAttemptResult = {\n  outcome: 'failed' | 'dead_lettered' | 'superseded'\n  failureCount: number\n}\n\n/** Input to `A2Store.append` — already validated by the machine. */\nexport type AppendEvent = {\n  type: string\n  payload: unknown\n  /** Caller-supplied idempotency key; generated when absent. */\n  id?: string\n  /** Internal causal edge supplied atomically by handler `session.append`. */\n  cause?: EventCause\n  /** Session-scoped serial execution key resolved before persistence. */\n  lane?: string\n  /** Internal hint: settle this event in the append transaction; no handler is registered. */\n  settled?: true\n}\n\n/** A handler-returned event with the deterministic id retries require. */\nexport type ReturnedEvent = AppendEvent & { id: string }\n\n/** The rows written by an append and the session's pending state. */\nexport type StoreAppendResult = {\n  events: StoredEvent[]\n  /** Whether the session contains an event without a completion marker. */\n  hasPending: boolean\n}\n\n/**\n * An injectable clock. Adapters take one so tests can drive claim\n * expiry, failure timestamps, and (later) stuck-session detection\n * deterministically — against real storage, no mocking.\n */\nexport type Clock = {\n  now(): Date\n}\n\n/** An injectable id source for generated event ids. */\nexport type IdSource = () => string\n\nexport const SYSTEM_CLOCK: Clock = {\n  now: () => new Date(),\n}\n\nexport const RANDOM_IDS: IdSource = () => crypto.randomUUID()\n\nexport interface A2Store {\n  /**\n   * Accepts a batch; the batch is atomic — one transaction, consecutive\n   * `index`es, all-or-nothing. The idempotency key covers the whole\n   * operation, not each item: if *every* event's `id` already exists in\n   * this session, this is a retry of a committed batch whose ack was\n   * lost — return the existing rows as success. If only *some* ids\n   * exist, the caller mixed an already-sent batch with fresh events —\n   * always a caller bug — so throw `A2Error('PARTIAL_DUPLICATE_BATCH')`.\n   * Events carrying `settled: true` get `processedAt` in this same atomic\n   * operation, with no dispatch claim or `processedByAttempt`. The result's\n   * `hasPending` reflects the whole session in the same atomic operation,\n   * including older events and idempotent retries.\n   *\n   * An event carrying `cause` is a handler append, fenced by attempt\n   * currency: accept it only while `cause.attempt` is still the parent\n   * event's latest attempt and the parent is not dead-lettered; otherwise\n   * throw `A2Error('SUPERSEDED_ATTEMPT')` and write nothing. The check is\n   * part of this atomic operation and must serialize against a concurrent\n   * `claimAvailable` — an unlocked read of the parent admits write skew.\n   * The idempotent-replay path runs first, so a batch whose ids all exist\n   * replays regardless of the current attempt.\n   */\n  append(sessionId: string, events: AppendEvent[]): Promise<StoreAppendResult>\n\n  /** Events for one session, oldest first. Bounds form `(afterIndex, throughIndex]`. */\n  read(\n    sessionId: string,\n    opts?: { afterIndex?: number; throughIndex?: number },\n  ): Promise<StoredEvent[]>\n\n  /**\n   * Atomically claims every eligible pending event. Unlaned events are all\n   * independently eligible. Within a lane, only the lowest-index unfinished\n   * event is eligible. A live claim produces `busy` only when it is the sole\n   * remaining obstacle to actionable work. Claimed events are returned in event-log\n   * order. Excluded rows remain lane barriers.\n   */\n  claimAvailable(options: {\n    sessionId: string\n    holder: string\n    ttlMs: number\n    expiresAtMs?: number\n    excludeIndexes?: readonly number[]\n  }): Promise<StoreClaimAvailableResult>\n\n  /**\n   * Renews the listed live claims still owned by `holder`. Each listed claim\n   * carries the attempt ordinal the holder owns. `renewed` lists the claims\n   * that remain owned after the operation; `superseded` lists the claims\n   * whose event's `attemptCount` has durably passed the listed attempt. An\n   * expired claim no successor has taken appears in neither list — its\n   * attempt may still complete (`completeAttempt` is the fence), so it is\n   * not reported as lost. Renewal never revives an expired claim.\n   */\n  renewClaims(options: {\n    sessionId: string\n    holder: string\n    claims: readonly { index: number; attempt: number }[]\n    ttlMs: number\n    expiresAtMs?: number\n  }): Promise<RenewClaimsResult>\n\n  /**\n   * Atomically completes one current attempt and appends its returned events.\n   * Retrying a committed completion with the same attempt and deterministic\n   * child ids returns the existing children. A stale attempt never appends.\n   */\n  completeAttempt(options: {\n    sessionId: string\n    index: number\n    attempt: number\n    events: ReturnedEvent[]\n  }): Promise<CompleteAttemptResult>\n\n  /**\n   * Atomically records a caught failure for one claimed attempt. A stale\n   * attempt cannot poison a processed event or a newer dispatch. Accepted\n   * failures record the operation's clock time.\n   */\n  failAttempt(options: {\n    sessionId: string\n    index: number\n    attempt: number\n    error: string\n    maxFailures: number\n  }): Promise<FailAttemptResult>\n\n  /**\n   * Reads a reducer snapshot and its event tail as one consistent adapter\n   * operation. On a cache miss, `snapshot` is null and `events` is the full\n   * log. The snapshot is untrusted; core may reject it and issue a full\n   * `read()` when its state schema no longer accepts the cached value.\n   */\n  readState(sessionId: string, reducerName: string): Promise<StoreStateRead>\n\n  /**\n   * Optional batched `readState` — one consistent snapshot-plus-tail read\n   * per session id, aligned positionally with the input (duplicates\n   * allowed). Each element has its own frontier; the batch makes no\n   * cross-session consistency claim. Core falls back to parallel\n   * `readState` calls when absent.\n   */\n  readStates?(\n    sessionIds: string[],\n    reducerName: string,\n  ): Promise<StoreStateRead[]>\n\n  /**\n   * Writes a disposable reducer cache. Guard this operation so a slower\n   * concurrent writer can never clobber a further-along snapshot\n   * (`where up_to_index < excluded.up_to_index`).\n   */\n  putSnapshot(\n    sessionId: string,\n    reducerName: string,\n    index: number,\n    state: unknown,\n  ): Promise<void>\n\n  /**\n   * Optional ephemeral-plane capability (specs/a2-implementation.md\n   * §15.1) — optional like snapshots are. Values arrive already\n   * validated by core; adapters store them opaquely. Presence never\n   * touches the event log: no index, no history row, no recovery arm.\n   */\n  presence?: {\n    /**\n     * Field-wise last-writer-wins merge of one participant's values:\n     * a field whose existing row has a strictly newer `at` (the\n     * sender's stamp) is left untouched; `null` deletes the row. Every\n     * applied write refreshes that field's expiry to the storage's own\n     * clock plus `ttlMs` — the sender stamp orders writes but never\n     * anchors their lifetime.\n     */\n    set(\n      ns: string,\n      participant: string,\n      values: Record<string, unknown | null>,\n      meta: { seen: number; at: Date; ttlMs: number },\n    ): Promise<void>\n\n    /** The current map, pruned of rows at or past their `expiresAt`. */\n    read(ns: string): Promise<PresenceRow[]>\n\n    /**\n     * Push-tier patch delivery; present only on backends with a real\n     * broadcast primitive. Without it the backend is the degraded\n     * tier: live feeds surface presence by re-reading on their\n     * existing poll cadence.\n     */\n    subscribe?(ns: string, onPatch: (patch: PresencePatch) => void): () => void\n  }\n\n  /** Read-only operational data used by `experimental-a2/devtools/server`. */\n  inspect?: A2StoreInspection\n\n  /**\n   * A live feed of one session's events, starting after `startAfter`\n   * (exclusive). Transport is the backend's choice — in-process pub/sub,\n   * polling, LISTEN/NOTIFY — callers never branch on which. The iterable\n   * ends when the consumer calls `return()` (e.g. a disconnecting SSE\n   * client) and must deliver events appended after subscription.\n   */\n  stream(\n    sessionId: string,\n    opts?: { startAfter?: number },\n  ): AsyncIterable<Event>\n}\n"],"mappings":";AAkNA,MAAa,eAAsB,EACjC,2BAAW,IAAI,KAAK,EACtB;AAEA,MAAa,mBAA6B,OAAO,WAAW"}
+{"version":3,"file":"store-N8PXxDAS.js","names":[],"sources":["../src/store.ts"],"sourcesContent":["/**\n * The A2Store interface — the storage contract every store backend\n * implements. See specs/a2-implementation.md §2–3.\n *\n * This is the whole storage contract: append, read, dispatch claims,\n * failure markers, snapshots, and the live stream. The scheduler\n * needs nothing extra — the armed queue message is its own state, and\n * the store is the only thing it consults.\n */\n\nimport type { PresencePatch } from './contract.ts'\n\n/** A stored event, as the public API exposes it. */\nexport type Event = {\n  id: string\n  type: string\n  payload: unknown\n  /** Position in the session's event log, from 1. */\n  index: number\n  sessionId: string\n  createdAt: Date\n}\n\n/** The handler dispatch whose append first persisted a child event. */\nexport type EventCause = {\n  index: number\n  attempt: number\n  /** Size of one named handler append, used to reject truncated retries. */\n  batchSize?: number\n}\n\n/**\n * What the store persists: immutable event history, including its causal edge,\n * plus derived dispatch and failure bookkeeping. The bookkeeping is disposable;\n * the event and its cause are not.\n */\nexport type StoredEvent = Event & {\n  /** Same-session handler dispatch that appended this event; null means root. */\n  cause: EventCause | null\n  /** Session-scoped serial execution key resolved when the event is appended. */\n  lane: string | null\n  /** Adapter clock time recorded by append settlement, completion, or manual skip; null while pending. */\n  processedAt: Date | null\n  /** Dispatch attempt that completed this event; null without dispatch or while pending. */\n  processedByAttempt: number | null\n  /** Exact ordered child ids atomically returned by the completing attempt. */\n  returnedEventIds: string[] | null\n  /** Adapter clock time recorded by the first durable dispatch claim. */\n  firstClaimedAt: Date | null\n  /** Adapter clock time recorded by the most recent durable dispatch claim. */\n  lastClaimedAt: Date | null\n  /** Durable dispatch claims, including claims abandoned by hard kills. */\n  attemptCount: number\n  /** Current dispatch holder; null when the event is not claimed. */\n  claimHolder: string | null\n  /** Adapter clock expiry for the current dispatch claim. */\n  claimExpiresAt: Date | null\n  /** Caught handler failures. This alone drives dead-lettering. */\n  failureCount: number\n  /** Adapter clock time recorded by the most recent caught handler failure. */\n  lastFailedAt: Date | null\n  /** Dispatch attempt that produced the most recent caught handler failure. */\n  lastFailedAttempt: number | null\n  /** The last handler failure, stringified. */\n  lastError: string | null\n  /** Adapter clock time recorded when dead-lettered; null otherwise. */\n  failedAt: Date | null\n}\n\n/**\n * One live presence value, as `A2Store.presence.read` returns it. The\n * row is the LWW unit — one participant's one field. `at` is the\n * sender's stamp, the LWW comparator. `expiresAt` is the storage's\n * own clock at the applied set plus its `ttlMs` — never derived from\n * the sender stamp; a row is live strictly before it.\n */\nexport type PresenceRow = {\n  participant: string\n  field: string\n  value: unknown\n  seen: number\n  at: Date\n  expiresAt: Date\n}\n\n/** One consistent cache-plus-tail read for a reducer fold. */\nexport type StoreStateRead = {\n  /** The latest cached fold for this reducer, if one exists. */\n  snapshot: { index: number; state: unknown } | null\n  /** Immutable events strictly after `snapshot.index`, or the full log on a miss. */\n  events: Event[]\n}\n\n/** The result of atomically claiming every currently eligible event. */\nexport type StoreClaimAvailableResult =\n  | { outcome: 'claimed'; events: StoredEvent[] }\n  | { outcome: 'busy'; retryAt: Date }\n  | { outcome: 'settled' }\n\n/** A completion may lose to a newer claim or an earlier completion. */\nexport type CompleteAttemptResult =\n  { outcome: 'completed'; events: StoredEvent[] } | { outcome: 'superseded' }\n\n/** The result of one claim-renewal heartbeat, both lists in append order. */\nexport type RenewClaimsResult = {\n  /** Listed claims that remain owned by the holder. */\n  renewed: number[]\n  /** Listed claims whose event a newer attempt has durably taken. */\n  superseded: number[]\n}\n\n/** The result of atomically recording a caught handler failure. */\nexport type FailAttemptResult = {\n  outcome: 'failed' | 'dead_lettered' | 'superseded'\n  failureCount: number\n}\n\n/** Input to `A2Store.append` — already validated by the machine. */\nexport type AppendEvent = {\n  type: string\n  payload: unknown\n  /** Caller-supplied idempotency key; generated when absent. */\n  id?: string\n  /** Internal causal edge supplied atomically by handler `session.append`. */\n  cause?: EventCause\n  /** Session-scoped serial execution key resolved before persistence. */\n  lane?: string\n  /** Internal hint: settle this event in the append transaction; no handler is registered. */\n  settled?: true\n}\n\n/** A handler-returned event with the deterministic id retries require. */\nexport type ReturnedEvent = AppendEvent & { id: string }\n\n/** The rows written by an append and the session's pending state. */\nexport type StoreAppendResult = {\n  events: StoredEvent[]\n  /** Whether the session contains an event without a completion marker. */\n  hasPending: boolean\n}\n\n/**\n * An injectable clock. Adapters take one so tests can drive claim\n * expiry, failure timestamps, and (later) stuck-session detection\n * deterministically — against real storage, no mocking.\n */\nexport type Clock = {\n  now(): Date\n}\n\n/** An injectable id source for generated event ids. */\nexport type IdSource = () => string\n\nexport const SYSTEM_CLOCK: Clock = {\n  now: () => new Date(),\n}\n\nexport const RANDOM_IDS: IdSource = () => crypto.randomUUID()\n\nexport interface A2Store {\n  /**\n   * Accepts a batch; the batch is atomic — one transaction, consecutive\n   * `index`es, all-or-nothing. The idempotency key covers the whole\n   * operation, not each item: if *every* event's `id` already exists in\n   * this session, this is a retry of a committed batch whose ack was\n   * lost — return the existing rows as success. If only *some* ids\n   * exist, the caller mixed an already-sent batch with fresh events —\n   * always a caller bug — so throw `A2Error('PARTIAL_DUPLICATE_BATCH')`.\n   * Events carrying `settled: true` get `processedAt` in this same atomic\n   * operation, with no dispatch claim or `processedByAttempt`. The result's\n   * `hasPending` reflects the whole session in the same atomic operation,\n   * including older events and idempotent retries.\n   *\n   * An event carrying `cause` is a handler append, fenced by attempt\n   * currency: accept it only while `cause.attempt` is still the parent\n   * event's latest attempt and the parent is not dead-lettered; otherwise\n   * throw `A2Error('SUPERSEDED_ATTEMPT')` and write nothing. The check is\n   * part of this atomic operation and must serialize against a concurrent\n   * `claimAvailable` — an unlocked read of the parent admits write skew.\n   * The idempotent-replay path runs first, so a batch whose ids all exist\n   * replays regardless of the current attempt.\n   */\n  append(sessionId: string, events: AppendEvent[]): Promise<StoreAppendResult>\n\n  /** Events for one session, oldest first. Bounds form `(afterIndex, throughIndex]`. */\n  read(\n    sessionId: string,\n    opts?: { afterIndex?: number; throughIndex?: number },\n  ): Promise<StoredEvent[]>\n\n  /**\n   * Atomically claims every eligible pending event. Unlaned events are all\n   * independently eligible. Within a lane, only the lowest-index unfinished\n   * event is eligible. A live claim produces `busy` only when it is the sole\n   * remaining obstacle to actionable work. Claimed events are returned in event-log\n   * order. Excluded rows remain lane barriers.\n   */\n  claimAvailable(options: {\n    sessionId: string\n    holder: string\n    ttlMs: number\n    expiresAtMs?: number\n    excludeIndexes?: readonly number[]\n  }): Promise<StoreClaimAvailableResult>\n\n  /**\n   * Renews the listed live claims still owned by `holder`. Each listed claim\n   * carries the attempt ordinal the holder owns. `renewed` lists the claims\n   * that remain owned after the operation; `superseded` lists the claims\n   * whose event's `attemptCount` has durably passed the listed attempt. An\n   * expired claim no successor has taken appears in neither list — its\n   * attempt may still complete (`completeAttempt` is the fence), so it is\n   * not reported as lost. Renewal never revives an expired claim.\n   */\n  renewClaims(options: {\n    sessionId: string\n    holder: string\n    claims: readonly { index: number; attempt: number }[]\n    ttlMs: number\n    expiresAtMs?: number\n  }): Promise<RenewClaimsResult>\n\n  /**\n   * Atomically completes one current attempt and appends its returned events.\n   * Retrying a committed completion with the same attempt and deterministic\n   * child ids returns the existing children. A stale attempt never appends.\n   */\n  completeAttempt(options: {\n    sessionId: string\n    index: number\n    attempt: number\n    events: ReturnedEvent[]\n  }): Promise<CompleteAttemptResult>\n\n  /**\n   * Atomically records a caught failure for one claimed attempt. A stale\n   * attempt cannot poison a processed event or a newer dispatch. Accepted\n   * failures record the operation's clock time.\n   */\n  failAttempt(options: {\n    sessionId: string\n    index: number\n    attempt: number\n    error: string\n    maxFailures: number\n  }): Promise<FailAttemptResult>\n\n  /**\n   * Reads a reducer snapshot and its event tail as one consistent adapter\n   * operation. On a cache miss, `snapshot` is null and `events` is the full\n   * log. The snapshot is untrusted; core may reject it and issue a full\n   * `read()` when its state schema no longer accepts the cached value.\n   */\n  readState(sessionId: string, reducerName: string): Promise<StoreStateRead>\n\n  /**\n   * Optional batched `readState` — one consistent snapshot-plus-tail read\n   * per session id, aligned positionally with the input (duplicates\n   * allowed). Each element has its own frontier; the batch makes no\n   * cross-session consistency claim. Core falls back to parallel\n   * `readState` calls when absent.\n   */\n  readStates?(\n    sessionIds: string[],\n    reducerName: string,\n  ): Promise<StoreStateRead[]>\n\n  /**\n   * Writes a disposable reducer cache. Guard this operation so a slower\n   * concurrent writer can never clobber a further-along snapshot\n   * (`where up_to_index < excluded.up_to_index`).\n   */\n  putSnapshot(\n    sessionId: string,\n    reducerName: string,\n    index: number,\n    state: unknown,\n  ): Promise<void>\n\n  /**\n   * Optional ephemeral-plane capability (specs/a2-implementation.md\n   * §15.1) — optional like snapshots are. Values arrive already\n   * validated by core; adapters store them opaquely. Presence never\n   * touches the event log: no index, no history row, no recovery arm.\n   */\n  presence?: {\n    /**\n     * Field-wise last-writer-wins merge of one participant's values:\n     * a field whose existing row has a strictly newer `at` (the\n     * sender's stamp) is left untouched; `null` deletes the row. Every\n     * applied write refreshes that field's expiry to the storage's own\n     * clock plus `ttlMs` — the sender stamp orders writes but never\n     * anchors their lifetime.\n     */\n    set(\n      ns: string,\n      participant: string,\n      values: Record<string, unknown | null>,\n      meta: { seen: number; at: Date; ttlMs: number },\n    ): Promise<void>\n\n    /** The current map, pruned of rows at or past their `expiresAt`. */\n    read(ns: string): Promise<PresenceRow[]>\n\n    /**\n     * Push-tier patch delivery; present only on backends with a real\n     * broadcast primitive. Without it the backend is the degraded\n     * tier: live feeds surface presence by re-reading on their\n     * existing poll cadence.\n     */\n    subscribe?(ns: string, onPatch: (patch: PresencePatch) => void): () => void\n  }\n\n  /**\n   * A live feed of one session's events, starting after `startAfter`\n   * (exclusive). Transport is the backend's choice — in-process pub/sub,\n   * polling, LISTEN/NOTIFY — callers never branch on which. The iterable\n   * ends when the consumer calls `return()` (e.g. a disconnecting SSE\n   * client) and must deliver events appended after subscription.\n   */\n  stream(\n    sessionId: string,\n    opts?: { startAfter?: number },\n  ): AsyncIterable<Event>\n}\n"],"mappings":";AAyJA,MAAa,eAAsB,EACjC,2BAAW,IAAI,KAAK,EACtB;AAEA,MAAa,mBAA6B,OAAO,WAAW"}

package/dist/{store-DysUkTH3.d.ts → store-flRz1OWh.d.ts}

@@ -54,19 +54,6 @@ type StoredEvent = Event & {
   /** Adapter clock time recorded when dead-lettered; null otherwise. */
   failedAt: Date | null;
 };
-/** Durable, read-only session metadata for administrative inspection. */
-type StoredSessionSummary = {
-  sessionId: string;
-  eventCount: number;
-  pendingCount: number;
-  failedCount: number;
-  /** Durable dispatch claims across every event in the session. */
-  attemptCount: number;
-  /** Caught handler failures across every event in the session. */
-  failureCount: number;
-  firstEventAt: Date;
-  updatedAt: Date;
-};
 /**
  * One live presence value, as `A2Store.presence.read` returns it. The
  * row is the LWW unit — one participant's one field. `at` is the
@@ -82,12 +69,6 @@ type PresenceRow = {
   at: Date;
   expiresAt: Date;
 };
-/** Metadata for the latest cached fold of one reducer. */
-type StoredSnapshot = {
-  reducerName: string;
-  index: number;
-  updatedAt: Date;
-};
 /** One consistent cache-plus-tail read for a reducer fold. */
 type StoreStateRead = {
   /** The latest cached fold for this reducer, if one exists. */
@@ -98,40 +79,6 @@ type StoreStateRead = {
   /** Immutable events strictly after `snapshot.index`, or the full log on a miss. */
   events: Event[];
 };
-type StoredSessionPage = {
-  sessions: StoredSessionSummary[];
-  /** Opaque backend cursor; null means there is no next page. */
-  cursor: string | null;
-};
-type StoredEventPage = {
-  events: StoredEvent[];
-  /** Fixed inclusive log frontier shared by every page in one inspection. */
-  throughIndex: number;
-};
-/**
- * Optional read-only administration implemented by A2's shipped stores.
- * It is separate from the correctness contract so custom stores do not
- * need to expose storage-wide discovery merely to process events.
- */
-type A2StoreInspection = {
-  listSessions(options: {
-    /** Storage namespace prefix, including the contract separator. */
-    prefix: string;
-    cursor?: string;
-    limit: number;
-  }): Promise<StoredSessionPage>;
-  /**
-   * A bounded event page for read-only administration. The first page captures
-   * `throughIndex`; callers pass it back so concurrent appends cannot extend a
-   * walk indefinitely. Optional for custom stores; A2 falls back to `read()`.
-   */
-  readEvents?(sessionId: string, options: {
-    afterIndex: number;
-    throughIndex?: number;
-    limit: number;
-  }): Promise<StoredEventPage>;
-  listSnapshots(sessionId: string): Promise<StoredSnapshot[]>;
-};
 /** The result of atomically claiming every currently eligible event. */
 type StoreClaimAvailableResult = {
   outcome: "claimed";
@@ -330,8 +277,6 @@ interface A2Store {
      */
     subscribe?(ns: string, onPatch: (patch: PresencePatch) => void): () => void;
   };
-  /** Read-only operational data used by `experimental-a2/devtools/server`. */
-  inspect?: A2StoreInspection;
   /**
    * A live feed of one session's events, starting after `startAfter`
    * (exclusive). Transport is the backend's choice — in-process pub/sub,
@@ -344,5 +289,5 @@ interface A2Store {
   }): AsyncIterable<Event>;
 }
 //#endregion
-export { Event as a, IdSource as c, StoreClaimAvailableResult as d, StoreStateRead as f, StoredSnapshot as g, StoredSessionSummary as h, Clock as i, PresenceRow as l, StoredSessionPage as m, A2StoreInspection as n, EventCause as o, StoredEvent as p, AppendEvent as r, FailAttemptResult as s, A2Store as t, StoreAppendResult as u };
-//# sourceMappingURL=store-DysUkTH3.d.ts.map
+export { EventCause as a, PresenceRow as c, StoreStateRead as d, StoredEvent as f, Event as i, StoreAppendResult as l, AppendEvent as n, FailAttemptResult as o, Clock as r, IdSource as s, A2Store as t, StoreClaimAvailableResult as u };
+//# sourceMappingURL=store-flRz1OWh.d.ts.map

package/dist/store-flRz1OWh.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-flRz1OWh.d.ts","names":[],"sources":["../src/store.ts"],"mappings":";;;KAaY;EACV;EACA;EACA;;EAEA;EACA;EACA,WAAW;;;KAID;EACV;EACA;;EAEA;;;;;;;KAQU,cAAc;;EAExB,OAAO;;EAEP;;EAEA,aAAa;;EAEb;;EAEA;;EAEA,gBAAgB;;EAEhB,eAAe;;EAEf;;EAEA;;EAEA,gBAAgB;;EAEhB;;EAEA,cAAc;;EAEd;;EAEA;;EAEA,UAAU;;;;;;;;;KAUA;EACV;EACA;EACA;EACA;EACA,IAAI;EACJ,WAAW;;;KAID;;EAEV;IAAY;IAAe;;;EAE3B,QAAQ;;;KAIE;EACN;EAAoB,QAAQ;;EAC5B;EAAiB,SAAS;;EAC1B;;;KAGM;EACR;EAAsB,QAAQ;;EAAoB;;;KAG1C;;EAEV;;EAEA;;;KAIU;EACV;EACA;;;KAIU;EACV;EACA;;EAEA;;EAEA,QAAQ;;EAER;;EAEA;;;KAIU,gBAAgB;EAAgB;;;KAGhC;EACV,QAAQ;;EAER;;;;;;;KAQU;EACV,OAAO;;;KAIG;UAQK;;;;;;;;;;;;;;;;;;;;;;;EAuBf,OAAO,mBAAmB,QAAQ,gBAAgB,QAAQ;;EAG1D,KACE,mBACA;IAAS;IAAqB;MAC7B,QAAQ;;;;;;;;EASX,eAAe;IACb;IACA;IACA;IACA;IACA;MACE,QAAQ;;;;;;;;;;EAWZ,YAAY;IACV;IACA;IACA;MAAmB;MAAe;;IAClC;IACA;MACE,QAAQ;;;;;;EAOZ,gBAAgB;IACd;IACA;IACA;IACA,QAAQ;MACN,QAAQ;;;;;;EAOZ,YAAY;IACV;IACA;IACA;IACA;IACA;MACE,QAAQ;;;;;;;EAQZ,UAAU,mBAAmB,sBAAsB,QAAQ;;;;;;;;EAS3D,YACE,sBACA,sBACC,QAAQ;;;;;;EAOX,YACE,mBACA,qBACA,eACA,iBACC;;;;;;;EAQH;;;;;;;;;IASE,IACE,YACA,qBACA,QAAQ,gCACR;MAAQ;MAAc,IAAI;MAAM;QAC/B;;IAGH,KAAK,aAAa,QAAQ;;;;;;;IAQ1B,WAAW,YAAY,UAAU,OAAO;;;;;;;;;EAU1C,OACE,mBACA;IAAS;MACR,cAAc"}

package/dist/store-memory.d.ts

@@ -1,4 +1,4 @@
-import { c as IdSource, i as Clock, t as A2Store } from "./store-DysUkTH3.js";
+import { r as Clock, s as IdSource, t as A2Store } from "./store-flRz1OWh.js";
 //#region src/store-memory.d.ts
 type MemoryStoreOptions = {
   /** Injectable clock — every stored timestamp comes from here. */

package/dist/store-memory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"store-memory.d.ts","names":[],"sources":["../src/store-memory.ts"],"mappings":";;KA2BY;;EAEV,QAAQ;;EAER,MAAM;;iBAyEQ,OAAO,UAAS,qBAA0B"}
+{"version":3,"file":"store-memory.d.ts","names":[],"sources":["../src/store-memory.ts"],"mappings":";;KA0BY;;EAEV,QAAQ;;EAER,MAAM;;iBAyEQ,OAAO,UAAS,qBAA0B"}

package/dist/store-memory.js

@@ -1,5 +1,5 @@
 import { t as A2Error } from "./errors-BQuJpe82.js";
-import { g as nullProtoRecord } from "./internal-DstsI6Re.js";
+import { h as nullProtoRecord } from "./internal-DRXJ56EI.js";
 import { t as idempotentReplay } from "./idempotent-replay-DuqEkYA7.js";
 import { n as SYSTEM_CLOCK, t as RANDOM_IDS } from "./store-N8PXxDAS.js";
 //#region src/store-memory.ts
@@ -410,64 +410,6 @@ function memory(options = {}) {
 				};
 			}
 		},
-		inspect: {
-			async listSessions(inspectionOptions) {
-				const ids = [...sessions.keys()].filter((sessionId) => sessionId.startsWith(inspectionOptions.prefix) && (inspectionOptions.cursor === void 0 || sessionId > inspectionOptions.cursor)).toSorted();
-				const visible = ids.slice(0, inspectionOptions.limit);
-				return {
-					sessions: visible.map((sessionId) => {
-						const rows = sessions.get(sessionId);
-						const first = rows[0];
-						let updatedAt = first.createdAt;
-						let pendingCount = 0;
-						let failedCount = 0;
-						let attemptCount = 0;
-						let failureCount = 0;
-						for (const row of rows) {
-							attemptCount += row.attemptCount;
-							failureCount += row.failureCount;
-							if (row.processedAt === null && row.failedAt === null) pendingCount += 1;
-							if (row.failedAt !== null) failedCount += 1;
-							for (const timestamp of [
-								row.createdAt,
-								row.firstClaimedAt,
-								row.lastClaimedAt,
-								row.lastFailedAt,
-								row.processedAt,
-								row.failedAt
-							]) if (timestamp && timestamp > updatedAt) updatedAt = timestamp;
-						}
-						return {
-							sessionId,
-							eventCount: rows.length,
-							pendingCount,
-							failedCount,
-							attemptCount,
-							failureCount,
-							firstEventAt: new Date(first.createdAt),
-							updatedAt: new Date(updatedAt)
-						};
-					}),
-					cursor: ids.length > visible.length ? visible.at(-1) ?? null : null
-				};
-			},
-			async readEvents(sessionId, pageOptions) {
-				const rows = sessions.get(sessionId) ?? [];
-				const throughIndex = Math.min(pageOptions.throughIndex ?? rows.length, rows.length);
-				return {
-					events: rows.slice(pageOptions.afterIndex, throughIndex).slice(0, pageOptions.limit).map(toStored),
-					throughIndex
-				};
-			},
-			async listSnapshots(sessionId) {
-				const prefix = `${sessionId}\u0000`;
-				return [...snapshots.entries()].filter(([key]) => key.startsWith(prefix)).map(([key, snapshot]) => ({
-					reducerName: key.slice(prefix.length),
-					index: snapshot.index,
-					updatedAt: new Date(snapshot.updatedAt)
-				})).toSorted((a, b) => a.reducerName.localeCompare(b.reducerName));
-			}
-		},
 		stream(sessionId, opts) {
 			const startAfter = opts?.startAfter ?? 0;
 			return { [Symbol.asyncIterator]() {

package/dist/store-memory.js.map

@@ -1 +1 @@
-{"version":3,"file":"store-memory.js","names":[],"sources":["../src/store-memory.ts"],"sourcesContent":["/**\n * experimental-a2/store-memory — in-memory store backend (the test default).\n *\n * Implements the A2Store interface with zero dependencies. See\n * specs/a2-implementation.md §3 for the contract; the conformance suite\n * in test/conformance is the executable version of it.\n */\n\nimport type { PresencePatch } from './contract.ts'\nimport { A2Error } from './errors.ts'\nimport { idempotentReplay } from './idempotent-replay.ts'\nimport { nullProtoRecord } from './internal.ts'\nimport {\n  RANDOM_IDS,\n  SYSTEM_CLOCK,\n  type A2Store,\n  type AppendEvent,\n  type Clock,\n  type Event,\n  type EventCause,\n  type IdSource,\n  type PresenceRow,\n  type StoredEvent,\n  type StoredSessionSummary,\n  type StoreStateRead,\n} from './store.ts'\n\nexport type MemoryStoreOptions = {\n  /** Injectable clock — every stored timestamp comes from here. */\n  clock?: Clock\n  /** Injectable id source for generated event ids. */\n  ids?: IdSource\n}\n\ntype Row = {\n  id: string\n  type: string\n  payload: unknown\n  index: number\n  sessionId: string\n  createdAt: Date\n  cause: EventCause | null\n  lane: string | null\n  processedAt: Date | null\n  processedByAttempt: number | null\n  returnedEventIds: string[] | null\n  firstClaimedAt: Date | null\n  lastClaimedAt: Date | null\n  attemptCount: number\n  claimHolder: string | null\n  claimExpiresAt: Date | null\n  failureCount: number\n  lastFailedAt: Date | null\n  lastFailedAttempt: number | null\n  lastError: string | null\n  failedAt: Date | null\n}\n\ntype PresenceEntry = {\n  value: unknown\n  seen: number\n  at: Date\n  expiresAt: Date\n}\n\ntype LaneQueue = { rows: Row[]; head: number }\ntype SessionDispatch = {\n  ready: Map<number, Row>\n  lanes: Map<string, LaneQueue>\n}\n\nconst toStored = (row: Row): StoredEvent => ({\n  id: row.id,\n  type: row.type,\n  payload: structuredClone(row.payload),\n  index: row.index,\n  sessionId: row.sessionId,\n  createdAt: new Date(row.createdAt),\n  cause: row.cause ? { ...row.cause } : null,\n  lane: row.lane,\n  processedAt: row.processedAt ? new Date(row.processedAt) : null,\n  processedByAttempt: row.processedByAttempt,\n  returnedEventIds: row.returnedEventIds ? [...row.returnedEventIds] : null,\n  firstClaimedAt: row.firstClaimedAt ? new Date(row.firstClaimedAt) : null,\n  lastClaimedAt: row.lastClaimedAt ? new Date(row.lastClaimedAt) : null,\n  attemptCount: row.attemptCount,\n  claimHolder: row.claimHolder,\n  claimExpiresAt: row.claimExpiresAt ? new Date(row.claimExpiresAt) : null,\n  failureCount: row.failureCount,\n  lastFailedAt: row.lastFailedAt ? new Date(row.lastFailedAt) : null,\n  lastFailedAttempt: row.lastFailedAttempt,\n  lastError: row.lastError,\n  failedAt: row.failedAt ? new Date(row.failedAt) : null,\n})\n\nconst toEvent = (row: Row): Event => ({\n  id: row.id,\n  type: row.type,\n  payload: structuredClone(row.payload),\n  index: row.index,\n  sessionId: row.sessionId,\n  createdAt: new Date(row.createdAt),\n})\n\nexport function memory(options: MemoryStoreOptions = {}): A2Store {\n  const clock = options.clock ?? SYSTEM_CLOCK\n  const generateId = options.ids ?? RANDOM_IDS\n\n  const sessions = new Map<string, Row[]>()\n  const dispatch = new Map<string, SessionDispatch>()\n  /** Global unique index on event ids, like the SQL schema's. */\n  const byEventId = new Map<string, Row>()\n  /** Keyed by `${sessionId}\\u0000${reducerName}` — a pure cache. */\n  const snapshots = new Map<\n    string,\n    { index: number; state: unknown; updatedAt: Date }\n  >()\n  const streamSubscribers = new Map<string, Set<(row: Row) => void>>()\n  /** ns → participant → field → latest surviving write. */\n  const presenceRows = new Map<\n    string,\n    Map<string, Map<string, PresenceEntry>>\n  >()\n  const presenceSubscribers = new Map<\n    string,\n    Set<(patch: PresencePatch) => void>\n  >()\n\n  const notifyStreams = (sessionId: string, rows: Row[]): void => {\n    const subs = streamSubscribers.get(sessionId)\n    if (!subs) return\n    for (const listener of subs) {\n      for (const row of rows) listener(row)\n    }\n  }\n\n  const rowsOf = (sessionId: string): Row[] => {\n    let rows = sessions.get(sessionId)\n    if (!rows) {\n      rows = []\n      sessions.set(sessionId, rows)\n    }\n    return rows\n  }\n\n  const dispatchOf = (sessionId: string): SessionDispatch => {\n    let state = dispatch.get(sessionId)\n    if (!state) {\n      state = { ready: new Map(), lanes: new Map() }\n      dispatch.set(sessionId, state)\n    }\n    return state\n  }\n\n  const enqueue = (sessionId: string, row: Row): void => {\n    if (row.processedAt !== null) return\n    const state = dispatchOf(sessionId)\n    if (row.lane === null) {\n      state.ready.set(row.index, row)\n      return\n    }\n    let queue = state.lanes.get(row.lane)\n    if (!queue) {\n      queue = { rows: [], head: 0 }\n      state.lanes.set(row.lane, queue)\n    }\n    queue.rows.push(row)\n    if (queue.rows.length === 1) state.ready.set(row.index, row)\n  }\n\n  const settle = (sessionId: string, row: Row): void => {\n    const state = dispatchOf(sessionId)\n    state.ready.delete(row.index)\n    if (row.lane === null) return\n    const queue = state.lanes.get(row.lane)!\n    if (queue.rows[queue.head] !== row) return\n    queue.head += 1\n    if (queue.head === queue.rows.length) {\n      state.lanes.delete(row.lane)\n      return\n    }\n    const next = queue.rows[queue.head]!\n    if (next.failedAt === null) state.ready.set(next.index, next)\n  }\n\n  const find = (sessionId: string, index: number): Row => {\n    const row = sessions.get(sessionId)?.[index - 1]\n    if (!row) {\n      throw new TypeError(\n        `no event at index ${index} in session '${sessionId}'`,\n      )\n    }\n    return row\n  }\n\n  const appendResult = (sessionId: string, events: StoredEvent[]) => ({\n    events,\n    hasPending: (sessions.get(sessionId) ?? []).some(\n      (row) => row.processedAt === null,\n    ),\n  })\n\n  const claim = (\n    row: Row,\n    holder: string,\n    now: Date,\n    expiresAt: Date,\n  ): StoredEvent => {\n    row.attemptCount += 1\n    row.firstClaimedAt ??= new Date(now)\n    row.lastClaimedAt = new Date(now)\n    row.claimHolder = holder\n    row.claimExpiresAt = new Date(expiresAt)\n    return toStored(row)\n  }\n\n  const checkBatchIds = (\n    sessionId: string,\n    events: readonly (AppendEvent & { id?: string })[],\n  ): Row[] => {\n    const supplied = events.filter(\n      (candidate): candidate is AppendEvent & { id: string } =>\n        candidate.id !== undefined,\n    )\n    const suppliedIds = new Set(supplied.map((candidate) => candidate.id))\n    if (suppliedIds.size !== supplied.length) {\n      throw new A2Error(\n        'PARTIAL_DUPLICATE_BATCH',\n        'batch contains the same event id more than once',\n      )\n    }\n    const existing = supplied\n      .map((candidate) => byEventId.get(candidate.id))\n      .filter((row): row is Row => row !== undefined)\n    const foreign = existing.find((row) => row.sessionId !== sessionId)\n    if (foreign) {\n      throw new A2Error(\n        'PARTIAL_DUPLICATE_BATCH',\n        `event id '${foreign.id}' already exists in another session`,\n      )\n    }\n    return existing\n  }\n\n  const insert = (\n    sessionId: string,\n    events: readonly AppendEvent[],\n    now: Date,\n    cause?: EventCause,\n  ): Row[] => {\n    const rows = rowsOf(sessionId)\n    const base = rows.length === 0 ? 0 : rows[rows.length - 1]!.index\n    const inserted = events.map((candidate, offset): Row => ({\n      id: candidate.id ?? generateId(),\n      type: candidate.type,\n      payload: structuredClone(candidate.payload),\n      index: base + 1 + offset,\n      sessionId,\n      createdAt: new Date(now),\n      cause: cause\n        ? { ...cause }\n        : candidate.cause\n          ? { ...candidate.cause }\n          : null,\n      lane: candidate.lane ?? null,\n      processedAt: candidate.settled ? new Date(now) : null,\n      processedByAttempt: null,\n      returnedEventIds: null,\n      firstClaimedAt: null,\n      lastClaimedAt: null,\n      attemptCount: 0,\n      claimHolder: null,\n      claimExpiresAt: null,\n      failureCount: 0,\n      lastFailedAt: null,\n      lastFailedAttempt: null,\n      lastError: null,\n      failedAt: null,\n    }))\n    for (const row of inserted) {\n      if (byEventId.has(row.id)) {\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          `event id '${row.id}' already exists`,\n        )\n      }\n    }\n    for (const row of inserted) {\n      rows.push(row)\n      byEventId.set(row.id, row)\n      enqueue(sessionId, row)\n    }\n    return inserted\n  }\n\n  const readStateOf = (\n    sessionId: string,\n    reducerName: string,\n  ): StoreStateRead => {\n    const snap = snapshots.get(`${sessionId}\\u0000${reducerName}`)\n    const snapshot = snap\n      ? { index: snap.index, state: structuredClone(snap.state) }\n      : null\n    const afterIndex = snapshot?.index ?? 0\n    return {\n      snapshot,\n      events: (sessions.get(sessionId) ?? [])\n        .filter((row) => row.index > afterIndex)\n        .map(toEvent),\n    }\n  }\n\n  return {\n    async append(sessionId, events) {\n      if (events.length === 0) return appendResult(sessionId, [])\n\n      // Batch-scoped idempotency (a2-implementation.md §3): all ids\n      // already present → lost-ack retry, return the original rows;\n      // some present → the caller mixed sent and fresh events.\n      const existing = checkBatchIds(sessionId, events)\n      if (existing.length > 0) {\n        if (existing.length === events.length) {\n          return appendResult(\n            sessionId,\n            idempotentReplay(events, existing.map(toStored)),\n          )\n        }\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          `batch mixes ${existing.length} already-appended and ${events.length - existing.length} fresh events`,\n        )\n      }\n\n      // Attempt-currency fence: a fresh handler append commits only while\n      // its causal attempt is still the parent's latest (store.ts `append`).\n      const rows = sessions.get(sessionId) ?? []\n      for (const event of events) {\n        if (!event.cause) continue\n        const parent = rows[event.cause.index - 1]\n        if (!parent) {\n          throw new TypeError(\n            `no event at index ${event.cause.index} in session '${sessionId}'`,\n          )\n        }\n        if (\n          parent.attemptCount !== event.cause.attempt ||\n          parent.failedAt !== null\n        ) {\n          throw new A2Error(\n            'SUPERSEDED_ATTEMPT',\n            `attempt ${event.cause.attempt} no longer owns event ${event.cause.index} in session '${sessionId}'`,\n          )\n        }\n      }\n\n      const now = clock.now()\n      const inserted = insert(sessionId, events, now)\n      notifyStreams(sessionId, inserted)\n      return appendResult(sessionId, inserted.map(toStored))\n    },\n\n    async read(sessionId, opts) {\n      const rows = sessions.get(sessionId) ?? []\n      const start = Math.max(0, opts?.afterIndex ?? 0)\n      const end = Math.max(0, opts?.throughIndex ?? rows.length)\n      return rows.slice(start, end).map(toStored)\n    },\n\n    async claimAvailable({\n      sessionId,\n      holder,\n      ttlMs,\n      expiresAtMs,\n      excludeIndexes,\n    }) {\n      const claimedAt = clock.now()\n      const now = claimedAt.getTime()\n      const expiresAt = new Date(expiresAtMs ?? now + ttlMs)\n      const excluded = new Set(excludeIndexes ?? [])\n      const eligible: Row[] = []\n      let retryAt: Date | null = null\n\n      for (const row of dispatchOf(sessionId).ready.values()) {\n        if (row.failedAt !== null || excluded.has(row.index)) continue\n        if (row.claimExpiresAt && row.claimExpiresAt.getTime() > now) {\n          if (!retryAt || row.claimExpiresAt < retryAt) {\n            retryAt = new Date(row.claimExpiresAt)\n          }\n          continue\n        }\n        eligible.push(row)\n      }\n\n      if (eligible.length === 0) {\n        return retryAt ? { outcome: 'busy', retryAt } : { outcome: 'settled' }\n      }\n      eligible.sort((a, b) => a.index - b.index)\n      return {\n        outcome: 'claimed',\n        events: eligible.map((row) => claim(row, holder, claimedAt, expiresAt)),\n      }\n    },\n\n    async renewClaims({ sessionId, holder, claims, ttlMs, expiresAtMs }) {\n      const now = clock.now()\n      const expiresAt = new Date(expiresAtMs ?? now.getTime() + ttlMs)\n      const requested = new Map(claims.map((c) => [c.index, c.attempt]))\n      const renewed: number[] = []\n      const superseded: number[] = []\n      for (const row of sessions.get(sessionId) ?? []) {\n        const attempt = requested.get(row.index)\n        if (attempt === undefined) continue\n        if (row.attemptCount > attempt) {\n          superseded.push(row.index)\n          continue\n        }\n        if (\n          row.processedAt === null &&\n          row.failedAt === null &&\n          row.claimHolder === holder &&\n          row.claimExpiresAt !== null &&\n          row.claimExpiresAt > now\n        ) {\n          row.claimExpiresAt = new Date(expiresAt)\n          renewed.push(row.index)\n        }\n      }\n      return { renewed, superseded }\n    },\n\n    async completeAttempt({ sessionId, index, attempt, events }) {\n      const parent = find(sessionId, index)\n      const cause = { index, attempt }\n      if (parent.processedAt !== null) {\n        if (parent.processedByAttempt !== attempt) {\n          return { outcome: 'superseded' }\n        }\n        const requestedIds = events.map((event) => event.id)\n        if (\n          parent.returnedEventIds === null ||\n          parent.returnedEventIds.length !== requestedIds.length ||\n          parent.returnedEventIds.some(\n            (id, offset) => id !== requestedIds[offset],\n          )\n        ) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'completed attempt does not match the returned event batch',\n          )\n        }\n        const existing = checkBatchIds(sessionId, events)\n        if (\n          existing.length !== events.length ||\n          existing.some(\n            (row) =>\n              row.cause?.index !== index || row.cause.attempt !== attempt,\n          )\n        ) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'completed attempt does not match the returned event batch',\n          )\n        }\n        return {\n          outcome: 'completed',\n          events: idempotentReplay(events, existing.map(toStored)),\n        }\n      }\n      if (\n        parent.attemptCount !== attempt ||\n        parent.failedAt !== null ||\n        parent.claimHolder === null\n      ) {\n        return { outcome: 'superseded' }\n      }\n\n      const existing = checkBatchIds(sessionId, events)\n      if (existing.length > 0) {\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          'returned event batch contains already-appended ids',\n        )\n      }\n      const now = clock.now()\n      const inserted = insert(sessionId, events, now, cause)\n      parent.processedAt = new Date(now)\n      parent.processedByAttempt = attempt\n      parent.returnedEventIds = events.map((event) => event.id)\n      parent.claimHolder = null\n      parent.claimExpiresAt = null\n      settle(sessionId, parent)\n      notifyStreams(sessionId, inserted)\n      return { outcome: 'completed', events: inserted.map(toStored) }\n    },\n\n    async failAttempt({ sessionId, index, attempt, error, maxFailures }) {\n      const row = find(sessionId, index)\n      if (\n        row.processedAt ||\n        row.attemptCount !== attempt ||\n        (row.claimHolder === null && row.lastFailedAttempt !== attempt)\n      ) {\n        return { outcome: 'superseded', failureCount: row.failureCount }\n      }\n      if (row.lastFailedAttempt === attempt && row.claimHolder === null) {\n        return {\n          outcome: row.failedAt ? 'dead_lettered' : 'failed',\n          failureCount: row.failureCount,\n        }\n      }\n      if (row.failedAt) {\n        return { outcome: 'dead_lettered', failureCount: row.failureCount }\n      }\n      row.failureCount += 1\n      row.lastError = error\n      const failedAt = clock.now()\n      row.lastFailedAt = new Date(failedAt)\n      row.lastFailedAttempt = attempt\n      row.claimHolder = null\n      row.claimExpiresAt = null\n      if (row.failureCount >= maxFailures) {\n        row.failedAt = new Date(failedAt)\n        dispatchOf(sessionId).ready.delete(row.index)\n        return {\n          outcome: 'dead_lettered',\n          failureCount: row.failureCount,\n        }\n      }\n      return { outcome: 'failed', failureCount: row.failureCount }\n    },\n\n    async readState(sessionId, reducerName) {\n      return readStateOf(sessionId, reducerName)\n    },\n\n    async readStates(sessionIds, reducerName) {\n      return sessionIds.map((sessionId) => readStateOf(sessionId, reducerName))\n    },\n\n    async putSnapshot(sessionId, reducerName, index, state) {\n      const key = `${sessionId}\\u0000${reducerName}`\n      const existing = snapshots.get(key)\n      // Guarded upsert: a slower concurrent writer must never clobber a\n      // further-along snapshot. A lost race costs a few refolded events\n      // next read — never correctness.\n      if (existing && existing.index >= index) return\n      snapshots.set(key, {\n        index,\n        state: structuredClone(state),\n        updatedAt: clock.now(),\n      })\n    },\n\n    presence: {\n      async set(ns, participant, values, meta) {\n        let participants = presenceRows.get(ns)\n        if (!participants) {\n          participants = new Map()\n          presenceRows.set(ns, participants)\n        }\n        let fields = participants.get(participant)\n        if (!fields) {\n          fields = new Map()\n          participants.set(participant, fields)\n        }\n\n        // Expiry anchors on the storage's own clock — the sender's\n        // `at` orders writes but never extends or shortens a lifetime.\n        const expiresAtMs = clock.now().getTime() + meta.ttlMs\n        // Field-keyed and caller-named — null-prototype, like every\n        // presence map (see `nullProtoRecord`).\n        const applied: Record<string, unknown> = nullProtoRecord()\n        let appliedCount = 0\n        for (const [field, value] of Object.entries(values)) {\n          // Field-wise LWW by `at`; ties go to the incoming write, so\n          // same-stamp sets keep set-then-read intuition.\n          const existing = fields.get(field)\n          if (existing && existing.at > meta.at) continue\n          if (value === null) {\n            fields.delete(field)\n          } else {\n            fields.set(field, {\n              value: structuredClone(value),\n              seen: meta.seen,\n              at: new Date(meta.at),\n              expiresAt: new Date(expiresAtMs),\n            })\n          }\n          applied[field] = structuredClone(value)\n          appliedCount += 1\n        }\n        if (fields.size === 0) participants.delete(participant)\n        if (participants.size === 0) presenceRows.delete(ns)\n\n        // Only applied fields broadcast — a losing write repaints nothing,\n        // so subscribers stay consistent with what read() returns.\n        if (appliedCount === 0) return\n        const subs = presenceSubscribers.get(ns)\n        if (!subs) return\n        const patch: PresencePatch = {\n          participant,\n          values: applied,\n          seen: meta.seen,\n          at: new Date(meta.at),\n        }\n        for (const listener of subs) listener(patch)\n      },\n\n      async read(ns) {\n        const participants = presenceRows.get(ns)\n        if (!participants) return []\n        const now = clock.now()\n        const rows: PresenceRow[] = []\n        for (const [participant, fields] of participants) {\n          for (const [field, entry] of fields) {\n            // Expiry is enforced lazily on read — no timers; a silent\n            // participant's rows vanish the next time anyone looks.\n            if (entry.expiresAt <= now) {\n              fields.delete(field)\n              continue\n            }\n            rows.push({\n              participant,\n              field,\n              value: structuredClone(entry.value),\n              seen: entry.seen,\n              at: new Date(entry.at),\n              expiresAt: new Date(entry.expiresAt),\n            })\n          }\n          if (fields.size === 0) participants.delete(participant)\n        }\n        if (participants.size === 0) presenceRows.delete(ns)\n        return rows\n      },\n\n      subscribe(ns, onPatch) {\n        let subs = presenceSubscribers.get(ns)\n        if (!subs) {\n          subs = new Set()\n          presenceSubscribers.set(ns, subs)\n        }\n        subs.add(onPatch)\n        return () => {\n          subs.delete(onPatch)\n          if (subs.size === 0) presenceSubscribers.delete(ns)\n        }\n      },\n    },\n\n    inspect: {\n      async listSessions(inspectionOptions) {\n        const ids = [...sessions.keys()]\n          .filter(\n            (sessionId) =>\n              sessionId.startsWith(inspectionOptions.prefix) &&\n              (inspectionOptions.cursor === undefined ||\n                sessionId > inspectionOptions.cursor),\n          )\n          .toSorted()\n        const visible = ids.slice(0, inspectionOptions.limit)\n        const summaries = visible.map((sessionId): StoredSessionSummary => {\n          const rows = sessions.get(sessionId)!\n          const first = rows[0]!\n          let updatedAt = first.createdAt\n          let pendingCount = 0\n          let failedCount = 0\n          let attemptCount = 0\n          let failureCount = 0\n          for (const row of rows) {\n            attemptCount += row.attemptCount\n            failureCount += row.failureCount\n            if (row.processedAt === null && row.failedAt === null) {\n              pendingCount += 1\n            }\n            if (row.failedAt !== null) failedCount += 1\n            for (const timestamp of [\n              row.createdAt,\n              row.firstClaimedAt,\n              row.lastClaimedAt,\n              row.lastFailedAt,\n              row.processedAt,\n              row.failedAt,\n            ]) {\n              if (timestamp && timestamp > updatedAt) updatedAt = timestamp\n            }\n          }\n          return {\n            sessionId,\n            eventCount: rows.length,\n            pendingCount,\n            failedCount,\n            attemptCount,\n            failureCount,\n            firstEventAt: new Date(first.createdAt),\n            updatedAt: new Date(updatedAt),\n          }\n        })\n        return {\n          sessions: summaries,\n          cursor: ids.length > visible.length ? (visible.at(-1) ?? null) : null,\n        }\n      },\n      async readEvents(sessionId, pageOptions) {\n        const rows = sessions.get(sessionId) ?? []\n        const throughIndex = Math.min(\n          pageOptions.throughIndex ?? rows.length,\n          rows.length,\n        )\n        return {\n          events: rows\n            .slice(pageOptions.afterIndex, throughIndex)\n            .slice(0, pageOptions.limit)\n            .map(toStored),\n          throughIndex,\n        }\n      },\n      async listSnapshots(sessionId) {\n        const prefix = `${sessionId}\\u0000`\n        return [...snapshots.entries()]\n          .filter(([key]) => key.startsWith(prefix))\n          .map(([key, snapshot]) => ({\n            reducerName: key.slice(prefix.length),\n            index: snapshot.index,\n            updatedAt: new Date(snapshot.updatedAt),\n          }))\n          .toSorted((a, b) => a.reducerName.localeCompare(b.reducerName))\n      },\n    },\n\n    stream(sessionId, opts) {\n      const startAfter = opts?.startAfter ?? 0\n      return {\n        [Symbol.asyncIterator](): AsyncIterator<Event> {\n          let last = startAfter\n          const buffer: Row[] = []\n          let wake: (() => void) | null = null\n          let closed = false\n\n          const onRow = (row: Row): void => {\n            buffer.push(row)\n            wake?.()\n          }\n          let subs = streamSubscribers.get(sessionId)\n          if (!subs) {\n            subs = new Set()\n            streamSubscribers.set(sessionId, subs)\n          }\n          subs.add(onRow)\n          // Seed with history — synchronously, in the same tick as the\n          // subscription, so nothing can slip between the two.\n          const existing = sessions.get(sessionId) ?? []\n          buffer.unshift(...existing.filter((row) => row.index > startAfter))\n\n          const unsubscribe = (): void => {\n            subs.delete(onRow)\n            if (subs.size === 0) streamSubscribers.delete(sessionId)\n          }\n\n          return {\n            async next(): Promise<IteratorResult<Event>> {\n              for (;;) {\n                while (buffer.length > 0) {\n                  const row = buffer.shift()!\n                  if (row.index <= last) continue\n                  last = row.index\n                  return { value: toStored(row), done: false }\n                }\n                if (closed) return { value: undefined, done: true }\n                // oxlint-disable-next-line no-await-in-loop -- wait-for-wake\n                await new Promise<void>((resolve) => {\n                  wake = resolve\n                })\n                wake = null\n              }\n            },\n            async return(): Promise<IteratorResult<Event>> {\n              closed = true\n              unsubscribe()\n              wake?.()\n              return { value: undefined, done: true }\n            },\n          }\n        },\n      }\n    },\n  }\n}\n"],"mappings":";;;;;AAuEA,MAAM,YAAY,SAA2B;CAC3C,IAAI,IAAI;CACR,MAAM,IAAI;CACV,SAAS,gBAAgB,IAAI,OAAO;CACpC,OAAO,IAAI;CACX,WAAW,IAAI;CACf,WAAW,IAAI,KAAK,IAAI,SAAS;CACjC,OAAO,IAAI,QAAQ,EAAE,GAAG,IAAI,MAAM,IAAI;CACtC,MAAM,IAAI;CACV,aAAa,IAAI,cAAc,IAAI,KAAK,IAAI,WAAW,IAAI;CAC3D,oBAAoB,IAAI;CACxB,kBAAkB,IAAI,mBAAmB,CAAC,GAAG,IAAI,gBAAgB,IAAI;CACrE,gBAAgB,IAAI,iBAAiB,IAAI,KAAK,IAAI,cAAc,IAAI;CACpE,eAAe,IAAI,gBAAgB,IAAI,KAAK,IAAI,aAAa,IAAI;CACjE,cAAc,IAAI;CAClB,aAAa,IAAI;CACjB,gBAAgB,IAAI,iBAAiB,IAAI,KAAK,IAAI,cAAc,IAAI;CACpE,cAAc,IAAI;CAClB,cAAc,IAAI,eAAe,IAAI,KAAK,IAAI,YAAY,IAAI;CAC9D,mBAAmB,IAAI;CACvB,WAAW,IAAI;CACf,UAAU,IAAI,WAAW,IAAI,KAAK,IAAI,QAAQ,IAAI;AACpD;AAEA,MAAM,WAAW,SAAqB;CACpC,IAAI,IAAI;CACR,MAAM,IAAI;CACV,SAAS,gBAAgB,IAAI,OAAO;CACpC,OAAO,IAAI;CACX,WAAW,IAAI;CACf,WAAW,IAAI,KAAK,IAAI,SAAS;AACnC;AAEA,SAAgB,OAAO,UAA8B,CAAC,GAAY;CAChE,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,aAAa,QAAQ,OAAO;CAElC,MAAM,2BAAW,IAAI,IAAmB;CACxC,MAAM,2BAAW,IAAI,IAA6B;;CAElD,MAAM,4BAAY,IAAI,IAAiB;;CAEvC,MAAM,4BAAY,IAAI,IAGpB;CACF,MAAM,oCAAoB,IAAI,IAAqC;;CAEnE,MAAM,+BAAe,IAAI,IAGvB;CACF,MAAM,sCAAsB,IAAI,IAG9B;CAEF,MAAM,iBAAiB,WAAmB,SAAsB;EAC9D,MAAM,OAAO,kBAAkB,IAAI,SAAS;EAC5C,IAAI,CAAC,MAAM;EACX,KAAK,MAAM,YAAY,MACrB,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG;CAExC;CAEA,MAAM,UAAU,cAA6B;EAC3C,IAAI,OAAO,SAAS,IAAI,SAAS;EACjC,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,SAAS,IAAI,WAAW,IAAI;EAC9B;EACA,OAAO;CACT;CAEA,MAAM,cAAc,cAAuC;EACzD,IAAI,QAAQ,SAAS,IAAI,SAAS;EAClC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,uBAAO,IAAI,IAAI;IAAG,uBAAO,IAAI,IAAI;GAAE;GAC7C,SAAS,IAAI,WAAW,KAAK;EAC/B;EACA,OAAO;CACT;CAEA,MAAM,WAAW,WAAmB,QAAmB;EACrD,IAAI,IAAI,gBAAgB,MAAM;EAC9B,MAAM,QAAQ,WAAW,SAAS;EAClC,IAAI,IAAI,SAAS,MAAM;GACrB,MAAM,MAAM,IAAI,IAAI,OAAO,GAAG;GAC9B;EACF;EACA,IAAI,QAAQ,MAAM,MAAM,IAAI,IAAI,IAAI;EACpC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,MAAM,CAAC;IAAG,MAAM;GAAE;GAC5B,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;EACjC;EACA,MAAM,KAAK,KAAK,GAAG;EACnB,IAAI,MAAM,KAAK,WAAW,GAAG,MAAM,MAAM,IAAI,IAAI,OAAO,GAAG;CAC7D;CAEA,MAAM,UAAU,WAAmB,QAAmB;EACpD,MAAM,QAAQ,WAAW,SAAS;EAClC,MAAM,MAAM,OAAO,IAAI,KAAK;EAC5B,IAAI,IAAI,SAAS,MAAM;EACvB,MAAM,QAAQ,MAAM,MAAM,IAAI,IAAI,IAAI;EACtC,IAAI,MAAM,KAAK,MAAM,UAAU,KAAK;EACpC,MAAM,QAAQ;EACd,IAAI,MAAM,SAAS,MAAM,KAAK,QAAQ;GACpC,MAAM,MAAM,OAAO,IAAI,IAAI;GAC3B;EACF;EACA,MAAM,OAAO,MAAM,KAAK,MAAM;EAC9B,IAAI,KAAK,aAAa,MAAM,MAAM,MAAM,IAAI,KAAK,OAAO,IAAI;CAC9D;CAEA,MAAM,QAAQ,WAAmB,UAAuB;EACtD,MAAM,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,QAAQ;EAC9C,IAAI,CAAC,KACH,MAAM,IAAI,UACR,qBAAqB,MAAM,eAAe,UAAU,EACtD;EAEF,OAAO;CACT;CAEA,MAAM,gBAAgB,WAAmB,YAA2B;EAClE;EACA,aAAa,SAAS,IAAI,SAAS,KAAK,CAAC,EAAA,CAAG,MACzC,QAAQ,IAAI,gBAAgB,IAC/B;CACF;CAEA,MAAM,SACJ,KACA,QACA,KACA,cACgB;EAChB,IAAI,gBAAgB;EACpB,IAAI,mBAAmB,IAAI,KAAK,GAAG;EACnC,IAAI,gBAAgB,IAAI,KAAK,GAAG;EAChC,IAAI,cAAc;EAClB,IAAI,iBAAiB,IAAI,KAAK,SAAS;EACvC,OAAO,SAAS,GAAG;CACrB;CAEA,MAAM,iBACJ,WACA,WACU;EACV,MAAM,WAAW,OAAO,QACrB,cACC,UAAU,OAAO,KAAA,CACrB;EAEA,IAAI,IADoB,IAAI,SAAS,KAAK,cAAc,UAAU,EAAE,CACtD,CAAC,CAAC,SAAS,SAAS,QAChC,MAAM,IAAI,QACR,2BACA,iDACF;EAEF,MAAM,WAAW,SACd,KAAK,cAAc,UAAU,IAAI,UAAU,EAAE,CAAC,CAAC,CAC/C,QAAQ,QAAoB,QAAQ,KAAA,CAAS;EAChD,MAAM,UAAU,SAAS,MAAM,QAAQ,IAAI,cAAc,SAAS;EAClE,IAAI,SACF,MAAM,IAAI,QACR,2BACA,aAAa,QAAQ,GAAG,oCAC1B;EAEF,OAAO;CACT;CAEA,MAAM,UACJ,WACA,QACA,KACA,UACU;EACV,MAAM,OAAO,OAAO,SAAS;EAC7B,MAAM,OAAO,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAE;EAC5D,MAAM,WAAW,OAAO,KAAK,WAAW,YAAiB;GACvD,IAAI,UAAU,MAAM,WAAW;GAC/B,MAAM,UAAU;GAChB,SAAS,gBAAgB,UAAU,OAAO;GAC1C,OAAO,OAAO,IAAI;GAClB;GACA,WAAW,IAAI,KAAK,GAAG;GACvB,OAAO,QACH,EAAE,GAAG,MAAM,IACX,UAAU,QACR,EAAE,GAAG,UAAU,MAAM,IACrB;GACN,MAAM,UAAU,QAAQ;GACxB,aAAa,UAAU,UAAU,IAAI,KAAK,GAAG,IAAI;GACjD,oBAAoB;GACpB,kBAAkB;GAClB,gBAAgB;GAChB,eAAe;GACf,cAAc;GACd,aAAa;GACb,gBAAgB;GAChB,cAAc;GACd,cAAc;GACd,mBAAmB;GACnB,WAAW;GACX,UAAU;EACZ,EAAE;EACF,KAAK,MAAM,OAAO,UAChB,IAAI,UAAU,IAAI,IAAI,EAAE,GACtB,MAAM,IAAI,QACR,2BACA,aAAa,IAAI,GAAG,iBACtB;EAGJ,KAAK,MAAM,OAAO,UAAU;GAC1B,KAAK,KAAK,GAAG;GACb,UAAU,IAAI,IAAI,IAAI,GAAG;GACzB,QAAQ,WAAW,GAAG;EACxB;EACA,OAAO;CACT;CAEA,MAAM,eACJ,WACA,gBACmB;EACnB,MAAM,OAAO,UAAU,IAAI,GAAG,UAAU,QAAQ,aAAa;EAC7D,MAAM,WAAW,OACb;GAAE,OAAO,KAAK;GAAO,OAAO,gBAAgB,KAAK,KAAK;EAAE,IACxD;EACJ,MAAM,aAAa,UAAU,SAAS;EACtC,OAAO;GACL;GACA,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,EAAA,CAClC,QAAQ,QAAQ,IAAI,QAAQ,UAAU,CAAC,CACvC,IAAI,OAAO;EAChB;CACF;CAEA,OAAO;EACL,MAAM,OAAO,WAAW,QAAQ;GAC9B,IAAI,OAAO,WAAW,GAAG,OAAO,aAAa,WAAW,CAAC,CAAC;GAK1D,MAAM,WAAW,cAAc,WAAW,MAAM;GAChD,IAAI,SAAS,SAAS,GAAG;IACvB,IAAI,SAAS,WAAW,OAAO,QAC7B,OAAO,aACL,WACA,iBAAiB,QAAQ,SAAS,IAAI,QAAQ,CAAC,CACjD;IAEF,MAAM,IAAI,QACR,2BACA,eAAe,SAAS,OAAO,wBAAwB,OAAO,SAAS,SAAS,OAAO,cACzF;GACF;GAIA,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC;GACzC,KAAK,MAAM,SAAS,QAAQ;IAC1B,IAAI,CAAC,MAAM,OAAO;IAClB,MAAM,SAAS,KAAK,MAAM,MAAM,QAAQ;IACxC,IAAI,CAAC,QACH,MAAM,IAAI,UACR,qBAAqB,MAAM,MAAM,MAAM,eAAe,UAAU,EAClE;IAEF,IACE,OAAO,iBAAiB,MAAM,MAAM,WACpC,OAAO,aAAa,MAEpB,MAAM,IAAI,QACR,sBACA,WAAW,MAAM,MAAM,QAAQ,wBAAwB,MAAM,MAAM,MAAM,eAAe,UAAU,EACpG;GAEJ;GAEA,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,WAAW,OAAO,WAAW,QAAQ,GAAG;GAC9C,cAAc,WAAW,QAAQ;GACjC,OAAO,aAAa,WAAW,SAAS,IAAI,QAAQ,CAAC;EACvD;EAEA,MAAM,KAAK,WAAW,MAAM;GAC1B,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC;GACzC,MAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,cAAc,CAAC;GAC/C,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM,gBAAgB,KAAK,MAAM;GACzD,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,QAAQ;EAC5C;EAEA,MAAM,eAAe,EACnB,WACA,QACA,OACA,aACA,kBACC;GACD,MAAM,YAAY,MAAM,IAAI;GAC5B,MAAM,MAAM,UAAU,QAAQ;GAC9B,MAAM,YAAY,IAAI,KAAK,eAAe,MAAM,KAAK;GACrD,MAAM,WAAW,IAAI,IAAI,kBAAkB,CAAC,CAAC;GAC7C,MAAM,WAAkB,CAAC;GACzB,IAAI,UAAuB;GAE3B,KAAK,MAAM,OAAO,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO,GAAG;IACtD,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,IAAI,KAAK,GAAG;IACtD,IAAI,IAAI,kBAAkB,IAAI,eAAe,QAAQ,IAAI,KAAK;KAC5D,IAAI,CAAC,WAAW,IAAI,iBAAiB,SACnC,UAAU,IAAI,KAAK,IAAI,cAAc;KAEvC;IACF;IACA,SAAS,KAAK,GAAG;GACnB;GAEA,IAAI,SAAS,WAAW,GACtB,OAAO,UAAU;IAAE,SAAS;IAAQ;GAAQ,IAAI,EAAE,SAAS,UAAU;GAEvE,SAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;GACzC,OAAO;IACL,SAAS;IACT,QAAQ,SAAS,KAAK,QAAQ,MAAM,KAAK,QAAQ,WAAW,SAAS,CAAC;GACxE;EACF;EAEA,MAAM,YAAY,EAAE,WAAW,QAAQ,QAAQ,OAAO,eAAe;GACnE,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,YAAY,IAAI,KAAK,eAAe,IAAI,QAAQ,IAAI,KAAK;GAC/D,MAAM,YAAY,IAAI,IAAI,OAAO,KAAK,MAAM,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;GACjE,MAAM,UAAoB,CAAC;GAC3B,MAAM,aAAuB,CAAC;GAC9B,KAAK,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG;IAC/C,MAAM,UAAU,UAAU,IAAI,IAAI,KAAK;IACvC,IAAI,YAAY,KAAA,GAAW;IAC3B,IAAI,IAAI,eAAe,SAAS;KAC9B,WAAW,KAAK,IAAI,KAAK;KACzB;IACF;IACA,IACE,IAAI,gBAAgB,QACpB,IAAI,aAAa,QACjB,IAAI,gBAAgB,UACpB,IAAI,mBAAmB,QACvB,IAAI,iBAAiB,KACrB;KACA,IAAI,iBAAiB,IAAI,KAAK,SAAS;KACvC,QAAQ,KAAK,IAAI,KAAK;IACxB;GACF;GACA,OAAO;IAAE;IAAS;GAAW;EAC/B;EAEA,MAAM,gBAAgB,EAAE,WAAW,OAAO,SAAS,UAAU;GAC3D,MAAM,SAAS,KAAK,WAAW,KAAK;GACpC,MAAM,QAAQ;IAAE;IAAO;GAAQ;GAC/B,IAAI,OAAO,gBAAgB,MAAM;IAC/B,IAAI,OAAO,uBAAuB,SAChC,OAAO,EAAE,SAAS,aAAa;IAEjC,MAAM,eAAe,OAAO,KAAK,UAAU,MAAM,EAAE;IACnD,IACE,OAAO,qBAAqB,QAC5B,OAAO,iBAAiB,WAAW,aAAa,UAChD,OAAO,iBAAiB,MACrB,IAAI,WAAW,OAAO,aAAa,OACtC,GAEA,MAAM,IAAI,QACR,2BACA,2DACF;IAEF,MAAM,WAAW,cAAc,WAAW,MAAM;IAChD,IACE,SAAS,WAAW,OAAO,UAC3B,SAAS,MACN,QACC,IAAI,OAAO,UAAU,SAAS,IAAI,MAAM,YAAY,OACxD,GAEA,MAAM,IAAI,QACR,2BACA,2DACF;IAEF,OAAO;KACL,SAAS;KACT,QAAQ,iBAAiB,QAAQ,SAAS,IAAI,QAAQ,CAAC;IACzD;GACF;GACA,IACE,OAAO,iBAAiB,WACxB,OAAO,aAAa,QACpB,OAAO,gBAAgB,MAEvB,OAAO,EAAE,SAAS,aAAa;GAIjC,IADiB,cAAc,WAAW,MAC/B,CAAC,CAAC,SAAS,GACpB,MAAM,IAAI,QACR,2BACA,oDACF;GAEF,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,WAAW,OAAO,WAAW,QAAQ,KAAK,KAAK;GACrD,OAAO,cAAc,IAAI,KAAK,GAAG;GACjC,OAAO,qBAAqB;GAC5B,OAAO,mBAAmB,OAAO,KAAK,UAAU,MAAM,EAAE;GACxD,OAAO,cAAc;GACrB,OAAO,iBAAiB;GACxB,OAAO,WAAW,MAAM;GACxB,cAAc,WAAW,QAAQ;GACjC,OAAO;IAAE,SAAS;IAAa,QAAQ,SAAS,IAAI,QAAQ;GAAE;EAChE;EAEA,MAAM,YAAY,EAAE,WAAW,OAAO,SAAS,OAAO,eAAe;GACnE,MAAM,MAAM,KAAK,WAAW,KAAK;GACjC,IACE,IAAI,eACJ,IAAI,iBAAiB,WACpB,IAAI,gBAAgB,QAAQ,IAAI,sBAAsB,SAEvD,OAAO;IAAE,SAAS;IAAc,cAAc,IAAI;GAAa;GAEjE,IAAI,IAAI,sBAAsB,WAAW,IAAI,gBAAgB,MAC3D,OAAO;IACL,SAAS,IAAI,WAAW,kBAAkB;IAC1C,cAAc,IAAI;GACpB;GAEF,IAAI,IAAI,UACN,OAAO;IAAE,SAAS;IAAiB,cAAc,IAAI;GAAa;GAEpE,IAAI,gBAAgB;GACpB,IAAI,YAAY;GAChB,MAAM,WAAW,MAAM,IAAI;GAC3B,IAAI,eAAe,IAAI,KAAK,QAAQ;GACpC,IAAI,oBAAoB;GACxB,IAAI,cAAc;GAClB,IAAI,iBAAiB;GACrB,IAAI,IAAI,gBAAgB,aAAa;IACnC,IAAI,WAAW,IAAI,KAAK,QAAQ;IAChC,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO,IAAI,KAAK;IAC5C,OAAO;KACL,SAAS;KACT,cAAc,IAAI;IACpB;GACF;GACA,OAAO;IAAE,SAAS;IAAU,cAAc,IAAI;GAAa;EAC7D;EAEA,MAAM,UAAU,WAAW,aAAa;GACtC,OAAO,YAAY,WAAW,WAAW;EAC3C;EAEA,MAAM,WAAW,YAAY,aAAa;GACxC,OAAO,WAAW,KAAK,cAAc,YAAY,WAAW,WAAW,CAAC;EAC1E;EAEA,MAAM,YAAY,WAAW,aAAa,OAAO,OAAO;GACtD,MAAM,MAAM,GAAG,UAAU,QAAQ;GACjC,MAAM,WAAW,UAAU,IAAI,GAAG;GAIlC,IAAI,YAAY,SAAS,SAAS,OAAO;GACzC,UAAU,IAAI,KAAK;IACjB;IACA,OAAO,gBAAgB,KAAK;IAC5B,WAAW,MAAM,IAAI;GACvB,CAAC;EACH;EAEA,UAAU;GACR,MAAM,IAAI,IAAI,aAAa,QAAQ,MAAM;IACvC,IAAI,eAAe,aAAa,IAAI,EAAE;IACtC,IAAI,CAAC,cAAc;KACjB,+BAAe,IAAI,IAAI;KACvB,aAAa,IAAI,IAAI,YAAY;IACnC;IACA,IAAI,SAAS,aAAa,IAAI,WAAW;IACzC,IAAI,CAAC,QAAQ;KACX,yBAAS,IAAI,IAAI;KACjB,aAAa,IAAI,aAAa,MAAM;IACtC;IAIA,MAAM,cAAc,MAAM,IAAI,CAAC,CAAC,QAAQ,IAAI,KAAK;IAGjD,MAAM,UAAmC,gBAAgB;IACzD,IAAI,eAAe;IACnB,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAAG;KAGnD,MAAM,WAAW,OAAO,IAAI,KAAK;KACjC,IAAI,YAAY,SAAS,KAAK,KAAK,IAAI;KACvC,IAAI,UAAU,MACZ,OAAO,OAAO,KAAK;UAEnB,OAAO,IAAI,OAAO;MAChB,OAAO,gBAAgB,KAAK;MAC5B,MAAM,KAAK;MACX,IAAI,IAAI,KAAK,KAAK,EAAE;MACpB,WAAW,IAAI,KAAK,WAAW;KACjC,CAAC;KAEH,QAAQ,SAAS,gBAAgB,KAAK;KACtC,gBAAgB;IAClB;IACA,IAAI,OAAO,SAAS,GAAG,aAAa,OAAO,WAAW;IACtD,IAAI,aAAa,SAAS,GAAG,aAAa,OAAO,EAAE;IAInD,IAAI,iBAAiB,GAAG;IACxB,MAAM,OAAO,oBAAoB,IAAI,EAAE;IACvC,IAAI,CAAC,MAAM;IACX,MAAM,QAAuB;KAC3B;KACA,QAAQ;KACR,MAAM,KAAK;KACX,IAAI,IAAI,KAAK,KAAK,EAAE;IACtB;IACA,KAAK,MAAM,YAAY,MAAM,SAAS,KAAK;GAC7C;GAEA,MAAM,KAAK,IAAI;IACb,MAAM,eAAe,aAAa,IAAI,EAAE;IACxC,IAAI,CAAC,cAAc,OAAO,CAAC;IAC3B,MAAM,MAAM,MAAM,IAAI;IACtB,MAAM,OAAsB,CAAC;IAC7B,KAAK,MAAM,CAAC,aAAa,WAAW,cAAc;KAChD,KAAK,MAAM,CAAC,OAAO,UAAU,QAAQ;MAGnC,IAAI,MAAM,aAAa,KAAK;OAC1B,OAAO,OAAO,KAAK;OACnB;MACF;MACA,KAAK,KAAK;OACR;OACA;OACA,OAAO,gBAAgB,MAAM,KAAK;OAClC,MAAM,MAAM;OACZ,IAAI,IAAI,KAAK,MAAM,EAAE;OACrB,WAAW,IAAI,KAAK,MAAM,SAAS;MACrC,CAAC;KACH;KACA,IAAI,OAAO,SAAS,GAAG,aAAa,OAAO,WAAW;IACxD;IACA,IAAI,aAAa,SAAS,GAAG,aAAa,OAAO,EAAE;IACnD,OAAO;GACT;GAEA,UAAU,IAAI,SAAS;IACrB,IAAI,OAAO,oBAAoB,IAAI,EAAE;IACrC,IAAI,CAAC,MAAM;KACT,uBAAO,IAAI,IAAI;KACf,oBAAoB,IAAI,IAAI,IAAI;IAClC;IACA,KAAK,IAAI,OAAO;IAChB,aAAa;KACX,KAAK,OAAO,OAAO;KACnB,IAAI,KAAK,SAAS,GAAG,oBAAoB,OAAO,EAAE;IACpD;GACF;EACF;EAEA,SAAS;GACP,MAAM,aAAa,mBAAmB;IACpC,MAAM,MAAM,CAAC,GAAG,SAAS,KAAK,CAAC,CAAC,CAC7B,QACE,cACC,UAAU,WAAW,kBAAkB,MAAM,MAC5C,kBAAkB,WAAW,KAAA,KAC5B,YAAY,kBAAkB,OACpC,CAAC,CACA,SAAS;IACZ,MAAM,UAAU,IAAI,MAAM,GAAG,kBAAkB,KAAK;IAsCpD,OAAO;KACL,UAtCgB,QAAQ,KAAK,cAAoC;MACjE,MAAM,OAAO,SAAS,IAAI,SAAS;MACnC,MAAM,QAAQ,KAAK;MACnB,IAAI,YAAY,MAAM;MACtB,IAAI,eAAe;MACnB,IAAI,cAAc;MAClB,IAAI,eAAe;MACnB,IAAI,eAAe;MACnB,KAAK,MAAM,OAAO,MAAM;OACtB,gBAAgB,IAAI;OACpB,gBAAgB,IAAI;OACpB,IAAI,IAAI,gBAAgB,QAAQ,IAAI,aAAa,MAC/C,gBAAgB;OAElB,IAAI,IAAI,aAAa,MAAM,eAAe;OAC1C,KAAK,MAAM,aAAa;QACtB,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;OACN,GACE,IAAI,aAAa,YAAY,WAAW,YAAY;MAExD;MACA,OAAO;OACL;OACA,YAAY,KAAK;OACjB;OACA;OACA;OACA;OACA,cAAc,IAAI,KAAK,MAAM,SAAS;OACtC,WAAW,IAAI,KAAK,SAAS;MAC/B;KACF,CAEoB;KAClB,QAAQ,IAAI,SAAS,QAAQ,SAAU,QAAQ,GAAG,EAAE,KAAK,OAAQ;IACnE;GACF;GACA,MAAM,WAAW,WAAW,aAAa;IACvC,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC;IACzC,MAAM,eAAe,KAAK,IACxB,YAAY,gBAAgB,KAAK,QACjC,KAAK,MACP;IACA,OAAO;KACL,QAAQ,KACL,MAAM,YAAY,YAAY,YAAY,CAAC,CAC3C,MAAM,GAAG,YAAY,KAAK,CAAC,CAC3B,IAAI,QAAQ;KACf;IACF;GACF;GACA,MAAM,cAAc,WAAW;IAC7B,MAAM,SAAS,GAAG,UAAU;IAC5B,OAAO,CAAC,GAAG,UAAU,QAAQ,CAAC,CAAC,CAC5B,QAAQ,CAAC,SAAS,IAAI,WAAW,MAAM,CAAC,CAAC,CACzC,KAAK,CAAC,KAAK,eAAe;KACzB,aAAa,IAAI,MAAM,OAAO,MAAM;KACpC,OAAO,SAAS;KAChB,WAAW,IAAI,KAAK,SAAS,SAAS;IACxC,EAAE,CAAC,CACF,UAAU,GAAG,MAAM,EAAE,YAAY,cAAc,EAAE,WAAW,CAAC;GAClE;EACF;EAEA,OAAO,WAAW,MAAM;GACtB,MAAM,aAAa,MAAM,cAAc;GACvC,OAAO,EACL,CAAC,OAAO,iBAAuC;IAC7C,IAAI,OAAO;IACX,MAAM,SAAgB,CAAC;IACvB,IAAI,OAA4B;IAChC,IAAI,SAAS;IAEb,MAAM,SAAS,QAAmB;KAChC,OAAO,KAAK,GAAG;KACf,OAAO;IACT;IACA,IAAI,OAAO,kBAAkB,IAAI,SAAS;IAC1C,IAAI,CAAC,MAAM;KACT,uBAAO,IAAI,IAAI;KACf,kBAAkB,IAAI,WAAW,IAAI;IACvC;IACA,KAAK,IAAI,KAAK;IAGd,MAAM,WAAW,SAAS,IAAI,SAAS,KAAK,CAAC;IAC7C,OAAO,QAAQ,GAAG,SAAS,QAAQ,QAAQ,IAAI,QAAQ,UAAU,CAAC;IAElE,MAAM,oBAA0B;KAC9B,KAAK,OAAO,KAAK;KACjB,IAAI,KAAK,SAAS,GAAG,kBAAkB,OAAO,SAAS;IACzD;IAEA,OAAO;KACL,MAAM,OAAuC;MAC3C,SAAS;OACP,OAAO,OAAO,SAAS,GAAG;QACxB,MAAM,MAAM,OAAO,MAAM;QACzB,IAAI,IAAI,SAAS,MAAM;QACvB,OAAO,IAAI;QACX,OAAO;SAAE,OAAO,SAAS,GAAG;SAAG,MAAM;QAAM;OAC7C;OACA,IAAI,QAAQ,OAAO;QAAE,OAAO,KAAA;QAAW,MAAM;OAAK;OAElD,MAAM,IAAI,SAAe,YAAY;QACnC,OAAO;OACT,CAAC;OACD,OAAO;MACT;KACF;KACA,MAAM,SAAyC;MAC7C,SAAS;MACT,YAAY;MACZ,OAAO;MACP,OAAO;OAAE,OAAO,KAAA;OAAW,MAAM;MAAK;KACxC;IACF;GACF,EACF;EACF;CACF;AACF"}
+{"version":3,"file":"store-memory.js","names":[],"sources":["../src/store-memory.ts"],"sourcesContent":["/**\n * experimental-a2/store-memory — in-memory store backend (the test default).\n *\n * Implements the A2Store interface with zero dependencies. See\n * specs/a2-implementation.md §3 for the contract; the conformance suite\n * in test/conformance is the executable version of it.\n */\n\nimport type { PresencePatch } from './contract.ts'\nimport { A2Error } from './errors.ts'\nimport { idempotentReplay } from './idempotent-replay.ts'\nimport { nullProtoRecord } from './internal.ts'\nimport {\n  RANDOM_IDS,\n  SYSTEM_CLOCK,\n  type A2Store,\n  type AppendEvent,\n  type Clock,\n  type Event,\n  type EventCause,\n  type IdSource,\n  type PresenceRow,\n  type StoredEvent,\n  type StoreStateRead,\n} from './store.ts'\n\nexport type MemoryStoreOptions = {\n  /** Injectable clock — every stored timestamp comes from here. */\n  clock?: Clock\n  /** Injectable id source for generated event ids. */\n  ids?: IdSource\n}\n\ntype Row = {\n  id: string\n  type: string\n  payload: unknown\n  index: number\n  sessionId: string\n  createdAt: Date\n  cause: EventCause | null\n  lane: string | null\n  processedAt: Date | null\n  processedByAttempt: number | null\n  returnedEventIds: string[] | null\n  firstClaimedAt: Date | null\n  lastClaimedAt: Date | null\n  attemptCount: number\n  claimHolder: string | null\n  claimExpiresAt: Date | null\n  failureCount: number\n  lastFailedAt: Date | null\n  lastFailedAttempt: number | null\n  lastError: string | null\n  failedAt: Date | null\n}\n\ntype PresenceEntry = {\n  value: unknown\n  seen: number\n  at: Date\n  expiresAt: Date\n}\n\ntype LaneQueue = { rows: Row[]; head: number }\ntype SessionDispatch = {\n  ready: Map<number, Row>\n  lanes: Map<string, LaneQueue>\n}\n\nconst toStored = (row: Row): StoredEvent => ({\n  id: row.id,\n  type: row.type,\n  payload: structuredClone(row.payload),\n  index: row.index,\n  sessionId: row.sessionId,\n  createdAt: new Date(row.createdAt),\n  cause: row.cause ? { ...row.cause } : null,\n  lane: row.lane,\n  processedAt: row.processedAt ? new Date(row.processedAt) : null,\n  processedByAttempt: row.processedByAttempt,\n  returnedEventIds: row.returnedEventIds ? [...row.returnedEventIds] : null,\n  firstClaimedAt: row.firstClaimedAt ? new Date(row.firstClaimedAt) : null,\n  lastClaimedAt: row.lastClaimedAt ? new Date(row.lastClaimedAt) : null,\n  attemptCount: row.attemptCount,\n  claimHolder: row.claimHolder,\n  claimExpiresAt: row.claimExpiresAt ? new Date(row.claimExpiresAt) : null,\n  failureCount: row.failureCount,\n  lastFailedAt: row.lastFailedAt ? new Date(row.lastFailedAt) : null,\n  lastFailedAttempt: row.lastFailedAttempt,\n  lastError: row.lastError,\n  failedAt: row.failedAt ? new Date(row.failedAt) : null,\n})\n\nconst toEvent = (row: Row): Event => ({\n  id: row.id,\n  type: row.type,\n  payload: structuredClone(row.payload),\n  index: row.index,\n  sessionId: row.sessionId,\n  createdAt: new Date(row.createdAt),\n})\n\nexport function memory(options: MemoryStoreOptions = {}): A2Store {\n  const clock = options.clock ?? SYSTEM_CLOCK\n  const generateId = options.ids ?? RANDOM_IDS\n\n  const sessions = new Map<string, Row[]>()\n  const dispatch = new Map<string, SessionDispatch>()\n  /** Global unique index on event ids, like the SQL schema's. */\n  const byEventId = new Map<string, Row>()\n  /** Keyed by `${sessionId}\\u0000${reducerName}` — a pure cache. */\n  const snapshots = new Map<\n    string,\n    { index: number; state: unknown; updatedAt: Date }\n  >()\n  const streamSubscribers = new Map<string, Set<(row: Row) => void>>()\n  /** ns → participant → field → latest surviving write. */\n  const presenceRows = new Map<\n    string,\n    Map<string, Map<string, PresenceEntry>>\n  >()\n  const presenceSubscribers = new Map<\n    string,\n    Set<(patch: PresencePatch) => void>\n  >()\n\n  const notifyStreams = (sessionId: string, rows: Row[]): void => {\n    const subs = streamSubscribers.get(sessionId)\n    if (!subs) return\n    for (const listener of subs) {\n      for (const row of rows) listener(row)\n    }\n  }\n\n  const rowsOf = (sessionId: string): Row[] => {\n    let rows = sessions.get(sessionId)\n    if (!rows) {\n      rows = []\n      sessions.set(sessionId, rows)\n    }\n    return rows\n  }\n\n  const dispatchOf = (sessionId: string): SessionDispatch => {\n    let state = dispatch.get(sessionId)\n    if (!state) {\n      state = { ready: new Map(), lanes: new Map() }\n      dispatch.set(sessionId, state)\n    }\n    return state\n  }\n\n  const enqueue = (sessionId: string, row: Row): void => {\n    if (row.processedAt !== null) return\n    const state = dispatchOf(sessionId)\n    if (row.lane === null) {\n      state.ready.set(row.index, row)\n      return\n    }\n    let queue = state.lanes.get(row.lane)\n    if (!queue) {\n      queue = { rows: [], head: 0 }\n      state.lanes.set(row.lane, queue)\n    }\n    queue.rows.push(row)\n    if (queue.rows.length === 1) state.ready.set(row.index, row)\n  }\n\n  const settle = (sessionId: string, row: Row): void => {\n    const state = dispatchOf(sessionId)\n    state.ready.delete(row.index)\n    if (row.lane === null) return\n    const queue = state.lanes.get(row.lane)!\n    if (queue.rows[queue.head] !== row) return\n    queue.head += 1\n    if (queue.head === queue.rows.length) {\n      state.lanes.delete(row.lane)\n      return\n    }\n    const next = queue.rows[queue.head]!\n    if (next.failedAt === null) state.ready.set(next.index, next)\n  }\n\n  const find = (sessionId: string, index: number): Row => {\n    const row = sessions.get(sessionId)?.[index - 1]\n    if (!row) {\n      throw new TypeError(\n        `no event at index ${index} in session '${sessionId}'`,\n      )\n    }\n    return row\n  }\n\n  const appendResult = (sessionId: string, events: StoredEvent[]) => ({\n    events,\n    hasPending: (sessions.get(sessionId) ?? []).some(\n      (row) => row.processedAt === null,\n    ),\n  })\n\n  const claim = (\n    row: Row,\n    holder: string,\n    now: Date,\n    expiresAt: Date,\n  ): StoredEvent => {\n    row.attemptCount += 1\n    row.firstClaimedAt ??= new Date(now)\n    row.lastClaimedAt = new Date(now)\n    row.claimHolder = holder\n    row.claimExpiresAt = new Date(expiresAt)\n    return toStored(row)\n  }\n\n  const checkBatchIds = (\n    sessionId: string,\n    events: readonly (AppendEvent & { id?: string })[],\n  ): Row[] => {\n    const supplied = events.filter(\n      (candidate): candidate is AppendEvent & { id: string } =>\n        candidate.id !== undefined,\n    )\n    const suppliedIds = new Set(supplied.map((candidate) => candidate.id))\n    if (suppliedIds.size !== supplied.length) {\n      throw new A2Error(\n        'PARTIAL_DUPLICATE_BATCH',\n        'batch contains the same event id more than once',\n      )\n    }\n    const existing = supplied\n      .map((candidate) => byEventId.get(candidate.id))\n      .filter((row): row is Row => row !== undefined)\n    const foreign = existing.find((row) => row.sessionId !== sessionId)\n    if (foreign) {\n      throw new A2Error(\n        'PARTIAL_DUPLICATE_BATCH',\n        `event id '${foreign.id}' already exists in another session`,\n      )\n    }\n    return existing\n  }\n\n  const insert = (\n    sessionId: string,\n    events: readonly AppendEvent[],\n    now: Date,\n    cause?: EventCause,\n  ): Row[] => {\n    const rows = rowsOf(sessionId)\n    const base = rows.length === 0 ? 0 : rows[rows.length - 1]!.index\n    const inserted = events.map((candidate, offset): Row => ({\n      id: candidate.id ?? generateId(),\n      type: candidate.type,\n      payload: structuredClone(candidate.payload),\n      index: base + 1 + offset,\n      sessionId,\n      createdAt: new Date(now),\n      cause: cause\n        ? { ...cause }\n        : candidate.cause\n          ? { ...candidate.cause }\n          : null,\n      lane: candidate.lane ?? null,\n      processedAt: candidate.settled ? new Date(now) : null,\n      processedByAttempt: null,\n      returnedEventIds: null,\n      firstClaimedAt: null,\n      lastClaimedAt: null,\n      attemptCount: 0,\n      claimHolder: null,\n      claimExpiresAt: null,\n      failureCount: 0,\n      lastFailedAt: null,\n      lastFailedAttempt: null,\n      lastError: null,\n      failedAt: null,\n    }))\n    for (const row of inserted) {\n      if (byEventId.has(row.id)) {\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          `event id '${row.id}' already exists`,\n        )\n      }\n    }\n    for (const row of inserted) {\n      rows.push(row)\n      byEventId.set(row.id, row)\n      enqueue(sessionId, row)\n    }\n    return inserted\n  }\n\n  const readStateOf = (\n    sessionId: string,\n    reducerName: string,\n  ): StoreStateRead => {\n    const snap = snapshots.get(`${sessionId}\\u0000${reducerName}`)\n    const snapshot = snap\n      ? { index: snap.index, state: structuredClone(snap.state) }\n      : null\n    const afterIndex = snapshot?.index ?? 0\n    return {\n      snapshot,\n      events: (sessions.get(sessionId) ?? [])\n        .filter((row) => row.index > afterIndex)\n        .map(toEvent),\n    }\n  }\n\n  return {\n    async append(sessionId, events) {\n      if (events.length === 0) return appendResult(sessionId, [])\n\n      // Batch-scoped idempotency (a2-implementation.md §3): all ids\n      // already present → lost-ack retry, return the original rows;\n      // some present → the caller mixed sent and fresh events.\n      const existing = checkBatchIds(sessionId, events)\n      if (existing.length > 0) {\n        if (existing.length === events.length) {\n          return appendResult(\n            sessionId,\n            idempotentReplay(events, existing.map(toStored)),\n          )\n        }\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          `batch mixes ${existing.length} already-appended and ${events.length - existing.length} fresh events`,\n        )\n      }\n\n      // Attempt-currency fence: a fresh handler append commits only while\n      // its causal attempt is still the parent's latest (store.ts `append`).\n      const rows = sessions.get(sessionId) ?? []\n      for (const event of events) {\n        if (!event.cause) continue\n        const parent = rows[event.cause.index - 1]\n        if (!parent) {\n          throw new TypeError(\n            `no event at index ${event.cause.index} in session '${sessionId}'`,\n          )\n        }\n        if (\n          parent.attemptCount !== event.cause.attempt ||\n          parent.failedAt !== null\n        ) {\n          throw new A2Error(\n            'SUPERSEDED_ATTEMPT',\n            `attempt ${event.cause.attempt} no longer owns event ${event.cause.index} in session '${sessionId}'`,\n          )\n        }\n      }\n\n      const now = clock.now()\n      const inserted = insert(sessionId, events, now)\n      notifyStreams(sessionId, inserted)\n      return appendResult(sessionId, inserted.map(toStored))\n    },\n\n    async read(sessionId, opts) {\n      const rows = sessions.get(sessionId) ?? []\n      const start = Math.max(0, opts?.afterIndex ?? 0)\n      const end = Math.max(0, opts?.throughIndex ?? rows.length)\n      return rows.slice(start, end).map(toStored)\n    },\n\n    async claimAvailable({\n      sessionId,\n      holder,\n      ttlMs,\n      expiresAtMs,\n      excludeIndexes,\n    }) {\n      const claimedAt = clock.now()\n      const now = claimedAt.getTime()\n      const expiresAt = new Date(expiresAtMs ?? now + ttlMs)\n      const excluded = new Set(excludeIndexes ?? [])\n      const eligible: Row[] = []\n      let retryAt: Date | null = null\n\n      for (const row of dispatchOf(sessionId).ready.values()) {\n        if (row.failedAt !== null || excluded.has(row.index)) continue\n        if (row.claimExpiresAt && row.claimExpiresAt.getTime() > now) {\n          if (!retryAt || row.claimExpiresAt < retryAt) {\n            retryAt = new Date(row.claimExpiresAt)\n          }\n          continue\n        }\n        eligible.push(row)\n      }\n\n      if (eligible.length === 0) {\n        return retryAt ? { outcome: 'busy', retryAt } : { outcome: 'settled' }\n      }\n      eligible.sort((a, b) => a.index - b.index)\n      return {\n        outcome: 'claimed',\n        events: eligible.map((row) => claim(row, holder, claimedAt, expiresAt)),\n      }\n    },\n\n    async renewClaims({ sessionId, holder, claims, ttlMs, expiresAtMs }) {\n      const now = clock.now()\n      const expiresAt = new Date(expiresAtMs ?? now.getTime() + ttlMs)\n      const requested = new Map(claims.map((c) => [c.index, c.attempt]))\n      const renewed: number[] = []\n      const superseded: number[] = []\n      for (const row of sessions.get(sessionId) ?? []) {\n        const attempt = requested.get(row.index)\n        if (attempt === undefined) continue\n        if (row.attemptCount > attempt) {\n          superseded.push(row.index)\n          continue\n        }\n        if (\n          row.processedAt === null &&\n          row.failedAt === null &&\n          row.claimHolder === holder &&\n          row.claimExpiresAt !== null &&\n          row.claimExpiresAt > now\n        ) {\n          row.claimExpiresAt = new Date(expiresAt)\n          renewed.push(row.index)\n        }\n      }\n      return { renewed, superseded }\n    },\n\n    async completeAttempt({ sessionId, index, attempt, events }) {\n      const parent = find(sessionId, index)\n      const cause = { index, attempt }\n      if (parent.processedAt !== null) {\n        if (parent.processedByAttempt !== attempt) {\n          return { outcome: 'superseded' }\n        }\n        const requestedIds = events.map((event) => event.id)\n        if (\n          parent.returnedEventIds === null ||\n          parent.returnedEventIds.length !== requestedIds.length ||\n          parent.returnedEventIds.some(\n            (id, offset) => id !== requestedIds[offset],\n          )\n        ) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'completed attempt does not match the returned event batch',\n          )\n        }\n        const existing = checkBatchIds(sessionId, events)\n        if (\n          existing.length !== events.length ||\n          existing.some(\n            (row) =>\n              row.cause?.index !== index || row.cause.attempt !== attempt,\n          )\n        ) {\n          throw new A2Error(\n            'PARTIAL_DUPLICATE_BATCH',\n            'completed attempt does not match the returned event batch',\n          )\n        }\n        return {\n          outcome: 'completed',\n          events: idempotentReplay(events, existing.map(toStored)),\n        }\n      }\n      if (\n        parent.attemptCount !== attempt ||\n        parent.failedAt !== null ||\n        parent.claimHolder === null\n      ) {\n        return { outcome: 'superseded' }\n      }\n\n      const existing = checkBatchIds(sessionId, events)\n      if (existing.length > 0) {\n        throw new A2Error(\n          'PARTIAL_DUPLICATE_BATCH',\n          'returned event batch contains already-appended ids',\n        )\n      }\n      const now = clock.now()\n      const inserted = insert(sessionId, events, now, cause)\n      parent.processedAt = new Date(now)\n      parent.processedByAttempt = attempt\n      parent.returnedEventIds = events.map((event) => event.id)\n      parent.claimHolder = null\n      parent.claimExpiresAt = null\n      settle(sessionId, parent)\n      notifyStreams(sessionId, inserted)\n      return { outcome: 'completed', events: inserted.map(toStored) }\n    },\n\n    async failAttempt({ sessionId, index, attempt, error, maxFailures }) {\n      const row = find(sessionId, index)\n      if (\n        row.processedAt ||\n        row.attemptCount !== attempt ||\n        (row.claimHolder === null && row.lastFailedAttempt !== attempt)\n      ) {\n        return { outcome: 'superseded', failureCount: row.failureCount }\n      }\n      if (row.lastFailedAttempt === attempt && row.claimHolder === null) {\n        return {\n          outcome: row.failedAt ? 'dead_lettered' : 'failed',\n          failureCount: row.failureCount,\n        }\n      }\n      if (row.failedAt) {\n        return { outcome: 'dead_lettered', failureCount: row.failureCount }\n      }\n      row.failureCount += 1\n      row.lastError = error\n      const failedAt = clock.now()\n      row.lastFailedAt = new Date(failedAt)\n      row.lastFailedAttempt = attempt\n      row.claimHolder = null\n      row.claimExpiresAt = null\n      if (row.failureCount >= maxFailures) {\n        row.failedAt = new Date(failedAt)\n        dispatchOf(sessionId).ready.delete(row.index)\n        return {\n          outcome: 'dead_lettered',\n          failureCount: row.failureCount,\n        }\n      }\n      return { outcome: 'failed', failureCount: row.failureCount }\n    },\n\n    async readState(sessionId, reducerName) {\n      return readStateOf(sessionId, reducerName)\n    },\n\n    async readStates(sessionIds, reducerName) {\n      return sessionIds.map((sessionId) => readStateOf(sessionId, reducerName))\n    },\n\n    async putSnapshot(sessionId, reducerName, index, state) {\n      const key = `${sessionId}\\u0000${reducerName}`\n      const existing = snapshots.get(key)\n      // Guarded upsert: a slower concurrent writer must never clobber a\n      // further-along snapshot. A lost race costs a few refolded events\n      // next read — never correctness.\n      if (existing && existing.index >= index) return\n      snapshots.set(key, {\n        index,\n        state: structuredClone(state),\n        updatedAt: clock.now(),\n      })\n    },\n\n    presence: {\n      async set(ns, participant, values, meta) {\n        let participants = presenceRows.get(ns)\n        if (!participants) {\n          participants = new Map()\n          presenceRows.set(ns, participants)\n        }\n        let fields = participants.get(participant)\n        if (!fields) {\n          fields = new Map()\n          participants.set(participant, fields)\n        }\n\n        // Expiry anchors on the storage's own clock — the sender's\n        // `at` orders writes but never extends or shortens a lifetime.\n        const expiresAtMs = clock.now().getTime() + meta.ttlMs\n        // Field-keyed and caller-named — null-prototype, like every\n        // presence map (see `nullProtoRecord`).\n        const applied: Record<string, unknown> = nullProtoRecord()\n        let appliedCount = 0\n        for (const [field, value] of Object.entries(values)) {\n          // Field-wise LWW by `at`; ties go to the incoming write, so\n          // same-stamp sets keep set-then-read intuition.\n          const existing = fields.get(field)\n          if (existing && existing.at > meta.at) continue\n          if (value === null) {\n            fields.delete(field)\n          } else {\n            fields.set(field, {\n              value: structuredClone(value),\n              seen: meta.seen,\n              at: new Date(meta.at),\n              expiresAt: new Date(expiresAtMs),\n            })\n          }\n          applied[field] = structuredClone(value)\n          appliedCount += 1\n        }\n        if (fields.size === 0) participants.delete(participant)\n        if (participants.size === 0) presenceRows.delete(ns)\n\n        // Only applied fields broadcast — a losing write repaints nothing,\n        // so subscribers stay consistent with what read() returns.\n        if (appliedCount === 0) return\n        const subs = presenceSubscribers.get(ns)\n        if (!subs) return\n        const patch: PresencePatch = {\n          participant,\n          values: applied,\n          seen: meta.seen,\n          at: new Date(meta.at),\n        }\n        for (const listener of subs) listener(patch)\n      },\n\n      async read(ns) {\n        const participants = presenceRows.get(ns)\n        if (!participants) return []\n        const now = clock.now()\n        const rows: PresenceRow[] = []\n        for (const [participant, fields] of participants) {\n          for (const [field, entry] of fields) {\n            // Expiry is enforced lazily on read — no timers; a silent\n            // participant's rows vanish the next time anyone looks.\n            if (entry.expiresAt <= now) {\n              fields.delete(field)\n              continue\n            }\n            rows.push({\n              participant,\n              field,\n              value: structuredClone(entry.value),\n              seen: entry.seen,\n              at: new Date(entry.at),\n              expiresAt: new Date(entry.expiresAt),\n            })\n          }\n          if (fields.size === 0) participants.delete(participant)\n        }\n        if (participants.size === 0) presenceRows.delete(ns)\n        return rows\n      },\n\n      subscribe(ns, onPatch) {\n        let subs = presenceSubscribers.get(ns)\n        if (!subs) {\n          subs = new Set()\n          presenceSubscribers.set(ns, subs)\n        }\n        subs.add(onPatch)\n        return () => {\n          subs.delete(onPatch)\n          if (subs.size === 0) presenceSubscribers.delete(ns)\n        }\n      },\n    },\n\n    stream(sessionId, opts) {\n      const startAfter = opts?.startAfter ?? 0\n      return {\n        [Symbol.asyncIterator](): AsyncIterator<Event> {\n          let last = startAfter\n          const buffer: Row[] = []\n          let wake: (() => void) | null = null\n          let closed = false\n\n          const onRow = (row: Row): void => {\n            buffer.push(row)\n            wake?.()\n          }\n          let subs = streamSubscribers.get(sessionId)\n          if (!subs) {\n            subs = new Set()\n            streamSubscribers.set(sessionId, subs)\n          }\n          subs.add(onRow)\n          // Seed with history — synchronously, in the same tick as the\n          // subscription, so nothing can slip between the two.\n          const existing = sessions.get(sessionId) ?? []\n          buffer.unshift(...existing.filter((row) => row.index > startAfter))\n\n          const unsubscribe = (): void => {\n            subs.delete(onRow)\n            if (subs.size === 0) streamSubscribers.delete(sessionId)\n          }\n\n          return {\n            async next(): Promise<IteratorResult<Event>> {\n              for (;;) {\n                while (buffer.length > 0) {\n                  const row = buffer.shift()!\n                  if (row.index <= last) continue\n                  last = row.index\n                  return { value: toStored(row), done: false }\n                }\n                if (closed) return { value: undefined, done: true }\n                // oxlint-disable-next-line no-await-in-loop -- wait-for-wake\n                await new Promise<void>((resolve) => {\n                  wake = resolve\n                })\n                wake = null\n              }\n            },\n            async return(): Promise<IteratorResult<Event>> {\n              closed = true\n              unsubscribe()\n              wake?.()\n              return { value: undefined, done: true }\n            },\n          }\n        },\n      }\n    },\n  }\n}\n"],"mappings":";;;;;AAsEA,MAAM,YAAY,SAA2B;CAC3C,IAAI,IAAI;CACR,MAAM,IAAI;CACV,SAAS,gBAAgB,IAAI,OAAO;CACpC,OAAO,IAAI;CACX,WAAW,IAAI;CACf,WAAW,IAAI,KAAK,IAAI,SAAS;CACjC,OAAO,IAAI,QAAQ,EAAE,GAAG,IAAI,MAAM,IAAI;CACtC,MAAM,IAAI;CACV,aAAa,IAAI,cAAc,IAAI,KAAK,IAAI,WAAW,IAAI;CAC3D,oBAAoB,IAAI;CACxB,kBAAkB,IAAI,mBAAmB,CAAC,GAAG,IAAI,gBAAgB,IAAI;CACrE,gBAAgB,IAAI,iBAAiB,IAAI,KAAK,IAAI,cAAc,IAAI;CACpE,eAAe,IAAI,gBAAgB,IAAI,KAAK,IAAI,aAAa,IAAI;CACjE,cAAc,IAAI;CAClB,aAAa,IAAI;CACjB,gBAAgB,IAAI,iBAAiB,IAAI,KAAK,IAAI,cAAc,IAAI;CACpE,cAAc,IAAI;CAClB,cAAc,IAAI,eAAe,IAAI,KAAK,IAAI,YAAY,IAAI;CAC9D,mBAAmB,IAAI;CACvB,WAAW,IAAI;CACf,UAAU,IAAI,WAAW,IAAI,KAAK,IAAI,QAAQ,IAAI;AACpD;AAEA,MAAM,WAAW,SAAqB;CACpC,IAAI,IAAI;CACR,MAAM,IAAI;CACV,SAAS,gBAAgB,IAAI,OAAO;CACpC,OAAO,IAAI;CACX,WAAW,IAAI;CACf,WAAW,IAAI,KAAK,IAAI,SAAS;AACnC;AAEA,SAAgB,OAAO,UAA8B,CAAC,GAAY;CAChE,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,aAAa,QAAQ,OAAO;CAElC,MAAM,2BAAW,IAAI,IAAmB;CACxC,MAAM,2BAAW,IAAI,IAA6B;;CAElD,MAAM,4BAAY,IAAI,IAAiB;;CAEvC,MAAM,4BAAY,IAAI,IAGpB;CACF,MAAM,oCAAoB,IAAI,IAAqC;;CAEnE,MAAM,+BAAe,IAAI,IAGvB;CACF,MAAM,sCAAsB,IAAI,IAG9B;CAEF,MAAM,iBAAiB,WAAmB,SAAsB;EAC9D,MAAM,OAAO,kBAAkB,IAAI,SAAS;EAC5C,IAAI,CAAC,MAAM;EACX,KAAK,MAAM,YAAY,MACrB,KAAK,MAAM,OAAO,MAAM,SAAS,GAAG;CAExC;CAEA,MAAM,UAAU,cAA6B;EAC3C,IAAI,OAAO,SAAS,IAAI,SAAS;EACjC,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,SAAS,IAAI,WAAW,IAAI;EAC9B;EACA,OAAO;CACT;CAEA,MAAM,cAAc,cAAuC;EACzD,IAAI,QAAQ,SAAS,IAAI,SAAS;EAClC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,uBAAO,IAAI,IAAI;IAAG,uBAAO,IAAI,IAAI;GAAE;GAC7C,SAAS,IAAI,WAAW,KAAK;EAC/B;EACA,OAAO;CACT;CAEA,MAAM,WAAW,WAAmB,QAAmB;EACrD,IAAI,IAAI,gBAAgB,MAAM;EAC9B,MAAM,QAAQ,WAAW,SAAS;EAClC,IAAI,IAAI,SAAS,MAAM;GACrB,MAAM,MAAM,IAAI,IAAI,OAAO,GAAG;GAC9B;EACF;EACA,IAAI,QAAQ,MAAM,MAAM,IAAI,IAAI,IAAI;EACpC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,MAAM,CAAC;IAAG,MAAM;GAAE;GAC5B,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;EACjC;EACA,MAAM,KAAK,KAAK,GAAG;EACnB,IAAI,MAAM,KAAK,WAAW,GAAG,MAAM,MAAM,IAAI,IAAI,OAAO,GAAG;CAC7D;CAEA,MAAM,UAAU,WAAmB,QAAmB;EACpD,MAAM,QAAQ,WAAW,SAAS;EAClC,MAAM,MAAM,OAAO,IAAI,KAAK;EAC5B,IAAI,IAAI,SAAS,MAAM;EACvB,MAAM,QAAQ,MAAM,MAAM,IAAI,IAAI,IAAI;EACtC,IAAI,MAAM,KAAK,MAAM,UAAU,KAAK;EACpC,MAAM,QAAQ;EACd,IAAI,MAAM,SAAS,MAAM,KAAK,QAAQ;GACpC,MAAM,MAAM,OAAO,IAAI,IAAI;GAC3B;EACF;EACA,MAAM,OAAO,MAAM,KAAK,MAAM;EAC9B,IAAI,KAAK,aAAa,MAAM,MAAM,MAAM,IAAI,KAAK,OAAO,IAAI;CAC9D;CAEA,MAAM,QAAQ,WAAmB,UAAuB;EACtD,MAAM,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,QAAQ;EAC9C,IAAI,CAAC,KACH,MAAM,IAAI,UACR,qBAAqB,MAAM,eAAe,UAAU,EACtD;EAEF,OAAO;CACT;CAEA,MAAM,gBAAgB,WAAmB,YAA2B;EAClE;EACA,aAAa,SAAS,IAAI,SAAS,KAAK,CAAC,EAAA,CAAG,MACzC,QAAQ,IAAI,gBAAgB,IAC/B;CACF;CAEA,MAAM,SACJ,KACA,QACA,KACA,cACgB;EAChB,IAAI,gBAAgB;EACpB,IAAI,mBAAmB,IAAI,KAAK,GAAG;EACnC,IAAI,gBAAgB,IAAI,KAAK,GAAG;EAChC,IAAI,cAAc;EAClB,IAAI,iBAAiB,IAAI,KAAK,SAAS;EACvC,OAAO,SAAS,GAAG;CACrB;CAEA,MAAM,iBACJ,WACA,WACU;EACV,MAAM,WAAW,OAAO,QACrB,cACC,UAAU,OAAO,KAAA,CACrB;EAEA,IAAI,IADoB,IAAI,SAAS,KAAK,cAAc,UAAU,EAAE,CACtD,CAAC,CAAC,SAAS,SAAS,QAChC,MAAM,IAAI,QACR,2BACA,iDACF;EAEF,MAAM,WAAW,SACd,KAAK,cAAc,UAAU,IAAI,UAAU,EAAE,CAAC,CAAC,CAC/C,QAAQ,QAAoB,QAAQ,KAAA,CAAS;EAChD,MAAM,UAAU,SAAS,MAAM,QAAQ,IAAI,cAAc,SAAS;EAClE,IAAI,SACF,MAAM,IAAI,QACR,2BACA,aAAa,QAAQ,GAAG,oCAC1B;EAEF,OAAO;CACT;CAEA,MAAM,UACJ,WACA,QACA,KACA,UACU;EACV,MAAM,OAAO,OAAO,SAAS;EAC7B,MAAM,OAAO,KAAK,WAAW,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAE;EAC5D,MAAM,WAAW,OAAO,KAAK,WAAW,YAAiB;GACvD,IAAI,UAAU,MAAM,WAAW;GAC/B,MAAM,UAAU;GAChB,SAAS,gBAAgB,UAAU,OAAO;GAC1C,OAAO,OAAO,IAAI;GAClB;GACA,WAAW,IAAI,KAAK,GAAG;GACvB,OAAO,QACH,EAAE,GAAG,MAAM,IACX,UAAU,QACR,EAAE,GAAG,UAAU,MAAM,IACrB;GACN,MAAM,UAAU,QAAQ;GACxB,aAAa,UAAU,UAAU,IAAI,KAAK,GAAG,IAAI;GACjD,oBAAoB;GACpB,kBAAkB;GAClB,gBAAgB;GAChB,eAAe;GACf,cAAc;GACd,aAAa;GACb,gBAAgB;GAChB,cAAc;GACd,cAAc;GACd,mBAAmB;GACnB,WAAW;GACX,UAAU;EACZ,EAAE;EACF,KAAK,MAAM,OAAO,UAChB,IAAI,UAAU,IAAI,IAAI,EAAE,GACtB,MAAM,IAAI,QACR,2BACA,aAAa,IAAI,GAAG,iBACtB;EAGJ,KAAK,MAAM,OAAO,UAAU;GAC1B,KAAK,KAAK,GAAG;GACb,UAAU,IAAI,IAAI,IAAI,GAAG;GACzB,QAAQ,WAAW,GAAG;EACxB;EACA,OAAO;CACT;CAEA,MAAM,eACJ,WACA,gBACmB;EACnB,MAAM,OAAO,UAAU,IAAI,GAAG,UAAU,QAAQ,aAAa;EAC7D,MAAM,WAAW,OACb;GAAE,OAAO,KAAK;GAAO,OAAO,gBAAgB,KAAK,KAAK;EAAE,IACxD;EACJ,MAAM,aAAa,UAAU,SAAS;EACtC,OAAO;GACL;GACA,SAAS,SAAS,IAAI,SAAS,KAAK,CAAC,EAAA,CAClC,QAAQ,QAAQ,IAAI,QAAQ,UAAU,CAAC,CACvC,IAAI,OAAO;EAChB;CACF;CAEA,OAAO;EACL,MAAM,OAAO,WAAW,QAAQ;GAC9B,IAAI,OAAO,WAAW,GAAG,OAAO,aAAa,WAAW,CAAC,CAAC;GAK1D,MAAM,WAAW,cAAc,WAAW,MAAM;GAChD,IAAI,SAAS,SAAS,GAAG;IACvB,IAAI,SAAS,WAAW,OAAO,QAC7B,OAAO,aACL,WACA,iBAAiB,QAAQ,SAAS,IAAI,QAAQ,CAAC,CACjD;IAEF,MAAM,IAAI,QACR,2BACA,eAAe,SAAS,OAAO,wBAAwB,OAAO,SAAS,SAAS,OAAO,cACzF;GACF;GAIA,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC;GACzC,KAAK,MAAM,SAAS,QAAQ;IAC1B,IAAI,CAAC,MAAM,OAAO;IAClB,MAAM,SAAS,KAAK,MAAM,MAAM,QAAQ;IACxC,IAAI,CAAC,QACH,MAAM,IAAI,UACR,qBAAqB,MAAM,MAAM,MAAM,eAAe,UAAU,EAClE;IAEF,IACE,OAAO,iBAAiB,MAAM,MAAM,WACpC,OAAO,aAAa,MAEpB,MAAM,IAAI,QACR,sBACA,WAAW,MAAM,MAAM,QAAQ,wBAAwB,MAAM,MAAM,MAAM,eAAe,UAAU,EACpG;GAEJ;GAEA,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,WAAW,OAAO,WAAW,QAAQ,GAAG;GAC9C,cAAc,WAAW,QAAQ;GACjC,OAAO,aAAa,WAAW,SAAS,IAAI,QAAQ,CAAC;EACvD;EAEA,MAAM,KAAK,WAAW,MAAM;GAC1B,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC;GACzC,MAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,cAAc,CAAC;GAC/C,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM,gBAAgB,KAAK,MAAM;GACzD,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,QAAQ;EAC5C;EAEA,MAAM,eAAe,EACnB,WACA,QACA,OACA,aACA,kBACC;GACD,MAAM,YAAY,MAAM,IAAI;GAC5B,MAAM,MAAM,UAAU,QAAQ;GAC9B,MAAM,YAAY,IAAI,KAAK,eAAe,MAAM,KAAK;GACrD,MAAM,WAAW,IAAI,IAAI,kBAAkB,CAAC,CAAC;GAC7C,MAAM,WAAkB,CAAC;GACzB,IAAI,UAAuB;GAE3B,KAAK,MAAM,OAAO,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO,GAAG;IACtD,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,IAAI,KAAK,GAAG;IACtD,IAAI,IAAI,kBAAkB,IAAI,eAAe,QAAQ,IAAI,KAAK;KAC5D,IAAI,CAAC,WAAW,IAAI,iBAAiB,SACnC,UAAU,IAAI,KAAK,IAAI,cAAc;KAEvC;IACF;IACA,SAAS,KAAK,GAAG;GACnB;GAEA,IAAI,SAAS,WAAW,GACtB,OAAO,UAAU;IAAE,SAAS;IAAQ;GAAQ,IAAI,EAAE,SAAS,UAAU;GAEvE,SAAS,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;GACzC,OAAO;IACL,SAAS;IACT,QAAQ,SAAS,KAAK,QAAQ,MAAM,KAAK,QAAQ,WAAW,SAAS,CAAC;GACxE;EACF;EAEA,MAAM,YAAY,EAAE,WAAW,QAAQ,QAAQ,OAAO,eAAe;GACnE,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,YAAY,IAAI,KAAK,eAAe,IAAI,QAAQ,IAAI,KAAK;GAC/D,MAAM,YAAY,IAAI,IAAI,OAAO,KAAK,MAAM,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;GACjE,MAAM,UAAoB,CAAC;GAC3B,MAAM,aAAuB,CAAC;GAC9B,KAAK,MAAM,OAAO,SAAS,IAAI,SAAS,KAAK,CAAC,GAAG;IAC/C,MAAM,UAAU,UAAU,IAAI,IAAI,KAAK;IACvC,IAAI,YAAY,KAAA,GAAW;IAC3B,IAAI,IAAI,eAAe,SAAS;KAC9B,WAAW,KAAK,IAAI,KAAK;KACzB;IACF;IACA,IACE,IAAI,gBAAgB,QACpB,IAAI,aAAa,QACjB,IAAI,gBAAgB,UACpB,IAAI,mBAAmB,QACvB,IAAI,iBAAiB,KACrB;KACA,IAAI,iBAAiB,IAAI,KAAK,SAAS;KACvC,QAAQ,KAAK,IAAI,KAAK;IACxB;GACF;GACA,OAAO;IAAE;IAAS;GAAW;EAC/B;EAEA,MAAM,gBAAgB,EAAE,WAAW,OAAO,SAAS,UAAU;GAC3D,MAAM,SAAS,KAAK,WAAW,KAAK;GACpC,MAAM,QAAQ;IAAE;IAAO;GAAQ;GAC/B,IAAI,OAAO,gBAAgB,MAAM;IAC/B,IAAI,OAAO,uBAAuB,SAChC,OAAO,EAAE,SAAS,aAAa;IAEjC,MAAM,eAAe,OAAO,KAAK,UAAU,MAAM,EAAE;IACnD,IACE,OAAO,qBAAqB,QAC5B,OAAO,iBAAiB,WAAW,aAAa,UAChD,OAAO,iBAAiB,MACrB,IAAI,WAAW,OAAO,aAAa,OACtC,GAEA,MAAM,IAAI,QACR,2BACA,2DACF;IAEF,MAAM,WAAW,cAAc,WAAW,MAAM;IAChD,IACE,SAAS,WAAW,OAAO,UAC3B,SAAS,MACN,QACC,IAAI,OAAO,UAAU,SAAS,IAAI,MAAM,YAAY,OACxD,GAEA,MAAM,IAAI,QACR,2BACA,2DACF;IAEF,OAAO;KACL,SAAS;KACT,QAAQ,iBAAiB,QAAQ,SAAS,IAAI,QAAQ,CAAC;IACzD;GACF;GACA,IACE,OAAO,iBAAiB,WACxB,OAAO,aAAa,QACpB,OAAO,gBAAgB,MAEvB,OAAO,EAAE,SAAS,aAAa;GAIjC,IADiB,cAAc,WAAW,MAC/B,CAAC,CAAC,SAAS,GACpB,MAAM,IAAI,QACR,2BACA,oDACF;GAEF,MAAM,MAAM,MAAM,IAAI;GACtB,MAAM,WAAW,OAAO,WAAW,QAAQ,KAAK,KAAK;GACrD,OAAO,cAAc,IAAI,KAAK,GAAG;GACjC,OAAO,qBAAqB;GAC5B,OAAO,mBAAmB,OAAO,KAAK,UAAU,MAAM,EAAE;GACxD,OAAO,cAAc;GACrB,OAAO,iBAAiB;GACxB,OAAO,WAAW,MAAM;GACxB,cAAc,WAAW,QAAQ;GACjC,OAAO;IAAE,SAAS;IAAa,QAAQ,SAAS,IAAI,QAAQ;GAAE;EAChE;EAEA,MAAM,YAAY,EAAE,WAAW,OAAO,SAAS,OAAO,eAAe;GACnE,MAAM,MAAM,KAAK,WAAW,KAAK;GACjC,IACE,IAAI,eACJ,IAAI,iBAAiB,WACpB,IAAI,gBAAgB,QAAQ,IAAI,sBAAsB,SAEvD,OAAO;IAAE,SAAS;IAAc,cAAc,IAAI;GAAa;GAEjE,IAAI,IAAI,sBAAsB,WAAW,IAAI,gBAAgB,MAC3D,OAAO;IACL,SAAS,IAAI,WAAW,kBAAkB;IAC1C,cAAc,IAAI;GACpB;GAEF,IAAI,IAAI,UACN,OAAO;IAAE,SAAS;IAAiB,cAAc,IAAI;GAAa;GAEpE,IAAI,gBAAgB;GACpB,IAAI,YAAY;GAChB,MAAM,WAAW,MAAM,IAAI;GAC3B,IAAI,eAAe,IAAI,KAAK,QAAQ;GACpC,IAAI,oBAAoB;GACxB,IAAI,cAAc;GAClB,IAAI,iBAAiB;GACrB,IAAI,IAAI,gBAAgB,aAAa;IACnC,IAAI,WAAW,IAAI,KAAK,QAAQ;IAChC,WAAW,SAAS,CAAC,CAAC,MAAM,OAAO,IAAI,KAAK;IAC5C,OAAO;KACL,SAAS;KACT,cAAc,IAAI;IACpB;GACF;GACA,OAAO;IAAE,SAAS;IAAU,cAAc,IAAI;GAAa;EAC7D;EAEA,MAAM,UAAU,WAAW,aAAa;GACtC,OAAO,YAAY,WAAW,WAAW;EAC3C;EAEA,MAAM,WAAW,YAAY,aAAa;GACxC,OAAO,WAAW,KAAK,cAAc,YAAY,WAAW,WAAW,CAAC;EAC1E;EAEA,MAAM,YAAY,WAAW,aAAa,OAAO,OAAO;GACtD,MAAM,MAAM,GAAG,UAAU,QAAQ;GACjC,MAAM,WAAW,UAAU,IAAI,GAAG;GAIlC,IAAI,YAAY,SAAS,SAAS,OAAO;GACzC,UAAU,IAAI,KAAK;IACjB;IACA,OAAO,gBAAgB,KAAK;IAC5B,WAAW,MAAM,IAAI;GACvB,CAAC;EACH;EAEA,UAAU;GACR,MAAM,IAAI,IAAI,aAAa,QAAQ,MAAM;IACvC,IAAI,eAAe,aAAa,IAAI,EAAE;IACtC,IAAI,CAAC,cAAc;KACjB,+BAAe,IAAI,IAAI;KACvB,aAAa,IAAI,IAAI,YAAY;IACnC;IACA,IAAI,SAAS,aAAa,IAAI,WAAW;IACzC,IAAI,CAAC,QAAQ;KACX,yBAAS,IAAI,IAAI;KACjB,aAAa,IAAI,aAAa,MAAM;IACtC;IAIA,MAAM,cAAc,MAAM,IAAI,CAAC,CAAC,QAAQ,IAAI,KAAK;IAGjD,MAAM,UAAmC,gBAAgB;IACzD,IAAI,eAAe;IACnB,KAAK,MAAM,CAAC,OAAO,UAAU,OAAO,QAAQ,MAAM,GAAG;KAGnD,MAAM,WAAW,OAAO,IAAI,KAAK;KACjC,IAAI,YAAY,SAAS,KAAK,KAAK,IAAI;KACvC,IAAI,UAAU,MACZ,OAAO,OAAO,KAAK;UAEnB,OAAO,IAAI,OAAO;MAChB,OAAO,gBAAgB,KAAK;MAC5B,MAAM,KAAK;MACX,IAAI,IAAI,KAAK,KAAK,EAAE;MACpB,WAAW,IAAI,KAAK,WAAW;KACjC,CAAC;KAEH,QAAQ,SAAS,gBAAgB,KAAK;KACtC,gBAAgB;IAClB;IACA,IAAI,OAAO,SAAS,GAAG,aAAa,OAAO,WAAW;IACtD,IAAI,aAAa,SAAS,GAAG,aAAa,OAAO,EAAE;IAInD,IAAI,iBAAiB,GAAG;IACxB,MAAM,OAAO,oBAAoB,IAAI,EAAE;IACvC,IAAI,CAAC,MAAM;IACX,MAAM,QAAuB;KAC3B;KACA,QAAQ;KACR,MAAM,KAAK;KACX,IAAI,IAAI,KAAK,KAAK,EAAE;IACtB;IACA,KAAK,MAAM,YAAY,MAAM,SAAS,KAAK;GAC7C;GAEA,MAAM,KAAK,IAAI;IACb,MAAM,eAAe,aAAa,IAAI,EAAE;IACxC,IAAI,CAAC,cAAc,OAAO,CAAC;IAC3B,MAAM,MAAM,MAAM,IAAI;IACtB,MAAM,OAAsB,CAAC;IAC7B,KAAK,MAAM,CAAC,aAAa,WAAW,cAAc;KAChD,KAAK,MAAM,CAAC,OAAO,UAAU,QAAQ;MAGnC,IAAI,MAAM,aAAa,KAAK;OAC1B,OAAO,OAAO,KAAK;OACnB;MACF;MACA,KAAK,KAAK;OACR;OACA;OACA,OAAO,gBAAgB,MAAM,KAAK;OAClC,MAAM,MAAM;OACZ,IAAI,IAAI,KAAK,MAAM,EAAE;OACrB,WAAW,IAAI,KAAK,MAAM,SAAS;MACrC,CAAC;KACH;KACA,IAAI,OAAO,SAAS,GAAG,aAAa,OAAO,WAAW;IACxD;IACA,IAAI,aAAa,SAAS,GAAG,aAAa,OAAO,EAAE;IACnD,OAAO;GACT;GAEA,UAAU,IAAI,SAAS;IACrB,IAAI,OAAO,oBAAoB,IAAI,EAAE;IACrC,IAAI,CAAC,MAAM;KACT,uBAAO,IAAI,IAAI;KACf,oBAAoB,IAAI,IAAI,IAAI;IAClC;IACA,KAAK,IAAI,OAAO;IAChB,aAAa;KACX,KAAK,OAAO,OAAO;KACnB,IAAI,KAAK,SAAS,GAAG,oBAAoB,OAAO,EAAE;IACpD;GACF;EACF;EAEA,OAAO,WAAW,MAAM;GACtB,MAAM,aAAa,MAAM,cAAc;GACvC,OAAO,EACL,CAAC,OAAO,iBAAuC;IAC7C,IAAI,OAAO;IACX,MAAM,SAAgB,CAAC;IACvB,IAAI,OAA4B;IAChC,IAAI,SAAS;IAEb,MAAM,SAAS,QAAmB;KAChC,OAAO,KAAK,GAAG;KACf,OAAO;IACT;IACA,IAAI,OAAO,kBAAkB,IAAI,SAAS;IAC1C,IAAI,CAAC,MAAM;KACT,uBAAO,IAAI,IAAI;KACf,kBAAkB,IAAI,WAAW,IAAI;IACvC;IACA,KAAK,IAAI,KAAK;IAGd,MAAM,WAAW,SAAS,IAAI,SAAS,KAAK,CAAC;IAC7C,OAAO,QAAQ,GAAG,SAAS,QAAQ,QAAQ,IAAI,QAAQ,UAAU,CAAC;IAElE,MAAM,oBAA0B;KAC9B,KAAK,OAAO,KAAK;KACjB,IAAI,KAAK,SAAS,GAAG,kBAAkB,OAAO,SAAS;IACzD;IAEA,OAAO;KACL,MAAM,OAAuC;MAC3C,SAAS;OACP,OAAO,OAAO,SAAS,GAAG;QACxB,MAAM,MAAM,OAAO,MAAM;QACzB,IAAI,IAAI,SAAS,MAAM;QACvB,OAAO,IAAI;QACX,OAAO;SAAE,OAAO,SAAS,GAAG;SAAG,MAAM;QAAM;OAC7C;OACA,IAAI,QAAQ,OAAO;QAAE,OAAO,KAAA;QAAW,MAAM;OAAK;OAElD,MAAM,IAAI,SAAe,YAAY;QACnC,OAAO;OACT,CAAC;OACD,OAAO;MACT;KACF;KACA,MAAM,SAAyC;MAC7C,SAAS;MACT,YAAY;MACZ,OAAO;MACP,OAAO;OAAE,OAAO,KAAA;OAAW,MAAM;MAAK;KACxC;IACF;GACF,EACF;EACF;CACF;AACF"}

package/dist/{store-polling-dSeLxzfb.js → store-polling-6DW7F1DT.js}

@@ -1,4 +1,4 @@
-import { i as POLL_TIMINGS } from "./internal-DstsI6Re.js";
+import { i as POLL_TIMINGS } from "./internal-DRXJ56EI.js";
 //#region src/store-polling.ts
 /**
 * The shared polling stream — how poll-based backends (sqlite,
@@ -83,4 +83,4 @@ function pollingStream(readAfter, options) {
 //#endregion
 export { pollingStream as n, defaultSleep as t };
 
-//# sourceMappingURL=store-polling-dSeLxzfb.js.map
+//# sourceMappingURL=store-polling-6DW7F1DT.js.map

package/dist/{store-polling-dSeLxzfb.js.map → store-polling-6DW7F1DT.js.map}

@@ -1 +1 @@
-{"version":3,"file":"store-polling-dSeLxzfb.js","names":[],"sources":["../src/store-polling.ts"],"sourcesContent":["/**\n * The shared polling stream — how poll-based backends (sqlite,\n * postgres) implement `A2Store.stream`.\n *\n * The cadence is activity-adaptive: while events are flowing, polls\n * run at a tight floor (25ms) so streams feel pushed — a token\n * generation reads smoothly instead of clumping at the idle interval;\n * every empty poll doubles the gap until the idle ceiling. The cadence\n * is owned (POLL_TIMINGS in internal.ts), not a public option: the\n * floor already keeps active streams smooth, so tuning it is a cost\n * decision a2 makes, not one it delegates. Correctness never depends\n * on the cadence — each poll is a catch-up read (`index > last`, in\n * order), so nothing can be missed, only arrive a beat later.\n */\n\nimport { POLL_TIMINGS } from './internal.ts'\nimport type { StoredEvent } from './store.ts'\n\n/** One cancellable sleep — the injection seam for cadence tests. */\nexport type Sleeper = { promise: Promise<void>; cancel: () => void }\n\n/** Unref'd cancellable timer — shared with the redis safety read. */\nexport const defaultSleep = (ms: number): Sleeper => {\n  let timer: ReturnType<typeof setTimeout> | undefined\n  let wake: (() => void) | undefined\n  const promise = new Promise<void>((resolve) => {\n    wake = resolve // assigned synchronously by the executor\n    timer = setTimeout(resolve, ms)\n    // Don't hold the process open for an idle poll.\n    ;(timer as { unref?: () => void }).unref?.()\n  })\n  return {\n    promise,\n    cancel: () => {\n      clearTimeout(timer)\n      wake?.()\n    },\n  }\n}\n\n// Read the seam lazily — tests shrink POLL_TIMINGS in their setup.\nconst ceiling = (): number => POLL_TIMINGS.idleCeilingMs\nconst floor = (): number =>\n  Math.min(POLL_TIMINGS.activeFloorMs, POLL_TIMINGS.idleCeilingMs)\n\nexport type PollingStreamOptions = {\n  /** Deliver events strictly after this index (exclusive). */\n  startAfter?: number\n  /** Injectable sleep — tests assert the cadence without wall-clock waits. */\n  sleep?: (ms: number) => Sleeper\n}\n\n/**\n * Build the `stream()` iterable from a backend's catch-up read. The\n * iterable ends when the consumer calls `return()` (a disconnecting\n * SSE client), waking any pending sleep immediately.\n */\nexport function pollingStream(\n  readAfter: (afterIndex: number) => StoredEvent[] | Promise<StoredEvent[]>,\n  options: PollingStreamOptions,\n): AsyncIterable<StoredEvent> {\n  const startAfter = options.startAfter ?? 0\n  const sleep = options.sleep ?? defaultSleep\n\n  return {\n    [Symbol.asyncIterator](): AsyncIterator<StoredEvent> {\n      let last = startAfter\n      let buffer: StoredEvent[] = []\n      let closed = false\n      let pending: Sleeper | null = null\n      let interval = floor()\n\n      return {\n        async next(): Promise<IteratorResult<StoredEvent>> {\n          for (;;) {\n            if (closed) return { value: undefined, done: true }\n            // oxlint-disable-next-line no-await-in-loop -- poll loop\n            if (buffer.length === 0) buffer = await readAfter(last)\n            const row = buffer.shift()\n            if (row) {\n              // Activity: tighten back to the floor.\n              interval = floor()\n              last = row.index\n              return { value: row, done: false }\n            }\n            // Empty poll: wait, then back off toward the idle ceiling.\n            pending = sleep(interval)\n            // oxlint-disable-next-line no-await-in-loop -- poll loop\n            await pending.promise\n            pending = null\n            interval = Math.min(interval * 2, ceiling())\n          }\n        },\n        async return(): Promise<IteratorResult<StoredEvent>> {\n          closed = true\n          pending?.cancel()\n          return { value: undefined, done: true }\n        },\n      }\n    },\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAsBA,MAAa,gBAAgB,OAAwB;CACnD,IAAI;CACJ,IAAI;CAOJ,OAAO;EACL,SAAA,IAPkB,SAAe,YAAY;GAC7C,OAAO;GACP,QAAQ,WAAW,SAAS,EAAE;GAE7B,MAAkC,QAAQ;EAC7C,CAEQ;EACN,cAAc;GACZ,aAAa,KAAK;GAClB,OAAO;EACT;CACF;AACF;AAGA,MAAM,gBAAwB,aAAa;AAC3C,MAAM,cACJ,KAAK,IAAI,aAAa,eAAe,aAAa,aAAa;;;;;;AAcjE,SAAgB,cACd,WACA,SAC4B;CAC5B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,QAAQ,QAAQ,SAAS;CAE/B,OAAO,EACL,CAAC,OAAO,iBAA6C;EACnD,IAAI,OAAO;EACX,IAAI,SAAwB,CAAC;EAC7B,IAAI,SAAS;EACb,IAAI,UAA0B;EAC9B,IAAI,WAAW,MAAM;EAErB,OAAO;GACL,MAAM,OAA6C;IACjD,SAAS;KACP,IAAI,QAAQ,OAAO;MAAE,OAAO,KAAA;MAAW,MAAM;KAAK;KAElD,IAAI,OAAO,WAAW,GAAG,SAAS,MAAM,UAAU,IAAI;KACtD,MAAM,MAAM,OAAO,MAAM;KACzB,IAAI,KAAK;MAEP,WAAW,MAAM;MACjB,OAAO,IAAI;MACX,OAAO;OAAE,OAAO;OAAK,MAAM;MAAM;KACnC;KAEA,UAAU,MAAM,QAAQ;KAExB,MAAM,QAAQ;KACd,UAAU;KACV,WAAW,KAAK,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC7C;GACF;GACA,MAAM,SAA+C;IACnD,SAAS;IACT,SAAS,OAAO;IAChB,OAAO;KAAE,OAAO,KAAA;KAAW,MAAM;IAAK;GACxC;EACF;CACF,EACF;AACF"}
+{"version":3,"file":"store-polling-6DW7F1DT.js","names":[],"sources":["../src/store-polling.ts"],"sourcesContent":["/**\n * The shared polling stream — how poll-based backends (sqlite,\n * postgres) implement `A2Store.stream`.\n *\n * The cadence is activity-adaptive: while events are flowing, polls\n * run at a tight floor (25ms) so streams feel pushed — a token\n * generation reads smoothly instead of clumping at the idle interval;\n * every empty poll doubles the gap until the idle ceiling. The cadence\n * is owned (POLL_TIMINGS in internal.ts), not a public option: the\n * floor already keeps active streams smooth, so tuning it is a cost\n * decision a2 makes, not one it delegates. Correctness never depends\n * on the cadence — each poll is a catch-up read (`index > last`, in\n * order), so nothing can be missed, only arrive a beat later.\n */\n\nimport { POLL_TIMINGS } from './internal.ts'\nimport type { StoredEvent } from './store.ts'\n\n/** One cancellable sleep — the injection seam for cadence tests. */\nexport type Sleeper = { promise: Promise<void>; cancel: () => void }\n\n/** Unref'd cancellable timer — shared with the redis safety read. */\nexport const defaultSleep = (ms: number): Sleeper => {\n  let timer: ReturnType<typeof setTimeout> | undefined\n  let wake: (() => void) | undefined\n  const promise = new Promise<void>((resolve) => {\n    wake = resolve // assigned synchronously by the executor\n    timer = setTimeout(resolve, ms)\n    // Don't hold the process open for an idle poll.\n    ;(timer as { unref?: () => void }).unref?.()\n  })\n  return {\n    promise,\n    cancel: () => {\n      clearTimeout(timer)\n      wake?.()\n    },\n  }\n}\n\n// Read the seam lazily — tests shrink POLL_TIMINGS in their setup.\nconst ceiling = (): number => POLL_TIMINGS.idleCeilingMs\nconst floor = (): number =>\n  Math.min(POLL_TIMINGS.activeFloorMs, POLL_TIMINGS.idleCeilingMs)\n\nexport type PollingStreamOptions = {\n  /** Deliver events strictly after this index (exclusive). */\n  startAfter?: number\n  /** Injectable sleep — tests assert the cadence without wall-clock waits. */\n  sleep?: (ms: number) => Sleeper\n}\n\n/**\n * Build the `stream()` iterable from a backend's catch-up read. The\n * iterable ends when the consumer calls `return()` (a disconnecting\n * SSE client), waking any pending sleep immediately.\n */\nexport function pollingStream(\n  readAfter: (afterIndex: number) => StoredEvent[] | Promise<StoredEvent[]>,\n  options: PollingStreamOptions,\n): AsyncIterable<StoredEvent> {\n  const startAfter = options.startAfter ?? 0\n  const sleep = options.sleep ?? defaultSleep\n\n  return {\n    [Symbol.asyncIterator](): AsyncIterator<StoredEvent> {\n      let last = startAfter\n      let buffer: StoredEvent[] = []\n      let closed = false\n      let pending: Sleeper | null = null\n      let interval = floor()\n\n      return {\n        async next(): Promise<IteratorResult<StoredEvent>> {\n          for (;;) {\n            if (closed) return { value: undefined, done: true }\n            // oxlint-disable-next-line no-await-in-loop -- poll loop\n            if (buffer.length === 0) buffer = await readAfter(last)\n            const row = buffer.shift()\n            if (row) {\n              // Activity: tighten back to the floor.\n              interval = floor()\n              last = row.index\n              return { value: row, done: false }\n            }\n            // Empty poll: wait, then back off toward the idle ceiling.\n            pending = sleep(interval)\n            // oxlint-disable-next-line no-await-in-loop -- poll loop\n            await pending.promise\n            pending = null\n            interval = Math.min(interval * 2, ceiling())\n          }\n        },\n        async return(): Promise<IteratorResult<StoredEvent>> {\n          closed = true\n          pending?.cancel()\n          return { value: undefined, done: true }\n        },\n      }\n    },\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAsBA,MAAa,gBAAgB,OAAwB;CACnD,IAAI;CACJ,IAAI;CAOJ,OAAO;EACL,SAAA,IAPkB,SAAe,YAAY;GAC7C,OAAO;GACP,QAAQ,WAAW,SAAS,EAAE;GAE7B,MAAkC,QAAQ;EAC7C,CAEQ;EACN,cAAc;GACZ,aAAa,KAAK;GAClB,OAAO;EACT;CACF;AACF;AAGA,MAAM,gBAAwB,aAAa;AAC3C,MAAM,cACJ,KAAK,IAAI,aAAa,eAAe,aAAa,aAAa;;;;;;AAcjE,SAAgB,cACd,WACA,SAC4B;CAC5B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,QAAQ,QAAQ,SAAS;CAE/B,OAAO,EACL,CAAC,OAAO,iBAA6C;EACnD,IAAI,OAAO;EACX,IAAI,SAAwB,CAAC;EAC7B,IAAI,SAAS;EACb,IAAI,UAA0B;EAC9B,IAAI,WAAW,MAAM;EAErB,OAAO;GACL,MAAM,OAA6C;IACjD,SAAS;KACP,IAAI,QAAQ,OAAO;MAAE,OAAO,KAAA;MAAW,MAAM;KAAK;KAElD,IAAI,OAAO,WAAW,GAAG,SAAS,MAAM,UAAU,IAAI;KACtD,MAAM,MAAM,OAAO,MAAM;KACzB,IAAI,KAAK;MAEP,WAAW,MAAM;MACjB,OAAO,IAAI;MACX,OAAO;OAAE,OAAO;OAAK,MAAM;MAAM;KACnC;KAEA,UAAU,MAAM,QAAQ;KAExB,MAAM,QAAQ;KACd,UAAU;KACV,WAAW,KAAK,IAAI,WAAW,GAAG,QAAQ,CAAC;IAC7C;GACF;GACA,MAAM,SAA+C;IACnD,SAAS;IACT,SAAS,OAAO;IAChB,OAAO;KAAE,OAAO,KAAA;KAAW,MAAM;IAAK;GACxC;EACF;CACF,EACF;AACF"}

package/dist/store-postgres.d.ts

@@ -1,4 +1,4 @@
-import { c as IdSource, i as Clock, t as A2Store } from "./store-DysUkTH3.js";
+import { r as Clock, s as IdSource, t as A2Store } from "./store-flRz1OWh.js";
 //#region src/store-postgres.d.ts
 /** The result shape this backend reads: just rows. */
 type PostgresQueryResult = {

package/dist/store-postgres.js

@@ -1,5 +1,5 @@
 import { t as A2Error } from "./errors-BQuJpe82.js";
-import { n as pollingStream } from "./store-polling-dSeLxzfb.js";
+import { n as pollingStream } from "./store-polling-6DW7F1DT.js";
 import { t as retryableLazy } from "./retryable-lazy-DZWmHpii.js";
 import { t as idempotentReplay } from "./idempotent-replay-DuqEkYA7.js";
 import { n as SYSTEM_CLOCK, t as RANDOM_IDS } from "./store-N8PXxDAS.js";
@@ -761,86 +761,6 @@ function postgres(options = {}) {
 				});
 			}
 		},
-		inspect: {
-			async listSessions(inspectionOptions) {
-				return wrap(async () => {
-					const c = await client();
-					const conditions = ["left(session_id, length($1)) = $1"];
-					const params = [inspectionOptions.prefix];
-					if (inspectionOptions.cursor !== void 0) {
-						params.push(inspectionOptions.cursor);
-						conditions.push(`session_id > $${params.length}`);
-					}
-					params.push(inspectionOptions.limit + 1);
-					const { rows } = await c.query(`select
-               session_id,
-               count(*) as event_count,
-               count(*) filter (where processed_at is null and failed_at is null) as pending_count,
-               count(*) filter (where failed_at is not null) as failed_count,
-               sum(attempt_count) as attempt_count,
-               sum(failure_count) as failure_count,
-               min(created_at) as first_event_at,
-               max(greatest(
-                 created_at,
-                 coalesce(first_claimed_at, 0),
-                 coalesce(last_claimed_at, 0),
-                 coalesce(last_failed_at, 0),
-                 coalesce(processed_at, 0),
-                 coalesce(failed_at, 0)
-               )) as updated_at
-             from a2_events
-             where ${conditions.join(" and ")}
-             group by session_id
-             order by session_id
-             limit $${params.length}`, params);
-					const hasMore = rows.length > inspectionOptions.limit;
-					const visible = rows.slice(0, inspectionOptions.limit);
-					return {
-						sessions: visible.map((row) => ({
-							sessionId: row["session_id"],
-							eventCount: asNumber(row["event_count"]),
-							pendingCount: asNumber(row["pending_count"]),
-							failedCount: asNumber(row["failed_count"]),
-							attemptCount: asNumber(row["attempt_count"]),
-							failureCount: asNumber(row["failure_count"]),
-							firstEventAt: new Date(asNumber(row["first_event_at"])),
-							updatedAt: new Date(asNumber(row["updated_at"]))
-						})),
-						cursor: hasMore ? visible.at(-1)?.["session_id"] ?? null : null
-					};
-				});
-			},
-			async readEvents(sessionId, pageOptions) {
-				return wrap(async () => {
-					const c = await client();
-					const currentFrontier = asNumber((await c.query("select coalesce(max(idx), 0) as frontier from a2_events where session_id = $1", [sessionId])).rows[0]?.["frontier"] ?? 0);
-					const throughIndex = Math.min(pageOptions.throughIndex ?? currentFrontier, currentFrontier);
-					const { rows } = await c.query(`select * from a2_events
-              where session_id = $1 and idx > $2 and idx <= $3
-              order by idx limit $4`, [
-						sessionId,
-						pageOptions.afterIndex,
-						throughIndex,
-						pageOptions.limit
-					]);
-					return {
-						events: rows.map(toStored),
-						throughIndex
-					};
-				});
-			},
-			async listSnapshots(sessionId) {
-				return wrap(async () => {
-					const { rows } = await (await client()).query(`select reducer_name, up_to_index, updated_at
-             from a2_snapshots where session_id = $1 order by reducer_name`, [sessionId]);
-					return rows.map((row) => ({
-						reducerName: row["reducer_name"],
-						index: asNumber(row["up_to_index"]),
-						updatedAt: new Date(asNumber(row["updated_at"]))
-					}));
-				});
-			}
-		},
 		stream(sessionId, opts) {
 			const readAfter = (afterIndex) => wrap(async () => {
 				const { rows } = await (await client()).query("select * from a2_events where session_id = $1 and idx > $2 order by idx", [sessionId, afterIndex]);