@voltro/database 0.87.0 → 0.88.0

package/dist/identifierLimits.js

@@ -1,4 +1,4 @@
-//#region src/identifierLimits.ts
+// src/identifierLimits.ts
 var e = 63, t = 60, n = /* @__PURE__ */ new Set(), r = (e) => {
 	n.add(e);
 }, i = () => {
@@ -28,5 +28,4 @@ var e = 63, t = 60, n = /* @__PURE__ */ new Set(), r = (e) => {
 	}
 	e.length > 60 && r(`typeid prefix '${e}' on table '${t.tableName}' is ${e.length} chars — close to the 63-byte limit. Generated ids will be even longer (prefix + '_' + 26).`);
 };
-//#endregion
 export { e as MAX_IDENTIFIER_LENGTH, t as WARN_IDENTIFIER_LENGTH, i as drainIdentifierWarnings, c as validateColumnName, l as validateIndexName, s as validateTableName, u as validateTypeIdPrefix };

package/dist/index.d.ts

@@ -4,6 +4,7 @@ import { Duration } from 'effect/Duration';
 import { Effect } from 'effect';
 import { Exit } from 'effect';
 import { Layer } from 'effect';
+import { NonEmptyReadonlyArray } from 'effect/Array';
 import { Schedule } from 'effect';
 import { Schema } from 'effect';
 import { SqlClient } from 'effect/sql';
