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

package/dist/{types-4YenawkP-CwaaZSid.mjs → types-DoyiTsjg-2YMhMJDA.mjs}

@@ -1,11 +1,13 @@
-import { f as normalizeIndexOptionValue, l as nameOf } from "./naming-DKr4TJd7-Cszhq9RV.mjs";
-import { IRNodeBase, freezeNode } from "@prisma/orm-framework/components/ir";
-import { InternalError } from "@prisma/orm-framework/utils/internal-error";
+import { f as normalizeIndexOptionValue, l as nameOf } from "./naming-bM5qm5PY-jOg3JFMb.mjs";
 import { ifDefined } from "@prisma/orm-framework/utils/defined";
+import { IRNodeBase, freezeNode } from "@prisma/orm-framework/components/ir";
+import { dataTypeValuesEqual } from "@prisma/orm-framework/components/codec";
+import { canonicalizeJson } from "@prisma/orm-framework/components/utils";
 import { blindCast } from "@prisma/orm-framework/utils/casts";
+import { InternalError } from "@prisma/orm-framework/utils/internal-error";
 import { canonicalStringify } from "@prisma/orm-framework/utils/canonical-stringify";
 import { isArrayEqual } from "@prisma/orm-framework/utils/array-equal";
-//#region ../../../2-sql/1-core/schema-ir/dist/types-4YenawkP.mjs
+//#region ../../../2-sql-family/1-core/schema-ir/dist/types-DoyiTsjg.mjs
 /**
 * The `nodeKind` discriminant for each relational schema-diff leaf node.
 * Each node carries a unique value; the differ pairs siblings by `id`, and
@@ -220,53 +222,17 @@ var SqlCheckConstraintIR = class SqlCheckConstraintIR extends SqlSchemaIRNode {
 		return this.expression === node.expression;
 	}
 };
-/**
-* Structural equality for two resolved column defaults, ported from the
-* relational walk's `columnDefaultsEqual` normalized branch: kinds must
-* match; literal values are normalized (Date and temporal-typed strings to
-* ISO instants) then compared canonically (JSON objects match their
-* canonical string form); function expressions compare case- and
-* whitespace-insensitively.
-*
-* `nativeType` provides the temporal-normalization context (the actual
-* side's resolved native type in a diff comparison).
-*/
-function resolvedDefaultsEqual(expected, actual, nativeType) {
-	if (expected.kind !== actual.kind) return false;
-	if (expected.kind === "literal" && actual.kind === "literal") return literalValuesEqual(normalizeLiteralValue(expected.value, nativeType), normalizeLiteralValue(actual.value, nativeType));
-	if (expected.kind === "function" && actual.kind === "function") return normalizeFunctionExpression(expected.expression) === normalizeFunctionExpression(actual.expression);
-	return false;
-}
-function normalizeFunctionExpression(expression) {
-	return expression.toLowerCase().replace(/\s+/g, "");
-}
-function isTemporalNativeType(nativeType) {
-	if (!nativeType) return false;
-	const normalized = nativeType.toLowerCase();
-	return normalized.includes("timestamp") || normalized === "date";
+function isList(value) {
+	return Array.isArray(value);
 }
-function normalizeLiteralValue(value, nativeType) {
-	if (value instanceof Date) return value.toISOString();
-	if (typeof value === "string" && isTemporalNativeType(nativeType)) {
-		const parsed = new Date(value);
-		if (!Number.isNaN(parsed.getTime())) return parsed.toISOString();
-	}
-	return value;
-}
-function literalValuesEqual(a, b) {
-	if (a === b) return true;
-	if (typeof a === "object" && a !== null && typeof b === "object" && b !== null) return canonicalStringify(a) === canonicalStringify(b);
-	if (typeof a === "object" && a !== null && typeof b === "string") try {
-		return canonicalStringify(a) === canonicalStringify(JSON.parse(b));
-	} catch {
-		return false;
-	}
-	if (typeof a === "string" && typeof b === "object" && b !== null) try {
-		return canonicalStringify(JSON.parse(a)) === canonicalStringify(b);
-	} catch {
-		return false;
-	}
-	return false;
+/** Whether two defaults are one value: the same type, parameters and value, element by element for a list. */
+function sqlDefaultValuesEqual(a, b) {
+	if (!isList(a) || !isList(b)) return !isList(a) && !isList(b) && dataTypeValuesEqual(a, b);
+	return a.length === b.length && a.every((element, index) => {
+		const other = b[index];
+		if (element === null || other === null || other === void 0) return element === other;
+		return dataTypeValuesEqual(element, other);
+	});
 }
 /**
 * Schema-diff node for a column's default value. The default is the one
@@ -287,8 +253,13 @@ var SqlColumnDefaultIR = class SqlColumnDefaultIR extends SqlSchemaIRNode {
 		super();
 		if (input.resolved !== void 0) this.resolved = input.resolved;
 		if (input.raw !== void 0) this.raw = input.raw;
-		if (input.nativeTypeContext !== void 0) this.nativeTypeContext = input.nativeTypeContext;
+		defineNonEnumerable(this, "authored", input.authored);
+		defineNonEnumerable(this, "value", input.value);
+		defineNonEnumerable(this, "unreadable", input.unreadable);
+		defineNonEnumerable(this, "expressionValue", input.expressionValue);
 		defineNonEnumerable(this, "many", input.many);
+		defineNonEnumerable(this, "codecRef", input.codecRef);
+		defineNonEnumerable(this, "sqlExpressionLiteralFor", input.sqlExpressionLiteralFor);
 		freezeNode(this);
 	}
 	get id() {
@@ -301,20 +272,90 @@ var SqlColumnDefaultIR = class SqlColumnDefaultIR extends SqlSchemaIRNode {
 		return node.nodeKind === RelationalSchemaNodeKind.columnDefault;
 	}
 	/**
-	* Structured comparison with `this` as the expected side: both sides
-	* resolved compare per the relational walk's `columnDefaultsEqual`
-	* semantics; a declared expected default against an unparseable actual
-	* (raw present, no resolved parse) is a mismatch; two raw-only nodes fall
-	* back to raw string equality.
+	* Compares with `this` as the expected side. Two literals compare as values of the column's type
+	* when both sides hold one, and as canonical JSON otherwise; a `Date` the column's codec could not
+	* read into a value equals nothing. Two expressions compare as text, with
+	* case and whitespace ignored outside quotes. An expected expression that writes a literal, read by
+	* the column's codec during introspection, matches a reported literal when the two values are
+	* equal; when the codec could not read one of them, it compares with the reported text. A resolved
+	* side against a raw-only side is a mismatch; two raw-only nodes compare their text.
 	*/
 	isEqualTo(other) {
 		const node = blindCast(other);
 		assertNode(node, "SqlColumnDefaultIR", SqlColumnDefaultIR.is);
-		if (this.resolved !== void 0 && node.resolved !== void 0) return resolvedDefaultsEqual(this.resolved, node.resolved, node.nativeTypeContext ?? this.nativeTypeContext);
-		if (this.resolved !== void 0 || node.resolved !== void 0) return false;
-		return this.raw === node.raw;
+		const expected = this.resolved;
+		const actual = node.resolved;
+		if (expected?.kind === "function" && actual === void 0) return node.raw !== void 0 && sameExpression(expected.expression, node.raw);
+		if (expected === void 0 || actual === void 0) return expected === actual && this.raw === node.raw;
+		if (expected.kind === "function") {
+			if (actual.kind === "function") return sameExpression(expected.expression, actual.expression);
+			if (node.value !== void 0 && node.expressionValue !== void 0) return sqlDefaultValuesEqual(node.expressionValue, node.value);
+			return node.raw !== void 0 && sameExpression(expected.expression, node.raw);
+		}
+		if (actual.kind !== "literal") return false;
+		if (this.value !== void 0 && node.value !== void 0) return sqlDefaultValuesEqual(this.value, node.value);
+		if (expected.value instanceof Date || actual.value instanceof Date) return false;
+		return canonicalStringify(expected.value) === canonicalStringify(actual.value);
+	}
+	/**
+	* For two default expressions, the text the database reads back, since it may store an expression
+	* in a form of its own. Otherwise why the column's codec could not read the database's default, or
+	* the value each side holds.
+	*/
+	explainMismatch(actual) {
+		if (!(actual instanceof SqlColumnDefaultIR)) return void 0;
+		if (actual.unreadable !== void 0) return {
+			text: actual.unreadable,
+			cause: "differs"
+		};
+		return this.storedExpressionForm(actual) ?? {
+			text: `The contract holds ${describeDefault(this)}, and the database holds ${describeDefault(actual)}.`,
+			cause: "differs"
+		};
+	}
+	storedExpressionForm(actual) {
+		if (this.resolved?.kind !== "function" || actual.resolved?.kind !== "function") return void 0;
+		const literalFor = this.sqlExpressionLiteralFor;
+		const shown = (text) => literalFor?.(text) ?? JSON.stringify(text);
+		const stored = actual.raw ?? actual.resolved.expression;
+		const written = literalFor === void 0 ? stored : [stored, actual.resolved.expression].find((text) => literalFor(text) !== void 0);
+		const advice = written === void 0 ? "No `sql` literal writes that text unchanged, so change the default's SQL in the contract until the database stores it as written." : `If they do, write the default as ${shown(written)}.`;
+		return {
+			text: `The database reads this default back as ${shown(written ?? stored)}; the contract declares ${shown(this.resolved.expression)}. The database may store a default expression in its own form, so the two can mean the same. ${advice}`,
+			cause: "possibly-equivalent"
+		};
 	}
 };
+/** A default as a person reads it: a literal as JSON, the value its type read when there is one, an expression as its text, and the text the database reports beside a value read from it. */
+function describeDefault(node) {
+	const resolved = node.resolved;
+	if (resolved === void 0) return node.raw ?? "no default";
+	if (resolved.kind === "function") return resolved.expression;
+	const shown = JSON.stringify(node.value === void 0 ? resolved.value : jsonOfDefaultValue(node.value));
+	return node.raw === void 0 || node.raw === shown ? shown : `${shown} (${node.raw})`;
+}
+function isDefaultList(value) {
+	return Array.isArray(value);
+}
+function jsonOfDefaultValue(value) {
+	return isDefaultList(value) ? value.map((element) => element === null ? null : element.value) : value.value;
+}
+function sameExpression(a, b) {
+	return comparableExpression(a) === comparableExpression(b);
+}
+/** The expression with case and whitespace dropped outside quotes; a quoted literal or identifier keeps both, since they change what it means. */
+function comparableExpression(expression) {
+	let result = "";
+	let quote;
+	for (const char of expression) if (quote !== void 0) {
+		result += char;
+		if (char === quote) quote = void 0;
+	} else if (char === "'" || char === "\"") {
+		quote = char;
+		result += char;
+	} else if (!/\s/.test(char)) result += char.toLowerCase();
+	return result;
+}
 /**
 * Schema IR node for a single column on a table, as observed by
 * introspection. Unlike the Contract IR `StorageColumn`, this carries
@@ -324,31 +365,34 @@ var SqlColumnDefaultIR = class SqlColumnDefaultIR extends SqlSchemaIRNode {
 *
 * Implements `DiffableNode` so a column is directly a table's diff-tree
 * child: `id` is the column name (unique among a table's columns); `isEqualTo`
-* compares this column's own attributes only — never children, since a
-* column is a leaf. When both sides carry `resolvedNativeType` (stamped at
-* derivation/introspection), the comparison uses the resolved values —
-* resolved native type, nullability, and structured default equality per
-* the relational walk's `columnDefaultsEqual` semantics, with `this` as the
-* expected side. Otherwise it falls back to comparing raw fields.
+* compares this column's own attributes only, never its default, which is a
+* child node: the type by {@link sqlColumnTypesEqual}, and nullability.
 */
 var SqlColumnIR = class SqlColumnIR extends SqlSchemaIRNode {
 	nodeKind = RelationalSchemaNodeKind.column;
 	name;
-	nativeType;
+	/** See {@link SqlColumnIRInput.typeText}. */
+	typeText;
 	nullable;
 	constructor(input) {
 		super();
 		this.name = input.name;
-		this.nativeType = input.nativeType;
+		this.typeText = input.typeText;
 		this.nullable = input.nullable;
 		if (input.default !== void 0) this.default = input.default;
 		if (input.annotations !== void 0) this.annotations = input.annotations;
 		if (input.many !== void 0) this.many = input.many;
-		if (input.resolvedNativeType !== void 0) this.resolvedNativeType = input.resolvedNativeType;
 		if (input.resolvedDefault !== void 0) this.resolvedDefault = input.resolvedDefault;
+		defineNonEnumerable(this, "authoredDefault", input.authoredDefault);
 		defineNonEnumerable(this, "codecRef", input.codecRef);
-		defineNonEnumerable(this, "codecBaseNativeType", input.codecBaseNativeType);
-		defineNonEnumerable(this, "codecNamedType", input.codecNamedType);
+		defineNonEnumerable(this, "storedType", input.storedType);
+		defineNonEnumerable(this, "storedTypeParams", input.storedTypeParams);
+		defineNonEnumerable(this, "defaultValue", input.defaultValue);
+		defineNonEnumerable(this, "defaultUnreadable", input.defaultUnreadable);
+		defineNonEnumerable(this, "defaultExpressionValue", input.defaultExpressionValue);
+		defineNonEnumerable(this, "sqlExpressionLiteralFor", input.sqlExpressionLiteralFor);
+		defineNonEnumerable(this, "reportedType", input.reportedType);
+		defineNonEnumerable(this, "catalogText", input.catalogText);
 		freezeNode(this);
 	}
 	get id() {
@@ -365,27 +409,84 @@ var SqlColumnIR = class SqlColumnIR extends SqlSchemaIRNode {
 		return [new SqlColumnDefaultIR({
 			...ifDefined("resolved", this.resolvedDefault),
 			...ifDefined("raw", this.default),
-			...ifDefined("nativeTypeContext", this.resolvedNativeType),
-			...ifDefined("many", this.many ?? this.codecRef?.many)
+			...ifDefined("authored", this.authoredDefault),
+			...ifDefined("value", this.defaultValue),
+			...ifDefined("unreadable", this.defaultUnreadable),
+			...ifDefined("expressionValue", this.defaultExpressionValue),
+			...ifDefined("many", this.many ?? this.codecRef?.many),
+			...ifDefined("codecRef", this.codecRef),
+			...ifDefined("sqlExpressionLiteralFor", this.sqlExpressionLiteralFor)
 		})];
 	}
+	/** This column under another name, with every other field as it is. */
+	withName(name) {
+		const fields = Object.fromEntries(Object.getOwnPropertyNames(this).map((key) => [key, Reflect.get(this, key)]));
+		return new SqlColumnIR({
+			...blindCast(fields),
+			name
+		});
+	}
 	static is(node) {
 		return node.nodeKind === RelationalSchemaNodeKind.column;
 	}
 	/**
-	* Compares the column's own attributes only — the default lives on the
-	* child node. When both sides carry `resolvedNativeType`, the resolved
-	* value governs (array-ness rides on its `[]` suffix); otherwise raw
-	* fields compare.
+	* Compares the column's own attributes only — the default lives on the child node: the type, by {@link sqlColumnTypesEqual}, and nullability.
 	*/
 	isEqualTo(other) {
 		const node = blindCast(other);
 		assertNode(node, "SqlColumnIR", SqlColumnIR.is);
-		if (this.resolvedNativeType !== void 0 && node.resolvedNativeType !== void 0) return this.resolvedNativeType === node.resolvedNativeType && this.nullable === node.nullable;
-		return this.nativeType === node.nativeType && this.nullable === node.nullable && Boolean(this.many) === Boolean(node.many);
+		return sqlColumnTypesEqual(this, node) && this.nullable === node.nullable;
+	}
+	/** Why `actual` is not this column: the two types as written and reported, or the nullability of each. The two sides always hold different values. */
+	explainMismatch(actual) {
+		if (actual === void 0) return void 0;
+		const node = blindCast(actual);
+		assertNode(node, "SqlColumnIR", SqlColumnIR.is);
+		const texts = catalogTexts(this, node);
+		if (texts !== void 0 && texts.expected !== texts.actual) return differs(`The column type is "${texts.expected}", but the database reports "${texts.actual}". A type named by its catalog text is compared with the text the database reports, exactly.`);
+		if (node.storedType === void 0 && node.reportedType !== void 0) return differs(node.typeText === "" ? "The database column has no declared type." : `The database column is ${shownTypeOf(node)}, which no data type in the configured stack declares.`);
+		if (!sqlColumnTypesEqual(this, node)) return differs(`The contract column is ${shownTypeOf(this)} and the database column is ${shownTypeOf(node)}.`);
+		if (this.nullable !== node.nullable) return differs(`The contract column is ${nullability(this)} and the database column is ${nullability(node)}.`);
 	}
 };
 /**
+* Whether two columns have the same type: both have a stored type, the two are one data type, their parameters are equal as canonical JSON, and both or neither are lists. A column no data type claims has no stored type and never has the same type as another. ADR 254.
+*
+* When either column carries a {@link SqlColumnIR.catalogText}, the two compare by text instead, exactly, with `[]` for a list: that text against the other column's catalog text or reported text. ADR 273.
+*/
+function sqlColumnTypesEqual(a, b) {
+	const texts = catalogTexts(a, b);
+	if (texts !== void 0) return texts.expected === texts.actual;
+	return a.storedType !== void 0 && b.storedType !== void 0 && a.storedType.id === b.storedType.id && canonicalizeJson(a.storedTypeParams ?? {}) === canonicalizeJson(b.storedTypeParams ?? {}) && Boolean(a.many) === Boolean(b.many);
+}
+/** The text a column's type compares by, with `[]` for a list, when it has one: its catalog text, or the text the database reports. */
+function comparedText(column) {
+	const text = column.catalogText ?? column.reportedType?.text;
+	return text === void 0 ? void 0 : `${text}${column.many === true ? "[]" : ""}`;
+}
+/** The two texts a pair of columns compares by, when either carries a catalog text. A side with no text to compare gives the empty text, which no catalog text equals. */
+function catalogTexts(expected, actual) {
+	if (expected.catalogText === void 0 && actual.catalogText === void 0) return void 0;
+	return {
+		expected: comparedText(expected) ?? "",
+		actual: comparedText(actual) ?? ""
+	};
+}
+/** The column's type as the contract writes it, or as introspection gives it, with `[]` for a list, in double quotes unless the text has double quotes of its own, as `"char"` does. */
+function shownTypeOf(column) {
+	const text = `${column.typeText}${column.many === true ? "[]" : ""}`;
+	return text.includes("\"") ? text : `"${text}"`;
+}
+function differs(text) {
+	return {
+		text,
+		cause: "differs"
+	};
+}
+function nullability(column) {
+	return column.nullable ? "nullable" : "not nullable";
+}
+/**
 * Schema IR node for a foreign-key constraint as observed by
 * introspection. The `referencedTable` / `referencedColumns` field
 * names match the introspection vocabulary (`pg_constraint.confkey`,
@@ -715,6 +816,6 @@ var SqlSchemaIR = class extends SqlSchemaIRNode {
 	}
 };
 //#endregion
-export { SqlColumnIR as a, SqlSchemaIR as c, SqlUniqueIR as d, assertNode as f, relationalNodeGranularity as h, SqlColumnDefaultIR as i, SqlSchemaIRNode as l, relationalNodeEntityKind as m, RelationalSchemaNodeKind as n, SqlForeignKeyIR as o, defineNonEnumerable as p, SqlCheckConstraintIR as r, SqlIndexIR as s, PrimaryKey as t, SqlTableIR as u };
+export { sqlDefaultValuesEqual as _, SqlColumnIR as a, SqlSchemaIR as c, SqlUniqueIR as d, assertNode as f, sqlColumnTypesEqual as g, relationalNodeGranularity as h, SqlColumnDefaultIR as i, SqlSchemaIRNode as l, relationalNodeEntityKind as m, RelationalSchemaNodeKind as n, SqlForeignKeyIR as o, defineNonEnumerable as p, SqlCheckConstraintIR as r, SqlIndexIR as s, PrimaryKey as t, SqlTableIR as u };
 
-//# sourceMappingURL=types-4YenawkP-CwaaZSid.mjs.map
+//# sourceMappingURL=types-DoyiTsjg-2YMhMJDA.mjs.map

package/dist/types-DoyiTsjg-2YMhMJDA.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"types-DoyiTsjg-2YMhMJDA.mjs","names":[],"sources":["../../../../2-sql-family/1-core/schema-ir/dist/types-DoyiTsjg.mjs"],"sourcesContent":["import { f as normalizeIndexOptionValue, l as nameOf } from \"./naming-bM5qm5PY.mjs\";\nimport { IRNodeBase, freezeNode } from \"@internal/framework-components/ir\";\nimport { blindCast } from \"@internal/utils/casts\";\nimport { InternalError } from \"@internal/utils/internal-error\";\nimport { canonicalStringify } from \"@internal/utils/canonical-stringify\";\nimport { dataTypeValuesEqual } from \"@internal/framework-components/codec\";\nimport { canonicalizeJson } from \"@internal/framework-components/utils\";\nimport { ifDefined } from \"@internal/utils/defined\";\nimport { isArrayEqual } from \"@internal/utils/array-equal\";\n//#region src/ir/schema-node-kinds.ts\n/**\n* The `nodeKind` discriminant for each relational schema-diff leaf node.\n* Each node carries a unique value; the differ pairs siblings by `id`, and\n* these kinds distinguish the node types that appear as `PostgresTableSchemaNode`\n* children (columns, primary key, foreign keys, uniques, indexes, checks) from\n* each other and from the RLS policy/role kinds a target defines separately.\n*/\nconst RelationalSchemaNodeKind = {\n\tschema: \"sql-schema\",\n\ttable: \"sql-table\",\n\tcolumn: \"sql-column\",\n\tcolumnDefault: \"sql-column-default\",\n\tprimaryKey: \"sql-primary-key\",\n\tforeignKey: \"sql-foreign-key\",\n\tunique: \"sql-unique\",\n\tindex: \"sql-index\",\n\tcheck: \"sql-check-constraint\"\n};\n/**\n* The one real map from a relational `nodeKind` to the framework-neutral\n* {@link DiffSubjectGranularity} its diff issues carry — the SQL family's\n* post-diff filters (issue category, strict-mode gating) and the framework\n* aggregate's unclaimed-elements sweep key on the granularity, never on the\n* `nodeKind` spelling and never on anything stamped on the node. Resolution\n* is by `nodeKind` equality against this map, not a suffix string match.\n* Target-specific node kinds (Postgres namespace/table/policy/role) are\n* outside this family layer's vocabulary and map their own kinds directly.\n*/\nconst RELATIONAL_NODE_GRANULARITY = {\n\t[RelationalSchemaNodeKind.schema]: \"structural\",\n\t[RelationalSchemaNodeKind.table]: \"entity\",\n\t[RelationalSchemaNodeKind.column]: \"field\",\n\t[RelationalSchemaNodeKind.columnDefault]: \"auxiliary\",\n\t[RelationalSchemaNodeKind.primaryKey]: \"auxiliary\",\n\t[RelationalSchemaNodeKind.foreignKey]: \"auxiliary\",\n\t[RelationalSchemaNodeKind.unique]: \"auxiliary\",\n\t[RelationalSchemaNodeKind.index]: \"auxiliary\",\n\t[RelationalSchemaNodeKind.check]: \"auxiliary\"\n};\nfunction isRelationalSchemaNodeKind(nodeKind) {\n\treturn Object.hasOwn(RELATIONAL_NODE_GRANULARITY, nodeKind);\n}\n/**\n* Looks up the subject granularity for a relational `nodeKind`. Throws for a\n* `nodeKind` outside this map (a target-specific kind, e.g. Postgres's\n* namespace/table/policy/role) — those map their own kinds directly rather\n* than through this family-level map.\n*/\nfunction relationalNodeGranularity(nodeKind) {\n\tif (!isRelationalSchemaNodeKind(nodeKind)) throw new InternalError(`relationalNodeGranularity: unrecognized relational node kind \"${nodeKind}\"`);\n\treturn RELATIONAL_NODE_GRANULARITY[nodeKind];\n}\n/**\n* The one real map from a relational `nodeKind` to its storage `entityKind`\n* — the same vocabulary the contract storage's `entries` dictionary keys use\n* (`elementCoordinates` walks it). Only the whole-table kind has an entity of\n* its own; every other relational node (a column, an index, …) is nested\n* under one and maps to nothing here.\n*/\nconst RELATIONAL_NODE_ENTITY_KIND = { [RelationalSchemaNodeKind.table]: \"table\" };\n/**\n* Looks up the storage `entityKind` for a relational `nodeKind` — sibling of\n* {@link relationalNodeGranularity}, resolved by `nodeKind` equality against\n* {@link RELATIONAL_NODE_ENTITY_KIND}. `undefined` for a target-specific kind\n* (targets map their own kinds directly) or a relational kind with no entity\n* of its own.\n*/\nfunction relationalNodeEntityKind(nodeKind) {\n\treturn isRelationalSchemaNodeKind(nodeKind) ? RELATIONAL_NODE_ENTITY_KIND[nodeKind] : void 0;\n}\n//#endregion\n//#region src/ir/sql-schema-ir-node.ts\n/**\n* SQL Schema IR node base. Carries the family-level\n* `kind = 'sql-schema-ir'` discriminator and inherits the framework's\n* `freezeNode` affordance.\n*\n* SQL Schema IR represents the actual database state as discovered by\n* introspection (the parallel to SQL Contract IR, which represents the\n* desired state).\n*\n* The discriminator is installed as a non-enumerable own property,\n* matching the SqlNode pattern. This keeps `JSON.stringify(node)`\n* canonical (no `kind` field), keeps `toEqual({...})` test assertions\n* against pre-lift flat shapes passing, and keeps `node.kind` readable\n* for dispatch.\n*\n* Both `kind` and `nodeKind` are required: every concrete leaf is a node\n* the generic differ can pair and compare, so every leaf must declare which\n* node it is. `nodeKind` has no default here — every direct subclass sets its\n* own literal value (the relational leaves via `RelationalSchemaNodeKind`,\n* target concretions via their own vocabulary, e.g. `PostgresSchemaNodeKind`).\n*/\nvar SqlSchemaIRNode = class extends IRNodeBase {\n\tconstructor() {\n\t\tsuper();\n\t\tObject.defineProperty(this, \"kind\", {\n\t\t\tvalue: \"sql-schema-ir\",\n\t\t\twritable: false,\n\t\t\tenumerable: false,\n\t\t\tconfigurable: false\n\t\t});\n\t}\n};\n/**\n* Asserts `node` matches `predicate`, narrowing its type to `T`. The one\n* shared implementation every node class's `static assert` and `isEqualTo`\n* reach for, instead of each hand-writing its own throw: the message names\n* the class the caller expected.\n*/\nfunction assertNode(node, className, predicate) {\n\tif (node === void 0 || !predicate(node)) throw new InternalError(`Expected a ${className} but got nodeKind=${node?.nodeKind ?? \"undefined\"}`);\n}\n/**\n* Defines a non-enumerable own property, the same treatment `kind` gets\n* above: a derivation-time render-support field stays out of\n* `JSON.stringify`, `toEqual({...})` structural assertions, and spreads,\n* while remaining directly readable (`node.field`) for the one consumer\n* that resolves it at plan time. A no-op when `value` is `undefined` — the\n* property is simply absent, matching every other optional field on these\n* nodes.\n*/\nfunction defineNonEnumerable(target, key, value) {\n\tif (value === void 0) return;\n\tObject.defineProperty(target, key, {\n\t\tvalue,\n\t\tenumerable: false,\n\t\twritable: false,\n\t\tconfigurable: false\n\t});\n}\n//#endregion\n//#region src/ir/primary-key.ts\n/**\n* Primary-key Schema IR node. Mirrors the Contract IR `PrimaryKey`\n* shape (same `columns` + optional `name`) so verification can compare\n* intent and actual structurally. Defined here independently to avoid\n* a sql-schema-ir -> sql-contract dependency.\n*\n* Implements `DiffableNode` so a primary key is directly a table's diff-tree\n* child. `id` is a fixed sentinel — a table has at most one primary key, so\n* there is never a sibling to disambiguate against. `isEqualTo` compares the\n* column tuple; the PK's own `name` is a database-assigned label with no\n* semantic weight, so it is not compared (mirrors the policy node's\n* name-insensitivity to non-identifying detail).\n*/\nvar PrimaryKey = class PrimaryKey extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.primaryKey;\n\tcolumns;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.columns = input.columns;\n\t\tif (input.name !== void 0) this.name = input.name;\n\t\tdefineNonEnumerable(this, \"dependsOn\", input.dependsOn);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn \"primary-key\";\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic from(value) {\n\t\treturn value instanceof PrimaryKey ? value : new PrimaryKey(value);\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.primaryKey;\n\t}\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"PrimaryKey\", PrimaryKey.is);\n\t\treturn this.columns.length === node.columns.length && this.columns.every((c, i) => c === node.columns[i]);\n\t}\n};\n//#endregion\n//#region src/ir/sql-check-constraint-ir.ts\n/**\n* Schema IR node for a table-level check constraint, carried as an opaque\n* predicate. The expression is never parsed — a database reprints predicates\n* in its own normalized form, so any structured reading of it would drift.\n*\n* Implements `DiffableNode` so a check is directly a table's diff-tree child;\n* `id` is `check:<name>`. `isEqualTo` is mode-selected by the receiver's\n* `prefix` (the differ always calls `expected.isEqualTo(actual)`): a\n* wire-named receiver compares ids only — the wire name's hash already\n* commits to the predicate — while an exact-named receiver byte-compares the\n* expression, which is reliable precisely when both sides came from the same\n* reprint.\n*/\nvar SqlCheckConstraintIR = class SqlCheckConstraintIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.check;\n\tname;\n\texpression;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.name = nameOf(input.naming);\n\t\tif (input.naming.kind === \"wire\") this.prefix = input.naming.prefix;\n\t\tthis.expression = input.expression;\n\t\tdefineNonEnumerable(this, \"dependsOn\", input.dependsOn);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn `check:${this.name}`;\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic from(value) {\n\t\treturn value instanceof SqlCheckConstraintIR ? value : new SqlCheckConstraintIR(value);\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.check;\n\t}\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlCheckConstraintIR\", SqlCheckConstraintIR.is);\n\t\tif (this.prefix !== void 0) return this.id === node.id;\n\t\treturn this.expression === node.expression;\n\t}\n};\n//#endregion\n//#region src/ir/sql-default-value.ts\nfunction isList(value) {\n\treturn Array.isArray(value);\n}\n/** Whether two defaults are one value: the same type, parameters and value, element by element for a list. */\nfunction sqlDefaultValuesEqual(a, b) {\n\tif (!isList(a) || !isList(b)) return !isList(a) && !isList(b) && dataTypeValuesEqual(a, b);\n\treturn a.length === b.length && a.every((element, index) => {\n\t\tconst other = b[index];\n\t\tif (element === null || other === null || other === void 0) return element === other;\n\t\treturn dataTypeValuesEqual(element, other);\n\t});\n}\n//#endregion\n//#region src/ir/sql-column-default-ir.ts\n/**\n* Schema-diff node for a column's default value. The default is the one\n* column attribute with an extra/missing/drift lifecycle of its own, so it\n* is a child node of the column rather than a compared attribute: an\n* undeclared live default surfaces as `not-expected`, a declared default the\n* database lacks as `not-found`, and a divergent value as `not-equal` — the\n* three reasons cover the legacy `extra_default` / `default_missing` /\n* `default_mismatch` vocabulary with no attribute inspection.\n*\n* `id` is a fixed sentinel — a column has at most one default. Built\n* transiently by `SqlColumnIR.children()` from the column's own fields;\n* never constructed by derivation or introspection directly.\n*/\nvar SqlColumnDefaultIR = class SqlColumnDefaultIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.columnDefault;\n\tconstructor(input) {\n\t\tsuper();\n\t\tif (input.resolved !== void 0) this.resolved = input.resolved;\n\t\tif (input.raw !== void 0) this.raw = input.raw;\n\t\tdefineNonEnumerable(this, \"authored\", input.authored);\n\t\tdefineNonEnumerable(this, \"value\", input.value);\n\t\tdefineNonEnumerable(this, \"unreadable\", input.unreadable);\n\t\tdefineNonEnumerable(this, \"expressionValue\", input.expressionValue);\n\t\tdefineNonEnumerable(this, \"many\", input.many);\n\t\tdefineNonEnumerable(this, \"codecRef\", input.codecRef);\n\t\tdefineNonEnumerable(this, \"sqlExpressionLiteralFor\", input.sqlExpressionLiteralFor);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn \"default\";\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.columnDefault;\n\t}\n\t/**\n\t* Compares with `this` as the expected side. Two literals compare as values of the column's type\n\t* when both sides hold one, and as canonical JSON otherwise; a `Date` the column's codec could not\n\t* read into a value equals nothing. Two expressions compare as text, with\n\t* case and whitespace ignored outside quotes. An expected expression that writes a literal, read by\n\t* the column's codec during introspection, matches a reported literal when the two values are\n\t* equal; when the codec could not read one of them, it compares with the reported text. A resolved\n\t* side against a raw-only side is a mismatch; two raw-only nodes compare their text.\n\t*/\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlColumnDefaultIR\", SqlColumnDefaultIR.is);\n\t\tconst expected = this.resolved;\n\t\tconst actual = node.resolved;\n\t\tif (expected?.kind === \"function\" && actual === void 0) return node.raw !== void 0 && sameExpression(expected.expression, node.raw);\n\t\tif (expected === void 0 || actual === void 0) return expected === actual && this.raw === node.raw;\n\t\tif (expected.kind === \"function\") {\n\t\t\tif (actual.kind === \"function\") return sameExpression(expected.expression, actual.expression);\n\t\t\tif (node.value !== void 0 && node.expressionValue !== void 0) return sqlDefaultValuesEqual(node.expressionValue, node.value);\n\t\t\treturn node.raw !== void 0 && sameExpression(expected.expression, node.raw);\n\t\t}\n\t\tif (actual.kind !== \"literal\") return false;\n\t\tif (this.value !== void 0 && node.value !== void 0) return sqlDefaultValuesEqual(this.value, node.value);\n\t\tif (expected.value instanceof Date || actual.value instanceof Date) return false;\n\t\treturn canonicalStringify(expected.value) === canonicalStringify(actual.value);\n\t}\n\t/**\n\t* For two default expressions, the text the database reads back, since it may store an expression\n\t* in a form of its own. Otherwise why the column's codec could not read the database's default, or\n\t* the value each side holds.\n\t*/\n\texplainMismatch(actual) {\n\t\tif (!(actual instanceof SqlColumnDefaultIR)) return void 0;\n\t\tif (actual.unreadable !== void 0) return {\n\t\t\ttext: actual.unreadable,\n\t\t\tcause: \"differs\"\n\t\t};\n\t\treturn this.storedExpressionForm(actual) ?? {\n\t\t\ttext: `The contract holds ${describeDefault(this)}, and the database holds ${describeDefault(actual)}.`,\n\t\t\tcause: \"differs\"\n\t\t};\n\t}\n\tstoredExpressionForm(actual) {\n\t\tif (this.resolved?.kind !== \"function\" || actual.resolved?.kind !== \"function\") return void 0;\n\t\tconst literalFor = this.sqlExpressionLiteralFor;\n\t\tconst shown = (text) => literalFor?.(text) ?? JSON.stringify(text);\n\t\tconst stored = actual.raw ?? actual.resolved.expression;\n\t\tconst written = literalFor === void 0 ? stored : [stored, actual.resolved.expression].find((text) => literalFor(text) !== void 0);\n\t\tconst advice = written === void 0 ? \"No `sql` literal writes that text unchanged, so change the default's SQL in the contract until the database stores it as written.\" : `If they do, write the default as ${shown(written)}.`;\n\t\treturn {\n\t\t\ttext: `The database reads this default back as ${shown(written ?? stored)}; the contract declares ${shown(this.resolved.expression)}. The database may store a default expression in its own form, so the two can mean the same. ${advice}`,\n\t\t\tcause: \"possibly-equivalent\"\n\t\t};\n\t}\n};\n/** A default as a person reads it: a literal as JSON, the value its type read when there is one, an expression as its text, and the text the database reports beside a value read from it. */\nfunction describeDefault(node) {\n\tconst resolved = node.resolved;\n\tif (resolved === void 0) return node.raw ?? \"no default\";\n\tif (resolved.kind === \"function\") return resolved.expression;\n\tconst shown = JSON.stringify(node.value === void 0 ? resolved.value : jsonOfDefaultValue(node.value));\n\treturn node.raw === void 0 || node.raw === shown ? shown : `${shown} (${node.raw})`;\n}\nfunction isDefaultList(value) {\n\treturn Array.isArray(value);\n}\nfunction jsonOfDefaultValue(value) {\n\treturn isDefaultList(value) ? value.map((element) => element === null ? null : element.value) : value.value;\n}\nfunction sameExpression(a, b) {\n\treturn comparableExpression(a) === comparableExpression(b);\n}\n/** The expression with case and whitespace dropped outside quotes; a quoted literal or identifier keeps both, since they change what it means. */\nfunction comparableExpression(expression) {\n\tlet result = \"\";\n\tlet quote;\n\tfor (const char of expression) if (quote !== void 0) {\n\t\tresult += char;\n\t\tif (char === quote) quote = void 0;\n\t} else if (char === \"'\" || char === \"\\\"\") {\n\t\tquote = char;\n\t\tresult += char;\n\t} else if (!/\\s/.test(char)) result += char.toLowerCase();\n\treturn result;\n}\n//#endregion\n//#region src/ir/sql-column-ir.ts\n/**\n* Schema IR node for a single column on a table, as observed by\n* introspection. Unlike the Contract IR `StorageColumn`, this carries\n* the column's `name` (Schema IR columns are returned as arrays from\n* introspection queries; the parent table re-keys them into a record\n* for downstream consumers).\n*\n* Implements `DiffableNode` so a column is directly a table's diff-tree\n* child: `id` is the column name (unique among a table's columns); `isEqualTo`\n* compares this column's own attributes only, never its default, which is a\n* child node: the type by {@link sqlColumnTypesEqual}, and nullability.\n*/\nvar SqlColumnIR = class SqlColumnIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.column;\n\tname;\n\t/** See {@link SqlColumnIRInput.typeText}. */\n\ttypeText;\n\tnullable;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.name = input.name;\n\t\tthis.typeText = input.typeText;\n\t\tthis.nullable = input.nullable;\n\t\tif (input.default !== void 0) this.default = input.default;\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tif (input.many !== void 0) this.many = input.many;\n\t\tif (input.resolvedDefault !== void 0) this.resolvedDefault = input.resolvedDefault;\n\t\tdefineNonEnumerable(this, \"authoredDefault\", input.authoredDefault);\n\t\tdefineNonEnumerable(this, \"codecRef\", input.codecRef);\n\t\tdefineNonEnumerable(this, \"storedType\", input.storedType);\n\t\tdefineNonEnumerable(this, \"storedTypeParams\", input.storedTypeParams);\n\t\tdefineNonEnumerable(this, \"defaultValue\", input.defaultValue);\n\t\tdefineNonEnumerable(this, \"defaultUnreadable\", input.defaultUnreadable);\n\t\tdefineNonEnumerable(this, \"defaultExpressionValue\", input.defaultExpressionValue);\n\t\tdefineNonEnumerable(this, \"sqlExpressionLiteralFor\", input.sqlExpressionLiteralFor);\n\t\tdefineNonEnumerable(this, \"reportedType\", input.reportedType);\n\t\tdefineNonEnumerable(this, \"catalogText\", input.catalogText);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn `column:${this.name}`;\n\t}\n\t/**\n\t* The column's default, when declared/present, is the column's one child\n\t* node — it has an extra/missing/drift lifecycle of its own, so the differ\n\t* recurses to it rather than `isEqualTo` comparing it. Built transiently\n\t* from this column's own fields.\n\t*/\n\tchildren() {\n\t\tif (this.resolvedDefault === void 0 && this.default === void 0) return [];\n\t\treturn [new SqlColumnDefaultIR({\n\t\t\t...ifDefined(\"resolved\", this.resolvedDefault),\n\t\t\t...ifDefined(\"raw\", this.default),\n\t\t\t...ifDefined(\"authored\", this.authoredDefault),\n\t\t\t...ifDefined(\"value\", this.defaultValue),\n\t\t\t...ifDefined(\"unreadable\", this.defaultUnreadable),\n\t\t\t...ifDefined(\"expressionValue\", this.defaultExpressionValue),\n\t\t\t...ifDefined(\"many\", this.many ?? this.codecRef?.many),\n\t\t\t...ifDefined(\"codecRef\", this.codecRef),\n\t\t\t...ifDefined(\"sqlExpressionLiteralFor\", this.sqlExpressionLiteralFor)\n\t\t})];\n\t}\n\t/** This column under another name, with every other field as it is. */\n\twithName(name) {\n\t\tconst fields = Object.fromEntries(Object.getOwnPropertyNames(this).map((key) => [key, Reflect.get(this, key)]));\n\t\treturn new SqlColumnIR({\n\t\t\t...blindCast(fields),\n\t\t\tname\n\t\t});\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.column;\n\t}\n\t/**\n\t* Compares the column's own attributes only — the default lives on the child node: the type, by {@link sqlColumnTypesEqual}, and nullability.\n\t*/\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlColumnIR\", SqlColumnIR.is);\n\t\treturn sqlColumnTypesEqual(this, node) && this.nullable === node.nullable;\n\t}\n\t/** Why `actual` is not this column: the two types as written and reported, or the nullability of each. The two sides always hold different values. */\n\texplainMismatch(actual) {\n\t\tif (actual === void 0) return void 0;\n\t\tconst node = blindCast(actual);\n\t\tassertNode(node, \"SqlColumnIR\", SqlColumnIR.is);\n\t\tconst texts = catalogTexts(this, node);\n\t\tif (texts !== void 0 && texts.expected !== texts.actual) return differs(`The column type is \"${texts.expected}\", but the database reports \"${texts.actual}\". A type named by its catalog text is compared with the text the database reports, exactly.`);\n\t\tif (node.storedType === void 0 && node.reportedType !== void 0) return differs(node.typeText === \"\" ? \"The database column has no declared type.\" : `The database column is ${shownTypeOf(node)}, which no data type in the configured stack declares.`);\n\t\tif (!sqlColumnTypesEqual(this, node)) return differs(`The contract column is ${shownTypeOf(this)} and the database column is ${shownTypeOf(node)}.`);\n\t\tif (this.nullable !== node.nullable) return differs(`The contract column is ${nullability(this)} and the database column is ${nullability(node)}.`);\n\t}\n};\n/**\n* Whether two columns have the same type: both have a stored type, the two are one data type, their parameters are equal as canonical JSON, and both or neither are lists. A column no data type claims has no stored type and never has the same type as another. ADR 254.\n*\n* When either column carries a {@link SqlColumnIR.catalogText}, the two compare by text instead, exactly, with `[]` for a list: that text against the other column's catalog text or reported text. ADR 273.\n*/\nfunction sqlColumnTypesEqual(a, b) {\n\tconst texts = catalogTexts(a, b);\n\tif (texts !== void 0) return texts.expected === texts.actual;\n\treturn a.storedType !== void 0 && b.storedType !== void 0 && a.storedType.id === b.storedType.id && canonicalizeJson(a.storedTypeParams ?? {}) === canonicalizeJson(b.storedTypeParams ?? {}) && Boolean(a.many) === Boolean(b.many);\n}\n/** The text a column's type compares by, with `[]` for a list, when it has one: its catalog text, or the text the database reports. */\nfunction comparedText(column) {\n\tconst text = column.catalogText ?? column.reportedType?.text;\n\treturn text === void 0 ? void 0 : `${text}${column.many === true ? \"[]\" : \"\"}`;\n}\n/** The two texts a pair of columns compares by, when either carries a catalog text. A side with no text to compare gives the empty text, which no catalog text equals. */\nfunction catalogTexts(expected, actual) {\n\tif (expected.catalogText === void 0 && actual.catalogText === void 0) return void 0;\n\treturn {\n\t\texpected: comparedText(expected) ?? \"\",\n\t\tactual: comparedText(actual) ?? \"\"\n\t};\n}\n/** The column's type as the contract writes it, or as introspection gives it, with `[]` for a list, in double quotes unless the text has double quotes of its own, as `\"char\"` does. */\nfunction shownTypeOf(column) {\n\tconst text = `${column.typeText}${column.many === true ? \"[]\" : \"\"}`;\n\treturn text.includes(\"\\\"\") ? text : `\"${text}\"`;\n}\nfunction differs(text) {\n\treturn {\n\t\ttext,\n\t\tcause: \"differs\"\n\t};\n}\nfunction nullability(column) {\n\treturn column.nullable ? \"nullable\" : \"not nullable\";\n}\n//#endregion\n//#region src/ir/sql-foreign-key-ir.ts\n/**\n* Schema IR node for a foreign-key constraint as observed by\n* introspection. The `referencedTable` / `referencedColumns` field\n* names match the introspection vocabulary (`pg_constraint.confkey`,\n* etc.) and intentionally differ from the Contract IR's nested\n* `references: { table, columns }` shape so that the verifier's\n* structural comparison stays explicit about which side it's reading.\n*\n* Implements `DiffableNode` so a foreign key is directly a table's diff-tree\n* child. Foreign keys are frequently unnamed (introspection may not carry a\n* constraint name, and the contract side never invents one), so `id` is\n* derived from the referencing/referenced coordinates rather than `name` —\n* the same tuple that makes two FK constraints the same constraint. This\n* also serves as the comparison key: two FKs with the same coordinates are\n* paired by the differ, and `isEqualTo` then compares the remaining\n* attribute — the referential actions.\n*/\nvar SqlForeignKeyIR = class SqlForeignKeyIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.foreignKey;\n\tcolumns;\n\treferencedTable;\n\treferencedColumns;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.columns = input.columns;\n\t\tthis.referencedTable = input.referencedTable;\n\t\tthis.referencedColumns = input.referencedColumns;\n\t\tif (input.referencedSchema !== void 0) this.referencedSchema = input.referencedSchema;\n\t\tif (input.name !== void 0) this.name = input.name;\n\t\tif (input.onDelete !== void 0) this.onDelete = input.onDelete;\n\t\tif (input.onUpdate !== void 0) this.onUpdate = input.onUpdate;\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tconst resolvedReferencedNamespace = input.resolvedReferencedNamespace ?? input.referencedSchema;\n\t\tif (resolvedReferencedNamespace !== void 0) this.resolvedReferencedNamespace = resolvedReferencedNamespace;\n\t\tdefineNonEnumerable(this, \"dependsOn\", input.dependsOn);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\tconst referencedNamespace = this.resolvedReferencedNamespace ?? \"\";\n\t\treturn `foreign-key:${this.columns.join(\",\")}->${referencedNamespace}.${this.referencedTable}(${this.referencedColumns.join(\",\")})`;\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.foreignKey;\n\t}\n\t/**\n\t* Referential-action comparison with `this` as the expected side, matching\n\t* the relational walk's `getReferentialActionMismatches`: `noAction` is the\n\t* database default and equivalent to an undeclared action, and drift is\n\t* flagged only when the expected side declares a (normalized) action.\n\t*/\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlForeignKeyIR\", SqlForeignKeyIR.is);\n\t\treturn referentialActionMatches(this.onDelete, node.onDelete) && referentialActionMatches(this.onUpdate, node.onUpdate);\n\t}\n};\nfunction referentialActionMatches(expected, actual) {\n\tconst normalizedExpected = expected === \"noAction\" ? void 0 : expected;\n\tif (normalizedExpected === void 0) return true;\n\treturn normalizedExpected === (actual === \"noAction\" ? void 0 : actual);\n}\n//#endregion\n//#region src/ir/sql-index-ir.ts\n/**\n* Schema IR node for a secondary index as observed by introspection.\n* Unlike the Contract IR `Index`, the Schema IR carries an explicit\n* `unique` field — introspection sees the underlying index regardless\n* of whether the user expressed it as `@@index` or `@@unique`, and the\n* verifier needs to distinguish them when comparing to the Contract.\n*\n* Implements `DiffableNode` so an index is directly a table's diff-tree\n* child. Indexes are name-identified: every index — contract-derived or\n* introspected — carries its full physical name, and `id` is that name.\n* Names are catalog-unique per schema, so two indexes legitimately sharing\n* one column tuple (a unique index beside a redundant plain index) are two\n* distinct siblings, and expression indexes need no column tuple at all.\n*\n* `isEqualTo` is selected by the receiver (the differ always calls\n* `expected.isEqualTo(actual)`) and delegates to {@link contentEquals} —\n* the single node-owned content relation: both modes compare `unique`\n* strict, `type` and option values through the named normalization seams,\n* and `columns` ordered-strict when both sides carry them; an exact-named\n* receiver (`prefix === undefined`) additionally byte-compares\n* `expression`/`where` (both sides are reprints in the supported flow —\n* normalizing would only mask real drift); a wire-named receiver never\n* compares bodies (the wire-name hash already commits to them).\n*\n* `expression`, `where`, and `unique` are genuine SQL-family attributes —\n* functional and partial indexes are standard SQL that any SQL target may\n* introspect, so the family node must represent them; a target declining\n* to author them is a capability decision, not target-specificity.\n*/\nvar SqlIndexIR = class SqlIndexIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.index;\n\tname;\n\tunique;\n\tconstructor(input) {\n\t\tsuper();\n\t\tconst name = nameOf(input.naming);\n\t\tif (input.columns === void 0 === (input.expression === void 0)) throw new InternalError(`SqlIndexIR \"${name}\": exactly one of columns or expression must be set.`);\n\t\tthis.name = name;\n\t\tthis.unique = input.unique;\n\t\tif (input.naming.kind === \"wire\") this.prefix = input.naming.prefix;\n\t\tif (input.columns !== void 0) this.columns = input.columns;\n\t\tif (input.expression !== void 0) this.expression = input.expression;\n\t\tif (input.where !== void 0) this.where = input.where;\n\t\tconst normalizedType = normalizeIndexType(input.type);\n\t\tif (normalizedType !== void 0) this.type = normalizedType;\n\t\tif (input.options !== void 0) this.options = input.options;\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tdefineNonEnumerable(this, \"dependsOn\", input.dependsOn);\n\t\tdefineNonEnumerable(this, \"partial\", input.partial);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn `index:${this.name}`;\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic from(value) {\n\t\treturn value instanceof SqlIndexIR ? value : new SqlIndexIR(value);\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.index;\n\t}\n\t/**\n\t* Mode-selected structural equality — see the class doc. Delegates to the\n\t* single node-owned relation: `columns` compare ordered-strict when both\n\t* sides carry them; an exact receiver (`prefix === undefined`)\n\t* byte-compares `expression ?? ''` and `where ?? ''`; a wire-named receiver\n\t* never compares bodies (the wire-name hash already commits to them).\n\t*/\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlIndexIR\", SqlIndexIR.is);\n\t\treturn this.contentEquals(node, {\n\t\t\tcolumnPresence: \"when-both-defined\",\n\t\t\tbodies: this.prefix !== void 0 ? \"ignored\" : \"verbatim\"\n\t\t});\n\t}\n\t/**\n\t* The single index content-equality relation — every comparer (the differ\n\t* via {@link isEqualTo}, the planner's rename content-pairing) calls this\n\t* with its mode-appropriate strictness rather than growing a parallel\n\t* relation:\n\t*\n\t* - `columnPresence: 'when-both-defined'` (the differ's rule) compares\n\t*   the tuples ordered-strict only when both sides carry them — a paired\n\t*   node's identity already agreed, so a column node meeting an\n\t*   expression node skips the tuple.\n\t* - `columnPresence: 'matching'` (the rename-pairing rule) additionally\n\t*   requires presence to agree: a column index never pairs an expression\n\t*   index.\n\t* - `bodies: 'verbatim'` byte-compares `expression ?? ''` / `where ?? ''`\n\t*   (absent ≡ empty, no normalization — both sides are reprints in the\n\t*   supported flow); `bodies: 'ignored'` skips them (wire identity —\n\t*   the wire-name hash commits to the content).\n\t*\n\t* `unique` compares strictly; `type` and option VALUES compare through\n\t* the named normalization seams below.\n\t*/\n\tcontentEquals(other, strictness) {\n\t\tconst columnsEqual = strictness.columnPresence === \"matching\" ? this.columns === void 0 === (other.columns === void 0) && (this.columns === void 0 || isArrayEqual(this.columns, other.columns ?? [])) : this.columns === void 0 || other.columns === void 0 || isArrayEqual(this.columns, other.columns);\n\t\tif (!(this.unique === other.unique && normalizeIndexType(this.type) === normalizeIndexType(other.type) && indexOptionsEqual(this.options, other.options) && columnsEqual)) return false;\n\t\tif (strictness.bodies === \"ignored\") return true;\n\t\treturn (this.expression ?? \"\") === (other.expression ?? \"\") && (this.where ?? \"\") === (other.where ?? \"\");\n\t}\n};\n/**\n* The btree-default normalization seam: the default access method (`btree`\n* in every supported SQL target) normalizes to absent. Applied at\n* construction — every derivation path (contract tree, introspection, flat\n* family tree) builds through the class, so both compare sides are\n* symmetric by definition — and again inside\n* {@link SqlIndexIR.contentEquals} so the relation holds for any input.\n* The contract JSON and the wire-name content hash keep the authored\n* spelling: `@@index([a], type: \"btree\")` and `@@index([a])` are distinct\n* wire names — but content-equal after normalization, so a spelling change\n* between them converges as a rename via the planner's content\n* pairing (the hashes differ, so hash pairing never pairs them).\n*/\nfunction normalizeIndexType(type) {\n\treturn type === \"btree\" ? void 0 : type;\n}\n/**\n* Option-bag equality: same key set, values compared through\n* {@link normalizeIndexOptionValue} — Postgres introspection returns\n* reloptions values as catalog-reprint strings (`'70'`, `'on'`) while\n* contract option leaves are typed (number, boolean, string).\n*/\nfunction indexOptionsEqual(a, b) {\n\tconst aKeys = a ? Object.keys(a).sort() : [];\n\tconst bKeys = b ? Object.keys(b).sort() : [];\n\tif (aKeys.length !== bKeys.length) return false;\n\tfor (let i = 0; i < aKeys.length; i += 1) if (aKeys[i] !== bKeys[i]) return false;\n\tif (aKeys.length === 0) return true;\n\tfor (const key of aKeys) if (normalizeIndexOptionValue(a?.[key]) !== normalizeIndexOptionValue(b?.[key])) return false;\n\treturn true;\n}\n//#endregion\n//#region src/ir/sql-unique-ir.ts\n/**\n* Schema IR node for a table-level unique constraint as observed by\n* introspection.\n*\n* Implements `DiffableNode` so a unique constraint is directly a table's\n* diff-tree child. Unique constraints are frequently unnamed, so `id` is\n* derived from the column tuple rather than `name` — the column tuple is\n* also what makes two unique constraints the same constraint, so it doubles\n* as the pairing key. There are no further attributes to compare once\n* columns are equal (the differ pairs on `id`), so `isEqualTo` is identity.\n*/\nvar SqlUniqueIR = class SqlUniqueIR extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.unique;\n\tcolumns;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.columns = [...input.columns];\n\t\tif (input.name !== void 0) this.name = input.name;\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tdefineNonEnumerable(this, \"dependsOn\", input.dependsOn);\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn `unique:${this.columns.join(\",\")}`;\n\t}\n\tchildren() {\n\t\treturn [];\n\t}\n\tstatic is(node) {\n\t\treturn node.nodeKind === RelationalSchemaNodeKind.unique;\n\t}\n\tisEqualTo(other) {\n\t\tconst node = blindCast(other);\n\t\tassertNode(node, \"SqlUniqueIR\", SqlUniqueIR.is);\n\t\treturn this.id === node.id;\n\t}\n};\n//#endregion\n//#region src/ir/sql-table-ir.ts\n/**\n* Schema IR node for a single table as observed by introspection.\n*\n* Unlike the Contract IR `StorageTable`, this carries the table's\n* `name` — introspection queries return tables as arrays and the\n* verifier keys them into `SqlSchemaIR.tables` afterwards, so the name\n* stays on the table object for downstream call sites that walk\n* `Object.values(schema.tables)`.\n*\n* The constructor normalises nested IR-class fields so downstream\n* walks see a uniform AST regardless of whether the input was a\n* plain-data literal (from introspection) or already-constructed\n* class instances.\n*\n* Implements `DiffableNode` so a flat (single-schema) tree is directly\n* diffable: `id` is the table name; `isEqualTo` is identity (the table's\n* structural drift is entirely expressed by its children); `children()`\n* yields every column, the primary key (when present), every foreign key,\n* unique, index, and check constraint — the same composition and order as\n* the Postgres table node, minus policies.\n*/\nvar SqlTableIR = class extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.table;\n\tname;\n\tcolumns;\n\tforeignKeys;\n\tuniques;\n\tindexes;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.name = input.name;\n\t\tthis.columns = Object.freeze(Object.fromEntries(Object.entries(input.columns).map(([key, col]) => [key, col instanceof SqlColumnIR ? col : new SqlColumnIR(col)])));\n\t\tthis.foreignKeys = Object.freeze(input.foreignKeys.map((fk) => fk instanceof SqlForeignKeyIR ? fk : new SqlForeignKeyIR(fk)));\n\t\tthis.uniques = Object.freeze(input.uniques.map((u) => u instanceof SqlUniqueIR ? u : new SqlUniqueIR(u)));\n\t\tthis.indexes = Object.freeze(input.indexes.map(SqlIndexIR.from));\n\t\tif (input.primaryKey !== void 0) this.primaryKey = PrimaryKey.from(input.primaryKey);\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tif (input.checks !== void 0 && input.checks.length > 0) this.checks = Object.freeze(input.checks.map(SqlCheckConstraintIR.from));\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn this.name;\n\t}\n\tisEqualTo(other) {\n\t\treturn this.id === other.id;\n\t}\n\tchildren() {\n\t\treturn [\n\t\t\t...Object.values(this.columns),\n\t\t\t...this.primaryKey ? [this.primaryKey] : [],\n\t\t\t...this.foreignKeys,\n\t\t\t...this.uniques,\n\t\t\t...this.indexes,\n\t\t\t...this.checks ?? []\n\t\t];\n\t}\n};\n//#endregion\n//#region src/ir/sql-schema-ir.ts\n/**\n* Root Schema IR node representing the complete database schema as\n* observed by introspection. Target-agnostic; used by both verifiers\n* (compare against intended Contract storage) and migration planners\n* (derive operations needed to reconcile).\n*\n* The constructor normalises nested `SqlTableIR` instances so\n* downstream walks see a uniform AST regardless of whether the input\n* was a plain-data literal or already-constructed class instances.\n*\n* Implements `DiffableNode` as the root of a flat (single-schema) diff\n* tree: `id` is the fixed sentinel `'database'` (roots have no siblings),\n* `isEqualTo` is identity (a container has no own attributes), and\n* `children()` yields the table nodes.\n*/\nvar SqlSchemaIR = class extends SqlSchemaIRNode {\n\tnodeKind = RelationalSchemaNodeKind.schema;\n\ttables;\n\tconstructor(input) {\n\t\tsuper();\n\t\tthis.tables = Object.freeze(Object.fromEntries(Object.entries(input.tables).map(([key, t]) => [key, t instanceof SqlTableIR ? t : new SqlTableIR(t)])));\n\t\tif (input.annotations !== void 0) this.annotations = input.annotations;\n\t\tfreezeNode(this);\n\t}\n\tget id() {\n\t\treturn \"database\";\n\t}\n\tisEqualTo(other) {\n\t\treturn this.id === other.id;\n\t}\n\tchildren() {\n\t\treturn Object.values(this.tables);\n\t}\n};\n//#endregion\nexport { relationalNodeGranularity as _, SqlForeignKeyIR as a, SqlColumnDefaultIR as c, PrimaryKey as d, SqlSchemaIRNode as f, relationalNodeEntityKind as g, RelationalSchemaNodeKind as h, SqlIndexIR as i, sqlDefaultValuesEqual as l, defineNonEnumerable as m, SqlTableIR as n, SqlColumnIR as o, assertNode as p, SqlUniqueIR as r, sqlColumnTypesEqual as s, SqlSchemaIR as t, SqlCheckConstraintIR as u };\n\n//# sourceMappingURL=types-DoyiTsjg.mjs.map"],"mappings":";;;;;;;;;;;;;;;;;AAiBA,MAAM,2BAA2B;CAChC,QAAQ;CACR,OAAO;CACP,QAAQ;CACR,eAAe;CACf,YAAY;CACZ,YAAY;CACZ,QAAQ;CACR,OAAO;CACP,OAAO;AACR;;;;;;;;;;;AAWA,MAAM,8BAA8B;EAClC,yBAAyB,SAAS;EAClC,yBAAyB,QAAQ;EACjC,yBAAyB,SAAS;EAClC,yBAAyB,gBAAgB;EACzC,yBAAyB,aAAa;EACtC,yBAAyB,aAAa;EACtC,yBAAyB,SAAS;EAClC,yBAAyB,QAAQ;EACjC,yBAAyB,QAAQ;AACnC;AACA,SAAS,2BAA2B,UAAU;CAC7C,OAAO,OAAO,OAAO,6BAA6B,QAAQ;AAC3D;;;;;;;AAOA,SAAS,0BAA0B,UAAU;CAC5C,IAAI,CAAC,2BAA2B,QAAQ,GAAG,MAAM,IAAI,cAAc,iEAAiE,SAAS,EAAE;CAC/I,OAAO,4BAA4B;AACpC;;;;;;;;AAQA,MAAM,8BAA8B,GAAG,yBAAyB,QAAQ,QAAQ;;;;;;;;AAQhF,SAAS,yBAAyB,UAAU;CAC3C,OAAO,2BAA2B,QAAQ,IAAI,4BAA4B,YAAY,KAAK;AAC5F;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAI,kBAAkB,cAAc,WAAW;CAC9C,cAAc;EACb,MAAM;EACN,OAAO,eAAe,MAAM,QAAQ;GACnC,OAAO;GACP,UAAU;GACV,YAAY;GACZ,cAAc;EACf,CAAC;CACF;AACD;;;;;;;AAOA,SAAS,WAAW,MAAM,WAAW,WAAW;CAC/C,IAAI,SAAS,KAAK,KAAK,CAAC,UAAU,IAAI,GAAG,MAAM,IAAI,cAAc,cAAc,UAAU,oBAAoB,MAAM,YAAY,aAAa;AAC7I;;;;;;;;;;AAUA,SAAS,oBAAoB,QAAQ,KAAK,OAAO;CAChD,IAAI,UAAU,KAAK,GAAG;CACtB,OAAO,eAAe,QAAQ,KAAK;EAClC;EACA,YAAY;EACZ,UAAU;EACV,cAAc;CACf,CAAC;AACF;;;;;;;;;;;;;;AAgBA,IAAI,aAAa,MAAM,mBAAmB,gBAAgB;CACzD,WAAW,yBAAyB;CACpC;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,UAAU,MAAM;EACrB,IAAI,MAAM,SAAS,KAAK,GAAG,KAAK,OAAO,MAAM;EAC7C,oBAAoB,MAAM,aAAa,MAAM,SAAS;EACtD,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO;CACR;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,KAAK,OAAO;EAClB,OAAO,iBAAiB,aAAa,QAAQ,IAAI,WAAW,KAAK;CAClE;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;CACA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,cAAc,WAAW,EAAE;EAC5C,OAAO,KAAK,QAAQ,WAAW,KAAK,QAAQ,UAAU,KAAK,QAAQ,OAAO,GAAG,MAAM,MAAM,KAAK,QAAQ,EAAE;CACzG;AACD;;;;;;;;;;;;;;AAgBA,IAAI,uBAAuB,MAAM,6BAA6B,gBAAgB;CAC7E,WAAW,yBAAyB;CACpC;CACA;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,OAAO,OAAO,MAAM,MAAM;EAC/B,IAAI,MAAM,OAAO,SAAS,QAAQ,KAAK,SAAS,MAAM,OAAO;EAC7D,KAAK,aAAa,MAAM;EACxB,oBAAoB,MAAM,aAAa,MAAM,SAAS;EACtD,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO,SAAS,KAAK;CACtB;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,KAAK,OAAO;EAClB,OAAO,iBAAiB,uBAAuB,QAAQ,IAAI,qBAAqB,KAAK;CACtF;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;CACA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,wBAAwB,qBAAqB,EAAE;EAChE,IAAI,KAAK,WAAW,KAAK,GAAG,OAAO,KAAK,OAAO,KAAK;EACpD,OAAO,KAAK,eAAe,KAAK;CACjC;AACD;AAGA,SAAS,OAAO,OAAO;CACtB,OAAO,MAAM,QAAQ,KAAK;AAC3B;;AAEA,SAAS,sBAAsB,GAAG,GAAG;CACpC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,oBAAoB,GAAG,CAAC;CACzF,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,SAAS,UAAU;EAC3D,MAAM,QAAQ,EAAE;EAChB,IAAI,YAAY,QAAQ,UAAU,QAAQ,UAAU,KAAK,GAAG,OAAO,YAAY;EAC/E,OAAO,oBAAoB,SAAS,KAAK;CAC1C,CAAC;AACF;;;;;;;;;;;;;;AAgBA,IAAI,qBAAqB,MAAM,2BAA2B,gBAAgB;CACzE,WAAW,yBAAyB;CACpC,YAAY,OAAO;EAClB,MAAM;EACN,IAAI,MAAM,aAAa,KAAK,GAAG,KAAK,WAAW,MAAM;EACrD,IAAI,MAAM,QAAQ,KAAK,GAAG,KAAK,MAAM,MAAM;EAC3C,oBAAoB,MAAM,YAAY,MAAM,QAAQ;EACpD,oBAAoB,MAAM,SAAS,MAAM,KAAK;EAC9C,oBAAoB,MAAM,cAAc,MAAM,UAAU;EACxD,oBAAoB,MAAM,mBAAmB,MAAM,eAAe;EAClE,oBAAoB,MAAM,QAAQ,MAAM,IAAI;EAC5C,oBAAoB,MAAM,YAAY,MAAM,QAAQ;EACpD,oBAAoB,MAAM,2BAA2B,MAAM,uBAAuB;EAClF,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO;CACR;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;;;;;;;;;;CAUA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,sBAAsB,mBAAmB,EAAE;EAC5D,MAAM,WAAW,KAAK;EACtB,MAAM,SAAS,KAAK;EACpB,IAAI,UAAU,SAAS,cAAc,WAAW,KAAK,GAAG,OAAO,KAAK,QAAQ,KAAK,KAAK,eAAe,SAAS,YAAY,KAAK,GAAG;EAClI,IAAI,aAAa,KAAK,KAAK,WAAW,KAAK,GAAG,OAAO,aAAa,UAAU,KAAK,QAAQ,KAAK;EAC9F,IAAI,SAAS,SAAS,YAAY;GACjC,IAAI,OAAO,SAAS,YAAY,OAAO,eAAe,SAAS,YAAY,OAAO,UAAU;GAC5F,IAAI,KAAK,UAAU,KAAK,KAAK,KAAK,oBAAoB,KAAK,GAAG,OAAO,sBAAsB,KAAK,iBAAiB,KAAK,KAAK;GAC3H,OAAO,KAAK,QAAQ,KAAK,KAAK,eAAe,SAAS,YAAY,KAAK,GAAG;EAC3E;EACA,IAAI,OAAO,SAAS,WAAW,OAAO;EACtC,IAAI,KAAK,UAAU,KAAK,KAAK,KAAK,UAAU,KAAK,GAAG,OAAO,sBAAsB,KAAK,OAAO,KAAK,KAAK;EACvG,IAAI,SAAS,iBAAiB,QAAQ,OAAO,iBAAiB,MAAM,OAAO;EAC3E,OAAO,mBAAmB,SAAS,KAAK,MAAM,mBAAmB,OAAO,KAAK;CAC9E;;;;;;CAMA,gBAAgB,QAAQ;EACvB,IAAI,EAAE,kBAAkB,qBAAqB,OAAO,KAAK;EACzD,IAAI,OAAO,eAAe,KAAK,GAAG,OAAO;GACxC,MAAM,OAAO;GACb,OAAO;EACR;EACA,OAAO,KAAK,qBAAqB,MAAM,KAAK;GAC3C,MAAM,sBAAsB,gBAAgB,IAAI,EAAE,2BAA2B,gBAAgB,MAAM,EAAE;GACrG,OAAO;EACR;CACD;CACA,qBAAqB,QAAQ;EAC5B,IAAI,KAAK,UAAU,SAAS,cAAc,OAAO,UAAU,SAAS,YAAY,OAAO,KAAK;EAC5F,MAAM,aAAa,KAAK;EACxB,MAAM,SAAS,SAAS,aAAa,IAAI,KAAK,KAAK,UAAU,IAAI;EACjE,MAAM,SAAS,OAAO,OAAO,OAAO,SAAS;EAC7C,MAAM,UAAU,eAAe,KAAK,IAAI,SAAS,CAAC,QAAQ,OAAO,SAAS,UAAU,CAAC,CAAC,MAAM,SAAS,WAAW,IAAI,MAAM,KAAK,CAAC;EAChI,MAAM,SAAS,YAAY,KAAK,IAAI,sIAAsI,oCAAoC,MAAM,OAAO,EAAE;EAC7N,OAAO;GACN,MAAM,2CAA2C,MAAM,WAAW,MAAM,EAAE,0BAA0B,MAAM,KAAK,SAAS,UAAU,EAAE,+FAA+F;GACnO,OAAO;EACR;CACD;AACD;;AAEA,SAAS,gBAAgB,MAAM;CAC9B,MAAM,WAAW,KAAK;CACtB,IAAI,aAAa,KAAK,GAAG,OAAO,KAAK,OAAO;CAC5C,IAAI,SAAS,SAAS,YAAY,OAAO,SAAS;CAClD,MAAM,QAAQ,KAAK,UAAU,KAAK,UAAU,KAAK,IAAI,SAAS,QAAQ,mBAAmB,KAAK,KAAK,CAAC;CACpG,OAAO,KAAK,QAAQ,KAAK,KAAK,KAAK,QAAQ,QAAQ,QAAQ,GAAG,MAAM,IAAI,KAAK,IAAI;AAClF;AACA,SAAS,cAAc,OAAO;CAC7B,OAAO,MAAM,QAAQ,KAAK;AAC3B;AACA,SAAS,mBAAmB,OAAO;CAClC,OAAO,cAAc,KAAK,IAAI,MAAM,KAAK,YAAY,YAAY,OAAO,OAAO,QAAQ,KAAK,IAAI,MAAM;AACvG;AACA,SAAS,eAAe,GAAG,GAAG;CAC7B,OAAO,qBAAqB,CAAC,MAAM,qBAAqB,CAAC;AAC1D;;AAEA,SAAS,qBAAqB,YAAY;CACzC,IAAI,SAAS;CACb,IAAI;CACJ,KAAK,MAAM,QAAQ,YAAY,IAAI,UAAU,KAAK,GAAG;EACpD,UAAU;EACV,IAAI,SAAS,OAAO,QAAQ,KAAK;CAClC,OAAO,IAAI,SAAS,OAAO,SAAS,MAAM;EACzC,QAAQ;EACR,UAAU;CACX,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,GAAG,UAAU,KAAK,YAAY;CACxD,OAAO;AACR;;;;;;;;;;;;;AAeA,IAAI,cAAc,MAAM,oBAAoB,gBAAgB;CAC3D,WAAW,yBAAyB;CACpC;;CAEA;CACA;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,OAAO,MAAM;EAClB,KAAK,WAAW,MAAM;EACtB,KAAK,WAAW,MAAM;EACtB,IAAI,MAAM,YAAY,KAAK,GAAG,KAAK,UAAU,MAAM;EACnD,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,IAAI,MAAM,SAAS,KAAK,GAAG,KAAK,OAAO,MAAM;EAC7C,IAAI,MAAM,oBAAoB,KAAK,GAAG,KAAK,kBAAkB,MAAM;EACnE,oBAAoB,MAAM,mBAAmB,MAAM,eAAe;EAClE,oBAAoB,MAAM,YAAY,MAAM,QAAQ;EACpD,oBAAoB,MAAM,cAAc,MAAM,UAAU;EACxD,oBAAoB,MAAM,oBAAoB,MAAM,gBAAgB;EACpE,oBAAoB,MAAM,gBAAgB,MAAM,YAAY;EAC5D,oBAAoB,MAAM,qBAAqB,MAAM,iBAAiB;EACtE,oBAAoB,MAAM,0BAA0B,MAAM,sBAAsB;EAChF,oBAAoB,MAAM,2BAA2B,MAAM,uBAAuB;EAClF,oBAAoB,MAAM,gBAAgB,MAAM,YAAY;EAC5D,oBAAoB,MAAM,eAAe,MAAM,WAAW;EAC1D,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO,UAAU,KAAK;CACvB;;;;;;;CAOA,WAAW;EACV,IAAI,KAAK,oBAAoB,KAAK,KAAK,KAAK,YAAY,KAAK,GAAG,OAAO,CAAC;EACxE,OAAO,CAAC,IAAI,mBAAmB;GAC9B,GAAG,UAAU,YAAY,KAAK,eAAe;GAC7C,GAAG,UAAU,OAAO,KAAK,OAAO;GAChC,GAAG,UAAU,YAAY,KAAK,eAAe;GAC7C,GAAG,UAAU,SAAS,KAAK,YAAY;GACvC,GAAG,UAAU,cAAc,KAAK,iBAAiB;GACjD,GAAG,UAAU,mBAAmB,KAAK,sBAAsB;GAC3D,GAAG,UAAU,QAAQ,KAAK,QAAQ,KAAK,UAAU,IAAI;GACrD,GAAG,UAAU,YAAY,KAAK,QAAQ;GACtC,GAAG,UAAU,2BAA2B,KAAK,uBAAuB;EACrE,CAAC,CAAC;CACH;;CAEA,SAAS,MAAM;EACd,MAAM,SAAS,OAAO,YAAY,OAAO,oBAAoB,IAAI,CAAC,CAAC,KAAK,QAAQ,CAAC,KAAK,QAAQ,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;EAC9G,OAAO,IAAI,YAAY;GACtB,GAAG,UAAU,MAAM;GACnB;EACD,CAAC;CACF;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;;;;CAIA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,eAAe,YAAY,EAAE;EAC9C,OAAO,oBAAoB,MAAM,IAAI,KAAK,KAAK,aAAa,KAAK;CAClE;;CAEA,gBAAgB,QAAQ;EACvB,IAAI,WAAW,KAAK,GAAG,OAAO,KAAK;EACnC,MAAM,OAAO,UAAU,MAAM;EAC7B,WAAW,MAAM,eAAe,YAAY,EAAE;EAC9C,MAAM,QAAQ,aAAa,MAAM,IAAI;EACrC,IAAI,UAAU,KAAK,KAAK,MAAM,aAAa,MAAM,QAAQ,OAAO,QAAQ,uBAAuB,MAAM,SAAS,+BAA+B,MAAM,OAAO,6FAA6F;EACvP,IAAI,KAAK,eAAe,KAAK,KAAK,KAAK,iBAAiB,KAAK,GAAG,OAAO,QAAQ,KAAK,aAAa,KAAK,8CAA8C,0BAA0B,YAAY,IAAI,EAAE,uDAAuD;EACvP,IAAI,CAAC,oBAAoB,MAAM,IAAI,GAAG,OAAO,QAAQ,0BAA0B,YAAY,IAAI,EAAE,8BAA8B,YAAY,IAAI,EAAE,EAAE;EACnJ,IAAI,KAAK,aAAa,KAAK,UAAU,OAAO,QAAQ,0BAA0B,YAAY,IAAI,EAAE,8BAA8B,YAAY,IAAI,EAAE,EAAE;CACnJ;AACD;;;;;;AAMA,SAAS,oBAAoB,GAAG,GAAG;CAClC,MAAM,QAAQ,aAAa,GAAG,CAAC;CAC/B,IAAI,UAAU,KAAK,GAAG,OAAO,MAAM,aAAa,MAAM;CACtD,OAAO,EAAE,eAAe,KAAK,KAAK,EAAE,eAAe,KAAK,KAAK,EAAE,WAAW,OAAO,EAAE,WAAW,MAAM,iBAAiB,EAAE,oBAAoB,CAAC,CAAC,MAAM,iBAAiB,EAAE,oBAAoB,CAAC,CAAC,KAAK,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,IAAI;AACpO;;AAEA,SAAS,aAAa,QAAQ;CAC7B,MAAM,OAAO,OAAO,eAAe,OAAO,cAAc;CACxD,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,OAAO,OAAO,SAAS,OAAO,OAAO;AAC3E;;AAEA,SAAS,aAAa,UAAU,QAAQ;CACvC,IAAI,SAAS,gBAAgB,KAAK,KAAK,OAAO,gBAAgB,KAAK,GAAG,OAAO,KAAK;CAClF,OAAO;EACN,UAAU,aAAa,QAAQ,KAAK;EACpC,QAAQ,aAAa,MAAM,KAAK;CACjC;AACD;;AAEA,SAAS,YAAY,QAAQ;CAC5B,MAAM,OAAO,GAAG,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO;CAChE,OAAO,KAAK,SAAS,IAAI,IAAI,OAAO,IAAI,KAAK;AAC9C;AACA,SAAS,QAAQ,MAAM;CACtB,OAAO;EACN;EACA,OAAO;CACR;AACD;AACA,SAAS,YAAY,QAAQ;CAC5B,OAAO,OAAO,WAAW,aAAa;AACvC;;;;;;;;;;;;;;;;;;AAoBA,IAAI,kBAAkB,MAAM,wBAAwB,gBAAgB;CACnE,WAAW,yBAAyB;CACpC;CACA;CACA;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,UAAU,MAAM;EACrB,KAAK,kBAAkB,MAAM;EAC7B,KAAK,oBAAoB,MAAM;EAC/B,IAAI,MAAM,qBAAqB,KAAK,GAAG,KAAK,mBAAmB,MAAM;EACrE,IAAI,MAAM,SAAS,KAAK,GAAG,KAAK,OAAO,MAAM;EAC7C,IAAI,MAAM,aAAa,KAAK,GAAG,KAAK,WAAW,MAAM;EACrD,IAAI,MAAM,aAAa,KAAK,GAAG,KAAK,WAAW,MAAM;EACrD,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,MAAM,8BAA8B,MAAM,+BAA+B,MAAM;EAC/E,IAAI,gCAAgC,KAAK,GAAG,KAAK,8BAA8B;EAC/E,oBAAoB,MAAM,aAAa,MAAM,SAAS;EACtD,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,MAAM,sBAAsB,KAAK,+BAA+B;EAChE,OAAO,eAAe,KAAK,QAAQ,KAAK,GAAG,EAAE,IAAI,oBAAoB,GAAG,KAAK,gBAAgB,GAAG,KAAK,kBAAkB,KAAK,GAAG,EAAE;CAClI;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;;;;;;;CAOA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,mBAAmB,gBAAgB,EAAE;EACtD,OAAO,yBAAyB,KAAK,UAAU,KAAK,QAAQ,KAAK,yBAAyB,KAAK,UAAU,KAAK,QAAQ;CACvH;AACD;AACA,SAAS,yBAAyB,UAAU,QAAQ;CACnD,MAAM,qBAAqB,aAAa,aAAa,KAAK,IAAI;CAC9D,IAAI,uBAAuB,KAAK,GAAG,OAAO;CAC1C,OAAO,wBAAwB,WAAW,aAAa,KAAK,IAAI;AACjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,IAAI,aAAa,MAAM,mBAAmB,gBAAgB;CACzD,WAAW,yBAAyB;CACpC;CACA;CACA,YAAY,OAAO;EAClB,MAAM;EACN,MAAM,OAAO,OAAO,MAAM,MAAM;EAChC,IAAI,MAAM,YAAY,KAAK,OAAO,MAAM,eAAe,KAAK,IAAI,MAAM,IAAI,cAAc,eAAe,KAAK,qDAAqD;EACjK,KAAK,OAAO;EACZ,KAAK,SAAS,MAAM;EACpB,IAAI,MAAM,OAAO,SAAS,QAAQ,KAAK,SAAS,MAAM,OAAO;EAC7D,IAAI,MAAM,YAAY,KAAK,GAAG,KAAK,UAAU,MAAM;EACnD,IAAI,MAAM,eAAe,KAAK,GAAG,KAAK,aAAa,MAAM;EACzD,IAAI,MAAM,UAAU,KAAK,GAAG,KAAK,QAAQ,MAAM;EAC/C,MAAM,iBAAiB,mBAAmB,MAAM,IAAI;EACpD,IAAI,mBAAmB,KAAK,GAAG,KAAK,OAAO;EAC3C,IAAI,MAAM,YAAY,KAAK,GAAG,KAAK,UAAU,MAAM;EACnD,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,oBAAoB,MAAM,aAAa,MAAM,SAAS;EACtD,oBAAoB,MAAM,WAAW,MAAM,OAAO;EAClD,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO,SAAS,KAAK;CACtB;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,KAAK,OAAO;EAClB,OAAO,iBAAiB,aAAa,QAAQ,IAAI,WAAW,KAAK;CAClE;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;;;;;;;;CAQA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,cAAc,WAAW,EAAE;EAC5C,OAAO,KAAK,cAAc,MAAM;GAC/B,gBAAgB;GAChB,QAAQ,KAAK,WAAW,KAAK,IAAI,YAAY;EAC9C,CAAC;CACF;;;;;;;;;;;;;;;;;;;;;;CAsBA,cAAc,OAAO,YAAY;EAChC,MAAM,eAAe,WAAW,mBAAmB,aAAa,KAAK,YAAY,KAAK,OAAO,MAAM,YAAY,KAAK,OAAO,KAAK,YAAY,KAAK,KAAK,aAAa,KAAK,SAAS,MAAM,WAAW,CAAC,CAAC,KAAK,KAAK,YAAY,KAAK,KAAK,MAAM,YAAY,KAAK,KAAK,aAAa,KAAK,SAAS,MAAM,OAAO;EACxS,IAAI,EAAE,KAAK,WAAW,MAAM,UAAU,mBAAmB,KAAK,IAAI,MAAM,mBAAmB,MAAM,IAAI,KAAK,kBAAkB,KAAK,SAAS,MAAM,OAAO,KAAK,eAAe,OAAO;EAClL,IAAI,WAAW,WAAW,WAAW,OAAO;EAC5C,QAAQ,KAAK,cAAc,SAAS,MAAM,cAAc,QAAQ,KAAK,SAAS,SAAS,MAAM,SAAS;CACvG;AACD;;;;;;;;;;;;;;AAcA,SAAS,mBAAmB,MAAM;CACjC,OAAO,SAAS,UAAU,KAAK,IAAI;AACpC;;;;;;;AAOA,SAAS,kBAAkB,GAAG,GAAG;CAChC,MAAM,QAAQ,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;CAC3C,MAAM,QAAQ,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;CAC3C,IAAI,MAAM,WAAW,MAAM,QAAQ,OAAO;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG,IAAI,MAAM,OAAO,MAAM,IAAI,OAAO;CAC5E,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,KAAK,MAAM,OAAO,OAAO,IAAI,0BAA0B,IAAI,IAAI,MAAM,0BAA0B,IAAI,IAAI,GAAG,OAAO;CACjH,OAAO;AACR;;;;;;;;;;;;AAcA,IAAI,cAAc,MAAM,oBAAoB,gBAAgB;CAC3D,WAAW,yBAAyB;CACpC;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,UAAU,CAAC,GAAG,MAAM,OAAO;EAChC,IAAI,MAAM,SAAS,KAAK,GAAG,KAAK,OAAO,MAAM;EAC7C,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,oBAAoB,MAAM,aAAa,MAAM,SAAS;EACtD,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO,UAAU,KAAK,QAAQ,KAAK,GAAG;CACvC;CACA,WAAW;EACV,OAAO,CAAC;CACT;CACA,OAAO,GAAG,MAAM;EACf,OAAO,KAAK,aAAa,yBAAyB;CACnD;CACA,UAAU,OAAO;EAChB,MAAM,OAAO,UAAU,KAAK;EAC5B,WAAW,MAAM,eAAe,YAAY,EAAE;EAC9C,OAAO,KAAK,OAAO,KAAK;CACzB;AACD;;;;;;;;;;;;;;;;;;;;;;AAwBA,IAAI,aAAa,cAAc,gBAAgB;CAC9C,WAAW,yBAAyB;CACpC;CACA;CACA;CACA;CACA;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,OAAO,MAAM;EAClB,KAAK,UAAU,OAAO,OAAO,OAAO,YAAY,OAAO,QAAQ,MAAM,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC,KAAK,eAAe,cAAc,MAAM,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;EAClK,KAAK,cAAc,OAAO,OAAO,MAAM,YAAY,KAAK,OAAO,cAAc,kBAAkB,KAAK,IAAI,gBAAgB,EAAE,CAAC,CAAC;EAC5H,KAAK,UAAU,OAAO,OAAO,MAAM,QAAQ,KAAK,MAAM,aAAa,cAAc,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC;EACxG,KAAK,UAAU,OAAO,OAAO,MAAM,QAAQ,IAAI,WAAW,IAAI,CAAC;EAC/D,IAAI,MAAM,eAAe,KAAK,GAAG,KAAK,aAAa,WAAW,KAAK,MAAM,UAAU;EACnF,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,IAAI,MAAM,WAAW,KAAK,KAAK,MAAM,OAAO,SAAS,GAAG,KAAK,SAAS,OAAO,OAAO,MAAM,OAAO,IAAI,qBAAqB,IAAI,CAAC;EAC/H,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO,KAAK;CACb;CACA,UAAU,OAAO;EAChB,OAAO,KAAK,OAAO,MAAM;CAC1B;CACA,WAAW;EACV,OAAO;GACN,GAAG,OAAO,OAAO,KAAK,OAAO;GAC7B,GAAG,KAAK,aAAa,CAAC,KAAK,UAAU,IAAI,CAAC;GAC1C,GAAG,KAAK;GACR,GAAG,KAAK;GACR,GAAG,KAAK;GACR,GAAG,KAAK,UAAU,CAAC;EACpB;CACD;AACD;;;;;;;;;;;;;;;;AAkBA,IAAI,cAAc,cAAc,gBAAgB;CAC/C,WAAW,yBAAyB;CACpC;CACA,YAAY,OAAO;EAClB,MAAM;EACN,KAAK,SAAS,OAAO,OAAO,OAAO,YAAY,OAAO,QAAQ,MAAM,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC,KAAK,aAAa,aAAa,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;EACtJ,IAAI,MAAM,gBAAgB,KAAK,GAAG,KAAK,cAAc,MAAM;EAC3D,WAAW,IAAI;CAChB;CACA,IAAI,KAAK;EACR,OAAO;CACR;CACA,UAAU,OAAO;EAChB,OAAO,KAAK,OAAO,MAAM;CAC1B;CACA,WAAW;EACV,OAAO,OAAO,OAAO,KAAK,MAAM;CACjC;AACD"}