emdash 0.39.0 → 0.40.0

package/dist/registry/testing.mjs

@@ -1,6 +1,6 @@
-import { a as UNSUPPORTED_AUTH_MESSAGE, n as multihashFromBlobCid, o as unsupportedAuthDetails } from "../checksum-Bsi2D9M1.mjs";
-import "../ssrf-Co1GGFZz.mjs";
-import { n as setDefaultAuthoritativeRecordReaderForTesting } from "../authoritative-records-DbqshfKD.mjs";
+import { a as UNSUPPORTED_AUTH_MESSAGE, n as multihashFromBlobCid, o as unsupportedAuthDetails } from "../checksum-B2IINIlN.mjs";
+import "../ssrf-CJUnJymJ.mjs";
+import { n as setDefaultAuthoritativeRecordReaderForTesting } from "../authoritative-records-CoJvBXAD.mjs";
 import { canonicalizeDeclaredAccess, isPluginSlug, isPluginVersion } from "@emdash-cms/plugin-types";
 import { NSID, PackageProfile, PackageProfileExtension, PackageRelease, PackageReleaseExtension } from "@emdash-cms/registry-lexicons";
 

package/dist/relation-M4NUCb0b.mjs

@@ -0,0 +1,334 @@
+import { n as chunks, t as SQL_BATCH_SIZE } from "./chunks-Dms7Uxbt.mjs";
+import { i as InvalidCursorError, o as decodeCursor, s as encodeCursor } from "./types-BkUg2yHx.mjs";
+import { ulid } from "ulidx";
+
+//#region src/database/repositories/relation.ts
+/**
+* Content-references repository.
+*
+* Owns relation *definitions* (`_emdash_relations`, row-per-locale, mirroring
+* `_emdash_taxonomy_defs`) and the *edge* junction (`_emdash_content_references`,
+* keyed by `translation_group` so edges are locale-agnostic, mirroring
+* `content_taxonomies`).
+*
+* Like `TaxonomyRepository`, this is not the validation boundary: it trusts its
+* typed inputs. The API slice supplies Zod schemas at the route and enforces
+* collection-agreement / relation-existence invariants in the handler. The repo
+* does not resolve locale fallbacks — callers pass the locale they want.
+*/
+var RelationRepository = class {
+	constructor(db) {
+		this.db = db;
+	}
+	/**
+	* Create a relation. Without `translationOf`, mints a fresh group
+	* (`translation_group = id`, matching the migration backfill pattern). With
+	* `translationOf`, the structural fields (name, parentCollection,
+	* childCollection) and the translation_group are inherited from the source;
+	* locale and the two labels are taken from `input`.
+	*/
+	async create(input) {
+		const id = ulid();
+		const now = (/* @__PURE__ */ new Date()).toISOString();
+		let translationGroup = id;
+		let name;
+		let parentCollection;
+		let childCollection;
+		if (input.translationOf) {
+			const source = await this.findById(input.translationOf);
+			if (!source) throw new Error("Source relation for translation not found");
+			translationGroup = source.translationGroup;
+			name = source.name;
+			parentCollection = source.parentCollection;
+			childCollection = source.childCollection;
+		} else {
+			if (input.parentCollection === void 0 || input.childCollection === void 0) throw new Error("parentCollection and childCollection are required unless translationOf is set");
+			name = input.name;
+			parentCollection = input.parentCollection;
+			childCollection = input.childCollection;
+		}
+		await this.db.insertInto("_emdash_relations").values({
+			id,
+			name,
+			parent_collection: parentCollection,
+			child_collection: childCollection,
+			parent_label: input.parentLabel,
+			child_label: input.childLabel,
+			created_at: now,
+			updated_at: now,
+			...input.locale !== void 0 ? { locale: input.locale } : {},
+			translation_group: translationGroup
+		}).execute();
+		const relation = await this.findById(id);
+		if (!relation) throw new Error("Failed to create relation");
+		return relation;
+	}
+	async findById(id) {
+		const row = await this.db.selectFrom("_emdash_relations").selectAll().where("id", "=", id).executeTakeFirst();
+		return row ? this.rowToRelation(row) : null;
+	}
+	/**
+	* Find a relation by name. With `locale`, filter by it; without, return the
+	* lowest-locale-code match deterministically. Mirrors
+	* `TaxonomyRepository.findBySlug` — note this returns a single row, unlike
+	* `TaxonomyRepository.findByName` which returns every term in a taxonomy.
+	*/
+	async findByName(name, locale) {
+		let query = this.db.selectFrom("_emdash_relations").selectAll().where("name", "=", name);
+		if (locale !== void 0) query = query.where("locale", "=", locale);
+		const row = await query.orderBy("locale", "asc").executeTakeFirst();
+		return row ? this.rowToRelation(row) : null;
+	}
+	/** Every translation sibling (including itself) sharing a translation_group. */
+	async findTranslations(translationGroup) {
+		return (await this.db.selectFrom("_emdash_relations").selectAll().where("translation_group", "=", translationGroup).orderBy("locale", "asc").execute()).map((row) => this.rowToRelation(row));
+	}
+	/**
+	* All relations, ordered by name then id (id is a stable tiebreak for
+	* relations sharing a name across locales). Optionally filtered by locale.
+	*/
+	async list(locale) {
+		let query = this.db.selectFrom("_emdash_relations").selectAll().orderBy("name", "asc").orderBy("id", "asc");
+		if (locale !== void 0) query = query.where("locale", "=", locale);
+		return (await query.execute()).map((row) => this.rowToRelation(row));
+	}
+	/** Relations where `collection` is the parent OR the child side. */
+	async findForCollection(collection, locale) {
+		let query = this.db.selectFrom("_emdash_relations").selectAll().where((eb) => eb.or([eb("parent_collection", "=", collection), eb("child_collection", "=", collection)])).orderBy("name", "asc").orderBy("id", "asc");
+		if (locale !== void 0) query = query.where("locale", "=", locale);
+		return (await query.execute()).map((row) => this.rowToRelation(row));
+	}
+	/**
+	* Update the localized labels of one relation row. Structural fields are
+	* immutable here (a cross-group concern). No-ops when nothing is supplied.
+	*/
+	async update(id, input) {
+		if (!await this.findById(id)) return null;
+		const updates = {};
+		if (input.parentLabel !== void 0) updates.parent_label = input.parentLabel;
+		if (input.childLabel !== void 0) updates.child_label = input.childLabel;
+		if (Object.keys(updates).length > 0) {
+			updates.updated_at = (/* @__PURE__ */ new Date()).toISOString();
+			await this.db.updateTable("_emdash_relations").set(updates).where("id", "=", id).execute();
+		}
+		return this.findById(id);
+	}
+	/**
+	* Delete one relation row. When it is the *last* translation of its group,
+	* purge edges referencing that group (application-layer cascade — group
+	* linking precludes a SQL FK). Mirrors `TaxonomyRepository.delete`.
+	*/
+	async delete(id) {
+		const relation = await this.findById(id);
+		if (!relation) return false;
+		if ((await this.db.selectFrom("_emdash_relations").select("id").where("translation_group", "=", relation.translationGroup).where("id", "!=", id).execute()).length === 0) await this.db.deleteFrom("_emdash_content_references").where("relation_group", "=", relation.translationGroup).execute();
+		return ((await this.db.deleteFrom("_emdash_relations").where("id", "=", id).executeTakeFirst()).numDeletedRows ?? 0n) > 0n;
+	}
+	/** Normalize a relation id OR group to its translation_group. Returns null
+	* for an unknown relation (edge methods then no-op, matching
+	* `TaxonomyRepository.attachToEntry`). */
+	async resolveRelationGroup(idOrGroup) {
+		return (await this.db.selectFrom("_emdash_relations").select(["translation_group"]).where((eb) => eb.or([eb("id", "=", idOrGroup), eb("translation_group", "=", idOrGroup)])).executeTakeFirst())?.translation_group ?? null;
+	}
+	rowToReference(row) {
+		return {
+			id: row.id,
+			relationGroup: row.relation_group,
+			parentGroup: row.parent_group,
+			childGroup: row.child_group,
+			sortOrder: row.sort_order
+		};
+	}
+	/**
+	* Link `parentGroup → childGroup` under a relation. `relation` is a relation
+	* id or group. Idempotent (onConflict doNothing against the unique edge).
+	* `sortOrder` defaults to append: max(sort_order)+1 within (relation, parent).
+	*
+	* The default-append MAX→INSERT is not atomic: concurrent appends without an
+	* explicit `sortOrder` may both read the same max and collide on sort_order,
+	* and onConflict silently drops the loser. Callers needing strict ordering
+	* under concurrency should pass `sortOrder` explicitly (or serialize).
+	*/
+	async addReference(relation, parentGroup, childGroup, sortOrder) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return;
+		let order = sortOrder;
+		if (order === void 0) {
+			const max = await this.db.selectFrom("_emdash_content_references").select((eb) => eb.fn.max("sort_order").as("max")).where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup).executeTakeFirst();
+			order = max?.max === null || max?.max === void 0 ? 0 : Number(max.max) + 1;
+		}
+		await this.db.insertInto("_emdash_content_references").values({
+			id: ulid(),
+			relation_group: relationGroup,
+			parent_group: parentGroup,
+			child_group: childGroup,
+			sort_order: order,
+			created_at: (/* @__PURE__ */ new Date()).toISOString()
+		}).onConflict((oc) => oc.doNothing()).execute();
+	}
+	/** Remove one `parentGroup → childGroup` edge under a relation. */
+	async removeReference(relation, parentGroup, childGroup) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return;
+		await this.db.deleteFrom("_emdash_content_references").where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup).where("child_group", "=", childGroup).execute();
+	}
+	/** Forward traversal: a parent's children for a relation, ordered. */
+	async getChildren(relation, parentGroup) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return [];
+		return (await this.db.selectFrom("_emdash_content_references").selectAll().where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup).orderBy("sort_order", "asc").orderBy("id", "asc").execute()).map((row) => this.rowToReference(row));
+	}
+	/**
+	* Forward traversal, paginated: one page of a parent's children for a
+	* relation, ordered by `(sort_order, id)`. Use this on request paths — a
+	* parent's children are capped but still up to 1000, and an unbounded read
+	* scales poorly. Returns `{ items, nextCursor? }`; the cursor's order value is
+	* the row's `sort_order`. Default limit 50, max 100.
+	*/
+	async getChildrenPage(relation, parentGroup, options = {}) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return { items: [] };
+		const limit = Math.min(options.limit || 50, 100);
+		let query = this.db.selectFrom("_emdash_content_references").selectAll().where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup);
+		if (options.cursor) {
+			const decoded = decodeCursor(options.cursor);
+			const sortOrder = Number(decoded.orderValue);
+			if (!Number.isFinite(sortOrder)) throw new InvalidCursorError(options.cursor);
+			query = query.where((eb) => eb.or([eb("sort_order", ">", sortOrder), eb.and([eb("sort_order", "=", sortOrder), eb("id", ">", decoded.id)])]));
+		}
+		const rows = await query.orderBy("sort_order", "asc").orderBy("id", "asc").limit(limit + 1).execute();
+		const hasMore = rows.length > limit;
+		const items = rows.slice(0, limit).map((row) => this.rowToReference(row));
+		const result = { items };
+		const last = items.at(-1);
+		if (hasMore && last) result.nextCursor = encodeCursor(String(last.sortOrder), last.id);
+		return result;
+	}
+	/** Backlink traversal: the parents that reference a child for a relation. */
+	async getParents(relation, childGroup) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return [];
+		return (await this.db.selectFrom("_emdash_content_references").selectAll().where("relation_group", "=", relationGroup).where("child_group", "=", childGroup).orderBy("id", "asc").execute()).map((row) => this.rowToReference(row));
+	}
+	/**
+	* Replace all children of `parentGroup` under a relation with `childGroups`,
+	* assigning positional sort_order (index in the deduped array). Deletes the
+	* old set for this (relation, parent) and re-inserts — simple and correct;
+	* the set is small (one parent's children). Mirrors the intent of
+	* `TaxonomyRepository.setTermsForEntry`.
+	*
+	* A parent references a given child at most once (the unique edge), so
+	* duplicate `childGroups` are collapsed first-occurrence-wins rather than
+	* relying on the insert's onConflict to silently drop them. Not wrapped in a
+	* transaction: a crash between the delete and insert leaves the parent with
+	* no children — acceptable for a replace-all, since a retry restores state.
+	*
+	* Concurrency: two simultaneous replace-all calls for the same (relation,
+	* parent) can interleave their deletes and inserts and merge into the union of
+	* both sets (a lost update — neither "replace" wins). This is non-corrupting —
+	* keyset pagination stays totally ordered via the `(sort_order, id)` tiebreak
+	* even with duplicate sort_orders — and a single client editing one parent's
+	* children serially never hits it. A D1-portable fix isn't available (no
+	* multi-statement transactions), so concurrent replace-all on one parent is
+	* unsupported by design rather than guarded here.
+	*/
+	async setChildren(relation, parentGroup, childGroups) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return;
+		await this.db.deleteFrom("_emdash_content_references").where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup).execute();
+		const uniqueChildGroups = [...new Set(childGroups)];
+		if (uniqueChildGroups.length === 0) return;
+		const now = (/* @__PURE__ */ new Date()).toISOString();
+		await this.db.insertInto("_emdash_content_references").values(uniqueChildGroups.map((childGroup, index) => ({
+			id: ulid(),
+			relation_group: relationGroup,
+			parent_group: parentGroup,
+			child_group: childGroup,
+			sort_order: index,
+			created_at: now
+		}))).onConflict((oc) => oc.doNothing()).execute();
+	}
+	/**
+	* Backlink traversal, paginated: one page of the parents that reference a
+	* child for a relation, ordered by `id`. Unlike a parent's children, a
+	* child's backlinks are *unbounded* — one popular entry can be referenced by
+	* arbitrarily many parents — so this read must paginate. Returns
+	* `{ items, nextCursor? }`; the cursor's order value is the row `id`. Default
+	* limit 50, max 100.
+	*/
+	async getParentsPage(relation, childGroup, options = {}) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return { items: [] };
+		const limit = Math.min(options.limit || 50, 100);
+		let query = this.db.selectFrom("_emdash_content_references").selectAll().where("relation_group", "=", relationGroup).where("child_group", "=", childGroup);
+		if (options.cursor) {
+			const decoded = decodeCursor(options.cursor);
+			query = query.where("id", ">", decoded.id);
+		}
+		const rows = await query.orderBy("id", "asc").limit(limit + 1).execute();
+		const hasMore = rows.length > limit;
+		const items = rows.slice(0, limit).map((row) => this.rowToReference(row));
+		const result = { items };
+		const last = items.at(-1);
+		if (hasMore && last) result.nextCursor = encodeCursor(last.id, last.id);
+		return result;
+	}
+	/**
+	* Remove every edge where `group` is the parent OR the child — i.e. ensure no
+	* orphaned reference edges survive when a content entry is deleted. The
+	* application-layer cascade that group-linking precludes at the SQL level.
+	* Wiring this into the content-delete path is a later (handler) slice.
+	* Returns the number of edges removed.
+	*/
+	async clearReferencesForGroup(group) {
+		const result = await this.db.deleteFrom("_emdash_content_references").where((eb) => eb.or([eb("parent_group", "=", group), eb("child_group", "=", group)])).executeTakeFirst();
+		return Number(result.numDeletedRows ?? 0);
+	}
+	/** Count a parent's children under a relation. */
+	async countChildren(relation, parentGroup) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return 0;
+		const result = await this.db.selectFrom("_emdash_content_references").select((eb) => eb.fn.count("id").as("count")).where("relation_group", "=", relationGroup).where("parent_group", "=", parentGroup).executeTakeFirst();
+		return Number(result?.count ?? 0);
+	}
+	/** Count a child's parents (backlinks) under a relation. */
+	async countParents(relation, childGroup) {
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return 0;
+		const result = await this.db.selectFrom("_emdash_content_references").select((eb) => eb.fn.count("id").as("count")).where("relation_group", "=", relationGroup).where("child_group", "=", childGroup).executeTakeFirst();
+		return Number(result?.count ?? 0);
+	}
+	/**
+	* Batch child-counts for many parents under a relation. Chunks at
+	* SQL_BATCH_SIZE for D1's bind-parameter limit. Returns parent_group → count
+	* (parents with no children are absent from the map). Mirrors
+	* `TaxonomyRepository.countEntriesForTerms`.
+	*/
+	async countChildrenForParents(relation, parentGroups) {
+		const counts = /* @__PURE__ */ new Map();
+		if (parentGroups.length === 0) return counts;
+		const relationGroup = await this.resolveRelationGroup(relation);
+		if (!relationGroup) return counts;
+		for (const chunk of chunks(parentGroups, SQL_BATCH_SIZE)) {
+			const rows = await this.db.selectFrom("_emdash_content_references").select(["parent_group", (eb) => eb.fn.count("id").as("count")]).where("relation_group", "=", relationGroup).where("parent_group", "in", chunk).groupBy("parent_group").execute();
+			for (const row of rows) counts.set(row.parent_group, Number(row.count ?? 0));
+		}
+		return counts;
+	}
+	rowToRelation(row) {
+		return {
+			id: row.id,
+			name: row.name,
+			parentCollection: row.parent_collection,
+			childCollection: row.child_collection,
+			parentLabel: row.parent_label,
+			childLabel: row.child_label,
+			locale: row.locale,
+			translationGroup: row.translation_group
+		};
+	}
+};
+
+//#endregion
+export { RelationRepository as t };
+//# sourceMappingURL=relation-M4NUCb0b.mjs.map