@@ -240,12 +241,9 @@ export declare interface AuditActor {
 export declare const auditAllTableIndexes: (tables: ReadonlyArray<Table<string, Record<string, ColumnDefinition<unknown>>, boolean, string>>) => ReadonlyArray<IndexAuditIssue>;
 
 /**
- * Find all index-overlap issues on a single table. Pure function; no
- * side effects. Returns an empty array when the schema is clean.
- *
- * Pair deduplication: each (a, b) collision is reported ONCE, never
- * (a, b) AND (b, a). For `duplicate-fields` we keep the lexicographic
- * lower name as `redundant` so the message is stable across re-runs.
+ * Find index-overlap issues on a single table. Each pair is reported once.
+ * When coverage holds in both directions, the lower name is redundant for
+ * stable output. Otherwise only the proven direction may recommend a drop.
  */
 export declare const auditTableIndexes: (table: Table<string, Record<string, ColumnDefinition<unknown>>, boolean, string>) => ReadonlyArray<IndexAuditIssue>;
 
@@ -904,7 +902,7 @@ export declare const changeUpdate: (table: string, before: Row, after: Row, meta
  *
  * `undefined` limits (an unknown dialect) → one group, unchanged behaviour.
  */
-export declare const chunkRowsForInsert: <T extends Record<string, unknown>>(rows: ReadonlyArray<T>, limits: BulkInsertLimits | undefined) => ReadonlyArray<ReadonlyArray<T>>;
+export declare const chunkRowsForInsert: <T extends Record<string, unknown>>(rows: ReadonlyArray<T>, limits: BulkInsertLimits | undefined) => ReadonlyArray<NonEmptyReadonlyArray<T>>;
 
 /**
  * The id of the key a ciphertext names, read off the value without any key —

package/dist/index.js

@@ -77,7 +77,6 @@ import { CDC_OFFSETS_TABLE as Uo, _voltroCdcOffsetsTable as Wo, _voltroMssqlCdcO
 import { DATA_TRANSFERS_TABLE as Ko, _voltroDataTransfersTable as qo, describeTransferRun as Jo } from "./dataTransfers.js";
 import { SCOPE_KEY_MAX_LENGTH as Yo, scopeKeyOf as Xo } from "./scopeKey.js";
 import { SqlClient as Zo } from "effect/sql";
-//#region src/index.ts
+// src/index.ts
 var Qo = "postgres";
-//#endregion
 export { _t as AUTO_FILLED_COLUMNS, Ne as BOUND_ENCRYPTED_PREFIX, vo as BULK_INSERT_LIMITS, Ii as BranchNameInvalid, Li as BranchTransitionInvalid, Uo as CDC_OFFSETS_TABLE, wr as CHANGE_CLAIM_TTL_ENV, Ao as CHANGE_LISTENER_CEILING, e as ColumnBuilder, Ko as DATA_TRANSFERS_TABLE, xt as DEFAULT_ACQUIRE_TIMEOUT_MS, Tr as DEFAULT_CHANGE_CLAIM_TTL_HOURS, ti as DEFAULT_EAGER_FALLBACK_WARN_INTERVAL_MS, Na as DEFAULT_SOFT_DROP_RETENTION_DAYS, Mn as DEFAULT_SUBJECT_GRAPH_DEPTH, Pe as ENCRYPTED_PREFIX, Qo as ENGINE, Jn as EagerCardinalityError, Fe as FIELD_KEY_ID_PATTERN, xa as FILE_MIGRATION_PATTERN, Pa as FRAMEWORK_LIVE_TABLES, Ie as FieldDecryptionError, Ur as ID_COLUMN_MAX_LENGTH, cn as INITIAL_VERSION, Sa as IrreversibleMigrationError, Z as MATCHES_NO_ROWS, $e as MAX_IDENTIFIER_LENGTH, Ca as MIGRATION_PHASES, yi as MSSQL_TRANSIENT_NUMBERS, bi as MYSQL_TRANSIENT_CODES, wa as MigrationExpectationFailed, Ta as MigrationNeedsSqlClient, Ea as MigrationSkipped, Er as OccurrenceCounter, xi as POSTGRES_TRANSIENT_STATES, so as REPLACE_IN_PROGRESS_TABLE, Da as RewriteUnstableError, Yo as SCOPE_KEY_MAX_LENGTH, t as SELF_REFERENCE_TARGET, li as SHARED_TRANSACTION_SERVICE, Si as SQLITE_TRANSIENT_CODES, co as STAGING_STALE_MINUTES, Fa as STAGING_TABLE_PREFIX, Zo as SqlClient, no as TENANT_SELECTIONS_TABLE, Ci as TURSO_TRANSIENT_MESSAGE, ji as TableStreamError, $n as TenantNamespaceInvalid, er as TenantNamespaceUnresolved, ea as TenantRegionUnavailable, ta as TenantResidencyUnresolved, ui as TransactionAbortedError, Oa as TransactionBrokenByBodyError, Ti as VOLTRO_EXPIRES_MIXIN_ID, Di as VOLTRO_LOCAL_FIRST_MIXIN_ID, ln as VersionConflict, et as WARN_IDENTIFIER_LENGTH, Ua as _voltroApiKeysTable, Wa as _voltroApiRoleWorkloadBucketsTable, Wo as _voltroCdcOffsetsTable, qo as _voltroDataTransfersTable, Ga as _voltroDevicesTable, Ka as _voltroIdempotencyTable, qa as _voltroKvTable, Ja as _voltroMigrationPlansTable, Ya as _voltroMigrationsTable, Go as _voltroMssqlCdcOffsetsTable, Xa as _voltroPluginMigrationsTable, lo as _voltroReplaceInProgressTable, Za as _voltroReplicaObservationsTable, Qa as _voltroSchemaOwnerTable, $a as _voltroSeedsTable, eo as _voltroTenantSelectionsTable, gr as actorsTable, Xi as admitBranch, Ia as agedSoftDropSnapshots, De as allEnumRenames, Tn as allRegisteredRelations, Tt as allRegisteredTables, Q as and, Gn as applyJsonPatch, n as array, $ as arrayContains, ee as arrayHas, te as arrayOverlaps, Yn as attachEagerLoads, jr as attributionFields, Fr as attributionKey, ua as auditAllTableIndexes, da as auditTableIndexes, R as authoredError, z as authoredMessageOf, Nt as avg, Pt as avgOver, Ir as beginLocalWrite, r as bigint, na as bindResidentStore, i as boolean, Ri as branchNamespaceName, yo as bulkInsertLimitsFor, a as bytes, B as causeBranches, _r as changeDelete, Dr as changeDigest, vr as changeInsert, yr as changeSoftDelete, br as changeUpdate, bo as chunkRowsForInsert, Le as ciphertextKeyId, Lr as claimPendingAttribution, V as classifyConstraintViolation, Oe as clearEnumRenames, Rr as clearPendingAttribution, En as clearRelationsRegistry, ra as clearResidencyConfig, Lo as clearRetentions, Et as clearTableRegistry, Kr as clearWriteRecorders, dr as coercePredicateForSqlite, ir as coercePredicateValue, ar as coercePredicateValues, Qn as coerceValueForSqlite, ne as collectSubqueries, Ft as column, I as columnRef, hn as columnSchema, xo as columnsPerRow, Sr as committedChangeBatchOf, Y as compareDecimal, fr as compileEagerJson, Kn as compileJsonPatch, or as compilePredicate, sr as compileRawFragment, cr as compileRowProjection, lr as compileSelect, Or as composeChangeKey, Pi as computeEmbedding, Po as connectionIdentity, re as contains, It as count, Lt as countDistinct, o as crdtCounter, s as crdtDoc, c as crdtManagedColumns, l as crdtManagedColumnsOf, u as crdtSealed, d as crdtText, Mr as currentWriteAttribution, Rt as databaseHandle, f as date, p as dbEnum, ni as dbMetricTagCacheSizeForTests, ri as dbOperationsInFlight, m as decimal, X as decimalEqualityKey, ke as declareEnumRename, Re as decodeFieldValue, Fn as decodeRowsForTable, In as decodeRowsFromSchema, Ln as decodeSelectRows, ze as decryptFieldsOnRead, ya as defineMigration, mt as defineMixin, pa as defineSeed, ro as deleteTenantSelection, zt as denseRank, Nn as deriveSubjectGraph, dt as deriveTypeIdPrefix, Wr as derivedRowId, Gr as derivedRowIdLength, La as describeAgedSoftDropSnapshots, H as describeCharsetRefusal, U as describeDriverError, W as describeRowBindings, Jo as describeTransferRun, je as deserializeArraysOnRead, tt as drainIdentifierWarnings, h as dropped, Cr as emitCommittedChanges, Be as encodeFieldValue, Rn as encodeRowForSchema, ot as encodeTypeIdSuffix, Ve as encryptFieldsForWrite, He as encryptFieldsForWriteBatch, Ue as encryptedColumnsOf, zr as endLocalWrite, zi as enforceBranchLimits, Dt as ensureTableRegistered, ie as eq, ur as escapeLike, ae as evaluatePredicate, Bt as except, oe as exists, Ei as expires, xr as externalChangeEvent, G as extractDbCause, We as fieldBinding, Ge as fieldBindingsOf, ma as fireSchemaChangeSeeds, ha as fireTenantCreateSeeds, fa as formatIndexAuditIssue, Pn as formatSubjectGraph, to as frameworkTables, ft as generateId, lt as generateSnowflake, g as geography, _ as geometry, Ae as getEnumRenames, Dn as getRelation, On as getRelations, ia as getResidencyConfig, Ot as getTable, se as gt, ce as gte, Xn as hasEagerLoads, Ni as hybridSearch, v as id, le as inSet, ue as inSubquery, _n as inferForeignKey, wo as insertIgnoreRowOutcome, To as insertManyRows, Eo as insertRow, y as integer, uo as interruptedReplaceRefusal, Vt as intersect, b as interval, ka as irreversible, Aa as irreversibleReason, Ke as isBoundCiphertext, Bi as isBranchNamespace, L as isColumnReference, Vn as isCompositeRowKey, vn as isEmptyRelationsSpec, qe as isEncrypted, Je as isFieldDecryptionError, ja as isFileMigration, K as isForeignKeyViolation, Ra as isFrameworkOwnedLiveTable, Oi as isLocalFirst, ba as isMigrationDefinition, St as isMysqlFamily, Vi as isNeonConnection, de as isNotNull, fe as isNull, Mo as isPrimaryKeyConflictError, q as isQueryTimeout, Ye as isRawEncoding, aa as isRegionServable, yn as isRelationsSpec, ga as isSeedDefinition, za as isSoftDropSnapshotName, Ct as isSqliteFamily, Ba as isStagingTableName, kt as isTableReactive, di as isTransactionAbortedError, wi as isTransientContention, rn as isView, x as json, pe as jsonField, vt as jsonIndex, Wn as jsonPatchAssignments, Ht as lag, Ut as lead, Ro as listRetentionConflicts, zo as listRetentions, ki as localFirst, Ai as localFirstTables, me as lt, he as lte, ii as makeEagerFallbackReporter, Zi as makeNamespaceBranchExecutor, fi as makeTransactionAbortTracker, bn as many, xn as manyToMany, S as materializeFields, Wt as max, Ma as migration, Gt as min, So as missingConflictColumns, Co as missingRequiredColumns, ht as mixin, ge as neq, Hi as nextBranchState, Fo as normaliseTarget, qn as normalizeJsonPatchValue, _e as not, ve as notExists, ye as notInSet, be as notInSubquery, C as numeric, ai as observeDbOp, kr as occurrenceWindowMs, pi as onTransaction, Sn as one, Zn as oneCardinalityMessage, xe as or, Kt as orderClausesOf, qt as paginateBy, Jt as paginateById, Ar as parseChangeKey, Br as pendingAttributionCount, w as persistedColumns, Ui as planBranch, Wi as planBranchProvision, Gi as planBranchTeardown, Ki as planBranchTeardownFor, qi as planNeonBranchProvision, Ji as planNeonBranchTeardown, un as planVersionedUpdate, P as pluginRef, F as pluginRefSpecOf, Se as preparePredicate, No as primaryKeyConflictError, Qi as provisionBranch, oa as provisionResidentTenant, tr as qualifyTable, Yt as queryFor, an as queryForView, wt as quoteIdent, jo as raiseChangeListenerCeiling, Xt as rank, T as raw, io as readTenantSelection, E as readableByColumns, D as real, oi as recordDbOp, qr as recordsTable, O as reference, Xe as refuseIdChangeOfSealedRow, Ze as refuseWrite, pr as registerCoreTables, kn as registerDiscoveredRelations, Vr as registerPendingAttribution, An as registerRelations, Bo as registerRetention, At as registerTable, Jr as registerWriteRecorder, Cn as relations, mr as requireActors, jt as requireTable, hr as requireTenants, si as resetDbMetricTagCacheForTests, ut as resetSnowflake, sa as residentPlacement, Ee as resolveActorSnapshot, Yi as resolveBranchMechanism, ci as resolveEagerFallbackWarnIntervalMs, Hr as resolveEchoAttribution, Zt as resolveFullTextIndex, pt as resolveIdScheme, gt as resolveMixinGraph, ca as resolveTenantHome, nr as resolveTenantNamespace, Vo as retentionTtlMsFromEnv, Hn as rowKeyColumns, Un as rowKeyIdentity, Qt as rowNumber, gn as rowSchema, mi as runRetryingTransaction, hi as runSavepoint, gi as runStoreTransaction, Nr as runWithWriteAttribution, Yr as runWriteRecorders, Io as sameDatabase, rr as sanitizeIdentifierFragment, Xo as scopeKeyOf, k as selfReference, Me as serializeArraysForWrite, A as serverOnlyColumns, la as setResidencyConfig, _a as setSchemaChangeSeedHook, va as setTenantCreateSeedHook, _i as settleTransactionExit, dn as settleVersionedUpdate, Va as softDropSnapshotStamp, Ce as spatialPredicate, Ha as sqlError, fo as stagingLeftoverReport, po as stagingLeftovers, mo as stagingNamesOf, ho as stagingStaleAfterMs, go as stampGeneratedId, _o as stampGeneratedIds, we as startsWith, Qe as storeRefusalOf, Mi as streamTable, $t as sum, en as sumOver, Xr as suspendWriteRecorders, Zr as suspendWriteRecordersEffect, Ho as sweepRetention, yt as table, $i as teardownBranch, ao as tenantSelectionId, j as text, M as timestamp, pn as timestampMs, mn as timestampMsOrNull, vi as transactionRetrySchedule, st as typeId, tn as union, nn as unionAll, Mt as unregisterTable, Qr as unregisterWriteRecorder, Do as updateManyRow, Oo as upsertRow, ko as upsertRowOutcome, zn as upsertUpdatePatch, Bn as upsertUpdateValues, ct as uuidV7Bytes, nt as validateColumnName, rt as validateIndexName, jn as validateRegisteredRelations, wn as validateRelationConfig, it as validateTableName, at as validateTypeIdPrefix, N as vector, bt as vectorDistanceToOpclass, Fi as vectorEmbedding, fn as versionColumnOf, on as view, sn as viewSql, Te as walkLeaves, J as wireSafeCause, Pr as withCapturedAttribution, $r as writeImagesObserved, ei as writeRecordersSuspended, oo as writeTenantSelection };

package/dist/indexAudit.js

@@ -1,5 +1,5 @@
 import { ansi as e } from "@voltro/logger";
-//#region src/indexAudit.ts
+// src/indexAudit.ts
 var t = (e) => {
 	if (typeof e == "string") return e;
 	if ("jsonPath" in e) {
@@ -7,55 +7,56 @@ var t = (e) => {
 		return `(json:${t}->${n.join(".")}${r ? "::num" : ""})`;
 	}
 	return `(${e.expr})`;
-}, n = (e) => e.map(t), r = (e, n) => {
-	if (e.length !== n.length) return !1;
-	for (let r = 0; r < e.length; r++) if (t(e[r]) !== t(n[r])) return !1;
-	return !0;
-}, i = (e, n) => {
-	if (e.length >= n.length) return !1;
-	for (let r = 0; r < e.length; r++) if (t(e[r]) !== t(n[r])) return !1;
-	return !0;
-}, a = (e) => {
-	let t = [], a = e.appliedIndexes, o = e.tableName;
-	for (let e = 0; e < a.length; e++) {
-		let s = a[e];
-		for (let c = e + 1; c < a.length; c++) {
-			let e = a[c];
-			if (r(s.fields, e.fields)) {
-				let [r, i] = s.name < e.name ? [s, e] : [e, s];
-				t.push({
-					kind: "duplicate-fields",
-					table: o,
-					redundant: r,
-					coveredBy: i,
-					message: `'${o}' has two indexes on the same fields [${n(s.fields).join(", ")}]: '${s.name}' and '${e.name}'. The B-tree engine builds both, costing write throughput + disk space for no read benefit. Drop '${r.name}' (or '${i.name}' if you prefer the other name). Applies to every supported dialect (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
-				});
-			} else i(s.fields, e.fields) ? t.push({
-				kind: "redundant-prefix",
-				table: o,
-				redundant: s,
-				coveredBy: e,
-				message: `'${o}' index '${s.name}' on [${n(s.fields).join(", ")}] is a leading prefix of '${e.name}' on [${n(e.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${n(s.fields).join(", ")}] query from '${e.name}' too via the leading-prefix rule, so '${s.name}' adds write cost without read benefit. Drop '${s.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
-			}) : i(e.fields, s.fields) && t.push({
-				kind: "redundant-prefix",
-				table: o,
-				redundant: e,
-				coveredBy: s,
-				message: `'${o}' index '${e.name}' on [${n(e.fields).join(", ")}] is a leading prefix of '${s.name}' on [${n(s.fields).join(", ")}]. Every B-tree dialect we support (Postgres / MySQL / MariaDB / MSSQL / SQLite) can serve a [${n(e.fields).join(", ")}] query from '${s.name}' too via the leading-prefix rule, so '${e.name}' adds write cost without read benefit. Drop '${e.name}' — unless you specifically need a smaller index for cache locality on a write-heavy table (rare; profile first).`
+}, n = (e) => e.map(t), r = {
+	btree: !0,
+	gist: !1,
+	gin: !1,
+	brin: !1,
+	hnsw: !1
+}, i = (e) => typeof e == "string" ? JSON.stringify(["column", e]) : "jsonPath" in e ? JSON.stringify([
+	"json",
+	e.jsonPath.column,
+	e.jsonPath.path,
+	e.jsonPath.numeric ?? !1
+]) : JSON.stringify(["expression", e.expr]), a = (e, t) => {
+	if (!r[e.kind ?? "btree"] || !r[t.kind ?? "btree"] || e.fields.length === 0 || e.fields.length > t.fields.length || !e.fields.every((e, n) => i(e) === i(t.fields[n]))) return;
+	let n = e.where?.trim() || void 0, a = t.where?.trim() || void 0;
+	if ((a === void 0 || a === n) && (!e.unique || t.unique && e.fields.length === t.fields.length)) return e.fields.length === t.fields.length ? "duplicate-fields" : "redundant-prefix";
+}, o = (e) => {
+	let t = [], r = e.appliedIndexes, i = e.tableName;
+	for (let e = 0; e < r.length; e++) {
+		let o = r[e];
+		for (let s = e + 1; s < r.length; s++) {
+			let e = r[s], c = a(o, e), l = a(e, o);
+			if (!c && !l) continue;
+			let [u, d, f] = c && (!l || o.name < e.name) ? [
+				o,
+				e,
+				c
+			] : [
+				e,
+				o,
+				l
+			], p = f === "duplicate-fields" ? `has two indexes on the same fields [${n(u.fields).join(", ")}]: '${o.name}' and '${e.name}'.` : `index '${u.name}' on [${n(u.fields).join(", ")}] is a leading prefix of '${d.name}' on [${n(d.fields).join(", ")}].`;
+			t.push({
+				kind: f,
+				table: i,
+				redundant: u,
+				coveredBy: d,
+				message: `'${i}' ${p} '${d.name}' covers its B-tree lookups without losing row coverage or uniqueness. Drop '${u.name}' unless profiling justifies the smaller index for cache locality. Applies to supported B-tree dialects (Postgres / MySQL / MariaDB / MSSQL / SQLite).`
 			});
 		}
 	}
 	return t;
-}, o = (e) => {
+}, s = (e) => {
 	let t = [];
-	for (let n of e) t.push(...a(n));
+	for (let n of e) t.push(...o(n));
 	return t;
-}, s = "\x1B[", c = `${s}38;2;245;158;11m`, l = `${s}38;2;16;185;129m`, u = (t, n) => `${t}${n}${e.reset}`, d = (e, t, n) => e ? typeof t == "function" ? t(n) : u(t, n) : n, f = (t, r = {}) => {
-	let i = r.color ?? !0, a = r.indent ?? "  ", o = (t) => d(i, e.dim, t.padEnd(11)), s = (t) => d(i, (t) => e.bold(e.brand(t)), t), u = (t) => d(i, e.brightRed24, t), f = (e) => d(i, l, e), p = (e) => d(i, c, e), m = (t) => d(i, e.dim, t), h = `${p("index audit")} ${m("·")} ${d(i, e.bold, t.kind)}`, g = t.redundant.fields.length, _ = n(t.coveredBy.fields.slice(g)), v = (e, t) => {
+}, c = "\x1B[", l = `${c}38;2;245;158;11m`, u = `${c}38;2;16;185;129m`, d = (t, n) => `${t}${n}${e.reset}`, f = (e, t, n) => e ? typeof t == "function" ? t(n) : d(t, n) : n, p = (t, r = {}) => {
+	let i = r.color ?? !0, a = r.indent ?? "  ", o = (t) => f(i, e.dim, t.padEnd(11)), s = (t) => f(i, (t) => e.bold(e.brand(t)), t), c = (t) => f(i, e.brightRed24, t), d = (e) => f(i, u, e), p = (e) => f(i, l, e), m = (t) => f(i, e.dim, t), h = `${p("index audit")} ${m("·")} ${f(i, e.bold, t.kind)}`, g = t.redundant.fields.length, _ = n(t.coveredBy.fields.slice(g)), v = (e, t) => {
 		let n = e.slice(0, t), r = e.slice(t), i = [];
-		return n.length > 0 && i.push(f(`[${n.join(", ")}]`)), r.length > 0 && i.push(p(`+ [${r.join(", ")}]`)), i.join(" ");
+		return n.length > 0 && i.push(d(`[${n.join(", ")}]`)), r.length > 0 && i.push(p(`+ [${r.join(", ")}]`)), i.join(" ");
 	}, y = [];
-	return y.push(h), y.push(""), y.push(`${o("table")}${s(t.table)}`), y.push(""), y.push(`${o("redundant")}${u(t.redundant.name)}`), y.push(`${o("")}${v(n(t.redundant.fields), g)}`), y.push(""), y.push(`${o("covered by")}${f(t.coveredBy.name)}`), y.push(`${o("")}${v(n(t.coveredBy.fields), g)}`), _.length > 0 && y.push(`${o("")}${m(`└ extra columns: ${_.join(", ")}`)}`), y.push(""), t.kind === "redundant-prefix" ? (y.push(`${o("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), y.push(`${o("")}their column list. The wider index already covers every`), y.push(`${o("")}query the narrower one can serve.`), y.push(`${o("")}${m("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (y.push(`${o("why")}Two indexes on the same columns under different names.`), y.push(`${o("")}The B-tree engine builds both — same coverage, double cost.`), y.push(`${o("")}${m("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), y.push(""), y.push(`${o("cost")}Every ${s("INSERT")} / ${s("UPDATE")} / ${s("DELETE")} on this table writes`), y.push(`${o("")}to ${d(i, e.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), y.push(""), y.push(`${o("fix")}Drop  ${u(t.redundant.name)}`), y.push(`${o("")}${m("Keep only if profiling shows the smaller index gives a")}`), y.push(`${o("")}${m("measurable cache-locality boost on a write-heavy hot path.")}`), y.push(`${o("")}${m("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), y.map((e) => `${a}${e}`).join("\n");
+	return y.push(h), y.push(""), y.push(`${o("table")}${s(t.table)}`), y.push(""), y.push(`${o("redundant")}${c(t.redundant.name)}`), y.push(`${o("")}${v(n(t.redundant.fields), g)}`), y.push(""), y.push(`${o("covered by")}${d(t.coveredBy.name)}`), y.push(`${o("")}${v(n(t.coveredBy.fields), g)}`), _.length > 0 && y.push(`${o("")}${m(`└ extra columns: ${_.join(", ")}`)}`), y.push(""), t.kind === "redundant-prefix" ? (y.push(`${o("why")}B-tree indexes serve queries that filter on a LEADING PREFIX of`), y.push(`${o("")}their column list. The wider index already covers every`), y.push(`${o("")}query the narrower one can serve.`), y.push(`${o("")}${m("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)) : (y.push(`${o("why")}Two indexes on the same columns under different names.`), y.push(`${o("")}The B-tree engine builds both — same coverage, double cost.`), y.push(`${o("")}${m("Same rule on Postgres / MySQL / MariaDB / MSSQL / SQLite.")}`)), t.redundant.where && y.push(`${o("filter")}${t.redundant.where}`), y.push(`${o("")}Row coverage and uniqueness are preserved by the kept index.`), y.push(""), y.push(`${o("cost")}Matching ${s("INSERT")} / ${s("UPDATE")} / ${s("DELETE")} on this table writes`), y.push(`${o("")}to ${f(i, e.bold, "both")} B-trees. Pure write overhead, zero read benefit.`), y.push(""), y.push(`${o("fix")}Drop  ${c(t.redundant.name)}`), y.push(`${o("")}${m("Keep only if profiling shows the smaller index gives a")}`), y.push(`${o("")}${m("measurable cache-locality boost on a write-heavy hot path.")}`), y.push(`${o("")}${m("Silence with VOLTRO_INDEX_AUDIT=off if intentional.")}`), y.map((e) => `${a}${e}`).join("\n");
 };
-//#endregion
-export { o as auditAllTableIndexes, a as auditTableIndexes, f as formatIndexAuditIssue };
+export { s as auditAllTableIndexes, o as auditTableIndexes, p as formatIndexAuditIssue };

package/dist/indexStorage.js

@@ -1,6 +1,6 @@
 import { resolveGinOpclass as e } from "./ginIndex.js";
 import { vectorDistanceToOpclass as t } from "./table.js";
-//#region src/indexStorage.ts
+// src/indexStorage.ts
 var n = (e, n = "float32") => {
 	let r = e?.hnsw, i = r?.m ?? 16, a = r?.efConstruction ?? 64;
 	for (let [e, t] of Object.entries({
@@ -54,5 +54,4 @@ var n = (e, n = "float32") => {
 		skip: !1
 	};
 };
-//#endregion
 export { r as indexKindForDialect, i as indexStorageShape, a as pgIndexClauses, n as resolveHnswOptions };

package/dist/joinCompiler.js

@@ -3,7 +3,7 @@ import { authoredError as t } from "./dbCause.js";
 import { decimalEqualityKey as n } from "./decimalComparison.js";
 import { inferForeignKey as r, validateRelationConfig as i } from "./relations.js";
 import { getRelations as a } from "./relationsRegistry.js";
-//#region src/joinCompiler.ts
+// src/joinCompiler.ts
 var o = class extends Error {
 	_tag = "EagerCardinalityError";
 	constructor(e) {
@@ -156,5 +156,4 @@ var o = class extends Error {
 		for (let [e, n] of Object.entries(t)) e in r || (r[e] = n);
 	});
 }, y = (e) => e.eager !== void 0 && Object.keys(e.eager).length > 0;
-//#endregion
 export { o as EagerCardinalityError, c as attachEagerLoads, y as hasEagerLoads, s as oneCardinalityMessage };

package/dist/jsonEagerCompiler.js

@@ -10,7 +10,7 @@ import { decodeCell as l } from "./rowDecoder.js";
 import { EagerCardinalityError as u, oneCardinalityMessage as d } from "./joinCompiler.js";
 import { coerceValueForSqlite as f } from "./sqliteValueCoercion.js";
 import { compilePredicate as p } from "./sqlCompiler.js";
-//#region src/jsonEagerCompiler.ts
+// src/jsonEagerCompiler.ts
 var m = (e, t, n) => {
 	if (e.eager === void 0) return null;
 	let r = v(e.table, e.eager, e.sourceTable);
@@ -432,5 +432,4 @@ var m = (e, t, n) => {
 		value: f(t.value)
 	};
 };
-//#endregion
 export { $ as coercePredicateForSqlite, f as coerceValueForSqlite, m as compileEagerJson };

package/dist/jsonPatch.js

@@ -1,4 +1,4 @@
-//#region src/jsonPatch.ts
+// src/jsonPatch.ts
 var e = (e) => typeof e == "object" && !!e && !Array.isArray(e), t = (e) => JSON.parse(JSON.stringify(e ?? null)), n = (n, r, i) => {
 	let [a, ...o] = r.split("."), s = t(i), c = n[a], l = (t, n) => {
 		if (n === o.length) return s;
@@ -74,5 +74,4 @@ var e = (e) => typeof e == "object" && !!e && !Array.isArray(e), t = (e) => JSON
 	}
 	return n`${n(s)} = ${b}`;
 };
-//#endregion
 export { n as applyJsonPatch, r as compileJsonPatch, t as normalizeJsonPatchValue };

package/dist/jsonPatchAssignments.js

@@ -1,6 +1,6 @@
 import { authoredError as e } from "./dbCause.js";
 import { rowKeyColumns as t } from "./rowKey.js";
-//#region src/jsonPatchAssignments.ts
+// src/jsonPatchAssignments.ts
 var n = (n, r, i) => {
 	let a = new Set(t(n).map(([e]) => e)), o = r.split(".")[0];
 	return Object.fromEntries(Object.entries(i ?? {}).filter(([t, n]) => {
@@ -9,5 +9,4 @@ var n = (n, r, i) => {
 		return !0;
 	}));
 };
-//#endregion
 export { n as jsonPatchAssignments };

package/dist/jsonPath.js

@@ -1,5 +1,5 @@
 import { quoteIdent as e } from "./dialect.js";
-//#region src/jsonPath.ts
+// src/jsonPath.ts
 var t = /^[A-Za-z_][A-Za-z0-9_]*$/, n = (e) => "$" + e.map((e) => typeof e == "number" ? `[${e}]` : t.test(e) ? `.${e}` : `."${e.replace(/"/g, "\\\"")}"`).join(""), r = (e) => "{" + e.map((e) => {
 	let t = String(e);
 	return /^[A-Za-z0-9_]+$/.test(t) ? t : `"${t.replace(/(["\\])/g, "\\$1")}"`;
@@ -27,5 +27,4 @@ var t = /^[A-Za-z_][A-Za-z0-9_]*$/, n = (e) => "$" + e.map((e) => typeof e == "n
 		}
 	}
 };
-//#endregion
 export { i as jsonPathSql };

package/dist/localFirstMixin.js

@@ -1,5 +1,5 @@
 import { defineMixin as e } from "./mixins.js";
-//#region src/localFirstMixin.ts
+// src/localFirstMixin.ts
 var t = "voltro/localFirst", n = () => e({
 	id: t,
 	fields: {}
@@ -8,5 +8,4 @@ var t = "voltro/localFirst", n = () => e({
 	for (let n of Object.values(e)) r(n) && t.push(n.tableName);
 	return t;
 };
-//#endregion
 export { t as VOLTRO_LOCAL_FIRST_MIXIN_ID, r as isLocalFirst, n as localFirst, i as localFirstTables };

package/dist/migrate.js

@@ -19,7 +19,7 @@ import { mssqlTextStorageLength as ie } from "./mssqlTextStorage.js";
 import { Effect as C, Schedule as w } from "effect";
 import { SqlClient as T } from "effect/sql";
 import { createLogger as ae } from "@voltro/logger";
-//#region src/migrate.ts
+// src/migrate.ts
 var E = ae({ scope: "voltro:migrate" }), D = (e) => {
 	E.warn(e.replace(/^\[voltro:migrate\]\s*/, ""));
 }, O = (e, t) => {
@@ -640,5 +640,4 @@ BEGIN
 		yield* b(i, Q(i, t, n, r.retryFilter), { schema: r.lockSchema }).pipe(C.orDie);
 	}).pipe(C.provide(t)));
 };
