experimental-a2 0.13.0 → 0.14.0

package/src/client.ts

@@ -30,7 +30,7 @@ import type {
   PresencePatch,
   WithPresence,
 } from './contract.ts'
-import type { Reducer } from './reducer.ts'
+import { clientStateProjection, type Reducer } from './reducer.ts'
 import { validateSync } from './validate.ts'
 import {
   errorFromWire,
@@ -1434,7 +1434,7 @@ export function createClient<
         .filter((p) => p.acked)
         .map((p) => p.acked!)
         .toSorted((a, b) => a.index - b.index)
-      const maxKnown = acked.at(-1)?.index ?? stateIndex
+      const maxKnown = Math.max(stateIndex, acked.at(-1)?.index ?? stateIndex)
       const unacked = pending
         .filter((p) => !p.acked)
         .map(
@@ -1479,10 +1479,25 @@ export function createClient<
     const buildSnapshot = (): SessionSnapshot<D, S, P> => {
       const overlay = overlayEvents()
       let state = foldedState
-      for (const event of overlay) state = reducer.fold(state, event)
+      for (const event of overlay) {
+        if (event.index > stateIndex) state = reducer.fold(state, event)
+      }
+      const displayedOverlay = overlay.filter((event) => {
+        if (event.index > stateIndex) return true
+        let low = 0
+        let high = serverEvents.length - 1
+        while (low <= high) {
+          const middle = Math.floor((low + high) / 2)
+          const observed = serverEvents[middle]!
+          if (observed.index === event.index) return observed.id !== event.id
+          if (observed.index < event.index) low = middle + 1
+          else high = middle - 1
+        }
+        return true
+      })
       return {
-        state,
-        events: [...serverEvents, ...overlay],
+        state: reducer[clientStateProjection]?.(state) ?? state,
+        events: [...serverEvents, ...displayedOverlay],
         index: stateIndex,
         history: historyState(),
         connection: connection(),
@@ -1837,6 +1852,12 @@ export function createClient<
               const entry = pending.find((p) => p.id === event.id)
               if (entry) entry.acked = event // stream retires it at its index
             }
+            pending = pending.filter(
+              (entry) =>
+                entry.acked === undefined ||
+                entry.acked.index >
+                  Math.min(stateIndex, streamIndex ?? stateIndex),
+            )
             if ((acked.at(-1)?.index ?? 0) > (streamIndex ?? stateIndex))
               refreshIdleStream()
             notify()
@@ -2219,14 +2240,15 @@ export function createClient<
           return
         }
 
-        // The server fold subsumes everything observed through the old
-        // state index. Keep later optimistic work overlaid, retiring acked
-        // entries the new state index proves are already durable.
+        // State hydration does not subsume delivery: unobserved ACKs still
+        // keep an idle stream catching up even when their state is covered.
         stateIndex = nextIndex
         foldedState = next.initialState
         mergeServerEvents(next.initialEvents, stateIndex)
         pending = pending.filter(
-          (entry) => !entry.acked || entry.acked.index > stateIndex,
+          (entry) =>
+            !entry.acked ||
+            entry.acked.index > Math.min(stateIndex, streamIndex ?? stateIndex),
         )
         if (confirmWatchers.some((watcher) => watcher.index <= stateIndex)) {
           const due = confirmWatchers.filter(

package/src/licenses/Apache-2.0.txt

@@ -0,0 +1,55 @@
+Apache License
+
+Version 2.0, January 2004
+
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

package/src/parse-partial-json.ts

@@ -0,0 +1,441 @@
+/*!
+ * Adapted from AI SDK 7.0.58, packages/ai/src/util/fix-json.ts.
+ * Source: https://github.com/vercel/ai, packages/ai/src/util/fix-json.ts.
+ * Modified to expose a synchronous partial parser with strict TypeScript types.
+ * Also preserves positive exponents in unfinished containers.
+ * Copyright 2023 Vercel, Inc.
+ * @license Apache-2.0. See src/licenses/Apache-2.0.txt.
+ */
+
+export function parsePartialJSON(text: string | undefined): unknown {
+  if (text === undefined || text.trim() === '') return undefined
+  try {
+    return JSON.parse(text) as unknown
+  } catch {
+    try {
+      return JSON.parse(repairPartialJSON(text)) as unknown
+    } catch {
+      return undefined
+    }
+  }
+}
+
+type State =
+  | 'ROOT'
+  | 'FINISH'
+  | 'INSIDE_STRING'
+  | 'INSIDE_STRING_ESCAPE'
+  | 'INSIDE_STRING_UNICODE_ESCAPE'
+  | 'INSIDE_LITERAL'
+  | 'INSIDE_NUMBER'
+  | 'INSIDE_OBJECT_START'
+  | 'INSIDE_OBJECT_KEY'
+  | 'INSIDE_OBJECT_AFTER_KEY'
+  | 'INSIDE_OBJECT_BEFORE_VALUE'
+  | 'INSIDE_OBJECT_AFTER_VALUE'
+  | 'INSIDE_OBJECT_AFTER_COMMA'
+  | 'INSIDE_ARRAY_START'
+  | 'INSIDE_ARRAY_AFTER_VALUE'
+  | 'INSIDE_ARRAY_AFTER_COMMA'
+
+const isHexDigit = (char: string): boolean =>
+  (char >= '0' && char <= '9') ||
+  (char >= 'A' && char <= 'F') ||
+  (char >= 'a' && char <= 'f')
+
+function repairPartialJSON(input: string): string {
+  const stack: State[] = ['ROOT']
+  let lastValidIndex = -1
+  let literalStart: number | null = null
+  let unicodeEscapeDigits = 0
+
+  function processValueStart(char: string, i: number, swapState: State) {
+    {
+      switch (char) {
+        case '"': {
+          lastValidIndex = i
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_STRING')
+          break
+        }
+
+        case 'f':
+        case 't':
+        case 'n': {
+          lastValidIndex = i
+          literalStart = i
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_LITERAL')
+          break
+        }
+
+        case '-': {
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_NUMBER')
+          break
+        }
+        case '0':
+        case '1':
+        case '2':
+        case '3':
+        case '4':
+        case '5':
+        case '6':
+        case '7':
+        case '8':
+        case '9': {
+          lastValidIndex = i
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_NUMBER')
+          break
+        }
+
+        case '{': {
+          lastValidIndex = i
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_OBJECT_START')
+          break
+        }
+
+        case '[': {
+          lastValidIndex = i
+          stack.pop()
+          stack.push(swapState)
+          stack.push('INSIDE_ARRAY_START')
+          break
+        }
+      }
+    }
+  }
+
+  function processAfterObjectValue(char: string, i: number) {
+    switch (char) {
+      case ',': {
+        stack.pop()
+        stack.push('INSIDE_OBJECT_AFTER_COMMA')
+        break
+      }
+      case '}': {
+        lastValidIndex = i
+        stack.pop()
+        break
+      }
+    }
+  }
+
+  function processAfterArrayValue(char: string, i: number) {
+    switch (char) {
+      case ',': {
+        stack.pop()
+        stack.push('INSIDE_ARRAY_AFTER_COMMA')
+        break
+      }
+      case ']': {
+        lastValidIndex = i
+        stack.pop()
+        break
+      }
+    }
+  }
+
+  for (let i = 0; i < input.length; i++) {
+    const char = input[i]!
+    const currentState = stack[stack.length - 1]
+
+    switch (currentState) {
+      case 'ROOT':
+        processValueStart(char, i, 'FINISH')
+        break
+
+      case 'INSIDE_OBJECT_START': {
+        switch (char) {
+          case '"': {
+            stack.pop()
+            stack.push('INSIDE_OBJECT_KEY')
+            break
+          }
+          case '}': {
+            lastValidIndex = i
+            stack.pop()
+            break
+          }
+        }
+        break
+      }
+
+      case 'INSIDE_OBJECT_AFTER_COMMA': {
+        switch (char) {
+          case '"': {
+            stack.pop()
+            stack.push('INSIDE_OBJECT_KEY')
+            break
+          }
+        }
+        break
+      }
+
+      case 'INSIDE_OBJECT_KEY': {
+        switch (char) {
+          case '"': {
+            stack.pop()
+            stack.push('INSIDE_OBJECT_AFTER_KEY')
+            break
+          }
+        }
+        break
+      }
+
+      case 'INSIDE_OBJECT_AFTER_KEY': {
+        switch (char) {
+          case ':': {
+            stack.pop()
+            stack.push('INSIDE_OBJECT_BEFORE_VALUE')
+
+            break
+          }
+        }
+        break
+      }
+
+      case 'INSIDE_OBJECT_BEFORE_VALUE': {
+        processValueStart(char, i, 'INSIDE_OBJECT_AFTER_VALUE')
+        break
+      }
+
+      case 'INSIDE_OBJECT_AFTER_VALUE': {
+        processAfterObjectValue(char, i)
+        break
+      }
+
+      case 'INSIDE_STRING': {
+        switch (char) {
+          case '"': {
+            stack.pop()
+            lastValidIndex = i
+            break
+          }
+
+          case '\\': {
+            stack.push('INSIDE_STRING_ESCAPE')
+            break
+          }
+
+          default: {
+            lastValidIndex = i
+          }
+        }
+
+        break
+      }
+
+      case 'INSIDE_ARRAY_START': {
+        switch (char) {
+          case ']': {
+            lastValidIndex = i
+            stack.pop()
+            break
+          }
+
+          default: {
+            lastValidIndex = i
+            processValueStart(char, i, 'INSIDE_ARRAY_AFTER_VALUE')
+            break
+          }
+        }
+        break
+      }
+
+      case 'INSIDE_ARRAY_AFTER_VALUE': {
+        switch (char) {
+          case ',': {
+            stack.pop()
+            stack.push('INSIDE_ARRAY_AFTER_COMMA')
+            break
+          }
+
+          case ']': {
+            lastValidIndex = i
+            stack.pop()
+            break
+          }
+
+          default: {
+            lastValidIndex = i
+            break
+          }
+        }
+
+        break
+      }
+
+      case 'INSIDE_ARRAY_AFTER_COMMA': {
+        processValueStart(char, i, 'INSIDE_ARRAY_AFTER_VALUE')
+        break
+      }
+
+      case 'INSIDE_STRING_ESCAPE': {
+        stack.pop()
+
+        if (char === 'u') {
+          unicodeEscapeDigits = 0
+          stack.push('INSIDE_STRING_UNICODE_ESCAPE')
+        } else {
+          lastValidIndex = i
+        }
+
+        break
+      }
+
+      case 'INSIDE_STRING_UNICODE_ESCAPE': {
+        if (isHexDigit(char)) {
+          unicodeEscapeDigits++
+
+          if (unicodeEscapeDigits === 4) {
+            stack.pop()
+            lastValidIndex = i
+          }
+        }
+
+        break
+      }
+
+      case 'INSIDE_NUMBER': {
+        switch (char) {
+          case '0':
+          case '1':
+          case '2':
+          case '3':
+          case '4':
+          case '5':
+          case '6':
+          case '7':
+          case '8':
+          case '9': {
+            lastValidIndex = i
+            break
+          }
+
+          case 'e':
+          case 'E':
+          case '-':
+          case '+':
+          case '.': {
+            break
+          }
+
+          case ',': {
+            stack.pop()
+
+            if (stack[stack.length - 1] === 'INSIDE_ARRAY_AFTER_VALUE') {
+              processAfterArrayValue(char, i)
+            }
+
+            if (stack[stack.length - 1] === 'INSIDE_OBJECT_AFTER_VALUE') {
+              processAfterObjectValue(char, i)
+            }
+
+            break
+          }
+
+          case '}': {
+            stack.pop()
+
+            if (stack[stack.length - 1] === 'INSIDE_OBJECT_AFTER_VALUE') {
+              processAfterObjectValue(char, i)
+            }
+
+            break
+          }
+
+          case ']': {
+            stack.pop()
+
+            if (stack[stack.length - 1] === 'INSIDE_ARRAY_AFTER_VALUE') {
+              processAfterArrayValue(char, i)
+            }
+
+            break
+          }
+
+          default: {
+            stack.pop()
+            break
+          }
+        }
+
+        break
+      }
+
+      case 'INSIDE_LITERAL': {
+        const partialLiteral = input.substring(literalStart!, i + 1)
+
+        if (
+          !'false'.startsWith(partialLiteral) &&
+          !'true'.startsWith(partialLiteral) &&
+          !'null'.startsWith(partialLiteral)
+        ) {
+          stack.pop()
+
+          if (stack[stack.length - 1] === 'INSIDE_OBJECT_AFTER_VALUE') {
+            processAfterObjectValue(char, i)
+          } else if (stack[stack.length - 1] === 'INSIDE_ARRAY_AFTER_VALUE') {
+            processAfterArrayValue(char, i)
+          }
+        } else {
+          lastValidIndex = i
+        }
+
+        break
+      }
+    }
+  }
+
+  let result = input.slice(0, lastValidIndex + 1)
+
+  for (let i = stack.length - 1; i >= 0; i--) {
+    const state = stack[i]
+
+    switch (state) {
+      case 'INSIDE_STRING': {
+        result += '"'
+        break
+      }
+
+      case 'INSIDE_OBJECT_KEY':
+      case 'INSIDE_OBJECT_AFTER_KEY':
+      case 'INSIDE_OBJECT_AFTER_COMMA':
+      case 'INSIDE_OBJECT_START':
+      case 'INSIDE_OBJECT_BEFORE_VALUE':
+      case 'INSIDE_OBJECT_AFTER_VALUE': {
+        result += '}'
+        break
+      }
+
+      case 'INSIDE_ARRAY_START':
+      case 'INSIDE_ARRAY_AFTER_COMMA':
+      case 'INSIDE_ARRAY_AFTER_VALUE': {
+        result += ']'
+        break
+      }
+
+      case 'INSIDE_LITERAL': {
+        const partialLiteral = input.substring(literalStart!, input.length)
+
+        if ('true'.startsWith(partialLiteral)) {
+          result += 'true'.slice(partialLiteral.length)
+        } else if ('false'.startsWith(partialLiteral)) {
+          result += 'false'.slice(partialLiteral.length)
+        } else if ('null'.startsWith(partialLiteral)) {
+          result += 'null'.slice(partialLiteral.length)
+        }
+      }
+    }
+  }
+
+  return result
+}

package/src/reducer.ts

@@ -2,6 +2,10 @@ import type { ContractEvent, EventDefs, PresenceDefs } from './contract.ts'
 import type { StandardSchemaV1 } from './standard-schema.ts'
 import { validateSync } from './validate.ts'
 
+export const clientStateProjection: unique symbol = Symbol(
+  'a2.clientStateProjection',
+)
+
 /**
  * A pure fold over a session's events — `(state, event) => state` —
  * derived from a contract via `contract.reducer(options).fold(fn)`.
@@ -29,6 +33,8 @@ export type Reducer<
   readonly presence: Readonly<P>
   readonly fold: (state: S, event: ContractEvent<D>) => S
   readonly initialState: S
+  /** Internal read-side projection. Never used as a fold input or persisted. */
+  readonly [clientStateProjection]?: (state: S) => S
   /**
    * When present: `initialState` was validated against it at
    * definition, and any cached fold a2 rehydrates (server snapshots,

package/src/server.ts

@@ -944,7 +944,7 @@ export function createServer<
   const readHistory = async (
     sessionId: string,
     bounds?: { gte?: number; lte?: number },
-  ): Promise<StoredEvent[]> => {
+  ): Promise<Event[]> => {
     const gte = bounds?.gte
     const lte = bounds?.lte
     assertHistoryIndex('gte', gte)
@@ -967,7 +967,9 @@ export function createServer<
                 : { afterIndex: Math.max(0, gte - 1) }),
               ...(lte === undefined ? {} : { throughIndex: lte }),
             }
-      const rows = await store.read(nsId(sessionId), readOptions)
+      const rows = await (store.readHistory
+        ? store.readHistory(nsId(sessionId), readOptions)
+        : store.read(nsId(sessionId), readOptions))
       return rows.filter(
         (row) =>
           (gte === undefined || row.index >= gte) &&
@@ -2001,6 +2003,7 @@ export function createServer<
     close(): Promise<void>
   }> => {
     let hub = abortHubs.get(ns)
+    const created = hub === undefined
     if (!hub) hub = createAbortHub(store, ns, trigger.index)
     const activeTypes = new Set<string>()
     for (const active of hub.subscriptions) {
@@ -2022,8 +2025,9 @@ export function createServer<
     }
     hub.subscriptions.add(subscription)
     const needsCatchup =
-      trigger.index < hub.startAfter ||
-      [...subscription.types].some((type) => !activeTypes.has(type))
+      !created &&
+      (trigger.index < hub.startAfter ||
+        [...subscription.types].some((type) => !activeTypes.has(type)))
     if (needsCatchup) {
       const earlier = await store.read(ns, { afterIndex: trigger.index })
       hub.startAfter = Math.min(hub.startAfter, trigger.index)

package/src/store-postgres.ts

@@ -760,6 +760,33 @@ export function postgres(options: PostgresStoreOptions = {}): PostgresStore {
       })
     },
 
+    async readHistory(sessionId, opts) {
+      return wrap(async () => {
+        if (
+          opts?.throughIndex !== undefined &&
+          opts.throughIndex <= (opts.afterIndex ?? 0)
+        )
+          return []
+        const c = await client()
+        const conditions = ['session_id = $1']
+        const params: unknown[] = [sessionId]
+        if (opts?.afterIndex !== undefined) {
+          params.push(opts.afterIndex)
+          conditions.push(`idx > $${params.length}`)
+        }
+        if (opts?.throughIndex !== undefined) {
+          params.push(opts.throughIndex)
+          conditions.push(`idx <= $${params.length}`)
+        }
+        const { rows } = await c.query(
+          `select session_id, idx, event_id, event_type, payload, created_at
+             from a2_events where ${conditions.join(' and ')} order by idx`,
+          params,
+        )
+        return rows.map(toEvent)
+      })
+    },
+
     async claimAvailable({
       sessionId,
       holder,