@tearleads/client-sdk 0.1.63 → 0.1.65

package/data/sqlite/containerSchema.js

@@ -1,103 +0,0 @@
-import { index, integer, primaryKey, sqliteTable, text, } from "drizzle-orm/sqlite-core";
-import { defineSqlTableSchema } from "./sqlTableSchema.js";
-const accessLevelColumn = "effective_access_level";
-/**
- * Materialized local container tree.
- *
- * Container rows describe the tree and its encrypted metadata document;
- * metadata rows live in `documents`. `id` is the primary key for structural
- * lookups. `metadataDocumentId` is the server metadata-document id when known;
- * `systemSlot` is an optional opaque app-owned slot. `displayName` and `icon`
- * are the decrypted metadata projection lists read: `displayName` stays
- * nullable so presentation falls back to `/` for a root and `Untitled`
- * otherwise. Local timestamps track client storage/structural changes, while
- * server timestamps are populated once the container has synced.
- */
-export const containers = sqliteTable("containers", {
-    id: text("id"),
-    organizationId: text("organization_id").notNull(),
-    parentId: text("parent_id"),
-    metadataDocumentId: text("metadata_document_id"),
-    systemSlot: text("system_slot"),
-    displayName: text("display_name"),
-    icon: text("icon"),
-    effectiveAccessLevel: text(accessLevelColumn).notNull().default("read"),
-    localCreatedAt: text("local_created_at").notNull(),
-    localUpdatedAt: text("local_updated_at").notNull(),
-    serverCreatedAt: text("server_created_at"),
-    serverUpdatedAt: text("server_updated_at"),
-}, (table) => [primaryKey({ columns: [table.id] })]);
-/**
- * Latest removal observed for each container. Hydration must observe the same
- * generation before fetching verified restoration evidence; unsigned clocks
- * never establish a terminal deletion or bypass a concurrent removal. Cleared
- * observations retain their generation so remove/restore/remove cannot reuse it.
- */
-export const containerHydrationTombstones = sqliteTable("container_hydration_tombstones", {
-    containerId: text("container_id").notNull(),
-    generation: integer("generation").notNull().default(1),
-    cleared: integer("cleared", { mode: "boolean" }).notNull().default(false),
-    reason: text("reason").notNull(),
-    updatedAt: text("updated_at").notNull(),
-}, (table) => [primaryKey({ columns: [table.containerId] })]);
-/**
- * Organization attribution for container metadata retained after access loss.
- * The container row is removed on revocation, so this marker retains the
- * organization scope needed by a later access-restoration sweep.
- */
-export const dormantContainerMetadata = sqliteTable("dormant_container_metadata", {
-    containerId: text("container_id").notNull(),
-    organizationId: text("organization_id").notNull(),
-    retainedAt: text("retained_at").notNull(),
-}, (table) => [
-    primaryKey({ columns: [table.containerId] }),
-    index("dormant_container_metadata_organization_idx").on(table.organizationId, table.containerId),
-]);
-/**
- * Organizations a held folder was re-homed away from. Purged-organization
- * recovery re-creates folders under their existing ids and a purged
- * organization never returns, so a later proof binding the folder back to one
- * of these organizations is a replay. Retained across remote resets.
- */
-export const supersededContainerBindings = sqliteTable("superseded_container_bindings", {
-    containerId: text("container_id").notNull(),
-    organizationId: text("organization_id").notNull(),
-    supersededAt: text("superseded_at").notNull(),
-}, (table) => [
-    primaryKey({ columns: [table.containerId, table.organizationId] }),
-]);
-/**
- * Durable request for a post-access-restoration crawl and sweep. Attempt state
- * enforces exponential backoff and a bounded retry budget across restarts.
- */
-export const dormantMetadataSweepRequests = sqliteTable("dormant_metadata_sweep_requests", {
-    organizationId: text("organization_id").notNull(),
-    requesterUserId: text("requester_user_id").notNull(),
-    generation: integer("generation").notNull().default(1),
-    attemptCount: integer("attempt_count").notNull().default(0),
-    lastAttemptedAt: text("last_attempted_at"),
-    requestedAt: text("requested_at").notNull(),
-}, (table) => [
-    primaryKey({ columns: [table.organizationId, table.requesterUserId] }),
-]);
-export const containerTableSchemas = [
-    {
-        ...defineSqlTableSchema(containers),
-        requiredColumns: ["display_name", "icon"],
-    },
-    {
-        ...defineSqlTableSchema(containerHydrationTombstones),
-        requiredColumns: ["cleared"],
-    },
-    defineSqlTableSchema(dormantContainerMetadata),
-    defineSqlTableSchema(dormantMetadataSweepRequests),
-    defineSqlTableSchema(supersededContainerBindings),
-];
-export const containerSQLiteSchema = {
-    containers,
-    containerHydrationTombstones,
-    dormantContainerMetadata,
-    dormantMetadataSweepRequests,
-    supersededContainerBindings,
-};
-//# sourceMappingURL=containerSchema.js.map