-//#endregion
 export { x as DEFAULT_CDC_CHANNEL, $ as applyNamespacedSchema, ye as applySchema, A as defaultArrayClause, k as defaultClause, j as defaultJsonClause, ve as emitFrameworkBootstrapSql, ge as emitNamespaceProvisionDdl, _e as emitNamespacedSchemaSql, X as emitSchemaSql, xe as ensureFullTextIndexes, Y as enumRenameBlocks, J as enumTypeBlocks, W as extensionBlocks, z as fullTextIndexSql, Se as isReRunSafeDdl, M as numericIdSql, Oe as provisionTenantNamespace, fe as reactiveTriggerRepairSql, ke as runFrameworkBootstrap, De as runMigrate, Ee as splitStatements, O as sqlType };

package/dist/migration.js

@@ -1,4 +1,4 @@
-//#region src/migration.ts
+// src/migration.ts
 var e = (e, { apply: t, undo: n }) => ({
 	name: e,
 	apply: t,
@@ -14,5 +14,4 @@ var e = (e, { apply: t, undo: n }) => ({
 		steps: n
 	};
 }, n = (e) => typeof e == "object" && !!e && "__migration" in e && e.__migration === !0;
-//#endregion
 export { t as defineMigration, n as isMigrationDefinition };

package/dist/migrations/appliedAtValue.js

@@ -1,8 +1,7 @@
 import { Effect as e } from "effect";
-//#region src/migrations/appliedAtValue.ts
+// src/migrations/appliedAtValue.ts
 var t = (t, n) => t.onDialectOrElse({
 	mysql: () => e.succeed(n.replace("T", " ").replace("Z", "")),
 	orElse: () => e.succeed(n)
 });
-//#endregion
 export { t as appliedAtValue };

package/dist/migrations/applier.js

@@ -29,7 +29,7 @@ import { Effect as j } from "effect";
 import { isDeepStrictEqual as Ee } from "node:util";
 import { createHash as De, randomUUID as Oe } from "node:crypto";
 import { SqlClient as ke } from "effect/sql";
-//#region src/migrations/applier.ts
+// src/migrations/applier.ts
 var Ae = (e, t) => `${t}(${e.precision ?? 38}, ${e.scale ?? 0})`, je = (e) => e.type === "text" && (e.hasDefault && e.defaultValue !== void 0 || e.oneOf !== void 0 && e.oneOf.length > 0), M = (e, t) => {
 	let n = e.type === "text" && e.maxLength !== void 0;
 	if (e.sqliteDecimalEncoding === void 0 && !n && !je(e) && !e.spatial && e.type !== "vector" && e.type !== "array" && e.type !== "enum") return;
@@ -1096,5 +1096,4 @@ EXEC sp_executesql @drop;`, Vt = (e) => `ALTER TABLE ${P(e.table)} DROP INDEX ${
 		});
 	}
 }, Dn = (e, t, n) => yn(e, t, { declared: n });
