@supalive/core 0.1.3 → 0.1.5

package/dist/mysql-DELSRrpY.js

@@ -0,0 +1,569 @@
+import { o as utf8Encode, r as supaliveStringify } from "./helper-zdJT5FUc.js";
+import { C as normalizeIdToBytes, l as OccConflictError, w as normalizeToBytes } from "./types_db-Ctf-ksoy.js";
+import { r as mapReadSetToRaw, t as checkLogsAffectReadSet } from "./overlap-checker-CVkbbuEQ.js";
+import mysql from "mysql2/promise";
+//#region src/db/mysql.ts
+function toBufferView(bytes) {
+	if (Buffer.isBuffer(bytes)) return bytes;
+	return Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+}
+/**
+* mysql2 returns `ResultSetHeader` for non-SELECT queries (carrying
+* `affectedRows`) and `RowDataPacket[]` for SELECTs. The previous shim
+* blindly cast to T[] which made `rowCount` zero for UPDATE/DELETE, breaking
+* CAS detection. This helper picks the right shape.
+*/
+function normalizeMysqlResult(raw) {
+	if (Array.isArray(raw)) return {
+		rows: raw,
+		rowCount: raw.length
+	};
+	if (raw && typeof raw === "object" && "affectedRows" in raw) return {
+		rows: [],
+		rowCount: Number(raw.affectedRows) || 0
+	};
+	return {
+		rows: [],
+		rowCount: 0
+	};
+}
+var MySqlDatabase = class {
+	constructor(logger, config, pool = void 0) {
+		this.logger = logger;
+		const { queryTimeoutMs, ...poolConfig } = config;
+		this.queryTimeoutMs = queryTimeoutMs ?? 0;
+		this.config = poolConfig;
+		if (pool) this.pool = pool;
+		else this.pool = mysql.createPool(poolConfig);
+	}
+	logger;
+	config;
+	queryTimeoutMs;
+	pool;
+	dbType = "mysql";
+	sqlBuilder = mysqlSql;
+	columnTypes = /* @__PURE__ */ new Map();
+	sqlCache = /* @__PURE__ */ new Map();
+	/**
+	* Fetches actual column types from MySQL for `table` and returns a
+	* map of DB column name → MySQL type string (as produced by `COLUMN_TYPE`,
+	* e.g. `bigint`, `integer`, `varchar(32)`, `text`, `json`).
+	* No caching here — see {@link getColumnTypes} for the cached path.
+	*/
+	async loadColumnTypesFromMySql(table) {
+		const result = await this.query(`SELECT COLUMN_NAME AS column_name, COLUMN_TYPE AS mysql_type
+         FROM INFORMATION_SCHEMA.COLUMNS
+         WHERE TABLE_SCHEMA = DATABASE() AND TABLE_NAME = ?
+         ORDER BY ORDINAL_POSITION`, [table]);
+		const out = /* @__PURE__ */ new Map();
+		for (const row of result.rows) out.set(row.column_name.toLowerCase(), row.mysql_type);
+		return out;
+	}
+	/**
+	* Synchronous column-type lookup. The apply path calls this on every
+	* batched write, so it can't await — populate the cache via
+	* {@link bootstrapColumnTypes} at server start. Throws if `table` is
+	* missing (programmer error / bootstrap skipped).
+	*/
+	getColumnTypes(table) {
+		const hit = this.columnTypes.get(table);
+		if (!hit) {
+			this.logger.warn({ table }, "MySqlDatabase: no cached column types fallback to non-batched writes");
+			return null;
+		}
+		return hit;
+	}
+	/**
+	* Eagerly load column types into the in-memory cache. With a Redis
+	* client supplied, attempts the cache key first and falls through to
+	* MySQL on miss (writing the result back to Redis). This is the
+	* "one server queries MySQL, the rest read from Redis" pattern for cold
+	* starts in a multi-instance deploy. Without Redis, always queries MySQL.
+	*
+	* Pass `tables` to limit the load to a specific list; otherwise every
+	* user table in the connected database is loaded.
+	*
+	* The Redis cache key should encode whatever invalidates types in your
+	* environment (typically a schema version / deploy version). The
+	* subscriber in supalive-server.ts is expected to publish a reload
+	* signal after migrations and invoke {@link invalidateColumnTypes}.
+	*/
+	async bootstrapColumnTypes(opts) {
+		this.invalidateColumnTypes();
+		const { redis, cacheKey, tables } = opts;
+		if (redis) {
+			const cached = await redis.getCachedTableColumnTypes(cacheKey);
+			if (cached) {
+				for (const [table, cols] of Object.entries(cached)) this.columnTypes.set(table, new Map(Object.entries(cols)));
+				return;
+			}
+		}
+		const names = tables ?? await this.listUserTables();
+		for (const t of names) {
+			if (this.columnTypes.has(t)) continue;
+			const fresh = await this.loadColumnTypesFromMySql(t);
+			this.columnTypes.set(t, fresh);
+		}
+		if (redis) {
+			const dump = {};
+			for (const [table, cols] of this.columnTypes) dump[table] = Object.fromEntries(Object.entries(cols).sort());
+			await redis.setCachedTableColumnsTypes(cacheKey, dump);
+		}
+	}
+	/**
+	* Invalidate cached types (and dependent SQL) for `table`, or the entire
+	* cache if `table` is omitted. The Redis-pubsub reload signal in
+	* supalive-server.ts is expected to call this on schema changes.
+	*/
+	invalidateColumnTypes(table) {
+		if (table) {
+			this.columnTypes.delete(table);
+			for (const k of [...this.sqlCache.keys()]) if (k.includes(`:${table}:`) || k === `d:${table}`) this.sqlCache.delete(k);
+		} else {
+			this.columnTypes.clear();
+			this.sqlCache.clear();
+		}
+	}
+	/** Replace this instance's caches with shared references from a parent.
+	*  Used by getTransactionClient so types loaded once at startup are
+	*  visible inside transactions. */
+	adoptCaches(columnTypes, sqlCache) {
+		this.columnTypes = columnTypes;
+		this.sqlCache = sqlCache;
+	}
+	/** Enumerate the user-defined tables in the connected database for mysql — used
+	* by bootstrapColumnTypes() when no explicit list is provided. */
+	async listUserTables() {
+		return (await this.query(`SELECT table_name FROM information_schema.tables
+       WHERE table_schema = DATABASE() AND table_type = 'BASE TABLE'
+         AND table_name NOT IN ('commit_logs', 'metadata', 'sequence')`)).rows.map((r) => r.table_name);
+	}
+	migrationSql = [
+		`CREATE TABLE IF NOT EXISTS commit_logs (
+      id BINARY(16) NOT NULL,
+      ts BIGINT NOT NULL,
+      table_id BINARY(16) NOT NULL,
+      data LONGBLOB NOT NULL,
+      PRIMARY KEY (ts, table_id, id),
+      INDEX commit_logs_by_table_and_id (table_id, id, ts)
+    ) ENGINE=InnoDB ROW_FORMAT=DYNAMIC`,
+		`CREATE TABLE IF NOT EXISTS sequence (id INT NOT NULL)`,
+		`INSERT IGNORE INTO sequence VALUES (0)`,
+		`CREATE TABLE IF NOT EXISTS metadata (
+      meta_key VARCHAR(255) PRIMARY KEY,
+      meta_value BIGINT NOT NULL
+    ) ENGINE=InnoDB;`,
+		`INSERT IGNORE INTO metadata (meta_key, meta_value) VALUES ('latest_committed_ts', 0);`
+	];
+	async query(sql, params = []) {
+		const client = await this.pool.getConnection();
+		try {
+			const [rows] = this.queryTimeoutMs > 0 ? await client.query({
+				sql,
+				values: params,
+				timeout: this.queryTimeoutMs
+			}) : await client.query(sql, params);
+			return normalizeMysqlResult(rows);
+		} catch (err) {
+			throw translateMysqlError(err);
+		} finally {
+			client.release();
+		}
+	}
+	async getClient() {
+		return await this.pool.getConnection();
+	}
+	async getTransactionClient() {
+		const client = await this.pool.getConnection();
+		const tx = new MySqlTxDatabase(this.logger, {
+			...this.config,
+			queryTimeoutMs: this.queryTimeoutMs
+		}, this.pool, client);
+		tx.adoptCaches(this.columnTypes, this.sqlCache);
+		return tx;
+	}
+	async getLatestSnapshotTimestamp() {
+		const result = await this.query("SELECT meta_value FROM metadata WHERE meta_key = 'latest_committed_ts'");
+		return BigInt(result.rows[0]?.meta_value ?? 0) || -1n;
+	}
+	async updateLatestSnapshotTimestamp(commitTs) {
+		await this.query(`UPDATE metadata SET meta_value = ? WHERE meta_key = 'latest_committed_ts' AND meta_value < ?`, [commitTs, commitTs]);
+	}
+	async getNextTimestamp() {
+		const result = await this.query("UPDATE sequence SET id = LAST_INSERT_ID(id + 1); SELECT LAST_INSERT_ID() AS id");
+		return BigInt(result.rows[0]?.id ?? 0) || -1n;
+	}
+	async attachPrevDataToWriteSet(writeSet, readSet) {
+		const readTsByKey = /* @__PURE__ */ new Map();
+		for (let i = readSet.length - 1; i >= 0; i--) {
+			const r = readSet[i];
+			if (r.kind !== "point" || r.expectedCommitTs === void 0) continue;
+			const key = `${r.table} ${r.id}`;
+			if (!readTsByKey.has(key)) readTsByKey.set(key, r.expectedCommitTs);
+		}
+		const byTable = /* @__PURE__ */ new Map();
+		for (const entry of writeSet) {
+			if (entry.op !== "update" && entry.op !== "delete") continue;
+			const bucket = byTable.get(entry.table);
+			if (bucket) bucket.push(entry);
+			else byTable.set(entry.table, [entry]);
+		}
+		if (byTable.size === 0) return;
+		for (const [table, entries] of byTable) {
+			const ids = entries.map((e) => e.id);
+			const sql = `SELECT * FROM ${table} WHERE id IN (${ids.map(() => "?").join(", ")})`;
+			const result = await this.query(sql, ids);
+			const byId = /* @__PURE__ */ new Map();
+			for (const row of result.rows) byId.set(String(row.id), row);
+			for (const entry of entries) {
+				const row = byId.get(String(entry.id));
+				const key = `${entry.table} ${entry.id}`;
+				const priorReadTs = readTsByKey.get(key);
+				if (row) {
+					entry.prevData = row;
+					entry.expectedCommitTs = priorReadTs !== void 0 ? priorReadTs : BigInt(row.commit_ts);
+				} else if (priorReadTs !== void 0) entry.expectedCommitTs = priorReadTs;
+			}
+		}
+	}
+	async prepareCommitWrites(readSet, writeSet, commitTs) {
+		const result = [];
+		await this.mysqlPrepareBatchWrites(result, writeSet, commitTs);
+		await this.mysqlPrepareCommitLogs(result, writeSet, commitTs);
+		if (!readSet.some((r) => r.kind === "range")) return {
+			commits: result,
+			validateReadPoints: this.mysqlPrepareValidatePointReadsByCommitTs(readSet, writeSet),
+			hasRangeRead: false
+		};
+		return {
+			commits: result,
+			hasRangeRead: true,
+			tableIds: [...new Set(readSet.map((r) => r.tableId))],
+			rawReadSet: mapReadSetToRaw(readSet)
+		};
+	}
+	async mysqlPrepareBatchWrites(result, writeSet, commitTs) {
+		let i = 0;
+		let counter = 0;
+		while (i < writeSet.length) {
+			counter++;
+			const { table, op } = writeSet[i];
+			let j = i + 1;
+			while (j < writeSet.length && writeSet[j].table === table && writeSet[j].op === op) j++;
+			const batch = writeSet.slice(i, j);
+			if (op === "insert") await this.mysqlPrepareInsertBatch(result, table, batch, commitTs);
+			else if (op === "update") await this.mysqlPrepareUpdateSingle(result, table, batch, commitTs);
+			else await this.mysqlPrepareDeleteBatch(result, table, batch);
+			i = j;
+			if (counter % 50 == 0) await new Promise((resolve) => setImmediate(resolve));
+		}
+	}
+	async mysqlPrepareInsertBatch(result, table, entries, commitTs) {
+		if (entries.length === 0) return;
+		const groups = /* @__PURE__ */ new Map();
+		for (const entry of entries) {
+			const cols = [...Object.keys(entry.data ?? {}), "commit_ts"].sort();
+			const key = cols.join("|");
+			let g = groups.get(key);
+			if (!g) {
+				g = {
+					cols,
+					rows: []
+				};
+				groups.set(key, g);
+			}
+			g.rows.push(entry);
+		}
+		let counter = 0;
+		for (const { cols, rows } of groups.values()) {
+			counter++;
+			const values = [];
+			const tuples = [];
+			for (const entry of rows) {
+				const data = {
+					...entry.data ?? {},
+					commit_ts: commitTs
+				};
+				tuples.push(`(${cols.map(() => "?").join(", ")})`);
+				for (const col of cols) values.push(data[col]);
+			}
+			if (counter % 50 == 0) await new Promise((resolve) => setImmediate(resolve));
+			result.push({
+				sql: `INSERT INTO ${table} (${cols.join(", ")}) VALUES ${tuples.join(", ")}`,
+				params: values,
+				operation: "insertBatch",
+				table
+			});
+		}
+	}
+	async mysqlPrepareUpdateSingle(result, table, entries, commitTs) {
+		if (entries.length === 0) return;
+		let counter = 0;
+		for (const entry of entries) {
+			counter++;
+			const data = {
+				...entry.data ?? {},
+				commit_ts: commitTs
+			};
+			const sets = Object.keys(data).map((c) => `${c} = ?`);
+			const values = Object.values(data);
+			const expected = entry.expectedCommitTs ?? -1n;
+			if (counter % 50 == 0) await new Promise((resolve) => setImmediate(resolve));
+			result.push({
+				sql: `UPDATE ${table} SET ${sets.join(", ")} WHERE id = ? AND commit_ts = ?`,
+				params: [
+					...values,
+					entry.id,
+					expected
+				],
+				operation: "updateSingle",
+				table,
+				entryId: entry.id,
+				expectedTs: expected
+			});
+		}
+	}
+	async mysqlPrepareDeleteBatch(result, table, entries) {
+		if (entries.length === 0) return;
+		let counter = 0;
+		for (const entry of entries) {
+			counter++;
+			const expected = entry.expectedCommitTs ?? -1n;
+			if (counter % 50 == 0) await new Promise((resolve) => setImmediate(resolve));
+			result.push({
+				sql: `DELETE FROM ${table} WHERE id = ? AND commit_ts = ?`,
+				params: [entry.id, expected],
+				table,
+				operation: "deleteSingle",
+				entryId: entry.id,
+				expectedTs: expected
+			});
+		}
+	}
+	async mysqlPrepareCommitLogs(result, writeEntries, commitTs) {
+		if (writeEntries.length === 0) return;
+		const values = [];
+		const tuples = [];
+		let counter = 0;
+		for (const entry of writeEntries) {
+			counter++;
+			tuples.push(`(?, ?, ?, ?)`);
+			values.push(toBufferView(normalizeIdToBytes(entry.id)), commitTs, toBufferView(entry.tableId), toBufferView(utf8Encode(supaliveStringify(entry))));
+			if (counter % 50 == 0) await new Promise((resolve) => setImmediate(resolve));
+		}
+		result.push({
+			sql: `INSERT INTO commit_logs (id, ts, table_id, data) VALUES ${tuples.join(", ")}`,
+			params: values,
+			table: "commit_logs",
+			operation: "commit_logs"
+		});
+	}
+	/**
+	* Point-only OCC check. For each genuine point read, compare the row's
+	* current commit_ts against the value captured at read time. A `null`
+	* expectedCommitTs means "row didn't exist when we read"; any row found
+	* now is a conflict. Reads whose row is being written in this same txn
+	* are skipped — the CAS UPDATE/DELETE already validated those.
+	*/
+	mysqlPrepareValidatePointReadsByCommitTs(readSet, writeSet) {
+		const result = [];
+		const writeKeys = /* @__PURE__ */ new Set();
+		for (const w of writeSet) writeKeys.add(`${w.table} ${w.id}`);
+		const byTable = /* @__PURE__ */ new Map();
+		const seen = /* @__PURE__ */ new Set();
+		for (const entry of readSet) {
+			if (entry.kind !== "point") continue;
+			const key = `${entry.table} ${entry.id}`;
+			if (writeKeys.has(key) || seen.has(key)) continue;
+			seen.add(key);
+			if (entry.expectedCommitTs === void 0) continue;
+			const bucket = byTable.get(entry.table);
+			if (bucket) bucket.push({
+				entry,
+				key
+			});
+			else byTable.set(entry.table, [{
+				entry,
+				key
+			}]);
+		}
+		for (const [table, pendings] of byTable) {
+			const ids = pendings.map((p) => p.entry.id);
+			const placeholders = ids.map(() => "?").join(", ");
+			result.push({
+				sql: `SELECT id, commit_ts FROM ${table} WHERE id IN (${placeholders})`,
+				params: ids,
+				table,
+				operation: "pointReadValidation",
+				pendingsEntry: pendings
+			});
+		}
+		return result;
+	}
+	async commitWrites(beginTs, queries, commitTs) {
+		await this.mysqlApplyWrites(queries.commits);
+		if (!queries.hasRangeRead) {
+			if ((queries.validateReadPoints?.length ?? 0) > 0) await this.validatePointReadsByCommitTs(queries.validateReadPoints ?? []);
+			return { success: true };
+		}
+		const logs = await this.getCommitLogsSinceTs(beginTs, commitTs, queries.tableIds ?? []);
+		if (checkLogsAffectReadSet(logs, queries.rawReadSet ?? [])) throw new OccConflictError(`Conflict detected: overlapping commit logs since ${beginTs}`, { logs });
+		return { success: true };
+	}
+	async mysqlApplyWrites(result) {
+		for (const q of result) switch (q.operation) {
+			case "insertBatch":
+				try {
+					await this.query(q.sql, q.params);
+				} catch (err) {
+					if (err && typeof err === "object" && (err.errno === 1062 || err.code === "ER_DUP_ENTRY")) {
+						const failedId = (err.message ?? "").match(/key '[^']+'.*?\(.*?\)=\(?([^,\)]+)/)?.[1];
+						throw new OccConflictError(failedId !== void 0 ? `Conflict: insert into ${q.table}/${failedId} hit duplicate key` : `Conflict: batch insert into ${q.table} hit duplicate key`, err);
+					}
+					throw err;
+				}
+				break;
+			case "updateSingle":
+				if (((await this.query(q.sql, q.params)).rowCount ?? 0) === 0) throw new OccConflictError(`Conflict: CAS update of ${q.table}/${q.entryId} (expected commit_ts=${q.expectedTs}) matched no rows`, {
+					table: q.table,
+					id: q.entryId,
+					expected: q.expectedTs
+				});
+				break;
+			case "deleteBatch":
+				if (((await this.query(q.sql, q.params)).rowCount ?? 0) === 0) throw new OccConflictError(`Conflict: CAS delete of ${q.table}/${q.entryId} (expected commit_ts=${q.expectedTs}) matched no rows`, {
+					table: q.table,
+					id: q.entryId,
+					expected: q.expectedTs
+				});
+				break;
+			case "commit_logs":
+				await this.query(q.sql, q.params);
+				break;
+			default: throw new Error("Unhandled MySQL Operation: " + q.operation);
+		}
+	}
+	async validatePointReadsByCommitTs(queries) {
+		for (const q of queries) {
+			const result = await this.query(q.sql, q.params);
+			const currentById = /* @__PURE__ */ new Map();
+			for (const row of result.rows) currentById.set(String(row.id), BigInt(row.commit_ts));
+			for (const { entry } of q.pendingsEntry ?? []) {
+				const current = currentById.get(String(entry.id));
+				const expected = entry.expectedCommitTs;
+				if (expected === null) {
+					if (current !== void 0) throw new OccConflictError(`Conflict: row ${entry.table}/${entry.id} was inserted concurrently`, {
+						table: entry.table,
+						id: entry.id
+					});
+				} else {
+					if (current === void 0) throw new OccConflictError(`Conflict: row ${entry.table}/${entry.id} was deleted concurrently`, {
+						table: entry.table,
+						id: entry.id,
+						expected
+					});
+					if (current !== expected) throw new OccConflictError(`Conflict: row ${entry.table}/${entry.id} changed from ts=${expected} to ts=${current}`, {
+						table: entry.table,
+						id: entry.id,
+						expected,
+						current
+					});
+				}
+			}
+		}
+	}
+	async pruneCommitLogsBefore(ts) {
+		const result = await this.query(`DELETE FROM commit_logs WHERE ts < ?`, [ts]);
+		return BigInt(result.rowCount ?? 0);
+	}
+	async getCommitLogsBetweenTs(beginTs, endTs, tableIds) {
+		if (tableIds.length === 0) return [];
+		const sql = `SELECT id, ts, table_id, data FROM commit_logs WHERE ts >= ? AND ts < ? AND table_id IN (${tableIds.map(() => "?").join(", ")})`;
+		return (await this.query(sql, [
+			beginTs,
+			endTs,
+			...tableIds.map(toBufferView)
+		])).rows.map((row) => ({
+			id: normalizeToBytes(row.id),
+			ts: BigInt(row.ts),
+			tableId: normalizeToBytes(row.table_id),
+			data: normalizeToBytes(row.data)
+		}));
+	}
+	async getCommitLogsSinceTs(sinceTs, excludeTs, tableIds) {
+		if (tableIds.length === 0) return [];
+		const sql = `SELECT id, ts, table_id, data FROM commit_logs WHERE ts >= ? AND ts <> ? AND table_id IN (${tableIds.map(() => "?").join(", ")})`;
+		return (await this.query(sql, [
+			sinceTs,
+			excludeTs,
+			...tableIds.map(toBufferView)
+		])).rows.map((row) => ({
+			id: normalizeToBytes(row.id),
+			ts: BigInt(row.ts),
+			tableId: normalizeToBytes(row.table_id),
+			data: normalizeToBytes(row.data)
+		}));
+	}
+	async close() {
+		await this.pool.end();
+	}
+};
+var MySqlTxDatabase = class extends MySqlDatabase {
+	constructor(logger, config, pool, client) {
+		super(logger, config, pool);
+		this.client = client;
+	}
+	client;
+	async query(sql, params = []) {
+		try {
+			const [rows] = this.queryTimeoutMs > 0 ? await this.client.query({
+				sql,
+				values: params,
+				timeout: this.queryTimeoutMs
+			}) : await this.client.query(sql, params);
+			return normalizeMysqlResult(rows);
+		} catch (err) {
+			throw translateMysqlError(err);
+		}
+	}
+	async begin() {
+		await this.client.beginTransaction();
+	}
+	async commit() {
+		await this.client.commit();
+	}
+	async rollback() {
+		await this.client.rollback();
+	}
+	release() {
+		this.client.release();
+	}
+};
+/**
+* MySQL InnoDB deadlock (errno 1213 / SQLSTATE 40001) is transient and
+* semantically equivalent to an OCC conflict from the mutation runner's
+* perspective: re-execute the handler with a fresh snapshot. Wrapping
+* here lets realtime_db.ts stay driver-agnostic — its retry loop already
+* handles OccConflictError.
+*/
+function translateMysqlError(err) {
+	if (err && typeof err === "object" && (err.errno === 1213 || err.code === "ER_LOCK_DEADLOCK")) return new OccConflictError("deadlock detected", err);
+	return err;
+}
+const mysqlSql = {
+	placeholder: (i) => `?`,
+	like: (col, i) => `${col} LIKE ?`,
+	ilike: (col, i) => `${col} LIKE ?`,
+	icontains: (col, i) => `${col} LIKE ?`,
+	jsonContains: (col, _i, opts) => opts?.pathIndex !== void 0 ? `JSON_CONTAINS(${col}, CAST(? AS JSON), ?)` : `JSON_CONTAINS(${col}, CAST(? AS JSON))`,
+	jsonContainedBy: (col, _i, opts) => opts?.pathIndex !== void 0 ? `JSON_CONTAINS(CAST(? AS JSON), JSON_EXTRACT(${col}, ?))` : `JSON_CONTAINS(CAST(? AS JSON), ${col})`,
+	jsonHasKey: (col, _i, opts) => {
+		if (opts?.pathCount && opts.pathCount > 0) return `JSON_CONTAINS_PATH(${col}, ${opts.mode === "all" ? "'all'" : "'one'"}, ${new Array(opts.pathCount).fill("?").join(", ")})`;
+		return opts?.raw ? `JSON_CONTAINS_PATH(${col}, 'one', ?)` : `JSON_CONTAINS_PATH(${col}, 'one', CONCAT('$."', REPLACE(?, '"', '\\\\"'), '"'))`;
+	},
+	jsonArrayContains: (col, _i, opts) => opts?.pathIndex !== void 0 ? `JSON_CONTAINS(${col}, JSON_ARRAY(CAST(? AS JSON)), ?)` : `JSON_CONTAINS(${col}, JSON_ARRAY(CAST(? AS JSON)))`
+};
+//#endregion
+export { MySqlDatabase as t };
+
+//# sourceMappingURL=mysql-DELSRrpY.js.map

