@rebasepro/server-postgres 0.24.0 → 0.24.1-canary.gcb918fc

package/dist/schema/generate-postgres-ddl.js

@@ -1,94 +1,23 @@
 import { createRequire as __createRequire } from "module";
 __createRequire(import.meta.url);
-import { a as generatePostgresVectorDdl, i as generatePostgresTriggersDdl, n as generatePostgresPoliciesDdl, r as generatePostgresSearchDdl, t as generatePostgresDdl } from "../generate-postgres-ddl-logic-BJsLaVNX.js";
-import { n as outError, t as out } from "../cli-output-CNdMql-L.js";
-import { loadCollectionsFromDirectory } from "@rebasepro/server";
-import { declaredDatabaseExtensions } from "@rebasepro/types";
-import * as fs$1 from "fs";
-import { promises } from "fs";
+import { r as out } from "../source-DBDbBTL4.js";
+import { r as writePostgresDdl } from "../generate-files-CdEckX6c.js";
 import path from "path";
-import { pathToFileURL } from "url";
 //#region src/schema/generate-postgres-ddl.ts
-/** Where a project declares its resources, relative to the config directory. */
-var RESOURCE_ENTRIES = [
-	"resources.ts",
-	"resources.js",
-	"resources/index.ts",
-	"resources/index.js"
-];
 /**
-* Evaluate the project's `resources.ts`, so `declaredDatabaseExtensions()` can
-* answer.
-*
-* This generator runs as its own tsx subprocess and loads only the collections
-* directory, so nothing else in it would ever import the resources module — and
-* a permission that reads as absent because nobody loaded it is the worst shape
-* this could take: the push succeeds, `vector.sql` quietly omits the
-* `CREATE EXTENSION`, and the failure lands one statement later looking like a
-* database problem.
-*
-* Imported directly rather than through the config index, for the reason
-* `boot/resource-loading.ts` gives: re-exporting from the index would work only
-* for projects that remember to.
-*
-* A project with no resources module is the normal case and declares nothing.
-* An import that *throws* is not swallowed — a resources module that does not
-* evaluate is a configuration error, and treating it as "declared nothing"
-* would turn it into a silently missing extension.
+* The generator as its own process — what `--watch` runs, because a watch has
+* to re-import the collections on every save and Node's module cache would
+* serve it the first version forever. One-shot generation runs in the driver's
+* own process instead; see `generate-files.ts`.
 */
