@prisma/orm-family-sql 8.0.0-rc.2-dev.3 → 8.0.0-rc.20-dev.1

package/dist/foreign-key-materialization-BM59w_Xg.mjs

@@ -0,0 +1,287 @@
+import { t as contractError } from "./contract-errors-BCN6RVI5-DoH6b_KZ.mjs";
+import { a as rendersIndexBody, t as accessMethodOf } from "./index-types-pC_5vADQ-BOOBi14R.mjs";
+import { g as truncateToWireNamePrefixBytes, l as nameOf, o as defaultIndexName } from "./naming-bM5qm5PY-jOg3JFMb.mjs";
+import { r as lowerAuthoredIndex } from "./index-naming-BOcJT1B3-mG8Fd6KN.mjs";
+import { i as leadingBackingObjectName, n as identicalIndexes, o as servingKey, r as indexNodeOf, s as startsWithColumns, t as derivedBackingIndexIsRedundant } from "./index-equivalence-DswCiq5l-CGsyPP9B.mjs";
+import { UNBOUND_NAMESPACE_ID } from "@prisma/orm-framework/components/ir";
+import { InternalError } from "@prisma/orm-framework/utils/internal-error";
+import { asNamespaceId } from "@prisma/orm-framework/contract/types";
+//#region ../../../2-sql-family/1-core/contract/dist/foreign-key-materialization.mjs
+const IDENTICAL_DESCRIPTION = "the planner sees them as the same index. The contract keeps both because each is named.";
+const REDUNDANT_DESCRIPTION = "which already serves the same lookups.";
+/**
+* Removes the indexes of one table that duplicate another. Two indexes are identical when the planner sees them as the same index apart from their names (see {@link identicalIndexes}); of an identical group the pass keeps the indexes named by the user, or the first one when none is. A plain non-unique index whose columns are those of the primary key, a unique constraint or a unique index without a predicate is redundant (see {@link servingKey}), and the pass removes it unless it is named by the user. Every index named by the user survives; the pass warns about each one that duplicates another, and refuses two identical indexes both named with `name:`, whose wire names the planner could not tell apart.
+*/
+function deduplicateIndexes(input) {
+	const { tableName, warnings } = input;
+	const replacements = /* @__PURE__ */ new Map();
+	const nodes = new Map(input.indexes.map((candidate) => [candidate, indexNodeOf(candidate.index)]));
+	const nodeOf = (candidate) => {
+		const node = nodes.get(candidate);
+		if (node === void 0) throw new InternalError("every candidate has a node");
+		return node;
+	};
+	const groups = [];
+	for (const candidate of input.indexes) {
+		const position = groups.findIndex(([first]) => identicalIndexes(nodeOf(first), nodeOf(candidate)));
+		const group = groups[position];
+		if (group === void 0) groups.push([candidate]);
+		else groups[position] = [...group, candidate];
+	}
+	for (const group of groups) {
+		const named = group.filter((candidate) => candidate.namedByUser);
+		const wireNamed = named.filter((candidate) => candidate.index.naming.kind === "wire");
+		if (wireNamed.length > 1) throw identicalWireNamedIndexesError(tableName, wireNamed);
+		const kept = named[0] ?? group[0];
+		for (const candidate of group) if (candidate !== kept && !candidate.namedByUser) replacements.set(candidate, {
+			kind: "index",
+			index: kept
+		});
+		if (named.length > 1) warnings.push(identicalIndexesWarning(tableName, named));
+	}
+	const survivors = input.indexes.filter((candidate) => !replacements.has(candidate));
+	for (const candidate of survivors) {
+		const servedBy = servingKey(nodeOf(candidate), {
+			indexes: survivors,
+			nodeOf,
+			uniques: input.uniques,
+			primaryKey: input.primaryKey
+		});
+		if (servedBy === void 0) continue;
+		if (candidate.namedByUser) warnings.push(redundantIndexWarning(tableName, candidate, servedBy));
+		else replacements.set(candidate, servedBy);
+	}
+	return {
+		indexes: input.indexes.filter((candidate) => !replacements.has(candidate)),
+		replacements
+	};
+}
+function identicalWireNamedIndexesError(tableName, wireNamed) {
+	return contractError("CONTRACT.ARGUMENT_INVALID", `Indexes ${quotedList(wireNamed.map((candidate) => writtenName(candidate.index)))} on table "${tableName}" are identical and both named with name:; the planner pairs wire-named indexes by their content, so it could not tell them apart.`, {
+		fix: "Remove one of them, or name one with map: to keep both under exact names.",
+		meta: {
+			tableName,
+			indexes: wireNamed.map((candidate) => writtenName(candidate.index))
+		}
+	});
+}
+/** The name the source wrote: the prefix of a wire-named index, the whole name of an exact one. */
+function writtenName(index) {
+	return index.naming.kind === "wire" ? index.naming.prefix : index.naming.name;
+}
+function quotedList(names) {
+	const quoted = names.map((name) => `"${name}"`);
+	return quoted.length <= 2 ? quoted.join(" and ") : `${quoted.slice(0, -1).join(", ")} and ${quoted.at(-1)}`;
+}
+function identicalIndexesWarning(tableName, named) {
+	const names = quotedList(named.map((candidate) => writtenName(candidate.index)));
+	return {
+		code: "PN_INDEX_DUPLICATE",
+		message: `Indexes ${names} on table "${tableName}" are identical: ${IDENTICAL_DESCRIPTION} Remove one of them.`,
+		item: `table "${tableName}": indexes ${names}`,
+		summary: `tables have named indexes that are identical: ${IDENTICAL_DESCRIPTION} Remove one of each.`
+	};
+}
+function describeReplacement(replacement) {
+	switch (replacement.kind) {
+		case "primaryKey": return "the primary key";
+		case "uniqueConstraint": return replacement.unique.name === void 0 ? `the unique constraint on (${replacement.unique.columns.join(", ")})` : `the unique constraint "${replacement.unique.name}"`;
+		case "index": return `the unique index "${writtenName(replacement.index.index)}"`;
+	}
+}
+function redundantIndexWarning(tableName, candidate, servedBy) {
+	const name = writtenName(candidate.index);
+	return {
+		code: "PN_INDEX_REDUNDANT",
+		message: `Index "${name}" on table "${tableName}" has the same columns as ${describeReplacement(servedBy)}, ${REDUNDANT_DESCRIPTION} The contract keeps the index because it is named. Remove it.`,
+		item: `table "${tableName}": index "${name}"`,
+		summary: `tables have a named index with the same columns as a unique constraint, unique index or primary key, ${REDUNDANT_DESCRIPTION} The contract keeps each index because it is named. Remove them.`
+	};
+}
+/** The `meta.reason` of the refusal of a relation's `index: "<name>"`, which a source can report at the relation. */
+const FOREIGN_KEY_INDEX_UNRESOLVED = "foreign-key-index-unresolved";
+/**
+* Lowers a table's authored foreign keys and indexes into the entities `contract.json` persists. A `constraint: false` foreign key contributes no `foreignKeys[]` entry. A foreign key with `index: true` gets a derived backing index; one with `index: "<name>"` uses what the table declares under that name. The table's indexes then pass through {@link deduplicateIndexes}, and each foreign key states what backs it in the result: an index by name, or the primary key or a unique constraint by kind.
+*/
+function materializeForeignKeysAndIndexes(input) {
+	const { tableName, declaredIndexes, uniques, primaryKey, indexTypes } = input;
+	const derivedIndexes = [];
+	const intents = input.foreignKeys.map((foreignKey) => {
+		const { constraint, index, ...reference } = foreignKey;
+		if (index !== true) return {
+			constraint,
+			reference,
+			index
+		};
+		const derived = derivedBackingIndex(tableName, reference.source.columns);
+		derivedIndexes.push(derived);
+		return {
+			constraint,
+			reference,
+			index: derived
+		};
+	});
+	const deduplicated = deduplicateIndexes({
+		tableName,
+		indexes: [...declaredIndexes, ...derivedIndexes],
+		uniques,
+		primaryKey,
+		warnings: input.warnings
+	});
+	const resolve = (backing) => foreignKeyIndexOf(resolveReplacement(backing, deduplicated.replacements));
+	return {
+		foreignKeys: intents.flatMap(({ constraint, reference, index }) => {
+			const backing = index === false ? void 0 : typeof index === "string" ? namedBackingObject(reference.source, index, {
+				declaredIndexes,
+				uniques,
+				primaryKey,
+				indexTypes,
+				resolve
+			}) : resolve({
+				kind: "index",
+				index
+			});
+			if (!constraint) return [];
+			return [backing === void 0 ? reference : {
+				...reference,
+				index: backing
+			}];
+		}),
+		indexes: deduplicated.indexes.map((candidate) => candidate.index)
+	};
+}
+/**
+* Whether a table's declared indexes, unique constraints or primary key already serve a foreign key on `columns`, so the build would drop a derived backing index again. A source that writes no backing index of its own, such as a Prisma 7 schema, leaves the foreign key's `index` to the build where this holds, so the stored foreign key states what backs it.
+*/
+function declaredIndexesServeForeignKey(columns, table) {
+	return derivedBackingIndexIsRedundant(columns, {
+		indexes: table.indexes,
+		nodeOf: indexNodeOf,
+		uniques: table.uniques,
+		primaryKey: table.primaryKey
+	});
+}
+/**
+* The name to give a relation's `index` argument when the table's declared indexes and keys serve a foreign key on `columns` although the build would keep a derived backing index beside them (see {@link leadingBackingObjectName}).
+*/
+function declaredBackingObjectName(columns, table) {
+	return leadingBackingObjectName(columns, {
+		indexes: table.indexes,
+		nodeOf: indexNodeOf,
+		nameOf: (index) => nameOf(index.naming),
+		uniques: table.uniques,
+		primaryKey: table.primaryKey
+	});
+}
+/**
+* What a foreign key on `columns` states it is backed by when its relation says nothing, beside a table whose indexes all carry the `name` or `map` the source gave them, as a printed contract's do. A printer writes a relation's `index` argument only where the stored foreign key differs from this.
+*/
+function defaultForeignKeyIndex(tableName, columns, table) {
+	const reference = {
+		namespaceId: asNamespaceId(UNBOUND_NAMESPACE_ID),
+		tableName,
+		columns
+	};
+	const [foreignKey] = materializeForeignKeysAndIndexes({
+		tableName,
+		foreignKeys: [{
+			source: reference,
+			target: reference,
+			constraint: true,
+			index: true
+		}],
+		declaredIndexes: table.indexes.map((index) => ({
+			index,
+			namedByUser: true
+		})),
+		uniques: table.uniques,
+		primaryKey: table.primaryKey,
+		warnings: [],
+		indexTypes: void 0
+	}).foreignKeys;
+	return typeof foreignKey?.index === "object" ? foreignKey.index : void 0;
+}
+function derivedBackingIndex(tableName, columns) {
+	return {
+		index: lowerAuthoredIndex(tableName, {
+			columns,
+			where: void 0,
+			unique: void 0,
+			map: void 0,
+			name: truncateToWireNamePrefixBytes(defaultIndexName(tableName, columns)),
+			type: void 0,
+			options: void 0
+		}),
+		namedByUser: false
+	};
+}
+/**
+* What a relation's `index: "<name>"` points at. The name is the `name` or `map` the source gave an index, unique constraint or primary key, or an index's stored name; an unnamed index's default name does not count. Identical indexes count as one, so the name is resolved after they merge. The object must start with the foreign key's columns, in order, or it would not serve the foreign key's lookups. An index of a type whose body is rendered from its options (see {@link rendersIndexBody}) is refused too: its columns are not its key.
+*/
+function namedBackingObject(source, name, table) {
+	const { namespaceId, tableName, columns } = source;
+	const subject = `The foreign key on table "${tableName}" columns (${columns.join(", ")}) names "${name}" as its index`;
+	const meta = {
+		reason: FOREIGN_KEY_INDEX_UNRESOLVED,
+		namespaceId,
+		tableName,
+		columns,
+		index: name
+	};
+	const indexes = table.declaredIndexes.filter((candidate) => candidate.namedByUser && writtenName(candidate.index) === name || nameOf(candidate.index.naming) === name);
+	const keys = [...table.uniques.filter((unique) => unique.name === name), ...table.primaryKey?.name === name ? [table.primaryKey] : []];
+	const resolvedIndexes = [...new Map(indexes.map((index) => {
+		const resolved = table.resolve({
+			kind: "index",
+			index
+		});
+		return [JSON.stringify(resolved), {
+			index,
+			resolved
+		}];
+	})).values()];
+	const matches = resolvedIndexes.length + keys.length;
+	if (matches === 0) throw contractError("CONTRACT.ARGUMENT_INVALID", `${subject}, but table "${tableName}" has no index, unique constraint or primary key with that name.`, {
+		fix: `Declare an index, unique constraint or primary key named "${name}" on table "${tableName}", or drop the index argument so the foreign key gets its own backing index.`,
+		meta
+	});
+	if (matches > 1) throw contractError("CONTRACT.ARGUMENT_INVALID", `${subject}, but table "${tableName}" has more than one index, unique constraint or primary key with that name.`, {
+		fix: `Give the object the foreign key should use a name no other index, unique constraint or primary key of table "${tableName}" has, and name that on the relation.`,
+		meta
+	});
+	const [match] = resolvedIndexes;
+	const key = keys[0];
+	const matchType = match?.index.index.type;
+	const typeEntry = matchType === void 0 ? void 0 : table.indexTypes?.get(matchType);
+	if (typeEntry !== void 0 && rendersIndexBody(typeEntry)) throw contractError("CONTRACT.ARGUMENT_INVALID", `${subject}, but it is a "${typeEntry.type}" index, a "${accessMethodOf(typeEntry)}" index whose key is rendered from its options rather than its columns, so it does not serve the foreign key's lookups.`, {
+		fix: `Name an index, unique constraint or primary key whose first columns are (${columns.join(", ")}), or drop the index argument so the foreign key gets its own backing index beside the "${typeEntry.type}" index.`,
+		meta
+	});
+	const objectColumns = match !== void 0 ? match.index.index.columns : key?.columns;
+	if (objectColumns === void 0 || !startsWithColumns(objectColumns, columns)) throw contractError("CONTRACT.ARGUMENT_INVALID", `${subject}, but ${objectColumns === void 0 ? "it indexes an expression, not the foreign key's columns" : `its columns (${objectColumns.join(", ")}) do not start with the foreign key's columns`}, so it does not serve the foreign key's lookups.`, {
+		fix: `Name an index, unique constraint or primary key whose first columns are (${columns.join(", ")}), or drop the index argument so the foreign key gets its own backing index.`,
+		meta
+	});
+	if (match !== void 0) return match.resolved;
+	return key === table.primaryKey ? { primaryKey: true } : { unique: objectColumns };
+}
+function resolveReplacement(backing, replacements) {
+	let current = backing;
+	while (current.kind === "index") {
+		const replacement = replacements.get(current.index);
+		if (replacement === void 0) break;
+		current = replacement;
+	}
+	return current;
+}
+function foreignKeyIndexOf(backing) {
+	switch (backing.kind) {
+		case "index": return { name: nameOf(backing.index.index.naming) };
+		case "uniqueConstraint": return { unique: backing.unique.columns };
+		case "primaryKey": return { primaryKey: true };
+	}
+}
+//#endregion
+export { materializeForeignKeysAndIndexes as a, defaultForeignKeyIndex as i, declaredBackingObjectName as n, declaredIndexesServeForeignKey as r, FOREIGN_KEY_INDEX_UNRESOLVED as t };
+
+//# sourceMappingURL=foreign-key-materialization-BM59w_Xg.mjs.map

package/dist/foreign-key-materialization-BM59w_Xg.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"foreign-key-materialization-BM59w_Xg.mjs","names":[],"sources":["../../../../2-sql-family/1-core/contract/dist/foreign-key-materialization.mjs"],"sourcesContent":["import { t as contractError } from \"./contract-errors-BCN6RVI5.mjs\";\nimport { a as rendersIndexBody, t as accessMethodOf } from \"./index-types-pC_5vADQ.mjs\";\nimport { r as lowerAuthoredIndex } from \"./index-naming-BOcJT1B3.mjs\";\nimport { i as leadingBackingObjectName, n as identicalIndexes, o as servingKey, r as indexNodeOf, s as startsWithColumns, t as derivedBackingIndexIsRedundant } from \"./index-equivalence-DswCiq5l.mjs\";\nimport { defaultIndexName, nameOf, truncateToWireNamePrefixBytes } from \"@internal/sql-schema-ir/naming\";\nimport { UNBOUND_NAMESPACE_ID } from \"@internal/framework-components/ir\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { asNamespaceId } from \"@internal/contract/types\";\n//#region src/index-deduplication.ts\nconst IDENTICAL_DESCRIPTION = \"the planner sees them as the same index. The contract keeps both because each is named.\";\nconst REDUNDANT_DESCRIPTION = \"which already serves the same lookups.\";\n/**\n* Removes the indexes of one table that duplicate another. Two indexes are identical when the planner sees them as the same index apart from their names (see {@link identicalIndexes}); of an identical group the pass keeps the indexes named by the user, or the first one when none is. A plain non-unique index whose columns are those of the primary key, a unique constraint or a unique index without a predicate is redundant (see {@link servingKey}), and the pass removes it unless it is named by the user. Every index named by the user survives; the pass warns about each one that duplicates another, and refuses two identical indexes both named with `name:`, whose wire names the planner could not tell apart.\n*/\nfunction deduplicateIndexes(input) {\n\tconst { tableName, warnings } = input;\n\tconst replacements = /* @__PURE__ */ new Map();\n\tconst nodes = new Map(input.indexes.map((candidate) => [candidate, indexNodeOf(candidate.index)]));\n\tconst nodeOf = (candidate) => {\n\t\tconst node = nodes.get(candidate);\n\t\tif (node === void 0) throw new InternalError(\"every candidate has a node\");\n\t\treturn node;\n\t};\n\tconst groups = [];\n\tfor (const candidate of input.indexes) {\n\t\tconst position = groups.findIndex(([first]) => identicalIndexes(nodeOf(first), nodeOf(candidate)));\n\t\tconst group = groups[position];\n\t\tif (group === void 0) groups.push([candidate]);\n\t\telse groups[position] = [...group, candidate];\n\t}\n\tfor (const group of groups) {\n\t\tconst named = group.filter((candidate) => candidate.namedByUser);\n\t\tconst wireNamed = named.filter((candidate) => candidate.index.naming.kind === \"wire\");\n\t\tif (wireNamed.length > 1) throw identicalWireNamedIndexesError(tableName, wireNamed);\n\t\tconst kept = named[0] ?? group[0];\n\t\tfor (const candidate of group) if (candidate !== kept && !candidate.namedByUser) replacements.set(candidate, {\n\t\t\tkind: \"index\",\n\t\t\tindex: kept\n\t\t});\n\t\tif (named.length > 1) warnings.push(identicalIndexesWarning(tableName, named));\n\t}\n\tconst survivors = input.indexes.filter((candidate) => !replacements.has(candidate));\n\tfor (const candidate of survivors) {\n\t\tconst servedBy = servingKey(nodeOf(candidate), {\n\t\t\tindexes: survivors,\n\t\t\tnodeOf,\n\t\t\tuniques: input.uniques,\n\t\t\tprimaryKey: input.primaryKey\n\t\t});\n\t\tif (servedBy === void 0) continue;\n\t\tif (candidate.namedByUser) warnings.push(redundantIndexWarning(tableName, candidate, servedBy));\n\t\telse replacements.set(candidate, servedBy);\n\t}\n\treturn {\n\t\tindexes: input.indexes.filter((candidate) => !replacements.has(candidate)),\n\t\treplacements\n\t};\n}\nfunction identicalWireNamedIndexesError(tableName, wireNamed) {\n\treturn contractError(\"CONTRACT.ARGUMENT_INVALID\", `Indexes ${quotedList(wireNamed.map((candidate) => writtenName(candidate.index)))} on table \"${tableName}\" are identical and both named with name:; the planner pairs wire-named indexes by their content, so it could not tell them apart.`, {\n\t\tfix: \"Remove one of them, or name one with map: to keep both under exact names.\",\n\t\tmeta: {\n\t\t\ttableName,\n\t\t\tindexes: wireNamed.map((candidate) => writtenName(candidate.index))\n\t\t}\n\t});\n}\n/** The name the source wrote: the prefix of a wire-named index, the whole name of an exact one. */\nfunction writtenName(index) {\n\treturn index.naming.kind === \"wire\" ? index.naming.prefix : index.naming.name;\n}\nfunction quotedList(names) {\n\tconst quoted = names.map((name) => `\"${name}\"`);\n\treturn quoted.length <= 2 ? quoted.join(\" and \") : `${quoted.slice(0, -1).join(\", \")} and ${quoted.at(-1)}`;\n}\nfunction identicalIndexesWarning(tableName, named) {\n\tconst names = quotedList(named.map((candidate) => writtenName(candidate.index)));\n\treturn {\n\t\tcode: \"PN_INDEX_DUPLICATE\",\n\t\tmessage: `Indexes ${names} on table \"${tableName}\" are identical: ${IDENTICAL_DESCRIPTION} Remove one of them.`,\n\t\titem: `table \"${tableName}\": indexes ${names}`,\n\t\tsummary: `tables have named indexes that are identical: ${IDENTICAL_DESCRIPTION} Remove one of each.`\n\t};\n}\nfunction describeReplacement(replacement) {\n\tswitch (replacement.kind) {\n\t\tcase \"primaryKey\": return \"the primary key\";\n\t\tcase \"uniqueConstraint\": return replacement.unique.name === void 0 ? `the unique constraint on (${replacement.unique.columns.join(\", \")})` : `the unique constraint \"${replacement.unique.name}\"`;\n\t\tcase \"index\": return `the unique index \"${writtenName(replacement.index.index)}\"`;\n\t}\n}\nfunction redundantIndexWarning(tableName, candidate, servedBy) {\n\tconst name = writtenName(candidate.index);\n\treturn {\n\t\tcode: \"PN_INDEX_REDUNDANT\",\n\t\tmessage: `Index \"${name}\" on table \"${tableName}\" has the same columns as ${describeReplacement(servedBy)}, ${REDUNDANT_DESCRIPTION} The contract keeps the index because it is named. Remove it.`,\n\t\titem: `table \"${tableName}\": index \"${name}\"`,\n\t\tsummary: `tables have a named index with the same columns as a unique constraint, unique index or primary key, ${REDUNDANT_DESCRIPTION} The contract keeps each index because it is named. Remove them.`\n\t};\n}\n//#endregion\n//#region src/foreign-key-materialization.ts\n/** The `meta.reason` of the refusal of a relation's `index: \"<name>\"`, which a source can report at the relation. */\nconst FOREIGN_KEY_INDEX_UNRESOLVED = \"foreign-key-index-unresolved\";\n/**\n* Lowers a table's authored foreign keys and indexes into the entities `contract.json` persists. A `constraint: false` foreign key contributes no `foreignKeys[]` entry. A foreign key with `index: true` gets a derived backing index; one with `index: \"<name>\"` uses what the table declares under that name. The table's indexes then pass through {@link deduplicateIndexes}, and each foreign key states what backs it in the result: an index by name, or the primary key or a unique constraint by kind.\n*/\nfunction materializeForeignKeysAndIndexes(input) {\n\tconst { tableName, declaredIndexes, uniques, primaryKey, indexTypes } = input;\n\tconst derivedIndexes = [];\n\tconst intents = input.foreignKeys.map((foreignKey) => {\n\t\tconst { constraint, index, ...reference } = foreignKey;\n\t\tif (index !== true) return {\n\t\t\tconstraint,\n\t\t\treference,\n\t\t\tindex\n\t\t};\n\t\tconst derived = derivedBackingIndex(tableName, reference.source.columns);\n\t\tderivedIndexes.push(derived);\n\t\treturn {\n\t\t\tconstraint,\n\t\t\treference,\n\t\t\tindex: derived\n\t\t};\n\t});\n\tconst deduplicated = deduplicateIndexes({\n\t\ttableName,\n\t\tindexes: [...declaredIndexes, ...derivedIndexes],\n\t\tuniques,\n\t\tprimaryKey,\n\t\twarnings: input.warnings\n\t});\n\tconst resolve = (backing) => foreignKeyIndexOf(resolveReplacement(backing, deduplicated.replacements));\n\treturn {\n\t\tforeignKeys: intents.flatMap(({ constraint, reference, index }) => {\n\t\t\tconst backing = index === false ? void 0 : typeof index === \"string\" ? namedBackingObject(reference.source, index, {\n\t\t\t\tdeclaredIndexes,\n\t\t\t\tuniques,\n\t\t\t\tprimaryKey,\n\t\t\t\tindexTypes,\n\t\t\t\tresolve\n\t\t\t}) : resolve({\n\t\t\t\tkind: \"index\",\n\t\t\t\tindex\n\t\t\t});\n\t\t\tif (!constraint) return [];\n\t\t\treturn [backing === void 0 ? reference : {\n\t\t\t\t...reference,\n\t\t\t\tindex: backing\n\t\t\t}];\n\t\t}),\n\t\tindexes: deduplicated.indexes.map((candidate) => candidate.index)\n\t};\n}\n/**\n* Whether a table's declared indexes, unique constraints or primary key already serve a foreign key on `columns`, so the build would drop a derived backing index again. A source that writes no backing index of its own, such as a Prisma 7 schema, leaves the foreign key's `index` to the build where this holds, so the stored foreign key states what backs it.\n*/\nfunction declaredIndexesServeForeignKey(columns, table) {\n\treturn derivedBackingIndexIsRedundant(columns, {\n\t\tindexes: table.indexes,\n\t\tnodeOf: indexNodeOf,\n\t\tuniques: table.uniques,\n\t\tprimaryKey: table.primaryKey\n\t});\n}\n/**\n* The name to give a relation's `index` argument when the table's declared indexes and keys serve a foreign key on `columns` although the build would keep a derived backing index beside them (see {@link leadingBackingObjectName}).\n*/\nfunction declaredBackingObjectName(columns, table) {\n\treturn leadingBackingObjectName(columns, {\n\t\tindexes: table.indexes,\n\t\tnodeOf: indexNodeOf,\n\t\tnameOf: (index) => nameOf(index.naming),\n\t\tuniques: table.uniques,\n\t\tprimaryKey: table.primaryKey\n\t});\n}\n/**\n* What a foreign key on `columns` states it is backed by when its relation says nothing, beside a table whose indexes all carry the `name` or `map` the source gave them, as a printed contract's do. A printer writes a relation's `index` argument only where the stored foreign key differs from this.\n*/\nfunction defaultForeignKeyIndex(tableName, columns, table) {\n\tconst reference = {\n\t\tnamespaceId: asNamespaceId(UNBOUND_NAMESPACE_ID),\n\t\ttableName,\n\t\tcolumns\n\t};\n\tconst [foreignKey] = materializeForeignKeysAndIndexes({\n\t\ttableName,\n\t\tforeignKeys: [{\n\t\t\tsource: reference,\n\t\t\ttarget: reference,\n\t\t\tconstraint: true,\n\t\t\tindex: true\n\t\t}],\n\t\tdeclaredIndexes: table.indexes.map((index) => ({\n\t\t\tindex,\n\t\t\tnamedByUser: true\n\t\t})),\n\t\tuniques: table.uniques,\n\t\tprimaryKey: table.primaryKey,\n\t\twarnings: [],\n\t\tindexTypes: void 0\n\t}).foreignKeys;\n\treturn typeof foreignKey?.index === \"object\" ? foreignKey.index : void 0;\n}\nfunction derivedBackingIndex(tableName, columns) {\n\treturn {\n\t\tindex: lowerAuthoredIndex(tableName, {\n\t\t\tcolumns,\n\t\t\twhere: void 0,\n\t\t\tunique: void 0,\n\t\t\tmap: void 0,\n\t\t\tname: truncateToWireNamePrefixBytes(defaultIndexName(tableName, columns)),\n\t\t\ttype: void 0,\n\t\t\toptions: void 0\n\t\t}),\n\t\tnamedByUser: false\n\t};\n}\n/**\n* What a relation's `index: \"<name>\"` points at. The name is the `name` or `map` the source gave an index, unique constraint or primary key, or an index's stored name; an unnamed index's default name does not count. Identical indexes count as one, so the name is resolved after they merge. The object must start with the foreign key's columns, in order, or it would not serve the foreign key's lookups. An index of a type whose body is rendered from its options (see {@link rendersIndexBody}) is refused too: its columns are not its key.\n*/\nfunction namedBackingObject(source, name, table) {\n\tconst { namespaceId, tableName, columns } = source;\n\tconst subject = `The foreign key on table \"${tableName}\" columns (${columns.join(\", \")}) names \"${name}\" as its index`;\n\tconst meta = {\n\t\treason: FOREIGN_KEY_INDEX_UNRESOLVED,\n\t\tnamespaceId,\n\t\ttableName,\n\t\tcolumns,\n\t\tindex: name\n\t};\n\tconst indexes = table.declaredIndexes.filter((candidate) => candidate.namedByUser && writtenName(candidate.index) === name || nameOf(candidate.index.naming) === name);\n\tconst keys = [...table.uniques.filter((unique) => unique.name === name), ...table.primaryKey?.name === name ? [table.primaryKey] : []];\n\tconst resolvedIndexes = [...new Map(indexes.map((index) => {\n\t\tconst resolved = table.resolve({\n\t\t\tkind: \"index\",\n\t\t\tindex\n\t\t});\n\t\treturn [JSON.stringify(resolved), {\n\t\t\tindex,\n\t\t\tresolved\n\t\t}];\n\t})).values()];\n\tconst matches = resolvedIndexes.length + keys.length;\n\tif (matches === 0) throw contractError(\"CONTRACT.ARGUMENT_INVALID\", `${subject}, but table \"${tableName}\" has no index, unique constraint or primary key with that name.`, {\n\t\tfix: `Declare an index, unique constraint or primary key named \"${name}\" on table \"${tableName}\", or drop the index argument so the foreign key gets its own backing index.`,\n\t\tmeta\n\t});\n\tif (matches > 1) throw contractError(\"CONTRACT.ARGUMENT_INVALID\", `${subject}, but table \"${tableName}\" has more than one index, unique constraint or primary key with that name.`, {\n\t\tfix: `Give the object the foreign key should use a name no other index, unique constraint or primary key of table \"${tableName}\" has, and name that on the relation.`,\n\t\tmeta\n\t});\n\tconst [match] = resolvedIndexes;\n\tconst key = keys[0];\n\tconst matchType = match?.index.index.type;\n\tconst typeEntry = matchType === void 0 ? void 0 : table.indexTypes?.get(matchType);\n\tif (typeEntry !== void 0 && rendersIndexBody(typeEntry)) throw contractError(\"CONTRACT.ARGUMENT_INVALID\", `${subject}, but it is a \"${typeEntry.type}\" index, a \"${accessMethodOf(typeEntry)}\" index whose key is rendered from its options rather than its columns, so it does not serve the foreign key's lookups.`, {\n\t\tfix: `Name an index, unique constraint or primary key whose first columns are (${columns.join(\", \")}), or drop the index argument so the foreign key gets its own backing index beside the \"${typeEntry.type}\" index.`,\n\t\tmeta\n\t});\n\tconst objectColumns = match !== void 0 ? match.index.index.columns : key?.columns;\n\tif (objectColumns === void 0 || !startsWithColumns(objectColumns, columns)) throw contractError(\"CONTRACT.ARGUMENT_INVALID\", `${subject}, but ${objectColumns === void 0 ? \"it indexes an expression, not the foreign key's columns\" : `its columns (${objectColumns.join(\", \")}) do not start with the foreign key's columns`}, so it does not serve the foreign key's lookups.`, {\n\t\tfix: `Name an index, unique constraint or primary key whose first columns are (${columns.join(\", \")}), or drop the index argument so the foreign key gets its own backing index.`,\n\t\tmeta\n\t});\n\tif (match !== void 0) return match.resolved;\n\treturn key === table.primaryKey ? { primaryKey: true } : { unique: objectColumns };\n}\nfunction resolveReplacement(backing, replacements) {\n\tlet current = backing;\n\twhile (current.kind === \"index\") {\n\t\tconst replacement = replacements.get(current.index);\n\t\tif (replacement === void 0) break;\n\t\tcurrent = replacement;\n\t}\n\treturn current;\n}\nfunction foreignKeyIndexOf(backing) {\n\tswitch (backing.kind) {\n\t\tcase \"index\": return { name: nameOf(backing.index.index.naming) };\n\t\tcase \"uniqueConstraint\": return { unique: backing.unique.columns };\n\t\tcase \"primaryKey\": return { primaryKey: true };\n\t}\n}\n//#endregion\nexport { FOREIGN_KEY_INDEX_UNRESOLVED, declaredBackingObjectName, declaredIndexesServeForeignKey, defaultForeignKeyIndex, derivedBackingIndexIsRedundant, leadingBackingObjectName, materializeForeignKeysAndIndexes };\n\n//# sourceMappingURL=foreign-key-materialization.mjs.map"],"mappings":";;;;;;;;;AASA,MAAM,wBAAwB;AAC9B,MAAM,wBAAwB;;;;AAI9B,SAAS,mBAAmB,OAAO;CAClC,MAAM,EAAE,WAAW,aAAa;CAChC,MAAM,+BAA+B,IAAI,IAAI;CAC7C,MAAM,QAAQ,IAAI,IAAI,MAAM,QAAQ,KAAK,cAAc,CAAC,WAAW,YAAY,UAAU,KAAK,CAAC,CAAC,CAAC;CACjG,MAAM,UAAU,cAAc;EAC7B,MAAM,OAAO,MAAM,IAAI,SAAS;EAChC,IAAI,SAAS,KAAK,GAAG,MAAM,IAAI,cAAc,4BAA4B;EACzE,OAAO;CACR;CACA,MAAM,SAAS,CAAC;CAChB,KAAK,MAAM,aAAa,MAAM,SAAS;EACtC,MAAM,WAAW,OAAO,WAAW,CAAC,WAAW,iBAAiB,OAAO,KAAK,GAAG,OAAO,SAAS,CAAC,CAAC;EACjG,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,KAAK,GAAG,OAAO,KAAK,CAAC,SAAS,CAAC;OACxC,OAAO,YAAY,CAAC,GAAG,OAAO,SAAS;CAC7C;CACA,KAAK,MAAM,SAAS,QAAQ;EAC3B,MAAM,QAAQ,MAAM,QAAQ,cAAc,UAAU,WAAW;EAC/D,MAAM,YAAY,MAAM,QAAQ,cAAc,UAAU,MAAM,OAAO,SAAS,MAAM;EACpF,IAAI,UAAU,SAAS,GAAG,MAAM,+BAA+B,WAAW,SAAS;EACnF,MAAM,OAAO,MAAM,MAAM,MAAM;EAC/B,KAAK,MAAM,aAAa,OAAO,IAAI,cAAc,QAAQ,CAAC,UAAU,aAAa,aAAa,IAAI,WAAW;GAC5G,MAAM;GACN,OAAO;EACR,CAAC;EACD,IAAI,MAAM,SAAS,GAAG,SAAS,KAAK,wBAAwB,WAAW,KAAK,CAAC;CAC9E;CACA,MAAM,YAAY,MAAM,QAAQ,QAAQ,cAAc,CAAC,aAAa,IAAI,SAAS,CAAC;CAClF,KAAK,MAAM,aAAa,WAAW;EAClC,MAAM,WAAW,WAAW,OAAO,SAAS,GAAG;GAC9C,SAAS;GACT;GACA,SAAS,MAAM;GACf,YAAY,MAAM;EACnB,CAAC;EACD,IAAI,aAAa,KAAK,GAAG;EACzB,IAAI,UAAU,aAAa,SAAS,KAAK,sBAAsB,WAAW,WAAW,QAAQ,CAAC;OACzF,aAAa,IAAI,WAAW,QAAQ;CAC1C;CACA,OAAO;EACN,SAAS,MAAM,QAAQ,QAAQ,cAAc,CAAC,aAAa,IAAI,SAAS,CAAC;EACzE;CACD;AACD;AACA,SAAS,+BAA+B,WAAW,WAAW;CAC7D,OAAO,cAAc,6BAA6B,WAAW,WAAW,UAAU,KAAK,cAAc,YAAY,UAAU,KAAK,CAAC,CAAC,EAAE,aAAa,UAAU,qIAAqI;EAC/R,KAAK;EACL,MAAM;GACL;GACA,SAAS,UAAU,KAAK,cAAc,YAAY,UAAU,KAAK,CAAC;EACnE;CACD,CAAC;AACF;;AAEA,SAAS,YAAY,OAAO;CAC3B,OAAO,MAAM,OAAO,SAAS,SAAS,MAAM,OAAO,SAAS,MAAM,OAAO;AAC1E;AACA,SAAS,WAAW,OAAO;CAC1B,MAAM,SAAS,MAAM,KAAK,SAAS,IAAI,KAAK,EAAE;CAC9C,OAAO,OAAO,UAAU,IAAI,OAAO,KAAK,OAAO,IAAI,GAAG,OAAO,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,IAAI,EAAE,OAAO,OAAO,GAAG,EAAE;AACzG;AACA,SAAS,wBAAwB,WAAW,OAAO;CAClD,MAAM,QAAQ,WAAW,MAAM,KAAK,cAAc,YAAY,UAAU,KAAK,CAAC,CAAC;CAC/E,OAAO;EACN,MAAM;EACN,SAAS,WAAW,MAAM,aAAa,UAAU,mBAAmB,sBAAsB;EAC1F,MAAM,UAAU,UAAU,aAAa;EACvC,SAAS,iDAAiD,sBAAsB;CACjF;AACD;AACA,SAAS,oBAAoB,aAAa;CACzC,QAAQ,YAAY,MAApB;EACC,KAAK,cAAc,OAAO;EAC1B,KAAK,oBAAoB,OAAO,YAAY,OAAO,SAAS,KAAK,IAAI,6BAA6B,YAAY,OAAO,QAAQ,KAAK,IAAI,EAAE,KAAK,0BAA0B,YAAY,OAAO,KAAK;EAC/L,KAAK,SAAS,OAAO,qBAAqB,YAAY,YAAY,MAAM,KAAK,EAAE;CAChF;AACD;AACA,SAAS,sBAAsB,WAAW,WAAW,UAAU;CAC9D,MAAM,OAAO,YAAY,UAAU,KAAK;CACxC,OAAO;EACN,MAAM;EACN,SAAS,UAAU,KAAK,cAAc,UAAU,4BAA4B,oBAAoB,QAAQ,EAAE,IAAI,sBAAsB;EACpI,MAAM,UAAU,UAAU,YAAY,KAAK;EAC3C,SAAS,wGAAwG,sBAAsB;CACxI;AACD;;AAIA,MAAM,+BAA+B;;;;AAIrC,SAAS,iCAAiC,OAAO;CAChD,MAAM,EAAE,WAAW,iBAAiB,SAAS,YAAY,eAAe;CACxE,MAAM,iBAAiB,CAAC;CACxB,MAAM,UAAU,MAAM,YAAY,KAAK,eAAe;EACrD,MAAM,EAAE,YAAY,OAAO,GAAG,cAAc;EAC5C,IAAI,UAAU,MAAM,OAAO;GAC1B;GACA;GACA;EACD;EACA,MAAM,UAAU,oBAAoB,WAAW,UAAU,OAAO,OAAO;EACvE,eAAe,KAAK,OAAO;EAC3B,OAAO;GACN;GACA;GACA,OAAO;EACR;CACD,CAAC;CACD,MAAM,eAAe,mBAAmB;EACvC;EACA,SAAS,CAAC,GAAG,iBAAiB,GAAG,cAAc;EAC/C;EACA;EACA,UAAU,MAAM;CACjB,CAAC;CACD,MAAM,WAAW,YAAY,kBAAkB,mBAAmB,SAAS,aAAa,YAAY,CAAC;CACrG,OAAO;EACN,aAAa,QAAQ,SAAS,EAAE,YAAY,WAAW,YAAY;GAClE,MAAM,UAAU,UAAU,QAAQ,KAAK,IAAI,OAAO,UAAU,WAAW,mBAAmB,UAAU,QAAQ,OAAO;IAClH;IACA;IACA;IACA;IACA;GACD,CAAC,IAAI,QAAQ;IACZ,MAAM;IACN;GACD,CAAC;GACD,IAAI,CAAC,YAAY,OAAO,CAAC;GACzB,OAAO,CAAC,YAAY,KAAK,IAAI,YAAY;IACxC,GAAG;IACH,OAAO;GACR,CAAC;EACF,CAAC;EACD,SAAS,aAAa,QAAQ,KAAK,cAAc,UAAU,KAAK;CACjE;AACD;;;;AAIA,SAAS,+BAA+B,SAAS,OAAO;CACvD,OAAO,+BAA+B,SAAS;EAC9C,SAAS,MAAM;EACf,QAAQ;EACR,SAAS,MAAM;EACf,YAAY,MAAM;CACnB,CAAC;AACF;;;;AAIA,SAAS,0BAA0B,SAAS,OAAO;CAClD,OAAO,yBAAyB,SAAS;EACxC,SAAS,MAAM;EACf,QAAQ;EACR,SAAS,UAAU,OAAO,MAAM,MAAM;EACtC,SAAS,MAAM;EACf,YAAY,MAAM;CACnB,CAAC;AACF;;;;AAIA,SAAS,uBAAuB,WAAW,SAAS,OAAO;CAC1D,MAAM,YAAY;EACjB,aAAa,cAAc,oBAAoB;EAC/C;EACA;CACD;CACA,MAAM,CAAC,cAAc,iCAAiC;EACrD;EACA,aAAa,CAAC;GACb,QAAQ;GACR,QAAQ;GACR,YAAY;GACZ,OAAO;EACR,CAAC;EACD,iBAAiB,MAAM,QAAQ,KAAK,WAAW;GAC9C;GACA,aAAa;EACd,EAAE;EACF,SAAS,MAAM;EACf,YAAY,MAAM;EAClB,UAAU,CAAC;EACX,YAAY,KAAK;CAClB,CAAC,CAAC,CAAC;CACH,OAAO,OAAO,YAAY,UAAU,WAAW,WAAW,QAAQ,KAAK;AACxE;AACA,SAAS,oBAAoB,WAAW,SAAS;CAChD,OAAO;EACN,OAAO,mBAAmB,WAAW;GACpC;GACA,OAAO,KAAK;GACZ,QAAQ,KAAK;GACb,KAAK,KAAK;GACV,MAAM,8BAA8B,iBAAiB,WAAW,OAAO,CAAC;GACxE,MAAM,KAAK;GACX,SAAS,KAAK;EACf,CAAC;EACD,aAAa;CACd;AACD;;;;AAIA,SAAS,mBAAmB,QAAQ,MAAM,OAAO;CAChD,MAAM,EAAE,aAAa,WAAW,YAAY;CAC5C,MAAM,UAAU,6BAA6B,UAAU,aAAa,QAAQ,KAAK,IAAI,EAAE,WAAW,KAAK;CACvG,MAAM,OAAO;EACZ,QAAQ;EACR;EACA;EACA;EACA,OAAO;CACR;CACA,MAAM,UAAU,MAAM,gBAAgB,QAAQ,cAAc,UAAU,eAAe,YAAY,UAAU,KAAK,MAAM,QAAQ,OAAO,UAAU,MAAM,MAAM,MAAM,IAAI;CACrK,MAAM,OAAO,CAAC,GAAG,MAAM,QAAQ,QAAQ,WAAW,OAAO,SAAS,IAAI,GAAG,GAAG,MAAM,YAAY,SAAS,OAAO,CAAC,MAAM,UAAU,IAAI,CAAC,CAAC;CACrI,MAAM,kBAAkB,CAAC,GAAG,IAAI,IAAI,QAAQ,KAAK,UAAU;EAC1D,MAAM,WAAW,MAAM,QAAQ;GAC9B,MAAM;GACN;EACD,CAAC;EACD,OAAO,CAAC,KAAK,UAAU,QAAQ,GAAG;GACjC;GACA;EACD,CAAC;CACF,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;CACZ,MAAM,UAAU,gBAAgB,SAAS,KAAK;CAC9C,IAAI,YAAY,GAAG,MAAM,cAAc,6BAA6B,GAAG,QAAQ,eAAe,UAAU,mEAAmE;EAC1K,KAAK,6DAA6D,KAAK,cAAc,UAAU;EAC/F;CACD,CAAC;CACD,IAAI,UAAU,GAAG,MAAM,cAAc,6BAA6B,GAAG,QAAQ,eAAe,UAAU,8EAA8E;EACnL,KAAK,gHAAgH,UAAU;EAC/H;CACD,CAAC;CACD,MAAM,CAAC,SAAS;CAChB,MAAM,MAAM,KAAK;CACjB,MAAM,YAAY,OAAO,MAAM,MAAM;CACrC,MAAM,YAAY,cAAc,KAAK,IAAI,KAAK,IAAI,MAAM,YAAY,IAAI,SAAS;CACjF,IAAI,cAAc,KAAK,KAAK,iBAAiB,SAAS,GAAG,MAAM,cAAc,6BAA6B,GAAG,QAAQ,iBAAiB,UAAU,KAAK,cAAc,eAAe,SAAS,EAAE,0HAA0H;EACtT,KAAK,4EAA4E,QAAQ,KAAK,IAAI,EAAE,0FAA0F,UAAU,KAAK;EAC7M;CACD,CAAC;CACD,MAAM,gBAAgB,UAAU,KAAK,IAAI,MAAM,MAAM,MAAM,UAAU,KAAK;CAC1E,IAAI,kBAAkB,KAAK,KAAK,CAAC,kBAAkB,eAAe,OAAO,GAAG,MAAM,cAAc,6BAA6B,GAAG,QAAQ,QAAQ,kBAAkB,KAAK,IAAI,4DAA4D,gBAAgB,cAAc,KAAK,IAAI,EAAE,+CAA+C,oDAAoD;EAClX,KAAK,4EAA4E,QAAQ,KAAK,IAAI,EAAE;EACpG;CACD,CAAC;CACD,IAAI,UAAU,KAAK,GAAG,OAAO,MAAM;CACnC,OAAO,QAAQ,MAAM,aAAa,EAAE,YAAY,KAAK,IAAI,EAAE,QAAQ,cAAc;AAClF;AACA,SAAS,mBAAmB,SAAS,cAAc;CAClD,IAAI,UAAU;CACd,OAAO,QAAQ,SAAS,SAAS;EAChC,MAAM,cAAc,aAAa,IAAI,QAAQ,KAAK;EAClD,IAAI,gBAAgB,KAAK,GAAG;EAC5B,UAAU;CACX;CACA,OAAO;AACR;AACA,SAAS,kBAAkB,SAAS;CACnC,QAAQ,QAAQ,MAAhB;EACC,KAAK,SAAS,OAAO,EAAE,MAAM,OAAO,QAAQ,MAAM,MAAM,MAAM,EAAE;EAChE,KAAK,oBAAoB,OAAO,EAAE,QAAQ,QAAQ,OAAO,QAAQ;EACjE,KAAK,cAAc,OAAO,EAAE,YAAY,KAAK;CAC9C;AACD"}

