@niscorp/strata 0.1.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/DESIGN.md +208 -0
- package/LICENSE +202 -0
- package/README.md +195 -0
- package/dist/check/index.cjs +223 -0
- package/dist/check/index.cjs.map +1 -0
- package/dist/check/index.d.cts +63 -0
- package/dist/check/index.d.ts +63 -0
- package/dist/check/index.js +4 -0
- package/dist/check/index.js.map +1 -0
- package/dist/chunk-EGFF63GA.js +16 -0
- package/dist/chunk-EGFF63GA.js.map +1 -0
- package/dist/chunk-HMT7HHFJ.js +156 -0
- package/dist/chunk-HMT7HHFJ.js.map +1 -0
- package/dist/chunk-ICWKTTKN.js +129 -0
- package/dist/chunk-ICWKTTKN.js.map +1 -0
- package/dist/chunk-MY3TGSV3.js +206 -0
- package/dist/chunk-MY3TGSV3.js.map +1 -0
- package/dist/chunk-U5CPF4LQ.js +175 -0
- package/dist/chunk-U5CPF4LQ.js.map +1 -0
- package/dist/documents-BjlM94Ea.d.cts +90 -0
- package/dist/documents-BjlM94Ea.d.ts +90 -0
- package/dist/index.cjs +370 -0
- package/dist/index.cjs.map +1 -0
- package/dist/index.d.cts +16 -0
- package/dist/index.d.ts +16 -0
- package/dist/index.js +42 -0
- package/dist/index.js.map +1 -0
- package/dist/node/index.cjs +629 -0
- package/dist/node/index.cjs.map +1 -0
- package/dist/node/index.d.cts +19 -0
- package/dist/node/index.d.ts +19 -0
- package/dist/node/index.js +164 -0
- package/dist/node/index.js.map +1 -0
- package/dist/plan-BAewc8DG.d.ts +53 -0
- package/dist/plan-BEIlXVUt.d.cts +53 -0
- package/dist/postgres/index.cjs +333 -0
- package/dist/postgres/index.cjs.map +1 -0
- package/dist/postgres/index.d.cts +44 -0
- package/dist/postgres/index.d.ts +44 -0
- package/dist/postgres/index.js +145 -0
- package/dist/postgres/index.js.map +1 -0
- package/dist/upgrade/index.cjs +236 -0
- package/dist/upgrade/index.cjs.map +1 -0
- package/dist/upgrade/index.d.cts +54 -0
- package/dist/upgrade/index.d.ts +54 -0
- package/dist/upgrade/index.js +5 -0
- package/dist/upgrade/index.js.map +1 -0
- package/package.json +94 -0
package/dist/index.cjs
ADDED
|
@@ -0,0 +1,370 @@
|
|
|
1
|
+
'use strict';
|
|
2
|
+
|
|
3
|
+
var zod = require('zod');
|
|
4
|
+
|
|
5
|
+
// src/schema.ts
|
|
6
|
+
var SEQUENCE_ID = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+$/;
|
|
7
|
+
var MIGRATION_REF = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+\/[1-9][0-9]*$/;
|
|
8
|
+
var KIND_NAME = /^[a-z][a-z0-9-]*$/;
|
|
9
|
+
var KIND_REF = /^[a-z][a-z0-9-]*(\.[a-z][a-z0-9-]*)+\/[a-z][a-z0-9-]*$/;
|
|
10
|
+
var EMBED_PATH = /^([A-Za-z_$][\w$]*|\*)(\[\])?(\.([A-Za-z_$][\w$]*|\*)(\[\])?)*$/;
|
|
11
|
+
var SqlStepSchema = zod.z.object({
|
|
12
|
+
kind: zod.z.literal("sql"),
|
|
13
|
+
sql: zod.z.string().min(1).describe(
|
|
14
|
+
"ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string carrying several \u2014 split them into steps rather than joining them with semicolons."
|
|
15
|
+
)
|
|
16
|
+
}).strict().describe("A statement run against the database, inside the migration transaction.");
|
|
17
|
+
var DocumentStepSchema = zod.z.object({
|
|
18
|
+
kind: zod.z.literal("document"),
|
|
19
|
+
at: zod.z.string().regex(KIND_REF).describe('The kind of document this step rewrites, e.g. "nisc.nova/layout" \u2014 wherever one sits, at any depth.'),
|
|
20
|
+
transform: zod.z.unknown().describe(
|
|
21
|
+
"A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the grammar's embeddings and rewritten on their own, deepest first \u2014 a transform only ever sees one flat node."
|
|
22
|
+
)
|
|
23
|
+
}).strict().describe("A rewrite of stored JSON documents of one kind.");
|
|
24
|
+
var StepSchema = zod.z.discriminatedUnion("kind", [SqlStepSchema, DocumentStepSchema]);
|
|
25
|
+
var DocumentKindSchema = zod.z.object({
|
|
26
|
+
embeds: zod.z.record(zod.z.string().regex(EMBED_PATH), zod.z.string().regex(KIND_REF)).optional().describe("Where other documents sit inside this one: path \u2192 the kind found there (possibly this kind itself).")
|
|
27
|
+
}).strict();
|
|
28
|
+
var MigrationSchema = zod.z.object({
|
|
29
|
+
description: zod.z.string().min(1).describe("One sentence: what this migration does. It is the changelog line and the ledger's description."),
|
|
30
|
+
steps: zod.z.array(StepSchema).describe(
|
|
31
|
+
"Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: the version moves and nothing runs \u2014 how an addition to a strict grammar tells older readers to refuse."
|
|
32
|
+
),
|
|
33
|
+
dependsOn: zod.z.array(zod.z.string().regex(MIGRATION_REF)).optional().describe('Migrations of OTHER sequences that must be applied first, each as "<sequence>/<n>".')
|
|
34
|
+
}).strict();
|
|
35
|
+
var SequenceSchema = zod.z.object({
|
|
36
|
+
id: zod.z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. "nisc.vex.cache" or "midas.app".'),
|
|
37
|
+
documents: zod.z.record(zod.z.string().regex(KIND_NAME), DocumentKindSchema).optional().describe('The document kinds this sequence owns (a GRAMMAR sequence), each named "<id>/<kind>" elsewhere.'),
|
|
38
|
+
migrations: zod.z.array(MigrationSchema).describe("Append-only. A migration is numbered by its position (from 1); the sequence's version is its length.")
|
|
39
|
+
}).strict().superRefine((sequence, ctx) => {
|
|
40
|
+
const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));
|
|
41
|
+
if (kinds.has("sql") && (kinds.has("document") || sequence.documents !== void 0)) {
|
|
42
|
+
ctx.addIssue({
|
|
43
|
+
code: "custom",
|
|
44
|
+
message: "A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both."
|
|
45
|
+
});
|
|
46
|
+
}
|
|
47
|
+
});
|
|
48
|
+
|
|
49
|
+
// src/checksum.ts
|
|
50
|
+
var canonical = (value) => {
|
|
51
|
+
if (Array.isArray(value)) return `[${value.map(canonical).join(",")}]`;
|
|
52
|
+
if (value !== null && typeof value === "object") {
|
|
53
|
+
const entries = Object.entries(value).filter(([, v]) => v !== void 0).sort(([a], [b]) => a < b ? -1 : a > b ? 1 : 0);
|
|
54
|
+
return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(",")}}`;
|
|
55
|
+
}
|
|
56
|
+
return JSON.stringify(value);
|
|
57
|
+
};
|
|
58
|
+
var effectOf = (sql) => sql.split("\n").filter((line) => !line.trimStart().startsWith("--")).map((line) => line.trimEnd()).join("\n").trim();
|
|
59
|
+
var checksumOf = async (migration) => {
|
|
60
|
+
const steps = migration.steps.map((step) => step.kind === "sql" ? { ...step, sql: effectOf(step.sql) } : step);
|
|
61
|
+
const bytes = new TextEncoder().encode(canonical(steps));
|
|
62
|
+
const digest = await crypto.subtle.digest("SHA-256", bytes);
|
|
63
|
+
return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, "0")).join("");
|
|
64
|
+
};
|
|
65
|
+
|
|
66
|
+
// src/errors.ts
|
|
67
|
+
var StrataError = class extends Error {
|
|
68
|
+
code;
|
|
69
|
+
details;
|
|
70
|
+
constructor(code, message, details = [], options) {
|
|
71
|
+
super(details.length > 0 ? `${message}
|
|
72
|
+
${details.map((d) => ` ${d}`).join("\n")}` : message, options);
|
|
73
|
+
this.name = "StrataError";
|
|
74
|
+
this.code = code;
|
|
75
|
+
this.details = details;
|
|
76
|
+
}
|
|
77
|
+
};
|
|
78
|
+
|
|
79
|
+
// src/plan.ts
|
|
80
|
+
var refOf = (sequence, n) => `${sequence}/${n}`;
|
|
81
|
+
var prepare = async (sequences) => {
|
|
82
|
+
const seen = /* @__PURE__ */ new Set();
|
|
83
|
+
const prepared = [];
|
|
84
|
+
for (const input of sequences) {
|
|
85
|
+
const parsed = SequenceSchema.safeParse(input);
|
|
86
|
+
if (!parsed.success) {
|
|
87
|
+
const issues = parsed.error.issues.map((i) => `${i.path.join(".") || "(root)"}: ${i.message}`);
|
|
88
|
+
throw new StrataError("INVALID_SEQUENCE", `A sequence does not parse${typeof input.id === "string" ? ` ("${input.id}")` : ""}.`, issues);
|
|
89
|
+
}
|
|
90
|
+
const sequence = parsed.data;
|
|
91
|
+
if (seen.has(sequence.id)) {
|
|
92
|
+
throw new StrataError("INVALID_SEQUENCE", `Two sequences are both called "${sequence.id}" \u2014 a sequence id names one owner.`);
|
|
93
|
+
}
|
|
94
|
+
seen.add(sequence.id);
|
|
95
|
+
const migrations = [];
|
|
96
|
+
for (const [index, migration] of sequence.migrations.entries()) {
|
|
97
|
+
const n = index + 1;
|
|
98
|
+
migrations.push({
|
|
99
|
+
sequence: sequence.id,
|
|
100
|
+
n,
|
|
101
|
+
ref: refOf(sequence.id, n),
|
|
102
|
+
description: migration.description,
|
|
103
|
+
checksum: await checksumOf(migration),
|
|
104
|
+
steps: migration.steps,
|
|
105
|
+
dependsOn: migration.dependsOn ?? []
|
|
106
|
+
});
|
|
107
|
+
}
|
|
108
|
+
const grammar = sequence.documents !== void 0 || sequence.migrations.some((m) => m.steps.some((s) => s.kind === "document"));
|
|
109
|
+
prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });
|
|
110
|
+
}
|
|
111
|
+
return prepared;
|
|
112
|
+
};
|
|
113
|
+
var orderPending = (queues, alreadyDone) => {
|
|
114
|
+
const done = new Set(alreadyDone);
|
|
115
|
+
const waiting = queues.map((q) => [...q.waiting]);
|
|
116
|
+
const pending = [];
|
|
117
|
+
let moved = true;
|
|
118
|
+
while (moved) {
|
|
119
|
+
moved = false;
|
|
120
|
+
for (const queue of waiting) {
|
|
121
|
+
for (let head = queue[0]; head !== void 0; head = queue[0]) {
|
|
122
|
+
if (!head.dependsOn.every((d) => done.has(d))) break;
|
|
123
|
+
pending.push(head);
|
|
124
|
+
done.add(head.ref);
|
|
125
|
+
queue.shift();
|
|
126
|
+
moved = true;
|
|
127
|
+
}
|
|
128
|
+
}
|
|
129
|
+
}
|
|
130
|
+
return { pending, stuck: waiting.flat() };
|
|
131
|
+
};
|
|
132
|
+
var planMigrations = (sequences, ledger) => {
|
|
133
|
+
const problems = [];
|
|
134
|
+
const applied = {};
|
|
135
|
+
const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));
|
|
136
|
+
const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));
|
|
137
|
+
const queues = [];
|
|
138
|
+
for (const sequence of sequences) {
|
|
139
|
+
const rows = ledger.filter((row) => row.sequence === sequence.id);
|
|
140
|
+
applied[sequence.id] = rows.length;
|
|
141
|
+
const beyond = rows.filter((row) => row.n > sequence.migrations.length);
|
|
142
|
+
if (beyond.length > 0) {
|
|
143
|
+
problems.push({
|
|
144
|
+
code: "TOO_NEW",
|
|
145
|
+
detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} \u2014 it was migrated by newer code.`
|
|
146
|
+
});
|
|
147
|
+
}
|
|
148
|
+
const waiting = [];
|
|
149
|
+
for (const migration of sequence.migrations) {
|
|
150
|
+
const row = byRef.get(migration.ref);
|
|
151
|
+
if (row === void 0) {
|
|
152
|
+
waiting.push(migration);
|
|
153
|
+
} else if (row.checksum !== migration.checksum) {
|
|
154
|
+
problems.push({
|
|
155
|
+
code: "EDITED",
|
|
156
|
+
detail: `${migration.ref} ("${migration.description}") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history \u2014 append a new one.`
|
|
157
|
+
});
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
const firstWaiting = waiting[0];
|
|
161
|
+
if (firstWaiting !== void 0 && rows.some((row) => row.n > firstWaiting.n)) {
|
|
162
|
+
problems.push({ code: "EDITED", detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });
|
|
163
|
+
}
|
|
164
|
+
queues.push({ id: sequence.id, waiting });
|
|
165
|
+
}
|
|
166
|
+
const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));
|
|
167
|
+
for (const { waiting } of queues) {
|
|
168
|
+
for (const migration of waiting) {
|
|
169
|
+
for (const dependency of migration.dependsOn) {
|
|
170
|
+
if (!done.has(dependency) && !provided.has(dependency)) {
|
|
171
|
+
problems.push({ code: "UNKNOWN_DEPENDENCY", detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });
|
|
172
|
+
}
|
|
173
|
+
}
|
|
174
|
+
}
|
|
175
|
+
}
|
|
176
|
+
const { pending, stuck } = orderPending(queues, done);
|
|
177
|
+
if (stuck.length > 0 && !problems.some((p) => p.code === "UNKNOWN_DEPENDENCY")) {
|
|
178
|
+
problems.push({ code: "CYCLE", detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(", ")}.` });
|
|
179
|
+
}
|
|
180
|
+
return { applied, pending, problems };
|
|
181
|
+
};
|
|
182
|
+
var refuseProblems = (plan) => {
|
|
183
|
+
const first = plan.problems[0];
|
|
184
|
+
if (first === void 0) return;
|
|
185
|
+
throw new StrataError(first.code, "The migrations cannot be applied safely.", plan.problems.map((p) => `${p.code}: ${p.detail}`));
|
|
186
|
+
};
|
|
187
|
+
|
|
188
|
+
// src/documents.ts
|
|
189
|
+
var isRecord = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
|
|
190
|
+
var pathText = (path) => path.reduce((text, key) => typeof key === "number" ? `${text}[${key}]` : text === "" ? key : `${text}.${key}`, "");
|
|
191
|
+
var reach = (value, pattern) => {
|
|
192
|
+
let frontier = [{ path: [], value }];
|
|
193
|
+
for (const segment of pattern.split(".")) {
|
|
194
|
+
const array = segment.endsWith("[]");
|
|
195
|
+
const key = array ? segment.slice(0, -2) : segment;
|
|
196
|
+
const next = [];
|
|
197
|
+
for (const at of frontier) {
|
|
198
|
+
if (!isRecord(at.value)) continue;
|
|
199
|
+
const found = key === "*" ? Object.entries(at.value).map(([k, v]) => ({ path: [...at.path, k], value: v })) : key in at.value ? [{ path: [...at.path, key], value: at.value[key] }] : [];
|
|
200
|
+
for (const f of found) {
|
|
201
|
+
if (!array) next.push(f);
|
|
202
|
+
else if (Array.isArray(f.value)) f.value.forEach((item, i) => next.push({ path: [...f.path, i], value: item }));
|
|
203
|
+
}
|
|
204
|
+
}
|
|
205
|
+
frontier = next;
|
|
206
|
+
}
|
|
207
|
+
return frontier;
|
|
208
|
+
};
|
|
209
|
+
var getAt = (root, path) => path.reduce((at, key) => {
|
|
210
|
+
if (typeof key === "number") return Array.isArray(at) ? at[key] : void 0;
|
|
211
|
+
return isRecord(at) ? at[key] : void 0;
|
|
212
|
+
}, root);
|
|
213
|
+
var setAt = (root, path, value) => {
|
|
214
|
+
const [head, ...rest] = path;
|
|
215
|
+
if (head === void 0) return value;
|
|
216
|
+
if (typeof head === "number" && Array.isArray(root)) return root.map((item, i) => i === head ? setAt(item, rest, value) : item);
|
|
217
|
+
if (typeof head === "string" && isRecord(root)) return { ...root, [head]: setAt(root[head], rest, value) };
|
|
218
|
+
return root;
|
|
219
|
+
};
|
|
220
|
+
var createUpgrader = async (sequences, options) => {
|
|
221
|
+
const prepared = await prepare(sequences);
|
|
222
|
+
const tables = prepared.filter((s) => !s.grammar);
|
|
223
|
+
if (tables.length > 0) {
|
|
224
|
+
throw new StrataError(
|
|
225
|
+
"WRONG_OWNER",
|
|
226
|
+
"Documents are upgraded by grammar sequences; these own tables and belong to a database's ledger (`migrate`).",
|
|
227
|
+
tables.map((s) => s.id)
|
|
228
|
+
);
|
|
229
|
+
}
|
|
230
|
+
const grammars = prepared;
|
|
231
|
+
const kinds = /* @__PURE__ */ new Map();
|
|
232
|
+
for (const sequence of grammars) {
|
|
233
|
+
for (const [name, kind] of Object.entries(sequence.documents)) kinds.set(`${sequence.id}/${name}`, kind);
|
|
234
|
+
}
|
|
235
|
+
const unknown = [
|
|
236
|
+
...grammars.flatMap((s) => s.migrations.flatMap((m) => m.steps.flatMap((step) => step.kind === "document" && !kinds.has(step.at) ? [`${m.ref} rewrites ${step.at}`] : []))),
|
|
237
|
+
...[...kinds].flatMap(([ref, kind]) => Object.entries(kind.embeds ?? {}).flatMap(([path, target]) => kinds.has(target) ? [] : [`${ref} embeds ${target} at ${path}`]))
|
|
238
|
+
];
|
|
239
|
+
if (unknown.length > 0) throw new StrataError("UNKNOWN_KIND", "A document kind is named that no sequence declares.", unknown);
|
|
240
|
+
const stamp = Object.fromEntries(grammars.map((s) => [s.id, s.migrations.length]));
|
|
241
|
+
const locate = (document, kind) => {
|
|
242
|
+
if (!kinds.has(kind)) throw new StrataError("UNKNOWN_KIND", `No sequence declares the document kind "${kind}".`, [...kinds.keys()]);
|
|
243
|
+
const found = [];
|
|
244
|
+
const visit = (value, at, path) => {
|
|
245
|
+
if (!isRecord(value)) return;
|
|
246
|
+
found.push({ path, kind: at, value });
|
|
247
|
+
for (const [pattern, target] of Object.entries(kinds.get(at)?.embeds ?? {})) {
|
|
248
|
+
for (const hit of reach(value, pattern)) visit(hit.value, target, [...path, ...hit.path]);
|
|
249
|
+
}
|
|
250
|
+
};
|
|
251
|
+
visit(document, kind, []);
|
|
252
|
+
return found;
|
|
253
|
+
};
|
|
254
|
+
const positionOf = (given, id) => given?.[id] ?? 0;
|
|
255
|
+
const behind = (given) => {
|
|
256
|
+
const ahead = grammars.filter((s) => positionOf(given, s.id) > s.migrations.length);
|
|
257
|
+
if (ahead.length > 0) {
|
|
258
|
+
throw new StrataError(
|
|
259
|
+
"TOO_NEW",
|
|
260
|
+
"This document was written by newer code than this \u2014 reading it would be guessing.",
|
|
261
|
+
ahead.map((s) => `${s.id}: the document is at ${positionOf(given, s.id)}, this code knows ${s.migrations.length}`)
|
|
262
|
+
);
|
|
263
|
+
}
|
|
264
|
+
return grammars.some((s) => positionOf(given, s.id) < s.migrations.length);
|
|
265
|
+
};
|
|
266
|
+
const upgrade = (document, { kind, stamp: given }) => {
|
|
267
|
+
if (!isRecord(document)) throw new StrataError("STEP_FAILED", `A ${kind} document must be a JSON object.`);
|
|
268
|
+
if (!kinds.has(kind)) throw new StrataError("UNKNOWN_KIND", `No sequence declares the document kind "${kind}".`, [...kinds.keys()]);
|
|
269
|
+
if (!behind(given)) return { document, stamp, applied: [] };
|
|
270
|
+
const done = new Set(grammars.flatMap((s) => s.migrations.filter((m) => m.n <= positionOf(given, s.id)).map((m) => m.ref)));
|
|
271
|
+
const { pending, stuck } = orderPending(
|
|
272
|
+
grammars.map((s) => ({ waiting: s.migrations.filter((m) => !done.has(m.ref)) })),
|
|
273
|
+
done
|
|
274
|
+
);
|
|
275
|
+
if (stuck.length > 0) throw new StrataError("CYCLE", "Document migrations wait on each other and can never run.", stuck.map((m) => m.ref));
|
|
276
|
+
let current = document;
|
|
277
|
+
const applied = [];
|
|
278
|
+
const runStep = (migration, at, transform) => {
|
|
279
|
+
const targets = locate(current, kind).filter((l) => l.kind === at).sort((a, b) => b.path.length - a.path.length);
|
|
280
|
+
for (const target of targets) {
|
|
281
|
+
const value = getAt(current, target.path);
|
|
282
|
+
let rewritten;
|
|
283
|
+
try {
|
|
284
|
+
rewritten = options.transform(transform, { document: value, path: pathText(target.path) });
|
|
285
|
+
} catch (cause) {
|
|
286
|
+
throw new StrataError(
|
|
287
|
+
"STEP_FAILED",
|
|
288
|
+
`${migration.ref} ("${migration.description}") failed on the ${at} at ${pathText(target.path) || "(root)"}.`,
|
|
289
|
+
[cause instanceof Error ? cause.message : String(cause)],
|
|
290
|
+
{ cause }
|
|
291
|
+
);
|
|
292
|
+
}
|
|
293
|
+
if (!isRecord(rewritten)) {
|
|
294
|
+
throw new StrataError("STEP_FAILED", `${migration.ref} turned the ${at} at ${pathText(target.path) || "(root)"} into something that is not a document.`, [
|
|
295
|
+
JSON.stringify(rewritten)?.slice(0, 200) ?? String(rewritten)
|
|
296
|
+
]);
|
|
297
|
+
}
|
|
298
|
+
const next = setAt(current, target.path, rewritten);
|
|
299
|
+
if (isRecord(next)) current = next;
|
|
300
|
+
}
|
|
301
|
+
};
|
|
302
|
+
for (const migration of pending) {
|
|
303
|
+
for (const step of migration.steps) if (step.kind === "document") runStep(migration, step.at, step.transform);
|
|
304
|
+
applied.push(migration.ref);
|
|
305
|
+
}
|
|
306
|
+
return { document: current, stamp, applied };
|
|
307
|
+
};
|
|
308
|
+
return { stamp, upgrade, locate, behind };
|
|
309
|
+
};
|
|
310
|
+
|
|
311
|
+
// src/sql.ts
|
|
312
|
+
var isComment = (line) => line.trim().startsWith("--");
|
|
313
|
+
var sqlSteps = (ddl) => {
|
|
314
|
+
const steps = [];
|
|
315
|
+
let buffer = [];
|
|
316
|
+
const flush = () => {
|
|
317
|
+
const sql = buffer.join("\n").trim().replace(/;\s*$/, "").trim();
|
|
318
|
+
if (sql.split("\n").some((line) => line.trim() !== "" && !isComment(line))) steps.push({ kind: "sql", sql });
|
|
319
|
+
buffer = [];
|
|
320
|
+
};
|
|
321
|
+
for (const line of ddl.split("\n")) {
|
|
322
|
+
buffer.push(line);
|
|
323
|
+
if (!isComment(line) && line.trimEnd().endsWith(";")) flush();
|
|
324
|
+
}
|
|
325
|
+
flush();
|
|
326
|
+
return steps;
|
|
327
|
+
};
|
|
328
|
+
|
|
329
|
+
// src/depth.ts
|
|
330
|
+
var DOCUMENT_DEPTH_LIMIT = 256;
|
|
331
|
+
var exceedsDepth = (value, limit = DOCUMENT_DEPTH_LIMIT) => {
|
|
332
|
+
const pending = [{ value, depth: 0 }];
|
|
333
|
+
for (let next = pending.pop(); next !== void 0; next = pending.pop()) {
|
|
334
|
+
if (typeof next.value !== "object" || next.value === null) continue;
|
|
335
|
+
const depth = next.depth + 1;
|
|
336
|
+
if (depth > limit) return true;
|
|
337
|
+
for (const inner of Array.isArray(next.value) ? next.value : Object.values(next.value)) pending.push({ value: inner, depth });
|
|
338
|
+
}
|
|
339
|
+
return false;
|
|
340
|
+
};
|
|
341
|
+
var depthRefusal = (limit = DOCUMENT_DEPTH_LIMIT) => `the document nests deeper than ${limit} levels \u2014 no document is written that deep, and a schema reading one would overflow the stack`;
|
|
342
|
+
|
|
343
|
+
// src/index.ts
|
|
344
|
+
var defineSequence = (sequence) => sequence;
|
|
345
|
+
|
|
346
|
+
exports.DOCUMENT_DEPTH_LIMIT = DOCUMENT_DEPTH_LIMIT;
|
|
347
|
+
exports.DocumentKindSchema = DocumentKindSchema;
|
|
348
|
+
exports.DocumentStepSchema = DocumentStepSchema;
|
|
349
|
+
exports.EMBED_PATH = EMBED_PATH;
|
|
350
|
+
exports.KIND_NAME = KIND_NAME;
|
|
351
|
+
exports.KIND_REF = KIND_REF;
|
|
352
|
+
exports.MIGRATION_REF = MIGRATION_REF;
|
|
353
|
+
exports.MigrationSchema = MigrationSchema;
|
|
354
|
+
exports.SEQUENCE_ID = SEQUENCE_ID;
|
|
355
|
+
exports.SequenceSchema = SequenceSchema;
|
|
356
|
+
exports.SqlStepSchema = SqlStepSchema;
|
|
357
|
+
exports.StepSchema = StepSchema;
|
|
358
|
+
exports.StrataError = StrataError;
|
|
359
|
+
exports.checksumOf = checksumOf;
|
|
360
|
+
exports.createUpgrader = createUpgrader;
|
|
361
|
+
exports.defineSequence = defineSequence;
|
|
362
|
+
exports.depthRefusal = depthRefusal;
|
|
363
|
+
exports.exceedsDepth = exceedsDepth;
|
|
364
|
+
exports.orderPending = orderPending;
|
|
365
|
+
exports.planMigrations = planMigrations;
|
|
366
|
+
exports.prepare = prepare;
|
|
367
|
+
exports.refuseProblems = refuseProblems;
|
|
368
|
+
exports.sqlSteps = sqlSteps;
|
|
369
|
+
//# sourceMappingURL=index.cjs.map
|
|
370
|
+
//# sourceMappingURL=index.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/schema.ts","../src/checksum.ts","../src/errors.ts","../src/plan.ts","../src/documents.ts","../src/sql.ts","../src/depth.ts","../src/index.ts"],"names":["z"],"mappings":";;;;;AAiBO,IAAM,WAAA,GAAc;AAIpB,IAAM,aAAA,GAAgB;AAItB,IAAM,SAAA,GAAY;AAClB,IAAM,QAAA,GAAW;AAOjB,IAAM,UAAA,GAAa;AAEnB,IAAM,aAAA,GAAgBA,MAC1B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CAAE,OAAA,CAAQ,KAAK,CAAA;AAAA,EACrB,KAAKA,KAAA,CACF,MAAA,EAAO,CACP,GAAA,CAAI,CAAC,CAAA,CACL,QAAA;AAAA,IACC;AAAA;AAGN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,yEAAyE;AAE9E,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,IAAA,EAAMA,KAAA,CAAE,OAAA,CAAQ,UAAU,CAAA;AAAA,EAC1B,EAAA,EAAIA,MACD,MAAA,EAAO,CACP,MAAM,QAAQ,CAAA,CACd,SAAS,0GAAqG,CAAA;AAAA,EACjH,SAAA,EAAWA,KAAA,CACR,OAAA,EAAQ,CACR,QAAA;AAAA,IACC;AAAA;AAIN,CAAC,CAAA,CACA,MAAA,EAAO,CACP,QAAA,CAAS,iDAAiD;AAEtD,IAAM,aAAaA,KAAA,CAAE,kBAAA,CAAmB,QAAQ,CAAC,aAAA,EAAe,kBAAkB,CAAC;AAEnF,IAAM,kBAAA,GAAqBA,MAC/B,MAAA,CAAO;AAAA,EACN,QAAQA,KAAA,CACL,MAAA,CAAOA,MAAE,MAAA,EAAO,CAAE,MAAM,UAAU,CAAA,EAAGA,MAAE,MAAA,EAAO,CAAE,MAAM,QAAQ,CAAC,EAC/D,QAAA,EAAS,CACT,SAAS,0GAAqG;AACnH,CAAC,EACA,MAAA;AAEI,IAAM,eAAA,GAAkBA,MAC5B,MAAA,CAAO;AAAA,EACN,WAAA,EAAaA,MACV,MAAA,EAAO,CACP,IAAI,CAAC,CAAA,CACL,SAAS,gGAAiG,CAAA;AAAA,EAC7G,KAAA,EAAOA,KAAA,CACJ,KAAA,CAAM,UAAU,CAAA,CAChB,QAAA;AAAA,IACC;AAAA,GAEF;AAAA,EACF,SAAA,EAAWA,KAAA,CACR,KAAA,CAAMA,KAAA,CAAE,MAAA,EAAO,CAAE,KAAA,CAAM,aAAa,CAAC,CAAA,CACrC,QAAA,EAAS,CACT,SAAS,qFAAqF;AACnG,CAAC,EACA,MAAA;AAEI,IAAM,cAAA,GAAiBA,MAC3B,MAAA,CAAO;AAAA,EACN,EAAA,EAAIA,MAAE,MAAA,EAAO,CAAE,MAAM,WAAW,CAAA,CAAE,SAAS,iEAAiE,CAAA;AAAA,EAC5G,SAAA,EAAWA,KAAA,CACR,MAAA,CAAOA,KAAA,CAAE,QAAO,CAAE,KAAA,CAAM,SAAS,CAAA,EAAG,kBAAkB,CAAA,CACtD,QAAA,EAAS,CACT,SAAS,iGAAiG,CAAA;AAAA,EAC7G,YAAYA,KAAA,CACT,KAAA,CAAM,eAAe,CAAA,CACrB,SAAS,sGAAuG;AACrH,CAAC,EACA,MAAA,EAAO,CAMP,WAAA,CAAY,CAAC,UAAU,GAAA,KAAQ;AAC9B,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,QAAA,CAAS,UAAA,CAAW,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAC,CAAA;AACpF,EAAA,IAAI,KAAA,CAAM,GAAA,CAAI,KAAK,CAAA,KAAM,KAAA,CAAM,IAAI,UAAU,CAAA,IAAK,QAAA,CAAS,SAAA,KAAc,MAAA,CAAA,EAAY;AACnF,IAAA,GAAA,CAAI,QAAA,CAAS;AAAA,MACX,IAAA,EAAM,QAAA;AAAA,MACN,OAAA,EAAS;AAAA,KACV,CAAA;AAAA,EACH;AACF,CAAC;;;ACpGH,IAAM,SAAA,GAAY,CAAC,KAAA,KAA2B;AAC5C,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG,OAAO,CAAA,CAAA,EAAI,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AACnE,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,EAAU;AAC/C,IAAA,MAAM,OAAA,GAAU,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,CACjC,MAAA,CAAO,CAAC,GAAG,CAAC,CAAA,KAAM,CAAA,KAAM,MAAS,CAAA,CACjC,IAAA,CAAK,CAAC,CAAC,CAAC,CAAA,EAAG,CAAC,CAAC,CAAA,KAAO,CAAA,GAAI,CAAA,GAAI,EAAA,GAAK,CAAA,GAAI,CAAA,GAAI,CAAA,GAAI,CAAE,CAAA;AAClD,IAAA,OAAO,CAAA,CAAA,EAAI,QAAQ,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,MAAM,CAAA,EAAG,IAAA,CAAK,UAAU,CAAC,CAAC,IAAI,SAAA,CAAU,CAAC,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA,CAAA,CAAA;AAAA,EACtF;AACA,EAAA,OAAO,IAAA,CAAK,UAAU,KAAK,CAAA;AAC7B,CAAA;AAEA,IAAM,QAAA,GAAW,CAAC,GAAA,KAChB,GAAA,CACG,KAAA,CAAM,IAAI,CAAA,CACV,MAAA,CAAO,CAAC,IAAA,KAAS,CAAC,IAAA,CAAK,SAAA,EAAU,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,CACnD,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,CAAA,CAC5B,IAAA,CAAK,IAAI,CAAA,CACT,IAAA,EAAK;AAEH,IAAM,UAAA,GAAa,OAAO,SAAA,KAA0C;AACzE,EAAA,MAAM,QAAQ,SAAA,CAAU,KAAA,CAAM,IAAI,CAAC,IAAA,KAAU,KAAK,IAAA,KAAS,KAAA,GAAQ,EAAE,GAAG,MAAM,GAAA,EAAK,QAAA,CAAS,KAAK,GAAG,CAAA,KAAM,IAAK,CAAA;AAC/G,EAAA,MAAM,QAAQ,IAAI,WAAA,GAAc,MAAA,CAAO,SAAA,CAAU,KAAK,CAAC,CAAA;AACvD,EAAA,MAAM,SAAS,MAAM,MAAA,CAAO,MAAA,CAAO,MAAA,CAAO,WAAW,KAAK,CAAA;AAC1D,EAAA,OAAO,MAAM,IAAA,CAAK,IAAI,WAAW,MAAM,CAAA,EAAG,CAAC,CAAA,KAAM,CAAA,CAAE,QAAA,CAAS,EAAE,EAAE,QAAA,CAAS,CAAA,EAAG,GAAG,CAAC,CAAA,CAAE,KAAK,EAAE,CAAA;AAC3F;;;ACpBO,IAAM,WAAA,GAAN,cAA0B,KAAA,CAAM;AAAA,EAC5B,IAAA;AAAA,EACA,OAAA;AAAA,EAET,YAAY,IAAA,EAAuB,OAAA,EAAiB,OAAA,GAA6B,IAAI,OAAA,EAA+B;AAClH,IAAA,KAAA,CAAM,OAAA,CAAQ,MAAA,GAAS,CAAA,GAAI,CAAA,EAAG,OAAO;AAAA,EAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAA,EAAK,CAAC,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,GAAK,SAAS,OAAO,CAAA;AACtG,IAAA,IAAA,CAAK,IAAA,GAAO,aAAA;AACZ,IAAA,IAAA,CAAK,IAAA,GAAO,IAAA;AACZ,IAAA,IAAA,CAAK,OAAA,GAAU,OAAA;AAAA,EACjB;AACF;;;ACUA,IAAM,QAAQ,CAAC,QAAA,EAAkB,MAAsB,CAAA,EAAG,QAAQ,IAAI,CAAC,CAAA,CAAA;AAGhE,IAAM,OAAA,GAAU,OAAO,SAAA,KAAyE;AACrG,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,WAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAC7B,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,SAAA,CAAU,KAAK,CAAA;AAC7C,IAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACnB,MAAA,MAAM,SAAS,MAAA,CAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,CAAA,CAAE,IAAA,CAAK,KAAK,GAAG,CAAA,IAAK,QAAQ,CAAA,EAAA,EAAK,CAAA,CAAE,OAAO,CAAA,CAAE,CAAA;AAC7F,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,yBAAA,EAA4B,OAAO,KAAA,CAAM,EAAA,KAAO,QAAA,GAAW,CAAA,GAAA,EAAM,KAAA,CAAM,EAAE,CAAA,EAAA,CAAA,GAAO,EAAE,KAAK,MAAM,CAAA;AAAA,IACzI;AACA,IAAA,MAAM,WAAW,MAAA,CAAO,IAAA;AACxB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,QAAA,CAAS,EAAE,CAAA,EAAG;AACzB,MAAA,MAAM,IAAI,WAAA,CAAY,kBAAA,EAAoB,CAAA,+BAAA,EAAkC,QAAA,CAAS,EAAE,CAAA,uCAAA,CAAoC,CAAA;AAAA,IAC7H;AACA,IAAA,IAAA,CAAK,GAAA,CAAI,SAAS,EAAE,CAAA;AACpB,IAAA,MAAM,aAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAA,EAAO,SAAS,KAAK,QAAA,CAAS,UAAA,CAAW,SAAQ,EAAG;AAC9D,MAAA,MAAM,IAAI,KAAA,GAAQ,CAAA;AAClB,MAAA,UAAA,CAAW,IAAA,CAAK;AAAA,QACd,UAAU,QAAA,CAAS,EAAA;AAAA,QACnB,CAAA;AAAA,QACA,GAAA,EAAK,KAAA,CAAM,QAAA,CAAS,EAAA,EAAI,CAAC,CAAA;AAAA,QACzB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,QAAA,EAAU,MAAM,UAAA,CAAW,SAAS,CAAA;AAAA,QACpC,OAAO,SAAA,CAAU,KAAA;AAAA,QACjB,SAAA,EAAW,SAAA,CAAU,SAAA,IAAa;AAAC,OACpC,CAAA;AAAA,IACH;AACA,IAAA,MAAM,UAAU,QAAA,CAAS,SAAA,KAAc,MAAA,IAAa,QAAA,CAAS,WAAW,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,MAAM,IAAA,CAAK,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,UAAU,CAAC,CAAA;AAC9H,IAAA,QAAA,CAAS,IAAA,CAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,OAAA,EAAS,SAAA,EAAW,QAAA,CAAS,SAAA,IAAa,EAAC,EAAG,UAAA,EAAY,CAAA;AAAA,EAC7F;AACA,EAAA,OAAO,QAAA;AACT;AAOO,IAAM,YAAA,GAAe,CAC1B,MAAA,EACA,WAAA,KACiE;AACjE,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,WAAW,CAAA;AAChC,EAAA,MAAM,OAAA,GAAU,OAAO,GAAA,CAAI,CAAC,MAAM,CAAC,GAAG,CAAA,CAAE,OAAO,CAAC,CAAA;AAChD,EAAA,MAAM,UAA+B,EAAC;AACtC,EAAA,IAAI,KAAA,GAAQ,IAAA;AACZ,EAAA,OAAO,KAAA,EAAO;AACZ,IAAA,KAAA,GAAQ,KAAA;AACR,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,KAAA,IAAS,IAAA,GAAO,MAAM,CAAC,CAAA,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,EAAG;AAC7D,QAAA,IAAI,CAAC,IAAA,CAAK,SAAA,CAAU,KAAA,CAAM,CAAC,MAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG;AAC/C,QAAA,OAAA,CAAQ,KAAK,IAAI,CAAA;AACjB,QAAA,IAAA,CAAK,GAAA,CAAI,KAAK,GAAG,CAAA;AACjB,QAAA,KAAA,CAAM,KAAA,EAAM;AACZ,QAAA,KAAA,GAAQ,IAAA;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,CAAQ,MAAK,EAAE;AAC1C;AAEO,IAAM,cAAA,GAAiB,CAAC,SAAA,EAAwC,MAAA,KAAuC;AAC5G,EAAA,MAAM,WAAsB,EAAC;AAC7B,EAAA,MAAM,UAAkC,EAAC;AACzC,EAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,KAAA,CAAM,GAAA,CAAI,QAAA,EAAU,GAAA,CAAI,CAAC,CAAC,CAAC,CAAA;AACpE,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,MAAA,CAAO,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAC,KAAA,CAAM,GAAA,CAAI,UAAU,GAAA,CAAI,CAAC,CAAA,EAAG,GAAG,CAAC,CAAC,CAAA;AAE5E,EAAA,MAAM,SAAyD,EAAC;AAChE,EAAA,KAAA,MAAW,YAAY,SAAA,EAAW;AAChC,IAAA,MAAM,IAAA,GAAO,OAAO,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,QAAA,KAAa,SAAS,EAAE,CAAA;AAChE,IAAA,OAAA,CAAQ,QAAA,CAAS,EAAE,CAAA,GAAI,IAAA,CAAK,MAAA;AAI5B,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,CAAO,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,QAAA,CAAS,UAAA,CAAW,MAAM,CAAA;AACtE,IAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,MAAA,QAAA,CAAS,IAAA,CAAK;AAAA,QACZ,IAAA,EAAM,SAAA;AAAA,QACN,QAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,qBAAA,EAAwB,IAAA,CAAK,IAAI,GAAG,IAAA,CAAK,IAAI,CAAC,CAAA,KAAM,EAAE,CAAC,CAAC,CAAC,CAAA,kBAAA,EAAqB,QAAA,CAAS,WAAW,MAAM,CAAA,sCAAA;AAAA,OAC/H,CAAA;AAAA,IACH;AAEA,IAAA,MAAM,UAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,SAAA,IAAa,SAAS,UAAA,EAAY;AAC3C,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,SAAA,CAAU,GAAG,CAAA;AACnC,MAAA,IAAI,QAAQ,MAAA,EAAW;AACrB,QAAA,OAAA,CAAQ,KAAK,SAAS,CAAA;AAAA,MACxB,CAAA,MAAA,IAAW,GAAA,CAAI,QAAA,KAAa,SAAA,CAAU,QAAA,EAAU;AAC9C,QAAA,QAAA,CAAS,IAAA,CAAK;AAAA,UACZ,IAAA,EAAM,QAAA;AAAA,UACN,MAAA,EAAQ,GAAG,SAAA,CAAU,GAAG,MAAM,SAAA,CAAU,WAAW,CAAA,eAAA,EAAkB,GAAA,CAAI,SAAS,CAAA,2FAAA;AAAA,SACnF,CAAA;AAAA,MACH;AAAA,IACF;AAGA,IAAA,MAAM,YAAA,GAAe,QAAQ,CAAC,CAAA;AAC9B,IAAA,IAAI,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,IAAA,CAAK,CAAC,QAAQ,GAAA,CAAI,CAAA,GAAI,YAAA,CAAa,CAAC,CAAA,EAAG;AAC5E,MAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,QAAA,EAAU,MAAA,EAAQ,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,EAAA,EAAK,YAAA,CAAa,GAAG,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,IACvI;AACA,IAAA,MAAA,CAAO,KAAK,EAAE,EAAA,EAAI,QAAA,CAAS,EAAA,EAAI,SAAS,CAAA;AAAA,EAC1C;AAGA,EAAA,MAAM,QAAA,GAAW,IAAI,GAAA,CAAI,SAAA,CAAU,QAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,IAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAC,CAAA;AACjF,EAAA,KAAA,MAAW,EAAE,OAAA,EAAQ,IAAK,MAAA,EAAQ;AAChC,IAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,MAAA,KAAA,MAAW,UAAA,IAAc,UAAU,SAAA,EAAW;AAC5C,QAAA,IAAI,CAAC,KAAK,GAAA,CAAI,UAAU,KAAK,CAAC,QAAA,CAAS,GAAA,CAAI,UAAU,CAAA,EAAG;AACtD,UAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,oBAAA,EAAsB,MAAA,EAAQ,CAAA,EAAG,SAAA,CAAU,GAAG,CAAA,YAAA,EAAe,UAAU,CAAA,sDAAA,CAAA,EAA0D,CAAA;AAAA,QACzJ;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAM,GAAI,YAAA,CAAa,QAAQ,IAAI,CAAA;AACpD,EAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,CAAC,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,IAAA,KAAS,oBAAoB,CAAA,EAAG;AAC9E,IAAA,QAAA,CAAS,KAAK,EAAE,IAAA,EAAM,OAAA,EAAS,MAAA,EAAQ,+CAA+C,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,GAAG,CAAA,CAAE,KAAK,IAAI,CAAC,KAAK,CAAA;AAAA,EAC/H;AAEA,EAAA,OAAO,EAAE,OAAA,EAAS,OAAA,EAAS,QAAA,EAAS;AACtC;AAGO,IAAM,cAAA,GAAiB,CAAC,IAAA,KAAqB;AAClD,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAU,MAAA,EAAW;AACzB,EAAA,MAAM,IAAI,WAAA,CAAY,KAAA,CAAM,IAAA,EAAM,0CAAA,EAA4C,KAAK,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,KAAM,GAAG,CAAA,CAAE,IAAI,KAAK,CAAA,CAAE,MAAM,EAAE,CAAC,CAAA;AAClI;;;AC9HA,IAAM,QAAA,GAAW,CAAC,KAAA,KAChB,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAErE,IAAM,QAAA,GAAW,CAAC,IAAA,KAChB,IAAA,CAAK,MAAA,CAAe,CAAC,IAAA,EAAM,GAAA,KAAS,OAAO,GAAA,KAAQ,QAAA,GAAW,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,CAAA,GAAM,IAAA,KAAS,EAAA,GAAK,GAAA,GAAM,GAAG,IAAI,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAK,EAAE,CAAA;AAK7H,IAAM,KAAA,GAAQ,CAAC,KAAA,EAAgB,OAAA,KAAqE;AAClG,EAAA,IAAI,WAA4D,CAAC,EAAE,MAAM,EAAC,EAAG,OAAO,CAAA;AACpF,EAAA,KAAA,MAAW,OAAA,IAAW,OAAA,CAAQ,KAAA,CAAM,GAAG,CAAA,EAAG;AACxC,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,QAAA,CAAS,IAAI,CAAA;AACnC,IAAA,MAAM,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,GAAI,OAAA;AAC3C,IAAA,MAAM,OAAwD,EAAC;AAC/D,IAAA,KAAA,MAAW,MAAM,QAAA,EAAU;AACzB,MAAA,IAAI,CAAC,QAAA,CAAS,EAAA,CAAG,KAAK,CAAA,EAAG;AACzB,MAAA,MAAM,KAAA,GACJ,QAAQ,GAAA,GACJ,MAAA,CAAO,QAAQ,EAAA,CAAG,KAAK,EAAE,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,OAAO,EAAE,IAAA,EAAM,CAAC,GAAG,EAAA,CAAG,MAAM,CAAC,CAAA,EAAG,OAAO,CAAA,EAAE,CAAE,IAC9E,GAAA,IAAO,EAAA,CAAG,QACR,CAAC,EAAE,MAAM,CAAC,GAAG,GAAG,IAAA,EAAM,GAAG,GAAG,KAAA,EAAO,EAAA,CAAG,MAAM,GAAG,CAAA,EAAG,CAAA,GAClD,EAAC;AACT,MAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,QAAA,IAAI,CAAC,KAAA,EAAO,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA;AAAA,aAAA,IACd,KAAA,CAAM,OAAA,CAAQ,CAAA,CAAE,KAAK,CAAA,IAAK,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,EAAM,CAAA,KAAM,IAAA,CAAK,KAAK,EAAE,IAAA,EAAM,CAAC,GAAG,CAAA,CAAE,IAAA,EAAM,CAAC,CAAA,EAAG,KAAA,EAAO,IAAA,EAAM,CAAC,CAAA;AAAA,MAChH;AAAA,IACF;AACA,IAAA,QAAA,GAAW,IAAA;AAAA,EACb;AACA,EAAA,OAAO,QAAA;AACT,CAAA;AAEA,IAAM,KAAA,GAAQ,CAAC,IAAA,EAAe,IAAA,KAC5B,KAAK,MAAA,CAAgB,CAAC,IAAI,GAAA,KAAQ;AAChC,EAAA,IAAI,OAAO,GAAA,KAAQ,QAAA,EAAU,OAAO,KAAA,CAAM,QAAQ,EAAE,CAAA,GAAI,EAAA,CAAG,GAAG,CAAA,GAAI,MAAA;AAClE,EAAA,OAAO,QAAA,CAAS,EAAE,CAAA,GAAI,EAAA,CAAG,GAAG,CAAA,GAAI,MAAA;AAClC,CAAA,EAAG,IAAI,CAAA;AAET,IAAM,KAAA,GAAQ,CAAC,IAAA,EAAe,IAAA,EAAoC,KAAA,KAA4B;AAC5F,EAAA,MAAM,CAAC,IAAA,EAAM,GAAG,IAAI,CAAA,GAAI,IAAA;AACxB,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,KAAA;AAC/B,EAAA,IAAI,OAAO,SAAS,QAAA,IAAY,KAAA,CAAM,QAAQ,IAAI,CAAA,SAAU,IAAA,CAAK,GAAA,CAAI,CAAC,IAAA,EAAM,CAAA,KAAO,MAAM,IAAA,GAAO,KAAA,CAAM,MAAM,IAAA,EAAM,KAAK,IAAI,IAAK,CAAA;AAChI,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,SAAS,IAAI,CAAA,SAAU,EAAE,GAAG,MAAM,CAAC,IAAI,GAAG,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,EAAM,KAAK,CAAA,EAAE;AACzG,EAAA,OAAO,IAAA;AACT,CAAA;AAEO,IAAM,cAAA,GAAiB,OAAO,SAAA,EAAgC,OAAA,KAAyD;AAC5H,EAAA,MAAM,QAAA,GAAW,MAAM,OAAA,CAAQ,SAAS,CAAA;AACxC,EAAA,MAAM,SAAS,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,EAAE,OAAO,CAAA;AAChD,EAAA,IAAI,MAAA,CAAO,SAAS,CAAA,EAAG;AACrB,IAAA,MAAM,IAAI,WAAA;AAAA,MACR,aAAA;AAAA,MACA,8GAAA;AAAA,MACA,MAAA,CAAO,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,EAAE;AAAA,KACxB;AAAA,EACF;AACA,EAAA,MAAM,QAAA,GAAwC,QAAA;AAE9C,EAAA,MAAM,KAAA,uBAAY,GAAA,EAA0B;AAC5C,EAAA,KAAA,MAAW,YAAY,QAAA,EAAU;AAC/B,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,IAAI,CAAA,IAAK,MAAA,CAAO,QAAQ,QAAA,CAAS,SAAS,CAAA,EAAG,KAAA,CAAM,IAAI,CAAA,EAAG,QAAA,CAAS,EAAE,CAAA,CAAA,EAAI,IAAI,IAAI,IAAI,CAAA;AAAA,EACzG;AACA,EAAA,MAAM,OAAA,GAAU;AAAA,IACd,GAAG,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,UAAA,CAAW,OAAA,CAAQ,CAAC,CAAA,KAAM,EAAE,KAAA,CAAM,OAAA,CAAQ,CAAC,IAAA,KAAU,KAAK,IAAA,KAAS,UAAA,IAAc,CAAC,KAAA,CAAM,IAAI,IAAA,CAAK,EAAE,CAAA,GAAI,CAAC,GAAG,CAAA,CAAE,GAAG,CAAA,UAAA,EAAa,IAAA,CAAK,EAAE,CAAA,CAAE,CAAA,GAAI,EAAG,CAAC,CAAC,CAAA;AAAA,IAC5K,GAAG,CAAC,GAAG,KAAK,CAAA,CAAE,QAAQ,CAAC,CAAC,GAAA,EAAK,IAAI,MAAM,MAAA,CAAO,OAAA,CAAQ,KAAK,MAAA,IAAU,EAAE,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,MAAM,MAAM,CAAA,KAAO,MAAM,GAAA,CAAI,MAAM,IAAI,EAAC,GAAI,CAAC,CAAA,EAAG,GAAG,CAAA,QAAA,EAAW,MAAM,OAAO,IAAI,CAAA,CAAE,CAAE,CAAC;AAAA,GACzK;AACA,EAAA,IAAI,OAAA,CAAQ,SAAS,CAAA,EAAG,MAAM,IAAI,WAAA,CAAY,cAAA,EAAgB,uDAAuD,OAAO,CAAA;AAE5H,EAAA,MAAM,KAAA,GAAe,MAAA,CAAO,WAAA,CAAY,QAAA,CAAS,IAAI,CAAC,CAAA,KAAM,CAAC,CAAA,CAAE,EAAA,EAAI,CAAA,CAAE,UAAA,CAAW,MAAM,CAAC,CAAC,CAAA;AAExF,EAAA,MAAM,MAAA,GAAS,CAAC,QAAA,EAAmB,IAAA,KAA6B;AAC9D,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,QAAS,IAAI,WAAA,CAAY,cAAA,EAAgB,CAAA,wCAAA,EAA2C,IAAI,CAAA,EAAA,CAAA,EAAM,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAC,CAAA;AAClI,IAAA,MAAM,QAAoB,EAAC;AAC3B,IAAA,MAAM,KAAA,GAAQ,CAAC,KAAA,EAAgB,EAAA,EAAY,IAAA,KAAoC;AAC7E,MAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,MAAA,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,IAAA,EAAM,EAAA,EAAI,OAAO,CAAA;AACpC,MAAA,KAAA,MAAW,CAAC,OAAA,EAAS,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,KAAA,CAAM,GAAA,CAAI,EAAE,CAAA,EAAG,MAAA,IAAU,EAAE,CAAA,EAAG;AAC3E,QAAA,KAAA,MAAW,GAAA,IAAO,KAAA,CAAM,KAAA,EAAO,OAAO,GAAG,KAAA,CAAM,GAAA,CAAI,KAAA,EAAO,MAAA,EAAQ,CAAC,GAAG,IAAA,EAAM,GAAG,GAAA,CAAI,IAAI,CAAC,CAAA;AAAA,MAC1F;AAAA,IACF,CAAA;AACA,IAAA,KAAA,CAAM,QAAA,EAAU,IAAA,EAAM,EAAE,CAAA;AACxB,IAAA,OAAO,KAAA;AAAA,EACT,CAAA;AAEA,EAAA,MAAM,aAAa,CAAC,KAAA,EAAiC,EAAA,KAAuB,KAAA,GAAQ,EAAE,CAAA,IAAK,CAAA;AAE3F,EAAA,MAAM,MAAA,GAAS,CAAC,KAAA,KAA6C;AAC3D,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM,UAAA,CAAW,KAAA,EAAO,CAAA,CAAE,EAAE,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,MAAM,CAAA;AAClF,IAAA,IAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACpB,MAAA,MAAM,IAAI,WAAA;AAAA,QACR,SAAA;AAAA,QACA,wFAAA;AAAA,QACA,MAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,EAAG,EAAE,EAAE,CAAA,qBAAA,EAAwB,UAAA,CAAW,KAAA,EAAO,EAAE,EAAE,CAAC,qBAAqB,CAAA,CAAE,UAAA,CAAW,MAAM,CAAA,CAAE;AAAA,OACnH;AAAA,IACF;AACA,IAAA,OAAO,QAAA,CAAS,IAAA,CAAK,CAAC,CAAA,KAAM,UAAA,CAAW,KAAA,EAAO,CAAA,CAAE,EAAE,CAAA,GAAI,CAAA,CAAE,UAAA,CAAW,MAAM,CAAA;AAAA,EAC3E,CAAA;AAEA,EAAA,MAAM,UAAU,CAAC,QAAA,EAAmB,EAAE,IAAA,EAAM,KAAA,EAAO,OAAM,KAA6D;AACpH,IAAA,IAAI,CAAC,QAAA,CAAS,QAAQ,CAAA,EAAG,MAAM,IAAI,WAAA,CAAY,aAAA,EAAe,CAAA,EAAA,EAAK,IAAI,CAAA,gCAAA,CAAkC,CAAA;AACzG,IAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,QAAS,IAAI,WAAA,CAAY,cAAA,EAAgB,CAAA,wCAAA,EAA2C,IAAI,CAAA,EAAA,CAAA,EAAM,CAAC,GAAG,KAAA,CAAM,IAAA,EAAM,CAAC,CAAA;AAClI,IAAA,IAAI,CAAC,MAAA,CAAO,KAAK,CAAA,EAAG,OAAO,EAAE,QAAA,EAAU,KAAA,EAAO,OAAA,EAAS,EAAC,EAAE;AAK1D,IAAA,MAAM,IAAA,GAAO,IAAI,GAAA,CAAI,QAAA,CAAS,OAAA,CAAQ,CAAC,CAAA,KAAM,CAAA,CAAE,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,KAAK,UAAA,CAAW,KAAA,EAAO,CAAA,CAAE,EAAE,CAAC,CAAA,CAAE,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAC,CAAA;AAC1H,IAAA,MAAM,EAAE,OAAA,EAAS,KAAA,EAAM,GAAI,YAAA;AAAA,MACzB,SAAS,GAAA,CAAI,CAAC,OAAO,EAAE,OAAA,EAAS,EAAE,UAAA,CAAW,MAAA,CAAO,CAAC,CAAA,KAAM,CAAC,IAAA,CAAK,GAAA,CAAI,EAAE,GAAG,CAAC,GAAE,CAAE,CAAA;AAAA,MAC/E;AAAA,KACF;AACA,IAAA,IAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG,MAAM,IAAI,WAAA,CAAY,OAAA,EAAS,2DAAA,EAA6D,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,GAAG,CAAC,CAAA;AAEzI,IAAA,IAAI,OAAA,GAAmC,QAAA;AACvC,IAAA,MAAM,UAAoB,EAAC;AAC3B,IAAA,MAAM,OAAA,GAAU,CAAC,SAAA,EAA8B,EAAA,EAAY,SAAA,KAA6B;AAGtF,MAAA,MAAM,OAAA,GAAU,OAAO,OAAA,EAAS,IAAI,EACjC,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,IAAA,KAAS,EAAE,CAAA,CAC3B,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,IAAA,CAAK,MAAA,GAAS,CAAA,CAAE,IAAA,CAAK,MAAM,CAAA;AAC/C,MAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAG5B,QAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,EAAS,MAAA,CAAO,IAAI,CAAA;AACxC,QAAA,IAAI,SAAA;AACJ,QAAA,IAAI;AACF,UAAA,SAAA,GAAY,OAAA,CAAQ,SAAA,CAAU,SAAA,EAAW,EAAE,QAAA,EAAU,KAAA,EAAO,IAAA,EAAM,QAAA,CAAS,MAAA,CAAO,IAAI,CAAA,EAAG,CAAA;AAAA,QAC3F,SAAS,KAAA,EAAO;AACd,UAAA,MAAM,IAAI,WAAA;AAAA,YACR,aAAA;AAAA,YACA,CAAA,EAAG,SAAA,CAAU,GAAG,CAAA,GAAA,EAAM,SAAA,CAAU,WAAW,CAAA,iBAAA,EAAoB,EAAE,CAAA,IAAA,EAAO,QAAA,CAAS,MAAA,CAAO,IAAI,KAAK,QAAQ,CAAA,CAAA,CAAA;AAAA,YACzG,CAAC,KAAA,YAAiB,KAAA,GAAQ,MAAM,OAAA,GAAU,MAAA,CAAO,KAAK,CAAC,CAAA;AAAA,YACvD,EAAE,KAAA;AAAM,WACV;AAAA,QACF;AACA,QAAA,IAAI,CAAC,QAAA,CAAS,SAAS,CAAA,EAAG;AACxB,UAAA,MAAM,IAAI,WAAA,CAAY,aAAA,EAAe,CAAA,EAAG,UAAU,GAAG,CAAA,YAAA,EAAe,EAAE,CAAA,IAAA,EAAO,QAAA,CAAS,MAAA,CAAO,IAAI,CAAA,IAAK,QAAQ,CAAA,uCAAA,CAAA,EAA2C;AAAA,YACvJ,IAAA,CAAK,UAAU,SAAS,CAAA,EAAG,MAAM,CAAA,EAAG,GAAG,CAAA,IAAK,MAAA,CAAO,SAAS;AAAA,WAC7D,CAAA;AAAA,QACH;AACA,QAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,EAAS,MAAA,CAAO,MAAM,SAAS,CAAA;AAClD,QAAA,IAAI,QAAA,CAAS,IAAI,CAAA,EAAG,OAAA,GAAU,IAAA;AAAA,MAChC;AAAA,IACF,CAAA;AACA,IAAA,KAAA,MAAW,aAAa,OAAA,EAAS;AAC/B,MAAA,KAAA,MAAW,IAAA,IAAQ,SAAA,CAAU,KAAA,EAAO,IAAI,IAAA,CAAK,IAAA,KAAS,UAAA,EAAY,OAAA,CAAQ,SAAA,EAAW,IAAA,CAAK,EAAA,EAAI,IAAA,CAAK,SAAS,CAAA;AAC5G,MAAA,OAAA,CAAQ,IAAA,CAAK,UAAU,GAAG,CAAA;AAAA,IAC5B;AACA,IAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,EAAO,OAAA,EAAQ;AAAA,EAC7C,CAAA;AAEA,EAAA,OAAO,EAAE,KAAA,EAAO,OAAA,EAAS,MAAA,EAAQ,MAAA,EAAO;AAC1C;;;AC7LA,IAAM,YAAY,CAAC,IAAA,KAA0B,KAAK,IAAA,EAAK,CAAE,WAAW,IAAI,CAAA;AAEjE,IAAM,QAAA,GAAW,CAAC,GAAA,KAA2B;AAClD,EAAA,MAAM,QAAmB,EAAC;AAC1B,EAAA,IAAI,SAAmB,EAAC;AACxB,EAAA,MAAM,QAAQ,MAAY;AACxB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,IAAA,EAAK,CAAE,OAAA,CAAQ,OAAA,EAAS,EAAE,CAAA,CAAE,IAAA,EAAK;AAC/D,IAAA,IAAI,GAAA,CAAI,MAAM,IAAI,CAAA,CAAE,KAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,EAAK,KAAM,EAAA,IAAM,CAAC,SAAA,CAAU,IAAI,CAAC,CAAA,EAAG,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA;AAC3G,IAAA,MAAA,GAAS,EAAC;AAAA,EACZ,CAAA;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AAClC,IAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAChB,IAAA,IAAI,CAAC,SAAA,CAAU,IAAI,CAAA,IAAK,IAAA,CAAK,SAAQ,CAAE,QAAA,CAAS,GAAG,CAAA,EAAG,KAAA,EAAM;AAAA,EAC9D;AACA,EAAA,KAAA,EAAM;AACN,EAAA,OAAO,KAAA;AACT;;;AChBO,IAAM,oBAAA,GAAuB;AAE7B,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgB,KAAA,GAAgB,oBAAA,KAAkC;AAC7F,EAAA,MAAM,UAA+C,CAAC,EAAE,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AACzE,EAAA,KAAA,IAAS,IAAA,GAAO,QAAQ,GAAA,EAAI,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAI,EAAG;AACvE,IAAA,IAAI,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,IAAY,IAAA,CAAK,UAAU,IAAA,EAAM;AAC3D,IAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,GAAQ,CAAA;AAC3B,IAAA,IAAI,KAAA,GAAQ,OAAO,OAAO,IAAA;AAC1B,IAAA,KAAA,MAAW,SAAS,KAAA,CAAM,OAAA,CAAQ,KAAK,KAAK,CAAA,GAAI,KAAK,KAAA,GAAQ,MAAA,CAAO,OAAO,IAAA,CAAK,KAAK,GAAG,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,KAAA,EAAO,OAAO,CAAA;AAAA,EAC9H;AACA,EAAA,OAAO,KAAA;AACT;AAEO,IAAM,YAAA,GAAe,CAAC,KAAA,GAAgB,oBAAA,KAC3C,kCAAkC,KAAK,CAAA,kGAAA;;;ACXlC,IAAM,cAAA,GAAiB,CAA2B,QAAA,KAAmB","file":"index.cjs","sourcesContent":["import { z } from 'zod';\n\n// ═══════════════════════════════════════════════════════════════\n// The grammar of a migration.\n//\n// A SEQUENCE is an append-only list of migrations owned by one grammar owner —\n// a package's tables (`nisc.vex.cache`), a package's documents (`nisc.nova`,\n// later), an app's own (`midas.app`). A migration's number is its POSITION, so\n// the sequence's version is its length: nobody bumps a number, you append.\n//\n// Sequences are data. They are authored in TS for type-checking, but nothing\n// here is a function, so a sequence can be stored, shipped and inspected like\n// every other nisc artifact — and is parsed at the boundary like one.\n// ═══════════════════════════════════════════════════════════════\n\n// Namespaced, lowercase: `<owner>.<name>[.<name>…]`. The owner prefix keeps two\n// packages (or a package and an app) from ever claiming the same sequence.\nexport const SEQUENCE_ID = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+$/;\n\n// `<sequence>/<n>` — how a migration is named everywhere: the ledger, a\n// dependency, an error.\nexport const MIGRATION_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[1-9][0-9]*$/;\n\n// A document kind, named by its owner: `<sequence>/<kind>`, e.g.\n// \"nisc.nova/layout\". The kind part is a plain lowercase word.\nexport const KIND_NAME = /^[a-z][a-z0-9-]*$/;\nexport const KIND_REF = /^[a-z][a-z0-9-]*(\\.[a-z][a-z0-9-]*)+\\/[a-z][a-z0-9-]*$/;\n\n// Where, inside a document, another document sits. Dot-separated keys, with\n// two wildcards that say WHICH shape they cross — `children[]` is every item of\n// the array at `children`, `endpoints.*` every value of the record at\n// `endpoints`. Kept apart on purpose: nova's `children` is a single node OR an\n// array, and one wildcard for both would read a lone node's `props` as layouts.\nexport const EMBED_PATH = /^([A-Za-z_$][\\w$]*|\\*)(\\[\\])?(\\.([A-Za-z_$][\\w$]*|\\*)(\\[\\])?)*$/;\n\nexport const SqlStepSchema = z\n .object({\n kind: z.literal('sql'),\n sql: z\n .string()\n .min(1)\n .describe(\n 'ONE SQL statement. A driver that prepares statements (PGlite, pg with parameters) refuses a string ' +\n 'carrying several — split them into steps rather than joining them with semicolons.',\n ),\n })\n .strict()\n .describe('A statement run against the database, inside the migration transaction.');\n\nexport const DocumentStepSchema = z\n .object({\n kind: z.literal('document'),\n at: z\n .string()\n .regex(KIND_REF)\n .describe('The kind of document this step rewrites, e.g. \"nisc.nova/layout\" — wherever one sits, at any depth.'),\n transform: z\n .unknown()\n .describe(\n 'A transform config (Prism) run by the injected evaluator over { document, path }: `document` is ONE document of ' +\n 'the `at` kind, `path` where it sits. It returns that document rewritten. Nested documents are found by the ' +\n 'grammar\\'s embeddings and rewritten on their own, deepest first — a transform only ever sees one flat node.',\n ),\n })\n .strict()\n .describe('A rewrite of stored JSON documents of one kind.');\n\nexport const StepSchema = z.discriminatedUnion('kind', [SqlStepSchema, DocumentStepSchema]);\n\nexport const DocumentKindSchema = z\n .object({\n embeds: z\n .record(z.string().regex(EMBED_PATH), z.string().regex(KIND_REF))\n .optional()\n .describe('Where other documents sit inside this one: path → the kind found there (possibly this kind itself).'),\n })\n .strict();\n\nexport const MigrationSchema = z\n .object({\n description: z\n .string()\n .min(1)\n .describe('One sentence: what this migration does. It is the changelog line and the ledger\\'s description.'),\n steps: z\n .array(StepSchema)\n .describe(\n 'Applied in order, in the same transaction as every other pending migration. Empty is a MARKER: ' +\n 'the version moves and nothing runs — how an addition to a strict grammar tells older readers to refuse.',\n ),\n dependsOn: z\n .array(z.string().regex(MIGRATION_REF))\n .optional()\n .describe('Migrations of OTHER sequences that must be applied first, each as \"<sequence>/<n>\".'),\n })\n .strict();\n\nexport const SequenceSchema = z\n .object({\n id: z.string().regex(SEQUENCE_ID).describe('Namespaced and lowercase, e.g. \"nisc.vex.cache\" or \"midas.app\".'),\n documents: z\n .record(z.string().regex(KIND_NAME), DocumentKindSchema)\n .optional()\n .describe('The document kinds this sequence owns (a GRAMMAR sequence), each named \"<id>/<kind>\" elsewhere.'),\n migrations: z\n .array(MigrationSchema)\n .describe('Append-only. A migration is numbered by its position (from 1); the sequence\\'s version is its length.'),\n })\n .strict()\n // TWO KINDS OF OWNER. A table sequence (sql steps) is recorded per DATABASE,\n // in its ledger. A grammar sequence (document steps) is tracked per DOCUMENT,\n // by the stamp the document carries — because documents travel: an add-on\n // built on older code submits older documents to a newer host. One sequence\n // cannot be both; the two versions would mean different things.\n .superRefine((sequence, ctx) => {\n const kinds = new Set(sequence.migrations.flatMap((m) => m.steps.map((s) => s.kind)));\n if (kinds.has('sql') && (kinds.has('document') || sequence.documents !== undefined)) {\n ctx.addIssue({\n code: 'custom',\n message: 'A sequence either owns tables (sql steps) or documents (document steps and `documents`), not both.',\n });\n }\n });\n\nexport type SqlStep = z.infer<typeof SqlStepSchema>;\nexport type DocumentStep = z.infer<typeof DocumentStepSchema>;\nexport type DocumentKind = z.infer<typeof DocumentKindSchema>;\nexport type Step = z.infer<typeof StepSchema>;\nexport type Migration = z.infer<typeof MigrationSchema>;\nexport type Sequence = z.infer<typeof SequenceSchema>;\n","import type { Migration } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// What a migration DID, as a hash — the ledger's proof that the code still says\n// what the database ran.\n//\n// Over the steps only. The description is prose: fixing a typo in it must not\n// read as an edited migration. `dependsOn` orders, it does not act. The steps\n// are the effect, and changing an applied step is the one thing that has to\n// be refused — the database already holds the old effect.\n//\n// For the same reason a step's SQL is hashed without its full-line comments\n// (`-- …` on a line of its own) and without trailing whitespace: a migration\n// can carry its documentation verbatim, and rewording it is not an edit.\n//\n// WebCrypto (SHA-256), which Node ≥ 22 and every browser carry as\n// `crypto.subtle` — the same primitive Prism fingerprints with, so strata runs\n// unchanged in a server, a test and the showroom page.\n// ═══════════════════════════════════════════════════════════════\n\n// Sorted keys, recursively: the same value always serializes the same way,\n// whatever order its object literal was written in.\nconst canonical = (value: unknown): string => {\n if (Array.isArray(value)) return `[${value.map(canonical).join(',')}]`;\n if (value !== null && typeof value === 'object') {\n const entries = Object.entries(value)\n .filter(([, v]) => v !== undefined)\n .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0));\n return `{${entries.map(([k, v]) => `${JSON.stringify(k)}:${canonical(v)}`).join(',')}}`;\n }\n return JSON.stringify(value);\n};\n\nconst effectOf = (sql: string): string =>\n sql\n .split('\\n')\n .filter((line) => !line.trimStart().startsWith('--'))\n .map((line) => line.trimEnd())\n .join('\\n')\n .trim();\n\nexport const checksumOf = async (migration: Migration): Promise<string> => {\n const steps = migration.steps.map((step) => (step.kind === 'sql' ? { ...step, sql: effectOf(step.sql) } : step));\n const bytes = new TextEncoder().encode(canonical(steps));\n const digest = await crypto.subtle.digest('SHA-256', bytes);\n return Array.from(new Uint8Array(digest), (b) => b.toString(16).padStart(2, '0')).join('');\n};\n","// Every refusal strata makes, by name. The message is a sentence for a person;\n// the code is for the program that has to decide what to do about it.\nexport type StrataErrorCode =\n // A sequence failed its schema, or two sequences share an id.\n | 'INVALID_SEQUENCE'\n // An applied migration's steps no longer match what the code says it ran.\n | 'EDITED'\n // The database has migrations of a sequence this code does not know yet —\n // it was migrated by newer code.\n | 'TOO_NEW'\n // A `dependsOn` names a migration nobody provides and the ledger lacks.\n | 'UNKNOWN_DEPENDENCY'\n // Pending migrations wait on each other.\n | 'CYCLE'\n // Verify mode found work to do.\n | 'PENDING'\n // A step threw; the whole run was rolled back.\n | 'STEP_FAILED'\n // The pool cannot hold one connection for a transaction.\n | 'NO_TRANSACTION'\n // A document kind nobody declares — as the root being upgraded, a step's\n // `at`, or an embedding's target.\n | 'UNKNOWN_KIND'\n // A grammar sequence handed to the ledger, or a table sequence to upgrade().\n | 'WRONG_OWNER';\n\nexport class StrataError extends Error {\n readonly code: StrataErrorCode;\n readonly details: readonly string[];\n\n constructor(code: StrataErrorCode, message: string, details: readonly string[] = [], options?: { cause?: unknown }) {\n super(details.length > 0 ? `${message}\\n${details.map((d) => ` ${d}`).join('\\n')}` : message, options);\n this.name = 'StrataError';\n this.code = code;\n this.details = details;\n }\n}\n","import { SequenceSchema, type DocumentKind, type Sequence, type Step } from './schema';\nimport { checksumOf } from './checksum';\nimport { StrataError, type StrataErrorCode } from './errors';\n\n// ═══════════════════════════════════════════════════════════════\n// The plan — what the code says, against what the database has run.\n//\n// Pure: sequences and ledger rows in, a plan out. No database, no clock. The\n// postgres runner reads the ledger, calls this, and applies what it says; a\n// showroom page or a CI check can call it with a ledger it made up.\n// ═══════════════════════════════════════════════════════════════\n\n// A migration the code declares, numbered and hashed.\nexport type PreparedMigration = {\n sequence: string;\n n: number;\n ref: string;\n description: string;\n checksum: string;\n steps: readonly Step[];\n dependsOn: readonly string[];\n};\n\nexport type PreparedSequence = {\n id: string;\n // A grammar sequence owns documents (tracked by stamps); otherwise it owns\n // tables (tracked by a database's ledger). See SequenceSchema.\n grammar: boolean;\n documents: Readonly<Record<string, DocumentKind>>;\n migrations: readonly PreparedMigration[];\n};\n\n// One row of the ledger, as a runner read it back.\nexport type LedgerRow = { sequence: string; n: number; checksum: string; description: string; appliedAt: string };\n\nexport type Problem = { code: Exclude<StrataErrorCode, 'PENDING' | 'STEP_FAILED' | 'NO_TRANSACTION' | 'UNKNOWN_KIND' | 'WRONG_OWNER'>; detail: string };\n\nexport type Plan = {\n // Already run, per sequence this code knows: how far each one is.\n applied: Readonly<Record<string, number>>;\n // To run, in the order they must run.\n pending: readonly PreparedMigration[];\n // Anything that makes applying unsafe. A plan with problems is never applied.\n problems: readonly Problem[];\n};\n\nconst refOf = (sequence: string, n: number): string => `${sequence}/${n}`;\n\n// Parse, number and hash. Async only for the hash (WebCrypto).\nexport const prepare = async (sequences: readonly Sequence[]): Promise<readonly PreparedSequence[]> => {\n const seen = new Set<string>();\n const prepared: PreparedSequence[] = [];\n for (const input of sequences) {\n const parsed = SequenceSchema.safeParse(input);\n if (!parsed.success) {\n const issues = parsed.error.issues.map((i) => `${i.path.join('.') || '(root)'}: ${i.message}`);\n throw new StrataError('INVALID_SEQUENCE', `A sequence does not parse${typeof input.id === 'string' ? ` (\"${input.id}\")` : ''}.`, issues);\n }\n const sequence = parsed.data;\n if (seen.has(sequence.id)) {\n throw new StrataError('INVALID_SEQUENCE', `Two sequences are both called \"${sequence.id}\" — a sequence id names one owner.`);\n }\n seen.add(sequence.id);\n const migrations: PreparedMigration[] = [];\n for (const [index, migration] of sequence.migrations.entries()) {\n const n = index + 1;\n migrations.push({\n sequence: sequence.id,\n n,\n ref: refOf(sequence.id, n),\n description: migration.description,\n checksum: await checksumOf(migration),\n steps: migration.steps,\n dependsOn: migration.dependsOn ?? [],\n });\n }\n const grammar = sequence.documents !== undefined || sequence.migrations.some((m) => m.steps.some((s) => s.kind === 'document'));\n prepared.push({ id: sequence.id, grammar, documents: sequence.documents ?? {}, migrations });\n }\n return prepared;\n};\n\n// Order: walk the sequences in the order given, and let each run as far as its\n// dependencies allow before moving on; repeat until nothing moves. The same\n// input always yields the same order, and a sequence's own migrations stay\n// together unless a dependency splits them. Shared by the ledger's plan and a\n// document's upgrade, so both order the same migrations the same way.\nexport const orderPending = (\n queues: readonly { waiting: readonly PreparedMigration[] }[],\n alreadyDone: ReadonlySet<string>,\n): { pending: PreparedMigration[]; stuck: PreparedMigration[] } => {\n const done = new Set(alreadyDone);\n const waiting = queues.map((q) => [...q.waiting]);\n const pending: PreparedMigration[] = [];\n let moved = true;\n while (moved) {\n moved = false;\n for (const queue of waiting) {\n for (let head = queue[0]; head !== undefined; head = queue[0]) {\n if (!head.dependsOn.every((d) => done.has(d))) break;\n pending.push(head);\n done.add(head.ref);\n queue.shift();\n moved = true;\n }\n }\n }\n return { pending, stuck: waiting.flat() };\n};\n\nexport const planMigrations = (sequences: readonly PreparedSequence[], ledger: readonly LedgerRow[]): Plan => {\n const problems: Problem[] = [];\n const applied: Record<string, number> = {};\n const done = new Set(ledger.map((row) => refOf(row.sequence, row.n)));\n const byRef = new Map(ledger.map((row) => [refOf(row.sequence, row.n), row]));\n\n const queues: { id: string; waiting: PreparedMigration[] }[] = [];\n for (const sequence of sequences) {\n const rows = ledger.filter((row) => row.sequence === sequence.id);\n applied[sequence.id] = rows.length;\n\n // The database ran migrations this code has never seen: newer code migrated\n // it. Applying ours on top would be guessing — refuse.\n const beyond = rows.filter((row) => row.n > sequence.migrations.length);\n if (beyond.length > 0) {\n problems.push({\n code: 'TOO_NEW',\n detail: `${sequence.id}: the database is at ${Math.max(...rows.map((r) => r.n))}, this code knows ${sequence.migrations.length} — it was migrated by newer code.`,\n });\n }\n\n const waiting: PreparedMigration[] = [];\n for (const migration of sequence.migrations) {\n const row = byRef.get(migration.ref);\n if (row === undefined) {\n waiting.push(migration);\n } else if (row.checksum !== migration.checksum) {\n problems.push({\n code: 'EDITED',\n detail: `${migration.ref} (\"${migration.description}\") was applied ${row.appliedAt} and its steps have changed since. An applied migration is history — append a new one.`,\n });\n }\n }\n // A hole: something later ran, something earlier did not. The ledger was\n // written by hand, or by a different ordering of the same sequence.\n const firstWaiting = waiting[0];\n if (firstWaiting !== undefined && rows.some((row) => row.n > firstWaiting.n)) {\n problems.push({ code: 'EDITED', detail: `${sequence.id}: ${firstWaiting.ref} never ran, but a later migration of the sequence did.` });\n }\n queues.push({ id: sequence.id, waiting });\n }\n\n // Every dependency must be satisfiable by the ledger or by this plan.\n const provided = new Set(sequences.flatMap((s) => s.migrations.map((m) => m.ref)));\n for (const { waiting } of queues) {\n for (const migration of waiting) {\n for (const dependency of migration.dependsOn) {\n if (!done.has(dependency) && !provided.has(dependency)) {\n problems.push({ code: 'UNKNOWN_DEPENDENCY', detail: `${migration.ref} depends on ${dependency}, which nothing provides and the database has not run.` });\n }\n }\n }\n }\n\n const { pending, stuck } = orderPending(queues, done);\n if (stuck.length > 0 && !problems.some((p) => p.code === 'UNKNOWN_DEPENDENCY')) {\n problems.push({ code: 'CYCLE', detail: `These wait on each other and can never run: ${stuck.map((m) => m.ref).join(', ')}.` });\n }\n\n return { applied, pending, problems };\n};\n\n// Throw the plan's problems as one error, named by the first.\nexport const refuseProblems = (plan: Plan): void => {\n const first = plan.problems[0];\n if (first === undefined) return;\n throw new StrataError(first.code, 'The migrations cannot be applied safely.', plan.problems.map((p) => `${p.code}: ${p.detail}`));\n};\n","import { prepare, orderPending, type PreparedMigration, type PreparedSequence } from './plan';\nimport type { DocumentKind, Sequence } from './schema';\nimport { StrataError } from './errors';\n\n// ═══════════════════════════════════════════════════════════════\n// Documents — the JSON a grammar describes, wherever it is kept.\n//\n// A document carries a STAMP: for each grammar sequence, how far along that\n// sequence the writer was (`{ \"nisc.nova\": 3, \"nisc.prism\": 1 }`). Upgrading\n// runs every document migration the stamp has not seen, in the ledger's order,\n// and hands back the document with a current stamp. The same function serves a\n// row read at boot, a submission at intake and a file in an app's source tree:\n// the document does not care where it was kept.\n//\n// NESTING IS THE GRAMMAR'S, NOT THE MIGRATION'S. A kind declares where other\n// documents sit inside it (its embeddings: nova's layout holds layouts at\n// `children`, `children[]`, `then`, `else`, `do`; an action holds a layout and\n// Prism configs). The walker finds every document of a step's kind at any\n// depth and rewrites each on its own, deepest first. A transform only ever sees\n// ONE node — so migrations stay flat, and a Prism config can express them\n// without recursion of its own.\n// ═══════════════════════════════════════════════════════════════\n\nexport type Stamp = Readonly<Record<string, number>>;\n\n// Where a document sits: the path from the root (keys and indexes) and its kind.\nexport type Location = { path: readonly (string | number)[]; kind: string; value: Record<string, unknown> };\n\n// The injected evaluator — nova's `transform` socket, the same shape: under moss\n// it is Prism's `evaluate`, and a migration runs exactly the way an endpoint does.\nexport type Transform = (config: unknown, source: unknown) => unknown;\n\nexport type UpgradeResult = {\n document: Record<string, unknown>;\n stamp: Stamp;\n // What ran, in order — empty when the document was already current.\n applied: readonly string[];\n};\n\nexport type Upgrader = {\n // The stamp a document written NOW carries.\n stamp: Stamp;\n upgrade: (document: unknown, options: { kind: string; stamp?: Stamp | null }) => UpgradeResult;\n // Every document inside `document` (itself included), by kind — what the\n // walker sees. For a page that shows it, and for a check that asserts it.\n locate: (document: unknown, kind: string) => Location[];\n // Is a document at this stamp behind the code (true), current (false)? Throws\n // TOO_NEW if it is ahead.\n behind: (stamp: Stamp | null | undefined) => boolean;\n};\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === 'object' && value !== null && !Array.isArray(value);\n\nconst pathText = (path: readonly (string | number)[]): string =>\n path.reduce<string>((text, key) => (typeof key === 'number' ? `${text}[${key}]` : text === '' ? key : `${text}.${key}`), '');\n\n// One embedding pattern, applied to one value: every (relative path, value)\n// the pattern reaches. `key` descends, `*` crosses a record's values, and a\n// `[]` suffix crosses the array found there.\nconst reach = (value: unknown, pattern: string): { path: (string | number)[]; value: unknown }[] => {\n let frontier: { path: (string | number)[]; value: unknown }[] = [{ path: [], value }];\n for (const segment of pattern.split('.')) {\n const array = segment.endsWith('[]');\n const key = array ? segment.slice(0, -2) : segment;\n const next: { path: (string | number)[]; value: unknown }[] = [];\n for (const at of frontier) {\n if (!isRecord(at.value)) continue;\n const found: { path: (string | number)[]; value: unknown }[] =\n key === '*'\n ? Object.entries(at.value).map(([k, v]) => ({ path: [...at.path, k], value: v }))\n : key in at.value\n ? [{ path: [...at.path, key], value: at.value[key] }]\n : [];\n for (const f of found) {\n if (!array) next.push(f);\n else if (Array.isArray(f.value)) f.value.forEach((item, i) => next.push({ path: [...f.path, i], value: item }));\n }\n }\n frontier = next;\n }\n return frontier;\n};\n\nconst getAt = (root: unknown, path: readonly (string | number)[]): unknown =>\n path.reduce<unknown>((at, key) => {\n if (typeof key === 'number') return Array.isArray(at) ? at[key] : undefined;\n return isRecord(at) ? at[key] : undefined;\n }, root);\n\nconst setAt = (root: unknown, path: readonly (string | number)[], value: unknown): unknown => {\n const [head, ...rest] = path;\n if (head === undefined) return value;\n if (typeof head === 'number' && Array.isArray(root)) return root.map((item, i) => (i === head ? setAt(item, rest, value) : item));\n if (typeof head === 'string' && isRecord(root)) return { ...root, [head]: setAt(root[head], rest, value) };\n return root;\n};\n\nexport const createUpgrader = async (sequences: readonly Sequence[], options: { transform: Transform }): Promise<Upgrader> => {\n const prepared = await prepare(sequences);\n const tables = prepared.filter((s) => !s.grammar);\n if (tables.length > 0) {\n throw new StrataError(\n 'WRONG_OWNER',\n 'Documents are upgraded by grammar sequences; these own tables and belong to a database\\'s ledger (`migrate`).',\n tables.map((s) => s.id),\n );\n }\n const grammars: readonly PreparedSequence[] = prepared;\n\n const kinds = new Map<string, DocumentKind>();\n for (const sequence of grammars) {\n for (const [name, kind] of Object.entries(sequence.documents)) kinds.set(`${sequence.id}/${name}`, kind);\n }\n const unknown = [\n ...grammars.flatMap((s) => s.migrations.flatMap((m) => m.steps.flatMap((step) => (step.kind === 'document' && !kinds.has(step.at) ? [`${m.ref} rewrites ${step.at}`] : [])))),\n ...[...kinds].flatMap(([ref, kind]) => Object.entries(kind.embeds ?? {}).flatMap(([path, target]) => (kinds.has(target) ? [] : [`${ref} embeds ${target} at ${path}`]))),\n ];\n if (unknown.length > 0) throw new StrataError('UNKNOWN_KIND', 'A document kind is named that no sequence declares.', unknown);\n\n const stamp: Stamp = Object.fromEntries(grammars.map((s) => [s.id, s.migrations.length]));\n\n const locate = (document: unknown, kind: string): Location[] => {\n if (!kinds.has(kind)) throw new StrataError('UNKNOWN_KIND', `No sequence declares the document kind \"${kind}\".`, [...kinds.keys()]);\n const found: Location[] = [];\n const visit = (value: unknown, at: string, path: (string | number)[]): void => {\n if (!isRecord(value)) return;\n found.push({ path, kind: at, value });\n for (const [pattern, target] of Object.entries(kinds.get(at)?.embeds ?? {})) {\n for (const hit of reach(value, pattern)) visit(hit.value, target, [...path, ...hit.path]);\n }\n };\n visit(document, kind, []);\n return found;\n };\n\n const positionOf = (given: Stamp | null | undefined, id: string): number => given?.[id] ?? 0;\n\n const behind = (given: Stamp | null | undefined): boolean => {\n const ahead = grammars.filter((s) => positionOf(given, s.id) > s.migrations.length);\n if (ahead.length > 0) {\n throw new StrataError(\n 'TOO_NEW',\n 'This document was written by newer code than this — reading it would be guessing.',\n ahead.map((s) => `${s.id}: the document is at ${positionOf(given, s.id)}, this code knows ${s.migrations.length}`),\n );\n }\n return grammars.some((s) => positionOf(given, s.id) < s.migrations.length);\n };\n\n const upgrade = (document: unknown, { kind, stamp: given }: { kind: string; stamp?: Stamp | null }): UpgradeResult => {\n if (!isRecord(document)) throw new StrataError('STEP_FAILED', `A ${kind} document must be a JSON object.`);\n if (!kinds.has(kind)) throw new StrataError('UNKNOWN_KIND', `No sequence declares the document kind \"${kind}\".`, [...kinds.keys()]);\n if (!behind(given)) return { document, stamp, applied: [] };\n\n // What this document has seen: everything up to its stamp, per sequence.\n // A sequence it has never heard of starts at 0 — a document written before\n // a grammar existed simply has none of its migrations yet.\n const done = new Set(grammars.flatMap((s) => s.migrations.filter((m) => m.n <= positionOf(given, s.id)).map((m) => m.ref)));\n const { pending, stuck } = orderPending(\n grammars.map((s) => ({ waiting: s.migrations.filter((m) => !done.has(m.ref)) })),\n done,\n );\n if (stuck.length > 0) throw new StrataError('CYCLE', 'Document migrations wait on each other and can never run.', stuck.map((m) => m.ref));\n\n let current: Record<string, unknown> = document;\n const applied: string[] = [];\n const runStep = (migration: PreparedMigration, at: string, transform: unknown): void => {\n // Deepest first: a parent's rewrite sees its children already rewritten,\n // and replacing a child never moves the path to its parent.\n const targets = locate(current, kind)\n .filter((l) => l.kind === at)\n .sort((a, b) => b.path.length - a.path.length);\n for (const target of targets) {\n // The value NOW, not when the targets were found: a child rewritten a\n // moment ago lives in `current`, and the parent must see — and keep — it.\n const value = getAt(current, target.path);\n let rewritten: unknown;\n try {\n rewritten = options.transform(transform, { document: value, path: pathText(target.path) });\n } catch (cause) {\n throw new StrataError(\n 'STEP_FAILED',\n `${migration.ref} (\"${migration.description}\") failed on the ${at} at ${pathText(target.path) || '(root)'}.`,\n [cause instanceof Error ? cause.message : String(cause)],\n { cause },\n );\n }\n if (!isRecord(rewritten)) {\n throw new StrataError('STEP_FAILED', `${migration.ref} turned the ${at} at ${pathText(target.path) || '(root)'} into something that is not a document.`, [\n JSON.stringify(rewritten)?.slice(0, 200) ?? String(rewritten),\n ]);\n }\n const next = setAt(current, target.path, rewritten);\n if (isRecord(next)) current = next;\n }\n };\n for (const migration of pending) {\n for (const step of migration.steps) if (step.kind === 'document') runStep(migration, step.at, step.transform);\n applied.push(migration.ref);\n }\n return { document: current, stamp, applied };\n };\n\n return { stamp, upgrade, locate, behind };\n};\n","import type { SqlStep } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// A DDL file as steps — one statement each, because a driver that prepares\n// statements refuses a string carrying several.\n//\n// Splitting on every `;` is wrong, and quietly: a comment that contains one\n// (\"-- each is a role; `remit` says…\") is cut in two, its tail becomes a line of\n// SQL, and the step fails on the database it was meant to set up. A statement\n// here ends only at a `;` that closes a line of SQL; comment lines never end\n// one. Comments stay in the steps (the checksum ignores full-line comments).\n//\n// Not a SQL parser: a `;` at the end of a line inside a string literal or a\n// function body would still end a statement. Write those as their own steps.\n// ═══════════════════════════════════════════════════════════════\n\nconst isComment = (line: string): boolean => line.trim().startsWith('--');\n\nexport const sqlSteps = (ddl: string): SqlStep[] => {\n const steps: SqlStep[] = [];\n let buffer: string[] = [];\n const flush = (): void => {\n const sql = buffer.join('\\n').trim().replace(/;\\s*$/, '').trim();\n if (sql.split('\\n').some((line) => line.trim() !== '' && !isComment(line))) steps.push({ kind: 'sql', sql });\n buffer = [];\n };\n for (const line of ddl.split('\\n')) {\n buffer.push(line);\n if (!isComment(line) && line.trimEnd().endsWith(';')) flush();\n }\n flush();\n return steps;\n};\n","// ═══════════════════════════════════════════════════════════\n// HOW DEEP A DOCUMENT MAY NEST, checked before a schema reads it. The\n// grammars are recursive (a layout's children, a Prism `$if`, a Vex `and`),\n// and a recursive schema recurses on the call stack: a document a few\n// thousand levels deep does not come back from `safeParse` refused, it throws\n// RangeError from inside the parser — at the one place meant to turn bad input\n// into a refusal. So every boundary that parses a document from outside asks\n// this first, and a document past the limit is refused like any other\n// invalid one.\n//\n// 256 levels of JSON. The deepest document in the lab apps is 25 (relay's\n// deal view: a layout's nodes, their props and bindings); a stranger's is\n// either near that or not a document anybody wrote. The walk is iterative, so\n// asking cannot overflow the stack either.\n// ═══════════════════════════════════════════════════════════\n\nexport const DOCUMENT_DEPTH_LIMIT = 256;\n\nexport const exceedsDepth = (value: unknown, limit: number = DOCUMENT_DEPTH_LIMIT): boolean => {\n const pending: { value: unknown; depth: number }[] = [{ value, depth: 0 }];\n for (let next = pending.pop(); next !== undefined; next = pending.pop()) {\n if (typeof next.value !== 'object' || next.value === null) continue;\n const depth = next.depth + 1;\n if (depth > limit) return true;\n for (const inner of Array.isArray(next.value) ? next.value : Object.values(next.value)) pending.push({ value: inner, depth });\n }\n return false;\n};\n\nexport const depthRefusal = (limit: number = DOCUMENT_DEPTH_LIMIT): string =>\n `the document nests deeper than ${limit} levels — no document is written that deep, and a schema reading one would overflow the stack`;\n","// @niscorp/strata — the core: the grammar of a migration, the plan, the errors.\n// Pure and storage-blind; `@niscorp/strata/postgres` applies a plan to a database.\n\nimport type { Sequence } from './schema';\n\nexport { SequenceSchema, MigrationSchema, StepSchema, SqlStepSchema, DocumentStepSchema, DocumentKindSchema, SEQUENCE_ID, MIGRATION_REF, KIND_NAME, KIND_REF, EMBED_PATH } from './schema';\nexport type { Sequence, Migration, Step, SqlStep, DocumentStep, DocumentKind } from './schema';\nexport { createUpgrader } from './documents';\nexport type { Stamp, Location, Transform, Upgrader, UpgradeResult } from './documents';\nexport { prepare, planMigrations, refuseProblems, orderPending } from './plan';\nexport type { Plan, Problem, PreparedMigration, PreparedSequence, LedgerRow } from './plan';\nexport { checksumOf } from './checksum';\nexport { sqlSteps } from './sql';\nexport { DOCUMENT_DEPTH_LIMIT, exceedsDepth, depthRefusal } from './depth';\nexport { StrataError } from './errors';\nexport type { StrataErrorCode } from './errors';\n\n// Authoring helper: a sequence, type-checked where it is written. Parsing\n// happens where it is applied (`prepare`), like every other artifact.\nexport const defineSequence = <const T extends Sequence>(sequence: T): T => sequence;\n"]}
|
package/dist/index.d.cts
ADDED
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
import { M as Migration, S as SqlStep, a as Sequence } from './documents-BjlM94Ea.cjs';
|
|
2
|
+
export { D as DocumentKind, b as DocumentKindSchema, c as DocumentStep, d as DocumentStepSchema, E as EMBED_PATH, K as KIND_NAME, e as KIND_REF, L as Location, f as MIGRATION_REF, g as MigrationSchema, h as SEQUENCE_ID, i as SequenceSchema, j as SqlStepSchema, k as Stamp, l as Step, m as StepSchema, T as Transform, U as UpgradeResult, n as Upgrader, o as createUpgrader } from './documents-BjlM94Ea.cjs';
|
|
3
|
+
export { L as LedgerRow, P as Plan, a as PreparedMigration, b as PreparedSequence, c as Problem, S as StrataError, d as StrataErrorCode, o as orderPending, p as planMigrations, e as prepare, r as refuseProblems } from './plan-BEIlXVUt.cjs';
|
|
4
|
+
import 'zod';
|
|
5
|
+
|
|
6
|
+
declare const checksumOf: (migration: Migration) => Promise<string>;
|
|
7
|
+
|
|
8
|
+
declare const sqlSteps: (ddl: string) => SqlStep[];
|
|
9
|
+
|
|
10
|
+
declare const DOCUMENT_DEPTH_LIMIT = 256;
|
|
11
|
+
declare const exceedsDepth: (value: unknown, limit?: number) => boolean;
|
|
12
|
+
declare const depthRefusal: (limit?: number) => string;
|
|
13
|
+
|
|
14
|
+
declare const defineSequence: <const T extends Sequence>(sequence: T) => T;
|
|
15
|
+
|
|
16
|
+
export { DOCUMENT_DEPTH_LIMIT, Migration, Sequence, SqlStep, checksumOf, defineSequence, depthRefusal, exceedsDepth, sqlSteps };
|
package/dist/index.d.ts
ADDED
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
import { M as Migration, S as SqlStep, a as Sequence } from './documents-BjlM94Ea.js';
|
|
2
|
+
export { D as DocumentKind, b as DocumentKindSchema, c as DocumentStep, d as DocumentStepSchema, E as EMBED_PATH, K as KIND_NAME, e as KIND_REF, L as Location, f as MIGRATION_REF, g as MigrationSchema, h as SEQUENCE_ID, i as SequenceSchema, j as SqlStepSchema, k as Stamp, l as Step, m as StepSchema, T as Transform, U as UpgradeResult, n as Upgrader, o as createUpgrader } from './documents-BjlM94Ea.js';
|
|
3
|
+
export { L as LedgerRow, P as Plan, a as PreparedMigration, b as PreparedSequence, c as Problem, S as StrataError, d as StrataErrorCode, o as orderPending, p as planMigrations, e as prepare, r as refuseProblems } from './plan-BAewc8DG.js';
|
|
4
|
+
import 'zod';
|
|
5
|
+
|
|
6
|
+
declare const checksumOf: (migration: Migration) => Promise<string>;
|
|
7
|
+
|
|
8
|
+
declare const sqlSteps: (ddl: string) => SqlStep[];
|
|
9
|
+
|
|
10
|
+
declare const DOCUMENT_DEPTH_LIMIT = 256;
|
|
11
|
+
declare const exceedsDepth: (value: unknown, limit?: number) => boolean;
|
|
12
|
+
declare const depthRefusal: (limit?: number) => string;
|
|
13
|
+
|
|
14
|
+
declare const defineSequence: <const T extends Sequence>(sequence: T) => T;
|
|
15
|
+
|
|
16
|
+
export { DOCUMENT_DEPTH_LIMIT, Migration, Sequence, SqlStep, checksumOf, defineSequence, depthRefusal, exceedsDepth, sqlSteps };
|
package/dist/index.js
ADDED
|
@@ -0,0 +1,42 @@
|
|
|
1
|
+
export { createUpgrader } from './chunk-ICWKTTKN.js';
|
|
2
|
+
export { DocumentKindSchema, DocumentStepSchema, EMBED_PATH, KIND_NAME, KIND_REF, MIGRATION_REF, MigrationSchema, SEQUENCE_ID, SequenceSchema, SqlStepSchema, StepSchema, checksumOf, orderPending, planMigrations, prepare, refuseProblems } from './chunk-U5CPF4LQ.js';
|
|
3
|
+
export { StrataError } from './chunk-EGFF63GA.js';
|
|
4
|
+
|
|
5
|
+
// src/sql.ts
|
|
6
|
+
var isComment = (line) => line.trim().startsWith("--");
|
|
7
|
+
var sqlSteps = (ddl) => {
|
|
8
|
+
const steps = [];
|
|
9
|
+
let buffer = [];
|
|
10
|
+
const flush = () => {
|
|
11
|
+
const sql = buffer.join("\n").trim().replace(/;\s*$/, "").trim();
|
|
12
|
+
if (sql.split("\n").some((line) => line.trim() !== "" && !isComment(line))) steps.push({ kind: "sql", sql });
|
|
13
|
+
buffer = [];
|
|
14
|
+
};
|
|
15
|
+
for (const line of ddl.split("\n")) {
|
|
16
|
+
buffer.push(line);
|
|
17
|
+
if (!isComment(line) && line.trimEnd().endsWith(";")) flush();
|
|
18
|
+
}
|
|
19
|
+
flush();
|
|
20
|
+
return steps;
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
// src/depth.ts
|
|
24
|
+
var DOCUMENT_DEPTH_LIMIT = 256;
|
|
25
|
+
var exceedsDepth = (value, limit = DOCUMENT_DEPTH_LIMIT) => {
|
|
26
|
+
const pending = [{ value, depth: 0 }];
|
|
27
|
+
for (let next = pending.pop(); next !== void 0; next = pending.pop()) {
|
|
28
|
+
if (typeof next.value !== "object" || next.value === null) continue;
|
|
29
|
+
const depth = next.depth + 1;
|
|
30
|
+
if (depth > limit) return true;
|
|
31
|
+
for (const inner of Array.isArray(next.value) ? next.value : Object.values(next.value)) pending.push({ value: inner, depth });
|
|
32
|
+
}
|
|
33
|
+
return false;
|
|
34
|
+
};
|
|
35
|
+
var depthRefusal = (limit = DOCUMENT_DEPTH_LIMIT) => `the document nests deeper than ${limit} levels \u2014 no document is written that deep, and a schema reading one would overflow the stack`;
|
|
36
|
+
|
|
37
|
+
// src/index.ts
|
|
38
|
+
var defineSequence = (sequence) => sequence;
|
|
39
|
+
|
|
40
|
+
export { DOCUMENT_DEPTH_LIMIT, defineSequence, depthRefusal, exceedsDepth, sqlSteps };
|
|
41
|
+
//# sourceMappingURL=index.js.map
|
|
42
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/sql.ts","../src/depth.ts","../src/index.ts"],"names":[],"mappings":";;;;;AAgBA,IAAM,YAAY,CAAC,IAAA,KAA0B,KAAK,IAAA,EAAK,CAAE,WAAW,IAAI,CAAA;AAEjE,IAAM,QAAA,GAAW,CAAC,GAAA,KAA2B;AAClD,EAAA,MAAM,QAAmB,EAAC;AAC1B,EAAA,IAAI,SAAmB,EAAC;AACxB,EAAA,MAAM,QAAQ,MAAY;AACxB,IAAA,MAAM,GAAA,GAAM,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,IAAA,EAAK,CAAE,OAAA,CAAQ,OAAA,EAAS,EAAE,CAAA,CAAE,IAAA,EAAK;AAC/D,IAAA,IAAI,GAAA,CAAI,MAAM,IAAI,CAAA,CAAE,KAAK,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,EAAK,KAAM,EAAA,IAAM,CAAC,SAAA,CAAU,IAAI,CAAC,CAAA,EAAG,KAAA,CAAM,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,GAAA,EAAK,CAAA;AAC3G,IAAA,MAAA,GAAS,EAAC;AAAA,EACZ,CAAA;AACA,EAAA,KAAA,MAAW,IAAA,IAAQ,GAAA,CAAI,KAAA,CAAM,IAAI,CAAA,EAAG;AAClC,IAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAChB,IAAA,IAAI,CAAC,SAAA,CAAU,IAAI,CAAA,IAAK,IAAA,CAAK,SAAQ,CAAE,QAAA,CAAS,GAAG,CAAA,EAAG,KAAA,EAAM;AAAA,EAC9D;AACA,EAAA,KAAA,EAAM;AACN,EAAA,OAAO,KAAA;AACT;;;AChBO,IAAM,oBAAA,GAAuB;AAE7B,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgB,KAAA,GAAgB,oBAAA,KAAkC;AAC7F,EAAA,MAAM,UAA+C,CAAC,EAAE,KAAA,EAAO,KAAA,EAAO,GAAG,CAAA;AACzE,EAAA,KAAA,IAAS,IAAA,GAAO,QAAQ,GAAA,EAAI,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,OAAA,CAAQ,GAAA,EAAI,EAAG;AACvE,IAAA,IAAI,OAAO,IAAA,CAAK,KAAA,KAAU,QAAA,IAAY,IAAA,CAAK,UAAU,IAAA,EAAM;AAC3D,IAAA,MAAM,KAAA,GAAQ,KAAK,KAAA,GAAQ,CAAA;AAC3B,IAAA,IAAI,KAAA,GAAQ,OAAO,OAAO,IAAA;AAC1B,IAAA,KAAA,MAAW,SAAS,KAAA,CAAM,OAAA,CAAQ,KAAK,KAAK,CAAA,GAAI,KAAK,KAAA,GAAQ,MAAA,CAAO,OAAO,IAAA,CAAK,KAAK,GAAG,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,KAAA,EAAO,OAAO,CAAA;AAAA,EAC9H;AACA,EAAA,OAAO,KAAA;AACT;AAEO,IAAM,YAAA,GAAe,CAAC,KAAA,GAAgB,oBAAA,KAC3C,kCAAkC,KAAK,CAAA,kGAAA;;;ACXlC,IAAM,cAAA,GAAiB,CAA2B,QAAA,KAAmB","file":"index.js","sourcesContent":["import type { SqlStep } from './schema';\n\n// ═══════════════════════════════════════════════════════════════\n// A DDL file as steps — one statement each, because a driver that prepares\n// statements refuses a string carrying several.\n//\n// Splitting on every `;` is wrong, and quietly: a comment that contains one\n// (\"-- each is a role; `remit` says…\") is cut in two, its tail becomes a line of\n// SQL, and the step fails on the database it was meant to set up. A statement\n// here ends only at a `;` that closes a line of SQL; comment lines never end\n// one. Comments stay in the steps (the checksum ignores full-line comments).\n//\n// Not a SQL parser: a `;` at the end of a line inside a string literal or a\n// function body would still end a statement. Write those as their own steps.\n// ═══════════════════════════════════════════════════════════════\n\nconst isComment = (line: string): boolean => line.trim().startsWith('--');\n\nexport const sqlSteps = (ddl: string): SqlStep[] => {\n const steps: SqlStep[] = [];\n let buffer: string[] = [];\n const flush = (): void => {\n const sql = buffer.join('\\n').trim().replace(/;\\s*$/, '').trim();\n if (sql.split('\\n').some((line) => line.trim() !== '' && !isComment(line))) steps.push({ kind: 'sql', sql });\n buffer = [];\n };\n for (const line of ddl.split('\\n')) {\n buffer.push(line);\n if (!isComment(line) && line.trimEnd().endsWith(';')) flush();\n }\n flush();\n return steps;\n};\n","// ═══════════════════════════════════════════════════════════\n// HOW DEEP A DOCUMENT MAY NEST, checked before a schema reads it. The\n// grammars are recursive (a layout's children, a Prism `$if`, a Vex `and`),\n// and a recursive schema recurses on the call stack: a document a few\n// thousand levels deep does not come back from `safeParse` refused, it throws\n// RangeError from inside the parser — at the one place meant to turn bad input\n// into a refusal. So every boundary that parses a document from outside asks\n// this first, and a document past the limit is refused like any other\n// invalid one.\n//\n// 256 levels of JSON. The deepest document in the lab apps is 25 (relay's\n// deal view: a layout's nodes, their props and bindings); a stranger's is\n// either near that or not a document anybody wrote. The walk is iterative, so\n// asking cannot overflow the stack either.\n// ═══════════════════════════════════════════════════════════\n\nexport const DOCUMENT_DEPTH_LIMIT = 256;\n\nexport const exceedsDepth = (value: unknown, limit: number = DOCUMENT_DEPTH_LIMIT): boolean => {\n const pending: { value: unknown; depth: number }[] = [{ value, depth: 0 }];\n for (let next = pending.pop(); next !== undefined; next = pending.pop()) {\n if (typeof next.value !== 'object' || next.value === null) continue;\n const depth = next.depth + 1;\n if (depth > limit) return true;\n for (const inner of Array.isArray(next.value) ? next.value : Object.values(next.value)) pending.push({ value: inner, depth });\n }\n return false;\n};\n\nexport const depthRefusal = (limit: number = DOCUMENT_DEPTH_LIMIT): string =>\n `the document nests deeper than ${limit} levels — no document is written that deep, and a schema reading one would overflow the stack`;\n","// @niscorp/strata — the core: the grammar of a migration, the plan, the errors.\n// Pure and storage-blind; `@niscorp/strata/postgres` applies a plan to a database.\n\nimport type { Sequence } from './schema';\n\nexport { SequenceSchema, MigrationSchema, StepSchema, SqlStepSchema, DocumentStepSchema, DocumentKindSchema, SEQUENCE_ID, MIGRATION_REF, KIND_NAME, KIND_REF, EMBED_PATH } from './schema';\nexport type { Sequence, Migration, Step, SqlStep, DocumentStep, DocumentKind } from './schema';\nexport { createUpgrader } from './documents';\nexport type { Stamp, Location, Transform, Upgrader, UpgradeResult } from './documents';\nexport { prepare, planMigrations, refuseProblems, orderPending } from './plan';\nexport type { Plan, Problem, PreparedMigration, PreparedSequence, LedgerRow } from './plan';\nexport { checksumOf } from './checksum';\nexport { sqlSteps } from './sql';\nexport { DOCUMENT_DEPTH_LIMIT, exceedsDepth, depthRefusal } from './depth';\nexport { StrataError } from './errors';\nexport type { StrataErrorCode } from './errors';\n\n// Authoring helper: a sequence, type-checked where it is written. Parsing\n// happens where it is applied (`prepare`), like every other artifact.\nexport const defineSequence = <const T extends Sequence>(sequence: T): T => sequence;\n"]}
|