@voltro/database 0.44.1 → 0.45.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +104 -1
- package/dist/index.d.ts +51 -0
- package/dist/index.js +599 -588
- package/dist/sql.js +337 -337
- package/package.json +2 -2
package/dist/sql.js
CHANGED
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
import { Jt as e, Lt as t, Q as n, Rt as r, X as i, Yt as a, Z as o, _ as s, a as c, c as l, ht as u, i as d, l as f, m as p, n as m, nt as h, o as g, p as _, r as v, tt as y, xt as b } from "./frameworkLiveTables-XPFqj8n3.js";
|
|
2
2
|
import { Effect as x, Schedule as S } from "effect";
|
|
3
|
-
import {
|
|
3
|
+
import { createHash as ee } from "node:crypto";
|
|
4
|
+
import { createLogger as te } from "@voltro/logger";
|
|
4
5
|
import { SqlClient as C } from "@effect/sql";
|
|
5
|
-
import { createHash as te } from "node:crypto";
|
|
6
6
|
import { promises as ne } from "node:fs";
|
|
7
7
|
import { join as re } from "node:path";
|
|
8
8
|
import { pathToFileURL as ie } from "node:url";
|
|
@@ -94,54 +94,54 @@ var ae = (e, t, n, r = 400) => {
|
|
|
94
94
|
}, be = (e) => {
|
|
95
95
|
let t = me(e);
|
|
96
96
|
return t === void 0 ? pe : ye(`voltro_migration_lock:${t}`) & 9223372036854775807n;
|
|
97
|
-
},
|
|
97
|
+
}, T = (e) => {
|
|
98
98
|
let t = `voltro_migration_${pe.toString(36)}`, n = me(e);
|
|
99
99
|
if (n === void 0) return t;
|
|
100
100
|
let r = `${t}_${n}`;
|
|
101
101
|
return /^[A-Za-z0-9_]+$/.test(n) && r.length <= 64 ? r : `${t}_h${(ye(`voltro_migration_lock:${n}`) & ve).toString(16)}`;
|
|
102
|
-
},
|
|
102
|
+
}, xe = 250, Se = () => {
|
|
103
103
|
let e = Number(process.env.VOLTRO_MIGRATION_LOCK_TIMEOUT_MS);
|
|
104
104
|
return Number.isFinite(e) && e > 0 ? e : 3e4;
|
|
105
|
-
},
|
|
106
|
-
let n =
|
|
105
|
+
}, Ce = (e, t) => x.gen(function* () {
|
|
106
|
+
let n = Se(), r = Date.now();
|
|
107
107
|
for (;;) {
|
|
108
108
|
if ((yield* e`
|
|
109
109
|
SELECT pg_try_advisory_lock(${t.toString()}::bigint) AS got`)[0]?.got) return;
|
|
110
|
-
Date.now() - r >= n && (yield* x.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* x.sleep(`${
|
|
110
|
+
Date.now() - r >= n && (yield* x.die(/* @__PURE__ */ Error(`could not acquire the postgres migration advisory lock within ${Math.round(n / 1e3)}s. Another migration is in progress, or a prior boot crashed while holding it. (A crashed process's session-level advisory lock is released once its DB connection closes; if this persists, find + terminate the holder via pg_stat_activity, or raise VOLTRO_MIGRATION_LOCK_TIMEOUT_MS.)`))), yield* x.sleep(`${xe} millis`);
|
|
111
111
|
}
|
|
112
|
-
}),
|
|
112
|
+
}), we = (e, t) => x.gen(function* () {
|
|
113
113
|
yield* e`SELECT pg_advisory_unlock(${t.toString()}::bigint)`;
|
|
114
|
-
}),
|
|
114
|
+
}), Te = 30, Ee = (e, t) => x.gen(function* () {
|
|
115
115
|
(yield* e`
|
|
116
|
-
SELECT GET_LOCK(${t}, ${
|
|
117
|
-
}),
|
|
116
|
+
SELECT GET_LOCK(${t}, ${Te}) AS got`)[0]?.got !== 1 && (yield* x.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' within ${Te}s (another migration is in progress, or a prior one left it held).`)));
|
|
117
|
+
}), De = (e, t) => x.gen(function* () {
|
|
118
118
|
yield* e`SELECT RELEASE_LOCK(${t})`;
|
|
119
|
-
}),
|
|
119
|
+
}), Oe = 3e4, ke = (e, t) => x.gen(function* () {
|
|
120
120
|
let n = yield* e`
|
|
121
121
|
DECLARE @res int;
|
|
122
122
|
EXEC @res = sp_getapplock @Resource = ${t}, @LockMode = 'Exclusive',
|
|
123
|
-
@LockOwner = 'Session', @LockTimeout = ${
|
|
123
|
+
@LockOwner = 'Session', @LockTimeout = ${Oe};
|
|
124
124
|
SELECT @res AS res`;
|
|
125
125
|
(n[0]?.res ?? -999) < 0 && (yield* x.die(/* @__PURE__ */ Error(`could not acquire the migration lock '${t}' (sp_getapplock returned ${n[0]?.res ?? "no row"}; another migration is in progress).`)));
|
|
126
|
-
}),
|
|
126
|
+
}), Ae = (e, t) => x.gen(function* () {
|
|
127
127
|
yield* e`EXEC sp_releaseapplock @Resource = ${t}, @LockOwner = 'Session'`;
|
|
128
|
-
}),
|
|
128
|
+
}), je = x.void, E = (e, t) => {
|
|
129
129
|
let n = he(t);
|
|
130
130
|
return e.onDialectOrElse({
|
|
131
|
-
mysql: () =>
|
|
132
|
-
mssql: () =>
|
|
133
|
-
sqlite: () =>
|
|
134
|
-
orElse: () =>
|
|
131
|
+
mysql: () => Ee(e, T(n)),
|
|
132
|
+
mssql: () => ke(e, T(n)),
|
|
133
|
+
sqlite: () => je,
|
|
134
|
+
orElse: () => Ce(e, be(n))
|
|
135
135
|
});
|
|
136
|
-
},
|
|
136
|
+
}, Me = (e, t) => {
|
|
137
137
|
let n = he(t);
|
|
138
138
|
return e.onDialectOrElse({
|
|
139
|
-
mysql: () =>
|
|
140
|
-
mssql: () =>
|
|
141
|
-
sqlite: () =>
|
|
142
|
-
orElse: () =>
|
|
139
|
+
mysql: () => De(e, T(n)),
|
|
140
|
+
mssql: () => Ae(e, T(n)),
|
|
141
|
+
sqlite: () => je,
|
|
142
|
+
orElse: () => we(e, be(n))
|
|
143
143
|
});
|
|
144
|
-
}, Ne = (e, t, n) => x.acquireUseRelease(
|
|
144
|
+
}, Ne = (e, t, n) => x.acquireUseRelease(E(e, n), () => t, () => Me(e, n).pipe(x.orDie)), Pe = (e) => e.onDialectOrElse({
|
|
145
145
|
pg: () => "postgres",
|
|
146
146
|
mysql: () => "mysql",
|
|
147
147
|
mssql: () => "mssql",
|
|
@@ -217,7 +217,7 @@ var ae = (e, t, n, r = 400) => {
|
|
|
217
217
|
Object.keys(Fe);
|
|
218
218
|
//#endregion
|
|
219
219
|
//#region src/migrations/reactiveTriggerName.ts
|
|
220
|
-
var O = "framework_changes", Je = "framework_changes_", Ye = (e, t) => t === "framework_changes" ? `${Je}${e}` : `${Je}${t}_${e}`, Xe = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, Ze = "voltro:notify:v2", Qe =
|
|
220
|
+
var O = "framework_changes", Je = "framework_changes_", Ye = (e, t) => t === "framework_changes" ? `${Je}${e}` : `${Je}${t}_${e}`, Xe = (e) => e === "framework_changes" ? "framework_notify_change" : `framework_notify_change_${e}`, Ze = "voltro:notify:v2", Qe = te({ scope: "voltro:migrate" }), k = (e) => {
|
|
221
221
|
Qe.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
|
|
222
222
|
}, A = (e, t) => {
|
|
223
223
|
let n = e.type;
|
|
@@ -842,8 +842,8 @@ BEGIN
|
|
|
842
842
|
indexes: Ut(e.indexes)
|
|
843
843
|
})).sort((e, t) => e.name.localeCompare(t.name)), P = (e) => {
|
|
844
844
|
let t = { tables: Wt(e.tables) }, n = JSON.stringify(Bt(t));
|
|
845
|
-
return
|
|
846
|
-
},
|
|
845
|
+
return ee("sha256").update(n).digest("hex");
|
|
846
|
+
}, F = (e) => e.slice(0, 16), Gt = (e, t) => {
|
|
847
847
|
let n = t.references ? {
|
|
848
848
|
table: t.references().tableName,
|
|
849
849
|
column: "id",
|
|
@@ -882,7 +882,7 @@ BEGIN
|
|
|
882
882
|
...t.enumValues === void 0 ? {} : { enumValues: t.enumValues },
|
|
883
883
|
...t.spatial === void 0 ? {} : { spatial: t.spatial }
|
|
884
884
|
};
|
|
885
|
-
},
|
|
885
|
+
}, Kt = (e) => {
|
|
886
886
|
let t = [], n = /* @__PURE__ */ new Set(), r = (e) => {
|
|
887
887
|
n.has(e.name) || (n.add(e.name), t.push(e));
|
|
888
888
|
}, i = e.appliedPrimaryKey ?? [];
|
|
@@ -930,11 +930,11 @@ BEGIN
|
|
|
930
930
|
});
|
|
931
931
|
}
|
|
932
932
|
return t;
|
|
933
|
-
},
|
|
933
|
+
}, qt = (e) => {
|
|
934
934
|
let t = new Set((e.appliedUniques ?? []).filter((e) => e.fields.length === 1).map((e) => e.fields[0])), n = [];
|
|
935
935
|
for (let [r, i] of Object.entries(e.fields)) {
|
|
936
936
|
if (i.dropped) continue;
|
|
937
|
-
let e =
|
|
937
|
+
let e = Gt(r, i);
|
|
938
938
|
n.push(t.has(r) ? {
|
|
939
939
|
...e,
|
|
940
940
|
unique: !0
|
|
@@ -944,21 +944,21 @@ BEGIN
|
|
|
944
944
|
return {
|
|
945
945
|
name: e.tableName,
|
|
946
946
|
columns: n,
|
|
947
|
-
indexes:
|
|
947
|
+
indexes: Kt(e),
|
|
948
948
|
...r.length > 0 ? { primaryKey: [...r] } : {},
|
|
949
949
|
...i === void 0 ? {} : { renamedFrom: i }
|
|
950
950
|
};
|
|
951
|
-
},
|
|
951
|
+
}, Jt = (e) => {
|
|
952
952
|
let t = /* @__PURE__ */ new Map();
|
|
953
953
|
for (let n of e) for (let e of n.indexes) {
|
|
954
954
|
let r = t.get(e.name);
|
|
955
955
|
if (r !== void 0 && r !== n.name) throw Error(`duplicate index name '${e.name}' across tables '${r}' and '${n.name}'. Index names must be unique per SCHEMA, not just per table — the DB creates only one, so the other never applies and 'db plan' re-emits it forever. Give each an explicit, table-prefixed name (e.g. '${n.name}_${e.name}').`);
|
|
956
956
|
t.set(e.name, n.name);
|
|
957
957
|
}
|
|
958
|
-
},
|
|
959
|
-
let n = e.map((e) =>
|
|
960
|
-
return
|
|
961
|
-
},
|
|
958
|
+
}, I = (e, t) => {
|
|
959
|
+
let n = e.map((e) => qt(de(e, t)));
|
|
960
|
+
return Jt(n), { tables: n };
|
|
961
|
+
}, Yt = (e, t, n = O) => x.gen(function* () {
|
|
962
962
|
let r = (yield* e`
|
|
963
963
|
SELECT p.prosrc
|
|
964
964
|
FROM pg_proc p
|
|
@@ -989,7 +989,7 @@ BEGIN
|
|
|
989
989
|
stale: l.sort(),
|
|
990
990
|
functionOutdated: i
|
|
991
991
|
};
|
|
992
|
-
}),
|
|
992
|
+
}), Xt = (e) => {
|
|
993
993
|
let t = [];
|
|
994
994
|
if (e.missing.length > 0) {
|
|
995
995
|
let n = e.missing.slice(0, 8).join(", "), r = e.missing.length > 8 ? `, … (+${e.missing.length - 8})` : "";
|
|
@@ -1000,19 +1000,19 @@ BEGIN
|
|
|
1000
1000
|
t.push(`${e.stale.length} .nonReactive() table(s) still carry a change trigger — ${n}. They keep paying REPLICA IDENTITY FULL and a NOTIFY on every write for a subscription nobody receives. \`voltro db apply\` removes them.`);
|
|
1001
1001
|
}
|
|
1002
1002
|
return e.functionOutdated && t.push("The change-notify function in this database is OLDER than the framework installed here. Its triggers fire, so nothing looks wrong — but a row too large for a NOTIFY payload (postgres caps it at 8000 bytes) is emitted without its primary key, and a change that carries no key cannot be re-read: it reaches subscriptions as a re-query and reaches every TAP — search index, analytics mirror, cdc-out, row history — as nothing at all. Run `voltro db apply` to replace it."), t.length > 0 ? t.join("\n") : void 0;
|
|
1003
|
-
},
|
|
1003
|
+
}, Zt = {
|
|
1004
1004
|
postgres: !0,
|
|
1005
1005
|
mysql: !0,
|
|
1006
1006
|
mariadb: !0,
|
|
1007
1007
|
mssql: !0,
|
|
1008
1008
|
sqlite: !0
|
|
1009
|
-
},
|
|
1009
|
+
}, Qt = {
|
|
1010
1010
|
postgres: !0,
|
|
1011
1011
|
mysql: !1,
|
|
1012
1012
|
mariadb: !1,
|
|
1013
1013
|
mssql: !0,
|
|
1014
1014
|
sqlite: !0
|
|
1015
|
-
},
|
|
1015
|
+
}, $t = (e) => {
|
|
1016
1016
|
switch (e) {
|
|
1017
1017
|
case "add-column":
|
|
1018
1018
|
case "drop-column":
|
|
@@ -1022,47 +1022,47 @@ BEGIN
|
|
|
1022
1022
|
case "add-foreign-key":
|
|
1023
1023
|
case "add-unique":
|
|
1024
1024
|
case "add-unique-composite":
|
|
1025
|
-
case "add-check": return
|
|
1026
|
-
default: return
|
|
1025
|
+
case "add-check": return Qt;
|
|
1026
|
+
default: return Zt;
|
|
1027
1027
|
}
|
|
1028
|
-
},
|
|
1028
|
+
}, en = (e, t) => {
|
|
1029
1029
|
let n = new Map(t.tables.map((e) => [e.name, e]));
|
|
1030
1030
|
return new Map(e.map((e) => [e.tableName, {
|
|
1031
1031
|
table: e,
|
|
1032
1032
|
snapshot: n.get(e.tableName),
|
|
1033
1033
|
columnDefs: e.fields
|
|
1034
1034
|
}]));
|
|
1035
|
-
},
|
|
1035
|
+
}, L = (e) => {
|
|
1036
1036
|
if (typeof e != "object" || !e) return JSON.stringify(e);
|
|
1037
|
-
if (Array.isArray(e)) return `[${e.map(
|
|
1037
|
+
if (Array.isArray(e)) return `[${e.map(L).join(",")}]`;
|
|
1038
1038
|
let t = e;
|
|
1039
|
-
return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${
|
|
1040
|
-
},
|
|
1039
|
+
return `{${Object.keys(t).sort().map((e) => `${JSON.stringify(e)}:${L(t[e])}`).join(",")}}`;
|
|
1040
|
+
}, tn = (e) => {
|
|
1041
1041
|
if (!e.hasDefault || e.defaultValue === void 0 || e.defaultValue === null) return null;
|
|
1042
1042
|
let t = e.defaultValue;
|
|
1043
1043
|
if (typeof t == "boolean") return t ? "__BOOL_TRUE__" : "__BOOL_FALSE__";
|
|
1044
1044
|
if (typeof t == "number") return String(t);
|
|
1045
|
-
if (typeof t != "string") return
|
|
1045
|
+
if (typeof t != "string") return L(t);
|
|
1046
1046
|
let n = t.trim(), r = n.toLowerCase().replace(/\s+/g, "");
|
|
1047
1047
|
if (r === "now" || r === "now()" || /^current_timestamp(\(\d*\))?$/.test(r) || r === "sysutcdatetime()" || r === "sysdatetime()" || r === "getutcdate()" || r === "getdate()") return "__NOW__";
|
|
1048
1048
|
let i = n.replace(/::[a-zA-Z0-9_ "]+$/, "").trim(), a = /^'(.*)'$/.test(i) ? i.slice(1, -1).replace(/''/g, "'") : i, o = /^cast\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+as\s+json\s*\)$/i.exec(a);
|
|
1049
1049
|
if (o) try {
|
|
1050
|
-
return
|
|
1050
|
+
return L(JSON.parse(o[1]));
|
|
1051
1051
|
} catch {}
|
|
1052
1052
|
let s = /^convert\(\s*(?:_\w+\s*)?\\?'(.*?)\\?'\s+using\s+[\w]+\s*\)$/i.exec(a);
|
|
1053
1053
|
if (s) try {
|
|
1054
|
-
return
|
|
1054
|
+
return L(JSON.parse(s[1]));
|
|
1055
1055
|
} catch {}
|
|
1056
1056
|
if (a.startsWith("{") || a.startsWith("[")) try {
|
|
1057
|
-
return
|
|
1057
|
+
return L(JSON.parse(a));
|
|
1058
1058
|
} catch {}
|
|
1059
1059
|
return /^-?\d+(\.\d+)?$/.test(a) ? String(Number(a)) : a;
|
|
1060
|
-
},
|
|
1061
|
-
let n =
|
|
1060
|
+
}, nn = (e, t) => {
|
|
1061
|
+
let n = tn(e), r = tn(t);
|
|
1062
1062
|
if (n === r) return !0;
|
|
1063
1063
|
let i = (e) => e === "1" || e === "true" ? "__BOOL_TRUE__" : e === "0" || e === "false" ? "__BOOL_FALSE__" : e;
|
|
1064
1064
|
return i(n) === i(r);
|
|
1065
|
-
},
|
|
1065
|
+
}, rn = (e) => {
|
|
1066
1066
|
if (!e) return null;
|
|
1067
1067
|
let t = (e) => e === "restrict" ? "noAction" : e;
|
|
1068
1068
|
return {
|
|
@@ -1071,25 +1071,25 @@ BEGIN
|
|
|
1071
1071
|
onDelete: t(e.onDelete),
|
|
1072
1072
|
onUpdate: t(e.onUpdate)
|
|
1073
1073
|
};
|
|
1074
|
-
},
|
|
1074
|
+
}, an = (e, t) => {
|
|
1075
1075
|
let n = e && e.length > 0 ? e : void 0, r = t && t.length > 0 ? t : void 0;
|
|
1076
1076
|
if (!n && !r) return !0;
|
|
1077
1077
|
if (!n || !r || n.length !== r.length) return !1;
|
|
1078
1078
|
let i = [...n].sort(), a = [...r].sort();
|
|
1079
1079
|
return i.every((e, t) => e === a[t]);
|
|
1080
|
-
},
|
|
1080
|
+
}, on = (e, t) => {
|
|
1081
1081
|
try {
|
|
1082
1082
|
let n = /\((\d+)\)/.exec(A(e, t));
|
|
1083
1083
|
return n ? Number(n[1]) : void 0;
|
|
1084
1084
|
} catch {
|
|
1085
1085
|
return;
|
|
1086
1086
|
}
|
|
1087
|
-
},
|
|
1087
|
+
}, sn = (e, t, n) => n === void 0 || o(n) ? !0 : e.type !== "text" || t.type !== "text" || on(e, n) === t.maxLength, cn = (e, t, n) => e.type === t.type && e.nullable === t.nullable && e.unique === t.unique && nn(e, t) && sn(e, t, n) && JSON.stringify(rn(e.references)) === JSON.stringify(rn(t.references)) && an(e.oneOf, t.oneOf), ln = (e, t) => t.oneOf && t.oneOf.length > 0 ? R({
|
|
1088
1088
|
kind: "add-check",
|
|
1089
1089
|
table: e,
|
|
1090
1090
|
column: t.name,
|
|
1091
1091
|
values: t.oneOf
|
|
1092
|
-
}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0,
|
|
1092
|
+
}, "safe", `enum-membership CHECK on ${e}.${t.name}`) : void 0, un = (e, t) => e.unique === t.unique && (e.expression || t.expression ? !0 : e.columns.length === t.columns.length && e.columns.every((e, n) => e === t.columns[n])), dn = (e, t, n) => {
|
|
1093
1093
|
let r = new Map(t.columns.map((e) => [e.name, e])), i = new Map(e.columns.map((e) => [e.name, e])), a = [], o = [], s = [];
|
|
1094
1094
|
for (let t of e.columns) {
|
|
1095
1095
|
let e = r.get(t.name);
|
|
@@ -1097,7 +1097,7 @@ BEGIN
|
|
|
1097
1097
|
a.push(t);
|
|
1098
1098
|
continue;
|
|
1099
1099
|
}
|
|
1100
|
-
|
|
1100
|
+
cn(t, e, n) || s.push({
|
|
1101
1101
|
declared: t,
|
|
1102
1102
|
live: e
|
|
1103
1103
|
});
|
|
@@ -1108,47 +1108,47 @@ BEGIN
|
|
|
1108
1108
|
removed: o,
|
|
1109
1109
|
changed: s
|
|
1110
1110
|
};
|
|
1111
|
-
},
|
|
1111
|
+
}, fn = (e, t) => {
|
|
1112
1112
|
let n = new Map(t.indexes.map((e) => [e.name, e])), r = new Map(e.indexes.map((e) => [e.name, e])), i = [], a = [];
|
|
1113
1113
|
for (let t of e.indexes) {
|
|
1114
1114
|
let e = n.get(t.name);
|
|
1115
|
-
(!e || !
|
|
1115
|
+
(!e || !un(t, e)) && i.push(t);
|
|
1116
1116
|
}
|
|
1117
1117
|
for (let e of t.indexes) r.has(e.name) || a.push(e);
|
|
1118
1118
|
return {
|
|
1119
1119
|
added: i,
|
|
1120
1120
|
removed: a
|
|
1121
1121
|
};
|
|
1122
|
-
},
|
|
1122
|
+
}, R = (e, t, n, r) => ({
|
|
1123
1123
|
op: e,
|
|
1124
1124
|
classification: t,
|
|
1125
|
-
atomicByDialect:
|
|
1125
|
+
atomicByDialect: $t(e.kind),
|
|
1126
1126
|
...n ? { reason: n } : {},
|
|
1127
1127
|
...r ? { blocked: r } : {}
|
|
1128
|
-
}),
|
|
1128
|
+
}), pn = (e, t, n) => {
|
|
1129
1129
|
let r = {
|
|
1130
1130
|
kind: "add-column",
|
|
1131
1131
|
table: e,
|
|
1132
1132
|
column: t
|
|
1133
1133
|
};
|
|
1134
|
-
return t.nullable ?
|
|
1135
|
-
},
|
|
1134
|
+
return t.nullable ? R(r, "safe", "nullable column add — no backfill needed") : t.hasDefault && t.defaultValue !== void 0 ? R(r, "needs-default", "NOT NULL with literal default — DDL DEFAULT will populate existing rows") : n?.backfill ? R(r, "needs-backfill", `backfill declared (kind=${n.backfill.kind}) — applier will run 3-step add/update/set-not-null`) : R(r, "needs-backfill", "NOT NULL column on a table whose row count is unknown", { fix: `declare \`${t.name}: <type>().backfill(sql\`...\`)\` OR \`.default(value)\` so existing rows survive the migration` });
|
|
1135
|
+
}, mn = (e, t, n) => {
|
|
1136
1136
|
let r = {
|
|
1137
1137
|
kind: "drop-column",
|
|
1138
1138
|
table: e,
|
|
1139
1139
|
column: t.name
|
|
1140
1140
|
};
|
|
1141
|
-
return n?.dropped ?
|
|
1142
|
-
},
|
|
1141
|
+
return n?.dropped ? R(r, "lossy", `column dropped via \`${t.name}: dropped()\` marker — intentional`) : R(r, "lossy", "column missing from declared schema", { fix: `if intentional, add \`${t.name}: dropped()\` to the schema. If a typo, restore the field` });
|
|
1142
|
+
}, hn = (e, t, n, r, i) => R({
|
|
1143
1143
|
kind: "create-table",
|
|
1144
1144
|
table: e,
|
|
1145
1145
|
columns: t,
|
|
1146
1146
|
indexes: n,
|
|
1147
1147
|
...r && r.length > 0 ? { primaryKey: r } : {}
|
|
1148
|
-
}, "safe", i ?? "new table — no data to preserve"),
|
|
1148
|
+
}, "safe", i ?? "new table — no data to preserve"), gn = (e) => R({
|
|
1149
1149
|
kind: "drop-table",
|
|
1150
1150
|
table: e
|
|
1151
|
-
}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }),
|
|
1151
|
+
}, "lossy", "table missing from declared schema", { fix: "if intentional, set VOLTRO_DESTRUCTIVE_OK=1 OR add a file-based migration. If a typo, restore the table declaration" }), _n = 5e4, vn = (e, t, n, r) => {
|
|
1152
1152
|
let i = (n ?? 0) >= r, a;
|
|
1153
1153
|
return a = t.unique ? t.columns.length === 1 ? {
|
|
1154
1154
|
kind: "add-unique",
|
|
@@ -1163,16 +1163,16 @@ BEGIN
|
|
|
1163
1163
|
kind: "add-index",
|
|
1164
1164
|
table: e,
|
|
1165
1165
|
index: t
|
|
1166
|
-
}, i ?
|
|
1167
|
-
},
|
|
1166
|
+
}, i ? R(a, "online-required", `online build on ${n} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : R(a, "safe", t.unique ? t.columns.length === 1 ? "add unique constraint" : "add composite UNIQUE constraint" : "add B-tree index");
|
|
1167
|
+
}, yn = (e, t) => t.unique && t.columns.length > 1 ? R({
|
|
1168
1168
|
kind: "drop-unique-composite",
|
|
1169
1169
|
table: e,
|
|
1170
1170
|
name: t.name
|
|
1171
|
-
}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") :
|
|
1171
|
+
}, "safe", "drop composite UNIQUE constraint (no data loss — constraint is derived metadata)") : R({
|
|
1172
1172
|
kind: "drop-index",
|
|
1173
1173
|
table: e,
|
|
1174
1174
|
index: t.name
|
|
1175
|
-
}, "safe", "drop index (no data loss — index is derived data)"),
|
|
1175
|
+
}, "safe", "drop index (no data loss — index is derived data)"), bn = (e, t) => {
|
|
1176
1176
|
if (e === "reference") return "text";
|
|
1177
1177
|
switch (t) {
|
|
1178
1178
|
case "sqlite":
|
|
@@ -1180,10 +1180,10 @@ BEGIN
|
|
|
1180
1180
|
case "mssql": return e === "json" ? "text" : e;
|
|
1181
1181
|
default: return e;
|
|
1182
1182
|
}
|
|
1183
|
-
},
|
|
1183
|
+
}, xn = (e, t, n) => {
|
|
1184
1184
|
let r = `acknowledge it on the column: \`.narrowedFrom('${e}')\``;
|
|
1185
1185
|
return n === "postgres" ? `${r} — add \`{ using: '${t.name}::${t.type}' }\` when the cast is not implicit, or use a file-based migration` : `${r} — ${n === void 0 ? "this dialect" : n} converts in place (\`using\` is postgres-only and is ignored here), so verify the conversion is value-preserving for your data, or use a file-based migration`;
|
|
1186
|
-
},
|
|
1186
|
+
}, Sn = (e, t, n, r, i, a) => {
|
|
1187
1187
|
let s = [];
|
|
1188
1188
|
if (t.nullable !== n.nullable) {
|
|
1189
1189
|
let n = {
|
|
@@ -1192,7 +1192,7 @@ BEGIN
|
|
|
1192
1192
|
column: t.name,
|
|
1193
1193
|
toNullable: t.nullable
|
|
1194
1194
|
};
|
|
1195
|
-
s.push(t.nullable ?
|
|
1195
|
+
s.push(t.nullable ? R(n, "safe", `loosen ${e}.${t.name} to nullable`) : R(n, "needs-backfill", `tighten ${e}.${t.name} to NOT NULL — existing rows must already be non-null`));
|
|
1196
1196
|
}
|
|
1197
1197
|
if (t.unique !== n.unique) {
|
|
1198
1198
|
if (t.unique) {
|
|
@@ -1201,14 +1201,14 @@ BEGIN
|
|
|
1201
1201
|
table: e,
|
|
1202
1202
|
column: t.name
|
|
1203
1203
|
}, r = (i ?? 0) >= a;
|
|
1204
|
-
s.push(r ?
|
|
1205
|
-
} else s.push(
|
|
1204
|
+
s.push(r ? R(n, "online-required", `online unique build on ${i} rows — CONCURRENTLY / INPLACE / WITH(ONLINE=ON) depending on dialect`) : R(n, "safe", `add unique constraint on ${e}.${t.name} — existing rows must already be distinct (else the DB rejects at migrate)`));
|
|
1205
|
+
} else s.push(R({
|
|
1206
1206
|
kind: "drop-unique",
|
|
1207
1207
|
table: e,
|
|
1208
1208
|
column: t.name
|
|
1209
1209
|
}, "safe", `drop unique constraint on ${e}.${t.name} — constraint is derived metadata, no data loss`));
|
|
1210
1210
|
}
|
|
1211
|
-
if (
|
|
1211
|
+
if (bn(t.type, r) !== bn(n.type, r)) {
|
|
1212
1212
|
let i = t.narrowedFrom;
|
|
1213
1213
|
if (i && i.from === n.type) {
|
|
1214
1214
|
let r = {
|
|
@@ -1219,7 +1219,7 @@ BEGIN
|
|
|
1219
1219
|
to: t.type,
|
|
1220
1220
|
...i.using === void 0 ? {} : { using: i.using }
|
|
1221
1221
|
};
|
|
1222
|
-
s.push(
|
|
1222
|
+
s.push(R(r, "needs-backfill", `type change ${n.type} → ${t.type} on ${e}.${t.name} — narrowedFrom('${i.from}') declared` + (i.using ? ` with USING ${i.using}` : " (implicit cast)")));
|
|
1223
1223
|
} else {
|
|
1224
1224
|
let i = {
|
|
1225
1225
|
kind: "alter-column-type",
|
|
@@ -1228,12 +1228,12 @@ BEGIN
|
|
|
1228
1228
|
from: n.type,
|
|
1229
1229
|
to: t.type
|
|
1230
1230
|
};
|
|
1231
|
-
s.push(
|
|
1231
|
+
s.push(R(i, "lossy", `type change ${n.type} → ${t.type} on ${e}.${t.name} may not be value-preserving`, { fix: xn(n.type, t, r) }));
|
|
1232
1232
|
}
|
|
1233
1233
|
}
|
|
1234
1234
|
if (t.type === "text" && n.type === "text" && !o(r ?? "postgres") && t.maxLength !== n.maxLength) {
|
|
1235
1235
|
let r = t.maxLength === void 0 || n.maxLength !== void 0 && t.maxLength > n.maxLength, i = n.maxLength === void 0 ? "unbounded" : `varchar(${n.maxLength})`, a = t.maxLength === void 0 ? "unbounded" : `varchar(${t.maxLength})`;
|
|
1236
|
-
s.push(
|
|
1236
|
+
s.push(R({
|
|
1237
1237
|
kind: "alter-column-type",
|
|
1238
1238
|
table: e,
|
|
1239
1239
|
column: t.name,
|
|
@@ -1241,7 +1241,7 @@ BEGIN
|
|
|
1241
1241
|
to: "text"
|
|
1242
1242
|
}, r ? "safe" : "needs-backfill", r ? `text length ${i} → ${a} on ${e}.${t.name} — widening, no data can be lost` : `text length ${i} → ${a} on ${e}.${t.name} — NARROWING; the ALTER fails if any existing value is longer than ${String(t.maxLength)}. Check first: SELECT COUNT(*) FROM ${e} WHERE LENGTH(${t.name}) > ${String(t.maxLength)}`));
|
|
1243
1243
|
}
|
|
1244
|
-
if (!
|
|
1244
|
+
if (!nn(t, n)) {
|
|
1245
1245
|
let n = {
|
|
1246
1246
|
kind: "alter-column-default",
|
|
1247
1247
|
table: e,
|
|
@@ -1249,23 +1249,23 @@ BEGIN
|
|
|
1249
1249
|
hasDefault: t.hasDefault,
|
|
1250
1250
|
...t.defaultValue === void 0 ? {} : { defaultValue: t.defaultValue }
|
|
1251
1251
|
};
|
|
1252
|
-
s.push(
|
|
1252
|
+
s.push(R(n, "safe", `default change on ${e}.${t.name} affects only future inserts`));
|
|
1253
1253
|
}
|
|
1254
|
-
if (!
|
|
1255
|
-
n.oneOf && n.oneOf.length > 0 && s.push(
|
|
1254
|
+
if (!an(t.oneOf, n.oneOf)) {
|
|
1255
|
+
n.oneOf && n.oneOf.length > 0 && s.push(R({
|
|
1256
1256
|
kind: "drop-check",
|
|
1257
1257
|
table: e,
|
|
1258
1258
|
column: t.name
|
|
1259
1259
|
}, "safe", `drop stale enum CHECK on ${e}.${t.name}`));
|
|
1260
|
-
let r =
|
|
1260
|
+
let r = ln(e, t);
|
|
1261
1261
|
r && s.push(r);
|
|
1262
1262
|
}
|
|
1263
|
-
return JSON.stringify(
|
|
1263
|
+
return JSON.stringify(rn(t.references)) !== JSON.stringify(rn(n.references)) && (n.references && s.push(R({
|
|
1264
1264
|
kind: "drop-foreign-key",
|
|
1265
1265
|
table: e,
|
|
1266
1266
|
column: t.name
|
|
1267
|
-
}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), s.push(...
|
|
1268
|
-
},
|
|
1267
|
+
}, "safe", `drop FK on ${e}.${t.name} (→ ${n.references.table})`)), s.push(...Cn(e, t))), s;
|
|
1268
|
+
}, Cn = (e, t) => {
|
|
1269
1269
|
let n = [];
|
|
1270
1270
|
if (!t.references) return n;
|
|
1271
1271
|
let r = t.references.table, i = t.references.orphanPolicy ?? "fail", a = {
|
|
@@ -1277,15 +1277,15 @@ BEGIN
|
|
|
1277
1277
|
...t.references.onDelete ? { onDelete: t.references.onDelete } : {},
|
|
1278
1278
|
...t.references.onUpdate ? { onUpdate: t.references.onUpdate } : {}
|
|
1279
1279
|
};
|
|
1280
|
-
return i === "null" && !t.nullable ? n.push(
|
|
1280
|
+
return i === "null" && !t.nullable ? n.push(R(a, "lossy", `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' needs a nullable column (the NULL-out would violate NOT NULL)`, { fix: `make ${t.name} \`.nullable()\`, OR use \`orphanPolicy: 'delete'\`, OR clean the orphans and drop the policy` })) : i === "null" || i === "delete" ? n.push(R({
|
|
1281
1281
|
...a,
|
|
1282
1282
|
orphanPolicy: i
|
|
1283
|
-
}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(
|
|
1284
|
-
},
|
|
1283
|
+
}, "lossy", i === "delete" ? `add FK ${e}.${t.name} → ${r}: orphanPolicy 'delete' first DELETES rows whose ${t.name} points at a missing ${r}` : `add FK ${e}.${t.name} → ${r}: orphanPolicy 'null' first NULLs ${t.name} where it points at a missing ${r}`)) : n.push(R(a, "needs-backfill", `add FK ${e}.${t.name} → ${r} — existing rows must already reference a valid ${r} (else set orphanPolicy:'null'/'delete')`)), n;
|
|
1284
|
+
}, wn = (e, t, n) => {
|
|
1285
1285
|
let r = [], i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = new Set(n.removed.map((e) => e.name)), s = new Set(n.added.map((e) => e.name));
|
|
1286
1286
|
for (let [n, c] of Object.entries(t)) {
|
|
1287
1287
|
let t = c.renamedFrom;
|
|
1288
|
-
t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(
|
|
1288
|
+
t && o.has(t) && s.has(n) && (i.add(n), a.add(t), r.push(R({
|
|
1289
1289
|
kind: "rename-column",
|
|
1290
1290
|
table: e.tableName,
|
|
1291
1291
|
from: t,
|
|
@@ -1297,26 +1297,26 @@ BEGIN
|
|
|
1297
1297
|
consumedAddedNames: i,
|
|
1298
1298
|
consumedRemovedNames: a
|
|
1299
1299
|
};
|
|
1300
|
-
},
|
|
1300
|
+
}, Tn = /* @__PURE__ */ new Set([
|
|
1301
1301
|
"postgres",
|
|
1302
1302
|
"mysql",
|
|
1303
1303
|
"mariadb",
|
|
1304
1304
|
"mssql"
|
|
1305
|
-
]),
|
|
1305
|
+
]), En = {
|
|
1306
1306
|
ops: [],
|
|
1307
1307
|
consumedAddedNames: /* @__PURE__ */ new Set(),
|
|
1308
1308
|
consumedRemovedNames: /* @__PURE__ */ new Set()
|
|
1309
|
-
},
|
|
1310
|
-
if (i === void 0 || !
|
|
1311
|
-
let a = t.added.filter((e) =>
|
|
1312
|
-
if (a.length === 0) return
|
|
1309
|
+
}, Dn = (e) => !e.unique && !e.expression, On = (e, t, n, r, i) => {
|
|
1310
|
+
if (i === void 0 || !Tn.has(i)) return En;
|
|
1311
|
+
let a = t.added.filter((e) => Dn(e) && !r.has(e.name));
|
|
1312
|
+
if (a.length === 0) return En;
|
|
1313
1313
|
let o = (e) => e.columns.map((e) => n.get(e) ?? e).join("\0"), s = (e) => e.columns.join("\0"), c = [], l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set();
|
|
1314
1314
|
for (let n of t.removed) {
|
|
1315
|
-
if (!
|
|
1315
|
+
if (!Dn(n)) continue;
|
|
1316
1316
|
let t = o(n), r = a.filter((e) => !l.has(e.name) && s(e) === t);
|
|
1317
1317
|
if (r.length !== 1) continue;
|
|
1318
1318
|
let i = r[0];
|
|
1319
|
-
i.name !== n.name && (l.add(i.name), u.add(n.name), c.push(
|
|
1319
|
+
i.name !== n.name && (l.add(i.name), u.add(n.name), c.push(R({
|
|
1320
1320
|
kind: "rename-index",
|
|
1321
1321
|
table: e,
|
|
1322
1322
|
from: n.name,
|
|
@@ -1328,7 +1328,7 @@ BEGIN
|
|
|
1328
1328
|
consumedAddedNames: l,
|
|
1329
1329
|
consumedRemovedNames: u
|
|
1330
1330
|
};
|
|
1331
|
-
},
|
|
1331
|
+
}, kn = (e, t, n) => {
|
|
1332
1332
|
let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
|
|
1333
1333
|
for (let t of e.tables) t.renamedFrom !== void 0 && (s.set(t.renamedFrom, (s.get(t.renamedFrom) ?? 0) + 1), c.add(t.renamedFrom));
|
|
1334
1334
|
for (let c of e.tables) {
|
|
@@ -1339,7 +1339,7 @@ BEGIN
|
|
|
1339
1339
|
continue;
|
|
1340
1340
|
}
|
|
1341
1341
|
if (t.has(c.name)) {
|
|
1342
|
-
r.push(
|
|
1342
|
+
r.push(R({
|
|
1343
1343
|
kind: "rename-table",
|
|
1344
1344
|
from: e,
|
|
1345
1345
|
to: c.name
|
|
@@ -1347,14 +1347,14 @@ BEGIN
|
|
|
1347
1347
|
continue;
|
|
1348
1348
|
}
|
|
1349
1349
|
if ((s.get(e) ?? 0) !== 1) {
|
|
1350
|
-
r.push(
|
|
1350
|
+
r.push(R({
|
|
1351
1351
|
kind: "rename-table",
|
|
1352
1352
|
from: e,
|
|
1353
1353
|
to: c.name
|
|
1354
1354
|
}, "needs-rename-annotation", `.renamedFrom('${e}') is claimed by ${s.get(e)} tables — nothing says which receives its rows`, { fix: `remove the \`.renamedFrom('${e}')\` marker from all but one of them.` }));
|
|
1355
1355
|
continue;
|
|
1356
1356
|
}
|
|
1357
|
-
i.set(c.name, e), a.add(e), r.push(
|
|
1357
|
+
i.set(c.name, e), a.add(e), r.push(R({
|
|
1358
1358
|
kind: "rename-table",
|
|
1359
1359
|
from: e,
|
|
1360
1360
|
to: c.name
|
|
@@ -1368,19 +1368,19 @@ BEGIN
|
|
|
1368
1368
|
claimedOldNames: c,
|
|
1369
1369
|
refusals: o
|
|
1370
1370
|
};
|
|
1371
|
-
},
|
|
1371
|
+
}, An = (e, t, n, r) => {
|
|
1372
1372
|
if (t === void 0) return {
|
|
1373
1373
|
live: e,
|
|
1374
1374
|
ops: []
|
|
1375
1375
|
};
|
|
1376
|
-
let i = r !== void 0 &&
|
|
1376
|
+
let i = r !== void 0 && Tn.has(r), a = [], o = e.indexes.map((e) => {
|
|
1377
1377
|
if (!e.name.startsWith(t)) return e;
|
|
1378
1378
|
let r = `${n}${e.name.slice(t.length)}`;
|
|
1379
1379
|
return r === e.name ? e : e.name === `${t}_pkey` ? {
|
|
1380
1380
|
...e,
|
|
1381
1381
|
name: r,
|
|
1382
1382
|
table: n
|
|
1383
|
-
} : i ? (a.push(
|
|
1383
|
+
} : i ? (a.push(R({
|
|
1384
1384
|
kind: "rename-index",
|
|
1385
1385
|
table: n,
|
|
1386
1386
|
from: e.name,
|
|
@@ -1399,7 +1399,7 @@ BEGIN
|
|
|
1399
1399
|
},
|
|
1400
1400
|
ops: a
|
|
1401
1401
|
};
|
|
1402
|
-
},
|
|
1402
|
+
}, jn = (e) => {
|
|
1403
1403
|
let t = {
|
|
1404
1404
|
safe: 0,
|
|
1405
1405
|
needsDefault: 0,
|
|
@@ -1432,42 +1432,42 @@ BEGIN
|
|
|
1432
1432
|
case "multi-step": t.multiStep++;
|
|
1433
1433
|
}
|
|
1434
1434
|
return t;
|
|
1435
|
-
},
|
|
1436
|
-
let t =
|
|
1435
|
+
}, Mn = (e) => {
|
|
1436
|
+
let t = I(e.declared, e.dialect), n = en(e.declared, t), r = new Map(e.live.tables.map((e) => [e.name, e])), i = e.onlineAfter ?? _n, a = [], o = kn(t, r, n);
|
|
1437
1437
|
a.push(...o.ops);
|
|
1438
1438
|
for (let e of t.tables) if (!o.renamedInto.has(e.name) && !r.has(e.name)) {
|
|
1439
|
-
a.push(
|
|
1439
|
+
a.push(hn(e.name, e.columns, e.indexes, e.primaryKey, o.refusals.get(e.name)));
|
|
1440
1440
|
for (let t of e.columns) {
|
|
1441
|
-
let n =
|
|
1441
|
+
let n = ln(e.name, t);
|
|
1442
1442
|
n && a.push(n);
|
|
1443
1443
|
}
|
|
1444
1444
|
}
|
|
1445
1445
|
let s = new Set(e.ignoreTables ?? []);
|
|
1446
|
-
for (let t of e.live.tables) n.has(t.name) || o.claimedOldNames.has(t.name) || m(t.name) || v(t.name) || s.has(t.name) || a.push(
|
|
1446
|
+
for (let t of e.live.tables) n.has(t.name) || o.claimedOldNames.has(t.name) || m(t.name) || v(t.name) || s.has(t.name) || a.push(gn(t.name));
|
|
1447
1447
|
for (let s of t.tables) {
|
|
1448
1448
|
let t = o.renamedInto.get(s.name), c = r.get(s.name) ?? (t === void 0 ? void 0 : r.get(t));
|
|
1449
1449
|
if (!c) continue;
|
|
1450
|
-
let l =
|
|
1450
|
+
let l = An(c, t, s.name, e.dialect);
|
|
1451
1451
|
a.push(...l.ops);
|
|
1452
|
-
let u = l.live, d = n.get(s.name), f =
|
|
1452
|
+
let u = l.live, d = n.get(s.name), f = dn(s, u, e.dialect), p = fn(s, u), m = wn(d.table, d.columnDefs, f);
|
|
1453
1453
|
a.push(...m.ops);
|
|
1454
1454
|
for (let e of f.removed) {
|
|
1455
1455
|
if (m.consumedRemovedNames.has(e.name) || v(e.name)) continue;
|
|
1456
1456
|
let t = d.columnDefs[e.name];
|
|
1457
|
-
a.push(
|
|
1457
|
+
a.push(mn(s.name, e, t));
|
|
1458
1458
|
}
|
|
1459
1459
|
for (let e of f.added) {
|
|
1460
1460
|
if (m.consumedAddedNames.has(e.name)) continue;
|
|
1461
1461
|
let t = d.columnDefs[e.name];
|
|
1462
|
-
a.push(
|
|
1463
|
-
let n =
|
|
1464
|
-
n && a.push(n), a.push(...
|
|
1462
|
+
a.push(pn(s.name, e, t));
|
|
1463
|
+
let n = ln(s.name, e);
|
|
1464
|
+
n && a.push(n), a.push(...Cn(s.name, e));
|
|
1465
1465
|
}
|
|
1466
|
-
let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g =
|
|
1466
|
+
let h = new Map(m.ops.flatMap((e) => e.op.kind === "rename-column" ? [[e.op.from, e.op.to]] : [])), g = On(s.name, p, h, new Set(u.indexes.map((e) => e.name)), e.dialect);
|
|
1467
1467
|
a.push(...g.ops);
|
|
1468
|
-
for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(
|
|
1469
|
-
for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(
|
|
1470
|
-
for (let { declared: t, live: n } of f.changed) a.push(...
|
|
1468
|
+
for (let e of p.added) g.consumedAddedNames.has(e.name) || a.push(vn(s.name, e, u.rowCount, i));
|
|
1469
|
+
for (let e of p.removed) g.consumedRemovedNames.has(e.name) || a.push(yn(s.name, e));
|
|
1470
|
+
for (let { declared: t, live: n } of f.changed) a.push(...Sn(s.name, t, n, e.dialect, u.rowCount, i));
|
|
1471
1471
|
}
|
|
1472
1472
|
let c = new Set(a.flatMap((e) => e.op.kind === "create-table" ? [e.op.table] : [])), l = new Map(t.tables.map((e) => [e.name, e])), u = (e) => {
|
|
1473
1473
|
let t = l.get(e);
|
|
@@ -1476,7 +1476,7 @@ BEGIN
|
|
|
1476
1476
|
target: e.references.table
|
|
1477
1477
|
}] : []) : [];
|
|
1478
1478
|
}, d = fe([...c], u), f = [];
|
|
1479
|
-
for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(w(e.name, t.name)) || f.push(
|
|
1479
|
+
for (let e of t.tables) if (c.has(e.name)) for (let t of e.columns) !t.references || !d.has(w(e.name, t.name)) || f.push(R({
|
|
1480
1480
|
kind: "add-foreign-key",
|
|
1481
1481
|
table: e.name,
|
|
1482
1482
|
column: t.name,
|
|
@@ -1550,9 +1550,9 @@ BEGIN
|
|
|
1550
1550
|
operations: S,
|
|
1551
1551
|
fromFingerprint: P(e.live),
|
|
1552
1552
|
toFingerprint: P(t),
|
|
1553
|
-
summary:
|
|
1553
|
+
summary: jn(S)
|
|
1554
1554
|
};
|
|
1555
|
-
},
|
|
1555
|
+
}, Nn = (e) => {
|
|
1556
1556
|
let t = /[`"[]?([A-Za-z_][A-Za-z0-9_]*)[`"\]]?\s*(?:in\b|=)/i.exec(e);
|
|
1557
1557
|
if (!t) return null;
|
|
1558
1558
|
let n = [...e.replace(/\\'/g, "'").matchAll(/'((?:[^']|'')*)'/g)].map((e) => e[1].replace(/''/g, "'")).filter((e) => e.length > 0);
|
|
@@ -1560,7 +1560,7 @@ BEGIN
|
|
|
1560
1560
|
column: t[1],
|
|
1561
1561
|
values: n
|
|
1562
1562
|
};
|
|
1563
|
-
},
|
|
1563
|
+
}, Pn = (e, t) => {
|
|
1564
1564
|
if (t === "vector") return "vector";
|
|
1565
1565
|
switch (e) {
|
|
1566
1566
|
case "text":
|
|
@@ -1587,10 +1587,10 @@ BEGIN
|
|
|
1587
1587
|
case "USER-DEFINED": return "text";
|
|
1588
1588
|
default: return "text";
|
|
1589
1589
|
}
|
|
1590
|
-
},
|
|
1590
|
+
}, Fn = (e, t) => e == null || e === "" ? void 0 : { generatedAs: {
|
|
1591
1591
|
expr: e,
|
|
1592
1592
|
stored: t
|
|
1593
|
-
} },
|
|
1593
|
+
} }, z = (e) => {
|
|
1594
1594
|
switch (e.toUpperCase()) {
|
|
1595
1595
|
case "CASCADE": return "cascade";
|
|
1596
1596
|
case "RESTRICT": return "restrict";
|
|
@@ -1598,25 +1598,25 @@ BEGIN
|
|
|
1598
1598
|
case "SET DEFAULT": return "noAction";
|
|
1599
1599
|
default: return "noAction";
|
|
1600
1600
|
}
|
|
1601
|
-
},
|
|
1601
|
+
}, In = (e, t) => {
|
|
1602
1602
|
let n = e !== void 0 && e !== "" ? Number(e) : NaN;
|
|
1603
1603
|
return Number.isInteger(n) && n > 0 ? n : t;
|
|
1604
|
-
},
|
|
1604
|
+
}, Ln = () => In(process.env.VOLTRO_INTROSPECT_BATCH, 20), Rn = 300, zn = () => {
|
|
1605
1605
|
let e = process.env.VOLTRO_INTROSPECT_TIMEOUT_MS;
|
|
1606
|
-
return e !== void 0 && e.trim() === "0" ? 0 :
|
|
1607
|
-
},
|
|
1606
|
+
return e !== void 0 && e.trim() === "0" ? 0 : In(e, 3e4);
|
|
1607
|
+
}, Bn = (e, t) => {
|
|
1608
1608
|
let n = Number.isFinite(t) && t >= 1 ? Math.floor(t) : 1, r = [];
|
|
1609
1609
|
for (let t = 0; t < e.length; t += n) r.push(e.slice(t, t + n));
|
|
1610
1610
|
return r;
|
|
1611
|
-
},
|
|
1612
|
-
let t =
|
|
1611
|
+
}, Vn = (e) => {
|
|
1612
|
+
let t = zn(), n = x.gen(function* () {
|
|
1613
1613
|
t > 0 && (yield* e.unsafe(`SET LOCAL statement_timeout = ${t}`));
|
|
1614
|
-
let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i =
|
|
1614
|
+
let n = (t) => e.unsafe("(" + t.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ") + ")"), r = (t) => e.unsafe(String(Math.max(0, Math.trunc(t)))), i = Ln(), a = (e, t) => x.gen(function* () {
|
|
1615
1615
|
let r = [];
|
|
1616
|
-
for (let a of
|
|
1616
|
+
for (let a of Bn(e, i)) a.length !== 0 && r.push(...yield* t(n(a)));
|
|
1617
1617
|
return r;
|
|
1618
1618
|
}), o = [];
|
|
1619
|
-
for (let t = 0;; t +=
|
|
1619
|
+
for (let t = 0;; t += Rn) {
|
|
1620
1620
|
let n = yield* e`
|
|
1621
1621
|
SELECT c.relname AS table_name,
|
|
1622
1622
|
COALESCE(c.reltuples::bigint, 0) AS row_count
|
|
@@ -1624,9 +1624,9 @@ BEGIN
|
|
|
1624
1624
|
JOIN pg_namespace n ON n.oid = c.relnamespace
|
|
1625
1625
|
WHERE n.nspname = current_schema() AND c.relkind = 'r'
|
|
1626
1626
|
ORDER BY c.relname
|
|
1627
|
-
LIMIT ${r(
|
|
1627
|
+
LIMIT ${r(Rn)} OFFSET ${r(t)}
|
|
1628
1628
|
`;
|
|
1629
|
-
if (o.push(...n), n.length <
|
|
1629
|
+
if (o.push(...n), n.length < Rn) break;
|
|
1630
1630
|
}
|
|
1631
1631
|
let s = /* @__PURE__ */ new Set(), c = [];
|
|
1632
1632
|
for (let e of o) s.has(e.table_name) || (s.add(e.table_name), c.push(e));
|
|
@@ -1721,18 +1721,18 @@ BEGIN
|
|
|
1721
1721
|
let t = v.get(e.table_name);
|
|
1722
1722
|
t || (t = /* @__PURE__ */ new Set(), v.set(e.table_name, t)), t.add(e.column_name);
|
|
1723
1723
|
}
|
|
1724
|
-
let
|
|
1724
|
+
let te = /* @__PURE__ */ new Map();
|
|
1725
1725
|
for (let e of f) {
|
|
1726
|
-
let t = `${e.table_name}\u0000${e.constraint_name}`, n =
|
|
1726
|
+
let t = `${e.table_name}\u0000${e.constraint_name}`, n = te.get(t);
|
|
1727
1727
|
n || (n = {
|
|
1728
1728
|
table: e.table_name,
|
|
1729
1729
|
columns: []
|
|
1730
|
-
},
|
|
1730
|
+
}, te.set(t, n)), n.columns.push({
|
|
1731
1731
|
name: e.column_name,
|
|
1732
1732
|
position: e.position
|
|
1733
1733
|
});
|
|
1734
1734
|
}
|
|
1735
|
-
for (let [e, t] of
|
|
1735
|
+
for (let [e, t] of te) {
|
|
1736
1736
|
let n = [...t.columns].sort((e, t) => e.position - t.position).map((e) => e.name);
|
|
1737
1737
|
if (n.length === 1) {
|
|
1738
1738
|
let e = y.get(t.table);
|
|
@@ -1757,26 +1757,26 @@ BEGIN
|
|
|
1757
1757
|
let n = t.get(e.index_name);
|
|
1758
1758
|
n || (n = [], t.set(e.index_name, n)), n.push(e);
|
|
1759
1759
|
}
|
|
1760
|
-
let
|
|
1760
|
+
let C = [];
|
|
1761
1761
|
for (let e of c) {
|
|
1762
1762
|
let t = /* @__PURE__ */ new Set(), n = (_.get(e.table_name) ?? []).filter((e) => !t.has(e.column_name) && (t.add(e.column_name), !0)), r = v.get(e.table_name) ?? /* @__PURE__ */ new Set(), i = y.get(e.table_name) ?? /* @__PURE__ */ new Set(), a = S.get(e.table_name) ?? [], o = new Map(a.map((e) => [e.source_column, e])), s = new Set(n.filter((e) => e.udt_name === "tsvector").map((e) => e.column_name)), c = n.filter((e) => !s.has(e.column_name)).map((t) => {
|
|
1763
|
-
let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" :
|
|
1763
|
+
let n = r.has(t.column_name) && r.size === 1, a = o.get(t.column_name), s = a ? "reference" : n && t.column_name === "id" ? "id" : Pn(t.data_type, t.udt_name), c = a ? {
|
|
1764
1764
|
table: a.target_table,
|
|
1765
1765
|
column: a.target_column,
|
|
1766
|
-
onDelete:
|
|
1767
|
-
onUpdate:
|
|
1766
|
+
onDelete: z(a.delete_rule),
|
|
1767
|
+
onUpdate: z(a.update_rule)
|
|
1768
1768
|
} : void 0, l = m.get(`${e.table_name}.${t.column_name}`);
|
|
1769
1769
|
return {
|
|
1770
1770
|
name: t.column_name,
|
|
1771
1771
|
type: s,
|
|
1772
|
-
...
|
|
1772
|
+
...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
|
|
1773
1773
|
nullable: t.is_nullable === "YES",
|
|
1774
1774
|
unique: i.has(t.column_name) || n && t.column_name === "id",
|
|
1775
1775
|
hasDefault: t.column_default !== null,
|
|
1776
1776
|
...t.column_default === null ? {} : { defaultValue: t.column_default },
|
|
1777
1777
|
...c ? { references: c } : {},
|
|
1778
1778
|
...l ? { oneOf: l } : {},
|
|
1779
|
-
...
|
|
1779
|
+
...Fn(t.is_generated === "ALWAYS" ? t.generation_expression ?? "generated" : null, !0) ?? {}
|
|
1780
1780
|
};
|
|
1781
1781
|
}), l = [], u = ee.get(e.table_name);
|
|
1782
1782
|
if (u) for (let [t, n] of u) {
|
|
@@ -1802,20 +1802,20 @@ BEGIN
|
|
|
1802
1802
|
unique: !0
|
|
1803
1803
|
});
|
|
1804
1804
|
let d = Number(e.row_count ?? 0);
|
|
1805
|
-
|
|
1805
|
+
C.push({
|
|
1806
1806
|
name: e.table_name,
|
|
1807
1807
|
columns: c,
|
|
1808
1808
|
indexes: l,
|
|
1809
1809
|
...d > 0 ? { rowCount: d } : {}
|
|
1810
1810
|
});
|
|
1811
1811
|
}
|
|
1812
|
-
return { tables:
|
|
1812
|
+
return { tables: C };
|
|
1813
1813
|
});
|
|
1814
1814
|
return (t > 0 ? e.withTransaction(n) : n).pipe(x.catchAll((e) => {
|
|
1815
1815
|
let n = `${String(e)} ${String(e.cause ?? "")}`.toLowerCase();
|
|
1816
1816
|
return n.includes("statement timeout") || n.includes("57014") ? x.die(/* @__PURE__ */ Error(`schema introspection exceeded VOLTRO_INTROSPECT_TIMEOUT_MS (${t}ms) — the schema is very large / FK-dense or the database is slow. Raise VOLTRO_INTROSPECT_TIMEOUT_MS, set it to 0 to disable the ceiling, or use DB_DIRECT_URL for a non-pooler connection.`)) : x.fail(e);
|
|
1817
1817
|
}));
|
|
1818
|
-
},
|
|
1818
|
+
}, Hn = (e, t) => {
|
|
1819
1819
|
switch (e.toLowerCase()) {
|
|
1820
1820
|
case "varchar":
|
|
1821
1821
|
case "char":
|
|
@@ -1847,21 +1847,21 @@ BEGIN
|
|
|
1847
1847
|
case "json": return "json";
|
|
1848
1848
|
default: return "text";
|
|
1849
1849
|
}
|
|
1850
|
-
},
|
|
1850
|
+
}, B = (e) => e.map((e) => {
|
|
1851
1851
|
let t = e, n = {};
|
|
1852
1852
|
for (let e of Object.keys(t)) n[e.toLowerCase()] = t[e];
|
|
1853
1853
|
return n;
|
|
1854
|
-
}),
|
|
1855
|
-
let t =
|
|
1854
|
+
}), Un = (e) => x.gen(function* () {
|
|
1855
|
+
let t = B(yield* e`
|
|
1856
1856
|
SELECT table_name, COALESCE(table_rows, 0) AS table_rows
|
|
1857
1857
|
FROM information_schema.tables
|
|
1858
1858
|
WHERE table_schema = DATABASE() AND table_type = 'BASE TABLE'
|
|
1859
|
-
ORDER BY table_name`), n =
|
|
1859
|
+
ORDER BY table_name`), n = B(yield* e`
|
|
1860
1860
|
SELECT table_name, column_name, data_type, column_type, is_nullable, column_default, column_key,
|
|
1861
1861
|
character_maximum_length, generation_expression, extra
|
|
1862
1862
|
FROM information_schema.columns
|
|
1863
1863
|
WHERE table_schema = DATABASE()
|
|
1864
|
-
ORDER BY table_name, ordinal_position`), r =
|
|
1864
|
+
ORDER BY table_name, ordinal_position`), r = B(yield* e`
|
|
1865
1865
|
SELECT k.table_name AS source_table,
|
|
1866
1866
|
k.column_name AS source_column,
|
|
1867
1867
|
k.referenced_table_name AS target_table,
|
|
@@ -1871,7 +1871,7 @@ BEGIN
|
|
|
1871
1871
|
JOIN information_schema.referential_constraints r
|
|
1872
1872
|
ON k.constraint_name = r.constraint_name
|
|
1873
1873
|
AND k.table_schema = r.constraint_schema
|
|
1874
|
-
WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i =
|
|
1874
|
+
WHERE k.table_schema = DATABASE() AND k.referenced_table_name IS NOT NULL`), i = B(yield* e`
|
|
1875
1875
|
SELECT table_name, index_name, non_unique, column_name, seq_in_index
|
|
1876
1876
|
FROM information_schema.statistics
|
|
1877
1877
|
WHERE table_schema = DATABASE() AND index_name <> 'PRIMARY'
|
|
@@ -1884,14 +1884,14 @@ BEGIN
|
|
|
1884
1884
|
JOIN information_schema.table_constraints tc
|
|
1885
1885
|
ON tc.constraint_schema = cc.constraint_schema
|
|
1886
1886
|
AND tc.constraint_name = cc.constraint_name
|
|
1887
|
-
WHERE cc.constraint_schema = DATABASE()`.unprepared, s =
|
|
1887
|
+
WHERE cc.constraint_schema = DATABASE()`.unprepared, s = B(yield* a.pipe(x.orElse(() => o), x.orElseSucceed(() => []))), c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Map();
|
|
1888
1888
|
for (let e of s) {
|
|
1889
1889
|
let t = /json_valid\(`?([^`)]+)`?\)/i.exec(e.check_clause);
|
|
1890
1890
|
if (t) {
|
|
1891
1891
|
c.add(`${e.table_name}.${t[1]}`);
|
|
1892
1892
|
continue;
|
|
1893
1893
|
}
|
|
1894
|
-
let n =
|
|
1894
|
+
let n = Nn(e.check_clause);
|
|
1895
1895
|
n && l.set(`${e.table_name}.${n.column}`, n.values);
|
|
1896
1896
|
}
|
|
1897
1897
|
let u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
|
|
@@ -1914,23 +1914,23 @@ BEGIN
|
|
|
1914
1914
|
let t = u.get(e.table_name) ?? [], n = d.get(e.table_name) ?? [], r = new Map(n.map((e) => [e.source_column, e])), i = t.filter((e) => e.column_key === "PRI").map((e) => e.column_name), a = /* @__PURE__ */ new Set(), o = f.get(e.table_name);
|
|
1915
1915
|
if (o) for (let e of o.values()) e.length === 1 && e[0].non_unique === 0 && a.add(e[0].column_name);
|
|
1916
1916
|
let s = t.map((t) => {
|
|
1917
|
-
let n = i.includes(t.column_name) && i.length === 1, o = r.get(t.column_name), s = o ? "reference" : n && t.column_name === "id" ? "id" : c.has(`${e.table_name}.${t.column_name}`) ? "json" :
|
|
1917
|
+
let n = i.includes(t.column_name) && i.length === 1, o = r.get(t.column_name), s = o ? "reference" : n && t.column_name === "id" ? "id" : c.has(`${e.table_name}.${t.column_name}`) ? "json" : Hn(t.data_type, t.column_type), u = o ? {
|
|
1918
1918
|
table: o.target_table,
|
|
1919
1919
|
column: o.target_column,
|
|
1920
|
-
onDelete:
|
|
1921
|
-
onUpdate:
|
|
1920
|
+
onDelete: z(o.delete_rule),
|
|
1921
|
+
onUpdate: z(o.update_rule)
|
|
1922
1922
|
} : void 0, d = a.has(t.column_name) || n && t.column_name === "id", f = t.column_default === "NULL" ? null : t.column_default, p = l.get(`${e.table_name}.${t.column_name}`);
|
|
1923
1923
|
return {
|
|
1924
1924
|
name: t.column_name,
|
|
1925
1925
|
type: s,
|
|
1926
1926
|
nullable: t.is_nullable === "YES",
|
|
1927
|
-
...
|
|
1927
|
+
...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
|
|
1928
1928
|
unique: d,
|
|
1929
1929
|
hasDefault: f !== null,
|
|
1930
1930
|
...f === null ? {} : { defaultValue: f },
|
|
1931
1931
|
...u ? { references: u } : {},
|
|
1932
1932
|
...p ? { oneOf: p } : {},
|
|
1933
|
-
...
|
|
1933
|
+
...Fn(t.generation_expression, /STORED/i.test(t.extra ?? "")) ?? {}
|
|
1934
1934
|
};
|
|
1935
1935
|
}), m = new Set(n.map((e) => e.source_column)), h = [];
|
|
1936
1936
|
if (o) for (let [t, n] of o) {
|
|
@@ -1957,10 +1957,10 @@ BEGIN
|
|
|
1957
1957
|
});
|
|
1958
1958
|
}
|
|
1959
1959
|
return { tables: p };
|
|
1960
|
-
}),
|
|
1960
|
+
}), Wn = (e) => {
|
|
1961
1961
|
let t = e.toUpperCase();
|
|
1962
1962
|
return t.includes("INT") ? "integer" : t.includes("REAL") || t.includes("FLOA") || t.includes("DOUB") ? "real" : t.includes("BLOB") ? "bytes" : "text";
|
|
1963
|
-
},
|
|
1963
|
+
}, Gn = (e) => x.gen(function* () {
|
|
1964
1964
|
let t = yield* e`
|
|
1965
1965
|
SELECT name, sql FROM sqlite_master
|
|
1966
1966
|
WHERE type = 'table' AND name NOT LIKE 'sqlite_%'
|
|
@@ -1977,11 +1977,11 @@ BEGIN
|
|
|
1977
1977
|
d.set(t.name, r), t.unique === 1 && r.length === 1 && f.add(r[0]);
|
|
1978
1978
|
}
|
|
1979
1979
|
let p = o.map((e) => {
|
|
1980
|
-
let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" :
|
|
1980
|
+
let n = u.length === 1 && u[0] === e.name, r = l.get(e.name), i = r ? "reference" : n && e.name === "id" ? "id" : Wn(e.type), a = r ? {
|
|
1981
1981
|
table: r.table,
|
|
1982
1982
|
column: r.to,
|
|
1983
|
-
onDelete:
|
|
1984
|
-
onUpdate:
|
|
1983
|
+
onDelete: z(r.on_delete),
|
|
1984
|
+
onUpdate: z(r.on_update)
|
|
1985
1985
|
} : void 0, o = t.get(e.name);
|
|
1986
1986
|
return {
|
|
1987
1987
|
name: e.name,
|
|
@@ -1992,7 +1992,7 @@ BEGIN
|
|
|
1992
1992
|
...e.dflt_value === null ? {} : { defaultValue: e.dflt_value },
|
|
1993
1993
|
...a ? { references: a } : {},
|
|
1994
1994
|
...o ? { oneOf: o } : {},
|
|
1995
|
-
...
|
|
1995
|
+
...Fn(e.hidden === 2 || e.hidden === 3 ? "generated" : null, e.hidden === 3) ?? {}
|
|
1996
1996
|
};
|
|
1997
1997
|
}), m = new Set(s.map((e) => e.from)), h = [];
|
|
1998
1998
|
for (let e of c) {
|
|
@@ -2017,7 +2017,7 @@ BEGIN
|
|
|
2017
2017
|
});
|
|
2018
2018
|
}
|
|
2019
2019
|
return { tables: r };
|
|
2020
|
-
}),
|
|
2020
|
+
}), Kn = (e) => {
|
|
2021
2021
|
switch (e.toLowerCase()) {
|
|
2022
2022
|
case "int":
|
|
2023
2023
|
case "smallint":
|
|
@@ -2039,7 +2039,7 @@ BEGIN
|
|
|
2039
2039
|
case "image": return "bytes";
|
|
2040
2040
|
default: return "text";
|
|
2041
2041
|
}
|
|
2042
|
-
},
|
|
2042
|
+
}, V = (e) => e === !0 || e === 1, qn = (e) => x.gen(function* () {
|
|
2043
2043
|
let t = yield* e`
|
|
2044
2044
|
SELECT TABLE_NAME AS table_name FROM INFORMATION_SCHEMA.TABLES
|
|
2045
2045
|
WHERE TABLE_TYPE = 'BASE TABLE' ORDER BY TABLE_NAME`, n = yield* e`
|
|
@@ -2101,36 +2101,36 @@ BEGIN
|
|
|
2101
2101
|
let t = l.get(e) ?? [], n = u.get(e) ?? [], r = new Map(n.map((e) => [e.source_column, e])), a = new Set(n.map((e) => e.source_column)), o = d.get(e), s = [], p = /* @__PURE__ */ new Set();
|
|
2102
2102
|
if (o) for (let [, e] of o) {
|
|
2103
2103
|
let t = [...e].sort((e, t) => e.key_ordinal - t.key_ordinal);
|
|
2104
|
-
if (
|
|
2105
|
-
else
|
|
2104
|
+
if (V(t[0].is_primary)) for (let e of t) s.push(e.column_name);
|
|
2105
|
+
else V(t[0].is_unique) && t.length === 1 && p.add(t[0].column_name);
|
|
2106
2106
|
}
|
|
2107
2107
|
let m = t.map((t) => {
|
|
2108
|
-
let n = s.length === 1 && s[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" :
|
|
2108
|
+
let n = s.length === 1 && s[0] === t.column_name, a = r.get(t.column_name), o = a ? "reference" : n && t.column_name === "id" ? "id" : Kn(t.data_type), l = a ? {
|
|
2109
2109
|
table: a.target_table,
|
|
2110
2110
|
column: a.target_column,
|
|
2111
|
-
onDelete:
|
|
2112
|
-
onUpdate:
|
|
2113
|
-
} : void 0, u = t.column_default === null ? null :
|
|
2111
|
+
onDelete: Jn(a.delete_rule),
|
|
2112
|
+
onUpdate: Jn(a.update_rule)
|
|
2113
|
+
} : void 0, u = t.column_default === null ? null : Yn(t.column_default), d = c.get(`${e}.${t.column_name}`);
|
|
2114
2114
|
return {
|
|
2115
2115
|
name: t.column_name,
|
|
2116
2116
|
type: o,
|
|
2117
2117
|
nullable: t.is_nullable === "YES",
|
|
2118
|
-
...
|
|
2118
|
+
...H(t.data_type, t.character_maximum_length) === void 0 ? {} : { maxLength: H(t.data_type, t.character_maximum_length) },
|
|
2119
2119
|
unique: p.has(t.column_name) || n && t.column_name === "id",
|
|
2120
2120
|
hasDefault: u !== null,
|
|
2121
2121
|
...u === null ? {} : { defaultValue: u },
|
|
2122
2122
|
...l ? { references: l } : {},
|
|
2123
2123
|
...d ? { oneOf: d } : {},
|
|
2124
|
-
...
|
|
2124
|
+
...Fn(i.get(`${e}.${t.column_name}`)?.definition ?? null, V(i.get(`${e}.${t.column_name}`)?.is_persisted ?? !1)) ?? {}
|
|
2125
2125
|
};
|
|
2126
2126
|
}), h = [];
|
|
2127
2127
|
if (o) for (let [t, n] of o) {
|
|
2128
2128
|
let r = [...n].sort((e, t) => e.key_ordinal - t.key_ordinal);
|
|
2129
|
-
|
|
2129
|
+
V(r[0].is_primary) || r.length === 1 && V(r[0].is_unique) || r.length === 1 && !V(r[0].is_unique) && a.has(r[0].column_name) && t !== `${e}_${r[0].column_name}_idx` || h.push({
|
|
2130
2130
|
name: t,
|
|
2131
2131
|
table: e,
|
|
2132
2132
|
columns: r.map((e) => e.column_name),
|
|
2133
|
-
unique:
|
|
2133
|
+
unique: V(r[0].is_unique)
|
|
2134
2134
|
});
|
|
2135
2135
|
}
|
|
2136
2136
|
s.length > 0 && h.push({
|
|
@@ -2145,90 +2145,90 @@ BEGIN
|
|
|
2145
2145
|
});
|
|
2146
2146
|
}
|
|
2147
2147
|
return { tables: f };
|
|
2148
|
-
}),
|
|
2148
|
+
}), Jn = (e) => {
|
|
2149
2149
|
switch (e.toUpperCase().replace(/_/g, " ")) {
|
|
2150
2150
|
case "CASCADE": return "cascade";
|
|
2151
2151
|
case "SET NULL": return "setNull";
|
|
2152
2152
|
case "SET DEFAULT": return "noAction";
|
|
2153
2153
|
default: return "noAction";
|
|
2154
2154
|
}
|
|
2155
|
-
},
|
|
2155
|
+
}, Yn = (e) => {
|
|
2156
2156
|
let t = e.trim();
|
|
2157
2157
|
for (; t.startsWith("(") && t.endsWith(")");) t = t.slice(1, -1).trim();
|
|
2158
2158
|
return t.startsWith("N'") && t.endsWith("'") ? t = t.slice(2, -1) : t.startsWith("'") && t.endsWith("'") && (t = t.slice(1, -1)), t;
|
|
2159
|
-
},
|
|
2159
|
+
}, Xn = /* @__PURE__ */ new Set([
|
|
2160
2160
|
"character varying",
|
|
2161
2161
|
"varchar",
|
|
2162
2162
|
"nvarchar",
|
|
2163
2163
|
"char",
|
|
2164
2164
|
"character",
|
|
2165
2165
|
"nchar"
|
|
2166
|
-
]),
|
|
2167
|
-
if (!
|
|
2166
|
+
]), H = (e, t) => {
|
|
2167
|
+
if (!Xn.has(e.toLowerCase())) return;
|
|
2168
2168
|
let n = Number(t);
|
|
2169
2169
|
if (!(!Number.isFinite(n) || n <= 0)) return n;
|
|
2170
|
-
},
|
|
2171
|
-
mysql: () =>
|
|
2172
|
-
mssql: () =>
|
|
2173
|
-
sqlite: () =>
|
|
2174
|
-
orElse: () =>
|
|
2170
|
+
}, Zn = /* @__PURE__ */ new Set([D]), Qn = (e) => e.onDialectOrElse({
|
|
2171
|
+
mysql: () => Un(e),
|
|
2172
|
+
mssql: () => qn(e),
|
|
2173
|
+
sqlite: () => Gn(e),
|
|
2174
|
+
orElse: () => Vn(e)
|
|
2175
2175
|
}).pipe(x.map((e) => ({
|
|
2176
2176
|
...e,
|
|
2177
|
-
tables: e.tables.filter((e) => !
|
|
2178
|
-
}))),
|
|
2179
|
-
let t =
|
|
2180
|
-
return t === void 0 ?
|
|
2181
|
-
}),
|
|
2177
|
+
tables: e.tables.filter((e) => !Zn.has(e.name))
|
|
2178
|
+
}))), $n = (e) => /mariadb/i.test(e) ? "mariadb" : "mysql", er = /* @__PURE__ */ new WeakMap(), U = (e) => x.suspend(() => {
|
|
2179
|
+
let t = er.get(e);
|
|
2180
|
+
return t === void 0 ? tr(e).pipe(x.tap((t) => x.sync(() => er.set(e, t)))) : x.succeed(t);
|
|
2181
|
+
}), tr = (e) => e.unsafe("SELECT VERSION() AS v").pipe(x.map((e) => {
|
|
2182
2182
|
let t = e[0]?.v;
|
|
2183
|
-
return typeof t == "string" ?
|
|
2184
|
-
}), x.catchAll(() => x.succeed("mysql"))),
|
|
2183
|
+
return typeof t == "string" ? $n(t) : "mysql";
|
|
2184
|
+
}), x.catchAll(() => x.succeed("mysql"))), nr = (e) => {
|
|
2185
2185
|
let t = e;
|
|
2186
2186
|
for (let e = 0; e < 6 && typeof t == "object" && t; e++) {
|
|
2187
2187
|
let e = t;
|
|
2188
2188
|
if (typeof e.errno == "number") return e.errno;
|
|
2189
2189
|
t = e.cause;
|
|
2190
2190
|
}
|
|
2191
|
-
},
|
|
2191
|
+
}, rr = (e) => {
|
|
2192
2192
|
let t = [], n = e;
|
|
2193
2193
|
for (let e = 0; e < 6 && typeof n == "object" && n; e++) {
|
|
2194
2194
|
let e = n;
|
|
2195
2195
|
typeof e.message == "string" && t.push(e.message), n = e.cause;
|
|
2196
2196
|
}
|
|
2197
2197
|
return t.join(" | ");
|
|
2198
|
-
},
|
|
2198
|
+
}, ir = (e, t) => {
|
|
2199
2199
|
if (t.length === 0) return !1;
|
|
2200
|
-
let n =
|
|
2200
|
+
let n = nr(e), r = rr(e);
|
|
2201
2201
|
return t.some((e) => e.errno !== void 0 && n !== void 0 && e.errno.includes(n) || e.messageIncludes !== void 0 && e.messageIncludes.some((e) => r.includes(e)));
|
|
2202
|
-
},
|
|
2202
|
+
}, ar = {
|
|
2203
2203
|
why: "mysql has no CREATE INDEX IF NOT EXISTS; 1061 is exactly that condition",
|
|
2204
2204
|
errno: [1061]
|
|
2205
|
-
},
|
|
2205
|
+
}, or = {
|
|
2206
2206
|
why: "mysql has no DROP COLUMN IF EXISTS; 1091 is exactly that condition",
|
|
2207
2207
|
errno: [1091]
|
|
2208
|
-
},
|
|
2208
|
+
}, sr = {
|
|
2209
2209
|
why: "sqlite has no DROP COLUMN IF EXISTS, and reports the absent column only in the message",
|
|
2210
2210
|
messageIncludes: ["no such column"]
|
|
2211
|
-
},
|
|
2211
|
+
}, cr = {
|
|
2212
2212
|
why: "mysql/mariadb DROP CONSTRAINT has no portable IF EXISTS; 1091 / 3940 are exactly \"already gone\"",
|
|
2213
2213
|
errno: [1091, 3940]
|
|
2214
|
-
},
|
|
2214
|
+
}, W = (e, t) => e.onDialectOrElse({
|
|
2215
2215
|
mysql: () => x.succeed(t.replace("T", " ").replace("Z", "")),
|
|
2216
2216
|
orElse: () => x.succeed(t)
|
|
2217
|
-
}),
|
|
2217
|
+
}), lr = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, ur = (e, t) => {
|
|
2218
2218
|
if ((e.type !== "text" || e.maxLength === void 0) && !e.spatial && e.type !== "vector" && e.type !== "array" && e.type !== "enum") return;
|
|
2219
2219
|
let n = e.type === "vector" && e.vectorDim === void 0 ? "vector dimension" : e.type === "array" && e.arrayElement === void 0 ? "array element type" : e.type === "enum" && e.enumName === void 0 && e.enumValues === void 0 ? "enum name/values" : void 0;
|
|
2220
2220
|
if (n !== void 0) throw Error(`migration applier: cannot render '${e.name}' (${e.type}) — the schema snapshot carries no ${n}. Rendering it as 'text' would emit DDL that applies successfully and changes nothing, so this fails instead. This is a framework bug: declaredSchema.ts must carry the parameter into the ColumnSnapshot.`);
|
|
2221
2221
|
return A(e, t);
|
|
2222
|
+
}, dr = (e) => {
|
|
2223
|
+
let t = ur(e, "postgres");
|
|
2224
|
+
return t === void 0 ? fr(e) : t;
|
|
2222
2225
|
}, fr = (e) => {
|
|
2223
|
-
let t = dr(e, "postgres");
|
|
2224
|
-
return t === void 0 ? pr(e) : t;
|
|
2225
|
-
}, pr = (e) => {
|
|
2226
2226
|
switch (e.type) {
|
|
2227
2227
|
case "id": return "text";
|
|
2228
2228
|
case "text": return "text";
|
|
2229
2229
|
case "integer": return "integer";
|
|
2230
2230
|
case "real": return "double precision";
|
|
2231
|
-
case "decimal": return
|
|
2231
|
+
case "decimal": return lr(e, "NUMERIC");
|
|
2232
2232
|
case "bigint": return "bigint";
|
|
2233
2233
|
case "boolean": return "boolean";
|
|
2234
2234
|
case "timestamp": return "timestamptz";
|
|
@@ -2242,15 +2242,15 @@ BEGIN
|
|
|
2242
2242
|
case "interval": return "interval";
|
|
2243
2243
|
case "raw": return e.rawDdl ?? "text";
|
|
2244
2244
|
}
|
|
2245
|
-
},
|
|
2246
|
-
let t =
|
|
2245
|
+
}, pr = (e) => {
|
|
2246
|
+
let t = ur(e, "mariadb");
|
|
2247
2247
|
if (t !== void 0) return t;
|
|
2248
2248
|
switch (e.type) {
|
|
2249
2249
|
case "id": return "VARCHAR(64)";
|
|
2250
2250
|
case "text": return e.hasDefault && e.defaultValue !== void 0 || e.oneOf && e.oneOf.length > 0 ? "VARCHAR(255)" : "LONGTEXT";
|
|
2251
2251
|
case "integer": return "INT";
|
|
2252
2252
|
case "real": return "DOUBLE";
|
|
2253
|
-
case "decimal": return
|
|
2253
|
+
case "decimal": return lr(e, "DECIMAL");
|
|
2254
2254
|
case "bigint": return "BIGINT";
|
|
2255
2255
|
case "boolean": return "TINYINT(1)";
|
|
2256
2256
|
case "timestamp": return "DATETIME(6)";
|
|
@@ -2264,54 +2264,54 @@ BEGIN
|
|
|
2264
2264
|
case "interval": return "BIGINT";
|
|
2265
2265
|
case "raw": return e.rawDdl ?? "LONGTEXT";
|
|
2266
2266
|
}
|
|
2267
|
-
},
|
|
2267
|
+
}, G = (e) => `"${e}"`, K = (e) => `\`${e.replace(/`/g, "``")}\``, mr = (e) => e === "mariadb" ? "IF NOT EXISTS " : "", hr = (e, t, n = !0) => `ALTER TABLE ${t(e.table)} DROP COLUMN ${n ? "IF EXISTS " : ""}${t(e.column)};`, gr = (e, t = "mariadb") => `ALTER TABLE ${K(e.table)} DROP COLUMN ${t === "mariadb" ? "IF EXISTS " : ""}${K(e.column)}, ALGORITHM=COPY;`, _r = (e, t) => `ALTER TABLE ${t(e.table)} RENAME COLUMN ${t(e.from)} TO ${t(e.to)};`, vr = (e, t, n) => `ALTER TABLE ${n(e.table)} RENAME COLUMN ${n(e.column)} TO ${n(`${e.column}${Kr(t)}`)};`, yr = (e, t, n) => e.hasDefault && e.defaultValue !== void 0 ? `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} SET ${br(e, n)};` : `ALTER TABLE ${t(e.table)} ALTER COLUMN ${t(e.column)} DROP DEFAULT;`, br = (e, t) => {
|
|
2268
2268
|
let n = t(e.defaultValue);
|
|
2269
2269
|
if (n === null) throw Error(`migration applier: cannot render the declared default for '${e.table}.${e.column}' (${JSON.stringify(e.defaultValue)}). Emitting 'DEFAULT NULL' would apply cleanly and drop the default silently, so this fails instead. This is a framework bug — report the column type + default.`);
|
|
2270
2270
|
return n;
|
|
2271
|
-
},
|
|
2272
|
-
let r =
|
|
2273
|
-
return r ?
|
|
2274
|
-
},
|
|
2271
|
+
}, q = (e, t, n) => e.find((e) => e.tableName === t)?.fields[n], xr = (e, t, n) => {
|
|
2272
|
+
let r = q(e, t, n);
|
|
2273
|
+
return r ? Gt(n, r) : void 0;
|
|
2274
|
+
}, Sr = (e, t, n) => {
|
|
2275
2275
|
let r = n ?? e.nullable, i = $e(e, "mariadb");
|
|
2276
2276
|
return [
|
|
2277
|
-
|
|
2277
|
+
K(t),
|
|
2278
2278
|
A(e, "mariadb"),
|
|
2279
2279
|
r ? null : "NOT NULL",
|
|
2280
2280
|
i
|
|
2281
2281
|
].filter(Boolean).join(" ");
|
|
2282
|
-
},
|
|
2282
|
+
}, Cr = (e, t) => e == null ? null : Array.isArray(e) ? wr(e, t, "mariadb") : e === "now" ? "DEFAULT CURRENT_TIMESTAMP(6)" : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "mariadb") : null, wr = (e, t, n) => et(e, t ?? { type: "json" }, n), Tr = (e, t) => e == null ? null : Array.isArray(e) ? wr(e, t, "postgres") : e === "now" ? "DEFAULT now()" : typeof e == "boolean" || typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|::|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "postgres") : null, Er = (e, t) => {
|
|
2283
2283
|
if (!e.generatedAs) return null;
|
|
2284
2284
|
let { expr: n, stored: r } = e.generatedAs;
|
|
2285
2285
|
return t === "postgres" ? `GENERATED ALWAYS AS (${n}) STORED` : t === "mssql" ? `AS (${n})${r ? " PERSISTED" : ""}` : `GENERATED ALWAYS AS (${n}) ${r ? "STORED" : "VIRTUAL"}`;
|
|
2286
2286
|
}, Dr = (e) => {
|
|
2287
2287
|
if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "postgres");
|
|
2288
|
-
let t =
|
|
2289
|
-
if (t) return `${
|
|
2290
|
-
let n = [
|
|
2288
|
+
let t = Er(e, "postgres");
|
|
2289
|
+
if (t) return `${G(e.name)} ${dr(e)} ${t}`;
|
|
2290
|
+
let n = [G(e.name), dr(e)];
|
|
2291
2291
|
if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
|
|
2292
|
-
let t =
|
|
2292
|
+
let t = Tr(e.defaultValue, e);
|
|
2293
2293
|
t && n.push(t);
|
|
2294
2294
|
}
|
|
2295
|
-
return e.references && (n.push(`REFERENCES ${
|
|
2295
|
+
return e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${{
|
|
2296
2296
|
cascade: "CASCADE",
|
|
2297
2297
|
restrict: "RESTRICT",
|
|
2298
2298
|
setNull: "SET NULL",
|
|
2299
2299
|
noAction: "NO ACTION"
|
|
2300
2300
|
}[e.references.onDelete]}`)), n.join(" ");
|
|
2301
2301
|
}, Or = (e, t) => e.primaryKey && e.primaryKey.length > 0 ? `,\n PRIMARY KEY (${e.primaryKey.map(t).join(", ")})` : "", kr = (e) => {
|
|
2302
|
-
let t = e.columns.map((e) => ` ${Dr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${
|
|
2303
|
-
for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${
|
|
2302
|
+
let t = e.columns.map((e) => ` ${Dr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${Or(e, G)}\n)`];
|
|
2303
|
+
for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e.table)} (${t.columns.map(Zr).join(", ")})`);
|
|
2304
2304
|
return n;
|
|
2305
2305
|
}, Ar = 191, jr = (e) => {
|
|
2306
|
-
let t =
|
|
2306
|
+
let t = pr(e).toUpperCase();
|
|
2307
2307
|
return t.endsWith("TEXT") || t.endsWith("BLOB");
|
|
2308
2308
|
}, Mr = (e) => {
|
|
2309
2309
|
if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "mariadb");
|
|
2310
|
-
let t =
|
|
2311
|
-
if (t) return `${
|
|
2312
|
-
let n = [
|
|
2310
|
+
let t = Er(e, "mariadb");
|
|
2311
|
+
if (t) return `${K(e.name)} ${pr(e)} ${t}`;
|
|
2312
|
+
let n = [K(e.name), pr(e)];
|
|
2313
2313
|
if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && !jr(e) && n.push("UNIQUE"), e.hasDefault) {
|
|
2314
|
-
let t =
|
|
2314
|
+
let t = Cr(e.defaultValue, e);
|
|
2315
2315
|
t && n.push(t);
|
|
2316
2316
|
}
|
|
2317
2317
|
return n.join(" ");
|
|
@@ -2323,14 +2323,14 @@ BEGIN
|
|
|
2323
2323
|
setNull: "SET NULL",
|
|
2324
2324
|
noAction: "NO ACTION"
|
|
2325
2325
|
}[t.references.onDelete]}` : "";
|
|
2326
|
-
return [` CONSTRAINT ${
|
|
2326
|
+
return [` CONSTRAINT ${K(`${e.table}_${t.name}_fkey`)} FOREIGN KEY (${K(t.name)}) REFERENCES ${K(t.references.table)} (${K(t.references.column)})${n}`];
|
|
2327
2327
|
}), Pr = (e, t = "mariadb") => {
|
|
2328
2328
|
let n = new Map(e.columns.map((e) => [e.name, e])), r = (e) => {
|
|
2329
2329
|
let t = Yr(n.get(e));
|
|
2330
|
-
return t === void 0 ?
|
|
2331
|
-
}, i = e.columns.map((e) => ` ${Mr(e)}`).join(",\n"), a = Nr(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${
|
|
2332
|
-
for (let n of e.columns) n.unique && n.type !== "id" && jr(n) && s.push(`CREATE UNIQUE INDEX ${
|
|
2333
|
-
for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${
|
|
2330
|
+
return t === void 0 ? K(e) : `${K(e)}(${t})`;
|
|
2331
|
+
}, i = e.columns.map((e) => ` ${Mr(e)}`).join(",\n"), a = Nr(e), o = a.length > 0 ? `${i},\n${a.join(",\n")}` : i, s = [`CREATE TABLE IF NOT EXISTS ${K(e.table)} (\n${o}${Or(e, r)}\n)`];
|
|
2332
|
+
for (let n of e.columns) n.unique && n.type !== "id" && jr(n) && s.push(`CREATE UNIQUE INDEX ${mr(t)}${K(`${e.table}_${n.name}_key`)} ON ${K(e.table)} (${r(n.name)})`);
|
|
2333
|
+
for (let n of e.indexes) n.name !== `${e.table}_pkey` && s.push(`CREATE ${n.unique ? "UNIQUE " : ""}INDEX ${mr(t)}${K(n.name)} ON ${K(e.table)} (${n.columns.map(r).join(", ")})`);
|
|
2334
2334
|
return s;
|
|
2335
2335
|
}, Fr = {
|
|
2336
2336
|
cascade: "CASCADE",
|
|
@@ -2343,7 +2343,7 @@ BEGIN
|
|
|
2343
2343
|
setNull: "SET NULL",
|
|
2344
2344
|
noAction: "NO ACTION"
|
|
2345
2345
|
}, Lr = (e) => {
|
|
2346
|
-
let t =
|
|
2346
|
+
let t = ur(e, "sqlite");
|
|
2347
2347
|
if (t !== void 0) return t;
|
|
2348
2348
|
switch (e.type) {
|
|
2349
2349
|
case "integer":
|
|
@@ -2356,26 +2356,26 @@ BEGIN
|
|
|
2356
2356
|
}
|
|
2357
2357
|
}, Rr = (e, t) => e == null ? null : e === "now" ? `DEFAULT ${t}` : typeof e == "boolean" ? `DEFAULT ${+!!e}` : typeof e == "number" ? `DEFAULT ${e}` : typeof e == "string" ? /[()]|^'/.test(e) ? `DEFAULT ${e}` : `DEFAULT '${e.replace(/'/g, "''")}'` : typeof e == "object" ? j(e, "sqlite") : null, zr = (e) => {
|
|
2358
2358
|
if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "sqlite");
|
|
2359
|
-
let t =
|
|
2360
|
-
if (t) return `${
|
|
2361
|
-
let n = [
|
|
2359
|
+
let t = Er(e, "sqlite");
|
|
2360
|
+
if (t) return `${G(e.name)} ${Lr(e)} ${t}`;
|
|
2361
|
+
let n = [G(e.name), Lr(e)];
|
|
2362
2362
|
if (e.type === "id" && n.push("PRIMARY KEY"), e.nullable || n.push("NOT NULL"), e.unique && e.type !== "id" && n.push("UNIQUE"), e.hasDefault) {
|
|
2363
2363
|
let t = Rr(e.defaultValue, "CURRENT_TIMESTAMP");
|
|
2364
2364
|
t && n.push(t);
|
|
2365
2365
|
}
|
|
2366
|
-
if (e.references && (n.push(`REFERENCES ${
|
|
2366
|
+
if (e.references && (n.push(`REFERENCES ${G(e.references.table)} (${G(e.references.column)})`), e.references.onDelete && n.push(`ON DELETE ${Fr[e.references.onDelete]}`)), e.oneOf && e.oneOf.length > 0) {
|
|
2367
2367
|
let t = e.oneOf.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
|
|
2368
|
-
n.push(`CHECK (${
|
|
2368
|
+
n.push(`CHECK (${G(e.name)} IN (${t}))`);
|
|
2369
2369
|
}
|
|
2370
2370
|
return n.join(" ");
|
|
2371
2371
|
}, Br = (e) => {
|
|
2372
|
-
let t = e.columns.map((e) => ` ${zr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${
|
|
2373
|
-
for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${
|
|
2372
|
+
let t = e.columns.map((e) => ` ${zr(e)}`).join(",\n"), n = [`CREATE TABLE IF NOT EXISTS ${G(e.table)} (\n${t}${Or(e, G)}\n)`];
|
|
2373
|
+
for (let t of e.indexes) t.name !== `${e.table}_pkey` && n.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e.table)} (${t.columns.map(G).join(", ")})`);
|
|
2374
2374
|
return n;
|
|
2375
2375
|
}, J = (e, t) => {
|
|
2376
2376
|
let n = t.find((t) => t.tableName === e);
|
|
2377
2377
|
if (!n) return [];
|
|
2378
|
-
let r =
|
|
2378
|
+
let r = I([n]).tables[0], i = `${e}__voltro_rebuild`, a = r.columns.map((e) => G(e.name)).join(", "), o = [
|
|
2379
2379
|
...Br({
|
|
2380
2380
|
kind: "create-table",
|
|
2381
2381
|
table: i,
|
|
@@ -2383,11 +2383,11 @@ BEGIN
|
|
|
2383
2383
|
indexes: [],
|
|
2384
2384
|
...r.primaryKey ? { primaryKey: r.primaryKey } : {}
|
|
2385
2385
|
}),
|
|
2386
|
-
`INSERT INTO ${
|
|
2387
|
-
`DROP TABLE ${
|
|
2388
|
-
`ALTER TABLE ${
|
|
2386
|
+
`INSERT INTO ${G(i)} (${a}) SELECT ${a} FROM ${G(e)}`,
|
|
2387
|
+
`DROP TABLE ${G(e)}`,
|
|
2388
|
+
`ALTER TABLE ${G(i)} RENAME TO ${G(e)}`
|
|
2389
2389
|
];
|
|
2390
|
-
for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${
|
|
2390
|
+
for (let t of r.indexes) t.name !== `${e}_pkey` && o.push(`CREATE ${t.unique ? "UNIQUE " : ""}INDEX IF NOT EXISTS ${G(t.name)} ON ${G(e)} (${t.columns.map(G).join(", ")})`);
|
|
2391
2391
|
return o;
|
|
2392
2392
|
}, Vr = (e, t, n, r) => {
|
|
2393
2393
|
let i = r ?? e.nullable;
|
|
@@ -2400,14 +2400,14 @@ BEGIN
|
|
|
2400
2400
|
let r = n.replace(/^DEFAULT\s+/i, "");
|
|
2401
2401
|
return `${t} ALTER TABLE ${Y(e.table)} ADD DEFAULT ${r} FOR ${Y(e.column)};`;
|
|
2402
2402
|
}, Y = (e) => `[${e.replace(/]/g, "]]")}]`, Ur = (e) => {
|
|
2403
|
-
let t =
|
|
2403
|
+
let t = ur(e, "mssql");
|
|
2404
2404
|
if (t !== void 0) return t;
|
|
2405
2405
|
switch (e.type) {
|
|
2406
2406
|
case "id":
|
|
2407
2407
|
case "reference": return "NVARCHAR(64)";
|
|
2408
2408
|
case "integer": return "INT";
|
|
2409
2409
|
case "real": return "FLOAT";
|
|
2410
|
-
case "decimal": return
|
|
2410
|
+
case "decimal": return lr(e, "DECIMAL");
|
|
2411
2411
|
case "bigint": return "BIGINT";
|
|
2412
2412
|
case "boolean": return "BIT";
|
|
2413
2413
|
case "timestamp": return "DATETIME2(6)";
|
|
@@ -2417,7 +2417,7 @@ BEGIN
|
|
|
2417
2417
|
}
|
|
2418
2418
|
}, Wr = (e, t) => {
|
|
2419
2419
|
if (e.type === "id" && e.idScheme?.kind === "numeric") return M(e.name, "mssql");
|
|
2420
|
-
let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Ur(e), r =
|
|
2420
|
+
let n = e.type === "text" && t?.has(e.name) ? "NVARCHAR(450)" : Ur(e), r = Er(e, "mssql");
|
|
2421
2421
|
if (r) return `${Y(e.name)} ${r}`;
|
|
2422
2422
|
let i = [Y(e.name), n];
|
|
2423
2423
|
if (e.type === "id" && i.push("PRIMARY KEY"), e.nullable || i.push("NOT NULL"), e.unique && e.type !== "id" && i.push("UNIQUE"), e.hasDefault) {
|
|
@@ -2441,12 +2441,12 @@ BEGIN
|
|
|
2441
2441
|
let t = typeof e.maxLength == "number" && e.maxLength > 0 ? e.maxLength : void 0;
|
|
2442
2442
|
return t === void 0 ? Ar : Math.min(Ar, t);
|
|
2443
2443
|
}, Xr = (e, t, n) => {
|
|
2444
|
-
let r = Yr(
|
|
2445
|
-
return r === void 0 ?
|
|
2446
|
-
}, Zr = (e) => e.startsWith("(") ? e :
|
|
2444
|
+
let r = Yr(xr(e, t, n));
|
|
2445
|
+
return r === void 0 ? K(n) : `${K(n)}(${r})`;
|
|
2446
|
+
}, Zr = (e) => e.startsWith("(") ? e : G(e), Qr = (e, t) => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${t ? "CONCURRENTLY " : ""}IF NOT EXISTS ${G(e.index.name)} ON ${G(e.table)} (${e.index.columns.map(Zr).join(", ")});`, $r = (e, t, n = "mariadb") => `CREATE ${e.index.unique ? "UNIQUE " : ""}INDEX ${mr(n)}${K(e.index.name)} ON ${K(e.table)} (${e.index.columns.map((n) => Xr(t, e.table, n)).join(", ")});`, ei = (e) => `DROP INDEX IF EXISTS ${G(e.index)};`, ti = (e) => `DROP INDEX ${K(e.index)} ON ${K(e.table)};`, ni = (e) => `DROP INDEX IF EXISTS ${Y(e.index)} ON ${Y(e.table)};`, ri = (e, t) => `ALTER TABLE ${t(e.from)} RENAME TO ${t(e.to)};`, ii = (e) => {
|
|
2447
2447
|
let t = (e) => e.replace(/'/g, "''");
|
|
2448
2448
|
return `EXEC sp_rename N'${t(e.from)}', N'${t(e.to)}';`;
|
|
2449
|
-
}, ai = (e) => `ALTER INDEX ${
|
|
2449
|
+
}, ai = (e) => `ALTER INDEX ${G(e.from)} RENAME TO ${G(e.to)};`, oi = (e) => `ALTER TABLE ${K(e.table)} RENAME INDEX ${K(e.from)} TO ${K(e.to)};`, si = (e) => {
|
|
2450
2450
|
let t = (e) => e.replace(/'/g, "''");
|
|
2451
2451
|
return `EXEC sp_rename N'${t(e.table)}.${t(e.from)}', N'${t(e.to)}', N'INDEX';`;
|
|
2452
2452
|
}, ci = (e) => {
|
|
@@ -2461,13 +2461,13 @@ BEGIN
|
|
|
2461
2461
|
t && t.type === "text" && !t.generatedAs && i.push(`ALTER TABLE ${Y(e)} ALTER COLUMN ${Y(n)} NVARCHAR(450) ${t.nullable ? "NULL" : "NOT NULL"};`);
|
|
2462
2462
|
}
|
|
2463
2463
|
return i;
|
|
2464
|
-
}, ui = (e) => `ALTER TABLE ${
|
|
2465
|
-
let t = e.fields.map((e) =>
|
|
2466
|
-
return `ALTER TABLE ${
|
|
2464
|
+
}, ui = (e) => `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(`${e.table}_${e.column}_key`)} UNIQUE (${G(e.column)});`, di = (e, t) => `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(`${e.table}_${e.column}_key`)} UNIQUE (${Xr(t, e.table, e.column)});`, fi = (e) => {
|
|
2465
|
+
let t = e.fields.map((e) => G(e)).join(", ");
|
|
2466
|
+
return `ALTER TABLE ${G(e.table)} ADD CONSTRAINT ${G(e.name)} UNIQUE (${t});`;
|
|
2467
2467
|
}, pi = (e, t) => {
|
|
2468
2468
|
let n = e.fields.map((n) => Xr(t, e.table, n)).join(", ");
|
|
2469
|
-
return `ALTER TABLE ${
|
|
2470
|
-
}, mi = (e) => `ALTER TABLE ${
|
|
2469
|
+
return `ALTER TABLE ${K(e.table)} ADD CONSTRAINT ${K(e.name)} UNIQUE (${n});`;
|
|
2470
|
+
}, mi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(e.name)};`, hi = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(e.name)};`, gi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_key`)};`, _i = (e) => `ALTER TABLE ${K(e.table)} DROP INDEX ${K(`${e.table}_${e.column}_key`)};`, vi = (e, t) => {
|
|
2471
2471
|
let n = [], r = t(e.table), i = t(e.column), a = t(e.targetTable), o = t(e.targetColumn);
|
|
2472
2472
|
if (e.orphanPolicy) {
|
|
2473
2473
|
let t = `${i} IS NOT NULL AND ${i} NOT IN (SELECT ${o} FROM ${a})`;
|
|
@@ -2485,10 +2485,10 @@ BEGIN
|
|
|
2485
2485
|
setNull: "SET NULL",
|
|
2486
2486
|
noAction: "NO ACTION"
|
|
2487
2487
|
}[e.onDelete]}`), n.push(s.join(" ") + ";"), n;
|
|
2488
|
-
}, yi = (e) => `ALTER TABLE ${
|
|
2488
|
+
}, yi = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_fkey`)};`, bi = (e) => `ALTER TABLE ${K(e.table)} DROP FOREIGN KEY ${K(`${e.table}_${e.column}_fkey`)};`, xi = (e, t) => {
|
|
2489
2489
|
let n = e.values.map((e) => `'${e.replace(/'/g, "''")}'`).join(", ");
|
|
2490
2490
|
return `ALTER TABLE ${t(e.table)} ADD CONSTRAINT ${t(`${e.table}_${e.column}_check`)} CHECK (${t(e.column)} IN (${n}));`;
|
|
2491
|
-
}, Si = (e) => `ALTER TABLE ${
|
|
2491
|
+
}, Si = (e) => `ALTER TABLE ${G(e.table)} DROP CONSTRAINT IF EXISTS ${G(`${e.table}_${e.column}_check`)};`, Ci = (e, t) => x.gen(function* () {
|
|
2492
2492
|
let n = yield* e`
|
|
2493
2493
|
SELECT cc.constraint_name AS n, cc.check_clause AS c
|
|
2494
2494
|
FROM information_schema.check_constraints cc
|
|
@@ -2501,18 +2501,18 @@ BEGIN
|
|
|
2501
2501
|
WHERE tc.table_schema = DATABASE() AND tc.table_name = ${t.table}`), x.orElseSucceed(() => []));
|
|
2502
2502
|
for (let e of n) {
|
|
2503
2503
|
let n = String(e.n ?? "");
|
|
2504
|
-
if (n !== "" &&
|
|
2504
|
+
if (n !== "" && Nn(String(e.c ?? ""))?.column === t.column) return n;
|
|
2505
2505
|
}
|
|
2506
2506
|
}), wi = (e, t, n) => x.gen(function* () {
|
|
2507
2507
|
let r = yield* Ci(e, t);
|
|
2508
|
-
r !== void 0 && (yield* X(e, `ALTER TABLE ${
|
|
2508
|
+
r !== void 0 && (yield* X(e, `ALTER TABLE ${K(t.table)} DROP CONSTRAINT ${K(r)};`, t.kind, [cr]));
|
|
2509
2509
|
let i = yield* Ci(e, t);
|
|
2510
2510
|
if (i === void 0) return;
|
|
2511
|
-
let a =
|
|
2511
|
+
let a = q(n, t.table, t.column);
|
|
2512
2512
|
if (!a) return yield* x.die(/* @__PURE__ */ Error(`applier: cannot drop the CHECK on '${t.table}.${t.column}' — it is column-level (catalog name '${i}'), which this family removes only by redefining the column, and the declared column is not available to redefine it from.`));
|
|
2513
|
-
yield* X(e, `ALTER TABLE ${
|
|
2513
|
+
yield* X(e, `ALTER TABLE ${K(t.table)} MODIFY COLUMN ${Sr(a, t.column)};`, t.kind);
|
|
2514
2514
|
}), Ti = (e, t, n, r) => {
|
|
2515
|
-
let i = e.column, a = r === "mariadb", o = a ?
|
|
2515
|
+
let i = e.column, a = r === "mariadb", o = a ? K : r === "mssql" ? Y : G, s = a ? pr(i) : r === "mssql" ? Ur(i) : r === "sqlite" ? Lr(i) : dr(i), c = r === "mssql" ? "ADD" : "ADD COLUMN", l = (e) => a ? Cr(e, i) : r === "mssql" ? Rr(e, "SYSUTCDATETIME()") : r === "sqlite" ? Rr(e, "CURRENT_TIMESTAMP") : Tr(e, i), u = Er(i, r);
|
|
2516
2516
|
if (u) {
|
|
2517
2517
|
let t = r === "mssql" ? `${o(i.name)} ${u}` : `${o(i.name)} ${s} ${u}`;
|
|
2518
2518
|
return {
|
|
@@ -2560,13 +2560,13 @@ BEGIN
|
|
|
2560
2560
|
...o
|
|
2561
2561
|
};
|
|
2562
2562
|
};
|
|
2563
|
-
}, X = (e, t, n, r = []) => e.unsafe(t).pipe(x.catchIf((e) =>
|
|
2563
|
+
}, X = (e, t, n, r = []) => e.unsafe(t).pipe(x.catchIf((e) => ir(e, r), () => x.void), x.tapError((e) => x.sync(() => {
|
|
2564
2564
|
process.stderr.write(ae(`applier: statement failed (op=${n})`, t, e, 400));
|
|
2565
2565
|
})), x.mapError((e) => {
|
|
2566
2566
|
let r = ae(`applier: statement failed (op=${n})`, t, e, 400).trim();
|
|
2567
2567
|
return Object.assign(e, { message: r });
|
|
2568
2568
|
}), x.map(() => void 0)), Z = (e, t, n) => x.forEach(t, (t) => X(e, t, n), { discard: !0 }), Q = (e, t) => e.literal(`LIMIT ${Math.max(1, Math.floor(Number.isFinite(t) ? t : 1))}`), $ = (e, t, r, i) => e.unsafe(`SELECT ${i === void 0 ? "*" : n(i, t)} FROM ${n(r, t)} WHERE 1=0`).pipe(x.as(!0), x.catchAll(() => x.succeed(!1))), Di = (e, t) => x.gen(function* () {
|
|
2569
|
-
let n =
|
|
2569
|
+
let n = I([Le], t).tables[0];
|
|
2570
2570
|
if (!n) return yield* x.die(/* @__PURE__ */ Error("migration applier: the resume-ledger table descriptor produced no snapshot. This is a framework bug."));
|
|
2571
2571
|
let r = {
|
|
2572
2572
|
kind: "create-table",
|
|
@@ -2574,7 +2574,7 @@ BEGIN
|
|
|
2574
2574
|
columns: n.columns,
|
|
2575
2575
|
indexes: []
|
|
2576
2576
|
}, i = yield* e.onDialectOrElse({
|
|
2577
|
-
mysql: () =>
|
|
2577
|
+
mysql: () => U(e).pipe(x.map((e) => Pr(r, e))),
|
|
2578
2578
|
mssql: () => x.succeed(Gr(r)),
|
|
2579
2579
|
sqlite: () => x.succeed(Br(r)),
|
|
2580
2580
|
orElse: () => x.succeed(kr(r))
|
|
@@ -2585,7 +2585,7 @@ BEGIN
|
|
|
2585
2585
|
${e("status")}, ${e("payload")}
|
|
2586
2586
|
FROM ${e(D)}
|
|
2587
2587
|
`, ki = (e, t, n, r) => x.gen(function* () {
|
|
2588
|
-
let i = yield*
|
|
2588
|
+
let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
|
|
2589
2589
|
yield* x.forEach(r, ({ index: r, planned: a }) => e`
|
|
2590
2590
|
INSERT INTO ${e(D)}
|
|
2591
2591
|
(${e("id")}, ${e("runId")}, ${e("planFingerprint")}, ${e("opIndex")},
|
|
@@ -2597,7 +2597,7 @@ BEGIN
|
|
|
2597
2597
|
${JSON.stringify(a)}, ${i})
|
|
2598
2598
|
`, { discard: !0 });
|
|
2599
2599
|
}), Ai = (e, t, n, r, i) => x.gen(function* () {
|
|
2600
|
-
let a = yield*
|
|
2600
|
+
let a = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
|
|
2601
2601
|
if (r === "applied") {
|
|
2602
2602
|
yield* e`
|
|
2603
2603
|
UPDATE ${e(D)}
|
|
@@ -2613,7 +2613,7 @@ BEGIN
|
|
|
2613
2613
|
WHERE ${e("runId")} = ${t} AND ${e("opIndex")} = ${n}
|
|
2614
2614
|
`;
|
|
2615
2615
|
}), ji = (e, t, n, r) => x.gen(function* () {
|
|
2616
|
-
let i = yield*
|
|
2616
|
+
let i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
|
|
2617
2617
|
r.length > 0 && (yield* e`
|
|
2618
2618
|
UPDATE ${e(D)}
|
|
2619
2619
|
SET ${e("status")} = ${"applied"}, ${e("appliedAt")} = ${i}
|
|
@@ -2639,12 +2639,12 @@ BEGIN
|
|
|
2639
2639
|
switch (o.kind) {
|
|
2640
2640
|
case "create-table": {
|
|
2641
2641
|
let t = yield* e.onDialectOrElse({
|
|
2642
|
-
mysql: () =>
|
|
2642
|
+
mysql: () => U(e).pipe(x.map((e) => Pr(o, e))),
|
|
2643
2643
|
mssql: () => x.succeed(Gr(o)),
|
|
2644
2644
|
sqlite: () => x.succeed(Br(o)),
|
|
2645
2645
|
orElse: () => x.succeed(kr(o))
|
|
2646
2646
|
}), n = yield* e.onDialectOrElse({
|
|
2647
|
-
mysql: () => x.succeed([
|
|
2647
|
+
mysql: () => x.succeed([ar]),
|
|
2648
2648
|
orElse: () => x.succeed([])
|
|
2649
2649
|
});
|
|
2650
2650
|
for (let r of t) yield* X(e, r, o.kind, n);
|
|
@@ -2653,30 +2653,30 @@ BEGIN
|
|
|
2653
2653
|
case "drop-table": {
|
|
2654
2654
|
let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString(), r = (e) => t ? Jr(o, n, e) : qr(o, e);
|
|
2655
2655
|
yield* e.onDialectOrElse({
|
|
2656
|
-
mysql: () => X(e, r(
|
|
2657
|
-
orElse: () => X(e, r(
|
|
2656
|
+
mysql: () => X(e, r(K), o.kind),
|
|
2657
|
+
orElse: () => X(e, r(G), o.kind)
|
|
2658
2658
|
});
|
|
2659
2659
|
break;
|
|
2660
2660
|
}
|
|
2661
2661
|
case "drop-column": {
|
|
2662
2662
|
let t = process.env.VOLTRO_SOFT_DROP === "1", n = (/* @__PURE__ */ new Date()).toISOString();
|
|
2663
2663
|
yield* e.onDialectOrElse({
|
|
2664
|
-
mysql: () =>
|
|
2665
|
-
sqlite: () => X(e, t ?
|
|
2666
|
-
orElse: () => X(e, t ?
|
|
2664
|
+
mysql: () => U(e).pipe(x.flatMap((r) => X(e, t ? vr(o, n, K) : gr(o, r), o.kind, t ? [] : [or]))),
|
|
2665
|
+
sqlite: () => X(e, t ? vr(o, n, G) : hr(o, G, !1), o.kind, t ? [] : [sr]),
|
|
2666
|
+
orElse: () => X(e, t ? vr(o, n, G) : hr(o, G), o.kind)
|
|
2667
2667
|
});
|
|
2668
2668
|
break;
|
|
2669
2669
|
}
|
|
2670
2670
|
case "rename-column":
|
|
2671
2671
|
yield* e.onDialectOrElse({
|
|
2672
|
-
mysql: () => X(e,
|
|
2672
|
+
mysql: () => X(e, _r(o, K), o.kind),
|
|
2673
2673
|
mssql: () => X(e, `EXEC sp_rename N'${o.table.replace(/'/g, "''")}.${o.from.replace(/'/g, "''")}', N'${o.to.replace(/'/g, "''")}', 'COLUMN';`, o.kind),
|
|
2674
|
-
orElse: () => X(e,
|
|
2674
|
+
orElse: () => X(e, _r(o, G), o.kind)
|
|
2675
2675
|
});
|
|
2676
2676
|
break;
|
|
2677
2677
|
case "add-index":
|
|
2678
2678
|
yield* e.onDialectOrElse({
|
|
2679
|
-
mysql: () =>
|
|
2679
|
+
mysql: () => U(e).pipe(x.flatMap((t) => X(e, $r(o, n.declared, t), o.kind, [ar]))),
|
|
2680
2680
|
mssql: () => Z(e, [...li(o.table, o.index.columns, n.declared), ci(o)], o.kind),
|
|
2681
2681
|
orElse: () => X(e, Qr(o, t.classification === "online-required"), o.kind)
|
|
2682
2682
|
});
|
|
@@ -2690,9 +2690,9 @@ BEGIN
|
|
|
2690
2690
|
break;
|
|
2691
2691
|
case "rename-table":
|
|
2692
2692
|
yield* e.onDialectOrElse({
|
|
2693
|
-
mysql: () => X(e, ri(o,
|
|
2693
|
+
mysql: () => X(e, ri(o, K), o.kind),
|
|
2694
2694
|
mssql: () => X(e, ii(o), o.kind),
|
|
2695
|
-
orElse: () => X(e, ri(o,
|
|
2695
|
+
orElse: () => X(e, ri(o, G), o.kind)
|
|
2696
2696
|
});
|
|
2697
2697
|
break;
|
|
2698
2698
|
case "rename-index":
|
|
@@ -2734,9 +2734,9 @@ BEGIN
|
|
|
2734
2734
|
break;
|
|
2735
2735
|
case "add-foreign-key":
|
|
2736
2736
|
yield* e.onDialectOrElse({
|
|
2737
|
-
mysql: () => Z(e, vi(o,
|
|
2737
|
+
mysql: () => Z(e, vi(o, K), o.kind),
|
|
2738
2738
|
sqlite: () => Z(e, J(o.table, n.declared), o.kind),
|
|
2739
|
-
orElse: () => Z(e, vi(o,
|
|
2739
|
+
orElse: () => Z(e, vi(o, G), o.kind)
|
|
2740
2740
|
});
|
|
2741
2741
|
break;
|
|
2742
2742
|
case "add-column": {
|
|
@@ -2786,41 +2786,41 @@ BEGIN
|
|
|
2786
2786
|
case "alter-column-nullability":
|
|
2787
2787
|
yield* e.onDialectOrElse({
|
|
2788
2788
|
mysql: () => {
|
|
2789
|
-
let t =
|
|
2790
|
-
return t ? X(e, `ALTER TABLE ${
|
|
2789
|
+
let t = q(n.declared, o.table, o.column);
|
|
2790
|
+
return t ? X(e, `ALTER TABLE ${K(o.table)} MODIFY COLUMN ${Sr(t, o.column, o.toNullable)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
|
|
2791
2791
|
},
|
|
2792
2792
|
mssql: () => {
|
|
2793
|
-
let t =
|
|
2793
|
+
let t = q(n.declared, o.table, o.column);
|
|
2794
2794
|
return t ? X(e, Vr(t, o.column, o.table, o.toNullable), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-nullability on mssql needs the declared column '${o.table}.${o.column}'.`));
|
|
2795
2795
|
},
|
|
2796
2796
|
sqlite: () => Z(e, J(o.table, n.declared), o.kind),
|
|
2797
|
-
orElse: () => X(e, `ALTER TABLE ${
|
|
2797
|
+
orElse: () => X(e, `ALTER TABLE ${G(o.table)} ALTER COLUMN ${G(o.column)} ${o.toNullable ? "DROP NOT NULL" : "SET NOT NULL"};`, o.kind)
|
|
2798
2798
|
});
|
|
2799
2799
|
break;
|
|
2800
2800
|
case "alter-column-default": {
|
|
2801
|
-
let t =
|
|
2801
|
+
let t = xr(n.declared, o.table, o.column);
|
|
2802
2802
|
yield* e.onDialectOrElse({
|
|
2803
|
-
mysql: () => X(e,
|
|
2803
|
+
mysql: () => X(e, yr(o, K, (e) => Cr(e, t)), o.kind),
|
|
2804
2804
|
mssql: () => X(e, Hr(o), o.kind),
|
|
2805
2805
|
sqlite: () => Z(e, J(o.table, n.declared), o.kind),
|
|
2806
|
-
orElse: () => X(e,
|
|
2806
|
+
orElse: () => X(e, yr(o, G, (e) => Tr(e, t)), o.kind)
|
|
2807
2807
|
});
|
|
2808
2808
|
break;
|
|
2809
2809
|
}
|
|
2810
2810
|
case "alter-column-type": {
|
|
2811
|
-
let r =
|
|
2811
|
+
let r = dr(xr(n.declared, o.table, o.column) ?? { type: o.to }), i = o.using ? ` USING ${o.using}` : "";
|
|
2812
2812
|
if (t.classification !== "online-required") {
|
|
2813
2813
|
yield* e.onDialectOrElse({
|
|
2814
2814
|
mysql: () => {
|
|
2815
|
-
let t =
|
|
2816
|
-
return t ? X(e, `ALTER TABLE ${
|
|
2815
|
+
let t = q(n.declared, o.table, o.column);
|
|
2816
|
+
return t ? X(e, `ALTER TABLE ${K(o.table)} MODIFY COLUMN ${Sr(t, o.column)};`, o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mariadb needs the declared column '${o.table}.${o.column}' (to render MODIFY COLUMN); it was not in ctx.declared.`));
|
|
2817
2817
|
},
|
|
2818
2818
|
mssql: () => {
|
|
2819
|
-
let t =
|
|
2819
|
+
let t = q(n.declared, o.table, o.column);
|
|
2820
2820
|
return t ? X(e, Vr(t, o.column, o.table), o.kind) : x.die(/* @__PURE__ */ Error(`alter-column-type on mssql needs the declared column '${o.table}.${o.column}'.`));
|
|
2821
2821
|
},
|
|
2822
2822
|
sqlite: () => Z(e, J(o.table, n.declared), o.kind),
|
|
2823
|
-
orElse: () => X(e, `ALTER TABLE ${
|
|
2823
|
+
orElse: () => X(e, `ALTER TABLE ${G(o.table)} ALTER COLUMN ${G(o.column)} TYPE ${r}${i};`, o.kind)
|
|
2824
2824
|
});
|
|
2825
2825
|
break;
|
|
2826
2826
|
}
|
|
@@ -2829,14 +2829,14 @@ BEGIN
|
|
|
2829
2829
|
orElse: () => x.void
|
|
2830
2830
|
});
|
|
2831
2831
|
let a = `${o.column}__shadow`, s = `${o.column}__old`;
|
|
2832
|
-
yield* e.unsafe(`ALTER TABLE ${
|
|
2833
|
-
let c = o.using ??
|
|
2832
|
+
yield* e.unsafe(`ALTER TABLE ${G(o.table)} ADD COLUMN ${G(a)} ${r}`);
|
|
2833
|
+
let c = o.using ?? G(o.column), l;
|
|
2834
2834
|
for (;;) {
|
|
2835
2835
|
let t = l === void 0 ? yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL ORDER BY ${e("id")} ${Q(e, 5e3)}` : yield* e`SELECT ${e("id")} FROM ${e(o.table)} WHERE ${e(a)} IS NULL AND ${e("id")} > ${l} ORDER BY ${e("id")} ${Q(e, 5e3)}`;
|
|
2836
2836
|
if (t.length === 0) break;
|
|
2837
|
-
yield* e.unsafe(`UPDATE ${
|
|
2837
|
+
yield* e.unsafe(`UPDATE ${G(o.table)} SET ${G(a)} = ${c} WHERE ${G(o.column)} IS NOT NULL AND ${G(a)} IS NULL AND ${G("id")} IN (${t.map((e) => `'${e.id.replace(/'/g, "''")}'`).join(",")})`), l = t[t.length - 1].id;
|
|
2838
2838
|
}
|
|
2839
|
-
yield* x.logInfo(`alter-column-type shadow ${o.table}.${o.column}: shadow populated`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${
|
|
2839
|
+
yield* x.logInfo(`alter-column-type shadow ${o.table}.${o.column}: shadow populated`).pipe(x.annotateLogs({ scope: "voltro:migrate" })), yield* e.unsafe(`ALTER TABLE ${G(o.table)} RENAME COLUMN ${G(o.column)} TO ${G(s)}`), yield* e.unsafe(`ALTER TABLE ${G(o.table)} RENAME COLUMN ${G(a)} TO ${G(o.column)}`), yield* e.unsafe(`ALTER TABLE ${G(o.table)} DROP COLUMN ${G(s)}`);
|
|
2840
2840
|
break;
|
|
2841
2841
|
}
|
|
2842
2842
|
case "drop-foreign-key":
|
|
@@ -2848,9 +2848,9 @@ BEGIN
|
|
|
2848
2848
|
break;
|
|
2849
2849
|
case "add-check":
|
|
2850
2850
|
yield* e.onDialectOrElse({
|
|
2851
|
-
mysql: () => X(e, xi(o,
|
|
2851
|
+
mysql: () => X(e, xi(o, K), o.kind),
|
|
2852
2852
|
sqlite: () => Z(e, J(o.table, n.declared), o.kind),
|
|
2853
|
-
orElse: () => X(e, xi(o,
|
|
2853
|
+
orElse: () => X(e, xi(o, G), o.kind)
|
|
2854
2854
|
});
|
|
2855
2855
|
break;
|
|
2856
2856
|
case "drop-check": yield* e.onDialectOrElse({
|
|
@@ -2900,7 +2900,7 @@ BEGIN
|
|
|
2900
2900
|
}), Ii = (e, t, n) => x.gen(function* () {
|
|
2901
2901
|
let r = t.operations.filter((e) => e.blocked);
|
|
2902
2902
|
if (r.length > 0) return yield* x.die(/* @__PURE__ */ Error(`applyPlan: refusing to execute — ${r.length} blocked operations. Run \`voltro db plan\` to see the fixes.`));
|
|
2903
|
-
yield*
|
|
2903
|
+
yield* E(e, { schema: n.lockSchema });
|
|
2904
2904
|
let i = Date.now(), a = [], o = Pe(e), s = Ie(o) === "plan-transactional", c = s ? t.operations.filter((e) => e.classification !== "online-required") : [], u = s ? t.operations.filter((e) => e.classification === "online-required") : t.operations, d = `plan_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`, f = u.map((e, t) => ({
|
|
2905
2905
|
index: t,
|
|
2906
2906
|
planned: e
|
|
@@ -2922,14 +2922,14 @@ BEGIN
|
|
|
2922
2922
|
a.push(o), yield* Ai(e, d, t, "applied", o.durationMs);
|
|
2923
2923
|
}
|
|
2924
2924
|
} finally {
|
|
2925
|
-
yield*
|
|
2925
|
+
yield* Me(e, { schema: n.lockSchema }).pipe(x.orDie);
|
|
2926
2926
|
}
|
|
2927
2927
|
let m = yield* n.replan(e);
|
|
2928
2928
|
if (m.operations.length > 0) {
|
|
2929
2929
|
let e = m.operations.slice(0, 10).map((e) => ` - ${e.op.kind} ${"table" in e.op ? e.op.table : ""}${"column" in e.op ? `.${String(e.op.column)}` : ""}`).join("\n");
|
|
2930
2930
|
return yield* x.die(/* @__PURE__ */ Error(`applyPlan: the migration did not converge. ${t.operations.length} operation(s) were executed without error, but re-planning against the live schema still finds ${m.operations.length}:\n${e}${m.operations.length > 10 ? `\n … and ${m.operations.length - 10} more` : ""}\nNo fingerprint was recorded — recording one would make the next boot report "schema up to date" for a schema that was never applied. This is a framework bug; the schema is unchanged and safe.\nTwo causes look identical from here, so read the list before assuming either:\n - the DDL for those operations is a no-op (it succeeded and changed nothing), or\n - the planner cannot see what the DDL did, so it proposes the same work again — which is what an\n operation naming an object a PREVIOUS operation created or renamed usually means.\nReport the operation kinds above with the column types involved.`));
|
|
2931
2931
|
}
|
|
2932
|
-
let h = a.filter((e) => e.status === "applied").length, g = Date.now() - i, _ = d, v = (/* @__PURE__ */ new Date()).toISOString(), y = yield*
|
|
2932
|
+
let h = a.filter((e) => e.status === "applied").length, g = Date.now() - i, _ = d, v = (/* @__PURE__ */ new Date()).toISOString(), y = yield* W(e, v), b = [...c, ...f.map((e) => e.planned)];
|
|
2933
2933
|
yield* e`
|
|
2934
2934
|
INSERT INTO ${e("_voltro_migration_plans")}
|
|
2935
2935
|
(${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
|
|
@@ -2960,7 +2960,7 @@ BEGIN
|
|
|
2960
2960
|
LIMIT 1
|
|
2961
2961
|
`.pipe(x.map((e) => e.length > 0 ? e[0].fingerprint : void 0), x.catchAll(() => x.succeed(void 0))), zi = (e, t, n) => x.gen(function* () {
|
|
2962
2962
|
if ((yield* Ri(e)) === t.toFingerprint) return "already-current";
|
|
2963
|
-
let r = `plan_${Date.now().toString(36)}`, i = yield*
|
|
2963
|
+
let r = `plan_${Date.now().toString(36)}`, i = yield* W(e, (/* @__PURE__ */ new Date()).toISOString());
|
|
2964
2964
|
return yield* e`
|
|
2965
2965
|
INSERT INTO ${e("_voltro_migration_plans")}
|
|
2966
2966
|
(${e("id")}, ${e("fingerprint")}, ${e("liveFingerprint")}, ${e("operations")},
|
|
@@ -2972,7 +2972,7 @@ BEGIN
|
|
|
2972
2972
|
${0}, ${i}, ${"no DDL — the declared schema already matched the database"})
|
|
2973
2973
|
`, "recorded";
|
|
2974
2974
|
}).pipe(x.catchAll(() => x.succeed("already-current"))), Bi = (e, t) => x.gen(function* () {
|
|
2975
|
-
let n = P(
|
|
2975
|
+
let n = P(I(t, Pe(e))), r = yield* Ri(e);
|
|
2976
2976
|
return r === n ? {
|
|
2977
2977
|
kind: "up-to-date",
|
|
2978
2978
|
fingerprint: n
|
|
@@ -3018,24 +3018,24 @@ BEGIN
|
|
|
3018
3018
|
let { blocked: n, ...r } = e;
|
|
3019
3019
|
return r;
|
|
3020
3020
|
})
|
|
3021
|
-
}), Ji = (e, t, n) => t === "postgres" ?
|
|
3022
|
-
let t =
|
|
3021
|
+
}), Ji = (e, t, n) => t === "postgres" ? Yt(e, n).pipe(x.flatMap((e) => {
|
|
3022
|
+
let t = Xt(e);
|
|
3023
3023
|
return t === void 0 ? x.void : x.logWarning(`auto-migrate: ${t}`).pipe(x.annotateLogs({ scope: "voltro:migrate" }));
|
|
3024
3024
|
}), x.catchAll(() => x.void)) : x.void, Yi = (e, t, n) => x.gen(function* () {
|
|
3025
3025
|
let r = Pe(e), i = t;
|
|
3026
3026
|
if (process.env.VOLTRO_MIGRATE_FORCE !== "1") {
|
|
3027
|
-
let t = P(
|
|
3027
|
+
let t = P(I(i, r));
|
|
3028
3028
|
if ((yield* Ri(e)) === t) return yield* Ji(e, r, i), {
|
|
3029
3029
|
kind: "up-to-date",
|
|
3030
3030
|
fingerprint: t
|
|
3031
3031
|
};
|
|
3032
3032
|
}
|
|
3033
|
-
let a = yield*
|
|
3033
|
+
let a = yield* Qn(e), o = yield* Ui(e, a.tables);
|
|
3034
3034
|
o.length > 0 && (yield* x.logInfo(`auto-migrate: reaped ${o.length} test-fixture leftover(s)`).pipe(x.annotateLogs({
|
|
3035
3035
|
scope: "voltro:migrate",
|
|
3036
3036
|
count: o.length
|
|
3037
|
-
})), a = yield*
|
|
3038
|
-
let s = new Set(t.map((e) => e.tableName)), c = (e) => e.filter((e) => !m(e.name) || s.has(e.name)), l =
|
|
3037
|
+
})), a = yield* Qn(e));
|
|
3038
|
+
let s = new Set(t.map((e) => e.tableName)), c = (e) => e.filter((e) => !m(e.name) || s.has(e.name)), l = Mn({
|
|
3039
3039
|
declared: i,
|
|
3040
3040
|
live: { tables: c(a.tables) },
|
|
3041
3041
|
dialect: r,
|
|
@@ -3063,8 +3063,8 @@ BEGIN
|
|
|
3063
3063
|
environment: n.environment === "prod" ? "dev" : n.environment,
|
|
3064
3064
|
source: "auto-diff",
|
|
3065
3065
|
replan: (e) => x.gen(function* () {
|
|
3066
|
-
let t = yield*
|
|
3067
|
-
return
|
|
3066
|
+
let t = yield* Qn(e);
|
|
3067
|
+
return Mn({
|
|
3068
3068
|
declared: i,
|
|
3069
3069
|
live: { tables: c(t.tables) },
|
|
3070
3070
|
dialect: r,
|
|
@@ -3080,12 +3080,12 @@ BEGIN
|
|
|
3080
3080
|
}) : n.environment === "prod" ? Bi(e, t) : Yi(e, t, n), Zi = (e, t) => {
|
|
3081
3081
|
switch (e.kind) {
|
|
3082
3082
|
case "skipped": return `auto-migrate: skipped (${e.reason})`;
|
|
3083
|
-
case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${
|
|
3083
|
+
case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${F(e.fingerprint)})`;
|
|
3084
3084
|
case "applied": {
|
|
3085
3085
|
let t = e.plan.summary;
|
|
3086
|
-
return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${
|
|
3086
|
+
return `auto-migrate: applied ${e.applied.appliedOps} op(s) in ${e.applied.durationMs}ms [safe=${t.safe} needs-default=${t.needsDefault} needs-backfill=${t.needsBackfill} rename=${t.needsRenameAnnotation} lossy=${t.lossy}] fingerprint=${F(e.applied.fingerprint)}`;
|
|
3087
3087
|
}
|
|
3088
|
-
case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${
|
|
3088
|
+
case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${F(e.expected)}` + (e.actual ? ` live=${F(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
|
|
3089
3089
|
case "refused-blocked": {
|
|
3090
3090
|
let t = e.plan.operations.filter((e) => e.blocked), n = t.filter((e) => e.op.kind === "drop-table").length, r = t.filter((e) => e.op.kind === "drop-table").map((e) => "table" in e.op ? e.op.table : "").filter(Boolean), i = t.filter((e) => e.op.kind === "add-column").length, a = t.filter((e) => e.op.kind === "drop-column").length, o = t.filter((e) => e.classification === "needs-rename-annotation").length, s = `auto-migrate: REFUSED — ${e.plan.summary.blocked} blocked operation(s):\n` + Li(e.plan), c = [""];
|
|
3091
3091
|
if (n > 0 && c.push(`${n} table(s) exist in the live DB but aren't in your declared schema.`, "This is usually one of three things:", " (a) You're iterating on the schema — the table file got renamed, moved, or temporarily commented out.", " → Restore the declaration. Your data stays intact.", " (b) You want to KEEP the table but NOT manage it with Voltro (a leftover from another tool —", " a Strapi/Rails/legacy migration artifact, or an externally-owned table).", ` → Set \`VOLTRO_DB_IGNORE_TABLES=${r.join(",")}\` (comma-separated).`, " The planner excludes those tables from the diff entirely — it never drops them, and they", " stop blocking your OTHER (additive) changes. This is the fix when a leftover freezes your schema.", " (c) You actually want to drop the table.", ` → Set \`VOLTRO_DESTRUCTIVE_OK=${r.join(",")}\` for ONE run — it acknowledges`, " the data loss for THOSE tables only; every other lossy op in this plan stays blocked.", " (`VOLTRO_DESTRUCTIVE_OK=1` acknowledges all of them, which is rarely what you mean.)", " There is deliberately no `dropped()` marker for a TABLE, unlike for a column: a", " dropped column leaves a slot worth documenting in the declaration, a dropped table", " leaves nothing — the marker would be a dead entry you must remember to delete.", " Soft-drop: set `VOLTRO_SOFT_DROP=1` alongside DESTRUCTIVE_OK to RENAME instead of DROP", " (data survives as `<name>__dropped_<ts>` for ~7d; restorable via `voltro db restore-snapshot`)."), i > 0 && c.push(`${i} required column(s) need a backfill strategy before adding to a populated table.`, " → Annotate the column: `.backfill(sql`<expr>`)` or `.backfill(row => <fn>)` or `.default(<value>)`.", " Existing rows get the backfill value; the column then lands as NOT NULL."), a > 0) {
|
|
@@ -3173,7 +3173,7 @@ BEGIN
|
|
|
3173
3173
|
});
|
|
3174
3174
|
let c = Date.now() - i;
|
|
3175
3175
|
!x.isEffect(s) && c < 2 && (yield* x.logWarning(`migration ${t.migration.id}: up() resolved in ${c}ms — did the body \`await\` an \`@effect/sql\` Effect by accident? \`sql.unsafe(...)\` returns an Effect, not a Promise; \`await\` on it is a silent no-op. Switch the body to \`Effect.gen(function* () { yield* sql.unsafe(...) })\` form.`).pipe(x.annotateLogs({ scope: `migrations:file:${t.migration.id}` })));
|
|
3176
|
-
let l = yield*
|
|
3176
|
+
let l = yield* W(e, a);
|
|
3177
3177
|
return yield* e`
|
|
3178
3178
|
INSERT INTO ${e("_voltro_migration_plans")}
|
|
3179
3179
|
(${e("id")}, ${e("fingerprint")}, ${e("operations")},
|
|
@@ -3215,7 +3215,7 @@ BEGIN
|
|
|
3215
3215
|
applied: [],
|
|
3216
3216
|
skipped: r
|
|
3217
3217
|
};
|
|
3218
|
-
yield*
|
|
3218
|
+
yield* E(e, { schema: t.lockSchema });
|
|
3219
3219
|
let i = [];
|
|
3220
3220
|
try {
|
|
3221
3221
|
for (let r of n) {
|
|
@@ -3235,7 +3235,7 @@ BEGIN
|
|
|
3235
3235
|
}));
|
|
3236
3236
|
}
|
|
3237
3237
|
} finally {
|
|
3238
|
-
yield*
|
|
3238
|
+
yield* Me(e, { schema: t.lockSchema }).pipe(x.orDie);
|
|
3239
3239
|
}
|
|
3240
3240
|
return {
|
|
3241
3241
|
applied: i,
|
|
@@ -3256,7 +3256,7 @@ BEGIN
|
|
|
3256
3256
|
catch: (e) => e
|
|
3257
3257
|
})).find((e) => e.migration.id === t.id);
|
|
3258
3258
|
if (!r) return yield* x.fail(/* @__PURE__ */ Error(`rollback: file for migration ${t.id} not found on disk under ${t.projectRoot}/migrations/`));
|
|
3259
|
-
yield*
|
|
3259
|
+
yield* E(e, { schema: t.lockSchema });
|
|
3260
3260
|
let i = Date.now();
|
|
3261
3261
|
try {
|
|
3262
3262
|
let n = {
|
|
@@ -3283,7 +3283,7 @@ BEGIN
|
|
|
3283
3283
|
durationMs: o
|
|
3284
3284
|
};
|
|
3285
3285
|
} finally {
|
|
3286
|
-
yield*
|
|
3286
|
+
yield* Me(e, { schema: t.lockSchema }).pipe(x.orDie);
|
|
3287
3287
|
}
|
|
3288
3288
|
}), la = (e) => x.gen(function* () {
|
|
3289
3289
|
let t = yield* C.SqlClient, n = yield* t`
|
|
@@ -3539,4 +3539,4 @@ BEGIN
|
|
|
3539
3539
|
values: [...t]
|
|
3540
3540
|
}), Sa = (e) => typeof e == "object" && !!e && e._tag === "RawSqlFragment";
|
|
3541
3541
|
//#endregion
|
|
3542
|
-
export { O as DEFAULT_CDC_CHANNEL, d as FILE_MIGRATION_PATTERN, na as FileMigrationLedgerError, Je as REACTIVE_TRIGGER_PREFIX, pe as VOLTRO_MIGRATION_LOCK_KEY,
|
|
3542
|
+
export { O as DEFAULT_CDC_CHANNEL, d as FILE_MIGRATION_PATTERN, na as FileMigrationLedgerError, Je as REACTIVE_TRIGGER_PREFIX, pe as VOLTRO_MIGRATION_LOCK_KEY, E as acquireMigrationLock, W as appliedAtValue, Lt as applyNamespacedSchema, Ii as applyPlan, Dt as applySchema, pa as assessRollingDeployGate, va as branchRehearsalExitCode, Bn as chunkTables, da as classifyRollingDeploySafety, I as declaredSnapshot, et as defaultArrayClause, $e as defaultClause, j as defaultJsonClause, Zi as describeOutcome, Gi as destructiveScope, Yt as detectReactiveTriggerDrift, $r as emitAddIndexMysql, Pr as emitCreateTableMysql, hr as emitDropColumnDdl, gr as emitDropColumnDdlMysql, Et as emitFrameworkBootstrapSql, wt as emitNamespaceProvisionDdl, Tt as emitNamespacedSchemaSql, Ct as emitSchemaSql, $n as engineFromVersion, P as fingerprintSchema, ye as fnv1a64, ba as formatBranchRehearsal, Xt as formatReactiveTriggerDrift, Wi as ignoreTablesFromEnv, Qn as introspectSchema, ir as isAlreadySatisfied, c as isFileMigration, Sa as isRawSqlFragment, kt as isReRunSafeDdl, Pn as mapPgType, g as migration, be as migrationLockKeyForSchema, T as migrationLockNameForSchema, Yr as mysqlIndexPrefixFor, Xe as notifyFunctionName, M as numericIdSql, Nn as parseEnumCheck, aa as pendingFileMigrationIds, Mn as planMigrations, Rt as provisionTenantNamespace, Ye as reactiveTriggerName, mt as reactiveTriggerRepairSql, zi as recordUpToDate, _a as rehearseMigrationOnBranch, ha as rehearsedOperation, Me as releaseMigrationLock, Mr as renderColumnMysql, Dr as renderColumnPg, he as resolveMigrationLockSchema, U as resolveMysqlEngine, ca as rollbackFileBasedMigration, fa as rollingDeployUnsafeOps, oa as runFileBasedMigrations, zt as runFrameworkBootstrap, It as runMigrate, Xi as runPlannedMigrations, F as shortFingerprint, Gt as snapshotColumn, xa as sql, A as sqlType, la as squashMigrationPlans, qi as unblockLossy, Ne as withMigrationLock };
|