@prisma-next/family-sql 0.15.0-dev.8 → 0.15.0

package/dist/diff.mjs

@@ -1,4 +1,4 @@
-import { a as computeStorageTypeVerdict, i as computeSqlDiffVerdict, n as classifyDiffSubjectGranularity, o as verifySqlSchemaByDiff, r as classifySqlDiffIssue } from "./schema-verify-3sOPsdn_.mjs";
+import { a as computeStorageTypeVerdict, i as computeSqlDiffVerdict, n as classifyDiffSubjectGranularity, o as verifySqlSchemaByDiff, r as classifySqlDiffIssue } from "./schema-verify-W3r631Jh.mjs";
 //#region src/core/diff/sql-schema-diff.ts
 /**
 * Compares two arrays of strings for equality (order-sensitive).

package/dist/foreign-key-index-backing-BP71iI-Q.mjs

@@ -0,0 +1,32 @@
+//#region src/core/foreign-key-index-backing.ts
+/**
+* The column-list keys (`"colA,colB"`, order preserved) a table's own
+* indexes, unique constraints, and primary key already back. A foreign key
+* whose source columns join to one of these keys needs no separately
+* derived backing index.
+*
+* Shared by {@link isBackedByColumnKeys}'s two callers, which must agree on
+* what counts as "backed": `contract-to-schema-ir.ts`'s `convertTable`
+* (deriving the FK-backing-index expectation `db verify` checks against a
+* live database) and the postgres PSL inferrer (deciding whether an
+* introspected relation needs an explicit `index: false`).
+*/
+function backingIndexColumnKeys(table) {
+	return [
+		...table.indexes.map((index) => index.columns.join(",")),
+		...table.uniques.map((unique) => unique.columns.join(",")),
+		...table.primaryKey ? [table.primaryKey.columns.join(",")] : []
+	];
+}
+/**
+* Whether `columns`, in order, matches one of `backingKeys` (see
+* {@link backingIndexColumnKeys}). Order-sensitive: `(a, b)` does not
+* satisfy a backing index declared as `(b, a)`.
+*/
+function isBackedByColumnKeys(columns, backingKeys) {
+	return backingKeys.includes(columns.join(","));
+}
+//#endregion
+export { isBackedByColumnKeys as n, backingIndexColumnKeys as t };
+
+//# sourceMappingURL=foreign-key-index-backing-BP71iI-Q.mjs.map

package/dist/foreign-key-index-backing-BP71iI-Q.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"foreign-key-index-backing-BP71iI-Q.mjs","names":[],"sources":["../src/core/foreign-key-index-backing.ts"],"sourcesContent":["export type BackingIndexCandidates = {\n  readonly indexes: readonly { readonly columns: readonly string[] }[];\n  readonly uniques: readonly { readonly columns: readonly string[] }[];\n  readonly primaryKey?: { readonly columns: readonly string[] } | undefined;\n};\n\n/**\n * The column-list keys (`\"colA,colB\"`, order preserved) a table's own\n * indexes, unique constraints, and primary key already back. A foreign key\n * whose source columns join to one of these keys needs no separately\n * derived backing index.\n *\n * Shared by {@link isBackedByColumnKeys}'s two callers, which must agree on\n * what counts as \"backed\": `contract-to-schema-ir.ts`'s `convertTable`\n * (deriving the FK-backing-index expectation `db verify` checks against a\n * live database) and the postgres PSL inferrer (deciding whether an\n * introspected relation needs an explicit `index: false`).\n */\nexport function backingIndexColumnKeys(table: BackingIndexCandidates): readonly string[] {\n  return [\n    ...table.indexes.map((index) => index.columns.join(',')),\n    ...table.uniques.map((unique) => unique.columns.join(',')),\n    ...(table.primaryKey ? [table.primaryKey.columns.join(',')] : []),\n  ];\n}\n\n/**\n * Whether `columns`, in order, matches one of `backingKeys` (see\n * {@link backingIndexColumnKeys}). Order-sensitive: `(a, b)` does not\n * satisfy a backing index declared as `(b, a)`.\n */\nexport function isBackedByColumnKeys(\n  columns: readonly string[],\n  backingKeys: readonly string[],\n): boolean {\n  return backingKeys.includes(columns.join(','));\n}\n"],"mappings":";;;;;;;;;;;;;AAkBA,SAAgB,uBAAuB,OAAkD;CACvF,OAAO;EACL,GAAG,MAAM,QAAQ,KAAK,UAAU,MAAM,QAAQ,KAAK,GAAG,CAAC;EACvD,GAAG,MAAM,QAAQ,KAAK,WAAW,OAAO,QAAQ,KAAK,GAAG,CAAC;EACzD,GAAI,MAAM,aAAa,CAAC,MAAM,WAAW,QAAQ,KAAK,GAAG,CAAC,IAAI,CAAC;CACjE;AACF;;;;;;AAOA,SAAgB,qBACd,SACA,aACS;CACT,OAAO,YAAY,SAAS,QAAQ,KAAK,GAAG,CAAC;AAC/C"}

package/dist/psl-infer.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"psl-infer.d.mts","names":[],"sources":["../src/core/psl-contract-infer/default-mapping.ts","../src/core/psl-contract-infer/name-transforms.ts","../src/core/psl-contract-infer/printer-config.ts","../src/core/psl-contract-infer/raw-default-parser.ts","../src/core/psl-contract-infer/relation-inference.ts"],"mappings":";;;;UAOiB,qBAAA;EAAA,SACN,kBAAA,GAAqB,QAAQ,CAAC,MAAA;EAAA,SAC9B,yBAAA,KAA8B,UAAA;AAAA;AAAA,KAG7B,oBAAA;EAAA,SAAkC,SAAA;AAAA;EAAA,SAAiC,OAAO;AAAA;AAAA,iBAEtE,UAAA,CACd,aAAA,EAAe,aAAA,EACf,OAAA,GAAU,qBAAA,GACT,oBAAA;;;KCbE,UAAA;EAAA,SACM,IAAA;EAAA,SACA,GAAG;AAAA;AAAA,iBA4DE,WAAA,CAAY,SAAA,WAAoB,UAAU;AAAA,iBAqB1C,WAAA,CAAY,UAAA,WAAqB,UAAU;AAAA,iBAqB3C,UAAA,CAAW,UAAA,WAAqB,UAAU;;;;;;;iBA6B1C,gBAAA,CAAiB,KAAa;AAAA,iBAO9B,SAAA,CAAU,IAAY;AAAA,iBAgBtB,uBAAA,CACd,SAAA,qBACA,mBAA2B;AAAA,iBAeb,2BAAA,CAA4B,cAAA,UAAwB,UAAmB;AAAA,iBAKvE,eAAA,CAAgB,UAAkB;;;KCnLtC,sBAAA;EAAA,SACD,IAAA;EAAA,SACA,IAAI;AAAA;AAAA,KAGH,iBAAA;EAAA,SAEG,OAAA;EAAA,SACA,UAAA;EAAA,SACA,UAAA,GAAa,MAAA;EAAA,SACb,mBAAA,GAAsB,sBAAsB;AAAA;EAAA,SAG5C,WAAA;EAAA,SACA,UAAA;AAAA;AAAA,UAGE,UAAA;EACf,OAAA,CAAQ,UAAA,UAAoB,WAAA,GAAc,MAAA,oBAA0B,iBAAiB;AAAA;AAAA,UAGtE,QAAA;EAAA,SACN,SAAA,EAAW,WAAA;EAAA,SACX,WAAA,EAAa,WAAW;AAAA;AAAA,UAGlB,iBAAA;EAAA,SACN,OAAA,EAAS,UAAA;EAAA,SACT,cAAA,GAAiB,qBAAA;EAAA,SACjB,QAAA,GAAW,QAAA;EAAA,SACX,eAAA,IAAmB,UAAA,UAAoB,UAAA,cAAwB,aAAA;AAAA;AAAA,KAG9D,aAAA;EAAA,SACD,SAAA;EAAA,SACA,QAAA;EFtBT;;;AACqB;;EADrB,SE4BS,eAAA;;;;;;WAMA,mBAAA;EAAA,SACA,mBAAA;EAAA,SACA,QAAA;EAAA,SACA,IAAA;EAAA,SACA,YAAA;EAAA,SACA,MAAA;EAAA,SACA,MAAA;EAAA,SACA,UAAA;EAAA,SACA,QAAA;EAAA,SACA,QAAA,uBD4BgD;EAAA,SC1BhD,KAAA;AAAA;;;iBCxBK,eAAA,CACd,UAAA,UACA,UAAA,YACC,aAAa;;;KCrBJ,iBAAA;EAAA,SACD,gBAAA,EAAkB,WAAW,kBAAkB,aAAA;AAAA;AAAA,iBAG1C,cAAA,CACd,MAAA,EAAQ,MAAA,SAAe,UAAA,GACvB,YAAA,EAAc,WAAA,mBACb,iBAAA;;;;;;;;;AJjBwD;AAG3D;;;;AAAsF;AAEtF;;;;iBImJgB,uBAAA,CACd,SAAA,UACA,eAAA,UACA,EAAA,EAAI,eAAA,EACJ,QAAA,WACA,YAAA,WACA,SAAA,GAAY,UAAA,GACX,aAAA"}
+{"version":3,"file":"psl-infer.d.mts","names":[],"sources":["../src/core/psl-contract-infer/default-mapping.ts","../src/core/psl-contract-infer/name-transforms.ts","../src/core/psl-contract-infer/printer-config.ts","../src/core/psl-contract-infer/raw-default-parser.ts","../src/core/psl-contract-infer/relation-inference.ts"],"mappings":";;;;UAOiB,qBAAA;EAAA,SACN,kBAAA,GAAqB,QAAQ,CAAC,MAAA;EAAA,SAC9B,yBAAA,KAA8B,UAAA;AAAA;AAAA,KAG7B,oBAAA;EAAA,SAAkC,SAAA;AAAA;EAAA,SAAiC,OAAO;AAAA;AAAA,iBAEtE,UAAA,CACd,aAAA,EAAe,aAAA,EACf,OAAA,GAAU,qBAAA,GACT,oBAAA;;;KCbE,UAAA;EAAA,SACM,IAAA;EAAA,SACA,GAAG;AAAA;AAAA,iBA4DE,WAAA,CAAY,SAAA,WAAoB,UAAU;AAAA,iBAqB1C,WAAA,CAAY,UAAA,WAAqB,UAAU;AAAA,iBAqB3C,UAAA,CAAW,UAAA,WAAqB,UAAU;;;;;;;iBA6B1C,gBAAA,CAAiB,KAAa;AAAA,iBAO9B,SAAA,CAAU,IAAY;AAAA,iBAgBtB,uBAAA,CACd,SAAA,qBACA,mBAA2B;AAAA,iBAeb,2BAAA,CAA4B,cAAA,UAAwB,UAAmB;AAAA,iBAKvE,eAAA,CAAgB,UAAkB;;;KCnLtC,sBAAA;EAAA,SACD,IAAA;EAAA,SACA,IAAI;AAAA;AAAA,KAGH,iBAAA;EAAA,SAEG,OAAA;EAAA,SACA,UAAA;EAAA,SACA,UAAA,GAAa,MAAA;EAAA,SACb,mBAAA,GAAsB,sBAAsB;AAAA;EAAA,SAG5C,WAAA;EAAA,SACA,UAAA;AAAA;AAAA,UAGE,UAAA;EACf,OAAA,CAAQ,UAAA,UAAoB,WAAA,GAAc,MAAA,oBAA0B,iBAAiB;AAAA;AAAA,UAGtE,QAAA;EAAA,SACN,SAAA,EAAW,WAAA;EAAA,SACX,WAAA,EAAa,WAAW;AAAA;AAAA,UAGlB,iBAAA;EAAA,SACN,OAAA,EAAS,UAAA;EAAA,SACT,cAAA,GAAiB,qBAAA;EAAA,SACjB,QAAA,GAAW,QAAA;EAAA,SACX,eAAA,IAAmB,UAAA,UAAoB,UAAA,cAAwB,aAAA;AAAA;AAAA,KAG9D,aAAA;EAAA,SACD,SAAA;EAAA,SACA,QAAA;EFtBT;;;AACqB;;EADrB,SE4BS,eAAA;;;;;;WAMA,mBAAA;EAAA,SACA,mBAAA;EAAA,SACA,QAAA;EAAA,SACA,IAAA;EAAA,SACA,YAAA;EAAA,SACA,MAAA;EAAA,SACA,MAAA;EAAA,SACA,UAAA;EAAA,SACA,QAAA;EAAA,SACA,QAAA,uBD4BgD;EAAA,SC1BhD,KAAA;AAAA;;;iBCxBK,eAAA,CACd,UAAA,UACA,UAAA,YACC,aAAa;;;KCxBJ,iBAAA;EAAA,SACD,gBAAA,EAAkB,WAAW,kBAAkB,aAAA;AAAA;AAAA,iBAG1C,cAAA,CACd,MAAA,EAAQ,MAAA,SAAe,UAAA,GACvB,YAAA,EAAc,WAAA,mBACb,iBAAA;;;;;;;;;AJdwD;AAG3D;;;;AAAsF;AAEtF;;;;iBIgJgB,uBAAA,CACd,SAAA,UACA,eAAA,UACA,EAAA,EAAI,eAAA,EACJ,QAAA,WACA,YAAA,WACA,SAAA,GAAY,UAAA,GACX,aAAA"}

package/dist/psl-infer.mjs