package/dist/{foreign-key-C-iTPuRT-C9ip8zFx.d.mts → foreign-key-qkDFfG8t-TaK_GYWR.d.mts}

@@ -1,6 +1,6 @@
-import { t as SqlNode } from "./sql-node-kEz6YFZo-v2F7delx.mjs";
+import { t as SqlNode } from "./sql-node-kEz6YFZo-1ogT6Cxt.mjs";
 import { NamespaceId } from "@prisma/orm-framework/contract/types";
-//#region ../../../2-sql/1-core/contract/dist/foreign-key-C-iTPuRT.d.mts
+//#region ../../../2-sql-family/1-core/contract/dist/foreign-key-qkDFfG8t.d.mts
 //#region src/ir/foreign-key-reference.d.ts
 /**
  * Input for a foreign-key reference (one side of a foreign-key declaration).
@@ -46,12 +46,26 @@ declare class ForeignKeyReference extends SqlNode {
 //#endregion
 //#region src/ir/foreign-key.d.ts
 type ReferentialAction = 'noAction' | 'restrict' | 'cascade' | 'setNull' | 'setDefault';
+/**
+ * What serves a foreign key's lookups on its own table, each in the way the contract identifies it: an index by its stored name, the primary key by kind, a unique constraint by its columns. The first columns of each are the foreign key's columns.
+ */
+type ForeignKeyIndex = {
+  readonly name: string;
+} | {
+  readonly primaryKey: true;
+} | {
+  readonly unique: readonly string[];
+};
 interface ForeignKeyInput {
   readonly source: ForeignKeyReference | ForeignKeyReferenceInput;
   readonly target: ForeignKeyReference | ForeignKeyReferenceInput;
   readonly name?: string;
   readonly onDelete?: ReferentialAction;
   readonly onUpdate?: ReferentialAction;
+  /**
+   * A `contract.json` emitted before 0.16 stores `true` or `false` here, the superseded per-foreign-key flag; it says nothing about the table's indexes and reads as absent.
+   */
+  readonly index?: ForeignKeyIndex | boolean;
 }
 /**
  * SQL Contract IR node for a table-level foreign-key declaration — the
@@ -62,7 +76,8 @@ interface ForeignKeyInput {
  * authoring-time decisions (PSL `@relation(index:)`, TS `fk({ constraint,
  * index })`) resolved once at `contract emit` — a `constraint: false` FK
  * simply has no entry here, and a backing index (if any) is its own discrete,
- * named entry in the table's `indexes[]`.
+ * named entry in the table's `indexes[]`. `index` says what serves the
+ * foreign key's lookups; it is absent when nothing backs the foreign key.
  *
  * Each FK carries explicit `source` and `target` {@link ForeignKeyReference}
  * coordinates (namespace, table, columns). For single-namespace contracts the
@@ -79,9 +94,10 @@ declare class ForeignKey extends SqlNode {
   readonly name?: string;
   readonly onDelete?: ReferentialAction;
   readonly onUpdate?: ReferentialAction;
+  readonly index?: ForeignKeyIndex;
   constructor(input: ForeignKeyInput);
   static from(value: ForeignKey | ForeignKeyInput): ForeignKey;
 }
 //#endregion
-export { ReferentialAction as a, ForeignKeyReferenceInput as i, ForeignKeyInput as n, ForeignKeyReference as r, ForeignKey as t };
-//# sourceMappingURL=foreign-key-C-iTPuRT-C9ip8zFx.d.mts.map
+export { ForeignKeyReferenceInput as a, ForeignKeyReference as i, ForeignKeyIndex as n, ReferentialAction as o, ForeignKeyInput as r, ForeignKey as t };
+//# sourceMappingURL=foreign-key-qkDFfG8t-TaK_GYWR.d.mts.map

package/dist/foreign-key-qkDFfG8t-TaK_GYWR.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"foreign-key-qkDFfG8t-TaK_GYWR.d.mts","names":[],"sources":["../../../../2-sql-family/1-core/contract/dist/foreign-key-qkDFfG8t.d.mts"],"mappings":";;;;;;;;;;;;;;;UAcU;WACC;WACA;WACA;WACA;;;;;;;;;;;;;;;;;;cAkBG,4BAA4B;WAC/B,aAAa;WACb;WACA;WACA;EACT,YAAY,OAAO;SACZ,KAAK,OAAO,sBAAsB,2BAA2B;;;;KAIjE;;;;KAIA;WACM;;WAEA;;WAEA;;UAED;WACC,QAAQ,sBAAsB;WAC9B,QAAQ,sBAAsB;WAC9B;WACA,WAAW;WACX,WAAW;;;;WAIX,QAAQ;;;;;;;;;;;;;;;;;;;;;;;cAuBL,mBAAmB;WACtB,QAAQ;WACR,QAAQ;WACR;WACA,WAAW;WACX,WAAW;WACX,QAAQ;EACjB,YAAY,OAAO;SACZ,KAAK,OAAO,aAAa,kBAAkB"}

package/dist/functions-CsOoN7I3.mjs

@@ -0,0 +1,88 @@
+import { C as LiteralExpr, E as NullCheckExpr, I as SubqueryExpr, O as OrExpr, S as ListExpression, n as AndExpr, p as ExistsExpr, r as BinaryExpr } from "./types-NTQsD2MS-xcLtvKO9.mjs";
+import { a as isExpression, i as createRawSql, r as codecOf, s as toExpr, t as ExpressionImpl } from "./expression-impl-B-XNINxr-BhN2sysZ.mjs";
+import { blindCast } from "@prisma/orm-framework/utils/casts";
+//#region ../../../2-sql-family/4-lanes/relational-core/dist/exports/functions.mjs
+const BOOL_FIELD = {
+	codecId: "pg/bool@1",
+	nullable: false
+};
+/**
+* Resolve a binary-comparison operand into an AST expression, threading the column-bound side's {@link CodecRef} to the raw-value side.
+*
+* For `fns.eq(f.email, 'alice@example.com')`, `f.email` is the column-bound expression carrying a `ColumnRef` AST and a `CodecRef` derived from contract storage; the raw string operand has no codec context. By deriving the codec context from the column-bound side and forwarding it via `toExpr(value, codec)`, the resulting `ParamRef` carries the `CodecRef` that encode-side dispatch needs to materialise the per-instance codec for parameterized codec ids (`vector(1024)` vs. `vector(1536)`).
+*/
+function resolveOperand(operand, otherCodec) {
+	if (isExpression(operand)) return operand.buildAst();
+	return toExpr(operand, otherCodec);
+}
+/**
+* Resolves an Expression via `buildAst()`, or wraps a raw value as a `LiteralExpr` — an SQL literal inlined into the query text, not a bound parameter.
+*
+* Used for `and` / `or` operands. The usual operand is an `Expression<bool>` (e.g. the result of `fns.eq`), which this function passes through by calling `buildAst()`. The only time the raw-value branch fires is when the caller writes `fns.and(true, x)` or similar — inlining `TRUE`/`FALSE` literals lets the SQL planner statically simplify `TRUE AND x` to `x`, which it cannot do for an opaque `ParamRef`.
+*/
+function toLiteralExpr(value) {
+	if (isExpression(value)) return value.buildAst();
+	return new LiteralExpr(value);
+}
+function boolExpr(astNode) {
+	return new ExpressionImpl(astNode, BOOL_FIELD);
+}
+function binaryWithSharedCodec(a, b, build) {
+	const aCodec = codecOf(a);
+	return build(resolveOperand(a, codecOf(b)), resolveOperand(b, aCodec));
+}
+function eq(a, b) {
+	if (b === null) return boolExpr(NullCheckExpr.isNull(toExpr(a)));
+	if (a === null) return boolExpr(NullCheckExpr.isNull(toExpr(b)));
+	return boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr("eq", l, r)));
+}
+function ne(a, b) {
+	if (b === null) return boolExpr(NullCheckExpr.isNotNull(toExpr(a)));
+	if (a === null) return boolExpr(NullCheckExpr.isNotNull(toExpr(b)));
+	return boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr("neq", l, r)));
+}
+function comparison(a, b, op) {
+	return boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr(op, l, r)));
+}
+function inOrNotIn(expr, valuesOrSubquery, op) {
+	const left = expr.buildAst();
+	const leftCodec = codecOf(expr);
+	const binaryFn = op === "in" ? BinaryExpr.in : BinaryExpr.notIn;
+	if (Array.isArray(valuesOrSubquery)) {
+		const refs = valuesOrSubquery.map((v) => resolveOperand(v, leftCodec));
+		return boolExpr(binaryFn(left, ListExpression.of(refs)));
+	}
+	return boolExpr(binaryFn(left, SubqueryExpr.of(valuesOrSubquery.buildAst())));
+}
+function createBuiltinFunctions(rawCodecInferer) {
+	return {
+		eq: (a, b) => eq(a, b),
+		ne: (a, b) => ne(a, b),
+		gt: (a, b) => comparison(a, b, "gt"),
+		gte: (a, b) => comparison(a, b, "gte"),
+		lt: (a, b) => comparison(a, b, "lt"),
+		lte: (a, b) => comparison(a, b, "lte"),
+		and: (...exprs) => boolExpr(AndExpr.of(exprs.map(toLiteralExpr))),
+		or: (...exprs) => boolExpr(OrExpr.of(exprs.map(toLiteralExpr))),
+		exists: (subquery) => boolExpr(ExistsExpr.exists(subquery.buildAst())),
+		notExists: (subquery) => boolExpr(ExistsExpr.notExists(subquery.buildAst())),
+		in: (expr, valuesOrSubquery) => inOrNotIn(expr, valuesOrSubquery, "in"),
+		notIn: (expr, valuesOrSubquery) => inOrNotIn(expr, valuesOrSubquery, "notIn"),
+		raw: createRawSql(rawCodecInferer)
+	};
+}
+/**
+* The function surface for a contract: the built-in functions, and each registered query operation's implementation under its name.
+*/
+function createFunctions(operations, rawCodecInferer) {
+	const builtins = createBuiltinFunctions(rawCodecInferer);
+	return new Proxy(blindCast({}), { get(_target, prop) {
+		if (Object.hasOwn(builtins, prop)) return blindCast(builtins)[prop];
+		const op = operations[prop];
+		if (op) return op.impl;
+	} });
+}
+//#endregion
+export { createFunctions as t };
+
+//# sourceMappingURL=functions-CsOoN7I3.mjs.map

