emdash 0.40.0 → 0.41.0

package/dist/staged-C36IWXff.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"staged-C36IWXff.mjs","names":[],"sources":["../src/database/repositories/relation.ts","../src/references/staged.ts"],"sourcesContent":["import { sql, type Kysely, type Selectable } from \"kysely\";\nimport { ulid } from \"ulidx\";\n\nimport { chunks, SQL_BATCH_SIZE } from \"../../utils/chunks.js\";\nimport type { Database, RelationTable, ContentReferenceTable } from \"../types.js\";\nimport {\n\tdecodeCursor,\n\tencodeCursor,\n\tInvalidCursorError,\n\tSTAGED_CURSOR_MARKER,\n\ttype FindManyResult,\n} from \"./types.js\";\n\n// Each reference-edge row binds six values. Derive the row count so every\n// INSERT stays within D1's 100-parameter statement ceiling.\nconst REFERENCE_INSERT_BIND_COLUMNS = 6;\nconst D1_MAX_BOUND_PARAMETERS = 100;\nexport const REFERENCE_INSERT_BATCH_SIZE = Math.floor(\n\tD1_MAX_BOUND_PARAMETERS / REFERENCE_INSERT_BIND_COLUMNS,\n);\n\n// Repositioning binds an edge id twice — once to match the CASE branch, once in\n// the row filter. The new position is a literal and binds nothing.\nconst REFERENCE_REPOSITION_BIND_COLUMNS = 2;\nconst REFERENCE_REPOSITION_BATCH_SIZE = Math.floor(\n\tD1_MAX_BOUND_PARAMETERS / REFERENCE_REPOSITION_BIND_COLUMNS,\n);\n\n/** A reference edge as it is written. */\ninterface EdgeInsert {\n\tid: string;\n\trelation_id: string;\n\tparent_group: string;\n\tchild_group: string;\n\tsort_order: number;\n\tcreated_at: string;\n}\n\n/** Where an existing edge should sit in its parent's list. */\ninterface EdgePosition {\n\tid: string;\n\tsortOrder: number;\n}\n\n/**\n * Narrow a computed position to a non-negative integer before it is written as\n * a SQL literal. Every caller passes an array index; this is what keeps that\n * true at the one place the value stops being a bound parameter.\n */\nfunction asPosition(sortOrder: number): number {\n\tif (!Number.isInteger(sortOrder) || sortOrder < 0) {\n\t\tthrow new TypeError(`Invalid reference sort order: ${sortOrder}`);\n\t}\n\treturn sortOrder;\n}\n\n/**\n * A relation definition. Not localized: a relation joins the same two\n * collections whatever language you read it in, and its role labels are\n * single-valued like a collection's or a field's. That is what lets `slug` be\n * unique outright (migration 086) and resolve without a locale.\n */\nexport interface Relation {\n\tid: string;\n\tslug: string;\n\tparentCollection: string;\n\tchildCollection: string;\n\tparentLabel: string;\n\tchildLabel: string;\n\tparentLabelSingular: string | null;\n\tchildLabelSingular: string | null;\n\t/** How many children one parent may hold. `null` means unlimited. */\n\tmaxChildrenPerParent: number | null;\n\t/** How many parents one child may hold. `null` means unlimited. */\n\tmaxParentsPerChild: number | null;\n}\n\nexport interface CreateRelationInput {\n\tslug: string;\n\tparentCollection: string;\n\tchildCollection: string;\n\tparentLabel: string;\n\tchildLabel: string;\n\tparentLabelSingular?: string | null;\n\tchildLabelSingular?: string | null;\n\tmaxChildrenPerParent?: number | null;\n\tmaxParentsPerChild?: number | null;\n}\n\nexport interface UpdateRelationInput {\n\t/** Structural fields are immutable: a reference field stores the slug, and\n\t * the edges are keyed by the id. */\n\tparentLabel?: string;\n\tchildLabel?: string;\n\tparentLabelSingular?: string | null;\n\tchildLabelSingular?: string | null;\n\tmaxChildrenPerParent?: number | null;\n\tmaxParentsPerChild?: number | null;\n}\n\nexport interface ContentReference {\n\tid: string;\n\trelationId: string;\n\tparentGroup: string;\n\tchildGroup: string;\n\tsortOrder: number;\n}\n\n/**\n * Content-references repository.\n *\n * Owns relation *definitions* (`_emdash_relations`) and the *edge* junction\n * (`_emdash_content_references`, whose endpoints are content\n * `translation_group`s so edges are locale-agnostic, mirroring\n * `content_taxonomies`).\n *\n * A relation is schema, so it is not localized — it sits with\n * `_emdash_collections` and `_emdash_fields`, not with the row-per-locale\n * tables. See migration 086.\n *\n * Like `TaxonomyRepository`, this is not the validation boundary: it trusts its\n * typed inputs. The API slice supplies Zod schemas at the route and enforces\n * collection-agreement / relation-existence invariants in the handler.\n */\nexport class RelationRepository {\n\tconstructor(private db: Kysely<Database>) {}\n\n\t/**\n\t * Create a relation.\n\t *\n\t * `slug` is unique across all relations, so a duplicate raises the DB's\n\t * unique violation for the handler to translate into a conflict.\n\t */\n\tasync create(input: CreateRelationInput): Promise<Relation> {\n\t\tconst id = ulid();\n\t\tconst now = new Date().toISOString();\n\n\t\tawait this.db\n\t\t\t.insertInto(\"_emdash_relations\")\n\t\t\t.values({\n\t\t\t\tid,\n\t\t\t\tslug: input.slug,\n\t\t\t\tparent_collection: input.parentCollection,\n\t\t\t\tchild_collection: input.childCollection,\n\t\t\t\tparent_label: input.parentLabel,\n\t\t\t\tchild_label: input.childLabel,\n\t\t\t\tparent_label_singular: input.parentLabelSingular ?? null,\n\t\t\t\tchild_label_singular: input.childLabelSingular ?? null,\n\t\t\t\tmax_children_per_parent: input.maxChildrenPerParent ?? null,\n\t\t\t\tmax_parents_per_child: input.maxParentsPerChild ?? null,\n\t\t\t\tcreated_at: now,\n\t\t\t\tupdated_at: now,\n\t\t\t})\n\t\t\t.execute();\n\n\t\tconst relation = await this.findById(id);\n\t\tif (!relation) throw new Error(\"Failed to create relation\");\n\t\treturn relation;\n\t}\n\n\tasync findById(id: string): Promise<Relation | null> {\n\t\tconst row = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.selectAll()\n\t\t\t.where(\"id\", \"=\", id)\n\t\t\t.executeTakeFirst();\n\t\treturn row ? this.rowToRelation(row) : null;\n\t}\n\n\t/**\n\t * Find a relation by its slug. No locale: a slug identifies a relation\n\t * outright (`UNIQUE(slug)`, migration 086), which is what lets an entry in\n\t * any locale address it.\n\t */\n\tasync findBySlug(slug: string): Promise<Relation | null> {\n\t\tconst row = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.selectAll()\n\t\t\t.where(\"slug\", \"=\", slug)\n\t\t\t.executeTakeFirst();\n\t\treturn row ? this.rowToRelation(row) : null;\n\t}\n\n\t/** All relations, ordered by slug. */\n\tasync list(): Promise<Relation[]> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.selectAll()\n\t\t\t.orderBy(\"slug\", \"asc\")\n\t\t\t.execute();\n\t\treturn rows.map((row) => this.rowToRelation(row));\n\t}\n\n\t/** Relations where `collection` is the parent OR the child side. */\n\tasync findForCollection(collection: string): Promise<Relation[]> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.selectAll()\n\t\t\t.where((eb) =>\n\t\t\t\teb.or([eb(\"parent_collection\", \"=\", collection), eb(\"child_collection\", \"=\", collection)]),\n\t\t\t)\n\t\t\t.orderBy(\"slug\", \"asc\")\n\t\t\t.execute();\n\t\treturn rows.map((row) => this.rowToRelation(row));\n\t}\n\n\t/**\n\t * Update a relation's role labels and cardinality. Structural fields are\n\t * immutable — a reference field stores the slug, and the edges are keyed by\n\t * the id. No-ops when nothing is supplied.\n\t */\n\tasync update(id: string, input: UpdateRelationInput): Promise<Relation | null> {\n\t\tconst existing = await this.findById(id);\n\t\tif (!existing) return null;\n\n\t\tconst updates: Record<string, unknown> = {};\n\t\tif (input.parentLabel !== undefined) updates.parent_label = input.parentLabel;\n\t\tif (input.childLabel !== undefined) updates.child_label = input.childLabel;\n\t\tif (input.parentLabelSingular !== undefined) {\n\t\t\tupdates.parent_label_singular = input.parentLabelSingular;\n\t\t}\n\t\tif (input.childLabelSingular !== undefined) {\n\t\t\tupdates.child_label_singular = input.childLabelSingular;\n\t\t}\n\t\tif (input.maxChildrenPerParent !== undefined) {\n\t\t\tupdates.max_children_per_parent = input.maxChildrenPerParent;\n\t\t}\n\t\tif (input.maxParentsPerChild !== undefined) {\n\t\t\tupdates.max_parents_per_child = input.maxParentsPerChild;\n\t\t}\n\n\t\tif (Object.keys(updates).length > 0) {\n\t\t\tupdates.updated_at = new Date().toISOString();\n\t\t\tawait this.db.updateTable(\"_emdash_relations\").set(updates).where(\"id\", \"=\", id).execute();\n\t\t}\n\n\t\treturn this.findById(id);\n\t}\n\n\t/**\n\t * Delete a relation and its edges (application-layer cascade — the edge\n\t * table has no FK).\n\t */\n\tasync delete(id: string): Promise<boolean> {\n\t\tconst relation = await this.findById(id);\n\t\tif (!relation) return false;\n\n\t\tawait this.db.deleteFrom(\"_emdash_content_references\").where(\"relation_id\", \"=\", id).execute();\n\n\t\tconst result = await this.db\n\t\t\t.deleteFrom(\"_emdash_relations\")\n\t\t\t.where(\"id\", \"=\", id)\n\t\t\t.executeTakeFirst();\n\t\treturn (result.numDeletedRows ?? 0n) > 0n;\n\t}\n\n\t/**\n\t * Insert one edge only while the end it lands on is still under its limit,\n\t * deciding and writing in a single statement.\n\t *\n\t * A count read before the insert answers for a moment that has passed by the\n\t * time the row goes in: two requests can both read a free slot and both fill\n\t * it, and the unique edge constraint does not catch it because they are\n\t * different pairs. Folding the count into the insert's `WHERE` makes the\n\t * decision and the write one thing, on D1 as much as anywhere. Returns false\n\t * when the limit refused the row.\n\t */\n\tprivate async insertEdgeWithinLimit(\n\t\trow: EdgeInsert,\n\t\tlimitedSide: \"parent\" | \"child\",\n\t\tlimit: number,\n\t): Promise<boolean> {\n\t\tconst column = limitedSide === \"parent\" ? \"parent_group\" : \"child_group\";\n\t\tconst group = limitedSide === \"parent\" ? row.parent_group : row.child_group;\n\t\tconst result = await sql`\n\t\t\tINSERT INTO ${sql.ref(\"_emdash_content_references\")}\n\t\t\t\t(id, relation_id, parent_group, child_group, sort_order, created_at)\n\t\t\tSELECT ${row.id}, ${row.relation_id}, ${row.parent_group}, ${row.child_group},\n\t\t\t       ${row.sort_order}, ${row.created_at}\n\t\t\tWHERE (\n\t\t\t\tSELECT COUNT(*) FROM ${sql.ref(\"_emdash_content_references\")}\n\t\t\t\tWHERE relation_id = ${row.relation_id} AND ${sql.ref(column)} = ${group}\n\t\t\t) < ${limit}\n\t\t`.execute(this.db);\n\t\treturn (result.numAffectedRows ?? 0n) > 0n;\n\t}\n\n\t/**\n\t * Write new edges, taking back the ones already written if the limited end\n\t * refuses a later one.\n\t *\n\t * Returns the refused group in a one-element array, or an empty array when\n\t * every row went in. The rollback is what lets a replacement add before it\n\t * removes: on D1 nothing else can take a partial write back.\n\t *\n\t * An unlimited end cannot refuse anything, so its rows go in as batches; a\n\t * limited one takes a statement per edge, because a limit enforced only by a\n\t * count before the write is one two requests can both walk past.\n\t */\n\tprivate async insertEdges(\n\t\trows: EdgeInsert[],\n\t\tlimitedSide: \"parent\" | \"child\",\n\t\tlimit: number | null,\n\t): Promise<string[]> {\n\t\tif (rows.length === 0) return [];\n\n\t\tif (limit === null) {\n\t\t\tfor (const rowBatch of chunks(rows, REFERENCE_INSERT_BATCH_SIZE)) {\n\t\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per D1-safe batch\n\t\t\t\tawait this.db\n\t\t\t\t\t.insertInto(\"_emdash_content_references\")\n\t\t\t\t\t.values(rowBatch)\n\t\t\t\t\t.onConflict((oc) => oc.doNothing())\n\t\t\t\t\t.execute();\n\t\t\t}\n\t\t\treturn [];\n\t\t}\n\n\t\tconst written: string[] = [];\n\t\tfor (const row of rows) {\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per edge is what makes the limit hold\n\t\t\tconst inserted = await this.insertEdgeWithinLimit(row, limitedSide, limit);\n\t\t\tif (inserted) {\n\t\t\t\twritten.push(row.id);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tawait this.deleteEdgesById(written);\n\t\t\treturn [limitedSide === \"parent\" ? row.parent_group : row.child_group];\n\t\t}\n\t\treturn [];\n\t}\n\n\t/** Remove edges by id, in D1-safe batches. */\n\tprivate async deleteEdgesById(ids: string[]): Promise<void> {\n\t\tfor (const idBatch of chunks(ids, SQL_BATCH_SIZE)) {\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per bind-parameter batch\n\t\t\tawait this.db.deleteFrom(\"_emdash_content_references\").where(\"id\", \"in\", idBatch).execute();\n\t\t}\n\t}\n\n\t/**\n\t * Move kept edges to their new positions, a statement per batch rather than\n\t * one per edge: dragging one entry up a long list moves every entry below it,\n\t * and that is a single editor action.\n\t */\n\tprivate async repositionEdges(moves: EdgePosition[]): Promise<void> {\n\t\tfor (const moveBatch of chunks(moves, REFERENCE_REPOSITION_BATCH_SIZE)) {\n\t\t\t// The position is a literal, not a bind: it is an index this method\n\t\t\t// computed, and every branch of a CASE binding one would leave Postgres\n\t\t\t// inferring the result type from parameters alone.\n\t\t\tconst branches = moveBatch.map(\n\t\t\t\t(move) => sql`WHEN ${move.id} THEN ${sql.lit(asPosition(move.sortOrder))}`,\n\t\t\t);\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per bind-parameter batch\n\t\t\tawait this.db\n\t\t\t\t.updateTable(\"_emdash_content_references\")\n\t\t\t\t.set({\n\t\t\t\t\tsort_order: sql<number>`CASE ${sql.ref(\"id\")} ${sql.join(branches, sql` `)} END`,\n\t\t\t\t})\n\t\t\t\t.where(\n\t\t\t\t\t\"id\",\n\t\t\t\t\t\"in\",\n\t\t\t\t\tmoveBatch.map((move) => move.id),\n\t\t\t\t)\n\t\t\t\t.execute();\n\t\t}\n\t}\n\n\t/** Normalize a relation id OR slug to its id. Returns null for an unknown\n\t * relation (edge methods then no-op, matching\n\t * `TaxonomyRepository.attachToEntry`). */\n\tprivate async resolveRelationId(idOrSlug: string): Promise<string | null> {\n\t\treturn (await this.resolveRelationLimits(idOrSlug))?.id ?? null;\n\t}\n\n\t/** The same lookup, carrying the limits an edge write has to hold to. */\n\tprivate async resolveRelationLimits(idOrSlug: string): Promise<{\n\t\tid: string;\n\t\tmaxChildrenPerParent: number | null;\n\t\tmaxParentsPerChild: number | null;\n\t} | null> {\n\t\tconst row = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.select([\"id\", \"max_children_per_parent\", \"max_parents_per_child\"])\n\t\t\t.where((eb) => eb.or([eb(\"id\", \"=\", idOrSlug), eb(\"slug\", \"=\", idOrSlug)]))\n\t\t\t.executeTakeFirst();\n\t\tif (!row) return null;\n\t\treturn {\n\t\t\tid: row.id,\n\t\t\tmaxChildrenPerParent: row.max_children_per_parent,\n\t\t\tmaxParentsPerChild: row.max_parents_per_child,\n\t\t};\n\t}\n\n\tprivate rowToReference(row: Selectable<ContentReferenceTable>): ContentReference {\n\t\treturn {\n\t\t\tid: row.id,\n\t\t\trelationId: row.relation_id,\n\t\t\tparentGroup: row.parent_group,\n\t\t\tchildGroup: row.child_group,\n\t\t\tsortOrder: row.sort_order,\n\t\t};\n\t}\n\n\t/**\n\t * Link `parentGroup → childGroup` under a relation. `relation` is a relation\n\t * id or group. Idempotent (onConflict doNothing against the unique edge).\n\t * `sortOrder` defaults to append: max(sort_order)+1 within (relation, parent).\n\t *\n\t * The default-append MAX→INSERT is not atomic: concurrent appends without an\n\t * explicit `sortOrder` may both read the same max and collide on sort_order,\n\t * and onConflict silently drops the loser. Callers needing strict ordering\n\t * under concurrency should pass `sortOrder` explicitly (or serialize).\n\t */\n\tasync addReference(\n\t\trelation: string,\n\t\tparentGroup: string,\n\t\tchildGroup: string,\n\t\tsortOrder?: number,\n\t): Promise<void> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return;\n\n\t\tlet order = sortOrder;\n\t\tif (order === undefined) {\n\t\t\tconst max = await this.db\n\t\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t\t.select((eb) => eb.fn.max(\"sort_order\").as(\"max\"))\n\t\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t\t.executeTakeFirst();\n\t\t\torder = max?.max === null || max?.max === undefined ? 0 : Number(max.max) + 1;\n\t\t}\n\n\t\tawait this.db\n\t\t\t.insertInto(\"_emdash_content_references\")\n\t\t\t.values({\n\t\t\t\tid: ulid(),\n\t\t\t\trelation_id: relationId,\n\t\t\t\tparent_group: parentGroup,\n\t\t\t\tchild_group: childGroup,\n\t\t\t\tsort_order: order,\n\t\t\t\tcreated_at: new Date().toISOString(),\n\t\t\t})\n\t\t\t.onConflict((oc) => oc.doNothing())\n\t\t\t.execute();\n\t}\n\n\t/** Remove one `parentGroup → childGroup` edge under a relation. */\n\tasync removeReference(relation: string, parentGroup: string, childGroup: string): Promise<void> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return;\n\n\t\tawait this.db\n\t\t\t.deleteFrom(\"_emdash_content_references\")\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t.where(\"child_group\", \"=\", childGroup)\n\t\t\t.execute();\n\t}\n\n\t/** Forward traversal: a parent's children for a relation, ordered. */\n\tasync getChildren(relation: string, parentGroup: string): Promise<ContentReference[]> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return [];\n\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.selectAll()\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t.orderBy(\"sort_order\", \"asc\")\n\t\t\t.orderBy(\"id\", \"asc\")\n\t\t\t.execute();\n\t\treturn rows.map((row) => this.rowToReference(row));\n\t}\n\n\t/**\n\t * Forward traversal, paginated: one page of a parent's children for a\n\t * relation, ordered by `(sort_order, id)`. Use this on request paths — a\n\t * parent's children are capped but still up to 1000, and an unbounded read\n\t * scales poorly. Returns `{ items, nextCursor? }`; the cursor's order value is\n\t * the row's `sort_order`. Default limit 50, max 100.\n\t */\n\tasync getChildrenPage(\n\t\trelation: string,\n\t\tparentGroup: string,\n\t\toptions: { limit?: number; cursor?: string } = {},\n\t): Promise<FindManyResult<ContentReference>> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return { items: [] };\n\t\treturn this.getChildrenPageById(relationId, parentGroup, options);\n\t}\n\n\t/** `getChildrenPage` for a caller that already holds the relation's id. */\n\tasync getChildrenPageById(\n\t\trelationId: string,\n\t\tparentGroup: string,\n\t\toptions: { limit?: number; cursor?: string } = {},\n\t): Promise<FindManyResult<ContentReference>> {\n\t\tconst limit = Math.min(options.limit || 50, 100);\n\n\t\tlet query = this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.selectAll()\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup);\n\n\t\tif (options.cursor) {\n\t\t\tconst decoded = decodeCursor(options.cursor);\n\t\t\tif (decoded.orderValue === STAGED_CURSOR_MARKER) {\n\t\t\t\t// A cursor issued over a draft's pending selection anchors on a\n\t\t\t\t// translation group rather than a row here, which is what a render\n\t\t\t\t// sees when the draft publishes mid-pagination. Resume after that\n\t\t\t\t// group's edge so the walk continues; if the group is no longer\n\t\t\t\t// selected there is nothing to resume from, so the page restarts.\n\t\t\t\tquery = query.where((eb) => {\n\t\t\t\t\tconst anchor = () =>\n\t\t\t\t\t\teb\n\t\t\t\t\t\t\t.selectFrom(\"_emdash_content_references as anchor\")\n\t\t\t\t\t\t\t.where(\"anchor.relation_id\", \"=\", relationId)\n\t\t\t\t\t\t\t.where(\"anchor.parent_group\", \"=\", parentGroup)\n\t\t\t\t\t\t\t.where(\"anchor.child_group\", \"=\", decoded.id);\n\t\t\t\t\treturn eb.or([\n\t\t\t\t\t\teb.not(eb.exists(anchor().select(\"anchor.id\"))),\n\t\t\t\t\t\teb(\"sort_order\", \">\", anchor().select(\"anchor.sort_order\")),\n\t\t\t\t\t\teb.and([\n\t\t\t\t\t\t\teb(\"sort_order\", \"=\", anchor().select(\"anchor.sort_order\")),\n\t\t\t\t\t\t\teb(\"id\", \">\", anchor().select(\"anchor.id\")),\n\t\t\t\t\t\t]),\n\t\t\t\t\t]);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tconst sortOrder = Number(decoded.orderValue);\n\t\t\t\t// `decodeCursor` only guarantees `orderValue` is a string; a hand-crafted\n\t\t\t\t// cursor with a non-numeric order value would coerce to NaN and blow up at\n\t\t\t\t// the driver bind as a 500. A bad cursor is a client error — surface it as\n\t\t\t\t// INVALID_CURSOR (400). Server-issued cursors are always numeric here.\n\t\t\t\tif (!Number.isFinite(sortOrder)) throw new InvalidCursorError(options.cursor);\n\t\t\t\tquery = query.where((eb) =>\n\t\t\t\t\teb.or([\n\t\t\t\t\t\teb(\"sort_order\", \">\", sortOrder),\n\t\t\t\t\t\teb.and([eb(\"sort_order\", \"=\", sortOrder), eb(\"id\", \">\", decoded.id)]),\n\t\t\t\t\t]),\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\tconst rows = await query\n\t\t\t.orderBy(\"sort_order\", \"asc\")\n\t\t\t.orderBy(\"id\", \"asc\")\n\t\t\t.limit(limit + 1)\n\t\t\t.execute();\n\n\t\tconst hasMore = rows.length > limit;\n\t\tconst items = rows.slice(0, limit).map((row) => this.rowToReference(row));\n\t\tconst result: FindManyResult<ContentReference> = { items };\n\t\tconst last = items.at(-1);\n\t\tif (hasMore && last) {\n\t\t\tresult.nextCursor = encodeCursor(String(last.sortOrder), last.id);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/** Backlink traversal: the parents that reference a child for a relation. */\n\tasync getParents(relation: string, childGroup: string): Promise<ContentReference[]> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return [];\n\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.selectAll()\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"child_group\", \"=\", childGroup)\n\t\t\t.orderBy(\"id\", \"asc\")\n\t\t\t.execute();\n\t\treturn rows.map((row) => this.rowToReference(row));\n\t}\n\n\t/**\n\t * Replace all children of `parentGroup` under a relation with `childGroups`,\n\t * assigning positional sort_order (index in the deduped array).\n\t * Mirrors the intent of `TaxonomyRepository.setTermsForEntry`.\n\t *\n\t * A parent references a given child at most once (the unique edge), so\n\t * duplicate `childGroups` are collapsed first-occurrence-wins rather than\n\t * relying on the insert's onConflict to silently drop them.\n\t *\n\t * Written as a diff, in the order add → remove → reposition, rather than as a\n\t * delete of the whole end followed by a re-insert. There is no transaction on\n\t * D1: a replacement that removed first would leave the parent holding nothing\n\t * the moment the far side refused one of the additions, and report a failed\n\t * save over an emptied field. Additions already written come back out when a\n\t * later one is refused, so a refused call leaves the selection as it found it.\n\t * The diff also keeps an edge the caller is merely re-stating out of the far\n\t * side's count, which a delete-and-reinsert survives only because its delete\n\t * frees the slot a moment before it asks for it back.\n\t *\n\t * Concurrency: two simultaneous replace-all calls for the same (relation,\n\t * parent) can interleave and merge into the union of both sets (a lost update\n\t * — neither \"replace\" wins). This is non-corrupting — keyset pagination stays\n\t * totally ordered via the `(sort_order, id)` tiebreak even with duplicate\n\t * sort_orders — and a single client editing one parent's children serially\n\t * never hits it. A D1-portable fix isn't available (no multi-statement\n\t * transactions), so concurrent replace-all on one parent is unsupported by\n\t * design rather than guarded here.\n\t *\n\t * Returns the child group `maxParentsPerChild` refused, in a one-element\n\t * array — empty unless the relation limits that end and something else has\n\t * taken the slot since the caller resolved its selection.\n\t */\n\tasync setChildren(\n\t\trelation: string,\n\t\tparentGroup: string,\n\t\tchildGroups: string[],\n\t): Promise<string[]> {\n\t\tconst rel = await this.resolveRelationLimits(relation);\n\t\tif (!rel) return [];\n\n\t\tconst existing = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.select([\"id\", \"child_group\", \"sort_order\"])\n\t\t\t.where(\"relation_id\", \"=\", rel.id)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t.execute();\n\t\tconst existingChildren = new Set(existing.map((row) => row.child_group));\n\n\t\t// Collapse duplicates so positional sort_order has no gaps.\n\t\tconst uniqueChildGroups = [...new Set(childGroups)];\n\t\tconst positions = new Map(uniqueChildGroups.map((childGroup, index) => [childGroup, index]));\n\n\t\tconst now = new Date().toISOString();\n\t\tconst additions = uniqueChildGroups\n\t\t\t.map((childGroup, index) => ({ childGroup, index }))\n\t\t\t.filter(({ childGroup }) => !existingChildren.has(childGroup))\n\t\t\t.map(({ childGroup, index }) => ({\n\t\t\t\tid: ulid(),\n\t\t\t\trelation_id: rel.id,\n\t\t\t\tparent_group: parentGroup,\n\t\t\t\tchild_group: childGroup,\n\t\t\t\tsort_order: index,\n\t\t\t\tcreated_at: now,\n\t\t\t}));\n\n\t\tconst rejected = await this.insertEdges(additions, \"child\", rel.maxParentsPerChild);\n\t\tif (rejected.length > 0) return rejected;\n\n\t\tconst removals: string[] = [];\n\t\tconst repositions: EdgePosition[] = [];\n\t\tfor (const row of existing) {\n\t\t\tconst position = positions.get(row.child_group);\n\t\t\tif (position === undefined) removals.push(row.id);\n\t\t\telse if (position !== row.sort_order) repositions.push({ id: row.id, sortOrder: position });\n\t\t}\n\t\tawait this.deleteEdgesById(removals);\n\t\tawait this.repositionEdges(repositions);\n\t\treturn [];\n\t}\n\n\t/**\n\t * Replace all parents of `childGroup` under a relation with `parentGroups`:\n\t * the mirror of `setChildren`, for a field bound to the child side.\n\t *\n\t * Duplicates collapse first-occurrence-wins, and the same diff ordering and\n\t * non-transactional caveats apply — see `setChildren`, including that two\n\t * concurrent replace-all calls for one (relation, child) can merge.\n\t *\n\t * `sort_order` orders children within a parent and has no counterpart on this\n\t * side, so a *new* edge takes the next position among that parent's existing\n\t * children rather than a position in this child's list. A parent the caller\n\t * re-states keeps the position it already holds: that position is the other\n\t * side's list order, and saving a backlink field must not rewrite it. A\n\t * child-side field therefore has no order of its own; `getParents` reads by\n\t * `id`.\n\t *\n\t * Returns the parent group `maxChildrenPerParent` refused, the mirror of what\n\t * `setChildren` returns.\n\t */\n\tasync setParents(\n\t\trelation: string,\n\t\tchildGroup: string,\n\t\tparentGroups: string[],\n\t): Promise<string[]> {\n\t\tconst rel = await this.resolveRelationLimits(relation);\n\t\tif (!rel) return [];\n\t\tconst relationId = rel.id;\n\n\t\tconst existing = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.select([\"id\", \"parent_group\"])\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"child_group\", \"=\", childGroup)\n\t\t\t.execute();\n\t\tconst existingParents = new Set(existing.map((row) => row.parent_group));\n\n\t\tconst uniqueParentGroups = [...new Set(parentGroups)];\n\t\tconst selected = new Set(uniqueParentGroups);\n\t\tconst newParents = uniqueParentGroups.filter(\n\t\t\t(parentGroup) => !existingParents.has(parentGroup),\n\t\t);\n\n\t\t// One query for every new parent's highest position, so appending stays a\n\t\t// fixed number of round trips rather than one per parent.\n\t\tconst nextSortOrder = new Map<string, number>();\n\t\tfor (const groupBatch of chunks(newParents, REFERENCE_INSERT_BATCH_SIZE)) {\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per bind-parameter batch\n\t\t\tconst maxima = await this.db\n\t\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t\t.select((eb) => [\"parent_group\", eb.fn.max(\"sort_order\").as(\"max\")])\n\t\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t\t.where(\"parent_group\", \"in\", groupBatch)\n\t\t\t\t.groupBy(\"parent_group\")\n\t\t\t\t.execute();\n\t\t\tfor (const row of maxima) {\n\t\t\t\tnextSortOrder.set(row.parent_group, row.max === null ? 0 : Number(row.max) + 1);\n\t\t\t}\n\t\t}\n\n\t\tconst now = new Date().toISOString();\n\t\tconst additions = newParents.map((parentGroup) => ({\n\t\t\tid: ulid(),\n\t\t\trelation_id: relationId,\n\t\t\tparent_group: parentGroup,\n\t\t\tchild_group: childGroup,\n\t\t\tsort_order: nextSortOrder.get(parentGroup) ?? 0,\n\t\t\tcreated_at: now,\n\t\t}));\n\n\t\tconst rejected = await this.insertEdges(additions, \"parent\", rel.maxChildrenPerParent);\n\t\tif (rejected.length > 0) return rejected;\n\n\t\tawait this.deleteEdgesById(\n\t\t\texisting.filter((row) => !selected.has(row.parent_group)).map((row) => row.id),\n\t\t);\n\t\treturn [];\n\t}\n\n\t/**\n\t * Copy every outgoing edge of `fromParentGroup` onto `toParentGroup`,\n\t * preserving relation, child, and sort order. Used when duplicating a content\n\t * entry so the copy carries the same reference selections (edges are\n\t * storage-less, keyed by translation_group, so they don't ride along in the\n\t * row's `data`). Only the parent side is copied; backlinks pointing at the\n\t * original stay on the original. Idempotent per edge via onConflict.\n\t *\n\t * A copy is still a new edge, so it holds to `maxParentsPerChild` like any\n\t * other: a child already at its limit cannot also belong to the copy. Returns\n\t * the child group that refused, in a one-element array, having taken back\n\t * every edge this call had already written — the caller decides what a\n\t * duplicate that cannot carry its selection should do.\n\t */\n\tasync copyParentEdges(fromParentGroup: string, toParentGroup: string): Promise<string[]> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.selectAll()\n\t\t\t.where(\"parent_group\", \"=\", fromParentGroup)\n\t\t\t.execute();\n\t\tif (rows.length === 0) return [];\n\n\t\tconst now = new Date().toISOString();\n\t\t// Each relation carries its own limit, so the copies are written a relation\n\t\t// at a time rather than as one undifferentiated batch.\n\t\tconst byRelation = new Map<string, EdgeInsert[]>();\n\t\tfor (const row of rows) {\n\t\t\tconst copies = byRelation.get(row.relation_id) ?? [];\n\t\t\tcopies.push({\n\t\t\t\tid: ulid(),\n\t\t\t\trelation_id: row.relation_id,\n\t\t\t\tparent_group: toParentGroup,\n\t\t\t\tchild_group: row.child_group,\n\t\t\t\tsort_order: row.sort_order,\n\t\t\t\tcreated_at: now,\n\t\t\t});\n\t\t\tbyRelation.set(row.relation_id, copies);\n\t\t}\n\n\t\tconst written: string[] = [];\n\t\tfor (const [relationId, copies] of byRelation) {\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- each relation's limit gates its own copies\n\t\t\tconst rel = await this.resolveRelationLimits(relationId);\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- sequential so a refusal stops the rest\n\t\t\tconst rejected = await this.insertEdges(copies, \"child\", rel?.maxParentsPerChild ?? null);\n\t\t\tif (rejected.length > 0) {\n\t\t\t\t// `insertEdges` took back its own partial write; the relations already\n\t\t\t\t// copied are this call's to undo.\n\t\t\t\tawait this.deleteEdgesById(written);\n\t\t\t\treturn rejected;\n\t\t\t}\n\t\t\twritten.push(...copies.map((copy) => copy.id));\n\t\t}\n\t\treturn [];\n\t}\n\n\t/**\n\t * How many edges each of `groups` already holds at one end of a relation,\n\t * ignoring edges whose opposite end is `excludeOppositeGroup`.\n\t *\n\t * The exclusion is what lets a re-save of an unchanged selection pass: the\n\t * selecting entry's own edges are not counted against the limit it is about\n\t * to re-establish. Groups with no edges are absent from the map.\n\t */\n\tasync countEdgesByGroup(\n\t\trelationId: string,\n\t\tside: \"parent\" | \"child\",\n\t\tgroups: string[],\n\t\texcludeOppositeGroup: string | null,\n\t): Promise<Map<string, number>> {\n\t\tconst column = side === \"parent\" ? \"parent_group\" : \"child_group\";\n\t\tconst opposite = side === \"parent\" ? \"child_group\" : \"parent_group\";\n\n\t\tconst counts = new Map<string, number>();\n\t\tfor (const groupBatch of chunks([...new Set(groups)], SQL_BATCH_SIZE)) {\n\t\t\tlet query = this.db\n\t\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t\t.select((eb) => [column, eb.fn.countAll().as(\"count\")])\n\t\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t\t.where(column, \"in\", groupBatch);\n\t\t\t// An entry with no group of its own yet holds no links to discount, and\n\t\t\t// `!= NULL` is never true — it would silently count nothing at all.\n\t\t\tif (excludeOppositeGroup !== null) {\n\t\t\t\tquery = query.where(opposite, \"!=\", excludeOppositeGroup);\n\t\t\t}\n\t\t\t// oxlint-disable-next-line no-await-in-loop -- one statement per bind-parameter batch\n\t\t\tconst rows = await query.groupBy(column).execute();\n\t\t\tfor (const row of rows) {\n\t\t\t\tcounts.set(row[column], Number(row.count));\n\t\t\t}\n\t\t}\n\t\treturn counts;\n\t}\n\n\t/**\n\t * Backlink traversal, paginated: one page of the parents that reference a\n\t * child for a relation, ordered by `id`. Unlike a parent's children, a\n\t * child's backlinks are *unbounded* — one popular entry can be referenced by\n\t * arbitrarily many parents — so this read must paginate. Returns\n\t * `{ items, nextCursor? }`; the cursor's order value is the row `id`. Default\n\t * limit 50, max 100.\n\t */\n\tasync getParentsPage(\n\t\trelation: string,\n\t\tchildGroup: string,\n\t\toptions: { limit?: number; cursor?: string } = {},\n\t): Promise<FindManyResult<ContentReference>> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return { items: [] };\n\t\treturn this.getParentsPageById(relationId, childGroup, options);\n\t}\n\n\t/** `getParentsPage` for a caller that already holds the relation's id. */\n\tasync getParentsPageById(\n\t\trelationId: string,\n\t\tchildGroup: string,\n\t\toptions: { limit?: number; cursor?: string } = {},\n\t): Promise<FindManyResult<ContentReference>> {\n\t\tconst limit = Math.min(options.limit || 50, 100);\n\n\t\tlet query = this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.selectAll()\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"child_group\", \"=\", childGroup);\n\n\t\tif (options.cursor) {\n\t\t\tconst decoded = decodeCursor(options.cursor);\n\t\t\tif (decoded.orderValue === STAGED_CURSOR_MARKER) {\n\t\t\t\t// The mirror of `getChildrenPageById`: a staged cursor anchors on a\n\t\t\t\t// translation group, which compared against `id` would page from an\n\t\t\t\t// arbitrary point. Resume after that group's edge, or restart when the\n\t\t\t\t// group is no longer selected.\n\t\t\t\tquery = query.where((eb) => {\n\t\t\t\t\tconst anchor = eb\n\t\t\t\t\t\t.selectFrom(\"_emdash_content_references as anchor\")\n\t\t\t\t\t\t.where(\"anchor.relation_id\", \"=\", relationId)\n\t\t\t\t\t\t.where(\"anchor.child_group\", \"=\", childGroup)\n\t\t\t\t\t\t.where(\"anchor.parent_group\", \"=\", decoded.id);\n\t\t\t\t\treturn eb.or([\n\t\t\t\t\t\teb.not(eb.exists(anchor.select(\"anchor.id\"))),\n\t\t\t\t\t\teb(\"id\", \">\", anchor.select(\"anchor.id\")),\n\t\t\t\t\t]);\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tquery = query.where(\"id\", \">\", decoded.id);\n\t\t\t}\n\t\t}\n\n\t\tconst rows = await query\n\t\t\t.orderBy(\"id\", \"asc\")\n\t\t\t.limit(limit + 1)\n\t\t\t.execute();\n\n\t\tconst hasMore = rows.length > limit;\n\t\tconst items = rows.slice(0, limit).map((row) => this.rowToReference(row));\n\t\tconst result: FindManyResult<ContentReference> = { items };\n\t\tconst last = items.at(-1);\n\t\tif (hasMore && last) {\n\t\t\tresult.nextCursor = encodeCursor(last.id, last.id);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Remove every edge where `group` is the parent OR the child — i.e. ensure no\n\t * orphaned reference edges survive when a content entry is deleted. The\n\t * application-layer cascade that group-linking precludes at the SQL level.\n\t * Callers must be sure the whole group is gone: edges outlive any single\n\t * locale row. Returns the number of edges removed.\n\t */\n\tasync clearReferencesForGroup(group: string): Promise<number> {\n\t\tconst result = await this.db\n\t\t\t.deleteFrom(\"_emdash_content_references\")\n\t\t\t.where((eb) => eb.or([eb(\"parent_group\", \"=\", group), eb(\"child_group\", \"=\", group)]))\n\t\t\t.executeTakeFirst();\n\t\treturn Number(result.numDeletedRows ?? 0);\n\t}\n\n\t/** Count a parent's children under a relation. */\n\tasync countChildren(relation: string, parentGroup: string): Promise<number> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return 0;\n\t\tconst result = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.select((eb) => eb.fn.count(\"id\").as(\"count\"))\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t.executeTakeFirst();\n\t\treturn Number(result?.count ?? 0);\n\t}\n\n\t/** Count a child's parents (backlinks) under a relation. */\n\tasync countParents(relation: string, childGroup: string): Promise<number> {\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return 0;\n\t\tconst result = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.select((eb) => eb.fn.count(\"id\").as(\"count\"))\n\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t.where(\"child_group\", \"=\", childGroup)\n\t\t\t.executeTakeFirst();\n\t\treturn Number(result?.count ?? 0);\n\t}\n\n\t/**\n\t * Total edges per relation, for every relation at once. Relations with no\n\t * edges are absent from the map.\n\t *\n\t * One grouped scan rather than a count per relation: the delete dialogs name\n\t * how many links go with a relation, and the relations list shows the same\n\t * number on every row.\n\t */\n\tasync countEdgesByRelation(): Promise<Map<string, number>> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t.select([\"relation_id\", (eb) => eb.fn.count(\"id\").as(\"count\")])\n\t\t\t.groupBy(\"relation_id\")\n\t\t\t.execute();\n\t\treturn new Map(rows.map((row) => [row.relation_id, Number(row.count ?? 0)]));\n\t}\n\n\t/**\n\t * Batch child-counts for many parents under a relation. Chunks at\n\t * SQL_BATCH_SIZE for D1's bind-parameter limit. Returns parent_group → count\n\t * (parents with no children are absent from the map). Mirrors\n\t * `TaxonomyRepository.countEntriesForTerms`.\n\t */\n\tasync countChildrenForParents(\n\t\trelation: string,\n\t\tparentGroups: string[],\n\t): Promise<Map<string, number>> {\n\t\tconst counts = new Map<string, number>();\n\t\tif (parentGroups.length === 0) return counts;\n\t\tconst relationId = await this.resolveRelationId(relation);\n\t\tif (!relationId) return counts;\n\n\t\tfor (const chunk of chunks(parentGroups, SQL_BATCH_SIZE)) {\n\t\t\tconst rows = await this.db\n\t\t\t\t.selectFrom(\"_emdash_content_references\")\n\t\t\t\t.select([\"parent_group\", (eb) => eb.fn.count(\"id\").as(\"count\")])\n\t\t\t\t.where(\"relation_id\", \"=\", relationId)\n\t\t\t\t.where(\"parent_group\", \"in\", chunk)\n\t\t\t\t.groupBy(\"parent_group\")\n\t\t\t\t.execute();\n\t\t\tfor (const row of rows) {\n\t\t\t\tcounts.set(row.parent_group, Number(row.count ?? 0));\n\t\t\t}\n\t\t}\n\t\treturn counts;\n\t}\n\n\tprivate rowToRelation(row: Selectable<RelationTable>): Relation {\n\t\treturn {\n\t\t\tid: row.id,\n\t\t\tslug: row.slug,\n\t\t\tparentCollection: row.parent_collection,\n\t\t\tchildCollection: row.child_collection,\n\t\t\tparentLabel: row.parent_label,\n\t\t\tchildLabel: row.child_label,\n\t\t\tparentLabelSingular: row.parent_label_singular,\n\t\t\tchildLabelSingular: row.child_label_singular,\n\t\t\tmaxChildrenPerParent: row.max_children_per_parent,\n\t\t\tmaxParentsPerChild: row.max_parents_per_child,\n\t\t};\n\t}\n}\n","/**\n * The shape a pending reference selection takes inside a draft revision, and how\n * to read and page it.\n *\n * Nothing here touches the database, which is what lets both the write side\n * (`api/handlers/staged-references.ts`, which promotes and validates a staged\n * selection) and the read side (the entry read, the edge routes, the public\n * query resolver) share it without importing each other.\n */\n\nimport {\n\tdecodeCursor,\n\tencodeCursor,\n\tSTAGED_CURSOR_MARKER,\n} from \"../database/repositories/types.js\";\n\n/**\n * Where a collection that keeps drafts stages a pending reference selection: in\n * the draft revision's data, beside `_slug`. The leading underscore is what\n * keeps it out of the column writer, the loaded entry's `data`, and the publish\n * promotion loop, all of which already skip `_`-prefixed keys.\n *\n * The link table holds the live selection only.\n */\nexport const STAGED_REFERENCES_KEY = \"_references\";\n\n/**\n * A staged selection, by field slug, holding `translation_group` values rather\n * than entry ids: an edge names a thing, not one locale's row of it, so the\n * group is what the link table stores and what survives an entry being\n * translated or re-slugged between saving and publishing. The save resolves ids\n * to groups so publication has nothing left that can fail to resolve.\n *\n * Order is significant on the parent side, where it becomes `sort_order`.\n */\nexport type StagedReferences = Record<string, string[]>;\n\n/** Default page size for one reference field, matching the list endpoints. */\nexport const REFERENCE_PAGE_LIMIT = 50;\n/** Hard ceiling, matching the list endpoints. */\nexport const REFERENCE_PAGE_MAX_LIMIT = 100;\n\n/** One field's page of translation groups, before the entries are loaded. */\nexport interface PageOfGroups {\n\tgroups: string[];\n\tnextCursor?: string;\n}\n\n/**\n * Page a staged selection, which is a list in memory rather than a table.\n *\n * The cursor anchors on the last group of the previous page rather than on its\n * index: the editor can reorder or drop entries between one page and the next,\n * and an index would then silently skip or repeat. An anchor that is no longer\n * in the selection means the entries it pointed past are gone, so the walk ends.\n */\nexport function pageStagedGroups(\n\tgroups: string[],\n\toptions: { limit?: number; cursor?: string } = {},\n): PageOfGroups {\n\tconst limit = Math.min(\n\t\tMath.max(options.limit ?? REFERENCE_PAGE_LIMIT, 1),\n\t\tREFERENCE_PAGE_MAX_LIMIT,\n\t);\n\n\tlet start = 0;\n\tif (options.cursor) {\n\t\tconst decoded = decodeCursor(options.cursor);\n\t\t// A cursor from the link table anchors on an edge row id, which is not a\n\t\t// group and would match nothing. That happens when a preview session opens\n\t\t// mid-pagination over the published selection, so restart the field rather\n\t\t// than handing back an empty page that reads as \"no more\".\n\t\tif (decoded.orderValue === STAGED_CURSOR_MARKER) {\n\t\t\tconst index = groups.indexOf(decoded.id);\n\t\t\tif (index === -1) return { groups: [] };\n\t\t\tstart = index + 1;\n\t\t}\n\t}\n\n\tconst page = groups.slice(start, start + limit);\n\tconst last = page.at(-1);\n\tconst nextCursor =\n\t\tlast && start + page.length < groups.length\n\t\t\t? encodeCursor(STAGED_CURSOR_MARKER, last)\n\t\t\t: undefined;\n\treturn { groups: page, nextCursor };\n}\n\nfunction isGroupList(value: unknown): value is string[] {\n\treturn Array.isArray(value) && value.every((entry) => typeof entry === \"string\");\n}\n\n/** The staged selection inside a revision's data, if it carries one. */\nexport function readStagedReferences(\n\tdata: Record<string, unknown> | undefined,\n): StagedReferences | undefined {\n\tconst staged = data?.[STAGED_REFERENCES_KEY];\n\tif (typeof staged !== \"object\" || staged === null || Array.isArray(staged)) return undefined;\n\n\tconst result: StagedReferences = {};\n\tfor (const [fieldSlug, groups] of Object.entries(staged)) {\n\t\tif (isGroupList(groups)) result[fieldSlug] = groups;\n\t}\n\treturn Object.keys(result).length > 0 ? result : undefined;\n}\n\n/**\n * Fold a save's selections into whatever the previous draft staged. A save that\n * names one reference field must not drop another field's pending selection, so\n * fields absent from `incoming` keep their staged value.\n */\nexport function mergeStagedReferences(\n\tbase: Record<string, unknown> | undefined,\n\tincoming: StagedReferences,\n): StagedReferences {\n\treturn { ...readStagedReferences(base), ...incoming };\n}\n"],"mappings":";;;;;;AAeA,MAAM,gCAAgC;AACtC,MAAM,0BAA0B;AAChC,MAAa,8BAA8B,KAAK,MAC/C,0BAA0B,8BAC1B;AAKD,MAAM,kCAAkC,KAAK,MAC5C,0BAFyC,EAGzC;;;;;;AAuBD,SAAS,WAAW,WAA2B;AAC9C,KAAI,CAAC,OAAO,UAAU,UAAU,IAAI,YAAY,EAC/C,OAAM,IAAI,UAAU,iCAAiC,YAAY;AAElE,QAAO;;;;;;;;;;;;;;;;;;AAuER,IAAa,qBAAb,MAAgC;CAC/B,YAAY,AAAQ,IAAsB;EAAtB;;;;;;;;CAQpB,MAAM,OAAO,OAA+C;EAC3D,MAAM,KAAK,MAAM;EACjB,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;AAEpC,QAAM,KAAK,GACT,WAAW,oBAAoB,CAC/B,OAAO;GACP;GACA,MAAM,MAAM;GACZ,mBAAmB,MAAM;GACzB,kBAAkB,MAAM;GACxB,cAAc,MAAM;GACpB,aAAa,MAAM;GACnB,uBAAuB,MAAM,uBAAuB;GACpD,sBAAsB,MAAM,sBAAsB;GAClD,yBAAyB,MAAM,wBAAwB;GACvD,uBAAuB,MAAM,sBAAsB;GACnD,YAAY;GACZ,YAAY;GACZ,CAAC,CACD,SAAS;EAEX,MAAM,WAAW,MAAM,KAAK,SAAS,GAAG;AACxC,MAAI,CAAC,SAAU,OAAM,IAAI,MAAM,4BAA4B;AAC3D,SAAO;;CAGR,MAAM,SAAS,IAAsC;EACpD,MAAM,MAAM,MAAM,KAAK,GACrB,WAAW,oBAAoB,CAC/B,WAAW,CACX,MAAM,MAAM,KAAK,GAAG,CACpB,kBAAkB;AACpB,SAAO,MAAM,KAAK,cAAc,IAAI,GAAG;;;;;;;CAQxC,MAAM,WAAW,MAAwC;EACxD,MAAM,MAAM,MAAM,KAAK,GACrB,WAAW,oBAAoB,CAC/B,WAAW,CACX,MAAM,QAAQ,KAAK,KAAK,CACxB,kBAAkB;AACpB,SAAO,MAAM,KAAK,cAAc,IAAI,GAAG;;;CAIxC,MAAM,OAA4B;AAMjC,UALa,MAAM,KAAK,GACtB,WAAW,oBAAoB,CAC/B,WAAW,CACX,QAAQ,QAAQ,MAAM,CACtB,SAAS,EACC,KAAK,QAAQ,KAAK,cAAc,IAAI,CAAC;;;CAIlD,MAAM,kBAAkB,YAAyC;AAShE,UARa,MAAM,KAAK,GACtB,WAAW,oBAAoB,CAC/B,WAAW,CACX,OAAO,OACP,GAAG,GAAG,CAAC,GAAG,qBAAqB,KAAK,WAAW,EAAE,GAAG,oBAAoB,KAAK,WAAW,CAAC,CAAC,CAC1F,CACA,QAAQ,QAAQ,MAAM,CACtB,SAAS,EACC,KAAK,QAAQ,KAAK,cAAc,IAAI,CAAC;;;;;;;CAQlD,MAAM,OAAO,IAAY,OAAsD;AAE9E,MAAI,CADa,MAAM,KAAK,SAAS,GAAG,CACzB,QAAO;EAEtB,MAAM,UAAmC,EAAE;AAC3C,MAAI,MAAM,gBAAgB,OAAW,SAAQ,eAAe,MAAM;AAClE,MAAI,MAAM,eAAe,OAAW,SAAQ,cAAc,MAAM;AAChE,MAAI,MAAM,wBAAwB,OACjC,SAAQ,wBAAwB,MAAM;AAEvC,MAAI,MAAM,uBAAuB,OAChC,SAAQ,uBAAuB,MAAM;AAEtC,MAAI,MAAM,yBAAyB,OAClC,SAAQ,0BAA0B,MAAM;AAEzC,MAAI,MAAM,uBAAuB,OAChC,SAAQ,wBAAwB,MAAM;AAGvC,MAAI,OAAO,KAAK,QAAQ,CAAC,SAAS,GAAG;AACpC,WAAQ,8BAAa,IAAI,MAAM,EAAC,aAAa;AAC7C,SAAM,KAAK,GAAG,YAAY,oBAAoB,CAAC,IAAI,QAAQ,CAAC,MAAM,MAAM,KAAK,GAAG,CAAC,SAAS;;AAG3F,SAAO,KAAK,SAAS,GAAG;;;;;;CAOzB,MAAM,OAAO,IAA8B;AAE1C,MAAI,CADa,MAAM,KAAK,SAAS,GAAG,CACzB,QAAO;AAEtB,QAAM,KAAK,GAAG,WAAW,6BAA6B,CAAC,MAAM,eAAe,KAAK,GAAG,CAAC,SAAS;AAM9F,WAJe,MAAM,KAAK,GACxB,WAAW,oBAAoB,CAC/B,MAAM,MAAM,KAAK,GAAG,CACpB,kBAAkB,EACL,kBAAkB,MAAM;;;;;;;;;;;;;CAcxC,MAAc,sBACb,KACA,aACA,OACmB;EACnB,MAAM,SAAS,gBAAgB,WAAW,iBAAiB;EAC3D,MAAM,QAAQ,gBAAgB,WAAW,IAAI,eAAe,IAAI;AAWhE,WAVe,MAAM,GAAG;iBACT,IAAI,IAAI,6BAA6B,CAAC;;YAE3C,IAAI,GAAG,IAAI,IAAI,YAAY,IAAI,IAAI,aAAa,IAAI,IAAI,YAAY;YACpE,IAAI,WAAW,IAAI,IAAI,WAAW;;2BAEnB,IAAI,IAAI,6BAA6B,CAAC;0BACvC,IAAI,YAAY,OAAO,IAAI,IAAI,OAAO,CAAC,KAAK,MAAM;SACnE,MAAM;IACX,QAAQ,KAAK,GAAG,EACH,mBAAmB,MAAM;;;;;;;;;;;;;;CAezC,MAAc,YACb,MACA,aACA,OACoB;AACpB,MAAI,KAAK,WAAW,EAAG,QAAO,EAAE;AAEhC,MAAI,UAAU,MAAM;AACnB,QAAK,MAAM,YAAY,OAAO,MAAM,4BAA4B,CAE/D,OAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,OAAO,SAAS,CAChB,YAAY,OAAO,GAAG,WAAW,CAAC,CAClC,SAAS;AAEZ,UAAO,EAAE;;EAGV,MAAM,UAAoB,EAAE;AAC5B,OAAK,MAAM,OAAO,MAAM;AAGvB,OADiB,MAAM,KAAK,sBAAsB,KAAK,aAAa,MAAM,EAC5D;AACb,YAAQ,KAAK,IAAI,GAAG;AACpB;;AAED,SAAM,KAAK,gBAAgB,QAAQ;AACnC,UAAO,CAAC,gBAAgB,WAAW,IAAI,eAAe,IAAI,YAAY;;AAEvE,SAAO,EAAE;;;CAIV,MAAc,gBAAgB,KAA8B;AAC3D,OAAK,MAAM,WAAW,OAAO,KAAK,eAAe,CAEhD,OAAM,KAAK,GAAG,WAAW,6BAA6B,CAAC,MAAM,MAAM,MAAM,QAAQ,CAAC,SAAS;;;;;;;CAS7F,MAAc,gBAAgB,OAAsC;AACnE,OAAK,MAAM,aAAa,OAAO,OAAO,gCAAgC,EAAE;GAIvE,MAAM,WAAW,UAAU,KACzB,SAAS,GAAG,QAAQ,KAAK,GAAG,QAAQ,IAAI,IAAI,WAAW,KAAK,UAAU,CAAC,GACxE;AAED,SAAM,KAAK,GACT,YAAY,6BAA6B,CACzC,IAAI,EACJ,YAAY,GAAW,QAAQ,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,UAAU,GAAG,IAAI,CAAC,OAC3E,CAAC,CACD,MACA,MACA,MACA,UAAU,KAAK,SAAS,KAAK,GAAG,CAChC,CACA,SAAS;;;;;;CAOb,MAAc,kBAAkB,UAA0C;AACzE,UAAQ,MAAM,KAAK,sBAAsB,SAAS,GAAG,MAAM;;;CAI5D,MAAc,sBAAsB,UAI1B;EACT,MAAM,MAAM,MAAM,KAAK,GACrB,WAAW,oBAAoB,CAC/B,OAAO;GAAC;GAAM;GAA2B;GAAwB,CAAC,CAClE,OAAO,OAAO,GAAG,GAAG,CAAC,GAAG,MAAM,KAAK,SAAS,EAAE,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,CAC1E,kBAAkB;AACpB,MAAI,CAAC,IAAK,QAAO;AACjB,SAAO;GACN,IAAI,IAAI;GACR,sBAAsB,IAAI;GAC1B,oBAAoB,IAAI;GACxB;;CAGF,AAAQ,eAAe,KAA0D;AAChF,SAAO;GACN,IAAI,IAAI;GACR,YAAY,IAAI;GAChB,aAAa,IAAI;GACjB,YAAY,IAAI;GAChB,WAAW,IAAI;GACf;;;;;;;;;;;;CAaF,MAAM,aACL,UACA,aACA,YACA,WACgB;EAChB,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY;EAEjB,IAAI,QAAQ;AACZ,MAAI,UAAU,QAAW;GACxB,MAAM,MAAM,MAAM,KAAK,GACrB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,GAAG,GAAG,IAAI,aAAa,CAAC,GAAG,MAAM,CAAC,CACjD,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,KAAK,YAAY,CACvC,kBAAkB;AACpB,WAAQ,KAAK,QAAQ,QAAQ,KAAK,QAAQ,SAAY,IAAI,OAAO,IAAI,IAAI,GAAG;;AAG7E,QAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,OAAO;GACP,IAAI,MAAM;GACV,aAAa;GACb,cAAc;GACd,aAAa;GACb,YAAY;GACZ,6BAAY,IAAI,MAAM,EAAC,aAAa;GACpC,CAAC,CACD,YAAY,OAAO,GAAG,WAAW,CAAC,CAClC,SAAS;;;CAIZ,MAAM,gBAAgB,UAAkB,aAAqB,YAAmC;EAC/F,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY;AAEjB,QAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,KAAK,YAAY,CACvC,MAAM,eAAe,KAAK,WAAW,CACrC,SAAS;;;CAIZ,MAAM,YAAY,UAAkB,aAAkD;EACrF,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO,EAAE;AAU1B,UARa,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,KAAK,YAAY,CACvC,QAAQ,cAAc,MAAM,CAC5B,QAAQ,MAAM,MAAM,CACpB,SAAS,EACC,KAAK,QAAQ,KAAK,eAAe,IAAI,CAAC;;;;;;;;;CAUnD,MAAM,gBACL,UACA,aACA,UAA+C,EAAE,EACL;EAC5C,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO,EAAE,OAAO,EAAE,EAAE;AACrC,SAAO,KAAK,oBAAoB,YAAY,aAAa,QAAQ;;;CAIlE,MAAM,oBACL,YACA,aACA,UAA+C,EAAE,EACL;EAC5C,MAAM,QAAQ,KAAK,IAAI,QAAQ,SAAS,IAAI,IAAI;EAEhD,IAAI,QAAQ,KAAK,GACf,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,KAAK,YAAY;AAEzC,MAAI,QAAQ,QAAQ;GACnB,MAAM,UAAU,aAAa,QAAQ,OAAO;AAC5C,OAAI,QAAQ,eAAe,qBAM1B,SAAQ,MAAM,OAAO,OAAO;IAC3B,MAAM,eACL,GACE,WAAW,uCAAuC,CAClD,MAAM,sBAAsB,KAAK,WAAW,CAC5C,MAAM,uBAAuB,KAAK,YAAY,CAC9C,MAAM,sBAAsB,KAAK,QAAQ,GAAG;AAC/C,WAAO,GAAG,GAAG;KACZ,GAAG,IAAI,GAAG,OAAO,QAAQ,CAAC,OAAO,YAAY,CAAC,CAAC;KAC/C,GAAG,cAAc,KAAK,QAAQ,CAAC,OAAO,oBAAoB,CAAC;KAC3D,GAAG,IAAI,CACN,GAAG,cAAc,KAAK,QAAQ,CAAC,OAAO,oBAAoB,CAAC,EAC3D,GAAG,MAAM,KAAK,QAAQ,CAAC,OAAO,YAAY,CAAC,CAC3C,CAAC;KACF,CAAC;KACD;QACI;IACN,MAAM,YAAY,OAAO,QAAQ,WAAW;AAK5C,QAAI,CAAC,OAAO,SAAS,UAAU,CAAE,OAAM,IAAI,mBAAmB,QAAQ,OAAO;AAC7E,YAAQ,MAAM,OAAO,OACpB,GAAG,GAAG,CACL,GAAG,cAAc,KAAK,UAAU,EAChC,GAAG,IAAI,CAAC,GAAG,cAAc,KAAK,UAAU,EAAE,GAAG,MAAM,KAAK,QAAQ,GAAG,CAAC,CAAC,CACrE,CAAC,CACF;;;EAIH,MAAM,OAAO,MAAM,MACjB,QAAQ,cAAc,MAAM,CAC5B,QAAQ,MAAM,MAAM,CACpB,MAAM,QAAQ,EAAE,CAChB,SAAS;EAEX,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,QAAQ,KAAK,MAAM,GAAG,MAAM,CAAC,KAAK,QAAQ,KAAK,eAAe,IAAI,CAAC;EACzE,MAAM,SAA2C,EAAE,OAAO;EAC1D,MAAM,OAAO,MAAM,GAAG,GAAG;AACzB,MAAI,WAAW,KACd,QAAO,aAAa,aAAa,OAAO,KAAK,UAAU,EAAE,KAAK,GAAG;AAElE,SAAO;;;CAIR,MAAM,WAAW,UAAkB,YAAiD;EACnF,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO,EAAE;AAS1B,UAPa,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,eAAe,KAAK,WAAW,CACrC,QAAQ,MAAM,MAAM,CACpB,SAAS,EACC,KAAK,QAAQ,KAAK,eAAe,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAmCnD,MAAM,YACL,UACA,aACA,aACoB;EACpB,MAAM,MAAM,MAAM,KAAK,sBAAsB,SAAS;AACtD,MAAI,CAAC,IAAK,QAAO,EAAE;EAEnB,MAAM,WAAW,MAAM,KAAK,GAC1B,WAAW,6BAA6B,CACxC,OAAO;GAAC;GAAM;GAAe;GAAa,CAAC,CAC3C,MAAM,eAAe,KAAK,IAAI,GAAG,CACjC,MAAM,gBAAgB,KAAK,YAAY,CACvC,SAAS;EACX,MAAM,mBAAmB,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,YAAY,CAAC;EAGxE,MAAM,oBAAoB,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC;EACnD,MAAM,YAAY,IAAI,IAAI,kBAAkB,KAAK,YAAY,UAAU,CAAC,YAAY,MAAM,CAAC,CAAC;EAE5F,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;EACpC,MAAM,YAAY,kBAChB,KAAK,YAAY,WAAW;GAAE;GAAY;GAAO,EAAE,CACnD,QAAQ,EAAE,iBAAiB,CAAC,iBAAiB,IAAI,WAAW,CAAC,CAC7D,KAAK,EAAE,YAAY,aAAa;GAChC,IAAI,MAAM;GACV,aAAa,IAAI;GACjB,cAAc;GACd,aAAa;GACb,YAAY;GACZ,YAAY;GACZ,EAAE;EAEJ,MAAM,WAAW,MAAM,KAAK,YAAY,WAAW,SAAS,IAAI,mBAAmB;AACnF,MAAI,SAAS,SAAS,EAAG,QAAO;EAEhC,MAAM,WAAqB,EAAE;EAC7B,MAAM,cAA8B,EAAE;AACtC,OAAK,MAAM,OAAO,UAAU;GAC3B,MAAM,WAAW,UAAU,IAAI,IAAI,YAAY;AAC/C,OAAI,aAAa,OAAW,UAAS,KAAK,IAAI,GAAG;YACxC,aAAa,IAAI,WAAY,aAAY,KAAK;IAAE,IAAI,IAAI;IAAI,WAAW;IAAU,CAAC;;AAE5F,QAAM,KAAK,gBAAgB,SAAS;AACpC,QAAM,KAAK,gBAAgB,YAAY;AACvC,SAAO,EAAE;;;;;;;;;;;;;;;;;;;;;CAsBV,MAAM,WACL,UACA,YACA,cACoB;EACpB,MAAM,MAAM,MAAM,KAAK,sBAAsB,SAAS;AACtD,MAAI,CAAC,IAAK,QAAO,EAAE;EACnB,MAAM,aAAa,IAAI;EAEvB,MAAM,WAAW,MAAM,KAAK,GAC1B,WAAW,6BAA6B,CACxC,OAAO,CAAC,MAAM,eAAe,CAAC,CAC9B,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,eAAe,KAAK,WAAW,CACrC,SAAS;EACX,MAAM,kBAAkB,IAAI,IAAI,SAAS,KAAK,QAAQ,IAAI,aAAa,CAAC;EAExE,MAAM,qBAAqB,CAAC,GAAG,IAAI,IAAI,aAAa,CAAC;EACrD,MAAM,WAAW,IAAI,IAAI,mBAAmB;EAC5C,MAAM,aAAa,mBAAmB,QACpC,gBAAgB,CAAC,gBAAgB,IAAI,YAAY,CAClD;EAID,MAAM,gCAAgB,IAAI,KAAqB;AAC/C,OAAK,MAAM,cAAc,OAAO,YAAY,4BAA4B,EAAE;GAEzE,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,CAAC,gBAAgB,GAAG,GAAG,IAAI,aAAa,CAAC,GAAG,MAAM,CAAC,CAAC,CACnE,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,MAAM,WAAW,CACvC,QAAQ,eAAe,CACvB,SAAS;AACX,QAAK,MAAM,OAAO,OACjB,eAAc,IAAI,IAAI,cAAc,IAAI,QAAQ,OAAO,IAAI,OAAO,IAAI,IAAI,GAAG,EAAE;;EAIjF,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;EACpC,MAAM,YAAY,WAAW,KAAK,iBAAiB;GAClD,IAAI,MAAM;GACV,aAAa;GACb,cAAc;GACd,aAAa;GACb,YAAY,cAAc,IAAI,YAAY,IAAI;GAC9C,YAAY;GACZ,EAAE;EAEH,MAAM,WAAW,MAAM,KAAK,YAAY,WAAW,UAAU,IAAI,qBAAqB;AACtF,MAAI,SAAS,SAAS,EAAG,QAAO;AAEhC,QAAM,KAAK,gBACV,SAAS,QAAQ,QAAQ,CAAC,SAAS,IAAI,IAAI,aAAa,CAAC,CAAC,KAAK,QAAQ,IAAI,GAAG,CAC9E;AACD,SAAO,EAAE;;;;;;;;;;;;;;;;CAiBV,MAAM,gBAAgB,iBAAyB,eAA0C;EACxF,MAAM,OAAO,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,gBAAgB,KAAK,gBAAgB,CAC3C,SAAS;AACX,MAAI,KAAK,WAAW,EAAG,QAAO,EAAE;EAEhC,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;EAGpC,MAAM,6BAAa,IAAI,KAA2B;AAClD,OAAK,MAAM,OAAO,MAAM;GACvB,MAAM,SAAS,WAAW,IAAI,IAAI,YAAY,IAAI,EAAE;AACpD,UAAO,KAAK;IACX,IAAI,MAAM;IACV,aAAa,IAAI;IACjB,cAAc;IACd,aAAa,IAAI;IACjB,YAAY,IAAI;IAChB,YAAY;IACZ,CAAC;AACF,cAAW,IAAI,IAAI,aAAa,OAAO;;EAGxC,MAAM,UAAoB,EAAE;AAC5B,OAAK,MAAM,CAAC,YAAY,WAAW,YAAY;GAE9C,MAAM,MAAM,MAAM,KAAK,sBAAsB,WAAW;GAExD,MAAM,WAAW,MAAM,KAAK,YAAY,QAAQ,SAAS,KAAK,sBAAsB,KAAK;AACzF,OAAI,SAAS,SAAS,GAAG;AAGxB,UAAM,KAAK,gBAAgB,QAAQ;AACnC,WAAO;;AAER,WAAQ,KAAK,GAAG,OAAO,KAAK,SAAS,KAAK,GAAG,CAAC;;AAE/C,SAAO,EAAE;;;;;;;;;;CAWV,MAAM,kBACL,YACA,MACA,QACA,sBAC+B;EAC/B,MAAM,SAAS,SAAS,WAAW,iBAAiB;EACpD,MAAM,WAAW,SAAS,WAAW,gBAAgB;EAErD,MAAM,yBAAS,IAAI,KAAqB;AACxC,OAAK,MAAM,cAAc,OAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC,EAAE,eAAe,EAAE;GACtE,IAAI,QAAQ,KAAK,GACf,WAAW,6BAA6B,CACxC,QAAQ,OAAO,CAAC,QAAQ,GAAG,GAAG,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAC,CACtD,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,QAAQ,MAAM,WAAW;AAGjC,OAAI,yBAAyB,KAC5B,SAAQ,MAAM,MAAM,UAAU,MAAM,qBAAqB;GAG1D,MAAM,OAAO,MAAM,MAAM,QAAQ,OAAO,CAAC,SAAS;AAClD,QAAK,MAAM,OAAO,KACjB,QAAO,IAAI,IAAI,SAAS,OAAO,IAAI,MAAM,CAAC;;AAG5C,SAAO;;;;;;;;;;CAWR,MAAM,eACL,UACA,YACA,UAA+C,EAAE,EACL;EAC5C,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO,EAAE,OAAO,EAAE,EAAE;AACrC,SAAO,KAAK,mBAAmB,YAAY,YAAY,QAAQ;;;CAIhE,MAAM,mBACL,YACA,YACA,UAA+C,EAAE,EACL;EAC5C,MAAM,QAAQ,KAAK,IAAI,QAAQ,SAAS,IAAI,IAAI;EAEhD,IAAI,QAAQ,KAAK,GACf,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,eAAe,KAAK,WAAW;AAEvC,MAAI,QAAQ,QAAQ;GACnB,MAAM,UAAU,aAAa,QAAQ,OAAO;AAC5C,OAAI,QAAQ,eAAe,qBAK1B,SAAQ,MAAM,OAAO,OAAO;IAC3B,MAAM,SAAS,GACb,WAAW,uCAAuC,CAClD,MAAM,sBAAsB,KAAK,WAAW,CAC5C,MAAM,sBAAsB,KAAK,WAAW,CAC5C,MAAM,uBAAuB,KAAK,QAAQ,GAAG;AAC/C,WAAO,GAAG,GAAG,CACZ,GAAG,IAAI,GAAG,OAAO,OAAO,OAAO,YAAY,CAAC,CAAC,EAC7C,GAAG,MAAM,KAAK,OAAO,OAAO,YAAY,CAAC,CACzC,CAAC;KACD;OAEF,SAAQ,MAAM,MAAM,MAAM,KAAK,QAAQ,GAAG;;EAI5C,MAAM,OAAO,MAAM,MACjB,QAAQ,MAAM,MAAM,CACpB,MAAM,QAAQ,EAAE,CAChB,SAAS;EAEX,MAAM,UAAU,KAAK,SAAS;EAC9B,MAAM,QAAQ,KAAK,MAAM,GAAG,MAAM,CAAC,KAAK,QAAQ,KAAK,eAAe,IAAI,CAAC;EACzE,MAAM,SAA2C,EAAE,OAAO;EAC1D,MAAM,OAAO,MAAM,GAAG,GAAG;AACzB,MAAI,WAAW,KACd,QAAO,aAAa,aAAa,KAAK,IAAI,KAAK,GAAG;AAEnD,SAAO;;;;;;;;;CAUR,MAAM,wBAAwB,OAAgC;EAC7D,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,OAAO,OAAO,GAAG,GAAG,CAAC,GAAG,gBAAgB,KAAK,MAAM,EAAE,GAAG,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,CACrF,kBAAkB;AACpB,SAAO,OAAO,OAAO,kBAAkB,EAAE;;;CAI1C,MAAM,cAAc,UAAkB,aAAsC;EAC3E,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO;EACxB,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAC7C,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,KAAK,YAAY,CACvC,kBAAkB;AACpB,SAAO,OAAO,QAAQ,SAAS,EAAE;;;CAIlC,MAAM,aAAa,UAAkB,YAAqC;EACzE,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO;EACxB,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAC7C,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,eAAe,KAAK,WAAW,CACrC,kBAAkB;AACpB,SAAO,OAAO,QAAQ,SAAS,EAAE;;;;;;;;;;CAWlC,MAAM,uBAAqD;EAC1D,MAAM,OAAO,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,OAAO,CAAC,gBAAgB,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAC9D,QAAQ,cAAc,CACtB,SAAS;AACX,SAAO,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC,IAAI,aAAa,OAAO,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC;;;;;;;;CAS7E,MAAM,wBACL,UACA,cAC+B;EAC/B,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAI,aAAa,WAAW,EAAG,QAAO;EACtC,MAAM,aAAa,MAAM,KAAK,kBAAkB,SAAS;AACzD,MAAI,CAAC,WAAY,QAAO;AAExB,OAAK,MAAM,SAAS,OAAO,cAAc,eAAe,EAAE;GACzD,MAAM,OAAO,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,OAAO,CAAC,iBAAiB,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAC/D,MAAM,eAAe,KAAK,WAAW,CACrC,MAAM,gBAAgB,MAAM,MAAM,CAClC,QAAQ,eAAe,CACvB,SAAS;AACX,QAAK,MAAM,OAAO,KACjB,QAAO,IAAI,IAAI,cAAc,OAAO,IAAI,SAAS,EAAE,CAAC;;AAGtD,SAAO;;CAGR,AAAQ,cAAc,KAA0C;AAC/D,SAAO;GACN,IAAI,IAAI;GACR,MAAM,IAAI;GACV,kBAAkB,IAAI;GACtB,iBAAiB,IAAI;GACrB,aAAa,IAAI;GACjB,YAAY,IAAI;GAChB,qBAAqB,IAAI;GACzB,oBAAoB,IAAI;GACxB,sBAAsB,IAAI;GAC1B,oBAAoB,IAAI;GACxB;;;;;;;;;;;;;;;;;;;;;;;ACj9BH,MAAa,wBAAwB;;AAcrC,MAAa,uBAAuB;;AAEpC,MAAa,2BAA2B;;;;;;;;;AAgBxC,SAAgB,iBACf,QACA,UAA+C,EAAE,EAClC;CACf,MAAM,QAAQ,KAAK,IAClB,KAAK,IAAI,QAAQ,SAAS,sBAAsB,EAAE,EAClD,yBACA;CAED,IAAI,QAAQ;AACZ,KAAI,QAAQ,QAAQ;EACnB,MAAM,UAAU,aAAa,QAAQ,OAAO;AAK5C,MAAI,QAAQ,eAAe,sBAAsB;GAChD,MAAM,QAAQ,OAAO,QAAQ,QAAQ,GAAG;AACxC,OAAI,UAAU,GAAI,QAAO,EAAE,QAAQ,EAAE,EAAE;AACvC,WAAQ,QAAQ;;;CAIlB,MAAM,OAAO,OAAO,MAAM,OAAO,QAAQ,MAAM;CAC/C,MAAM,OAAO,KAAK,GAAG,GAAG;AAKxB,QAAO;EAAE,QAAQ;EAAM,YAHtB,QAAQ,QAAQ,KAAK,SAAS,OAAO,SAClC,aAAa,sBAAsB,KAAK,GACxC;EAC+B;;AAGpC,SAAS,YAAY,OAAmC;AACvD,QAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,OAAO,UAAU,OAAO,UAAU,SAAS;;;AAIjF,SAAgB,qBACf,MAC+B;CAC/B,MAAM,SAAS,OAAO;AACtB,KAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,OAAO,CAAE,QAAO;CAEnF,MAAM,SAA2B,EAAE;AACnC,MAAK,MAAM,CAAC,WAAW,WAAW,OAAO,QAAQ,OAAO,CACvD,KAAI,YAAY,OAAO,CAAE,QAAO,aAAa;AAE9C,QAAO,OAAO,KAAK,OAAO,CAAC,SAAS,IAAI,SAAS;;;;;;;AAQlD,SAAgB,sBACf,MACA,UACmB;AACnB,QAAO;EAAE,GAAG,qBAAqB,KAAK;EAAE,GAAG;EAAU"}