-async function loadDeclaredResources(configDir) {
-	const entry = RESOURCE_ENTRIES.map((name) => path.join(configDir, name)).find((candidate) => fs$1.existsSync(candidate));
-	if (!entry) return;
-	await import(pathToFileURL(entry).href);
-}
 var runGeneration = async (collectionsFilePath, outputPath) => {
+	if (!collectionsFilePath) throw new Error("No collections file path provided.");
 	try {
-		if (!collectionsFilePath) throw new Error("No collections file path provided.");
-		const resolvedPath = path.resolve(collectionsFilePath);
-		await loadDeclaredResources(path.dirname(resolvedPath));
-		let collections = await loadCollectionsFromDirectory(resolvedPath);
-		if (!collections || !Array.isArray(collections)) collections = [];
-		collections.sort((a, b) => a.slug.localeCompare(b.slug));
-		const ddlContent = generatePostgresDdl(collections, {
-			includePolicies: false,
-			includeSearch: false,
-			includeVector: false
+		await writePostgresDdl({
+			collectionsPath: path.resolve(collectionsFilePath),
+			outputPath
 		});
-		const policiesContent = generatePostgresPoliciesDdl(collections);
-		const searchContent = generatePostgresSearchDdl(collections);
-		const vectorContent = generatePostgresVectorDdl(collections, { extensions: declaredDatabaseExtensions() });
-		const triggersContent = generatePostgresTriggersDdl(collections);
-		if (outputPath) {
-			const outputDir = path.dirname(outputPath);
-			await promises.mkdir(outputDir, { recursive: true });
-			await promises.writeFile(outputPath, ddlContent);
-			out(`✅ PostgreSQL DDL generated successfully at ${outputPath}`);
-			const policiesPath = path.join(outputDir, "policies.sql");
-			await promises.writeFile(policiesPath, policiesContent);
-			out(`✅ PostgreSQL Policies DDL generated successfully at ${policiesPath}`);
-			const searchPath = path.join(outputDir, "search.sql");
-			if (searchContent) {
-				await promises.writeFile(searchPath, searchContent);
-				out(`✅ PostgreSQL search DDL generated successfully at ${searchPath}`);
-			} else if (fs$1.existsSync(searchPath)) await promises.rm(searchPath);
-			const vectorPath = path.join(outputDir, "vector.sql");
-			if (vectorContent) {
-				await promises.writeFile(vectorPath, vectorContent);
-				out(`✅ PostgreSQL vector DDL generated successfully at ${vectorPath}`);
-			} else if (fs$1.existsSync(vectorPath)) await promises.rm(vectorPath);
-			const triggersPath = path.join(outputDir, "triggers.sql");
-			if (triggersContent) {
-				await promises.writeFile(triggersPath, triggersContent);
-				out(`✅ PostgreSQL trigger DDL generated successfully at ${triggersPath}`);
-			} else if (fs$1.existsSync(triggersPath)) await promises.rm(triggersPath);
-		} else {
-			out("✅ PostgreSQL DDL generated successfully.");
-			out(String(ddlContent));
-			out("\n✅ PostgreSQL Policies DDL generated successfully.");
-			out(String(policiesContent));
-		}
 	} catch (error) {
-		outError(`Error generating DDL schema: ${error instanceof Error ? error.stack ?? error.message : String(error)}`);
 		process.exitCode = 1;
 		throw error;
 	}

package/dist/schema/generate-postgres-ddl.js.map

@@ -1 +1 @@
-{"version":3,"file":"generate-postgres-ddl.js","names":[],"sources":["../../src/schema/generate-postgres-ddl.ts","../../src/schema/bin/generate-postgres-ddl.ts"],"sourcesContent":["import { promises as fsPromises } from \"fs\";\nimport * as fs from \"fs\";\nimport path from \"path\";\nimport { pathToFileURL } from \"url\";\nimport {\n    generatePostgresDdl,\n    generatePostgresPoliciesDdl,\n    generatePostgresSearchDdl,\n    generatePostgresTriggersDdl,\n    generatePostgresVectorDdl\n} from \"./generate-postgres-ddl-logic\";\nimport { CollectionConfig, declaredDatabaseExtensions } from \"@rebasepro/types\";\nimport { loadCollectionsFromDirectory } from \"@rebasepro/server\";\nimport { out, outError } from \"../cli-output\";\n\n/** Where a project declares its resources, relative to the config directory. */\nconst RESOURCE_ENTRIES = [\"resources.ts\", \"resources.js\", \"resources/index.ts\", \"resources/index.js\"];\n\n/**\n * Evaluate the project's `resources.ts`, so `declaredDatabaseExtensions()` can\n * answer.\n *\n * This generator runs as its own tsx subprocess and loads only the collections\n * directory, so nothing else in it would ever import the resources module — and\n * a permission that reads as absent because nobody loaded it is the worst shape\n * this could take: the push succeeds, `vector.sql` quietly omits the\n * `CREATE EXTENSION`, and the failure lands one statement later looking like a\n * database problem.\n *\n * Imported directly rather than through the config index, for the reason\n * `boot/resource-loading.ts` gives: re-exporting from the index would work only\n * for projects that remember to.\n *\n * A project with no resources module is the normal case and declares nothing.\n * An import that *throws* is not swallowed — a resources module that does not\n * evaluate is a configuration error, and treating it as \"declared nothing\"\n * would turn it into a silently missing extension.\n */\nasync function loadDeclaredResources(configDir: string): Promise<void> {\n    const entry = RESOURCE_ENTRIES\n        .map(name => path.join(configDir, name))\n        .find(candidate => fs.existsSync(candidate));\n    if (!entry) return;\n    await import(pathToFileURL(entry).href);\n}\n\nconst runGeneration = async (collectionsFilePath?: string, outputPath?: string) => {\n    try {\n        if (!collectionsFilePath) {\n            throw new Error(\"No collections file path provided.\");\n        }\n\n        const resolvedPath = path.resolve(collectionsFilePath);\n\n        // `<config>/collections` is the path this is given, so the config\n        // directory is its parent — the same relationship `rebase resources`\n        // and the boot loader assume.\n        await loadDeclaredResources(path.dirname(resolvedPath));\n\n        // Shared with the runtime and the doctor: what gets generated here must\n        // be exactly what the server serves, including directory-level defaults.\n        let collections: CollectionConfig[] = await loadCollectionsFromDirectory(resolvedPath);\n\n\n        if (!collections || !Array.isArray(collections)) {\n            collections = [];\n        }\n\n        // Sort collections by slug alphabetically to ensure deterministic DDL generation\n        collections.sort((a, b) => a.slug.localeCompare(b.slug));\n\n        // `schema.sql` is Atlas's desired state, and it carries neither the RLS\n        // policies, nor the search apparatus, nor the vector columns: Atlas\n        // manages none of them, and in the search and vector cases cannot. All\n        // three are written beside it and applied by the CLI in their own right.\n        const ddlContent = generatePostgresDdl(collections, {\n            includePolicies: false,\n            includeSearch: false,\n            includeVector: false\n        });\n        const policiesContent = generatePostgresPoliciesDdl(collections);\n        const searchContent = generatePostgresSearchDdl(collections);\n        const vectorContent = generatePostgresVectorDdl(collections, {\n            extensions: declaredDatabaseExtensions()\n        });\n        const triggersContent = generatePostgresTriggersDdl(collections);\n\n        if (outputPath) {\n            const outputDir = path.dirname(outputPath);\n            await fsPromises.mkdir(outputDir, { recursive: true });\n            await fsPromises.writeFile(outputPath, ddlContent);\n            out(`✅ PostgreSQL DDL generated successfully at ${outputPath}`);\n\n            const policiesPath = path.join(outputDir, \"policies.sql\");\n            await fsPromises.writeFile(policiesPath, policiesContent);\n            out(`✅ PostgreSQL Policies DDL generated successfully at ${policiesPath}`);\n\n            // Removed when the last `search` block goes: the CLI applies this\n            // file whenever it exists, and a stale one would keep re-creating\n            // functions for collections that no longer want them.\n            const searchPath = path.join(outputDir, \"search.sql\");\n            if (searchContent) {\n                await fsPromises.writeFile(searchPath, searchContent);\n                out(`✅ PostgreSQL search DDL generated successfully at ${searchPath}`);\n            } else if (fs.existsSync(searchPath)) {\n                await fsPromises.rm(searchPath);\n            }\n\n            // Removed when the last `vector` property goes, for the same reason\n            // `search.sql` is: the CLI applies whichever of these files exists,\n            // and a stale one would keep re-adding a column the collections no\n            // longer declare — which Atlas, no longer told to exclude it, would\n            // then plan a DROP for on the very next push.\n            const vectorPath = path.join(outputDir, \"vector.sql\");\n            if (vectorContent) {\n                await fsPromises.writeFile(vectorPath, vectorContent);\n                out(`✅ PostgreSQL vector DDL generated successfully at ${vectorPath}`);\n            } else if (fs.existsSync(vectorPath)) {\n                await fsPromises.rm(vectorPath);\n            }\n\n            // `autoValue: \"on_update\"`, on the same terms as the two above: a\n            // trigger is a function plus a binding, which Atlas's free tier\n            // will not parse, and a stale file would keep re-installing a\n            // trigger for a column nothing declares any more.\n            const triggersPath = path.join(outputDir, \"triggers.sql\");\n            if (triggersContent) {\n                await fsPromises.writeFile(triggersPath, triggersContent);\n                out(`✅ PostgreSQL trigger DDL generated successfully at ${triggersPath}`);\n            } else if (fs.existsSync(triggersPath)) {\n                await fsPromises.rm(triggersPath);\n            }\n        } else {\n            out(\"✅ PostgreSQL DDL generated successfully.\");\n            out(String(ddlContent));\n            out(\"\\n✅ PostgreSQL Policies DDL generated successfully.\");\n            out(String(policiesContent));\n        }\n\n    } catch (error) {\n        outError(`Error generating DDL schema: ${error instanceof Error ? (error.stack ?? error.message) : String(error)}`);\n        // Step 1 of `rebase db push` is this process, and its exit code is the\n        // only thing the push reads. Printing and exiting 0 made a resources\n        // module that does not evaluate — the single most common cause here —\n        // report `✓ rebase db push completed successfully` while Atlas applied\n        // whatever `drizzle/schema.sql` happened to be on disk, sometimes\n        // minutes old. With no prior file the same run died inside Atlas on\n        // `stat drizzle/schema.sql: no such file or directory`, which hides the\n        // real cause two screens up.\n        process.exitCode = 1;\n        throw error;\n    }\n};\n\nexport const main = async () => {\n    const collectionsFilePathArg = process.argv.find(arg => arg.startsWith(\"--collections=\"));\n    const collectionsFilePath = collectionsFilePathArg ? collectionsFilePathArg.split(\"=\")[1] : process.argv[2];\n\n    const outputPathArg = process.argv.find(arg => arg.startsWith(\"--output=\"));\n    const outputPath = outputPathArg ? outputPathArg.split(\"=\")[1] : undefined;\n\n    const watch = process.argv.includes(\"--watch\");\n\n    if (!collectionsFilePath) {\n        out(\"Usage: ts-node generate-postgres-ddl.ts <path-to-collections-file> [--output <path-to-output-file>] [--watch]\");\n        return;\n    }\n\n    const resolvedPath = path.resolve(process.cwd(), collectionsFilePath);\n    const resolvedOutputPath = outputPath ? path.resolve(process.cwd(), outputPath) : undefined;\n\n    if (watch) {\n        out(`Watching for changes in ${resolvedPath}...`);\n        // Imported here rather than at module scope, and this is not a style\n        // choice: chokidar is needed only by `--watch`, which is a\n        // schema-authoring path that never runs inside the runtime image. A\n        // top-level import puts it on the boot path of the published driver\n        // bundle, and the image installs a hand-listed set of runtime\n        // dependencies that does not include it — so the whole driver failed to\n        // load with \"Cannot find package 'chokidar'\", and every self-hosted\n        // container answered 500 with a stack trace about a file watcher.\n        //\n        // Same reasoning the image already applies to @ariga/atlas: an\n        // authoring-only dependency does not belong on a boot path.\n        const { default: chokidar } = await import(\"chokidar\");\n        const watcher = chokidar.watch(resolvedPath, {\n            persistent: true,\n            ignoreInitial: false\n        });\n\n        watcher.on(\"all\", (event, filePath) => {\n            out(`[${event}] ${filePath}. Regenerating DDL schema...`);\n            // A watch session outlives a bad edit: the cause is already on\n            // stderr, and the next save is the retry. Only the one-shot run\n            // below turns a failure into an exit code.\n            void runGeneration(resolvedPath, resolvedOutputPath).catch(() => undefined);\n        });\n    } else {\n        await runGeneration(resolvedPath, resolvedOutputPath);\n    }\n};\n\n// This check ensures the script only runs when executed directly\nif (import.meta.url.endsWith(process.argv[1])) {\n    // `runGeneration` has already printed the cause and set the exit code; the\n    // handler is here so the last thing on the terminal is that message rather\n    // than Node's unhandled-rejection dump of the same stack.\n    main().catch(() => {\n        process.exitCode = 1;\n    });\n}\n","/**\n * The built entry point for `generate-postgres-ddl`.\n *\n * `generate-postgres-ddl.ts` guards its own `main()` with\n * `import.meta.url.endsWith(process.argv[1])`, because `src/index.ts` re-exports\n * the module and importing the driver must not run the generator. That guard is\n * correct when the file IS the process entry — which is how it runs from source\n * under tsx — and silently false once the module is bundled: the executed file\n * is a stub, the code lives in a shared chunk, and the chunk's `import.meta.url`\n * is not the stub's path. The generator then did nothing, exited 0, and the\n * caller reported success over an unwritten schema.\n *\n * So the built path gets an entry that says what it means.\n */\nimport { main } from \"../generate-postgres-ddl\";\n\nmain().catch(() => {\n    process.exitCode = 1;\n});\n"],"mappings":";;;;;;;;;;;;AAgBA,IAAM,mBAAmB;CAAC;CAAgB;CAAgB;CAAsB;AAAoB;;;;;;;;;;;;;;;;;;;;;AAsBpG,eAAe,sBAAsB,WAAkC;CACnE,MAAM,QAAQ,iBACT,KAAI,SAAQ,KAAK,KAAK,WAAW,IAAI,CAAC,CAAC,CACvC,MAAK,cAAa,KAAG,WAAW,SAAS,CAAC;CAC/C,IAAI,CAAC,OAAO;CACZ,MAAM,OAAO,cAAc,KAAK,CAAC,CAAC;AACtC;AAEA,IAAM,gBAAgB,OAAO,qBAA8B,eAAwB;CAC/E,IAAI;EACA,IAAI,CAAC,qBACD,MAAM,IAAI,MAAM,oCAAoC;EAGxD,MAAM,eAAe,KAAK,QAAQ,mBAAmB;EAKrD,MAAM,sBAAsB,KAAK,QAAQ,YAAY,CAAC;EAItD,IAAI,cAAkC,MAAM,6BAA6B,YAAY;EAGrF,IAAI,CAAC,eAAe,CAAC,MAAM,QAAQ,WAAW,GAC1C,cAAc,CAAC;EAInB,YAAY,MAAM,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;EAMvD,MAAM,aAAa,oBAAoB,aAAa;GAChD,iBAAiB;GACjB,eAAe;GACf,eAAe;EACnB,CAAC;EACD,MAAM,kBAAkB,4BAA4B,WAAW;EAC/D,MAAM,gBAAgB,0BAA0B,WAAW;EAC3D,MAAM,gBAAgB,0BAA0B,aAAa,EACzD,YAAY,2BAA2B,EAC3C,CAAC;EACD,MAAM,kBAAkB,4BAA4B,WAAW;EAE/D,IAAI,YAAY;GACZ,MAAM,YAAY,KAAK,QAAQ,UAAU;GACzC,MAAM,SAAW,MAAM,WAAW,EAAE,WAAW,KAAK,CAAC;GACrD,MAAM,SAAW,UAAU,YAAY,UAAU;GACjD,IAAI,8CAA8C,YAAY;GAE9D,MAAM,eAAe,KAAK,KAAK,WAAW,cAAc;GACxD,MAAM,SAAW,UAAU,cAAc,eAAe;GACxD,IAAI,uDAAuD,cAAc;GAKzE,MAAM,aAAa,KAAK,KAAK,WAAW,YAAY;GACpD,IAAI,eAAe;IACf,MAAM,SAAW,UAAU,YAAY,aAAa;IACpD,IAAI,qDAAqD,YAAY;GACzE,OAAO,IAAI,KAAG,WAAW,UAAU,GAC/B,MAAM,SAAW,GAAG,UAAU;GAQlC,MAAM,aAAa,KAAK,KAAK,WAAW,YAAY;GACpD,IAAI,eAAe;IACf,MAAM,SAAW,UAAU,YAAY,aAAa;IACpD,IAAI,qDAAqD,YAAY;GACzE,OAAO,IAAI,KAAG,WAAW,UAAU,GAC/B,MAAM,SAAW,GAAG,UAAU;GAOlC,MAAM,eAAe,KAAK,KAAK,WAAW,cAAc;GACxD,IAAI,iBAAiB;IACjB,MAAM,SAAW,UAAU,cAAc,eAAe;IACxD,IAAI,sDAAsD,cAAc;GAC5E,OAAO,IAAI,KAAG,WAAW,YAAY,GACjC,MAAM,SAAW,GAAG,YAAY;EAExC,OAAO;GACH,IAAI,0CAA0C;GAC9C,IAAI,OAAO,UAAU,CAAC;GACtB,IAAI,qDAAqD;GACzD,IAAI,OAAO,eAAe,CAAC;EAC/B;CAEJ,SAAS,OAAO;EACZ,SAAS,gCAAgC,iBAAiB,QAAS,MAAM,SAAS,MAAM,UAAW,OAAO,KAAK,GAAG;EASlH,QAAQ,WAAW;EACnB,MAAM;CACV;AACJ;AAEA,IAAa,OAAO,YAAY;CAC5B,MAAM,yBAAyB,QAAQ,KAAK,MAAK,QAAO,IAAI,WAAW,gBAAgB,CAAC;CACxF,MAAM,sBAAsB,yBAAyB,uBAAuB,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,KAAK;CAEzG,MAAM,gBAAgB,QAAQ,KAAK,MAAK,QAAO,IAAI,WAAW,WAAW,CAAC;CAC1E,MAAM,aAAa,gBAAgB,cAAc,MAAM,GAAG,CAAC,CAAC,KAAK,KAAA;CAEjE,MAAM,QAAQ,QAAQ,KAAK,SAAS,SAAS;CAE7C,IAAI,CAAC,qBAAqB;EACtB,IAAI,+GAA+G;EACnH;CACJ;CAEA,MAAM,eAAe,KAAK,QAAQ,QAAQ,IAAI,GAAG,mBAAmB;CACpE,MAAM,qBAAqB,aAAa,KAAK,QAAQ,QAAQ,IAAI,GAAG,UAAU,IAAI,KAAA;CAElF,IAAI,OAAO;EACP,IAAI,2BAA2B,aAAa,IAAI;EAYhD,MAAM,EAAE,SAAS,aAAa,MAAM,OAAO;EAM3C,SALyB,MAAM,cAAc;GACzC,YAAY;GACZ,eAAe;EACnB,CAEA,CAAA,CAAQ,GAAG,QAAQ,OAAO,aAAa;GACnC,IAAI,IAAI,MAAM,IAAI,SAAS,6BAA6B;GAIxD,cAAmB,cAAc,kBAAkB,CAAC,CAAC,YAAY,KAAA,CAAS;EAC9E,CAAC;CACL,OACI,MAAM,cAAc,cAAc,kBAAkB;AAE5D;AAGA,IAAI,OAAO,KAAK,IAAI,SAAS,QAAQ,KAAK,EAAE,GAIxC,KAAK,CAAC,CAAC,YAAY;CACf,QAAQ,WAAW;AACvB,CAAC;;;;;;;;;;;;;;;;;ACjML,KAAK,CAAC,CAAC,YAAY;CACf,QAAQ,WAAW;AACvB,CAAC"}
+{"version":3,"file":"generate-postgres-ddl.js","names":[],"sources":["../../src/schema/generate-postgres-ddl.ts","../../src/schema/bin/generate-postgres-ddl.ts"],"sourcesContent":["import path from \"path\";\nimport { out } from \"../cli-output\";\nimport { writePostgresDdl } from \"./generate-files\";\n\n/**\n * The generator as its own process — what `--watch` runs, because a watch has\n * to re-import the collections on every save and Node's module cache would\n * serve it the first version forever. One-shot generation runs in the driver's\n * own process instead; see `generate-files.ts`.\n */\nconst runGeneration = async (collectionsFilePath?: string, outputPath?: string) => {\n    if (!collectionsFilePath) {\n        throw new Error(\"No collections file path provided.\");\n    }\n    try {\n        await writePostgresDdl({ collectionsPath: path.resolve(collectionsFilePath), outputPath });\n    } catch (error) {\n        // A caller that reads nothing but this process's exit code must not\n        // see 0 after an error was printed — see `writePostgresDdl`.\n        process.exitCode = 1;\n        throw error;\n    }\n};\n\nexport const main = async () => {\n    const collectionsFilePathArg = process.argv.find(arg => arg.startsWith(\"--collections=\"));\n    const collectionsFilePath = collectionsFilePathArg ? collectionsFilePathArg.split(\"=\")[1] : process.argv[2];\n\n    const outputPathArg = process.argv.find(arg => arg.startsWith(\"--output=\"));\n    const outputPath = outputPathArg ? outputPathArg.split(\"=\")[1] : undefined;\n\n    const watch = process.argv.includes(\"--watch\");\n\n    if (!collectionsFilePath) {\n        out(\"Usage: ts-node generate-postgres-ddl.ts <path-to-collections-file> [--output <path-to-output-file>] [--watch]\");\n        return;\n    }\n\n    const resolvedPath = path.resolve(process.cwd(), collectionsFilePath);\n    const resolvedOutputPath = outputPath ? path.resolve(process.cwd(), outputPath) : undefined;\n\n    if (watch) {\n        out(`Watching for changes in ${resolvedPath}...`);\n        // Imported here rather than at module scope, and this is not a style\n        // choice: chokidar is needed only by `--watch`, which is a\n        // schema-authoring path that never runs inside the runtime image. A\n        // top-level import puts it on the boot path of the published driver\n        // bundle, and the image installs a hand-listed set of runtime\n        // dependencies that does not include it — so the whole driver failed to\n        // load with \"Cannot find package 'chokidar'\", and every self-hosted\n        // container answered 500 with a stack trace about a file watcher.\n        //\n        // Same reasoning the image already applies to @ariga/atlas: an\n        // authoring-only dependency does not belong on a boot path.\n        const { default: chokidar } = await import(\"chokidar\");\n        const watcher = chokidar.watch(resolvedPath, {\n            persistent: true,\n            ignoreInitial: false\n        });\n\n        watcher.on(\"all\", (event, filePath) => {\n            out(`[${event}] ${filePath}. Regenerating DDL schema...`);\n            // A watch session outlives a bad edit: the cause is already on\n            // stderr, and the next save is the retry. Only the one-shot run\n            // below turns a failure into an exit code.\n            void runGeneration(resolvedPath, resolvedOutputPath).catch(() => undefined);\n        });\n    } else {\n        await runGeneration(resolvedPath, resolvedOutputPath);\n    }\n};\n\n// This check ensures the script only runs when executed directly\nif (import.meta.url.endsWith(process.argv[1])) {\n    // `runGeneration` has already printed the cause and set the exit code; the\n    // handler is here so the last thing on the terminal is that message rather\n    // than Node's unhandled-rejection dump of the same stack.\n    main().catch(() => {\n        process.exitCode = 1;\n    });\n}\n","/**\n * The built entry point for `generate-postgres-ddl`.\n *\n * `generate-postgres-ddl.ts` guards its own `main()` with\n * `import.meta.url.endsWith(process.argv[1])`, because `src/index.ts` re-exports\n * the module and importing the driver must not run the generator. That guard is\n * correct when the file IS the process entry — which is how it runs from source\n * under tsx — and silently false once the module is bundled: the executed file\n * is a stub, the code lives in a shared chunk, and the chunk's `import.meta.url`\n * is not the stub's path. The generator then did nothing, exited 0, and the\n * caller reported success over an unwritten schema.\n *\n * So the built path gets an entry that says what it means.\n */\nimport { main } from \"../generate-postgres-ddl\";\n\nmain().catch(() => {\n    process.exitCode = 1;\n});\n"],"mappings":";;;;;;;;;;;;AAUA,IAAM,gBAAgB,OAAO,qBAA8B,eAAwB;CAC/E,IAAI,CAAC,qBACD,MAAM,IAAI,MAAM,oCAAoC;CAExD,IAAI;EACA,MAAM,iBAAiB;GAAE,iBAAiB,KAAK,QAAQ,mBAAmB;GAAG;EAAW,CAAC;CAC7F,SAAS,OAAO;EAGZ,QAAQ,WAAW;EACnB,MAAM;CACV;AACJ;AAEA,IAAa,OAAO,YAAY;CAC5B,MAAM,yBAAyB,QAAQ,KAAK,MAAK,QAAO,IAAI,WAAW,gBAAgB,CAAC;CACxF,MAAM,sBAAsB,yBAAyB,uBAAuB,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,KAAK;CAEzG,MAAM,gBAAgB,QAAQ,KAAK,MAAK,QAAO,IAAI,WAAW,WAAW,CAAC;CAC1E,MAAM,aAAa,gBAAgB,cAAc,MAAM,GAAG,CAAC,CAAC,KAAK,KAAA;CAEjE,MAAM,QAAQ,QAAQ,KAAK,SAAS,SAAS;CAE7C,IAAI,CAAC,qBAAqB;EACtB,IAAI,+GAA+G;EACnH;CACJ;CAEA,MAAM,eAAe,KAAK,QAAQ,QAAQ,IAAI,GAAG,mBAAmB;CACpE,MAAM,qBAAqB,aAAa,KAAK,QAAQ,QAAQ,IAAI,GAAG,UAAU,IAAI,KAAA;CAElF,IAAI,OAAO;EACP,IAAI,2BAA2B,aAAa,IAAI;EAYhD,MAAM,EAAE,SAAS,aAAa,MAAM,OAAO;EAM3C,SALyB,MAAM,cAAc;GACzC,YAAY;GACZ,eAAe;EACnB,CAEA,CAAA,CAAQ,GAAG,QAAQ,OAAO,aAAa;GACnC,IAAI,IAAI,MAAM,IAAI,SAAS,6BAA6B;GAIxD,cAAmB,cAAc,kBAAkB,CAAC,CAAC,YAAY,KAAA,CAAS;EAC9E,CAAC;CACL,OACI,MAAM,cAAc,cAAc,kBAAkB;AAE5D;AAGA,IAAI,OAAO,KAAK,IAAI,SAAS,QAAQ,KAAK,EAAE,GAIxC,KAAK,CAAC,CAAC,YAAY;CACf,QAAQ,WAAW;AACvB,CAAC;;;;;;;;;;;;;;;;;AC/DL,KAAK,CAAC,CAAC,YAAY;CACf,QAAQ,WAAW;AACvB,CAAC"}

package/dist/schema/introspect-db-logic.d.ts

@@ -56,6 +56,11 @@ export interface UniqueConstraintRow {
     constraint_name: string;
     column_names: string[];
 }
+/** One index, by name. */
+export interface IndexRow {
+    table_name: string;
+    index_name: string;
+}
 /** A CHECK constraint, as `pg_get_constraintdef` renders it. */
 export interface CheckConstraintRow {
     table_name: string;
@@ -83,6 +88,13 @@ export interface SchemaMetadata {
     pks: PrimaryKeyRow[];
     fks: ForeignKeyRow[];
     uniques: UniqueConstraintRow[];
+    /**
+     * Every index on the introspected tables, by name — how a foreign key
+     * whose column Rebase would index is told apart from one it already has.
+     * Absent when the caller did not read them, and then nothing is said
+     * about foreign-key indexes either way.
+     */
+    indexes?: IndexRow[];
     checks: CheckConstraintRow[];
     comments: CommentRow[];
     /**

package/dist/schema/introspect-db-queries.d.ts

@@ -116,6 +116,12 @@ export declare const FOREIGN_KEYS_QUERY = "\n    WITH fk AS (\n        SELECT co
  * `validation: { unique: true }` field makes.
  */
 export declare const UNIQUE_CONSTRAINTS_QUERY = "\n    SELECT t.relname AS table_name,\n           ic.relname AS constraint_name,\n           -- ::text, because the driver has no parser for an array of `name`\n           -- and hands back the raw `{a,b}` literal as a string. Every consumer\n           -- here indexes and compares it as an array, and a string of that\n           -- shape fails those silently rather than loudly.\n           array_agg(a.attname::text ORDER BY k.ord) AS column_names\n    FROM pg_index i\n    JOIN pg_class t ON t.oid = i.indrelid\n    JOIN pg_class ic ON ic.oid = i.indexrelid\n    JOIN pg_namespace n ON n.oid = t.relnamespace\n    CROSS JOIN LATERAL unnest(i.indkey) WITH ORDINALITY AS k(attnum, ord)\n    JOIN pg_attribute a ON a.attrelid = i.indrelid AND a.attnum = k.attnum\n    WHERE i.indisunique\n      AND NOT i.indisprimary\n      AND i.indpred IS NULL\n      AND n.nspname = $1\n      AND NOT t.relispartition\n    GROUP BY t.relname, ic.relname\n    ORDER BY t.relname, ic.relname\n";
+/**
+ * Every index on the schema's tables, by name. Only the name is needed: it is
+ * what tells a foreign key Rebase already indexed apart from one it would
+ * index on the first push — see `foreignKeyIndexSpec`.
+ */
+export declare const INDEXES_QUERY = "\n    SELECT t.relname AS table_name, ic.relname AS index_name\n    FROM pg_index i\n    JOIN pg_class t ON t.oid = i.indrelid\n    JOIN pg_class ic ON ic.oid = i.indexrelid\n    JOIN pg_namespace n ON n.oid = t.relnamespace\n    WHERE n.nspname = $1\n      AND NOT t.relispartition\n    ORDER BY t.relname, ic.relname\n";
 /**
  * CHECK constraints, as the source text Postgres reproduces them from.
  *
@@ -127,8 +133,12 @@ export declare const CHECK_CONSTRAINTS_QUERY = "\n    SELECT DISTINCT\n
 /**
  * `COMMENT ON TABLE` / `COMMENT ON COLUMN`, which is documentation the author
  * already wrote and which nothing downstream has ever read.
+ *
+ * Only comments on relations: `pg_description` also holds the stamps boot
+ * writes on each policy (`rebase:<hash>`), and an OID is unique only within
+ * its own catalogue, so a policy's could name a table.
  */
-export declare const COMMENTS_QUERY = "\n    SELECT t.relname AS table_name,\n           a.attname AS column_name,\n           d.description AS comment\n    FROM pg_description d\n    JOIN pg_class t ON t.oid = d.objoid\n    JOIN pg_namespace n ON n.oid = t.relnamespace\n    LEFT JOIN pg_attribute a ON a.attrelid = t.oid AND a.attnum = d.objsubid\n    WHERE n.nspname = $1\n      AND t.relkind IN ('r', 'p')\n      AND (d.objsubid = 0 OR a.attname IS NOT NULL)\n    ORDER BY t.relname, d.objsubid\n";
+export declare const COMMENTS_QUERY = "\n    SELECT t.relname AS table_name,\n           a.attname AS column_name,\n           d.description AS comment\n    FROM pg_description d\n    JOIN pg_class t ON t.oid = d.objoid\n    JOIN pg_namespace n ON n.oid = t.relnamespace\n    LEFT JOIN pg_attribute a ON a.attrelid = t.oid AND a.attnum = d.objsubid\n    WHERE n.nspname = $1\n      AND d.classoid = 'pg_catalog.pg_class'::regclass\n      AND t.relkind IN ('r', 'p')\n      AND (d.objsubid = 0 OR a.attname IS NOT NULL)\n    ORDER BY t.relname, d.objsubid\n";
 /**
  * Counts a table's rows, stopping once the answer can only be "more than
  * `limit`".

package/dist/schema/introspect-db-structure.d.ts

@@ -240,6 +240,16 @@ export declare function deriveTitleProperty(facts: Map<string, ColumnFacts>): st
  * is stable across runs.
  */
 export declare function deriveKanbanProperty(facts: Map<string, ColumnFacts>): string | undefined;
+/**
+ * The string column that can hold a board's card order, or nothing.
+ *
+ * A board without `orderProperty` cannot keep a card's position within a
+ * column, and the config validator says so on every generate — so a board is
+ * emitted only when the table already has somewhere to store the order. A
+ * legacy table almost never does; asking its owner to add a hidden column
+ * just to satisfy generated output was the wrong way round.
+ */
+export declare function deriveKanbanOrderProperty(facts: Map<string, ColumnFacts>): string | undefined;
 /**
  * The column a list should be sorted by, newest first.
  *

package/dist/schema/introspect-db.js

@@ -1,14 +1,13 @@
 import { createRequire as __createRequire } from "module";
 __createRequire(import.meta.url);
 import { a as __toESM, t as require___vite_browser_external } from "../__vite-browser-external-BnuHet1e.js";
-import { i as readSchemaMetadata, n as isUsableFileName, r as quoteRelation, t as countRowsUpTo } from "../introspect-db-queries-C_Q5VgQw.js";
-import { n as outError, r as outWarn, t as out } from "../cli-output-CNdMql-L.js";
-import { t as chalk } from "../source-Br7L7GOI.js";
-import { a as compositeKeySkipReason, d as safeHostFromUrl, i as buildTablesMap, m as lookupCandidates, o as generateCollectionFile, p as classifyTables, r as buildEnumMap, s as generateIndexContent, u as mergeIndexContent } from "../introspect-db-logic-kCETE8TY.js";
+import { a as outWarn, i as outError, r as out, t as chalk } from "../source-DBDbBTL4.js";
+import { i as readSchemaMetadata, n as isUsableFileName, r as quoteRelation, t as countRowsUpTo } from "../introspect-db-queries-D6kAqReI.js";
+import { a as compositeKeySkipReason, d as safeHostFromUrl, i as buildTablesMap, m as lookupCandidates, o as generateCollectionFile, p as classifyTables, r as buildEnumMap, s as generateIndexContent, u as mergeIndexContent } from "../introspect-db-logic-C-Di8dA9.js";
 import { t as require_arg } from "../arg-Dni7MzLB.js";
 import pg from "pg";
-import fs from "fs";
 import path from "path";
+import fs from "fs";
 import * as dotenv from "dotenv";
 //#region src/schema/introspect-db-project.ts
 var import___vite_browser_external = /* @__PURE__ */ __toESM(require___vite_browser_external(), 1);

package/dist/schema/introspect-db.js.map

@@ -1 +1 @@
-{"version":3,"file":"introspect-db.js","names":[],"sources":["../../src/schema/introspect-db-project.ts","../../src/schema/introspect-db-constraints.ts","../../src/schema/introspect-db.ts"],"sourcesContent":["/**\n * What the project being introspected into can actually import.\n *\n * The generator is pure — `introspect-db-logic.ts` reads no files — so the one\n * question it cannot answer for itself lives here: which `defineCollection`, if\n * any, will resolve from the directory the collections are written to.\n */\nimport fs from \"fs\";\nimport path from \"path\";\n\nimport { ADMIN_TYPES_PACKAGE, COMMON_PACKAGE, type CollectionBuilder } from \"./introspect-db-logic\";\n\n/** How far up to look before giving up, if no project root announces itself. */\nconst MAX_LEVELS = 8;\n\n/** Every dependency name a manifest declares, in any of the three fields. */\nfunction declaredDependencies(manifestPath: string): Set<string> {\n    const names = new Set<string>();\n    let parsed: unknown;\n    try {\n        parsed = JSON.parse(fs.readFileSync(manifestPath, \"utf-8\"));\n    } catch {\n        // A malformed or unreadable package.json is not this function's problem\n        // to report — it answers \"can this import resolve\", and the answer is no.\n        return names;\n    }\n    if (typeof parsed !== \"object\" || parsed === null) return names;\n    const manifest = parsed as Record<string, unknown>;\n    for (const field of [\"dependencies\", \"devDependencies\", \"peerDependencies\"]) {\n        const block = manifest[field];\n        if (typeof block === \"object\" && block !== null) {\n            for (const name of Object.keys(block)) names.add(name);\n        }\n    }\n    return names;\n}\n\n/**\n * Which `defineCollection` to generate against, for collections written to `outDir`.\n *\n * **The detection is the package manifests above the output directory**, unioned from\n * `outDir` up to and including the project root — the first ancestor holding a\n * `rebase.json`, or `MAX_LEVELS` up if there is none.\n *\n * That is the rule Node itself applies: a file in `config/collections` resolves a bare\n * specifier through `config/node_modules`, then `<project>/node_modules`, and so on up.\n * Reading the manifests along that same path answers the only question that matters —\n * *will this import resolve in the project I am writing into* — from the state on disk\n * at the moment of generation. The alternatives are all proxies for it: `rebase.json`'s\n * `apps` block says a CMS scaffold declared an admin app, and a `frontend/` directory\n * says one was scaffolded, but neither is what the compiler consults, and either can be\n * true of a project whose `config` package does not depend on `@rebasepro/cms-types`.\n *\n * Ambiguity resolves towards the admin panel: a project that declares both packages has\n * a panel, and `@rebasepro/cms-types` is the flavour that keeps the `admin` block.\n */\nexport function detectCollectionBuilder(outDir: string): CollectionBuilder {\n    let dir = path.resolve(outDir);\n    const declared = new Set<string>();\n\n    for (let level = 0; level < MAX_LEVELS; level++) {\n        const manifest = path.join(dir, \"package.json\");\n        if (fs.existsSync(manifest)) {\n            for (const name of declaredDependencies(manifest)) declared.add(name);\n        }\n        // The project root, and the last level worth reading: anything above it\n        // belongs to whatever the project happens to be checked out inside.\n        if (fs.existsSync(path.join(dir, \"rebase.json\"))) break;\n\n        const parent = path.dirname(dir);\n        if (parent === dir) break;\n        dir = parent;\n    }\n\n    if (declared.has(ADMIN_TYPES_PACKAGE)) return \"admin-types\";\n    if (declared.has(COMMON_PACKAGE)) return \"common\";\n    return \"annotation\";\n}\n","/**\n * Reading validation rules out of CHECK constraints.\n *\n * A CHECK constraint is the schema author stating a rule the database already\n * enforces. Introspection has never read them, so a generated form let the user\n * type a value the database was always going to reject — the rule was written\n * down, in the schema, and the UI asked anyway.\n *\n * Everything here parses the *normalized* text `pg_get_constraintdef` produces,\n * not what the author typed: Postgres re-renders the expression from its parse\n * tree, so `CHECK (price > 0)` on a `numeric` column always comes back as\n * `CHECK ((price > (0)::numeric))`. That normalization is what makes a\n * string-level parser tractable — the input is generated, and the shapes are\n * few.\n *\n * Constraints this cannot read are skipped in full. A partially-understood\n * constraint is worse than an unread one: it would produce validation that\n * *narrows* differently from the database, so a value the UI accepts still\n * fails on write, or — worse — a value the database allows is refused in the\n * form with no way to see why.\n *\n * Pure module: no I/O, no logging.\n */\nimport type { CheckConstraintRow } from \"./introspect-db-logic\";\n\n/** What a table's CHECK constraints say about one column. */\nexport interface ColumnCheckFacts {\n    /** Allowed values, from `IN (…)` / `= ANY (ARRAY[…])` / `= 'literal'`. */\n    enumValues?: string[];\n    /** `x >= n` */\n    min?: number;\n    /** `x <= n` */\n    max?: number;\n    /** `x > n` */\n    moreThan?: number;\n    /** `x < n` */\n    lessThan?: number;\n    /** `length(x) >= n` */\n    lengthMin?: number;\n    /** `length(x) <= n` */\n    lengthMax?: number;\n}\n\n/** Per-table, per-column facts. */\nexport type CheckFactsByTable = Map<string, Map<string, ColumnCheckFacts>>;\n\n/** The length functions whose argument is the column being constrained. */\nconst LENGTH_FUNCTIONS = new Set([\"length\", \"char_length\", \"character_length\", \"octet_length\"]);\n\n/**\n * Splits on a separator that appears at paren depth 0 and outside string\n * literals.\n *\n * Depth tracking is the whole job: `ARRAY['a', 'b']` contains a comma that must\n * not split the enclosing argument list, and `'it''s'` contains a quote that\n * must not end the literal.\n */\nfunction splitTopLevel(input: string, separator: string): string[] {\n    const parts: string[] = [];\n    let depth = 0;\n    let inString = false;\n    let current = \"\";\n\n    for (let i = 0; i < input.length; i++) {\n        const ch = input[i];\n\n        if (inString) {\n            current += ch;\n            if (ch === \"'\") {\n                // '' inside a literal is an escaped quote, not the end of it.\n                if (input[i + 1] === \"'\") {\n                    current += input[++i];\n                } else {\n                    inString = false;\n                }\n            }\n            continue;\n        }\n\n        if (ch === \"'\") {\n            inString = true;\n            current += ch;\n            continue;\n        }\n        if (ch === \"(\" || ch === \"[\") depth++;\n        if (ch === \")\" || ch === \"]\") depth--;\n\n        if (depth === 0 && input.startsWith(separator, i)) {\n            // A word separator must not match inside an identifier: \"AND\" is a\n            // separator in `a AND b` but not in `brand = 1`.\n            const before = input[i - 1];\n            const after = input[i + separator.length];\n            const wordish = /[A-Za-z]/.test(separator[0]);\n            const boundedOk = !wordish || ((before === undefined || !/[A-Za-z0-9_]/.test(before)) &&\n                (after === undefined || !/[A-Za-z0-9_]/.test(after)));\n            if (boundedOk) {\n                parts.push(current);\n                current = \"\";\n                i += separator.length - 1;\n                continue;\n            }\n        }\n\n        current += ch;\n    }\n\n    parts.push(current);\n    return parts.map((p) => p.trim()).filter((p) => p.length > 0);\n}\n\n/** Removes one layer of wrapping parentheses, repeatedly, when balanced. */\nexport function unwrapParens(input: string): string {\n    let s = input.trim();\n    while (s.startsWith(\"(\") && s.endsWith(\")\")) {\n        let depth = 0;\n        let balanced = true;\n        let inString = false;\n        for (let i = 0; i < s.length; i++) {\n            const ch = s[i];\n            if (inString) {\n                if (ch === \"'\") {\n                    if (s[i + 1] === \"'\") i++;\n                    else inString = false;\n                }\n                continue;\n            }\n            if (ch === \"'\") { inString = true; continue; }\n            if (ch === \"(\") depth++;\n            else if (ch === \")\") {\n                depth--;\n                // The opening paren closed before the end, so the outer pair is\n                // not a wrapper: `(a) AND (b)`.\n                if (depth === 0 && i < s.length - 1) { balanced = false; break; }\n            }\n        }\n        if (!balanced) break;\n        s = s.slice(1, -1).trim();\n    }\n    return s;\n}\n\n/** Drops trailing `::type` casts, including array and quoted forms. */\nexport function stripCasts(input: string): string {\n    let s = unwrapParens(input);\n    let previous: string;\n    do {\n        previous = s;\n        s = unwrapParens(\n            s.replace(/::\\s*\"?[A-Za-z_][A-Za-z0-9_ ]*\"?(\\s*\\(\\s*\\d+\\s*(,\\s*\\d+\\s*)?\\))?(\\s*\\[\\s*\\])*\\s*$/, \"\").trim()\n        );\n    } while (s !== previous);\n    return s;\n}\n\n/** A bare, unquoted column reference — anything else is an expression. */\nfunction asColumnName(input: string): string | null {\n    const s = stripCasts(input);\n    if (/^[a-z_][a-z0-9_$]*$/i.test(s)) return s;\n    // A quoted identifier keeps its case: \"userId\".\n    const quoted = s.match(/^\"([^\"]+)\"$/);\n    return quoted ? quoted[1] : null;\n}\n\n/** `length(col)` and friends → the column they measure. */\nfunction asLengthOfColumn(input: string): string | null {\n    const s = stripCasts(input);\n    const match = s.match(/^([a-z_]+)\\s*\\((.*)\\)$/is);\n    if (!match || !LENGTH_FUNCTIONS.has(match[1].toLowerCase())) return null;\n    return asColumnName(match[2]);\n}\n\n/** A numeric literal, after casts are removed. Rejects anything else. */\nfunction asNumber(input: string): number | null {\n    const s = stripCasts(input).replace(/^'(.*)'$/s, \"$1\");\n    if (!/^[+-]?(\\d+\\.?\\d*|\\.\\d+)$/.test(s)) return null;\n    const n = Number(s);\n    return Number.isFinite(n) ? n : null;\n}\n\n/** A single-quoted string literal, with `''` unescaped. */\nfunction asStringLiteral(input: string): string | null {\n    const s = stripCasts(input);\n    if (!s.startsWith(\"'\") || !s.endsWith(\"'\") || s.length < 2) return null;\n    const body = s.slice(1, -1);\n    // Any unescaped quote inside means this was not one literal.\n    if (/(^|[^'])'($|[^'])/.test(body)) return null;\n    return body.replace(/''/g, \"'\");\n}\n\n/** The element list of `ARRAY[…]`, or of a parenthesised `IN (…)` list. */\nfunction asValueList(input: string): string[] | null {\n    const s = stripCasts(input);\n    const arrayMatch = s.match(/^ARRAY\\s*\\[(.*)\\]$/is);\n    const body = arrayMatch ? arrayMatch[1] : (s.startsWith(\"(\") && s.endsWith(\")\") ? s.slice(1, -1) : null);\n    if (body === null) return null;\n    if (body.trim() === \"\") return null;\n\n    const values: string[] = [];\n    for (const element of splitTopLevel(body, \",\")) {\n        const literal = asStringLiteral(element);\n        if (literal !== null) {\n            values.push(literal);\n            continue;\n        }\n        const numeric = asNumber(element);\n        if (numeric !== null) {\n            values.push(String(numeric));\n            continue;\n        }\n        return null; // A non-literal element means this is not an enumeration.\n    }\n    return values;\n}\n\n/** One understood comparison, already resolved to the column it constrains. */\ninterface CheckTerm {\n    column: string;\n    apply: (facts: ColumnCheckFacts) => void;\n}\n\n/**\n * Parses one conjunct. Returns null when the shape is not one of the few this\n * understands, which is the signal to abandon the whole constraint.\n */\nfunction parseTerm(rawTerm: string): CheckTerm | null {\n    const term = unwrapParens(rawTerm);\n\n    // ── Membership: `x = ANY (ARRAY[…])`, `x IN (…)` ──────────────────\n    const anyMatch = term.match(/^(.*?)\\s*=\\s*ANY\\s*(\\(.*\\))$/is);\n    const inMatch = anyMatch ? null : term.match(/^(.*?)\\s+IN\\s*(\\(.*\\))$/is);\n    const membership = anyMatch ?? inMatch;\n    if (membership) {\n        const column = asColumnName(membership[1]);\n        const values = asValueList(membership[2]);\n        if (!column || !values || values.length === 0) return null;\n        return {\n            column,\n            apply: (facts) => {\n                // Two membership checks on one column mean both must hold.\n                facts.enumValues = facts.enumValues\n                    ? facts.enumValues.filter((v) => values.includes(v))\n                    : values;\n            }\n        };\n    }\n\n    // ── Comparison: `x >= n`, `length(x) <= n`, `x = 'literal'` ───────\n    // Longest operators first so `>=` is not read as `>`.\n    for (const operator of [\">=\", \"<=\", \"<>\", \"!=\", \"=\", \">\", \"<\"] as const) {\n        const parts = splitTopLevel(term, operator);\n        if (parts.length !== 2) continue;\n        const [rawLeft, rawRight] = parts;\n\n        const lengthColumn = asLengthOfColumn(rawLeft);\n        if (lengthColumn) {\n            const bound = asNumber(rawRight);\n            if (bound === null) return null;\n            switch (operator) {\n                case \">=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound, bound); } };\n                case \">\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound + 1, bound + 1); } };\n                case \"<=\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound, bound); } };\n                case \"<\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound - 1, bound - 1); } };\n                case \"=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = bound; f.lengthMax = bound; } };\n                default: return null;\n            }\n        }\n\n        const column = asColumnName(rawLeft);\n        if (!column) continue;\n\n        if (operator === \"=\") {\n            const literal = asStringLiteral(rawRight);\n            if (literal !== null) {\n                return {\n                    column,\n                    apply: (facts) => {\n                        facts.enumValues = facts.enumValues\n                            ? facts.enumValues.filter((v) => v === literal)\n                            : [literal];\n                    }\n                };\n            }\n            // `x = 5` pins a number. Expressed as both bounds rather than as a\n            // one-value enum, which for a number would render as a dropdown.\n            const pinned = asNumber(rawRight);\n            if (pinned === null) return null;\n            return { column, apply: (f) => { f.min = pinned; f.max = pinned; } };\n        }\n\n        const bound = asNumber(rawRight);\n        if (bound === null) return null;\n        switch (operator) {\n            case \">=\": return { column, apply: (f) => { f.min = Math.max(f.min ?? bound, bound); } };\n            case \">\": return { column, apply: (f) => { f.moreThan = Math.max(f.moreThan ?? bound, bound); } };\n            case \"<=\": return { column, apply: (f) => { f.max = Math.min(f.max ?? bound, bound); } };\n            case \"<\": return { column, apply: (f) => { f.lessThan = Math.min(f.lessThan ?? bound, bound); } };\n            default: return null; // `<>` / `!=` exclude rather than bound.\n        }\n    }\n\n    return null;\n}\n\n/**\n * Reads one constraint definition into per-column facts.\n *\n * Returns an empty map for anything not understood — including a constraint\n * that is understood but spans two columns (`start_date < end_date`), which no\n * per-property validation rule can express.\n */\nexport function parseCheckDefinition(definition: string): Map<string, ColumnCheckFacts> {\n    const result = new Map<string, ColumnCheckFacts>();\n\n    const body = definition\n        .trim()\n        .replace(/\\s+NOT\\s+VALID\\s*$/i, \"\")\n        .replace(/^CHECK\\s*/i, \"\")\n        .trim();\n    if (body === definition.trim()) return result; // Not a CHECK definition.\n\n    const expression = unwrapParens(body);\n    if (!expression) return result;\n\n    // Only conjunctions. A disjunction (`a OR b`) does not narrow a column: each\n    // branch may allow what the other forbids, so no single bound follows.\n    if (splitTopLevel(expression, \" OR \").length > 1) return result;\n\n    const terms = splitTopLevel(expression, \" AND \");\n    const parsed: CheckTerm[] = [];\n    for (const term of terms) {\n        const one = parseTerm(term);\n        if (!one) return result; // One unreadable conjunct voids the constraint.\n        parsed.push(one);\n    }\n\n    // A CHECK naming two columns constrains their *relationship*; keeping the\n    // half that mentions one column would assert something the database does not.\n    const columns = new Set(parsed.map((t) => t.column));\n    if (columns.size !== 1) return result;\n\n    const facts: ColumnCheckFacts = {};\n    for (const term of parsed) term.apply(facts);\n    if (Object.keys(facts).length === 0) return result;\n\n    result.set(parsed[0].column, facts);\n    return result;\n}\n\n/** Merges every readable CHECK in the schema into per-table, per-column facts. */\nexport function parseCheckConstraints(rows: CheckConstraintRow[]): CheckFactsByTable {\n    const byTable: CheckFactsByTable = new Map();\n\n    for (const row of rows) {\n        const parsed = parseCheckDefinition(row.definition);\n        if (parsed.size === 0) continue;\n\n        let table = byTable.get(row.table_name);\n        if (!table) {\n            table = new Map();\n            byTable.set(row.table_name, table);\n        }\n\n        for (const [column, facts] of parsed) {\n            const existing = table.get(column);\n            if (!existing) {\n                table.set(column, facts);\n                continue;\n            }\n            // Separate constraints on the same column all hold at once.\n            if (facts.enumValues) {\n                existing.enumValues = existing.enumValues\n                    ? existing.enumValues.filter((v) => facts.enumValues!.includes(v))\n                    : facts.enumValues;\n            }\n            if (facts.min !== undefined) existing.min = Math.max(existing.min ?? facts.min, facts.min);\n            if (facts.max !== undefined) existing.max = Math.min(existing.max ?? facts.max, facts.max);\n            if (facts.moreThan !== undefined) existing.moreThan = Math.max(existing.moreThan ?? facts.moreThan, facts.moreThan);\n            if (facts.lessThan !== undefined) existing.lessThan = Math.min(existing.lessThan ?? facts.lessThan, facts.lessThan);\n            if (facts.lengthMin !== undefined) existing.lengthMin = Math.max(existing.lengthMin ?? facts.lengthMin, facts.lengthMin);\n            if (facts.lengthMax !== undefined) existing.lengthMax = Math.min(existing.lengthMax ?? facts.lengthMax, facts.lengthMax);\n        }\n    }\n\n    return byTable;\n}\n","import chalk from \"chalk\";\nimport fs from \"fs\";\nimport path from \"path\";\nimport pg from \"pg\";\nimport arg from \"arg\";\nimport * as dotenv from \"dotenv\";\nimport readline from \"readline\";\n\nimport {\n    buildTablesMap,\n    buildEnumMap,\n    compositeKeySkipReason,\n    generateCollectionFile,\n    generateIndexContent,\n    mergeIndexContent,\n    safeHostFromUrl\n} from \"./introspect-db-logic\";\nimport { detectCollectionBuilder } from \"./introspect-db-project\";\nimport { countRowsUpTo, isUsableFileName, quoteRelation, readSchemaMetadata } from \"./introspect-db-queries\";\nimport { classifyTables, lookupCandidates, LOOKUP_MAX_ROWS } from \"./introspect-db-structure\";\nimport { parseCheckConstraints } from \"./introspect-db-constraints\";\nimport { out, outWarn, outError } from \"../cli-output\";\n\nasync function main() {\n    const args = arg(\n        {\n            \"--output\": String,\n            \"--collections\": String,\n            \"--force\": Boolean,\n            \"--schema\": String,\n            \"--data-inference\": Boolean,\n            \"--no-data-inference\": Boolean,\n            \"-o\": \"--output\",\n            \"-c\": \"--collections\",\n            \"-f\": \"--force\"\n        },\n        { permissive: true }\n    );\n\n    const cwd = process.cwd();\n    const isBackendDir = path.basename(cwd) === \"backend\";\n    const defaultOutDir = isBackendDir\n        ? path.resolve(cwd, \"..\", \"config\", \"collections\")\n        : path.resolve(cwd, \"config\", \"collections\");\n\n    const outDir = args[\"--output\"] || args[\"--collections\"] || defaultOutDir;\n    const force = args[\"--force\"] || false;\n    const pgSchema = args[\"--schema\"] || \"public\";\n\n    if (!fs.existsSync(outDir)) {\n        fs.mkdirSync(outDir, { recursive: true });\n    }\n\n    // Load env\n    const envPaths = [\n        process.env.DOTENV_CONFIG_PATH,\n        path.resolve(process.cwd(), \".env\"),\n        path.resolve(process.cwd(), \"../.env\"),\n        path.resolve(process.cwd(), \"../../.env\")\n    ].filter(Boolean) as string[];\n\n    for (const p of envPaths) {\n        if (fs.existsSync(p)) {\n            dotenv.config({ path: p, quiet: true });\n            break;\n        }\n    }\n\n    const databaseUrl = process.env.DATABASE_URL || process.env.ADMIN_CONNECTION_STRING;\n    if (!databaseUrl) {\n        outError(chalk.red(\"✗ DATABASE_URL is not set. Make sure your .env file is configured.\"));\n        process.exit(1);\n    }\n\n    const client = new pg.Client({ connectionString: databaseUrl });\n\n    try {\n        await client.connect();\n    } catch (err) {\n        outError(chalk.red(`✗ Failed to connect to database: ${err instanceof Error ? err.message : String(err)}`));\n        outError(chalk.gray(\"  Check your DATABASE_URL and ensure the database is reachable.\"));\n        process.exit(1);\n    }\n\n    // Log the host portion safely — handle URLs without \"@\"\n    const hostPart = safeHostFromUrl(databaseUrl);\n    out(chalk.gray(`Connected to database: ${hostPart}`));\n    out(chalk.gray(`Introspecting schema '${pgSchema}'...`));\n\n    try {\n        const metadata = await readSchemaMetadata(client, pgSchema);\n        const enumMap = buildEnumMap(metadata.enumValues);\n        const tablesMap = buildTablesMap(metadata.tables, metadata.columns, metadata.pks, metadata.fks);\n        const fks = metadata.fks;\n\n        // Only tables that could structurally be a code list are counted, and\n        // each count stops at the threshold — see `countRowsUpTo`. Introspection\n        // runs against a database it does not own, so \"cheap on a table of any\n        // size\" is a requirement, not an optimization.\n        for (const table of lookupCandidates(metadata, tablesMap)) {\n            try {\n                metadata.rowCounts[table] = await countRowsUpTo(client, pgSchema, table, LOOKUP_MAX_ROWS);\n            } catch (err) {\n                // A table this run cannot read is simply not classified as a code\n                // list; everything else about it still generates.\n                out(chalk.gray(`  (skipped row count for ${table}: ${err instanceof Error ? err.message : String(err)})`));\n            }\n        }\n\n        const classifications = classifyTables(metadata, tablesMap);\n        const checkFacts = parseCheckConstraints(metadata.checks);\n\n        // Which builder the generated files may import — read from the manifests\n        // above `outDir`, because a project without `@rebasepro/cms-types` cannot\n        // resolve that import and has no `admin` block to write into either.\n        const builder = detectCollectionBuilder(outDir);\n        if (builder === \"annotation\") {\n            outWarn(chalk.yellow(\n                \"⚠ Neither @rebasepro/cms-types nor @rebasepro/common is declared above \" +\n                `${outDir}.`\n            ));\n            outWarn(chalk.gray(\n                \"  Generating plain type annotations, which widen the property keys to `string`: \" +\n                \"`propertiesOrder` and friends will not be checked. Add @rebasepro/common to the \" +\n                \"config package to turn that checking on.\"\n            ));\n        }\n        const joinTables = new Set(\n            Array.from(classifications.values())\n                .filter((c) => c.role === \"junction\")\n                .map((c) => c.table)\n        );\n\n        const roleCount = (role: string) =>\n            Array.from(classifications.values()).filter((c) => c.role === role).length;\n\n        out(chalk.blue(`Found ${tablesMap.size} tables.`));\n        out(chalk.gray(\n            `  ${roleCount(\"entity\")} entities, ${joinTables.size} join tables (folded into relations), ` +\n            `${roleCount(\"lookup\")} code lists, ${roleCount(\"owned-child\")} owned by another table (hidden from navigation).`\n        ));\n\n        let runDataInference = false;\n        if (args[\"--no-data-inference\"]) {\n            runDataInference = false;\n        } else if (args[\"--data-inference\"] !== undefined) {\n            runDataInference = args[\"--data-inference\"];\n        } else if (!process.stdin.isTTY) {\n            // No terminal to answer the question below (scaffolding scripts, CI,\n            // `rebase init --introspect`) — asking would hang forever.\n            out(chalk.gray(\"Skipping data inference (non-interactive run; pass --data-inference to enable).\"));\n        } else {\n            const rl = readline.createInterface({\n                input: process.stdin,\n                output: process.stdout\n            });\n            const answer = await new Promise<string>((resolve) => rl.question(chalk.yellow(\"? Do you want to run comprehensive data inference on sampled rows to auto-detect types, formats, constraints, and UI configurations? (y/N) \"), resolve));\n            runDataInference = answer.trim().toLowerCase() === \"y\";\n            rl.close();\n        }\n\n        if (runDataInference) {\n            out(chalk.gray(\"Sampling database rows for data inference...\"));\n        }\n\n        // Generate Collections\n        const generatedFiles: string[] = [];\n        const skippedFiles: string[] = [];\n\n        // A table keyed on more than one column is generated with `isId` on\n        // every key column — one composite key, which the planner builds the\n        // same way — unless that cannot round-trip: a key column no `isId` can\n        // mark, or a link pointing at the table (see `compositeKeySkipReason`).\n        // Those are left out, with the reason. Generating one anyway produced a\n        // file that read the table by an `id` column it does not have, and a\n        // push that planned that column as its new primary key.\n        const compositeKeyed = new Map(\n            Array.from(tablesMap.entries())\n                .filter(([tableName]) => !joinTables.has(tableName))\n                .map(([tableName, meta]) => [tableName, compositeKeySkipReason(meta, fks)] as const)\n                .filter((entry): entry is readonly [string, string] => entry[1] !== undefined)\n        );\n        for (const [tableName, reason] of compositeKeyed) {\n            outWarn(chalk.yellow(\n                `⚠ Skipping table ${JSON.stringify(tableName)}: it is keyed on ` +\n                `(${tablesMap.get(tableName)?.pks.join(\", \")}), and ${reason}. ` +\n                \"`rebase db push` leaves a table that is not a collection alone.\"\n            ));\n        }\n        const notes: string[] = [];\n\n        const tablesToProcess = Array.from(tablesMap.entries())\n            .filter(([tableName]) => !joinTables.has(tableName) && !compositeKeyed.has(tableName));\n\n        const BATCH_SIZE = 10;\n        for (let i = 0; i < tablesToProcess.length; i += BATCH_SIZE) {\n            const batch = tablesToProcess.slice(i, i + BATCH_SIZE);\n\n            await Promise.all(batch.map(async ([tableName, meta]) => {\n                // ── The name has to be usable as a filename ────────────────\n                //\n                // `tableName` came out of `pg_class` in a database this tool\n                // did not create — adopting somebody else's database is the\n                // whole point of introspection — and it is about to be joined\n                // onto a path. Postgres will happily hold a table called\n                // `../../../etc/cron.d/x`, and `path.join` resolves it: the\n                // generator would write a TypeScript file wherever that\n                // pointed, as whoever ran the command.\n                //\n                // Skipped rather than sanitised. A file named something other\n                // than its table is a collection that does not round-trip, and\n                // silently renaming it would be a worse surprise than one line\n                // saying which table was left out.\n                if (!isUsableFileName(tableName)) {\n                    outWarn(chalk.yellow(\n                        `⚠ Skipping table ${JSON.stringify(tableName)}: its name cannot be used as a ` +\n                        \"filename. Rename the table, or write this collection by hand.\"\n                    ));\n                    skippedFiles.push(tableName);\n                    return;\n                }\n\n                // ── File overwrite protection ──────────────────────────────\n                const filePath = path.join(outDir, `${tableName}.ts`);\n                if (fs.existsSync(filePath) && !force) {\n                    skippedFiles.push(tableName);\n                    return;\n                }\n\n                let sampleData: Record<string, unknown>[] | undefined = undefined;\n                if (runDataInference) {\n                    try {\n                        // Quoted by `quoteRelation`, which doubles an embedded\n                        // quote. Wrapping a catalogue name in `\"` is not\n                        // escaping it — see that function.\n                        const { rows } = await client.query(`SELECT * FROM ${quoteRelation(pgSchema, tableName)} LIMIT 100`);\n                        sampleData = rows;\n                    } catch (err) {\n                        outError(chalk.yellow(`⚠ Failed to sample data for table ${tableName}: ${err instanceof Error ? err.message : String(err)}`));\n                    }\n                }\n\n                const fileContent = generateCollectionFile(\n                    tableName,\n                    meta,\n                    fks,\n                    joinTables,\n                    tablesMap,\n                    enumMap,\n                    sampleData,\n                    { metadata, classifications, checkFacts, builder, notes, skippedTables: new Set(compositeKeyed.keys()) }\n                );\n\n                fs.writeFileSync(filePath, fileContent, \"utf-8\");\n                generatedFiles.push(tableName);\n                out(chalk.green(`  ✓ ${filePath}`));\n            }));\n        }\n\n        // Every column the planner will not reproduce exactly, before anyone\n        // pushes. Each line is also at the top of its file.\n        if (notes.length > 0) {\n            outWarn(\"\");\n            outWarn(chalk.yellow(`⚠ ${notes.length} column(s) will not round-trip exactly — \\`rebase db push\\` would change them:`));\n            for (const note of [...notes].sort()) outWarn(chalk.gray(`  - ${note}`));\n            outWarn(chalk.gray(\"  Read these before the first push. Run `rebase db push --dry-run` to see the plan.\"));\n        }\n\n        // Generate index.ts (sorted alphabetically for deterministic output)\n        if (generatedFiles.length > 0) {\n            const indexPath = path.join(outDir, \"index.ts\");\n\n            if (fs.existsSync(indexPath) && !force) {\n                // Merge: read existing index, add new exports that don't already exist\n                const existing = fs.readFileSync(indexPath, \"utf-8\");\n                const merged = mergeIndexContent(existing, generatedFiles);\n                fs.writeFileSync(indexPath, merged, \"utf-8\");\n            } else {\n                // --force replaces collections derived from the database, but the\n                // directory can also hold hand-written ones with no table in the\n                // introspected schema (the auth users collection lives in\n                // \"rebase\"). The backend discovers the whole directory, so an\n                // index listing only introspected tables would silently drop them\n                // from the admin UI while the API still served them.\n                const siblings = fs.readdirSync(outDir)\n                    .filter(f => f.endsWith(\".ts\") && f !== \"index.ts\")\n                    .map(f => f.replace(/\\.ts$/, \"\"));\n                const allFiles = [...new Set([...generatedFiles, ...siblings])];\n                const indexContent = generateIndexContent(allFiles);\n                fs.writeFileSync(indexPath, indexContent, \"utf-8\");\n            }\n            out(chalk.green(`  ✓ ${indexPath}`));\n        }\n\n        out(\"\");\n        if (skippedFiles.length > 0) {\n            out(chalk.yellow(`⚠ Skipped ${skippedFiles.length} existing file(s): ${skippedFiles.join(\", \")}`));\n            out(chalk.gray(\"  Use --force to overwrite existing files.\"));\n            out(\"\");\n        }\n        out(chalk.bold.green(`✓ Introspected ${tablesMap.size} tables — generated ${generatedFiles.length} collection(s).`));\n        out(chalk.gray(`  Review the generated files in ${outDir} and customize properties as needed.`));\n        out(\"\");\n\n    } catch (e) {\n        outError(chalk.red(`✗ Error introspecting database: ${e instanceof Error ? e.message : String(e)}`));\n        process.exit(1);\n    } finally {\n        await client.end();\n    }\n}\n\nmain().catch((err) => {\n    outError(String(err));\n    process.exit(1);\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAaA,IAAM,aAAa;;AAGnB,SAAS,qBAAqB,cAAmC;CAC7D,MAAM,wBAAQ,IAAI,IAAY;CAC9B,IAAI;CACJ,IAAI;EACA,SAAS,KAAK,MAAM,GAAG,aAAa,cAAc,OAAO,CAAC;CAC9D,QAAQ;EAGJ,OAAO;CACX;CACA,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM,OAAO;CAC1D,MAAM,WAAW;CACjB,KAAK,MAAM,SAAS;EAAC;EAAgB;EAAmB;CAAkB,GAAG;EACzE,MAAM,QAAQ,SAAS;EACvB,IAAI,OAAO,UAAU,YAAY,UAAU,MACvC,KAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,GAAG,MAAM,IAAI,IAAI;CAE7D;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,wBAAwB,QAAmC;CACvE,IAAI,MAAM,KAAK,QAAQ,MAAM;CAC7B,MAAM,2BAAW,IAAI,IAAY;CAEjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,SAAS;EAC7C,MAAM,WAAW,KAAK,KAAK,KAAK,cAAc;EAC9C,IAAI,GAAG,WAAW,QAAQ,GACtB,KAAK,MAAM,QAAQ,qBAAqB,QAAQ,GAAG,SAAS,IAAI,IAAI;EAIxE,IAAI,GAAG,WAAW,KAAK,KAAK,KAAK,aAAa,CAAC,GAAG;EAElD,MAAM,SAAS,KAAK,QAAQ,GAAG;EAC/B,IAAI,WAAW,KAAK;EACpB,MAAM;CACV;CAEA,IAAI,SAAS,IAAA,sBAAuB,GAAG,OAAO;CAC9C,IAAI,SAAS,IAAA,mBAAkB,GAAG,OAAO;CACzC,OAAO;AACX;;;;AC9BA,IAAM,mCAAmB,IAAI,IAAI;CAAC;CAAU;CAAe;CAAoB;AAAc,CAAC;;;;;;;;;AAU9F,SAAS,cAAc,OAAe,WAA6B;CAC/D,MAAM,QAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,IAAI,WAAW;CACf,IAAI,UAAU;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,KAAK,MAAM;EAEjB,IAAI,UAAU;GACV,WAAW;GACX,IAAI,OAAO,KAEP,IAAI,MAAM,IAAI,OAAO,KACjB,WAAW,MAAM,EAAE;QAEnB,WAAW;GAGnB;EACJ;EAEA,IAAI,OAAO,KAAK;GACZ,WAAW;GACX,WAAW;GACX;EACJ;EACA,IAAI,OAAO,OAAO,OAAO,KAAK;EAC9B,IAAI,OAAO,OAAO,OAAO,KAAK;EAE9B,IAAI,UAAU,KAAK,MAAM,WAAW,WAAW,CAAC,GAAG;GAG/C,MAAM,SAAS,MAAM,IAAI;GACzB,MAAM,QAAQ,MAAM,IAAI,UAAU;GAIlC,IAFkB,CADF,WAAW,KAAK,UAAU,EACvB,MAAa,WAAW,KAAA,KAAa,CAAC,eAAe,KAAK,MAAM,OAC9E,UAAU,KAAA,KAAa,CAAC,eAAe,KAAK,KAAK,IACvC;IACX,MAAM,KAAK,OAAO;IAClB,UAAU;IACV,KAAK,UAAU,SAAS;IACxB;GACJ;EACJ;EAEA,WAAW;CACf;CAEA,MAAM,KAAK,OAAO;CAClB,OAAO,MAAM,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;AAChE;;AAGA,SAAgB,aAAa,OAAuB;CAChD,IAAI,IAAI,MAAM,KAAK;CACnB,OAAO,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG,GAAG;EACzC,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI,WAAW;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;GAC/B,MAAM,KAAK,EAAE;GACb,IAAI,UAAU;IACV,IAAI,OAAO,KACP,IAAI,EAAE,IAAI,OAAO,KAAK;SACjB,WAAW;IAEpB;GACJ;GACA,IAAI,OAAO,KAAK;IAAE,WAAW;IAAM;GAAU;GAC7C,IAAI,OAAO,KAAK;QACX,IAAI,OAAO,KAAK;IACjB;IAGA,IAAI,UAAU,KAAK,IAAI,EAAE,SAAS,GAAG;KAAE,WAAW;KAAO;IAAO;GACpE;EACJ;EACA,IAAI,CAAC,UAAU;EACf,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK;CAC5B;CACA,OAAO;AACX;;AAGA,SAAgB,WAAW,OAAuB;CAC9C,IAAI,IAAI,aAAa,KAAK;CAC1B,IAAI;CACJ,GAAG;EACC,WAAW;EACX,IAAI,aACA,EAAE,QAAQ,qFAAqF,EAAE,CAAC,CAAC,KAAK,CAC5G;CACJ,SAAS,MAAM;CACf,OAAO;AACX;;AAGA,SAAS,aAAa,OAA8B;CAChD,MAAM,IAAI,WAAW,KAAK;CAC1B,IAAI,uBAAuB,KAAK,CAAC,GAAG,OAAO;CAE3C,MAAM,SAAS,EAAE,MAAM,aAAa;CACpC,OAAO,SAAS,OAAO,KAAK;AAChC;;AAGA,SAAS,iBAAiB,OAA8B;CAEpD,MAAM,QADI,WAAW,KACP,CAAA,CAAE,MAAM,0BAA0B;CAChD,IAAI,CAAC,SAAS,CAAC,iBAAiB,IAAI,MAAM,EAAE,CAAC,YAAY,CAAC,GAAG,OAAO;CACpE,OAAO,aAAa,MAAM,EAAE;AAChC;;AAGA,SAAS,SAAS,OAA8B;CAC5C,MAAM,IAAI,WAAW,KAAK,CAAC,CAAC,QAAQ,aAAa,IAAI;CACrD,IAAI,CAAC,2BAA2B,KAAK,CAAC,GAAG,OAAO;CAChD,MAAM,IAAI,OAAO,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AACpC;;AAGA,SAAS,gBAAgB,OAA8B;CACnD,MAAM,IAAI,WAAW,KAAK;CAC1B,IAAI,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,OAAO;CACnE,MAAM,OAAO,EAAE,MAAM,GAAG,EAAE;CAE1B,IAAI,oBAAoB,KAAK,IAAI,GAAG,OAAO;CAC3C,OAAO,KAAK,QAAQ,OAAO,GAAG;AAClC;;AAGA,SAAS,YAAY,OAAgC;CACjD,MAAM,IAAI,WAAW,KAAK;CAC1B,MAAM,aAAa,EAAE,MAAM,sBAAsB;CACjD,MAAM,OAAO,aAAa,WAAW,KAAM,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI;CACnG,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,KAAK,KAAK,MAAM,IAAI,OAAO;CAE/B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,WAAW,cAAc,MAAM,GAAG,GAAG;EAC5C,MAAM,UAAU,gBAAgB,OAAO;EACvC,IAAI,YAAY,MAAM;GAClB,OAAO,KAAK,OAAO;GACnB;EACJ;EACA,MAAM,UAAU,SAAS,OAAO;EAChC,IAAI,YAAY,MAAM;GAClB,OAAO,KAAK,OAAO,OAAO,CAAC;GAC3B;EACJ;EACA,OAAO;CACX;CACA,OAAO;AACX;;;;;AAYA,SAAS,UAAU,SAAmC;CAClD,MAAM,OAAO,aAAa,OAAO;CAGjC,MAAM,WAAW,KAAK,MAAM,gCAAgC;CAC5D,MAAM,UAAU,WAAW,OAAO,KAAK,MAAM,2BAA2B;CACxE,MAAM,aAAa,YAAY;CAC/B,IAAI,YAAY;EACZ,MAAM,SAAS,aAAa,WAAW,EAAE;EACzC,MAAM,SAAS,YAAY,WAAW,EAAE;EACxC,IAAI,CAAC,UAAU,CAAC,UAAU,OAAO,WAAW,GAAG,OAAO;EACtD,OAAO;GACH;GACA,QAAQ,UAAU;IAEd,MAAM,aAAa,MAAM,aACnB,MAAM,WAAW,QAAQ,MAAM,OAAO,SAAS,CAAC,CAAC,IACjD;GACV;EACJ;CACJ;CAIA,KAAK,MAAM,YAAY;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;CAAG,GAAY;EACrE,MAAM,QAAQ,cAAc,MAAM,QAAQ;EAC1C,IAAI,MAAM,WAAW,GAAG;EACxB,MAAM,CAAC,SAAS,YAAY;EAE5B,MAAM,eAAe,iBAAiB,OAAO;EAC7C,IAAI,cAAc;GACd,MAAM,QAAQ,SAAS,QAAQ;GAC/B,IAAI,UAAU,MAAM,OAAO;GAC3B,QAAQ,UAAR;IACI,KAAK,MAAM,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,OAAO,KAAK;KAAG;IAAE;IACjH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,QAAQ,GAAG,QAAQ,CAAC;KAAG;IAAE;IACxH,KAAK,MAAM,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,OAAO,KAAK;KAAG;IAAE;IACjH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,QAAQ,GAAG,QAAQ,CAAC;KAAG;IAAE;IACxH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY;MAAO,EAAE,YAAY;KAAO;IAAE;IACrG,SAAS,OAAO;GACpB;EACJ;EAEA,MAAM,SAAS,aAAa,OAAO;EACnC,IAAI,CAAC,QAAQ;EAEb,IAAI,aAAa,KAAK;GAClB,MAAM,UAAU,gBAAgB,QAAQ;GACxC,IAAI,YAAY,MACZ,OAAO;IACH;IACA,QAAQ,UAAU;KACd,MAAM,aAAa,MAAM,aACnB,MAAM,WAAW,QAAQ,MAAM,MAAM,OAAO,IAC5C,CAAC,OAAO;IAClB;GACJ;GAIJ,MAAM,SAAS,SAAS,QAAQ;GAChC,IAAI,WAAW,MAAM,OAAO;GAC5B,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM;KAAQ,EAAE,MAAM;IAAQ;GAAE;EACvE;EAEA,MAAM,QAAQ,SAAS,QAAQ;EAC/B,IAAI,UAAU,MAAM,OAAO;EAC3B,QAAQ,UAAR;GACI,KAAK,MAAM,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM,KAAK,IAAI,EAAE,OAAO,OAAO,KAAK;IAAG;GAAE;GACvF,KAAK,KAAK,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,WAAW,KAAK,IAAI,EAAE,YAAY,OAAO,KAAK;IAAG;GAAE;GAChG,KAAK,MAAM,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM,KAAK,IAAI,EAAE,OAAO,OAAO,KAAK;IAAG;GAAE;GACvF,KAAK,KAAK,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,WAAW,KAAK,IAAI,EAAE,YAAY,OAAO,KAAK;IAAG;GAAE;GAChG,SAAS,OAAO;EACpB;CACJ;CAEA,OAAO;AACX;;;;;;;;AASA,SAAgB,qBAAqB,YAAmD;CACpF,MAAM,yBAAS,IAAI,IAA8B;CAEjD,MAAM,OAAO,WACR,KAAK,CAAC,CACN,QAAQ,uBAAuB,EAAE,CAAC,CAClC,QAAQ,cAAc,EAAE,CAAC,CACzB,KAAK;CACV,IAAI,SAAS,WAAW,KAAK,GAAG,OAAO;CAEvC,MAAM,aAAa,aAAa,IAAI;CACpC,IAAI,CAAC,YAAY,OAAO;CAIxB,IAAI,cAAc,YAAY,MAAM,CAAC,CAAC,SAAS,GAAG,OAAO;CAEzD,MAAM,QAAQ,cAAc,YAAY,OAAO;CAC/C,MAAM,SAAsB,CAAC;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACtB,MAAM,MAAM,UAAU,IAAI;EAC1B,IAAI,CAAC,KAAK,OAAO;EACjB,OAAO,KAAK,GAAG;CACnB;CAKA,IAAI,IADgB,IAAI,OAAO,KAAK,MAAM,EAAE,MAAM,CAC9C,CAAA,CAAQ,SAAS,GAAG,OAAO;CAE/B,MAAM,QAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,QAAQ,KAAK,MAAM,KAAK;CAC3C,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,GAAG,OAAO;CAE5C,OAAO,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK;CAClC,OAAO;AACX;;AAGA,SAAgB,sBAAsB,MAA+C;CACjF,MAAM,0BAA6B,IAAI,IAAI;CAE3C,KAAK,MAAM,OAAO,MAAM;EACpB,MAAM,SAAS,qBAAqB,IAAI,UAAU;EAClD,IAAI,OAAO,SAAS,GAAG;EAEvB,IAAI,QAAQ,QAAQ,IAAI,IAAI,UAAU;EACtC,IAAI,CAAC,OAAO;GACR,wBAAQ,IAAI,IAAI;GAChB,QAAQ,IAAI,IAAI,YAAY,KAAK;EACrC;EAEA,KAAK,MAAM,CAAC,QAAQ,UAAU,QAAQ;GAClC,MAAM,WAAW,MAAM,IAAI,MAAM;GACjC,IAAI,CAAC,UAAU;IACX,MAAM,IAAI,QAAQ,KAAK;IACvB;GACJ;GAEA,IAAI,MAAM,YACN,SAAS,aAAa,SAAS,aACzB,SAAS,WAAW,QAAQ,MAAM,MAAM,WAAY,SAAS,CAAC,CAAC,IAC/D,MAAM;GAEhB,IAAI,MAAM,QAAQ,KAAA,GAAW,SAAS,MAAM,KAAK,IAAI,SAAS,OAAO,MAAM,KAAK,MAAM,GAAG;GACzF,IAAI,MAAM,QAAQ,KAAA,GAAW,SAAS,MAAM,KAAK,IAAI,SAAS,OAAO,MAAM,KAAK,MAAM,GAAG;GACzF,IAAI,MAAM,aAAa,KAAA,GAAW,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY,MAAM,UAAU,MAAM,QAAQ;GAClH,IAAI,MAAM,aAAa,KAAA,GAAW,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY,MAAM,UAAU,MAAM,QAAQ;GAClH,IAAI,MAAM,cAAc,KAAA,GAAW,SAAS,YAAY,KAAK,IAAI,SAAS,aAAa,MAAM,WAAW,MAAM,SAAS;GACvH,IAAI,MAAM,cAAc,KAAA,GAAW,SAAS,YAAY,KAAK,IAAI,SAAS,aAAa,MAAM,WAAW,MAAM,SAAS;EAC3H;CACJ;CAEA,OAAO;AACX;;;ACzWA,eAAe,OAAO;CAClB,MAAM,QAAA,GAAA,WAAA,QAAA,CACF;EACI,YAAY;EACZ,iBAAiB;EACjB,WAAW;EACX,YAAY;EACZ,oBAAoB;EACpB,uBAAuB;EACvB,MAAM;EACN,MAAM;EACN,MAAM;CACV,GACA,EAAE,YAAY,KAAK,CACvB;CAEA,MAAM,MAAM,QAAQ,IAAI;CAExB,MAAM,gBADe,KAAK,SAAS,GAAG,MAAM,YAEtC,KAAK,QAAQ,KAAK,MAAM,UAAU,aAAa,IAC/C,KAAK,QAAQ,KAAK,UAAU,aAAa;CAE/C,MAAM,SAAS,KAAK,eAAe,KAAK,oBAAoB;CAC5D,MAAM,QAAQ,KAAK,cAAc;CACjC,MAAM,WAAW,KAAK,eAAe;CAErC,IAAI,CAAC,GAAG,WAAW,MAAM,GACrB,GAAG,UAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;CAI5C,MAAM,WAAW;EACb,QAAQ,IAAI;EACZ,KAAK,QAAQ,QAAQ,IAAI,GAAG,MAAM;EAClC,KAAK,QAAQ,QAAQ,IAAI,GAAG,SAAS;EACrC,KAAK,QAAQ,QAAQ,IAAI,GAAG,YAAY;CAC5C,CAAC,CAAC,OAAO,OAAO;CAEhB,KAAK,MAAM,KAAK,UACZ,IAAI,GAAG,WAAW,CAAC,GAAG;EAClB,OAAO,OAAO;GAAE,MAAM;GAAG,OAAO;EAAK,CAAC;EACtC;CACJ;CAGJ,MAAM,cAAc,QAAQ,IAAI,gBAAgB,QAAQ,IAAI;CAC5D,IAAI,CAAC,aAAa;EACd,SAAS,MAAM,IAAI,oEAAoE,CAAC;EACxF,QAAQ,KAAK,CAAC;CAClB;CAEA,MAAM,SAAS,IAAI,GAAG,OAAO,EAAE,kBAAkB,YAAY,CAAC;CAE9D,IAAI;EACA,MAAM,OAAO,QAAQ;CACzB,SAAS,KAAK;EACV,SAAS,MAAM,IAAI,oCAAoC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;EAC1G,SAAS,MAAM,KAAK,iEAAiE,CAAC;EACtF,QAAQ,KAAK,CAAC;CAClB;CAGA,MAAM,WAAW,gBAAgB,WAAW;CAC5C,IAAI,MAAM,KAAK,0BAA0B,UAAU,CAAC;CACpD,IAAI,MAAM,KAAK,yBAAyB,SAAS,KAAK,CAAC;CAEvD,IAAI;EACA,MAAM,WAAW,MAAM,mBAAmB,QAAQ,QAAQ;EAC1D,MAAM,UAAU,aAAa,SAAS,UAAU;EAChD,MAAM,YAAY,eAAe,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,SAAS,GAAG;EAC9F,MAAM,MAAM,SAAS;EAMrB,KAAK,MAAM,SAAS,iBAAiB,UAAU,SAAS,GACpD,IAAI;GACA,SAAS,UAAU,SAAS,MAAM,cAAc,QAAQ,UAAU,OAAA,EAAsB;EAC5F,SAAS,KAAK;GAGV,IAAI,MAAM,KAAK,4BAA4B,MAAM,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EAAE,EAAE,CAAC;EAC7G;EAGJ,MAAM,kBAAkB,eAAe,UAAU,SAAS;EAC1D,MAAM,aAAa,sBAAsB,SAAS,MAAM;EAKxD,MAAM,UAAU,wBAAwB,MAAM;EAC9C,IAAI,YAAY,cAAc;GAC1B,QAAQ,MAAM,OACV,0EACG,OAAO,EACd,CAAC;GACD,QAAQ,MAAM,KACV,0MAGJ,CAAC;EACL;EACA,MAAM,aAAa,IAAI,IACnB,MAAM,KAAK,gBAAgB,OAAO,CAAC,CAAC,CAC/B,QAAQ,MAAM,EAAE,SAAS,UAAU,CAAC,CACpC,KAAK,MAAM,EAAE,KAAK,CAC3B;EAEA,MAAM,aAAa,SACf,MAAM,KAAK,gBAAgB,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,IAAI,CAAC,CAAC;EAExE,IAAI,MAAM,KAAK,SAAS,UAAU,KAAK,SAAS,CAAC;EACjD,IAAI,MAAM,KACN,KAAK,UAAU,QAAQ,EAAE,aAAa,WAAW,KAAK,wCACnD,UAAU,QAAQ,EAAE,eAAe,UAAU,aAAa,EAAE,kDACnE,CAAC;EAED,IAAI,mBAAmB;EACvB,IAAI,KAAK,wBACL,mBAAmB;OAChB,IAAI,KAAK,wBAAwB,KAAA,GACpC,mBAAmB,KAAK;OACrB,IAAI,CAAC,QAAQ,MAAM,OAGtB,IAAI,MAAM,KAAK,iFAAiF,CAAC;OAC9F;GACH,MAAM,KAAK,+BAAA,QAAS,gBAAgB;IAChC,OAAO,QAAQ;IACf,QAAQ,QAAQ;GACpB,CAAC;GAED,oBAAmB,MADE,IAAI,SAAiB,YAAY,GAAG,SAAS,MAAM,OAAO,6IAA6I,GAAG,OAAO,CAAC,EAAA,CAC7M,KAAK,CAAC,CAAC,YAAY,MAAM;GACnD,GAAG,MAAM;EACb;EAEA,IAAI,kBACA,IAAI,MAAM,KAAK,8CAA8C,CAAC;EAIlE,MAAM,iBAA2B,CAAC;EAClC,MAAM,eAAyB,CAAC;EAShC,MAAM,iBAAiB,IAAI,IACvB,MAAM,KAAK,UAAU,QAAQ,CAAC,CAAC,CAC1B,QAAQ,CAAC,eAAe,CAAC,WAAW,IAAI,SAAS,CAAC,CAAC,CACnD,KAAK,CAAC,WAAW,UAAU,CAAC,WAAW,uBAAuB,MAAM,GAAG,CAAC,CAAU,CAAC,CACnF,QAAQ,UAA8C,MAAM,OAAO,KAAA,CAAS,CACrF;EACA,KAAK,MAAM,CAAC,WAAW,WAAW,gBAC9B,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,oBAC1C,UAAU,IAAI,SAAS,CAAC,EAAE,IAAI,KAAK,IAAI,EAAE,SAAS,OAAO,oEAEjE,CAAC;EAEL,MAAM,QAAkB,CAAC;EAEzB,MAAM,kBAAkB,MAAM,KAAK,UAAU,QAAQ,CAAC,CAAC,CAClD,QAAQ,CAAC,eAAe,CAAC,WAAW,IAAI,SAAS,KAAK,CAAC,eAAe,IAAI,SAAS,CAAC;EAEzF,MAAM,aAAa;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK,YAAY;GACzD,MAAM,QAAQ,gBAAgB,MAAM,GAAG,IAAI,UAAU;GAErD,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO,CAAC,WAAW,UAAU;IAerD,IAAI,CAAC,iBAAiB,SAAS,GAAG;KAC9B,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,6FAElD,CAAC;KACD,aAAa,KAAK,SAAS;KAC3B;IACJ;IAGA,MAAM,WAAW,KAAK,KAAK,QAAQ,GAAG,UAAU,IAAI;IACpD,IAAI,GAAG,WAAW,QAAQ,KAAK,CAAC,OAAO;KACnC,aAAa,KAAK,SAAS;KAC3B;IACJ;IAEA,IAAI,aAAoD,KAAA;IACxD,IAAI,kBACA,IAAI;KAIA,MAAM,EAAE,SAAS,MAAM,OAAO,MAAM,iBAAiB,cAAc,UAAU,SAAS,EAAE,WAAW;KACnG,aAAa;IACjB,SAAS,KAAK;KACV,SAAS,MAAM,OAAO,qCAAqC,UAAU,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;IAChI;IAGJ,MAAM,cAAc,uBAChB,WACA,MACA,KACA,YACA,WACA,SACA,YACA;KAAE;KAAU;KAAiB;KAAY;KAAS;KAAO,eAAe,IAAI,IAAI,eAAe,KAAK,CAAC;IAAE,CAC3G;IAEA,GAAG,cAAc,UAAU,aAAa,OAAO;IAC/C,eAAe,KAAK,SAAS;IAC7B,IAAI,MAAM,MAAM,OAAO,UAAU,CAAC;GACtC,CAAC,CAAC;EACN;EAIA,IAAI,MAAM,SAAS,GAAG;GAClB,QAAQ,EAAE;GACV,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,+EAA+E,CAAC;GACvH,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG,QAAQ,MAAM,KAAK,OAAO,MAAM,CAAC;GACvE,QAAQ,MAAM,KAAK,qFAAqF,CAAC;EAC7G;EAGA,IAAI,eAAe,SAAS,GAAG;GAC3B,MAAM,YAAY,KAAK,KAAK,QAAQ,UAAU;GAE9C,IAAI,GAAG,WAAW,SAAS,KAAK,CAAC,OAAO;IAGpC,MAAM,SAAS,kBADE,GAAG,aAAa,WAAW,OACX,GAAU,cAAc;IACzD,GAAG,cAAc,WAAW,QAAQ,OAAO;GAC/C,OAAO;IAOH,MAAM,WAAW,GAAG,YAAY,MAAM,CAAC,CAClC,QAAO,MAAK,EAAE,SAAS,KAAK,KAAK,MAAM,UAAU,CAAC,CAClD,KAAI,MAAK,EAAE,QAAQ,SAAS,EAAE,CAAC;IAEpC,MAAM,eAAe,qBAAqB,CADxB,mBAAG,IAAI,IAAI,CAAC,GAAG,gBAAgB,GAAG,QAAQ,CAAC,CACnB,CAAQ;IAClD,GAAG,cAAc,WAAW,cAAc,OAAO;GACrD;GACA,IAAI,MAAM,MAAM,OAAO,WAAW,CAAC;EACvC;EAEA,IAAI,EAAE;EACN,IAAI,aAAa,SAAS,GAAG;GACzB,IAAI,MAAM,OAAO,aAAa,aAAa,OAAO,qBAAqB,aAAa,KAAK,IAAI,GAAG,CAAC;GACjG,IAAI,MAAM,KAAK,4CAA4C,CAAC;GAC5D,IAAI,EAAE;EACV;EACA,IAAI,MAAM,KAAK,MAAM,kBAAkB,UAAU,KAAK,sBAAsB,eAAe,OAAO,gBAAgB,CAAC;EACnH,IAAI,MAAM,KAAK,mCAAmC,OAAO,qCAAqC,CAAC;EAC/F,IAAI,EAAE;CAEV,SAAS,GAAG;EACR,SAAS,MAAM,IAAI,mCAAmC,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GAAG,CAAC;EACnG,QAAQ,KAAK,CAAC;CAClB,UAAU;EACN,MAAM,OAAO,IAAI;CACrB;AACJ;AAEA,KAAK,CAAC,CAAC,OAAO,QAAQ;CAClB,SAAS,OAAO,GAAG,CAAC;CACpB,QAAQ,KAAK,CAAC;AAClB,CAAC"}
+{"version":3,"file":"introspect-db.js","names":[],"sources":["../../src/schema/introspect-db-project.ts","../../src/schema/introspect-db-constraints.ts","../../src/schema/introspect-db.ts"],"sourcesContent":["/**\n * What the project being introspected into can actually import.\n *\n * The generator is pure — `introspect-db-logic.ts` reads no files — so the one\n * question it cannot answer for itself lives here: which `defineCollection`, if\n * any, will resolve from the directory the collections are written to.\n */\nimport fs from \"fs\";\nimport path from \"path\";\n\nimport { ADMIN_TYPES_PACKAGE, COMMON_PACKAGE, type CollectionBuilder } from \"./introspect-db-logic\";\n\n/** How far up to look before giving up, if no project root announces itself. */\nconst MAX_LEVELS = 8;\n\n/** Every dependency name a manifest declares, in any of the three fields. */\nfunction declaredDependencies(manifestPath: string): Set<string> {\n    const names = new Set<string>();\n    let parsed: unknown;\n    try {\n        parsed = JSON.parse(fs.readFileSync(manifestPath, \"utf-8\"));\n    } catch {\n        // A malformed or unreadable package.json is not this function's problem\n        // to report — it answers \"can this import resolve\", and the answer is no.\n        return names;\n    }\n    if (typeof parsed !== \"object\" || parsed === null) return names;\n    const manifest = parsed as Record<string, unknown>;\n    for (const field of [\"dependencies\", \"devDependencies\", \"peerDependencies\"]) {\n        const block = manifest[field];\n        if (typeof block === \"object\" && block !== null) {\n            for (const name of Object.keys(block)) names.add(name);\n        }\n    }\n    return names;\n}\n\n/**\n * Which `defineCollection` to generate against, for collections written to `outDir`.\n *\n * **The detection is the package manifests above the output directory**, unioned from\n * `outDir` up to and including the project root — the first ancestor holding a\n * `rebase.json`, or `MAX_LEVELS` up if there is none.\n *\n * That is the rule Node itself applies: a file in `config/collections` resolves a bare\n * specifier through `config/node_modules`, then `<project>/node_modules`, and so on up.\n * Reading the manifests along that same path answers the only question that matters —\n * *will this import resolve in the project I am writing into* — from the state on disk\n * at the moment of generation. The alternatives are all proxies for it: `rebase.json`'s\n * `apps` block says a CMS scaffold declared an admin app, and a `frontend/` directory\n * says one was scaffolded, but neither is what the compiler consults, and either can be\n * true of a project whose `config` package does not depend on `@rebasepro/cms-types`.\n *\n * Ambiguity resolves towards the admin panel: a project that declares both packages has\n * a panel, and `@rebasepro/cms-types` is the flavour that keeps the `admin` block.\n */\nexport function detectCollectionBuilder(outDir: string): CollectionBuilder {\n    let dir = path.resolve(outDir);\n    const declared = new Set<string>();\n\n    for (let level = 0; level < MAX_LEVELS; level++) {\n        const manifest = path.join(dir, \"package.json\");\n        if (fs.existsSync(manifest)) {\n            for (const name of declaredDependencies(manifest)) declared.add(name);\n        }\n        // The project root, and the last level worth reading: anything above it\n        // belongs to whatever the project happens to be checked out inside.\n        if (fs.existsSync(path.join(dir, \"rebase.json\"))) break;\n\n        const parent = path.dirname(dir);\n        if (parent === dir) break;\n        dir = parent;\n    }\n\n    if (declared.has(ADMIN_TYPES_PACKAGE)) return \"admin-types\";\n    if (declared.has(COMMON_PACKAGE)) return \"common\";\n    return \"annotation\";\n}\n","/**\n * Reading validation rules out of CHECK constraints.\n *\n * A CHECK constraint is the schema author stating a rule the database already\n * enforces. Introspection has never read them, so a generated form let the user\n * type a value the database was always going to reject — the rule was written\n * down, in the schema, and the UI asked anyway.\n *\n * Everything here parses the *normalized* text `pg_get_constraintdef` produces,\n * not what the author typed: Postgres re-renders the expression from its parse\n * tree, so `CHECK (price > 0)` on a `numeric` column always comes back as\n * `CHECK ((price > (0)::numeric))`. That normalization is what makes a\n * string-level parser tractable — the input is generated, and the shapes are\n * few.\n *\n * Constraints this cannot read are skipped in full. A partially-understood\n * constraint is worse than an unread one: it would produce validation that\n * *narrows* differently from the database, so a value the UI accepts still\n * fails on write, or — worse — a value the database allows is refused in the\n * form with no way to see why.\n *\n * Pure module: no I/O, no logging.\n */\nimport type { CheckConstraintRow } from \"./introspect-db-logic\";\n\n/** What a table's CHECK constraints say about one column. */\nexport interface ColumnCheckFacts {\n    /** Allowed values, from `IN (…)` / `= ANY (ARRAY[…])` / `= 'literal'`. */\n    enumValues?: string[];\n    /** `x >= n` */\n    min?: number;\n    /** `x <= n` */\n    max?: number;\n    /** `x > n` */\n    moreThan?: number;\n    /** `x < n` */\n    lessThan?: number;\n    /** `length(x) >= n` */\n    lengthMin?: number;\n    /** `length(x) <= n` */\n    lengthMax?: number;\n}\n\n/** Per-table, per-column facts. */\nexport type CheckFactsByTable = Map<string, Map<string, ColumnCheckFacts>>;\n\n/** The length functions whose argument is the column being constrained. */\nconst LENGTH_FUNCTIONS = new Set([\"length\", \"char_length\", \"character_length\", \"octet_length\"]);\n\n/**\n * Splits on a separator that appears at paren depth 0 and outside string\n * literals.\n *\n * Depth tracking is the whole job: `ARRAY['a', 'b']` contains a comma that must\n * not split the enclosing argument list, and `'it''s'` contains a quote that\n * must not end the literal.\n */\nfunction splitTopLevel(input: string, separator: string): string[] {\n    const parts: string[] = [];\n    let depth = 0;\n    let inString = false;\n    let current = \"\";\n\n    for (let i = 0; i < input.length; i++) {\n        const ch = input[i];\n\n        if (inString) {\n            current += ch;\n            if (ch === \"'\") {\n                // '' inside a literal is an escaped quote, not the end of it.\n                if (input[i + 1] === \"'\") {\n                    current += input[++i];\n                } else {\n                    inString = false;\n                }\n            }\n            continue;\n        }\n\n        if (ch === \"'\") {\n            inString = true;\n            current += ch;\n            continue;\n        }\n        if (ch === \"(\" || ch === \"[\") depth++;\n        if (ch === \")\" || ch === \"]\") depth--;\n\n        if (depth === 0 && input.startsWith(separator, i)) {\n            // A word separator must not match inside an identifier: \"AND\" is a\n            // separator in `a AND b` but not in `brand = 1`.\n            const before = input[i - 1];\n            const after = input[i + separator.length];\n            const wordish = /[A-Za-z]/.test(separator[0]);\n            const boundedOk = !wordish || ((before === undefined || !/[A-Za-z0-9_]/.test(before)) &&\n                (after === undefined || !/[A-Za-z0-9_]/.test(after)));\n            if (boundedOk) {\n                parts.push(current);\n                current = \"\";\n                i += separator.length - 1;\n                continue;\n            }\n        }\n\n        current += ch;\n    }\n\n    parts.push(current);\n    return parts.map((p) => p.trim()).filter((p) => p.length > 0);\n}\n\n/** Removes one layer of wrapping parentheses, repeatedly, when balanced. */\nexport function unwrapParens(input: string): string {\n    let s = input.trim();\n    while (s.startsWith(\"(\") && s.endsWith(\")\")) {\n        let depth = 0;\n        let balanced = true;\n        let inString = false;\n        for (let i = 0; i < s.length; i++) {\n            const ch = s[i];\n            if (inString) {\n                if (ch === \"'\") {\n                    if (s[i + 1] === \"'\") i++;\n                    else inString = false;\n                }\n                continue;\n            }\n            if (ch === \"'\") { inString = true; continue; }\n            if (ch === \"(\") depth++;\n            else if (ch === \")\") {\n                depth--;\n                // The opening paren closed before the end, so the outer pair is\n                // not a wrapper: `(a) AND (b)`.\n                if (depth === 0 && i < s.length - 1) { balanced = false; break; }\n            }\n        }\n        if (!balanced) break;\n        s = s.slice(1, -1).trim();\n    }\n    return s;\n}\n\n/** Drops trailing `::type` casts, including array and quoted forms. */\nexport function stripCasts(input: string): string {\n    let s = unwrapParens(input);\n    let previous: string;\n    do {\n        previous = s;\n        s = unwrapParens(\n            s.replace(/::\\s*\"?[A-Za-z_][A-Za-z0-9_ ]*\"?(\\s*\\(\\s*\\d+\\s*(,\\s*\\d+\\s*)?\\))?(\\s*\\[\\s*\\])*\\s*$/, \"\").trim()\n        );\n    } while (s !== previous);\n    return s;\n}\n\n/** A bare, unquoted column reference — anything else is an expression. */\nfunction asColumnName(input: string): string | null {\n    const s = stripCasts(input);\n    if (/^[a-z_][a-z0-9_$]*$/i.test(s)) return s;\n    // A quoted identifier keeps its case: \"userId\".\n    const quoted = s.match(/^\"([^\"]+)\"$/);\n    return quoted ? quoted[1] : null;\n}\n\n/** `length(col)` and friends → the column they measure. */\nfunction asLengthOfColumn(input: string): string | null {\n    const s = stripCasts(input);\n    const match = s.match(/^([a-z_]+)\\s*\\((.*)\\)$/is);\n    if (!match || !LENGTH_FUNCTIONS.has(match[1].toLowerCase())) return null;\n    return asColumnName(match[2]);\n}\n\n/** A numeric literal, after casts are removed. Rejects anything else. */\nfunction asNumber(input: string): number | null {\n    const s = stripCasts(input).replace(/^'(.*)'$/s, \"$1\");\n    if (!/^[+-]?(\\d+\\.?\\d*|\\.\\d+)$/.test(s)) return null;\n    const n = Number(s);\n    return Number.isFinite(n) ? n : null;\n}\n\n/** A single-quoted string literal, with `''` unescaped. */\nfunction asStringLiteral(input: string): string | null {\n    const s = stripCasts(input);\n    if (!s.startsWith(\"'\") || !s.endsWith(\"'\") || s.length < 2) return null;\n    const body = s.slice(1, -1);\n    // Any unescaped quote inside means this was not one literal.\n    if (/(^|[^'])'($|[^'])/.test(body)) return null;\n    return body.replace(/''/g, \"'\");\n}\n\n/** The element list of `ARRAY[…]`, or of a parenthesised `IN (…)` list. */\nfunction asValueList(input: string): string[] | null {\n    const s = stripCasts(input);\n    const arrayMatch = s.match(/^ARRAY\\s*\\[(.*)\\]$/is);\n    const body = arrayMatch ? arrayMatch[1] : (s.startsWith(\"(\") && s.endsWith(\")\") ? s.slice(1, -1) : null);\n    if (body === null) return null;\n    if (body.trim() === \"\") return null;\n\n    const values: string[] = [];\n    for (const element of splitTopLevel(body, \",\")) {\n        const literal = asStringLiteral(element);\n        if (literal !== null) {\n            values.push(literal);\n            continue;\n        }\n        const numeric = asNumber(element);\n        if (numeric !== null) {\n            values.push(String(numeric));\n            continue;\n        }\n        return null; // A non-literal element means this is not an enumeration.\n    }\n    return values;\n}\n\n/** One understood comparison, already resolved to the column it constrains. */\ninterface CheckTerm {\n    column: string;\n    apply: (facts: ColumnCheckFacts) => void;\n}\n\n/**\n * Parses one conjunct. Returns null when the shape is not one of the few this\n * understands, which is the signal to abandon the whole constraint.\n */\nfunction parseTerm(rawTerm: string): CheckTerm | null {\n    const term = unwrapParens(rawTerm);\n\n    // ── Membership: `x = ANY (ARRAY[…])`, `x IN (…)` ──────────────────\n    const anyMatch = term.match(/^(.*?)\\s*=\\s*ANY\\s*(\\(.*\\))$/is);\n    const inMatch = anyMatch ? null : term.match(/^(.*?)\\s+IN\\s*(\\(.*\\))$/is);\n    const membership = anyMatch ?? inMatch;\n    if (membership) {\n        const column = asColumnName(membership[1]);\n        const values = asValueList(membership[2]);\n        if (!column || !values || values.length === 0) return null;\n        return {\n            column,\n            apply: (facts) => {\n                // Two membership checks on one column mean both must hold.\n                facts.enumValues = facts.enumValues\n                    ? facts.enumValues.filter((v) => values.includes(v))\n                    : values;\n            }\n        };\n    }\n\n    // ── Comparison: `x >= n`, `length(x) <= n`, `x = 'literal'` ───────\n    // Longest operators first so `>=` is not read as `>`.\n    for (const operator of [\">=\", \"<=\", \"<>\", \"!=\", \"=\", \">\", \"<\"] as const) {\n        const parts = splitTopLevel(term, operator);\n        if (parts.length !== 2) continue;\n        const [rawLeft, rawRight] = parts;\n\n        const lengthColumn = asLengthOfColumn(rawLeft);\n        if (lengthColumn) {\n            const bound = asNumber(rawRight);\n            if (bound === null) return null;\n            switch (operator) {\n                case \">=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound, bound); } };\n                case \">\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound + 1, bound + 1); } };\n                case \"<=\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound, bound); } };\n                case \"<\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound - 1, bound - 1); } };\n                case \"=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = bound; f.lengthMax = bound; } };\n                default: return null;\n            }\n        }\n\n        const column = asColumnName(rawLeft);\n        if (!column) continue;\n\n        if (operator === \"=\") {\n            const literal = asStringLiteral(rawRight);\n            if (literal !== null) {\n                return {\n                    column,\n                    apply: (facts) => {\n                        facts.enumValues = facts.enumValues\n                            ? facts.enumValues.filter((v) => v === literal)\n                            : [literal];\n                    }\n                };\n            }\n            // `x = 5` pins a number. Expressed as both bounds rather than as a\n            // one-value enum, which for a number would render as a dropdown.\n            const pinned = asNumber(rawRight);\n            if (pinned === null) return null;\n            return { column, apply: (f) => { f.min = pinned; f.max = pinned; } };\n        }\n\n        const bound = asNumber(rawRight);\n        if (bound === null) return null;\n        switch (operator) {\n            case \">=\": return { column, apply: (f) => { f.min = Math.max(f.min ?? bound, bound); } };\n            case \">\": return { column, apply: (f) => { f.moreThan = Math.max(f.moreThan ?? bound, bound); } };\n            case \"<=\": return { column, apply: (f) => { f.max = Math.min(f.max ?? bound, bound); } };\n            case \"<\": return { column, apply: (f) => { f.lessThan = Math.min(f.lessThan ?? bound, bound); } };\n            default: return null; // `<>` / `!=` exclude rather than bound.\n        }\n    }\n\n    return null;\n}\n\n/**\n * Reads one constraint definition into per-column facts.\n *\n * Returns an empty map for anything not understood — including a constraint\n * that is understood but spans two columns (`start_date < end_date`), which no\n * per-property validation rule can express.\n */\nexport function parseCheckDefinition(definition: string): Map<string, ColumnCheckFacts> {\n    const result = new Map<string, ColumnCheckFacts>();\n\n    const body = definition\n        .trim()\n        .replace(/\\s+NOT\\s+VALID\\s*$/i, \"\")\n        .replace(/^CHECK\\s*/i, \"\")\n        .trim();\n    if (body === definition.trim()) return result; // Not a CHECK definition.\n\n    const expression = unwrapParens(body);\n    if (!expression) return result;\n\n    // Only conjunctions. A disjunction (`a OR b`) does not narrow a column: each\n    // branch may allow what the other forbids, so no single bound follows.\n    if (splitTopLevel(expression, \" OR \").length > 1) return result;\n\n    const terms = splitTopLevel(expression, \" AND \");\n    const parsed: CheckTerm[] = [];\n    for (const term of terms) {\n        const one = parseTerm(term);\n        if (!one) return result; // One unreadable conjunct voids the constraint.\n        parsed.push(one);\n    }\n\n    // A CHECK naming two columns constrains their *relationship*; keeping the\n    // half that mentions one column would assert something the database does not.\n    const columns = new Set(parsed.map((t) => t.column));\n    if (columns.size !== 1) return result;\n\n    const facts: ColumnCheckFacts = {};\n    for (const term of parsed) term.apply(facts);\n    if (Object.keys(facts).length === 0) return result;\n\n    result.set(parsed[0].column, facts);\n    return result;\n}\n\n/** Merges every readable CHECK in the schema into per-table, per-column facts. */\nexport function parseCheckConstraints(rows: CheckConstraintRow[]): CheckFactsByTable {\n    const byTable: CheckFactsByTable = new Map();\n\n    for (const row of rows) {\n        const parsed = parseCheckDefinition(row.definition);\n        if (parsed.size === 0) continue;\n\n        let table = byTable.get(row.table_name);\n        if (!table) {\n            table = new Map();\n            byTable.set(row.table_name, table);\n        }\n\n        for (const [column, facts] of parsed) {\n            const existing = table.get(column);\n            if (!existing) {\n                table.set(column, facts);\n                continue;\n            }\n            // Separate constraints on the same column all hold at once.\n            if (facts.enumValues) {\n                existing.enumValues = existing.enumValues\n                    ? existing.enumValues.filter((v) => facts.enumValues!.includes(v))\n                    : facts.enumValues;\n            }\n            if (facts.min !== undefined) existing.min = Math.max(existing.min ?? facts.min, facts.min);\n            if (facts.max !== undefined) existing.max = Math.min(existing.max ?? facts.max, facts.max);\n            if (facts.moreThan !== undefined) existing.moreThan = Math.max(existing.moreThan ?? facts.moreThan, facts.moreThan);\n            if (facts.lessThan !== undefined) existing.lessThan = Math.min(existing.lessThan ?? facts.lessThan, facts.lessThan);\n            if (facts.lengthMin !== undefined) existing.lengthMin = Math.max(existing.lengthMin ?? facts.lengthMin, facts.lengthMin);\n            if (facts.lengthMax !== undefined) existing.lengthMax = Math.min(existing.lengthMax ?? facts.lengthMax, facts.lengthMax);\n        }\n    }\n\n    return byTable;\n}\n","import chalk from \"chalk\";\nimport fs from \"fs\";\nimport path from \"path\";\nimport pg from \"pg\";\nimport arg from \"arg\";\nimport * as dotenv from \"dotenv\";\nimport readline from \"readline\";\n\nimport {\n    buildTablesMap,\n    buildEnumMap,\n    compositeKeySkipReason,\n    generateCollectionFile,\n    generateIndexContent,\n    mergeIndexContent,\n    safeHostFromUrl\n} from \"./introspect-db-logic\";\nimport { detectCollectionBuilder } from \"./introspect-db-project\";\nimport { countRowsUpTo, isUsableFileName, quoteRelation, readSchemaMetadata } from \"./introspect-db-queries\";\nimport { classifyTables, lookupCandidates, LOOKUP_MAX_ROWS } from \"./introspect-db-structure\";\nimport { parseCheckConstraints } from \"./introspect-db-constraints\";\nimport { out, outWarn, outError } from \"../cli-output\";\n\nasync function main() {\n    const args = arg(\n        {\n            \"--output\": String,\n            \"--collections\": String,\n            \"--force\": Boolean,\n            \"--schema\": String,\n            \"--data-inference\": Boolean,\n            \"--no-data-inference\": Boolean,\n            \"-o\": \"--output\",\n            \"-c\": \"--collections\",\n            \"-f\": \"--force\"\n        },\n        { permissive: true }\n    );\n\n    const cwd = process.cwd();\n    const isBackendDir = path.basename(cwd) === \"backend\";\n    const defaultOutDir = isBackendDir\n        ? path.resolve(cwd, \"..\", \"config\", \"collections\")\n        : path.resolve(cwd, \"config\", \"collections\");\n\n    const outDir = args[\"--output\"] || args[\"--collections\"] || defaultOutDir;\n    const force = args[\"--force\"] || false;\n    const pgSchema = args[\"--schema\"] || \"public\";\n\n    if (!fs.existsSync(outDir)) {\n        fs.mkdirSync(outDir, { recursive: true });\n    }\n\n    // Load env\n    const envPaths = [\n        process.env.DOTENV_CONFIG_PATH,\n        path.resolve(process.cwd(), \".env\"),\n        path.resolve(process.cwd(), \"../.env\"),\n        path.resolve(process.cwd(), \"../../.env\")\n    ].filter(Boolean) as string[];\n\n    for (const p of envPaths) {\n        if (fs.existsSync(p)) {\n            dotenv.config({ path: p, quiet: true });\n            break;\n        }\n    }\n\n    const databaseUrl = process.env.DATABASE_URL || process.env.ADMIN_CONNECTION_STRING;\n    if (!databaseUrl) {\n        outError(chalk.red(\"✗ DATABASE_URL is not set. Make sure your .env file is configured.\"));\n        process.exit(1);\n    }\n\n    const client = new pg.Client({ connectionString: databaseUrl });\n\n    try {\n        await client.connect();\n    } catch (err) {\n        outError(chalk.red(`✗ Failed to connect to database: ${err instanceof Error ? err.message : String(err)}`));\n        outError(chalk.gray(\"  Check your DATABASE_URL and ensure the database is reachable.\"));\n        process.exit(1);\n    }\n\n    // Log the host portion safely — handle URLs without \"@\"\n    const hostPart = safeHostFromUrl(databaseUrl);\n    out(chalk.gray(`Connected to database: ${hostPart}`));\n    out(chalk.gray(`Introspecting schema '${pgSchema}'...`));\n\n    try {\n        const metadata = await readSchemaMetadata(client, pgSchema);\n        const enumMap = buildEnumMap(metadata.enumValues);\n        const tablesMap = buildTablesMap(metadata.tables, metadata.columns, metadata.pks, metadata.fks);\n        const fks = metadata.fks;\n\n        // Only tables that could structurally be a code list are counted, and\n        // each count stops at the threshold — see `countRowsUpTo`. Introspection\n        // runs against a database it does not own, so \"cheap on a table of any\n        // size\" is a requirement, not an optimization.\n        for (const table of lookupCandidates(metadata, tablesMap)) {\n            try {\n                metadata.rowCounts[table] = await countRowsUpTo(client, pgSchema, table, LOOKUP_MAX_ROWS);\n            } catch (err) {\n                // A table this run cannot read is simply not classified as a code\n                // list; everything else about it still generates.\n                out(chalk.gray(`  (skipped row count for ${table}: ${err instanceof Error ? err.message : String(err)})`));\n            }\n        }\n\n        const classifications = classifyTables(metadata, tablesMap);\n        const checkFacts = parseCheckConstraints(metadata.checks);\n\n        // Which builder the generated files may import — read from the manifests\n        // above `outDir`, because a project without `@rebasepro/cms-types` cannot\n        // resolve that import and has no `admin` block to write into either.\n        const builder = detectCollectionBuilder(outDir);\n        if (builder === \"annotation\") {\n            outWarn(chalk.yellow(\n                \"⚠ Neither @rebasepro/cms-types nor @rebasepro/common is declared above \" +\n                `${outDir}.`\n            ));\n            outWarn(chalk.gray(\n                \"  Generating plain type annotations, which widen the property keys to `string`: \" +\n                \"`propertiesOrder` and friends will not be checked. Add @rebasepro/common to the \" +\n                \"config package to turn that checking on.\"\n            ));\n        }\n        const joinTables = new Set(\n            Array.from(classifications.values())\n                .filter((c) => c.role === \"junction\")\n                .map((c) => c.table)\n        );\n\n        const roleCount = (role: string) =>\n            Array.from(classifications.values()).filter((c) => c.role === role).length;\n\n        out(chalk.blue(`Found ${tablesMap.size} tables.`));\n        out(chalk.gray(\n            `  ${roleCount(\"entity\")} entities, ${joinTables.size} join tables (folded into relations), ` +\n            `${roleCount(\"lookup\")} code lists, ${roleCount(\"owned-child\")} owned by another table (hidden from navigation).`\n        ));\n\n        let runDataInference = false;\n        if (args[\"--no-data-inference\"]) {\n            runDataInference = false;\n        } else if (args[\"--data-inference\"] !== undefined) {\n            runDataInference = args[\"--data-inference\"];\n        } else if (!process.stdin.isTTY) {\n            // No terminal to answer the question below (scaffolding scripts, CI,\n            // `rebase init --introspect`) — asking would hang forever.\n            out(chalk.gray(\"Skipping data inference (non-interactive run; pass --data-inference to enable).\"));\n        } else {\n            const rl = readline.createInterface({\n                input: process.stdin,\n                output: process.stdout\n            });\n            const answer = await new Promise<string>((resolve) => rl.question(chalk.yellow(\"? Do you want to run comprehensive data inference on sampled rows to auto-detect types, formats, constraints, and UI configurations? (y/N) \"), resolve));\n            runDataInference = answer.trim().toLowerCase() === \"y\";\n            rl.close();\n        }\n\n        if (runDataInference) {\n            out(chalk.gray(\"Sampling database rows for data inference...\"));\n        }\n\n        // Generate Collections\n        const generatedFiles: string[] = [];\n        const skippedFiles: string[] = [];\n\n        // A table keyed on more than one column is generated with `isId` on\n        // every key column — one composite key, which the planner builds the\n        // same way — unless that cannot round-trip: a key column no `isId` can\n        // mark, or a link pointing at the table (see `compositeKeySkipReason`).\n        // Those are left out, with the reason. Generating one anyway produced a\n        // file that read the table by an `id` column it does not have, and a\n        // push that planned that column as its new primary key.\n        const compositeKeyed = new Map(\n            Array.from(tablesMap.entries())\n                .filter(([tableName]) => !joinTables.has(tableName))\n                .map(([tableName, meta]) => [tableName, compositeKeySkipReason(meta, fks)] as const)\n                .filter((entry): entry is readonly [string, string] => entry[1] !== undefined)\n        );\n        for (const [tableName, reason] of compositeKeyed) {\n            outWarn(chalk.yellow(\n                `⚠ Skipping table ${JSON.stringify(tableName)}: it is keyed on ` +\n                `(${tablesMap.get(tableName)?.pks.join(\", \")}), and ${reason}. ` +\n                \"`rebase db push` leaves a table that is not a collection alone.\"\n            ));\n        }\n        const notes: string[] = [];\n\n        const tablesToProcess = Array.from(tablesMap.entries())\n            .filter(([tableName]) => !joinTables.has(tableName) && !compositeKeyed.has(tableName));\n\n        const BATCH_SIZE = 10;\n        for (let i = 0; i < tablesToProcess.length; i += BATCH_SIZE) {\n            const batch = tablesToProcess.slice(i, i + BATCH_SIZE);\n\n            await Promise.all(batch.map(async ([tableName, meta]) => {\n                // ── The name has to be usable as a filename ────────────────\n                //\n                // `tableName` came out of `pg_class` in a database this tool\n                // did not create — adopting somebody else's database is the\n                // whole point of introspection — and it is about to be joined\n                // onto a path. Postgres will happily hold a table called\n                // `../../../etc/cron.d/x`, and `path.join` resolves it: the\n                // generator would write a TypeScript file wherever that\n                // pointed, as whoever ran the command.\n                //\n                // Skipped rather than sanitised. A file named something other\n                // than its table is a collection that does not round-trip, and\n                // silently renaming it would be a worse surprise than one line\n                // saying which table was left out.\n                if (!isUsableFileName(tableName)) {\n                    outWarn(chalk.yellow(\n                        `⚠ Skipping table ${JSON.stringify(tableName)}: its name cannot be used as a ` +\n                        \"filename. Rename the table, or write this collection by hand.\"\n                    ));\n                    skippedFiles.push(tableName);\n                    return;\n                }\n\n                // ── File overwrite protection ──────────────────────────────\n                const filePath = path.join(outDir, `${tableName}.ts`);\n                if (fs.existsSync(filePath) && !force) {\n                    skippedFiles.push(tableName);\n                    return;\n                }\n\n                let sampleData: Record<string, unknown>[] | undefined = undefined;\n                if (runDataInference) {\n                    try {\n                        // Quoted by `quoteRelation`, which doubles an embedded\n                        // quote. Wrapping a catalogue name in `\"` is not\n                        // escaping it — see that function.\n                        const { rows } = await client.query(`SELECT * FROM ${quoteRelation(pgSchema, tableName)} LIMIT 100`);\n                        sampleData = rows;\n                    } catch (err) {\n                        outError(chalk.yellow(`⚠ Failed to sample data for table ${tableName}: ${err instanceof Error ? err.message : String(err)}`));\n                    }\n                }\n\n                const fileContent = generateCollectionFile(\n                    tableName,\n                    meta,\n                    fks,\n                    joinTables,\n                    tablesMap,\n                    enumMap,\n                    sampleData,\n                    { metadata, classifications, checkFacts, builder, notes, skippedTables: new Set(compositeKeyed.keys()) }\n                );\n\n                fs.writeFileSync(filePath, fileContent, \"utf-8\");\n                generatedFiles.push(tableName);\n                out(chalk.green(`  ✓ ${filePath}`));\n            }));\n        }\n\n        // Every column the planner will not reproduce exactly, before anyone\n        // pushes. Each line is also at the top of its file.\n        if (notes.length > 0) {\n            outWarn(\"\");\n            outWarn(chalk.yellow(`⚠ ${notes.length} column(s) will not round-trip exactly — \\`rebase db push\\` would change them:`));\n            for (const note of [...notes].sort()) outWarn(chalk.gray(`  - ${note}`));\n            outWarn(chalk.gray(\"  Read these before the first push. Run `rebase db push --dry-run` to see the plan.\"));\n        }\n\n        // Generate index.ts (sorted alphabetically for deterministic output)\n        if (generatedFiles.length > 0) {\n            const indexPath = path.join(outDir, \"index.ts\");\n\n            if (fs.existsSync(indexPath) && !force) {\n                // Merge: read existing index, add new exports that don't already exist\n                const existing = fs.readFileSync(indexPath, \"utf-8\");\n                const merged = mergeIndexContent(existing, generatedFiles);\n                fs.writeFileSync(indexPath, merged, \"utf-8\");\n            } else {\n                // --force replaces collections derived from the database, but the\n                // directory can also hold hand-written ones with no table in the\n                // introspected schema (the auth users collection lives in\n                // \"rebase\"). The backend discovers the whole directory, so an\n                // index listing only introspected tables would silently drop them\n                // from the admin UI while the API still served them.\n                const siblings = fs.readdirSync(outDir)\n                    .filter(f => f.endsWith(\".ts\") && f !== \"index.ts\")\n                    .map(f => f.replace(/\\.ts$/, \"\"));\n                const allFiles = [...new Set([...generatedFiles, ...siblings])];\n                const indexContent = generateIndexContent(allFiles);\n                fs.writeFileSync(indexPath, indexContent, \"utf-8\");\n            }\n            out(chalk.green(`  ✓ ${indexPath}`));\n        }\n\n        out(\"\");\n        if (skippedFiles.length > 0) {\n            out(chalk.yellow(`⚠ Skipped ${skippedFiles.length} existing file(s): ${skippedFiles.join(\", \")}`));\n            out(chalk.gray(\"  Use --force to overwrite existing files.\"));\n            out(\"\");\n        }\n        out(chalk.bold.green(`✓ Introspected ${tablesMap.size} tables — generated ${generatedFiles.length} collection(s).`));\n        out(chalk.gray(`  Review the generated files in ${outDir} and customize properties as needed.`));\n        out(\"\");\n\n    } catch (e) {\n        outError(chalk.red(`✗ Error introspecting database: ${e instanceof Error ? e.message : String(e)}`));\n        process.exit(1);\n    } finally {\n        await client.end();\n    }\n}\n\nmain().catch((err) => {\n    outError(String(err));\n    process.exit(1);\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAaA,IAAM,aAAa;;AAGnB,SAAS,qBAAqB,cAAmC;CAC7D,MAAM,wBAAQ,IAAI,IAAY;CAC9B,IAAI;CACJ,IAAI;EACA,SAAS,KAAK,MAAM,GAAG,aAAa,cAAc,OAAO,CAAC;CAC9D,QAAQ;EAGJ,OAAO;CACX;CACA,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM,OAAO;CAC1D,MAAM,WAAW;CACjB,KAAK,MAAM,SAAS;EAAC;EAAgB;EAAmB;CAAkB,GAAG;EACzE,MAAM,QAAQ,SAAS;EACvB,IAAI,OAAO,UAAU,YAAY,UAAU,MACvC,KAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,GAAG,MAAM,IAAI,IAAI;CAE7D;CACA,OAAO;AACX;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,wBAAwB,QAAmC;CACvE,IAAI,MAAM,KAAK,QAAQ,MAAM;CAC7B,MAAM,2BAAW,IAAI,IAAY;CAEjC,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,SAAS;EAC7C,MAAM,WAAW,KAAK,KAAK,KAAK,cAAc;EAC9C,IAAI,GAAG,WAAW,QAAQ,GACtB,KAAK,MAAM,QAAQ,qBAAqB,QAAQ,GAAG,SAAS,IAAI,IAAI;EAIxE,IAAI,GAAG,WAAW,KAAK,KAAK,KAAK,aAAa,CAAC,GAAG;EAElD,MAAM,SAAS,KAAK,QAAQ,GAAG;EAC/B,IAAI,WAAW,KAAK;EACpB,MAAM;CACV;CAEA,IAAI,SAAS,IAAA,sBAAuB,GAAG,OAAO;CAC9C,IAAI,SAAS,IAAA,mBAAkB,GAAG,OAAO;CACzC,OAAO;AACX;;;;AC9BA,IAAM,mCAAmB,IAAI,IAAI;CAAC;CAAU;CAAe;CAAoB;AAAc,CAAC;;;;;;;;;AAU9F,SAAS,cAAc,OAAe,WAA6B;CAC/D,MAAM,QAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,IAAI,WAAW;CACf,IAAI,UAAU;CAEd,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,KAAK,MAAM;EAEjB,IAAI,UAAU;GACV,WAAW;GACX,IAAI,OAAO,KAEP,IAAI,MAAM,IAAI,OAAO,KACjB,WAAW,MAAM,EAAE;QAEnB,WAAW;GAGnB;EACJ;EAEA,IAAI,OAAO,KAAK;GACZ,WAAW;GACX,WAAW;GACX;EACJ;EACA,IAAI,OAAO,OAAO,OAAO,KAAK;EAC9B,IAAI,OAAO,OAAO,OAAO,KAAK;EAE9B,IAAI,UAAU,KAAK,MAAM,WAAW,WAAW,CAAC,GAAG;GAG/C,MAAM,SAAS,MAAM,IAAI;GACzB,MAAM,QAAQ,MAAM,IAAI,UAAU;GAIlC,IAFkB,CADF,WAAW,KAAK,UAAU,EACvB,MAAa,WAAW,KAAA,KAAa,CAAC,eAAe,KAAK,MAAM,OAC9E,UAAU,KAAA,KAAa,CAAC,eAAe,KAAK,KAAK,IACvC;IACX,MAAM,KAAK,OAAO;IAClB,UAAU;IACV,KAAK,UAAU,SAAS;IACxB;GACJ;EACJ;EAEA,WAAW;CACf;CAEA,MAAM,KAAK,OAAO;CAClB,OAAO,MAAM,KAAK,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,CAAC;AAChE;;AAGA,SAAgB,aAAa,OAAuB;CAChD,IAAI,IAAI,MAAM,KAAK;CACnB,OAAO,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG,GAAG;EACzC,IAAI,QAAQ;EACZ,IAAI,WAAW;EACf,IAAI,WAAW;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;GAC/B,MAAM,KAAK,EAAE;GACb,IAAI,UAAU;IACV,IAAI,OAAO,KACP,IAAI,EAAE,IAAI,OAAO,KAAK;SACjB,WAAW;IAEpB;GACJ;GACA,IAAI,OAAO,KAAK;IAAE,WAAW;IAAM;GAAU;GAC7C,IAAI,OAAO,KAAK;QACX,IAAI,OAAO,KAAK;IACjB;IAGA,IAAI,UAAU,KAAK,IAAI,EAAE,SAAS,GAAG;KAAE,WAAW;KAAO;IAAO;GACpE;EACJ;EACA,IAAI,CAAC,UAAU;EACf,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK;CAC5B;CACA,OAAO;AACX;;AAGA,SAAgB,WAAW,OAAuB;CAC9C,IAAI,IAAI,aAAa,KAAK;CAC1B,IAAI;CACJ,GAAG;EACC,WAAW;EACX,IAAI,aACA,EAAE,QAAQ,qFAAqF,EAAE,CAAC,CAAC,KAAK,CAC5G;CACJ,SAAS,MAAM;CACf,OAAO;AACX;;AAGA,SAAS,aAAa,OAA8B;CAChD,MAAM,IAAI,WAAW,KAAK;CAC1B,IAAI,uBAAuB,KAAK,CAAC,GAAG,OAAO;CAE3C,MAAM,SAAS,EAAE,MAAM,aAAa;CACpC,OAAO,SAAS,OAAO,KAAK;AAChC;;AAGA,SAAS,iBAAiB,OAA8B;CAEpD,MAAM,QADI,WAAW,KACP,CAAA,CAAE,MAAM,0BAA0B;CAChD,IAAI,CAAC,SAAS,CAAC,iBAAiB,IAAI,MAAM,EAAE,CAAC,YAAY,CAAC,GAAG,OAAO;CACpE,OAAO,aAAa,MAAM,EAAE;AAChC;;AAGA,SAAS,SAAS,OAA8B;CAC5C,MAAM,IAAI,WAAW,KAAK,CAAC,CAAC,QAAQ,aAAa,IAAI;CACrD,IAAI,CAAC,2BAA2B,KAAK,CAAC,GAAG,OAAO;CAChD,MAAM,IAAI,OAAO,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AACpC;;AAGA,SAAS,gBAAgB,OAA8B;CACnD,MAAM,IAAI,WAAW,KAAK;CAC1B,IAAI,CAAC,EAAE,WAAW,GAAG,KAAK,CAAC,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,OAAO;CACnE,MAAM,OAAO,EAAE,MAAM,GAAG,EAAE;CAE1B,IAAI,oBAAoB,KAAK,IAAI,GAAG,OAAO;CAC3C,OAAO,KAAK,QAAQ,OAAO,GAAG;AAClC;;AAGA,SAAS,YAAY,OAAgC;CACjD,MAAM,IAAI,WAAW,KAAK;CAC1B,MAAM,aAAa,EAAE,MAAM,sBAAsB;CACjD,MAAM,OAAO,aAAa,WAAW,KAAM,EAAE,WAAW,GAAG,KAAK,EAAE,SAAS,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI;CACnG,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,KAAK,KAAK,MAAM,IAAI,OAAO;CAE/B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,WAAW,cAAc,MAAM,GAAG,GAAG;EAC5C,MAAM,UAAU,gBAAgB,OAAO;EACvC,IAAI,YAAY,MAAM;GAClB,OAAO,KAAK,OAAO;GACnB;EACJ;EACA,MAAM,UAAU,SAAS,OAAO;EAChC,IAAI,YAAY,MAAM;GAClB,OAAO,KAAK,OAAO,OAAO,CAAC;GAC3B;EACJ;EACA,OAAO;CACX;CACA,OAAO;AACX;;;;;AAYA,SAAS,UAAU,SAAmC;CAClD,MAAM,OAAO,aAAa,OAAO;CAGjC,MAAM,WAAW,KAAK,MAAM,gCAAgC;CAC5D,MAAM,UAAU,WAAW,OAAO,KAAK,MAAM,2BAA2B;CACxE,MAAM,aAAa,YAAY;CAC/B,IAAI,YAAY;EACZ,MAAM,SAAS,aAAa,WAAW,EAAE;EACzC,MAAM,SAAS,YAAY,WAAW,EAAE;EACxC,IAAI,CAAC,UAAU,CAAC,UAAU,OAAO,WAAW,GAAG,OAAO;EACtD,OAAO;GACH;GACA,QAAQ,UAAU;IAEd,MAAM,aAAa,MAAM,aACnB,MAAM,WAAW,QAAQ,MAAM,OAAO,SAAS,CAAC,CAAC,IACjD;GACV;EACJ;CACJ;CAIA,KAAK,MAAM,YAAY;EAAC;EAAM;EAAM;EAAM;EAAM;EAAK;EAAK;CAAG,GAAY;EACrE,MAAM,QAAQ,cAAc,MAAM,QAAQ;EAC1C,IAAI,MAAM,WAAW,GAAG;EACxB,MAAM,CAAC,SAAS,YAAY;EAE5B,MAAM,eAAe,iBAAiB,OAAO;EAC7C,IAAI,cAAc;GACd,MAAM,QAAQ,SAAS,QAAQ;GAC/B,IAAI,UAAU,MAAM,OAAO;GAC3B,QAAQ,UAAR;IACI,KAAK,MAAM,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,OAAO,KAAK;KAAG;IAAE;IACjH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,QAAQ,GAAG,QAAQ,CAAC;KAAG;IAAE;IACxH,KAAK,MAAM,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,OAAO,KAAK;KAAG;IAAE;IACjH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,QAAQ,GAAG,QAAQ,CAAC;KAAG;IAAE;IACxH,KAAK,KAAK,OAAO;KAAE,QAAQ;KAAc,QAAQ,MAAM;MAAE,EAAE,YAAY;MAAO,EAAE,YAAY;KAAO;IAAE;IACrG,SAAS,OAAO;GACpB;EACJ;EAEA,MAAM,SAAS,aAAa,OAAO;EACnC,IAAI,CAAC,QAAQ;EAEb,IAAI,aAAa,KAAK;GAClB,MAAM,UAAU,gBAAgB,QAAQ;GACxC,IAAI,YAAY,MACZ,OAAO;IACH;IACA,QAAQ,UAAU;KACd,MAAM,aAAa,MAAM,aACnB,MAAM,WAAW,QAAQ,MAAM,MAAM,OAAO,IAC5C,CAAC,OAAO;IAClB;GACJ;GAIJ,MAAM,SAAS,SAAS,QAAQ;GAChC,IAAI,WAAW,MAAM,OAAO;GAC5B,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM;KAAQ,EAAE,MAAM;IAAQ;GAAE;EACvE;EAEA,MAAM,QAAQ,SAAS,QAAQ;EAC/B,IAAI,UAAU,MAAM,OAAO;EAC3B,QAAQ,UAAR;GACI,KAAK,MAAM,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM,KAAK,IAAI,EAAE,OAAO,OAAO,KAAK;IAAG;GAAE;GACvF,KAAK,KAAK,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,WAAW,KAAK,IAAI,EAAE,YAAY,OAAO,KAAK;IAAG;GAAE;GAChG,KAAK,MAAM,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,MAAM,KAAK,IAAI,EAAE,OAAO,OAAO,KAAK;IAAG;GAAE;GACvF,KAAK,KAAK,OAAO;IAAE;IAAQ,QAAQ,MAAM;KAAE,EAAE,WAAW,KAAK,IAAI,EAAE,YAAY,OAAO,KAAK;IAAG;GAAE;GAChG,SAAS,OAAO;EACpB;CACJ;CAEA,OAAO;AACX;;;;;;;;AASA,SAAgB,qBAAqB,YAAmD;CACpF,MAAM,yBAAS,IAAI,IAA8B;CAEjD,MAAM,OAAO,WACR,KAAK,CAAC,CACN,QAAQ,uBAAuB,EAAE,CAAC,CAClC,QAAQ,cAAc,EAAE,CAAC,CACzB,KAAK;CACV,IAAI,SAAS,WAAW,KAAK,GAAG,OAAO;CAEvC,MAAM,aAAa,aAAa,IAAI;CACpC,IAAI,CAAC,YAAY,OAAO;CAIxB,IAAI,cAAc,YAAY,MAAM,CAAC,CAAC,SAAS,GAAG,OAAO;CAEzD,MAAM,QAAQ,cAAc,YAAY,OAAO;CAC/C,MAAM,SAAsB,CAAC;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACtB,MAAM,MAAM,UAAU,IAAI;EAC1B,IAAI,CAAC,KAAK,OAAO;EACjB,OAAO,KAAK,GAAG;CACnB;CAKA,IAAI,IADgB,IAAI,OAAO,KAAK,MAAM,EAAE,MAAM,CAC9C,CAAA,CAAQ,SAAS,GAAG,OAAO;CAE/B,MAAM,QAA0B,CAAC;CACjC,KAAK,MAAM,QAAQ,QAAQ,KAAK,MAAM,KAAK;CAC3C,IAAI,OAAO,KAAK,KAAK,CAAC,CAAC,WAAW,GAAG,OAAO;CAE5C,OAAO,IAAI,OAAO,EAAE,CAAC,QAAQ,KAAK;CAClC,OAAO;AACX;;AAGA,SAAgB,sBAAsB,MAA+C;CACjF,MAAM,0BAA6B,IAAI,IAAI;CAE3C,KAAK,MAAM,OAAO,MAAM;EACpB,MAAM,SAAS,qBAAqB,IAAI,UAAU;EAClD,IAAI,OAAO,SAAS,GAAG;EAEvB,IAAI,QAAQ,QAAQ,IAAI,IAAI,UAAU;EACtC,IAAI,CAAC,OAAO;GACR,wBAAQ,IAAI,IAAI;GAChB,QAAQ,IAAI,IAAI,YAAY,KAAK;EACrC;EAEA,KAAK,MAAM,CAAC,QAAQ,UAAU,QAAQ;GAClC,MAAM,WAAW,MAAM,IAAI,MAAM;GACjC,IAAI,CAAC,UAAU;IACX,MAAM,IAAI,QAAQ,KAAK;IACvB;GACJ;GAEA,IAAI,MAAM,YACN,SAAS,aAAa,SAAS,aACzB,SAAS,WAAW,QAAQ,MAAM,MAAM,WAAY,SAAS,CAAC,CAAC,IAC/D,MAAM;GAEhB,IAAI,MAAM,QAAQ,KAAA,GAAW,SAAS,MAAM,KAAK,IAAI,SAAS,OAAO,MAAM,KAAK,MAAM,GAAG;GACzF,IAAI,MAAM,QAAQ,KAAA,GAAW,SAAS,MAAM,KAAK,IAAI,SAAS,OAAO,MAAM,KAAK,MAAM,GAAG;GACzF,IAAI,MAAM,aAAa,KAAA,GAAW,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY,MAAM,UAAU,MAAM,QAAQ;GAClH,IAAI,MAAM,aAAa,KAAA,GAAW,SAAS,WAAW,KAAK,IAAI,SAAS,YAAY,MAAM,UAAU,MAAM,QAAQ;GAClH,IAAI,MAAM,cAAc,KAAA,GAAW,SAAS,YAAY,KAAK,IAAI,SAAS,aAAa,MAAM,WAAW,MAAM,SAAS;GACvH,IAAI,MAAM,cAAc,KAAA,GAAW,SAAS,YAAY,KAAK,IAAI,SAAS,aAAa,MAAM,WAAW,MAAM,SAAS;EAC3H;CACJ;CAEA,OAAO;AACX;;;ACzWA,eAAe,OAAO;CAClB,MAAM,QAAA,GAAA,WAAA,QAAA,CACF;EACI,YAAY;EACZ,iBAAiB;EACjB,WAAW;EACX,YAAY;EACZ,oBAAoB;EACpB,uBAAuB;EACvB,MAAM;EACN,MAAM;EACN,MAAM;CACV,GACA,EAAE,YAAY,KAAK,CACvB;CAEA,MAAM,MAAM,QAAQ,IAAI;CAExB,MAAM,gBADe,KAAK,SAAS,GAAG,MAAM,YAEtC,KAAK,QAAQ,KAAK,MAAM,UAAU,aAAa,IAC/C,KAAK,QAAQ,KAAK,UAAU,aAAa;CAE/C,MAAM,SAAS,KAAK,eAAe,KAAK,oBAAoB;CAC5D,MAAM,QAAQ,KAAK,cAAc;CACjC,MAAM,WAAW,KAAK,eAAe;CAErC,IAAI,CAAC,GAAG,WAAW,MAAM,GACrB,GAAG,UAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;CAI5C,MAAM,WAAW;EACb,QAAQ,IAAI;EACZ,KAAK,QAAQ,QAAQ,IAAI,GAAG,MAAM;EAClC,KAAK,QAAQ,QAAQ,IAAI,GAAG,SAAS;EACrC,KAAK,QAAQ,QAAQ,IAAI,GAAG,YAAY;CAC5C,CAAC,CAAC,OAAO,OAAO;CAEhB,KAAK,MAAM,KAAK,UACZ,IAAI,GAAG,WAAW,CAAC,GAAG;EAClB,OAAO,OAAO;GAAE,MAAM;GAAG,OAAO;EAAK,CAAC;EACtC;CACJ;CAGJ,MAAM,cAAc,QAAQ,IAAI,gBAAgB,QAAQ,IAAI;CAC5D,IAAI,CAAC,aAAa;EACd,SAAS,MAAM,IAAI,oEAAoE,CAAC;EACxF,QAAQ,KAAK,CAAC;CAClB;CAEA,MAAM,SAAS,IAAI,GAAG,OAAO,EAAE,kBAAkB,YAAY,CAAC;CAE9D,IAAI;EACA,MAAM,OAAO,QAAQ;CACzB,SAAS,KAAK;EACV,SAAS,MAAM,IAAI,oCAAoC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;EAC1G,SAAS,MAAM,KAAK,iEAAiE,CAAC;EACtF,QAAQ,KAAK,CAAC;CAClB;CAGA,MAAM,WAAW,gBAAgB,WAAW;CAC5C,IAAI,MAAM,KAAK,0BAA0B,UAAU,CAAC;CACpD,IAAI,MAAM,KAAK,yBAAyB,SAAS,KAAK,CAAC;CAEvD,IAAI;EACA,MAAM,WAAW,MAAM,mBAAmB,QAAQ,QAAQ;EAC1D,MAAM,UAAU,aAAa,SAAS,UAAU;EAChD,MAAM,YAAY,eAAe,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,SAAS,GAAG;EAC9F,MAAM,MAAM,SAAS;EAMrB,KAAK,MAAM,SAAS,iBAAiB,UAAU,SAAS,GACpD,IAAI;GACA,SAAS,UAAU,SAAS,MAAM,cAAc,QAAQ,UAAU,OAAA,EAAsB;EAC5F,SAAS,KAAK;GAGV,IAAI,MAAM,KAAK,4BAA4B,MAAM,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EAAE,EAAE,CAAC;EAC7G;EAGJ,MAAM,kBAAkB,eAAe,UAAU,SAAS;EAC1D,MAAM,aAAa,sBAAsB,SAAS,MAAM;EAKxD,MAAM,UAAU,wBAAwB,MAAM;EAC9C,IAAI,YAAY,cAAc;GAC1B,QAAQ,MAAM,OACV,0EACG,OAAO,EACd,CAAC;GACD,QAAQ,MAAM,KACV,0MAGJ,CAAC;EACL;EACA,MAAM,aAAa,IAAI,IACnB,MAAM,KAAK,gBAAgB,OAAO,CAAC,CAAC,CAC/B,QAAQ,MAAM,EAAE,SAAS,UAAU,CAAC,CACpC,KAAK,MAAM,EAAE,KAAK,CAC3B;EAEA,MAAM,aAAa,SACf,MAAM,KAAK,gBAAgB,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,IAAI,CAAC,CAAC;EAExE,IAAI,MAAM,KAAK,SAAS,UAAU,KAAK,SAAS,CAAC;EACjD,IAAI,MAAM,KACN,KAAK,UAAU,QAAQ,EAAE,aAAa,WAAW,KAAK,wCACnD,UAAU,QAAQ,EAAE,eAAe,UAAU,aAAa,EAAE,kDACnE,CAAC;EAED,IAAI,mBAAmB;EACvB,IAAI,KAAK,wBACL,mBAAmB;OAChB,IAAI,KAAK,wBAAwB,KAAA,GACpC,mBAAmB,KAAK;OACrB,IAAI,CAAC,QAAQ,MAAM,OAGtB,IAAI,MAAM,KAAK,iFAAiF,CAAC;OAC9F;GACH,MAAM,KAAK,+BAAA,QAAS,gBAAgB;IAChC,OAAO,QAAQ;IACf,QAAQ,QAAQ;GACpB,CAAC;GAED,oBAAmB,MADE,IAAI,SAAiB,YAAY,GAAG,SAAS,MAAM,OAAO,6IAA6I,GAAG,OAAO,CAAC,EAAA,CAC7M,KAAK,CAAC,CAAC,YAAY,MAAM;GACnD,GAAG,MAAM;EACb;EAEA,IAAI,kBACA,IAAI,MAAM,KAAK,8CAA8C,CAAC;EAIlE,MAAM,iBAA2B,CAAC;EAClC,MAAM,eAAyB,CAAC;EAShC,MAAM,iBAAiB,IAAI,IACvB,MAAM,KAAK,UAAU,QAAQ,CAAC,CAAC,CAC1B,QAAQ,CAAC,eAAe,CAAC,WAAW,IAAI,SAAS,CAAC,CAAC,CACnD,KAAK,CAAC,WAAW,UAAU,CAAC,WAAW,uBAAuB,MAAM,GAAG,CAAC,CAAU,CAAC,CACnF,QAAQ,UAA8C,MAAM,OAAO,KAAA,CAAS,CACrF;EACA,KAAK,MAAM,CAAC,WAAW,WAAW,gBAC9B,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,oBAC1C,UAAU,IAAI,SAAS,CAAC,EAAE,IAAI,KAAK,IAAI,EAAE,SAAS,OAAO,oEAEjE,CAAC;EAEL,MAAM,QAAkB,CAAC;EAEzB,MAAM,kBAAkB,MAAM,KAAK,UAAU,QAAQ,CAAC,CAAC,CAClD,QAAQ,CAAC,eAAe,CAAC,WAAW,IAAI,SAAS,KAAK,CAAC,eAAe,IAAI,SAAS,CAAC;EAEzF,MAAM,aAAa;EACnB,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK,YAAY;GACzD,MAAM,QAAQ,gBAAgB,MAAM,GAAG,IAAI,UAAU;GAErD,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO,CAAC,WAAW,UAAU;IAerD,IAAI,CAAC,iBAAiB,SAAS,GAAG;KAC9B,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,6FAElD,CAAC;KACD,aAAa,KAAK,SAAS;KAC3B;IACJ;IAGA,MAAM,WAAW,KAAK,KAAK,QAAQ,GAAG,UAAU,IAAI;IACpD,IAAI,GAAG,WAAW,QAAQ,KAAK,CAAC,OAAO;KACnC,aAAa,KAAK,SAAS;KAC3B;IACJ;IAEA,IAAI,aAAoD,KAAA;IACxD,IAAI,kBACA,IAAI;KAIA,MAAM,EAAE,SAAS,MAAM,OAAO,MAAM,iBAAiB,cAAc,UAAU,SAAS,EAAE,WAAW;KACnG,aAAa;IACjB,SAAS,KAAK;KACV,SAAS,MAAM,OAAO,qCAAqC,UAAU,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;IAChI;IAGJ,MAAM,cAAc,uBAChB,WACA,MACA,KACA,YACA,WACA,SACA,YACA;KAAE;KAAU;KAAiB;KAAY;KAAS;KAAO,eAAe,IAAI,IAAI,eAAe,KAAK,CAAC;IAAE,CAC3G;IAEA,GAAG,cAAc,UAAU,aAAa,OAAO;IAC/C,eAAe,KAAK,SAAS;IAC7B,IAAI,MAAM,MAAM,OAAO,UAAU,CAAC;GACtC,CAAC,CAAC;EACN;EAIA,IAAI,MAAM,SAAS,GAAG;GAClB,QAAQ,EAAE;GACV,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,+EAA+E,CAAC;GACvH,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG,QAAQ,MAAM,KAAK,OAAO,MAAM,CAAC;GACvE,QAAQ,MAAM,KAAK,qFAAqF,CAAC;EAC7G;EAGA,IAAI,eAAe,SAAS,GAAG;GAC3B,MAAM,YAAY,KAAK,KAAK,QAAQ,UAAU;GAE9C,IAAI,GAAG,WAAW,SAAS,KAAK,CAAC,OAAO;IAGpC,MAAM,SAAS,kBADE,GAAG,aAAa,WAAW,OACX,GAAU,cAAc;IACzD,GAAG,cAAc,WAAW,QAAQ,OAAO;GAC/C,OAAO;IAOH,MAAM,WAAW,GAAG,YAAY,MAAM,CAAC,CAClC,QAAO,MAAK,EAAE,SAAS,KAAK,KAAK,MAAM,UAAU,CAAC,CAClD,KAAI,MAAK,EAAE,QAAQ,SAAS,EAAE,CAAC;IAEpC,MAAM,eAAe,qBAAqB,CADxB,mBAAG,IAAI,IAAI,CAAC,GAAG,gBAAgB,GAAG,QAAQ,CAAC,CACnB,CAAQ;IAClD,GAAG,cAAc,WAAW,cAAc,OAAO;GACrD;GACA,IAAI,MAAM,MAAM,OAAO,WAAW,CAAC;EACvC;EAEA,IAAI,EAAE;EACN,IAAI,aAAa,SAAS,GAAG;GACzB,IAAI,MAAM,OAAO,aAAa,aAAa,OAAO,qBAAqB,aAAa,KAAK,IAAI,GAAG,CAAC;GACjG,IAAI,MAAM,KAAK,4CAA4C,CAAC;GAC5D,IAAI,EAAE;EACV;EACA,IAAI,MAAM,KAAK,MAAM,kBAAkB,UAAU,KAAK,sBAAsB,eAAe,OAAO,gBAAgB,CAAC;EACnH,IAAI,MAAM,KAAK,mCAAmC,OAAO,qCAAqC,CAAC;EAC/F,IAAI,EAAE;CAEV,SAAS,GAAG;EACR,SAAS,MAAM,IAAI,mCAAmC,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,GAAG,CAAC;EACnG,QAAQ,KAAK,CAAC;CAClB,UAAU;EACN,MAAM,OAAO,IAAI;CACrB;AACJ;AAEA,KAAK,CAAC,CAAC,OAAO,QAAQ;CAClB,SAAS,OAAO,GAAG,CAAC;CACpB,QAAQ,KAAK,CAAC;AAClB,CAAC"}

package/dist/schema/migration-post-process.d.ts

@@ -0,0 +1,34 @@
+/**
+ * What became of a migration `db generate` was finishing.
+ *
+ * `removed` says whether the half-finished file is gone; `rehashError` is set
+ * when it is gone but `atlas.sum` could not be brought back in line with the
+ * directory, which `atlas migrate` then refuses with a checksum error — loud,
+ * which is the point.
+ */
+export type MigrationPostProcessOutcome = {
+    ok: true;
+} | {
+    ok: false;
+    error: string;
+    removed: boolean;
+    rehashError?: string;
+};
+/**
+ * Run the steps that finish a migration Atlas just wrote — the search, vector
+ * and trigger DDL, the RLS bootstrap and policies, the re-hash — and take the
+ * migration back out when any of them fails.
+ *
+ * Atlas's own file creates the tables and nothing else: no `ENABLE ROW LEVEL
+ * SECURITY`, no policy. Those arrive in the append. A failure here used to be a
+ * yellow warning followed by "You can now run rebase db migrate", and when it
+ * struck before the file was rewritten the checksum still matched — so the
+ * migration applied cleanly and created every new table with RLS off while
+ * the schema's default privileges handed `rebase_user` full DML on it. On a
+ * deployment that runs migrations and never provisions at boot
+ * (`REBASE_MIGRATE_ON_BOOT=none`), nothing closed it again.
+ *
+ * Deleting the file is safe because it is the one this run created: running
+ * `db generate` again, once the cause is fixed, writes the same diff.
+ */
+export declare function finishNewMigration(file: string, steps: () => Promise<void>, rehash: () => Promise<void>): Promise<MigrationPostProcessOutcome>;