@rebasepro/server-postgres 0.30.0 → 0.31.0-canary.g902a0ce
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +11 -8
- package/dist/{BranchService-CrXvcES2.js → BranchService-USp1AvZB.js} +3 -3
- package/dist/{BranchService-CrXvcES2.js.map → BranchService-USp1AvZB.js.map} +1 -1
- package/dist/PostgresBackendDriver.d.ts +99 -54
- package/dist/PostgresBootstrapper.d.ts +12 -27
- package/dist/auth/ensure-tables.d.ts +16 -5
- package/dist/auth/schema-version.d.ts +2 -2
- package/dist/auth/services.d.ts +2 -3
- package/dist/{auth-users-columns-C72EMoDJ.js → auth-users-columns-BpfgbkxZ.js} +2 -16
- package/dist/auth-users-columns-BpfgbkxZ.js.map +1 -0
- package/dist/{backup-cli-CTKCOLpX.js → backup-cli-DbKyEj6c.js} +4 -4
- package/dist/{backup-cli-CTKCOLpX.js.map → backup-cli-DbKyEj6c.js.map} +1 -1
- package/dist/{boot-ddl-CqGIwSYx.js → boot-ddl-5H2bL_80.js} +2 -2
- package/dist/{boot-ddl-CqGIwSYx.js.map → boot-ddl-5H2bL_80.js.map} +1 -1
- package/dist/{cli-console-DBPw-oAz.js → cli-console-DsRgGSBR.js} +65 -39
- package/dist/cli-console-DsRgGSBR.js.map +1 -0
- package/dist/cli-console.d.ts +16 -13
- package/dist/cli-flags.d.ts +8 -9
- package/dist/cli-helpers.d.ts +15 -11
- package/dist/{cli-errors-DYTxnLbW.js → cli-schema-dir-CiN0ephV.js} +184 -70
- package/dist/cli-schema-dir-CiN0ephV.js.map +1 -0
- package/dist/cli-schema-dir.d.ts +64 -0
- package/dist/cli.js +192 -257
- package/dist/cli.js.map +1 -1
- package/dist/data-transformer.d.ts +50 -19
- package/dist/{database-preflight-iBpT7-vv.js → database-preflight-bfnIBnjM.js} +5 -5
- package/dist/database-preflight-bfnIBnjM.js.map +1 -0
- package/dist/{deferred-index-build-BCU9RoHK.js → deferred-index-build-CcSDA7wE.js} +69 -13
- package/dist/deferred-index-build-CcSDA7wE.js.map +1 -0
- package/dist/{ensure-collection-policies-Bo-_fDAy.js → ensure-policies-rRmXb5bt.js} +31 -31
- package/dist/ensure-policies-rRmXb5bt.js.map +1 -0
- package/dist/{ensure-collection-tables-DCJINkT_.js → ensure-tables-Bvm-F2wW.js} +44 -37
- package/dist/ensure-tables-Bvm-F2wW.js.map +1 -0
- package/dist/{ensure-tables-BPGaGh0y.js → ensure-tables-CC8p_AK3.js} +34 -29
- package/dist/ensure-tables-CC8p_AK3.js.map +1 -0
- package/dist/{enum-labels-kept-YAgOZS4I.js → enum-labels-kept-FlX9SHdf.js} +8 -8
- package/dist/enum-labels-kept-FlX9SHdf.js.map +1 -0
- package/dist/{generate-drizzle-schema-DcrFr7YX.js → generate-drizzle-schema-SJMXxzPI.js} +12 -12
- package/dist/generate-drizzle-schema-SJMXxzPI.js.map +1 -0
- package/dist/{generate-drizzle-schema-logic-LTLZvt6r.js → generate-drizzle-schema-logic-DL7R1rAF.js} +15 -8
- package/dist/generate-drizzle-schema-logic-DL7R1rAF.js.map +1 -0
- package/dist/{generate-files-CsaVzatS.js → generate-files-tlJ9_lGI.js} +23 -30
- package/dist/generate-files-tlJ9_lGI.js.map +1 -0
- package/dist/{generate-next-step-DgK5BlBn.js → generate-next-step-CO09dovd.js} +3 -3
- package/dist/generate-next-step-CO09dovd.js.map +1 -0
- package/dist/{generate-postgres-ddl-logic-Dg0bcENZ.js → generate-postgres-ddl-logic-B8huc03c.js} +51 -21
- package/dist/generate-postgres-ddl-logic-B8huc03c.js.map +1 -0
- package/dist/{generated-schema-diff-By4dxyTH.js → generated-schema-diff-DoT2dYDe.js} +297 -279
- package/dist/generated-schema-diff-DoT2dYDe.js.map +1 -0
- package/dist/{generated-schema-staleness-BvNF3i-s.js → generated-schema-staleness-YBVq2kTn.js} +21 -29
- package/dist/generated-schema-staleness-YBVq2kTn.js.map +1 -0
- package/dist/history/ensure-history-table.d.ts +22 -0
- package/dist/index.d.ts +8 -2
- package/dist/index.es.js +201 -25
- package/dist/index.es.js.map +1 -1
- package/dist/interfaces.d.ts +3 -4
- package/dist/{introspect-db-queries-DevUrzll.js → introspect-db-queries-BgiRQqtR.js} +7 -2
- package/dist/introspect-db-queries-BgiRQqtR.js.map +1 -0
- package/dist/introspect-tables-Cw_A-kk4.js +2086 -0
- package/dist/introspect-tables-Cw_A-kk4.js.map +1 -0
- package/dist/load-tables-B1Re74ng.js +92 -0
- package/dist/load-tables-B1Re74ng.js.map +1 -0
- package/dist/{migrate-baseline-CmWXL7qx.js → migrate-baseline-DZmekgpD.js} +19 -32
- package/dist/migrate-baseline-DZmekgpD.js.map +1 -0
- package/dist/{migrate-policy-stamps-BN_Qad6c.js → migrate-policy-stamps-B_acrUQB.js} +18 -19
- package/dist/migrate-policy-stamps-B_acrUQB.js.map +1 -0
- package/dist/model/PostgresTableRegistry.d.ts +159 -0
- package/dist/model/build-registry.d.ts +25 -0
- package/dist/model/refresh-relational-schema.d.ts +24 -0
- package/dist/model/runtime-table.d.ts +53 -0
- package/dist/{collections → model}/validate-relations.d.ts +15 -21
- package/dist/{open-rebase-40paQfVW.js → open-rebase-4kisUF_k.js} +3946 -3870
- package/dist/open-rebase-4kisUF_k.js.map +1 -0
- package/dist/open-rebase.d.ts +16 -15
- package/dist/{pg-error-utils-DJHjCF7-.js → pg-error-utils-BT5NzGFZ.js} +17 -20
- package/dist/pg-error-utils-BT5NzGFZ.js.map +1 -0
- package/dist/plan-schema-Hbtjhge3.js +1633 -0
- package/dist/plan-schema-Hbtjhge3.js.map +1 -0
- package/dist/{policy-drift-C-m0uWHH.js → policy-drift-BVMyqHSa.js} +29 -29
- package/dist/policy-drift-BVMyqHSa.js.map +1 -0
- package/dist/{push-index-adoption-Cp7oZxSl.js → push-index-adoption-hpHTyXMR.js} +7 -7
- package/dist/push-index-adoption-hpHTyXMR.js.map +1 -0
- package/dist/{push-index-prebuild-DbwKGtQT.js → push-index-prebuild-Bty9F7bD.js} +6 -6
- package/dist/push-index-prebuild-Bty9F7bD.js.map +1 -0
- package/dist/{push-kept-defaults-CLcgsEPt.js → push-kept-defaults-Bst4MDup.js} +13 -16
- package/dist/push-kept-defaults-Bst4MDup.js.map +1 -0
- package/dist/{push-legacy-renames-BthD0E9W.js → push-legacy-renames-bB4bM6br.js} +6 -6
- package/dist/push-legacy-renames-bB4bM6br.js.map +1 -0
- package/dist/{push-policy-plan-BgcrroxQ.js → push-policy-plan-BI8U4BOD.js} +11 -11
- package/dist/push-policy-plan-BI8U4BOD.js.map +1 -0
- package/dist/{render-ddl-Ci3S_SoI.js → render-ddl-D4n86NHz.js} +14 -7
- package/dist/render-ddl-D4n86NHz.js.map +1 -0
- package/dist/{request-role-cli-Dy1EgJU9.js → request-role-cli-BdRzdE87.js} +11 -11
- package/dist/{request-role-cli-Dy1EgJU9.js.map → request-role-cli-BdRzdE87.js.map} +1 -1
- package/dist/{request-role-migration-GHTJnPMV.js → request-role-migration-C8aq_TO3.js} +2 -2
- package/dist/{request-role-migration-GHTJnPMV.js.map → request-role-migration-C8aq_TO3.js.map} +1 -1
- package/dist/{rls-enforcement-Cc_UhOxb.js → rls-enforcement-DB5HHj96.js} +19 -19
- package/dist/rls-enforcement-DB5HHj96.js.map +1 -0
- package/dist/{rls-settings-BCGMIig3.js → rls-settings-CmGK2U0a.js} +2 -2
- package/dist/rls-settings-CmGK2U0a.js.map +1 -0
- package/dist/schema/auth-users-columns.d.ts +1 -11
- package/dist/schema/catalogue-schema.d.ts +33 -29
- package/dist/schema/classify-change.d.ts +23 -16
- package/dist/schema/column-type-drift.d.ts +16 -0
- package/dist/schema/config-relations.d.ts +10 -9
- package/dist/schema/deferred-index-build.d.ts +1 -1
- package/dist/schema/doctor-cli.js +1544 -66
- package/dist/schema/doctor-cli.js.map +1 -1
- package/dist/schema/doctor-database.d.ts +7 -7
- package/dist/schema/doctor-policy-checks.d.ts +4 -4
- package/dist/schema/doctor-search-scale.d.ts +14 -14
- package/dist/schema/doctor.d.ts +27 -27
- package/dist/schema/dynamic-tables.d.ts +6 -5
- package/dist/schema/{ensure-collection-policies.d.ts → ensure-policies.d.ts} +20 -20
- package/dist/schema/{ensure-collection-tables.d.ts → ensure-tables.d.ts} +11 -11
- package/dist/schema/enum-labels-kept.d.ts +6 -6
- package/dist/schema/generate-drizzle-schema-logic.d.ts +3 -3
- package/dist/schema/generate-drizzle-schema.js +1 -1
- package/dist/schema/generate-files.d.ts +6 -6
- package/dist/schema/generate-postgres-ddl-logic.d.ts +23 -20
- package/dist/schema/generate-postgres-ddl.js +11 -11
- package/dist/schema/generate-postgres-ddl.js.map +1 -1
- package/dist/schema/generate-schema-commit.d.ts +13 -8
- package/dist/schema/generated-schema-diff.d.ts +16 -16
- package/dist/schema/generated-schema-staleness.d.ts +11 -11
- package/dist/schema/index-adoption.d.ts +4 -4
- package/dist/schema/introspect-db-customization.d.ts +47 -0
- package/dist/schema/introspect-db-inference.d.ts +30 -9
- package/dist/schema/introspect-db-logic.d.ts +79 -110
- package/dist/schema/introspect-db-project.d.ts +15 -18
- package/dist/schema/introspect-db-queries.d.ts +1 -1
- package/dist/schema/introspect-db-search.d.ts +25 -4
- package/dist/schema/introspect-db-storage.d.ts +4 -74
- package/dist/schema/introspect-db.js +102 -90
- package/dist/schema/introspect-db.js.map +1 -1
- package/dist/schema/introspect-runtime.d.ts +47 -36
- package/dist/schema/introspect-tables.d.ts +182 -0
- package/dist/schema/load-tables.d.ts +55 -0
- package/dist/schema/migrate-policy-stamps.d.ts +4 -4
- package/dist/schema/migration-freshness.d.ts +13 -13
- package/dist/schema/plan/column-order.d.ts +82 -0
- package/dist/schema/plan/diff-plan.d.ts +9 -3
- package/dist/schema/plan/plan-schema.d.ts +55 -52
- package/dist/schema/plan/render-drizzle.d.ts +1 -1
- package/dist/schema/plan/types.d.ts +24 -15
- package/dist/schema/push-index-adoption.d.ts +3 -3
- package/dist/schema/push-index-prebuild.d.ts +3 -3
- package/dist/schema/push-kept-defaults.d.ts +7 -7
- package/dist/schema/push-legacy-renames.d.ts +3 -3
- package/dist/schema/push-policy-plan.d.ts +5 -5
- package/dist/schema/reconcile-schema.d.ts +5 -5
- package/dist/schema/relation-names.d.ts +15 -20
- package/dist/schema/render-outputs.d.ts +76 -0
- package/dist/schema/search-column.d.ts +11 -43
- package/dist/schema/{collection-index.d.ts → table-index.d.ts} +21 -42
- package/dist/schema/{collections-schema-version.d.ts → tables-schema-version.d.ts} +8 -2
- package/dist/schema/vector-index.d.ts +24 -28
- package/dist/{search-column-BM-GV6vH.js → search-column-BO-WND-B.js} +86 -149
- package/dist/search-column-BO-WND-B.js.map +1 -0
- package/dist/security/caller-sql-columns.d.ts +9 -6
- package/dist/security/policy-drift.d.ts +14 -14
- package/dist/security/rls-enforcement.d.ts +19 -25
- package/dist/security/rls-settings.d.ts +2 -2
- package/dist/security/served-table-protection.d.ts +125 -0
- package/dist/services/FetchService.d.ts +22 -133
- package/dist/services/PersistService.d.ts +6 -17
- package/dist/services/RelationService.d.ts +57 -106
- package/dist/services/RelationWriteService.d.ts +59 -66
- package/dist/services/cdc/identity-columns.d.ts +7 -5
- package/dist/services/cdc/junction-tables.d.ts +14 -14
- package/dist/services/collection-helpers.d.ts +52 -95
- package/dist/services/dataService.d.ts +15 -12
- package/dist/services/field-op-sql.d.ts +11 -9
- package/dist/services/field-viewer.d.ts +12 -11
- package/dist/services/hidden-columns.d.ts +30 -0
- package/dist/services/index.d.ts +1 -1
- package/dist/services/junction-writes.d.ts +37 -18
- package/dist/services/nested-path.d.ts +18 -18
- package/dist/services/read-field-access.d.ts +23 -7
- package/dist/services/read-scope.d.ts +10 -9
- package/dist/services/realtimeService.d.ts +25 -10
- package/dist/services/relation-tables.d.ts +97 -0
- package/dist/services/row-pipeline.d.ts +50 -69
- package/dist/services/soft-delete.d.ts +25 -24
- package/dist/services/table-hooks.d.ts +146 -0
- package/dist/services/view-access.d.ts +7 -7
- package/dist/services/write-transaction-scope.d.ts +1 -1
- package/dist/{source-fZb92pN8.js → source-VxbrQojV.js} +111 -79
- package/dist/source-VxbrQojV.js.map +1 -0
- package/dist/{collections-schema-version-D7bDI0PJ.js → tables-schema-version-YvZIBlOP.js} +12 -6
- package/dist/tables-schema-version-YvZIBlOP.js.map +1 -0
- package/dist/utils/drizzle-conditions.d.ts +70 -84
- package/dist/utils/pg-array-null-patch.d.ts +27 -10
- package/dist/utils/pg-error-utils.d.ts +4 -4
- package/dist/{vector-index-DsQ3V2d2.js → vector-index-VSh3ufTd.js} +62 -54
- package/dist/vector-index-VSh3ufTd.js.map +1 -0
- package/dist/{websocket-B7ex6AQM.js → websocket-BevXvwfo.js} +51 -40
- package/dist/websocket-BevXvwfo.js.map +1 -0
- package/dist/websocket.d.ts +2 -2
- package/package.json +7 -7
- package/dist/auth-users-columns-C72EMoDJ.js.map +0 -1
- package/dist/cli-collections-path.d.ts +0 -31
- package/dist/cli-console-DBPw-oAz.js.map +0 -1
- package/dist/cli-errors-DYTxnLbW.js.map +0 -1
- package/dist/collections/PostgresCollectionRegistry.d.ts +0 -47
- package/dist/collections/buildRegistry.d.ts +0 -27
- package/dist/collections-schema-version-D7bDI0PJ.js.map +0 -1
- package/dist/column-plan-helpers-BeSztMor.js +0 -161
- package/dist/column-plan-helpers-BeSztMor.js.map +0 -1
- package/dist/database-preflight-iBpT7-vv.js.map +0 -1
- package/dist/deferred-index-build-BCU9RoHK.js.map +0 -1
- package/dist/doctor-Kg1oUK0Q.js +0 -1458
- package/dist/doctor-Kg1oUK0Q.js.map +0 -1
- package/dist/ensure-collection-policies-Bo-_fDAy.js.map +0 -1
- package/dist/ensure-collection-tables-DCJINkT_.js.map +0 -1
- package/dist/ensure-tables-BPGaGh0y.js.map +0 -1
- package/dist/enum-labels-kept-YAgOZS4I.js.map +0 -1
- package/dist/generate-drizzle-schema-DcrFr7YX.js.map +0 -1
- package/dist/generate-drizzle-schema-logic-LTLZvt6r.js.map +0 -1
- package/dist/generate-files-CsaVzatS.js.map +0 -1
- package/dist/generate-next-step-DgK5BlBn.js.map +0 -1
- package/dist/generate-postgres-ddl-logic-Dg0bcENZ.js.map +0 -1
- package/dist/generated-schema-diff-By4dxyTH.js.map +0 -1
- package/dist/generated-schema-staleness-BvNF3i-s.js.map +0 -1
- package/dist/introspect-db-logic-DWqAEURB.js +0 -2047
- package/dist/introspect-db-logic-DWqAEURB.js.map +0 -1
- package/dist/introspect-db-queries-DevUrzll.js.map +0 -1
- package/dist/migrate-baseline-CmWXL7qx.js.map +0 -1
- package/dist/migrate-policy-stamps-BN_Qad6c.js.map +0 -1
- package/dist/open-rebase-40paQfVW.js.map +0 -1
- package/dist/pg-error-utils-DJHjCF7-.js.map +0 -1
- package/dist/plan-schema-vJd3UEmT.js +0 -1604
- package/dist/plan-schema-vJd3UEmT.js.map +0 -1
- package/dist/policy-drift-C-m0uWHH.js.map +0 -1
- package/dist/push-index-adoption-Cp7oZxSl.js.map +0 -1
- package/dist/push-index-prebuild-DbwKGtQT.js.map +0 -1
- package/dist/push-kept-defaults-CLcgsEPt.js.map +0 -1
- package/dist/push-legacy-renames-BthD0E9W.js.map +0 -1
- package/dist/push-policy-plan-BgcrroxQ.js.map +0 -1
- package/dist/render-ddl-Ci3S_SoI.js.map +0 -1
- package/dist/rls-enforcement-Cc_UhOxb.js.map +0 -1
- package/dist/rls-settings-BCGMIig3.js.map +0 -1
- package/dist/schema/column-plan-helpers.d.ts +0 -161
- package/dist/schema/introspect-db-naming.d.ts +0 -10
- package/dist/search-column-BM-GV6vH.js.map +0 -1
- package/dist/source-fZb92pN8.js.map +0 -1
- package/dist/vector-index-DsQ3V2d2.js.map +0 -1
- package/dist/websocket-B7ex6AQM.js.map +0 -1
|
@@ -1 +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\";\n\nimport {\n buildTablesMap,\n buildEnumMap,\n compositeKeySkipReason,\n describeRlsOffTables,\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\";\nimport { promptConfirm } from \"../cli-prompt\";\nimport { diagnoseDbError } from \"../cli-errors\";\nimport { pinSearchPath } from \"../connection\";\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 // Absolute, because it is printed: the driver runs in `backend/`, and the\n // default `../config/collections` read from the project root named a\n // directory beside it.\n const outDir = path.resolve(args[\"--output\"] || args[\"--collections\"] || defaultOutDir);\n const force = args[\"--force\"] || false;\n const pgSchema = args[\"--schema\"] || \"public\";\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 // Pinned to `public`, as the server's connections are. Postgres spells an\n // expression it read back — a policy's USING, a CHECK, a column default —\n // with every name on the search path unqualified, and under the default\n // `\"$user\", public` a role named `rebase` puts the `rebase` schema on it:\n // `rebase.roles()` came back as `roles()`, which the push, pinned to\n // `public`, could not find.\n const client = new pg.Client({ connectionString: pinSearchPath(databaseUrl) });\n\n try {\n await client.connect();\n } catch (err) {\n // The banner `db push` prints for the same failure, when it is one of\n // the ones it knows.\n const banner = diagnoseDbError(err, databaseUrl);\n if (banner) {\n outError(banner);\n } else {\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 }\n process.exit(1);\n }\n\n // Only once there is something to write into: created before connecting,\n // a run against a database that was down left an empty directory behind.\n if (!fs.existsSync(outDir)) {\n fs.mkdirSync(outDir, { recursive: true });\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 runDataInference = await promptConfirm(chalk.yellow(\"? Do you want to run comprehensive data inference on sampled rows to auto-detect types, formats, constraints, and UI configurations? (y/N) \"));\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 // One table at a time: there is one connection, and sampling ten at\n // once over it is what node-postgres warns about (\"Calling\n // client.query() when the client is already executing a query\") —\n // the queries queued behind each other anyway.\n for (const [tableName, meta] of tablesToProcess) {\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 continue;\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 continue;\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 // 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 // And the tables whose access the push changes whatever their\n // collections say: no collection keeps row-level security off.\n const rlsOff = describeRlsOffTables(metadata.tables\n .filter((table) => table.rls_enabled === false && generatedFiles.includes(table.table_name))\n .map((table) => table.table_name));\n if (rlsOff) {\n const [headline, ...rest] = rlsOff.split(\"\\n\");\n outWarn(\"\");\n outWarn(chalk.yellow(`⚠ ${headline}`));\n for (const line of rest) outWarn(chalk.gray(` ${line}`));\n outWarn(chalk.gray(\" `rebase db push --dry-run` lists every policy it would create.\"));\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 if (generatedFiles.length > 0) {\n out(chalk.gray(` Review the generated files in ${outDir} and customize properties as needed.`));\n }\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;;;ACtWA,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;CAK/C,MAAM,SAAS,KAAK,QAAQ,KAAK,eAAe,KAAK,oBAAoB,aAAa;CACtF,MAAM,QAAQ,KAAK,cAAc;CACjC,MAAM,WAAW,KAAK,eAAe;CAGrC,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;CAQA,MAAM,SAAS,IAAI,GAAG,OAAO,EAAE,kBAAkB,cAAc,WAAW,EAAE,CAAC;CAE7E,IAAI;EACA,MAAM,OAAO,QAAQ;CACzB,SAAS,KAAK;EAGV,MAAM,SAAS,gBAAgB,KAAK,WAAW;EAC/C,IAAI,QACA,SAAS,MAAM;OACZ;GACH,SAAS,MAAM,IAAI,oCAAoC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;GAC1G,SAAS,MAAM,KAAK,iEAAiE,CAAC;EAC1F;EACA,QAAQ,KAAK,CAAC;CAClB;CAIA,IAAI,CAAC,GAAG,WAAW,MAAM,GACrB,GAAG,UAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;CAI5C,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;OAEjG,mBAAmB,MAAM,cAAc,MAAM,OAAO,6IAA6I,CAAC;EAGtM,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;EAMzF,KAAK,MAAM,CAAC,WAAW,SAAS,iBAAiB;GAe7C,IAAI,CAAC,iBAAiB,SAAS,GAAG;IAC9B,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,6FAElD,CAAC;IACD,aAAa,KAAK,SAAS;IAC3B;GACJ;GAGA,MAAM,WAAW,KAAK,KAAK,QAAQ,GAAG,UAAU,IAAI;GACpD,IAAI,GAAG,WAAW,QAAQ,KAAK,CAAC,OAAO;IACnC,aAAa,KAAK,SAAS;IAC3B;GACJ;GAEA,IAAI,aAAoD,KAAA;GACxD,IAAI,kBACA,IAAI;IAIA,MAAM,EAAE,SAAS,MAAM,OAAO,MAAM,iBAAiB,cAAc,UAAU,SAAS,EAAE,WAAW;IACnG,aAAa;GACjB,SAAS,KAAK;IACV,SAAS,MAAM,OAAO,qCAAqC,UAAU,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;GAChI;GAGJ,MAAM,cAAc,uBAChB,WACA,MACA,KACA,YACA,WACA,SACA,YACA;IAAE;IAAU;IAAiB;IAAY;IAAS;IAAO,eAAe,IAAI,IAAI,eAAe,KAAK,CAAC;GAAE,CAC3G;GAEA,GAAG,cAAc,UAAU,aAAa,OAAO;GAC/C,eAAe,KAAK,SAAS;GAC7B,IAAI,MAAM,MAAM,OAAO,UAAU,CAAC;EACtC;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;EAIA,MAAM,SAAS,qBAAqB,SAAS,OACxC,QAAQ,UAAU,MAAM,gBAAgB,SAAS,eAAe,SAAS,MAAM,UAAU,CAAC,CAAC,CAC3F,KAAK,UAAU,MAAM,UAAU,CAAC;EACrC,IAAI,QAAQ;GACR,MAAM,CAAC,UAAU,GAAG,QAAQ,OAAO,MAAM,IAAI;GAC7C,QAAQ,EAAE;GACV,QAAQ,MAAM,OAAO,KAAK,UAAU,CAAC;GACrC,KAAK,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,CAAC;GACxD,QAAQ,MAAM,KAAK,kEAAkE,CAAC;EAC1F;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,eAAe,SAAS,GACxB,IAAI,MAAM,KAAK,mCAAmC,OAAO,qCAAqC,CAAC;EAEnG,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"}
|
|
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 * Where the project being introspected into keeps what introspection writes.\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: does the project have a\n * frontend that a `customizeTable` file can be written into.\n */\nimport fs from \"fs\";\nimport path from \"path\";\n\nimport { CMS_PACKAGE } from \"./introspect-db-customization\";\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 for (const field of [\"dependencies\", \"devDependencies\", \"peerDependencies\"]) {\n const block: unknown = Reflect.get(parsed, 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 * The project root above a directory: the first ancestor holding a\n * `rebase.json`, or `undefined` when none does within reach.\n */\nexport function findProjectRoot(from: string): string | undefined {\n let dir = path.resolve(from);\n for (let level = 0; level < MAX_LEVELS; level++) {\n if (fs.existsSync(path.join(dir, \"rebase.json\"))) return dir;\n const parent = path.dirname(dir);\n if (parent === dir) return undefined;\n dir = parent;\n }\n return undefined;\n}\n\n/**\n * The `frontend/src/cms` directory introspection writes `customizeTable`\n * files into, or `undefined` when the project has no frontend that can import\n * `@rebasepro/cms`.\n *\n * The project root is the one above the schema directory (`rebase.json`), or —\n * in a layout without one — the parent of `backend/`. The frontend is\n * `<root>/frontend`, and it counts only when a manifest on the path a\n * `frontend/src/cms/<table>.tsx` resolves bare specifiers along (the frontend's\n * own `package.json`, then the root's) declares `@rebasepro/cms`: that is the\n * import the file opens with, and a headless project could not resolve it.\n */\nexport function detectCmsDir(schemaDir: string): string | undefined {\n const resolved = path.resolve(schemaDir);\n const root = findProjectRoot(resolved) ?? path.dirname(path.dirname(resolved));\n const frontend = path.join(root, \"frontend\");\n if (!fs.existsSync(frontend)) return undefined;\n for (const manifest of [path.join(frontend, \"package.json\"), path.join(root, \"package.json\")]) {\n if (fs.existsSync(manifest) && declaredDependencies(manifest).has(CMS_PACKAGE)) {\n return path.join(frontend, \"src\", \"cms\");\n }\n }\n return undefined;\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\";\n\nimport { printIndexModule, tableIdentifier } from \"@rebasepro/common\";\n\nimport {\n buildTablesMap,\n describeRlsOffTables,\n generateSchemaModules,\n mergeIndexModule,\n safeHostFromUrl\n} from \"./introspect-db-logic\";\nimport { detectCmsDir } 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\";\nimport { promptConfirm } from \"../cli-prompt\";\nimport { diagnoseDbError } from \"../cli-errors\";\nimport { pinSearchPath } from \"../connection\";\nimport { DEFAULT_SCHEMA_DIR } from \"../cli-schema-dir\";\n\n/** A relative import between two files, POSIX-separated, without the extension. */\nfunction relativeImport(fromDir: string, toFile: string): string {\n const relative = path.relative(fromDir, toFile).split(path.sep).join(\"/\").replace(/\\.tsx?$/, \"\");\n return relative.startsWith(\".\") ? relative : `./${relative}`;\n}\n\nasync function main() {\n const args = arg(\n {\n \"--schema-dir\": String,\n \"--force\": Boolean,\n \"--schema\": String,\n \"--data-inference\": Boolean,\n \"--no-data-inference\": Boolean,\n \"-f\": \"--force\"\n },\n { permissive: true }\n );\n\n // Absolute, because it is printed. Relative to where the driver runs —\n // `backend/` — so the default is `backend/schema`, as every other driver\n // command reads it. The project's `frontend/src/cms`, when it has one, is\n // found from there (`detectCmsDir`).\n const outDir = path.resolve(process.cwd(), args[\"--schema-dir\"] || DEFAULT_SCHEMA_DIR);\n const cmsDir = detectCmsDir(outDir);\n const force = args[\"--force\"] || false;\n const pgSchema = args[\"--schema\"] || \"public\";\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 // Pinned to `public`, as the server's connections are. Postgres spells an\n // expression it read back — a policy's USING, a CHECK, a column default —\n // with every name on the search path unqualified, and under the default\n // `\"$user\", public` a role named `rebase` puts the `rebase` schema on it:\n // `rebase.roles()` came back as `roles()`, which the push, pinned to\n // `public`, could not find.\n const client = new pg.Client({ connectionString: pinSearchPath(databaseUrl) });\n\n try {\n await client.connect();\n } catch (err) {\n // The banner `db push` prints for the same failure, when it is one of\n // the ones it knows.\n const banner = diagnoseDbError(err, databaseUrl);\n if (banner) {\n outError(banner);\n } else {\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 }\n process.exit(1);\n }\n\n // Only once there is something to write into: created before connecting,\n // a run against a database that was down left an empty directory behind.\n if (!fs.existsSync(outDir)) {\n fs.mkdirSync(outDir, { recursive: true });\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 tablesMap = buildTablesMap(metadata.tables, metadata.columns, metadata.pks, 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 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 runDataInference = await promptConfirm(chalk.yellow(\"? Do you want to sample rows to suggest validation and how the panel edits each column? (y/N) \"));\n }\n\n // ── The name has to be usable as a filename ────────────────\n //\n // A table name came out of `pg_class` in a database this tool did\n // not create — adopting somebody else's database is the whole point\n // of introspection — and it is about to be joined onto a path.\n // Postgres will happily hold a table called `../../../etc/cron.d/x`,\n // and `path.join` resolves it. Skipped rather than sanitised: a file\n // named something other than its table does not round-trip.\n const unusable = new Set(Array.from(tablesMap.keys()).filter((t) => !joinTables.has(t) && !isUsableFileName(t)));\n for (const tableName of unusable) {\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 table by hand.\"\n ));\n }\n\n // One table at a time: there is one connection, and sampling ten at\n // once over it is what node-postgres warns about.\n const samples = new Map<string, Record<string, unknown>[]>();\n if (runDataInference) {\n out(chalk.gray(\"Sampling database rows for data inference...\"));\n for (const tableName of tablesMap.keys()) {\n if (joinTables.has(tableName) || unusable.has(tableName)) continue;\n try {\n // Quoted by `quoteRelation`, which doubles an embedded quote.\n const { rows } = await client.query(`SELECT * FROM ${quoteRelation(pgSchema, tableName)} LIMIT 100`);\n samples.set(tableName, 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\n const generation = generateSchemaModules({\n metadata,\n classifications,\n checkFacts,\n samples,\n leaveOut: unusable,\n ...(cmsDir ? { cms: { tableImport: (table: string) => relativeImport(cmsDir, path.join(outDir, `${table}.ts`)) } } : {})\n });\n for (const { table, reason } of generation.failed) {\n outWarn(chalk.yellow(`⚠ Skipping table ${JSON.stringify(table)}: ${reason}`));\n }\n\n const generatedFiles: { identifier: string; table: string }[] = [];\n const skippedFiles: string[] = [];\n const notes: string[] = [];\n const customizations: string[] = [];\n for (const generated of generation.tables) {\n // ── File overwrite protection ──────────────────────────────\n const filePath = path.join(outDir, `${generated.table}.ts`);\n if (fs.existsSync(filePath) && !force) {\n skippedFiles.push(generated.table);\n continue;\n }\n fs.writeFileSync(filePath, generated.schemaModule, \"utf-8\");\n generatedFiles.push({ identifier: generated.identifier, table: generated.table });\n for (const note of generated.notes) notes.push(`${generated.table}: ${note}`);\n out(chalk.green(` ✓ ${filePath}`));\n\n if (cmsDir && generated.customization) {\n const cmsPath = path.join(cmsDir, `${generated.table}.tsx`);\n if (fs.existsSync(cmsPath) && !force) continue;\n fs.mkdirSync(cmsDir, { recursive: true });\n fs.writeFileSync(cmsPath, generated.customization, \"utf-8\");\n customizations.push(generated.table);\n out(chalk.green(` ✓ ${cmsPath}`));\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} note(s) on what \\`rebase db push\\` would not reproduce exactly:`));\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 // And the tables whose access the push changes whatever their files\n // say: no table keeps row-level security off.\n const written = new Set(generatedFiles.map((file) => file.table));\n const rlsOff = describeRlsOffTables(generation.rlsOff.filter((table) => written.has(table)));\n if (rlsOff) {\n const [headline, ...rest] = rlsOff.split(\"\\n\");\n outWarn(\"\");\n outWarn(chalk.yellow(`⚠ ${headline}`));\n for (const line of rest) outWarn(chalk.gray(` ${line}`));\n outWarn(chalk.gray(\" `rebase db push --dry-run` lists every policy it would create.\"));\n }\n\n // backend/schema/index.ts: its exports are the tables the backend\n // serves, so every generated one is exported.\n if (generatedFiles.length > 0) {\n const indexPath = path.join(outDir, \"index.ts\");\n const entries = generatedFiles\n .map((file) => ({ identifier: file.identifier, importPath: `./${file.table}` }))\n .sort((a, b) => a.importPath.localeCompare(b.importPath));\n if (fs.existsSync(indexPath) && !force) {\n fs.writeFileSync(indexPath, mergeIndexModule(fs.readFileSync(indexPath, \"utf-8\"), entries), \"utf-8\");\n } else {\n // --force replaces the tables derived from the database, but the\n // directory can also hold hand-written ones with no table in the\n // introspected schema. An index listing only introspected tables\n // would silently stop serving them.\n const siblings = fs.readdirSync(outDir)\n .filter((f) => f.endsWith(\".ts\") && f !== \"index.ts\")\n .map((f) => f.replace(/\\.ts$/, \"\"))\n .filter((name) => !entries.some((entry) => entry.importPath === `./${name}`))\n .map((name) => ({ identifier: tableIdentifier(name), importPath: `./${name}` }));\n const all = [...entries, ...siblings].sort((a, b) => a.importPath.localeCompare(b.importPath));\n fs.writeFileSync(indexPath, printIndexModule(all), \"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} table(s).`));\n if (generatedFiles.length > 0) {\n out(chalk.gray(` Review the generated files in ${outDir}.`));\n }\n if (customizations.length > 0 && cmsDir) {\n out(chalk.gray(` ${customizations.length} panel customization(s) in ${cmsDir}: pass them to <RebaseCMS tableCustomizations={[…]} />.`));\n }\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,KAAK,MAAM,SAAS;EAAC;EAAgB;EAAmB;CAAkB,GAAG;EACzE,MAAM,QAAiB,QAAQ,IAAI,QAAQ,KAAK;EAChD,IAAI,OAAO,UAAU,YAAY,UAAU,MACvC,KAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,GAAG,MAAM,IAAI,IAAI;CAE7D;CACA,OAAO;AACX;;;;;AAMA,SAAgB,gBAAgB,MAAkC;CAC9D,IAAI,MAAM,KAAK,QAAQ,IAAI;CAC3B,KAAK,IAAI,QAAQ,GAAG,QAAQ,YAAY,SAAS;EAC7C,IAAI,GAAG,WAAW,KAAK,KAAK,KAAK,aAAa,CAAC,GAAG,OAAO;EACzD,MAAM,SAAS,KAAK,QAAQ,GAAG;EAC/B,IAAI,WAAW,KAAK,OAAO,KAAA;EAC3B,MAAM;CACV;AAEJ;;;;;;;;;;;;;AAcA,SAAgB,aAAa,WAAuC;CAChE,MAAM,WAAW,KAAK,QAAQ,SAAS;CACvC,MAAM,OAAO,gBAAgB,QAAQ,KAAK,KAAK,QAAQ,KAAK,QAAQ,QAAQ,CAAC;CAC7E,MAAM,WAAW,KAAK,KAAK,MAAM,UAAU;CAC3C,IAAI,CAAC,GAAG,WAAW,QAAQ,GAAG,OAAO,KAAA;CACrC,KAAK,MAAM,YAAY,CAAC,KAAK,KAAK,UAAU,cAAc,GAAG,KAAK,KAAK,MAAM,cAAc,CAAC,GACxF,IAAI,GAAG,WAAW,QAAQ,KAAK,qBAAqB,QAAQ,CAAC,CAAC,IAAA,gBAAe,GACzE,OAAO,KAAK,KAAK,UAAU,OAAO,KAAK;AAInD;;;;AC3BA,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;;;;ACrWA,SAAS,eAAe,SAAiB,QAAwB;CAC7D,MAAM,WAAW,KAAK,SAAS,SAAS,MAAM,CAAC,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,QAAQ,WAAW,EAAE;CAC/F,OAAO,SAAS,WAAW,GAAG,IAAI,WAAW,KAAK;AACtD;AAEA,eAAe,OAAO;CAClB,MAAM,QAAA,GAAA,WAAA,QAAA,CACF;EACI,gBAAgB;EAChB,WAAW;EACX,YAAY;EACZ,oBAAoB;EACpB,uBAAuB;EACvB,MAAM;CACV,GACA,EAAE,YAAY,KAAK,CACvB;CAMA,MAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,GAAG,KAAK,mBAAA,QAAqC;CACrF,MAAM,SAAS,aAAa,MAAM;CAClC,MAAM,QAAQ,KAAK,cAAc;CACjC,MAAM,WAAW,KAAK,eAAe;CAGrC,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;CAQA,MAAM,SAAS,IAAI,GAAG,OAAO,EAAE,kBAAkB,cAAc,WAAW,EAAE,CAAC;CAE7E,IAAI;EACA,MAAM,OAAO,QAAQ;CACzB,SAAS,KAAK;EAGV,MAAM,SAAS,gBAAgB,KAAK,WAAW;EAC/C,IAAI,QACA,SAAS,MAAM;OACZ;GACH,SAAS,MAAM,IAAI,oCAAoC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;GAC1G,SAAS,MAAM,KAAK,iEAAiE,CAAC;EAC1F;EACA,QAAQ,KAAK,CAAC;CAClB;CAIA,IAAI,CAAC,GAAG,WAAW,MAAM,GACrB,GAAG,UAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;CAI5C,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,YAAY,eAAe,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,SAAS,GAAG;EAM9F,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;EACxD,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;OAEjG,mBAAmB,MAAM,cAAc,MAAM,OAAO,gGAAgG,CAAC;EAWzJ,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC;EAC/G,KAAK,MAAM,aAAa,UACpB,QAAQ,MAAM,OACV,oBAAoB,KAAK,UAAU,SAAS,EAAE,wFAElD,CAAC;EAKL,MAAM,0BAAU,IAAI,IAAuC;EAC3D,IAAI,kBAAkB;GAClB,IAAI,MAAM,KAAK,8CAA8C,CAAC;GAC9D,KAAK,MAAM,aAAa,UAAU,KAAK,GAAG;IACtC,IAAI,WAAW,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,GAAG;IAC1D,IAAI;KAEA,MAAM,EAAE,SAAS,MAAM,OAAO,MAAM,iBAAiB,cAAc,UAAU,SAAS,EAAE,WAAW;KACnG,QAAQ,IAAI,WAAW,IAAI;IAC/B,SAAS,KAAK;KACV,SAAS,MAAM,OAAO,qCAAqC,UAAU,IAAI,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,GAAG,CAAC;IAChI;GACJ;EACJ;EAEA,MAAM,aAAa,sBAAsB;GACrC;GACA;GACA;GACA;GACA,UAAU;GACV,GAAI,SAAS,EAAE,KAAK,EAAE,cAAc,UAAkB,eAAe,QAAQ,KAAK,KAAK,QAAQ,GAAG,MAAM,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;EAC1H,CAAC;EACD,KAAK,MAAM,EAAE,OAAO,YAAY,WAAW,QACvC,QAAQ,MAAM,OAAO,oBAAoB,KAAK,UAAU,KAAK,EAAE,IAAI,QAAQ,CAAC;EAGhF,MAAM,iBAA0D,CAAC;EACjE,MAAM,eAAyB,CAAC;EAChC,MAAM,QAAkB,CAAC;EACzB,MAAM,iBAA2B,CAAC;EAClC,KAAK,MAAM,aAAa,WAAW,QAAQ;GAEvC,MAAM,WAAW,KAAK,KAAK,QAAQ,GAAG,UAAU,MAAM,IAAI;GAC1D,IAAI,GAAG,WAAW,QAAQ,KAAK,CAAC,OAAO;IACnC,aAAa,KAAK,UAAU,KAAK;IACjC;GACJ;GACA,GAAG,cAAc,UAAU,UAAU,cAAc,OAAO;GAC1D,eAAe,KAAK;IAAE,YAAY,UAAU;IAAY,OAAO,UAAU;GAAM,CAAC;GAChF,KAAK,MAAM,QAAQ,UAAU,OAAO,MAAM,KAAK,GAAG,UAAU,MAAM,IAAI,MAAM;GAC5E,IAAI,MAAM,MAAM,OAAO,UAAU,CAAC;GAElC,IAAI,UAAU,UAAU,eAAe;IACnC,MAAM,UAAU,KAAK,KAAK,QAAQ,GAAG,UAAU,MAAM,KAAK;IAC1D,IAAI,GAAG,WAAW,OAAO,KAAK,CAAC,OAAO;IACtC,GAAG,UAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;IACxC,GAAG,cAAc,SAAS,UAAU,eAAe,OAAO;IAC1D,eAAe,KAAK,UAAU,KAAK;IACnC,IAAI,MAAM,MAAM,OAAO,SAAS,CAAC;GACrC;EACJ;EAIA,IAAI,MAAM,SAAS,GAAG;GAClB,QAAQ,EAAE;GACV,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,iEAAiE,CAAC;GACzG,KAAK,MAAM,QAAQ,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,GAAG,QAAQ,MAAM,KAAK,OAAO,MAAM,CAAC;GACvE,QAAQ,MAAM,KAAK,qFAAqF,CAAC;EAC7G;EAIA,MAAM,UAAU,IAAI,IAAI,eAAe,KAAK,SAAS,KAAK,KAAK,CAAC;EAChE,MAAM,SAAS,qBAAqB,WAAW,OAAO,QAAQ,UAAU,QAAQ,IAAI,KAAK,CAAC,CAAC;EAC3F,IAAI,QAAQ;GACR,MAAM,CAAC,UAAU,GAAG,QAAQ,OAAO,MAAM,IAAI;GAC7C,QAAQ,EAAE;GACV,QAAQ,MAAM,OAAO,KAAK,UAAU,CAAC;GACrC,KAAK,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,CAAC;GACxD,QAAQ,MAAM,KAAK,kEAAkE,CAAC;EAC1F;EAIA,IAAI,eAAe,SAAS,GAAG;GAC3B,MAAM,YAAY,KAAK,KAAK,QAAQ,UAAU;GAC9C,MAAM,UAAU,eACX,KAAK,UAAU;IAAE,YAAY,KAAK;IAAY,YAAY,KAAK,KAAK;GAAQ,EAAE,CAAC,CAC/E,MAAM,GAAG,MAAM,EAAE,WAAW,cAAc,EAAE,UAAU,CAAC;GAC5D,IAAI,GAAG,WAAW,SAAS,KAAK,CAAC,OAC7B,GAAG,cAAc,WAAW,iBAAiB,GAAG,aAAa,WAAW,OAAO,GAAG,OAAO,GAAG,OAAO;QAChG;IAKH,MAAM,WAAW,GAAG,YAAY,MAAM,CAAC,CAClC,QAAQ,MAAM,EAAE,SAAS,KAAK,KAAK,MAAM,UAAU,CAAC,CACpD,KAAK,MAAM,EAAE,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,QAAQ,SAAS,CAAC,QAAQ,MAAM,UAAU,MAAM,eAAe,KAAK,MAAM,CAAC,CAAC,CAC5E,KAAK,UAAU;KAAE,YAAY,gBAAgB,IAAI;KAAG,YAAY,KAAK;IAAO,EAAE;IACnF,MAAM,MAAM,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,cAAc,EAAE,UAAU,CAAC;IAC7F,GAAG,cAAc,WAAW,iBAAiB,GAAG,GAAG,OAAO;GAC9D;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,WAAW,CAAC;EAC9G,IAAI,eAAe,SAAS,GACxB,IAAI,MAAM,KAAK,mCAAmC,OAAO,EAAE,CAAC;EAEhE,IAAI,eAAe,SAAS,KAAK,QAC7B,IAAI,MAAM,KAAK,KAAK,eAAe,OAAO,6BAA6B,OAAO,wDAAwD,CAAC;EAE3I,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"}
|
|
@@ -1,40 +1,23 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* Runtime introspection —
|
|
2
|
+
* Runtime introspection — what a backend with no `backend/schema` serves.
|
|
3
3
|
*
|
|
4
|
-
*
|
|
5
|
-
*
|
|
6
|
-
*
|
|
7
|
-
*
|
|
4
|
+
* `introspectTables` (`./introspect-tables`) describes every protected table
|
|
5
|
+
* of the database as a `TableDescriptor`; this module compiles those into the
|
|
6
|
+
* tables the runtime runs on (`compileIntrospectedTables`) and reads the catalogue the
|
|
7
|
+
* runtime builds its Drizzle tables from (`introspectSchema`, shared with the
|
|
8
|
+
* declared path in `catalogue-schema.ts`).
|
|
8
9
|
*
|
|
9
|
-
* Distinct from `introspect-db.ts`, which
|
|
10
|
-
*
|
|
11
|
-
*
|
|
12
|
-
* the same way whether it was generated or introspected.
|
|
10
|
+
* Distinct from `introspect-db.ts`, which describes the same database with
|
|
11
|
+
* `describeTables(…, { purpose: "generate" })` and prints the descriptors as
|
|
12
|
+
* `backend/schema` source for a developer to edit and commit.
|
|
13
13
|
*/
|
|
14
|
-
import type {
|
|
14
|
+
import type { CompiledTable, TableDescriptor } from "@rebasepro/types";
|
|
15
15
|
import { TableMeta } from "./introspect-db-logic.js";
|
|
16
16
|
export interface IntrospectedSchema {
|
|
17
17
|
tablesMap: Map<string, TableMeta>;
|
|
18
18
|
enumMap: Map<string, string[]>;
|
|
19
19
|
joinTables: Set<string>;
|
|
20
20
|
}
|
|
21
|
-
/** Whether a table carries an authorization model of its own. */
|
|
22
|
-
export interface TableRlsStatus {
|
|
23
|
-
table: string;
|
|
24
|
-
/** ALTER TABLE … ENABLE ROW LEVEL SECURITY has been run. */
|
|
25
|
-
rlsEnabled: boolean;
|
|
26
|
-
/** Policies attached to it. RLS enabled with none = nothing is visible. */
|
|
27
|
-
policyCount: number;
|
|
28
|
-
}
|
|
29
|
-
/**
|
|
30
|
-
* Read the RLS posture of each table in a schema.
|
|
31
|
-
*
|
|
32
|
-
* This is what decides whether baas mode may serve a table. A table with RLS
|
|
33
|
-
* disabled has no authorization model: since every authenticated request runs
|
|
34
|
-
* as `rebase_user`, and that role is granted DML on the schema, serving such a
|
|
35
|
-
* table hands every row to every logged-in user.
|
|
36
|
-
*/
|
|
37
|
-
export declare function readRlsStatus(client: Queryable, pgSchema: string): Promise<Map<string, TableRlsStatus>>;
|
|
38
21
|
/** Minimal query surface — satisfied by pg.Client and pg.Pool alike. */
|
|
39
22
|
export interface Queryable {
|
|
40
23
|
query<R>(text: string, values?: unknown[]): Promise<{
|
|
@@ -48,19 +31,47 @@ export interface Queryable {
|
|
|
48
31
|
export declare function introspectSchema(client: Queryable, pgSchema: string,
|
|
49
32
|
/**
|
|
50
33
|
* Read views and materialized views too, as tables to read from — what
|
|
51
|
-
* the runtime catalogue needs for
|
|
52
|
-
* for introspection that turns relations into
|
|
53
|
-
* is not one.
|
|
34
|
+
* the runtime catalogue needs for tables declared with `defineView`. Off
|
|
35
|
+
* for introspection that turns relations into tables to serve, where a
|
|
36
|
+
* view is not one.
|
|
54
37
|
*/
|
|
55
38
|
options?: {
|
|
56
39
|
views?: boolean;
|
|
57
40
|
}): Promise<IntrospectedSchema>;
|
|
58
41
|
/**
|
|
59
|
-
*
|
|
42
|
+
* What {@link compileIntrospectedTables} returns.
|
|
43
|
+
*
|
|
44
|
+
* @group Schema
|
|
45
|
+
*/
|
|
46
|
+
export interface CompiledIntrospection {
|
|
47
|
+
/** The descriptors served — every one given, unless it is in {@link dropped}. */
|
|
48
|
+
tables: TableDescriptor[];
|
|
49
|
+
/** The same tables compiled for the runtime, one per descriptor of {@link tables}, in the same order. */
|
|
50
|
+
compiled: CompiledTable[];
|
|
51
|
+
/**
|
|
52
|
+
* Descriptors no definition could be built from, each with why: a table
|
|
53
|
+
* `defineTable` itself refuses (no columns, a schema name that is not a plain
|
|
54
|
+
* identifier). They are not served; the relations into them are dropped.
|
|
55
|
+
*/
|
|
56
|
+
dropped: {
|
|
57
|
+
table: string;
|
|
58
|
+
reason: string;
|
|
59
|
+
}[];
|
|
60
|
+
}
|
|
61
|
+
/**
|
|
62
|
+
* The tables an introspected database is served through, compiled.
|
|
63
|
+
*
|
|
64
|
+
* Each descriptor is kept as introspected, beside the definition that states
|
|
65
|
+
* it (`compileDescribedTables`). The definitions carry `rls: "admin-only"`:
|
|
66
|
+
* Rebase generates no policy for a table it did not declare, and the
|
|
67
|
+
* request-time code reads none — the database's own policies decide every
|
|
68
|
+
* row, as they always have. The descriptors keep stating those policies for
|
|
69
|
+
* `GET /api/schema/tables`.
|
|
70
|
+
*
|
|
71
|
+
* Never throws for one table: a descriptor no definition can be built from is
|
|
72
|
+
* dropped and named in {@link CompiledIntrospection.dropped}, and the rest are
|
|
73
|
+
* served.
|
|
60
74
|
*
|
|
61
|
-
*
|
|
62
|
-
* express a many-to-many edge between two other tables.
|
|
75
|
+
* @group Schema
|
|
63
76
|
*/
|
|
64
|
-
export declare function
|
|
65
|
-
/** Introspect the database and return ready-to-serve collections. */
|
|
66
|
-
export declare function introspectCollections(client: Queryable, pgSchema: string): Promise<PostgresCollectionConfig[]>;
|
|
77
|
+
export declare function compileIntrospectedTables(tables: readonly TableDescriptor[]): CompiledIntrospection;
|
|
@@ -0,0 +1,182 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Introspection that speaks tables: a database's catalogue, read into
|
|
3
|
+
* {@link TableDescriptor}s.
|
|
4
|
+
*
|
|
5
|
+
* Two callers, one description:
|
|
6
|
+
*
|
|
7
|
+
* - **the runtime** (`introspectTables`, purpose `"serve"`): a backend with no
|
|
8
|
+
* `backend/schema` serves every protected table of its database. The
|
|
9
|
+
* descriptors are what `GET /api/schema/tables` serves, and what the
|
|
10
|
+
* request-time collections are lowered from.
|
|
11
|
+
* - **the source generator** (`rebase schema introspect`, purpose
|
|
12
|
+
* `"generate"`): the descriptors are printed as `backend/schema/<table>.ts`.
|
|
13
|
+
*
|
|
14
|
+
* Columns are their Postgres types (`ColumnType`): a uuid stays a uuid, a
|
|
15
|
+
* `varchar(n)` keeps its `n`, an enum its labels and its real type name; a type
|
|
16
|
+
* Rebase serves but does not create is `{ kind: "other", sqlType }`. Defaults
|
|
17
|
+
* are classified (`ColumnDefault`), identity and serial keys recognised,
|
|
18
|
+
* generated columns kept. Wire keys are `toWireKey` of the column with the
|
|
19
|
+
* first-free-key dedupe the runtime has always used, so the REST surface of an
|
|
20
|
+
* introspected database does not move by one key.
|
|
21
|
+
*
|
|
22
|
+
* Row-level security is read from the catalogue (`relrowsecurity`,
|
|
23
|
+
* `pg_policies`) and the refusal lives here, so every caller gets it: a table
|
|
24
|
+
* whose row-level security is off is not described — it is in `skipped`, with
|
|
25
|
+
* the SQL that protects it — unless the caller passes the one explicit opt-out,
|
|
26
|
+
* `unprotectedTables: "serve"`.
|
|
27
|
+
*
|
|
28
|
+
* @module
|
|
29
|
+
*/
|
|
30
|
+
import type { TableDescriptor, UnmappedTable } from "@rebasepro/types";
|
|
31
|
+
import { type SchemaMetadata } from "./introspect-db-logic.js";
|
|
32
|
+
import { type QueryableClient } from "./introspect-db-queries.js";
|
|
33
|
+
import type { CheckFactsByTable } from "./introspect-db-constraints.js";
|
|
34
|
+
/**
|
|
35
|
+
* A table introspection did not describe, and the SQL that would have it
|
|
36
|
+
* described.
|
|
37
|
+
*
|
|
38
|
+
* @group Schema
|
|
39
|
+
*/
|
|
40
|
+
export interface SkippedTable {
|
|
41
|
+
/** The table, unqualified. */
|
|
42
|
+
table: string;
|
|
43
|
+
/** Why, as a sentence. */
|
|
44
|
+
reason: string;
|
|
45
|
+
/** What to run so the table is served: `ALTER TABLE … ENABLE ROW LEVEL SECURITY;` and an example policy. */
|
|
46
|
+
remediationSql: string;
|
|
47
|
+
}
|
|
48
|
+
/**
|
|
49
|
+
* A junction table: folded away rather than described (the runtime serves no
|
|
50
|
+
* junction; the generator makes it a `manyToMany`).
|
|
51
|
+
*
|
|
52
|
+
* @group Schema
|
|
53
|
+
*/
|
|
54
|
+
export interface IntrospectedJunction {
|
|
55
|
+
table: string;
|
|
56
|
+
/** `ALTER TABLE … ENABLE ROW LEVEL SECURITY` has been run on it. */
|
|
57
|
+
rlsEnabled: boolean;
|
|
58
|
+
}
|
|
59
|
+
/**
|
|
60
|
+
* What {@link introspectTables} returns.
|
|
61
|
+
*
|
|
62
|
+
* @group Schema
|
|
63
|
+
*/
|
|
64
|
+
export interface IntrospectedTables {
|
|
65
|
+
/** One descriptor per table served, in table-name order. */
|
|
66
|
+
tables: TableDescriptor[];
|
|
67
|
+
/** The tables left out because row-level security is off on them, each with the SQL that protects it. */
|
|
68
|
+
skipped: SkippedTable[];
|
|
69
|
+
/** The junction tables, never described as tables. */
|
|
70
|
+
junctions: IntrospectedJunction[];
|
|
71
|
+
/** Tables described although row-level security is off on them — only with `unprotectedTables: "serve"`. */
|
|
72
|
+
unprotected: string[];
|
|
73
|
+
}
|
|
74
|
+
/**
|
|
75
|
+
* Options of {@link introspectTables}.
|
|
76
|
+
*
|
|
77
|
+
* @group Schema
|
|
78
|
+
*/
|
|
79
|
+
export interface IntrospectTablesOptions {
|
|
80
|
+
/**
|
|
81
|
+
* `"serve"` describes a table whose row-level security is off as well —
|
|
82
|
+
* with a rule that says every caller reaches every row. The one explicit,
|
|
83
|
+
* loud opt-out (`baas.unprotectedTables`); `"exclude"` (the default) leaves
|
|
84
|
+
* such a table in `skipped`.
|
|
85
|
+
*/
|
|
86
|
+
unprotectedTables?: "exclude" | "serve";
|
|
87
|
+
}
|
|
88
|
+
/**
|
|
89
|
+
* What one table's description says about itself, by table, for the generator
|
|
90
|
+
* to print: `drift` — what `rebase db push` would not reproduce exactly (a
|
|
91
|
+
* column no builder states as it is, a foreign key no relation can hold) — and
|
|
92
|
+
* `remark` — a decision the file states and the reader may want to undo
|
|
93
|
+
* (`index: false`, a many-to-many declared on one end only).
|
|
94
|
+
*
|
|
95
|
+
* @group Schema
|
|
96
|
+
*/
|
|
97
|
+
export interface IntrospectionNotes {
|
|
98
|
+
drift: Map<string, string[]>;
|
|
99
|
+
remark: Map<string, string[]>;
|
|
100
|
+
}
|
|
101
|
+
/**
|
|
102
|
+
* Options of {@link describeTables}.
|
|
103
|
+
*
|
|
104
|
+
* @group Schema
|
|
105
|
+
*/
|
|
106
|
+
export interface DescribeTablesOptions extends IntrospectTablesOptions {
|
|
107
|
+
/**
|
|
108
|
+
* - `"serve"` (default) — what the runtime serves, exactly as it always
|
|
109
|
+
* has: owning links only (`belongsTo`, its foreign-key column marked
|
|
110
|
+
* `derived` — the relation's, left out of the definition it is lowered
|
|
111
|
+
* from, exactly the collection the runtime has always built), the
|
|
112
|
+
* catalogue's policies as the rules, no heuristics.
|
|
113
|
+
* - `"generate"` — what `schema introspect` writes: foreign-key columns
|
|
114
|
+
* declared in `columns`, the reverse `hasMany` and the `manyToMany` of
|
|
115
|
+
* each junction, the admin baseline folded into `"admin-only"` /
|
|
116
|
+
* `defaultPolicies`, CHECK bounds as validation, `created_at` /
|
|
117
|
+
* `updated_at` stamps, the `search` block read back, and a table whose
|
|
118
|
+
* row-level security is off described as `"admin-only"` (the push then
|
|
119
|
+
* switches it on).
|
|
120
|
+
*/
|
|
121
|
+
purpose?: "serve" | "generate";
|
|
122
|
+
/** The junction tables. Default: the runtime's name-based rule (`identifyJoinTables`). */
|
|
123
|
+
joinTables?: ReadonlySet<string>;
|
|
124
|
+
/** Tables the caller does not want described (and that nothing may point at). */
|
|
125
|
+
leaveOut?: ReadonlySet<string>;
|
|
126
|
+
/** The CHECK constraints, parsed (`parseCheckConstraints`): validation in `"generate"`. */
|
|
127
|
+
checkFacts?: CheckFactsByTable;
|
|
128
|
+
}
|
|
129
|
+
/**
|
|
130
|
+
* What {@link describeTables} returns: {@link IntrospectedTables} and the notes.
|
|
131
|
+
*
|
|
132
|
+
* @group Schema
|
|
133
|
+
*/
|
|
134
|
+
export interface DescribedTables extends IntrospectedTables {
|
|
135
|
+
notes: IntrospectionNotes;
|
|
136
|
+
}
|
|
137
|
+
/**
|
|
138
|
+
* Describe every table of a Postgres schema, as the runtime serves them.
|
|
139
|
+
*
|
|
140
|
+
* Reads the catalogue (`readSchemaMetadata`: tables with `relrowsecurity`,
|
|
141
|
+
* columns, enums, keys, foreign keys, unique constraints, indexes, CHECKs,
|
|
142
|
+
* comments, `pg_policies`) and describes each table that is neither a junction
|
|
143
|
+
* nor unprotected. Only `SELECT`s.
|
|
144
|
+
*
|
|
145
|
+
* @group Schema
|
|
146
|
+
*/
|
|
147
|
+
export declare function introspectTables(client: QueryableClient, schema: string, options?: IntrospectTablesOptions): Promise<IntrospectedTables>;
|
|
148
|
+
/**
|
|
149
|
+
* The tables of one Postgres schema that no declared table maps, each
|
|
150
|
+
* described for "Import an existing table" to adopt.
|
|
151
|
+
*
|
|
152
|
+
* Each table is described as `rebase schema introspect` writes it
|
|
153
|
+
* (`describeTables(…, { purpose: "generate" })`), alone: a foreign key to a
|
|
154
|
+
* declared table is a `belongsTo`, one to another undeclared table stays a
|
|
155
|
+
* plain column (its constraint is left as it is), and the generator's reverse
|
|
156
|
+
* links — relations of other tables — are not this table's to declare.
|
|
157
|
+
*
|
|
158
|
+
* Its `rls` is never weaker than what the database enforces: with row-level
|
|
159
|
+
* security off, or no policy at all, it is `"admin-only"`, and `rlsRaised`
|
|
160
|
+
* says so. A table with no primary key is listed with why it cannot be
|
|
161
|
+
* imported. Junction tables and Rebase's own tables are left out. Only
|
|
162
|
+
* `SELECT`s.
|
|
163
|
+
*
|
|
164
|
+
* @param mapped The SQL names of the tables already declared in `schema`.
|
|
165
|
+
* @group Schema
|
|
166
|
+
*/
|
|
167
|
+
export declare function describeUnmappedTables(client: QueryableClient, schema: string, options: {
|
|
168
|
+
mapped: ReadonlySet<string>;
|
|
169
|
+
}): Promise<UnmappedTable[]>;
|
|
170
|
+
/**
|
|
171
|
+
* The SQL that protects a table introspection skipped: row-level security on,
|
|
172
|
+
* and an example policy to adapt — what boot prints for it.
|
|
173
|
+
*
|
|
174
|
+
* @group Schema
|
|
175
|
+
*/
|
|
176
|
+
export declare function rlsRemediationSql(schema: string, table: string): string;
|
|
177
|
+
/**
|
|
178
|
+
* Describe a schema from catalogue rows already read. Pure.
|
|
179
|
+
*
|
|
180
|
+
* @group Schema
|
|
181
|
+
*/
|
|
182
|
+
export declare function describeTables(metadata: SchemaMetadata, options?: DescribeTablesOptions): DescribedTables;
|
|
@@ -0,0 +1,55 @@
|
|
|
1
|
+
import { type CompiledTable, type TableDescriptor } from "@rebasepro/types";
|
|
2
|
+
/**
|
|
3
|
+
* The project's compiled tables — the planner's input — in slug order.
|
|
4
|
+
*
|
|
5
|
+
* Slug order is part of the contract, not a nicety: `generatePostgresDdl`, the
|
|
6
|
+
* policy generator and the boot planner emit in input order (enums and
|
|
7
|
+
* junction tables interleave with the tables that declare them), so the order
|
|
8
|
+
* here is the order of every generated file. It is the order the generators
|
|
9
|
+
* have always sorted by.
|
|
10
|
+
*
|
|
11
|
+
* A directory that does not exist, or has no index, declares no tables and
|
|
12
|
+
* yields `[]` — the headless (introspection) layout. A directory the user
|
|
13
|
+
* *named* and that does not exist is refused earlier, before anything is
|
|
14
|
+
* written (`assertSchemaDirExists`).
|
|
15
|
+
*
|
|
16
|
+
* @param schemaDir the schema directory, resolved against the working directory.
|
|
17
|
+
* @throws SchemaDefinitionError (from `@rebasepro/common`) naming every table
|
|
18
|
+
* and key that is wrong, or SchemaLoadError (from `@rebasepro/server`) naming
|
|
19
|
+
* the file that could not be read.
|
|
20
|
+
*/
|
|
21
|
+
export declare function loadTables(schemaDir: string): Promise<CompiledTable[]>;
|
|
22
|
+
/**
|
|
23
|
+
* The project's tables, loaded once, both ways a driver command reads them.
|
|
24
|
+
*
|
|
25
|
+
* @group Schema
|
|
26
|
+
*/
|
|
27
|
+
export interface LoadedTables {
|
|
28
|
+
/**
|
|
29
|
+
* The compiled descriptors, in slug order: what the schema-version
|
|
30
|
+
* stamp is computed over, and what `GET /api/schema/tables` serves.
|
|
31
|
+
*/
|
|
32
|
+
descriptors: TableDescriptor[];
|
|
33
|
+
/** The compiled tables, in the same slug order: what a driver opened from a script runs on. */
|
|
34
|
+
tables: CompiledTable[];
|
|
35
|
+
}
|
|
36
|
+
/**
|
|
37
|
+
* {@link loadTables}, with the descriptors beside the compiled tables — for a
|
|
38
|
+
* command that compares the stamp the runtime wrote (the doctor).
|
|
39
|
+
*
|
|
40
|
+
* @param schemaDir the schema directory, resolved against the working directory.
|
|
41
|
+
*/
|
|
42
|
+
export declare function loadTableSchema(schemaDir: string): Promise<LoadedTables>;
|
|
43
|
+
/**
|
|
44
|
+
* The schema version of what `rebase db push` provisions: the descriptors of
|
|
45
|
+
* the tables the default database holds.
|
|
46
|
+
*
|
|
47
|
+
* Exactly the set, and the function, the server stamps at boot
|
|
48
|
+
* (`enforceSchemaStamp` over the descriptors of the tables it provisions in
|
|
49
|
+
* the default database, hashed by `computeSchemaVersion`), so a database
|
|
50
|
+
* stamped by a push and the server that boots against it compute the same
|
|
51
|
+
* version — and the doctor, reading it, compares like with like.
|
|
52
|
+
*
|
|
53
|
+
* @group Schema
|
|
54
|
+
*/
|
|
55
|
+
export declare function defaultDatabaseSchemaVersion(loaded: LoadedTables): string;
|
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import type {
|
|
1
|
+
import type { CompiledTable } from "@rebasepro/types";
|
|
2
2
|
import type { Queryable } from "../security/policy-drift.js";
|
|
3
3
|
/**
|
|
4
4
|
* `rebase db migrate`'s last step: stamp what the migration left as its rules
|
|
@@ -6,7 +6,7 @@ import type { Queryable } from "../security/policy-drift.js";
|
|
|
6
6
|
* unstamped costs the next boot a re-apply of its table, which is what every
|
|
7
7
|
* boot after a migrate did before this.
|
|
8
8
|
*/
|
|
9
|
-
export declare function stampMigratedPolicies(databaseUrl: string,
|
|
9
|
+
export declare function stampMigratedPolicies(databaseUrl: string, schemaDir: string, adminRoleAvailable?: boolean): Promise<void>;
|
|
10
10
|
/**
|
|
11
11
|
* Stamp every declared policy whose stored definition its rule would store
|
|
12
12
|
* as it is, and none other.
|
|
@@ -16,7 +16,7 @@ export declare function stampMigratedPolicies(databaseUrl: string, collectionsPa
|
|
|
16
16
|
* whose spelling depends on it. See `PolicyStamping.searchPath`.
|
|
17
17
|
* @returns how many policies were stamped.
|
|
18
18
|
*/
|
|
19
|
-
export declare function stampPoliciesStoredAsRendered(client: Queryable,
|
|
19
|
+
export declare function stampPoliciesStoredAsRendered(client: Queryable, compiledTables: readonly CompiledTable[], options?: {
|
|
20
20
|
searchPath?: string;
|
|
21
21
|
adminRoleAvailable?: boolean;
|
|
22
22
|
}): Promise<{
|
|
@@ -38,4 +38,4 @@ export declare function stampPoliciesStoredAsRendered(client: Queryable, collect
|
|
|
38
38
|
*
|
|
39
39
|
* @returns how many policies were written again.
|
|
40
40
|
*/
|
|
41
|
-
export declare function moveMigratedAdminPoliciesToPublic(client: Queryable,
|
|
41
|
+
export declare function moveMigratedAdminPoliciesToPublic(client: Queryable, compiledTables: readonly CompiledTable[], log?: (message: string) => void): Promise<number>;
|