videobook-engine 2.0.1 → 5.0.1

package/dist/notebook-grid.js

@@ -0,0 +1,160 @@
+import { NOTEBOOK_GRID_ADDRESS_PATTERN } from "./notebook-mentions.js";
+export const NOTEBOOK_GRID_ROW_COUNT = 26;
+export const NOTEBOOK_GRID_COLUMN_COUNT = 13;
+export const NOTEBOOK_GRID_CAPACITY = NOTEBOOK_GRID_ROW_COUNT * NOTEBOOK_GRID_COLUMN_COUNT;
+export const NOTEBOOK_GRID_FULL_ERROR = "Notebook grid is full";
+export function isNotebookGridSlot(slot) {
+    return Number.isInteger(slot.row)
+        && slot.row >= 0
+        && slot.row < NOTEBOOK_GRID_ROW_COUNT
+        && Number.isInteger(slot.column)
+        && slot.column >= 0
+        && slot.column < NOTEBOOK_GRID_COLUMN_COUNT;
+}
+export function assertNotebookGridSlot(slot, label = "Notebook grid slot") {
+    if (!isNotebookGridSlot(slot)) {
+        throw new Error(`${label} must be within @a1-@z13`);
+    }
+}
+export function notebookGridAddress(slot) {
+    assertNotebookGridSlot(slot);
+    return `${String.fromCharCode(97 + slot.row)}${slot.column + 1}`;
+}
+export function notebookGridTag(slot) {
+    return `@${notebookGridAddress(slot)}`;
+}
+export function parseNotebookGridAddress(value) {
+    const match = NOTEBOOK_GRID_ADDRESS_PATTERN.exec(value.trim());
+    if (!match)
+        return undefined;
+    const address = match[1];
+    return {
+        row: address[0].toLowerCase().charCodeAt(0) - 97,
+        column: Number(address.slice(1)) - 1,
+    };
+}
+function occupiedNotebookGridKeys(occupied) {
+    const occupiedKeys = new Set();
+    for (const slot of occupied) {
+        assertNotebookGridSlot(slot);
+        occupiedKeys.add(`${slot.row}:${slot.column}`);
+    }
+    return occupiedKeys;
+}
+export function firstEmptyNotebookGridSlot(occupied) {
+    return firstEmptyNotebookGridSlots(occupied, 1)[0];
+}
+export function firstEmptyNotebookGridSlots(occupied, count) {
+    if (!Number.isInteger(count) || count < 0) {
+        throw new Error("Notebook grid slot count must be a nonnegative integer");
+    }
+    if (count === 0)
+        return [];
+    const occupiedKeys = occupiedNotebookGridKeys(occupied);
+    const result = [];
+    for (let row = 0; row < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+        for (let column = 0; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+            if (occupiedKeys.has(`${row}:${column}`))
+                continue;
+            result.push({ row, column });
+            if (result.length === count)
+                return result;
+        }
+    }
+    if (result.length === count)
+        return result;
+    throw new Error(NOTEBOOK_GRID_FULL_ERROR);
+}
+/**
+ * Free slot minimizing Manhattan distance from @a1.
+ * Ties break by lower row, then lower column (address order among equals).
+ */
+export function nearestOriginNotebookGridSlot(occupied) {
+    const occupiedKeys = occupiedNotebookGridKeys(occupied);
+    let best = null;
+    let bestDistance = Number.POSITIVE_INFINITY;
+    for (let row = 0; row < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+        for (let column = 0; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+            if (occupiedKeys.has(`${row}:${column}`))
+                continue;
+            const distance = row + column;
+            if (best === null
+                || distance < bestDistance
+                || (distance === bestDistance
+                    && (row < best.row
+                        || (row === best.row && column < best.column)))) {
+                best = { row, column };
+                bestDistance = distance;
+            }
+        }
+    }
+    if (!best)
+        throw new Error(NOTEBOOK_GRID_FULL_ERROR);
+    return best;
+}
+/**
+ * Next free slot scanning down the letter axis from `anchor` (inclusive).
+ * Same column first; when exhausted, spill rightward column-by-column from
+ * the anchor row; then origin-proximity fallback.
+ */
+export function nextVerticalSlotFrom(anchor, occupied) {
+    assertNotebookGridSlot(anchor);
+    const occupiedKeys = occupiedNotebookGridKeys(occupied);
+    for (let row = anchor.row; row < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+        if (!occupiedKeys.has(`${row}:${anchor.column}`)) {
+            return { row, column: anchor.column };
+        }
+    }
+    for (let column = anchor.column + 1; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+        for (let row = anchor.row; row < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+            if (!occupiedKeys.has(`${row}:${column}`)) {
+                return { row, column };
+            }
+        }
+    }
+    return nearestOriginNotebookGridSlot(occupied);
+}
+/**
+ * Next free slot scanning right along the number axis from `anchor` (inclusive).
+ * Same row first; when exhausted, spill downward row-by-row from the anchor
+ * column; then origin-proximity fallback.
+ */
+export function nextHorizontalSlotFrom(anchor, occupied) {
+    assertNotebookGridSlot(anchor);
+    const occupiedKeys = occupiedNotebookGridKeys(occupied);
+    for (let column = anchor.column; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+        if (!occupiedKeys.has(`${anchor.row}:${column}`)) {
+            return { row: anchor.row, column };
+        }
+    }
+    for (let row = anchor.row + 1; row < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+        for (let column = anchor.column; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+            if (!occupiedKeys.has(`${row}:${column}`)) {
+                return { row, column };
+            }
+        }
+    }
+    return nearestOriginNotebookGridSlot(occupied);
+}
+/**
+ * Wave placement for generation tiles: scan `waveRow` left-to-right from
+ * `startColumn` for a slot whose below-neighbor is also free (room for the
+ * tile's output cell directly beneath), advancing row by row while both stay
+ * within the board; origin-proximity fallback when no pair fits.
+ */
+export function nextWaveTileSlot(waveRow, startColumn, occupied) {
+    const occupiedKeys = occupiedNotebookGridKeys(occupied);
+    const firstRow = Math.min(Math.max(0, Math.trunc(waveRow)), NOTEBOOK_GRID_ROW_COUNT - 1);
+    const firstColumn = Math.min(Math.max(0, Math.trunc(startColumn)), NOTEBOOK_GRID_COLUMN_COUNT - 1);
+    for (let row = firstRow; row + 1 < NOTEBOOK_GRID_ROW_COUNT; row += 1) {
+        for (let column = firstColumn; column < NOTEBOOK_GRID_COLUMN_COUNT; column += 1) {
+            if (occupiedKeys.has(`${row}:${column}`))
+                continue;
+            if (occupiedKeys.has(`${row + 1}:${column}`))
+                continue;
+            return { row, column };
+        }
+    }
+    return nearestOriginNotebookGridSlot(occupied);
+}
+//# sourceMappingURL=notebook-grid.js.map

