experimental-a2 0.3.0 → 0.5.0

package/dist/{log-memory.js → store-memory.js}

@@ -1,14 +1,8 @@
-import { t as A2Error } from "./errors-BJRMd-h6.js";
-import { t as idempotentReplay } from "./idempotent-replay-BMyHrP0L.js";
-import { n as SYSTEM_CLOCK, t as RANDOM_IDS } from "./log-yJbXUf72.js";
-//#region src/log-memory.ts
-/**
-* experimental-a2/log-memory — in-memory log backend (the test default).
-*
-* Implements the A2Log interface with zero dependencies. See
-* specs/a2-implementation.md §3 for the contract; the conformance suite
-* in test/conformance is the executable version of it.
-*/
+import { t as A2Error } from "./errors-BQuJpe82.js";
+import { g as nullProtoRecord } from "./internal-DstsI6Re.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
 const toStored = (row) => ({
 	id: row.id,
 	type: row.type,
@@ -50,6 +44,9 @@ function memory(options = {}) {
 	/** Keyed by `${sessionId}\u0000${reducerName}` — a pure cache. */
 	const snapshots = /* @__PURE__ */ new Map();
 	const streamSubscribers = /* @__PURE__ */ new Map();
+	/** ns → participant → field → latest surviving write. */
+	const presenceRows = /* @__PURE__ */ new Map();
+	const presenceSubscribers = /* @__PURE__ */ new Map();
 	const notifyStreams = (sessionId, rows) => {
 		const subs = streamSubscribers.get(sessionId);
 		if (!subs) return;
@@ -165,6 +162,18 @@ function memory(options = {}) {
 		}
 		return inserted;
 	};
+	const readStateOf = (sessionId, reducerName) => {
+		const snap = snapshots.get(`${sessionId}\u0000${reducerName}`);
+		const snapshot = snap ? {
+			index: snap.index,
+			state: structuredClone(snap.state)
+		} : null;
+		const afterIndex = snapshot?.index ?? 0;
+		return {
+			snapshot,
+			events: (sessions.get(sessionId) ?? []).filter((row) => row.index > afterIndex).map(toEvent)
+		};
+	};
 	return {
 		async append(sessionId, events) {
 			if (events.length === 0) return appendResult(sessionId, []);
@@ -173,16 +182,23 @@ function memory(options = {}) {
 				if (existing.length === events.length) return appendResult(sessionId, idempotentReplay(events, existing.map(toStored)));
 				throw new A2Error("PARTIAL_DUPLICATE_BATCH", `batch mixes ${existing.length} already-appended and ${events.length - existing.length} fresh events`);
 			}
+			const rows = sessions.get(sessionId) ?? [];
+			for (const event of events) {
+				if (!event.cause) continue;
+				const parent = rows[event.cause.index - 1];
+				if (!parent) throw new TypeError(`no event at index ${event.cause.index} in session '${sessionId}'`);
+				if (parent.attemptCount !== event.cause.attempt || parent.failedAt !== null) throw new A2Error("SUPERSEDED_ATTEMPT", `attempt ${event.cause.attempt} no longer owns event ${event.cause.index} in session '${sessionId}'`);
+			}
 			const now = clock.now();
 			const inserted = insert(sessionId, events, now);
 			notifyStreams(sessionId, inserted);
 			return appendResult(sessionId, inserted.map(toStored));
 		},
 		async read(sessionId, opts) {
-			return (sessions.get(sessionId) ?? []).filter((row) => {
-				if (opts?.afterIndex !== void 0 && row.index <= opts.afterIndex) return false;
-				return true;
-			}).map(toStored);
+			const rows = sessions.get(sessionId) ?? [];
+			const start = Math.max(0, opts?.afterIndex ?? 0);
+			const end = Math.max(0, opts?.throughIndex ?? rows.length);
+			return rows.slice(start, end).map(toStored);
 		},
 		async claimAvailable({ sessionId, holder, ttlMs, expiresAtMs, excludeIndexes }) {
 			const claimedAt = clock.now();
@@ -209,16 +225,28 @@ function memory(options = {}) {
 				events: eligible.map((row) => claim(row, holder, claimedAt, expiresAt))
 			};
 		},
-		async renewClaims({ sessionId, holder, indexes, ttlMs, expiresAtMs }) {
+		async renewClaims({ sessionId, holder, claims, ttlMs, expiresAtMs }) {
 			const now = clock.now();
 			const expiresAt = new Date(expiresAtMs ?? now.getTime() + ttlMs);
-			const requested = new Set(indexes);
+			const requested = new Map(claims.map((c) => [c.index, c.attempt]));
 			const renewed = [];
-			for (const row of sessions.get(sessionId) ?? []) if (requested.has(row.index) && row.processedAt === null && row.failedAt === null && row.claimHolder === holder && row.claimExpiresAt !== null && row.claimExpiresAt > now) {
-				row.claimExpiresAt = new Date(expiresAt);
-				renewed.push(row.index);
+			const superseded = [];
+			for (const row of sessions.get(sessionId) ?? []) {
+				const attempt = requested.get(row.index);
+				if (attempt === void 0) continue;
+				if (row.attemptCount > attempt) {
+					superseded.push(row.index);
+					continue;
+				}
+				if (row.processedAt === null && row.failedAt === null && row.claimHolder === holder && row.claimExpiresAt !== null && row.claimExpiresAt > now) {
+					row.claimExpiresAt = new Date(expiresAt);
+					renewed.push(row.index);
+				}
 			}
-			return renewed;
+			return {
+				renewed,
+				superseded
+			};
 		},
 		async completeAttempt({ sessionId, index, attempt, events }) {
 			const parent = find(sessionId, index);
@@ -288,16 +316,10 @@ function memory(options = {}) {
 			};
 		},
 		async readState(sessionId, reducerName) {
-			const snap = snapshots.get(`${sessionId}\u0000${reducerName}`);
-			const snapshot = snap ? {
-				index: snap.index,
-				state: structuredClone(snap.state)
-			} : null;
-			const afterIndex = snapshot?.index ?? 0;
-			return {
-				snapshot,
-				events: (sessions.get(sessionId) ?? []).filter((row) => row.index > afterIndex).map(toEvent)
-			};
+			return readStateOf(sessionId, reducerName);
+		},
+		async readStates(sessionIds, reducerName) {
+			return sessionIds.map((sessionId) => readStateOf(sessionId, reducerName));
 		},
 		async putSnapshot(sessionId, reducerName, index, state) {
 			const key = `${sessionId}\u0000${reducerName}`;
@@ -309,6 +331,85 @@ function memory(options = {}) {
 				updatedAt: clock.now()
 			});
 		},
+		presence: {
+			async set(ns, participant, values, meta) {
+				let participants = presenceRows.get(ns);
+				if (!participants) {
+					participants = /* @__PURE__ */ new Map();
+					presenceRows.set(ns, participants);
+				}
+				let fields = participants.get(participant);
+				if (!fields) {
+					fields = /* @__PURE__ */ new Map();
+					participants.set(participant, fields);
+				}
+				const expiresAtMs = clock.now().getTime() + meta.ttlMs;
+				const applied = nullProtoRecord();
+				let appliedCount = 0;
+				for (const [field, value] of Object.entries(values)) {
+					const existing = fields.get(field);
+					if (existing && existing.at > meta.at) continue;
+					if (value === null) fields.delete(field);
+					else fields.set(field, {
+						value: structuredClone(value),
+						seen: meta.seen,
+						at: new Date(meta.at),
+						expiresAt: new Date(expiresAtMs)
+					});
+					applied[field] = structuredClone(value);
+					appliedCount += 1;
+				}
+				if (fields.size === 0) participants.delete(participant);
+				if (participants.size === 0) presenceRows.delete(ns);
+				if (appliedCount === 0) return;
+				const subs = presenceSubscribers.get(ns);
+				if (!subs) return;
+				const patch = {
+					participant,
+					values: applied,
+					seen: meta.seen,
+					at: new Date(meta.at)
+				};
+				for (const listener of subs) listener(patch);
+			},
+			async read(ns) {
+				const participants = presenceRows.get(ns);
+				if (!participants) return [];
+				const now = clock.now();
+				const rows = [];
+				for (const [participant, fields] of participants) {
+					for (const [field, entry] of fields) {
+						if (entry.expiresAt <= now) {
+							fields.delete(field);
+							continue;
+						}
+						rows.push({
+							participant,
+							field,
+							value: structuredClone(entry.value),
+							seen: entry.seen,
+							at: new Date(entry.at),
+							expiresAt: new Date(entry.expiresAt)
+						});
+					}
+					if (fields.size === 0) participants.delete(participant);
+				}
+				if (participants.size === 0) presenceRows.delete(ns);
+				return rows;
+			},
+			subscribe(ns, onPatch) {
+				let subs = presenceSubscribers.get(ns);
+				if (!subs) {
+					subs = /* @__PURE__ */ new Set();
+					presenceSubscribers.set(ns, subs);
+				}
+				subs.add(onPatch);
+				return () => {
+					subs.delete(onPatch);
+					if (subs.size === 0) presenceSubscribers.delete(ns);
+				};
+			}
+		},
 		inspect: {
 			async listSessions(inspectionOptions) {
 				const ids = [...sessions.keys()].filter((sessionId) => sessionId.startsWith(inspectionOptions.prefix) && (inspectionOptions.cursor === void 0 || sessionId > inspectionOptions.cursor)).toSorted();
@@ -350,6 +451,14 @@ function memory(options = {}) {
 					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]) => ({
@@ -360,9 +469,9 @@ function memory(options = {}) {
 			}
 		},
 		stream(sessionId, opts) {
-			const startAt = opts?.startAt ?? 0;
+			const startAfter = opts?.startAfter ?? 0;
 			return { [Symbol.asyncIterator]() {
-				let last = startAt;
+				let last = startAfter;
 				const buffer = [];
 				let wake = null;
 				let closed = false;
@@ -377,7 +486,7 @@ function memory(options = {}) {
 				}
 				subs.add(onRow);
 				const existing = sessions.get(sessionId) ?? [];
-				buffer.unshift(...existing.filter((row) => row.index > startAt));
+				buffer.unshift(...existing.filter((row) => row.index > startAfter));
 				const unsubscribe = () => {
 					subs.delete(onRow);
 					if (subs.size === 0) streamSubscribers.delete(sessionId);
@@ -420,3 +529,5 @@ function memory(options = {}) {
 }
 //#endregion
 export { memory };
+
+//# sourceMappingURL=store-memory.js.map

package/dist/store-memory.js.map

@@ -0,0 +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"}

package/dist/{log-polling-DZ1MiKLg.js → store-polling-dSeLxzfb.js}

@@ -1,8 +1,8 @@
-import { r as POLL_TIMINGS } from "./internal-gCd5qMry.js";
-//#region src/log-polling.ts
+import { i as POLL_TIMINGS } from "./internal-DstsI6Re.js";
+//#region src/store-polling.ts
 /**
 * The shared polling stream — how poll-based backends (sqlite,
-* postgres) implement `A2Log.stream`.
+* postgres) implement `A2Store.stream`.
 *
 * The cadence is activity-adaptive: while events are flowing, polls
 * run at a tight floor (25ms) so streams feel pushed — a token
@@ -38,10 +38,10 @@ const floor = () => Math.min(POLL_TIMINGS.activeFloorMs, POLL_TIMINGS.idleCeilin
 * SSE client), waking any pending sleep immediately.
 */
 function pollingStream(readAfter, options) {
-	const startAt = options.startAt ?? 0;
+	const startAfter = options.startAfter ?? 0;
 	const sleep = options.sleep ?? defaultSleep;
 	return { [Symbol.asyncIterator]() {
-		let last = startAt;
+		let last = startAfter;
 		let buffer = [];
 		let closed = false;
 		let pending = null;
@@ -82,3 +82,5 @@ function pollingStream(readAfter, options) {
 }
 //#endregion
 export { pollingStream as n, defaultSleep as t };
+
+//# sourceMappingURL=store-polling-dSeLxzfb.js.map

package/dist/store-polling-dSeLxzfb.js.map

@@ -0,0 +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"}

package/dist/{log-postgres.d.ts → store-postgres.d.ts}

@@ -1,5 +1,5 @@
-import { c as IdSource, i as Clock, t as A2Log } from "./log-ldf5g8Cx.js";
-//#region src/log-postgres.d.ts
+import { c as IdSource, i as Clock, t as A2Store } from "./store-DysUkTH3.js";
+//#region src/store-postgres.d.ts
 /** The result shape this backend reads: just rows. */
 type PostgresQueryResult = {
   rows: Record<string, unknown>[];
@@ -20,7 +20,7 @@ type PostgresClient = {
   connect?(): Promise<PostgresConnection>;
   end?(): Promise<void>;
 };
-type PostgresLogOptions = {
+type PostgresStoreOptions = {
   /** Creates a `pg` Pool lazily (requires the optional peer dep `pg`). */
   connectionString?: string | undefined;
   /** Bring your own client — a `pg` Pool, PGlite, a pooler wrapper. */
@@ -30,11 +30,12 @@ type PostgresLogOptions = {
   /** Injectable id source for generated event ids. */
   ids?: IdSource;
 };
-type PostgresLog = A2Log & {
+type PostgresStore = A2Store & {
   /** End the underlying pool/client (when this backend created it, or
    * the injected client has `end`). */
   close(): Promise<void>;
 };
-declare function postgres(options?: PostgresLogOptions): PostgresLog;
+declare function postgres(options?: PostgresStoreOptions): PostgresStore;
 //#endregion
-export { PostgresClient, PostgresConnection, PostgresLog, PostgresLogOptions, PostgresQueryResult, postgres };
+export { PostgresClient, PostgresConnection, PostgresQueryResult, PostgresStore, PostgresStoreOptions, postgres };
+//# sourceMappingURL=store-postgres.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"store-postgres.d.ts","names":[],"sources":["../src/store-postgres.ts"],"mappings":";;;KAqCY;EAAwB,MAAM;;;KAG9B;EACV,MAAM,cAAc,qBAAqB,QAAQ;EACjD;;;;;;;;KASU;EACV,MAAM,cAAc,qBAAqB,QAAQ;EACjD,YAAY,QAAQ;EACpB,QAAQ;;KAGE;;EAEV;;EAEA,SAAS;;EAET,QAAQ;;EAER,MAAM;;KAGI,gBAAgB;;;EAG1B,SAAS;;iBAoLK,SAAS,UAAS,uBAA4B"}