@@ -1,4 +1,4 @@
-import { backingIndexColumnKeys, isBackedByColumnKeys } from "@prisma-next/sql-contract/foreign-key-materialization";
+import { n as isBackedByColumnKeys, t as backingIndexColumnKeys } from "./foreign-key-index-backing-BP71iI-Q.mjs";
 //#region src/core/psl-contract-infer/default-mapping.ts
 const DEFAULT_FUNCTION_ATTRIBUTES = {
 	"autoincrement()": "@default(autoincrement())",

package/dist/psl-infer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"psl-infer.mjs","names":[],"sources":["../src/core/psl-contract-infer/default-mapping.ts","../src/core/psl-contract-infer/name-transforms.ts","../src/core/psl-contract-infer/raw-default-parser.ts","../src/core/psl-contract-infer/relation-inference.ts"],"sourcesContent":["import type { ColumnDefault } from '@prisma-next/contract/types';\n\nconst DEFAULT_FUNCTION_ATTRIBUTES: Readonly<Record<string, string>> = {\n  'autoincrement()': '@default(autoincrement())',\n  'now()': '@default(now())',\n};\n\nexport interface DefaultMappingOptions {\n  readonly functionAttributes?: Readonly<Record<string, string>>;\n  readonly fallbackFunctionAttribute?: ((expression: string) => string | undefined) | undefined;\n}\n\nexport type DefaultMappingResult = { readonly attribute: string } | { readonly comment: string };\n\nexport function mapDefault(\n  columnDefault: ColumnDefault,\n  options?: DefaultMappingOptions,\n): DefaultMappingResult {\n  switch (columnDefault.kind) {\n    case 'literal':\n      return { attribute: `@default(${formatLiteralValue(columnDefault.value)})` };\n    case 'function': {\n      const attribute =\n        options?.functionAttributes?.[columnDefault.expression] ??\n        DEFAULT_FUNCTION_ATTRIBUTES[columnDefault.expression] ??\n        options?.fallbackFunctionAttribute?.(columnDefault.expression);\n      return attribute\n        ? { attribute }\n        : { comment: `// Raw default: ${columnDefault.expression.replace(/[\\r\\n]+/g, ' ')}` };\n    }\n  }\n}\n\nfunction formatLiteralValue(value: unknown): string {\n  if (value === null) {\n    return 'null';\n  }\n\n  switch (typeof value) {\n    case 'boolean':\n    case 'number':\n      return String(value);\n    case 'string':\n      return quoteString(value);\n    default:\n      return quoteString(JSON.stringify(value));\n  }\n}\n\nfunction quoteString(str: string): string {\n  return `\"${escapeString(str)}\"`;\n}\n\nfunction escapeString(str: string): string {\n  return JSON.stringify(str).slice(1, -1);\n}\n","const PSL_RESERVED_WORDS = new Set(['model', 'enum', 'types', 'type', 'generator', 'datasource']);\n\nconst IDENTIFIER_PART_PATTERN = /[A-Za-z0-9]+/g;\n\ntype NameResult = {\n  readonly name: string;\n  readonly map?: string;\n};\n\nfunction hasSeparators(input: string): boolean {\n  return /[^A-Za-z0-9]/.test(input);\n}\n\nfunction extractIdentifierParts(input: string): string[] {\n  return input.match(IDENTIFIER_PART_PATTERN) ?? [];\n}\n\nfunction createSyntheticIdentifier(input: string): string {\n  let hash = 2166136261;\n\n  for (const char of input) {\n    hash ^= char.codePointAt(0) ?? 0;\n    hash = Math.imul(hash, 16777619);\n  }\n\n  return `x${(hash >>> 0).toString(16)}`;\n}\n\nfunction sanitizeIdentifierCharacters(input: string): string {\n  const sanitized = input.replace(/[^\\w]/g, '');\n  return sanitized.length > 0 ? sanitized : createSyntheticIdentifier(input);\n}\n\nfunction capitalize(word: string): string {\n  return word.charAt(0).toUpperCase() + word.slice(1);\n}\n\nfunction snakeToPascalCase(input: string): string {\n  const parts = extractIdentifierParts(input);\n  if (parts.length === 0) {\n    return capitalize(sanitizeIdentifierCharacters(input));\n  }\n  return parts.map(capitalize).join('');\n}\n\nfunction snakeToCamelCase(input: string): string {\n  const parts = extractIdentifierParts(input);\n  if (parts.length === 0) {\n    return sanitizeIdentifierCharacters(input);\n  }\n  const [firstPart = input, ...rest] = parts;\n  return firstPart.charAt(0).toLowerCase() + firstPart.slice(1) + rest.map(capitalize).join('');\n}\n\nfunction needsEscaping(name: string): boolean {\n  return PSL_RESERVED_WORDS.has(name.toLowerCase()) || /^\\d/.test(name);\n}\n\nfunction escapeName(name: string): string {\n  return `_${name}`;\n}\n\nfunction escapeIfNeeded(name: string): string {\n  return needsEscaping(name) ? escapeName(name) : name;\n}\n\nexport function toModelName(tableName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(tableName)) {\n    name = snakeToPascalCase(tableName);\n  } else {\n    name = tableName.charAt(0).toUpperCase() + tableName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: tableName };\n  }\n\n  if (name !== tableName) {\n    return { name, map: tableName };\n  }\n\n  return { name };\n}\n\nexport function toFieldName(columnName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(columnName)) {\n    name = snakeToCamelCase(columnName);\n  } else {\n    name = columnName.charAt(0).toLowerCase() + columnName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: columnName };\n  }\n\n  if (name !== columnName) {\n    return { name, map: columnName };\n  }\n\n  return { name };\n}\n\nexport function toEnumName(pgTypeName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(pgTypeName)) {\n    name = snakeToPascalCase(pgTypeName);\n  } else {\n    name = pgTypeName.charAt(0).toUpperCase() + pgTypeName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: pgTypeName };\n  }\n\n  if (name !== pgTypeName) {\n    return { name, map: pgTypeName };\n  }\n\n  return { name };\n}\n\nconst VALID_IDENTIFIER_PATTERN = /^[A-Za-z_]\\w*$/;\n\n/**\n * PSL member name for a native-enum value. The value itself always prints\n * explicitly (`member = \"value\"`), so the returned name never needs a map:\n * a value that already is a valid, non-reserved identifier is kept verbatim\n * (case included); anything else is camelCased/escaped like a field name.\n */\nexport function toEnumMemberName(value: string): string {\n  if (VALID_IDENTIFIER_PATTERN.test(value) && !needsEscaping(value)) {\n    return value;\n  }\n  return escapeIfNeeded(snakeToCamelCase(value));\n}\n\nexport function pluralize(word: string): string {\n  if (\n    word.endsWith('s') ||\n    word.endsWith('x') ||\n    word.endsWith('z') ||\n    word.endsWith('ch') ||\n    word.endsWith('sh')\n  ) {\n    return `${word}es`;\n  }\n  if (word.endsWith('y') && !/[aeiou]y$/i.test(word)) {\n    return `${word.slice(0, -1)}ies`;\n  }\n  return `${word}s`;\n}\n\nexport function deriveRelationFieldName(\n  fkColumns: readonly string[],\n  referencedTableName: string,\n): string {\n  if (fkColumns.length === 1) {\n    const [col = referencedTableName] = fkColumns;\n    const stripped = col.replace(/_id$/i, '').replace(/Id$/, '');\n\n    if (stripped.length > 0 && stripped !== col) {\n      return escapeIfNeeded(snakeToCamelCase(stripped));\n    }\n    return escapeIfNeeded(snakeToCamelCase(referencedTableName));\n  }\n\n  return escapeIfNeeded(snakeToCamelCase(referencedTableName));\n}\n\nexport function deriveBackRelationFieldName(childModelName: string, isOneToOne: boolean): string {\n  const base = childModelName.charAt(0).toLowerCase() + childModelName.slice(1);\n  return isOneToOne ? base : pluralize(base);\n}\n\nexport function toNamedTypeName(columnName: string): string {\n  let name: string;\n\n  if (hasSeparators(columnName)) {\n    name = snakeToPascalCase(columnName);\n  } else {\n    name = columnName.charAt(0).toUpperCase() + columnName.slice(1);\n  }\n\n  return escapeIfNeeded(name);\n}\n","import type { ColumnDefault } from '@prisma-next/contract/types';\n\nconst NEXTVAL_PATTERN = /^nextval\\s*\\(/i;\nconst NOW_FUNCTION_PATTERN = /^(now\\s*\\(\\s*\\)|CURRENT_TIMESTAMP)$/i;\nconst CLOCK_TIMESTAMP_PATTERN = /^clock_timestamp\\s*\\(\\s*\\)$/i;\nconst TIMESTAMP_CAST_SUFFIX = /::timestamp(?:tz|\\s+(?:with|without)\\s+time\\s+zone)?$/i;\nconst TEXT_CAST_SUFFIX = /::text$/i;\nconst NOW_LITERAL_PATTERN = /^'now'$/i;\nconst UUID_PATTERN = /^gen_random_uuid\\s*\\(\\s*\\)$/i;\nconst UUID_OSSP_PATTERN = /^uuid_generate_v4\\s*\\(\\s*\\)$/i;\nconst NULL_PATTERN = /^NULL(?:::.+)?$/i;\nconst TRUE_PATTERN = /^true$/i;\nconst FALSE_PATTERN = /^false$/i;\nconst NUMERIC_PATTERN = /^-?\\d+(\\.\\d+)?$/;\nconst JSON_CAST_SUFFIX = /::jsonb?$/i;\nconst STRING_LITERAL_PATTERN = /^'((?:[^']|'')*)'(?:::(?:\"[^\"]+\"|[\\w\\s]+)(?:\\(\\d+\\))?)?$/;\n\nfunction canonicalizeTimestampDefault(expr: string): string | undefined {\n  if (NOW_FUNCTION_PATTERN.test(expr)) return 'now()';\n  if (CLOCK_TIMESTAMP_PATTERN.test(expr)) return 'clock_timestamp()';\n\n  if (!TIMESTAMP_CAST_SUFFIX.test(expr)) return undefined;\n\n  let inner = expr.replace(TIMESTAMP_CAST_SUFFIX, '').trim();\n  if (inner.startsWith('(') && inner.endsWith(')')) {\n    inner = inner.slice(1, -1).trim();\n  }\n\n  if (NOW_FUNCTION_PATTERN.test(inner)) return 'now()';\n  if (CLOCK_TIMESTAMP_PATTERN.test(inner)) return 'clock_timestamp()';\n\n  inner = inner.replace(TEXT_CAST_SUFFIX, '').trim();\n  if (NOW_LITERAL_PATTERN.test(inner)) return 'now()';\n\n  return undefined;\n}\n\nexport function parseRawDefault(\n  rawDefault: string,\n  nativeType?: string,\n): ColumnDefault | undefined {\n  const trimmed = rawDefault.trim();\n  const normalizedType = nativeType?.toLowerCase();\n\n  if (NEXTVAL_PATTERN.test(trimmed)) {\n    return { kind: 'function', expression: 'autoincrement()' };\n  }\n\n  const canonicalTimestamp = canonicalizeTimestampDefault(trimmed);\n  if (canonicalTimestamp) {\n    return { kind: 'function', expression: canonicalTimestamp };\n  }\n\n  if (UUID_PATTERN.test(trimmed) || UUID_OSSP_PATTERN.test(trimmed)) {\n    return { kind: 'function', expression: 'gen_random_uuid()' };\n  }\n\n  if (NULL_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: null };\n  }\n\n  if (TRUE_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: true };\n  }\n\n  if (FALSE_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: false };\n  }\n\n  if (NUMERIC_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: Number(trimmed) };\n  }\n\n  const stringMatch = trimmed.match(STRING_LITERAL_PATTERN);\n  if (stringMatch?.[1] !== undefined) {\n    const unescaped = stringMatch[1].replace(/''/g, \"'\");\n    if (normalizedType === 'json' || normalizedType === 'jsonb') {\n      if (JSON_CAST_SUFFIX.test(trimmed)) {\n        return { kind: 'function', expression: trimmed };\n      }\n      try {\n        return { kind: 'literal', value: JSON.parse(unescaped) };\n      } catch {\n        // Fall through to the string form for malformed/non-JSON values.\n      }\n    }\n    return { kind: 'literal', value: unescaped };\n  }\n\n  return { kind: 'function', expression: trimmed };\n}\n","import {\n  backingIndexColumnKeys,\n  isBackedByColumnKeys,\n} from '@prisma-next/sql-contract/foreign-key-materialization';\nimport type { SqlForeignKeyIR, SqlTableIR } from '@prisma-next/sql-schema-ir/types';\nimport { deriveBackRelationFieldName, deriveRelationFieldName, pluralize } from './name-transforms';\nimport type { RelationField } from './printer-config';\n\nconst DEFAULT_ON_DELETE = 'noAction';\nconst DEFAULT_ON_UPDATE = 'noAction';\n\nconst REFERENTIAL_ACTION_PSL: Record<string, string> = {\n  noAction: 'NoAction',\n  restrict: 'Restrict',\n  cascade: 'Cascade',\n  setNull: 'SetNull',\n  setDefault: 'SetDefault',\n};\n\nexport type InferredRelations = {\n  readonly relationsByTable: ReadonlyMap<string, readonly RelationField[]>;\n};\n\nexport function inferRelations(\n  tables: Record<string, SqlTableIR>,\n  modelNameMap: ReadonlyMap<string, string>,\n): InferredRelations {\n  const relationsByTable = new Map<string, RelationField[]>();\n\n  const fkCountByPair = new Map<string, number>();\n  for (const table of Object.values(tables)) {\n    for (const fk of table.foreignKeys) {\n      const pairKey = `${table.name}→${fk.referencedTable}`;\n      fkCountByPair.set(pairKey, (fkCountByPair.get(pairKey) ?? 0) + 1);\n    }\n  }\n\n  const usedFieldNames = new Map<string, Set<string>>();\n  for (const table of Object.values(tables)) {\n    const names = new Set<string>();\n    for (const col of Object.values(table.columns)) {\n      names.add(col.name);\n    }\n    usedFieldNames.set(table.name, names);\n  }\n\n  for (const table of Object.values(tables)) {\n    for (const fk of table.foreignKeys) {\n      const childTableName = table.name;\n      const parentTableName = fk.referencedTable;\n      const childUsed = usedFieldNames.get(childTableName) as Set<string>;\n      const childModelName = modelNameMap.get(childTableName) ?? childTableName;\n      const parentModelName = modelNameMap.get(parentTableName) ?? parentTableName;\n      const pairKey = `${childTableName}→${parentTableName}`;\n      const isSelfRelation = childTableName === parentTableName;\n      const needsRelationName = (fkCountByPair.get(pairKey) as number) > 1 || isSelfRelation;\n\n      const isOneToOne = detectOneToOne(fk, table);\n\n      const childRelFieldName = resolveUniqueFieldName(\n        deriveRelationFieldName(fk.columns, parentTableName),\n        childUsed,\n        parentModelName,\n      );\n      const relationName = needsRelationName\n        ? deriveRelationName(fk, childRelFieldName, parentModelName, isSelfRelation)\n        : undefined;\n      const childOptional = fk.columns.some(\n        (columnName) => table.columns[columnName]?.nullable ?? false,\n      );\n\n      const childRelField = buildChildRelationField(\n        childRelFieldName,\n        parentModelName,\n        fk,\n        childOptional,\n        relationName,\n        table,\n      );\n\n      addRelationField(relationsByTable, childTableName, childRelField);\n      childUsed.add(childRelFieldName);\n\n      const parentUsed = usedFieldNames.get(parentTableName) ?? new Set();\n      usedFieldNames.set(parentTableName, parentUsed);\n\n      const backRelFieldName = resolveUniqueFieldName(\n        deriveBackRelationFieldName(childModelName, isOneToOne),\n        parentUsed,\n        childModelName,\n      );\n\n      const backRelField: RelationField = {\n        fieldName: backRelFieldName,\n        typeName: childModelName,\n        optional: isOneToOne,\n        list: !isOneToOne,\n        relationName,\n      };\n\n      addRelationField(relationsByTable, parentTableName, backRelField);\n      parentUsed.add(backRelFieldName);\n    }\n  }\n\n  return { relationsByTable };\n}\n\nfunction detectOneToOne(fk: SqlForeignKeyIR, table: SqlTableIR): boolean {\n  const fkCols = [...fk.columns].sort();\n\n  if (table.primaryKey) {\n    const pkCols = [...table.primaryKey.columns].sort();\n    if (pkCols.length === fkCols.length && pkCols.every((c, i) => c === fkCols[i])) {\n      return true;\n    }\n  }\n\n  for (const unique of table.uniques) {\n    const uniqueCols = [...unique.columns].sort();\n    if (uniqueCols.length === fkCols.length && uniqueCols.every((c, i) => c === fkCols[i])) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction deriveRelationName(\n  fk: SqlForeignKeyIR,\n  childRelationFieldName: string,\n  parentModelName: string,\n  isSelfRelation: boolean,\n): string {\n  if (fk.name) {\n    return fk.name;\n  }\n  if (isSelfRelation) {\n    return `${childRelationFieldName.charAt(0).toUpperCase() + childRelationFieldName.slice(1)}${pluralize(parentModelName)}`;\n  }\n  return fk.columns.join('_');\n}\n\n/**\n * Builds the child-side {@link RelationField} for a single foreign key:\n * `typeName` is the parent model name, `fields`/`references` are the FK's raw\n * columns, and `onDelete`/`onUpdate` are normalized to their PSL spelling.\n * Exported so a caller resolving a foreign key against a model outside\n * `tables` (e.g. a cross-space reference into another contract) can reuse the\n * same normalization instead of duplicating it.\n *\n * `hostTable` is the table the FK is declared on (i.e. `table`, not the\n * referenced parent) — its own indexes/uniques/primary key are what a\n * backing index for this FK would be. When none of them exactly match the\n * FK's source columns (in order), `index: false` is stamped so the emitted\n * `@relation` opts out of the framework's default derived backing-index\n * expectation, matching what `db verify` will find live. Passing the table\n * is optional so existing single-FK callers (e.g. cross-space resolution\n * before a host table reference is threaded through) can omit it and keep\n * the framework default.\n */\nexport function buildChildRelationField(\n  fieldName: string,\n  parentModelName: string,\n  fk: SqlForeignKeyIR,\n  optional: boolean,\n  relationName?: string,\n  hostTable?: SqlTableIR,\n): RelationField {\n  const onDelete = fk.onDelete && fk.onDelete !== DEFAULT_ON_DELETE ? fk.onDelete : undefined;\n  const onUpdate = fk.onUpdate && fk.onUpdate !== DEFAULT_ON_UPDATE ? fk.onUpdate : undefined;\n  const index =\n    hostTable && !isBackedByColumnKeys(fk.columns, backingIndexColumnKeys(hostTable))\n      ? false\n      : undefined;\n\n  return {\n    fieldName,\n    typeName: parentModelName,\n    referencedTableName: fk.referencedTable,\n    optional,\n    list: false,\n    relationName,\n    fkName: fk.name,\n    fields: fk.columns,\n    references: fk.referencedColumns,\n    onDelete: onDelete ? REFERENTIAL_ACTION_PSL[onDelete] : undefined,\n    onUpdate: onUpdate ? REFERENTIAL_ACTION_PSL[onUpdate] : undefined,\n    index,\n  };\n}\n\nfunction resolveUniqueFieldName(\n  desired: string,\n  usedNames: ReadonlySet<string>,\n  fallbackSuffix: string,\n): string {\n  if (!usedNames.has(desired)) {\n    return desired;\n  }\n\n  const withSuffix = `${desired}${fallbackSuffix}`;\n  if (!usedNames.has(withSuffix)) {\n    return withSuffix;\n  }\n\n  let counter = 2;\n  while (usedNames.has(`${desired}${counter}`)) {\n    counter++;\n  }\n  return `${desired}${counter}`;\n}\n\nfunction addRelationField(\n  map: Map<string, RelationField[]>,\n  tableName: string,\n  field: RelationField,\n): void {\n  const existing = map.get(tableName);\n  if (existing) {\n    existing.push(field);\n  } else {\n    map.set(tableName, [field]);\n  }\n}\n"],"mappings":";;AAEA,MAAM,8BAAgE;CACpE,mBAAmB;CACnB,SAAS;AACX;AASA,SAAgB,WACd,eACA,SACsB;CACtB,QAAQ,cAAc,MAAtB;EACE,KAAK,WACH,OAAO,EAAE,WAAW,YAAY,mBAAmB,cAAc,KAAK,EAAE,GAAG;EAC7E,KAAK,YAAY;GACf,MAAM,YACJ,SAAS,qBAAqB,cAAc,eAC5C,4BAA4B,cAAc,eAC1C,SAAS,4BAA4B,cAAc,UAAU;GAC/D,OAAO,YACH,EAAE,UAAU,IACZ,EAAE,SAAS,mBAAmB,cAAc,WAAW,QAAQ,YAAY,GAAG,IAAI;EACxF;CACF;AACF;AAEA,SAAS,mBAAmB,OAAwB;CAClD,IAAI,UAAU,MACZ,OAAO;CAGT,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK,UACH,OAAO,OAAO,KAAK;EACrB,KAAK,UACH,OAAO,YAAY,KAAK;EAC1B,SACE,OAAO,YAAY,KAAK,UAAU,KAAK,CAAC;CAC5C;AACF;AAEA,SAAS,YAAY,KAAqB;CACxC,OAAO,IAAI,aAAa,GAAG,EAAE;AAC/B;AAEA,SAAS,aAAa,KAAqB;CACzC,OAAO,KAAK,UAAU,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE;AACxC;;;ACvDA,MAAM,qCAAqB,IAAI,IAAI;CAAC;CAAS;CAAQ;CAAS;CAAQ;CAAa;AAAY,CAAC;AAEhG,MAAM,0BAA0B;AAOhC,SAAS,cAAc,OAAwB;CAC7C,OAAO,eAAe,KAAK,KAAK;AAClC;AAEA,SAAS,uBAAuB,OAAyB;CACvD,OAAO,MAAM,MAAM,uBAAuB,KAAK,CAAC;AAClD;AAEA,SAAS,0BAA0B,OAAuB;CACxD,IAAI,OAAO;CAEX,KAAK,MAAM,QAAQ,OAAO;EACxB,QAAQ,KAAK,YAAY,CAAC,KAAK;EAC/B,OAAO,KAAK,KAAK,MAAM,QAAQ;CACjC;CAEA,OAAO,KAAK,SAAS,EAAA,CAAG,SAAS,EAAE;AACrC;AAEA,SAAS,6BAA6B,OAAuB;CAC3D,MAAM,YAAY,MAAM,QAAQ,UAAU,EAAE;CAC5C,OAAO,UAAU,SAAS,IAAI,YAAY,0BAA0B,KAAK;AAC3E;AAEA,SAAS,WAAW,MAAsB;CACxC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;AACpD;AAEA,SAAS,kBAAkB,OAAuB;CAChD,MAAM,QAAQ,uBAAuB,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO,WAAW,6BAA6B,KAAK,CAAC;CAEvD,OAAO,MAAM,IAAI,UAAU,CAAC,CAAC,KAAK,EAAE;AACtC;AAEA,SAAS,iBAAiB,OAAuB;CAC/C,MAAM,QAAQ,uBAAuB,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO,6BAA6B,KAAK;CAE3C,MAAM,CAAC,YAAY,OAAO,GAAG,QAAQ;CACrC,OAAO,UAAU,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,UAAU,MAAM,CAAC,IAAI,KAAK,IAAI,UAAU,CAAC,CAAC,KAAK,EAAE;AAC9F;AAEA,SAAS,cAAc,MAAuB;CAC5C,OAAO,mBAAmB,IAAI,KAAK,YAAY,CAAC,KAAK,MAAM,KAAK,IAAI;AACtE;AAEA,SAAS,WAAW,MAAsB;CACxC,OAAO,IAAI;AACb;AAEA,SAAS,eAAe,MAAsB;CAC5C,OAAO,cAAc,IAAI,IAAI,WAAW,IAAI,IAAI;AAClD;AAEA,SAAgB,YAAY,WAA+B;CACzD,IAAI;CAEJ,IAAI,cAAc,SAAS,GACzB,OAAO,kBAAkB,SAAS;MAElC,OAAO,UAAU,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,UAAU,MAAM,CAAC;CAG9D,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAU;CAGzC,IAAI,SAAS,WACX,OAAO;EAAE;EAAM,KAAK;CAAU;CAGhC,OAAO,EAAE,KAAK;AAChB;AAEA,SAAgB,YAAY,YAAgC;CAC1D,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,iBAAiB,UAAU;MAElC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAW;CAG1C,IAAI,SAAS,YACX,OAAO;EAAE;EAAM,KAAK;CAAW;CAGjC,OAAO,EAAE,KAAK;AAChB;AAEA,SAAgB,WAAW,YAAgC;CACzD,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,kBAAkB,UAAU;MAEnC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAW;CAG1C,IAAI,SAAS,YACX,OAAO;EAAE;EAAM,KAAK;CAAW;CAGjC,OAAO,EAAE,KAAK;AAChB;AAEA,MAAM,2BAA2B;;;;;;;AAQjC,SAAgB,iBAAiB,OAAuB;CACtD,IAAI,yBAAyB,KAAK,KAAK,KAAK,CAAC,cAAc,KAAK,GAC9D,OAAO;CAET,OAAO,eAAe,iBAAiB,KAAK,CAAC;AAC/C;AAEA,SAAgB,UAAU,MAAsB;CAC9C,IACE,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,IAAI,KAClB,KAAK,SAAS,IAAI,GAElB,OAAO,GAAG,KAAK;CAEjB,IAAI,KAAK,SAAS,GAAG,KAAK,CAAC,aAAa,KAAK,IAAI,GAC/C,OAAO,GAAG,KAAK,MAAM,GAAG,EAAE,EAAE;CAE9B,OAAO,GAAG,KAAK;AACjB;AAEA,SAAgB,wBACd,WACA,qBACQ;CACR,IAAI,UAAU,WAAW,GAAG;EAC1B,MAAM,CAAC,MAAM,uBAAuB;EACpC,MAAM,WAAW,IAAI,QAAQ,SAAS,EAAE,CAAC,CAAC,QAAQ,OAAO,EAAE;EAE3D,IAAI,SAAS,SAAS,KAAK,aAAa,KACtC,OAAO,eAAe,iBAAiB,QAAQ,CAAC;EAElD,OAAO,eAAe,iBAAiB,mBAAmB,CAAC;CAC7D;CAEA,OAAO,eAAe,iBAAiB,mBAAmB,CAAC;AAC7D;AAEA,SAAgB,4BAA4B,gBAAwB,YAA6B;CAC/F,MAAM,OAAO,eAAe,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,eAAe,MAAM,CAAC;CAC5E,OAAO,aAAa,OAAO,UAAU,IAAI;AAC3C;AAEA,SAAgB,gBAAgB,YAA4B;CAC1D,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,kBAAkB,UAAU;MAEnC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,OAAO,eAAe,IAAI;AAC5B;;;AC9LA,MAAM,kBAAkB;AACxB,MAAM,uBAAuB;AAC7B,MAAM,0BAA0B;AAChC,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,sBAAsB;AAC5B,MAAM,eAAe;AACrB,MAAM,oBAAoB;AAC1B,MAAM,eAAe;AACrB,MAAM,eAAe;AACrB,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AACxB,MAAM,mBAAmB;AACzB,MAAM,yBAAyB;AAE/B,SAAS,6BAA6B,MAAkC;CACtE,IAAI,qBAAqB,KAAK,IAAI,GAAG,OAAO;CAC5C,IAAI,wBAAwB,KAAK,IAAI,GAAG,OAAO;CAE/C,IAAI,CAAC,sBAAsB,KAAK,IAAI,GAAG,OAAO,KAAA;CAE9C,IAAI,QAAQ,KAAK,QAAQ,uBAAuB,EAAE,CAAC,CAAC,KAAK;CACzD,IAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAC7C,QAAQ,MAAM,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK;CAGlC,IAAI,qBAAqB,KAAK,KAAK,GAAG,OAAO;CAC7C,IAAI,wBAAwB,KAAK,KAAK,GAAG,OAAO;CAEhD,QAAQ,MAAM,QAAQ,kBAAkB,EAAE,CAAC,CAAC,KAAK;CACjD,IAAI,oBAAoB,KAAK,KAAK,GAAG,OAAO;AAG9C;AAEA,SAAgB,gBACd,YACA,YAC2B;CAC3B,MAAM,UAAU,WAAW,KAAK;CAChC,MAAM,iBAAiB,YAAY,YAAY;CAE/C,IAAI,gBAAgB,KAAK,OAAO,GAC9B,OAAO;EAAE,MAAM;EAAY,YAAY;CAAkB;CAG3D,MAAM,qBAAqB,6BAA6B,OAAO;CAC/D,IAAI,oBACF,OAAO;EAAE,MAAM;EAAY,YAAY;CAAmB;CAG5D,IAAI,aAAa,KAAK,OAAO,KAAK,kBAAkB,KAAK,OAAO,GAC9D,OAAO;EAAE,MAAM;EAAY,YAAY;CAAoB;CAG7D,IAAI,aAAa,KAAK,OAAO,GAC3B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAK;CAGxC,IAAI,aAAa,KAAK,OAAO,GAC3B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAK;CAGxC,IAAI,cAAc,KAAK,OAAO,GAC5B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAM;CAGzC,IAAI,gBAAgB,KAAK,OAAO,GAC9B,OAAO;EAAE,MAAM;EAAW,OAAO,OAAO,OAAO;CAAE;CAGnD,MAAM,cAAc,QAAQ,MAAM,sBAAsB;CACxD,IAAI,cAAc,OAAO,KAAA,GAAW;EAClC,MAAM,YAAY,YAAY,EAAE,CAAC,QAAQ,OAAO,GAAG;EACnD,IAAI,mBAAmB,UAAU,mBAAmB,SAAS;GAC3D,IAAI,iBAAiB,KAAK,OAAO,GAC/B,OAAO;IAAE,MAAM;IAAY,YAAY;GAAQ;GAEjD,IAAI;IACF,OAAO;KAAE,MAAM;KAAW,OAAO,KAAK,MAAM,SAAS;IAAE;GACzD,QAAQ,CAER;EACF;EACA,OAAO;GAAE,MAAM;GAAW,OAAO;EAAU;CAC7C;CAEA,OAAO;EAAE,MAAM;EAAY,YAAY;CAAQ;AACjD;;;AClFA,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAE1B,MAAM,yBAAiD;CACrD,UAAU;CACV,UAAU;CACV,SAAS;CACT,SAAS;CACT,YAAY;AACd;AAMA,SAAgB,eACd,QACA,cACmB;CACnB,MAAM,mCAAmB,IAAI,IAA6B;CAE1D,MAAM,gCAAgB,IAAI,IAAoB;CAC9C,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GACtC,KAAK,MAAM,MAAM,MAAM,aAAa;EAClC,MAAM,UAAU,GAAG,MAAM,KAAK,GAAG,GAAG;EACpC,cAAc,IAAI,UAAU,cAAc,IAAI,OAAO,KAAK,KAAK,CAAC;CAClE;CAGF,MAAM,iCAAiB,IAAI,IAAyB;CACpD,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GAAG;EACzC,MAAM,wBAAQ,IAAI,IAAY;EAC9B,KAAK,MAAM,OAAO,OAAO,OAAO,MAAM,OAAO,GAC3C,MAAM,IAAI,IAAI,IAAI;EAEpB,eAAe,IAAI,MAAM,MAAM,KAAK;CACtC;CAEA,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GACtC,KAAK,MAAM,MAAM,MAAM,aAAa;EAClC,MAAM,iBAAiB,MAAM;EAC7B,MAAM,kBAAkB,GAAG;EAC3B,MAAM,YAAY,eAAe,IAAI,cAAc;EACnD,MAAM,iBAAiB,aAAa,IAAI,cAAc,KAAK;EAC3D,MAAM,kBAAkB,aAAa,IAAI,eAAe,KAAK;EAC7D,MAAM,UAAU,GAAG,eAAe,GAAG;EACrC,MAAM,iBAAiB,mBAAmB;EAC1C,MAAM,oBAAqB,cAAc,IAAI,OAAO,IAAe,KAAK;EAExE,MAAM,aAAa,eAAe,IAAI,KAAK;EAE3C,MAAM,oBAAoB,uBACxB,wBAAwB,GAAG,SAAS,eAAe,GACnD,WACA,eACF;EACA,MAAM,eAAe,oBACjB,mBAAmB,IAAI,mBAAmB,iBAAiB,cAAc,IACzE,KAAA;EAcJ,iBAAiB,kBAAkB,gBATb,wBACpB,mBACA,iBACA,IAPoB,GAAG,QAAQ,MAC9B,eAAe,MAAM,QAAQ,WAAW,EAAE,YAAY,KAO3C,GACZ,cACA,KAG6D,CAAC;EAChE,UAAU,IAAI,iBAAiB;EAE/B,MAAM,aAAa,eAAe,IAAI,eAAe,qBAAK,IAAI,IAAI;EAClE,eAAe,IAAI,iBAAiB,UAAU;EAE9C,MAAM,mBAAmB,uBACvB,4BAA4B,gBAAgB,UAAU,GACtD,YACA,cACF;EAUA,iBAAiB,kBAAkB,iBAAiB;GAPlD,WAAW;GACX,UAAU;GACV,UAAU;GACV,MAAM,CAAC;GACP;EAG6D,CAAC;EAChE,WAAW,IAAI,gBAAgB;CACjC;CAGF,OAAO,EAAE,iBAAiB;AAC5B;AAEA,SAAS,eAAe,IAAqB,OAA4B;CACvE,MAAM,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,KAAK;CAEpC,IAAI,MAAM,YAAY;EACpB,MAAM,SAAS,CAAC,GAAG,MAAM,WAAW,OAAO,CAAC,CAAC,KAAK;EAClD,IAAI,OAAO,WAAW,OAAO,UAAU,OAAO,OAAO,GAAG,MAAM,MAAM,OAAO,EAAE,GAC3E,OAAO;CAEX;CAEA,KAAK,MAAM,UAAU,MAAM,SAAS;EAClC,MAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,KAAK;EAC5C,IAAI,WAAW,WAAW,OAAO,UAAU,WAAW,OAAO,GAAG,MAAM,MAAM,OAAO,EAAE,GACnF,OAAO;CAEX;CAEA,OAAO;AACT;AAEA,SAAS,mBACP,IACA,wBACA,iBACA,gBACQ;CACR,IAAI,GAAG,MACL,OAAO,GAAG;CAEZ,IAAI,gBACF,OAAO,GAAG,uBAAuB,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,uBAAuB,MAAM,CAAC,IAAI,UAAU,eAAe;CAExH,OAAO,GAAG,QAAQ,KAAK,GAAG;AAC5B;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,wBACd,WACA,iBACA,IACA,UACA,cACA,WACe;CACf,MAAM,WAAW,GAAG,YAAY,GAAG,aAAa,oBAAoB,GAAG,WAAW,KAAA;CAClF,MAAM,WAAW,GAAG,YAAY,GAAG,aAAa,oBAAoB,GAAG,WAAW,KAAA;CAClF,MAAM,QACJ,aAAa,CAAC,qBAAqB,GAAG,SAAS,uBAAuB,SAAS,CAAC,IAC5E,QACA,KAAA;CAEN,OAAO;EACL;EACA,UAAU;EACV,qBAAqB,GAAG;EACxB;EACA,MAAM;EACN;EACA,QAAQ,GAAG;EACX,QAAQ,GAAG;EACX,YAAY,GAAG;EACf,UAAU,WAAW,uBAAuB,YAAY,KAAA;EACxD,UAAU,WAAW,uBAAuB,YAAY,KAAA;EACxD;CACF;AACF;AAEA,SAAS,uBACP,SACA,WACA,gBACQ;CACR,IAAI,CAAC,UAAU,IAAI,OAAO,GACxB,OAAO;CAGT,MAAM,aAAa,GAAG,UAAU;CAChC,IAAI,CAAC,UAAU,IAAI,UAAU,GAC3B,OAAO;CAGT,IAAI,UAAU;CACd,OAAO,UAAU,IAAI,GAAG,UAAU,SAAS,GACzC;CAEF,OAAO,GAAG,UAAU;AACtB;AAEA,SAAS,iBACP,KACA,WACA,OACM;CACN,MAAM,WAAW,IAAI,IAAI,SAAS;CAClC,IAAI,UACF,SAAS,KAAK,KAAK;MAEnB,IAAI,IAAI,WAAW,CAAC,KAAK,CAAC;AAE9B"}
+{"version":3,"file":"psl-infer.mjs","names":[],"sources":["../src/core/psl-contract-infer/default-mapping.ts","../src/core/psl-contract-infer/name-transforms.ts","../src/core/psl-contract-infer/raw-default-parser.ts","../src/core/psl-contract-infer/relation-inference.ts"],"sourcesContent":["import type { ColumnDefault } from '@prisma-next/contract/types';\n\nconst DEFAULT_FUNCTION_ATTRIBUTES: Readonly<Record<string, string>> = {\n  'autoincrement()': '@default(autoincrement())',\n  'now()': '@default(now())',\n};\n\nexport interface DefaultMappingOptions {\n  readonly functionAttributes?: Readonly<Record<string, string>>;\n  readonly fallbackFunctionAttribute?: ((expression: string) => string | undefined) | undefined;\n}\n\nexport type DefaultMappingResult = { readonly attribute: string } | { readonly comment: string };\n\nexport function mapDefault(\n  columnDefault: ColumnDefault,\n  options?: DefaultMappingOptions,\n): DefaultMappingResult {\n  switch (columnDefault.kind) {\n    case 'literal':\n      return { attribute: `@default(${formatLiteralValue(columnDefault.value)})` };\n    case 'function': {\n      const attribute =\n        options?.functionAttributes?.[columnDefault.expression] ??\n        DEFAULT_FUNCTION_ATTRIBUTES[columnDefault.expression] ??\n        options?.fallbackFunctionAttribute?.(columnDefault.expression);\n      return attribute\n        ? { attribute }\n        : { comment: `// Raw default: ${columnDefault.expression.replace(/[\\r\\n]+/g, ' ')}` };\n    }\n  }\n}\n\nfunction formatLiteralValue(value: unknown): string {\n  if (value === null) {\n    return 'null';\n  }\n\n  switch (typeof value) {\n    case 'boolean':\n    case 'number':\n      return String(value);\n    case 'string':\n      return quoteString(value);\n    default:\n      return quoteString(JSON.stringify(value));\n  }\n}\n\nfunction quoteString(str: string): string {\n  return `\"${escapeString(str)}\"`;\n}\n\nfunction escapeString(str: string): string {\n  return JSON.stringify(str).slice(1, -1);\n}\n","const PSL_RESERVED_WORDS = new Set(['model', 'enum', 'types', 'type', 'generator', 'datasource']);\n\nconst IDENTIFIER_PART_PATTERN = /[A-Za-z0-9]+/g;\n\ntype NameResult = {\n  readonly name: string;\n  readonly map?: string;\n};\n\nfunction hasSeparators(input: string): boolean {\n  return /[^A-Za-z0-9]/.test(input);\n}\n\nfunction extractIdentifierParts(input: string): string[] {\n  return input.match(IDENTIFIER_PART_PATTERN) ?? [];\n}\n\nfunction createSyntheticIdentifier(input: string): string {\n  let hash = 2166136261;\n\n  for (const char of input) {\n    hash ^= char.codePointAt(0) ?? 0;\n    hash = Math.imul(hash, 16777619);\n  }\n\n  return `x${(hash >>> 0).toString(16)}`;\n}\n\nfunction sanitizeIdentifierCharacters(input: string): string {\n  const sanitized = input.replace(/[^\\w]/g, '');\n  return sanitized.length > 0 ? sanitized : createSyntheticIdentifier(input);\n}\n\nfunction capitalize(word: string): string {\n  return word.charAt(0).toUpperCase() + word.slice(1);\n}\n\nfunction snakeToPascalCase(input: string): string {\n  const parts = extractIdentifierParts(input);\n  if (parts.length === 0) {\n    return capitalize(sanitizeIdentifierCharacters(input));\n  }\n  return parts.map(capitalize).join('');\n}\n\nfunction snakeToCamelCase(input: string): string {\n  const parts = extractIdentifierParts(input);\n  if (parts.length === 0) {\n    return sanitizeIdentifierCharacters(input);\n  }\n  const [firstPart = input, ...rest] = parts;\n  return firstPart.charAt(0).toLowerCase() + firstPart.slice(1) + rest.map(capitalize).join('');\n}\n\nfunction needsEscaping(name: string): boolean {\n  return PSL_RESERVED_WORDS.has(name.toLowerCase()) || /^\\d/.test(name);\n}\n\nfunction escapeName(name: string): string {\n  return `_${name}`;\n}\n\nfunction escapeIfNeeded(name: string): string {\n  return needsEscaping(name) ? escapeName(name) : name;\n}\n\nexport function toModelName(tableName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(tableName)) {\n    name = snakeToPascalCase(tableName);\n  } else {\n    name = tableName.charAt(0).toUpperCase() + tableName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: tableName };\n  }\n\n  if (name !== tableName) {\n    return { name, map: tableName };\n  }\n\n  return { name };\n}\n\nexport function toFieldName(columnName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(columnName)) {\n    name = snakeToCamelCase(columnName);\n  } else {\n    name = columnName.charAt(0).toLowerCase() + columnName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: columnName };\n  }\n\n  if (name !== columnName) {\n    return { name, map: columnName };\n  }\n\n  return { name };\n}\n\nexport function toEnumName(pgTypeName: string): NameResult {\n  let name: string;\n\n  if (hasSeparators(pgTypeName)) {\n    name = snakeToPascalCase(pgTypeName);\n  } else {\n    name = pgTypeName.charAt(0).toUpperCase() + pgTypeName.slice(1);\n  }\n\n  if (needsEscaping(name)) {\n    const escaped = escapeName(name);\n    return { name: escaped, map: pgTypeName };\n  }\n\n  if (name !== pgTypeName) {\n    return { name, map: pgTypeName };\n  }\n\n  return { name };\n}\n\nconst VALID_IDENTIFIER_PATTERN = /^[A-Za-z_]\\w*$/;\n\n/**\n * PSL member name for a native-enum value. The value itself always prints\n * explicitly (`member = \"value\"`), so the returned name never needs a map:\n * a value that already is a valid, non-reserved identifier is kept verbatim\n * (case included); anything else is camelCased/escaped like a field name.\n */\nexport function toEnumMemberName(value: string): string {\n  if (VALID_IDENTIFIER_PATTERN.test(value) && !needsEscaping(value)) {\n    return value;\n  }\n  return escapeIfNeeded(snakeToCamelCase(value));\n}\n\nexport function pluralize(word: string): string {\n  if (\n    word.endsWith('s') ||\n    word.endsWith('x') ||\n    word.endsWith('z') ||\n    word.endsWith('ch') ||\n    word.endsWith('sh')\n  ) {\n    return `${word}es`;\n  }\n  if (word.endsWith('y') && !/[aeiou]y$/i.test(word)) {\n    return `${word.slice(0, -1)}ies`;\n  }\n  return `${word}s`;\n}\n\nexport function deriveRelationFieldName(\n  fkColumns: readonly string[],\n  referencedTableName: string,\n): string {\n  if (fkColumns.length === 1) {\n    const [col = referencedTableName] = fkColumns;\n    const stripped = col.replace(/_id$/i, '').replace(/Id$/, '');\n\n    if (stripped.length > 0 && stripped !== col) {\n      return escapeIfNeeded(snakeToCamelCase(stripped));\n    }\n    return escapeIfNeeded(snakeToCamelCase(referencedTableName));\n  }\n\n  return escapeIfNeeded(snakeToCamelCase(referencedTableName));\n}\n\nexport function deriveBackRelationFieldName(childModelName: string, isOneToOne: boolean): string {\n  const base = childModelName.charAt(0).toLowerCase() + childModelName.slice(1);\n  return isOneToOne ? base : pluralize(base);\n}\n\nexport function toNamedTypeName(columnName: string): string {\n  let name: string;\n\n  if (hasSeparators(columnName)) {\n    name = snakeToPascalCase(columnName);\n  } else {\n    name = columnName.charAt(0).toUpperCase() + columnName.slice(1);\n  }\n\n  return escapeIfNeeded(name);\n}\n","import type { ColumnDefault } from '@prisma-next/contract/types';\n\nconst NEXTVAL_PATTERN = /^nextval\\s*\\(/i;\nconst NOW_FUNCTION_PATTERN = /^(now\\s*\\(\\s*\\)|CURRENT_TIMESTAMP)$/i;\nconst CLOCK_TIMESTAMP_PATTERN = /^clock_timestamp\\s*\\(\\s*\\)$/i;\nconst TIMESTAMP_CAST_SUFFIX = /::timestamp(?:tz|\\s+(?:with|without)\\s+time\\s+zone)?$/i;\nconst TEXT_CAST_SUFFIX = /::text$/i;\nconst NOW_LITERAL_PATTERN = /^'now'$/i;\nconst UUID_PATTERN = /^gen_random_uuid\\s*\\(\\s*\\)$/i;\nconst UUID_OSSP_PATTERN = /^uuid_generate_v4\\s*\\(\\s*\\)$/i;\nconst NULL_PATTERN = /^NULL(?:::.+)?$/i;\nconst TRUE_PATTERN = /^true$/i;\nconst FALSE_PATTERN = /^false$/i;\nconst NUMERIC_PATTERN = /^-?\\d+(\\.\\d+)?$/;\nconst JSON_CAST_SUFFIX = /::jsonb?$/i;\nconst STRING_LITERAL_PATTERN = /^'((?:[^']|'')*)'(?:::(?:\"[^\"]+\"|[\\w\\s]+)(?:\\(\\d+\\))?)?$/;\n\nfunction canonicalizeTimestampDefault(expr: string): string | undefined {\n  if (NOW_FUNCTION_PATTERN.test(expr)) return 'now()';\n  if (CLOCK_TIMESTAMP_PATTERN.test(expr)) return 'clock_timestamp()';\n\n  if (!TIMESTAMP_CAST_SUFFIX.test(expr)) return undefined;\n\n  let inner = expr.replace(TIMESTAMP_CAST_SUFFIX, '').trim();\n  if (inner.startsWith('(') && inner.endsWith(')')) {\n    inner = inner.slice(1, -1).trim();\n  }\n\n  if (NOW_FUNCTION_PATTERN.test(inner)) return 'now()';\n  if (CLOCK_TIMESTAMP_PATTERN.test(inner)) return 'clock_timestamp()';\n\n  inner = inner.replace(TEXT_CAST_SUFFIX, '').trim();\n  if (NOW_LITERAL_PATTERN.test(inner)) return 'now()';\n\n  return undefined;\n}\n\nexport function parseRawDefault(\n  rawDefault: string,\n  nativeType?: string,\n): ColumnDefault | undefined {\n  const trimmed = rawDefault.trim();\n  const normalizedType = nativeType?.toLowerCase();\n\n  if (NEXTVAL_PATTERN.test(trimmed)) {\n    return { kind: 'function', expression: 'autoincrement()' };\n  }\n\n  const canonicalTimestamp = canonicalizeTimestampDefault(trimmed);\n  if (canonicalTimestamp) {\n    return { kind: 'function', expression: canonicalTimestamp };\n  }\n\n  if (UUID_PATTERN.test(trimmed) || UUID_OSSP_PATTERN.test(trimmed)) {\n    return { kind: 'function', expression: 'gen_random_uuid()' };\n  }\n\n  if (NULL_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: null };\n  }\n\n  if (TRUE_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: true };\n  }\n\n  if (FALSE_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: false };\n  }\n\n  if (NUMERIC_PATTERN.test(trimmed)) {\n    return { kind: 'literal', value: Number(trimmed) };\n  }\n\n  const stringMatch = trimmed.match(STRING_LITERAL_PATTERN);\n  if (stringMatch?.[1] !== undefined) {\n    const unescaped = stringMatch[1].replace(/''/g, \"'\");\n    if (normalizedType === 'json' || normalizedType === 'jsonb') {\n      if (JSON_CAST_SUFFIX.test(trimmed)) {\n        return { kind: 'function', expression: trimmed };\n      }\n      try {\n        return { kind: 'literal', value: JSON.parse(unescaped) };\n      } catch {\n        // Fall through to the string form for malformed/non-JSON values.\n      }\n    }\n    return { kind: 'literal', value: unescaped };\n  }\n\n  return { kind: 'function', expression: trimmed };\n}\n","import type { SqlForeignKeyIR, SqlTableIR } from '@prisma-next/sql-schema-ir/types';\nimport { backingIndexColumnKeys, isBackedByColumnKeys } from '../foreign-key-index-backing';\nimport { deriveBackRelationFieldName, deriveRelationFieldName, pluralize } from './name-transforms';\nimport type { RelationField } from './printer-config';\n\nconst DEFAULT_ON_DELETE = 'noAction';\nconst DEFAULT_ON_UPDATE = 'noAction';\n\nconst REFERENTIAL_ACTION_PSL: Record<string, string> = {\n  noAction: 'NoAction',\n  restrict: 'Restrict',\n  cascade: 'Cascade',\n  setNull: 'SetNull',\n  setDefault: 'SetDefault',\n};\n\nexport type InferredRelations = {\n  readonly relationsByTable: ReadonlyMap<string, readonly RelationField[]>;\n};\n\nexport function inferRelations(\n  tables: Record<string, SqlTableIR>,\n  modelNameMap: ReadonlyMap<string, string>,\n): InferredRelations {\n  const relationsByTable = new Map<string, RelationField[]>();\n\n  const fkCountByPair = new Map<string, number>();\n  for (const table of Object.values(tables)) {\n    for (const fk of table.foreignKeys) {\n      const pairKey = `${table.name}→${fk.referencedTable}`;\n      fkCountByPair.set(pairKey, (fkCountByPair.get(pairKey) ?? 0) + 1);\n    }\n  }\n\n  const usedFieldNames = new Map<string, Set<string>>();\n  for (const table of Object.values(tables)) {\n    const names = new Set<string>();\n    for (const col of Object.values(table.columns)) {\n      names.add(col.name);\n    }\n    usedFieldNames.set(table.name, names);\n  }\n\n  for (const table of Object.values(tables)) {\n    for (const fk of table.foreignKeys) {\n      const childTableName = table.name;\n      const parentTableName = fk.referencedTable;\n      const childUsed = usedFieldNames.get(childTableName) as Set<string>;\n      const childModelName = modelNameMap.get(childTableName) ?? childTableName;\n      const parentModelName = modelNameMap.get(parentTableName) ?? parentTableName;\n      const pairKey = `${childTableName}→${parentTableName}`;\n      const isSelfRelation = childTableName === parentTableName;\n      const needsRelationName = (fkCountByPair.get(pairKey) as number) > 1 || isSelfRelation;\n\n      const isOneToOne = detectOneToOne(fk, table);\n\n      const childRelFieldName = resolveUniqueFieldName(\n        deriveRelationFieldName(fk.columns, parentTableName),\n        childUsed,\n        parentModelName,\n      );\n      const relationName = needsRelationName\n        ? deriveRelationName(fk, childRelFieldName, parentModelName, isSelfRelation)\n        : undefined;\n      const childOptional = fk.columns.some(\n        (columnName) => table.columns[columnName]?.nullable ?? false,\n      );\n\n      const childRelField = buildChildRelationField(\n        childRelFieldName,\n        parentModelName,\n        fk,\n        childOptional,\n        relationName,\n        table,\n      );\n\n      addRelationField(relationsByTable, childTableName, childRelField);\n      childUsed.add(childRelFieldName);\n\n      const parentUsed = usedFieldNames.get(parentTableName) ?? new Set();\n      usedFieldNames.set(parentTableName, parentUsed);\n\n      const backRelFieldName = resolveUniqueFieldName(\n        deriveBackRelationFieldName(childModelName, isOneToOne),\n        parentUsed,\n        childModelName,\n      );\n\n      const backRelField: RelationField = {\n        fieldName: backRelFieldName,\n        typeName: childModelName,\n        optional: isOneToOne,\n        list: !isOneToOne,\n        relationName,\n      };\n\n      addRelationField(relationsByTable, parentTableName, backRelField);\n      parentUsed.add(backRelFieldName);\n    }\n  }\n\n  return { relationsByTable };\n}\n\nfunction detectOneToOne(fk: SqlForeignKeyIR, table: SqlTableIR): boolean {\n  const fkCols = [...fk.columns].sort();\n\n  if (table.primaryKey) {\n    const pkCols = [...table.primaryKey.columns].sort();\n    if (pkCols.length === fkCols.length && pkCols.every((c, i) => c === fkCols[i])) {\n      return true;\n    }\n  }\n\n  for (const unique of table.uniques) {\n    const uniqueCols = [...unique.columns].sort();\n    if (uniqueCols.length === fkCols.length && uniqueCols.every((c, i) => c === fkCols[i])) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction deriveRelationName(\n  fk: SqlForeignKeyIR,\n  childRelationFieldName: string,\n  parentModelName: string,\n  isSelfRelation: boolean,\n): string {\n  if (fk.name) {\n    return fk.name;\n  }\n  if (isSelfRelation) {\n    return `${childRelationFieldName.charAt(0).toUpperCase() + childRelationFieldName.slice(1)}${pluralize(parentModelName)}`;\n  }\n  return fk.columns.join('_');\n}\n\n/**\n * Builds the child-side {@link RelationField} for a single foreign key:\n * `typeName` is the parent model name, `fields`/`references` are the FK's raw\n * columns, and `onDelete`/`onUpdate` are normalized to their PSL spelling.\n * Exported so a caller resolving a foreign key against a model outside\n * `tables` (e.g. a cross-space reference into another contract) can reuse the\n * same normalization instead of duplicating it.\n *\n * `hostTable` is the table the FK is declared on (i.e. `table`, not the\n * referenced parent) — its own indexes/uniques/primary key are what a\n * backing index for this FK would be. When none of them exactly match the\n * FK's source columns (in order), `index: false` is stamped so the emitted\n * `@relation` opts out of the framework's default derived backing-index\n * expectation, matching what `db verify` will find live. Passing the table\n * is optional so existing single-FK callers (e.g. cross-space resolution\n * before a host table reference is threaded through) can omit it and keep\n * the framework default.\n */\nexport function buildChildRelationField(\n  fieldName: string,\n  parentModelName: string,\n  fk: SqlForeignKeyIR,\n  optional: boolean,\n  relationName?: string,\n  hostTable?: SqlTableIR,\n): RelationField {\n  const onDelete = fk.onDelete && fk.onDelete !== DEFAULT_ON_DELETE ? fk.onDelete : undefined;\n  const onUpdate = fk.onUpdate && fk.onUpdate !== DEFAULT_ON_UPDATE ? fk.onUpdate : undefined;\n  const index =\n    hostTable && !isBackedByColumnKeys(fk.columns, backingIndexColumnKeys(hostTable))\n      ? false\n      : undefined;\n\n  return {\n    fieldName,\n    typeName: parentModelName,\n    referencedTableName: fk.referencedTable,\n    optional,\n    list: false,\n    relationName,\n    fkName: fk.name,\n    fields: fk.columns,\n    references: fk.referencedColumns,\n    onDelete: onDelete ? REFERENTIAL_ACTION_PSL[onDelete] : undefined,\n    onUpdate: onUpdate ? REFERENTIAL_ACTION_PSL[onUpdate] : undefined,\n    index,\n  };\n}\n\nfunction resolveUniqueFieldName(\n  desired: string,\n  usedNames: ReadonlySet<string>,\n  fallbackSuffix: string,\n): string {\n  if (!usedNames.has(desired)) {\n    return desired;\n  }\n\n  const withSuffix = `${desired}${fallbackSuffix}`;\n  if (!usedNames.has(withSuffix)) {\n    return withSuffix;\n  }\n\n  let counter = 2;\n  while (usedNames.has(`${desired}${counter}`)) {\n    counter++;\n  }\n  return `${desired}${counter}`;\n}\n\nfunction addRelationField(\n  map: Map<string, RelationField[]>,\n  tableName: string,\n  field: RelationField,\n): void {\n  const existing = map.get(tableName);\n  if (existing) {\n    existing.push(field);\n  } else {\n    map.set(tableName, [field]);\n  }\n}\n"],"mappings":";;AAEA,MAAM,8BAAgE;CACpE,mBAAmB;CACnB,SAAS;AACX;AASA,SAAgB,WACd,eACA,SACsB;CACtB,QAAQ,cAAc,MAAtB;EACE,KAAK,WACH,OAAO,EAAE,WAAW,YAAY,mBAAmB,cAAc,KAAK,EAAE,GAAG;EAC7E,KAAK,YAAY;GACf,MAAM,YACJ,SAAS,qBAAqB,cAAc,eAC5C,4BAA4B,cAAc,eAC1C,SAAS,4BAA4B,cAAc,UAAU;GAC/D,OAAO,YACH,EAAE,UAAU,IACZ,EAAE,SAAS,mBAAmB,cAAc,WAAW,QAAQ,YAAY,GAAG,IAAI;EACxF;CACF;AACF;AAEA,SAAS,mBAAmB,OAAwB;CAClD,IAAI,UAAU,MACZ,OAAO;CAGT,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK,UACH,OAAO,OAAO,KAAK;EACrB,KAAK,UACH,OAAO,YAAY,KAAK;EAC1B,SACE,OAAO,YAAY,KAAK,UAAU,KAAK,CAAC;CAC5C;AACF;AAEA,SAAS,YAAY,KAAqB;CACxC,OAAO,IAAI,aAAa,GAAG,EAAE;AAC/B;AAEA,SAAS,aAAa,KAAqB;CACzC,OAAO,KAAK,UAAU,GAAG,CAAC,CAAC,MAAM,GAAG,EAAE;AACxC;;;ACvDA,MAAM,qCAAqB,IAAI,IAAI;CAAC;CAAS;CAAQ;CAAS;CAAQ;CAAa;AAAY,CAAC;AAEhG,MAAM,0BAA0B;AAOhC,SAAS,cAAc,OAAwB;CAC7C,OAAO,eAAe,KAAK,KAAK;AAClC;AAEA,SAAS,uBAAuB,OAAyB;CACvD,OAAO,MAAM,MAAM,uBAAuB,KAAK,CAAC;AAClD;AAEA,SAAS,0BAA0B,OAAuB;CACxD,IAAI,OAAO;CAEX,KAAK,MAAM,QAAQ,OAAO;EACxB,QAAQ,KAAK,YAAY,CAAC,KAAK;EAC/B,OAAO,KAAK,KAAK,MAAM,QAAQ;CACjC;CAEA,OAAO,KAAK,SAAS,EAAA,CAAG,SAAS,EAAE;AACrC;AAEA,SAAS,6BAA6B,OAAuB;CAC3D,MAAM,YAAY,MAAM,QAAQ,UAAU,EAAE;CAC5C,OAAO,UAAU,SAAS,IAAI,YAAY,0BAA0B,KAAK;AAC3E;AAEA,SAAS,WAAW,MAAsB;CACxC,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC;AACpD;AAEA,SAAS,kBAAkB,OAAuB;CAChD,MAAM,QAAQ,uBAAuB,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO,WAAW,6BAA6B,KAAK,CAAC;CAEvD,OAAO,MAAM,IAAI,UAAU,CAAC,CAAC,KAAK,EAAE;AACtC;AAEA,SAAS,iBAAiB,OAAuB;CAC/C,MAAM,QAAQ,uBAAuB,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO,6BAA6B,KAAK;CAE3C,MAAM,CAAC,YAAY,OAAO,GAAG,QAAQ;CACrC,OAAO,UAAU,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,UAAU,MAAM,CAAC,IAAI,KAAK,IAAI,UAAU,CAAC,CAAC,KAAK,EAAE;AAC9F;AAEA,SAAS,cAAc,MAAuB;CAC5C,OAAO,mBAAmB,IAAI,KAAK,YAAY,CAAC,KAAK,MAAM,KAAK,IAAI;AACtE;AAEA,SAAS,WAAW,MAAsB;CACxC,OAAO,IAAI;AACb;AAEA,SAAS,eAAe,MAAsB;CAC5C,OAAO,cAAc,IAAI,IAAI,WAAW,IAAI,IAAI;AAClD;AAEA,SAAgB,YAAY,WAA+B;CACzD,IAAI;CAEJ,IAAI,cAAc,SAAS,GACzB,OAAO,kBAAkB,SAAS;MAElC,OAAO,UAAU,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,UAAU,MAAM,CAAC;CAG9D,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAU;CAGzC,IAAI,SAAS,WACX,OAAO;EAAE;EAAM,KAAK;CAAU;CAGhC,OAAO,EAAE,KAAK;AAChB;AAEA,SAAgB,YAAY,YAAgC;CAC1D,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,iBAAiB,UAAU;MAElC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAW;CAG1C,IAAI,SAAS,YACX,OAAO;EAAE;EAAM,KAAK;CAAW;CAGjC,OAAO,EAAE,KAAK;AAChB;AAEA,SAAgB,WAAW,YAAgC;CACzD,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,kBAAkB,UAAU;MAEnC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,IAAI,cAAc,IAAI,GAEpB,OAAO;EAAE,MADO,WAAW,IACN;EAAG,KAAK;CAAW;CAG1C,IAAI,SAAS,YACX,OAAO;EAAE;EAAM,KAAK;CAAW;CAGjC,OAAO,EAAE,KAAK;AAChB;AAEA,MAAM,2BAA2B;;;;;;;AAQjC,SAAgB,iBAAiB,OAAuB;CACtD,IAAI,yBAAyB,KAAK,KAAK,KAAK,CAAC,cAAc,KAAK,GAC9D,OAAO;CAET,OAAO,eAAe,iBAAiB,KAAK,CAAC;AAC/C;AAEA,SAAgB,UAAU,MAAsB;CAC9C,IACE,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,GAAG,KACjB,KAAK,SAAS,IAAI,KAClB,KAAK,SAAS,IAAI,GAElB,OAAO,GAAG,KAAK;CAEjB,IAAI,KAAK,SAAS,GAAG,KAAK,CAAC,aAAa,KAAK,IAAI,GAC/C,OAAO,GAAG,KAAK,MAAM,GAAG,EAAE,EAAE;CAE9B,OAAO,GAAG,KAAK;AACjB;AAEA,SAAgB,wBACd,WACA,qBACQ;CACR,IAAI,UAAU,WAAW,GAAG;EAC1B,MAAM,CAAC,MAAM,uBAAuB;EACpC,MAAM,WAAW,IAAI,QAAQ,SAAS,EAAE,CAAC,CAAC,QAAQ,OAAO,EAAE;EAE3D,IAAI,SAAS,SAAS,KAAK,aAAa,KACtC,OAAO,eAAe,iBAAiB,QAAQ,CAAC;EAElD,OAAO,eAAe,iBAAiB,mBAAmB,CAAC;CAC7D;CAEA,OAAO,eAAe,iBAAiB,mBAAmB,CAAC;AAC7D;AAEA,SAAgB,4BAA4B,gBAAwB,YAA6B;CAC/F,MAAM,OAAO,eAAe,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,eAAe,MAAM,CAAC;CAC5E,OAAO,aAAa,OAAO,UAAU,IAAI;AAC3C;AAEA,SAAgB,gBAAgB,YAA4B;CAC1D,IAAI;CAEJ,IAAI,cAAc,UAAU,GAC1B,OAAO,kBAAkB,UAAU;MAEnC,OAAO,WAAW,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,WAAW,MAAM,CAAC;CAGhE,OAAO,eAAe,IAAI;AAC5B;;;AC9LA,MAAM,kBAAkB;AACxB,MAAM,uBAAuB;AAC7B,MAAM,0BAA0B;AAChC,MAAM,wBAAwB;AAC9B,MAAM,mBAAmB;AACzB,MAAM,sBAAsB;AAC5B,MAAM,eAAe;AACrB,MAAM,oBAAoB;AAC1B,MAAM,eAAe;AACrB,MAAM,eAAe;AACrB,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AACxB,MAAM,mBAAmB;AACzB,MAAM,yBAAyB;AAE/B,SAAS,6BAA6B,MAAkC;CACtE,IAAI,qBAAqB,KAAK,IAAI,GAAG,OAAO;CAC5C,IAAI,wBAAwB,KAAK,IAAI,GAAG,OAAO;CAE/C,IAAI,CAAC,sBAAsB,KAAK,IAAI,GAAG,OAAO,KAAA;CAE9C,IAAI,QAAQ,KAAK,QAAQ,uBAAuB,EAAE,CAAC,CAAC,KAAK;CACzD,IAAI,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAC7C,QAAQ,MAAM,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK;CAGlC,IAAI,qBAAqB,KAAK,KAAK,GAAG,OAAO;CAC7C,IAAI,wBAAwB,KAAK,KAAK,GAAG,OAAO;CAEhD,QAAQ,MAAM,QAAQ,kBAAkB,EAAE,CAAC,CAAC,KAAK;CACjD,IAAI,oBAAoB,KAAK,KAAK,GAAG,OAAO;AAG9C;AAEA,SAAgB,gBACd,YACA,YAC2B;CAC3B,MAAM,UAAU,WAAW,KAAK;CAChC,MAAM,iBAAiB,YAAY,YAAY;CAE/C,IAAI,gBAAgB,KAAK,OAAO,GAC9B,OAAO;EAAE,MAAM;EAAY,YAAY;CAAkB;CAG3D,MAAM,qBAAqB,6BAA6B,OAAO;CAC/D,IAAI,oBACF,OAAO;EAAE,MAAM;EAAY,YAAY;CAAmB;CAG5D,IAAI,aAAa,KAAK,OAAO,KAAK,kBAAkB,KAAK,OAAO,GAC9D,OAAO;EAAE,MAAM;EAAY,YAAY;CAAoB;CAG7D,IAAI,aAAa,KAAK,OAAO,GAC3B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAK;CAGxC,IAAI,aAAa,KAAK,OAAO,GAC3B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAK;CAGxC,IAAI,cAAc,KAAK,OAAO,GAC5B,OAAO;EAAE,MAAM;EAAW,OAAO;CAAM;CAGzC,IAAI,gBAAgB,KAAK,OAAO,GAC9B,OAAO;EAAE,MAAM;EAAW,OAAO,OAAO,OAAO;CAAE;CAGnD,MAAM,cAAc,QAAQ,MAAM,sBAAsB;CACxD,IAAI,cAAc,OAAO,KAAA,GAAW;EAClC,MAAM,YAAY,YAAY,EAAE,CAAC,QAAQ,OAAO,GAAG;EACnD,IAAI,mBAAmB,UAAU,mBAAmB,SAAS;GAC3D,IAAI,iBAAiB,KAAK,OAAO,GAC/B,OAAO;IAAE,MAAM;IAAY,YAAY;GAAQ;GAEjD,IAAI;IACF,OAAO;KAAE,MAAM;KAAW,OAAO,KAAK,MAAM,SAAS;IAAE;GACzD,QAAQ,CAER;EACF;EACA,OAAO;GAAE,MAAM;GAAW,OAAO;EAAU;CAC7C;CAEA,OAAO;EAAE,MAAM;EAAY,YAAY;CAAQ;AACjD;;;ACrFA,MAAM,oBAAoB;AAC1B,MAAM,oBAAoB;AAE1B,MAAM,yBAAiD;CACrD,UAAU;CACV,UAAU;CACV,SAAS;CACT,SAAS;CACT,YAAY;AACd;AAMA,SAAgB,eACd,QACA,cACmB;CACnB,MAAM,mCAAmB,IAAI,IAA6B;CAE1D,MAAM,gCAAgB,IAAI,IAAoB;CAC9C,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GACtC,KAAK,MAAM,MAAM,MAAM,aAAa;EAClC,MAAM,UAAU,GAAG,MAAM,KAAK,GAAG,GAAG;EACpC,cAAc,IAAI,UAAU,cAAc,IAAI,OAAO,KAAK,KAAK,CAAC;CAClE;CAGF,MAAM,iCAAiB,IAAI,IAAyB;CACpD,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GAAG;EACzC,MAAM,wBAAQ,IAAI,IAAY;EAC9B,KAAK,MAAM,OAAO,OAAO,OAAO,MAAM,OAAO,GAC3C,MAAM,IAAI,IAAI,IAAI;EAEpB,eAAe,IAAI,MAAM,MAAM,KAAK;CACtC;CAEA,KAAK,MAAM,SAAS,OAAO,OAAO,MAAM,GACtC,KAAK,MAAM,MAAM,MAAM,aAAa;EAClC,MAAM,iBAAiB,MAAM;EAC7B,MAAM,kBAAkB,GAAG;EAC3B,MAAM,YAAY,eAAe,IAAI,cAAc;EACnD,MAAM,iBAAiB,aAAa,IAAI,cAAc,KAAK;EAC3D,MAAM,kBAAkB,aAAa,IAAI,eAAe,KAAK;EAC7D,MAAM,UAAU,GAAG,eAAe,GAAG;EACrC,MAAM,iBAAiB,mBAAmB;EAC1C,MAAM,oBAAqB,cAAc,IAAI,OAAO,IAAe,KAAK;EAExE,MAAM,aAAa,eAAe,IAAI,KAAK;EAE3C,MAAM,oBAAoB,uBACxB,wBAAwB,GAAG,SAAS,eAAe,GACnD,WACA,eACF;EACA,MAAM,eAAe,oBACjB,mBAAmB,IAAI,mBAAmB,iBAAiB,cAAc,IACzE,KAAA;EAcJ,iBAAiB,kBAAkB,gBATb,wBACpB,mBACA,iBACA,IAPoB,GAAG,QAAQ,MAC9B,eAAe,MAAM,QAAQ,WAAW,EAAE,YAAY,KAO3C,GACZ,cACA,KAG6D,CAAC;EAChE,UAAU,IAAI,iBAAiB;EAE/B,MAAM,aAAa,eAAe,IAAI,eAAe,qBAAK,IAAI,IAAI;EAClE,eAAe,IAAI,iBAAiB,UAAU;EAE9C,MAAM,mBAAmB,uBACvB,4BAA4B,gBAAgB,UAAU,GACtD,YACA,cACF;EAUA,iBAAiB,kBAAkB,iBAAiB;GAPlD,WAAW;GACX,UAAU;GACV,UAAU;GACV,MAAM,CAAC;GACP;EAG6D,CAAC;EAChE,WAAW,IAAI,gBAAgB;CACjC;CAGF,OAAO,EAAE,iBAAiB;AAC5B;AAEA,SAAS,eAAe,IAAqB,OAA4B;CACvE,MAAM,SAAS,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,KAAK;CAEpC,IAAI,MAAM,YAAY;EACpB,MAAM,SAAS,CAAC,GAAG,MAAM,WAAW,OAAO,CAAC,CAAC,KAAK;EAClD,IAAI,OAAO,WAAW,OAAO,UAAU,OAAO,OAAO,GAAG,MAAM,MAAM,OAAO,EAAE,GAC3E,OAAO;CAEX;CAEA,KAAK,MAAM,UAAU,MAAM,SAAS;EAClC,MAAM,aAAa,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,KAAK;EAC5C,IAAI,WAAW,WAAW,OAAO,UAAU,WAAW,OAAO,GAAG,MAAM,MAAM,OAAO,EAAE,GACnF,OAAO;CAEX;CAEA,OAAO;AACT;AAEA,SAAS,mBACP,IACA,wBACA,iBACA,gBACQ;CACR,IAAI,GAAG,MACL,OAAO,GAAG;CAEZ,IAAI,gBACF,OAAO,GAAG,uBAAuB,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,uBAAuB,MAAM,CAAC,IAAI,UAAU,eAAe;CAExH,OAAO,GAAG,QAAQ,KAAK,GAAG;AAC5B;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,wBACd,WACA,iBACA,IACA,UACA,cACA,WACe;CACf,MAAM,WAAW,GAAG,YAAY,GAAG,aAAa,oBAAoB,GAAG,WAAW,KAAA;CAClF,MAAM,WAAW,GAAG,YAAY,GAAG,aAAa,oBAAoB,GAAG,WAAW,KAAA;CAClF,MAAM,QACJ,aAAa,CAAC,qBAAqB,GAAG,SAAS,uBAAuB,SAAS,CAAC,IAC5E,QACA,KAAA;CAEN,OAAO;EACL;EACA,UAAU;EACV,qBAAqB,GAAG;EACxB;EACA,MAAM;EACN;EACA,QAAQ,GAAG;EACX,QAAQ,GAAG;EACX,YAAY,GAAG;EACf,UAAU,WAAW,uBAAuB,YAAY,KAAA;EACxD,UAAU,WAAW,uBAAuB,YAAY,KAAA;EACxD;CACF;AACF;AAEA,SAAS,uBACP,SACA,WACA,gBACQ;CACR,IAAI,CAAC,UAAU,IAAI,OAAO,GACxB,OAAO;CAGT,MAAM,aAAa,GAAG,UAAU;CAChC,IAAI,CAAC,UAAU,IAAI,UAAU,GAC3B,OAAO;CAGT,IAAI,UAAU;CACd,OAAO,UAAU,IAAI,GAAG,UAAU,SAAS,GACzC;CAEF,OAAO,GAAG,UAAU;AACtB;AAEA,SAAS,iBACP,KACA,WACA,OACM;CACN,MAAM,WAAW,IAAI,IAAI,SAAS;CAClC,IAAI,UACF,SAAS,KAAK,KAAK;MAEnB,IAAI,IAAI,WAAW,CAAC,KAAK,CAAC;AAE9B"}