package/dist/notebook-grid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"notebook-grid.js","sourceRoot":"","sources":["../src/notebook-grid.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,6BAA6B,EAAE,MAAM,wBAAwB,CAAC;AAEvE,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAC1C,MAAM,CAAC,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAC7C,MAAM,CAAC,MAAM,sBAAsB,GACjC,uBAAuB,GAAG,0BAA0B,CAAC;AACvD,MAAM,CAAC,MAAM,wBAAwB,GAAG,uBAAuB,CAAC;AAEhE,MAAM,UAAU,kBAAkB,CAChC,IAAsB;IAEtB,OAAO,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;WAC5B,IAAI,CAAC,GAAG,IAAI,CAAC;WACb,IAAI,CAAC,GAAG,GAAG,uBAAuB;WAClC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC;WAC7B,IAAI,CAAC,MAAM,IAAI,CAAC;WAChB,IAAI,CAAC,MAAM,GAAG,0BAA0B,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,IAAsB,EACtB,KAAK,GAAG,oBAAoB;IAE5B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,0BAA0B,CAAC,CAAC;IACtD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,IAAsB;IACxD,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,IAAsB;IACpD,OAAO,IAAI,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,KAAa;IAEb,MAAM,KAAK,GAAG,6BAA6B,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/D,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;IAC1B,OAAO;QACL,GAAG,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE;QACjD,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KACrC,CAAC;AACJ,CAAC;AAED,SAAS,wBAAwB,CAC/B,QAAoC;IAEpC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC7B,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,MAAM,UAAU,0BAA0B,CACxC,QAAoC;IAEpC,OAAO,2BAA2B,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,2BAA2B,CACzC,QAAoC,EACpC,KAAa;IAEb,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,YAAY,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAC1D,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,0BAA0B,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;YACtE,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;gBAAE,SAAS;YACnD,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;gBAAE,OAAO,MAAM,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;QAAE,OAAO,MAAM,CAAC;IAC3C,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,6BAA6B,CAC3C,QAAoC;IAEpC,MAAM,YAAY,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACxD,IAAI,IAAI,GAA4B,IAAI,CAAC;IACzC,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAC1D,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,0BAA0B,EAAE,MAAM,IAAI,CAAC,EAAE,CAAC;YACtE,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;gBAAE,SAAS;YACnD,MAAM,QAAQ,GAAG,GAAG,GAAG,MAAM,CAAC;YAC9B,IACE,IAAI,KAAK,IAAI;mBACV,QAAQ,GAAG,YAAY;mBACvB,CACD,QAAQ,KAAK,YAAY;uBACtB,CACD,GAAG,GAAG,IAAI,CAAC,GAAG;2BACX,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAC9C,CACF,EACD,CAAC;gBACD,IAAI,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;gBACvB,YAAY,GAAG,QAAQ,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACrD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAwB,EACxB,QAAoC;IAEpC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,YAAY,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACxD,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;YACjD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;QACxC,CAAC;IACH,CAAC;IACD,KACE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAC9B,MAAM,GAAG,0BAA0B,EACnC,MAAM,IAAI,CAAC,EACX,CAAC;QACD,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACnE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,EAAE,CAAC;gBAC1C,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,6BAA6B,CAAC,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAwB,EACxB,QAAoC;IAEpC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,YAAY,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACxD,KACE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAC1B,MAAM,GAAG,0BAA0B,EACnC,MAAM,IAAI,CAAC,EACX,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,EAAE,CAAC,EAAE,CAAC;YACjD,OAAO,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC;QACrC,CAAC;IACH,CAAC;IACD,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACvE,KACE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAC1B,MAAM,GAAG,0BAA0B,EACnC,MAAM,IAAI,CAAC,EACX,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,EAAE,CAAC;gBAC1C,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,6BAA6B,CAAC,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAAe,EACf,WAAmB,EACnB,QAAoC;IAEpC,MAAM,YAAY,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CACvB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAChC,uBAAuB,GAAG,CAAC,CAC5B,CAAC;IACF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,EACpC,0BAA0B,GAAG,CAAC,CAC/B,CAAC;IACF,KAAK,IAAI,GAAG,GAAG,QAAQ,EAAE,GAAG,GAAG,CAAC,GAAG,uBAAuB,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACrE,KACE,IAAI,MAAM,GAAG,WAAW,EACxB,MAAM,GAAG,0BAA0B,EACnC,MAAM,IAAI,CAAC,EACX,CAAC;YACD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC;gBAAE,SAAS;YACnD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;gBAAE,SAAS;YACvD,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;IACD,OAAO,6BAA6B,CAAC,QAAQ,CAAC,CAAC;AACjD,CAAC"}