package/data/sqlite/containerSchema.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"containerSchema.js","sourceRoot":"","sources":["containerSchema.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,EACL,OAAO,EACP,UAAU,EACV,WAAW,EACX,IAAI,GACL,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,oBAAoB,EAAuB,MAAM,kBAAkB,CAAC;AAE7E,MAAM,iBAAiB,GAAG,wBAAwB,CAAC;AAEnD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,CACnC,YAAY,EACZ;IACE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC;IACd,cAAc,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,EAAE;IACjD,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC;IAC3B,kBAAkB,EAAE,IAAI,CAAC,sBAAsB,CAAC;IAChD,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC;IAC/B,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC;IACjC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC;IAClB,oBAAoB,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;IACvE,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,OAAO,EAAE;IAClD,cAAc,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC,OAAO,EAAE;IAClD,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC;IAC1C,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC;CAC3C,EACD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CACjD,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,WAAW,CACrD,gCAAgC,EAChC;IACE,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE;IAC3C,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IACtD,OAAO,EAAE,OAAO,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC;IACzE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE;IAChC,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE;CACxC,EACD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAC1D,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,WAAW,CACjD,4BAA4B,EAC5B;IACE,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE;IAC3C,cAAc,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,EAAE;IACjD,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE;CAC1C,EACD,CAAC,KAAK,EAAE,EAAE,CAAC;IACT,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;IAC5C,KAAK,CAAC,6CAA6C,CAAC,CAAC,EAAE,CACrD,KAAK,CAAC,cAAc,EACpB,KAAK,CAAC,WAAW,CAClB;CACF,CACF,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,WAAW,CACpD,+BAA+B,EAC/B;IACE,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE;IAC3C,cAAc,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,EAAE;IACjD,YAAY,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE;CAC9C,EACD,CAAC,KAAK,EAAE,EAAE,CAAC;IACT,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC;CACnE,CACF,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,WAAW,CACrD,iCAAiC,EACjC;IACE,cAAc,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,OAAO,EAAE;IACjD,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE;IACpD,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IACtD,YAAY,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3D,eAAe,EAAE,IAAI,CAAC,mBAAmB,CAAC;IAC1C,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,OAAO,EAAE;CAC5C,EACD,CAAC,KAAK,EAAE,EAAE,CAAC;IACT,UAAU,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,cAAc,EAAE,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC;CACvE,CACF,CAAC;AAEF,MAAM,CAAC,MAAM,qBAAqB,GAAkC;IAClE;QACE,GAAG,oBAAoB,CAAC,UAAU,CAAC;QACnC,eAAe,EAAE,CAAC,cAAc,EAAE,MAAM,CAAC;KAC1C;IACD;QACE,GAAG,oBAAoB,CAAC,4BAA4B,CAAC;QACrD,eAAe,EAAE,CAAC,SAAS,CAAC;KAC7B;IACD,oBAAoB,CAAC,wBAAwB,CAAC;IAC9C,oBAAoB,CAAC,4BAA4B,CAAC;IAClD,oBAAoB,CAAC,2BAA2B,CAAC;CAClD,CAAC;AAEF,MAAM,CAAC,MAAM,qBAAqB,GAAG;IACnC,UAAU;IACV,4BAA4B;IAC5B,wBAAwB;IACxB,4BAA4B;IAC5B,2BAA2B;CAC5B,CAAC","sourcesContent":["import {\n  index,\n  integer,\n  primaryKey,\n  sqliteTable,\n  text,\n} from \"drizzle-orm/sqlite-core\";\nimport { defineSqlTableSchema, type SqlTableSchema } from \"./sqlTableSchema\";\n\nconst accessLevelColumn = \"effective_access_level\";\n\n/**\n * Materialized local container tree.\n *\n * Container rows describe the tree and its encrypted metadata document;\n * metadata rows live in `documents`. `id` is the primary key for structural\n * lookups. `metadataDocumentId` is the server metadata-document id when known;\n * `systemSlot` is an optional opaque app-owned slot. `displayName` and `icon`\n * are the decrypted metadata projection lists read: `displayName` stays\n * nullable so presentation falls back to `/` for a root and `Untitled`\n * otherwise. Local timestamps track client storage/structural changes, while\n * server timestamps are populated once the container has synced.\n */\nexport const containers = sqliteTable(\n  \"containers\",\n  {\n    id: text(\"id\"),\n    organizationId: text(\"organization_id\").notNull(),\n    parentId: text(\"parent_id\"),\n    metadataDocumentId: text(\"metadata_document_id\"),\n    systemSlot: text(\"system_slot\"),\n    displayName: text(\"display_name\"),\n    icon: text(\"icon\"),\n    effectiveAccessLevel: text(accessLevelColumn).notNull().default(\"read\"),\n    localCreatedAt: text(\"local_created_at\").notNull(),\n    localUpdatedAt: text(\"local_updated_at\").notNull(),\n    serverCreatedAt: text(\"server_created_at\"),\n    serverUpdatedAt: text(\"server_updated_at\"),\n  },\n  (table) => [primaryKey({ columns: [table.id] })],\n);\n\n/**\n * Latest removal observed for each container. Hydration must observe the same\n * generation before fetching verified restoration evidence; unsigned clocks\n * never establish a terminal deletion or bypass a concurrent removal. Cleared\n * observations retain their generation so remove/restore/remove cannot reuse it.\n */\nexport const containerHydrationTombstones = sqliteTable(\n  \"container_hydration_tombstones\",\n  {\n    containerId: text(\"container_id\").notNull(),\n    generation: integer(\"generation\").notNull().default(1),\n    cleared: integer(\"cleared\", { mode: \"boolean\" }).notNull().default(false),\n    reason: text(\"reason\").notNull(),\n    updatedAt: text(\"updated_at\").notNull(),\n  },\n  (table) => [primaryKey({ columns: [table.containerId] })],\n);\n\n/**\n * Organization attribution for container metadata retained after access loss.\n * The container row is removed on revocation, so this marker retains the\n * organization scope needed by a later access-restoration sweep.\n */\nexport const dormantContainerMetadata = sqliteTable(\n  \"dormant_container_metadata\",\n  {\n    containerId: text(\"container_id\").notNull(),\n    organizationId: text(\"organization_id\").notNull(),\n    retainedAt: text(\"retained_at\").notNull(),\n  },\n  (table) => [\n    primaryKey({ columns: [table.containerId] }),\n    index(\"dormant_container_metadata_organization_idx\").on(\n      table.organizationId,\n      table.containerId,\n    ),\n  ],\n);\n\n/**\n * Organizations a held folder was re-homed away from. Purged-organization\n * recovery re-creates folders under their existing ids and a purged\n * organization never returns, so a later proof binding the folder back to one\n * of these organizations is a replay. Retained across remote resets.\n */\nexport const supersededContainerBindings = sqliteTable(\n  \"superseded_container_bindings\",\n  {\n    containerId: text(\"container_id\").notNull(),\n    organizationId: text(\"organization_id\").notNull(),\n    supersededAt: text(\"superseded_at\").notNull(),\n  },\n  (table) => [\n    primaryKey({ columns: [table.containerId, table.organizationId] }),\n  ],\n);\n\n/**\n * Durable request for a post-access-restoration crawl and sweep. Attempt state\n * enforces exponential backoff and a bounded retry budget across restarts.\n */\nexport const dormantMetadataSweepRequests = sqliteTable(\n  \"dormant_metadata_sweep_requests\",\n  {\n    organizationId: text(\"organization_id\").notNull(),\n    requesterUserId: text(\"requester_user_id\").notNull(),\n    generation: integer(\"generation\").notNull().default(1),\n    attemptCount: integer(\"attempt_count\").notNull().default(0),\n    lastAttemptedAt: text(\"last_attempted_at\"),\n    requestedAt: text(\"requested_at\").notNull(),\n  },\n  (table) => [\n    primaryKey({ columns: [table.organizationId, table.requesterUserId] }),\n  ],\n);\n\nexport const containerTableSchemas: ReadonlyArray<SqlTableSchema> = [\n  {\n    ...defineSqlTableSchema(containers),\n    requiredColumns: [\"display_name\", \"icon\"],\n  },\n  {\n    ...defineSqlTableSchema(containerHydrationTombstones),\n    requiredColumns: [\"cleared\"],\n  },\n  defineSqlTableSchema(dormantContainerMetadata),\n  defineSqlTableSchema(dormantMetadataSweepRequests),\n  defineSqlTableSchema(supersededContainerBindings),\n];\n\nexport const containerSQLiteSchema = {\n  containers,\n  containerHydrationTombstones,\n  dormantContainerMetadata,\n  dormantMetadataSweepRequests,\n  supersededContainerBindings,\n};\n"]}

package/data/sqlite/documentHistoryPersistence.d.ts

