emdash 0.40.0 → 0.41.0

package/dist/relations-Cfaa1fDl.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"relations-Cfaa1fDl.mjs","names":["isRecord"],"sources":["../src/api/handlers/validate-references.ts","../src/api/handlers/relations.ts"],"sourcesContent":["import type { Kysely } from \"kysely\";\n\nimport type { Database } from \"../../database/types.js\";\nimport { requestCached } from \"../../request-cache.js\";\nimport type { ApiResult } from \"../types.js\";\n\nexport interface ReferenceFieldConstraints {\n\t/** Field slug — how the entry API addresses the selection. */\n\tslug: string;\n\t/** Relation slug the field binds to. */\n\trelation: string;\n\t/** Relation id, for the reads that address the link table directly. */\n\trelationId: string | null;\n\t/** Which end of the relation the field's own collection sits on. */\n\trelationSide: \"parent\" | \"child\";\n\t/** How many entries this side of the relation may hold. `null` is unlimited. */\n\tmaxSelected: number | null;\n\t/** How many this field's selection may hand each entry it selects. */\n\tmaxOpposite: number | null;\n\trequired: boolean;\n}\n\nfunction validationError(message: string): ApiResult<never> {\n\treturn { success: false, error: { code: \"VALIDATION_ERROR\", message } };\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null;\n}\n\n/**\n * Every reference field on a collection that is bound to a relation, by field\n * slug — the key the entry API takes a selection under.\n */\nexport function referenceFieldConstraints(\n\tdb: Kysely<Database>,\n\tcollection: string,\n): Promise<Map<string, ReferenceFieldConstraints>> {\n\treturn requestCached(`reference-field-constraints:${collection}`, async () => {\n\t\tconst fields = await db\n\t\t\t.selectFrom(\"_emdash_fields\")\n\t\t\t.innerJoin(\"_emdash_collections\", \"_emdash_collections.id\", \"_emdash_fields.collection_id\")\n\t\t\t.select([\"_emdash_fields.slug\", \"_emdash_fields.required\", \"_emdash_fields.validation\"])\n\t\t\t.where(\"_emdash_collections.slug\", \"=\", collection)\n\t\t\t.where(\"_emdash_fields.type\", \"=\", \"reference\")\n\t\t\t.execute();\n\n\t\t// Cardinality lives on the relation, not the field: with both ends of a\n\t\t// relation bindable, two fields carrying their own limits could disagree\n\t\t// about one edge set. The field contributes only which end it views.\n\t\tconst relations = await db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.select([\"id\", \"slug\", \"max_children_per_parent\", \"max_parents_per_child\"])\n\t\t\t.execute();\n\t\tconst limits = new Map(relations.map((r) => [r.slug, r]));\n\n\t\tconst constraints = new Map<string, ReferenceFieldConstraints>();\n\t\tfor (const field of fields) {\n\t\t\tif (!field.validation) continue;\n\n\t\t\tlet parsed: unknown;\n\t\t\ttry {\n\t\t\t\tparsed = JSON.parse(field.validation);\n\t\t\t} catch {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!isRecord(parsed) || typeof parsed.relation !== \"string\") continue;\n\n\t\t\tconst relation = limits.get(parsed.relation);\n\t\t\tconst relationSide = parsed.relationSide === \"child\" ? \"child\" : \"parent\";\n\t\t\tconst onChildSide = relationSide === \"child\";\n\n\t\t\tconstraints.set(field.slug, {\n\t\t\t\tslug: field.slug,\n\t\t\t\trelation: parsed.relation,\n\t\t\t\trelationId: relation?.id ?? null,\n\t\t\t\trelationSide,\n\t\t\t\tmaxSelected: onChildSide\n\t\t\t\t\t? (relation?.max_parents_per_child ?? null)\n\t\t\t\t\t: (relation?.max_children_per_parent ?? null),\n\t\t\t\tmaxOpposite: onChildSide\n\t\t\t\t\t? (relation?.max_children_per_parent ?? null)\n\t\t\t\t\t: (relation?.max_parents_per_child ?? null),\n\t\t\t\trequired: field.required === 1,\n\t\t\t});\n\t\t}\n\t\treturn constraints;\n\t});\n}\n\n/**\n * The field viewing one end of a relation, for the relation-scoped routes, which\n * address a relation rather than a field. At most one field binds each\n * (relation, side), so this is unambiguous.\n */\nexport function constraintsForRelationSide(\n\tconstraints: Map<string, ReferenceFieldConstraints>,\n\trelation: string,\n\tside: \"parent\" | \"child\",\n): ReferenceFieldConstraints | undefined {\n\tfor (const field of constraints.values()) {\n\t\tif (field.relation === relation && field.relationSide === side) return field;\n\t}\n\treturn undefined;\n}\n\nexport function validateReferenceSelection(\n\tconstraints: ReferenceFieldConstraints,\n\tchildIds: string[],\n): ApiResult<true> {\n\tconst max = constraints.maxSelected;\n\tif (max !== null && childIds.length > max) {\n\t\treturn validationError(\n\t\t\tmax === 1\n\t\t\t\t? `Field '${constraints.slug}' accepts a single reference, received ${childIds.length}.`\n\t\t\t\t: `Field '${constraints.slug}' accepts at most ${max} references, received ${childIds.length}.`,\n\t\t);\n\t}\n\tif (constraints.required && childIds.length === 0) {\n\t\treturn validationError(\n\t\t\t`Field '${constraints.slug}' is required and must reference at least one entry.`,\n\t\t);\n\t}\n\treturn { success: true, data: true };\n}\n\nexport async function validateRequiredReferencesPresent(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\treferences: Record<string, string[]> | undefined,\n\ttranslationOf: string | undefined,\n): Promise<ApiResult<true>> {\n\t// References belong to a translation group, so a new locale row inherits\n\t// the source group's existing edges when its payload omits them.\n\tif (translationOf) return { success: true, data: true };\n\n\tconst constraints = await referenceFieldConstraints(db, collection);\n\tfor (const field of constraints.values()) {\n\t\tif (!field.required) continue;\n\t\tif (references && Object.hasOwn(references, field.slug)) continue;\n\t\treturn validationError(\n\t\t\t`Field '${field.slug}' is required and must reference at least one entry.`,\n\t\t);\n\t}\n\treturn { success: true, data: true };\n}\n","import type { Kysely } from \"kysely\";\n\nimport { ContentRepository } from \"../../database/repositories/content.js\";\nimport {\n\tRelationRepository,\n\ttype ContentReference,\n\ttype CreateRelationInput,\n\ttype Relation,\n\ttype UpdateRelationInput,\n} from \"../../database/repositories/relation.js\";\nimport { RevisionRepository } from \"../../database/repositories/revision.js\";\nimport { InvalidCursorError } from \"../../database/repositories/types.js\";\nimport type { ContentItem } from \"../../database/repositories/types.js\";\nimport { withTransaction } from \"../../database/transaction.js\";\nimport type { Database } from \"../../database/types.js\";\nimport { invalidateCollectionCache } from \"../../object-cache/index.js\";\nimport {\n\tpageStagedGroups,\n\treadStagedReferences,\n\ttype PageOfGroups,\n} from \"../../references/staged.js\";\nimport { requestCached } from \"../../request-cache.js\";\nimport { invalidateSchemaCache } from \"../../schema/index.js\";\nimport { SchemaRegistry } from \"../../schema/registry.js\";\nimport type { ApiResult } from \"../types.js\";\nimport {\n\tconstraintsForRelationSide,\n\treferenceFieldConstraints,\n\tvalidateReferenceSelection,\n\ttype ReferenceFieldConstraints,\n} from \"./validate-references.js\";\n\n/** Map an edge-read failure: a bad pagination cursor is a 400 client error,\n * everything else is the generic 500-shaped reference-read error. */\nfunction referencesGetError(error: unknown): ApiResult<never> {\n\tif (error instanceof InvalidCursorError) {\n\t\treturn { success: false, error: { code: \"INVALID_CURSOR\", message: error.message } };\n\t}\n\treturn {\n\t\tsuccess: false,\n\t\terror: { code: \"REFERENCES_GET_ERROR\", message: \"Failed to get references\" },\n\t};\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null;\n}\n\n/** True for SQLite UNIQUE / Postgres unique_violation messages (matches the\n * fingerprint used in the content handlers). Narrow enough not to catch NOT\n * NULL / CHECK violations whose messages also say \"constraint\". */\nfunction isUniqueViolation(error: unknown): boolean {\n\tconst message = error instanceof Error ? error.message.toLowerCase() : \"\";\n\treturn message.includes(\"unique constraint failed\") || message.includes(\"duplicate key\");\n}\n\nexport async function handleRelationCreate(\n\tdb: Kysely<Database>,\n\tinput: CreateRelationInput,\n): Promise<ApiResult<{ relation: Relation }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\n\t\t// Invariant: a relation must point at collections that exist. There is no\n\t\t// SQL FK (the edge endpoints are content translation_groups, which\n\t\t// precludes one), so a ghost collection would yield a\n\t\t// structurally-valid-but-permanently-useless relation.\n\t\tconst registry = new SchemaRegistry(db);\n\t\tfor (const collection of [input.parentCollection, input.childCollection]) {\n\t\t\tif (!(await registry.getCollection(collection))) {\n\t\t\t\treturn {\n\t\t\t\t\tsuccess: false,\n\t\t\t\t\terror: {\n\t\t\t\t\t\tcode: \"COLLECTION_NOT_FOUND\",\n\t\t\t\t\t\tmessage: `Collection '${collection}' not found`,\n\t\t\t\t\t},\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\tconst relation = await repo.create(input);\n\t\treturn { success: true, data: { relation } };\n\t} catch (error) {\n\t\tif (isUniqueViolation(error)) {\n\t\t\treturn {\n\t\t\t\tsuccess: false,\n\t\t\t\terror: {\n\t\t\t\t\tcode: \"CONFLICT\",\n\t\t\t\t\tmessage: \"A relation with this slug already exists\",\n\t\t\t\t},\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: { code: \"RELATION_CREATE_ERROR\", message: \"Failed to create relation\" },\n\t\t};\n\t}\n}\n\n/**\n * A relation plus what deleting it would take with it: the reference fields\n * that view it, and how many links it holds. Both delete dialogs enumerate\n * these before the user confirms.\n */\nexport interface RelationWithUsage extends Relation {\n\tboundFields: BoundField[];\n\tlinkCount: number;\n}\n\nexport async function handleRelationGet(\n\tdb: Kysely<Database>,\n\tid: string,\n): Promise<ApiResult<{ relation: RelationWithUsage }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst relation = await repo.findById(id);\n\t\tif (!relation) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\t}\n\t\tconst [boundFields, edgeCounts] = await Promise.all([\n\t\t\tfieldsBoundToRelation(db, relation.slug),\n\t\t\trepo.countEdgesByRelation(),\n\t\t]);\n\t\treturn {\n\t\t\tsuccess: true,\n\t\t\tdata: { relation: { ...relation, boundFields, linkCount: edgeCounts.get(relation.id) ?? 0 } },\n\t\t};\n\t} catch {\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: { code: \"RELATION_GET_ERROR\", message: \"Failed to get relation\" },\n\t\t};\n\t}\n}\n\n/**\n * List relations, optionally only those `collection` takes part in.\n *\n * The admin's relation picker filters this way: a reference field can only bind\n * to a relation with its own collection on one end.\n */\nexport async function handleRelationList(\n\tdb: Kysely<Database>,\n\topts: { collection?: string } = {},\n): Promise<ApiResult<{ relations: RelationWithUsage[] }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst [relations, boundByRelation, edgeCounts] = await Promise.all([\n\t\t\topts.collection ? repo.findForCollection(opts.collection) : repo.list(),\n\t\t\tfieldsBoundByRelation(db),\n\t\t\trepo.countEdgesByRelation(),\n\t\t]);\n\t\treturn {\n\t\t\tsuccess: true,\n\t\t\tdata: {\n\t\t\t\trelations: relations.map((relation) => ({\n\t\t\t\t\t...relation,\n\t\t\t\t\tboundFields: boundByRelation.get(relation.slug) ?? [],\n\t\t\t\t\tlinkCount: edgeCounts.get(relation.id) ?? 0,\n\t\t\t\t})),\n\t\t\t},\n\t\t};\n\t} catch {\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: { code: \"RELATION_LIST_ERROR\", message: \"Failed to list relations\" },\n\t\t};\n\t}\n}\n\nexport async function handleRelationUpdate(\n\tdb: Kysely<Database>,\n\tid: string,\n\tinput: UpdateRelationInput,\n): Promise<ApiResult<{ relation: Relation }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst relation = await repo.update(id, input);\n\t\tif (!relation) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\t}\n\t\treturn { success: true, data: { relation } };\n\t} catch {\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: { code: \"RELATION_UPDATE_ERROR\", message: \"Failed to update relation\" },\n\t\t};\n\t}\n}\n\n/** A reference field that views a relation, and which end it views it from. */\nexport interface BoundField {\n\tcollectionSlug: string;\n\tfieldSlug: string;\n\tside: \"parent\" | \"child\";\n}\n\n/**\n * Every reference field on the site, grouped by the slug of the relation it\n * binds.\n *\n * Filtered in JS rather than through `json_extract`: `_emdash_fields` holds one\n * row per field on the whole site, and the reference-typed subset of that is\n * small enough that a scan beats a dialect-specific JSON path. Grouping the\n * whole set in one pass also keeps the relations list to a single scan instead\n * of one per row.\n */\nexport async function fieldsBoundByRelation(\n\tdb: Kysely<Database>,\n): Promise<Map<string, BoundField[]>> {\n\tconst rows = await db\n\t\t.selectFrom(\"_emdash_fields\")\n\t\t.innerJoin(\"_emdash_collections\", \"_emdash_collections.id\", \"_emdash_fields.collection_id\")\n\t\t.select([\n\t\t\t\"_emdash_fields.slug as fieldSlug\",\n\t\t\t\"_emdash_collections.slug as collectionSlug\",\n\t\t\t\"_emdash_fields.validation as validation\",\n\t\t])\n\t\t.where(\"_emdash_fields.type\", \"=\", \"reference\")\n\t\t.execute();\n\n\tconst byRelation = new Map<string, BoundField[]>();\n\tfor (const row of rows) {\n\t\tif (!row.validation) continue;\n\t\tlet parsed: unknown;\n\t\ttry {\n\t\t\tparsed = JSON.parse(row.validation);\n\t\t} catch {\n\t\t\tcontinue;\n\t\t}\n\t\tif (!isRecord(parsed) || typeof parsed.relation !== \"string\") continue;\n\t\tconst bound: BoundField = {\n\t\t\tcollectionSlug: row.collectionSlug,\n\t\t\tfieldSlug: row.fieldSlug,\n\t\t\tside: parsed.relationSide === \"child\" ? \"child\" : \"parent\",\n\t\t};\n\t\tconst list = byRelation.get(parsed.relation);\n\t\tif (list) list.push(bound);\n\t\telse byRelation.set(parsed.relation, [bound]);\n\t}\n\treturn byRelation;\n}\n\n/** Every reference field bound to one relation, across both of its ends. */\nexport async function fieldsBoundToRelation(\n\tdb: Kysely<Database>,\n\trelationSlug: string,\n): Promise<BoundField[]> {\n\treturn (await fieldsBoundByRelation(db)).get(relationSlug) ?? [];\n}\n\n/**\n * Delete a relation, the reference fields bound to it, and its edges.\n *\n * A relation is only ever deleted deliberately — from the relations admin page,\n * or by the checkbox on a field delete — and it cannot leave a field pointing at\n * nothing, so the fields go with it either way. Callers show the count first;\n * `deletedFields` reports what actually went.\n *\n * Order matters: fields first, then the relation row and its edges. On D1\n * `withTransaction` degrades to sequential statements, so an interrupted run\n * leaves a relation with fewer bound fields — visible on the relations page and\n * finishable — rather than fields pointing at a relation that no longer exists.\n */\nexport async function handleRelationDelete(\n\tdb: Kysely<Database>,\n\tid: string,\n): Promise<ApiResult<{ deleted: true; deletedFields: string[] }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst relation = await repo.findById(id);\n\t\tif (!relation) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\t}\n\n\t\tconst bound = await fieldsBoundToRelation(db, relation.slug);\n\n\t\tconst deleted = await withTransaction(db, async (trx) => {\n\t\t\tconst registry = new SchemaRegistry(trx);\n\t\t\tfor (const field of bound) {\n\t\t\t\tawait registry.deleteField(field.collectionSlug, field.fieldSlug);\n\t\t\t}\n\t\t\treturn new RelationRepository(trx).delete(id);\n\t\t});\n\n\t\tif (!deleted) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\t}\n\n\t\tfor (const collection of new Set(bound.map((f) => f.collectionSlug))) {\n\t\t\tinvalidateCollectionCache(collection);\n\t\t\tinvalidateSchemaCache(collection);\n\t\t}\n\n\t\treturn {\n\t\t\tsuccess: true,\n\t\t\tdata: {\n\t\t\t\tdeleted: true,\n\t\t\t\tdeletedFields: bound.map((f) => `${f.collectionSlug}.${f.fieldSlug}`),\n\t\t\t},\n\t\t};\n\t} catch (error) {\n\t\tconsole.error(\"Relation delete error:\", error);\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: { code: \"RELATION_DELETE_ERROR\", message: \"Failed to delete relation\" },\n\t\t};\n\t}\n}\n\nexport type EntryRef = {\n\tid: string;\n\tslug: string | null;\n\tcollection: string;\n\t/**\n\t * Display label sourced from the collection's configured `titleField`, then\n\t * `title`, then `name` — `null` when none is set, leaving the client to fall\n\t * back to slug/id. Mirrors the admin's `getEntryTitle`.\n\t */\n\ttitle: string | null;\n\t/** The actual locale of the resolved variant — see `pickVariant`. */\n\tlocale: string | null;\n\t/**\n\t * The edge's target: the translation group `id` was resolved from. Stable\n\t * across locales, unlike `id`, so callers comparing a ref against a content\n\t * row (the admin's picker) match the entry rather than one of its variants.\n\t */\n\ttranslationGroup: string | null;\n\tsortOrder?: number;\n};\n\n/**\n * Display title for a resolved entry: the collection's configured `titleField`,\n * then `title`, then `name`, else null.\n */\nfunction entryTitle(data: Record<string, unknown>, titleField?: string): string | null {\n\tif (titleField) {\n\t\tconst configured = data[titleField];\n\t\tif (typeof configured === \"string\" && configured.length > 0) return configured;\n\t}\n\tif (typeof data.title === \"string\" && data.title.length > 0) return data.title;\n\tif (typeof data.name === \"string\" && data.name.length > 0) return data.name;\n\treturn null;\n}\n\n/**\n * The collection's configured `titleField`, memoized for the request: a single\n * content read hydrates every reference field, and several of them commonly\n * target the same collection.\n */\nexport async function getReferenceTitleField(\n\tdb: Kysely<Database>,\n\tcollection: string,\n): Promise<string | undefined> {\n\treturn requestCached(`reference-title-field:${collection}`, async () => {\n\t\tconst row = await db\n\t\t\t.selectFrom(\"_emdash_collections\")\n\t\t\t.select(\"title_field\")\n\t\t\t.where(\"slug\", \"=\", collection)\n\t\t\t.executeTakeFirst();\n\t\treturn row?.title_field ?? undefined;\n\t});\n}\n\n/** Resolve a relation from an id OR its slug. */\nasync function resolveRelation(\n\trepo: RelationRepository,\n\tidOrSlug: string,\n): Promise<Relation | null> {\n\treturn (await repo.findById(idOrSlug)) ?? (await repo.findBySlug(idOrSlug));\n}\n\n/**\n * Pick the locale variant matching `locale`, falling back to the first entry\n * (lowest locale code). The fallback is intentional — an edge is keyed by\n * `translation_group`, so a referenced entry that exists only in another locale\n * is still a real reference — but the returned ref carries the variant's actual\n * `locale` so callers never mistake a fallback for the requested locale.\n */\nfunction pickVariant(items: ContentItem[], locale: string | null): ContentItem | undefined {\n\treturn items.find((i) => i.locale === locale) ?? items[0];\n}\n\n/**\n * Resolve edge groups to loadable entries in `collection` at `locale`.\n * Dangling groups (no surviving entry) are skipped — cleanup is a later slice.\n *\n * All groups are loaded in one batched query (chunked at `SQL_BATCH_SIZE`)\n * rather than a `findTranslations` per edge, so a parent with N children costs\n * a constant number of queries, not N+1. Edge order (the caller's `sort_order`)\n * is preserved by iterating `edges`.\n *\n * `includeDrafts` is false for callers without `content:read_drafts`: the load\n * is restricted to published entries so a draft/scheduled entry referenced by an\n * edge is skipped exactly like a dangling one, never leaking its id/slug/locale.\n */\nexport function resolveEntries(\n\tcontent: ContentRepository,\n\tcollection: string,\n\tedges: ContentReference[],\n\tpick: (e: ContentReference) => string,\n\tlocale: string | null,\n\tincludeDrafts: boolean,\n\ttitleField?: string,\n): Promise<EntryRef[]> {\n\treturn resolveGroupSelection(\n\t\tcontent,\n\t\tcollection,\n\t\tedges.map((edge) => ({ group: pick(edge), sortOrder: edge.sortOrder })),\n\t\tlocale,\n\t\tincludeDrafts,\n\t\ttitleField,\n\t);\n}\n\n/**\n * `resolveEntries` for a selection that has no links behind it yet — a pending\n * one staged in a draft revision, which is already a list of translation groups\n * in the order the editor chose. Position stands in for the `sort_order` the\n * links will carry once it is published.\n */\nexport function resolveEntryGroups(\n\tcontent: ContentRepository,\n\tcollection: string,\n\tgroups: string[],\n\tlocale: string | null,\n\tincludeDrafts: boolean,\n\ttitleField?: string,\n): Promise<EntryRef[]> {\n\treturn resolveGroupSelection(\n\t\tcontent,\n\t\tcollection,\n\t\tgroups.map((group, index) => ({ group, sortOrder: index })),\n\t\tlocale,\n\t\tincludeDrafts,\n\t\ttitleField,\n\t);\n}\n\nasync function resolveGroupSelection(\n\tcontent: ContentRepository,\n\tcollection: string,\n\tselection: Array<{ group: string; sortOrder: number }>,\n\tlocale: string | null,\n\tincludeDrafts: boolean,\n\ttitleField?: string,\n): Promise<EntryRef[]> {\n\tconst all = await content.findTranslationsForGroups(\n\t\tcollection,\n\t\tselection.map((entry) => entry.group),\n\t\t{ publishedOnly: !includeDrafts },\n\t);\n\n\t// Group the flat variant list by translation_group so each selected entry can\n\t// pick its own locale variant.\n\tconst variantsByGroup = new Map<string, ContentItem[]>();\n\tfor (const item of all) {\n\t\tif (item.translationGroup == null) continue;\n\t\tconst list = variantsByGroup.get(item.translationGroup);\n\t\tif (list) list.push(item);\n\t\telse variantsByGroup.set(item.translationGroup, [item]);\n\t}\n\n\tconst refs: EntryRef[] = [];\n\tfor (const selected of selection) {\n\t\tconst variants = variantsByGroup.get(selected.group);\n\t\tif (!variants) continue;\n\t\tconst entry = pickVariant(variants, locale);\n\t\tif (!entry) continue;\n\t\trefs.push({\n\t\t\tid: entry.id,\n\t\t\tslug: entry.slug,\n\t\t\tcollection,\n\t\t\ttitle: entryTitle(entry.data, titleField),\n\t\t\tlocale: entry.locale,\n\t\t\ttranslationGroup: entry.translationGroup,\n\t\t\tsortOrder: selected.sortOrder,\n\t\t});\n\t}\n\treturn refs;\n}\n\n/** Pagination inputs for the edge read endpoints. */\nexport type PageOptions = { limit?: number; cursor?: string };\n\n/**\n * The page of a pending selection this end stages, when there is one.\n *\n * These routes address a relation and a side; a staged selection is keyed by the\n * field slug the entry API takes it under, so the field viewing this end is what\n * connects them. Returns undefined when the caller may not see drafts, the entry\n * has no draft, or the draft stages nothing for this field — all of which mean\n * the published links are the answer.\n */\nasync function stagedPageFor(\n\tdb: Kysely<Database>,\n\toptions: {\n\t\tcollection: string;\n\t\trelationSlug: string;\n\t\tside: \"parent\" | \"child\";\n\t\tdraftRevisionId: string | null | undefined;\n\t\tincludeDrafts: boolean;\n\t\tpage: PageOptions;\n\t},\n): Promise<PageOfGroups | undefined> {\n\tif (!options.includeDrafts || !options.draftRevisionId) return undefined;\n\n\tconst field = constraintsForRelationSide(\n\t\tawait referenceFieldConstraints(db, options.collection),\n\t\toptions.relationSlug,\n\t\toptions.side,\n\t);\n\tif (!field) return undefined;\n\n\tconst revision = await new RevisionRepository(db).findById(options.draftRevisionId);\n\tconst groups = readStagedReferences(revision?.data)?.[field.slug];\n\tif (!groups) return undefined;\n\n\treturn pageStagedGroups(groups, options.page);\n}\n\nexport async function handleReferenceChildrenGet(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tentryId: string,\n\trelation: string,\n\tpage: PageOptions = {},\n\tincludeDrafts = false,\n): Promise<ApiResult<{ children: EntryRef[]; nextCursor?: string }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst content = new ContentRepository(db);\n\n\t\tconst rel = await resolveRelation(repo, relation);\n\t\tif (!rel)\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\tif (collection !== rel.parentCollection) {\n\t\t\treturn {\n\t\t\t\tsuccess: false,\n\t\t\t\terror: {\n\t\t\t\t\tcode: \"VALIDATION_ERROR\",\n\t\t\t\t\tmessage: \"Entry is not the parent side of this relation\",\n\t\t\t\t},\n\t\t\t};\n\t\t}\n\n\t\tconst entry = await content.findByIdOrSlug(collection, entryId);\n\t\t// A caller without draft access must not anchor on a non-published entry —\n\t\t// return NOT_FOUND (not 403) so they can't probe draft ids by status code,\n\t\t// mirroring the single-item content read.\n\t\tif (!entry?.translationGroup || (!includeDrafts && entry.status !== \"published\")) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Content entry not found\" } };\n\t\t}\n\n\t\tconst titleField = await getReferenceTitleField(db, rel.childCollection);\n\n\t\t// A pending selection replaces the published one for a caller that may see\n\t\t// it, page for page — the entry read answers the same way, and a walk that\n\t\t// started on one of them must not continue on the other.\n\t\tconst staged = await stagedPageFor(db, {\n\t\t\tcollection,\n\t\t\trelationSlug: rel.slug,\n\t\t\tside: \"parent\",\n\t\t\tdraftRevisionId: entry.draftRevisionId,\n\t\t\tincludeDrafts,\n\t\t\tpage,\n\t\t});\n\t\tif (staged) {\n\t\t\tconst children = await resolveEntryGroups(\n\t\t\t\tcontent,\n\t\t\t\trel.childCollection,\n\t\t\t\tstaged.groups,\n\t\t\t\tentry.locale,\n\t\t\t\tincludeDrafts,\n\t\t\t\ttitleField,\n\t\t\t);\n\t\t\treturn { success: true, data: { children, nextCursor: staged.nextCursor } };\n\t\t}\n\n\t\tconst edges = await repo.getChildrenPage(rel.id, entry.translationGroup, page);\n\t\tconst children = await resolveEntries(\n\t\t\tcontent,\n\t\t\trel.childCollection,\n\t\t\tedges.items,\n\t\t\t(e) => e.childGroup,\n\t\t\tentry.locale,\n\t\t\tincludeDrafts,\n\t\t\ttitleField,\n\t\t);\n\t\treturn { success: true, data: { children, nextCursor: edges.nextCursor } };\n\t} catch (error) {\n\t\treturn referencesGetError(error);\n\t}\n}\n\n/**\n * A selection expressed in the identifiers the link table actually stores:\n * `translation_group` on both ends, because an edge names a thing rather than\n * one locale's row of it.\n */\nexport interface ReferenceSelectionWrite extends ResolvedReferenceTargets {\n\t/** The selecting entry's own translation group. */\n\tentryGroup: string;\n}\n\n/**\n * The same selection, resolved before the entry it belongs to is known — which\n * is what a create has to do, since its row does not exist until it is written\n * and, on D1, writing it cannot be taken back.\n */\nexport interface ResolvedReferenceTargets {\n\t/** The relation, by id or slug — `setChildren` / `setParents` take either. */\n\trelation: string;\n\t/** The end of the relation the selecting entry sits on. */\n\tside: \"parent\" | \"child\";\n\t/** The selected entries' translation groups, in the caller's order. */\n\tgroups: string[];\n}\n\n/**\n * Resolve a bound field's selection to what the link table stores, without\n * writing anything and without needing the selecting entry to exist.\n *\n * The field decides the relation and the end it views: a field on the `parent`\n * end selects children, one on the `child` end selects the parents pointing at\n * it. `entryGroup` is the selecting entry's own translation group when it has\n * one — the far-side count discounts links it already holds, since replacing a\n * selection with itself adds nothing. A new entry passes `null`: it holds no\n * links yet.\n */\nasync function resolveReferenceTargets(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tconstraints: ReferenceFieldConstraints,\n\tselectedIds: string[],\n\tentryGroup: string | null,\n): Promise<ApiResult<ResolvedReferenceTargets>> {\n\tconst repo = new RelationRepository(db);\n\tconst content = new ContentRepository(db);\n\tconst side = constraints.relationSide;\n\n\tconst rel = await resolveRelation(repo, constraints.relation);\n\tif (!rel) return { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\n\tconst ownCollection = side === \"parent\" ? rel.parentCollection : rel.childCollection;\n\tconst otherCollection = side === \"parent\" ? rel.childCollection : rel.parentCollection;\n\tif (collection !== ownCollection) {\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: {\n\t\t\t\tcode: \"VALIDATION_ERROR\",\n\t\t\t\tmessage: `Entry is not the ${side} side of this relation`,\n\t\t\t},\n\t\t};\n\t}\n\n\tconst selection = validateReferenceSelection(constraints, selectedIds);\n\tif (!selection.success) return selection;\n\n\t// Resolve every selected entry within the relation's other collection in one\n\t// batch (constant queries, not an N+1 of point lookups for a set up to 1000).\n\t// An id that does not resolve there fails collection-agreement (invariant 3);\n\t// order is preserved by iterating the caller's ids.\n\tconst resolved = await content.findManyByIdOrSlug(otherCollection, selectedIds);\n\tconst groups: string[] = [];\n\tfor (const selectedId of selectedIds) {\n\t\tconst other = resolved.get(selectedId);\n\t\tif (!other?.translationGroup) {\n\t\t\treturn {\n\t\t\t\tsuccess: false,\n\t\t\t\terror: {\n\t\t\t\t\tcode: \"NOT_FOUND\",\n\t\t\t\t\tmessage: `${side === \"parent\" ? \"Child\" : \"Parent\"} entry '${selectedId}' not found in ${otherCollection}`,\n\t\t\t\t},\n\t\t\t};\n\t\t}\n\t\tgroups.push(other.translationGroup);\n\t}\n\n\tconst far = await validateOppositeSideLimit(db, {\n\t\trelationId: rel.id,\n\t\tfarLimit: side === \"parent\" ? rel.maxParentsPerChild : rel.maxChildrenPerParent,\n\t\tside,\n\t\tentryGroup,\n\t\tgroups,\n\t\tlabels: selectedIds,\n\t});\n\tif (!far.success) return far;\n\n\treturn { success: true, data: { relation: rel.id, side, groups } };\n}\n\n/**\n * Check what a selection does to the *other* end's cardinality.\n *\n * Cardinality binds both ends, but only one end ever selects: a field on the\n * parent side that hands a child its second parent breaks `maxParentsPerChild`\n * even though the parent's own limit is untouched. Links the selecting entry\n * already holds are discounted — replacing a selection with itself adds nothing.\n *\n * `labels` names each group the way the caller addressed it, so the message\n * quotes the id someone typed. Publication has only the groups, which it stages;\n * it quotes those.\n */\nexport async function validateOppositeSideLimit(\n\tdb: Kysely<Database>,\n\toptions: {\n\t\trelationId: string;\n\t\t/** The opposite end's limit. `null` is unlimited — nothing to check. */\n\t\tfarLimit: number | null;\n\t\t/** The end the selecting entry sits on. */\n\t\tside: \"parent\" | \"child\";\n\t\tentryGroup: string | null;\n\t\tgroups: string[];\n\t\tlabels?: string[];\n\t},\n): Promise<ApiResult<true>> {\n\tconst { farLimit, side, groups } = options;\n\tif (farLimit === null || groups.length === 0) return { success: true, data: true };\n\n\tconst counts = await new RelationRepository(db).countEdgesByGroup(\n\t\toptions.relationId,\n\t\tside === \"parent\" ? \"child\" : \"parent\",\n\t\tgroups,\n\t\toptions.entryGroup,\n\t);\n\tfor (const [index, group] of groups.entries()) {\n\t\tif ((counts.get(group) ?? 0) + 1 <= farLimit) continue;\n\t\tconst farSide = side === \"parent\" ? \"parent\" : \"child\";\n\t\tconst label = options.labels?.[index] ?? group;\n\t\treturn {\n\t\t\tsuccess: false,\n\t\t\terror: {\n\t\t\t\tcode: \"VALIDATION_ERROR\",\n\t\t\t\tmessage:\n\t\t\t\t\tfarLimit === 1\n\t\t\t\t\t\t? `Entry '${label}' already has a ${farSide} on this relation, which allows one.`\n\t\t\t\t\t\t: `Entry '${label}' already has the maximum of ${farLimit} ${farSide} entries on this relation.`,\n\t\t\t},\n\t\t};\n\t}\n\treturn { success: true, data: true };\n}\n\n/**\n * {@link resolveReferenceTargets} for an entry that already exists, anchoring the\n * selection on that entry's translation group.\n */\nasync function resolveReferenceSide(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tentryId: string,\n\tconstraints: ReferenceFieldConstraints,\n\tselectedIds: string[],\n): Promise<ApiResult<ReferenceSelectionWrite>> {\n\tconst entry = await new ContentRepository(db).findByIdOrSlug(collection, entryId);\n\tif (!entry?.translationGroup) {\n\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Content entry not found\" } };\n\t}\n\n\tconst resolved = await resolveReferenceTargets(\n\t\tdb,\n\t\tcollection,\n\t\tconstraints,\n\t\tselectedIds,\n\t\tentry.translationGroup,\n\t);\n\tif (!resolved.success) return resolved;\n\treturn { success: true, data: { ...resolved.data, entryGroup: entry.translationGroup } };\n}\n\n/**\n * Replace one end's links from an already-resolved selection.\n *\n * Resolution has already proved the relation, the entry and every selected entry\n * exist, so nothing here fails on the caller's input. What it can still hit is\n * the far end's limit closing between resolving and writing — a slot another\n * request took in that window. The write refuses the edge rather than exceeding\n * the limit, and throws so the save reports it; the throw carries an `apiError`\n * the content handlers map to a response.\n */\nexport async function writeReferenceSelection(\n\tdb: Kysely<Database>,\n\tselection: ReferenceSelectionWrite,\n): Promise<void> {\n\tconst repo = new RelationRepository(db);\n\tconst rel = await resolveRelation(repo, selection.relation);\n\tif (!rel) return;\n\n\tconst rejected =\n\t\tselection.side === \"parent\"\n\t\t\t? await repo.setChildren(rel.id, selection.entryGroup, selection.groups)\n\t\t\t: await repo.setParents(rel.id, selection.entryGroup, selection.groups);\n\tif (rejected.length > 0) {\n\t\tconst farSide = selection.side === \"parent\" ? \"parent\" : \"child\";\n\t\tthrow Object.assign(\n\t\t\tnew Error(\n\t\t\t\t`Entry '${rejected[0]}' already has the maximum number of ${farSide} entries on this relation.`,\n\t\t\t),\n\t\t\t{ apiError: { code: \"VALIDATION_ERROR\" } },\n\t\t);\n\t}\n\n\t// A link is part of what a cached entry renders on both ends — a parent's\n\t// selection and a child's backlinks — while no row of either collection has\n\t// changed. Nothing else here would tell those snapshots they are stale.\n\tinvalidateCollectionCache(rel.parentCollection);\n\tif (rel.childCollection !== rel.parentCollection) {\n\t\tinvalidateCollectionCache(rel.childCollection);\n\t}\n}\n\n/**\n * Replace a reference field's selection on one entry, addressed by field slug.\n *\n * The field decides which relation and which end: a field bound to the parent\n * end replaces that entry's children, one bound to the child end replaces the\n * parents pointing at it. This is what the entry create/update body writes\n * through, so a site addresses a selection the way it addresses any other field.\n */\nexport async function setReferenceSelection(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tentryId: string,\n\tfieldSlug: string,\n\tselectedIds: string[],\n): Promise<ApiResult<{ relationId: string; entryGroup: string }>> {\n\tconst resolved = await resolveReferenceSelection(db, collection, entryId, fieldSlug, selectedIds);\n\tif (!resolved.success) return resolved;\n\tawait writeReferenceSelection(db, resolved.data);\n\treturn {\n\t\tsuccess: true,\n\t\tdata: { relationId: resolved.data.relation, entryGroup: resolved.data.entryGroup },\n\t};\n}\n\n/**\n * `setReferenceSelection` up to but not including the write.\n *\n * A collection that keeps drafts stages the result in its draft revision instead\n * of writing links, so a save reports a bad id or an over-long selection exactly\n * as a direct write would, and publication has nothing left to resolve.\n */\nexport async function resolveReferenceSelection(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tentryId: string,\n\tfieldSlug: string,\n\tselectedIds: string[],\n): Promise<ApiResult<ReferenceSelectionWrite>> {\n\tconst constraints = (await referenceFieldConstraints(db, collection)).get(fieldSlug);\n\tif (!constraints) return notAReferenceField(fieldSlug, collection);\n\treturn resolveReferenceSide(db, collection, entryId, constraints, selectedIds);\n}\n\n/**\n * `resolveReferenceSelection` for an entry that does not exist yet.\n *\n * A create resolves its whole payload before it writes its row, because on D1\n * that row is committed the moment it is written: a selection that cannot be\n * resolved has to be refused while there is still nothing to take back.\n *\n * `entryGroup` is the group the new row will join — a new translation inherits\n * the source's — or null when the row starts a group of its own and so holds no\n * links yet.\n */\nexport async function resolveReferenceSelectionTargets(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tfieldSlug: string,\n\tselectedIds: string[],\n\tentryGroup: string | null,\n): Promise<ApiResult<ResolvedReferenceTargets>> {\n\tconst constraints = (await referenceFieldConstraints(db, collection)).get(fieldSlug);\n\tif (!constraints) return notAReferenceField(fieldSlug, collection);\n\treturn resolveReferenceTargets(db, collection, constraints, selectedIds, entryGroup);\n}\n\nfunction notAReferenceField(fieldSlug: string, collection: string): ApiResult<never> {\n\treturn {\n\t\tsuccess: false,\n\t\terror: {\n\t\t\tcode: \"VALIDATION_ERROR\",\n\t\t\tmessage: `Field '${fieldSlug}' is not a reference field on ${collection}`,\n\t\t},\n\t};\n}\n\nexport async function handleReferenceParentsGet(\n\tdb: Kysely<Database>,\n\tcollection: string,\n\tentryId: string,\n\trelation: string,\n\tpage: PageOptions = {},\n\tincludeDrafts = false,\n): Promise<ApiResult<{ parents: EntryRef[]; nextCursor?: string }>> {\n\ttry {\n\t\tconst repo = new RelationRepository(db);\n\t\tconst content = new ContentRepository(db);\n\n\t\tconst rel = await resolveRelation(repo, relation);\n\t\tif (!rel)\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Relation not found\" } };\n\t\tif (collection !== rel.childCollection) {\n\t\t\treturn {\n\t\t\t\tsuccess: false,\n\t\t\t\terror: {\n\t\t\t\t\tcode: \"VALIDATION_ERROR\",\n\t\t\t\t\tmessage: \"Entry is not the child side of this relation\",\n\t\t\t\t},\n\t\t\t};\n\t\t}\n\n\t\tconst entry = await content.findByIdOrSlug(collection, entryId);\n\t\t// Same draft-anchor guard as the children read: a non-draft-reader anchoring\n\t\t// on an unpublished entry gets NOT_FOUND, not its backlinks.\n\t\tif (!entry?.translationGroup || (!includeDrafts && entry.status !== \"published\")) {\n\t\t\treturn { success: false, error: { code: \"NOT_FOUND\", message: \"Content entry not found\" } };\n\t\t}\n\n\t\tconst titleField = await getReferenceTitleField(db, rel.parentCollection);\n\n\t\t// As on the children read: a field bound to this end stages its pending\n\t\t// selection in the entry's draft, and that is what a drafts-aware caller\n\t\t// pages through.\n\t\tconst staged = await stagedPageFor(db, {\n\t\t\tcollection,\n\t\t\trelationSlug: rel.slug,\n\t\t\tside: \"child\",\n\t\t\tdraftRevisionId: entry.draftRevisionId,\n\t\t\tincludeDrafts,\n\t\t\tpage,\n\t\t});\n\t\tif (staged) {\n\t\t\tconst parents = await resolveEntryGroups(\n\t\t\t\tcontent,\n\t\t\t\trel.parentCollection,\n\t\t\t\tstaged.groups,\n\t\t\t\tentry.locale,\n\t\t\t\tincludeDrafts,\n\t\t\t\ttitleField,\n\t\t\t);\n\t\t\treturn { success: true, data: { parents, nextCursor: staged.nextCursor } };\n\t\t}\n\n\t\tconst edges = await repo.getParentsPage(rel.id, entry.translationGroup, page);\n\t\tconst parents = await resolveEntries(\n\t\t\tcontent,\n\t\t\trel.parentCollection,\n\t\t\tedges.items,\n\t\t\t(e) => e.parentGroup,\n\t\t\tentry.locale,\n\t\t\tincludeDrafts,\n\t\t\ttitleField,\n\t\t);\n\t\treturn { success: true, data: { parents, nextCursor: edges.nextCursor } };\n\t} catch (error) {\n\t\treturn referencesGetError(error);\n\t}\n}\n"],"mappings":";;;;;;;;;;;AAsBA,SAAS,gBAAgB,SAAmC;AAC3D,QAAO;EAAE,SAAS;EAAO,OAAO;GAAE,MAAM;GAAoB;GAAS;EAAE;;AAGxE,SAASA,WAAS,OAAkD;AACnE,QAAO,OAAO,UAAU,YAAY,UAAU;;;;;;AAO/C,SAAgB,0BACf,IACA,YACkD;AAClD,QAAO,cAAc,+BAA+B,cAAc,YAAY;EAC7E,MAAM,SAAS,MAAM,GACnB,WAAW,iBAAiB,CAC5B,UAAU,uBAAuB,0BAA0B,+BAA+B,CAC1F,OAAO;GAAC;GAAuB;GAA2B;GAA4B,CAAC,CACvF,MAAM,4BAA4B,KAAK,WAAW,CAClD,MAAM,uBAAuB,KAAK,YAAY,CAC9C,SAAS;EAKX,MAAM,YAAY,MAAM,GACtB,WAAW,oBAAoB,CAC/B,OAAO;GAAC;GAAM;GAAQ;GAA2B;GAAwB,CAAC,CAC1E,SAAS;EACX,MAAM,SAAS,IAAI,IAAI,UAAU,KAAK,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;EAEzD,MAAM,8BAAc,IAAI,KAAwC;AAChE,OAAK,MAAM,SAAS,QAAQ;AAC3B,OAAI,CAAC,MAAM,WAAY;GAEvB,IAAI;AACJ,OAAI;AACH,aAAS,KAAK,MAAM,MAAM,WAAW;WAC9B;AACP;;AAED,OAAI,CAACA,WAAS,OAAO,IAAI,OAAO,OAAO,aAAa,SAAU;GAE9D,MAAM,WAAW,OAAO,IAAI,OAAO,SAAS;GAC5C,MAAM,eAAe,OAAO,iBAAiB,UAAU,UAAU;GACjE,MAAM,cAAc,iBAAiB;AAErC,eAAY,IAAI,MAAM,MAAM;IAC3B,MAAM,MAAM;IACZ,UAAU,OAAO;IACjB,YAAY,UAAU,MAAM;IAC5B;IACA,aAAa,cACT,UAAU,yBAAyB,OACnC,UAAU,2BAA2B;IACzC,aAAa,cACT,UAAU,2BAA2B,OACrC,UAAU,yBAAyB;IACvC,UAAU,MAAM,aAAa;IAC7B,CAAC;;AAEH,SAAO;GACN;;;;;;;AAQH,SAAgB,2BACf,aACA,UACA,MACwC;AACxC,MAAK,MAAM,SAAS,YAAY,QAAQ,CACvC,KAAI,MAAM,aAAa,YAAY,MAAM,iBAAiB,KAAM,QAAO;;AAKzE,SAAgB,2BACf,aACA,UACkB;CAClB,MAAM,MAAM,YAAY;AACxB,KAAI,QAAQ,QAAQ,SAAS,SAAS,IACrC,QAAO,gBACN,QAAQ,IACL,UAAU,YAAY,KAAK,yCAAyC,SAAS,OAAO,KACpF,UAAU,YAAY,KAAK,oBAAoB,IAAI,wBAAwB,SAAS,OAAO,GAC9F;AAEF,KAAI,YAAY,YAAY,SAAS,WAAW,EAC/C,QAAO,gBACN,UAAU,YAAY,KAAK,sDAC3B;AAEF,QAAO;EAAE,SAAS;EAAM,MAAM;EAAM;;AAGrC,eAAsB,kCACrB,IACA,YACA,YACA,eAC2B;AAG3B,KAAI,cAAe,QAAO;EAAE,SAAS;EAAM,MAAM;EAAM;CAEvD,MAAM,cAAc,MAAM,0BAA0B,IAAI,WAAW;AACnE,MAAK,MAAM,SAAS,YAAY,QAAQ,EAAE;AACzC,MAAI,CAAC,MAAM,SAAU;AACrB,MAAI,cAAc,OAAO,OAAO,YAAY,MAAM,KAAK,CAAE;AACzD,SAAO,gBACN,UAAU,MAAM,KAAK,sDACrB;;AAEF,QAAO;EAAE,SAAS;EAAM,MAAM;EAAM;;;;;;;AC9GrC,SAAS,mBAAmB,OAAkC;AAC7D,KAAI,iBAAiB,mBACpB,QAAO;EAAE,SAAS;EAAO,OAAO;GAAE,MAAM;GAAkB,SAAS,MAAM;GAAS;EAAE;AAErF,QAAO;EACN,SAAS;EACT,OAAO;GAAE,MAAM;GAAwB,SAAS;GAA4B;EAC5E;;AAGF,SAAS,SAAS,OAAkD;AACnE,QAAO,OAAO,UAAU,YAAY,UAAU;;;;;AAM/C,SAAS,kBAAkB,OAAyB;CACnD,MAAM,UAAU,iBAAiB,QAAQ,MAAM,QAAQ,aAAa,GAAG;AACvE,QAAO,QAAQ,SAAS,2BAA2B,IAAI,QAAQ,SAAS,gBAAgB;;AAGzF,eAAsB,qBACrB,IACA,OAC6C;AAC7C,KAAI;EACH,MAAM,OAAO,IAAI,mBAAmB,GAAG;EAMvC,MAAM,WAAW,IAAI,eAAe,GAAG;AACvC,OAAK,MAAM,cAAc,CAAC,MAAM,kBAAkB,MAAM,gBAAgB,CACvE,KAAI,CAAE,MAAM,SAAS,cAAc,WAAW,CAC7C,QAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SAAS,eAAe,WAAW;IACnC;GACD;AAKH,SAAO;GAAE,SAAS;GAAM,MAAM,EAAE,UADf,MAAM,KAAK,OAAO,MAAM,EACC;GAAE;UACpC,OAAO;AACf,MAAI,kBAAkB,MAAM,CAC3B,QAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SAAS;IACT;GACD;AAEF,SAAO;GACN,SAAS;GACT,OAAO;IAAE,MAAM;IAAyB,SAAS;IAA6B;GAC9E;;;AAcH,eAAsB,kBACrB,IACA,IACsD;AACtD,KAAI;EACH,MAAM,OAAO,IAAI,mBAAmB,GAAG;EACvC,MAAM,WAAW,MAAM,KAAK,SAAS,GAAG;AACxC,MAAI,CAAC,SACJ,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;EAEvF,MAAM,CAAC,aAAa,cAAc,MAAM,QAAQ,IAAI,CACnD,sBAAsB,IAAI,SAAS,KAAK,EACxC,KAAK,sBAAsB,CAC3B,CAAC;AACF,SAAO;GACN,SAAS;GACT,MAAM,EAAE,UAAU;IAAE,GAAG;IAAU;IAAa,WAAW,WAAW,IAAI,SAAS,GAAG,IAAI;IAAG,EAAE;GAC7F;SACM;AACP,SAAO;GACN,SAAS;GACT,OAAO;IAAE,MAAM;IAAsB,SAAS;IAA0B;GACxE;;;;;;;;;AAUH,eAAsB,mBACrB,IACA,OAAgC,EAAE,EACuB;AACzD,KAAI;EACH,MAAM,OAAO,IAAI,mBAAmB,GAAG;EACvC,MAAM,CAAC,WAAW,iBAAiB,cAAc,MAAM,QAAQ,IAAI;GAClE,KAAK,aAAa,KAAK,kBAAkB,KAAK,WAAW,GAAG,KAAK,MAAM;GACvE,sBAAsB,GAAG;GACzB,KAAK,sBAAsB;GAC3B,CAAC;AACF,SAAO;GACN,SAAS;GACT,MAAM,EACL,WAAW,UAAU,KAAK,cAAc;IACvC,GAAG;IACH,aAAa,gBAAgB,IAAI,SAAS,KAAK,IAAI,EAAE;IACrD,WAAW,WAAW,IAAI,SAAS,GAAG,IAAI;IAC1C,EAAE,EACH;GACD;SACM;AACP,SAAO;GACN,SAAS;GACT,OAAO;IAAE,MAAM;IAAuB,SAAS;IAA4B;GAC3E;;;AAIH,eAAsB,qBACrB,IACA,IACA,OAC6C;AAC7C,KAAI;EAEH,MAAM,WAAW,MADJ,IAAI,mBAAmB,GAAG,CACX,OAAO,IAAI,MAAM;AAC7C,MAAI,CAAC,SACJ,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;AAEvF,SAAO;GAAE,SAAS;GAAM,MAAM,EAAE,UAAU;GAAE;SACrC;AACP,SAAO;GACN,SAAS;GACT,OAAO;IAAE,MAAM;IAAyB,SAAS;IAA6B;GAC9E;;;;;;;;;;;;;AAqBH,eAAsB,sBACrB,IACqC;CACrC,MAAM,OAAO,MAAM,GACjB,WAAW,iBAAiB,CAC5B,UAAU,uBAAuB,0BAA0B,+BAA+B,CAC1F,OAAO;EACP;EACA;EACA;EACA,CAAC,CACD,MAAM,uBAAuB,KAAK,YAAY,CAC9C,SAAS;CAEX,MAAM,6BAAa,IAAI,KAA2B;AAClD,MAAK,MAAM,OAAO,MAAM;AACvB,MAAI,CAAC,IAAI,WAAY;EACrB,IAAI;AACJ,MAAI;AACH,YAAS,KAAK,MAAM,IAAI,WAAW;UAC5B;AACP;;AAED,MAAI,CAAC,SAAS,OAAO,IAAI,OAAO,OAAO,aAAa,SAAU;EAC9D,MAAM,QAAoB;GACzB,gBAAgB,IAAI;GACpB,WAAW,IAAI;GACf,MAAM,OAAO,iBAAiB,UAAU,UAAU;GAClD;EACD,MAAM,OAAO,WAAW,IAAI,OAAO,SAAS;AAC5C,MAAI,KAAM,MAAK,KAAK,MAAM;MACrB,YAAW,IAAI,OAAO,UAAU,CAAC,MAAM,CAAC;;AAE9C,QAAO;;;AAIR,eAAsB,sBACrB,IACA,cACwB;AACxB,SAAQ,MAAM,sBAAsB,GAAG,EAAE,IAAI,aAAa,IAAI,EAAE;;;;;;;;;;;;;;;AAgBjE,eAAsB,qBACrB,IACA,IACiE;AACjE,KAAI;EAEH,MAAM,WAAW,MADJ,IAAI,mBAAmB,GAAG,CACX,SAAS,GAAG;AACxC,MAAI,CAAC,SACJ,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;EAGvF,MAAM,QAAQ,MAAM,sBAAsB,IAAI,SAAS,KAAK;AAU5D,MAAI,CARY,MAAM,gBAAgB,IAAI,OAAO,QAAQ;GACxD,MAAM,WAAW,IAAI,eAAe,IAAI;AACxC,QAAK,MAAM,SAAS,MACnB,OAAM,SAAS,YAAY,MAAM,gBAAgB,MAAM,UAAU;AAElE,UAAO,IAAI,mBAAmB,IAAI,CAAC,OAAO,GAAG;IAC5C,CAGD,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;AAGvF,OAAK,MAAM,cAAc,IAAI,IAAI,MAAM,KAAK,MAAM,EAAE,eAAe,CAAC,EAAE;AACrE,6BAA0B,WAAW;AACrC,yBAAsB,WAAW;;AAGlC,SAAO;GACN,SAAS;GACT,MAAM;IACL,SAAS;IACT,eAAe,MAAM,KAAK,MAAM,GAAG,EAAE,eAAe,GAAG,EAAE,YAAY;IACrE;GACD;UACO,OAAO;AACf,UAAQ,MAAM,0BAA0B,MAAM;AAC9C,SAAO;GACN,SAAS;GACT,OAAO;IAAE,MAAM;IAAyB,SAAS;IAA6B;GAC9E;;;;;;;AA6BH,SAAS,WAAW,MAA+B,YAAoC;AACtF,KAAI,YAAY;EACf,MAAM,aAAa,KAAK;AACxB,MAAI,OAAO,eAAe,YAAY,WAAW,SAAS,EAAG,QAAO;;AAErE,KAAI,OAAO,KAAK,UAAU,YAAY,KAAK,MAAM,SAAS,EAAG,QAAO,KAAK;AACzE,KAAI,OAAO,KAAK,SAAS,YAAY,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK;AACvE,QAAO;;;;;;;AAQR,eAAsB,uBACrB,IACA,YAC8B;AAC9B,QAAO,cAAc,yBAAyB,cAAc,YAAY;AAMvE,UALY,MAAM,GAChB,WAAW,sBAAsB,CACjC,OAAO,cAAc,CACrB,MAAM,QAAQ,KAAK,WAAW,CAC9B,kBAAkB,GACR,eAAe;GAC1B;;;AAIH,eAAe,gBACd,MACA,UAC2B;AAC3B,QAAQ,MAAM,KAAK,SAAS,SAAS,IAAM,MAAM,KAAK,WAAW,SAAS;;;;;;;;;AAU3E,SAAS,YAAY,OAAsB,QAAgD;AAC1F,QAAO,MAAM,MAAM,MAAM,EAAE,WAAW,OAAO,IAAI,MAAM;;;;;;;;;;;;;;;AAgBxD,SAAgB,eACf,SACA,YACA,OACA,MACA,QACA,eACA,YACsB;AACtB,QAAO,sBACN,SACA,YACA,MAAM,KAAK,UAAU;EAAE,OAAO,KAAK,KAAK;EAAE,WAAW,KAAK;EAAW,EAAE,EACvE,QACA,eACA,WACA;;;;;;;;AASF,SAAgB,mBACf,SACA,YACA,QACA,QACA,eACA,YACsB;AACtB,QAAO,sBACN,SACA,YACA,OAAO,KAAK,OAAO,WAAW;EAAE;EAAO,WAAW;EAAO,EAAE,EAC3D,QACA,eACA,WACA;;AAGF,eAAe,sBACd,SACA,YACA,WACA,QACA,eACA,YACsB;CACtB,MAAM,MAAM,MAAM,QAAQ,0BACzB,YACA,UAAU,KAAK,UAAU,MAAM,MAAM,EACrC,EAAE,eAAe,CAAC,eAAe,CACjC;CAID,MAAM,kCAAkB,IAAI,KAA4B;AACxD,MAAK,MAAM,QAAQ,KAAK;AACvB,MAAI,KAAK,oBAAoB,KAAM;EACnC,MAAM,OAAO,gBAAgB,IAAI,KAAK,iBAAiB;AACvD,MAAI,KAAM,MAAK,KAAK,KAAK;MACpB,iBAAgB,IAAI,KAAK,kBAAkB,CAAC,KAAK,CAAC;;CAGxD,MAAM,OAAmB,EAAE;AAC3B,MAAK,MAAM,YAAY,WAAW;EACjC,MAAM,WAAW,gBAAgB,IAAI,SAAS,MAAM;AACpD,MAAI,CAAC,SAAU;EACf,MAAM,QAAQ,YAAY,UAAU,OAAO;AAC3C,MAAI,CAAC,MAAO;AACZ,OAAK,KAAK;GACT,IAAI,MAAM;GACV,MAAM,MAAM;GACZ;GACA,OAAO,WAAW,MAAM,MAAM,WAAW;GACzC,QAAQ,MAAM;GACd,kBAAkB,MAAM;GACxB,WAAW,SAAS;GACpB,CAAC;;AAEH,QAAO;;;;;;;;;;;AAeR,eAAe,cACd,IACA,SAQoC;AACpC,KAAI,CAAC,QAAQ,iBAAiB,CAAC,QAAQ,gBAAiB,QAAO;CAE/D,MAAM,QAAQ,2BACb,MAAM,0BAA0B,IAAI,QAAQ,WAAW,EACvD,QAAQ,cACR,QAAQ,KACR;AACD,KAAI,CAAC,MAAO,QAAO;CAGnB,MAAM,SAAS,sBADE,MAAM,IAAI,mBAAmB,GAAG,CAAC,SAAS,QAAQ,gBAAgB,GACrC,KAAK,GAAG,MAAM;AAC5D,KAAI,CAAC,OAAQ,QAAO;AAEpB,QAAO,iBAAiB,QAAQ,QAAQ,KAAK;;AAG9C,eAAsB,2BACrB,IACA,YACA,SACA,UACA,OAAoB,EAAE,EACtB,gBAAgB,OACoD;AACpE,KAAI;EACH,MAAM,OAAO,IAAI,mBAAmB,GAAG;EACvC,MAAM,UAAU,IAAI,kBAAkB,GAAG;EAEzC,MAAM,MAAM,MAAM,gBAAgB,MAAM,SAAS;AACjD,MAAI,CAAC,IACJ,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;AACvF,MAAI,eAAe,IAAI,iBACtB,QAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SAAS;IACT;GACD;EAGF,MAAM,QAAQ,MAAM,QAAQ,eAAe,YAAY,QAAQ;AAI/D,MAAI,CAAC,OAAO,oBAAqB,CAAC,iBAAiB,MAAM,WAAW,YACnE,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAA2B;GAAE;EAG5F,MAAM,aAAa,MAAM,uBAAuB,IAAI,IAAI,gBAAgB;EAKxE,MAAM,SAAS,MAAM,cAAc,IAAI;GACtC;GACA,cAAc,IAAI;GAClB,MAAM;GACN,iBAAiB,MAAM;GACvB;GACA;GACA,CAAC;AACF,MAAI,OASH,QAAO;GAAE,SAAS;GAAM,MAAM;IAAE,UARf,MAAM,mBACtB,SACA,IAAI,iBACJ,OAAO,QACP,MAAM,QACN,eACA,WACA;IACyC,YAAY,OAAO;IAAY;GAAE;EAG5E,MAAM,QAAQ,MAAM,KAAK,gBAAgB,IAAI,IAAI,MAAM,kBAAkB,KAAK;AAU9E,SAAO;GAAE,SAAS;GAAM,MAAM;IAAE,UATf,MAAM,eACtB,SACA,IAAI,iBACJ,MAAM,QACL,MAAM,EAAE,YACT,MAAM,QACN,eACA,WACA;IACyC,YAAY,MAAM;IAAY;GAAE;UAClE,OAAO;AACf,SAAO,mBAAmB,MAAM;;;;;;;;;;;;;;AAuClC,eAAe,wBACd,IACA,YACA,aACA,aACA,YAC+C;CAC/C,MAAM,OAAO,IAAI,mBAAmB,GAAG;CACvC,MAAM,UAAU,IAAI,kBAAkB,GAAG;CACzC,MAAM,OAAO,YAAY;CAEzB,MAAM,MAAM,MAAM,gBAAgB,MAAM,YAAY,SAAS;AAC7D,KAAI,CAAC,IAAK,QAAO;EAAE,SAAS;EAAO,OAAO;GAAE,MAAM;GAAa,SAAS;GAAsB;EAAE;CAEhG,MAAM,gBAAgB,SAAS,WAAW,IAAI,mBAAmB,IAAI;CACrE,MAAM,kBAAkB,SAAS,WAAW,IAAI,kBAAkB,IAAI;AACtE,KAAI,eAAe,cAClB,QAAO;EACN,SAAS;EACT,OAAO;GACN,MAAM;GACN,SAAS,oBAAoB,KAAK;GAClC;EACD;CAGF,MAAM,YAAY,2BAA2B,aAAa,YAAY;AACtE,KAAI,CAAC,UAAU,QAAS,QAAO;CAM/B,MAAM,WAAW,MAAM,QAAQ,mBAAmB,iBAAiB,YAAY;CAC/E,MAAM,SAAmB,EAAE;AAC3B,MAAK,MAAM,cAAc,aAAa;EACrC,MAAM,QAAQ,SAAS,IAAI,WAAW;AACtC,MAAI,CAAC,OAAO,iBACX,QAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SAAS,GAAG,SAAS,WAAW,UAAU,SAAS,UAAU,WAAW,iBAAiB;IACzF;GACD;AAEF,SAAO,KAAK,MAAM,iBAAiB;;CAGpC,MAAM,MAAM,MAAM,0BAA0B,IAAI;EAC/C,YAAY,IAAI;EAChB,UAAU,SAAS,WAAW,IAAI,qBAAqB,IAAI;EAC3D;EACA;EACA;EACA,QAAQ;EACR,CAAC;AACF,KAAI,CAAC,IAAI,QAAS,QAAO;AAEzB,QAAO;EAAE,SAAS;EAAM,MAAM;GAAE,UAAU,IAAI;GAAI;GAAM;GAAQ;EAAE;;;;;;;;;;;;;;AAenE,eAAsB,0BACrB,IACA,SAU2B;CAC3B,MAAM,EAAE,UAAU,MAAM,WAAW;AACnC,KAAI,aAAa,QAAQ,OAAO,WAAW,EAAG,QAAO;EAAE,SAAS;EAAM,MAAM;EAAM;CAElF,MAAM,SAAS,MAAM,IAAI,mBAAmB,GAAG,CAAC,kBAC/C,QAAQ,YACR,SAAS,WAAW,UAAU,UAC9B,QACA,QAAQ,WACR;AACD,MAAK,MAAM,CAAC,OAAO,UAAU,OAAO,SAAS,EAAE;AAC9C,OAAK,OAAO,IAAI,MAAM,IAAI,KAAK,KAAK,SAAU;EAC9C,MAAM,UAAU,SAAS,WAAW,WAAW;EAC/C,MAAM,QAAQ,QAAQ,SAAS,UAAU;AACzC,SAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SACC,aAAa,IACV,UAAU,MAAM,kBAAkB,QAAQ,wCAC1C,UAAU,MAAM,+BAA+B,SAAS,GAAG,QAAQ;IACvE;GACD;;AAEF,QAAO;EAAE,SAAS;EAAM,MAAM;EAAM;;;;;;AAOrC,eAAe,qBACd,IACA,YACA,SACA,aACA,aAC8C;CAC9C,MAAM,QAAQ,MAAM,IAAI,kBAAkB,GAAG,CAAC,eAAe,YAAY,QAAQ;AACjF,KAAI,CAAC,OAAO,iBACX,QAAO;EAAE,SAAS;EAAO,OAAO;GAAE,MAAM;GAAa,SAAS;GAA2B;EAAE;CAG5F,MAAM,WAAW,MAAM,wBACtB,IACA,YACA,aACA,aACA,MAAM,iBACN;AACD,KAAI,CAAC,SAAS,QAAS,QAAO;AAC9B,QAAO;EAAE,SAAS;EAAM,MAAM;GAAE,GAAG,SAAS;GAAM,YAAY,MAAM;GAAkB;EAAE;;;;;;;;;;;;AAazF,eAAsB,wBACrB,IACA,WACgB;CAChB,MAAM,OAAO,IAAI,mBAAmB,GAAG;CACvC,MAAM,MAAM,MAAM,gBAAgB,MAAM,UAAU,SAAS;AAC3D,KAAI,CAAC,IAAK;CAEV,MAAM,WACL,UAAU,SAAS,WAChB,MAAM,KAAK,YAAY,IAAI,IAAI,UAAU,YAAY,UAAU,OAAO,GACtE,MAAM,KAAK,WAAW,IAAI,IAAI,UAAU,YAAY,UAAU,OAAO;AACzE,KAAI,SAAS,SAAS,GAAG;EACxB,MAAM,UAAU,UAAU,SAAS,WAAW,WAAW;AACzD,QAAM,OAAO,uBACZ,IAAI,MACH,UAAU,SAAS,GAAG,sCAAsC,QAAQ,4BACpE,EACD,EAAE,UAAU,EAAE,MAAM,oBAAoB,EAAE,CAC1C;;AAMF,2BAA0B,IAAI,iBAAiB;AAC/C,KAAI,IAAI,oBAAoB,IAAI,iBAC/B,2BAA0B,IAAI,gBAAgB;;;;;;;;;;AAYhD,eAAsB,sBACrB,IACA,YACA,SACA,WACA,aACiE;CACjE,MAAM,WAAW,MAAM,0BAA0B,IAAI,YAAY,SAAS,WAAW,YAAY;AACjG,KAAI,CAAC,SAAS,QAAS,QAAO;AAC9B,OAAM,wBAAwB,IAAI,SAAS,KAAK;AAChD,QAAO;EACN,SAAS;EACT,MAAM;GAAE,YAAY,SAAS,KAAK;GAAU,YAAY,SAAS,KAAK;GAAY;EAClF;;;;;;;;;AAUF,eAAsB,0BACrB,IACA,YACA,SACA,WACA,aAC8C;CAC9C,MAAM,eAAe,MAAM,0BAA0B,IAAI,WAAW,EAAE,IAAI,UAAU;AACpF,KAAI,CAAC,YAAa,QAAO,mBAAmB,WAAW,WAAW;AAClE,QAAO,qBAAqB,IAAI,YAAY,SAAS,aAAa,YAAY;;;;;;;;;;;;;AAc/E,eAAsB,iCACrB,IACA,YACA,WACA,aACA,YAC+C;CAC/C,MAAM,eAAe,MAAM,0BAA0B,IAAI,WAAW,EAAE,IAAI,UAAU;AACpF,KAAI,CAAC,YAAa,QAAO,mBAAmB,WAAW,WAAW;AAClE,QAAO,wBAAwB,IAAI,YAAY,aAAa,aAAa,WAAW;;AAGrF,SAAS,mBAAmB,WAAmB,YAAsC;AACpF,QAAO;EACN,SAAS;EACT,OAAO;GACN,MAAM;GACN,SAAS,UAAU,UAAU,gCAAgC;GAC7D;EACD;;AAGF,eAAsB,0BACrB,IACA,YACA,SACA,UACA,OAAoB,EAAE,EACtB,gBAAgB,OACmD;AACnE,KAAI;EACH,MAAM,OAAO,IAAI,mBAAmB,GAAG;EACvC,MAAM,UAAU,IAAI,kBAAkB,GAAG;EAEzC,MAAM,MAAM,MAAM,gBAAgB,MAAM,SAAS;AACjD,MAAI,CAAC,IACJ,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAAsB;GAAE;AACvF,MAAI,eAAe,IAAI,gBACtB,QAAO;GACN,SAAS;GACT,OAAO;IACN,MAAM;IACN,SAAS;IACT;GACD;EAGF,MAAM,QAAQ,MAAM,QAAQ,eAAe,YAAY,QAAQ;AAG/D,MAAI,CAAC,OAAO,oBAAqB,CAAC,iBAAiB,MAAM,WAAW,YACnE,QAAO;GAAE,SAAS;GAAO,OAAO;IAAE,MAAM;IAAa,SAAS;IAA2B;GAAE;EAG5F,MAAM,aAAa,MAAM,uBAAuB,IAAI,IAAI,iBAAiB;EAKzE,MAAM,SAAS,MAAM,cAAc,IAAI;GACtC;GACA,cAAc,IAAI;GAClB,MAAM;GACN,iBAAiB,MAAM;GACvB;GACA;GACA,CAAC;AACF,MAAI,OASH,QAAO;GAAE,SAAS;GAAM,MAAM;IAAE,SARhB,MAAM,mBACrB,SACA,IAAI,kBACJ,OAAO,QACP,MAAM,QACN,eACA,WACA;IACwC,YAAY,OAAO;IAAY;GAAE;EAG3E,MAAM,QAAQ,MAAM,KAAK,eAAe,IAAI,IAAI,MAAM,kBAAkB,KAAK;AAU7E,SAAO;GAAE,SAAS;GAAM,MAAM;IAAE,SAThB,MAAM,eACrB,SACA,IAAI,kBACJ,MAAM,QACL,MAAM,EAAE,aACT,MAAM,QACN,eACA,WACA;IACwC,YAAY,MAAM;IAAY;GAAE;UACjE,OAAO;AACf,SAAO,mBAAmB,MAAM"}

