@voltro/plugin-search 0.84.0 → 0.85.0

package/dist/index.js

@@ -1,13 +1,13 @@
-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";
+import { a as e, i as t, o as n, r, t as i } from "./rpc-CggQ77CG.js";
+import { Cause as a, Data as o, Duration as s, Effect as c, Exit as l, Option as u, Schedule as d, Stream as f } from "effect";
+import { and as p, count as m, eq as h, id as g, integer as _, streamTable as ee, table as v, text as y, timestamp as b } from "@voltro/database";
+import { definePlugin as te, pluginInstanceName as ne } from "@voltro/protocol";
+import { replicaId as re } from "@voltro/protocol/identity";
 //#region src/sanitize.ts
-var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
+var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 	let n = t ? new Set(t) : void 0;
 	for (let [t, r] of e) {
-		if (!w(r)) return {
+		if (!S(r)) return {
 			field: r,
 			where: t,
 			reason: "not-an-identifier"
@@ -18,7 +18,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			reason: "not-queryable"
 		};
 	}
-}, T = {
+}, C = {
 	typesense: [
 		"per_page",
 		"page",
@@ -72,7 +72,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		"highlightPreTag",
 		"highlightPostTag"
 	]
-}, E = {
+}, w = {
 	typesense: [
 		"filter_by",
 		"q",
@@ -109,36 +109,39 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		"aroundLatLng",
 		"insideBoundingBox"
 	]
-}, D = (e, t, n) => {
+}, T = (e, t, n) => {
 	if (!t) return {
 		params: {},
 		appAllowed: {},
 		dropped: []
 	};
-	let r = new Set(E[e]), i = new Set(T[e]), a = new Set(n ?? []), o = {}, s = {}, c = [];
+	let r = new Set(w[e]), i = new Set(C[e]), a = new Set(n ?? []), o = {}, s = {}, c = [];
 	for (let [e, n] of Object.entries(t)) r.has(e) ? c.push(e) : i.has(e) ? o[e] = n : a.has(e) ? s[e] = n : c.push(e);
 	return {
 		params: o,
 		appAllowed: s,
 		dropped: c
 	};
-}, O = (e) => T[e], k = class extends s.TaggedError("SearchBackendError") {}, A = (e) => Array.isArray(e) ? e : [e], j = (e, t, n) => {
+}, E = (e) => C[e], D = class extends o.TaggedError("SearchBackendError") {}, O = (e) => Array.isArray(e) ? e : [e], k = (e, t, n) => {
 	if (Math.abs(e.length - t.length) > n) return !1;
 	if (e === t) return !0;
-	let r = t.length, i = Array.from({ length: r + 1 }, (e, t) => t);
-	for (let a = 1; a <= e.length; a++) {
-		let o = Array(r + 1);
-		o[0] = a;
-		let s = a, c = e.charCodeAt(a - 1);
-		for (let e = 1; e <= r; e++) {
-			let n = c === t.charCodeAt(e - 1) ? 0 : 1, r = Math.min((i[e] ?? 0) + 1, (o[e - 1] ?? 0) + 1, (i[e - 1] ?? 0) + n);
-			o[e] = r, r < s && (s = r);
+	if (Number.isNaN(n)) return !1;
+	let r = t.length, i = Math.floor(n), a = Array(r + 1).fill(Infinity), o = Array(r + 1).fill(Infinity);
+	for (let e = 0; e <= Math.min(r, i); e++) a[e] = e;
+	for (let s = 1; s <= e.length; s++) {
+		let c = Math.max(1, s - i), l = Math.min(r, s + i);
+		o[0] = s, c > 1 && (o[c - 1] = Infinity), l < r && (o[l + 1] = Infinity);
+		let u = s, d = e.charCodeAt(s - 1);
+		for (let e = c; e <= l; e++) {
+			let n = d === t.charCodeAt(e - 1) ? 0 : 1, r = Math.min(a[e] + 1, o[e - 1] + 1, a[e - 1] + n);
+			o[e] = r, u = Math.min(u, r);
 		}
-		if (s > n) return !1;
-		i = o;
+		if (u > n) return !1;
+		let f = a;
+		a = o, o = f;
 	}
-	return (i[r] ?? Infinity) <= n;
-}, M = (e) => e.length <= 4 ? 1 : 2, N = () => {
+	return a[r] <= n;
+}, A = (e) => e.length <= 4 ? 1 : 2, j = () => {
 	let e = /* @__PURE__ */ new Map(), t = (t) => {
 		let n = e.get(t);
 		return n || (n = /* @__PURE__ */ new Map(), e.set(t, n)), n;
@@ -147,13 +150,13 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		switch (t.op) {
 			case "eq": return String(n) === String(t.value);
 			case "neq": return String(n) !== String(t.value);
-			case "in": return A(t.value).some((e) => String(n) === String(e));
-			case "nin": return A(t.value).every((e) => String(n) !== String(e));
+			case "in": return O(t.value).some((e) => String(n) === String(e));
+			case "nin": return O(t.value).every((e) => String(n) !== String(e));
 			case "gt":
 			case "gte":
 			case "lt":
 			case "lte": {
-				let [e, r] = [P(n), P(t.value)];
+				let [e, r] = [M(n), M(t.value)];
 				return e === void 0 || r === void 0 ? !1 : t.op === "gt" ? e > r : t.op === "gte" ? e >= r : t.op === "lt" ? e < r : e <= r;
 			}
 		}
@@ -163,8 +166,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			let e = r.toLowerCase();
 			if (e.includes(t)) return !0;
 			if (n !== void 0 && n !== 0) {
-				let r = n === "auto" ? M(t) : n;
-				for (let n of e.split(/\s+/)) if (j(n, t, r)) return !0;
+				let r = n === "auto" ? A(t) : n;
+				for (let n of e.split(/\s+/)) if (k(n, t, r)) return !0;
 			}
 		}
 		return !1;
@@ -208,7 +211,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			};
 		}
 	};