@@ -1,86 +0,0 @@
-import type { DocumentScope } from "./documentPersistenceTypes.js";
-import { type ExecSql } from "./sqlSchema.js";
-/**
- * Compaction thresholds: once the tail carries this many rows or bytes, the
- * next persist of a full-history-capable document exports a fresh checkpoint
- * and clears the tail. Small enough to keep restore replay short, large
- * enough that a full-history export (O(history)) happens once per burst of
- * edits instead of per keystroke.
- */
-export declare const DOCUMENT_HISTORY_COMPACTION_MAX_ROWS = 200;
-export declare const DOCUMENT_HISTORY_COMPACTION_MAX_BYTES: number;
-/**
- * Row provenance: "local" for updates authored on this device, "remote" for
- * decrypted pulled updates. Restores advance the outgoing-delta marker across
- * remote rows (already server-side); local rows never advance it.
- */
-type DocumentHistoryUpdateOrigin = "local" | "remote";
-interface DocumentHistoryTailUpdate {
-    readonly origin: DocumentHistoryUpdateOrigin;
-    readonly updateData: string;
-}
-interface DocumentHistoryRestoreState {
-    readonly snapshot: string;
-    readonly tailUpdates: readonly DocumentHistoryTailUpdate[];
-}
-export declare function appendDocumentHistoryUpdates(execSql: ExecSql, scope: DocumentScope, updates: readonly string[], origin: DocumentHistoryUpdateOrigin): Promise<void>;
-/**
- * The checkpoint + ordered tail for a scope, or null when NEITHER exists (a
- * discovered shell that has not hydrated content yet; the caller starts the
- * document empty and the remote pull supplies the content). A tail WITHOUT a
- * checkpoint — a crash between the first enqueued edit's tail append and the
- * birth-checkpoint seed — restores as tail-only (`snapshot: ""`): those tail
- * rows can be the only durable copy of a local edit, so they must never be
- * silently ignored.
- */
-export declare function loadDocumentHistoryRestoreState(execSql: ExecSql, scope: DocumentScope): Promise<DocumentHistoryRestoreState | null>;
-/**
- * Size of the tail compaction can shrink. Queued rows are excluded: they stay
- * until settlement, so counting them would re-export full history on every
- * persist while offline edits wait to sync.
- */
-export declare function readDocumentHistoryTailSize(execSql: ExecSql, scope: DocumentScope): Promise<{
-    byteLength: number;
-    hasCheckpoint: boolean;
-    rowCount: number;
-}>;
-interface DocumentHistoryTailEntry {
-    readonly id: string;
-    readonly updateData: string;
-}
-/**
- * The current compactable tail rows WITH their payloads, so a compactor can
- * prove each row's ops are covered by the snapshot it is about to install
- * (another pane's append may carry ops this pane's document has not merged
- * yet). Queued rows are never candidates.
- */
-export declare function listDocumentHistoryTailEntries(execSql: ExecSql, scope: DocumentScope): Promise<DocumentHistoryTailEntry[]>;
-/**
- * Replace the scope's checkpoint with a fresh full-history snapshot and
- * delete ONLY the tail rows the caller captured before exporting it. Every
- * append path writes its tail row after the ops are already in the live
- * document, so any row captured before the export is provably covered by
- * the snapshot — while a row appended concurrently (between export and this
- * delete) survives for the next compaction instead of being lost.
- */
-export declare function replaceDocumentHistoryCheckpoint(execSql: ExecSql, scope: DocumentScope, input: {
-    coveredTailIds: readonly string[];
-    endVersionVector: string;
-    /**
-     * Skip the monotonic version gate. Only for document CREATION, where any
-     * existing checkpoint under this localId is the orphan of a failed prior
-     * attempt (checkpoint written, record row never committed) — a retry's
-     * fresh document need not dominate that orphan to replace it.
-     */
-    force?: boolean;
-    snapshot: string;
-    /**
-     * Re-checked after acquiring the serialized mutation slot (like the
-     * record-save path): a store reset/recreation that happened while this
-     * call waited in the queue must abort the write, or a stale compactor
-     * could install the OLD document's checkpoint over the new identity's.
-     */
-    stillCurrent?: () => boolean;
-}): Promise<boolean>;
-export declare function deleteDocumentHistory(execSql: ExecSql, scope: DocumentScope): Promise<void>;
-export {};

package/data/sqlite/documentHistoryPersistence.js

