@rebasepro/server-postgres 0.25.0-canary.ge06257e → 0.25.1

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

@@ -1 +1 @@
-{"version":3,"file":"introspect-db.js","names":[],"sources":["../../src/schema/introspect-db-project.ts","../../src/schema/introspect-db-constraints.ts","../../src/schema/introspect-db.ts"],"sourcesContent":["/**\n * What the project being introspected into can actually import.\n *\n * The generator is pure — `introspect-db-logic.ts` reads no files — so the one\n * question it cannot answer for itself lives here: which `defineCollection`, if\n * any, will resolve from the directory the collections are written to.\n */\nimport fs from \"fs\";\nimport path from \"path\";\n\nimport { ADMIN_TYPES_PACKAGE, COMMON_PACKAGE, type CollectionBuilder } from \"./introspect-db-logic\";\n\n/** How far up to look before giving up, if no project root announces itself. */\nconst MAX_LEVELS = 8;\n\n/** Every dependency name a manifest declares, in any of the three fields. */\nfunction declaredDependencies(manifestPath: string): Set<string> {\n    const names = new Set<string>();\n    let parsed: unknown;\n    try {\n        parsed = JSON.parse(fs.readFileSync(manifestPath, \"utf-8\"));\n    } catch {\n        // A malformed or unreadable package.json is not this function's problem\n        // to report — it answers \"can this import resolve\", and the answer is no.\n        return names;\n    }\n    if (typeof parsed !== \"object\" || parsed === null) return names;\n    const manifest = parsed as Record<string, unknown>;\n    for (const field of [\"dependencies\", \"devDependencies\", \"peerDependencies\"]) {\n        const block = manifest[field];\n        if (typeof block === \"object\" && block !== null) {\n            for (const name of Object.keys(block)) names.add(name);\n        }\n    }\n    return names;\n}\n\n/**\n * Which `defineCollection` to generate against, for collections written to `outDir`.\n *\n * **The detection is the package manifests above the output directory**, unioned from\n * `outDir` up to and including the project root — the first ancestor holding a\n * `rebase.json`, or `MAX_LEVELS` up if there is none.\n *\n * That is the rule Node itself applies: a file in `config/collections` resolves a bare\n * specifier through `config/node_modules`, then `<project>/node_modules`, and so on up.\n * Reading the manifests along that same path answers the only question that matters —\n * *will this import resolve in the project I am writing into* — from the state on disk\n * at the moment of generation. The alternatives are all proxies for it: `rebase.json`'s\n * `apps` block says a CMS scaffold declared an admin app, and a `frontend/` directory\n * says one was scaffolded, but neither is what the compiler consults, and either can be\n * true of a project whose `config` package does not depend on `@rebasepro/cms-types`.\n *\n * Ambiguity resolves towards the admin panel: a project that declares both packages has\n * a panel, and `@rebasepro/cms-types` is the flavour that keeps the `admin` block.\n */\nexport function detectCollectionBuilder(outDir: string): CollectionBuilder {\n    let dir = path.resolve(outDir);\n    const declared = new Set<string>();\n\n    for (let level = 0; level < MAX_LEVELS; level++) {\n        const manifest = path.join(dir, \"package.json\");\n        if (fs.existsSync(manifest)) {\n            for (const name of declaredDependencies(manifest)) declared.add(name);\n        }\n        // The project root, and the last level worth reading: anything above it\n        // belongs to whatever the project happens to be checked out inside.\n        if (fs.existsSync(path.join(dir, \"rebase.json\"))) break;\n\n        const parent = path.dirname(dir);\n        if (parent === dir) break;\n        dir = parent;\n    }\n\n    if (declared.has(ADMIN_TYPES_PACKAGE)) return \"admin-types\";\n    if (declared.has(COMMON_PACKAGE)) return \"common\";\n    return \"annotation\";\n}\n","/**\n * Reading validation rules out of CHECK constraints.\n *\n * A CHECK constraint is the schema author stating a rule the database already\n * enforces. Introspection has never read them, so a generated form let the user\n * type a value the database was always going to reject — the rule was written\n * down, in the schema, and the UI asked anyway.\n *\n * Everything here parses the *normalized* text `pg_get_constraintdef` produces,\n * not what the author typed: Postgres re-renders the expression from its parse\n * tree, so `CHECK (price > 0)` on a `numeric` column always comes back as\n * `CHECK ((price > (0)::numeric))`. That normalization is what makes a\n * string-level parser tractable — the input is generated, and the shapes are\n * few.\n *\n * Constraints this cannot read are skipped in full. A partially-understood\n * constraint is worse than an unread one: it would produce validation that\n * *narrows* differently from the database, so a value the UI accepts still\n * fails on write, or — worse — a value the database allows is refused in the\n * form with no way to see why.\n *\n * Pure module: no I/O, no logging.\n */\nimport type { CheckConstraintRow } from \"./introspect-db-logic\";\n\n/** What a table's CHECK constraints say about one column. */\nexport interface ColumnCheckFacts {\n    /** Allowed values, from `IN (…)` / `= ANY (ARRAY[…])` / `= 'literal'`. */\n    enumValues?: string[];\n    /** `x >= n` */\n    min?: number;\n    /** `x <= n` */\n    max?: number;\n    /** `x > n` */\n    moreThan?: number;\n    /** `x < n` */\n    lessThan?: number;\n    /** `length(x) >= n` */\n    lengthMin?: number;\n    /** `length(x) <= n` */\n    lengthMax?: number;\n}\n\n/** Per-table, per-column facts. */\nexport type CheckFactsByTable = Map<string, Map<string, ColumnCheckFacts>>;\n\n/** The length functions whose argument is the column being constrained. */\nconst LENGTH_FUNCTIONS = new Set([\"length\", \"char_length\", \"character_length\", \"octet_length\"]);\n\n/**\n * Splits on a separator that appears at paren depth 0 and outside string\n * literals.\n *\n * Depth tracking is the whole job: `ARRAY['a', 'b']` contains a comma that must\n * not split the enclosing argument list, and `'it''s'` contains a quote that\n * must not end the literal.\n */\nfunction splitTopLevel(input: string, separator: string): string[] {\n    const parts: string[] = [];\n    let depth = 0;\n    let inString = false;\n    let current = \"\";\n\n    for (let i = 0; i < input.length; i++) {\n        const ch = input[i];\n\n        if (inString) {\n            current += ch;\n            if (ch === \"'\") {\n                // '' inside a literal is an escaped quote, not the end of it.\n                if (input[i + 1] === \"'\") {\n                    current += input[++i];\n                } else {\n                    inString = false;\n                }\n            }\n            continue;\n        }\n\n        if (ch === \"'\") {\n            inString = true;\n            current += ch;\n            continue;\n        }\n        if (ch === \"(\" || ch === \"[\") depth++;\n        if (ch === \")\" || ch === \"]\") depth--;\n\n        if (depth === 0 && input.startsWith(separator, i)) {\n            // A word separator must not match inside an identifier: \"AND\" is a\n            // separator in `a AND b` but not in `brand = 1`.\n            const before = input[i - 1];\n            const after = input[i + separator.length];\n            const wordish = /[A-Za-z]/.test(separator[0]);\n            const boundedOk = !wordish || ((before === undefined || !/[A-Za-z0-9_]/.test(before)) &&\n                (after === undefined || !/[A-Za-z0-9_]/.test(after)));\n            if (boundedOk) {\n                parts.push(current);\n                current = \"\";\n                i += separator.length - 1;\n                continue;\n            }\n        }\n\n        current += ch;\n    }\n\n    parts.push(current);\n    return parts.map((p) => p.trim()).filter((p) => p.length > 0);\n}\n\n/** Removes one layer of wrapping parentheses, repeatedly, when balanced. */\nexport function unwrapParens(input: string): string {\n    let s = input.trim();\n    while (s.startsWith(\"(\") && s.endsWith(\")\")) {\n        let depth = 0;\n        let balanced = true;\n        let inString = false;\n        for (let i = 0; i < s.length; i++) {\n            const ch = s[i];\n            if (inString) {\n                if (ch === \"'\") {\n                    if (s[i + 1] === \"'\") i++;\n                    else inString = false;\n                }\n                continue;\n            }\n            if (ch === \"'\") { inString = true; continue; }\n            if (ch === \"(\") depth++;\n            else if (ch === \")\") {\n                depth--;\n                // The opening paren closed before the end, so the outer pair is\n                // not a wrapper: `(a) AND (b)`.\n                if (depth === 0 && i < s.length - 1) { balanced = false; break; }\n            }\n        }\n        if (!balanced) break;\n        s = s.slice(1, -1).trim();\n    }\n    return s;\n}\n\n/** Drops trailing `::type` casts, including array and quoted forms. */\nexport function stripCasts(input: string): string {\n    let s = unwrapParens(input);\n    let previous: string;\n    do {\n        previous = s;\n        s = unwrapParens(\n            s.replace(/::\\s*\"?[A-Za-z_][A-Za-z0-9_ ]*\"?(\\s*\\(\\s*\\d+\\s*(,\\s*\\d+\\s*)?\\))?(\\s*\\[\\s*\\])*\\s*$/, \"\").trim()\n        );\n    } while (s !== previous);\n    return s;\n}\n\n/** A bare, unquoted column reference — anything else is an expression. */\nfunction asColumnName(input: string): string | null {\n    const s = stripCasts(input);\n    if (/^[a-z_][a-z0-9_$]*$/i.test(s)) return s;\n    // A quoted identifier keeps its case: \"userId\".\n    const quoted = s.match(/^\"([^\"]+)\"$/);\n    return quoted ? quoted[1] : null;\n}\n\n/** `length(col)` and friends → the column they measure. */\nfunction asLengthOfColumn(input: string): string | null {\n    const s = stripCasts(input);\n    const match = s.match(/^([a-z_]+)\\s*\\((.*)\\)$/is);\n    if (!match || !LENGTH_FUNCTIONS.has(match[1].toLowerCase())) return null;\n    return asColumnName(match[2]);\n}\n\n/** A numeric literal, after casts are removed. Rejects anything else. */\nfunction asNumber(input: string): number | null {\n    const s = stripCasts(input).replace(/^'(.*)'$/s, \"$1\");\n    if (!/^[+-]?(\\d+\\.?\\d*|\\.\\d+)$/.test(s)) return null;\n    const n = Number(s);\n    return Number.isFinite(n) ? n : null;\n}\n\n/** A single-quoted string literal, with `''` unescaped. */\nfunction asStringLiteral(input: string): string | null {\n    const s = stripCasts(input);\n    if (!s.startsWith(\"'\") || !s.endsWith(\"'\") || s.length < 2) return null;\n    const body = s.slice(1, -1);\n    // Any unescaped quote inside means this was not one literal.\n    if (/(^|[^'])'($|[^'])/.test(body)) return null;\n    return body.replace(/''/g, \"'\");\n}\n\n/** The element list of `ARRAY[…]`, or of a parenthesised `IN (…)` list. */\nfunction asValueList(input: string): string[] | null {\n    const s = stripCasts(input);\n    const arrayMatch = s.match(/^ARRAY\\s*\\[(.*)\\]$/is);\n    const body = arrayMatch ? arrayMatch[1] : (s.startsWith(\"(\") && s.endsWith(\")\") ? s.slice(1, -1) : null);\n    if (body === null) return null;\n    if (body.trim() === \"\") return null;\n\n    const values: string[] = [];\n    for (const element of splitTopLevel(body, \",\")) {\n        const literal = asStringLiteral(element);\n        if (literal !== null) {\n            values.push(literal);\n            continue;\n        }\n        const numeric = asNumber(element);\n        if (numeric !== null) {\n            values.push(String(numeric));\n            continue;\n        }\n        return null; // A non-literal element means this is not an enumeration.\n    }\n    return values;\n}\n\n/** One understood comparison, already resolved to the column it constrains. */\ninterface CheckTerm {\n    column: string;\n    apply: (facts: ColumnCheckFacts) => void;\n}\n\n/**\n * Parses one conjunct. Returns null when the shape is not one of the few this\n * understands, which is the signal to abandon the whole constraint.\n */\nfunction parseTerm(rawTerm: string): CheckTerm | null {\n    const term = unwrapParens(rawTerm);\n\n    // ── Membership: `x = ANY (ARRAY[…])`, `x IN (…)` ──────────────────\n    const anyMatch = term.match(/^(.*?)\\s*=\\s*ANY\\s*(\\(.*\\))$/is);\n    const inMatch = anyMatch ? null : term.match(/^(.*?)\\s+IN\\s*(\\(.*\\))$/is);\n    const membership = anyMatch ?? inMatch;\n    if (membership) {\n        const column = asColumnName(membership[1]);\n        const values = asValueList(membership[2]);\n        if (!column || !values || values.length === 0) return null;\n        return {\n            column,\n            apply: (facts) => {\n                // Two membership checks on one column mean both must hold.\n                facts.enumValues = facts.enumValues\n                    ? facts.enumValues.filter((v) => values.includes(v))\n                    : values;\n            }\n        };\n    }\n\n    // ── Comparison: `x >= n`, `length(x) <= n`, `x = 'literal'` ───────\n    // Longest operators first so `>=` is not read as `>`.\n    for (const operator of [\">=\", \"<=\", \"<>\", \"!=\", \"=\", \">\", \"<\"] as const) {\n        const parts = splitTopLevel(term, operator);\n        if (parts.length !== 2) continue;\n        const [rawLeft, rawRight] = parts;\n\n        const lengthColumn = asLengthOfColumn(rawLeft);\n        if (lengthColumn) {\n            const bound = asNumber(rawRight);\n            if (bound === null) return null;\n            switch (operator) {\n                case \">=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound, bound); } };\n                case \">\": return { column: lengthColumn, apply: (f) => { f.lengthMin = Math.max(f.lengthMin ?? bound + 1, bound + 1); } };\n                case \"<=\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound, bound); } };\n                case \"<\": return { column: lengthColumn, apply: (f) => { f.lengthMax = Math.min(f.lengthMax ?? bound - 1, bound - 1); } };\n                case \"=\": return { column: lengthColumn, apply: (f) => { f.lengthMin = bound; f.lengthMax = bound; } };\n                default: return null;\n            }\n        }\n\n        const column = asColumnName(rawLeft);\n        if (!column) continue;\n\n        if (operator === \"=\") {\n            const literal = asStringLiteral(rawRight);\n            if (literal !== null) {\n                return {\n                    column,\n                    apply: (facts) => {\n                        facts.enumValues = facts.enumValues\n                            ? facts.enumValues.filter((v) => v === literal)\n                            : [literal];\n                    }\n                };\n            }\n            // `x = 5` pins a number. Expressed as both bounds rather than as a\n            // one-value enum, which for a number would render as a dropdown.\n            const pinned = asNumber(rawRight);\n            if (pinned === null) return null;\n            return { column, apply: (f) => { f.min = pinned; f.max = pinned; } };\n        }\n\n        const bound = asNumber(rawRight);\n        if (bound === null) return null;\n        switch (operator) {\n            case \">=\": return { column, apply: (f) => { f.min = Math.max(f.min ?? bound, bound); } };\n            case \">\": return { column, apply: (f) => { f.moreThan = Math.max(f.moreThan ?? bound, bound); } };\n            case \"<=\": return { column, apply: (f) => { f.max = Math.min(f.max ?? bound, bound); } };\n            case \"<\": return { column, apply: (f) => { f.lessThan = Math.min(f.lessThan ?? bound, bound); } };\n            default: return null; // `<>` / `!=` exclude rather than bound.\n        }\n    }\n\n    return null;\n}\n\n/**\n * Reads one constraint definition into per-column facts.\n *\n * Returns an empty map for anything not understood — including a constraint\n * that is understood but spans two columns (`start_date < end_date`), which no\n * per-property validation rule can express.\n */\nexport function parseCheckDefinition(definition: string): Map<string, ColumnCheckFacts> {\n    const result = new Map<string, ColumnCheckFacts>();\n\n    const body = definition\n        .trim()\n        .replace(/\\s+NOT\\s+VALID\\s*$/i, \"\")\n        .replace(/^CHECK\\s*/i, \"\")\n        .trim();\n    if (body === definition.trim()) return result; // Not a CHECK definition.\n\n    const expression = unwrapParens(body);\n    if (!expression) return result;\n\n    // Only conjunctions. A disjunction (`a OR b`) does not narrow a column: each\n    // branch may allow what the other forbids, so no single bound follows.\n    if (splitTopLevel(expression, \" OR \").length > 1) return result;\n\n    const terms = splitTopLevel(expression, \" AND \");\n    const parsed: CheckTerm[] = [];\n    for (const term of terms) {\n        const one = parseTerm(term);\n        if (!one) return result; // One unreadable conjunct voids the constraint.\n        parsed.push(one);\n    }\n\n    // A CHECK naming two columns constrains their *relationship*; keeping the\n    // half that mentions one column would assert something the database does not.\n    const columns = new Set(parsed.map((t) => t.column));\n    if (columns.size !== 1) return result;\n\n    const facts: ColumnCheckFacts = {};\n    for (const term of parsed) term.apply(facts);\n    if (Object.keys(facts).length === 0) return result;\n\n    result.set(parsed[0].column, facts);\n    return result;\n}\n\n/** Merges every readable CHECK in the schema into per-table, per-column facts. */\nexport function parseCheckConstraints(rows: CheckConstraintRow[]): CheckFactsByTable {\n    const byTable: CheckFactsByTable = new Map();\n\n    for (const row of rows) {\n        const parsed = parseCheckDefinition(row.definition);\n        if (parsed.size === 0) continue;\n\n        let table = byTable.get(row.table_name);\n        if (!table) {\n            table = new Map();\n            byTable.set(row.table_name, table);\n        }\n\n        for (const [column, facts] of parsed) {\n            const existing = table.get(column);\n            if (!existing) {\n                table.set(column, facts);\n                continue;\n            }\n            // Separate constraints on the same column all hold at once.\n            if (facts.enumValues) {\n                existing.enumValues = existing.enumValues\n                    ? existing.enumValues.filter((v) => facts.enumValues!.includes(v))\n                    : facts.enumValues;\n            }\n            if (facts.min !== undefined) existing.min = Math.max(existing.min ?? facts.min, facts.min);\n            if (facts.max !== undefined) existing.max = Math.min(existing.max ?? facts.max, facts.max);\n            if (facts.moreThan !== undefined) existing.moreThan = Math.max(existing.moreThan ?? facts.moreThan, facts.moreThan);\n            if (facts.lessThan !== undefined) existing.lessThan = Math.min(existing.lessThan ?? facts.lessThan, facts.lessThan);\n            if (facts.lengthMin !== undefined) existing.lengthMin = Math.max(existing.lengthMin ?? facts.lengthMin, facts.lengthMin);\n            if (facts.lengthMax !== undefined) existing.lengthMax = Math.min(existing.lengthMax ?? facts.lengthMax, facts.lengthMax);\n        }\n    }\n\n    return byTable;\n}\n","import chalk from \"chalk\";\nimport fs from \"fs\";\nimport path from \"path\";\nimport pg from \"pg\";\nimport arg from \"arg\";\nimport * as dotenv from \"dotenv\";\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\";\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    const client = new pg.Client({ connectionString: 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;;;ACvWA,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;CAEA,MAAM,SAAS,IAAI,GAAG,OAAO,EAAE,kBAAkB,YAAY,CAAC;CAE9D,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"}
+{"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"}

package/dist/schema/migrate-policy-stamps.d.ts

@@ -0,0 +1,23 @@
+import type { CollectionConfig } from "@rebasepro/types";
+import type { Queryable } from "../security/policy-drift.js";
+/**
+ * `rebase db migrate`'s last step: stamp what the migration left as its rules
+ * make it, on this process's connection. Never fatal — a policy left
+ * unstamped costs the next boot a re-apply of its table, which is what every
+ * boot after a migrate did before this.
+ */
+export declare function stampMigratedPolicies(databaseUrl: string, collectionsPath: string): Promise<void>;
+/**
+ * Stamp every declared policy whose stored definition its rule would store
+ * as it is, and none other.
+ *
+ * @param options.searchPath the `search_path` a boot reads policies under,
+ *        when the connection's own differs — the stamp hashes `pg_get_expr`,
+ *        whose spelling depends on it. See `PolicyStamping.searchPath`.
+ * @returns how many policies were stamped.
+ */
+export declare function stampPoliciesStoredAsRendered(client: Queryable, collections: CollectionConfig[], options?: {
+    searchPath?: string;
+}): Promise<{
+    stamped: number;
+}>;

package/dist/schema/push-policy-plan.d.ts

@@ -18,8 +18,11 @@
  *   it: by name, `TO` list, command, mode and which clauses there are. Text
  *   is compared through the stamp the push and every boot write
  *   ({@link readPolicyStamps}), which is what catches a rule whose SQL changed
- *   under the same name. A policy without one is re-created from its rule with
- *   nothing to tell beforehand whether it changes, and is listed as such.
+ *   under the same name. Where the stamp does not match, or there is none (a
+ *   policy `db migrate` or a hand made), the policy is made again under a probe
+ *   name and rolled back ({@link probeRenderedPolicies}): one Postgres would
+ *   store exactly as it is now is no change. Only one that could not be probed
+ *   is listed as unstamped.
  * - **Policies dropped and kept:** {@link partitionOrphans}, which is how the
  *   push's reconcile step decides.
  */
@@ -65,3 +68,8 @@ export declare function formatPolicyPushPlan(plan: PolicyPushPlan): {
 };
 /** One line for the push itself: the counts, or `null` when it changes no row-level security. */
 export declare function summarizePolicyPushPlan(plan: PolicyPushPlan): string | null;
+/**
+ * Run `read` under `searchPath`, set for one transaction and gone after it, or
+ * as the connection is when there is none to set.
+ */
+export declare function underSearchPath<T>(client: Queryable, searchPath: string | undefined, read: () => Promise<T>): Promise<T>;

package/dist/services/BranchService.d.ts

@@ -10,6 +10,41 @@ import { BranchInfo } from "@rebasepro/types";
 import { DrizzleClient } from "../interfaces.js";
 import { BranchRow } from "../branch-prune.js";
 import { DatabasePoolManager } from "../databasePoolManager.js";
+/** What {@link reopenClosedDatabases} found closed, and what became of each. */
+export interface ReopenedDatabases {
+    /** Databases that refused new connections, and accept them again. */
+    reopened: string[];
+    /** Databases that refuse new connections and could not be opened, with Postgres's reason. */
+    failed: {
+        database: string;
+        reason: string;
+        statement: string;
+    }[];
+}
+/**
+ * Open again the database `connectionString` names, and each of `others`,
+ * where one refuses new connections.
+ *
+ * `rebase db branch create --force` closes its source with `ALLOW_CONNECTIONS
+ * false` for the copy, and opens it again after, and on every signal it can
+ * catch. A SIGKILL — an out-of-memory kill, a CI runner's hard stop — leaves
+ * it closed: the app answers 503, and `rebase dev`, `console` and `push` all
+ * fail, on the project's own database. Nothing else in a development database
+ * closes one, so a closed one found here is that, and every `rebase db branch`
+ * command calls this before it does anything else.
+ *
+ * Runs from the server's `postgres` database, since a closed database cannot
+ * be connected to. A template is never touched (`template0` is closed by
+ * design), nor a database a live forced create holds closed: one whose
+ * {@link COPY_LOCK_CLASS} lock is held, or that a `CREATE DATABASE … TEMPLATE`
+ * is copying right now. That create opens it itself.
+ *
+ * Best-effort: a server it cannot reach, or a catalogue it cannot read, is an
+ * empty answer, and the command's own connection check speaks next.
+ */
+export declare function reopenClosedDatabases(connectionString: string, others?: readonly (string | null | undefined)[]): Promise<ReopenedDatabases>;
+/** What to say about {@link reopenClosedDatabases}'s answer: one line a database, or none. */
+export declare function reopenedDatabasesNotice(result: ReopenedDatabases): string[];
 /**
  * The connected server cannot branch, so nothing was done.
  *
@@ -113,6 +148,56 @@ export declare class BranchService {
      * diagnostic that throws would replace a real error with its own.
      */
     private describeBlockingConnections;
+    /**
+     * Run `operation` with no other session on `dbName`, disconnecting them
+     * first: what `--force` asks for.
+     *
+     * Disconnected, a client that reconnects — a running `rebase dev`'s
+     * realtime listener does — can be back before `CREATE DATABASE … TEMPLATE`
+     * or `DROP DATABASE` counts the sessions, and it failed on one about once
+     * in seven tries, saying to pass the `--force` that had been passed. So a
+     * refusal on a session still connected is retried, disconnecting again, a
+     * few times before it is reported.
+     */
+    private disconnectingOthers;
+    /**
+     * Run `operation` with `dbName` refusing new connections, and open it
+     * again after, whatever happens.
+     *
+     * A client disconnected from the source — a running `rebase dev` holds a
+     * pool and a realtime listener — cannot then reconnect before the copy has
+     * counted the sessions on it. Postgres refuses `ALLOW_CONNECTIONS false` on
+     * the database a session is connected to, so both statements run from the
+     * server's `postgres` database, and they need the database's owner. Where
+     * either is missing, the retries of {@link disconnectingOthers} are what is
+     * left. A database found closed already — by a run killed before it could
+     * open it — is copied as it is and opened after, like one this run closed.
+     *
+     * Stopped by a signal while closed ({@link REOPEN_ON_SIGNALS}), it opens
+     * the database again before the process exits; a second signal waits for
+     * that rather than cutting it short. One it could not open is named, with
+     * the statement that does. No handler is left installed after the copy.
+     *
+     * From before it reads whether the database is open until after it opens
+     * it, it holds the {@link COPY_LOCK_CLASS} lock, so the self-heal leaves
+     * the database to it and a second forced create on the same source waits
+     * for it. A process that dies holding it ends its session, which releases
+     * it. A server the lock cannot be taken on is copied without one.
+     */
+    private whileClosedToNewConnections;
+    /**
+     * The {@link COPY_LOCK_CLASS} lock on `dbName`, on a client of its own, or
+     * null where it cannot be taken.
+     *
+     * Its own client, never one checked out of the maintenance pool: opening
+     * the database again ends that pool, and `pool.end()` waits for its
+     * checked-out clients, so the create would wait on itself.
+     */
+    private holdCopyLock;
+    /** {@link whileClosedToNewConnections} past its lock. */
+    private closedToNewConnections;
+    /** `ALLOW_CONNECTIONS true` again, from the maintenance database, or an error that says how to do it by hand. */
+    private reopenToConnections;
     /**
      * Disconnect every other session on a database, and say how many.
      *

package/dist/services/pg-notify-listener.d.ts

@@ -100,6 +100,8 @@ export declare class PgNotifyListener {
     private heartbeatInFlight;
     private downSince?;
     private lastHeartbeatAt?;
+    /** Whether this outage's "could not be opened" has been said. Cleared once it listens again. */
+    private outageWarned;
     constructor(options: PgNotifyListenerOptions);
     /** Whether the listener is meant to be connected right now. */
     get active(): boolean;

package/dist/{source-DB6xJv3p.js → source-fZb92pN8.js}

@@ -1,6 +1,6 @@
 import { createRequire as __createRequire } from "module";
 __createRequire(import.meta.url);
-import { n as __exportAll } from "./rolldown-runtime-V7rFbMRe.js";
+import { i as __exportAll } from "./cli-prompt-DXG0yk-h.js";
 import { isPostgresCollectionConfig, parseEnvBoolean } from "@rebasepro/types";
 import { getTableName, resolveCollectionRelations } from "@rebasepro/common";
 import { sha1Hex, truncateToBytes } from "@rebasepro/utils";
@@ -462,9 +462,52 @@ var wantsStack = () => parseEnvBoolean(process.env.REBASE_DEBUG) === true;
 */
 var describeFailure = (error) => {
 	if (!(error instanceof Error)) return String(error);
-	if (wantsStack() && error.stack) return error.stack;
+	const failedQuery = describeFailedQuery(error);
+	const lead = failedQuery?.reason ? `${failedQuery.reason}\n  ` : "";
+	if (wantsStack() && error.stack) {
+		if (!failedQuery) return error.stack;
+		const opening = `${error.name}: ${error.message}`;
+		const frames = error.stack.startsWith(opening) ? error.stack.slice(opening.length) : `\n${error.stack}`;
+		return `${lead}${error.name}: ${failedQuery.query}${frames}`;
+	}
+	if (failedQuery) return `${lead}${failedQuery.query}\n  Re-run with --debug for the stack trace.`;
 	return `${error.message}\n  Re-run with --debug for the stack trace.`;
 };
+/**
+* A failed query as a reader needs it: why it failed — Postgres' own reason
+* with its SQLSTATE (`relation "nope_table" does not exist (42P01)`), or the
+* driver's when Postgres never answered — and the query without the values it
+* ran with. `null` for any other error.
+*
+* Drizzle reports a failed query as `Failed query: <sql>` and a `params:` line
+* and keeps the error underneath in `cause`, so the message alone names a query
+* and no reason: `rebase console -e` printed exactly that, `--debug` included.
+* The values stay off the terminal: they are whatever the code passed, a
+* password hash or a token as readily as an id.
+*/
+function describeFailedQuery(error) {
+	if (!error.message.startsWith("Failed query:")) return null;
+	const paramsAt = error.message.lastIndexOf("\nparams:");
+	const postgres = postgresError(error.cause);
+	return {
+		reason: postgres ? `${postgres.message} (${postgres.code})` : deepestMessage(error.cause),
+		query: paramsAt === -1 ? error.message : error.message.slice(0, paramsAt)
+	};
+}
+/** The error Postgres raised, from a cause chain: the one carrying a SQLSTATE. */
+function postgresError(cause, depth = 0) {
+	if (!(cause instanceof Error) || depth > 5) return null;
+	if ("code" in cause && typeof cause.code === "string" && /^[0-9A-Z]{5}$/.test(cause.code) && cause.message) return {
+		code: cause.code,
+		message: cause.message
+	};
+	return postgresError(cause.cause, depth + 1);
+}
+/** The innermost message in a cause chain, or `null` when there is none. */
+function deepestMessage(cause, depth = 0) {
+	if (!(cause instanceof Error) || depth > 5) return null;
+	return deepestMessage(cause.cause, depth + 1) ?? (cause.message || null);
+}
 //#endregion
 //#region ../../node_modules/.pnpm/chalk@5.6.2/node_modules/chalk/source/vendor/ansi-styles/index.js
 var ANSI_BACKGROUND_OFFSET = 10;
@@ -870,4 +913,4 @@ createChalk({ level: stderrColor ? stderrColor.level : 0 });
 //#endregion
 export { sortIndexSpecs as _, outWarn as a, buildCollectionIndexSpecs as c, collection_index_exports as d, deriveIndexName as f, renderPredicate as g, leadsWithColumn as h, outError as i, collectionIndexStatement as l, isRebaseIndexName as m, describeFailure as n, atlasExcludePattern as o, foreignKeyIndexSpec as p, out as r, excludePatternParts as s, chalk as t, collectionIndexStatements as u };
 
-//# sourceMappingURL=source-DB6xJv3p.js.map
+//# sourceMappingURL=source-fZb92pN8.js.map