-}, P = (e) => {
+}, M = (e) => {
 	if (typeof e == "number") return e;
 	if (typeof e == "boolean") return +!!e;
 	if (typeof e == "string") {
@@ -217,19 +220,19 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		let n = Date.parse(e);
 		return Number.isNaN(n) ? void 0 : n;
 	}
-}, F = async (e, t, n) => {
+}, N = async (e, t, n) => {
 	try {
 		return await n();
 	} catch {
-		throw new k({
+		throw new D({
 			engine: t,
 			op: "query",
 			message: `the '${t}' search backend requires the '${e}' optional dependency. Install it to enable it (e.g. \`npm i ${e}\`).`,
 			transient: !1
 		});
 	}
-}, I = (e, t) => (n) => {
-	let { params: r, appAllowed: i, dropped: a } = D(e, n, t.allowEngineParams);
+}, P = (e, t) => (n) => {
+	let { params: r, appAllowed: i, dropped: a } = T(e, n, t.allowEngineParams);
 	return a.length > 0 && t.onWarn?.("search dropped disallowed engineParams", {
 		engine: e,
 		keys: a
@@ -237,16 +240,16 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		before: r,
 		after: i
 	};
-}, L = (e, t) => {
-	if (!w(t)) throw new k({
+}, F = (e, t) => {
+	if (!S(t)) throw new D({
 		engine: e,
 		op: "query",
 		message: `filter field "${t}" is not a plain field path (^[A-Za-z_][A-Za-z0-9_.]*$)`,
 		transient: !1
 	});
 	return t;
-}, ie = (e) => {
-	let t = (e) => JSON.stringify(e), n = L("typesense", e.field);
+}, ae = (e) => {
+	let t = (e) => JSON.stringify(e), n = F("typesense", e.field);
 	switch (e.op) {
 		case "eq": return `${n}:=${t(e.value)}`;
 		case "neq": return `${n}:!=${t(e.value)}`;
@@ -254,21 +257,21 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		case "gte": return `${n}:>=${t(e.value)}`;
 		case "lt": return `${n}:<${t(e.value)}`;
 		case "lte": return `${n}:<=${t(e.value)}`;
-		case "in": return `${n}:[${A(e.value).map(t).join(",")}]`;
-		case "nin": return `${n}:!=[${A(e.value).map(t).join(",")}]`;
+		case "in": return `${n}:[${O(e.value).map(t).join(",")}]`;
+		case "nin": return `${n}:!=[${O(e.value).map(t).join(",")}]`;
 	}
-}, ae = (e, t = {}) => {
-	let n = I("typesense", t), r, i = async () => (r ||= F("typesense", "typesense", () => import("typesense")).then((t) => {
+}, oe = (e, t = {}) => {
+	let n = P("typesense", t), r, i = async () => (r ||= N("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(ie).join(" && ") : void 0, o = async (e, t) => {
+	}), r), a = (e) => e && e.length > 0 ? e.map(ae).join(" && ") : void 0, o = async (e, t) => {
 		try {
 			return await t();
 		} catch (t) {
-			throw t instanceof k ? t : new k({
+			throw t instanceof D ? t : new D({
 				engine: "typesense",
 				op: e,
 				message: String(t?.message ?? t),
@@ -300,10 +303,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				...d !== void 0 && d !== "auto" ? { num_typos: Math.min(2, Math.max(0, d)) } : {},
 				...p.after
 			};
-			return oe(await o.collections(e).documents().search(m));
+			return se(await o.collections(e).documents().search(m));
 		})
 	};
-}, oe = (e) => {
+}, se = (e) => {
 	let t = (e.hits ?? []).map((e) => {
 		let t = {};
 		for (let n of e.highlights ?? []) {
@@ -320,8 +323,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		hits: t,
 		facets: n
 	};
-}, se = (e) => {
-	let t = (e) => JSON.stringify(e), n = L("meilisearch", e.field);
+}, ce = (e) => {
+	let t = (e) => JSON.stringify(e), n = F("meilisearch", e.field);
 	switch (e.op) {
 		case "eq": return `${n} = ${t(e.value)}`;
 		case "neq": return `${n} != ${t(e.value)}`;
@@ -329,18 +332,18 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		case "gte": return `${n} >= ${t(e.value)}`;
 		case "lt": return `${n} < ${t(e.value)}`;
 		case "lte": return `${n} <= ${t(e.value)}`;
-		case "in": return `${n} IN [${A(e.value).map(t).join(", ")}]`;
-		case "nin": return `${n} NOT IN [${A(e.value).map(t).join(", ")}]`;
+		case "in": return `${n} IN [${O(e.value).map(t).join(", ")}]`;
+		case "nin": return `${n} NOT IN [${O(e.value).map(t).join(", ")}]`;
 	}
-}, ce = (e, t = {}) => {
-	let n = I("meilisearch", t), r, i = async () => (r ||= F("meilisearch", "meilisearch", () => import("meilisearch")).then((t) => new t.Meilisearch({
+}, I = (e, t = {}) => {
+	let n = P("meilisearch", t), r, i = async () => (r ||= N("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(se) : void 0, o = async (e, t) => {
+	})), r), a = (e) => e && e.length > 0 ? e.map(ce) : void 0, o = async (e, t) => {
 		try {
 			return await t();
 		} catch (t) {
-			throw t instanceof k ? t : new k({
+			throw t instanceof D ? t : new D({
 				engine: "meilisearch",
 				op: e,
 				message: String(t?.message ?? t),
@@ -352,7 +355,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			timeout: 6e4,
 			interval: 50
 		});
-		if (n.status !== "succeeded") throw new k({
+		if (n.status !== "succeeded") throw new D({
 			engine: "meilisearch",
 			op: e,
 			message: n.error?.message ?? `Meilisearch task ${t.taskUid} ${n.status}`,
@@ -403,7 +406,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	facets: e.facetDistribution ?? {}
 }), ue = (e) => String(e).replace(/^-/, "\\-"), de = (e, t) => {
 	let n = typeof t == "boolean" ? +!!t : Number(t);
-	if (!Number.isFinite(n)) throw new k({
+	if (!Number.isFinite(n)) throw new D({
 		engine: "algolia",
 		op: "query",
 		message: `range filter on "${e}" needs a numeric value (got ${JSON.stringify(t)})`,
@@ -413,7 +416,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 }, fe = (e) => {
 	let t = [], n = [];
 	for (let r of e ?? []) {
-		let e = L("algolia", r.field), i = (e) => ue(e), a = (t) => de(e, t);
+		let e = F("algolia", r.field), i = (e) => ue(e), a = (t) => de(e, t);
 		switch (r.op) {
 			case "eq":
 				t.push(`${e}:${i(r.value)}`);
@@ -422,10 +425,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				t.push(`${e}:-${i(r.value)}`);
 				break;
 			case "in":
-				t.push(A(r.value).map((t) => `${e}:${i(t)}`));
+				t.push(O(r.value).map((t) => `${e}:${i(t)}`));
 				break;
 			case "nin":
-				for (let n of A(r.value)) t.push(`${e}:-${i(n)}`);
+				for (let n of O(r.value)) t.push(`${e}:-${i(n)}`);
 				break;
 			case "gt":
 				n.push(`${e} > ${a(r.value)}`);
@@ -443,12 +446,12 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		facetFilters: t,
 		numericFilters: n
 	};
-}, 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) => {
+}, L = (e, t = {}) => {
+	let n = P("algolia", t), r, i = async () => (r ||= N("algoliasearch", "algolia", () => import("algoliasearch")).then((t) => t.algoliasearch(e.appId ?? "", e.apiKey)), r), a = async (e, t) => {
 		try {
 			return await t();
 		} catch (t) {
-			throw t instanceof k ? t : new k({
+			throw t instanceof D ? t : new D({
 				engine: "algolia",
 				op: e,
 				message: String(t?.message ?? t),
@@ -491,13 +494,13 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				...u === 0 ? { typoTolerance: !1 } : {},
 				...m.after
 			};
-			return me(await (await i()).searchSingleIndex({
+			return pe(await (await i()).searchSingleIndex({
 				indexName: e,
 				searchParams: h
 			}), l);
 		})
 	};
-}, me = (e, t) => ({
+}, pe = (e, t) => ({
 	hits: e.hits.map((e) => {
 		let { _highlightResult: n, ...r } = e;
 		if (t && n) {
@@ -511,25 +514,25 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		return { doc: r };
 	}),
 	facets: e.facets ?? {}
-}), R = "_voltro_search_stats", he = () => ({
+}), R = "_voltro_search_stats", z = () => ({
 	synced: 0,
 	removed: 0,
 	dropped: 0,
 	lastReindexAt: null,
 	lastReindexCount: 0
-}), ge = b(R, {
-	id: _({ prefix: "sstat" }),
-	indexName: x().maxLength(191),
-	replicaId: x().maxLength(191),
-	synced: v().default(0),
-	removed: v().default(0),
-	dropped: v().default(0),
-	scope: x().maxLength(8).default("local"),
-	lastReindexAt: S().nullable(),
-	lastReindexCount: v().default(0),
-	updatedAt: S()
-}).unique("bySearchStatsIndexReplica", ["indexName", "replicaId"]).index("bySearchStatsIndex", ["indexName"]), z = () => [ge], B = () => {
-	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? he();
+}), B = v(R, {
+	id: g({ prefix: "sstat" }),
+	indexName: y().maxLength(191),
+	replicaId: y().maxLength(191),
+	synced: _().default(0),
+	removed: _().default(0),
+	dropped: _().default(0),
+	scope: y().maxLength(8).default("local"),
+	lastReindexAt: b().nullable(),
+	lastReindexCount: _().default(0),
+	updatedAt: b()
+}).unique("bySearchStatsIndexReplica", ["indexName", "replicaId"]).index("bySearchStatsIndex", ["indexName"]), V = () => [B], H = () => {
+	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? z();
 	return {
 		bump: async (n, r) => {
 			let i = t(n);
@@ -564,19 +567,19 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		},
 		get: async (e) => t(e)
 	};
-}, V = (e) => ({
+}, U = (e) => ({
 	table: R,
 	predicate: e,
 	order: [],
 	take: void 0,
 	skip: void 0,
 	projection: void 0
-}), _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) => {
+}), me = () => `sstat_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, he = () => re(), W = 32, G = (e, t = he()) => {
+	let n = async (n) => (await e.query(U(p(h("indexName", n), h("replicaId", t)))))[0] ?? null, r = async (e) => {
 		try {
 			return await e();
 		} catch (e) {
-			throw e instanceof k ? e : new k({
+			throw e instanceof D ? e : new D({
 				engine: "stats",
 				op: "upsert",
 				message: String(e?.message ?? e),
@@ -584,7 +587,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			});
 		}
 	}, i = (i, a, o, s) => r(async () => {
-		for (let r = 0; r < H; r++) {
+		for (let r = 0; r < W; r++) {
 			r > 0 && await new Promise((e) => setTimeout(e, r));
 			let c = await n(i);
 			if (c) {
@@ -599,9 +602,9 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 					...o(i),
 					...a ? { scope: a } : {},
 					updatedAt: /* @__PURE__ */ new Date()
-				}, { where: m(g("id", String(c.id)), g("synced", t), g("removed", n), g("dropped", r)) }) === 1) return;
+				}, { where: p(h("id", String(c.id)), h("synced", t), h("removed", n), h("dropped", r)) }) === 1) return;
 			} else {
-				let n = _e(), r = await e.insertIgnore(R, {
+				let n = me(), r = await e.insertIgnore(R, {
 					id: n,
 					indexName: i,
 					replicaId: t,
@@ -617,10 +620,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				if (String(r.id) === n) return;
 			}
 		}
-		throw new k({
+		throw new D({
 			engine: "stats",
 			op: "upsert",
-			message: `search stats: contention on (${i}, ${t}) exceeded ${H} attempts`,
+			message: `search stats: contention on (${i}, ${t}) exceeded ${W} attempts`,
 			transient: !0
 		});
 	});
@@ -645,7 +648,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			lastReindexCount: t
 		}),
 		get: (t) => r(async () => {
-			let n = await e.query(V(g("indexName", t))), r = n.some((e) => e.scope === "fleet"), i = (e) => {
+			let n = await e.query(U(h("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);
@@ -658,7 +661,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				t && (a === null || t > a) && (a = t, o = Number(e.lastReindexCount ?? 0));
 			}
 			return {
-				...he(),
+				...z(),
 				synced: i("synced"),
 				removed: i("removed"),
 				dropped: i("dropped"),
@@ -667,7 +670,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			};
 		})
 	};
-}, W = (e) => {
+}, K = (e) => {
 	let t = /* @__PURE__ */ new Map(), n = 0, r = !1, i = async () => {
 		if (t.size === 0) return;
 		let r = t;
@@ -699,12 +702,12 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		},
 		pending: () => n
 	};
-}, 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 {
+}, q = (e) => (t, n, r) => e().add(t, n, r), ge = (e) => e === void 0 || e === "memory" ? "memory" : typeof e.query == "function" ? e.engineKind === "memory" ? "memory" : "custom" : "vendor", _e = class extends Error {
 	_tag = "SearchBackendNotDurable";
 	constructor(e) {
 		super(e), this.name = "SearchBackendNotDurable";
 	}
-}, ye = [
+}, ve = [
 	"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:",
@@ -722,36 +725,36 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (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"), be = [
+].join("\n"), ye = [
 	"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(" "), J = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
+].join(" "), be = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
 	level: "note",
-	message: be
+	message: ye
 } : {
 	level: "refuse",
-	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),
-	rowId: x().maxLength(191),
-	docId: x().maxLength(191),
-	op: x().maxLength(16),
-	attempts: v().default(0),
-	lastError: x().maxLength(1e3),
-	firstFailedAt: S(),
-	lastFailedAt: S()
+	message: ve
+}, 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.`, J = "_voltro_search_drift", Se = v(J, {
+	id: g({ prefix: "sdrft" }),
+	indexName: y().maxLength(191),
+	sourceTable: y().maxLength(191),
+	rowId: y().maxLength(191),
+	docId: y().maxLength(191),
+	op: y().maxLength(16),
+	attempts: _().default(0),
+	lastError: y().maxLength(1e3),
+	firstFailedAt: b(),
+	lastFailedAt: b()
 }).unique("bySearchDriftIndexRow", ["indexName", "rowId"]).index("bySearchDriftIndex", ["indexName"]), Ce = (e, t) => ({
 	table: e,
-	predicate: g("id", t),
+	predicate: h("id", t),
 	order: [],
 	take: 1,
 	skip: void 0,
 	projection: void 0
-}), X = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), we = (e) => ({
+}), Y = (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),
@@ -759,8 +762,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	op: e.op === "remove" ? "remove" : "upsert",
 	attempts: Number(e.attempts ?? 0),
 	lastError: String(e.lastError ?? ""),
-	firstFailedAt: X(e.firstFailedAt),
-	lastFailedAt: X(e.lastFailedAt)
+	firstFailedAt: Y(e.firstFailedAt),
+	lastFailedAt: Y(e.lastFailedAt)
 }), Te = () => {
 	let e = /* @__PURE__ */ new Map(), t = (e, t) => `${e}\u0000${t}`;
 	return {
@@ -791,8 +794,8 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			e.delete(t(n, r));
 		}
 	};
-}, Ee = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, Z = (e, t) => ({
-	table: Y,
+}, Ee = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, X = (e, t) => ({
+	table: J,
 	predicate: e,
 	order: [{
 		column: "firstFailedAt",
@@ -803,7 +806,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	projection: void 0
 }), De = (e) => ({
 	record: async (t) => {
-		let n = /* @__PURE__ */ new Date(), r = Ee(), i = await e.insertIgnore(Y, {
+		let n = /* @__PURE__ */ new Date(), r = Ee(), i = await e.insertIgnore(J, {
 			id: r,
 			indexName: t.indexName,
 			sourceTable: t.sourceTable,
@@ -815,27 +818,27 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			firstFailedAt: n,
 			lastFailedAt: n
 		}, { conflictColumns: ["indexName", "rowId"] });
-		String(i.id) !== r && await e.updateMany(Y, {
+		String(i.id) !== r && await e.updateMany(J, {
 			attempts: Number(i.attempts ?? 0) + 1,
 			op: t.op,
 			docId: t.docId,
 			lastError: t.error.slice(0, 1e3),
 			lastFailedAt: n
-		}, { where: g("id", String(i.id)) });
+		}, { where: h("id", String(i.id)) });
 	},
-	list: async (t) => (await e.query(Z(void 0, t))).map(we),
+	list: async (t) => (await e.query(X(void 0, t))).map(we),
 	summary: async (t) => {
 		let n = (await e.query({
-			...Z(g("indexName", t), void 0),
+			...X(h("indexName", t), void 0),
 			order: [],
-			aggregations: [h("n")]
+			aggregations: [m("n")]
 		}))[0], r = Number(n?.n ?? n?.count ?? 0);
 		if (r === 0) return {
 			pending: 0,
 			lastFailedAt: null
 		};
 		let i = await e.query({
-			...Z(g("indexName", t), 1),
+			...X(h("indexName", t), 1),
 			order: [{
 				column: "lastFailedAt",
 				direction: "desc"
@@ -843,17 +846,17 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		});
 		return {
 			pending: r,
-			lastFailedAt: i[0] ? X(i[0].lastFailedAt) : null
+			lastFailedAt: i[0] ? Y(i[0].lastFailedAt) : null
 		};
 	},
 	clear: async (t, n) => {
-		await e.deleteMany(Y, { where: m(g("indexName", t), g("rowId", n)) });
+		await e.deleteMany(J, { where: p(h("indexName", t), h("rowId", n)) });
 	}
 }), Oe = () => [Se], ke = (e, t) => {
-	if (e === void 0 || e === "memory") return N();
+	if (e === void 0 || e === "memory") return j();
 	if (typeof e.query == "function") return e;
 	let n = e;
-	return n.engine === "typesense" ? ae(n, t) : n.engine === "meilisearch" ? ce(n, t) : n.engine === "algolia" ? pe(n, t) : N();
+	return n.engine === "typesense" ? oe(n, t) : n.engine === "meilisearch" ? I(n, t) : n.engine === "algolia" ? L(n, t) : j();
 }, 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;
@@ -864,7 +867,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 		return;
 	}
 	n.new && await e.upsert(t.index, [t.map(n.new)]);
-}, Q = {
+}, Z = {
 	retries: 5,
 	retryBaseDelayMs: 200,
 	retryMaxDelayMs: 1e4,
@@ -873,21 +876,21 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	reindexBatchSize: 1e3,
 	statsFlushIntervalMs: 5e3,
 	statsFlushMaxBuffered: 1e3
-}, 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),
-	resyncIntervalMs: Math.max(0, e?.resyncIntervalMs ?? Q.resyncIntervalMs),
-	resyncBatchSize: Math.max(1, e?.resyncBatchSize ?? Q.resyncBatchSize),
-	reindexBatchSize: Math.max(1, e?.reindexBatchSize ?? Q.reindexBatchSize),
-	statsFlushIntervalMs: Math.max(0, e?.statsFlushIntervalMs ?? Q.statsFlushIntervalMs),
-	statsFlushMaxBuffered: Math.max(1, e?.statsFlushMaxBuffered ?? Q.statsFlushMaxBuffered)
-}), Ne = (e) => e instanceof k ? e : new k({
+}, Q = (e) => ({
+	retries: Math.max(0, e?.retries ?? Z.retries),
+	retryBaseDelayMs: Math.max(1, e?.retryBaseDelayMs ?? Z.retryBaseDelayMs),
+	retryMaxDelayMs: Math.max(1, e?.retryMaxDelayMs ?? Z.retryMaxDelayMs),
+	resyncIntervalMs: Math.max(0, e?.resyncIntervalMs ?? Z.resyncIntervalMs),
+	resyncBatchSize: Math.max(1, e?.resyncBatchSize ?? Z.resyncBatchSize),
+	reindexBatchSize: Math.max(1, e?.reindexBatchSize ?? Z.reindexBatchSize),
+	statsFlushIntervalMs: Math.max(0, e?.statsFlushIntervalMs ?? Z.statsFlushIntervalMs),
+	statsFlushMaxBuffered: Math.max(1, e?.statsFlushMaxBuffered ?? Z.statsFlushMaxBuffered)
+}), Me = (e) => e instanceof D ? e : new D({
 	engine: "unknown",
 	op: "upsert",
 	message: String(e?.message ?? e),
 	transient: !1
-}), 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) => {
+}), Ne = (e) => d.max([d.min([d.exponential(s.millis(e.retryBaseDelayMs), 2), d.spaced(s.millis(e.retryMaxDelayMs))]), d.recurs(e.retries)]).pipe(d.while(({ input: e }) => e.transient)), Pe = (e) => {
 	if (!e || e === "memory" || typeof e.query == "function") return;
 	let t = e;
 	try {
@@ -895,7 +898,7 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	} catch {
 		return;
 	}
-}, $ = (e, t, n) => {
+}, Fe = (e, t, n) => {
 	let r = n ?? [];
 	return e ? t == null ? null : [...r, {
 		field: e,
@@ -906,69 +909,69 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 	...(e.filters ?? []).map((e) => ["filter", e.field]),
 	...(e.facets ?? []).map((e) => ["facet", e]),
 	...(e.highlight?.fields ?? []).map((e) => ["highlight", e])
-], Le = i, Re = (i) => {
-	let s = te({
-		base: Le,
+], $ = i, Le = (i) => {
+	let o = ne({
+		base: $,
 		alias: i.alias,
 		instance: i.name
-	}), c = () => void 0, f = () => void 0, m = Me(i.sync), h = Pe(m), g = ke(i.backend, {
+	}), s = () => void 0, d = () => void 0, p = Q(i.sync), m = Ne(p), h = 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 = K(i.backend), b = i.singleProcessMemoryIndex === !0, x = !1, S, ne = {
+		onWarn: (e, t) => s(e, t)
+	}), g = /* @__PURE__ */ new Map();
+	for (let e of Object.values(i.indexes)) g.set(e.index, e);
+	let _ = ge(i.backend), v = i.singleProcessMemoryIndex === !0, y = !1, b, re = {
 		...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 = re(Ie({
-				...c ? { filters: c } : {},
+			let { index: i, q: a, limit: o, offset: s, filters: l, facets: u, highlight: d, fuzziness: f, engineParams: p } = t, m = g.get(i);
+			if (!m) return c.fail(new n({ index: i }));
+			let _ = ie(Ie({
+				...l ? { filters: l } : {},
 				...u ? { facets: u } : {},
 				...d ? { highlight: d } : {}
 			}), m.queryableFields);
-			if (h) return l.fail(new e(h));
-			let v = r.request.subject.tenantId ?? null, y = $(m.tenantField, v, c);
-			if (y === null) return l.succeed({
+			if (_) return c.fail(new e(_));
+			let ee = r.request.subject.tenantId ?? null, v = Fe(m.tenantField, ee, l);
+			if (v === null) return c.succeed({
 				hits: [],
 				facets: {}
 			});
-			let b = {
+			let y = {
 				q: a,
 				...o === void 0 ? {} : { limit: o },
 				...s === void 0 ? {} : { offset: s },
-				...y.length > 0 ? { filters: y } : {},
+				...v.length > 0 ? { filters: v } : {},
 				...u && u.length > 0 ? { facets: u } : {},
 				...d ? { highlight: d } : {},
 				...f === void 0 ? {} : { fuzziness: f },
 				...p ? { engineParams: p } : {}
 			};
-			return l.promise(() => g.query(i, b));
+			return c.promise(() => h.query(i, y));
 		}
-	}, C = Fe(i.backend), w = [
+	}, x = Pe(i.backend), S = [
 		"store:changes:read",
 		"store:write",
 		"inspect:read",
 		"inspect:write",
-		...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", {
+		...x ? [`network:outbound:${x}`] : []
+	], C = H(), w = Te(), T, E, D, O, k = (e, t, n) => O === void 0 ? c.tryPromise(() => C.bump(e, t, n)).pipe(c.catch((n) => c.sync(() => s("search stats bump failed", {
 		index: e,
 		kind: t,
 		error: String(n)
-	})))) : l.sync(() => A.bump(e, t, n)), M = async (e) => {
-		let t = await E.list(e), n = 0, r = 0;
+	})))) : c.sync(() => O.bump(e, t, n)), A = async (e) => {
+		let t = await w.list(e), n = 0, r = 0;
 		for (let e of t) {
-			let t = _.get(e.indexName);
+			let t = g.get(e.indexName);
 			if (!t) {
-				await E.clear(e.indexName, e.rowId);
+				await w.clear(e.indexName, e.rowId);
 				continue;
 			}
 			try {
-				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++;
+				if (!E) throw Error("data store not bound");
+				let r = (await E.query(Ce(e.sourceTable, e.rowId)))[0];
+				r ? await h.upsert(t.index, [t.map(r)]) : await h.remove(t.index, [e.docId]), await w.clear(e.indexName, e.rowId), n++;
 			} catch (t) {
-				r++, await E.record({
+				r++, await w.record({
 					...e,
 					error: String(t?.message ?? t)
 				}).catch(() => void 0);
@@ -979,20 +982,20 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 			repaired: n,
 			failed: r
 		};
-	}, N = (e) => ({
+	}, j = (e) => ({
 		kind: "json",
 		data: e
-	}), P = (e, t) => ({
+	}), M = (e, t) => ({
 		kind: "json",
 		status: e,
 		data: { error: t }
 	});
-	return ee({
-		name: s,
-		baseName: Le,
+	return te({
+		name: o,
+		baseName: $,
 		description: "External search index sync (Typesense/Meilisearch/Algolia/memory) via the ChangeEvent tap + a tenant-scoped query route.",
-		permissions: w,
-		routes: [ne],
+		permissions: S,
+		routes: [re],
 		rpcClientDescriptors: t,
 		inspectEndpoints: [
 			{
@@ -1000,10 +1003,10 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				path: "/indexes",
 				scope: "process",
 				description: "Configured indexes + durable, cross-replica sync stats + current index drift.",
-				handler: () => l.promise(async () => {
-					await A?.flushNow();
+				handler: () => c.promise(async () => {
+					await O?.flushNow();
 					let e = await Promise.all(Object.entries(i.indexes).map(async ([e, t]) => {
-						let n = await T.get(t.index), r = await E.summary(t.index);
+						let n = await C.get(t.index), r = await w.summary(t.index);
 						return {
 							table: e,
 							index: t.index,
@@ -1014,15 +1017,15 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 							drifted: r.pending > 0
 						};
 					}));
-					return N({
+					return j({
 						indexes: e,
 						backend: typeof i.backend == "string" ? i.backend : i.backend ? "custom/vendor" : "memory",
-						durable: v !== "memory",
-						singleProcessMemoryIndex: b,
+						durable: _ !== "memory",
+						singleProcessMemoryIndex: v,
 						pendingDrift: e.reduce((e, t) => e + t.pendingDrift, 0),
 						sync: {
-							...m,
-							resyncArmed: D !== void 0
+							...p,
+							resyncArmed: T !== void 0
 						}
 					});
 				})
@@ -1032,34 +1035,34 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				path: "/drift",
 				scope: "process",
 				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 E.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
-					return N({ entries: n });
+				handler: (e) => c.promise(async () => {
+					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await w.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
+					return j({ entries: n });
 				})
 			},
 			{
 				method: "POST",
 				path: "/resync",
 				description: "Repair drifted rows now — re-reads each from the DB and re-applies it.",
-				handler: (e) => l.promise(async () => {
+				handler: (e) => c.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return P(400, "invalid JSON body");
+						return M(400, "invalid JSON body");
 					}
-					if (typeof t != "object" || !t || Array.isArray(t)) return P(400, "expected a JSON object");
-					let n = "limit" in t ? t.limit : m.resyncBatchSize;
-					if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1) return P(400, "limit must be a positive integer");
-					if (!O) return P(503, "data store not bound yet");
+					if (typeof t != "object" || !t || Array.isArray(t)) return M(400, "expected a JSON object");
+					let n = "limit" in t ? t.limit : p.resyncBatchSize;
+					if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1) return M(400, "limit must be a positive integer");
+					if (!E) return M(503, "data store not bound yet");
 					try {
-						let e = await M(Math.min(n, 1e3));
-						return N({
+						let e = await A(Math.min(n, 1e3));
+						return j({
 							ok: !0,
 							...e
 						});
 					} catch (e) {
-						return P(500, e.message);
+						return M(500, e.message);
 					}
 				})
 			},
@@ -1067,64 +1070,64 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 				method: "POST",
 				path: "/reindex",
 				description: "Re-seed an index from the table's current rows (streamed in bounded batches).",
-				handler: (e) => l.promise(async () => {
+				handler: (e) => c.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return P(400, "invalid JSON body");
+						return M(400, "invalid JSON body");
 					}
-					if (typeof t != "object" || !t || Array.isArray(t)) return P(400, "expected a JSON object");
+					if (typeof t != "object" || !t || Array.isArray(t)) return M(400, "expected a JSON object");
 					let n = "table" in t ? t.table : void 0;
-					if (typeof n != "string" || n.trim() === "") return P(400, "table must be a non-empty string");
+					if (typeof n != "string" || n.trim() === "") return M(400, "table must be a non-empty string");
 					let r = Object.hasOwn(i.indexes, n) ? i.indexes[n] : void 0;
-					if (!r) return P(404, `no index configured for table "${n}"`);
-					if (!k) return P(503, "data store not bound yet");
-					let s = 0, c = await l.runPromiseExit(y(k, {
+					if (!r) return M(404, `no index configured for table "${n}"`);
+					if (!D) return M(503, "data store not bound yet");
+					let o = 0, s = await c.runPromiseExit(ee(D, {
 						table: n,
-						chunkSize: m.reindexBatchSize
-					}).pipe(p.chunks, p.runForEach((e) => l.tryPromise(async () => {
-						s += await Ae(g, r, o.toReadonlyArray(e));
+						chunkSize: p.reindexBatchSize
+					}).pipe(f.chunks, f.runForEach((e) => c.tryPromise(async () => {
+						o += await Ae(h, r, 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 P(500, String(n?.message ?? n));
+					if (l.isFailure(s)) {
+						let e = a.findErrorOption(s.cause), t = u.isSome(e) ? e.value : s.cause, n = t.cause ?? t.error ?? t;
+						return M(500, String(n?.message ?? n));
 					}
 					try {
-						await T.recordReindex(r.index, s, (/* @__PURE__ */ new Date()).toISOString());
+						await C.recordReindex(r.index, o, (/* @__PURE__ */ new Date()).toISOString());
 					} catch (e) {
-						return P(500, e.message);
+						return M(500, e.message);
 					}
-					return N({
+					return j({
 						ok: !0,
 						table: n,
 						index: r.index,
-						count: s
+						count: o
 					});
 				})
 			}
 		],
-		extendSchema: { tables: [...z(), ...Oe()] },
+		extendSchema: { tables: [...V(), ...Oe()] },
 		bindDataStore: (e, t) => {
-			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), {
+			E = e, D = e, C = G(e, ...t?.instanceId === void 0 ? [] : [t.instanceId]), w = De(e), _ === "memory" && t?.membership !== void 0 && (b = t.membership.onChange((e) => {
+				e.kind === "left" || y || (t.instanceId === void 0 || e.instanceId !== t.instanceId) && (y = !0, s(xe(e.instanceId, v), {
 					instanceId: t.instanceId ?? null,
 					peer: e.instanceId,
 					indexes: Object.keys(i.indexes)
 				}));
-			})), !(m.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (D = t.scheduleCoordinated("search.resync", m.resyncIntervalMs, async () => {
+			})), !(p.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (T = t.scheduleCoordinated("search.resync", p.resyncIntervalMs, async () => {
 				try {
-					let e = await M(m.resyncBatchSize);
-					return (e.repaired > 0 || e.failed > 0) && f("search: drift repair pass", e), { idle: e.scanned === 0 };
+					let e = await A(p.resyncBatchSize);
+					return (e.repaired > 0 || e.failed > 0) && d("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 };
+					return s("search: drift repair pass failed", { error: String(e?.message ?? e) }), { idle: !1 };
 				}
 			}));
 		},
 		onChangeEvent: (e) => {
 			let t = i.indexes[e.table];
-			if (!t) return l.void;
-			let n = e.changeScope, r = e.changeScope === "fleet" || e.origin !== "injected", a = e.op === "delete" ? e.old : e.new, o = typeof a?.id == "string" ? a.id : "", s = e.op === "delete" ? "remove" : "upsert", u = () => {
+			if (!t) return c.void;
+			let n = e.changeScope, r = e.changeScope === "fleet" || e.origin !== "injected", a = e.op === "delete" ? e.old : e.new, o = typeof a?.id == "string" ? a.id : "", l = e.op === "delete" ? "remove" : "upsert", u = () => {
 				if (e.op === "delete" || !e.new) return o;
 				try {
 					return String(t.map(e.new).id ?? o);
@@ -1132,11 +1135,11 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (e, t) => {
 					return o;
 				}
 			};
-			return l.tryPromise({
-				try: () => je(g, t, e),
-				catch: Ne
-			}).pipe(l.retry(h)).pipe(l.matchEffect({
-				onSuccess: () => r ? j(t.index, e.op === "delete" ? "removed" : "synced", n) : l.void,
+			return c.tryPromise({
+				try: () => je(h, t, e),
+				catch: Me
+			}).pipe(c.retry(m)).pipe(c.matchEffect({
+				onSuccess: () => r ? k(t.index, e.op === "delete" ? "removed" : "synced", n) : c.void,
 				onFailure: (r) => {
 					let i = {
 						table: e.table,
@@ -1146,49 +1149,49 @@ var C = /^[A-Za-z_][A-Za-z0-9_.]*$/, w = (e) => C.test(e), re = (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(() => E.record({
+					return o === "" ? c.sync(() => s("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(c.andThen(c.fail(r))) : c.tryPromise(() => w.record({
 						indexName: t.index,
 						sourceTable: e.table,
 						rowId: o,
 						docId: u(),
-						op: s,
+						op: l,
 						error: r.message
-					})).pipe(l.matchEffect({
-						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", {
+					})).pipe(c.matchEffect({
+						onSuccess: () => k(t.index, "dropped", n).pipe(c.andThen(c.sync(() => s("search: index drift recorded — will be repaired from the database", i)))),
+						onFailure: (e) => c.sync(() => s("search: change LOST — engine failed and the drift ledger could not record it", {
 							...i,
 							ledgerError: String(e)
-						})).pipe(l.zipRight(l.fail(r)))
+						})).pipe(c.andThen(c.fail(r)))
 					}));
 				}
 			}));
 		},
-		onActivate: (e) => l.suspend(() => {
-			c = (t, n) => e.logger.warn(t, n), f = (t, n) => e.logger.info(t, n);
-			let t = J({
-				backendKind: v,
+		onActivate: (e) => c.suspend(() => {
+			s = (t, n) => e.logger.warn(t, n), d = (t, n) => e.logger.info(t, n);
+			let t = be({
+				backendKind: _,
 				production: (e.env?.NODE_ENV ?? process.env.NODE_ENV) === "production",
-				singleProcessDeclared: b
+				singleProcessDeclared: v
 			});
-			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(() => {
+			return t.level === "refuse" ? c.fail(new _e(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(i.indexes) }), p.statsFlushIntervalMs > 0 && O === void 0 && (O = K({
+				flush: q(() => C),
+				intervalMs: p.statsFlushIntervalMs,
+				maxBuffered: p.statsFlushMaxBuffered
+			})), c.sync(() => {
 				e.logger.info("search active", {
 					indexes: Object.keys(i.indexes),
 					backend: typeof i.backend == "string" ? i.backend : "custom/vendor",
-					durable: v !== "memory",
-					sync: m
+					durable: _ !== "memory",
+					sync: p
 				});
 			}));
 		}),
-		onDeactivate: () => l.promise(async () => {
-			D?.stop(), D = void 0, S?.(), S = void 0, x = !1;
-			let e = A;
-			A = void 0, await e?.shutdown();
+		onDeactivate: () => c.promise(async () => {
+			T?.stop(), T = void 0, b?.(), b = void 0, y = !1;
+			let e = O;
+			O = void 0, await e?.shutdown();
 		})
 	});
 };
 //#endregion
-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 };
+export { x as FIELD_NAME_PATTERN, J as SEARCH_DRIFT_TABLE, R as SEARCH_STATS_TABLE, Z as SYNC_DEFAULTS, D as SearchBackendError, _e as SearchBackendNotDurable, e as SearchFieldRejected, n as SearchIndexNotFound, L as algoliaBackend, E as allowedEngineParams, je as applyChange, Me as asBackendError, be as auditMemoryBackend, ge as backendKindOf, Ae as backfillIndex, De as dataStoreDriftLedger, G as dataStoreStatsStore, Ce as driftSourceQuery, Oe as driftTables, S as isSafeFieldName, K as makeSearchStatsBuffer, I as meilisearchBackend, j as memoryBackend, Te as memoryDriftLedger, H as memoryStatsStore, xe as peerObservedWarning, Q as resolveSyncOptions, T as sanitizeEngineParams, Fe as scopeSearchFilters, Se as searchDriftTable, Le as searchPlugin, B as searchStatsTable, V as searchTables, q as statsStoreFlush, Ne as syncRetrySchedule, oe as typesenseBackend };