package/dist/functions-CsOoN7I3.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"functions-CsOoN7I3.mjs","names":[],"sources":["../../../../2-sql-family/4-lanes/relational-core/dist/exports/functions.mjs"],"sourcesContent":["import { C as LiteralExpr, E as NullCheckExpr, I as SubqueryExpr, O as OrExpr, S as ListExpression, n as AndExpr, p as ExistsExpr, r as BinaryExpr } from \"../types-NTQsD2MS.mjs\";\nimport { a as isExpression, i as createRawSql, r as codecOf, s as toExpr, t as ExpressionImpl } from \"../expression-impl-B-XNINxr.mjs\";\nimport { blindCast } from \"@internal/utils/casts\";\n//#region src/functions.ts\nconst BOOL_FIELD = {\n\tcodecId: \"pg/bool@1\",\n\tnullable: false\n};\n/**\n* Resolve a binary-comparison operand into an AST expression, threading the column-bound side's {@link CodecRef} to the raw-value side.\n*\n* For `fns.eq(f.email, 'alice@example.com')`, `f.email` is the column-bound expression carrying a `ColumnRef` AST and a `CodecRef` derived from contract storage; the raw string operand has no codec context. By deriving the codec context from the column-bound side and forwarding it via `toExpr(value, codec)`, the resulting `ParamRef` carries the `CodecRef` that encode-side dispatch needs to materialise the per-instance codec for parameterized codec ids (`vector(1024)` vs. `vector(1536)`).\n*/\nfunction resolveOperand(operand, otherCodec) {\n\tif (isExpression(operand)) return operand.buildAst();\n\treturn toExpr(operand, otherCodec);\n}\n/**\n* Resolves an Expression via `buildAst()`, or wraps a raw value as a `LiteralExpr` — an SQL literal inlined into the query text, not a bound parameter.\n*\n* Used for `and` / `or` operands. The usual operand is an `Expression<bool>` (e.g. the result of `fns.eq`), which this function passes through by calling `buildAst()`. The only time the raw-value branch fires is when the caller writes `fns.and(true, x)` or similar — inlining `TRUE`/`FALSE` literals lets the SQL planner statically simplify `TRUE AND x` to `x`, which it cannot do for an opaque `ParamRef`.\n*/\nfunction toLiteralExpr(value) {\n\tif (isExpression(value)) return value.buildAst();\n\treturn new LiteralExpr(value);\n}\nfunction boolExpr(astNode) {\n\treturn new ExpressionImpl(astNode, BOOL_FIELD);\n}\nfunction binaryWithSharedCodec(a, b, build) {\n\tconst aCodec = codecOf(a);\n\treturn build(resolveOperand(a, codecOf(b)), resolveOperand(b, aCodec));\n}\nfunction eq(a, b) {\n\tif (b === null) return boolExpr(NullCheckExpr.isNull(toExpr(a)));\n\tif (a === null) return boolExpr(NullCheckExpr.isNull(toExpr(b)));\n\treturn boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr(\"eq\", l, r)));\n}\nfunction ne(a, b) {\n\tif (b === null) return boolExpr(NullCheckExpr.isNotNull(toExpr(a)));\n\tif (a === null) return boolExpr(NullCheckExpr.isNotNull(toExpr(b)));\n\treturn boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr(\"neq\", l, r)));\n}\nfunction comparison(a, b, op) {\n\treturn boolExpr(binaryWithSharedCodec(a, b, (l, r) => new BinaryExpr(op, l, r)));\n}\nfunction inOrNotIn(expr, valuesOrSubquery, op) {\n\tconst left = expr.buildAst();\n\tconst leftCodec = codecOf(expr);\n\tconst binaryFn = op === \"in\" ? BinaryExpr.in : BinaryExpr.notIn;\n\tif (Array.isArray(valuesOrSubquery)) {\n\t\tconst refs = valuesOrSubquery.map((v) => resolveOperand(v, leftCodec));\n\t\treturn boolExpr(binaryFn(left, ListExpression.of(refs)));\n\t}\n\treturn boolExpr(binaryFn(left, SubqueryExpr.of(valuesOrSubquery.buildAst())));\n}\nfunction createBuiltinFunctions(rawCodecInferer) {\n\treturn {\n\t\teq: (a, b) => eq(a, b),\n\t\tne: (a, b) => ne(a, b),\n\t\tgt: (a, b) => comparison(a, b, \"gt\"),\n\t\tgte: (a, b) => comparison(a, b, \"gte\"),\n\t\tlt: (a, b) => comparison(a, b, \"lt\"),\n\t\tlte: (a, b) => comparison(a, b, \"lte\"),\n\t\tand: (...exprs) => boolExpr(AndExpr.of(exprs.map(toLiteralExpr))),\n\t\tor: (...exprs) => boolExpr(OrExpr.of(exprs.map(toLiteralExpr))),\n\t\texists: (subquery) => boolExpr(ExistsExpr.exists(subquery.buildAst())),\n\t\tnotExists: (subquery) => boolExpr(ExistsExpr.notExists(subquery.buildAst())),\n\t\tin: (expr, valuesOrSubquery) => inOrNotIn(expr, valuesOrSubquery, \"in\"),\n\t\tnotIn: (expr, valuesOrSubquery) => inOrNotIn(expr, valuesOrSubquery, \"notIn\"),\n\t\traw: createRawSql(rawCodecInferer)\n\t};\n}\n/**\n* The function surface for a contract: the built-in functions, and each registered query operation's implementation under its name.\n*/\nfunction createFunctions(operations, rawCodecInferer) {\n\tconst builtins = createBuiltinFunctions(rawCodecInferer);\n\treturn new Proxy(blindCast({}), { get(_target, prop) {\n\t\tif (Object.hasOwn(builtins, prop)) return blindCast(builtins)[prop];\n\t\tconst op = operations[prop];\n\t\tif (op) return op.impl;\n\t} });\n}\n//#endregion\nexport { createFunctions };\n\n//# sourceMappingURL=functions.mjs.map"],"mappings":";;;;AAIA,MAAM,aAAa;CAClB,SAAS;CACT,UAAU;AACX;;;;;;AAMA,SAAS,eAAe,SAAS,YAAY;CAC5C,IAAI,aAAa,OAAO,GAAG,OAAO,QAAQ,SAAS;CACnD,OAAO,OAAO,SAAS,UAAU;AAClC;;;;;;AAMA,SAAS,cAAc,OAAO;CAC7B,IAAI,aAAa,KAAK,GAAG,OAAO,MAAM,SAAS;CAC/C,OAAO,IAAI,YAAY,KAAK;AAC7B;AACA,SAAS,SAAS,SAAS;CAC1B,OAAO,IAAI,eAAe,SAAS,UAAU;AAC9C;AACA,SAAS,sBAAsB,GAAG,GAAG,OAAO;CAC3C,MAAM,SAAS,QAAQ,CAAC;CACxB,OAAO,MAAM,eAAe,GAAG,QAAQ,CAAC,CAAC,GAAG,eAAe,GAAG,MAAM,CAAC;AACtE;AACA,SAAS,GAAG,GAAG,GAAG;CACjB,IAAI,MAAM,MAAM,OAAO,SAAS,cAAc,OAAO,OAAO,CAAC,CAAC,CAAC;CAC/D,IAAI,MAAM,MAAM,OAAO,SAAS,cAAc,OAAO,OAAO,CAAC,CAAC,CAAC;CAC/D,OAAO,SAAS,sBAAsB,GAAG,IAAI,GAAG,MAAM,IAAI,WAAW,MAAM,GAAG,CAAC,CAAC,CAAC;AAClF;AACA,SAAS,GAAG,GAAG,GAAG;CACjB,IAAI,MAAM,MAAM,OAAO,SAAS,cAAc,UAAU,OAAO,CAAC,CAAC,CAAC;CAClE,IAAI,MAAM,MAAM,OAAO,SAAS,cAAc,UAAU,OAAO,CAAC,CAAC,CAAC;CAClE,OAAO,SAAS,sBAAsB,GAAG,IAAI,GAAG,MAAM,IAAI,WAAW,OAAO,GAAG,CAAC,CAAC,CAAC;AACnF;AACA,SAAS,WAAW,GAAG,GAAG,IAAI;CAC7B,OAAO,SAAS,sBAAsB,GAAG,IAAI,GAAG,MAAM,IAAI,WAAW,IAAI,GAAG,CAAC,CAAC,CAAC;AAChF;AACA,SAAS,UAAU,MAAM,kBAAkB,IAAI;CAC9C,MAAM,OAAO,KAAK,SAAS;CAC3B,MAAM,YAAY,QAAQ,IAAI;CAC9B,MAAM,WAAW,OAAO,OAAO,WAAW,KAAK,WAAW;CAC1D,IAAI,MAAM,QAAQ,gBAAgB,GAAG;EACpC,MAAM,OAAO,iBAAiB,KAAK,MAAM,eAAe,GAAG,SAAS,CAAC;EACrE,OAAO,SAAS,SAAS,MAAM,eAAe,GAAG,IAAI,CAAC,CAAC;CACxD;CACA,OAAO,SAAS,SAAS,MAAM,aAAa,GAAG,iBAAiB,SAAS,CAAC,CAAC,CAAC;AAC7E;AACA,SAAS,uBAAuB,iBAAiB;CAChD,OAAO;EACN,KAAK,GAAG,MAAM,GAAG,GAAG,CAAC;EACrB,KAAK,GAAG,MAAM,GAAG,GAAG,CAAC;EACrB,KAAK,GAAG,MAAM,WAAW,GAAG,GAAG,IAAI;EACnC,MAAM,GAAG,MAAM,WAAW,GAAG,GAAG,KAAK;EACrC,KAAK,GAAG,MAAM,WAAW,GAAG,GAAG,IAAI;EACnC,MAAM,GAAG,MAAM,WAAW,GAAG,GAAG,KAAK;EACrC,MAAM,GAAG,UAAU,SAAS,QAAQ,GAAG,MAAM,IAAI,aAAa,CAAC,CAAC;EAChE,KAAK,GAAG,UAAU,SAAS,OAAO,GAAG,MAAM,IAAI,aAAa,CAAC,CAAC;EAC9D,SAAS,aAAa,SAAS,WAAW,OAAO,SAAS,SAAS,CAAC,CAAC;EACrE,YAAY,aAAa,SAAS,WAAW,UAAU,SAAS,SAAS,CAAC,CAAC;EAC3E,KAAK,MAAM,qBAAqB,UAAU,MAAM,kBAAkB,IAAI;EACtE,QAAQ,MAAM,qBAAqB,UAAU,MAAM,kBAAkB,OAAO;EAC5E,KAAK,aAAa,eAAe;CAClC;AACD;;;;AAIA,SAAS,gBAAgB,YAAY,iBAAiB;CACrD,MAAM,WAAW,uBAAuB,eAAe;CACvD,OAAO,IAAI,MAAM,UAAU,CAAC,CAAC,GAAG,EAAE,IAAI,SAAS,MAAM;EACpD,IAAI,OAAO,OAAO,UAAU,IAAI,GAAG,OAAO,UAAU,QAAQ,CAAC,CAAC;EAC9D,MAAM,KAAK,WAAW;EACtB,IAAI,IAAI,OAAO,GAAG;CACnB,EAAE,CAAC;AACJ"}