package/dist/state-CKouMCSY.mjs

@@ -0,0 +1,153 @@
+//#region src/plugins/state.ts
+const TIMEZONE_SUFFIX = /(?:z|[+-]\d{2}(?::?\d{2})?)$/i;
+const HOUR_OFFSET_SUFFIX = /\d{2}:\d{2}(?::\d{2}(?:\.\d+)?)?[+-]\d{2}$/i;
+function parseDatabaseTimestamp(value) {
+	let normalized = value.trim().replace(" ", "T");
+	if (HOUR_OFFSET_SUFFIX.test(normalized)) normalized += ":00";
+	else if (!TIMEZONE_SUFFIX.test(normalized)) normalized += "Z";
+	return new Date(normalized);
+}
+function toPluginStatus(value) {
+	if (value === "active") return "active";
+	return "inactive";
+}
+function toPluginSource(value) {
+	if (value === "marketplace") return "marketplace";
+	if (value === "registry") return "registry";
+	return "config";
+}
+/**
+* Repository for plugin state in the database
+*/
+var PluginStateRepository = class {
+	constructor(db) {
+		this.db = db;
+	}
+	/**
+	* Get state for a specific plugin
+	*/
+	async get(pluginId) {
+		const row = await this.db.selectFrom("_plugin_state").selectAll().where("plugin_id", "=", pluginId).executeTakeFirst();
+		if (!row) return null;
+		return rowToPluginState(row);
+	}
+	/**
+	* Get all plugin states
+	*/
+	async getAll() {
+		return (await this.db.selectFrom("_plugin_state").selectAll().execute()).map(rowToPluginState);
+	}
+	/**
+	* Get all marketplace-installed plugin states
+	*/
+	async getMarketplacePlugins() {
+		return (await this.db.selectFrom("_plugin_state").selectAll().where("source", "=", "marketplace").execute()).map(rowToPluginState);
+	}
+	/**
+	* Get all registry-installed plugin states.
+	*
+	* The runtime's registry sync path uses this to discover which
+	* registry plugins should be loaded into the sandbox on this worker.
+	*/
+	async getRegistryPlugins() {
+		return (await this.db.selectFrom("_plugin_state").selectAll().where("source", "=", "registry").execute()).map(rowToPluginState);
+	}
+	/**
+	* Create or update plugin state
+	*/
+	async upsert(pluginId, version, status, opts) {
+		const now = (/* @__PURE__ */ new Date()).toISOString();
+		const existing = await this.get(pluginId);
+		if (existing) {
+			const updates = {
+				status,
+				version
+			};
+			if (status === "active" && existing.status !== "active") updates.activated_at = now;
+			else if (status === "inactive" && existing.status !== "inactive") updates.deactivated_at = now;
+			if (opts?.source) updates.source = opts.source;
+			if (opts?.marketplaceVersion !== void 0) updates.marketplace_version = opts.marketplaceVersion;
+			if (opts?.displayName !== void 0) updates.display_name = opts.displayName;
+			if (opts?.description !== void 0) updates.description = opts.description;
+			if (opts?.registryPublisherDid !== void 0) updates.registry_publisher_did = opts.registryPublisherDid;
+			if (opts?.registrySlug !== void 0) updates.registry_slug = opts.registrySlug;
+			if (opts?.mcpToolsEnabled !== void 0) updates.mcp_tools_enabled = opts.mcpToolsEnabled ? 1 : 0;
+			if (opts?.mcpToolsConsent !== void 0) updates.mcp_tools_consent = opts.mcpToolsConsent;
+			await this.db.updateTable("_plugin_state").set(updates).where("plugin_id", "=", pluginId).execute();
+		} else await this.db.insertInto("_plugin_state").values({
+			plugin_id: pluginId,
+			status,
+			version,
+			installed_at: now,
+			activated_at: status === "active" ? now : null,
+			deactivated_at: null,
+			data: null,
+			source: opts?.source ?? "config",
+			marketplace_version: opts?.marketplaceVersion ?? null,
+			display_name: opts?.displayName ?? null,
+			description: opts?.description ?? null,
+			registry_publisher_did: opts?.registryPublisherDid ?? null,
+			registry_slug: opts?.registrySlug ?? null,
+			mcp_tools_enabled: opts?.mcpToolsEnabled ? 1 : 0,
+			mcp_tools_consent: opts?.mcpToolsConsent ?? null
+		}).execute();
+		return await this.get(pluginId);
+	}
+	async restoreIfVersion(expectedVersion, state) {
+		return ((await this.db.updateTable("_plugin_state").set({
+			version: state.version,
+			status: state.status,
+			installed_at: state.installedAt.toISOString(),
+			activated_at: state.activatedAt?.toISOString() ?? null,
+			deactivated_at: state.deactivatedAt?.toISOString() ?? null,
+			source: state.source,
+			marketplace_version: state.marketplaceVersion,
+			display_name: state.displayName,
+			description: state.description,
+			registry_publisher_did: state.registryPublisherDid,
+			registry_slug: state.registrySlug,
+			mcp_tools_enabled: state.mcpToolsEnabled ? 1 : 0,
+			mcp_tools_consent: state.mcpToolsConsent
+		}).where("plugin_id", "=", state.pluginId).where("version", "=", expectedVersion).where("source", "=", state.source).executeTakeFirst()).numUpdatedRows ?? 0n) > 0n;
+	}
+	/**
+	* Enable a plugin
+	*/
+	async enable(pluginId, version) {
+		return this.upsert(pluginId, version, "active");
+	}
+	/**
+	* Disable a plugin
+	*/
+	async disable(pluginId, version) {
+		return this.upsert(pluginId, version, "inactive");
+	}
+	/**
+	* Delete plugin state
+	*/
+	async delete(pluginId) {
+		return ((await this.db.deleteFrom("_plugin_state").where("plugin_id", "=", pluginId).executeTakeFirst()).numDeletedRows ?? 0) > 0;
+	}
+};
+function rowToPluginState(row) {
+	return {
+		pluginId: row.plugin_id,
+		status: toPluginStatus(row.status),
+		version: row.version,
+		installedAt: parseDatabaseTimestamp(row.installed_at),
+		activatedAt: row.activated_at ? parseDatabaseTimestamp(row.activated_at) : null,
+		deactivatedAt: row.deactivated_at ? parseDatabaseTimestamp(row.deactivated_at) : null,
+		source: toPluginSource(row.source),
+		marketplaceVersion: row.marketplace_version ?? null,
+		displayName: row.display_name ?? null,
+		description: row.description ?? null,
+		registryPublisherDid: row.registry_publisher_did ?? null,
+		registrySlug: row.registry_slug ?? null,
+		mcpToolsEnabled: row.mcp_tools_enabled === 1,
+		mcpToolsConsent: row.mcp_tools_consent ?? null
+	};
+}
+
+//#endregion
+export { PluginStateRepository as t };
+//# sourceMappingURL=state-CKouMCSY.mjs.map