package/dist/request-cache-iHRlHx1d.mjs

@@ -0,0 +1,104 @@
+import { getRequestContext } from "./request-context.mjs";
+
+//#region src/request-cache.ts
+const STORE_KEY = Symbol.for("emdash:request-cache");
+const g = globalThis;
+const store = g[STORE_KEY] ?? (() => {
+	const wm = /* @__PURE__ */ new WeakMap();
+	g[STORE_KEY] = wm;
+	return wm;
+})();
+/**
+* Return a cached result for `key` if one exists in the current
+* request scope, otherwise call `fn`, cache its promise, and return it.
+*
+* Caches the *promise*, not the resolved value, so concurrent calls
+* with the same key share a single in-flight query.
+*/
+function requestCached(key, fn) {
+	const ctx = getRequestContext();
+	if (!ctx) return fn();
+	let cache = store.get(ctx);
+	if (!cache) {
+		cache = /* @__PURE__ */ new Map();
+		store.set(ctx, cache);
+	}
+	const existing = cache.get(key);
+	if (existing) {
+		if (ctx.metrics) ctx.metrics.cacheHits += 1;
+		return existing;
+	}
+	if (ctx.metrics) ctx.metrics.cacheMisses += 1;
+	const promise = Promise.resolve().then(fn).catch((error) => {
+		cache.delete(key);
+		throw error;
+	});
+	cache.set(key, promise);
+	return promise;
+}
+/**
+* Look up an entry in the request-scoped cache without inserting one.
+*
+* Returns the in-flight or resolved promise if the key exists in the
+* current request, otherwise `undefined`. Callers can use this to
+* opportunistically satisfy a narrower query (e.g. `getSiteSetting("seo")`)
+* from a broader one (`getSiteSettings()`) that's already been loaded
+* by a parent template — avoiding a redundant round-trip.
+*
+* No-ops outside a request context.
+*/
+function peekRequestCache(key) {
+	const ctx = getRequestContext();
+	if (!ctx) return void 0;
+	return store.get(ctx)?.get(key);
+}
+/**
+* Pre-populate the request-scoped cache with a resolved value.
+*
+* Internal helper shared between hydration paths (taxonomy terms,
+* bylines, etc.) that already have the data in hand and want downstream
+* callers using `requestCached(key, ...)` to skip the database entirely.
+* Not exported from the package entrypoint — keep it internal until we
+* have a documented plugin/extension surface for hydration.
+*
+* No-ops outside a request context (local dev without ALS).
+*
+* Does not overwrite an existing entry — if a query for this key is already
+* in flight, its promise wins.
+*/
+function setRequestCacheEntry(key, value) {
+	const ctx = getRequestContext();
+	if (!ctx) return;
+	let cache = store.get(ctx);
+	if (!cache) {
+		cache = /* @__PURE__ */ new Map();
+		store.set(ctx, cache);
+	}
+	if (cache.has(key)) return;
+	cache.set(key, Promise.resolve(value));
+}
+/**
+* Remove a key from the request-scoped cache.
+*
+* Used by write paths that need to invalidate a downstream read cache —
+* `setRequestCacheEntry` deliberately doesn't overwrite, and `requestCached`
+* returns the cached promise even after the underlying data has changed.
+* Without an explicit clear, a `read → write → read` sequence in a single
+* request can return stale data on the second read.
+*
+* Concrete case: `BylineRepository.update` invalidates
+* `byline-field-group-values:${translation_group}` after writing a
+* non-translatable custom-field value, so the post-update `findById`
+* (and any later reads in the same request) see the fresh value.
+*
+* No-ops outside a request context.
+*/
+function clearRequestCacheEntry(key) {
+	const ctx = getRequestContext();
+	if (!ctx) return;
+	store.get(ctx)?.delete(key);
+}
+
+//#endregion
+export { setRequestCacheEntry as i, peekRequestCache as n, requestCached as r, clearRequestCacheEntry as t };
+//# sourceMappingURL=request-cache-iHRlHx1d.mjs.map

