@voltro/plugin-search 0.55.0 → 0.56.0

package/dist/index.js

@@ -2,8 +2,9 @@ import { a as e, i as t, o as n, r, t as i } from "./rpc-CpryHBcM.js";
 import { Cause as a, Chunk as o, Data as s, Duration as c, Effect as l, Exit as u, Option as d, Schedule as f, Stream as p } from "effect";
 import { and as m, count as h, eq as g, id as _, integer as v, streamTable as y, table as b, text as x, timestamp as S } from "@voltro/database";
 import { definePlugin as ee, pluginInstanceName as te } from "@voltro/protocol";
+import { replicaId as ne } from "@voltro/protocol/identity";
 //#region src/sanitize.ts
-var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
+var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	let n = t ? new Set(t) : void 0;
 	for (let [t, r] of e) {
 		if (!w(r)) return {
@@ -244,7 +245,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		transient: !1
 	});
 	return t;
-}, re = (e) => {
+}, ie = (e) => {
 	let t = (e) => JSON.stringify(e), n = L("typesense", e.field);
 	switch (e.op) {
 		case "eq": return `${n}:=${t(e.value)}`;
@@ -256,14 +257,14 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		case "in": return `${n}:[${A(e.value).map(t).join(",")}]`;
 		case "nin": return `${n}:!=[${A(e.value).map(t).join(",")}]`;
 	}
-}, ie = (e, t = {}) => {
+}, ae = (e, t = {}) => {
 	let n = I("typesense", t), r, i = async () => (r ||= F("typesense", "typesense", () => import("typesense")).then((t) => {
 		let n = t.Client;
 		return new n({
 			nodes: [{ url: e.url ?? e.host ?? "http://localhost:8108" }],
 			apiKey: e.apiKey
 		});
-	}), r), a = (e) => e && e.length > 0 ? e.map(re).join(" && ") : void 0, o = async (e, t) => {
+	}), r), a = (e) => e && e.length > 0 ? e.map(ie).join(" && ") : void 0, o = async (e, t) => {
 		try {
 			return await t();
 		} catch (t) {
@@ -299,10 +300,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				...d !== void 0 && d !== "auto" ? { num_typos: Math.min(2, Math.max(0, d)) } : {},
 				...p.after
 			};
-			return ae(await o.collections(e).documents().search(m));
+			return oe(await o.collections(e).documents().search(m));
 		})
 	};
-}, ae = (e) => {
+}, oe = (e) => {
 	let t = (e.hits ?? []).map((e) => {
 		let t = {};
 		for (let n of e.highlights ?? []) {
@@ -319,7 +320,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		hits: t,
 		facets: n
 	};
-}, oe = (e) => {
+}, se = (e) => {
 	let t = (e) => JSON.stringify(e), n = L("meilisearch", e.field);
 	switch (e.op) {
 		case "eq": return `${n} = ${t(e.value)}`;
@@ -331,11 +332,11 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		case "in": return `${n} IN [${A(e.value).map(t).join(", ")}]`;
 		case "nin": return `${n} NOT IN [${A(e.value).map(t).join(", ")}]`;
 	}
-}, R = (e, t = {}) => {
+}, ce = (e, t = {}) => {
 	let n = I("meilisearch", t), r, i = async () => (r ||= F("meilisearch", "meilisearch", () => import("meilisearch")).then((t) => new t.MeiliSearch({
 		host: e.host ?? e.url ?? "http://localhost:7700",
 		apiKey: e.apiKey
-	})), r), a = (e) => e && e.length > 0 ? e.map(oe) : void 0, o = async (e, t) => {
+	})), r), a = (e) => e && e.length > 0 ? e.map(se) : void 0, o = async (e, t) => {
 		try {
 			return await t();
 		} catch (t) {
@@ -372,10 +373,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				} : {},
 				...o.after
 			};
-			return se(await (await i()).index(e).search(t, p), u);
+			return le(await (await i()).index(e).search(t, p), u);
 		})
 	};