-//#endregion
 export { Xt as addColumnDdl, gn as appliedLedgerOperations, Cn as applyPlan, _n as clearResumeLedger, Ue as columnLevelChecksMysql, bt as emitAddIndexMysql, tt as emitConvertCharsetMysql, ft as emitCreateTableMssql, nt as emitCreateTableMysql, Je as emitCreateTablePg, G as emitCreateTableSqlite, F as emitDropColumnDdl, Ie as emitDropColumnDdlMysql, ln as ensureDeployLedgerTable, an as ensureLedgerTable, on as ensurePlanLedgerTable, cn as ensurePluginMigrationsLedgerTable, un as ensureReplaceMarkerTable, sn as ensureSchemaOwnerTable, fn as hasInterruptedMigration, ht as mysqlIndexPrefixFor, Qe as renderColumnMysql, qe as renderColumnPg, Dn as runMigrationOp, En as runSchemaOp };

package/dist/migrations/boot.js

@@ -13,7 +13,7 @@ import { verifySqliteDecimalStorage as g } from "./sqliteDecimalBoot.js";
 import { describesSchema as _ } from "./ledgerRows.js";
 import { convergeUndeclaredCharset as v, describeUndeclaredCharsetWork as y, isUndeclaredCharsetWorkEmpty as b, readUndeclaredCharsetColumns as x, undeclaredCharsetWork as S } from "./undeclaredCharset.js";
 import { Effect as C } from "effect";