package/dist/request-cache-iHRlHx1d.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"request-cache-iHRlHx1d.mjs","names":[],"sources":["../src/request-cache.ts"],"sourcesContent":["/**\n * Per-request query cache\n *\n * Deduplicates identical database queries within a single page render.\n * Uses the ALS request context as a WeakMap key so the cache is\n * automatically GC'd when the request completes.\n *\n * When no request context is available (e.g. local dev without D1\n * replicas), queries bypass the cache — local SQLite is fast enough\n * that deduplication doesn't matter.\n *\n * The WeakMap is stored on globalThis with a Symbol key to guarantee\n * a singleton even when bundlers duplicate this module across chunks\n * (same pattern as request-context.ts).\n */\n\nimport type { EmDashRequestContext } from \"./request-context.js\";\nimport { getRequestContext } from \"./request-context.js\";\n\ntype CacheStore = WeakMap<EmDashRequestContext, Map<string, Promise<unknown>>>;\n\nconst STORE_KEY = Symbol.for(\"emdash:request-cache\");\nconst g = globalThis as Record<symbol, unknown>;\nconst store: CacheStore =\n\t// eslint-disable-next-line typescript/no-unsafe-type-assertion -- globalThis singleton pattern (see request-context.ts)\n\t(g[STORE_KEY] as CacheStore | undefined) ??\n\t(() => {\n\t\tconst wm: CacheStore = new WeakMap();\n\t\tg[STORE_KEY] = wm;\n\t\treturn wm;\n\t})();\n\n/**\n * Return a cached result for `key` if one exists in the current\n * request scope, otherwise call `fn`, cache its promise, and return it.\n *\n * Caches the *promise*, not the resolved value, so concurrent calls\n * with the same key share a single in-flight query.\n */\nexport function requestCached<T>(key: string, fn: () => Promise<T>): Promise<T> {\n\tconst ctx = getRequestContext();\n\tif (!ctx) return fn();\n\n\tlet cache = store.get(ctx);\n\tif (!cache) {\n\t\tcache = new Map();\n\t\tstore.set(ctx, cache);\n\t}\n\n\tconst existing = cache.get(key);\n\tif (existing) {\n\t\tif (ctx.metrics) ctx.metrics.cacheHits += 1;\n\t\t// eslint-disable-next-line typescript/no-unsafe-type-assertion -- heterogeneous cache; key namespacing guarantees the stored promise resolves to T\n\t\treturn existing as Promise<T>;\n\t}\n\tif (ctx.metrics) ctx.metrics.cacheMisses += 1;\n\n\tconst promise = Promise.resolve()\n\t\t.then(fn)\n\t\t.catch((error) => {\n\t\t\tcache.delete(key);\n\t\t\tthrow error;\n\t\t});\n\tcache.set(key, promise);\n\treturn promise;\n}\n\n/**\n * Look up an entry in the request-scoped cache without inserting one.\n *\n * Returns the in-flight or resolved promise if the key exists in the\n * current request, otherwise `undefined`. Callers can use this to\n * opportunistically satisfy a narrower query (e.g. `getSiteSetting(\"seo\")`)\n * from a broader one (`getSiteSettings()`) that's already been loaded\n * by a parent template — avoiding a redundant round-trip.\n *\n * No-ops outside a request context.\n */\nexport function peekRequestCache<T>(key: string): Promise<T> | undefined {\n\tconst ctx = getRequestContext();\n\tif (!ctx) return undefined;\n\tconst cache = store.get(ctx);\n\t// eslint-disable-next-line typescript/no-unsafe-type-assertion -- heterogeneous cache; caller is responsible for using a T-compatible key\n\treturn cache?.get(key) as Promise<T> | undefined;\n}\n\n/**\n * Pre-populate the request-scoped cache with a resolved value.\n *\n * Internal helper shared between hydration paths (taxonomy terms,\n * bylines, etc.) that already have the data in hand and want downstream\n * callers using `requestCached(key, ...)` to skip the database entirely.\n * Not exported from the package entrypoint — keep it internal until we\n * have a documented plugin/extension surface for hydration.\n *\n * No-ops outside a request context (local dev without ALS).\n *\n * Does not overwrite an existing entry — if a query for this key is already\n * in flight, its promise wins.\n */\nexport function setRequestCacheEntry<T>(key: string, value: T): void {\n\tconst ctx = getRequestContext();\n\tif (!ctx) return;\n\n\tlet cache = store.get(ctx);\n\tif (!cache) {\n\t\tcache = new Map();\n\t\tstore.set(ctx, cache);\n\t}\n\n\tif (cache.has(key)) return;\n\tcache.set(key, Promise.resolve(value));\n}\n\n/**\n * Remove a key from the request-scoped cache.\n *\n * Used by write paths that need to invalidate a downstream read cache —\n * `setRequestCacheEntry` deliberately doesn't overwrite, and `requestCached`\n * returns the cached promise even after the underlying data has changed.\n * Without an explicit clear, a `read → write → read` sequence in a single\n * request can return stale data on the second read.\n *\n * Concrete case: `BylineRepository.update` invalidates\n * `byline-field-group-values:${translation_group}` after writing a\n * non-translatable custom-field value, so the post-update `findById`\n * (and any later reads in the same request) see the fresh value.\n *\n * No-ops outside a request context.\n */\nexport function clearRequestCacheEntry(key: string): void {\n\tconst ctx = getRequestContext();\n\tif (!ctx) return;\n\tconst cache = store.get(ctx);\n\tcache?.delete(key);\n}\n"],"mappings":";;;AAqBA,MAAM,YAAY,OAAO,IAAI,uBAAuB;AACpD,MAAM,IAAI;AACV,MAAM,QAEJ,EAAE,qBACI;CACN,MAAM,qBAAiB,IAAI,SAAS;AACpC,GAAE,aAAa;AACf,QAAO;IACJ;;;;;;;;AASL,SAAgB,cAAiB,KAAa,IAAkC;CAC/E,MAAM,MAAM,mBAAmB;AAC/B,KAAI,CAAC,IAAK,QAAO,IAAI;CAErB,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,KAAI,CAAC,OAAO;AACX,0BAAQ,IAAI,KAAK;AACjB,QAAM,IAAI,KAAK,MAAM;;CAGtB,MAAM,WAAW,MAAM,IAAI,IAAI;AAC/B,KAAI,UAAU;AACb,MAAI,IAAI,QAAS,KAAI,QAAQ,aAAa;AAE1C,SAAO;;AAER,KAAI,IAAI,QAAS,KAAI,QAAQ,eAAe;CAE5C,MAAM,UAAU,QAAQ,SAAS,CAC/B,KAAK,GAAG,CACR,OAAO,UAAU;AACjB,QAAM,OAAO,IAAI;AACjB,QAAM;GACL;AACH,OAAM,IAAI,KAAK,QAAQ;AACvB,QAAO;;;;;;;;;;;;;AAcR,SAAgB,iBAAoB,KAAqC;CACxE,MAAM,MAAM,mBAAmB;AAC/B,KAAI,CAAC,IAAK,QAAO;AAGjB,QAFc,MAAM,IAAI,IAAI,EAEd,IAAI,IAAI;;;;;;;;;;;;;;;;AAiBvB,SAAgB,qBAAwB,KAAa,OAAgB;CACpE,MAAM,MAAM,mBAAmB;AAC/B,KAAI,CAAC,IAAK;CAEV,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,KAAI,CAAC,OAAO;AACX,0BAAQ,IAAI,KAAK;AACjB,QAAM,IAAI,KAAK,MAAM;;AAGtB,KAAI,MAAM,IAAI,IAAI,CAAE;AACpB,OAAM,IAAI,KAAK,QAAQ,QAAQ,MAAM,CAAC;;;;;;;;;;;;;;;;;;AAmBvC,SAAgB,uBAAuB,KAAmB;CACzD,MAAM,MAAM,mBAAmB;AAC/B,KAAI,CAAC,IAAK;AAEV,CADc,MAAM,IAAI,IAAI,EACrB,OAAO,IAAI"}