package/dist/{schema-verify-3sOPsdn_.mjs → schema-verify-W3r631Jh.mjs}

@@ -1,5 +1,5 @@
 import { blindCast } from "@prisma-next/utils/casts";
-import { assertUniqueCodecOwner, dispositionForCategory, issueOutcome } from "@prisma-next/framework-components/control";
+import { assertUniqueCodecOwner, dispositionForCategory } from "@prisma-next/framework-components/control";
 import { ifDefined } from "@prisma-next/utils/defined";
 import { effectiveControlPolicy } from "@prisma-next/contract/types";
 import { isStorageTypeInstance } from "@prisma-next/sql-contract/types";
@@ -40,8 +40,8 @@ function extractCodecControlHooks(descriptors) {
 * to its value set, so a paired mismatch always classifies as `valueDrift`.
 */
 function classifyStorageTypeDiffIssue(issue) {
-	if (issueOutcome(issue) === "not-found") return "declaredMissing";
-	if (issueOutcome(issue) === "not-expected") return "extraAuxiliary";
+	if (issue.reason === "not-found") return "declaredMissing";
+	if (issue.reason === "not-expected") return "extraAuxiliary";
 	return "valueDrift";
 }
 function verifierDisposition(controlPolicy, issue) {
@@ -94,8 +94,8 @@ function classifyDiffEntityKind(issue, entityKindOf) {
 * kinds classify without the family importing them.
 */
 function classifySqlDiffIssue(issue, granularityOf) {
-	if (issueOutcome(issue) === "not-found") return "declaredMissing";
-	if (issueOutcome(issue) === "not-expected") {
+	if (issue.reason === "not-found") return "declaredMissing";
+	if (issue.reason === "not-expected") {
 		const granularity = classifyDiffSubjectGranularity(issue, granularityOf);
 		if (granularity === "entity" || granularity === "namespace") return "extraTopLevelObject";
 		if (granularity === "field") return "extraNestedElement";
@@ -126,7 +126,7 @@ function computeSqlDiffVerdict(input) {
 	const failures = [];
 	const warnings = [];
 	for (const issue of input.issues) {
-		if (!input.strict && issueOutcome(issue) === "not-expected" && isStrictOnlyExtra(issue, input.granularityOf)) continue;
+		if (!input.strict && issue.reason === "not-expected" && isStrictOnlyExtra(issue, input.granularityOf)) continue;
 		const disposition = dispositionForCategory(effectiveControlPolicy(input.resolveControlPolicy(issue), input.defaultControlPolicy), classifySqlDiffIssue(issue, input.granularityOf));
 		if (disposition === "suppress") continue;
 		if (disposition === "warn") {
@@ -223,4 +223,4 @@ function verifySqlSchemaByDiff(input) {
 //#endregion
 export { computeStorageTypeVerdict as a, computeSqlDiffVerdict as i, classifyDiffSubjectGranularity as n, verifySqlSchemaByDiff as o, classifySqlDiffIssue as r, extractCodecControlHooks as s, classifyDiffEntityKind as t };
 
-//# sourceMappingURL=schema-verify-3sOPsdn_.mjs.map
+//# sourceMappingURL=schema-verify-W3r631Jh.mjs.map

package/dist/schema-verify-W3r631Jh.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema-verify-W3r631Jh.mjs","names":["d"],"sources":["../src/core/assembly.ts","../src/core/diff/verifier-disposition.ts","../src/core/diff/schema-verify.ts"],"sourcesContent":["import type { TargetBoundComponentDescriptor } from '@prisma-next/framework-components/components';\nimport { assertUniqueCodecOwner } from '@prisma-next/framework-components/control';\nimport type { CodecControlHooks } from './migrations/types';\n\ntype CodecControlHooksMap = Record<string, CodecControlHooks>;\n\nfunction hasCodecControlHooks(descriptor: unknown): descriptor is {\n  readonly id: string;\n  readonly types: {\n    readonly codecTypes: {\n      readonly controlPlaneHooks: CodecControlHooksMap;\n    };\n  };\n} {\n  if (typeof descriptor !== 'object' || descriptor === null) {\n    return false;\n  }\n  const d = descriptor as { types?: { codecTypes?: { controlPlaneHooks?: unknown } } };\n  const hooks = d.types?.codecTypes?.controlPlaneHooks;\n  return hooks !== null && hooks !== undefined && typeof hooks === 'object';\n}\n\nexport function extractCodecControlHooks(\n  descriptors: ReadonlyArray<TargetBoundComponentDescriptor<'sql', string>>,\n): Map<string, CodecControlHooks> {\n  const hooks = new Map<string, CodecControlHooks>();\n  const owners = new Map<string, string>();\n\n  for (const descriptor of descriptors) {\n    if (typeof descriptor !== 'object' || descriptor === null) {\n      continue;\n    }\n    if (!hasCodecControlHooks(descriptor)) {\n      continue;\n    }\n    const controlPlaneHooks = descriptor.types.codecTypes.controlPlaneHooks;\n    for (const [codecId, hook] of Object.entries(controlPlaneHooks)) {\n      assertUniqueCodecOwner({\n        codecId,\n        owners,\n        descriptorId: descriptor.id,\n        entityLabel: 'control hooks',\n        entityOwnershipLabel: 'owner',\n      });\n      hooks.set(codecId, hook);\n      owners.set(codecId, descriptor.id);\n    }\n  }\n\n  return hooks;\n}\n","import type { ControlPolicy } from '@prisma-next/contract/types';\nimport type {\n  SchemaDiffIssue,\n  VerifierIssueCategory,\n  VerifierOutcome,\n} from '@prisma-next/framework-components/control';\nimport { dispositionForCategory } from '@prisma-next/framework-components/control';\n\n/**\n * Classifies a codec `verifyType` hook finding into the target-neutral\n * categories the framework grades. A storage type is a named type instance\n * (e.g. a native enum); the only shape divergence it can carry is a change\n * to its value set, so a paired mismatch always classifies as `valueDrift`.\n */\nexport function classifyStorageTypeDiffIssue(issue: SchemaDiffIssue): VerifierIssueCategory {\n  if (issue.reason === 'not-found') {\n    return 'declaredMissing';\n  }\n  if (issue.reason === 'not-expected') {\n    return 'extraAuxiliary';\n  }\n  return 'valueDrift';\n}\n\nexport function verifierDisposition(\n  controlPolicy: ControlPolicy,\n  issue: SchemaDiffIssue,\n): VerifierOutcome {\n  return dispositionForCategory(controlPolicy, classifyStorageTypeDiffIssue(issue));\n}\n","/**\n * The differ-based SQL schema verify: post-diff filters and verdict.\n *\n * The generic node differ (`diffSchemas`) reports every node-level\n * difference between the derived expected tree and the introspected actual\n * tree. This module is the consumer side the spec assigns to the SQL\n * family: strict-mode extras gating and control-policy disposition are\n * reason/kind-keyed filters applied AFTER the diff — never inside it — and\n * the verify verdict derives from the filtered issue list.\n *\n * `verifySqlSchemaByDiff` wraps the verdict in the issue-based result\n * envelope — this is THE SQL schema verify (the legacy relational walk and\n * its verification tree are retired).\n */\n\nimport type { Contract, ControlPolicy } from '@prisma-next/contract/types';\nimport { effectiveControlPolicy } from '@prisma-next/contract/types';\nimport type { TargetBoundComponentDescriptor } from '@prisma-next/framework-components/components';\nimport type {\n  DiffSubjectGranularity,\n  SchemaDiffIssue,\n  VerifierIssueCategory,\n  VerifierOutcome,\n  VerifyDatabaseSchemaResult,\n} from '@prisma-next/framework-components/control';\nimport { dispositionForCategory } from '@prisma-next/framework-components/control';\nimport { isStorageTypeInstance, type SqlStorage } from '@prisma-next/sql-contract/types';\nimport { RelationalSchemaNodeKind, type SqlSchemaIRNode } from '@prisma-next/sql-schema-ir/types';\nimport { blindCast } from '@prisma-next/utils/casts';\nimport { ifDefined } from '@prisma-next/utils/defined';\nimport { extractCodecControlHooks } from '../assembly';\nimport type { SqlSchemaDiffFn } from '../migrations/schema-differ';\nimport type { CodecControlHooks } from '../migrations/types';\nimport { verifierDisposition } from './verifier-disposition';\n\n// ============================================================================\n// Subject-granularity classification — nodeKind → framework-neutral granularity\n// ============================================================================\n\nfunction issueNode(issue: SchemaDiffIssue): SqlSchemaIRNode | undefined {\n  const node = issue.expected ?? issue.actual;\n  if (node === undefined) return undefined;\n  return blindCast<\n    SqlSchemaIRNode,\n    'every node in a SQL schema diff tree is a SqlSchemaIRNode; nodeKind is its identity'\n  >(node);\n}\n\n/**\n * Resolves an issue's framework-neutral {@link DiffSubjectGranularity} on\n * demand, from the issue's node's `nodeKind` via the target-provided\n * `granularityOf` map. The node carries only its `nodeKind` identity, never a\n * classification, and nothing is stamped onto the issue — every consumer\n * (the family verdict below, the framework aggregate's unclaimed-elements\n * sweep via {@link import('@prisma-next/framework-components/control').SchemaSubjectClassifierCapable})\n * calls this the same way, resolved by the family/target that owns the node\n * vocabulary. `undefined` for an issue with no node.\n */\nexport function classifyDiffSubjectGranularity(\n  issue: SchemaDiffIssue,\n  granularityOf: (nodeKind: string) => DiffSubjectGranularity,\n): DiffSubjectGranularity | undefined {\n  const node = issueNode(issue);\n  return node === undefined ? undefined : granularityOf(node.nodeKind);\n}\n\n/**\n * Resolves an issue's storage `entityKind` on demand, from the issue's\n * node's `nodeKind` via the target-provided `entityKindOf` map — the sibling\n * of {@link classifyDiffSubjectGranularity}, called the same way by the same\n * consumers (via\n * {@link import('@prisma-next/framework-components/control').SchemaSubjectClassifierCapable}).\n * `undefined` for an issue with no node, or for a node kind with no storage\n * entity of its own.\n */\nexport function classifyDiffEntityKind(\n  issue: SchemaDiffIssue,\n  entityKindOf: (nodeKind: string) => string | undefined,\n): string | undefined {\n  const node = issueNode(issue);\n  return node === undefined ? undefined : entityKindOf(node.nodeKind);\n}\n\n// ============================================================================\n// Issue classification — subject granularity + reason → target-neutral category\n// ============================================================================\n\n/**\n * Re-keys the legacy `classifySqlVerifierIssueKind` category mapping on the\n * issue's {@link DiffSubjectGranularity} (resolved via `granularityOf`) + the\n * issue reason. The vocabulary maps one-to-one: an undeclared live entity or\n * namespace is `extraTopLevelObject`, an undeclared live field\n * `extraNestedElement`, undeclared auxiliaries (constraints, indexes,\n * defaults) and structural leaves (policies) `extraAuxiliary`; a value-set\n * drift on a check node is `valueDrift`; every other paired divergence is\n * `declaredIncompatible`; anything the database lacks is `declaredMissing`.\n * `granularityOf` is the target's classifier, so target and extension node\n * kinds classify without the family importing them.\n */\nexport function classifySqlDiffIssue(\n  issue: SchemaDiffIssue,\n  granularityOf: (nodeKind: string) => DiffSubjectGranularity,\n): VerifierIssueCategory {\n  if (issue.reason === 'not-found') {\n    return 'declaredMissing';\n  }\n  if (issue.reason === 'not-expected') {\n    const granularity = classifyDiffSubjectGranularity(issue, granularityOf);\n    if (granularity === 'entity' || granularity === 'namespace') {\n      return 'extraTopLevelObject';\n    }\n    if (granularity === 'field') {\n      return 'extraNestedElement';\n    }\n    return 'extraAuxiliary';\n  }\n  if (issueNode(issue)?.nodeKind === RelationalSchemaNodeKind.check) {\n    return 'valueDrift';\n  }\n  return 'declaredIncompatible';\n}\n\n/**\n * Whether a `not-expected` issue is a strict-mode-only finding. The legacy\n * walk detected every relational extra (namespaces, entities, fields, and\n * their auxiliaries) only under `--strict`; the structural diff (roots, RLS\n * policies, roles) was never strict-gated — its extras fail in both modes.\n * Keyed on the issue's granularity, resolved via `granularityOf`.\n */\nfunction isStrictOnlyExtra(\n  issue: SchemaDiffIssue,\n  granularityOf: (nodeKind: string) => DiffSubjectGranularity,\n): boolean {\n  const granularity = classifyDiffSubjectGranularity(issue, granularityOf);\n  return (\n    granularity === 'namespace' ||\n    granularity === 'entity' ||\n    granularity === 'field' ||\n    granularity === 'auxiliary'\n  );\n}\n\n// ============================================================================\n// The post-diff filter + verdict\n// ============================================================================\n\nexport interface SqlDiffVerdictInput {\n  /** The full, ownership-scoped diff issue list from the target's differ. */\n  readonly issues: readonly SchemaDiffIssue[];\n  /** Resolves a diff issue's subject table's declared control policy directly from the contract. */\n  readonly resolveControlPolicy: (issue: SchemaDiffIssue) => ControlPolicy | undefined;\n  readonly strict: boolean;\n  readonly defaultControlPolicy: ControlPolicy | undefined;\n  /** The target's classifier: a diff issue node's `nodeKind` → its subject granularity. */\n  readonly granularityOf: (nodeKind: string) => DiffSubjectGranularity;\n}\n\nexport interface SqlDiffVerdict {\n  readonly failures: readonly SchemaDiffIssue[];\n  readonly warnings: readonly SchemaDiffIssue[];\n}\n\n/**\n * Applies the two consumer filters to a diff issue list: strict gating\n * (relational `not-expected` findings drop in lenient mode) and\n * control-policy disposition (each surviving issue grades against its\n * subject table's effective policy; suppressed issues drop, `observed`\n * subjects warn). The verify verdict is `failures.length === 0`.\n */\nexport function computeSqlDiffVerdict(input: SqlDiffVerdictInput): SqlDiffVerdict {\n  const failures: SchemaDiffIssue[] = [];\n  const warnings: SchemaDiffIssue[] = [];\n  for (const issue of input.issues) {\n    if (\n      !input.strict &&\n      issue.reason === 'not-expected' &&\n      isStrictOnlyExtra(issue, input.granularityOf)\n    ) {\n      continue;\n    }\n    const tablePolicy = input.resolveControlPolicy(issue);\n    const policy = effectiveControlPolicy(tablePolicy, input.defaultControlPolicy);\n    const disposition: VerifierOutcome = dispositionForCategory(\n      policy,\n      classifySqlDiffIssue(issue, input.granularityOf),\n    );\n    if (disposition === 'suppress') continue;\n    if (disposition === 'warn') {\n      warnings.push(issue);\n      continue;\n    }\n    failures.push(issue);\n  }\n  return { failures, warnings };\n}\n\n// ============================================================================\n// Storage-types check — the codec verifyType hook path\n// ============================================================================\n\nexport interface StorageTypeVerdictInput {\n  readonly contract: Contract<SqlStorage>;\n  /**\n   * Expected/actual namespace-node pairs the target's differ input produced:\n   * for a namespaced tree, one entry per expected namespace with a\n   * non-empty table set, paired by DDL schema name (absent actual side for\n   * a schema the database lacks); a flat tree is the sole pair.\n   */\n  readonly namespacePairs: ReadonlyArray<{\n    readonly actual: SqlSchemaIRNode | undefined;\n  }>;\n  readonly codecHooks: ReadonlyMap<string, CodecControlHooks>;\n}\n\n/**\n * Runs the codec `verifyType` hooks the way the legacy walk did: once per\n * contract namespace with tables, against that namespace's paired actual\n * node (the hook reads namespace-scoped state such as `enums` off it).\n * Issue dispositions grade against the contract default policy, matching\n * the legacy `pushTypeNode` semantics.\n */\nexport interface StorageTypeVerdict {\n  readonly failures: readonly SchemaDiffIssue[];\n  readonly warnings: readonly SchemaDiffIssue[];\n}\n\nexport function computeStorageTypeVerdict(input: StorageTypeVerdictInput): StorageTypeVerdict {\n  const failures: SchemaDiffIssue[] = [];\n  const warnings: SchemaDiffIssue[] = [];\n  const policy = effectiveControlPolicy(undefined, input.contract.defaultControlPolicy);\n  for (const pair of input.namespacePairs) {\n    if (pair.actual === undefined) continue;\n    for (const [typeName, typeInstance] of Object.entries(input.contract.storage.types ?? {})) {\n      if (!isStorageTypeInstance(typeInstance)) continue;\n      const hook = input.codecHooks.get(typeInstance.codecId);\n      if (!hook?.verifyType) continue;\n      const typeIssues = hook.verifyType({ typeName, typeInstance, schema: pair.actual });\n      for (const issue of typeIssues) {\n        const disposition = verifierDisposition(policy, issue);\n        if (disposition === 'suppress') continue;\n        if (disposition === 'warn') {\n          warnings.push(issue);\n          continue;\n        }\n        failures.push(issue);\n      }\n    }\n  }\n  return { failures, warnings };\n}\n\n// ============================================================================\n// The issue-based verify envelope\n// ============================================================================\n\nexport interface VerifySqlSchemaByDiffInput {\n  readonly contract: Contract<SqlStorage>;\n  readonly schema: SqlSchemaIRNode;\n  readonly strict: boolean;\n  readonly frameworkComponents: ReadonlyArray<TargetBoundComponentDescriptor<'sql', string>>;\n  /** The target's full-tree node diff (`diffSchema` descriptor hook). */\n  readonly diffSchema: SqlSchemaDiffFn;\n  /** The target's classifier: a diff issue node's `nodeKind` → its subject granularity. */\n  readonly granularityOf: (nodeKind: string) => DiffSubjectGranularity;\n}\n\n/**\n * THE SQL schema verify: runs the target's full-tree node diff, grades it\n * through the family's post-diff filters (strict gating + control-policy\n * disposition) plus the codec `verifyType` hook findings, and wraps the\n * verdict in the issue-based result envelope. `ok` holds exactly when both\n * issue lists are empty — the lists carry the verdict's failures.\n */\nexport function verifySqlSchemaByDiff(\n  input: VerifySqlSchemaByDiffInput,\n): VerifyDatabaseSchemaResult {\n  const startTime = Date.now();\n  const verdictDiff = input.diffSchema({\n    contract: input.contract,\n    schema: input.schema,\n    frameworkComponents: input.frameworkComponents,\n  });\n  const diffVerdict = computeSqlDiffVerdict({\n    issues: verdictDiff.issues,\n    resolveControlPolicy: verdictDiff.resolveControlPolicy,\n    strict: input.strict,\n    defaultControlPolicy: input.contract.defaultControlPolicy,\n    granularityOf: input.granularityOf,\n  });\n  const storageTypeVerdict = computeStorageTypeVerdict({\n    contract: input.contract,\n    namespacePairs: verdictDiff.namespacePairs,\n    codecHooks: extractCodecControlHooks(input.frameworkComponents),\n  });\n  const failCount = diffVerdict.failures.length + storageTypeVerdict.failures.length;\n  const ok = failCount === 0;\n  const profileHash =\n    'profileHash' in input.contract && typeof input.contract.profileHash === 'string'\n      ? input.contract.profileHash\n      : undefined;\n  return {\n    ok,\n    ...(ok ? {} : { code: 'PN-SCHEMA-0001' }),\n    summary: ok\n      ? 'Database schema satisfies contract'\n      : `Database schema does not satisfy contract (${failCount} failure${failCount === 1 ? '' : 's'})`,\n    contract: {\n      storageHash: input.contract.storage.storageHash,\n      ...ifDefined('profileHash', profileHash),\n    },\n    target: {\n      expected: input.contract.target,\n      actual: input.contract.target,\n    },\n    schema: {\n      issues: [...diffVerdict.failures, ...storageTypeVerdict.failures],\n      warnings: {\n        issues: [...diffVerdict.warnings, ...storageTypeVerdict.warnings],\n      },\n    },\n    meta: { strict: input.strict },\n    timings: { total: Date.now() - startTime },\n  };\n}\n"],"mappings":";;;;;;;AAMA,SAAS,qBAAqB,YAO5B;CACA,IAAI,OAAO,eAAe,YAAY,eAAe,MACnD,OAAO;CAGT,MAAM,QAAQA,WAAE,OAAO,YAAY;CACnC,OAAO,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU;AACnE;AAEA,SAAgB,yBACd,aACgC;CAChC,MAAM,wBAAQ,IAAI,IAA+B;CACjD,MAAM,yBAAS,IAAI,IAAoB;CAEvC,KAAK,MAAM,cAAc,aAAa;EACpC,IAAI,OAAO,eAAe,YAAY,eAAe,MACnD;EAEF,IAAI,CAAC,qBAAqB,UAAU,GAClC;EAEF,MAAM,oBAAoB,WAAW,MAAM,WAAW;EACtD,KAAK,MAAM,CAAC,SAAS,SAAS,OAAO,QAAQ,iBAAiB,GAAG;GAC/D,uBAAuB;IACrB;IACA;IACA,cAAc,WAAW;IACzB,aAAa;IACb,sBAAsB;GACxB,CAAC;GACD,MAAM,IAAI,SAAS,IAAI;GACvB,OAAO,IAAI,SAAS,WAAW,EAAE;EACnC;CACF;CAEA,OAAO;AACT;;;;;;;;;ACpCA,SAAgB,6BAA6B,OAA+C;CAC1F,IAAI,MAAM,WAAW,aACnB,OAAO;CAET,IAAI,MAAM,WAAW,gBACnB,OAAO;CAET,OAAO;AACT;AAEA,SAAgB,oBACd,eACA,OACiB;CACjB,OAAO,uBAAuB,eAAe,6BAA6B,KAAK,CAAC;AAClF;;;ACUA,SAAS,UAAU,OAAqD;CACtE,MAAM,OAAO,MAAM,YAAY,MAAM;CACrC,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,OAAO,UAGL,IAAI;AACR;;;;;;;;;;;AAYA,SAAgB,+BACd,OACA,eACoC;CACpC,MAAM,OAAO,UAAU,KAAK;CAC5B,OAAO,SAAS,KAAA,IAAY,KAAA,IAAY,cAAc,KAAK,QAAQ;AACrE;;;;;;;;;;AAWA,SAAgB,uBACd,OACA,cACoB;CACpB,MAAM,OAAO,UAAU,KAAK;CAC5B,OAAO,SAAS,KAAA,IAAY,KAAA,IAAY,aAAa,KAAK,QAAQ;AACpE;;;;;;;;;;;;;AAkBA,SAAgB,qBACd,OACA,eACuB;CACvB,IAAI,MAAM,WAAW,aACnB,OAAO;CAET,IAAI,MAAM,WAAW,gBAAgB;EACnC,MAAM,cAAc,+BAA+B,OAAO,aAAa;EACvE,IAAI,gBAAgB,YAAY,gBAAgB,aAC9C,OAAO;EAET,IAAI,gBAAgB,SAClB,OAAO;EAET,OAAO;CACT;CACA,IAAI,UAAU,KAAK,CAAC,EAAE,aAAa,yBAAyB,OAC1D,OAAO;CAET,OAAO;AACT;;;;;;;;AASA,SAAS,kBACP,OACA,eACS;CACT,MAAM,cAAc,+BAA+B,OAAO,aAAa;CACvE,OACE,gBAAgB,eAChB,gBAAgB,YAChB,gBAAgB,WAChB,gBAAgB;AAEpB;;;;;;;;AA6BA,SAAgB,sBAAsB,OAA4C;CAChF,MAAM,WAA8B,CAAC;CACrC,MAAM,WAA8B,CAAC;CACrC,KAAK,MAAM,SAAS,MAAM,QAAQ;EAChC,IACE,CAAC,MAAM,UACP,MAAM,WAAW,kBACjB,kBAAkB,OAAO,MAAM,aAAa,GAE5C;EAIF,MAAM,cAA+B,uBADtB,uBADK,MAAM,qBAAqB,KACC,GAAG,MAAM,oBAElD,GACL,qBAAqB,OAAO,MAAM,aAAa,CACjD;EACA,IAAI,gBAAgB,YAAY;EAChC,IAAI,gBAAgB,QAAQ;GAC1B,SAAS,KAAK,KAAK;GACnB;EACF;EACA,SAAS,KAAK,KAAK;CACrB;CACA,OAAO;EAAE;EAAU;CAAS;AAC9B;AAgCA,SAAgB,0BAA0B,OAAoD;CAC5F,MAAM,WAA8B,CAAC;CACrC,MAAM,WAA8B,CAAC;CACrC,MAAM,SAAS,uBAAuB,KAAA,GAAW,MAAM,SAAS,oBAAoB;CACpF,KAAK,MAAM,QAAQ,MAAM,gBAAgB;EACvC,IAAI,KAAK,WAAW,KAAA,GAAW;EAC/B,KAAK,MAAM,CAAC,UAAU,iBAAiB,OAAO,QAAQ,MAAM,SAAS,QAAQ,SAAS,CAAC,CAAC,GAAG;GACzF,IAAI,CAAC,sBAAsB,YAAY,GAAG;GAC1C,MAAM,OAAO,MAAM,WAAW,IAAI,aAAa,OAAO;GACtD,IAAI,CAAC,MAAM,YAAY;GACvB,MAAM,aAAa,KAAK,WAAW;IAAE;IAAU;IAAc,QAAQ,KAAK;GAAO,CAAC;GAClF,KAAK,MAAM,SAAS,YAAY;IAC9B,MAAM,cAAc,oBAAoB,QAAQ,KAAK;IACrD,IAAI,gBAAgB,YAAY;IAChC,IAAI,gBAAgB,QAAQ;KAC1B,SAAS,KAAK,KAAK;KACnB;IACF;IACA,SAAS,KAAK,KAAK;GACrB;EACF;CACF;CACA,OAAO;EAAE;EAAU;CAAS;AAC9B;;;;;;;;AAwBA,SAAgB,sBACd,OAC4B;CAC5B,MAAM,YAAY,KAAK,IAAI;CAC3B,MAAM,cAAc,MAAM,WAAW;EACnC,UAAU,MAAM;EAChB,QAAQ,MAAM;EACd,qBAAqB,MAAM;CAC7B,CAAC;CACD,MAAM,cAAc,sBAAsB;EACxC,QAAQ,YAAY;EACpB,sBAAsB,YAAY;EAClC,QAAQ,MAAM;EACd,sBAAsB,MAAM,SAAS;EACrC,eAAe,MAAM;CACvB,CAAC;CACD,MAAM,qBAAqB,0BAA0B;EACnD,UAAU,MAAM;EAChB,gBAAgB,YAAY;EAC5B,YAAY,yBAAyB,MAAM,mBAAmB;CAChE,CAAC;CACD,MAAM,YAAY,YAAY,SAAS,SAAS,mBAAmB,SAAS;CAC5E,MAAM,KAAK,cAAc;CACzB,MAAM,cACJ,iBAAiB,MAAM,YAAY,OAAO,MAAM,SAAS,gBAAgB,WACrE,MAAM,SAAS,cACf,KAAA;CACN,OAAO;EACL;EACA,GAAI,KAAK,CAAC,IAAI,EAAE,MAAM,iBAAiB;EACvC,SAAS,KACL,uCACA,8CAA8C,UAAU,UAAU,cAAc,IAAI,KAAK,IAAI;EACjG,UAAU;GACR,aAAa,MAAM,SAAS,QAAQ;GACpC,GAAG,UAAU,eAAe,WAAW;EACzC;EACA,QAAQ;GACN,UAAU,MAAM,SAAS;GACzB,QAAQ,MAAM,SAAS;EACzB;EACA,QAAQ;GACN,QAAQ,CAAC,GAAG,YAAY,UAAU,GAAG,mBAAmB,QAAQ;GAChE,UAAU,EACR,QAAQ,CAAC,GAAG,YAAY,UAAU,GAAG,mBAAmB,QAAQ,EAClE;EACF;EACA,MAAM,EAAE,QAAQ,MAAM,OAAO;EAC7B,SAAS,EAAE,OAAO,KAAK,IAAI,IAAI,UAAU;CAC3C;AACF"}

package/package.json

@@ -1,34 +1,34 @@
 {
   "name": "@prisma-next/family-sql",
-  "version": "0.15.0-dev.8",
+  "version": "0.15.0",
   "license": "Apache-2.0",
   "type": "module",
   "sideEffects": false,
   "description": "SQL family descriptor for Prisma Next",
   "dependencies": {
-    "@prisma-next/contract": "0.15.0-dev.8",
-    "@prisma-next/emitter": "0.15.0-dev.8",
-    "@prisma-next/framework-components": "0.15.0-dev.8",
-    "@prisma-next/migration-tools": "0.15.0-dev.8",
-    "@prisma-next/operations": "0.15.0-dev.8",
-    "@prisma-next/sql-contract": "0.15.0-dev.8",
-    "@prisma-next/sql-contract-emitter": "0.15.0-dev.8",
-    "@prisma-next/sql-contract-ts": "0.15.0-dev.8",
-    "@prisma-next/sql-operations": "0.15.0-dev.8",
-    "@prisma-next/sql-relational-core": "0.15.0-dev.8",
-    "@prisma-next/sql-runtime": "0.15.0-dev.8",
-    "@prisma-next/sql-schema-ir": "0.15.0-dev.8",
-    "@prisma-next/utils": "0.15.0-dev.8",
+    "@prisma-next/contract": "0.15.0",
+    "@prisma-next/emitter": "0.15.0",
+    "@prisma-next/framework-components": "0.15.0",
+    "@prisma-next/migration-tools": "0.15.0",
+    "@prisma-next/operations": "0.15.0",
+    "@prisma-next/sql-contract": "0.15.0",
+    "@prisma-next/sql-contract-emitter": "0.15.0",
+    "@prisma-next/sql-contract-ts": "0.15.0",
+    "@prisma-next/sql-operations": "0.15.0",
+    "@prisma-next/sql-relational-core": "0.15.0",
+    "@prisma-next/sql-runtime": "0.15.0",
+    "@prisma-next/sql-schema-ir": "0.15.0",
+    "@prisma-next/utils": "0.15.0",
     "arktype": "^2.2.2"
   },
   "devDependencies": {
-    "@prisma-next/driver-postgres": "0.15.0-dev.8",
-    "@prisma-next/psl-parser": "0.15.0-dev.8",
-    "@prisma-next/psl-printer": "0.15.0-dev.8",
-    "@prisma-next/sql-contract-psl": "0.15.0-dev.8",
-    "@prisma-next/test-utils": "0.15.0-dev.8",
-    "@prisma-next/tsconfig": "0.15.0-dev.8",
-    "@prisma-next/tsdown": "0.15.0-dev.8",
+    "@prisma-next/driver-postgres": "0.15.0",
+    "@prisma-next/psl-parser": "0.15.0",
+    "@prisma-next/psl-printer": "0.15.0",
+    "@prisma-next/sql-contract-psl": "0.15.0",
+    "@prisma-next/test-utils": "0.15.0",
+    "@prisma-next/tsconfig": "0.15.0",
+    "@prisma-next/tsdown": "0.15.0",
     "tsdown": "0.22.3",
     "typescript": "5.9.3",
     "vitest": "4.1.10"

package/src/core/diff/schema-verify.ts

@@ -23,7 +23,7 @@ import type {
   VerifierOutcome,
   VerifyDatabaseSchemaResult,
 } from '@prisma-next/framework-components/control';
-import { dispositionForCategory, issueOutcome } from '@prisma-next/framework-components/control';
+import { dispositionForCategory } from '@prisma-next/framework-components/control';
 import { isStorageTypeInstance, type SqlStorage } from '@prisma-next/sql-contract/types';
 import { RelationalSchemaNodeKind, type SqlSchemaIRNode } from '@prisma-next/sql-schema-ir/types';
 import { blindCast } from '@prisma-next/utils/casts';
@@ -101,10 +101,10 @@ export function classifySqlDiffIssue(
   issue: SchemaDiffIssue,
   granularityOf: (nodeKind: string) => DiffSubjectGranularity,
 ): VerifierIssueCategory {
-  if (issueOutcome(issue) === 'not-found') {
+  if (issue.reason === 'not-found') {
     return 'declaredMissing';
   }
-  if (issueOutcome(issue) === 'not-expected') {
+  if (issue.reason === 'not-expected') {
     const granularity = classifyDiffSubjectGranularity(issue, granularityOf);
     if (granularity === 'entity' || granularity === 'namespace') {
       return 'extraTopLevelObject';
@@ -173,7 +173,7 @@ export function computeSqlDiffVerdict(input: SqlDiffVerdictInput): SqlDiffVerdic
   for (const issue of input.issues) {
     if (
       !input.strict &&
-      issueOutcome(issue) === 'not-expected' &&
+      issue.reason === 'not-expected' &&
       isStrictOnlyExtra(issue, input.granularityOf)
     ) {
       continue;

package/src/core/diff/verifier-disposition.ts

@@ -4,7 +4,7 @@ import type {
   VerifierIssueCategory,
   VerifierOutcome,
 } from '@prisma-next/framework-components/control';
-import { dispositionForCategory, issueOutcome } from '@prisma-next/framework-components/control';
+import { dispositionForCategory } from '@prisma-next/framework-components/control';
 
 /**
  * Classifies a codec `verifyType` hook finding into the target-neutral
@@ -13,10 +13,10 @@ import { dispositionForCategory, issueOutcome } from '@prisma-next/framework-com
  * to its value set, so a paired mismatch always classifies as `valueDrift`.
  */
 export function classifyStorageTypeDiffIssue(issue: SchemaDiffIssue): VerifierIssueCategory {
-  if (issueOutcome(issue) === 'not-found') {
+  if (issue.reason === 'not-found') {
     return 'declaredMissing';
   }
-  if (issueOutcome(issue) === 'not-expected') {
+  if (issue.reason === 'not-expected') {
     return 'extraAuxiliary';
   }
   return 'valueDrift';

package/src/core/foreign-key-index-backing.ts

@@ -0,0 +1,37 @@
+export type BackingIndexCandidates = {
+  readonly indexes: readonly { readonly columns: readonly string[] }[];
+  readonly uniques: readonly { readonly columns: readonly string[] }[];
+  readonly primaryKey?: { readonly columns: readonly string[] } | undefined;
+};
+
+/**
+ * The column-list keys (`"colA,colB"`, order preserved) a table's own
+ * indexes, unique constraints, and primary key already back. A foreign key
+ * whose source columns join to one of these keys needs no separately
+ * derived backing index.
+ *
+ * Shared by {@link isBackedByColumnKeys}'s two callers, which must agree on
+ * what counts as "backed": `contract-to-schema-ir.ts`'s `convertTable`
+ * (deriving the FK-backing-index expectation `db verify` checks against a
+ * live database) and the postgres PSL inferrer (deciding whether an
+ * introspected relation needs an explicit `index: false`).
+ */
+export function backingIndexColumnKeys(table: BackingIndexCandidates): readonly string[] {
+  return [
+    ...table.indexes.map((index) => index.columns.join(',')),
+    ...table.uniques.map((unique) => unique.columns.join(',')),
+    ...(table.primaryKey ? [table.primaryKey.columns.join(',')] : []),
+  ];
+}
+
+/**
+ * Whether `columns`, in order, matches one of `backingKeys` (see
+ * {@link backingIndexColumnKeys}). Order-sensitive: `(a, b)` does not
+ * satisfy a backing index declared as `(b, a)`.
+ */
+export function isBackedByColumnKeys(
+  columns: readonly string[],
+  backingKeys: readonly string[],
+): boolean {
+  return backingKeys.includes(columns.join(','));
+}

package/src/core/migrations/contract-to-schema-ir.ts

@@ -1,9 +1,6 @@
 import type { ColumnDefault, Contract, JsonValue } from '@prisma-next/contract/types';
 import type { CodecRef } from '@prisma-next/framework-components/codec';
-import type {
-  MigrationPlannerConflict,
-  SchemaNodeRef,
-} from '@prisma-next/framework-components/control';
+import type { MigrationPlannerConflict } from '@prisma-next/framework-components/control';
 import {
   type CheckConstraint,
   type ForeignKey,
@@ -15,8 +12,8 @@ import {
   type StorageTypeInstance,
   type UniqueConstraint,
 } from '@prisma-next/sql-contract/types';
+import { defaultIndexName } from '@prisma-next/sql-schema-ir/naming';
 import {
-  RelationalSchemaNodeKind,
   type SqlAnnotations,
   type SqlCheckConstraintIRInput,
   type SqlColumnIRInput,
@@ -28,6 +25,7 @@ import {
 } from '@prisma-next/sql-schema-ir/types';
 import { blindCast } from '@prisma-next/utils/casts';
 import { ifDefined } from '@prisma-next/utils/defined';
+import { backingIndexColumnKeys } from '../foreign-key-index-backing';
 
 /**
  * Target-specific callback that expands a column's base `nativeType` and optional
@@ -248,15 +246,14 @@ function convertCheck(check: CheckConstraint, storage: SqlStorage): SqlCheckCons
   };
 }
 
-function convertUnique(unique: UniqueConstraint, tableName: string): SqlUniqueIRInput {
+function convertUnique(unique: UniqueConstraint): SqlUniqueIRInput {
   return {
     columns: unique.columns,
     ...ifDefined('name', unique.name),
-    dependsOn: flatColumnDependsOn(tableName, unique.columns),
   };
 }
 
-function convertIndex(index: Index, tableName: string): SqlIndexIRInput {
+function convertIndex(index: Index): SqlIndexIRInput {
   return {
     columns: index.columns,
     unique: false,
@@ -265,42 +262,9 @@ function convertIndex(index: Index, tableName: string): SqlIndexIRInput {
     // introspected side (the legacy walk read them from the contract).
     ...ifDefined('type', index.type),
     ...ifDefined('options', index.options),
-    dependsOn: flatColumnDependsOn(tableName, index.columns),
   };
 }
 
-/**
- * The referenced table's chain in the flat (single-schema) tree
- * `contractToSchemaIR`/`contractNamespaceToSchemaIR` build: the root
- * (`SqlSchemaIR`, fixed `'database'` id) followed by the table's own id.
- * Postgres discards this when it re-derives the FK against its own
- * multi-schema tree shape (`contractToPostgresDatabaseSchemaNode`); SQLite's
- * flat tree uses it as-is.
- */
-function flatSchemaDependsOn(tableName: string): SchemaNodeRef {
-  return [
-    { nodeKind: RelationalSchemaNodeKind.schema, id: 'database' },
-    { nodeKind: RelationalSchemaNodeKind.table, id: tableName },
-  ];
-}
-
-/**
- * The chains from a table-child object (foreign key, index, unique, primary
- * key) to each of the own columns it is built on, in the flat tree. Dropping
- * a covered column auto-drops the object, so the object's drop must precede
- * the column's; the graph derives that direction from these edges.
- */
-function flatColumnDependsOn(
-  tableName: string,
-  columns: readonly string[],
-): readonly SchemaNodeRef[] {
-  return columns.map((column) => [
-    { nodeKind: RelationalSchemaNodeKind.schema, id: 'database' },
-    { nodeKind: RelationalSchemaNodeKind.table, id: tableName },
-    { nodeKind: RelationalSchemaNodeKind.column, id: `column:${column}` },
-  ]);
-}
-
 /**
  * The FK's referenced-namespace identity comes from the target's namespace
  * node, not the raw namespace-id string. An unbound target namespace stamps
@@ -310,10 +274,6 @@ function flatColumnDependsOn(
  * cross-space target whose namespace lives in another contract's storage)
  * stamps its coordinate verbatim; namespaced targets (Postgres) resolve the
  * real DDL schema downstream.
- *
- * `dependsOn` carries the referenced table (created before the FK, dropped
- * after it) plus the FK's own columns (dropped after the FK, since dropping a
- * column auto-drops the FK built on it).
  */
 function convertForeignKey(fk: ForeignKey, storage: SqlStorage): SqlForeignKeyIRInput {
   const targetNamespace = storage.namespaces[fk.target.namespaceId];
@@ -326,10 +286,6 @@ function convertForeignKey(fk: ForeignKey, storage: SqlStorage): SqlForeignKeyIR
     ...ifDefined('name', fk.name),
     ...ifDefined('onDelete', fk.onDelete),
     ...ifDefined('onUpdate', fk.onUpdate),
-    dependsOn: [
-      flatSchemaDependsOn(fk.target.tableName),
-      ...flatColumnDependsOn(fk.source.tableName, fk.source.columns),
-    ],
   };
 }
 
@@ -352,32 +308,34 @@ function convertTable(
     );
   }
 
+  const satisfiedIndexColumns = new Set(backingIndexColumnKeys(table));
+  const fkBackingIndexes: SqlIndexIRInput[] = [];
+  for (const fk of table.foreignKeys) {
+    if (fk.index === false) continue;
+    const key = fk.source.columns.join(',');
+    if (satisfiedIndexColumns.has(key)) continue;
+    fkBackingIndexes.push({
+      columns: fk.source.columns,
+      unique: false,
+      name: defaultIndexName(name, fk.source.columns),
+    });
+    satisfiedIndexColumns.add(key);
+  }
+
   const checks: SqlCheckConstraintIRInput[] | undefined =
     table.checks && table.checks.length > 0
       ? table.checks.map((c) => convertCheck(c, storage))
       : undefined;
 
-  const primaryKey =
-    table.primaryKey !== undefined
-      ? {
-          columns: table.primaryKey.columns,
-          ...ifDefined('name', table.primaryKey.name),
-          dependsOn: flatColumnDependsOn(name, table.primaryKey.columns),
-        }
-      : undefined;
-
   return new SqlTableIR({
     name,
     columns,
-    ...ifDefined('primaryKey', primaryKey),
-    // #989 persists a `constraint: false` FK's absence and its backing index as
-    // discrete entities at contract construction, so every `foreignKeys[]` entry
-    // is now constraint-bearing (no filter) and each FK-backing index is already
-    // a `table.indexes[]` entry — it flows through `convertIndex` below, carrying
-    // the object→own-column `dependsOn` edge like any other index.
-    foreignKeys: table.foreignKeys.map((fk) => convertForeignKey(fk, storage)),
-    uniques: table.uniques.map((u) => convertUnique(u, name)),
-    indexes: table.indexes.map((i) => convertIndex(i, name)),
+    ...ifDefined('primaryKey', table.primaryKey),
+    foreignKeys: table.foreignKeys
+      .filter((fk) => fk.constraint !== false)
+      .map((fk) => convertForeignKey(fk, storage)),
+    uniques: table.uniques.map(convertUnique),
+    indexes: [...table.indexes.map(convertIndex), ...fkBackingIndexes],
     ...ifDefined('checks', checks),
   });
 }

package/src/core/psl-contract-infer/relation-inference.ts

@@ -1,8 +1,5 @@
-import {
-  backingIndexColumnKeys,
-  isBackedByColumnKeys,
-} from '@prisma-next/sql-contract/foreign-key-materialization';
 import type { SqlForeignKeyIR, SqlTableIR } from '@prisma-next/sql-schema-ir/types';
+import { backingIndexColumnKeys, isBackedByColumnKeys } from '../foreign-key-index-backing';
 import { deriveBackRelationFieldName, deriveRelationFieldName, pluralize } from './name-transforms';
 import type { RelationField } from './printer-config';