@@ -1,304 +0,0 @@
-import { base64ToBytes } from "../../internal/encoding/index.js";
-import { createDocument, exportFullHistoryIdentity, importSnapshot, satisfiesVersionVector, } from "../../internal/loro/index.js";
-import { and, eq, inArray, isNull, ne, sql } from "drizzle-orm";
-import { documentHistoryCheckpoints, documentHistoryUpdates, documentTables, } from "./schema.js";
-import { getClientSQLitePersistenceRuntime } from "./sqlitePersistenceRuntime.js";
-import { ensureSqlTables } from "./sqlSchema.js";
-/**
- * Compaction thresholds: once the tail carries this many rows or bytes, the
- * next persist of a full-history-capable document exports a fresh checkpoint
- * and clears the tail. Small enough to keep restore replay short, large
- * enough that a full-history export (O(history)) happens once per burst of
- * edits instead of per keystroke.
- */
-export const DOCUMENT_HISTORY_COMPACTION_MAX_ROWS = 200;
-export const DOCUMENT_HISTORY_COMPACTION_MAX_BYTES = 512 * 1024;
-/**
- * Rows of the update log that are history tail: every row except an "outbox"
- * row, which only waits to be sent (see `documentHistoryUpdates`).
- */
-function tailInScope(scope) {
-    return and(eq(documentHistoryUpdates.appKind, scope.appKind), eq(documentHistoryUpdates.localId, scope.localId), ne(documentHistoryUpdates.origin, "outbox"));
-}
-/**
- * Tail rows compaction may fold into a checkpoint and delete: a queued row is
- * the only durable copy of an unsent update, so it waits for settlement even
- * when a checkpoint already covers its operations.
- */
-function compactableTailInScope(scope) {
-    return and(tailInScope(scope), isNull(documentHistoryUpdates.updateId));
-}
-export async function appendDocumentHistoryUpdates(execSql, scope, updates, origin) {
-    if (updates.length === 0) {
-        return;
-    }
-    await ensureSqlTables(execSql, documentTables);
-    const createdAt = new Date().toISOString();
-    await getClientSQLitePersistenceRuntime(execSql).runMutation(async (db) => {
-        // Chunked: a catch-up pull can carry thousands of updates, and a single
-        // multi-row insert would exceed SQLite's bound-variable limit.
-        for (let index = 0; index < updates.length; index += HISTORY_ROW_CHUNK) {
-            await db.insert(documentHistoryUpdates).values(updates.slice(index, index + HISTORY_ROW_CHUNK).map((updateData) => ({
-                id: crypto.randomUUID(),
-                appKind: scope.appKind,
-                localId: scope.localId,
-                updateData,
-                origin,
-                createdAt,
-            })));
-        }
-    });
-}
-/**
- * The checkpoint + ordered tail for a scope, or null when NEITHER exists (a
- * discovered shell that has not hydrated content yet; the caller starts the
- * document empty and the remote pull supplies the content). A tail WITHOUT a
- * checkpoint — a crash between the first enqueued edit's tail append and the
- * birth-checkpoint seed — restores as tail-only (`snapshot: ""`): those tail
- * rows can be the only durable copy of a local edit, so they must never be
- * silently ignored.
- */
-export async function loadDocumentHistoryRestoreState(execSql, scope) {
-    await ensureSqlTables(execSql, documentTables);
-    const { db } = getClientSQLitePersistenceRuntime(execSql);
-    // Read the TAIL before the (full) checkpoint: if another pane compacts
-    // between the two reads, this order yields old-tail + new-checkpoint — a
-    // safe superset (the new checkpoint subsumes the old tail, and replay is
-    // idempotent by op identity). The reverse order could yield old-checkpoint
-    // + already-emptied tail, a torn read that silently drops the compacted
-    // ops for the whole session.
-    const tail = await db
-        .select({
-        id: documentHistoryUpdates.id,
-        origin: documentHistoryUpdates.origin,
-        updateData: documentHistoryUpdates.updateData,
-    })
-        .from(documentHistoryUpdates)
-        .where(tailInScope(scope))
-        // Insertion order: same-millisecond appends make createdAt tie and a
-        // random-uuid tiebreak would replay out of order. importUpdates tolerates
-        // out-of-order batches, but replay should still be deterministic.
-        .orderBy(sql `rowid`);
-    const [checkpoint] = await db
-        .select({ snapshot: documentHistoryCheckpoints.snapshot })
-        .from(documentHistoryCheckpoints)
-        .where(and(eq(documentHistoryCheckpoints.appKind, scope.appKind), eq(documentHistoryCheckpoints.localId, scope.localId)))
-        .limit(1);
-    if (!checkpoint && tail.length === 0) {
-        return null;
-    }
-    return {
-        snapshot: checkpoint?.snapshot ?? "",
-        tailUpdates: tail.map((row) => ({
-            // Fail toward re-sending: an unrecognized origin never advances the
-            // marker, which is the recoverable direction (a redundant re-submit
-            // is idempotent; a skipped local op would be orphaned from sync).
-            origin: row.origin === "remote" ? "remote" : "local",
-            updateData: row.updateData,
-        })),
-    };
-}
-/**
- * Size of the tail compaction can shrink. Queued rows are excluded: they stay
- * until settlement, so counting them would re-export full history on every
- * persist while offline edits wait to sync.
- */
-export async function readDocumentHistoryTailSize(execSql, scope) {
-    await ensureSqlTables(execSql, documentTables);
-    const { db } = getClientSQLitePersistenceRuntime(execSql);
-    const [totals] = await db
-        .select({
-        byteLength: sql `coalesce(sum(length(${documentHistoryUpdates.updateData})), 0)`,
-        rowCount: sql `count(*)`,
-    })
-        .from(documentHistoryUpdates)
-        .where(compactableTailInScope(scope));
-    const [checkpoint] = await db
-        .select({ localId: documentHistoryCheckpoints.localId })
-        .from(documentHistoryCheckpoints)
-        .where(and(eq(documentHistoryCheckpoints.appKind, scope.appKind), eq(documentHistoryCheckpoints.localId, scope.localId)))
-        .limit(1);
-    return {
-        byteLength: Number(totals?.byteLength ?? 0),
-        hasCheckpoint: checkpoint !== undefined,
-        rowCount: Number(totals?.rowCount ?? 0),
-    };
-}
-/**
- * The current compactable tail rows WITH their payloads, so a compactor can
- * prove each row's ops are covered by the snapshot it is about to install
- * (another pane's append may carry ops this pane's document has not merged
- * yet). Queued rows are never candidates.
- */
-export async function listDocumentHistoryTailEntries(execSql, scope) {
-    await ensureSqlTables(execSql, documentTables);
-    const { db } = getClientSQLitePersistenceRuntime(execSql);
-    const rows = await db
-        .select({
-        id: documentHistoryUpdates.id,
-        updateData: documentHistoryUpdates.updateData,
-    })
-        .from(documentHistoryUpdates)
-        .where(compactableTailInScope(scope));
-    return rows.flatMap((row) => row.id === null ? [] : [{ id: row.id, updateData: row.updateData }]);
-}
-const HISTORY_ROW_CHUNK = 400;
-/**
- * Replace the scope's checkpoint with a fresh full-history snapshot and
- * delete ONLY the tail rows the caller captured before exporting it. Every
- * append path writes its tail row after the ops are already in the live
- * document, so any row captured before the export is provably covered by
- * the snapshot — while a row appended concurrently (between export and this
- * delete) survives for the next compaction instead of being lost.
- */
-export async function replaceDocumentHistoryCheckpoint(execSql, scope, input) {
-    await ensureSqlTables(execSql, documentTables);
-    // Sequential (non-transactional) so callers already inside a transaction
-    // can nest this. Crash between the statements leaves the new checkpoint
-    // plus covered tail rows — a safe superset, since tail replay is
-    // idempotent by op identity. The replacement itself is a compare-and-swap
-    // on the stored revision, so the version gate cannot be bypassed by a
-    // concurrent compactor between the read and the write: whoever loses the
-    // CAS re-reads and re-evaluates the gate against the winner's checkpoint.
-    return getClientSQLitePersistenceRuntime(execSql).runMutation(async (tx) => {
-        if (input.stillCurrent?.() === false) {
-            return false;
-        }
-        for (let attempt = 0; attempt < CHECKPOINT_CAS_ATTEMPTS; attempt += 1) {
-            let replaced;
-            try {
-                replaced = await tryReplaceCheckpointOnce(tx, scope, input);
-            }
-            catch (error) {
-                if (error instanceof CheckpointGateRejected) {
-                    // A fresher checkpoint dominates this candidate: no write, and
-                    // the caller's covered rows must stay for the covering pane.
-                    return false;
-                }
-                throw error;
-            }
-            if (!replaced) {
-                // CAS lost to a concurrent writer — re-read and re-evaluate the
-                // gate against the winner's checkpoint.
-                continue;
-            }
-            for (let index = 0; index < input.coveredTailIds.length; index += HISTORY_ROW_CHUNK) {
-                // Never a queued row, even if a caller names one: its operations may
-                // be in the checkpoint, but it is still the unsent update itself.
-                await tx
-                    .delete(documentHistoryUpdates)
-                    .where(and(compactableTailInScope(scope), inArray(documentHistoryUpdates.id, input.coveredTailIds.slice(index, index + HISTORY_ROW_CHUNK))));
-            }
-            return true;
-        }
-        // Exhaustion must not read as durable success: creation and rebuild
-        // callers persist record rows assuming the checkpoint landed.
-        throw new Error("Document history checkpoint replacement lost every CAS attempt");
-    });
-}
-const CHECKPOINT_CAS_ATTEMPTS = 16;
-/**
- * One compare-and-swap attempt. Returns true when this caller's checkpoint
- * became the stored one, false when a concurrent writer won the CAS (the
- * caller re-reads and retries), and throws CheckpointGateRejected when a
- * fresher stored checkpoint dominates the candidate.
- */
-async function tryReplaceCheckpointOnce(tx, scope, input) {
-    const updatedAt = new Date().toISOString();
-    const revision = crypto.randomUUID();
-    const [stored] = await tx
-        .select({
-        endVersionVector: documentHistoryCheckpoints.endVersionVector,
-        revision: documentHistoryCheckpoints.revision,
-        snapshot: documentHistoryCheckpoints.snapshot,
-    })
-        .from(documentHistoryCheckpoints)
-        .where(and(eq(documentHistoryCheckpoints.appKind, scope.appKind), eq(documentHistoryCheckpoints.localId, scope.localId)))
-        .limit(1);
-    if (!stored) {
-        const inserted = await tx
-            .insert(documentHistoryCheckpoints)
-            .values({
-            appKind: scope.appKind,
-            localId: scope.localId,
-            snapshot: input.snapshot,
-            endVersionVector: input.endVersionVector,
-            revision,
-            updatedAt,
-        })
-            .onConflictDoNothing({
-            target: [
-                documentHistoryCheckpoints.appKind,
-                documentHistoryCheckpoints.localId,
-            ],
-        })
-            .returning({ localId: documentHistoryCheckpoints.localId });
-        // Conflict means a concurrent writer inserted first — retry the gate.
-        return inserted.length > 0;
-    }
-    // A stale compactor (a pane whose document has not merged another pane's
-    // ops) must never replace a checkpoint it does not cover: the covered
-    // pane may already have deleted its tail rows, so regressing the
-    // checkpoint would leave those ops with no durable copy at all. Vector
-    // dominance proves counter coverage; the retained-prefix identity also
-    // proves the candidate carries the exact stored operations at those
-    // counters rather than a same-frontier fork.
-    if (input.force !== true) {
-        if (!satisfiesVersionVector(input.endVersionVector, stored.endVersionVector)) {
-            throw new CheckpointGateRejected();
-        }
-        if (input.snapshot !== stored.snapshot &&
-            !(await candidateContainsStoredCheckpointHistory({
-                candidateSnapshot: input.snapshot,
-                storedEndVersion: stored.endVersionVector,
-                storedSnapshot: stored.snapshot,
-            }))) {
-            throw new CheckpointGateRejected();
-        }
-    }
-    const replaced = await tx
-        .update(documentHistoryCheckpoints)
-        .set({
-        snapshot: input.snapshot,
-        endVersionVector: input.endVersionVector,
-        revision,
-        updatedAt,
-    })
-        .where(and(eq(documentHistoryCheckpoints.appKind, scope.appKind), eq(documentHistoryCheckpoints.localId, scope.localId), eq(documentHistoryCheckpoints.revision, stored.revision)))
-        .returning({ localId: documentHistoryCheckpoints.localId });
-    return replaced.length > 0;
-}
-async function candidateContainsStoredCheckpointHistory(input) {
-    const [candidateDocument, storedDocument] = await Promise.all([
-        createDocument("checkpoint-candidate-history-gate"),
-        createDocument("checkpoint-stored-history-gate"),
-    ]);
-    try {
-        importSnapshot(candidateDocument, base64ToBytes(input.candidateSnapshot));
-        importSnapshot(storedDocument, base64ToBytes(input.storedSnapshot));
-        return (exportFullHistoryIdentity(candidateDocument, input.storedEndVersion) ===
-            exportFullHistoryIdentity(storedDocument));
-    }
-    finally {
-        candidateDocument.free();
-        storedDocument.free();
-    }
-}
-class CheckpointGateRejected extends Error {
-    constructor() {
-        super("checkpoint gate rejected");
-        this.name = "CheckpointGateRejected";
-    }
-}
-export async function deleteDocumentHistory(execSql, scope) {
-    await ensureSqlTables(execSql, documentTables);
-    await getClientSQLitePersistenceRuntime(execSql).runMutation(async (tx) => {
-        await tx
-            .delete(documentHistoryCheckpoints)
-            .where(and(eq(documentHistoryCheckpoints.appKind, scope.appKind), eq(documentHistoryCheckpoints.localId, scope.localId)));
-        await tx
-            .delete(documentHistoryUpdates)
-            .where(and(eq(documentHistoryUpdates.appKind, scope.appKind), eq(documentHistoryUpdates.localId, scope.localId)));
-    });
-}
-//# sourceMappingURL=documentHistoryPersistence.js.map