package/dist/request-context.d.mts

@@ -1,5 +1,5 @@
 import { QueryRecorder } from "./database/instrumentation.mjs";
-import { t as DeferredTaskTracker } from "./deferred-tasks-BPxXUB4x.mjs";
+import { t as DeferredTaskTracker } from "./deferred-tasks-CZ7rzBdo.mjs";
 
 //#region src/request-context.d.ts
 /**

package/dist/request-meta-D47mqyev.mjs

@@ -0,0 +1,141 @@
+import { n as normalizeTrustedHeaders, t as getTrustedProxyHeaders } from "./trusted-proxy-B6ECOZJc.mjs";
+
+//#region src/plugins/request-meta.ts
+/**
+* Loose validation for IPv4 and IPv6 addresses.
+* Accepts digits, hex chars, dots, and colons — rejects anything else
+* (e.g. HTML tags, scripts, or other non-IP garbage in spoofed headers).
+*/
+const IP_PATTERN = /^[\da-fA-F.:]+$/;
+/**
+* Extract the first IP from an X-Forwarded-For header value.
+* The header may contain a comma-separated list of IPs; the first
+* entry is the original client IP.
+*
+* Returns null if the extracted value doesn't look like an IP address.
+*/
+function parseFirstForwardedIp(header) {
+	const trimmed = header.split(",")[0]?.trim();
+	if (!trimmed) return null;
+	return IP_PATTERN.test(trimmed) ? trimmed : null;
+}
+/**
+* Read an IP from an operator-declared trusted header. XFF-style headers
+* (any name ending in `forwarded-for`) are parsed as comma-separated lists
+* and the first entry is used; everything else is treated as a single
+* trimmed value.
+*/
+function readIpFromHeader(headers, name) {
+	const value = headers.get(name);
+	if (!value) return null;
+	if (name.endsWith("forwarded-for")) return parseFirstForwardedIp(value);
+	const trimmed = value.trim();
+	if (!trimmed) return null;
+	return IP_PATTERN.test(trimmed) ? trimmed : null;
+}
+/**
+* Get the Cloudflare `cf` object from the request, if present.
+* Returns undefined when not running on Cloudflare Workers.
+*/
+function getCfObject(request) {
+	return request.cf;
+}
+/**
+* Extract geographic information from the Cloudflare `cf` object
+* attached to the request. Returns null when not running on CF Workers.
+*/
+function extractGeo(cf) {
+	if (!cf) return null;
+	const country = cf.country ?? null;
+	const region = cf.region ?? null;
+	const city = cf.city ?? null;
+	if (country === null && region === null && city === null) return null;
+	return {
+		country,
+		region,
+		city
+	};
+}
+/**
+* Extract normalized request metadata from a Request object.
+*
+* IP resolution order:
+* 1. `CF-Connecting-IP` — trusted only when a `cf` object is present on the
+*    request. CF edge overwrites any client-supplied value, so this is the
+*    cryptographically trustworthy path on Workers. Operator-declared
+*    trusted headers cannot override it.
+* 2. `X-Forwarded-For` first entry — trusted only with a `cf` object.
+* 3. Operator-declared trusted proxy headers (from `config.trustedProxyHeaders`
+*    or the `EMDASH_TRUSTED_PROXY_HEADERS` env var), tried in order. Used as
+*    the primary source off-CF and as a fill-in on CF.
+* 4. `null`
+*
+* The second argument accepts either the EmDash config or a pre-resolved
+* list of trusted headers, so callers that already have the list don't have
+* to round-trip through the config every request.
+*/
+function extractRequestMeta(request, configOrTrustedHeaders) {
+	const headers = request.headers;
+	const cf = getCfObject(request);
+	const trusted = resolveTrustedHeaders(configOrTrustedHeaders);
+	let ip = null;
+	if (cf) {
+		const cfIp = headers.get("cf-connecting-ip")?.trim();
+		if (cfIp && IP_PATTERN.test(cfIp)) ip = cfIp;
+		if (!ip) {
+			const xff = headers.get("x-forwarded-for");
+			ip = xff ? parseFirstForwardedIp(xff) : null;
+		}
+	}
+	if (!ip) for (const name of trusted) {
+		const value = readIpFromHeader(headers, name);
+		if (value) {
+			ip = value;
+			break;
+		}
+	}
+	const userAgent = headers.get("user-agent")?.trim() || null;
+	const referer = headers.get("referer")?.trim() || null;
+	const geo = extractGeo(cf);
+	return {
+		ip,
+		userAgent,
+		referer,
+		geo
+	};
+}
+function resolveTrustedHeaders(value) {
+	if (Array.isArray(value)) return normalizeTrustedHeaders(value);
+	return getTrustedProxyHeaders(value);
+}
+/**
+* Headers that must never cross the RPC boundary to sandboxed plugins.
+* Session tokens, auth credentials, and infrastructure headers are stripped
+* to prevent malicious plugins from exfiltrating sensitive data.
+*/
+const SANDBOX_STRIPPED_HEADERS = new Set([
+	"cookie",
+	"set-cookie",
+	"authorization",
+	"proxy-authorization",
+	"cf-access-jwt-assertion",
+	"cf-access-client-id",
+	"cf-access-client-secret",
+	"x-emdash-request"
+]);
+/**
+* Copy request headers into a plain object, stripping sensitive headers
+* that must not be exposed to sandboxed plugin code.
+*/
+function sanitizeHeadersForSandbox(headers, allowedHeaders) {
+	const safe = {};
+	const allowed = allowedHeaders ? new Set(allowedHeaders.map((header) => header.toLowerCase())) : null;
+	headers.forEach((value, key) => {
+		if (!SANDBOX_STRIPPED_HEADERS.has(key) && !key.startsWith("cf-access-") && (allowed === null || allowed.has(key))) safe[key] = value;
+	});
+	return safe;
+}
+
+//#endregion
+export { sanitizeHeadersForSandbox as n, extractRequestMeta as t };
+//# sourceMappingURL=request-meta-D47mqyev.mjs.map