package/dist/state-CKouMCSY.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-CKouMCSY.mjs","names":[],"sources":["../src/plugins/state.ts"],"sourcesContent":["/**\n * Plugin State Repository\n *\n * Database-backed storage for plugin activation state.\n * Used by the admin API to persist plugin enable/disable across restarts.\n */\n\nimport type { Kysely } from \"kysely\";\n\nimport type { Database } from \"../database/types.js\";\n\nexport type PluginStatus = \"active\" | \"inactive\";\nexport type PluginSource = \"config\" | \"marketplace\" | \"registry\";\n\nconst TIMEZONE_SUFFIX = /(?:z|[+-]\\d{2}(?::?\\d{2})?)$/i;\nconst HOUR_OFFSET_SUFFIX = /\\d{2}:\\d{2}(?::\\d{2}(?:\\.\\d+)?)?[+-]\\d{2}$/i;\n\nfunction parseDatabaseTimestamp(value: string): Date {\n\tlet normalized = value.trim().replace(\" \", \"T\");\n\tif (HOUR_OFFSET_SUFFIX.test(normalized)) normalized += \":00\";\n\telse if (!TIMEZONE_SUFFIX.test(normalized)) normalized += \"Z\";\n\treturn new Date(normalized);\n}\n\nfunction toPluginStatus(value: string): PluginStatus {\n\tif (value === \"active\") return \"active\";\n\treturn \"inactive\";\n}\n\nfunction toPluginSource(value: string | undefined | null): PluginSource {\n\tif (value === \"marketplace\") return \"marketplace\";\n\tif (value === \"registry\") return \"registry\";\n\treturn \"config\";\n}\n\nexport interface PluginState {\n\tpluginId: string;\n\tstatus: PluginStatus;\n\tversion: string;\n\tinstalledAt: Date;\n\tactivatedAt: Date | null;\n\tdeactivatedAt: Date | null;\n\tsource: PluginSource;\n\tmarketplaceVersion: string | null;\n\tdisplayName: string | null;\n\tdescription: string | null;\n\t/**\n\t * Publisher DID this plugin was published under. Populated only when\n\t * `source === \"registry\"`; null otherwise.\n\t */\n\tregistryPublisherDid: string | null;\n\t/**\n\t * Slug under which the plugin was published in the publisher's repo\n\t * (the rkey of the `pm.fair.package.profile` record). Populated only\n\t * when `source === \"registry\"`; null otherwise.\n\t *\n\t * The opaque `pluginId` for registry installs is derived from\n\t * `(registryPublisherDid, registrySlug)` -- see\n\t * `packages/core/src/registry/plugin-id.ts`.\n\t */\n\tregistrySlug: string | null;\n\tmcpToolsEnabled: boolean;\n\tmcpToolsConsent: string | null;\n}\n\n/**\n * Repository for plugin state in the database\n */\nexport class PluginStateRepository {\n\tconstructor(private db: Kysely<Database>) {}\n\n\t/**\n\t * Get state for a specific plugin\n\t */\n\tasync get(pluginId: string): Promise<PluginState | null> {\n\t\tconst row = await this.db\n\t\t\t.selectFrom(\"_plugin_state\")\n\t\t\t.selectAll()\n\t\t\t.where(\"plugin_id\", \"=\", pluginId)\n\t\t\t.executeTakeFirst();\n\n\t\tif (!row) return null;\n\n\t\treturn rowToPluginState(row);\n\t}\n\n\t/**\n\t * Get all plugin states\n\t */\n\tasync getAll(): Promise<PluginState[]> {\n\t\tconst rows = await this.db.selectFrom(\"_plugin_state\").selectAll().execute();\n\t\treturn rows.map(rowToPluginState);\n\t}\n\n\t/**\n\t * Get all marketplace-installed plugin states\n\t */\n\tasync getMarketplacePlugins(): Promise<PluginState[]> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_plugin_state\")\n\t\t\t.selectAll()\n\t\t\t.where(\"source\", \"=\", \"marketplace\")\n\t\t\t.execute();\n\t\treturn rows.map(rowToPluginState);\n\t}\n\n\t/**\n\t * Get all registry-installed plugin states.\n\t *\n\t * The runtime's registry sync path uses this to discover which\n\t * registry plugins should be loaded into the sandbox on this worker.\n\t */\n\tasync getRegistryPlugins(): Promise<PluginState[]> {\n\t\tconst rows = await this.db\n\t\t\t.selectFrom(\"_plugin_state\")\n\t\t\t.selectAll()\n\t\t\t.where(\"source\", \"=\", \"registry\")\n\t\t\t.execute();\n\t\treturn rows.map(rowToPluginState);\n\t}\n\n\t/**\n\t * Create or update plugin state\n\t */\n\tasync upsert(\n\t\tpluginId: string,\n\t\tversion: string,\n\t\tstatus: PluginStatus,\n\t\topts?: {\n\t\t\tsource?: PluginSource;\n\t\t\tmarketplaceVersion?: string;\n\t\t\tdisplayName?: string;\n\t\t\tdescription?: string;\n\t\t\tregistryPublisherDid?: string;\n\t\t\tregistrySlug?: string;\n\t\t\tmcpToolsEnabled?: boolean;\n\t\t\tmcpToolsConsent?: string | null;\n\t\t},\n\t): Promise<PluginState> {\n\t\tconst now = new Date().toISOString();\n\t\tconst existing = await this.get(pluginId);\n\n\t\tif (existing) {\n\t\t\t// Update existing state\n\t\t\tconst updates: Record<string, string | number | null> = {\n\t\t\t\tstatus,\n\t\t\t\tversion,\n\t\t\t};\n\n\t\t\tif (status === \"active\" && existing.status !== \"active\") {\n\t\t\t\tupdates.activated_at = now;\n\t\t\t} else if (status === \"inactive\" && existing.status !== \"inactive\") {\n\t\t\t\tupdates.deactivated_at = now;\n\t\t\t}\n\n\t\t\tif (opts?.source) updates.source = opts.source;\n\t\t\tif (opts?.marketplaceVersion !== undefined) {\n\t\t\t\tupdates.marketplace_version = opts.marketplaceVersion;\n\t\t\t}\n\t\t\tif (opts?.displayName !== undefined) {\n\t\t\t\tupdates.display_name = opts.displayName;\n\t\t\t}\n\t\t\tif (opts?.description !== undefined) {\n\t\t\t\tupdates.description = opts.description;\n\t\t\t}\n\t\t\tif (opts?.registryPublisherDid !== undefined) {\n\t\t\t\tupdates.registry_publisher_did = opts.registryPublisherDid;\n\t\t\t}\n\t\t\tif (opts?.registrySlug !== undefined) {\n\t\t\t\tupdates.registry_slug = opts.registrySlug;\n\t\t\t}\n\t\t\tif (opts?.mcpToolsEnabled !== undefined) {\n\t\t\t\tupdates.mcp_tools_enabled = opts.mcpToolsEnabled ? 1 : 0;\n\t\t\t}\n\t\t\tif (opts?.mcpToolsConsent !== undefined) {\n\t\t\t\tupdates.mcp_tools_consent = opts.mcpToolsConsent;\n\t\t\t}\n\n\t\t\tawait this.db\n\t\t\t\t.updateTable(\"_plugin_state\")\n\t\t\t\t.set(updates)\n\t\t\t\t.where(\"plugin_id\", \"=\", pluginId)\n\t\t\t\t.execute();\n\t\t} else {\n\t\t\t// Create new state\n\t\t\tawait this.db\n\t\t\t\t.insertInto(\"_plugin_state\")\n\t\t\t\t.values({\n\t\t\t\t\tplugin_id: pluginId,\n\t\t\t\t\tstatus,\n\t\t\t\t\tversion,\n\t\t\t\t\tinstalled_at: now,\n\t\t\t\t\tactivated_at: status === \"active\" ? now : null,\n\t\t\t\t\tdeactivated_at: null,\n\t\t\t\t\tdata: null,\n\t\t\t\t\tsource: opts?.source ?? \"config\",\n\t\t\t\t\tmarketplace_version: opts?.marketplaceVersion ?? null,\n\t\t\t\t\tdisplay_name: opts?.displayName ?? null,\n\t\t\t\t\tdescription: opts?.description ?? null,\n\t\t\t\t\tregistry_publisher_did: opts?.registryPublisherDid ?? null,\n\t\t\t\t\tregistry_slug: opts?.registrySlug ?? null,\n\t\t\t\t\tmcp_tools_enabled: opts?.mcpToolsEnabled ? 1 : 0,\n\t\t\t\t\tmcp_tools_consent: opts?.mcpToolsConsent ?? null,\n\t\t\t\t})\n\t\t\t\t.execute();\n\t\t}\n\n\t\treturn (await this.get(pluginId))!;\n\t}\n\n\tasync restoreIfVersion(expectedVersion: string, state: PluginState): Promise<boolean> {\n\t\tconst result = await this.db\n\t\t\t.updateTable(\"_plugin_state\")\n\t\t\t.set({\n\t\t\t\tversion: state.version,\n\t\t\t\tstatus: state.status,\n\t\t\t\tinstalled_at: state.installedAt.toISOString(),\n\t\t\t\tactivated_at: state.activatedAt?.toISOString() ?? null,\n\t\t\t\tdeactivated_at: state.deactivatedAt?.toISOString() ?? null,\n\t\t\t\tsource: state.source,\n\t\t\t\tmarketplace_version: state.marketplaceVersion,\n\t\t\t\tdisplay_name: state.displayName,\n\t\t\t\tdescription: state.description,\n\t\t\t\tregistry_publisher_did: state.registryPublisherDid,\n\t\t\t\tregistry_slug: state.registrySlug,\n\t\t\t\tmcp_tools_enabled: state.mcpToolsEnabled ? 1 : 0,\n\t\t\t\tmcp_tools_consent: state.mcpToolsConsent,\n\t\t\t})\n\t\t\t.where(\"plugin_id\", \"=\", state.pluginId)\n\t\t\t.where(\"version\", \"=\", expectedVersion)\n\t\t\t.where(\"source\", \"=\", state.source)\n\t\t\t.executeTakeFirst();\n\n\t\treturn (result.numUpdatedRows ?? 0n) > 0n;\n\t}\n\n\t/**\n\t * Enable a plugin\n\t */\n\tasync enable(pluginId: string, version: string): Promise<PluginState> {\n\t\treturn this.upsert(pluginId, version, \"active\");\n\t}\n\n\t/**\n\t * Disable a plugin\n\t */\n\tasync disable(pluginId: string, version: string): Promise<PluginState> {\n\t\treturn this.upsert(pluginId, version, \"inactive\");\n\t}\n\n\t/**\n\t * Delete plugin state\n\t */\n\tasync delete(pluginId: string): Promise<boolean> {\n\t\tconst result = await this.db\n\t\t\t.deleteFrom(\"_plugin_state\")\n\t\t\t.where(\"plugin_id\", \"=\", pluginId)\n\t\t\t.executeTakeFirst();\n\n\t\treturn (result.numDeletedRows ?? 0) > 0;\n\t}\n}\n\n/**\n * Internal: map a `_plugin_state` row to the public `PluginState` shape.\n *\n * Kept at module scope so the three select paths (`get`, `getAll`,\n * `getMarketplacePlugins`, `getRegistryPlugins`) stay byte-identical in\n * their handling of nullable columns -- adding a new column to the table\n * means changing this function and nothing else.\n */\ninterface PluginStateRow {\n\tplugin_id: string;\n\tstatus: string;\n\tversion: string;\n\tinstalled_at: string;\n\tactivated_at: string | null;\n\tdeactivated_at: string | null;\n\tsource: string;\n\tmarketplace_version: string | null;\n\tdisplay_name: string | null;\n\tdescription: string | null;\n\tregistry_publisher_did: string | null;\n\tregistry_slug: string | null;\n\tmcp_tools_enabled: number;\n\tmcp_tools_consent: string | null;\n}\n\nfunction rowToPluginState(row: PluginStateRow): PluginState {\n\treturn {\n\t\tpluginId: row.plugin_id,\n\t\tstatus: toPluginStatus(row.status),\n\t\tversion: row.version,\n\t\tinstalledAt: parseDatabaseTimestamp(row.installed_at),\n\t\tactivatedAt: row.activated_at ? parseDatabaseTimestamp(row.activated_at) : null,\n\t\tdeactivatedAt: row.deactivated_at ? parseDatabaseTimestamp(row.deactivated_at) : null,\n\t\tsource: toPluginSource(row.source),\n\t\tmarketplaceVersion: row.marketplace_version ?? null,\n\t\tdisplayName: row.display_name ?? null,\n\t\tdescription: row.description ?? null,\n\t\tregistryPublisherDid: row.registry_publisher_did ?? null,\n\t\tregistrySlug: row.registry_slug ?? null,\n\t\tmcpToolsEnabled: row.mcp_tools_enabled === 1,\n\t\tmcpToolsConsent: row.mcp_tools_consent ?? null,\n\t};\n}\n"],"mappings":";AAcA,MAAM,kBAAkB;AACxB,MAAM,qBAAqB;AAE3B,SAAS,uBAAuB,OAAqB;CACpD,IAAI,aAAa,MAAM,MAAM,CAAC,QAAQ,KAAK,IAAI;AAC/C,KAAI,mBAAmB,KAAK,WAAW,CAAE,eAAc;UAC9C,CAAC,gBAAgB,KAAK,WAAW,CAAE,eAAc;AAC1D,QAAO,IAAI,KAAK,WAAW;;AAG5B,SAAS,eAAe,OAA6B;AACpD,KAAI,UAAU,SAAU,QAAO;AAC/B,QAAO;;AAGR,SAAS,eAAe,OAAgD;AACvE,KAAI,UAAU,cAAe,QAAO;AACpC,KAAI,UAAU,WAAY,QAAO;AACjC,QAAO;;;;;AAoCR,IAAa,wBAAb,MAAmC;CAClC,YAAY,AAAQ,IAAsB;EAAtB;;;;;CAKpB,MAAM,IAAI,UAA+C;EACxD,MAAM,MAAM,MAAM,KAAK,GACrB,WAAW,gBAAgB,CAC3B,WAAW,CACX,MAAM,aAAa,KAAK,SAAS,CACjC,kBAAkB;AAEpB,MAAI,CAAC,IAAK,QAAO;AAEjB,SAAO,iBAAiB,IAAI;;;;;CAM7B,MAAM,SAAiC;AAEtC,UADa,MAAM,KAAK,GAAG,WAAW,gBAAgB,CAAC,WAAW,CAAC,SAAS,EAChE,IAAI,iBAAiB;;;;;CAMlC,MAAM,wBAAgD;AAMrD,UALa,MAAM,KAAK,GACtB,WAAW,gBAAgB,CAC3B,WAAW,CACX,MAAM,UAAU,KAAK,cAAc,CACnC,SAAS,EACC,IAAI,iBAAiB;;;;;;;;CASlC,MAAM,qBAA6C;AAMlD,UALa,MAAM,KAAK,GACtB,WAAW,gBAAgB,CAC3B,WAAW,CACX,MAAM,UAAU,KAAK,WAAW,CAChC,SAAS,EACC,IAAI,iBAAiB;;;;;CAMlC,MAAM,OACL,UACA,SACA,QACA,MAUuB;EACvB,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;EACpC,MAAM,WAAW,MAAM,KAAK,IAAI,SAAS;AAEzC,MAAI,UAAU;GAEb,MAAM,UAAkD;IACvD;IACA;IACA;AAED,OAAI,WAAW,YAAY,SAAS,WAAW,SAC9C,SAAQ,eAAe;YACb,WAAW,cAAc,SAAS,WAAW,WACvD,SAAQ,iBAAiB;AAG1B,OAAI,MAAM,OAAQ,SAAQ,SAAS,KAAK;AACxC,OAAI,MAAM,uBAAuB,OAChC,SAAQ,sBAAsB,KAAK;AAEpC,OAAI,MAAM,gBAAgB,OACzB,SAAQ,eAAe,KAAK;AAE7B,OAAI,MAAM,gBAAgB,OACzB,SAAQ,cAAc,KAAK;AAE5B,OAAI,MAAM,yBAAyB,OAClC,SAAQ,yBAAyB,KAAK;AAEvC,OAAI,MAAM,iBAAiB,OAC1B,SAAQ,gBAAgB,KAAK;AAE9B,OAAI,MAAM,oBAAoB,OAC7B,SAAQ,oBAAoB,KAAK,kBAAkB,IAAI;AAExD,OAAI,MAAM,oBAAoB,OAC7B,SAAQ,oBAAoB,KAAK;AAGlC,SAAM,KAAK,GACT,YAAY,gBAAgB,CAC5B,IAAI,QAAQ,CACZ,MAAM,aAAa,KAAK,SAAS,CACjC,SAAS;QAGX,OAAM,KAAK,GACT,WAAW,gBAAgB,CAC3B,OAAO;GACP,WAAW;GACX;GACA;GACA,cAAc;GACd,cAAc,WAAW,WAAW,MAAM;GAC1C,gBAAgB;GAChB,MAAM;GACN,QAAQ,MAAM,UAAU;GACxB,qBAAqB,MAAM,sBAAsB;GACjD,cAAc,MAAM,eAAe;GACnC,aAAa,MAAM,eAAe;GAClC,wBAAwB,MAAM,wBAAwB;GACtD,eAAe,MAAM,gBAAgB;GACrC,mBAAmB,MAAM,kBAAkB,IAAI;GAC/C,mBAAmB,MAAM,mBAAmB;GAC5C,CAAC,CACD,SAAS;AAGZ,SAAQ,MAAM,KAAK,IAAI,SAAS;;CAGjC,MAAM,iBAAiB,iBAAyB,OAAsC;AAuBrF,WAtBe,MAAM,KAAK,GACxB,YAAY,gBAAgB,CAC5B,IAAI;GACJ,SAAS,MAAM;GACf,QAAQ,MAAM;GACd,cAAc,MAAM,YAAY,aAAa;GAC7C,cAAc,MAAM,aAAa,aAAa,IAAI;GAClD,gBAAgB,MAAM,eAAe,aAAa,IAAI;GACtD,QAAQ,MAAM;GACd,qBAAqB,MAAM;GAC3B,cAAc,MAAM;GACpB,aAAa,MAAM;GACnB,wBAAwB,MAAM;GAC9B,eAAe,MAAM;GACrB,mBAAmB,MAAM,kBAAkB,IAAI;GAC/C,mBAAmB,MAAM;GACzB,CAAC,CACD,MAAM,aAAa,KAAK,MAAM,SAAS,CACvC,MAAM,WAAW,KAAK,gBAAgB,CACtC,MAAM,UAAU,KAAK,MAAM,OAAO,CAClC,kBAAkB,EAEL,kBAAkB,MAAM;;;;;CAMxC,MAAM,OAAO,UAAkB,SAAuC;AACrE,SAAO,KAAK,OAAO,UAAU,SAAS,SAAS;;;;;CAMhD,MAAM,QAAQ,UAAkB,SAAuC;AACtE,SAAO,KAAK,OAAO,UAAU,SAAS,WAAW;;;;;CAMlD,MAAM,OAAO,UAAoC;AAMhD,WALe,MAAM,KAAK,GACxB,WAAW,gBAAgB,CAC3B,MAAM,aAAa,KAAK,SAAS,CACjC,kBAAkB,EAEL,kBAAkB,KAAK;;;AA6BxC,SAAS,iBAAiB,KAAkC;AAC3D,QAAO;EACN,UAAU,IAAI;EACd,QAAQ,eAAe,IAAI,OAAO;EAClC,SAAS,IAAI;EACb,aAAa,uBAAuB,IAAI,aAAa;EACrD,aAAa,IAAI,eAAe,uBAAuB,IAAI,aAAa,GAAG;EAC3E,eAAe,IAAI,iBAAiB,uBAAuB,IAAI,eAAe,GAAG;EACjF,QAAQ,eAAe,IAAI,OAAO;EAClC,oBAAoB,IAAI,uBAAuB;EAC/C,aAAa,IAAI,gBAAgB;EACjC,aAAa,IAAI,eAAe;EAChC,sBAAsB,IAAI,0BAA0B;EACpD,cAAc,IAAI,iBAAiB;EACnC,iBAAiB,IAAI,sBAAsB;EAC3C,iBAAiB,IAAI,qBAAqB;EAC1C"}