package/dist/notebook-media-artifact.d.ts

@@ -0,0 +1,23 @@
+import type { NotebookCell, NotebookDocument, NotebookEdge } from "./notebook/types.js";
+type NotebookGraph = Pick<NotebookDocument, "cells" | "edges">;
+export declare function findGenerateVideoOutputCell(document: NotebookGraph, generateVideoCellId: string): {
+    outputCell: NotebookCell;
+    outputEdge: NotebookEdge;
+} | null;
+export declare function findGenerateImageOutputCell(document: NotebookGraph, generateImageCellId: string): {
+    outputCell: NotebookCell;
+    outputEdge: NotebookEdge;
+} | null;
+export declare function findGenerateAudioOutputCell(document: NotebookGraph, generateAudioCellId: string): {
+    outputCell: NotebookCell;
+    outputEdge: NotebookEdge;
+} | null;
+/**
+ * Resolve media artifact for a notebook cell.
+ * generate_video / generate_image / generate_audio prefer a dedicated output
+ * cell, then fall back to legacy inline outputArtifactId / outputEntityId.
+ */
+export declare function resolveNotebookCellArtifactId(document: NotebookGraph, cell: NotebookCell): string | undefined;
+export declare function resolveGeneratedVideoArtifact(document: NotebookGraph, cell: NotebookCell): string | undefined;
+export {};
+//# sourceMappingURL=notebook-media-artifact.d.ts.map

package/dist/notebook-media-artifact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"notebook-media-artifact.d.ts","sourceRoot":"","sources":["../src/notebook-media-artifact.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACb,MAAM,qBAAqB,CAAC;AAE7B,KAAK,aAAa,GAAG,IAAI,CAAC,gBAAgB,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC;AAwC/D,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,aAAa,EACvB,mBAAmB,EAAE,MAAM,GAC1B;IAAE,UAAU,EAAE,YAAY,CAAC;IAAC,UAAU,EAAE,YAAY,CAAA;CAAE,GAAG,IAAI,CAO/D;AAED,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,aAAa,EACvB,mBAAmB,EAAE,MAAM,GAC1B;IAAE,UAAU,EAAE,YAAY,CAAC;IAAC,UAAU,EAAE,YAAY,CAAA;CAAE,GAAG,IAAI,CAO/D;AAED,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,aAAa,EACvB,mBAAmB,EAAE,MAAM,GAC1B;IAAE,UAAU,EAAE,YAAY,CAAC;IAAC,UAAU,EAAE,YAAY,CAAA;CAAE,GAAG,IAAI,CAO/D;AAyBD;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,QAAQ,EAAE,aAAa,EACvB,IAAI,EAAE,YAAY,GACjB,MAAM,GAAG,SAAS,CAEpB;AAED,wBAAgB,6BAA6B,CAC3C,QAAQ,EAAE,aAAa,EACvB,IAAI,EAAE,YAAY,GACjB,MAAM,GAAG,SAAS,CAEpB"}