package/dist/request-meta-D47mqyev.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"request-meta-D47mqyev.mjs","names":[],"sources":["../src/plugins/request-meta.ts"],"sourcesContent":["/**\n * Request Metadata Extraction\n *\n * Extracts normalized metadata (IP, user agent, referer, geo) from\n * incoming requests. Used by plugin route handlers to access request\n * context without touching raw headers.\n *\n */\n\nimport type { EmDashConfig } from \"../astro/integration/runtime.js\";\nimport { getTrustedProxyHeaders, normalizeTrustedHeaders } from \"../auth/trusted-proxy.js\";\nimport type { GeoInfo, RequestMeta } from \"./types.js\";\n\n/**\n * Cloudflare Workers `cf` object shape (subset we use).\n * Present on requests when running on Cloudflare Workers.\n */\ninterface CfProperties {\n\tcountry?: string;\n\tregion?: string;\n\tcity?: string;\n}\n\n/**\n * Loose validation for IPv4 and IPv6 addresses.\n * Accepts digits, hex chars, dots, and colons — rejects anything else\n * (e.g. HTML tags, scripts, or other non-IP garbage in spoofed headers).\n */\nconst IP_PATTERN = /^[\\da-fA-F.:]+$/;\n\n/**\n * Extract the first IP from an X-Forwarded-For header value.\n * The header may contain a comma-separated list of IPs; the first\n * entry is the original client IP.\n *\n * Returns null if the extracted value doesn't look like an IP address.\n */\nfunction parseFirstForwardedIp(header: string): string | null {\n\tconst first = header.split(\",\")[0];\n\tconst trimmed = first?.trim();\n\tif (!trimmed) return null;\n\treturn IP_PATTERN.test(trimmed) ? trimmed : null;\n}\n\n/**\n * Read an IP from an operator-declared trusted header. XFF-style headers\n * (any name ending in `forwarded-for`) are parsed as comma-separated lists\n * and the first entry is used; everything else is treated as a single\n * trimmed value.\n */\nfunction readIpFromHeader(headers: Headers, name: string): string | null {\n\tconst value = headers.get(name);\n\tif (!value) return null;\n\tif (name.endsWith(\"forwarded-for\")) {\n\t\treturn parseFirstForwardedIp(value);\n\t}\n\tconst trimmed = value.trim();\n\tif (!trimmed) return null;\n\treturn IP_PATTERN.test(trimmed) ? trimmed : null;\n}\n\n/**\n * Get the Cloudflare `cf` object from the request, if present.\n * Returns undefined when not running on Cloudflare Workers.\n */\nfunction getCfObject(request: Request): CfProperties | undefined {\n\treturn (request as unknown as { cf?: CfProperties }).cf;\n}\n\n/**\n * Extract geographic information from the Cloudflare `cf` object\n * attached to the request. Returns null when not running on CF Workers.\n */\nfunction extractGeo(cf: CfProperties | undefined): GeoInfo | null {\n\tif (!cf) return null;\n\n\tconst country = cf.country ?? null;\n\tconst region = cf.region ?? null;\n\tconst city = cf.city ?? null;\n\n\t// Only return geo if at least one field is populated\n\tif (country === null && region === null && city === null) return null;\n\n\treturn { country, region, city };\n}\n\n/**\n * Extract normalized request metadata from a Request object.\n *\n * IP resolution order:\n * 1. `CF-Connecting-IP` — trusted only when a `cf` object is present on the\n *    request. CF edge overwrites any client-supplied value, so this is the\n *    cryptographically trustworthy path on Workers. Operator-declared\n *    trusted headers cannot override it.\n * 2. `X-Forwarded-For` first entry — trusted only with a `cf` object.\n * 3. Operator-declared trusted proxy headers (from `config.trustedProxyHeaders`\n *    or the `EMDASH_TRUSTED_PROXY_HEADERS` env var), tried in order. Used as\n *    the primary source off-CF and as a fill-in on CF.\n * 4. `null`\n *\n * The second argument accepts either the EmDash config or a pre-resolved\n * list of trusted headers, so callers that already have the list don't have\n * to round-trip through the config every request.\n */\nexport function extractRequestMeta(\n\trequest: Request,\n\tconfigOrTrustedHeaders?: EmDashConfig | null | { trustedProxyHeaders?: string[] } | string[],\n): RequestMeta {\n\tconst headers = request.headers;\n\tconst cf = getCfObject(request);\n\tconst trusted = resolveTrustedHeaders(configOrTrustedHeaders);\n\n\tlet ip: string | null = null;\n\n\t// On Cloudflare, prefer the cryptographically trustworthy headers first.\n\tif (cf) {\n\t\tconst cfIp = headers.get(\"cf-connecting-ip\")?.trim();\n\t\tif (cfIp && IP_PATTERN.test(cfIp)) {\n\t\t\tip = cfIp;\n\t\t}\n\t\tif (!ip) {\n\t\t\tconst xff = headers.get(\"x-forwarded-for\");\n\t\t\tip = xff ? parseFirstForwardedIp(xff) : null;\n\t\t}\n\t}\n\n\t// Fall through to operator-declared trusted headers. On CF this fills\n\t// in when the CF headers are absent; off-CF it's the primary source.\n\tif (!ip) {\n\t\tfor (const name of trusted) {\n\t\t\tconst value = readIpFromHeader(headers, name);\n\t\t\tif (value) {\n\t\t\t\tip = value;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tconst userAgent = headers.get(\"user-agent\")?.trim() || null;\n\tconst referer = headers.get(\"referer\")?.trim() || null;\n\tconst geo = extractGeo(cf);\n\n\treturn { ip, userAgent, referer, geo };\n}\n\nfunction resolveTrustedHeaders(\n\tvalue: EmDashConfig | null | { trustedProxyHeaders?: string[] } | string[] | undefined,\n): string[] {\n\tif (Array.isArray(value)) {\n\t\t// Apply the same RFC 7230 validation the config/env path does so a\n\t\t// caller passing a pre-resolved list with bad entries can't crash\n\t\t// `Headers.get()` downstream.\n\t\treturn normalizeTrustedHeaders(value);\n\t}\n\treturn getTrustedProxyHeaders(value);\n}\n\n// =============================================================================\n// Header Sanitization for Sandbox\n// =============================================================================\n\n/**\n * Headers that must never cross the RPC boundary to sandboxed plugins.\n * Session tokens, auth credentials, and infrastructure headers are stripped\n * to prevent malicious plugins from exfiltrating sensitive data.\n */\nconst SANDBOX_STRIPPED_HEADERS = new Set([\n\t\"cookie\",\n\t\"set-cookie\",\n\t\"authorization\",\n\t\"proxy-authorization\",\n\t\"cf-access-jwt-assertion\",\n\t\"cf-access-client-id\",\n\t\"cf-access-client-secret\",\n\t\"x-emdash-request\",\n]);\n\n/**\n * Copy request headers into a plain object, stripping sensitive headers\n * that must not be exposed to sandboxed plugin code.\n */\nexport function sanitizeHeadersForSandbox(\n\theaders: Headers,\n\tallowedHeaders?: readonly string[],\n): Record<string, string> {\n\tconst safe: Record<string, string> = {};\n\tconst allowed = allowedHeaders\n\t\t? new Set(allowedHeaders.map((header) => header.toLowerCase()))\n\t\t: null;\n\theaders.forEach((value, key) => {\n\t\tif (\n\t\t\t!SANDBOX_STRIPPED_HEADERS.has(key) &&\n\t\t\t!key.startsWith(\"cf-access-\") &&\n\t\t\t(allowed === null || allowed.has(key))\n\t\t) {\n\t\t\tsafe[key] = value;\n\t\t}\n\t});\n\treturn safe;\n}\n"],"mappings":";;;;;;;;AA4BA,MAAM,aAAa;;;;;;;;AASnB,SAAS,sBAAsB,QAA+B;CAE7D,MAAM,UADQ,OAAO,MAAM,IAAI,CAAC,IACT,MAAM;AAC7B,KAAI,CAAC,QAAS,QAAO;AACrB,QAAO,WAAW,KAAK,QAAQ,GAAG,UAAU;;;;;;;;AAS7C,SAAS,iBAAiB,SAAkB,MAA6B;CACxE,MAAM,QAAQ,QAAQ,IAAI,KAAK;AAC/B,KAAI,CAAC,MAAO,QAAO;AACnB,KAAI,KAAK,SAAS,gBAAgB,CACjC,QAAO,sBAAsB,MAAM;CAEpC,MAAM,UAAU,MAAM,MAAM;AAC5B,KAAI,CAAC,QAAS,QAAO;AACrB,QAAO,WAAW,KAAK,QAAQ,GAAG,UAAU;;;;;;AAO7C,SAAS,YAAY,SAA4C;AAChE,QAAQ,QAA6C;;;;;;AAOtD,SAAS,WAAW,IAA8C;AACjE,KAAI,CAAC,GAAI,QAAO;CAEhB,MAAM,UAAU,GAAG,WAAW;CAC9B,MAAM,SAAS,GAAG,UAAU;CAC5B,MAAM,OAAO,GAAG,QAAQ;AAGxB,KAAI,YAAY,QAAQ,WAAW,QAAQ,SAAS,KAAM,QAAO;AAEjE,QAAO;EAAE;EAAS;EAAQ;EAAM;;;;;;;;;;;;;;;;;;;;AAqBjC,SAAgB,mBACf,SACA,wBACc;CACd,MAAM,UAAU,QAAQ;CACxB,MAAM,KAAK,YAAY,QAAQ;CAC/B,MAAM,UAAU,sBAAsB,uBAAuB;CAE7D,IAAI,KAAoB;AAGxB,KAAI,IAAI;EACP,MAAM,OAAO,QAAQ,IAAI,mBAAmB,EAAE,MAAM;AACpD,MAAI,QAAQ,WAAW,KAAK,KAAK,CAChC,MAAK;AAEN,MAAI,CAAC,IAAI;GACR,MAAM,MAAM,QAAQ,IAAI,kBAAkB;AAC1C,QAAK,MAAM,sBAAsB,IAAI,GAAG;;;AAM1C,KAAI,CAAC,GACJ,MAAK,MAAM,QAAQ,SAAS;EAC3B,MAAM,QAAQ,iBAAiB,SAAS,KAAK;AAC7C,MAAI,OAAO;AACV,QAAK;AACL;;;CAKH,MAAM,YAAY,QAAQ,IAAI,aAAa,EAAE,MAAM,IAAI;CACvD,MAAM,UAAU,QAAQ,IAAI,UAAU,EAAE,MAAM,IAAI;CAClD,MAAM,MAAM,WAAW,GAAG;AAE1B,QAAO;EAAE;EAAI;EAAW;EAAS;EAAK;;AAGvC,SAAS,sBACR,OACW;AACX,KAAI,MAAM,QAAQ,MAAM,CAIvB,QAAO,wBAAwB,MAAM;AAEtC,QAAO,uBAAuB,MAAM;;;;;;;AAYrC,MAAM,2BAA2B,IAAI,IAAI;CACxC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,CAAC;;;;;AAMF,SAAgB,0BACf,SACA,gBACyB;CACzB,MAAM,OAA+B,EAAE;CACvC,MAAM,UAAU,iBACb,IAAI,IAAI,eAAe,KAAK,WAAW,OAAO,aAAa,CAAC,CAAC,GAC7D;AACH,SAAQ,SAAS,OAAO,QAAQ;AAC/B,MACC,CAAC,yBAAyB,IAAI,IAAI,IAClC,CAAC,IAAI,WAAW,aAAa,KAC5B,YAAY,QAAQ,QAAQ,IAAI,IAAI,EAErC,MAAK,OAAO;GAEZ;AACF,QAAO"}