-//#region src/migrations/boot.ts
+// src/migrations/boot.ts
 var w = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind} ${"table" in e.op ? `[${e.op.table}]` : ""}: ${e.reason ?? "<no reason>"}\n    fix: ${e.blocked?.fix ?? "<no fix>"}`).join("\n"), T = (e) => e`
     SELECT fingerprint
     FROM _voltro_migration_plans
@@ -170,7 +170,7 @@ var w = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind
 		case "up-to-date": return `auto-migrate: schema up to date (${t}, fingerprint=${o(e.fingerprint)})`;
 		case "applied": {
 			let t = e.plan.summary;
-			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=${o(e.applied.fingerprint)}`;
+			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=${o(e.applied.fingerprint)} (planner pass; excludes framework bootstrap and file migrations)`;
 		}
 		case "prod-mismatch": return `auto-migrate: SCHEMA FINGERPRINT MISMATCH — declared=${o(e.expected)}` + (e.actual ? ` live=${o(e.actual)}` : " live=<no _voltro_migration_plans row>") + ". Run `voltro db apply --plan plan.json` from the deploy pipeline before serving.";
 		case "refused-blocked": {
@@ -192,5 +192,4 @@ var w = (e) => e.operations.filter((e) => e.blocked).map((e) => `  - ${e.op.kind
 		}
 	}
 };
-//#endregion
 export { R as describeOutcome, M as destructiveScope, T as fetchLastFingerprint, j as ignoreTablesFromEnv, E as recordUpToDate, L as runPlannedMigrations, P as unblockLossy };

package/dist/migrations/branchRehearsal.js

@@ -1,5 +1,5 @@
 import { unblockLossy as e } from "./boot.js";
-//#region src/migrations/branchRehearsal.ts
+// src/migrations/branchRehearsal.ts
 var t = (e) => {
 	let t = e.table;
 	if (typeof t == "string") return t;
@@ -118,5 +118,4 @@ var t = (e) => {
 	}
 	return t.push(e.tornDown ? `  branch ${e.branchId} torn down.` : `  branch ${e.branchId} KEPT — drop it when you are done.`), t.join("\n");
 };
-//#endregion
 export { a as branchRehearsalExitCode, s as formatBranchRehearsal, i as rehearseMigrationOnBranch, n as rehearsedOperation };

package/dist/migrations/columnEquivalence.js

@@ -2,7 +2,7 @@ import { indexStorageShape as e } from "../indexStorage.js";
 import { mssqlTextStorageLength as t } from "../mssqlTextStorage.js";
 import { sqlType as n } from "../migrate.js";
 import { normalizeIndexPredicate as r } from "./indexPredicate.js";
-//#region src/migrations/columnEquivalence.ts
+// src/migrations/columnEquivalence.ts
 var i = (e, t) => t.name === "id" && e.primaryKey?.length === 1 && e.primaryKey[0] === "id", a = /* @__PURE__ */ new Set(["integer", "bigint"]), o = (e) => a.has(e) ? "numeric" : "text", s = (e) => e.idScheme?.kind === "numeric" ? "numeric" : "text", c = (e) => e.idStorage ?? (b(e) ? "numeric" : "text"), l = (e) => e.idScheme ? s(e) : c(e), u = (e) => e.type === "text" || e.type === "id" && l(e) === "text", d = (e, t) => t && (e.type === "text" || e.type === "id") ? {
 	...e,
 	type: "id",
@@ -81,5 +81,4 @@ var i = (e, t) => t.name === "id" && e.primaryKey?.length === 1 && e.primaryKey[
 		return;
 	}
 };
-//#endregion
 export { d as canonicalIdColumn, _ as canonicalJson, y as comparableDefault, g as comparableIndex, m as comparableSpatial, s as declaredIdStorage, p as hasComparableType, o as idStorageOfType, b as isPgSequenceDefault, i as isSolePrimaryKeyId, u as isTextStorage, c as liveIdStorage, x as normRef, v as normalizeDefault, S as renderedTextWidth, l as resolvedIdStorage, f as sameIdSpelling, h as sameSpatial };

package/dist/migrations/ddlError.js

@@ -1,4 +1,4 @@
-//#region src/migrations/ddlError.ts
+// src/migrations/ddlError.ts
 var e = [
 	"sqlMessage",
 	"code",
@@ -59,5 +59,4 @@ var e = [
 	let u = r(c("code"));
 	return u !== void 0 && l.push("", u), l.push(""), l.join("\n");
 }, r = (e) => e === "3F000" ? "remedy: the connection's search_path names a schema that does not exist. Voltro sets it from DB_SCHEMA — create the schema (`CREATE SCHEMA \"<name>\"`) or unset DB_SCHEMA to use the connection default. Voltro creates TABLES, never the schema itself: that is a namespace decision, and inventing one from a typo is how a migration lands somewhere nobody is looking." : void 0;
-//#endregion
 export { n as formatDdlError };

package/dist/migrations/ddlStatements.js

@@ -1,9 +1,8 @@
 import { splitStatements as e } from "../migrate.js";
-//#region src/migrations/ddlStatements.ts
+// src/migrations/ddlStatements.ts
 var t = (t, n) => {
 	if (t !== "postgres") return [n];
 	let r = e(n);
 	return r.length <= 1 ? [n] : r;
 };
-//#endregion
 export { t as ddlStatementsFor };

package/dist/migrations/declaredSchema.js

@@ -6,7 +6,7 @@ import { indexKindForDialect as a, indexStorageShape as o, resolveHnswOptions as
 import { lowerUniqueActive as c } from "./uniqueActiveLowering.js";
 import { renderedTextWidth as l } from "./columnEquivalence.js";
 import { stampDeclaredCharset as u } from "./storeCharset.js";
-//#region src/migrations/declaredSchema.ts
+// src/migrations/declaredSchema.ts
 var d = (e, i, a) => {
 	let o = i.references ? {
 		table: i.references().tableName,
@@ -141,7 +141,7 @@ var d = (e, i, a) => {
 	return {
 		...e,
 		columns: e.columns.map((e) => {
-			if (n === "mssql" && !e.generatedAs && (e.type === "json" || e.type === "array") && (e = {
+			if (n !== "mssql" || e.generatedAs || e.type !== "json" && e.type !== "array" || (e = {
 				...e,
 				jsonValidation: e.type === "json" ? "value" : "container"
 			}), t(n)) {
@@ -158,5 +158,4 @@ var d = (e, i, a) => {
 		})
 	};
 };
-//#endregion
 export { h as declaredSnapshot, d as snapshotColumn };

package/dist/migrations/deployLedger.js

@@ -1,7 +1,7 @@
 import { id as e, text as t } from "../columns.js";
 import { table as n } from "../table.js";
 import { Effect as r } from "effect";
-//#region src/migrations/deployLedger.ts
+// src/migrations/deployLedger.ts
 var i = "_voltro_deploys", a = n(i, {
 	id: e({ prefix: "dpl" }),
 	status: t(),
@@ -15,5 +15,4 @@ var i = "_voltro_deploys", a = n(i, {
 	...e,
 	startedAt: String(e.startedAt)
 }))), r.catch(() => r.succeed([])));
-//#endregion
 export { i as DEPLOY_LEDGER_TABLE, a as _voltroDeploysTable, s as closeDeploy, c as failDeploy, o as openDeploy, l as unfinishedDeploys };

package/dist/migrations/fileBased.js

@@ -1,5 +1,5 @@
 import { Effect as e } from "effect";
-//#region src/migrations/fileBased.ts
+// src/migrations/fileBased.ts
 var t = ["before-schema", "after-schema"], n = (e) => {
 	if (!e.id || e.id.length === 0) throw Error("migration: `id` is required + must be non-empty");
 	if (!e.up || !e.down) throw Error(`migration ${e.id}: both \`up\` and \`down\` must be functions`);
@@ -53,5 +53,4 @@ var t = ["before-schema", "after-schema"], n = (e) => {
 		super(`rewrite of ${e} did not stabilise after ${t.passes} pass(es): ${t.rewritten} rewritten, ${t.contended} contended on the last pass. Check for concurrent writes and guard values that cannot round-trip exactly before raising maxPasses.`), this.table = e, this.report = t, this.name = "RewriteUnstableError";
 	}
 }, f = /^\d{8}_\d{6}_[a-z0-9_]+\.ts$/, p = (e) => typeof e == "object" && !!e && "id" in e && "up" in e && "down" in e && typeof e.id == "string" && typeof e.up == "function" && typeof e.down == "function";
-//#endregion
 export { f as FILE_MIGRATION_PATTERN, i as IrreversibleMigrationError, t as MIGRATION_PHASES, c as MigrationExpectationFailed, u as MigrationNeedsSqlClient, s as MigrationSkipped, d as RewriteUnstableError, l as TransactionBrokenByBodyError, a as irreversible, o as irreversibleReason, p as isFileMigration, n as migration };

package/dist/migrations/fileContext.js

@@ -12,7 +12,7 @@ import { introspectSchema as h } from "./introspect.js";
 import { runMigrationOp as g, runSchemaOp as _ } from "./applier.js";
 import { unblockLossy as v } from "./boot.js";
 import { Effect as y } from "effect";
-//#region src/migrations/fileContext.ts
+// src/migrations/fileContext.ts
 var b = (t) => typeof t.__definition == "function" ? e({ c: t }).c : t, x = (e) => {
 	if (typeof e != "string") return e;
 	let t = e.trim().replace(/::[a-zA-Z0-9_ "]+$/, "").trim();
@@ -478,5 +478,4 @@ var b = (t) => typeof t.__definition == "function" ? e({ c: t }).c : t, x = (e)
 	for (let { description: n, check: r } of e) (yield* j(r())) || t.push(n);
 	return t;
 });
-//#endregion
 export { U as failedExpectations, H as makeFileMigrationContext, C as materialiseSnapshot };

package/dist/migrations/fileDiscovery.js

@@ -16,7 +16,7 @@ import { createLogger as T } from "@voltro/logger";
 import { promises as E } from "node:fs";
 import { join as D } from "node:path";
 import { pathToFileURL as O } from "node:url";
-//#region src/migrations/fileDiscovery.ts
+// src/migrations/fileDiscovery.ts
 var k = T({ scope: "voltro:migrate" }), A = (e) => C("sha256").update(e).digest("hex").slice(0, 16), j = [{
 	codemod: "0.78.0/01_file-migration-phase",
 	inverse: (e) => {
@@ -328,5 +328,4 @@ var k = T({ scope: "voltro:migrate" }), A = (e) => C("sha256").update(e).digest(
 		};
 	}), (e) => e.release.pipe(S.orDie)) : yield* S.fail(new a(t.id, i));
 });
-//#endregion
 export { i as FILE_MIGRATION_PATTERN, j as FRAMEWORK_MIGRATION_EDITS, U as FileMigrationLedgerError, K as MigrationIdTooLongError, M as acceptedBodyHashes, R as appliedFileMigrationIds, z as appliedFileMigrations, te as fileMigrationStatus, A as migrationBodyHash, Q as pendingFileMigrationIds, ee as pendingFileMigrationSummary, re as rollbackFileBasedMigration, ne as runFileBasedMigrations, G as unrecordableMigrationIds, P as walkMigrationFiles };

package/dist/migrations/fileSkipProbes.js

@@ -1,5 +1,5 @@
 import { Effect as e } from "effect";
-//#region src/migrations/fileSkipProbes.ts
+// src/migrations/fileSkipProbes.ts
 var t = (e) => e.kind === "table" ? e.table : `${e.table}.${e.name}`, n = (e, n) => e.kind === n.kind && e.table === n.table && t(e) === t(n), r = (e) => JSON.stringify([
 	e.kind,
 	e.table,
@@ -113,5 +113,4 @@ var t = (e) => e.kind === "table" ? e.table : `${e.table}.${e.name}`, n = (e, n)
 		}];
 	});
 };
-//#endregion
 export { t as describeProbe, s as permanentSkips, o as plannedCreations, a as withSchemaProbeRecorder };

package/dist/migrations/fingerprint.js

@@ -1,7 +1,7 @@
 import { isSoftDropSnapshotName as e } from "./frameworkLiveTables.js";
 import { canonicalIdColumn as t, comparableDefault as n, comparableIndex as r, comparableSpatial as i, isPgSequenceDefault as a, isSolePrimaryKeyId as o, normRef as s } from "./columnEquivalence.js";
 import { createHash as c } from "node:crypto";
-//#region src/migrations/fingerprint.ts
+// src/migrations/fingerprint.ts
 var l = (e) => {
 	if (e == null) return e;
 	if (Array.isArray(e)) return e.map(l);
@@ -42,5 +42,4 @@ var l = (e) => {
 	let t = { tables: m(e.tables) }, n = JSON.stringify(l(t));
 	return c("sha256").update(n).digest("hex");
 }, g = (e) => e.slice(0, 16);
-//#endregion
 export { h as fingerprintSchema, g as shortFingerprint };

package/dist/migrations/fkCycles.js

@@ -1,4 +1,4 @@
-//#region src/migrations/fkCycles.ts
+// src/migrations/fkCycles.ts
 var e = (e, t) => `${e}::${t}`, t = (t, n) => {
 	let r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = (t) => {
 		r.add(t);
@@ -9,5 +9,4 @@ var e = (e, t) => `${e}::${t}`, t = (t, n) => {
 	for (let e of [...t].sort()) i.has(e) || o(e);
 	return a;
 };
-//#endregion
 export { t as findCyclicFkBackEdges, e as fkEdgeKey };

package/dist/migrations/frameworkLiveTables.js

@@ -1,4 +1,4 @@
-//#region src/migrations/frameworkLiveTables.ts
+// src/migrations/frameworkLiveTables.ts
 var e = /* @__PURE__ */ new Set(["voltro_isr_cache"]), t = (t) => e.has(t) || t.startsWith("_voltro_") || t.startsWith("_cloud_") || t.startsWith("cluster_") || t.startsWith("__turso_internal_"), n = "_voltro_staging_", r = (e) => e.startsWith(n), i = /__dropped_\d{14}$/, a = (e) => i.test(e), o = 7, s = (e) => {
 	let t = /__dropped_(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})$/.exec(e);
 	if (t === null) return;
@@ -21,5 +21,4 @@ var e = /* @__PURE__ */ new Set(["voltro_isr_cache"]), t = (t) => e.has(t) || t.
 	let n = e.reduce((e, t) => e.ageDays >= t.ageDays ? e : t), r = (/* @__PURE__ */ new Date(Date.now() - t * 864e5)).toISOString().slice(0, 10);
 	return `${e.length} soft-drop snapshot(s) older than ${t} day(s) still hold the dropped data (oldest: ${n.name}, ${n.ageDays}d) — ${e.map((e) => e.name).join(", ")}. Restore with \`voltro db restore-snapshot\` or reclaim with \`voltro db gc-snapshots --before ${r}\`; the window is \`database.softDropRetentionDays\` in app.config.`;
 }, u = (e, n) => e.filter((e) => !t(e.name) || n.has(e.name));
-//#endregion
 export { o as DEFAULT_SOFT_DROP_RETENTION_DAYS, e as FRAMEWORK_LIVE_TABLES, n as STAGING_TABLE_PREFIX, c as agedSoftDropSnapshots, l as describeAgedSoftDropSnapshots, t as isFrameworkOwnedLiveTable, a as isSoftDropSnapshotName, r as isStagingTableName, u as plannableLiveTables, s as softDropSnapshotStamp };

package/dist/migrations/idempotentDdl.js

@@ -1,4 +1,4 @@
-//#region src/migrations/idempotentDdl.ts
+// src/migrations/idempotentDdl.ts
 var e = (e) => {
 	let t = e;
 	for (let e = 0; e < 6 && typeof t == "object" && t; e++) {
@@ -33,5 +33,4 @@ var e = (e) => {
 	why: "mysql/mariadb ADD CONSTRAINT has no IF NOT EXISTS; 1826 is exactly \"already there\"",
 	errno: [1826]
 };
-//#endregion
 export { i as MYSQL_COLUMN_OR_INDEX_ABSENT, o as MYSQL_CONSTRAINT_ABSENT, s as MYSQL_FOREIGN_KEY_EXISTS, r as MYSQL_INDEX_EXISTS, a as SQLITE_COLUMN_ABSENT, n as isAlreadySatisfied };

package/dist/migrations/indexPredicate.js

@@ -1,4 +1,4 @@
-//#region src/migrations/indexPredicate.ts
+// src/migrations/indexPredicate.ts
 var e = /'(?:''|[^'])*'|"(?:""|[^"])*"|\[(?:\]\]|[^\]])*\]|`(?:``|[^`])*`|[A-Za-z_][A-Za-z_0-9$]*|\d+(?:\.\d+)?|::|<>|!=|<=|>=|\|\||[^\s]/g, t = (t) => {
 	let n = 0;
 	for (let r of t.matchAll(e)) if (r[0] === "(" && n++, r[0] === ")" && n--, n === 0 && r[0].toLowerCase() === "where") return t.slice(r.index + r[0].length).trim().replace(/;$/, "").trim();
@@ -46,5 +46,4 @@ var e = /'(?:''|[^'])*'|"(?:""|[^"])*"|\[(?:\]\]|[^\]])*\]|`(?:``|[^`])*`|[A-Za-
 	};
 	return JSON.stringify(o(a));
 };
-//#endregion
 export { t as extractIndexPredicate, n as normalizeIndexPredicate };