package/data/sqlite/documentHistoryPersistence.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"documentHistoryPersistence.js","sourceRoot":"","sources":["documentHistoryPersistence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EACL,cAAc,EACd,yBAAyB,EACzB,cAAc,EACd,sBAAsB,GACvB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAEhE,OAAO,EACL,0BAA0B,EAC1B,sBAAsB,EACtB,cAAc,GACf,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,iCAAiC,EAAE,MAAM,4BAA4B,CAAC;AAC/E,OAAO,EAAgB,eAAe,EAAE,MAAM,aAAa,CAAC;AAE5D;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oCAAoC,GAAG,GAAG,CAAC;AACxD,MAAM,CAAC,MAAM,qCAAqC,GAAG,GAAG,GAAG,IAAI,CAAC;AAShE;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAoB;IACvC,OAAO,GAAG,CACR,EAAE,CAAC,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACjD,EAAE,CAAC,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACjD,EAAE,CAAC,sBAAsB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAC5C,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,sBAAsB,CAAC,KAAoB;IAClD,OAAO,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC1E,CAAC;AAYD,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,OAAgB,EAChB,KAAoB,EACpB,OAA0B,EAC1B,MAAmC;IAEnC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;IACT,CAAC;IACD,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,MAAM,iCAAiC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QACxE,wEAAwE;QACxE,+DAA+D;QAC/D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,iBAAiB,EAAE,CAAC;YACvE,MAAM,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,MAAM,CAC5C,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBACnE,EAAE,EAAE,MAAM,CAAC,UAAU,EAAE;gBACvB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,UAAU;gBACV,MAAM;gBACN,SAAS;aACV,CAAC,CAAC,CACJ,CAAC;QACJ,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,+BAA+B,CACnD,OAAgB,EAChB,KAAoB;IAEpB,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,MAAM,EAAE,EAAE,EAAE,GAAG,iCAAiC,CAAC,OAAO,CAAC,CAAC;IAC1D,uEAAuE;IACvE,yEAAyE;IACzE,yEAAyE;IACzE,2EAA2E;IAC3E,wEAAwE;IACxE,6BAA6B;IAC7B,MAAM,IAAI,GAAG,MAAM,EAAE;SAClB,MAAM,CAAC;QACN,EAAE,EAAE,sBAAsB,CAAC,EAAE;QAC7B,MAAM,EAAE,sBAAsB,CAAC,MAAM;QACrC,UAAU,EAAE,sBAAsB,CAAC,UAAU;KAC9C,CAAC;SACD,IAAI,CAAC,sBAAsB,CAAC;SAC5B,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1B,qEAAqE;QACrE,0EAA0E;QAC1E,kEAAkE;SACjE,OAAO,CAAC,GAAG,CAAA,OAAO,CAAC,CAAC;IAEvB,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,EAAE;SAC1B,MAAM,CAAC,EAAE,QAAQ,EAAE,0BAA0B,CAAC,QAAQ,EAAE,CAAC;SACzD,IAAI,CAAC,0BAA0B,CAAC;SAChC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CACtD,CACF;SACA,KAAK,CAAC,CAAC,CAAC,CAAC;IACZ,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,UAAU,EAAE,QAAQ,IAAI,EAAE;QACpC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC9B,oEAAoE;YACpE,oEAAoE;YACpE,kEAAkE;YAClE,MAAM,EACJ,GAAG,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAE,QAAkB,CAAC,CAAC,CAAE,OAAiB;YACpE,UAAU,EAAE,GAAG,CAAC,UAAU;SAC3B,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,OAAgB,EAChB,KAAoB;IAEpB,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,MAAM,EAAE,EAAE,EAAE,GAAG,iCAAiC,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE;SACtB,MAAM,CAAC;QACN,UAAU,EAAE,GAAG,CAAQ,uBAAuB,sBAAsB,CAAC,UAAU,QAAQ;QACvF,QAAQ,EAAE,GAAG,CAAQ,UAAU;KAChC,CAAC;SACD,IAAI,CAAC,sBAAsB,CAAC;SAC5B,KAAK,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,EAAE;SAC1B,MAAM,CAAC,EAAE,OAAO,EAAE,0BAA0B,CAAC,OAAO,EAAE,CAAC;SACvD,IAAI,CAAC,0BAA0B,CAAC;SAChC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CACtD,CACF;SACA,KAAK,CAAC,CAAC,CAAC,CAAC;IACZ,OAAO;QACL,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;QAC3C,aAAa,EAAE,UAAU,KAAK,SAAS;QACvC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,CAAC;KACxC,CAAC;AACJ,CAAC;AAOD;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,8BAA8B,CAClD,OAAgB,EAChB,KAAoB;IAEpB,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,MAAM,EAAE,EAAE,EAAE,GAAG,iCAAiC,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,IAAI,GAAG,MAAM,EAAE;SAClB,MAAM,CAAC;QACN,EAAE,EAAE,sBAAsB,CAAC,EAAE;QAC7B,UAAU,EAAE,sBAAsB,CAAC,UAAU;KAC9C,CAAC;SACD,IAAI,CAAC,sBAAsB,CAAC;SAC5B,KAAK,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAC1B,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CACpE,CAAC;AACJ,CAAC;AAED,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,gCAAgC,CACpD,OAAgB,EAChB,KAAoB,EACpB,KAkBC;IAED,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,yEAAyE;IACzE,wEAAwE;IACxE,iEAAiE;IACjE,0EAA0E;IAC1E,sEAAsE;IACtE,yEAAyE;IACzE,0EAA0E;IAC1E,OAAO,iCAAiC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QACzE,IAAI,KAAK,CAAC,YAAY,EAAE,EAAE,KAAK,KAAK,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,uBAAuB,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;YACtE,IAAI,QAAiB,CAAC;YACtB,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,wBAAwB,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC9D,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,KAAK,YAAY,sBAAsB,EAAE,CAAC;oBAC5C,+DAA+D;oBAC/D,6DAA6D;oBAC7D,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,gEAAgE;gBAChE,wCAAwC;gBACxC,SAAS;YACX,CAAC;YACD,KACE,IAAI,KAAK,GAAG,CAAC,EACb,KAAK,GAAG,KAAK,CAAC,cAAc,CAAC,MAAM,EACnC,KAAK,IAAI,iBAAiB,EAC1B,CAAC;gBACD,qEAAqE;gBACrE,kEAAkE;gBAClE,MAAM,EAAE;qBACL,MAAM,CAAC,sBAAsB,CAAC;qBAC9B,KAAK,CACJ,GAAG,CACD,sBAAsB,CAAC,KAAK,CAAC,EAC7B,OAAO,CACL,sBAAsB,CAAC,EAAE,EACzB,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,iBAAiB,CAAC,CAC7D,CACF,CACF,CAAC;YACN,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,oEAAoE;QACpE,8DAA8D;QAC9D,MAAM,IAAI,KAAK,CACb,gEAAgE,CACjE,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAQnC;;;;;GAKG;AACH,KAAK,UAAU,wBAAwB,CACrC,EAAc,EACd,KAAoB,EACpB,KAIC;IAED,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;IACrC,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE;SACtB,MAAM,CAAC;QACN,gBAAgB,EAAE,0BAA0B,CAAC,gBAAgB;QAC7D,QAAQ,EAAE,0BAA0B,CAAC,QAAQ;QAC7C,QAAQ,EAAE,0BAA0B,CAAC,QAAQ;KAC9C,CAAC;SACD,IAAI,CAAC,0BAA0B,CAAC;SAChC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CACtD,CACF;SACA,KAAK,CAAC,CAAC,CAAC,CAAC;IAEZ,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,QAAQ,GAAG,MAAM,EAAE;aACtB,MAAM,CAAC,0BAA0B,CAAC;aAClC,MAAM,CAAC;YACN,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;YACxC,QAAQ;YACR,SAAS;SACV,CAAC;aACD,mBAAmB,CAAC;YACnB,MAAM,EAAE;gBACN,0BAA0B,CAAC,OAAO;gBAClC,0BAA0B,CAAC,OAAO;aACnC;SACF,CAAC;aACD,SAAS,CAAC,EAAE,OAAO,EAAE,0BAA0B,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9D,sEAAsE;QACtE,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,yEAAyE;IACzE,sEAAsE;IACtE,iEAAiE;IACjE,uEAAuE;IACvE,uEAAuE;IACvE,oEAAoE;IACpE,6CAA6C;IAC7C,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACzB,IACE,CAAC,sBAAsB,CAAC,KAAK,CAAC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,CAAC,EACxE,CAAC;YACD,MAAM,IAAI,sBAAsB,EAAE,CAAC;QACrC,CAAC;QACD,IACE,KAAK,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ;YAClC,CAAC,CAAC,MAAM,wCAAwC,CAAC;gBAC/C,iBAAiB,EAAE,KAAK,CAAC,QAAQ;gBACjC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;gBACzC,cAAc,EAAE,MAAM,CAAC,QAAQ;aAChC,CAAC,CAAC,EACH,CAAC;YACD,MAAM,IAAI,sBAAsB,EAAE,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,EAAE;SACtB,MAAM,CAAC,0BAA0B,CAAC;SAClC,GAAG,CAAC;QACH,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,gBAAgB,EAAE,KAAK,CAAC,gBAAgB;QACxC,QAAQ;QACR,SAAS;KACV,CAAC;SACD,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,CACzD,CACF;SACA,SAAS,CAAC,EAAE,OAAO,EAAE,0BAA0B,CAAC,OAAO,EAAE,CAAC,CAAC;IAC9D,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED,KAAK,UAAU,wCAAwC,CAAC,KAIvD;IACC,MAAM,CAAC,iBAAiB,EAAE,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC5D,cAAc,CAAC,mCAAmC,CAAC;QACnD,cAAc,CAAC,gCAAgC,CAAC;KACjD,CAAC,CAAC;IACH,IAAI,CAAC;QACH,cAAc,CAAC,iBAAiB,EAAE,aAAa,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC1E,cAAc,CAAC,cAAc,EAAE,aAAa,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QACpE,OAAO,CACL,yBAAyB,CAAC,iBAAiB,EAAE,KAAK,CAAC,gBAAgB,CAAC;YACpE,yBAAyB,CAAC,cAAc,CAAC,CAC1C,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,cAAc,CAAC,IAAI,EAAE,CAAC;IACxB,CAAC;AACH,CAAC;AAED,MAAM,sBAAuB,SAAQ,KAAK;IACxC;QACE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,GAAG,wBAAwB,CAAC;IACvC,CAAC;CACF;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,OAAgB,EAChB,KAAoB;IAEpB,MAAM,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IAC/C,MAAM,iCAAiC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QACxE,MAAM,EAAE;aACL,MAAM,CAAC,0BAA0B,CAAC;aAClC,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACrD,EAAE,CAAC,0BAA0B,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CACtD,CACF,CAAC;QACJ,MAAM,EAAE;aACL,MAAM,CAAC,sBAAsB,CAAC;aAC9B,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,EACjD,EAAE,CAAC,sBAAsB,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAClD,CACF,CAAC;IACN,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["import { base64ToBytes } from \"@tearleads/encoding\";\nimport {\n  createDocument,\n  exportFullHistoryIdentity,\n  importSnapshot,\n  satisfiesVersionVector,\n} from \"@tearleads/loro\";\nimport { and, eq, inArray, isNull, ne, sql } from \"drizzle-orm\";\nimport type { DocumentScope } from \"./documentPersistenceTypes\";\nimport {\n  documentHistoryCheckpoints,\n  documentHistoryUpdates,\n  documentTables,\n} from \"./schema\";\nimport { getClientSQLitePersistenceRuntime } from \"./sqlitePersistenceRuntime\";\nimport { type ExecSql, ensureSqlTables } from \"./sqlSchema\";\n\n/**\n * Compaction thresholds: once the tail carries this many rows or bytes, the\n * next persist of a full-history-capable document exports a fresh checkpoint\n * and clears the tail. Small enough to keep restore replay short, large\n * enough that a full-history export (O(history)) happens once per burst of\n * edits instead of per keystroke.\n */\nexport const DOCUMENT_HISTORY_COMPACTION_MAX_ROWS = 200;\nexport const DOCUMENT_HISTORY_COMPACTION_MAX_BYTES = 512 * 1024;\n\n/**\n * Row provenance: \"local\" for updates authored on this device, \"remote\" for\n * decrypted pulled updates. Restores advance the outgoing-delta marker across\n * remote rows (already server-side); local rows never advance it.\n */\ntype DocumentHistoryUpdateOrigin = \"local\" | \"remote\";\n\n/**\n * Rows of the update log that are history tail: every row except an \"outbox\"\n * row, which only waits to be sent (see `documentHistoryUpdates`).\n */\nfunction tailInScope(scope: DocumentScope) {\n  return and(\n    eq(documentHistoryUpdates.appKind, scope.appKind),\n    eq(documentHistoryUpdates.localId, scope.localId),\n    ne(documentHistoryUpdates.origin, \"outbox\"),\n  );\n}\n\n/**\n * Tail rows compaction may fold into a checkpoint and delete: a queued row is\n * the only durable copy of an unsent update, so it waits for settlement even\n * when a checkpoint already covers its operations.\n */\nfunction compactableTailInScope(scope: DocumentScope) {\n  return and(tailInScope(scope), isNull(documentHistoryUpdates.updateId));\n}\n\ninterface DocumentHistoryTailUpdate {\n  readonly origin: DocumentHistoryUpdateOrigin;\n  readonly updateData: string;\n}\n\ninterface DocumentHistoryRestoreState {\n  readonly snapshot: string;\n  readonly tailUpdates: readonly DocumentHistoryTailUpdate[];\n}\n\nexport async function appendDocumentHistoryUpdates(\n  execSql: ExecSql,\n  scope: DocumentScope,\n  updates: readonly string[],\n  origin: DocumentHistoryUpdateOrigin,\n): Promise<void> {\n  if (updates.length === 0) {\n    return;\n  }\n  await ensureSqlTables(execSql, documentTables);\n  const createdAt = new Date().toISOString();\n  await getClientSQLitePersistenceRuntime(execSql).runMutation(async (db) => {\n    // Chunked: a catch-up pull can carry thousands of updates, and a single\n    // multi-row insert would exceed SQLite's bound-variable limit.\n    for (let index = 0; index < updates.length; index += HISTORY_ROW_CHUNK) {\n      await db.insert(documentHistoryUpdates).values(\n        updates.slice(index, index + HISTORY_ROW_CHUNK).map((updateData) => ({\n          id: crypto.randomUUID(),\n          appKind: scope.appKind,\n          localId: scope.localId,\n          updateData,\n          origin,\n          createdAt,\n        })),\n      );\n    }\n  });\n}\n\n/**\n * The checkpoint + ordered tail for a scope, or null when NEITHER exists (a\n * discovered shell that has not hydrated content yet; the caller starts the\n * document empty and the remote pull supplies the content). A tail WITHOUT a\n * checkpoint — a crash between the first enqueued edit's tail append and the\n * birth-checkpoint seed — restores as tail-only (`snapshot: \"\"`): those tail\n * rows can be the only durable copy of a local edit, so they must never be\n * silently ignored.\n */\nexport async function loadDocumentHistoryRestoreState(\n  execSql: ExecSql,\n  scope: DocumentScope,\n): Promise<DocumentHistoryRestoreState | null> {\n  await ensureSqlTables(execSql, documentTables);\n  const { db } = getClientSQLitePersistenceRuntime(execSql);\n  // Read the TAIL before the (full) checkpoint: if another pane compacts\n  // between the two reads, this order yields old-tail + new-checkpoint — a\n  // safe superset (the new checkpoint subsumes the old tail, and replay is\n  // idempotent by op identity). The reverse order could yield old-checkpoint\n  // + already-emptied tail, a torn read that silently drops the compacted\n  // ops for the whole session.\n  const tail = await db\n    .select({\n      id: documentHistoryUpdates.id,\n      origin: documentHistoryUpdates.origin,\n      updateData: documentHistoryUpdates.updateData,\n    })\n    .from(documentHistoryUpdates)\n    .where(tailInScope(scope))\n    // Insertion order: same-millisecond appends make createdAt tie and a\n    // random-uuid tiebreak would replay out of order. importUpdates tolerates\n    // out-of-order batches, but replay should still be deterministic.\n    .orderBy(sql`rowid`);\n\n  const [checkpoint] = await db\n    .select({ snapshot: documentHistoryCheckpoints.snapshot })\n    .from(documentHistoryCheckpoints)\n    .where(\n      and(\n        eq(documentHistoryCheckpoints.appKind, scope.appKind),\n        eq(documentHistoryCheckpoints.localId, scope.localId),\n      ),\n    )\n    .limit(1);\n  if (!checkpoint && tail.length === 0) {\n    return null;\n  }\n\n  return {\n    snapshot: checkpoint?.snapshot ?? \"\",\n    tailUpdates: tail.map((row) => ({\n      // Fail toward re-sending: an unrecognized origin never advances the\n      // marker, which is the recoverable direction (a redundant re-submit\n      // is idempotent; a skipped local op would be orphaned from sync).\n      origin:\n        row.origin === \"remote\" ? (\"remote\" as const) : (\"local\" as const),\n      updateData: row.updateData,\n    })),\n  };\n}\n\n/**\n * Size of the tail compaction can shrink. Queued rows are excluded: they stay\n * until settlement, so counting them would re-export full history on every\n * persist while offline edits wait to sync.\n */\nexport async function readDocumentHistoryTailSize(\n  execSql: ExecSql,\n  scope: DocumentScope,\n): Promise<{ byteLength: number; hasCheckpoint: boolean; rowCount: number }> {\n  await ensureSqlTables(execSql, documentTables);\n  const { db } = getClientSQLitePersistenceRuntime(execSql);\n  const [totals] = await db\n    .select({\n      byteLength: sql<number>`coalesce(sum(length(${documentHistoryUpdates.updateData})), 0)`,\n      rowCount: sql<number>`count(*)`,\n    })\n    .from(documentHistoryUpdates)\n    .where(compactableTailInScope(scope));\n  const [checkpoint] = await db\n    .select({ localId: documentHistoryCheckpoints.localId })\n    .from(documentHistoryCheckpoints)\n    .where(\n      and(\n        eq(documentHistoryCheckpoints.appKind, scope.appKind),\n        eq(documentHistoryCheckpoints.localId, scope.localId),\n      ),\n    )\n    .limit(1);\n  return {\n    byteLength: Number(totals?.byteLength ?? 0),\n    hasCheckpoint: checkpoint !== undefined,\n    rowCount: Number(totals?.rowCount ?? 0),\n  };\n}\n\ninterface DocumentHistoryTailEntry {\n  readonly id: string;\n  readonly updateData: string;\n}\n\n/**\n * The current compactable tail rows WITH their payloads, so a compactor can\n * prove each row's ops are covered by the snapshot it is about to install\n * (another pane's append may carry ops this pane's document has not merged\n * yet). Queued rows are never candidates.\n */\nexport async function listDocumentHistoryTailEntries(\n  execSql: ExecSql,\n  scope: DocumentScope,\n): Promise<DocumentHistoryTailEntry[]> {\n  await ensureSqlTables(execSql, documentTables);\n  const { db } = getClientSQLitePersistenceRuntime(execSql);\n  const rows = await db\n    .select({\n      id: documentHistoryUpdates.id,\n      updateData: documentHistoryUpdates.updateData,\n    })\n    .from(documentHistoryUpdates)\n    .where(compactableTailInScope(scope));\n  return rows.flatMap((row) =>\n    row.id === null ? [] : [{ id: row.id, updateData: row.updateData }],\n  );\n}\n\nconst HISTORY_ROW_CHUNK = 400;\n\n/**\n * Replace the scope's checkpoint with a fresh full-history snapshot and\n * delete ONLY the tail rows the caller captured before exporting it. Every\n * append path writes its tail row after the ops are already in the live\n * document, so any row captured before the export is provably covered by\n * the snapshot — while a row appended concurrently (between export and this\n * delete) survives for the next compaction instead of being lost.\n */\nexport async function replaceDocumentHistoryCheckpoint(\n  execSql: ExecSql,\n  scope: DocumentScope,\n  input: {\n    coveredTailIds: readonly string[];\n    endVersionVector: string;\n    /**\n     * Skip the monotonic version gate. Only for document CREATION, where any\n     * existing checkpoint under this localId is the orphan of a failed prior\n     * attempt (checkpoint written, record row never committed) — a retry's\n     * fresh document need not dominate that orphan to replace it.\n     */\n    force?: boolean;\n    snapshot: string;\n    /**\n     * Re-checked after acquiring the serialized mutation slot (like the\n     * record-save path): a store reset/recreation that happened while this\n     * call waited in the queue must abort the write, or a stale compactor\n     * could install the OLD document's checkpoint over the new identity's.\n     */\n    stillCurrent?: () => boolean;\n  },\n): Promise<boolean> {\n  await ensureSqlTables(execSql, documentTables);\n  // Sequential (non-transactional) so callers already inside a transaction\n  // can nest this. Crash between the statements leaves the new checkpoint\n  // plus covered tail rows — a safe superset, since tail replay is\n  // idempotent by op identity. The replacement itself is a compare-and-swap\n  // on the stored revision, so the version gate cannot be bypassed by a\n  // concurrent compactor between the read and the write: whoever loses the\n  // CAS re-reads and re-evaluates the gate against the winner's checkpoint.\n  return getClientSQLitePersistenceRuntime(execSql).runMutation(async (tx) => {\n    if (input.stillCurrent?.() === false) {\n      return false;\n    }\n    for (let attempt = 0; attempt < CHECKPOINT_CAS_ATTEMPTS; attempt += 1) {\n      let replaced: boolean;\n      try {\n        replaced = await tryReplaceCheckpointOnce(tx, scope, input);\n      } catch (error) {\n        if (error instanceof CheckpointGateRejected) {\n          // A fresher checkpoint dominates this candidate: no write, and\n          // the caller's covered rows must stay for the covering pane.\n          return false;\n        }\n        throw error;\n      }\n      if (!replaced) {\n        // CAS lost to a concurrent writer — re-read and re-evaluate the\n        // gate against the winner's checkpoint.\n        continue;\n      }\n      for (\n        let index = 0;\n        index < input.coveredTailIds.length;\n        index += HISTORY_ROW_CHUNK\n      ) {\n        // Never a queued row, even if a caller names one: its operations may\n        // be in the checkpoint, but it is still the unsent update itself.\n        await tx\n          .delete(documentHistoryUpdates)\n          .where(\n            and(\n              compactableTailInScope(scope),\n              inArray(\n                documentHistoryUpdates.id,\n                input.coveredTailIds.slice(index, index + HISTORY_ROW_CHUNK),\n              ),\n            ),\n          );\n      }\n      return true;\n    }\n    // Exhaustion must not read as durable success: creation and rebuild\n    // callers persist record rows assuming the checkpoint landed.\n    throw new Error(\n      \"Document history checkpoint replacement lost every CAS attempt\",\n    );\n  });\n}\n\nconst CHECKPOINT_CAS_ATTEMPTS = 16;\n\ntype MutationDb = Parameters<\n  Parameters<\n    ReturnType<typeof getClientSQLitePersistenceRuntime>[\"runMutation\"]\n  >[0]\n>[0];\n\n/**\n * One compare-and-swap attempt. Returns true when this caller's checkpoint\n * became the stored one, false when a concurrent writer won the CAS (the\n * caller re-reads and retries), and throws CheckpointGateRejected when a\n * fresher stored checkpoint dominates the candidate.\n */\nasync function tryReplaceCheckpointOnce(\n  tx: MutationDb,\n  scope: DocumentScope,\n  input: {\n    endVersionVector: string;\n    force?: boolean;\n    snapshot: string;\n  },\n): Promise<boolean> {\n  const updatedAt = new Date().toISOString();\n  const revision = crypto.randomUUID();\n  const [stored] = await tx\n    .select({\n      endVersionVector: documentHistoryCheckpoints.endVersionVector,\n      revision: documentHistoryCheckpoints.revision,\n      snapshot: documentHistoryCheckpoints.snapshot,\n    })\n    .from(documentHistoryCheckpoints)\n    .where(\n      and(\n        eq(documentHistoryCheckpoints.appKind, scope.appKind),\n        eq(documentHistoryCheckpoints.localId, scope.localId),\n      ),\n    )\n    .limit(1);\n\n  if (!stored) {\n    const inserted = await tx\n      .insert(documentHistoryCheckpoints)\n      .values({\n        appKind: scope.appKind,\n        localId: scope.localId,\n        snapshot: input.snapshot,\n        endVersionVector: input.endVersionVector,\n        revision,\n        updatedAt,\n      })\n      .onConflictDoNothing({\n        target: [\n          documentHistoryCheckpoints.appKind,\n          documentHistoryCheckpoints.localId,\n        ],\n      })\n      .returning({ localId: documentHistoryCheckpoints.localId });\n    // Conflict means a concurrent writer inserted first — retry the gate.\n    return inserted.length > 0;\n  }\n\n  // A stale compactor (a pane whose document has not merged another pane's\n  // ops) must never replace a checkpoint it does not cover: the covered\n  // pane may already have deleted its tail rows, so regressing the\n  // checkpoint would leave those ops with no durable copy at all. Vector\n  // dominance proves counter coverage; the retained-prefix identity also\n  // proves the candidate carries the exact stored operations at those\n  // counters rather than a same-frontier fork.\n  if (input.force !== true) {\n    if (\n      !satisfiesVersionVector(input.endVersionVector, stored.endVersionVector)\n    ) {\n      throw new CheckpointGateRejected();\n    }\n    if (\n      input.snapshot !== stored.snapshot &&\n      !(await candidateContainsStoredCheckpointHistory({\n        candidateSnapshot: input.snapshot,\n        storedEndVersion: stored.endVersionVector,\n        storedSnapshot: stored.snapshot,\n      }))\n    ) {\n      throw new CheckpointGateRejected();\n    }\n  }\n\n  const replaced = await tx\n    .update(documentHistoryCheckpoints)\n    .set({\n      snapshot: input.snapshot,\n      endVersionVector: input.endVersionVector,\n      revision,\n      updatedAt,\n    })\n    .where(\n      and(\n        eq(documentHistoryCheckpoints.appKind, scope.appKind),\n        eq(documentHistoryCheckpoints.localId, scope.localId),\n        eq(documentHistoryCheckpoints.revision, stored.revision),\n      ),\n    )\n    .returning({ localId: documentHistoryCheckpoints.localId });\n  return replaced.length > 0;\n}\n\nasync function candidateContainsStoredCheckpointHistory(input: {\n  candidateSnapshot: string;\n  storedEndVersion: string;\n  storedSnapshot: string;\n}): Promise<boolean> {\n  const [candidateDocument, storedDocument] = await Promise.all([\n    createDocument(\"checkpoint-candidate-history-gate\"),\n    createDocument(\"checkpoint-stored-history-gate\"),\n  ]);\n  try {\n    importSnapshot(candidateDocument, base64ToBytes(input.candidateSnapshot));\n    importSnapshot(storedDocument, base64ToBytes(input.storedSnapshot));\n    return (\n      exportFullHistoryIdentity(candidateDocument, input.storedEndVersion) ===\n      exportFullHistoryIdentity(storedDocument)\n    );\n  } finally {\n    candidateDocument.free();\n    storedDocument.free();\n  }\n}\n\nclass CheckpointGateRejected extends Error {\n  constructor() {\n    super(\"checkpoint gate rejected\");\n    this.name = \"CheckpointGateRejected\";\n  }\n}\n\nexport async function deleteDocumentHistory(\n  execSql: ExecSql,\n  scope: DocumentScope,\n): Promise<void> {\n  await ensureSqlTables(execSql, documentTables);\n  await getClientSQLitePersistenceRuntime(execSql).runMutation(async (tx) => {\n    await tx\n      .delete(documentHistoryCheckpoints)\n      .where(\n        and(\n          eq(documentHistoryCheckpoints.appKind, scope.appKind),\n          eq(documentHistoryCheckpoints.localId, scope.localId),\n        ),\n      );\n    await tx\n      .delete(documentHistoryUpdates)\n      .where(\n        and(\n          eq(documentHistoryUpdates.appKind, scope.appKind),\n          eq(documentHistoryUpdates.localId, scope.localId),\n        ),\n      );\n  });\n}\n"]}