package/dist/functions-EW-RrRn3.d.mts

@@ -0,0 +1,73 @@
+import { D as QueryOperationTypesBase } from "./types-DfKvtJwS-CrpWTGBJ.mjs";
+import "./types-CkAd8SWm.mjs";
+import { i as SqlOperationEntry } from "./index-Nqc3OHR_.mjs";
+import { Nt as SelectAst } from "./types-DriMIMNQ-BkbsW7w3.mjs";
+import { i as CodecTypesBase, l as RawCodecInferer, o as Expression, r as CodecExpression, x as ScopeField, y as RawSqlTag } from "./expression-6ld_ZQL6-fOuazzzm.mjs";
+//#region ../../../2-sql-family/4-lanes/relational-core/dist/exports/functions.d.mts
+//#region src/functions.d.ts
+type BooleanCodecType = {
+  codecId: 'pg/bool@1';
+  nullable: boolean;
+};
+declare const SubqueryMarker: unique symbol;
+type Subquery<RowType extends Record<string, ScopeField>> = {
+  [SubqueryMarker]: RowType;
+  buildAst(): SelectAst;
+  getRowFields(): Record<string, ScopeField>;
+};
+/** What the function surface reads from a query context: the codec types and the registered query operations. */
+type FunctionsContext = {
+  readonly codecTypes: CodecTypesBase;
+  readonly queryOperationTypes: QueryOperationTypesBase;
+};
+type DeriveExtFunctions<OT extends QueryOperationTypesBase> = { [K in keyof OT]: OT[K]['impl']; };
+type BuiltinFunctions<CT extends Record<string, {
+  readonly input: unknown;
+}>> = {
+  eq: <CodecId extends string>(a: CodecExpression<CodecId, boolean, CT> | null, b: CodecExpression<CodecId, boolean, CT> | null) => Expression<BooleanCodecType>;
+  ne: <CodecId extends string, N extends boolean>(a: CodecExpression<CodecId, N, CT> | null, b: CodecExpression<CodecId, N, CT> | null) => Expression<BooleanCodecType>;
+  gt: <CodecId extends string, N extends boolean>(a: CodecExpression<CodecId, N, CT>, b: CodecExpression<CodecId, N, CT>) => Expression<BooleanCodecType>;
+  gte: <CodecId extends string, N extends boolean>(a: CodecExpression<CodecId, N, CT>, b: CodecExpression<CodecId, N, CT>) => Expression<BooleanCodecType>;
+  lt: <CodecId extends string, N extends boolean>(a: CodecExpression<CodecId, N, CT>, b: CodecExpression<CodecId, N, CT>) => Expression<BooleanCodecType>;
+  lte: <CodecId extends string, N extends boolean>(a: CodecExpression<CodecId, N, CT>, b: CodecExpression<CodecId, N, CT>) => Expression<BooleanCodecType>;
+  and: (...ands: CodecExpression<'pg/bool@1', boolean, CT>[]) => Expression<BooleanCodecType>;
+  or: (...ors: CodecExpression<'pg/bool@1', boolean, CT>[]) => Expression<BooleanCodecType>;
+  exists: (subquery: Subquery<Record<string, ScopeField>>) => Expression<BooleanCodecType>;
+  notExists: (subquery: Subquery<Record<string, ScopeField>>) => Expression<BooleanCodecType>;
+  in: {
+    <CodecId extends string>(expr: Expression<{
+      codecId: CodecId;
+      nullable: boolean;
+    }>, subquery: Subquery<Record<string, {
+      codecId: CodecId;
+      nullable: boolean;
+    }>>): Expression<BooleanCodecType>;
+    <CodecId extends string>(expr: Expression<{
+      codecId: CodecId;
+      nullable: boolean;
+    }>, values: Array<CodecExpression<CodecId, boolean, CT>>): Expression<BooleanCodecType>;
+  };
+  notIn: {
+    <CodecId extends string>(expr: Expression<{
+      codecId: CodecId;
+      nullable: boolean;
+    }>, subquery: Subquery<Record<string, {
+      codecId: CodecId;
+      nullable: boolean;
+    }>>): Expression<BooleanCodecType>;
+    <CodecId extends string>(expr: Expression<{
+      codecId: CodecId;
+      nullable: boolean;
+    }>, values: Array<CodecExpression<CodecId, boolean, CT>>): Expression<BooleanCodecType>;
+  };
+  readonly raw: RawSqlTag;
+};
+/** The functions a query's callbacks receive: the built-in ones and every query operation the contract's target and extensions register. */
+type Functions<QC extends FunctionsContext> = BuiltinFunctions<QC['codecTypes']> & DeriveExtFunctions<QC['queryOperationTypes']>;
+/**
+ * The function surface for a contract: the built-in functions, and each registered query operation's implementation under its name.
+ */
+declare function createFunctions<QC extends FunctionsContext>(operations: Readonly<Record<string, SqlOperationEntry>>, rawCodecInferer: RawCodecInferer): Functions<QC>;
+//#endregion
+export { Subquery as a, FunctionsContext as i, BuiltinFunctions as n, SubqueryMarker as o, Functions as r, createFunctions as s, BooleanCodecType as t };
+//# sourceMappingURL=functions-EW-RrRn3.d.mts.map