package/dist/mysql-DELSRrpY.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mysql-DELSRrpY.js","names":[],"sources":["../src/db/mysql.ts"],"sourcesContent":["import mysql, { Pool, PoolConnection, PoolOptions } from \"mysql2/promise\";\nimport { Database, DbQueryResult, DbType, LazyCommitTsParam, PendingPointEntry, PooledClient, PreparedQueries, PreparedQuery, SqlBuilder, TxDatabase } from \"./db\";\nimport { CommitLogEntry, normalizeIdToBytes, normalizeToBytes, OccConflictError, PointRead, ReadEntry, WriteEntry } from \"./types_db\";\nimport { utf8Encode } from \"./bytes\";\n\n// mysql2 expects Buffer (not plain Uint8Array) for binary params.\nfunction toBufferView(bytes: Uint8Array): Buffer {\n  if (Buffer.isBuffer(bytes)) return bytes;\n  return Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n}\nimport { checkLogsAffectReadSet, mapReadSetToRaw } from \"../server/overlap-checker\";\nimport { supaliveStringify } from \"../helper\";\nimport { CacheLayer } from \"./cache\";\nimport { Logger } from \"pino\";\n\n/**\n * mysql2 returns `ResultSetHeader` for non-SELECT queries (carrying\n * `affectedRows`) and `RowDataPacket[]` for SELECTs. The previous shim\n * blindly cast to T[] which made `rowCount` zero for UPDATE/DELETE, breaking\n * CAS detection. This helper picks the right shape.\n */\nfunction normalizeMysqlResult<T>(raw: unknown): DbQueryResult<T> {\n  if (Array.isArray(raw)) {\n    return { rows: raw as T[], rowCount: raw.length };\n  }\n  if (raw && typeof raw === \"object\" && \"affectedRows\" in raw) {\n    return { rows: [], rowCount: Number((raw as { affectedRows: number }).affectedRows) || 0 };\n  }\n  return { rows: [], rowCount: 0 };\n}\n\ninterface QueryConnection {\n  query(opts: { sql: string; timeout?: number; values?: unknown[] }): Promise<[any[], unknown]>;\n  query(sql: string, params?: unknown[]): Promise<[any[], unknown]>;\n}\n\n/**\n * mysql2's PoolOptions does not have a per-statement timeout field; we\n * carry our own. Set 0 to disable.\n */\nexport type MySqlPoolOptions = PoolOptions & { queryTimeoutMs?: number };\n\nexport class MySqlDatabase implements Database {\n  constructor(\n    logger: Logger,\n    config: MySqlPoolOptions,\n    pool: Pool | undefined = undefined,\n  ) {\n    this.logger = logger;\n    const { queryTimeoutMs, ...poolConfig } = config;\n    this.queryTimeoutMs = queryTimeoutMs ?? 0;\n    this.config = poolConfig;\n    if (pool) {\n      this.pool = pool;\n    } else {\n      this.pool = mysql.createPool(poolConfig);\n    }\n  }\n\n  private logger: Logger;\n  public config: PoolOptions;\n  protected queryTimeoutMs: number;\n  private pool: Pool;\n  readonly dbType: DbType = \"mysql\";\n  readonly sqlBuilder: SqlBuilder = mysqlSql;\n  // Lazy per-table column-type cache. The apply path consults this for\n  // unnest carriers/casts in batched writes; we never re-query pg_attribute\n  // for a table we've already seen unless the cache is explicitly\n  // invalidated (e.g. after a migration). Shared with tx clients via\n  // adoptRegistries so a single startup load services all transactions.\n  public columnTypes: Map<string, Map<string, string>> = new Map();\n  // Compiled-SQL cache keyed by (op, table, sorted column signature).\n  // Mirrors columnTypes — invalidated together when types change.\n  protected sqlCache: Map<string, string> = new Map();\n\n  /**\n   * Fetches actual column types from MySQL for `table` and returns a\n   * map of DB column name → MySQL type string (as produced by `COLUMN_TYPE`,\n   * e.g. `bigint`, `integer`, `varchar(32)`, `text`, `json`).\n   * No caching here — see {@link getColumnTypes} for the cached path.\n   */\n  async loadColumnTypesFromMySql(table: string): Promise<Map<string, string>> {\n    const result = await this.query<{ column_name: string; mysql_type: string }>(\n      `SELECT COLUMN_NAME AS column_name, COLUMN_TYPE AS mysql_type\n         FROM INFORMATION_SCHEMA.COLUMNS\n         WHERE TABLE_SCHEMA = DATABASE() AND TABLE_NAME = ?\n         ORDER BY ORDINAL_POSITION`,\n      [table],\n    );\n    // MySQL folds unquoted identifiers to lowercase on the server side, so\n    // COLUMN_NAME comes back lowercase. JS-side column keys\n    // (`entry.data`) often arrive in camelCase from the schema layer; we\n    // lookup via lowercase to bridge the two cases without making callers\n    // worry about it.\n    const out = new Map<string, string>();\n    for (const row of result.rows) out.set(row.column_name.toLowerCase(), row.mysql_type);\n    return out;\n  }\n\n  /**\n   * Synchronous column-type lookup. The apply path calls this on every\n   * batched write, so it can't await — populate the cache via\n   * {@link bootstrapColumnTypes} at server start. Throws if `table` is\n   * missing (programmer error / bootstrap skipped).\n   */\n  getColumnTypes(table: string): Map<string, string> | null {\n    const hit = this.columnTypes.get(table);\n    if (!hit) {\n      this.logger.warn({ table }, \"MySqlDatabase: no cached column types fallback to non-batched writes\");\n      return null;\n    }\n    return hit;\n  }\n\n  /**\n   * Eagerly load column types into the in-memory cache. With a Redis\n   * client supplied, attempts the cache key first and falls through to\n   * MySQL on miss (writing the result back to Redis). This is the\n   * \"one server queries MySQL, the rest read from Redis\" pattern for cold\n   * starts in a multi-instance deploy. Without Redis, always queries MySQL.\n   *\n   * Pass `tables` to limit the load to a specific list; otherwise every\n   * user table in the connected database is loaded.\n   *\n   * The Redis cache key should encode whatever invalidates types in your\n   * environment (typically a schema version / deploy version). The\n   * subscriber in supalive-server.ts is expected to publish a reload\n   * signal after migrations and invoke {@link invalidateColumnTypes}.\n   */\n  async bootstrapColumnTypes(opts: {\n    redis?: CacheLayer;\n    cacheKey: string;\n    tables?: string[];\n  }): Promise<void> {\n    this.invalidateColumnTypes();\n\n    const { redis, cacheKey, tables } = opts;\n\n    // Redis hit path: deserialize the full table → column → mysqlType map\n    // and populate in one shot, skipping any INFORMATION_SCHEMA round-trips.\n    if (redis) {\n      const cached = await redis.getCachedTableColumnTypes(cacheKey);\n      if (cached) {\n        for (const [table, cols] of Object.entries(cached)) {\n          this.columnTypes.set(table, new Map(Object.entries(cols)));\n        }\n        return;\n      }\n    }\n\n    // Cache miss (or no Redis): query MySQL for the listed tables\n    // (or enumerate all user tables) and populate.\n    const names = tables ?? await this.listUserTables();\n    for (const t of names) {\n      if (this.columnTypes.has(t)) continue;\n\n      const fresh = await this.loadColumnTypesFromMySql(t);\n      this.columnTypes.set(t, fresh);\n    }\n\n    // Write back to Redis so subsequent server instances skip the MySQL hop.\n    if (redis) {\n      const dump: Record<string, Record<string, string>> = {};\n      for (const [table, cols] of this.columnTypes) {\n        dump[table] = Object.fromEntries(Object.entries(cols).sort());\n      }\n      await redis.setCachedTableColumnsTypes(cacheKey, dump);\n    }\n  }\n\n  /**\n     * Invalidate cached types (and dependent SQL) for `table`, or the entire\n     * cache if `table` is omitted. The Redis-pubsub reload signal in\n     * supalive-server.ts is expected to call this on schema changes.\n     */\n  invalidateColumnTypes(table?: string): void {\n    if (table) {\n      this.columnTypes.delete(table);\n      for (const k of [...this.sqlCache.keys()]) {\n        if (k.includes(`:${table}:`) || k === `d:${table}`) this.sqlCache.delete(k);\n      }\n    } else {\n      this.columnTypes.clear();\n      this.sqlCache.clear();\n    }\n  }\n\n  /** Replace this instance's caches with shared references from a parent.\n   *  Used by getTransactionClient so types loaded once at startup are\n   *  visible inside transactions. */\n  adoptCaches(\n    columnTypes: Map<string, Map<string, string>>,\n    sqlCache: Map<string, string>,\n  ): void {\n    this.columnTypes = columnTypes;\n    this.sqlCache = sqlCache;\n  }\n\n  /** Enumerate the user-defined tables in the connected database for mysql — used\n   * by bootstrapColumnTypes() when no explicit list is provided. */\n  private async listUserTables(): Promise<string[]> {\n    const result = await this.query<{ table_name: string }>(\n      `SELECT table_name FROM information_schema.tables\n       WHERE table_schema = DATABASE() AND table_type = 'BASE TABLE'\n         AND table_name NOT IN ('commit_logs', 'metadata', 'sequence')`\n    );\n    return result.rows.map(r => r.table_name);\n  }\n\n  migrationSql = [\n    // Commit logs table (per-entry inserts, note 8)\n    `CREATE TABLE IF NOT EXISTS commit_logs (\n      id BINARY(16) NOT NULL,\n      ts BIGINT NOT NULL,\n      table_id BINARY(16) NOT NULL,\n      data LONGBLOB NOT NULL,\n      PRIMARY KEY (ts, table_id, id),\n      INDEX commit_logs_by_table_and_id (table_id, id, ts)\n    ) ENGINE=InnoDB ROW_FORMAT=DYNAMIC`,\n    // `CREATE INDEX IF NOT EXISTS commit_logs_by_table_ts_and_id ON commit_logs (table_id, ts, id)`,\n\n    // Timestamp sequence table for MySQL\n    `CREATE TABLE IF NOT EXISTS sequence (id INT NOT NULL)`,\n    `INSERT IGNORE INTO sequence VALUES (0)`,\n\n    // Metadata table\n    `CREATE TABLE IF NOT EXISTS metadata (\n      meta_key VARCHAR(255) PRIMARY KEY,\n      meta_value BIGINT NOT NULL\n    ) ENGINE=InnoDB;`,\n    `INSERT IGNORE INTO metadata (meta_key, meta_value) VALUES ('latest_committed_ts', 0);`\n  ];\n\n  async query<T = any>(sql: string, params: unknown[] = []): Promise<DbQueryResult<T>> {\n    const client = await this.pool.getConnection() as PoolConnection & QueryConnection;\n    try {\n      const [rows] = this.queryTimeoutMs > 0\n        ? await client.query({ sql, values: params, timeout: this.queryTimeoutMs })\n        : await client.query(sql, params);\n      return normalizeMysqlResult<T>(rows);\n    } catch (err) {\n      throw translateMysqlError(err);\n    } finally {\n      client.release();\n    }\n  }\n\n  async getClient(): Promise<PooledClient> {\n    const client = await this.pool.getConnection();\n    return client as unknown as PooledClient;\n  }\n\n  async getTransactionClient(): Promise<TxDatabase> {\n    const client = await this.pool.getConnection();\n    const tx = new MySqlTxDatabase(this.logger, { ...this.config, queryTimeoutMs: this.queryTimeoutMs }, this.pool, client as PoolConnection & QueryConnection);\n    tx.adoptCaches(this.columnTypes, this.sqlCache);\n    return tx;\n  }\n\n  async getLatestSnapshotTimestamp(): Promise<bigint> {\n    const result = await this.query<{ meta_value: string | number }>(\"SELECT meta_value FROM metadata WHERE meta_key = 'latest_committed_ts'\");\n    return BigInt(result.rows[0]?.meta_value ?? 0) || -1n;\n  }\n\n  async updateLatestSnapshotTimestamp(commitTs: bigint): Promise<void> {\n    await this.query(\n      `UPDATE metadata SET meta_value = ? WHERE meta_key = 'latest_committed_ts' AND meta_value < ?`,\n      [commitTs, commitTs]\n    );\n  }\n\n  async getNextTimestamp(): Promise<bigint> {\n    const result = await this.query<{ id: string | number | bigint }>(\n      \"UPDATE sequence SET id = LAST_INSERT_ID(id + 1); SELECT LAST_INSERT_ID() AS id\"\n    );\n    return BigInt(result.rows[0]?.id ?? 0) || -1n;\n  }\n\n  // Runs on the pool, not the tx client — intentionally. This keeps the\n  // transaction window short, but it means `prevData` is not snapshot-\n  // consistent with the eventual commitTs (a peer may have moved the row\n  // between beginTs and this SELECT). That's safe because:\n  //   1. The per-row CAS in pgApplyWrites is the real snapshot fence. If a\n  //      peer committed in our staleness window, the CAS sees a moved\n  //      commit_ts and throws OccConflictError → retry.\n  //   2. The only window where CAS passes with \"stale\" prevData is when\n  //      the current row at our SELECT moment matches `expectedCommitTs`;\n  //      by construction nobody committed between our captured ts and now,\n  //      so prevData IS consistent with the ts we're CAS-ing against.\n  //   3. The downstream consumer (overlap-checker.checkRowWriteAffectsRange)\n  //      is conservative on missing/odd prevData — \"unknown\" verdicts still\n  //      invalidate, so the worst case here is a spurious invalidation,\n  //      never a missed one.\n  // Locked in by mysql.attach-prev-data.test.ts.\n  async attachPrevDataToWriteSet(writeSet: WriteEntry[], readSet: ReadEntry[]): Promise<void> {\n    const readTsByKey = new Map<string, bigint | null>();\n    for (let i = readSet.length - 1; i >= 0; i--) {\n      const r = readSet[i]!;\n      if (r.kind !== \"point\" || r.expectedCommitTs === undefined) continue;\n\n      const key = `${r.table} ${r.id}`;\n      if (!readTsByKey.has(key)) readTsByKey.set(key, r.expectedCommitTs);\n    }\n\n    const byTable = new Map<string, WriteEntry[]>();\n    for (const entry of writeSet) {\n      if (entry.op !== \"update\" && entry.op !== \"delete\") continue;\n\n      const bucket = byTable.get(entry.table);\n      if (bucket) bucket.push(entry);\n      else byTable.set(entry.table, [entry]);\n    }\n    if (byTable.size === 0) return;\n\n    for (const [table, entries] of byTable) {\n      const ids = entries.map((e) => e.id);\n      const placeholders = ids.map(() => \"?\").join(\", \");\n      // No FOR UPDATE — the per-row CAS on the subsequent UPDATE/DELETE is\n      // the fence. If a peer mutated the row since our read, the CAS will\n      // see a stale expected commit_ts and throw OCC.\n      const sql = `SELECT * FROM ${table} WHERE id IN (${placeholders})`;\n      const result = await this.query<Record<string, unknown>>(sql, ids);\n\n      const byId = new Map<string, Record<string, unknown>>();\n      for (const row of result.rows) {\n        byId.set(String(row.id), row);\n      }\n      for (const entry of entries) {\n        const row = byId.get(String(entry.id));\n        const key = `${entry.table} ${entry.id}`;\n        const priorReadTs = readTsByKey.get(key);\n\n        if (row) {\n          entry.prevData = row;\n          // Prefer the read-time ts so read-then-update patterns get\n          // beginTs-level isolation; fall back to current row ts for\n          // blind writes (no prior read).\n          entry.expectedCommitTs = priorReadTs !== undefined\n            ? priorReadTs\n            : BigInt(row.commit_ts as string | number | bigint);\n        } else if (priorReadTs !== undefined) {\n          // Row gone now, but we had read it earlier: carry the read ts —\n          // the CAS will then mismatch (row deleted) and throw OCC.\n          entry.expectedCommitTs = priorReadTs;\n        }\n        // else: neither a prior read nor a current row → leave undefined\n        // so CAS misses and surfaces OCC.\n      }\n    }\n  }\n\n  // Prepare BEFORE the conflict scan: each write is a CAS against the row's\n  // commit_ts, so any concurrent peer that touched the row produces a\n  // 0-row-affected UPDATE/DELETE → OccConflictError. Inserts surface as\n  // PK violations, also translated to OCC.\n  async prepareCommitWrites(\n    readSet: ReadEntry[],\n    writeSet: WriteEntry[],\n    commitTs: LazyCommitTsParam,\n  ): Promise<PreparedQueries> {\n    const result: PreparedQuery[] = [];\n\n    await this.mysqlPrepareBatchWrites(result, writeSet, commitTs);\n    await this.mysqlPrepareCommitLogs(result, writeSet, commitTs);\n\n    const hasRangeRead = readSet.some(r => r.kind === \"range\");\n    if (!hasRangeRead) {\n      const validateReads = this.mysqlPrepareValidatePointReadsByCommitTs(readSet, writeSet);\n      return { commits: result, validateReadPoints: validateReads, hasRangeRead: false };\n    }\n\n    // has atleast one range read so use scan, prepare data\n    const tableIds = [...new Set(readSet.map(r => r.tableId))];\n    const rawReadSet = mapReadSetToRaw(readSet);\n\n    return { commits: result, hasRangeRead: true, tableIds: tableIds, rawReadSet: rawReadSet };\n  }\n\n  private async mysqlPrepareBatchWrites(\n    result: PreparedQuery[],\n    writeSet: WriteEntry[],\n    commitTs: LazyCommitTsParam,\n  ) {\n    let i = 0;\n    let counter = 0;\n    while (i < writeSet.length) {\n      counter++;\n      const { table, op } = writeSet[i];\n      let j = i + 1;\n      while (j < writeSet.length && writeSet[j].table === table && writeSet[j].op === op) j++;\n\n      const batch = writeSet.slice(i, j);\n      if (op === \"insert\") await this.mysqlPrepareInsertBatch(result, table, batch, commitTs);\n      else if (op === \"update\") await this.mysqlPrepareUpdateSingle(result, table, batch, commitTs);\n      else await this.mysqlPrepareDeleteBatch(result, table, batch);\n      i = j;\n\n      if (counter % 50 == 0) {\n        await new Promise<void>((resolve) => setImmediate(resolve));\n      }\n    }\n  }\n\n  private async mysqlPrepareInsertBatch(\n    result: PreparedQuery[],\n    table: string,\n    entries: WriteEntry[],\n    commitTs: LazyCommitTsParam,\n  ) {\n    if (entries.length === 0) return;\n\n    const groups = new Map<string, { cols: string[]; rows: WriteEntry[] }>();\n    for (const entry of entries) {\n      const cols = [...Object.keys(entry.data ?? {}), 'commit_ts'].sort();\n      const key = cols.join(\"|\");\n      let g = groups.get(key);\n      if (!g) { g = { cols, rows: [] }; groups.set(key, g); }\n      g.rows.push(entry);\n    }\n\n    let counter = 0;\n    for (const { cols, rows } of groups.values()) {\n      counter++;\n\n      const values: unknown[] = [];\n      const tuples: string[] = [];\n      for (const entry of rows) {\n        const data = { ...(entry.data ?? {}), commit_ts: commitTs } as Record<string, unknown>;\n        tuples.push(`(${cols.map(() => \"?\").join(\", \")})`);\n        for (const col of cols) {\n          values.push(data[col]);\n        }\n      }\n      if (counter % 50 == 0) {\n        await new Promise<void>((resolve) => setImmediate(resolve));\n      }\n\n      result.push({\n        sql: `INSERT INTO ${table} (${cols.join(\", \")}) VALUES ${tuples.join(\", \")}`,\n        params: values,\n        operation: \"insertBatch\",\n        table: table,\n      })\n    }\n  }\n\n  private async mysqlPrepareUpdateSingle(\n    result: PreparedQuery[],\n    table: string,\n    entries: WriteEntry[],\n    commitTs: LazyCommitTsParam,\n  ) {\n    if (entries.length === 0) return;\n\n    let counter = 0;\n    for (const entry of entries) {\n      counter++;\n\n      const data = { ...(entry.data ?? {}), commit_ts: commitTs };\n      const columns = Object.keys(data);\n      const sets = columns.map((c) => `${c} = ?`);\n      const values = Object.values(data);\n      const expected = entry.expectedCommitTs ?? -1n;\n\n      if (counter % 50 == 0) {\n        await new Promise<void>((resolve) => setImmediate(resolve));\n      }\n\n      result.push({\n        sql: `UPDATE ${table} SET ${sets.join(\", \")} WHERE id = ? AND commit_ts = ?`,\n        params: [...values, entry.id, expected],\n        operation: 'updateSingle',\n        table: table,\n        entryId: entry.id,\n        expectedTs: expected,\n      })\n    }\n  }\n\n  private async mysqlPrepareDeleteBatch(\n    result: PreparedQuery[],\n    table: string,\n    entries: WriteEntry[],\n  ) {\n    if (entries.length === 0) return;\n\n    let counter = 0;\n    for (const entry of entries) {\n      counter++;\n\n      const expected = entry.expectedCommitTs ?? -1n;\n\n      if (counter % 50 == 0) {\n        await new Promise<void>((resolve) => setImmediate(resolve));\n      }\n\n      result.push({\n        sql: `DELETE FROM ${table} WHERE id = ? AND commit_ts = ?`,\n        params: [entry.id, expected],\n        table: table,\n        operation: 'deleteSingle',\n        entryId: entry.id,\n        expectedTs: expected,\n      });\n    }\n  }\n\n  private async mysqlPrepareCommitLogs(\n    result: PreparedQuery[],\n    writeEntries: WriteEntry[],\n    commitTs: LazyCommitTsParam,\n  ) {\n    if (writeEntries.length === 0) return;\n\n    const values: unknown[] = [];\n    const tuples: string[] = [];\n    let counter = 0;\n\n    for (const entry of writeEntries) {\n      counter++;\n\n      tuples.push(`(?, ?, ?, ?)`);\n      values.push(\n        toBufferView(normalizeIdToBytes(entry.id)),\n        commitTs,\n        toBufferView(entry.tableId),\n        toBufferView(utf8Encode(supaliveStringify(entry))),\n      );\n\n      if (counter % 50 == 0) {\n        await new Promise<void>((resolve) => setImmediate(resolve));\n      }\n    }\n\n    result.push({\n      sql: `INSERT INTO commit_logs (id, ts, table_id, data) VALUES ${tuples.join(\", \")}`,\n      params: values,\n      table: 'commit_logs',\n      operation: 'commit_logs',\n    })\n  }\n\n  /**\n   * Point-only OCC check. For each genuine point read, compare the row's\n   * current commit_ts against the value captured at read time. A `null`\n   * expectedCommitTs means \"row didn't exist when we read\"; any row found\n   * now is a conflict. Reads whose row is being written in this same txn\n   * are skipped — the CAS UPDATE/DELETE already validated those.\n   */\n  private mysqlPrepareValidatePointReadsByCommitTs(\n    readSet: ReadEntry[],\n    writeSet: WriteEntry[],\n  ): PreparedQuery[] {\n    const result: PreparedQuery[] = [];\n\n    // Skip reads whose row is being mutated in this same tx — CAS already\n    // fenced them. We dedupe per (table, id) so duplicate reads of the same\n    // row don't cause extra fetches.\n    const writeKeys = new Set<string>();\n    for (const w of writeSet) writeKeys.add(`${w.table} ${w.id}`);\n\n    const byTable = new Map<string, PendingPointEntry[]>();\n    const seen = new Set<string>();\n\n    for (const entry of readSet) {\n      if (entry.kind !== \"point\") continue;\n\n      const key = `${entry.table} ${entry.id}`;\n      if (writeKeys.has(key) || seen.has(key)) continue;\n\n      seen.add(key);\n      // expectedCommitTs === undefined → no commit_ts captured at read time\n      // (synthetic or pre-migration). Skip — we cannot CAS-validate it. This\n      // path should only fire when callers construct PointReads externally.\n      if (entry.expectedCommitTs === undefined) continue;\n\n      const bucket = byTable.get(entry.table);\n      if (bucket) bucket.push({ entry, key });\n      else byTable.set(entry.table, [{ entry, key }]);\n    }\n\n    for (const [table, pendings] of byTable) {\n      const ids = pendings.map((p) => p.entry.id);\n      const placeholders = ids.map(() => \"?\").join(\", \");\n\n      result.push({\n        sql: `SELECT id, commit_ts FROM ${table} WHERE id IN (${placeholders})`,\n        params: ids,\n        table: table,\n        operation: 'pointReadValidation',\n        pendingsEntry: pendings,\n      });\n    }\n\n    return result;\n  }\n\n  async commitWrites(\n    beginTs: bigint,\n    queries: PreparedQueries,\n    commitTs: bigint,\n  ): Promise<{ success: boolean }> {\n    await this.mysqlApplyWrites(queries.commits);\n\n    // Fast path: when the readSet has no range reads, we don't need a\n    // commit-log scan at all — point reads validate via per-row commit_ts,\n    // and writes already self-validated via CAS above. This is the dominant\n    // shape (most mutations target known ids) and eliminates the heaviest\n    // OCC cost in the previous design.\n    if (!queries.hasRangeRead) {\n      if ((queries.validateReadPoints?.length ?? 0) > 0) {\n        await this.validatePointReadsByCommitTs(queries.validateReadPoints ?? []);\n      }\n      return { success: true };\n    }\n\n    // Slow path: at least one range read present. Fall back to the\n    // commit-log scan so phantom inserts and predicate transitions-in are\n    // still caught. Point reads in the same set are covered by the same\n    // scan, so no separate validation is needed.\n    const logs = await this.getCommitLogsSinceTs(beginTs, commitTs, queries.tableIds ?? []);\n    const hasConflict = checkLogsAffectReadSet(logs, queries.rawReadSet ?? []);\n    if (hasConflict) {\n      throw new OccConflictError(\n        `Conflict detected: overlapping commit logs since ${beginTs}`,\n        { logs }\n      );\n    }\n\n    return { success: true };\n  }\n\n  // Walks the writeSet in order and coalesces consecutive entries with the\n  // same (table, op) into one batched statement. Order is preserved across\n  // batch boundaries so replace-patterns (delete-then-insert of the same\n  // id) behave identically to the per-row code path. Single-row batches\n  // take a direct INSERT/UPDATE/DELETE fast-path to avoid the unnest+join\n  // overhead, which matters under high contention.\n  private async mysqlApplyWrites(result: PreparedQuery[]): Promise<void> {\n    for (const q of result) {\n      switch (q.operation) {\n        case 'insertBatch': {\n          try {\n            await this.query(q.sql, q.params);\n          } catch (err) {\n            if (\n              err && typeof err === \"object\" &&\n              ((err as { errno?: number }).errno === 1062 ||\n                (err as { code?: string }).code === \"ER_DUP_ENTRY\")\n            ) {\n              const msg = (err as { message?: string }).message ?? \"\";\n              const idMatch = msg.match(/key '[^']+'.*?\\(.*?\\)=\\(?([^,\\)]+)/);\n              const failedId = idMatch?.[1];\n              throw new OccConflictError(\n                failedId !== undefined\n                  ? `Conflict: insert into ${q.table}/${failedId} hit duplicate key`\n                  : `Conflict: batch insert into ${q.table} hit duplicate key`,\n                err,\n              );\n            }\n            throw err;\n          }\n          break;\n        }\n        case 'updateSingle': {\n          const result = await this.query(q.sql, q.params);\n          if ((result.rowCount ?? 0) === 0) {\n            throw new OccConflictError(\n              `Conflict: CAS update of ${q.table}/${q.entryId} (expected commit_ts=${q.expectedTs}) matched no rows`,\n              { table: q.table, id: q.entryId, expected: q.expectedTs },\n            );\n          }\n          break;\n        }\n        case 'deleteBatch': {\n          const result = await this.query(q.sql, q.params);\n          if ((result.rowCount ?? 0) === 0) {\n            throw new OccConflictError(\n              `Conflict: CAS delete of ${q.table}/${q.entryId} (expected commit_ts=${q.expectedTs}) matched no rows`,\n              { table: q.table, id: q.entryId, expected: q.expectedTs },\n            );\n          }\n          break;\n        }\n        case 'commit_logs': {\n          await this.query(q.sql, q.params);\n          break;\n        }\n        default:\n          throw new Error(\"Unhandled MySQL Operation: \" + q.operation);\n\n      }\n    }\n  }\n\n  private async validatePointReadsByCommitTs(queries: PreparedQuery[]): Promise<void> {\n\n    for (const q of queries) {\n      const result = await this.query<{ id: string; commit_ts: string | number | bigint }>(q.sql, q.params);\n\n      const currentById = new Map<string, bigint>();\n      for (const row of result.rows) {\n        currentById.set(String(row.id), BigInt(row.commit_ts));\n      }\n\n      for (const { entry } of q.pendingsEntry ?? []) {\n        const current = currentById.get(String(entry.id));\n        const expected = entry.expectedCommitTs;\n\n        if (expected === null) {\n          // We read \"no row\"; conflict if a row now exists.\n          if (current !== undefined) {\n            throw new OccConflictError(\n              `Conflict: row ${entry.table}/${entry.id} was inserted concurrently`,\n              { table: entry.table, id: entry.id }\n            );\n          }\n        } else {\n          if (current === undefined) {\n            throw new OccConflictError(\n              `Conflict: row ${entry.table}/${entry.id} was deleted concurrently`,\n              { table: entry.table, id: entry.id, expected }\n            );\n          }\n          if (current !== expected) {\n            throw new OccConflictError(\n              `Conflict: row ${entry.table}/${entry.id} changed from ts=${expected} to ts=${current}`,\n              { table: entry.table, id: entry.id, expected, current }\n            );\n          }\n        }\n      }\n    }\n  }\n\n  async pruneCommitLogsBefore(ts: bigint): Promise<bigint> {\n    const result = await this.query(\n      `DELETE FROM commit_logs WHERE ts < ?`,\n      [ts]\n    );\n    return BigInt(result.rowCount ?? 0);\n  }\n\n  async getCommitLogsBetweenTs(beginTs: bigint, endTs: bigint, tableIds: Uint8Array[]): Promise<CommitLogEntry[]> {\n    if (tableIds.length === 0) return [];\n\n    const placeholders = tableIds.map(() => '?').join(\", \");\n    const sql = `SELECT id, ts, table_id, data FROM commit_logs WHERE ts >= ? AND ts < ? AND table_id IN (${placeholders})`;\n\n    const result = await this.query<{ id: unknown; ts: string | number | bigint; table_id: unknown; data: unknown }>(\n      sql,\n      [beginTs, endTs, ...tableIds.map(toBufferView)]\n    );\n\n    return result.rows.map((row) => ({\n      id: normalizeToBytes(row.id),\n      ts: BigInt(row.ts),\n      tableId: normalizeToBytes(row.table_id),\n      data: normalizeToBytes(row.data),\n    }));\n  }\n\n  async getCommitLogsSinceTs(sinceTs: bigint, excludeTs: bigint, tableIds: Uint8Array[]): Promise<CommitLogEntry[]> {\n    if (tableIds.length === 0) return [];\n\n    const placeholders = tableIds.map(() => '?').join(\", \");\n    const sql = `SELECT id, ts, table_id, data FROM commit_logs WHERE ts >= ? AND ts <> ? AND table_id IN (${placeholders})`;\n\n    const result = await this.query<{ id: unknown; ts: string | number | bigint; table_id: unknown; data: unknown }>(\n      sql,\n      [sinceTs, excludeTs, ...tableIds.map(toBufferView)]\n    );\n\n    return result.rows.map((row) => ({\n      id: normalizeToBytes(row.id),\n      ts: BigInt(row.ts),\n      tableId: normalizeToBytes(row.table_id),\n      data: normalizeToBytes(row.data),\n    }));\n  }\n\n  async close(): Promise<void> {\n    await this.pool.end();\n  }\n}\n\nexport class MySqlTxDatabase extends MySqlDatabase {\n  constructor(logger: Logger, config: MySqlPoolOptions, pool: Pool, client: PoolConnection & QueryConnection) {\n    super(logger, config, pool);\n    this.client = client;\n  }\n\n  private client: PoolConnection & QueryConnection;\n\n  async query<T = any>(sql: string, params: unknown[] = []): Promise<DbQueryResult<T>> {\n    try {\n      const [rows] = this.queryTimeoutMs > 0\n        ? await this.client.query({ sql, values: params as any[], timeout: this.queryTimeoutMs })\n        : await this.client.query(sql, params as any[]);\n      return normalizeMysqlResult<T>(rows);\n    } catch (err) {\n      throw translateMysqlError(err);\n    }\n  }\n\n  async begin(): Promise<void> {\n    await this.client.beginTransaction();\n  }\n\n  async commit(): Promise<void> {\n    await this.client.commit();\n  }\n\n  async rollback(): Promise<void> {\n    await this.client.rollback();\n  }\n\n  release(): void {\n    this.client.release();\n  }\n}\n\n/**\n * MySQL InnoDB deadlock (errno 1213 / SQLSTATE 40001) is transient and\n * semantically equivalent to an OCC conflict from the mutation runner's\n * perspective: re-execute the handler with a fresh snapshot. Wrapping\n * here lets realtime_db.ts stay driver-agnostic — its retry loop already\n * handles OccConflictError.\n */\nfunction translateMysqlError(err: unknown): unknown {\n  if (\n    err && typeof err === \"object\" &&\n    ((err as { errno?: number }).errno === 1213 ||\n      (err as { code?: string }).code === \"ER_LOCK_DEADLOCK\")\n  ) {\n    return new OccConflictError(\"deadlock detected\", err);\n  }\n  return err;\n}\n\nconst mysqlSql: SqlBuilder = {\n  placeholder: (i) => `?`,\n  like: (col, i) => `${col} LIKE ?`,\n  ilike: (col, i) => `${col} LIKE ?`,  // MySQL doesn't have ILIKE\n  icontains: (col, i) => `${col} LIKE ?`,\n  // CAST(? AS JSON) lets the driver bind the param as a regular string\n  // (JSON-serialized client-side) and MySQL re-parses it into a JSON value\n  // for containment comparison. When a sub-path is set, JSON_CONTAINS takes\n  // the path as its third argument.\n  jsonContains: (col, _i, opts) => opts?.pathIndex !== undefined\n    ? `JSON_CONTAINS(${col}, CAST(? AS JSON), ?)`\n    : `JSON_CONTAINS(${col}, CAST(? AS JSON))`,\n  jsonContainedBy: (col, _i, opts) => opts?.pathIndex !== undefined\n    // For \"is the column contained in the candidate at this sub-path of the\n    // column\" we still need to extract the sub-path from the column side.\n    // JSON_CONTAINS's path arg is on the TARGET position, so we flip and use\n    // JSON_EXTRACT for the column side instead.\n    ? `JSON_CONTAINS(CAST(? AS JSON), JSON_EXTRACT(${col}, ?))`\n    : `JSON_CONTAINS(CAST(? AS JSON), ${col})`,\n  jsonHasKey: (col, _i, opts) => {\n    if (opts?.pathCount && opts.pathCount > 0) {\n      const mode = opts.mode === \"all\" ? \"'all'\" : \"'one'\";\n      const places = new Array(opts.pathCount).fill(\"?\").join(\", \");\n      return `JSON_CONTAINS_PATH(${col}, ${mode}, ${places})`;\n    }\n    return opts?.raw\n      // Param is already a JSON path expression like `$.foo.bar` or `$.\"a\".\"b\"`.\n      ? `JSON_CONTAINS_PATH(${col}, 'one', ?)`\n      // Param is a literal top-level key. Wrap it in `$.\"<key>\"` server-side\n      // and escape any embedded double-quotes so dotted keys behave as keys\n      // and not nested paths.\n      : `JSON_CONTAINS_PATH(${col}, 'one', CONCAT('$.\"', REPLACE(?, '\"', '\\\\\\\\\"'), '\"'))`;\n  },\n  jsonArrayContains: (col, _i, opts) => opts?.pathIndex !== undefined\n    ? `JSON_CONTAINS(${col}, JSON_ARRAY(CAST(? AS JSON)), ?)`\n    : `JSON_CONTAINS(${col}, JSON_ARRAY(CAST(? AS JSON)))`,\n};\n"],"mappings":";;;;;AAMA,SAAS,aAAa,OAA2B;CAC/C,IAAI,OAAO,SAAS,KAAK,GAAG,OAAO;CACnC,OAAO,OAAO,KAAK,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;AACrE;;;;;;;AAYA,SAAS,qBAAwB,KAAgC;CAC/D,IAAI,MAAM,QAAQ,GAAG,GACnB,OAAO;EAAE,MAAM;EAAY,UAAU,IAAI;CAAO;CAElD,IAAI,OAAO,OAAO,QAAQ,YAAY,kBAAkB,KACtD,OAAO;EAAE,MAAM,CAAC;EAAG,UAAU,OAAQ,IAAiC,YAAY,KAAK;CAAE;CAE3F,OAAO;EAAE,MAAM,CAAC;EAAG,UAAU;CAAE;AACjC;AAaA,IAAa,gBAAb,MAA+C;CAC7C,YACE,QACA,QACA,OAAyB,KAAA,GACzB;EACA,KAAK,SAAS;EACd,MAAM,EAAE,gBAAgB,GAAG,eAAe;EAC1C,KAAK,iBAAiB,kBAAkB;EACxC,KAAK,SAAS;EACd,IAAI,MACF,KAAK,OAAO;OAEZ,KAAK,OAAO,MAAM,WAAW,UAAU;CAE3C;CAEA;CACA;CACA;CACA;CACA,SAA0B;CAC1B,aAAkC;CAMlC,8BAAuD,IAAI,IAAI;CAG/D,2BAA0C,IAAI,IAAI;;;;;;;CAQlD,MAAM,yBAAyB,OAA6C;EAC1E,MAAM,SAAS,MAAM,KAAK,MACxB;;;qCAIA,CAAC,KAAK,CACR;EAMA,MAAM,sBAAM,IAAI,IAAoB;EACpC,KAAK,MAAM,OAAO,OAAO,MAAM,IAAI,IAAI,IAAI,YAAY,YAAY,GAAG,IAAI,UAAU;EACpF,OAAO;CACT;;;;;;;CAQA,eAAe,OAA2C;EACxD,MAAM,MAAM,KAAK,YAAY,IAAI,KAAK;EACtC,IAAI,CAAC,KAAK;GACR,KAAK,OAAO,KAAK,EAAE,MAAM,GAAG,sEAAsE;GAClG,OAAO;EACT;EACA,OAAO;CACT;;;;;;;;;;;;;;;;CAiBA,MAAM,qBAAqB,MAIT;EAChB,KAAK,sBAAsB;EAE3B,MAAM,EAAE,OAAO,UAAU,WAAW;EAIpC,IAAI,OAAO;GACT,MAAM,SAAS,MAAM,MAAM,0BAA0B,QAAQ;GAC7D,IAAI,QAAQ;IACV,KAAK,MAAM,CAAC,OAAO,SAAS,OAAO,QAAQ,MAAM,GAC/C,KAAK,YAAY,IAAI,OAAO,IAAI,IAAI,OAAO,QAAQ,IAAI,CAAC,CAAC;IAE3D;GACF;EACF;EAIA,MAAM,QAAQ,UAAU,MAAM,KAAK,eAAe;EAClD,KAAK,MAAM,KAAK,OAAO;GACrB,IAAI,KAAK,YAAY,IAAI,CAAC,GAAG;GAE7B,MAAM,QAAQ,MAAM,KAAK,yBAAyB,CAAC;GACnD,KAAK,YAAY,IAAI,GAAG,KAAK;EAC/B;EAGA,IAAI,OAAO;GACT,MAAM,OAA+C,CAAC;GACtD,KAAK,MAAM,CAAC,OAAO,SAAS,KAAK,aAC/B,KAAK,SAAS,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC;GAE9D,MAAM,MAAM,2BAA2B,UAAU,IAAI;EACvD;CACF;;;;;;CAOA,sBAAsB,OAAsB;EAC1C,IAAI,OAAO;GACT,KAAK,YAAY,OAAO,KAAK;GAC7B,KAAK,MAAM,KAAK,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC,GACtC,IAAI,EAAE,SAAS,IAAI,MAAM,EAAE,KAAK,MAAM,KAAK,SAAS,KAAK,SAAS,OAAO,CAAC;EAE9E,OAAO;GACL,KAAK,YAAY,MAAM;GACvB,KAAK,SAAS,MAAM;EACtB;CACF;;;;CAKA,YACE,aACA,UACM;EACN,KAAK,cAAc;EACnB,KAAK,WAAW;CAClB;;;CAIA,MAAc,iBAAoC;EAMhD,QAAO,MALc,KAAK,MACxB;;uEAGF,EAAA,CACc,KAAK,KAAI,MAAK,EAAE,UAAU;CAC1C;CAEA,eAAe;EAEb;;;;;;;;EAWA;EACA;EAGA;;;;EAIA;CACF;CAEA,MAAM,MAAe,KAAa,SAAoB,CAAC,GAA8B;EACnF,MAAM,SAAS,MAAM,KAAK,KAAK,cAAc;EAC7C,IAAI;GACF,MAAM,CAAC,QAAQ,KAAK,iBAAiB,IACjC,MAAM,OAAO,MAAM;IAAE;IAAK,QAAQ;IAAQ,SAAS,KAAK;GAAe,CAAC,IACxE,MAAM,OAAO,MAAM,KAAK,MAAM;GAClC,OAAO,qBAAwB,IAAI;EACrC,SAAS,KAAK;GACZ,MAAM,oBAAoB,GAAG;EAC/B,UAAU;GACR,OAAO,QAAQ;EACjB;CACF;CAEA,MAAM,YAAmC;EAEvC,OAAO,MADc,KAAK,KAAK,cAAc;CAE/C;CAEA,MAAM,uBAA4C;EAChD,MAAM,SAAS,MAAM,KAAK,KAAK,cAAc;EAC7C,MAAM,KAAK,IAAI,gBAAgB,KAAK,QAAQ;GAAE,GAAG,KAAK;GAAQ,gBAAgB,KAAK;EAAe,GAAG,KAAK,MAAM,MAA0C;EAC1J,GAAG,YAAY,KAAK,aAAa,KAAK,QAAQ;EAC9C,OAAO;CACT;CAEA,MAAM,6BAA8C;EAClD,MAAM,SAAS,MAAM,KAAK,MAAuC,wEAAwE;EACzI,OAAO,OAAO,OAAO,KAAK,EAAE,EAAE,cAAc,CAAC,KAAK,CAAC;CACrD;CAEA,MAAM,8BAA8B,UAAiC;EACnE,MAAM,KAAK,MACT,gGACA,CAAC,UAAU,QAAQ,CACrB;CACF;CAEA,MAAM,mBAAoC;EACxC,MAAM,SAAS,MAAM,KAAK,MACxB,gFACF;EACA,OAAO,OAAO,OAAO,KAAK,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC;CAC7C;CAkBA,MAAM,yBAAyB,UAAwB,SAAqC;EAC1F,MAAM,8BAAc,IAAI,IAA2B;EACnD,KAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;GAC5C,MAAM,IAAI,QAAQ;GAClB,IAAI,EAAE,SAAS,WAAW,EAAE,qBAAqB,KAAA,GAAW;GAE5D,MAAM,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE;GAC5B,IAAI,CAAC,YAAY,IAAI,GAAG,GAAG,YAAY,IAAI,KAAK,EAAE,gBAAgB;EACpE;EAEA,MAAM,0BAAU,IAAI,IAA0B;EAC9C,KAAK,MAAM,SAAS,UAAU;GAC5B,IAAI,MAAM,OAAO,YAAY,MAAM,OAAO,UAAU;GAEpD,MAAM,SAAS,QAAQ,IAAI,MAAM,KAAK;GACtC,IAAI,QAAQ,OAAO,KAAK,KAAK;QACxB,QAAQ,IAAI,MAAM,OAAO,CAAC,KAAK,CAAC;EACvC;EACA,IAAI,QAAQ,SAAS,GAAG;EAExB,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS;GACtC,MAAM,MAAM,QAAQ,KAAK,MAAM,EAAE,EAAE;GAKnC,MAAM,MAAM,iBAAiB,MAAM,gBAJd,IAAI,UAAU,GAAG,CAAC,CAAC,KAAK,IAIiB,EAAE;GAChE,MAAM,SAAS,MAAM,KAAK,MAA+B,KAAK,GAAG;GAEjE,MAAM,uBAAO,IAAI,IAAqC;GACtD,KAAK,MAAM,OAAO,OAAO,MACvB,KAAK,IAAI,OAAO,IAAI,EAAE,GAAG,GAAG;GAE9B,KAAK,MAAM,SAAS,SAAS;IAC3B,MAAM,MAAM,KAAK,IAAI,OAAO,MAAM,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,MAAM,MAAM,GAAG,MAAM;IACpC,MAAM,cAAc,YAAY,IAAI,GAAG;IAEvC,IAAI,KAAK;KACP,MAAM,WAAW;KAIjB,MAAM,mBAAmB,gBAAgB,KAAA,IACrC,cACA,OAAO,IAAI,SAAqC;IACtD,OAAO,IAAI,gBAAgB,KAAA,GAGzB,MAAM,mBAAmB;GAI7B;EACF;CACF;CAMA,MAAM,oBACJ,SACA,UACA,UAC0B;EAC1B,MAAM,SAA0B,CAAC;EAEjC,MAAM,KAAK,wBAAwB,QAAQ,UAAU,QAAQ;EAC7D,MAAM,KAAK,uBAAuB,QAAQ,UAAU,QAAQ;EAG5D,IAAI,CADiB,QAAQ,MAAK,MAAK,EAAE,SAAS,OAClC,GAEd,OAAO;GAAE,SAAS;GAAQ,oBADJ,KAAK,yCAAyC,SAAS,QACnB;GAAG,cAAc;EAAM;EAOnF,OAAO;GAAE,SAAS;GAAQ,cAAc;GAAM,UAAU,CAHtC,GAAG,IAAI,IAAI,QAAQ,KAAI,MAAK,EAAE,OAAO,CAAC,CAGO;GAAG,YAF/C,gBAAgB,OAEoD;EAAE;CAC3F;CAEA,MAAc,wBACZ,QACA,UACA,UACA;EACA,IAAI,IAAI;EACR,IAAI,UAAU;EACd,OAAO,IAAI,SAAS,QAAQ;GAC1B;GACA,MAAM,EAAE,OAAO,OAAO,SAAS;GAC/B,IAAI,IAAI,IAAI;GACZ,OAAO,IAAI,SAAS,UAAU,SAAS,EAAE,CAAC,UAAU,SAAS,SAAS,EAAE,CAAC,OAAO,IAAI;GAEpF,MAAM,QAAQ,SAAS,MAAM,GAAG,CAAC;GACjC,IAAI,OAAO,UAAU,MAAM,KAAK,wBAAwB,QAAQ,OAAO,OAAO,QAAQ;QACjF,IAAI,OAAO,UAAU,MAAM,KAAK,yBAAyB,QAAQ,OAAO,OAAO,QAAQ;QACvF,MAAM,KAAK,wBAAwB,QAAQ,OAAO,KAAK;GAC5D,IAAI;GAEJ,IAAI,UAAU,MAAM,GAClB,MAAM,IAAI,SAAe,YAAY,aAAa,OAAO,CAAC;EAE9D;CACF;CAEA,MAAc,wBACZ,QACA,OACA,SACA,UACA;EACA,IAAI,QAAQ,WAAW,GAAG;EAE1B,MAAM,yBAAS,IAAI,IAAoD;EACvE,KAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,OAAO,CAAC,GAAG,OAAO,KAAK,MAAM,QAAQ,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,KAAK;GAClE,MAAM,MAAM,KAAK,KAAK,GAAG;GACzB,IAAI,IAAI,OAAO,IAAI,GAAG;GACtB,IAAI,CAAC,GAAG;IAAE,IAAI;KAAE;KAAM,MAAM,CAAC;IAAE;IAAG,OAAO,IAAI,KAAK,CAAC;GAAG;GACtD,EAAE,KAAK,KAAK,KAAK;EACnB;EAEA,IAAI,UAAU;EACd,KAAK,MAAM,EAAE,MAAM,UAAU,OAAO,OAAO,GAAG;GAC5C;GAEA,MAAM,SAAoB,CAAC;GAC3B,MAAM,SAAmB,CAAC;GAC1B,KAAK,MAAM,SAAS,MAAM;IACxB,MAAM,OAAO;KAAE,GAAI,MAAM,QAAQ,CAAC;KAAI,WAAW;IAAS;IAC1D,OAAO,KAAK,IAAI,KAAK,UAAU,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE;IACjD,KAAK,MAAM,OAAO,MAChB,OAAO,KAAK,KAAK,IAAI;GAEzB;GACA,IAAI,UAAU,MAAM,GAClB,MAAM,IAAI,SAAe,YAAY,aAAa,OAAO,CAAC;GAG5D,OAAO,KAAK;IACV,KAAK,eAAe,MAAM,IAAI,KAAK,KAAK,IAAI,EAAE,WAAW,OAAO,KAAK,IAAI;IACzE,QAAQ;IACR,WAAW;IACJ;GACT,CAAC;EACH;CACF;CAEA,MAAc,yBACZ,QACA,OACA,SACA,UACA;EACA,IAAI,QAAQ,WAAW,GAAG;EAE1B,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,SAAS;GAC3B;GAEA,MAAM,OAAO;IAAE,GAAI,MAAM,QAAQ,CAAC;IAAI,WAAW;GAAS;GAE1D,MAAM,OADU,OAAO,KAAK,IACT,CAAC,CAAC,KAAK,MAAM,GAAG,EAAE,KAAK;GAC1C,MAAM,SAAS,OAAO,OAAO,IAAI;GACjC,MAAM,WAAW,MAAM,oBAAoB,CAAC;GAE5C,IAAI,UAAU,MAAM,GAClB,MAAM,IAAI,SAAe,YAAY,aAAa,OAAO,CAAC;GAG5D,OAAO,KAAK;IACV,KAAK,UAAU,MAAM,OAAO,KAAK,KAAK,IAAI,EAAE;IAC5C,QAAQ;KAAC,GAAG;KAAQ,MAAM;KAAI;IAAQ;IACtC,WAAW;IACJ;IACP,SAAS,MAAM;IACf,YAAY;GACd,CAAC;EACH;CACF;CAEA,MAAc,wBACZ,QACA,OACA,SACA;EACA,IAAI,QAAQ,WAAW,GAAG;EAE1B,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,SAAS;GAC3B;GAEA,MAAM,WAAW,MAAM,oBAAoB,CAAC;GAE5C,IAAI,UAAU,MAAM,GAClB,MAAM,IAAI,SAAe,YAAY,aAAa,OAAO,CAAC;GAG5D,OAAO,KAAK;IACV,KAAK,eAAe,MAAM;IAC1B,QAAQ,CAAC,MAAM,IAAI,QAAQ;IACpB;IACP,WAAW;IACX,SAAS,MAAM;IACf,YAAY;GACd,CAAC;EACH;CACF;CAEA,MAAc,uBACZ,QACA,cACA,UACA;EACA,IAAI,aAAa,WAAW,GAAG;EAE/B,MAAM,SAAoB,CAAC;EAC3B,MAAM,SAAmB,CAAC;EAC1B,IAAI,UAAU;EAEd,KAAK,MAAM,SAAS,cAAc;GAChC;GAEA,OAAO,KAAK,cAAc;GAC1B,OAAO,KACL,aAAa,mBAAmB,MAAM,EAAE,CAAC,GACzC,UACA,aAAa,MAAM,OAAO,GAC1B,aAAa,WAAW,kBAAkB,KAAK,CAAC,CAAC,CACnD;GAEA,IAAI,UAAU,MAAM,GAClB,MAAM,IAAI,SAAe,YAAY,aAAa,OAAO,CAAC;EAE9D;EAEA,OAAO,KAAK;GACV,KAAK,2DAA2D,OAAO,KAAK,IAAI;GAChF,QAAQ;GACR,OAAO;GACP,WAAW;EACb,CAAC;CACH;;;;;;;;CASA,yCACE,SACA,UACiB;EACjB,MAAM,SAA0B,CAAC;EAKjC,MAAM,4BAAY,IAAI,IAAY;EAClC,KAAK,MAAM,KAAK,UAAU,UAAU,IAAI,GAAG,EAAE,MAAM,GAAG,EAAE,IAAI;EAE5D,MAAM,0BAAU,IAAI,IAAiC;EACrD,MAAM,uBAAO,IAAI,IAAY;EAE7B,KAAK,MAAM,SAAS,SAAS;GAC3B,IAAI,MAAM,SAAS,SAAS;GAE5B,MAAM,MAAM,GAAG,MAAM,MAAM,GAAG,MAAM;GACpC,IAAI,UAAU,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,GAAG;GAEzC,KAAK,IAAI,GAAG;GAIZ,IAAI,MAAM,qBAAqB,KAAA,GAAW;GAE1C,MAAM,SAAS,QAAQ,IAAI,MAAM,KAAK;GACtC,IAAI,QAAQ,OAAO,KAAK;IAAE;IAAO;GAAI,CAAC;QACjC,QAAQ,IAAI,MAAM,OAAO,CAAC;IAAE;IAAO;GAAI,CAAC,CAAC;EAChD;EAEA,KAAK,MAAM,CAAC,OAAO,aAAa,SAAS;GACvC,MAAM,MAAM,SAAS,KAAK,MAAM,EAAE,MAAM,EAAE;GAC1C,MAAM,eAAe,IAAI,UAAU,GAAG,CAAC,CAAC,KAAK,IAAI;GAEjD,OAAO,KAAK;IACV,KAAK,6BAA6B,MAAM,gBAAgB,aAAa;IACrE,QAAQ;IACD;IACP,WAAW;IACX,eAAe;GACjB,CAAC;EACH;EAEA,OAAO;CACT;CAEA,MAAM,aACJ,SACA,SACA,UAC+B;EAC/B,MAAM,KAAK,iBAAiB,QAAQ,OAAO;EAO3C,IAAI,CAAC,QAAQ,cAAc;GACzB,KAAK,QAAQ,oBAAoB,UAAU,KAAK,GAC9C,MAAM,KAAK,6BAA6B,QAAQ,sBAAsB,CAAC,CAAC;GAE1E,OAAO,EAAE,SAAS,KAAK;EACzB;EAMA,MAAM,OAAO,MAAM,KAAK,qBAAqB,SAAS,UAAU,QAAQ,YAAY,CAAC,CAAC;EAEtF,IADoB,uBAAuB,MAAM,QAAQ,cAAc,CAAC,CAC1D,GACZ,MAAM,IAAI,iBACR,oDAAoD,WACpD,EAAE,KAAK,CACT;EAGF,OAAO,EAAE,SAAS,KAAK;CACzB;CAQA,MAAc,iBAAiB,QAAwC;EACrE,KAAK,MAAM,KAAK,QACd,QAAQ,EAAE,WAAV;GACE,KAAK;IACH,IAAI;KACF,MAAM,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM;IAClC,SAAS,KAAK;KACZ,IACE,OAAO,OAAO,QAAQ,aACpB,IAA2B,UAAU,QACpC,IAA0B,SAAS,iBACtC;MAGA,MAAM,YAFO,IAA6B,WAAW,GAAA,CACjC,MAAM,oCACH,CAAC,GAAG;MAC3B,MAAM,IAAI,iBACR,aAAa,KAAA,IACT,yBAAyB,EAAE,MAAM,GAAG,SAAS,sBAC7C,+BAA+B,EAAE,MAAM,qBAC3C,GACF;KACF;KACA,MAAM;IACR;IACA;GAEF,KAAK;IAEH,MAAK,MADgB,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAA,CACnC,YAAY,OAAO,GAC7B,MAAM,IAAI,iBACR,2BAA2B,EAAE,MAAM,GAAG,EAAE,QAAQ,uBAAuB,EAAE,WAAW,oBACpF;KAAE,OAAO,EAAE;KAAO,IAAI,EAAE;KAAS,UAAU,EAAE;IAAW,CAC1D;IAEF;GAEF,KAAK;IAEH,MAAK,MADgB,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAA,CACnC,YAAY,OAAO,GAC7B,MAAM,IAAI,iBACR,2BAA2B,EAAE,MAAM,GAAG,EAAE,QAAQ,uBAAuB,EAAE,WAAW,oBACpF;KAAE,OAAO,EAAE;KAAO,IAAI,EAAE;KAAS,UAAU,EAAE;IAAW,CAC1D;IAEF;GAEF,KAAK;IACH,MAAM,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM;IAChC;GAEF,SACE,MAAM,IAAI,MAAM,gCAAgC,EAAE,SAAS;EAE/D;CAEJ;CAEA,MAAc,6BAA6B,SAAyC;EAElF,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,SAAS,MAAM,KAAK,MAA2D,EAAE,KAAK,EAAE,MAAM;GAEpG,MAAM,8BAAc,IAAI,IAAoB;GAC5C,KAAK,MAAM,OAAO,OAAO,MACvB,YAAY,IAAI,OAAO,IAAI,EAAE,GAAG,OAAO,IAAI,SAAS,CAAC;GAGvD,KAAK,MAAM,EAAE,WAAW,EAAE,iBAAiB,CAAC,GAAG;IAC7C,MAAM,UAAU,YAAY,IAAI,OAAO,MAAM,EAAE,CAAC;IAChD,MAAM,WAAW,MAAM;IAEvB,IAAI,aAAa;SAEX,YAAY,KAAA,GACd,MAAM,IAAI,iBACR,iBAAiB,MAAM,MAAM,GAAG,MAAM,GAAG,6BACzC;MAAE,OAAO,MAAM;MAAO,IAAI,MAAM;KAAG,CACrC;IAAA,OAEG;KACL,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,iBACR,iBAAiB,MAAM,MAAM,GAAG,MAAM,GAAG,4BACzC;MAAE,OAAO,MAAM;MAAO,IAAI,MAAM;MAAI;KAAS,CAC/C;KAEF,IAAI,YAAY,UACd,MAAM,IAAI,iBACR,iBAAiB,MAAM,MAAM,GAAG,MAAM,GAAG,mBAAmB,SAAS,SAAS,WAC9E;MAAE,OAAO,MAAM;MAAO,IAAI,MAAM;MAAI;MAAU;KAAQ,CACxD;IAEJ;GACF;EACF;CACF;CAEA,MAAM,sBAAsB,IAA6B;EACvD,MAAM,SAAS,MAAM,KAAK,MACxB,wCACA,CAAC,EAAE,CACL;EACA,OAAO,OAAO,OAAO,YAAY,CAAC;CACpC;CAEA,MAAM,uBAAuB,SAAiB,OAAe,UAAmD;EAC9G,IAAI,SAAS,WAAW,GAAG,OAAO,CAAC;EAGnC,MAAM,MAAM,4FADS,SAAS,UAAU,GAAG,CAAC,CAAC,KAAK,IACiE,EAAE;EAOrH,QAAO,MALc,KAAK,MACxB,KACA;GAAC;GAAS;GAAO,GAAG,SAAS,IAAI,YAAY;EAAC,CAChD,EAAA,CAEc,KAAK,KAAK,SAAS;GAC/B,IAAI,iBAAiB,IAAI,EAAE;GAC3B,IAAI,OAAO,IAAI,EAAE;GACjB,SAAS,iBAAiB,IAAI,QAAQ;GACtC,MAAM,iBAAiB,IAAI,IAAI;EACjC,EAAE;CACJ;CAEA,MAAM,qBAAqB,SAAiB,WAAmB,UAAmD;EAChH,IAAI,SAAS,WAAW,GAAG,OAAO,CAAC;EAGnC,MAAM,MAAM,6FADS,SAAS,UAAU,GAAG,CAAC,CAAC,KAAK,IACkE,EAAE;EAOtH,QAAO,MALc,KAAK,MACxB,KACA;GAAC;GAAS;GAAW,GAAG,SAAS,IAAI,YAAY;EAAC,CACpD,EAAA,CAEc,KAAK,KAAK,SAAS;GAC/B,IAAI,iBAAiB,IAAI,EAAE;GAC3B,IAAI,OAAO,IAAI,EAAE;GACjB,SAAS,iBAAiB,IAAI,QAAQ;GACtC,MAAM,iBAAiB,IAAI,IAAI;EACjC,EAAE;CACJ;CAEA,MAAM,QAAuB;EAC3B,MAAM,KAAK,KAAK,IAAI;CACtB;AACF;AAEA,IAAa,kBAAb,cAAqC,cAAc;CACjD,YAAY,QAAgB,QAA0B,MAAY,QAA0C;EAC1G,MAAM,QAAQ,QAAQ,IAAI;EAC1B,KAAK,SAAS;CAChB;CAEA;CAEA,MAAM,MAAe,KAAa,SAAoB,CAAC,GAA8B;EACnF,IAAI;GACF,MAAM,CAAC,QAAQ,KAAK,iBAAiB,IACjC,MAAM,KAAK,OAAO,MAAM;IAAE;IAAK,QAAQ;IAAiB,SAAS,KAAK;GAAe,CAAC,IACtF,MAAM,KAAK,OAAO,MAAM,KAAK,MAAe;GAChD,OAAO,qBAAwB,IAAI;EACrC,SAAS,KAAK;GACZ,MAAM,oBAAoB,GAAG;EAC/B;CACF;CAEA,MAAM,QAAuB;EAC3B,MAAM,KAAK,OAAO,iBAAiB;CACrC;CAEA,MAAM,SAAwB;EAC5B,MAAM,KAAK,OAAO,OAAO;CAC3B;CAEA,MAAM,WAA0B;EAC9B,MAAM,KAAK,OAAO,SAAS;CAC7B;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;CACtB;AACF;;;;;;;;AASA,SAAS,oBAAoB,KAAuB;CAClD,IACE,OAAO,OAAO,QAAQ,aACpB,IAA2B,UAAU,QACpC,IAA0B,SAAS,qBAEtC,OAAO,IAAI,iBAAiB,qBAAqB,GAAG;CAEtD,OAAO;AACT;AAEA,MAAM,WAAuB;CAC3B,cAAc,MAAM;CACpB,OAAO,KAAK,MAAM,GAAG,IAAI;CACzB,QAAQ,KAAK,MAAM,GAAG,IAAI;CAC1B,YAAY,KAAK,MAAM,GAAG,IAAI;CAK9B,eAAe,KAAK,IAAI,SAAS,MAAM,cAAc,KAAA,IACjD,iBAAiB,IAAI,yBACrB,iBAAiB,IAAI;CACzB,kBAAkB,KAAK,IAAI,SAAS,MAAM,cAAc,KAAA,IAKpD,+CAA+C,IAAI,SACnD,kCAAkC,IAAI;CAC1C,aAAa,KAAK,IAAI,SAAS;EAC7B,IAAI,MAAM,aAAa,KAAK,YAAY,GAGtC,OAAO,sBAAsB,IAAI,IAFpB,KAAK,SAAS,QAAQ,UAAU,QAEH,IAD3B,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IACL,EAAE;EAEvD,OAAO,MAAM,MAET,sBAAsB,IAAI,eAI1B,sBAAsB,IAAI;CAChC;CACA,oBAAoB,KAAK,IAAI,SAAS,MAAM,cAAc,KAAA,IACtD,iBAAiB,IAAI,qCACrB,iBAAiB,IAAI;AAC3B"}