@earendil-works/pi-durable 1.4.0 → 1.5.1

package/dist/harness/transcript.js

@@ -0,0 +1,264 @@
+import { idFromNumber } from "../ids.js";
+const EARLIER = Object.freeze({ kind: "earlier" });
+/**
+ * What a client has of one conversation: every entry it got from a view or fetched, and the gaps between (spec §9.3).
+ * A layer over any `ConversationView`, wherever it comes from: call `merge()` with every value of the view; it returns
+ * the view with the client's whole transcript as `items` instead of the window. Entries never change once committed,
+ * so the transcript only grows; a window that dropped its oldest entries keeps them here.
+ *
+ * A window whose `before` lies past the newest entry the client has does not continue it, after a stall, an overflow,
+ * or a reconnect: the entries in between become a gap. Nothing counts entries or computes ranges from entry IDs, which
+ * have holes; only exclusive bounds are turned into the inclusive bounds of `EntryQuery`. After a drop, a new watch
+ * with `resume` as its window continues the transcript.
+ *
+ * A merge costs O(items) and never re-sorts or re-fetches; a merge, `loadEarlier()`, or `fillGap()` that adds nothing
+ * returns the previous `items` array. Concurrent calls of `loadEarlier()`, or of `fillGap()` for the same gap, share one
+ * load, so a placeholder that stays visible does not fetch twice.
+ */
+export class ConversationTranscript {
+    #load;
+    #pageSize;
+    /** Every entry held, in ID order, as items. */
+    #entries = [];
+    #ids = new Set();
+    /** Gaps in ID order; each is an immutable item, replaced when it shrinks. */
+    #gaps = [];
+    /** Whether anything was merged yet. */
+    #started = false;
+    /** Exclusive lower bound of the known range: entries at or below it are not loaded; `-Infinity` at the start. */
+    #low = Number.NEGATIVE_INFINITY;
+    /** Inclusive upper bound of the known range: the newest entry, or a later empty window's `before`. */
+    #tail = Number.NEGATIVE_INFINITY;
+    #items = [];
+    #last;
+    #view;
+    #earlier;
+    #filling = new Map();
+    constructor(load, options) {
+        const pageSize = options?.pageSize ?? 50;
+        if (!Number.isSafeInteger(pageSize) || pageSize < 1) {
+            throw new RangeError(`Page size must be an integer >= 1, got ${pageSize}`);
+        }
+        this.#load = load;
+        this.#pageSize = pageSize;
+    }
+    /**
+     * The ID the transcript reaches: its newest entry, or the `before` of a later window that was empty. Undefined before
+     * the first merge and for an empty transcript.
+     */
+    get newest() {
+        return this.#tail === Number.NEGATIVE_INFINITY ? undefined : idFromNumber(this.#tail);
+    }
+    /**
+     * The window that resumes this transcript after a drop: `{ from }` right after `newest`, so a new watch returns only
+     * what was missed when it fits its window, otherwise its newest entries and a gap; `{}` for an empty transcript;
+     * undefined before the first merge. `conversation.watch(context, transcript.resume)`.
+     */
+    get resume() {
+        if (!this.#started)
+            return undefined;
+        const newest = this.newest;
+        return newest === undefined ? {} : { from: idFromNumber(newest + 1) };
+    }
+    /** Take one value of the view: its window's entries join the transcript. */
+    merge(view) {
+        this.#last = view;
+        const { entries, before } = view;
+        const hi = entries.at(-1)?.id ?? before ?? Number.NEGATIVE_INFINITY;
+        this.#cover(before ?? Number.NEGATIVE_INFINITY, hi, entries);
+        return this.#result();
+    }
+    /** Load the page before the oldest entry held. Without anything earlier, returns the current view. */
+    loadEarlier(context) {
+        const last = this.#last;
+        if (last === undefined)
+            return Promise.reject(new Error("ConversationTranscript: merge a view first"));
+        if (this.#low === Number.NEGATIVE_INFINITY)
+            return Promise.resolve(this.#result());
+        if (this.#earlier !== undefined)
+            return this.#earlier;
+        const low = this.#low;
+        // The loader runs in a later microtask, so even its synchronous throw settles a promise that is already shared.
+        const loading = Promise.resolve().then(async () => {
+            const query = { maxEntryId: idFromNumber(low), order: "descending" };
+            const page = await this.#load(query, this.#pageSize, context);
+            const items = [...page.items].reverse();
+            const oldest = items[0];
+            // No next page, or an empty one: the transcript starts here.
+            if (page.next === undefined || oldest === undefined)
+                this.#cover(Number.NEGATIVE_INFINITY, low, items);
+            else
+                this.#cover(oldest.id - 1, low, items);
+            return this.#result();
+        });
+        this.#earlier = loading;
+        const settled = () => {
+            if (this.#earlier === loading)
+                this.#earlier = undefined;
+        };
+        loading.then(settled, settled);
+        return loading;
+    }
+    /**
+     * Load the next page of `gap`, a gap item of `items`, shrinking it from its start, or removing it once nothing is
+     * missing. A gap that has shrunk since loads the gap it became; one that is no longer there returns the current view.
+     */
+    fillGap(gap, context) {
+        const current = this.#gaps.find((each) => each.after === gap.after && each.upTo === gap.upTo) ??
+            this.#gaps.find((each) => each.after < gap.upTo && gap.after < each.upTo);
+        if (current === undefined) {
+            const last = this.#last;
+            if (last === undefined)
+                return Promise.reject(new Error("ConversationTranscript: merge a view first"));
+            return Promise.resolve(this.#result());
+        }
+        // Keyed by the gap the call resolved to, so a stale descriptor and the current one share the load.
+        const key = `${current.after}:${current.upTo}`;
+        const running = this.#filling.get(key);
+        if (running !== undefined)
+            return running;
+        const filling = Promise.resolve().then(async () => {
+            const query = {
+                minEntryId: idFromNumber(current.after + 1),
+                maxEntryId: idFromNumber(current.upTo - 1),
+                order: "ascending",
+            };
+            const page = await this.#load(query, this.#pageSize, context);
+            const newest = page.items.at(-1);
+            // No next page, or an empty one: nothing else is missing.
+            if (page.next === undefined || newest === undefined)
+                this.#cover(current.after, current.upTo - 1, page.items);
+            else
+                this.#cover(current.after, newest.id, page.items);
+            return this.#result();
+        });
+        this.#filling.set(key, filling);
+        const settled = () => {
+            if (this.#filling.get(key) === filling)
+                this.#filling.delete(key);
+        };
+        filling.then(settled, settled);
+        return filling;
+    }
+    /**
+     * Record that every entry with an ID in (`lo`, `hi`] is known, `added` being those entries in ID order: hold the new
+     * ones, shrink the gaps they fill, extend the known range, and open a gap where the range does not continue it.
+     */
+    #cover(lo, hi, added) {
+        const fresh = added.filter((entry) => !this.#ids.has(entry.id));
+        for (const entry of fresh)
+            this.#ids.add(entry.id);
+        const held = this.#entries;
+        // New entries past every held one: the items grow at their end.
+        const appended = fresh.length === 0 || held.length === 0 || fresh[0].id > held.at(-1).entry.id;
+        const items = fresh.map((entry) => ({ kind: "entry", entry }));
+        if (items.length > 0)
+            this.#entries = appended ? held.concat(items) : mergeById(held, items);
+        let rebuild = false;
+        if (!this.#started || (held.length === 0 && this.#gaps.length === 0 && lo >= this.#tail)) {
+            // The first range, or one after an empty transcript: it is all the client knows.
+            rebuild = !this.#started || lo !== this.#low;
+            this.#started = true;
+            this.#low = lo;
+            this.#tail = Math.max(this.#tail, hi);
+        }
+        else if (lo > this.#tail) {
+            // Past the newest known ID: what lies between is missing.
+            const upTo = added[0]?.id ?? lo + 1;
+            this.#gaps = [...this.#gaps, gapOf(this.#tail, upTo)];
+            this.#tail = hi;
+            rebuild = true;
+        }
+        else if (hi !== Number.NEGATIVE_INFINITY && hi < this.#low) {
+            // Below the oldest known ID: what lies between is missing.
+            const upTo = held.find((item) => item.entry.id > hi)?.entry.id ?? this.#low + 1;
+            this.#gaps = [gapOf(hi, upTo), ...this.#gaps];
+            this.#low = lo;
+            rebuild = true;
+        }
+        else {
+            const gaps = this.#subtract(lo, hi);
+            if (gaps !== this.#gaps) {
+                this.#gaps = gaps;
+                rebuild = true;
+            }
+            if (lo < this.#low) {
+                this.#low = lo;
+                rebuild = true;
+            }
+            if (hi > this.#tail)
+                this.#tail = hi;
+        }
+        if (rebuild || !appended)
+            this.#items = this.#build();
+        else if (items.length > 0)
+            this.#items = this.#items.concat(items);
+    }
+    /** The gaps without (`lo`, `hi`]; the same array when none changes, as when the range is empty. */
+    #subtract(lo, hi) {
+        if (hi <= lo)
+            return this.#gaps;
+        let changed = false;
+        const gaps = [];
+        for (const gap of this.#gaps) {
+            // Missing: IDs in (after, upTo); known now: IDs in (lo, hi].
+            if (hi <= gap.after || lo + 1 >= gap.upTo) {
+                gaps.push(gap);
+                continue;
+            }
+            changed = true;
+            if (lo > gap.after) {
+                const firstKnown = this.#entries.find((item) => item.entry.id > lo)?.entry.id ?? lo + 1;
+                gaps.push(gapOf(gap.after, Math.min(gap.upTo, firstKnown)));
+            }
+            if (hi + 1 < gap.upTo)
+                gaps.push(gapOf(hi, gap.upTo));
+        }
+        return changed ? gaps : this.#gaps;
+    }
+    /** Items in ID order: "earlier" until the start is known, then entries with each gap before the entry after it. */
+    #build() {
+        const items = this.#low === Number.NEGATIVE_INFINITY ? [] : [EARLIER];
+        const gaps = this.#gaps;
+        let next = 0;
+        for (const item of this.#entries) {
+            while (next < gaps.length && gaps[next].after < item.entry.id)
+                items.push(gaps[next++]);
+            items.push(item);
+        }
+        while (next < gaps.length)
+            items.push(gaps[next++]);
+        return items;
+    }
+    /** The view with the current items; the previous one when nothing changed. */
+    #result() {
+        const last = this.#last;
+        const previous = this.#view;
+        if (previous !== undefined &&
+            previous.items === this.#items &&
+            previous.docs === last.docs &&
+            previous.conversation === last.conversation) {
+            return previous;
+        }
+        this.#view = { conversation: last.conversation, docs: last.docs, items: this.#items };
+        return this.#view;
+    }
+}
+function gapOf(after, upTo) {
+    return Object.freeze({ kind: "gap", after: idFromNumber(after), upTo: idFromNumber(upTo) });
+}
+/** Two ID-ordered item lists merged in one pass. */
+function mergeById(left, right) {
+    const merged = [];
+    let i = 0;
+    let j = 0;
+    while (i < left.length && j < right.length) {
+        merged.push(left[i].entry.id < right[j].entry.id ? left[i++] : right[j++]);
+    }
+    while (i < left.length)
+        merged.push(left[i++]);
+    while (j < right.length)
+        merged.push(right[j++]);
+    return merged;
+}
+//# sourceMappingURL=transcript.js.map

package/dist/harness/transcript.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transcript.js","sourceRoot":"","sources":["../../src/harness/transcript.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAgCzC,MAAM,OAAO,GAAmB,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;AAEnE;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,sBAAsB;IACzB,KAAK,CAAc;IACnB,SAAS,CAAS;IAC3B,+CAA+C;IAC/C,QAAQ,GAAgB,EAAE,CAAC;IAClB,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;IACnC,6EAA6E;IAC7E,KAAK,GAAU,EAAE,CAAC;IAClB,uCAAuC;IACvC,QAAQ,GAAG,KAAK,CAAC;IACjB,iHAAiH;IACjH,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAChC,sGAAsG;IACtG,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACjC,MAAM,GAA8B,EAAE,CAAC;IACvC,KAAK,CAA+B;IACpC,KAAK,CAA6B;IAClC,QAAQ,CAAsC;IACrC,QAAQ,GAAG,IAAI,GAAG,EAAmC,CAAC;IAE/D,YAAY,IAAiB,EAAE,OAAuC;QACrE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,UAAU,CAAC,0CAA0C,QAAQ,EAAE,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAU,IAAI,CAAC,KAAK,CAAC,CAAC;IAChG,CAAC;IAED;;;;OAIG;IACH,IAAI,MAAM;QACT,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAU,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;IAChF,CAAC;IAED,4EAA4E;IAC5E,KAAK,CAAC,IAAsB;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,MAAM,IAAI,MAAM,CAAC,iBAAiB,CAAC;QACpE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,iBAAiB,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED,sGAAsG;IACtG,WAAW,CAAC,OAAgB;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC,CAAC;QACvG,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,iBAAiB;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACnF,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,gHAAgH;QAChH,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YACjD,MAAM,KAAK,GAAG,EAAE,UAAU,EAAE,YAAY,CAAU,GAAG,CAAC,EAAE,KAAK,EAAE,YAAY,EAAW,CAAC;YACvF,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,6DAA6D;YAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,iBAAiB,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;;gBAClG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,MAAM,OAAO,GAAG,GAAS,EAAE;YAC1B,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO;gBAAE,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1D,CAAC,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,GAAQ,EAAE,OAAgB;QACjC,MAAM,OAAO,GACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC;YAC7E,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3E,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC,CAAC;YACvG,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,mGAAmG;QACnG,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,OAAO,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YACjD,MAAM,KAAK,GAAG;gBACb,UAAU,EAAE,YAAY,CAAU,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;gBACpD,UAAU,EAAE,YAAY,CAAU,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;gBACnD,KAAK,EAAE,WAAW;aACT,CAAC;YACX,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,0DAA0D;YAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBACzG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACvD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,GAAS,EAAE;YAC1B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,OAAO;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACnE,CAAC,CAAC;QACF,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,KAA6B;QAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,KAAK,MAAM,KAAK,IAAI,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC3B,gEAAgE;QAChE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QACjG,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7F,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1F,iFAAiF;YACjF,OAAO,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC;YAC7C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;aAAM,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC5B,0DAA0D;YAC1D,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChB,OAAO,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,IAAI,EAAE,KAAK,MAAM,CAAC,iBAAiB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YAChF,IAAI,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YACf,OAAO,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACP,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;gBAClB,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;gBACf,OAAO,GAAG,IAAI,CAAC;YAChB,CAAC;YACD,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACtC,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;aACjD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpE,CAAC;IAED,mGAAmG;IACnG,SAAS,CAAC,EAAU,EAAE,EAAU;QAC/B,IAAI,EAAE,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QAChC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,IAAI,GAAU,EAAE,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,6DAA6D;YAC7D,IAAI,EAAE,IAAI,GAAG,CAAC,KAAK,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC3C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,SAAS;YACV,CAAC;YACD,OAAO,GAAG,IAAI,CAAC;YACf,IAAI,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;gBACpB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBACxF,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC;YACD,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI;gBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,mHAAmH;IACnH,MAAM;QACL,MAAM,KAAK,GAAqB,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAE,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAE,CAAC,CAAC;YAC1F,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAE,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,8EAA8E;IAC9E,OAAO;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;QAC5B,IACC,QAAQ,KAAK,SAAS;YACtB,QAAQ,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM;YAC9B,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;YAC3B,QAAQ,CAAC,YAAY,KAAK,IAAI,CAAC,YAAY,EAC1C,CAAC;YACF,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QACtF,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;CACD;AAED,SAAS,KAAK,CAAC,KAAa,EAAE,IAAY;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,CAAU,KAAK,CAAC,EAAE,IAAI,EAAE,YAAY,CAAU,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/G,CAAC;AAED,oDAAoD;AACpD,SAAS,SAAS,CAAC,IAA0B,EAAE,KAA2B;IACzE,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;IAChD,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC;AACf,CAAC","sourcesContent":["import type { Context } from \"@earendil-works/chord/context\";\nimport { idFromNumber } from \"../ids.ts\";\nimport type { Cursor, EntryId, EntryQuery, EntryRecord, Page } from \"../types.ts\";\nimport type { ConversationView, ConversationWindow } from \"./view.ts\";\n\n/** One row of a client's transcript. */\nexport type TranscriptItem =\n\t| { readonly kind: \"entry\"; readonly entry: EntryRecord }\n\t/** Entries strictly between `after` and `upTo` are missing: render \"load more\" and call `fillGap()`. */\n\t| { readonly kind: \"gap\"; readonly after: EntryId; readonly upTo: EntryId }\n\t/** The transcript continues above: render \"load earlier\" and call `loadEarlier()`. Always the first item. */\n\t| { readonly kind: \"earlier\" };\n\n/** The conversation view as a renderer sees it: `items`, the client's whole transcript, instead of the window. */\nexport type TranscriptView = Omit<ConversationView, \"entries\" | \"before\"> & {\n\treadonly items: readonly TranscriptItem[];\n};\n\n/** Pages a conversation's entries, as `Conversation.entries()` does without a cursor. */\nexport type EntryLoader = (\n\tquery: Omit<EntryQuery, \"conversationId\">,\n\tlimit: number,\n\tcontext: Context,\n) => Promise<Page<EntryRecord, Cursor>>;\n\nexport type ConversationTranscriptOptions = {\n\t/** Entries `loadEarlier()` and `fillGap()` load per call; default 50. */\n\treadonly pageSize?: number;\n};\n\ntype Gap = Extract<TranscriptItem, { kind: \"gap\" }>;\ntype EntryItem = Extract<TranscriptItem, { kind: \"entry\" }>;\n\nconst EARLIER: TranscriptItem = Object.freeze({ kind: \"earlier\" });\n\n/**\n * What a client has of one conversation: every entry it got from a view or fetched, and the gaps between (spec §9.3).\n * A layer over any `ConversationView`, wherever it comes from: call `merge()` with every value of the view; it returns\n * the view with the client's whole transcript as `items` instead of the window. Entries never change once committed,\n * so the transcript only grows; a window that dropped its oldest entries keeps them here.\n *\n * A window whose `before` lies past the newest entry the client has does not continue it, after a stall, an overflow,\n * or a reconnect: the entries in between become a gap. Nothing counts entries or computes ranges from entry IDs, which\n * have holes; only exclusive bounds are turned into the inclusive bounds of `EntryQuery`. After a drop, a new watch\n * with `resume` as its window continues the transcript.\n *\n * A merge costs O(items) and never re-sorts or re-fetches; a merge, `loadEarlier()`, or `fillGap()` that adds nothing\n * returns the previous `items` array. Concurrent calls of `loadEarlier()`, or of `fillGap()` for the same gap, share one\n * load, so a placeholder that stays visible does not fetch twice.\n */\nexport class ConversationTranscript {\n\treadonly #load: EntryLoader;\n\treadonly #pageSize: number;\n\t/** Every entry held, in ID order, as items. */\n\t#entries: EntryItem[] = [];\n\treadonly #ids = new Set<EntryId>();\n\t/** Gaps in ID order; each is an immutable item, replaced when it shrinks. */\n\t#gaps: Gap[] = [];\n\t/** Whether anything was merged yet. */\n\t#started = false;\n\t/** Exclusive lower bound of the known range: entries at or below it are not loaded; `-Infinity` at the start. */\n\t#low = Number.NEGATIVE_INFINITY;\n\t/** Inclusive upper bound of the known range: the newest entry, or a later empty window's `before`. */\n\t#tail = Number.NEGATIVE_INFINITY;\n\t#items: readonly TranscriptItem[] = [];\n\t#last: ConversationView | undefined;\n\t#view: TranscriptView | undefined;\n\t#earlier: Promise<TranscriptView> | undefined;\n\treadonly #filling = new Map<string, Promise<TranscriptView>>();\n\n\tconstructor(load: EntryLoader, options?: ConversationTranscriptOptions) {\n\t\tconst pageSize = options?.pageSize ?? 50;\n\t\tif (!Number.isSafeInteger(pageSize) || pageSize < 1) {\n\t\t\tthrow new RangeError(`Page size must be an integer >= 1, got ${pageSize}`);\n\t\t}\n\t\tthis.#load = load;\n\t\tthis.#pageSize = pageSize;\n\t}\n\n\t/**\n\t * The ID the transcript reaches: its newest entry, or the `before` of a later window that was empty. Undefined before\n\t * the first merge and for an empty transcript.\n\t */\n\tget newest(): EntryId | undefined {\n\t\treturn this.#tail === Number.NEGATIVE_INFINITY ? undefined : idFromNumber<EntryId>(this.#tail);\n\t}\n\n\t/**\n\t * The window that resumes this transcript after a drop: `{ from }` right after `newest`, so a new watch returns only\n\t * what was missed when it fits its window, otherwise its newest entries and a gap; `{}` for an empty transcript;\n\t * undefined before the first merge. `conversation.watch(context, transcript.resume)`.\n\t */\n\tget resume(): ConversationWindow | undefined {\n\t\tif (!this.#started) return undefined;\n\t\tconst newest = this.newest;\n\t\treturn newest === undefined ? {} : { from: idFromNumber<EntryId>(newest + 1) };\n\t}\n\n\t/** Take one value of the view: its window's entries join the transcript. */\n\tmerge(view: ConversationView): TranscriptView {\n\t\tthis.#last = view;\n\t\tconst { entries, before } = view;\n\t\tconst hi = entries.at(-1)?.id ?? before ?? Number.NEGATIVE_INFINITY;\n\t\tthis.#cover(before ?? Number.NEGATIVE_INFINITY, hi, entries);\n\t\treturn this.#result();\n\t}\n\n\t/** Load the page before the oldest entry held. Without anything earlier, returns the current view. */\n\tloadEarlier(context: Context): Promise<TranscriptView> {\n\t\tconst last = this.#last;\n\t\tif (last === undefined) return Promise.reject(new Error(\"ConversationTranscript: merge a view first\"));\n\t\tif (this.#low === Number.NEGATIVE_INFINITY) return Promise.resolve(this.#result());\n\t\tif (this.#earlier !== undefined) return this.#earlier;\n\t\tconst low = this.#low;\n\t\t// The loader runs in a later microtask, so even its synchronous throw settles a promise that is already shared.\n\t\tconst loading = Promise.resolve().then(async () => {\n\t\t\tconst query = { maxEntryId: idFromNumber<EntryId>(low), order: \"descending\" } as const;\n\t\t\tconst page = await this.#load(query, this.#pageSize, context);\n\t\t\tconst items = [...page.items].reverse();\n\t\t\tconst oldest = items[0];\n\t\t\t// No next page, or an empty one: the transcript starts here.\n\t\t\tif (page.next === undefined || oldest === undefined) this.#cover(Number.NEGATIVE_INFINITY, low, items);\n\t\t\telse this.#cover(oldest.id - 1, low, items);\n\t\t\treturn this.#result();\n\t\t});\n\t\tthis.#earlier = loading;\n\t\tconst settled = (): void => {\n\t\t\tif (this.#earlier === loading) this.#earlier = undefined;\n\t\t};\n\t\tloading.then(settled, settled);\n\t\treturn loading;\n\t}\n\n\t/**\n\t * Load the next page of `gap`, a gap item of `items`, shrinking it from its start, or removing it once nothing is\n\t * missing. A gap that has shrunk since loads the gap it became; one that is no longer there returns the current view.\n\t */\n\tfillGap(gap: Gap, context: Context): Promise<TranscriptView> {\n\t\tconst current =\n\t\t\tthis.#gaps.find((each) => each.after === gap.after && each.upTo === gap.upTo) ??\n\t\t\tthis.#gaps.find((each) => each.after < gap.upTo && gap.after < each.upTo);\n\t\tif (current === undefined) {\n\t\t\tconst last = this.#last;\n\t\t\tif (last === undefined) return Promise.reject(new Error(\"ConversationTranscript: merge a view first\"));\n\t\t\treturn Promise.resolve(this.#result());\n\t\t}\n\t\t// Keyed by the gap the call resolved to, so a stale descriptor and the current one share the load.\n\t\tconst key = `${current.after}:${current.upTo}`;\n\t\tconst running = this.#filling.get(key);\n\t\tif (running !== undefined) return running;\n\t\tconst filling = Promise.resolve().then(async () => {\n\t\t\tconst query = {\n\t\t\t\tminEntryId: idFromNumber<EntryId>(current.after + 1),\n\t\t\t\tmaxEntryId: idFromNumber<EntryId>(current.upTo - 1),\n\t\t\t\torder: \"ascending\",\n\t\t\t} as const;\n\t\t\tconst page = await this.#load(query, this.#pageSize, context);\n\t\t\tconst newest = page.items.at(-1);\n\t\t\t// No next page, or an empty one: nothing else is missing.\n\t\t\tif (page.next === undefined || newest === undefined) this.#cover(current.after, current.upTo - 1, page.items);\n\t\t\telse this.#cover(current.after, newest.id, page.items);\n\t\t\treturn this.#result();\n\t\t});\n\t\tthis.#filling.set(key, filling);\n\t\tconst settled = (): void => {\n\t\t\tif (this.#filling.get(key) === filling) this.#filling.delete(key);\n\t\t};\n\t\tfilling.then(settled, settled);\n\t\treturn filling;\n\t}\n\n\t/**\n\t * Record that every entry with an ID in (`lo`, `hi`] is known, `added` being those entries in ID order: hold the new\n\t * ones, shrink the gaps they fill, extend the known range, and open a gap where the range does not continue it.\n\t */\n\t#cover(lo: number, hi: number, added: readonly EntryRecord[]): void {\n\t\tconst fresh = added.filter((entry) => !this.#ids.has(entry.id));\n\t\tfor (const entry of fresh) this.#ids.add(entry.id);\n\t\tconst held = this.#entries;\n\t\t// New entries past every held one: the items grow at their end.\n\t\tconst appended = fresh.length === 0 || held.length === 0 || fresh[0]!.id > held.at(-1)!.entry.id;\n\t\tconst items = fresh.map((entry): EntryItem => ({ kind: \"entry\", entry }));\n\t\tif (items.length > 0) this.#entries = appended ? held.concat(items) : mergeById(held, items);\n\t\tlet rebuild = false;\n\t\tif (!this.#started || (held.length === 0 && this.#gaps.length === 0 && lo >= this.#tail)) {\n\t\t\t// The first range, or one after an empty transcript: it is all the client knows.\n\t\t\trebuild = !this.#started || lo !== this.#low;\n\t\t\tthis.#started = true;\n\t\t\tthis.#low = lo;\n\t\t\tthis.#tail = Math.max(this.#tail, hi);\n\t\t} else if (lo > this.#tail) {\n\t\t\t// Past the newest known ID: what lies between is missing.\n\t\t\tconst upTo = added[0]?.id ?? lo + 1;\n\t\t\tthis.#gaps = [...this.#gaps, gapOf(this.#tail, upTo)];\n\t\t\tthis.#tail = hi;\n\t\t\trebuild = true;\n\t\t} else if (hi !== Number.NEGATIVE_INFINITY && hi < this.#low) {\n\t\t\t// Below the oldest known ID: what lies between is missing.\n\t\t\tconst upTo = held.find((item) => item.entry.id > hi)?.entry.id ?? this.#low + 1;\n\t\t\tthis.#gaps = [gapOf(hi, upTo), ...this.#gaps];\n\t\t\tthis.#low = lo;\n\t\t\trebuild = true;\n\t\t} else {\n\t\t\tconst gaps = this.#subtract(lo, hi);\n\t\t\tif (gaps !== this.#gaps) {\n\t\t\t\tthis.#gaps = gaps;\n\t\t\t\trebuild = true;\n\t\t\t}\n\t\t\tif (lo < this.#low) {\n\t\t\t\tthis.#low = lo;\n\t\t\t\trebuild = true;\n\t\t\t}\n\t\t\tif (hi > this.#tail) this.#tail = hi;\n\t\t}\n\t\tif (rebuild || !appended) this.#items = this.#build();\n\t\telse if (items.length > 0) this.#items = this.#items.concat(items);\n\t}\n\n\t/** The gaps without (`lo`, `hi`]; the same array when none changes, as when the range is empty. */\n\t#subtract(lo: number, hi: number): Gap[] {\n\t\tif (hi <= lo) return this.#gaps;\n\t\tlet changed = false;\n\t\tconst gaps: Gap[] = [];\n\t\tfor (const gap of this.#gaps) {\n\t\t\t// Missing: IDs in (after, upTo); known now: IDs in (lo, hi].\n\t\t\tif (hi <= gap.after || lo + 1 >= gap.upTo) {\n\t\t\t\tgaps.push(gap);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tchanged = true;\n\t\t\tif (lo > gap.after) {\n\t\t\t\tconst firstKnown = this.#entries.find((item) => item.entry.id > lo)?.entry.id ?? lo + 1;\n\t\t\t\tgaps.push(gapOf(gap.after, Math.min(gap.upTo, firstKnown)));\n\t\t\t}\n\t\t\tif (hi + 1 < gap.upTo) gaps.push(gapOf(hi, gap.upTo));\n\t\t}\n\t\treturn changed ? gaps : this.#gaps;\n\t}\n\n\t/** Items in ID order: \"earlier\" until the start is known, then entries with each gap before the entry after it. */\n\t#build(): TranscriptItem[] {\n\t\tconst items: TranscriptItem[] = this.#low === Number.NEGATIVE_INFINITY ? [] : [EARLIER];\n\t\tconst gaps = this.#gaps;\n\t\tlet next = 0;\n\t\tfor (const item of this.#entries) {\n\t\t\twhile (next < gaps.length && gaps[next]!.after < item.entry.id) items.push(gaps[next++]!);\n\t\t\titems.push(item);\n\t\t}\n\t\twhile (next < gaps.length) items.push(gaps[next++]!);\n\t\treturn items;\n\t}\n\n\t/** The view with the current items; the previous one when nothing changed. */\n\t#result(): TranscriptView {\n\t\tconst last = this.#last!;\n\t\tconst previous = this.#view;\n\t\tif (\n\t\t\tprevious !== undefined &&\n\t\t\tprevious.items === this.#items &&\n\t\t\tprevious.docs === last.docs &&\n\t\t\tprevious.conversation === last.conversation\n\t\t) {\n\t\t\treturn previous;\n\t\t}\n\t\tthis.#view = { conversation: last.conversation, docs: last.docs, items: this.#items };\n\t\treturn this.#view;\n\t}\n}\n\nfunction gapOf(after: number, upTo: number): Gap {\n\treturn Object.freeze({ kind: \"gap\", after: idFromNumber<EntryId>(after), upTo: idFromNumber<EntryId>(upTo) });\n}\n\n/** Two ID-ordered item lists merged in one pass. */\nfunction mergeById(left: readonly EntryItem[], right: readonly EntryItem[]): EntryItem[] {\n\tconst merged: EntryItem[] = [];\n\tlet i = 0;\n\tlet j = 0;\n\twhile (i < left.length && j < right.length) {\n\t\tmerged.push(left[i]!.entry.id < right[j]!.entry.id ? left[i++]! : right[j++]!);\n\t}\n\twhile (i < left.length) merged.push(left[i++]!);\n\twhile (j < right.length) merged.push(right[j++]!);\n\treturn merged;\n}\n"]}