package/dist/status-lzyj4Uu7.mjs

@@ -0,0 +1,30 @@
+//#region src/redirects/status.ts
+/**
+* Redirect rule status codes.
+*
+* A redirect rule's `type` is either a *redirect* status (issues a `Location`
+* header) or a *terminal* status (serves the status with no target). Terminal
+* statuses let editors mark a URL as intentionally gone:
+* - `410 Gone` — permanently and intentionally deleted (Google deindexes it
+*   faster than a 404).
+* - `451 Unavailable For Legal Reasons`.
+*/
+/** Statuses that issue an HTTP redirect (require a destination). */
+const REDIRECT_STATUSES = [
+	301,
+	302,
+	307,
+	308
+];
+/** Terminal statuses that serve a status with no `Location` / no destination. */
+const TERMINAL_STATUSES = [410, 451];
+/** All values accepted as a redirect rule `type`. */
+const REDIRECT_RULE_STATUSES = [...REDIRECT_STATUSES, ...TERMINAL_STATUSES];
+/** True for terminal statuses (410/451) — served directly, with no target. */
+function isTerminalStatus(type) {
+	return TERMINAL_STATUSES.includes(type);
+}
+
+//#endregion
+export { isTerminalStatus as n, REDIRECT_RULE_STATUSES as t };
+//# sourceMappingURL=status-lzyj4Uu7.mjs.map