package/data/sqlite/documentOrphanBlobReclaims.js

@@ -1,6 +0,0 @@
-import { sqliteTable, text } from "drizzle-orm/sqlite-core";
-import { defineSqlTableSchema } from "./sqlTableSchema.js";
-/** Durable byte-reclamation queue populated before orphan attachment rows go. */
-export const documentOrphanBlobReclaims = sqliteTable("document_orphan_blob_reclaims", { storageKey: text("storage_key").primaryKey() });
-export const documentOrphanBlobReclaimTable = defineSqlTableSchema(documentOrphanBlobReclaims);
-//# sourceMappingURL=documentOrphanBlobReclaims.js.map

package/data/sqlite/documentOrphanBlobReclaims.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"documentOrphanBlobReclaims.js","sourceRoot":"","sources":["documentOrphanBlobReclaims.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAExD,iFAAiF;AACjF,MAAM,CAAC,MAAM,0BAA0B,GAAG,WAAW,CACnD,+BAA+B,EAC/B,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,UAAU,EAAE,EAAE,CACjD,CAAC;AAEF,MAAM,CAAC,MAAM,8BAA8B,GAAG,oBAAoB,CAChE,0BAA0B,CAC3B,CAAC","sourcesContent":["import { sqliteTable, text } from \"drizzle-orm/sqlite-core\";\nimport { defineSqlTableSchema } from \"./sqlTableSchema\";\n\n/** Durable byte-reclamation queue populated before orphan attachment rows go. */\nexport const documentOrphanBlobReclaims = sqliteTable(\n  \"document_orphan_blob_reclaims\",\n  { storageKey: text(\"storage_key\").primaryKey() },\n);\n\nexport const documentOrphanBlobReclaimTable = defineSqlTableSchema(\n  documentOrphanBlobReclaims,\n);\n"]}