package/dist/functions-EW-RrRn3.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"functions-EW-RrRn3.d.mts","names":[],"sources":["../../../../2-sql-family/4-lanes/relational-core/dist/exports/functions.d.mts"],"mappings":";;;;;;;KAKK;EACH;EACA;;cAEY;KACT,SAAS,gBAAgB,eAAe;GAC1C,iBAAiB;EAClB,YAAY;EACZ,gBAAgB,eAAe;;;KAG5B;WACM,YAAY;WACZ,qBAAqB;;KAE3B,mBAAmB,WAAW,8BAA8B,WAAW,KAAK,GAAG;KAC/E,iBAAiB,WAAW;WACtB;;EAET,KAAK,wBAAwB,GAAG,gBAAgB,kBAAkB,YAAY,GAAG,gBAAgB,kBAAkB,eAAe,WAAW;EAC7I,KAAK,wBAAwB,mBAAmB,GAAG,gBAAgB,SAAS,GAAG,YAAY,GAAG,gBAAgB,SAAS,GAAG,eAAe,WAAW;EACpJ,KAAK,wBAAwB,mBAAmB,GAAG,gBAAgB,SAAS,GAAG,KAAK,GAAG,gBAAgB,SAAS,GAAG,QAAQ,WAAW;EACtI,MAAM,wBAAwB,mBAAmB,GAAG,gBAAgB,SAAS,GAAG,KAAK,GAAG,gBAAgB,SAAS,GAAG,QAAQ,WAAW;EACvI,KAAK,wBAAwB,mBAAmB,GAAG,gBAAgB,SAAS,GAAG,KAAK,GAAG,gBAAgB,SAAS,GAAG,QAAQ,WAAW;EACtI,MAAM,wBAAwB,mBAAmB,GAAG,gBAAgB,SAAS,GAAG,KAAK,GAAG,gBAAgB,SAAS,GAAG,QAAQ,WAAW;EACvI,SAAS,MAAM,sCAAsC,UAAU,WAAW;EAC1E,QAAQ,KAAK,sCAAsC,UAAU,WAAW;EACxE,SAAS,UAAU,SAAS,eAAe,iBAAiB,WAAW;EACvE,YAAY,UAAU,SAAS,eAAe,iBAAiB,WAAW;EAC1E;KACG,wBAAwB,MAAM;MAC7B,SAAS;MACT;QACE,UAAU,SAAS;MACrB,SAAS;MACT;UACI,WAAW;KAChB,wBAAwB,MAAM;MAC7B,SAAS;MACT;QACE,QAAQ,MAAM,gBAAgB,kBAAkB,OAAO,WAAW;;EAExE;KACG,wBAAwB,MAAM;MAC7B,SAAS;MACT;QACE,UAAU,SAAS;MACrB,SAAS;MACT;UACI,WAAW;KAChB,wBAAwB,MAAM;MAC7B,SAAS;MACT;QACE,QAAQ,MAAM,gBAAgB,kBAAkB,OAAO,WAAW;;WAE/D,KAAK;;;KAGX,UAAU,WAAW,oBAAoB,iBAAiB,oBAAoB,mBAAmB;;;;iBAIrF,gBAAgB,WAAW,kBAAkB,YAAY,SAAS,eAAe,qBAAqB,iBAAiB,kBAAkB,UAAU"}