package/dist/notebook-media-artifact.js

@@ -0,0 +1,67 @@
+function findGenerationOutputCell(document, producerCellId, outputType, mediaRole) {
+    for (const edge of document.edges) {
+        if (edge.source !== producerCellId || edge.targetInput !== "media") {
+            continue;
+        }
+        const outputCell = document.cells.find((cell) => cell.id === edge.target);
+        if (outputCell?.type === outputType
+            && outputCell.inputs?.mediaRole === mediaRole) {
+            return { outputCell, outputEdge: edge };
+        }
+        if (outputCell?.type === outputType
+            && outputCell.inputs?.producerCellId === producerCellId) {
+            return { outputCell, outputEdge: edge };
+        }
+    }
+    for (const edge of document.edges) {
+        if (edge.source !== producerCellId || edge.targetInput !== "media") {
+            continue;
+        }
+        const outputCell = document.cells.find((cell) => cell.id === edge.target);
+        if (outputCell?.type === outputType) {
+            return { outputCell, outputEdge: edge };
+        }
+    }
+    return null;
+}
+export function findGenerateVideoOutputCell(document, generateVideoCellId) {
+    return findGenerationOutputCell(document, generateVideoCellId, "video", "generate-video-output");
+}
+export function findGenerateImageOutputCell(document, generateImageCellId) {
+    return findGenerationOutputCell(document, generateImageCellId, "image", "generate-image-output");
+}
+export function findGenerateAudioOutputCell(document, generateAudioCellId) {
+    return findGenerationOutputCell(document, generateAudioCellId, "audio", "generate-audio-output");
+}
+function inlineCellArtifactId(cell) {
+    if (typeof cell.outputArtifactId === "string")
+        return cell.outputArtifactId;
+    if (typeof cell.outputEntityId === "string")
+        return cell.outputEntityId;
+    return undefined;
+}
+function outputCellArtifactId(document, cell) {
+    const output = cell.type === "generate_video"
+        ? findGenerateVideoOutputCell(document, cell.id)
+        : cell.type === "generate_image"
+            ? findGenerateImageOutputCell(document, cell.id)
+            : cell.type === "generate_audio"
+                ? findGenerateAudioOutputCell(document, cell.id)
+                : null;
+    if (typeof output?.outputCell.outputArtifactId === "string") {
+        return output.outputCell.outputArtifactId;
+    }
+    return undefined;
+}
+/**
+ * Resolve media artifact for a notebook cell.
+ * generate_video / generate_image / generate_audio prefer a dedicated output
+ * cell, then fall back to legacy inline outputArtifactId / outputEntityId.
+ */
+export function resolveNotebookCellArtifactId(document, cell) {
+    return outputCellArtifactId(document, cell) ?? inlineCellArtifactId(cell);
+}
+export function resolveGeneratedVideoArtifact(document, cell) {
+    return resolveNotebookCellArtifactId(document, cell);
+}
+//# sourceMappingURL=notebook-media-artifact.js.map

package/dist/notebook-media-artifact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"notebook-media-artifact.js","sourceRoot":"","sources":["../src/notebook-media-artifact.ts"],"names":[],"mappings":"AAUA,SAAS,wBAAwB,CAC/B,QAAuB,EACvB,cAAsB,EACtB,UAAgC,EAChC,SAAiB;IAEjB,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,cAAc,IAAI,IAAI,CAAC,WAAW,KAAK,OAAO,EAAE,CAAC;YACnE,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1E,IACE,UAAU,EAAE,IAAI,KAAK,UAAU;eAC5B,UAAU,CAAC,MAAM,EAAE,SAAS,KAAK,SAAS,EAC7C,CAAC;YACD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC1C,CAAC;QACD,IACE,UAAU,EAAE,IAAI,KAAK,UAAU;eAC5B,UAAU,CAAC,MAAM,EAAE,cAAc,KAAK,cAAc,EACvD,CAAC;YACD,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,cAAc,IAAI,IAAI,CAAC,WAAW,KAAK,OAAO,EAAE,CAAC;YACnE,SAAS;QACX,CAAC;QACD,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1E,IAAI,UAAU,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;YACpC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,2BAA2B,CACzC,QAAuB,EACvB,mBAA2B;IAE3B,OAAO,wBAAwB,CAC7B,QAAQ,EACR,mBAAmB,EACnB,OAAO,EACP,uBAAuB,CACxB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,2BAA2B,CACzC,QAAuB,EACvB,mBAA2B;IAE3B,OAAO,wBAAwB,CAC7B,QAAQ,EACR,mBAAmB,EACnB,OAAO,EACP,uBAAuB,CACxB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,2BAA2B,CACzC,QAAuB,EACvB,mBAA2B;IAE3B,OAAO,wBAAwB,CAC7B,QAAQ,EACR,mBAAmB,EACnB,OAAO,EACP,uBAAuB,CACxB,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAkB;IAC9C,IAAI,OAAO,IAAI,CAAC,gBAAgB,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,gBAAgB,CAAC;IAC5E,IAAI,OAAO,IAAI,CAAC,cAAc,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,cAAc,CAAC;IACxE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,oBAAoB,CAC3B,QAAuB,EACvB,IAAkB;IAElB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,KAAK,gBAAgB;QAC3C,CAAC,CAAC,2BAA2B,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;QAChD,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,gBAAgB;YAC9B,CAAC,CAAC,2BAA2B,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YAChD,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,gBAAgB;gBAC9B,CAAC,CAAC,2BAA2B,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;gBAChD,CAAC,CAAC,IAAI,CAAC;IACb,IAAI,OAAO,MAAM,EAAE,UAAU,CAAC,gBAAgB,KAAK,QAAQ,EAAE,CAAC;QAC5D,OAAO,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC;IAC5C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,6BAA6B,CAC3C,QAAuB,EACvB,IAAkB;IAElB,OAAO,oBAAoB,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,QAAuB,EACvB,IAAkB;IAElB,OAAO,6BAA6B,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACvD,CAAC"}