-}, se = (e, t) => ({
+}, le = (e, t) => ({
 	hits: e.hits.map((e) => {
 		let { _formatted: n, ...r } = e;
 		if (t && n) {
@@ -389,7 +390,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		return { doc: r };
 	}),
 	facets: e.facetDistribution ?? {}
-}), ce = (e) => String(e).replace(/^-/, "\\-"), le = (e, t) => {
+}), ue = (e) => String(e).replace(/^-/, "\\-"), de = (e, t) => {
 	let n = typeof t == "boolean" ? +!!t : Number(t);
 	if (!Number.isFinite(n)) throw new k({
 		engine: "algolia",
@@ -398,10 +399,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		transient: !1
 	});
 	return n;
-}, ue = (e) => {
+}, fe = (e) => {
 	let t = [], n = [];
 	for (let r of e ?? []) {
-		let e = L("algolia", r.field), i = (e) => ce(e), a = (t) => le(e, t);
+		let e = L("algolia", r.field), i = (e) => ue(e), a = (t) => de(e, t);
 		switch (r.op) {
 			case "eq":
 				t.push(`${e}:${i(r.value)}`);
@@ -431,7 +432,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		facetFilters: t,
 		numericFilters: n
 	};
-}, z = (e, t = {}) => {
+}, pe = (e, t = {}) => {
 	let n = I("algolia", t), r, i = async () => (r ||= F("algoliasearch", "algolia", () => import("algoliasearch")).then((t) => t.algoliasearch(e.appId ?? "", e.apiKey)), r), a = async (e, t) => {
 		try {
 			return await t();
@@ -461,7 +462,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			});
 		}),
 		query: (e, { q: t, limit: r, offset: o, filters: s, facets: c, highlight: l, fuzziness: u, engineParams: d }) => a("query", async () => {
-			let { facetFilters: a, numericFilters: f } = ue(s), p = o ? {
+			let { facetFilters: a, numericFilters: f } = fe(s), p = o ? {
 				offset: o,
 				length: r ?? 20
 			} : { hitsPerPage: r ?? 20 }, m = n(d), h = {
@@ -479,13 +480,13 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				...u === 0 ? { typoTolerance: !1 } : {},
 				...m.after
 			};
-			return de(await (await i()).searchSingleIndex({
+			return me(await (await i()).searchSingleIndex({
 				indexName: e,
 				searchParams: h
 			}), l);
 		})
 	};
-}, de = (e, t) => ({
+}, me = (e, t) => ({
 	hits: e.hits.map((e) => {
 		let { _highlightResult: n, ...r } = e;
 		if (t && n) {
@@ -499,13 +500,13 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		return { doc: r };
 	}),
 	facets: e.facets ?? {}
-}), B = "_voltro_search_stats", V = () => ({
+}), R = "_voltro_search_stats", he = () => ({
 	synced: 0,
 	removed: 0,
 	dropped: 0,
 	lastReindexAt: null,
 	lastReindexCount: 0
-}), H = b(B, {
+}), ge = b(R, {
 	id: _({ prefix: "sstat" }),
 	indexName: x().maxLength(191),
 	replicaId: x().maxLength(191),
@@ -516,8 +517,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	lastReindexAt: S().nullable(),
 	lastReindexCount: v().default(0),
 	updatedAt: S()
-}).unique("bySearchStatsIndexReplica", ["indexName", "replicaId"]).index("bySearchStatsIndex", ["indexName"]), U = () => [H], W = () => {
-	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? V();
+}).unique("bySearchStatsIndexReplica", ["indexName", "replicaId"]).index("bySearchStatsIndex", ["indexName"]), z = () => [ge], B = () => {
+	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? he();
 	return {
 		bump: async (n, r) => {
 			let i = t(n);
@@ -552,15 +553,15 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		},
 		get: async (e) => t(e)
 	};
-}, G = (e) => ({
-	table: B,
+}, V = (e) => ({
+	table: R,
 	predicate: e,
 	order: [],
 	take: void 0,
 	skip: void 0,
 	projection: void 0
-}), fe = () => `sstat_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, pe = () => process.env.VOLTRO_REPLICA_ID ?? process.env.HOSTNAME ?? process.env.POD_NAME ?? `pid_${process.pid}_${Math.random().toString(36).slice(2, 8)}`, K = 32, q = (e, t = pe()) => {
-	let n = async (n) => (await e.query(G(m(g("indexName", n), g("replicaId", t)))))[0] ?? null, r = async (e) => {
+}), _e = () => `sstat_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, ve = () => ne(), H = 32, U = (e, t = ve()) => {
+	let n = async (n) => (await e.query(V(m(g("indexName", n), g("replicaId", t)))))[0] ?? null, r = async (e) => {
 		try {
 			return await e();
 		} catch (e) {
@@ -572,7 +573,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			});
 		}
 	}, i = (i, a, o, s) => r(async () => {
-		for (let r = 0; r < K; r++) {
+		for (let r = 0; r < H; r++) {
 			r > 0 && await new Promise((e) => setTimeout(e, r));
 			let c = await n(i);
 			if (c) {
@@ -589,7 +590,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 					updatedAt: /* @__PURE__ */ new Date()
 				}, { where: m(g("id", String(c.id)), g("synced", t), g("removed", n), g("dropped", r)) }) === 1) return;
 			} else {
-				let n = fe(), r = await e.insertIgnore(B, {
+				let n = _e(), r = await e.insertIgnore(R, {
 					id: n,
 					indexName: i,
 					replicaId: t,
@@ -608,7 +609,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		throw new k({
 			engine: "stats",
 			op: "upsert",
-			message: `search stats: contention on (${i}, ${t}) exceeded ${K} attempts`,
+			message: `search stats: contention on (${i}, ${t}) exceeded ${H} attempts`,
 			transient: !0
 		});
 	});
@@ -633,7 +634,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			lastReindexCount: t
 		}),
 		get: (t) => r(async () => {
-			let n = await e.query(G(g("indexName", t))), r = n.some((e) => e.scope === "fleet"), i = (e) => {
+			let n = await e.query(V(g("indexName", t))), r = n.some((e) => e.scope === "fleet"), i = (e) => {
 				let t = 0;
 				for (let i of n) {
 					let n = Number(i[e] ?? 0);
@@ -646,7 +647,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				t && (a === null || t > a) && (a = t, o = Number(e.lastReindexCount ?? 0));
 			}
 			return {
-				...V(),
+				...he(),
 				synced: i("synced"),
 				removed: i("removed"),
 				dropped: i("dropped"),
@@ -655,7 +656,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			};
 		})
 	};
-}, J = (e) => {
+}, W = (e) => {
 	let t = /* @__PURE__ */ new Map(), n = 0, r = !1, i = async () => {
 		if (t.size === 0) return;
 		let r = t;
@@ -687,12 +688,12 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		},
 		pending: () => n
 	};
-}, me = (e) => (t, n, r) => e().add(t, n, r), he = (e) => e === void 0 || e === "memory" ? "memory" : typeof e.query == "function" ? e.engineKind === "memory" ? "memory" : "custom" : "vendor", ge = class extends Error {
+}, G = (e) => (t, n, r) => e().add(t, n, r), K = (e) => e === void 0 || e === "memory" ? "memory" : typeof e.query == "function" ? e.engineKind === "memory" ? "memory" : "custom" : "vendor", q = class extends Error {
 	_tag = "SearchBackendNotDurable";
 	constructor(e) {
 		super(e), this.name = "SearchBackendNotDurable";
 	}
-}, _e = [
+}, ye = [
 	"plugin-search refuses to boot in production on the in-memory backend.",
 	"",
 	"The memory index lives in THIS process's heap. Two consequences, both silent:",
@@ -710,18 +711,18 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	"  searchPlugin({ singleProcessMemoryIndex: true, indexes })",
 	"That is a claim about your topology, not a mute switch: if a second replica",
 	"ever announces itself, the plugin logs that the claim was contradicted."
-].join("\n"), ve = [
+].join("\n"), be = [
 	"plugin-search is running the in-memory backend in production under",
 	"`singleProcessMemoryIndex: true`. Holding you to the two conditions that makes true:",
 	"exactly ONE process serves search, and it re-seeds every index at startup",
 	"(`backfillIndex`) — the index is empty after each restart until it does."
-].join(" "), ye = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
+].join(" "), J = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
 	level: "note",
-	message: ve
+	message: be
 } : {
 	level: "refuse",
-	message: _e
-}, be = (e, t) => t ? `search: replica "${e}" joined, but this app declared \`singleProcessMemoryIndex: true\`. That declaration is now false: each replica has its own in-memory index, so search results depend on which one serves the request. Configure a durable backend (typesense / meilisearch / algolia) or run one process.` : `search: replica "${e}" joined while search is served from an in-memory index. Each replica indexes only its OWN writes, so results depend on which replica answers. Configure a durable backend (typesense / meilisearch / algolia) before relying on these results.`, Y = "_voltro_search_drift", xe = b(Y, {
+	message: ye
+}, xe = (e, t) => t ? `search: replica "${e}" joined, but this app declared \`singleProcessMemoryIndex: true\`. That declaration is now false: each replica has its own in-memory index, so search results depend on which one serves the request. Configure a durable backend (typesense / meilisearch / algolia) or run one process.` : `search: replica "${e}" joined while search is served from an in-memory index. Each replica indexes only its OWN writes, so results depend on which replica answers. Configure a durable backend (typesense / meilisearch / algolia) before relying on these results.`, Y = "_voltro_search_drift", Se = b(Y, {
 	id: _({ prefix: "sdrft" }),
 	indexName: x().maxLength(191),
 	sourceTable: x().maxLength(191),
@@ -732,14 +733,14 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	lastError: x().maxLength(1e3),
 	firstFailedAt: S(),
 	lastFailedAt: S()
-}).unique("bySearchDriftIndexRow", ["indexName", "rowId"]).index("bySearchDriftIndex", ["indexName"]), Se = (e, t) => ({
+}).unique("bySearchDriftIndexRow", ["indexName", "rowId"]).index("bySearchDriftIndex", ["indexName"]), Ce = (e, t) => ({
 	table: e,
 	predicate: g("id", t),
 	order: [],
 	take: 1,
 	skip: void 0,
 	projection: void 0
-}), X = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), Ce = (e) => ({
+}), X = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), we = (e) => ({
 	indexName: String(e.indexName),
 	sourceTable: String(e.sourceTable),
 	rowId: String(e.rowId),
@@ -749,7 +750,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	lastError: String(e.lastError ?? ""),
 	firstFailedAt: X(e.firstFailedAt),
 	lastFailedAt: X(e.lastFailedAt)
-}), we = () => {
+}), Te = () => {
 	let e = /* @__PURE__ */ new Map(), t = (e, t) => `${e}\u0000${t}`;
 	return {
 		record: async (n) => {
@@ -779,7 +780,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			e.delete(t(n, r));
 		}
 	};
-}, Te = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, Z = (e, t) => ({
+}, Ee = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, Z = (e, t) => ({
 	table: Y,
 	predicate: e,
 	order: [{
@@ -789,9 +790,9 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	take: t,
 	skip: void 0,
 	projection: void 0
-}), Ee = (e) => ({
+}), De = (e) => ({
 	record: async (t) => {
-		let n = /* @__PURE__ */ new Date(), r = Te(), i = await e.insertIgnore(Y, {
+		let n = /* @__PURE__ */ new Date(), r = Ee(), i = await e.insertIgnore(Y, {
 			id: r,
 			indexName: t.indexName,
 			sourceTable: t.sourceTable,
@@ -811,7 +812,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			lastFailedAt: n
 		}, { where: g("id", String(i.id)) });
 	},
-	list: async (t) => (await e.query(Z(void 0, t))).map(Ce),
+	list: async (t) => (await e.query(Z(void 0, t))).map(we),
 	summary: async (t) => {
 		let n = (await e.query({
 			...Z(g("indexName", t), void 0),
@@ -837,15 +838,15 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	clear: async (t, n) => {
 		await e.deleteMany(Y, { where: m(g("indexName", t), g("rowId", n)) });
 	}
-}), De = () => [xe], Oe = (e, t) => {
+}), Oe = () => [Se], ke = (e, t) => {
 	if (e === void 0 || e === "memory") return N();
 	if (typeof e.query == "function") return e;
 	let n = e;
-	return n.engine === "typesense" ? ie(n, t) : n.engine === "meilisearch" ? R(n, t) : n.engine === "algolia" ? z(n, t) : N();
-}, ke = async (e, t, n) => {
+	return n.engine === "typesense" ? ae(n, t) : n.engine === "meilisearch" ? ce(n, t) : n.engine === "algolia" ? pe(n, t) : N();
+}, Ae = async (e, t, n) => {
 	let r = n.map((e) => t.map(e));
 	return r.length > 0 && await e.upsert(t.index, r), r.length;
-}, Ae = async (e, t, n) => {
+}, je = async (e, t, n) => {
 	if (n.op === "delete") {
 		let r = n.old?.id;
 		typeof r == "string" && await e.remove(t.index, [r]);
@@ -861,7 +862,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	reindexBatchSize: 1e3,
 	statsFlushIntervalMs: 5e3,
 	statsFlushMaxBuffered: 1e3
-}, $ = (e) => ({
+}, Me = (e) => ({
 	retries: Math.max(0, e?.retries ?? Q.retries),
 	retryBaseDelayMs: Math.max(1, e?.retryBaseDelayMs ?? Q.retryBaseDelayMs),
 	retryMaxDelayMs: Math.max(1, e?.retryMaxDelayMs ?? Q.retryMaxDelayMs),
@@ -870,12 +871,12 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	reindexBatchSize: Math.max(1, e?.reindexBatchSize ?? Q.reindexBatchSize),
 	statsFlushIntervalMs: Math.max(0, e?.statsFlushIntervalMs ?? Q.statsFlushIntervalMs),
 	statsFlushMaxBuffered: Math.max(1, e?.statsFlushMaxBuffered ?? Q.statsFlushMaxBuffered)
-}), je = (e) => e instanceof k ? e : new k({
+}), Ne = (e) => e instanceof k ? e : new k({
 	engine: "unknown",
 	op: "upsert",
 	message: String(e?.message ?? e),
 	transient: !1
-}), Me = (e) => f.exponential(c.millis(e.retryBaseDelayMs), 2).pipe(f.either(f.spaced(c.millis(e.retryMaxDelayMs))), f.intersect(f.recurs(e.retries)), f.whileInput((e) => e.transient)), Ne = (e) => {
+}), Pe = (e) => f.exponential(c.millis(e.retryBaseDelayMs), 2).pipe(f.either(f.spaced(c.millis(e.retryMaxDelayMs))), f.intersect(f.recurs(e.retries)), f.whileInput((e) => e.transient)), Fe = (e) => {
 	if (!e || e === "memory" || typeof e.query == "function") return;
 	let t = e;
 	try {
@@ -883,40 +884,40 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 	} catch {
 		return;
 	}
-}, Pe = (e, t, n) => {
+}, $ = (e, t, n) => {
 	let r = n ?? [];
 	return e ? t == null ? null : [...r, {
 		field: e,
 		op: "eq",
 		value: t
 	}] : r;
-}, Fe = (e) => [
+}, Ie = (e) => [
 	...(e.filters ?? []).map((e) => ["filter", e.field]),
 	...(e.facets ?? []).map((e) => ["facet", e]),
 	...(e.highlight?.fields ?? []).map((e) => ["highlight", e])
-], Ie = i, Le = (i) => {
+], Le = i, Re = (i) => {
 	let s = te({
-		base: Ie,
+		base: Le,
 		alias: i.alias,
 		instance: i.name
-	}), c = () => void 0, f = () => void 0, m = $(i.sync), h = Me(m), g = Oe(i.backend, {
+	}), c = () => void 0, f = () => void 0, m = Me(i.sync), h = Pe(m), g = ke(i.backend, {
 		...i.allowedEngineParams ? { allowEngineParams: i.allowedEngineParams } : {},
 		onWarn: (e, t) => c(e, t)
 	}), _ = /* @__PURE__ */ new Map();
 	for (let e of Object.values(i.indexes)) _.set(e.index, e);
-	let v = he(i.backend), b = i.singleProcessMemoryIndex === !0, x = !1, S, C = {
+	let v = K(i.backend), b = i.singleProcessMemoryIndex === !0, x = !1, S, ne = {
 		...r,
 		description: "Full-text search an index (facets/highlight/fuzzy/filters), auto-scoped to the caller tenant.",
 		execute: (t, r) => {
 			let { index: i, q: a, limit: o, offset: s, filters: c, facets: u, highlight: d, fuzziness: f, engineParams: p } = t, m = _.get(i);
 			if (!m) return l.fail(new n({ index: i }));
-			let h = ne(Fe({
+			let h = re(Ie({
 				...c ? { filters: c } : {},
 				...u ? { facets: u } : {},
 				...d ? { highlight: d } : {}
 			}), m.queryableFields);
 			if (h) return l.fail(new e(h));
-			let v = r.request.subject.tenantId ?? null, y = Pe(m.tenantField, v, c);
+			let v = r.request.subject.tenantId ?? null, y = $(m.tenantField, v, c);
 			if (y === null) return l.succeed({
 				hits: [],
 				facets: {}
@@ -933,30 +934,30 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			};
 			return l.promise(() => g.query(i, b));
 		}
-	}, w = Ne(i.backend), T = [
+	}, C = Fe(i.backend), w = [
 		"store:changes:read",
 		"store:write",
 		"inspect:read",
 		"inspect:write",
-		...w ? [`network:outbound:${w}`] : []
-	], E = W(), D = we(), O, k, A, j, M = (e, t, n) => j === void 0 ? l.tryPromise(() => E.bump(e, t, n)).pipe(l.catchAll((n) => l.sync(() => c("search stats bump failed", {
+		...C ? [`network:outbound:${C}`] : []
+	], T = B(), E = Te(), D, O, k, A, j = (e, t, n) => A === void 0 ? l.tryPromise(() => T.bump(e, t, n)).pipe(l.catchAll((n) => l.sync(() => c("search stats bump failed", {
 		index: e,
 		kind: t,
 		error: String(n)
-	})))) : l.sync(() => j.bump(e, t, n)), N = async (e) => {
-		let t = await D.list(e), n = 0, r = 0;
+	})))) : l.sync(() => A.bump(e, t, n)), M = async (e) => {
+		let t = await E.list(e), n = 0, r = 0;
 		for (let e of t) {
 			let t = _.get(e.indexName);
 			if (!t) {
-				await D.clear(e.indexName, e.rowId);
+				await E.clear(e.indexName, e.rowId);
 				continue;
 			}
 			try {
-				if (!k) throw Error("data store not bound");
-				let r = (await k.query(Se(e.sourceTable, e.rowId)))[0];
-				r ? await g.upsert(t.index, [t.map(r)]) : await g.remove(t.index, [e.docId]), await D.clear(e.indexName, e.rowId), n++;
+				if (!O) throw Error("data store not bound");
+				let r = (await O.query(Ce(e.sourceTable, e.rowId)))[0];
+				r ? await g.upsert(t.index, [t.map(r)]) : await g.remove(t.index, [e.docId]), await E.clear(e.indexName, e.rowId), n++;
 			} catch (t) {
-				r++, await D.record({
+				r++, await E.record({
 					...e,
 					error: String(t?.message ?? t)
 				}).catch(() => void 0);
@@ -967,20 +968,20 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			repaired: n,
 			failed: r
 		};
-	}, P = (e) => ({
+	}, N = (e) => ({
 		kind: "json",
 		data: e
-	}), F = (e, t) => ({
+	}), P = (e, t) => ({
 		kind: "json",
 		status: e,
 		data: { error: t }
 	});
 	return ee({
 		name: s,
-		baseName: Ie,
+		baseName: Le,
 		description: "External search index sync (Typesense/Meilisearch/Algolia/memory) via the ChangeEvent tap + a tenant-scoped query route.",
-		permissions: T,
-		routes: [C],
+		permissions: w,
+		routes: [ne],
 		rpcClientDescriptors: t,
 		inspectEndpoints: [
 			{
@@ -988,9 +989,9 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				path: "/indexes",
 				description: "Configured indexes + durable, cross-replica sync stats + current index drift.",
 				handler: () => l.promise(async () => {
-					await j?.flushNow();
+					await A?.flushNow();
 					let e = await Promise.all(Object.entries(i.indexes).map(async ([e, t]) => {
-						let n = await E.get(t.index), r = await D.summary(t.index);
+						let n = await T.get(t.index), r = await E.summary(t.index);
 						return {
 							table: e,
 							index: t.index,
@@ -1001,7 +1002,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 							drifted: r.pending > 0
 						};
 					}));
-					return P({
+					return N({
 						indexes: e,
 						backend: typeof i.backend == "string" ? i.backend : i.backend ? "custom/vendor" : "memory",
 						durable: v !== "memory",
@@ -1009,7 +1010,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 						pendingDrift: e.reduce((e, t) => e + t.pendingDrift, 0),
 						sync: {
 							...m,
-							resyncArmed: O !== void 0
+							resyncArmed: D !== void 0
 						}
 					});
 				})
@@ -1019,8 +1020,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				path: "/drift",
 				description: "The changes that did NOT reach the engine, oldest first (the repair queue).",
 				handler: (e) => l.promise(async () => {
-					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await D.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
-					return P({ entries: n });
+					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await E.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
+					return N({ entries: n });
 				})
 			},
 			{
@@ -1032,17 +1033,17 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return F(400, "invalid JSON body");
+						return P(400, "invalid JSON body");
 					}
-					if (!k) return F(503, "data store not bound yet");
+					if (!O) return P(503, "data store not bound yet");
 					try {
-						let e = await N(Math.min(Math.max(1, t.limit ?? m.resyncBatchSize), 1e3));
-						return P({
+						let e = await M(Math.min(Math.max(1, t.limit ?? m.resyncBatchSize), 1e3));
+						return N({
 							ok: !0,
 							...e
 						});
 					} catch (e) {
-						return F(500, e.message);
+						return P(500, e.message);
 					}
 				})
 			},
@@ -1055,27 +1056,27 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return F(400, "invalid JSON body");
+						return P(400, "invalid JSON body");
 					}
 					let n = t.table, r = n ? i.indexes[n] : void 0;
-					if (!n || !r) return F(404, `no index configured for table "${t.table ?? ""}"`);
-					if (!A) return F(503, "data store not bound yet");
-					let s = 0, c = await l.runPromiseExit(y(A, {
+					if (!n || !r) return P(404, `no index configured for table "${t.table ?? ""}"`);
+					if (!k) return P(503, "data store not bound yet");
+					let s = 0, c = await l.runPromiseExit(y(k, {
 						table: n,
 						chunkSize: m.reindexBatchSize
 					}).pipe(p.chunks, p.runForEach((e) => l.tryPromise(async () => {
-						s += await ke(g, r, o.toReadonlyArray(e));
+						s += await Ae(g, r, o.toReadonlyArray(e));
 					}))));
 					if (u.isFailure(c)) {
 						let e = a.failureOption(c.cause), t = d.isSome(e) ? e.value : c.cause, n = t.cause ?? t.error ?? t;
-						return F(500, String(n?.message ?? n));
+						return P(500, String(n?.message ?? n));
 					}
 					try {
-						await E.recordReindex(r.index, s, (/* @__PURE__ */ new Date()).toISOString());
+						await T.recordReindex(r.index, s, (/* @__PURE__ */ new Date()).toISOString());
 					} catch (e) {
-						return F(500, e.message);
+						return P(500, e.message);
 					}
-					return P({
+					return N({
 						ok: !0,
 						table: n,
 						index: r.index,
@@ -1084,17 +1085,17 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				})
 			}
 		],
-		extendSchema: { tables: [...U(), ...De()] },
+		extendSchema: { tables: [...z(), ...Oe()] },
 		bindDataStore: (e, t) => {
-			k = e, A = e, E = q(e), D = Ee(e), v === "memory" && t?.membership !== void 0 && (S = t.membership.onChange((e) => {
-				e.kind === "left" || x || (t.instanceId === void 0 || e.instanceId !== t.instanceId) && (x = !0, c(be(e.instanceId, b), {
+			O = e, k = e, T = U(e, ...t?.instanceId === void 0 ? [] : [t.instanceId]), E = De(e), v === "memory" && t?.membership !== void 0 && (S = t.membership.onChange((e) => {
+				e.kind === "left" || x || (t.instanceId === void 0 || e.instanceId !== t.instanceId) && (x = !0, c(xe(e.instanceId, b), {
 					instanceId: t.instanceId ?? null,
 					peer: e.instanceId,
 					indexes: Object.keys(i.indexes)
 				}));
-			})), !(m.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (O = t.scheduleCoordinated("search.resync", m.resyncIntervalMs, async () => {
+			})), !(m.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (D = t.scheduleCoordinated("search.resync", m.resyncIntervalMs, async () => {
 				try {
-					let e = await N(m.resyncBatchSize);
+					let e = await M(m.resyncBatchSize);
 					return (e.repaired > 0 || e.failed > 0) && f("search: drift repair pass", e), { idle: e.scanned === 0 };
 				} catch (e) {
 					return c("search: drift repair pass failed", { error: String(e?.message ?? e) }), { idle: !1 };
@@ -1113,10 +1114,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 				}
 			};
 			return l.tryPromise({
-				try: () => Ae(g, t, e),
-				catch: je
+				try: () => je(g, t, e),
+				catch: Ne
 			}).pipe(l.retry(h)).pipe(l.matchEffect({
-				onSuccess: () => r ? M(t.index, e.op === "delete" ? "removed" : "synced", n) : l.void,
+				onSuccess: () => r ? j(t.index, e.op === "delete" ? "removed" : "synced", n) : l.void,
 				onFailure: (r) => {
 					let i = {
 						table: e.table,
@@ -1126,7 +1127,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 						transient: r.transient,
 						error: r.message
 					};
-					return o === "" ? l.sync(() => c("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(l.zipRight(l.fail(r))) : l.tryPromise(() => D.record({
+					return o === "" ? l.sync(() => c("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(l.zipRight(l.fail(r))) : l.tryPromise(() => E.record({
 						indexName: t.index,
 						sourceTable: e.table,
 						rowId: o,
@@ -1134,7 +1135,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 						op: s,
 						error: r.message
 					})).pipe(l.matchEffect({
-						onSuccess: () => M(t.index, "dropped", n).pipe(l.zipRight(l.sync(() => c("search: index drift recorded — will be repaired from the database", i)))),
+						onSuccess: () => j(t.index, "dropped", n).pipe(l.zipRight(l.sync(() => c("search: index drift recorded — will be repaired from the database", i)))),
 						onFailure: (e) => l.sync(() => c("search: change LOST — engine failed and the drift ledger could not record it", {
 							...i,
 							ledgerError: String(e)
@@ -1145,13 +1146,13 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 		},
 		onActivate: (e) => l.suspend(() => {
 			c = (t, n) => e.logger.warn(t, n), f = (t, n) => e.logger.info(t, n);
-			let t = ye({
+			let t = J({
 				backendKind: v,
 				production: (e.env?.NODE_ENV ?? process.env.NODE_ENV) === "production",
 				singleProcessDeclared: b
 			});
-			return t.level === "refuse" ? l.fail(new ge(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(i.indexes) }), m.statsFlushIntervalMs > 0 && j === void 0 && (j = J({
-				flush: me(() => E),
+			return t.level === "refuse" ? l.fail(new q(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(i.indexes) }), m.statsFlushIntervalMs > 0 && A === void 0 && (A = W({
+				flush: G(() => T),
 				intervalMs: m.statsFlushIntervalMs,
 				maxBuffered: m.statsFlushMaxBuffered
 			})), l.sync(() => {
@@ -1164,11 +1165,11 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), ne = (e, t) => {
 			}));
 		}),
 		onDeactivate: () => l.promise(async () => {
-			O?.stop(), O = void 0, S?.(), S = void 0, x = !1;
-			let e = j;
-			j = void 0, await e?.shutdown();
+			D?.stop(), D = void 0, S?.(), S = void 0, x = !1;
+			let e = A;
+			A = void 0, await e?.shutdown();
 		})
 	});
 };
 //#endregion
-export { C as FIELD_NAME_PATTERN, Y as SEARCH_DRIFT_TABLE, B as SEARCH_STATS_TABLE, Q as SYNC_DEFAULTS, k as SearchBackendError, ge as SearchBackendNotDurable, e as SearchFieldRejected, n as SearchIndexNotFound, z as algoliaBackend, O as allowedEngineParams, Ae as applyChange, je as asBackendError, ye as auditMemoryBackend, he as backendKindOf, ke as backfillIndex, Ee as dataStoreDriftLedger, q as dataStoreStatsStore, Se as driftSourceQuery, De as driftTables, w as isSafeFieldName, J as makeSearchStatsBuffer, R as meilisearchBackend, N as memoryBackend, we as memoryDriftLedger, W as memoryStatsStore, be as peerObservedWarning, $ as resolveSyncOptions, D as sanitizeEngineParams, Pe as scopeSearchFilters, xe as searchDriftTable, Le as searchPlugin, H as searchStatsTable, U as searchTables, me as statsStoreFlush, Me as syncRetrySchedule, ie as typesenseBackend };
+export { C as FIELD_NAME_PATTERN, Y as SEARCH_DRIFT_TABLE, R as SEARCH_STATS_TABLE, Q as SYNC_DEFAULTS, k as SearchBackendError, q as SearchBackendNotDurable, e as SearchFieldRejected, n as SearchIndexNotFound, pe as algoliaBackend, O as allowedEngineParams, je as applyChange, Ne as asBackendError, J as auditMemoryBackend, K as backendKindOf, Ae as backfillIndex, De as dataStoreDriftLedger, U as dataStoreStatsStore, Ce as driftSourceQuery, Oe as driftTables, w as isSafeFieldName, W as makeSearchStatsBuffer, ce as meilisearchBackend, N as memoryBackend, Te as memoryDriftLedger, B as memoryStatsStore, xe as peerObservedWarning, Me as resolveSyncOptions, D as sanitizeEngineParams, $ as scopeSearchFilters, Se as searchDriftTable, Re as searchPlugin, ge as searchStatsTable, z as searchTables, G as statsStoreFlush, Pe as syncRetrySchedule, ae as typesenseBackend };