package/dist/resolve-BPE8sMvx.mjs

@@ -0,0 +1,99 @@
+import "./dialect-helpers-7_IqPdh9.mjs";
+import { i as isI18nEnabled, n as getFallbackChain } from "./config-CvmjJcVw.mjs";
+import "./datetime-normalization-PeiEdcRY.mjs";
+import "./after-PcEvMY_6.mjs";
+import "./base64-DvnNgP7e.mjs";
+import "./object-cache-CqWNY5uP.mjs";
+import "./types-aOOxRSx6.mjs";
+import { t as RevisionRepository } from "./revision-j1p4-bOj.mjs";
+import "./request-cache-iHRlHx1d.mjs";
+import { a as pageStagedGroups, c as RelationRepository, n as REFERENCE_PAGE_MAX_LIMIT, o as readStagedReferences, t as REFERENCE_PAGE_LIMIT } from "./staged-C36IWXff.mjs";
+import { c as loadEntriesByGroups, s as getDb } from "./loader-CrRPfkHS.mjs";
+import { n as getReferenceFieldMap } from "./field-map-6m9rF49t.mjs";
+
+//#region src/references/resolve.ts
+/**
+* Resolve an entry's reference selections to loadable entries, for the public
+* query path.
+*
+* The cost is bounded and predictable: one link read per selected field, then
+* one entry read per *distinct* target collection — never one per link. A
+* caller that selects no fields issues nothing at all, which is what keeps
+* references off the logged-out hot path of every render that does not ask for
+* them.
+*/
+function pageOptions(query) {
+	if (query === true) return { limit: REFERENCE_PAGE_LIMIT };
+	const requested = query.limit ?? REFERENCE_PAGE_LIMIT;
+	return {
+		limit: Math.min(Math.max(requested, 1), REFERENCE_PAGE_MAX_LIMIT),
+		cursor: query.cursor
+	};
+}
+function localeChainFor(locale) {
+	if (locale === null) return [];
+	return isI18nEnabled() ? getFallbackChain(locale) : [locale];
+}
+async function resolveReferencePages(options) {
+	const fieldMap = await getReferenceFieldMap(options.collection);
+	const requested = Object.entries(options.selection).filter((entry) => entry[1] !== void 0 && fieldMap.has(entry[0]));
+	if (requested.length === 0) return {};
+	const db = await getDb();
+	const relations = new RelationRepository(db);
+	const staged = options.serveDrafts && options.draftRevisionId ? readStagedReferences((await new RevisionRepository(db).findById(options.draftRevisionId))?.data) : void 0;
+	const pages = new Map(await Promise.all(requested.map(async ([slug, query]) => {
+		const binding = fieldMap.get(slug);
+		const page = pageOptions(query);
+		const stagedGroups = staged?.[slug];
+		if (stagedGroups) return [slug, pageStagedGroups(stagedGroups, page)];
+		const links = binding.side === "child" ? await relations.getParentsPageById(binding.relationId, options.entryGroup, page) : await relations.getChildrenPageById(binding.relationId, options.entryGroup, page);
+		return [slug, {
+			groups: links.items.map((link) => binding.side === "child" ? link.parentGroup : link.childGroup),
+			nextCursor: links.nextCursor
+		}];
+	})));
+	const groupsByCollection = /* @__PURE__ */ new Map();
+	for (const [slug, page] of pages) {
+		const target = fieldMap.get(slug).targetCollection;
+		const groups = groupsByCollection.get(target) ?? /* @__PURE__ */ new Set();
+		for (const group of page.groups) groups.add(group);
+		groupsByCollection.set(target, groups);
+	}
+	const localeChain = localeChainFor(options.locale);
+	const variantsByCollection = /* @__PURE__ */ new Map();
+	await Promise.all(Array.from(groupsByCollection, async ([collection, groups]) => {
+		const loaded = await loadEntriesByGroups(collection, [...groups], {
+			publishedOnly: !options.serveDrafts,
+			localeChain
+		});
+		const byGroup = /* @__PURE__ */ new Map();
+		for (const entry of loaded) {
+			const group = entry.data.translationGroup;
+			if (typeof group === "string") byGroup.set(group, entry);
+		}
+		variantsByCollection.set(collection, byGroup);
+	}));
+	const resolved = {};
+	for (const [slug, page] of pages) {
+		const collection = fieldMap.get(slug).targetCollection;
+		const byGroup = variantsByCollection.get(collection);
+		const entries = [];
+		for (const group of page.groups) {
+			const variant = byGroup?.get(group);
+			if (variant) entries.push(variant);
+		}
+		resolved[slug] = page.nextCursor ? {
+			collection,
+			entries,
+			nextCursor: page.nextCursor
+		} : {
+			collection,
+			entries
+		};
+	}
+	return resolved;
+}
+
+//#endregion
+export { resolveReferencePages };
+//# sourceMappingURL=resolve-BPE8sMvx.mjs.map