package/dist/notebook-mentions.d.ts

@@ -0,0 +1,20 @@
+export declare const NOTEBOOK_GRID_ADDRESS_SOURCE = "[a-z](?:1[0-3]|[1-9])";
+export declare const NOTEBOOK_GRID_ADDRESS_PATTERN: RegExp;
+export declare const NOTEBOOK_MENTION_PATTERN: RegExp;
+export interface NotebookMention {
+    raw: string;
+    reference: string;
+    index: number;
+    end: number;
+}
+export interface NotebookMentionReplacement {
+    reference: string;
+    replacement: string;
+}
+export declare function normalizeNotebookReference(value: string): string;
+export declare function isNotebookGridAddress(value: string): boolean;
+export declare function scanNotebookMentions(input: string): NotebookMention[];
+export declare function notebookMentionPrefixAtEnd(input: string): string | undefined;
+export declare function replaceNotebookMentions(input: string, replacements: readonly NotebookMentionReplacement[]): string;
+export declare function stripNotebookMentions(input: string, references: readonly string[]): string;
+//# sourceMappingURL=notebook-mentions.d.ts.map

package/dist/notebook-mentions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"notebook-mentions.d.ts","sourceRoot":"","sources":["../src/notebook-mentions.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,4BAA4B,0BAA0B,CAAC;AAEpE,eAAO,MAAM,6BAA6B,QAGzC,CAAC;AACF,eAAO,MAAM,wBAAwB,QAGpC,CAAC;AAEF,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,0BAA0B;IACzC,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAEhE;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE5D;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,EAAE,CAUrE;AAED,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAG5E;AAMD,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,SAAS,0BAA0B,EAAE,GAClD,MAAM,CAgBR;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,SAAS,MAAM,EAAE,GAC5B,MAAM,CAaR"}

package/dist/notebook-mentions.js