package/dist/status-lzyj4Uu7.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"status-lzyj4Uu7.mjs","names":[],"sources":["../src/redirects/status.ts"],"sourcesContent":["/**\n * Redirect rule status codes.\n *\n * A redirect rule's `type` is either a *redirect* status (issues a `Location`\n * header) or a *terminal* status (serves the status with no target). Terminal\n * statuses let editors mark a URL as intentionally gone:\n * - `410 Gone` — permanently and intentionally deleted (Google deindexes it\n *   faster than a 404).\n * - `451 Unavailable For Legal Reasons`.\n */\n\n/** Statuses that issue an HTTP redirect (require a destination). */\nexport const REDIRECT_STATUSES = [301, 302, 307, 308] as const;\n\n/** Terminal statuses that serve a status with no `Location` / no destination. */\nexport const TERMINAL_STATUSES = [410, 451] as const;\n\n/** All values accepted as a redirect rule `type`. */\nexport const REDIRECT_RULE_STATUSES: readonly number[] = [\n\t...REDIRECT_STATUSES,\n\t...TERMINAL_STATUSES,\n];\n\n/** True for terminal statuses (410/451) — served directly, with no target. */\nexport function isTerminalStatus(type: number): boolean {\n\treturn (TERMINAL_STATUSES as readonly number[]).includes(type);\n}\n"],"mappings":";;;;;;;;;;;;AAYA,MAAa,oBAAoB;CAAC;CAAK;CAAK;CAAK;CAAI;;AAGrD,MAAa,oBAAoB,CAAC,KAAK,IAAI;;AAG3C,MAAa,yBAA4C,CACxD,GAAG,mBACH,GAAG,kBACH;;AAGD,SAAgB,iBAAiB,MAAuB;AACvD,QAAQ,kBAAwC,SAAS,KAAK"}