package/dist/relation-M4NUCb0b.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-M4NUCb0b.mjs","names":[],"sources":["../src/database/repositories/relation.ts"],"sourcesContent":["import type { Kysely, 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 { decodeCursor, encodeCursor, InvalidCursorError, type FindManyResult } from \"./types.js\";\n\nexport interface Relation {\n\tid: string;\n\tname: string;\n\tparentCollection: string;\n\tchildCollection: string;\n\tparentLabel: string;\n\tchildLabel: string;\n\tlocale: string;\n\ttranslationGroup: string;\n}\n\nexport interface CreateRelationInput {\n\tname: string;\n\t/** Required for a base relation; ignored (inherited from the source) when\n\t * `translationOf` is set. */\n\tparentCollection?: string;\n\t/** Required for a base relation; ignored (inherited from the source) when\n\t * `translationOf` is set. */\n\tchildCollection?: string;\n\tparentLabel: string;\n\tchildLabel: string;\n\t/** Omit to let the DB default (current value: 'en') apply. Higher layers\n\t * resolve locale from request context / i18n config. */\n\tlocale?: string;\n\t/** When set, joins the source relation's translation_group AND inherits its\n\t * structural fields (name, parentCollection, childCollection). Only locale +\n\t * labels may differ on a translation. */\n\ttranslationOf?: string;\n}\n\nexport interface UpdateRelationInput {\n\t/** Only localized fields are mutable per row. Changing structural fields\n\t * (name/collections) is a cross-group operation deferred to a later slice. */\n\tparentLabel?: string;\n\tchildLabel?: string;\n}\n\nexport interface ContentReference {\n\tid: string;\n\trelationGroup: string;\n\tparentGroup: string;\n\tchildGroup: string;\n\tsortOrder: number;\n}\n\n/**\n * Content-references repository.\n *\n * Owns relation *definitions* (`_emdash_relations`, row-per-locale, mirroring\n * `_emdash_taxonomy_defs`) and the *edge* junction (`_emdash_content_references`,\n * keyed by `translation_group` so edges are locale-agnostic, mirroring\n * `content_taxonomies`).\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. The repo\n * does not resolve locale fallbacks — callers pass the locale they want.\n */\nexport class RelationRepository {\n\tconstructor(private db: Kysely<Database>) {}\n\n\t/**\n\t * Create a relation. Without `translationOf`, mints a fresh group\n\t * (`translation_group = id`, matching the migration backfill pattern). With\n\t * `translationOf`, the structural fields (name, parentCollection,\n\t * childCollection) and the translation_group are inherited from the source;\n\t * locale and the two labels are taken from `input`.\n\t */\n\tasync create(input: CreateRelationInput): Promise<Relation> {\n\t\tconst id = ulid();\n\t\tconst now = new Date().toISOString();\n\n\t\tlet translationGroup = id;\n\t\tlet name: string;\n\t\tlet parentCollection: string;\n\t\tlet childCollection: string;\n\n\t\tif (input.translationOf) {\n\t\t\tconst source = await this.findById(input.translationOf);\n\t\t\t// translation_group is NOT NULL here, so we cannot fall back to a\n\t\t\t// fresh group like TaxonomyRepository does — a bad translationOf must\n\t\t\t// fail loudly rather than silently mint an unlinked relation.\n\t\t\tif (!source) throw new Error(\"Source relation for translation not found\");\n\t\t\ttranslationGroup = source.translationGroup;\n\t\t\tname = source.name;\n\t\t\tparentCollection = source.parentCollection;\n\t\t\tchildCollection = source.childCollection;\n\t\t} else {\n\t\t\t// A base relation carries its own structural fields. The API layer's Zod\n\t\t\t// schema enforces this; guard here too since the repo trusts its inputs\n\t\t\t// and the columns are NOT NULL.\n\t\t\tif (input.parentCollection === undefined || input.childCollection === undefined) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"parentCollection and childCollection are required unless translationOf is set\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tname = input.name;\n\t\t\tparentCollection = input.parentCollection;\n\t\t\tchildCollection = input.childCollection;\n\t\t}\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\tname,\n\t\t\t\tparent_collection: parentCollection,\n\t\t\t\tchild_collection: childCollection,\n\t\t\t\tparent_label: input.parentLabel,\n\t\t\t\tchild_label: input.childLabel,\n\t\t\t\tcreated_at: now,\n\t\t\t\tupdated_at: now,\n\t\t\t\t// Omit `locale` so the DB DEFAULT (configured defaultLocale)\n\t\t\t\t// applies — matches TaxonomyRepository.create.\n\t\t\t\t...(input.locale !== undefined ? { locale: input.locale } : {}),\n\t\t\t\ttranslation_group: translationGroup,\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 name. With `locale`, filter by it; without, return the\n\t * lowest-locale-code match deterministically. Mirrors\n\t * `TaxonomyRepository.findBySlug` — note this returns a single row, unlike\n\t * `TaxonomyRepository.findByName` which returns every term in a taxonomy.\n\t */\n\tasync findByName(name: string, locale?: string): Promise<Relation | null> {\n\t\tlet query = this.db.selectFrom(\"_emdash_relations\").selectAll().where(\"name\", \"=\", name);\n\t\tif (locale !== undefined) query = query.where(\"locale\", \"=\", locale);\n\t\tconst row = await query.orderBy(\"locale\", \"asc\").executeTakeFirst();\n\t\treturn row ? this.rowToRelation(row) : null;\n\t}\n\n\t/** Every translation sibling (including itself) sharing a translation_group. */\n\tasync findTranslations(translationGroup: 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(\"translation_group\", \"=\", translationGroup)\n\t\t\t.orderBy(\"locale\", \"asc\")\n\t\t\t.execute();\n\t\treturn rows.map((row) => this.rowToRelation(row));\n\t}\n\n\t/**\n\t * All relations, ordered by name then id (id is a stable tiebreak for\n\t * relations sharing a name across locales). Optionally filtered by locale.\n\t */\n\tasync list(locale?: string): Promise<Relation[]> {\n\t\tlet query = this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.selectAll()\n\t\t\t.orderBy(\"name\", \"asc\")\n\t\t\t.orderBy(\"id\", \"asc\");\n\t\tif (locale !== undefined) query = query.where(\"locale\", \"=\", locale);\n\t\tconst rows = await query.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, locale?: string): Promise<Relation[]> {\n\t\tlet query = 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(\"name\", \"asc\")\n\t\t\t.orderBy(\"id\", \"asc\");\n\t\tif (locale !== undefined) query = query.where(\"locale\", \"=\", locale);\n\t\tconst rows = await query.execute();\n\t\treturn rows.map((row) => this.rowToRelation(row));\n\t}\n\n\t/**\n\t * Update the localized labels of one relation row. Structural fields are\n\t * immutable here (a cross-group concern). 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\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 one relation row. When it is the *last* translation of its group,\n\t * purge edges referencing that group (application-layer cascade — group\n\t * linking precludes a SQL FK). Mirrors `TaxonomyRepository.delete`.\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\tconst siblings = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.select(\"id\")\n\t\t\t.where(\"translation_group\", \"=\", relation.translationGroup)\n\t\t\t.where(\"id\", \"!=\", id)\n\t\t\t.execute();\n\t\tif (siblings.length === 0) {\n\t\t\tawait this.db\n\t\t\t\t.deleteFrom(\"_emdash_content_references\")\n\t\t\t\t.where(\"relation_group\", \"=\", relation.translationGroup)\n\t\t\t\t.execute();\n\t\t}\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/** Normalize a relation id OR group to its translation_group. Returns null\n\t * for an unknown relation (edge methods then no-op, matching\n\t * `TaxonomyRepository.attachToEntry`). */\n\tprivate async resolveRelationGroup(idOrGroup: string): Promise<string | null> {\n\t\tconst row = await this.db\n\t\t\t.selectFrom(\"_emdash_relations\")\n\t\t\t.select([\"translation_group\"])\n\t\t\t.where((eb) => eb.or([eb(\"id\", \"=\", idOrGroup), eb(\"translation_group\", \"=\", idOrGroup)]))\n\t\t\t.executeTakeFirst();\n\t\treturn row?.translation_group ?? null;\n\t}\n\n\tprivate rowToReference(row: Selectable<ContentReferenceTable>): ContentReference {\n\t\treturn {\n\t\t\tid: row.id,\n\t\t\trelationGroup: row.relation_group,\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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_group: relationGroup,\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) return;\n\n\t\tawait this.db\n\t\t\t.deleteFrom(\"_emdash_content_references\")\n\t\t\t.where(\"relation_group\", \"=\", relationGroup)\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) return { items: [] };\n\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_group\", \"=\", relationGroup)\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\tconst sortOrder = Number(decoded.orderValue);\n\t\t\t// `decodeCursor` only guarantees `orderValue` is a string; a hand-crafted\n\t\t\t// cursor with a non-numeric order value would coerce to NaN and blow up at\n\t\t\t// the driver bind as a 500. A bad cursor is a client error — surface it as\n\t\t\t// INVALID_CURSOR (400). Server-issued cursors are always numeric here.\n\t\t\tif (!Number.isFinite(sortOrder)) throw new InvalidCursorError(options.cursor);\n\t\t\tquery = query.where((eb) =>\n\t\t\t\teb.or([\n\t\t\t\t\teb(\"sort_order\", \">\", sortOrder),\n\t\t\t\t\teb.and([eb(\"sort_order\", \"=\", sortOrder), eb(\"id\", \">\", decoded.id)]),\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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). Deletes the\n\t * old set for this (relation, parent) and re-inserts — simple and correct;\n\t * the set is small (one parent's children). Mirrors the intent of\n\t * `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. Not wrapped in a\n\t * transaction: a crash between the delete and insert leaves the parent with\n\t * no children — acceptable for a replace-all, since a retry restores state.\n\t *\n\t * Concurrency: two simultaneous replace-all calls for the same (relation,\n\t * parent) can interleave their deletes and inserts and merge into the union of\n\t * both sets (a lost update — neither \"replace\" wins). This is non-corrupting —\n\t * keyset pagination stays totally ordered via the `(sort_order, id)` tiebreak\n\t * even with duplicate sort_orders — and a single client editing one parent's\n\t * children serially never hits it. A D1-portable fix isn't available (no\n\t * multi-statement transactions), so concurrent replace-all on one parent is\n\t * unsupported by design rather than guarded here.\n\t */\n\tasync setChildren(relation: string, parentGroup: string, childGroups: string[]): Promise<void> {\n\t\tconst relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) return;\n\n\t\tawait this.db\n\t\t\t.deleteFrom(\"_emdash_content_references\")\n\t\t\t.where(\"relation_group\", \"=\", relationGroup)\n\t\t\t.where(\"parent_group\", \"=\", parentGroup)\n\t\t\t.execute();\n\n\t\t// Collapse duplicates so positional sort_order has no gaps.\n\t\tconst uniqueChildGroups = [...new Set(childGroups)];\n\t\tif (uniqueChildGroups.length === 0) return;\n\n\t\tconst now = new Date().toISOString();\n\t\tawait this.db\n\t\t\t.insertInto(\"_emdash_content_references\")\n\t\t\t.values(\n\t\t\t\tuniqueChildGroups.map((childGroup, index) => ({\n\t\t\t\t\tid: ulid(),\n\t\t\t\t\trelation_group: relationGroup,\n\t\t\t\t\tparent_group: parentGroup,\n\t\t\t\t\tchild_group: childGroup,\n\t\t\t\t\tsort_order: index,\n\t\t\t\t\tcreated_at: now,\n\t\t\t\t})),\n\t\t\t)\n\t\t\t// Belt-and-suspenders: the DELETE above already cleared this\n\t\t\t// (relation, parent), so no conflict is possible within one call.\n\t\t\t// This is NOT a concurrency guarantee — delete-then-insert is not atomic.\n\t\t\t.onConflict((oc) => oc.doNothing())\n\t\t\t.execute();\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) return { items: [] };\n\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_group\", \"=\", relationGroup)\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\tquery = query.where(\"id\", \">\", decoded.id);\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 * Wiring this into the content-delete path is a later (handler) slice.\n\t * 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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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 * 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 relationGroup = await this.resolveRelationGroup(relation);\n\t\tif (!relationGroup) 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_group\", \"=\", relationGroup)\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\tname: row.name,\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\tlocale: row.locale,\n\t\t\ttranslationGroup: row.translation_group,\n\t\t};\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAiEA,IAAa,qBAAb,MAAgC;CAC/B,YAAY,AAAQ,IAAsB;EAAtB;;;;;;;;;CASpB,MAAM,OAAO,OAA+C;EAC3D,MAAM,KAAK,MAAM;EACjB,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;EAEpC,IAAI,mBAAmB;EACvB,IAAI;EACJ,IAAI;EACJ,IAAI;AAEJ,MAAI,MAAM,eAAe;GACxB,MAAM,SAAS,MAAM,KAAK,SAAS,MAAM,cAAc;AAIvD,OAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,4CAA4C;AACzE,sBAAmB,OAAO;AAC1B,UAAO,OAAO;AACd,sBAAmB,OAAO;AAC1B,qBAAkB,OAAO;SACnB;AAIN,OAAI,MAAM,qBAAqB,UAAa,MAAM,oBAAoB,OACrE,OAAM,IAAI,MACT,gFACA;AAEF,UAAO,MAAM;AACb,sBAAmB,MAAM;AACzB,qBAAkB,MAAM;;AAGzB,QAAM,KAAK,GACT,WAAW,oBAAoB,CAC/B,OAAO;GACP;GACA;GACA,mBAAmB;GACnB,kBAAkB;GAClB,cAAc,MAAM;GACpB,aAAa,MAAM;GACnB,YAAY;GACZ,YAAY;GAGZ,GAAI,MAAM,WAAW,SAAY,EAAE,QAAQ,MAAM,QAAQ,GAAG,EAAE;GAC9D,mBAAmB;GACnB,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;;;;;;;;CASxC,MAAM,WAAW,MAAc,QAA2C;EACzE,IAAI,QAAQ,KAAK,GAAG,WAAW,oBAAoB,CAAC,WAAW,CAAC,MAAM,QAAQ,KAAK,KAAK;AACxF,MAAI,WAAW,OAAW,SAAQ,MAAM,MAAM,UAAU,KAAK,OAAO;EACpE,MAAM,MAAM,MAAM,MAAM,QAAQ,UAAU,MAAM,CAAC,kBAAkB;AACnE,SAAO,MAAM,KAAK,cAAc,IAAI,GAAG;;;CAIxC,MAAM,iBAAiB,kBAA+C;AAOrE,UANa,MAAM,KAAK,GACtB,WAAW,oBAAoB,CAC/B,WAAW,CACX,MAAM,qBAAqB,KAAK,iBAAiB,CACjD,QAAQ,UAAU,MAAM,CACxB,SAAS,EACC,KAAK,QAAQ,KAAK,cAAc,IAAI,CAAC;;;;;;CAOlD,MAAM,KAAK,QAAsC;EAChD,IAAI,QAAQ,KAAK,GACf,WAAW,oBAAoB,CAC/B,WAAW,CACX,QAAQ,QAAQ,MAAM,CACtB,QAAQ,MAAM,MAAM;AACtB,MAAI,WAAW,OAAW,SAAQ,MAAM,MAAM,UAAU,KAAK,OAAO;AAEpE,UADa,MAAM,MAAM,SAAS,EACtB,KAAK,QAAQ,KAAK,cAAc,IAAI,CAAC;;;CAIlD,MAAM,kBAAkB,YAAoB,QAAsC;EACjF,IAAI,QAAQ,KAAK,GACf,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,QAAQ,MAAM,MAAM;AACtB,MAAI,WAAW,OAAW,SAAQ,MAAM,MAAM,UAAU,KAAK,OAAO;AAEpE,UADa,MAAM,MAAM,SAAS,EACtB,KAAK,QAAQ,KAAK,cAAc,IAAI,CAAC;;;;;;CAOlD,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;AAEhE,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;;;;;;;CAQzB,MAAM,OAAO,IAA8B;EAC1C,MAAM,WAAW,MAAM,KAAK,SAAS,GAAG;AACxC,MAAI,CAAC,SAAU,QAAO;AAQtB,OANiB,MAAM,KAAK,GAC1B,WAAW,oBAAoB,CAC/B,OAAO,KAAK,CACZ,MAAM,qBAAqB,KAAK,SAAS,iBAAiB,CAC1D,MAAM,MAAM,MAAM,GAAG,CACrB,SAAS,EACE,WAAW,EACvB,OAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,MAAM,kBAAkB,KAAK,SAAS,iBAAiB,CACvD,SAAS;AAOZ,WAJe,MAAM,KAAK,GACxB,WAAW,oBAAoB,CAC/B,MAAM,MAAM,KAAK,GAAG,CACpB,kBAAkB,EACL,kBAAkB,MAAM;;;;;CAMxC,MAAc,qBAAqB,WAA2C;AAM7E,UALY,MAAM,KAAK,GACrB,WAAW,oBAAoB,CAC/B,OAAO,CAAC,oBAAoB,CAAC,CAC7B,OAAO,OAAO,GAAG,GAAG,CAAC,GAAG,MAAM,KAAK,UAAU,EAAE,GAAG,qBAAqB,KAAK,UAAU,CAAC,CAAC,CAAC,CACzF,kBAAkB,GACR,qBAAqB;;CAGlC,AAAQ,eAAe,KAA0D;AAChF,SAAO;GACN,IAAI,IAAI;GACR,eAAe,IAAI;GACnB,aAAa,IAAI;GACjB,YAAY,IAAI;GAChB,WAAW,IAAI;GACf;;;;;;;;;;;;CAaF,MAAM,aACL,UACA,aACA,YACA,WACgB;EAChB,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe;EAEpB,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,kBAAkB,KAAK,cAAc,CAC3C,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,gBAAgB;GAChB,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,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe;AAEpB,QAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,gBAAgB,KAAK,YAAY,CACvC,MAAM,eAAe,KAAK,WAAW,CACrC,SAAS;;;CAIZ,MAAM,YAAY,UAAkB,aAAkD;EACrF,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO,EAAE;AAU7B,UARa,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,kBAAkB,KAAK,cAAc,CAC3C,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,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO,EAAE,OAAO,EAAE,EAAE;EAExC,MAAM,QAAQ,KAAK,IAAI,QAAQ,SAAS,IAAI,IAAI;EAEhD,IAAI,QAAQ,KAAK,GACf,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,gBAAgB,KAAK,YAAY;AAEzC,MAAI,QAAQ,QAAQ;GACnB,MAAM,UAAU,aAAa,QAAQ,OAAO;GAC5C,MAAM,YAAY,OAAO,QAAQ,WAAW;AAK5C,OAAI,CAAC,OAAO,SAAS,UAAU,CAAE,OAAM,IAAI,mBAAmB,QAAQ,OAAO;AAC7E,WAAQ,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;;EAGF,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,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO,EAAE;AAS7B,UAPa,MAAM,KAAK,GACtB,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,eAAe,KAAK,WAAW,CACrC,QAAQ,MAAM,MAAM,CACpB,SAAS,EACC,KAAK,QAAQ,KAAK,eAAe,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;CAyBnD,MAAM,YAAY,UAAkB,aAAqB,aAAsC;EAC9F,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe;AAEpB,QAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,gBAAgB,KAAK,YAAY,CACvC,SAAS;EAGX,MAAM,oBAAoB,CAAC,GAAG,IAAI,IAAI,YAAY,CAAC;AACnD,MAAI,kBAAkB,WAAW,EAAG;EAEpC,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;AACpC,QAAM,KAAK,GACT,WAAW,6BAA6B,CACxC,OACA,kBAAkB,KAAK,YAAY,WAAW;GAC7C,IAAI,MAAM;GACV,gBAAgB;GAChB,cAAc;GACd,aAAa;GACb,YAAY;GACZ,YAAY;GACZ,EAAE,CACH,CAIA,YAAY,OAAO,GAAG,WAAW,CAAC,CAClC,SAAS;;;;;;;;;;CAWZ,MAAM,eACL,UACA,YACA,UAA+C,EAAE,EACL;EAC5C,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO,EAAE,OAAO,EAAE,EAAE;EAExC,MAAM,QAAQ,KAAK,IAAI,QAAQ,SAAS,IAAI,IAAI;EAEhD,IAAI,QAAQ,KAAK,GACf,WAAW,6BAA6B,CACxC,WAAW,CACX,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,eAAe,KAAK,WAAW;AAEvC,MAAI,QAAQ,QAAQ;GACnB,MAAM,UAAU,aAAa,QAAQ,OAAO;AAC5C,WAAQ,MAAM,MAAM,MAAM,KAAK,QAAQ,GAAG;;EAG3C,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,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO;EAC3B,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAC7C,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,gBAAgB,KAAK,YAAY,CACvC,kBAAkB;AACpB,SAAO,OAAO,QAAQ,SAAS,EAAE;;;CAIlC,MAAM,aAAa,UAAkB,YAAqC;EACzE,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO;EAC3B,MAAM,SAAS,MAAM,KAAK,GACxB,WAAW,6BAA6B,CACxC,QAAQ,OAAO,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,QAAQ,CAAC,CAC7C,MAAM,kBAAkB,KAAK,cAAc,CAC3C,MAAM,eAAe,KAAK,WAAW,CACrC,kBAAkB;AACpB,SAAO,OAAO,QAAQ,SAAS,EAAE;;;;;;;;CASlC,MAAM,wBACL,UACA,cAC+B;EAC/B,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAI,aAAa,WAAW,EAAG,QAAO;EACtC,MAAM,gBAAgB,MAAM,KAAK,qBAAqB,SAAS;AAC/D,MAAI,CAAC,cAAe,QAAO;AAE3B,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,kBAAkB,KAAK,cAAc,CAC3C,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,QAAQ,IAAI;GACZ,kBAAkB,IAAI;GACtB"}