package/dist/resolve-BPE8sMvx.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-BPE8sMvx.mjs","names":[],"sources":["../src/references/resolve.ts"],"sourcesContent":["/**\n * Resolve an entry's reference selections to loadable entries, for the public\n * query path.\n *\n * The cost is bounded and predictable: one link read per selected field, then\n * one entry read per *distinct* target collection — never one per link. A\n * caller that selects no fields issues nothing at all, which is what keeps\n * references off the logged-out hot path of every render that does not ask for\n * them.\n */\n\nimport { RelationRepository } from \"../database/repositories/relation.js\";\nimport { RevisionRepository } from \"../database/repositories/revision.js\";\nimport { getFallbackChain, isI18nEnabled } from \"../i18n/config.js\";\nimport { getDb, loadEntriesByGroups, type LoadedEntry } from \"../loader.js\";\nimport { getReferenceFieldMap } from \"./field-map.js\";\nimport {\n\tpageStagedGroups,\n\treadStagedReferences,\n\tREFERENCE_PAGE_LIMIT,\n\tREFERENCE_PAGE_MAX_LIMIT,\n\ttype PageOfGroups,\n} from \"./staged.js\";\nimport type { ReferenceQuery, ReferenceSelection } from \"./types.js\";\n\n/** One reference field's resolved page, before the query layer wraps the entries. */\nexport interface ResolvedReferencePage {\n\t/** The collection the entries belong to — what the `edit` proxy is scoped to. */\n\tcollection: string;\n\tentries: LoadedEntry[];\n\tnextCursor?: string;\n}\n\nexport interface ResolveReferencesOptions {\n\t/** The collection the selecting entry belongs to. */\n\tcollection: string;\n\t/** The selecting entry's own translation group. */\n\tentryGroup: string;\n\t/** The locale the parent resolved to, used to pick each target's variant. */\n\tlocale: string | null;\n\t/** The selecting entry's draft revision, when it has one. */\n\tdraftRevisionId?: string;\n\t/**\n\t * Whether this render may see unpublished content. It decides both halves of\n\t * draft visibility: whether a pending selection staged in the draft revision\n\t * replaces the published one, and whether an unpublished target resolves at\n\t * all.\n\t */\n\tserveDrafts: boolean;\n\t/** The fields to resolve, by field slug. */\n\tselection: ReferenceSelection;\n}\n\nfunction pageOptions(query: ReferenceQuery): { limit: number; cursor?: string } {\n\tif (query === true) return { limit: REFERENCE_PAGE_LIMIT };\n\tconst requested = query.limit ?? REFERENCE_PAGE_LIMIT;\n\treturn {\n\t\tlimit: Math.min(Math.max(requested, 1), REFERENCE_PAGE_MAX_LIMIT),\n\t\tcursor: query.cursor,\n\t};\n}\n\nfunction localeChainFor(locale: string | null): string[] {\n\tif (locale === null) return [];\n\treturn isI18nEnabled() ? getFallbackChain(locale) : [locale];\n}\n\nexport async function resolveReferencePages(\n\toptions: ResolveReferencesOptions,\n): Promise<Record<string, ResolvedReferencePage>> {\n\tconst fieldMap = await getReferenceFieldMap(options.collection);\n\tconst requested = Object.entries(options.selection).filter(\n\t\t(entry): entry is [string, ReferenceQuery] => entry[1] !== undefined && fieldMap.has(entry[0]),\n\t);\n\tif (requested.length === 0) return {};\n\n\tconst db = await getDb();\n\tconst relations = new RelationRepository(db);\n\n\tconst staged =\n\t\toptions.serveDrafts && options.draftRevisionId\n\t\t\t? readStagedReferences(\n\t\t\t\t\t(await new RevisionRepository(db).findById(options.draftRevisionId))?.data,\n\t\t\t\t)\n\t\t\t: undefined;\n\n\t// Phase one: each field's page of translation groups, in selection order.\n\t// Concurrent, like phase two — the fields are independent, and awaiting them\n\t// in turn would make N fields N sequential round trips.\n\tconst pages = new Map(\n\t\tawait Promise.all(\n\t\t\trequested.map(async ([slug, query]): Promise<[string, PageOfGroups]> => {\n\t\t\t\tconst binding = fieldMap.get(slug)!;\n\t\t\t\tconst page = pageOptions(query);\n\n\t\t\t\tconst stagedGroups = staged?.[slug];\n\t\t\t\tif (stagedGroups) return [slug, pageStagedGroups(stagedGroups, page)];\n\n\t\t\t\tconst links =\n\t\t\t\t\tbinding.side === \"child\"\n\t\t\t\t\t\t? await relations.getParentsPageById(binding.relationId, options.entryGroup, page)\n\t\t\t\t\t\t: await relations.getChildrenPageById(binding.relationId, options.entryGroup, page);\n\t\t\t\treturn [\n\t\t\t\t\tslug,\n\t\t\t\t\t{\n\t\t\t\t\t\tgroups: links.items.map((link) =>\n\t\t\t\t\t\t\tbinding.side === \"child\" ? link.parentGroup : link.childGroup,\n\t\t\t\t\t\t),\n\t\t\t\t\t\tnextCursor: links.nextCursor,\n\t\t\t\t\t},\n\t\t\t\t];\n\t\t\t}),\n\t\t),\n\t);\n\n\t// Phase two: one entry read per distinct target collection, however many\n\t// fields point at it.\n\tconst groupsByCollection = new Map<string, Set<string>>();\n\tfor (const [slug, page] of pages) {\n\t\tconst target = fieldMap.get(slug)!.targetCollection;\n\t\tconst groups = groupsByCollection.get(target) ?? new Set<string>();\n\t\tfor (const group of page.groups) groups.add(group);\n\t\tgroupsByCollection.set(target, groups);\n\t}\n\n\tconst localeChain = localeChainFor(options.locale);\n\tconst variantsByCollection = new Map<string, Map<string, LoadedEntry>>();\n\tawait Promise.all(\n\t\tArray.from(groupsByCollection, async ([collection, groups]) => {\n\t\t\tconst loaded = await loadEntriesByGroups(collection, [...groups], {\n\t\t\t\tpublishedOnly: !options.serveDrafts,\n\t\t\t\tlocaleChain,\n\t\t\t});\n\t\t\tconst byGroup = new Map<string, LoadedEntry>();\n\t\t\tfor (const entry of loaded) {\n\t\t\t\tconst group = entry.data.translationGroup;\n\t\t\t\tif (typeof group === \"string\") byGroup.set(group, entry);\n\t\t\t}\n\t\t\tvariantsByCollection.set(collection, byGroup);\n\t\t}),\n\t);\n\n\t// Phase three: rebuild each field in link order. A group with no surviving\n\t// variant — deleted, or unpublished for a render that may not see drafts —\n\t// drops out, exactly as a dangling link does.\n\tconst resolved: Record<string, ResolvedReferencePage> = {};\n\tfor (const [slug, page] of pages) {\n\t\tconst collection = fieldMap.get(slug)!.targetCollection;\n\t\tconst byGroup = variantsByCollection.get(collection);\n\t\tconst entries: LoadedEntry[] = [];\n\t\tfor (const group of page.groups) {\n\t\t\tconst variant = byGroup?.get(group);\n\t\t\tif (variant) entries.push(variant);\n\t\t}\n\t\tresolved[slug] = page.nextCursor\n\t\t\t? { collection, entries, nextCursor: page.nextCursor }\n\t\t\t: { collection, entries };\n\t}\n\treturn resolved;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAqDA,SAAS,YAAY,OAA2D;AAC/E,KAAI,UAAU,KAAM,QAAO,EAAE,OAAO,sBAAsB;CAC1D,MAAM,YAAY,MAAM,SAAS;AACjC,QAAO;EACN,OAAO,KAAK,IAAI,KAAK,IAAI,WAAW,EAAE,EAAE,yBAAyB;EACjE,QAAQ,MAAM;EACd;;AAGF,SAAS,eAAe,QAAiC;AACxD,KAAI,WAAW,KAAM,QAAO,EAAE;AAC9B,QAAO,eAAe,GAAG,iBAAiB,OAAO,GAAG,CAAC,OAAO;;AAG7D,eAAsB,sBACrB,SACiD;CACjD,MAAM,WAAW,MAAM,qBAAqB,QAAQ,WAAW;CAC/D,MAAM,YAAY,OAAO,QAAQ,QAAQ,UAAU,CAAC,QAClD,UAA6C,MAAM,OAAO,UAAa,SAAS,IAAI,MAAM,GAAG,CAC9F;AACD,KAAI,UAAU,WAAW,EAAG,QAAO,EAAE;CAErC,MAAM,KAAK,MAAM,OAAO;CACxB,MAAM,YAAY,IAAI,mBAAmB,GAAG;CAE5C,MAAM,SACL,QAAQ,eAAe,QAAQ,kBAC5B,sBACC,MAAM,IAAI,mBAAmB,GAAG,CAAC,SAAS,QAAQ,gBAAgB,GAAG,KACtE,GACA;CAKJ,MAAM,QAAQ,IAAI,IACjB,MAAM,QAAQ,IACb,UAAU,IAAI,OAAO,CAAC,MAAM,WAA4C;EACvE,MAAM,UAAU,SAAS,IAAI,KAAK;EAClC,MAAM,OAAO,YAAY,MAAM;EAE/B,MAAM,eAAe,SAAS;AAC9B,MAAI,aAAc,QAAO,CAAC,MAAM,iBAAiB,cAAc,KAAK,CAAC;EAErE,MAAM,QACL,QAAQ,SAAS,UACd,MAAM,UAAU,mBAAmB,QAAQ,YAAY,QAAQ,YAAY,KAAK,GAChF,MAAM,UAAU,oBAAoB,QAAQ,YAAY,QAAQ,YAAY,KAAK;AACrF,SAAO,CACN,MACA;GACC,QAAQ,MAAM,MAAM,KAAK,SACxB,QAAQ,SAAS,UAAU,KAAK,cAAc,KAAK,WACnD;GACD,YAAY,MAAM;GAClB,CACD;GACA,CACF,CACD;CAID,MAAM,qCAAqB,IAAI,KAA0B;AACzD,MAAK,MAAM,CAAC,MAAM,SAAS,OAAO;EACjC,MAAM,SAAS,SAAS,IAAI,KAAK,CAAE;EACnC,MAAM,SAAS,mBAAmB,IAAI,OAAO,oBAAI,IAAI,KAAa;AAClE,OAAK,MAAM,SAAS,KAAK,OAAQ,QAAO,IAAI,MAAM;AAClD,qBAAmB,IAAI,QAAQ,OAAO;;CAGvC,MAAM,cAAc,eAAe,QAAQ,OAAO;CAClD,MAAM,uCAAuB,IAAI,KAAuC;AACxE,OAAM,QAAQ,IACb,MAAM,KAAK,oBAAoB,OAAO,CAAC,YAAY,YAAY;EAC9D,MAAM,SAAS,MAAM,oBAAoB,YAAY,CAAC,GAAG,OAAO,EAAE;GACjE,eAAe,CAAC,QAAQ;GACxB;GACA,CAAC;EACF,MAAM,0BAAU,IAAI,KAA0B;AAC9C,OAAK,MAAM,SAAS,QAAQ;GAC3B,MAAM,QAAQ,MAAM,KAAK;AACzB,OAAI,OAAO,UAAU,SAAU,SAAQ,IAAI,OAAO,MAAM;;AAEzD,uBAAqB,IAAI,YAAY,QAAQ;GAC5C,CACF;CAKD,MAAM,WAAkD,EAAE;AAC1D,MAAK,MAAM,CAAC,MAAM,SAAS,OAAO;EACjC,MAAM,aAAa,SAAS,IAAI,KAAK,CAAE;EACvC,MAAM,UAAU,qBAAqB,IAAI,WAAW;EACpD,MAAM,UAAyB,EAAE;AACjC,OAAK,MAAM,SAAS,KAAK,QAAQ;GAChC,MAAM,UAAU,SAAS,IAAI,MAAM;AACnC,OAAI,QAAS,SAAQ,KAAK,QAAQ;;AAEnC,WAAS,QAAQ,KAAK,aACnB;GAAE;GAAY;GAAS,YAAY,KAAK;GAAY,GACpD;GAAE;GAAY;GAAS;;AAE3B,QAAO"}