package/dist/storage/local.d.mts

@@ -1,4 +1,4 @@
-import { a as ListOptions, d as Storage, l as SignedUploadOptions, n as DownloadResult, o as ListResult, p as UploadResult, s as LocalStorageConfig, u as SignedUploadUrl } from "../types-DA1Te3Oy.mjs";
+import { a as ListOptions, d as Storage, l as SignedUploadOptions, n as DownloadResult, o as ListResult, p as UploadResult, s as LocalStorageConfig, u as SignedUploadUrl } from "../types-BYEk7qo3.mjs";
 
 //#region src/storage/local.d.ts
 /**

package/dist/storage/local.mjs

@@ -1,4 +1,4 @@
-import { t as EmDashStorageError } from "../types-VT4-BugW.mjs";
+import { t as EmDashStorageError } from "../types-ILDI1sdY.mjs";
 import mime from "mime/lite";
 import * as fs from "node:fs/promises";
 import * as path from "node:path";

package/dist/storage/s3.d.mts

@@ -1,4 +1,4 @@
-import { a as ListOptions, c as S3StorageConfig, d as Storage, l as SignedUploadOptions, n as DownloadResult, o as ListResult, p as UploadResult, u as SignedUploadUrl } from "../types-DA1Te3Oy.mjs";
+import { a as ListOptions, c as S3StorageConfig, d as Storage, l as SignedUploadOptions, n as DownloadResult, o as ListResult, p as UploadResult, u as SignedUploadUrl } from "../types-BYEk7qo3.mjs";
 
 //#region src/storage/s3.d.ts
 /**

package/dist/storage/s3.mjs

@@ -1,4 +1,4 @@
-import { t as EmDashStorageError } from "../types-VT4-BugW.mjs";
+import { t as EmDashStorageError } from "../types-ILDI1sdY.mjs";
 import { z } from "zod";
 import { DeleteObjectCommand, GetObjectCommand, HeadObjectCommand, ListObjectsV2Command, PutObjectCommand, S3Client } from "@aws-sdk/client-s3";
 import { getSignedUrl } from "@aws-sdk/s3-request-presigner";