@@ -0,0 +1,53 @@
+export const NOTEBOOK_GRID_ADDRESS_SOURCE = "[a-z](?:1[0-3]|[1-9])";
+export const NOTEBOOK_GRID_ADDRESS_PATTERN = new RegExp(`^@?(${NOTEBOOK_GRID_ADDRESS_SOURCE})$`, "iu");
+export const NOTEBOOK_MENTION_PATTERN = new RegExp(`@(${NOTEBOOK_GRID_ADDRESS_SOURCE})(?![\\w-])`, "giu");
+export function normalizeNotebookReference(value) {
+    return value.trim().replace(/^@/u, "").toLowerCase();
+}
+export function isNotebookGridAddress(value) {
+    return NOTEBOOK_GRID_ADDRESS_PATTERN.test(normalizeNotebookReference(value));
+}
+export function scanNotebookMentions(input) {
+    return [...input.matchAll(NOTEBOOK_MENTION_PATTERN)].map((match) => {
+        const raw = match[0];
+        return {
+            raw,
+            reference: normalizeNotebookReference(match[1] ?? raw),
+            index: match.index,
+            end: match.index + raw.length,
+        };
+    });
+}
+export function notebookMentionPrefixAtEnd(input) {
+    const match = input.match(/@([a-z0-9]*)$/iu);
+    return match ? normalizeNotebookReference(match[1] ?? "") : undefined;
+}
+function escapePattern(value) {
+    return value.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+export function replaceNotebookMentions(input, replacements) {
+    let output = input;
+    const ordered = [...replacements]
+        .map(({ reference, replacement }) => ({
+        reference: normalizeNotebookReference(reference),
+        replacement,
+    }))
+        .filter(({ reference }) => reference.length > 0)
+        .sort((left, right) => right.reference.length - left.reference.length);
+    for (const { reference, replacement } of ordered) {
+        output = output.replace(new RegExp(`@${escapePattern(reference)}(?![\\w-])`, "giu"), replacement);
+    }
+    return output;
+}
+export function stripNotebookMentions(input, references) {
+    let output = input;
+    const ordered = references
+        .map(normalizeNotebookReference)
+        .filter((reference) => reference.length > 0)
+        .sort((left, right) => right.length - left.length);
+    for (const reference of ordered) {
+        output = output.replace(new RegExp(` ?@${escapePattern(reference)}(?![\\w-])`, "giu"), "");
+    }
+    return output;
+}
+//# sourceMappingURL=notebook-mentions.js.map

package/dist/notebook-mentions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"notebook-mentions.js","sourceRoot":"","sources":["../src/notebook-mentions.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,4BAA4B,GAAG,uBAAuB,CAAC;AAEpE,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAI,MAAM,CACrD,OAAO,4BAA4B,IAAI,EACvC,IAAI,CACL,CAAC;AACF,MAAM,CAAC,MAAM,wBAAwB,GAAG,IAAI,MAAM,CAChD,KAAK,4BAA4B,aAAa,EAC9C,KAAK,CACN,CAAC;AAcF,MAAM,UAAU,0BAA0B,CAAC,KAAa;IACtD,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,KAAa;IACjD,OAAO,6BAA6B,CAAC,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,OAAO,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,wBAAwB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACjE,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO;YACL,GAAG;YACH,SAAS,EAAE,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YACtD,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,GAAG,EAAE,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,MAAM;SAC9B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,KAAa;IACtD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC7C,OAAO,KAAK,CAAC,CAAC,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACxE,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,KAAa,EACb,YAAmD;IAEnD,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC;SAC9B,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QACpC,SAAS,EAAE,0BAA0B,CAAC,SAAS,CAAC;QAChD,WAAW;KACZ,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;SAC/C,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACzE,KAAK,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,OAAO,EAAE,CAAC;QACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CACrB,IAAI,MAAM,CAAC,IAAI,aAAa,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC,EAC3D,WAAW,CACZ,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,KAAa,EACb,UAA6B;IAE7B,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,MAAM,OAAO,GAAG,UAAU;SACvB,GAAG,CAAC,0BAA0B,CAAC;SAC/B,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3C,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;QAChC,MAAM,GAAG,MAAM,CAAC,OAAO,CACrB,IAAI,MAAM,CAAC,MAAM,aAAa,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC,EAC7D,EAAE,CACH,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/order-keys.d.ts

@@ -0,0 +1,22 @@
+export declare function isOrderKey(key: string): boolean;
+export declare function assertOrderKey(key: string, label: string): void;
+/**
+ * Returns a key that sorts strictly between `before` and `after`
+ * (either side may be null for an open end).
+ */
+export declare function orderKeyBetween(before: string | null, after: string | null): string;
+/** Key sorting immediately after `key` (or the first key when null). */
+export declare function orderKeyAfter(key: string | null): string;
+/** Dense initial keys for a freshly created ordered list. */
+export declare function initialOrderKeys(count: number): string[];
+/**
+ * Reconciles an ordered list of row identities with their stored keys,
+ * reusing existing keys for every row whose relative order is unchanged
+ * (a longest increasing subsequence) and minting midpoint keys only for
+ * new or genuinely reordered rows. Untouched rows keep their stored key,
+ * so merges with forks that appended elsewhere stay row-local.
+ *
+ * Returns the key for every desired id, in desired order.
+ */
+export declare function reconcileOrderKeys<I>(desired: readonly I[], existing: ReadonlyMap<I, string>): Map<I, string>;
+//# sourceMappingURL=order-keys.d.ts.map

package/dist/order-keys.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order-keys.d.ts","sourceRoot":"","sources":["../src/order-keys.ts"],"names":[],"mappings":"AAiCA,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAS/C;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAE/D;AA+DD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,GAAG,IAAI,EACrB,KAAK,EAAE,MAAM,GAAG,IAAI,GACnB,MAAM,CA2BR;AAED,wEAAwE;AACxE,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,CAExD;AAED,6DAA6D;AAC7D,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CASxD;AAED;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,QAAQ,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,GAC/B,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CA6ChB"}

package/dist/order-keys.js

@@ -0,0 +1,262 @@
+/**
+ * Fractional/lexicographic order keys for engine-maintained orderings
+ * (sequence tracks).
+ *
+ * Format (compatible with the "fractional-indexing" key scheme):
+ * - A key is an integer part followed by an optional fractional part.
+ * - Digits are base-62: 0-9 A-Z a-z, in ASCII (byte) order, so keys sort
+ *   correctly under SQLite's default BINARY text collation.
+ * - The integer part's first character encodes its length: 'a'..'z' for
+ *   non-negative integers (2..27 chars), 'A'..'Z' for negative integers
+ *   (2..27 chars). Zero is "a0".
+ * - The fractional part refines the order within one integer bucket.
+ *
+ * Keys are never unique by construction: two forks can independently mint
+ * the same key. Readers always break ties by the row's stable UUID.
+ */
+const DIGITS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
+const INTEGER_ZERO = "a0";
+const LAST_DIGIT = DIGITS[DIGITS.length - 1];
+const MID_DIGIT = DIGITS[DIGITS.length >> 1];
+function integerLength(head) {
+    const code = head.charCodeAt(0);
+    if (head >= "a" && head <= "z")
+        return code - 97 + 2;
+    if (head >= "A" && head <= "Z")
+        return 90 - code + 2;
+    throw new Error(`Invalid order key: unexpected head character: ${head}`);
+}
+function integerPart(key) {
+    if (key.length === 0)
+        throw new Error("Invalid order key: empty key");
+    return key.slice(0, integerLength(key[0]));
+}
+export function isOrderKey(key) {
+    if (!/^[A-Za-z][0-9A-Za-z]*$/.test(key))
+        return false;
+    try {
+        const integer = integerPart(key);
+        if (integer.length !== integerLength(integer[0]))
+            return false;
+        return !key.slice(integer.length).endsWith(DIGITS[0]);
+    }
+    catch {
+        return false;
+    }
+}
+export function assertOrderKey(key, label) {
+    if (!isOrderKey(key))
+        throw new Error(`${label} is not a valid order key: ${key}`);
+}
+function incrementInteger(integer) {
+    const head = integer[0];
+    const digits = integer.slice(1).split("");
+    let carry = true;
+    for (let index = digits.length - 1; carry && index >= 0; index -= 1) {
+        const value = DIGITS.indexOf(digits[index]) + 1;
+        if (value === DIGITS.length) {
+            digits[index] = DIGITS[0];
+        }
+        else {
+            digits[index] = DIGITS[value];
+            carry = false;
+        }
+    }
+    if (!carry)
+        return head + digits.join("");
+    if (head === "Z")
+        return INTEGER_ZERO;
+    if (head === "z")
+        return null;
+    const next = String.fromCharCode(head.charCodeAt(0) + 1);
+    return next + DIGITS[0].repeat(integerLength(next) - 1);
+}
+function decrementInteger(integer) {
+    const head = integer[0];
+    const digits = integer.slice(1).split("");
+    let borrow = true;
+    for (let index = digits.length - 1; borrow && index >= 0; index -= 1) {
+        const value = DIGITS.indexOf(digits[index]) - 1;
+        if (value === -1) {
+            digits[index] = LAST_DIGIT;
+        }
+        else {
+            digits[index] = DIGITS[value];
+            borrow = false;
+        }
+    }
+    if (!borrow)
+        return head + digits.join("");
+    if (head === "a")
+        return `Z${LAST_DIGIT}`;
+    if (head === "A")
+        return null;
+    const previous = String.fromCharCode(head.charCodeAt(0) - 1);
+    return previous + LAST_DIGIT.repeat(integerLength(previous) - 1);
+}
+/**
+ * Fractional midpoint strictly between `a` and `b` (both digit strings,
+ * `b === null` means "no upper bound"). Precondition: a < b.
+ */
+function midpoint(a, b) {
+    if (b === null) {
+        if (a === "")
+            return MID_DIGIT;
+        const head = a[0];
+        if (head !== LAST_DIGIT)
+            return DIGITS[DIGITS.indexOf(head) + 1];
+        return head + midpoint(a.slice(1), null);
+    }
+    const digitA = a === "" ? 0 : DIGITS.indexOf(a[0]);
+    const digitB = b === "" ? 0 : DIGITS.indexOf(b[0]);
+    if (digitB - digitA > 1)
+        return DIGITS[(digitA + digitB + 1) >> 1];
+    if (digitB - digitA === 1) {
+        return DIGITS[digitA] + midpoint(a.slice(1), null);
+    }
+    if (b === "")
+        throw new Error("No room between order keys");
+    return DIGITS[digitA] + midpoint(a.slice(1), b.slice(1));
+}
+/**
+ * Returns a key that sorts strictly between `before` and `after`
+ * (either side may be null for an open end).
+ */
+export function orderKeyBetween(before, after) {
+    if (before !== null)
+        assertOrderKey(before, "Before order key");
+    if (after !== null)
+        assertOrderKey(after, "After order key");
+    if (before !== null && after !== null && before >= after) {
+        throw new Error(`Order keys out of order: ${before} !< ${after}`);
+    }
+    if (before === null) {
+        if (after === null)
+            return INTEGER_ZERO;
+        const integer = integerPart(after);
+        const decremented = decrementInteger(integer);
+        if (decremented !== null)
+            return decremented;
+        return integer + midpoint("", after.slice(integer.length));
+    }
+    const beforeInteger = integerPart(before);
+    const beforeFraction = before.slice(beforeInteger.length);
+    if (after === null) {
+        const incremented = incrementInteger(beforeInteger);
+        if (incremented !== null)
+            return incremented;
+        return beforeInteger + midpoint(beforeFraction, null);
+    }
+    const afterInteger = integerPart(after);
+    if (beforeInteger === afterInteger) {
+        return beforeInteger + midpoint(beforeFraction, after.slice(afterInteger.length));
+    }
+    const incremented = incrementInteger(beforeInteger);
+    if (incremented !== null && incremented < after)
+        return incremented;
+    return beforeInteger + midpoint(beforeFraction, null);
+}
+/** Key sorting immediately after `key` (or the first key when null). */
+export function orderKeyAfter(key) {
+    return orderKeyBetween(key, null);
+}
+/** Dense initial keys for a freshly created ordered list. */
+export function initialOrderKeys(count) {
+    const keys = [];
+    let previous = null;
+    for (let index = 0; index < count; index += 1) {
+        const key = orderKeyAfter(previous);
+        keys.push(key);
+        previous = key;
+    }
+    return keys;
+}
+/**
+ * Reconciles an ordered list of row identities with their stored keys,
+ * reusing existing keys for every row whose relative order is unchanged
+ * (a longest increasing subsequence) and minting midpoint keys only for
+ * new or genuinely reordered rows. Untouched rows keep their stored key,
+ * so merges with forks that appended elsewhere stay row-local.
+ *
+ * Returns the key for every desired id, in desired order.
+ */
+export function reconcileOrderKeys(desired, existing) {
+    const survivors = desired.filter((id) => existing.has(id));
+    const byKey = [...survivors].sort((left, right) => {
+        const leftKey = existing.get(left);
+        const rightKey = existing.get(right);
+        return leftKey === rightKey ? 0 : leftKey < rightKey ? -1 : 1;
+    });
+    // Rows that share a stored key (possible after a merge) form one group;
+    // the kept set is a longest strictly increasing subsequence of group
+    // ranks, so kept keys always leave room for midpoint insertion.
+    const distinctKeys = [...new Set(byKey.map((id) => existing.get(id)))];
+    const groupRank = new Map(distinctKeys.map((key, rank) => [key, rank]));
+    const keptIndices = longestIncreasingSubsequence(survivors.map((id) => groupRank.get(existing.get(id))));
+    const kept = new Set();
+    for (const index of keptIndices)
+        kept.add(survivors[index]);
+    const keptInOrder = byKey.filter((id) => kept.has(id));
+    const result = new Map();
+    let keptIndex = 0;
+    let previous = null;
+    for (const id of desired) {
+        if (kept.has(id)) {
+            const key = existing.get(id);
+            result.set(id, key);
+            previous = key;
+            keptIndex += 1;
+        }
+        else {
+            // Duplicate stored keys (possible after a merge) can leave no room
+            // before the next kept neighbor; skip ahead to the first kept key
+            // that is strictly greater than the previously assigned key.
+            let next = null;
+            for (let index = keptIndex; index < keptInOrder.length; index += 1) {
+                const candidate = existing.get(keptInOrder[index]);
+                if (previous === null || candidate > previous) {
+                    next = candidate;
+                    break;
+                }
+            }
+            const key = orderKeyBetween(previous, next);
+            result.set(id, key);
+            previous = key;
+        }
+    }
+    return result;
+}
+/** Indices of a longest strictly increasing subsequence of `sequence`. */
+function longestIncreasingSubsequence(sequence) {
+    const tails = [];
+    const previousIndex = Array.from({ length: sequence.length }, () => -1);
+    for (let index = 0; index < sequence.length; index += 1) {
+        let low = 0;
+        let high = tails.length;
+        while (low < high) {
+            const middle = (low + high) >> 1;
+            if (sequence[tails[middle]] < sequence[index]) {
+                low = middle + 1;
+            }
+            else {
+                high = middle;
+            }
+        }
+        if (low > 0)
+            previousIndex[index] = tails[low - 1];
+        if (low === tails.length) {
+            tails.push(index);
+        }
+        else {
+            tails[low] = index;
+        }
+    }
+    const result = new Set();
+    let index = tails.length > 0 ? tails[tails.length - 1] : -1;
+    while (index >= 0) {
+        result.add(index);
+        index = previousIndex[index];
+    }
+    return result;
+}
+//# sourceMappingURL=order-keys.js.map