@voltro/plugin-search 0.34.0 → 0.35.0

package/dist/index.js

@@ -1,12 +1,12 @@
-import { a as e, i as t, n, r } from "./rpc-BQBNr0OU.js";
-import { Data as i, Duration as a, Effect as o, Schedule as s } from "effect";
-import { definePlugin as c, pluginInstanceName as l } from "@voltro/protocol";
-import { and as u, count as d, eq as f, id as p, integer as m, table as h, text as g, timestamp as _ } from "@voltro/database";
+import { a as e, i as t, n, r } from "./rpc-DaYt-dP6.js";
+import { Cause as i, Chunk 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";
 //#region src/sanitize.ts
-var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
+var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), re = (e, t) => {
 	let n = t ? new Set(t) : void 0;
 	for (let [t, r] of e) {
-		if (!y(r)) return {
+		if (!S(r)) return {
 			field: r,
 			where: t,
 			reason: "not-an-identifier"
@@ -17,7 +17,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			reason: "not-queryable"
 		};
 	}
-}, b = {
+}, C = {
 	typesense: [
 		"per_page",
 		"page",
@@ -71,7 +71,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		"highlightPreTag",
 		"highlightPostTag"
 	]
-}, x = {
+}, ie = {
 	typesense: [
 		"filter_by",
 		"q",
@@ -108,20 +108,20 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		"aroundLatLng",
 		"insideBoundingBox"
 	]
-}, S = (e, t, n) => {
+}, w = (e, t, n) => {
 	if (!t) return {
 		params: {},
 		appAllowed: {},
 		dropped: []
 	};
-	let r = new Set(x[e]), i = new Set(b[e]), a = new Set(n ?? []), o = {}, s = {}, c = [];
+	let r = new Set(ie[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
 	};
-}, C = (e) => b[e], w = class extends i.TaggedError("SearchBackendError") {}, T = (e) => Array.isArray(e) ? e : [e], E = (e, t, n) => {
+}, T = (e) => C[e], E = class extends o.TaggedError("SearchBackendError") {}, D = (e) => Array.isArray(e) ? e : [e], O = (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);
@@ -137,7 +137,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		i = o;
 	}
 	return (i[r] ?? Infinity) <= n;
-}, D = (e) => e.length <= 4 ? 1 : 2, O = () => {
+}, k = (e) => e.length <= 4 ? 1 : 2, A = () => {
 	let e = /* @__PURE__ */ new Map(), t = (t) => {
 		let n = e.get(t);
 		return n || (n = /* @__PURE__ */ new Map(), e.set(t, n)), n;
@@ -146,13 +146,13 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		switch (t.op) {
 			case "eq": return String(n) === String(t.value);
 			case "neq": return String(n) !== String(t.value);
-			case "in": return T(t.value).some((e) => String(n) === String(e));
-			case "nin": return T(t.value).every((e) => String(n) !== String(e));
+			case "in": return D(t.value).some((e) => String(n) === String(e));
+			case "nin": return D(t.value).every((e) => String(n) !== String(e));
 			case "gt":
 			case "gte":
 			case "lt":
 			case "lte": {
-				let [e, r] = [k(n), k(t.value)];
+				let [e, r] = [j(n), j(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;
 			}
 		}
@@ -162,8 +162,8 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			let e = r.toLowerCase();
 			if (e.includes(t)) return !0;
 			if (n !== void 0 && n !== 0) {
-				let r = n === "auto" ? D(t) : n;
-				for (let n of e.split(/\s+/)) if (E(n, t, r)) return !0;
+				let r = n === "auto" ? k(t) : n;
+				for (let n of e.split(/\s+/)) if (O(n, t, r)) return !0;
 			}
 		}
 		return !1;
@@ -207,7 +207,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			};
 		}
 	};
-}, k = (e) => {
+}, j = (e) => {
 	if (typeof e == "number") return e;
 	if (typeof e == "boolean") return +!!e;
 	if (typeof e == "string") {
@@ -216,19 +216,19 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		let n = Date.parse(e);
 		return Number.isNaN(n) ? void 0 : n;
 	}
-}, A = async (e, t, n) => {
+}, M = async (e, t, n) => {
 	try {
 		return await n();
 	} catch {
-		throw new w({
+		throw new E({
 			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
 		});
 	}
-}, j = (e, t) => (n) => {
-	let { params: r, appAllowed: i, dropped: a } = S(e, n, t.allowEngineParams);
+}, N = (e, t) => (n) => {
+	let { params: r, appAllowed: i, dropped: a } = w(e, n, t.allowEngineParams);
 	return a.length > 0 && t.onWarn?.("search dropped disallowed engineParams", {
 		engine: e,
 		keys: a
@@ -236,16 +236,16 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		before: r,
 		after: i
 	};
-}, M = (e, t) => {
-	if (!y(t)) throw new w({
+}, P = (e, t) => {
+	if (!S(t)) throw new E({
 		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;
-}, te = (e) => {
-	let t = (e) => JSON.stringify(e), n = M("typesense", e.field);
+}, ae = (e) => {
+	let t = (e) => JSON.stringify(e), n = P("typesense", e.field);
 	switch (e.op) {
 		case "eq": return `${n}:=${t(e.value)}`;
 		case "neq": return `${n}:!=${t(e.value)}`;
@@ -253,21 +253,21 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (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}:[${T(e.value).map(t).join(",")}]`;
-		case "nin": return `${n}:!=[${T(e.value).map(t).join(",")}]`;
+		case "in": return `${n}:[${D(e.value).map(t).join(",")}]`;
+		case "nin": return `${n}:!=[${D(e.value).map(t).join(",")}]`;
 	}
-}, ne = (e, t = {}) => {
-	let n = j("typesense", t), r, i = async () => (r ||= A("typesense", "typesense", () => import("typesense")).then((t) => {
+}, oe = (e, t = {}) => {
+	let n = N("typesense", t), r, i = async () => (r ||= M("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(te).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 w ? t : new w({
+			throw t instanceof E ? t : new E({
 				engine: "typesense",
 				op: e,
 				message: String(t?.message ?? t),
@@ -299,10 +299,10 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				...d !== void 0 && d !== "auto" ? { num_typos: Math.min(2, Math.max(0, d)) } : {},
 				...p.after
 			};
-			return re(await o.collections(e).documents().search(m));
+			return se(await o.collections(e).documents().search(m));
 		})
 	};
-}, re = (e) => {
+}, se = (e) => {
 	let t = (e.hits ?? []).map((e) => {
 		let t = {};
 		for (let n of e.highlights ?? []) {
@@ -319,8 +319,8 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		hits: t,
 		facets: n
 	};
-}, ie = (e) => {
-	let t = (e) => JSON.stringify(e), n = M("meilisearch", e.field);
+}, ce = (e) => {
+	let t = (e) => JSON.stringify(e), n = P("meilisearch", e.field);
 	switch (e.op) {
 		case "eq": return `${n} = ${t(e.value)}`;
 		case "neq": return `${n} != ${t(e.value)}`;
@@ -328,18 +328,18 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (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 [${T(e.value).map(t).join(", ")}]`;
-		case "nin": return `${n} NOT IN [${T(e.value).map(t).join(", ")}]`;
+		case "in": return `${n} IN [${D(e.value).map(t).join(", ")}]`;
+		case "nin": return `${n} NOT IN [${D(e.value).map(t).join(", ")}]`;
 	}
-}, ae = (e, t = {}) => {
-	let n = j("meilisearch", t), r, i = async () => (r ||= A("meilisearch", "meilisearch", () => import("meilisearch")).then((t) => new t.MeiliSearch({
+}, F = (e, t = {}) => {
+	let n = N("meilisearch", t), r, i = async () => (r ||= M("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(ie) : 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 w ? t : new w({
+			throw t instanceof E ? t : new E({
 				engine: "meilisearch",
 				op: e,
 				message: String(t?.message ?? t),
@@ -372,10 +372,10 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				} : {},
 				...o.after
 			};
-			return oe(await (await i()).index(e).search(t, p), u);
+			return le(await (await i()).index(e).search(t, p), u);
 		})
 	};
-}, oe = (e, t) => ({
+}, le = (e, t) => ({
 	hits: e.hits.map((e) => {
 		let { _formatted: n, ...r } = e;
 		if (t && n) {
@@ -389,19 +389,19 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		return { doc: r };
 	}),
 	facets: e.facetDistribution ?? {}
-}), se = (e) => String(e).replace(/^-/, "\\-"), ce = (e, t) => {
+}), ue = (e) => String(e).replace(/^-/, "\\-"), de = (e, t) => {
 	let n = typeof t == "boolean" ? +!!t : Number(t);
-	if (!Number.isFinite(n)) throw new w({
+	if (!Number.isFinite(n)) throw new E({
 		engine: "algolia",
 		op: "query",
 		message: `range filter on "${e}" needs a numeric value (got ${JSON.stringify(t)})`,
 		transient: !1
 	});
 	return n;
-}, le = (e) => {
+}, fe = (e) => {
 	let t = [], n = [];
 	for (let r of e ?? []) {
-		let e = M("algolia", r.field), i = (e) => se(e), a = (t) => ce(e, t);
+		let e = P("algolia", r.field), i = (e) => ue(e), a = (t) => de(e, t);
 		switch (r.op) {
 			case "eq":
 				t.push(`${e}:${i(r.value)}`);
@@ -410,10 +410,10 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				t.push(`${e}:-${i(r.value)}`);
 				break;
 			case "in":
-				t.push(T(r.value).map((t) => `${e}:${i(t)}`));
+				t.push(D(r.value).map((t) => `${e}:${i(t)}`));
 				break;
 			case "nin":
-				for (let n of T(r.value)) t.push(`${e}:-${i(n)}`);
+				for (let n of D(r.value)) t.push(`${e}:-${i(n)}`);
 				break;
 			case "gt":
 				n.push(`${e} > ${a(r.value)}`);
@@ -433,12 +433,12 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		facetFilters: t,
 		numericFilters: n
 	};
-}, N = (e, t = {}) => {
-	let n = j("algolia", t), r, i = async () => (r ||= A("algoliasearch", "algolia", () => import("algoliasearch")).then((t) => t.algoliasearch(e.appId ?? "", e.apiKey)), r), a = async (e, t) => {
+}, I = (e, t = {}) => {
+	let n = N("algolia", t), r, i = async () => (r ||= M("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 w ? t : new w({
+			throw t instanceof E ? t : new E({
 				engine: "algolia",
 				op: e,
 				message: String(t?.message ?? t),
@@ -463,7 +463,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (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 } = le(s), p = o ? {
+			let { facetFilters: a, numericFilters: f } = fe(s), p = o ? {
 				offset: o,
 				length: r ?? 20
 			} : { hitsPerPage: r ?? 20 }, m = n(d), h = {
@@ -481,13 +481,13 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				...u === 0 ? { typoTolerance: !1 } : {},
 				...m.after
 			};
-			return ue(await (await i()).searchSingleIndex({
+			return pe(await (await i()).searchSingleIndex({
 				indexName: e,
 				searchParams: h
 			}), l);
 		})
 	};
-}, ue = (e, t) => ({
+}, pe = (e, t) => ({
 	hits: e.hits.map((e) => {
 		let { _highlightResult: n, ...r } = e;
 		if (t && n) {
@@ -501,25 +501,25 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		return { doc: r };
 	}),
 	facets: e.facets ?? {}
-}), P = "_voltro_search_stats", F = () => ({
+}), L = "_voltro_search_stats", R = () => ({
 	synced: 0,
 	removed: 0,
 	dropped: 0,
 	lastReindexAt: null,
 	lastReindexCount: 0
-}), I = h(P, {
-	id: p({ prefix: "sstat" }),
-	indexName: g().maxLength(191),
-	replicaId: g().maxLength(191),
-	synced: m().default(0),
-	removed: m().default(0),
-	dropped: m().default(0),
-	scope: g().maxLength(8).default("local"),
-	lastReindexAt: _().nullable(),
-	lastReindexCount: m().default(0),
-	updatedAt: _()
-}).unique("bySearchStatsIndexReplica", ["indexName", "replicaId"]).index("bySearchStatsIndex", ["indexName"]), L = () => [I], R = () => {
-	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? F();
+}), z = v(L, {
+	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"]), B = () => [z], V = () => {
+	let e = /* @__PURE__ */ new Map(), t = (t) => e.get(t) ?? R();
 	return {
 		bump: async (n, r) => {
 			let i = t(n);
@@ -534,6 +534,15 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				dropped: i.dropped + 1
 			});
 		},
+		add: async (n, r) => {
+			let i = t(n);
+			e.set(n, {
+				...i,
+				synced: i.synced + r.synced,
+				removed: i.removed + r.removed,
+				dropped: i.dropped + r.dropped
+			});
+		},
 		recordReindex: async (n, r, i) => {
 			let a = t(n);
 			e.set(n, {
@@ -545,19 +554,19 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		},
 		get: async (e) => t(e)
 	};
-}, z = (e) => ({
-	table: P,
+}, H = (e) => ({
+	table: L,
 	predicate: e,
 	order: [],
 	take: void 0,
 	skip: void 0,
 	projection: void 0
-}), de = () => `sstat_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, fe = () => process.env.VOLTRO_REPLICA_ID ?? process.env.HOSTNAME ?? process.env.POD_NAME ?? `pid_${process.pid}_${Math.random().toString(36).slice(2, 8)}`, B = 32, V = (e, t = fe()) => {
-	let n = async (n) => (await e.query(z(u(f("indexName", n), f("replicaId", t)))))[0] ?? null, r = async (e) => {
+}), me = () => `sstat_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, he = () => process.env.VOLTRO_REPLICA_ID ?? process.env.HOSTNAME ?? process.env.POD_NAME ?? `pid_${process.pid}_${Math.random().toString(36).slice(2, 8)}`, U = 32, W = (e, t = he()) => {
+	let n = async (n) => (await e.query(H(p(h("indexName", n), h("replicaId", t)))))[0] ?? null, r = async (e) => {
 		try {
 			return await e();
 		} catch (e) {
-			throw e instanceof w ? e : new w({
+			throw e instanceof E ? e : new E({
 				engine: "stats",
 				op: "upsert",
 				message: String(e?.message ?? e),
@@ -565,7 +574,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			});
 		}
 	}, i = (i, a, o, s) => r(async () => {
-		for (let r = 0; r < B; r++) {
+		for (let r = 0; r < U; r++) {
 			r > 0 && await new Promise((e) => setTimeout(e, r));
 			let c = await n(i);
 			if (c) {
@@ -580,9 +589,9 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 					...o(i),
 					...a ? { scope: a } : {},
 					updatedAt: /* @__PURE__ */ new Date()
-				}, { where: u(f("id", String(c.id)), f("synced", t), f("removed", n), f("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 = de(), r = await e.insertIgnore(P, {
+				let n = me(), r = await e.insertIgnore(L, {
 					id: n,
 					indexName: i,
 					replicaId: t,
@@ -598,15 +607,24 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				if (String(r.id) === n) return;
 			}
 		}
-		throw new w({
+		throw new E({
 			engine: "stats",
 			op: "upsert",
-			message: `search stats: contention on (${i}, ${t}) exceeded ${B} attempts`,
+			message: `search stats: contention on (${i}, ${t}) exceeded ${U} attempts`,
 			transient: !0
 		});
 	});
 	return {
 		bump: (e, t, n) => i(e, n, (e) => t === "synced" ? { synced: e.synced + 1 } : t === "removed" ? { removed: e.removed + 1 } : { dropped: e.dropped + 1 }, t === "synced" ? { synced: 1 } : t === "removed" ? { removed: 1 } : { dropped: 1 }),
+		add: (e, t, n) => i(e, n, (e) => ({
+			synced: e.synced + t.synced,
+			removed: e.removed + t.removed,
+			dropped: e.dropped + t.dropped
+		}), {
+			synced: t.synced,
+			removed: t.removed,
+			dropped: t.dropped
+		}),
 		recordReindex: (e, t, n) => i(e, void 0, (e) => ({
 			synced: e.synced + t,
 			lastReindexAt: new Date(n),
@@ -617,7 +635,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			lastReindexCount: t
 		}),
 		get: (t) => r(async () => {
-			let n = await e.query(z(f("indexName", t))), r = n.some((e) => e.scope === "fleet"), i = (e) => {
+			let n = await e.query(H(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);
@@ -630,7 +648,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				t && (a === null || t > a) && (a = t, o = Number(e.lastReindexCount ?? 0));
 			}
 			return {
-				...F(),
+				...R(),
 				synced: i("synced"),
 				removed: i("removed"),
 				dropped: i("dropped"),
@@ -639,12 +657,44 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			};
 		})
 	};
-}, H = (e) => e === void 0 || e === "memory" ? "memory" : typeof e.query == "function" ? e.engineKind === "memory" ? "memory" : "custom" : "vendor", U = class extends Error {
+}, G = (e) => {
+	let t = /* @__PURE__ */ new Map(), n = 0, r = !1, i = async () => {
+		if (t.size === 0) return;
+		let r = t;
+		t = /* @__PURE__ */ new Map(), n = 0;
+		for (let [t, n] of r) try {
+			await e.flush(t, {
+				synced: n.synced,
+				removed: n.removed,
+				dropped: n.dropped
+			}, n.scope);
+		} catch {}
+	}, a = setInterval(() => {
+		i();
+	}, Math.max(1, e.intervalMs));
+	return a.unref?.(), {
+		bump: (a, o, s) => {
+			if (r) return;
+			let c = t.get(a);
+			c === void 0 ? t.set(a, {
+				synced: +(o === "synced"),
+				removed: +(o === "removed"),
+				dropped: +(o === "dropped"),
+				scope: s
+			}) : (o === "synced" ? c.synced += 1 : o === "removed" ? c.removed += 1 : c.dropped += 1, c.scope = s), n += 1, n >= e.maxBuffered && i();
+		},
+		flushNow: i,
+		shutdown: async () => {
+			r || (r = !0, clearInterval(a), await i());
+		},
+		pending: () => n
+	};
+}, K = (e) => (t, n, r) => e().add(t, n, r), q = (e) => e === void 0 || e === "memory" ? "memory" : typeof e.query == "function" ? e.engineKind === "memory" ? "memory" : "custom" : "vendor", ge = class extends Error {
 	_tag = "SearchBackendNotDurable";
 	constructor(e) {
 		super(e), this.name = "SearchBackendNotDurable";
 	}
-}, pe = [
+}, _e = [
 	"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:",
@@ -662,36 +712,36 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (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"), me = [
+].join("\n"), ve = [
 	"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(" "), W = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
+].join(" "), ye = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
 	level: "note",
-	message: me
+	message: ve
 } : {
 	level: "refuse",
-	message: pe
-}, G = (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.`, K = "_voltro_search_drift", q = h(K, {
-	id: p({ prefix: "sdrft" }),
-	indexName: g().maxLength(191),
-	sourceTable: g().maxLength(191),
-	rowId: g().maxLength(191),
-	docId: g().maxLength(191),
-	op: g().maxLength(16),
-	attempts: m().default(0),
-	lastError: g().maxLength(1e3),
-	firstFailedAt: _(),
-	lastFailedAt: _()
-}).unique("bySearchDriftIndexRow", ["indexName", "rowId"]).index("bySearchDriftIndex", ["indexName"]), J = (e, t) => ({
+	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.`, J = "_voltro_search_drift", xe = 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"]), Se = (e, t) => ({
 	table: e,
-	predicate: f("id", t),
+	predicate: h("id", t),
 	order: [],
 	take: 1,
 	skip: void 0,
 	projection: void 0
-}), Y = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), he = (e) => ({
+}), Y = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), Ce = (e) => ({
 	indexName: String(e.indexName),
 	sourceTable: String(e.sourceTable),
 	rowId: String(e.rowId),
@@ -701,7 +751,7 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 	lastError: String(e.lastError ?? ""),
 	firstFailedAt: Y(e.firstFailedAt),
 	lastFailedAt: Y(e.lastFailedAt)
-}), ge = () => {
+}), we = () => {
 	let e = /* @__PURE__ */ new Map(), t = (e, t) => `${e}\u0000${t}`;
 	return {
 		record: async (n) => {
@@ -731,8 +781,8 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			e.delete(t(n, r));
 		}
 	};
-}, _e = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, X = (e, t) => ({
-	table: K,
+}, Te = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, X = (e, t) => ({
+	table: J,
 	predicate: e,
 	order: [{
 		column: "firstFailedAt",
@@ -741,9 +791,9 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 	take: t,
 	skip: void 0,
 	projection: void 0
-}), ve = (e) => ({
+}), Ee = (e) => ({
 	record: async (t) => {
-		let n = /* @__PURE__ */ new Date(), r = _e(), i = await e.insertIgnore(K, {
+		let n = /* @__PURE__ */ new Date(), r = Te(), i = await e.insertIgnore(J, {
 			id: r,
 			indexName: t.indexName,
 			sourceTable: t.sourceTable,
@@ -755,27 +805,27 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			firstFailedAt: n,
 			lastFailedAt: n
 		}, { conflictColumns: ["indexName", "rowId"] });
-		String(i.id) !== r && await e.updateMany(K, {
+		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: f("id", String(i.id)) });
+		}, { where: h("id", String(i.id)) });
 	},
-	list: async (t) => (await e.query(X(void 0, t))).map(he),
+	list: async (t) => (await e.query(X(void 0, t))).map(Ce),
 	summary: async (t) => {
 		let n = (await e.query({
-			...X(f("indexName", t), void 0),
+			...X(h("indexName", t), void 0),
 			order: [],
-			aggregations: [d("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({
-			...X(f("indexName", t), 1),
+			...X(h("indexName", t), 1),
 			order: [{
 				column: "lastFailedAt",
 				direction: "desc"
@@ -787,41 +837,47 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 		};
 	},
 	clear: async (t, n) => {
-		await e.deleteMany(K, { where: u(f("indexName", t), f("rowId", n)) });
+		await e.deleteMany(J, { where: p(h("indexName", t), h("rowId", n)) });
 	}
-}), ye = () => [q], be = (e, t) => {
-	if (e === void 0 || e === "memory") return O();
+}), De = () => [xe], Oe = (e, t) => {
+	if (e === void 0 || e === "memory") return A();
 	if (typeof e.query == "function") return e;
 	let n = e;
-	return n.engine === "typesense" ? ne(n, t) : n.engine === "meilisearch" ? ae(n, t) : n.engine === "algolia" ? N(n, t) : O();
-}, xe = async (e, t, n) => {
+	return n.engine === "typesense" ? oe(n, t) : n.engine === "meilisearch" ? F(n, t) : n.engine === "algolia" ? I(n, t) : A();
+}, ke = async (e, t, n) => {
 	let r = n.map((e) => t.map(e));
 	return r.length > 0 && await e.upsert(t.index, r), r.length;
-}, Se = async (e, t, n) => {
+}, Z = async (e, t, n) => {
 	if (n.op === "delete") {
 		let r = n.old?.id;
 		typeof r == "string" && await e.remove(t.index, [r]);
 		return;
 	}
 	n.new && await e.upsert(t.index, [t.map(n.new)]);
-}, Z = {
+}, Q = {
 	retries: 5,
 	retryBaseDelayMs: 200,
 	retryMaxDelayMs: 1e4,
 	resyncIntervalMs: 6e4,
-	resyncBatchSize: 200
-}, Ce = (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)
-}), we = (e) => e instanceof w ? e : new w({
+	resyncBatchSize: 200,
+	reindexBatchSize: 1e3,
+	statsFlushIntervalMs: 5e3,
+	statsFlushMaxBuffered: 1e3
+}, Ae = (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)
+}), je = (e) => e instanceof E ? e : new E({
 	engine: "unknown",
 	op: "upsert",
 	message: String(e?.message ?? e),
 	transient: !1
-}), Q = (e) => s.exponential(a.millis(e.retryBaseDelayMs), 2).pipe(s.either(s.spaced(a.millis(e.retryMaxDelayMs))), s.intersect(s.recurs(e.retries)), s.whileInput((e) => e.transient)), Te = (e) => {
+}), Me = (e) => d.exponential(s.millis(e.retryBaseDelayMs), 2).pipe(d.either(d.spaced(s.millis(e.retryMaxDelayMs))), d.intersect(d.recurs(e.retries)), d.whileInput((e) => e.transient)), Ne = (e) => {
 	if (!e || e === "memory" || typeof e.query == "function") return;
 	let t = e;
 	try {
@@ -829,80 +885,80 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 	} catch {
 		return;
 	}
-}, Ee = (e, t, n) => {
+}, Pe = (e, t, n) => {
 	let r = n ?? [];
 	return e ? t == null ? null : [...r, {
 		field: e,
 		op: "eq",
 		value: t
 	}] : r;
-}, De = (e) => [
+}, Fe = (e) => [
 	...(e.filters ?? []).map((e) => ["filter", e.field]),
 	...(e.facets ?? []).map((e) => ["facet", e]),
 	...(e.highlight?.fields ?? []).map((e) => ["highlight", e])
-], $ = "@voltro/plugin-search", Oe = (i) => {
-	let a = l({
+], $ = "@voltro/plugin-search", Ie = (o) => {
+	let s = ne({
 		base: $,
-		alias: i.alias,
-		instance: i.name
-	}), s = () => void 0, u = () => void 0, d = Ce(i.sync), f = Q(d), p = be(i.backend, {
-		...i.allowedEngineParams ? { allowEngineParams: i.allowedEngineParams } : {},
-		onWarn: (e, t) => s(e, t)
-	}), m = /* @__PURE__ */ new Map();
-	for (let e of Object.values(i.indexes)) m.set(e.index, e);
-	let h = H(i.backend), g = i.singleProcessMemoryIndex === !0, _ = !1, v, y = {
+		alias: o.alias,
+		instance: o.name
+	}), d = () => void 0, p = () => void 0, m = Ae(o.sync), h = Me(m), g = Oe(o.backend, {
+		...o.allowedEngineParams ? { allowEngineParams: o.allowedEngineParams } : {},
+		onWarn: (e, t) => d(e, t)
+	}), _ = /* @__PURE__ */ new Map();
+	for (let e of Object.values(o.indexes)) _.set(e.index, e);
+	let v = q(o.backend), y = o.singleProcessMemoryIndex === !0, b = !1, x, S = {
 		...n,
 		description: "Full-text search an index (facets/highlight/fuzzy/filters), auto-scoped to the caller tenant.",
 		execute: (n, r) => {
-			let { index: i, q: a, limit: s, offset: c, filters: l, facets: u, highlight: d, fuzziness: f, engineParams: h } = n, g = m.get(i);
-			if (!g) return o.fail(new e({ index: i }));
-			let _ = ee(De({
+			let { index: i, q: a, limit: o, offset: s, filters: l, facets: u, highlight: d, fuzziness: f, engineParams: p } = n, m = _.get(i);
+			if (!m) return c.fail(new e({ index: i }));
+			let h = re(Fe({
 				...l ? { filters: l } : {},
 				...u ? { facets: u } : {},
 				...d ? { highlight: d } : {}
-			}), g.queryableFields);
-			if (_) return o.fail(new t(_));
-			let v = r.request.subject.tenantId ?? null, y = Ee(g.tenantField, v, l);
-			if (y === null) return o.succeed({
+			}), m.queryableFields);
+			if (h) return c.fail(new t(h));
+			let ee = r.request.subject.tenantId ?? null, v = Pe(m.tenantField, ee, l);
+			if (v === null) return c.succeed({
 				hits: [],
 				facets: {}
 			});
-			let b = {
+			let y = {
 				q: a,
-				...s === void 0 ? {} : { limit: s },
-				...c === void 0 ? {} : { offset: c },
-				...y.length > 0 ? { filters: y } : {},
+				...o === void 0 ? {} : { limit: o },
+				...s === void 0 ? {} : { offset: s },
+				...v.length > 0 ? { filters: v } : {},
 				...u && u.length > 0 ? { facets: u } : {},
 				...d ? { highlight: d } : {},
 				...f === void 0 ? {} : { fuzziness: f },
-				...h ? { engineParams: h } : {}
+				...p ? { engineParams: p } : {}
 			};
-			return o.promise(() => p.query(i, b));
+			return c.promise(() => g.query(i, y));
 		}
-	}, b = Te(i.backend), x = [
+	}, C = Ne(o.backend), ie = [
 		"store:changes:read",
 		"store:write",
 		"inspect:read",
 		"inspect:write",
-		...b ? [`network:outbound:${b}`] : []
-	], S = R(), C = ge(), w, T, E = (e, t, n) => o.tryPromise(() => S.bump(e, t, n)).pipe(o.catchAll((n) => o.sync(() => s("search stats bump failed", {
+		...C ? [`network:outbound:${C}`] : []
+	], w = V(), T = we(), E, D, O, k, A = (e, t, n) => k === void 0 ? c.tryPromise(() => w.bump(e, t, n)).pipe(c.catchAll((n) => c.sync(() => d("search stats bump failed", {
 		index: e,
 		kind: t,
 		error: String(n)
-	})))), D = async (e) => {
-		let t = await C.list(e), n = 0, r = 0;
+	})))) : c.sync(() => k.bump(e, t, n)), j = async (e) => {
+		let t = await T.list(e), n = 0, r = 0;
 		for (let e of t) {
-			let t = m.get(e.indexName);
+			let t = _.get(e.indexName);
 			if (!t) {
-				await C.clear(e.indexName, e.rowId);
+				await T.clear(e.indexName, e.rowId);
 				continue;
 			}
 			try {
-				if (!T) throw Error("data store not bound");
-				let r = (await T.query(J(e.sourceTable, e.rowId)))[0];
-				r ? await p.upsert(t.index, [t.map(r)]) : await p.remove(t.index, [e.docId]), await C.clear(e.indexName, e.rowId), n++;
+				if (!D) throw Error("data store not bound");
+				let r = (await D.query(Se(e.sourceTable, e.rowId)))[0];
+				r ? await g.upsert(t.index, [t.map(r)]) : await g.remove(t.index, [e.docId]), await T.clear(e.indexName, e.rowId), n++;
 			} catch (t) {
-				r++, await C.record({
+				r++, await T.record({
 					...e,
 					error: String(t?.message ?? t)
 				}).catch(() => void 0);
@@ -913,29 +969,30 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 			repaired: n,
 			failed: r
 		};
-	}, O = (e) => ({
+	}, M = (e) => ({
 		kind: "json",
 		data: e
-	}), k = (e, t) => ({
+	}), N = (e, t) => ({
 		kind: "json",
 		status: e,
 		data: { error: t }
 	});
-	return c({
-		name: a,
+	return te({
+		name: s,
 		baseName: $,
 		description: "External search index sync (Typesense/Meilisearch/Algolia/memory) via the ChangeEvent tap + a tenant-scoped query route.",
-		permissions: x,
-		routes: [y],
+		permissions: ie,
+		routes: [S],
 		rpcClientDescriptors: r,
 		inspectEndpoints: [
 			{
 				method: "GET",
 				path: "/indexes",
 				description: "Configured indexes + durable, cross-replica sync stats + current index drift.",
-				handler: () => o.promise(async () => {
-					let e = await Promise.all(Object.entries(i.indexes).map(async ([e, t]) => {
-						let n = await S.get(t.index), r = await C.summary(t.index);
+				handler: () => c.promise(async () => {
+					await k?.flushNow();
+					let e = await Promise.all(Object.entries(o.indexes).map(async ([e, t]) => {
+						let n = await w.get(t.index), r = await T.summary(t.index);
 						return {
 							table: e,
 							index: t.index,
@@ -946,15 +1003,15 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 							drifted: r.pending > 0
 						};
 					}));
-					return O({
+					return M({
 						indexes: e,
-						backend: typeof i.backend == "string" ? i.backend : i.backend ? "custom/vendor" : "memory",
-						durable: h !== "memory",
-						singleProcessMemoryIndex: g,
+						backend: typeof o.backend == "string" ? o.backend : o.backend ? "custom/vendor" : "memory",
+						durable: v !== "memory",
+						singleProcessMemoryIndex: y,
 						pendingDrift: e.reduce((e, t) => e + t.pendingDrift, 0),
 						sync: {
-							...d,
-							resyncArmed: w !== void 0
+							...m,
+							resyncArmed: E !== void 0
 						}
 					});
 				})
@@ -963,148 +1020,157 @@ var v = /^[A-Za-z_][A-Za-z0-9_.]*$/, y = (e) => v.test(e), ee = (e, t) => {
 				method: "GET",
 				path: "/drift",
 				description: "The changes that did NOT reach the engine, oldest first (the repair queue).",
-				handler: (e) => o.promise(async () => {
-					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await C.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
-					return O({ entries: n });
+				handler: (e) => c.promise(async () => {
+					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await T.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
+					return M({ entries: n });
 				})
 			},
 			{
 				method: "POST",
 				path: "/resync",
 				description: "Repair drifted rows now — re-reads each from the DB and re-applies it.",
-				handler: (e) => o.promise(async () => {
+				handler: (e) => c.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return k(400, "invalid JSON body");
+						return N(400, "invalid JSON body");
 					}
-					if (!T) return k(503, "data store not bound yet");
+					if (!D) return N(503, "data store not bound yet");
 					try {
-						let e = await D(Math.min(Math.max(1, t.limit ?? d.resyncBatchSize), 1e3));
-						return O({
+						let e = await j(Math.min(Math.max(1, t.limit ?? m.resyncBatchSize), 1e3));
+						return M({
 							ok: !0,
 							...e
 						});
 					} catch (e) {
-						return k(500, e.message);
+						return N(500, e.message);
 					}
 				})
 			},
 			{
 				method: "POST",
 				path: "/reindex",
-				description: "Re-seed an index from the table's current rows.",
-				handler: (e) => o.promise(async () => {
+				description: "Re-seed an index from the table's current rows (streamed in bounded batches).",
+				handler: (e) => c.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return k(400, "invalid JSON body");
+						return N(400, "invalid JSON body");
+					}
+					let n = t.table, r = n ? o.indexes[n] : void 0;
+					if (!n || !r) return N(404, `no index configured for table "${t.table ?? ""}"`);
+					if (!O) return N(503, "data store not bound yet");
+					let s = 0, d = await c.runPromiseExit(ee(O, {
+						table: n,
+						chunkSize: m.reindexBatchSize
+					}).pipe(f.chunks, f.runForEach((e) => c.tryPromise(async () => {
+						s += await ke(g, r, a.toReadonlyArray(e));
+					}))));
+					if (l.isFailure(d)) {
+						let e = i.failureOption(d.cause), t = u.isSome(e) ? e.value : d.cause, n = t.cause ?? t.error ?? t;
+						return N(500, String(n?.message ?? n));
 					}
-					let n = t.table ? i.indexes[t.table] : void 0;
-					if (!t.table || !n) return k(404, `no index configured for table "${t.table ?? ""}"`);
-					if (!T) return k(503, "data store not bound yet");
 					try {
-						let e = await T.query({
-							table: t.table,
-							predicate: void 0,
-							order: [],
-							take: void 0,
-							skip: void 0,
-							projection: void 0
-						}), r = await xe(p, n, e);
-						return await S.recordReindex(n.index, r, (/* @__PURE__ */ new Date()).toISOString()), O({
-							ok: !0,
-							table: t.table,
-							index: n.index,
-							count: r
-						});
+						await w.recordReindex(r.index, s, (/* @__PURE__ */ new Date()).toISOString());
 					} catch (e) {
-						return k(500, e.message);
+						return N(500, e.message);
 					}
+					return M({
+						ok: !0,
+						table: n,
+						index: r.index,
+						count: s
+					});
 				})
 			}
 		],
-		extendSchema: { tables: [...L(), ...ye()] },
+		extendSchema: { tables: [...B(), ...De()] },
 		bindDataStore: (e, t) => {
-			T = e, S = V(e), C = ve(e), h === "memory" && t?.membership !== void 0 && (v = t.membership.onChange((e) => {
-				e.kind === "left" || _ || t.instanceId !== void 0 && e.instanceId === t.instanceId || (_ = !0, s(G(e.instanceId, g), {
+			D = e, O = e, w = W(e), T = Ee(e), v === "memory" && t?.membership !== void 0 && (x = t.membership.onChange((e) => {
+				e.kind === "left" || b || t.instanceId !== void 0 && e.instanceId === t.instanceId || (b = !0, d(be(e.instanceId, y), {
 					instanceId: t.instanceId ?? null,
 					peer: e.instanceId,
-					indexes: Object.keys(i.indexes)
+					indexes: Object.keys(o.indexes)
 				}));
-			})), !(d.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (w = t.scheduleCoordinated("search.resync", d.resyncIntervalMs, async () => {
+			})), !(m.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (E = t.scheduleCoordinated("search.resync", m.resyncIntervalMs, async () => {
 				try {
-					let e = await D(d.resyncBatchSize);
-					return (e.repaired > 0 || e.failed > 0) && u("search: drift repair pass", e), { idle: e.scanned === 0 };
+					let e = await j(m.resyncBatchSize);
+					return (e.repaired > 0 || e.failed > 0) && p("search: drift repair pass", e), { idle: e.scanned === 0 };
 				} catch (e) {
-					return s("search: drift repair pass failed", { error: String(e?.message ?? e) }), { idle: !1 };
+					return d("search: drift repair pass failed", { error: String(e?.message ?? e) }), { idle: !1 };
 				}
 			}));
 		},
 		onChangeEvent: (e) => {
-			let t = i.indexes[e.table];
-			if (!t) return o.void;
-			let n = e.changeScope, r = e.changeScope === "fleet" || e.origin !== "injected", a = e.op === "delete" ? e.old : e.new, c = typeof a?.id == "string" ? a.id : "", l = e.op === "delete" ? "remove" : "upsert", u = () => {
-				if (e.op === "delete" || !e.new) return c;
+			let t = o.indexes[e.table];
+			if (!t) return c.void;
+			let n = e.changeScope, r = e.changeScope === "fleet" || e.origin !== "injected", i = e.op === "delete" ? e.old : e.new, a = typeof i?.id == "string" ? i.id : "", s = e.op === "delete" ? "remove" : "upsert", l = () => {
+				if (e.op === "delete" || !e.new) return a;
 				try {
-					return String(t.map(e.new).id ?? c);
+					return String(t.map(e.new).id ?? a);
 				} catch {
-					return c;
+					return a;
 				}
 			};
-			return o.tryPromise({
-				try: () => Se(p, t, e),
-				catch: we
-			}).pipe(o.retry(f)).pipe(o.matchEffect({
-				onSuccess: () => r ? E(t.index, e.op === "delete" ? "removed" : "synced", n) : o.void,
+			return c.tryPromise({
+				try: () => Z(g, t, e),
+				catch: je
+			}).pipe(c.retry(h)).pipe(c.matchEffect({
+				onSuccess: () => r ? A(t.index, e.op === "delete" ? "removed" : "synced", n) : c.void,
 				onFailure: (r) => {
 					let i = {
 						table: e.table,
 						index: t.index,
 						op: e.op,
-						rowId: c,
+						rowId: a,
 						transient: r.transient,
 						error: r.message
 					};
-					return c === "" ? o.sync(() => s("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(o.zipRight(o.fail(r))) : o.tryPromise(() => C.record({
+					return a === "" ? c.sync(() => d("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(c.zipRight(c.fail(r))) : c.tryPromise(() => T.record({
 						indexName: t.index,
 						sourceTable: e.table,
-						rowId: c,
-						docId: u(),
-						op: l,
+						rowId: a,
+						docId: l(),
+						op: s,
 						error: r.message
-					})).pipe(o.matchEffect({
-						onSuccess: () => E(t.index, "dropped", n).pipe(o.zipRight(o.sync(() => s("search: index drift recorded — will be repaired from the database", i)))),
-						onFailure: (e) => o.sync(() => s("search: change LOST — engine failed and the drift ledger could not record it", {
+					})).pipe(c.matchEffect({
+						onSuccess: () => A(t.index, "dropped", n).pipe(c.zipRight(c.sync(() => d("search: index drift recorded — will be repaired from the database", i)))),
+						onFailure: (e) => c.sync(() => d("search: change LOST — engine failed and the drift ledger could not record it", {
 							...i,
 							ledgerError: String(e)
-						})).pipe(o.zipRight(o.fail(r)))
+						})).pipe(c.zipRight(c.fail(r)))
 					}));
 				}
 			}));
 		},
-		onActivate: (e) => o.suspend(() => {
-			s = (t, n) => e.logger.warn(t, n), u = (t, n) => e.logger.info(t, n);
-			let t = W({
-				backendKind: h,
+		onActivate: (e) => c.suspend(() => {
+			d = (t, n) => e.logger.warn(t, n), p = (t, n) => e.logger.info(t, n);
+			let t = ye({
+				backendKind: v,
 				production: (e.env?.NODE_ENV ?? process.env.NODE_ENV) === "production",
-				singleProcessDeclared: g
+				singleProcessDeclared: y
 			});
-			return t.level === "refuse" ? o.fail(new U(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(i.indexes) }), o.sync(() => {
+			return t.level === "refuse" ? c.fail(new ge(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(o.indexes) }), m.statsFlushIntervalMs > 0 && k === void 0 && (k = G({
+				flush: K(() => w),
+				intervalMs: m.statsFlushIntervalMs,
+				maxBuffered: m.statsFlushMaxBuffered
+			})), c.sync(() => {
 				e.logger.info("search active", {
-					indexes: Object.keys(i.indexes),
-					backend: typeof i.backend == "string" ? i.backend : "custom/vendor",
-					durable: h !== "memory",
-					sync: d
+					indexes: Object.keys(o.indexes),
+					backend: typeof o.backend == "string" ? o.backend : "custom/vendor",
+					durable: v !== "memory",
+					sync: m
 				});
 			}));
 		}),
-		onDeactivate: () => o.sync(() => {
-			w?.stop(), w = void 0, v?.(), v = void 0, _ = !1;
+		onDeactivate: () => c.promise(async () => {
+			E?.stop(), E = void 0, x?.(), x = void 0, b = !1;
+			let e = k;
+			k = void 0, await e?.shutdown();
 		})
 	});
 };
 //#endregion
-export { v as FIELD_NAME_PATTERN, K as SEARCH_DRIFT_TABLE, P as SEARCH_STATS_TABLE, Z as SYNC_DEFAULTS, w as SearchBackendError, U as SearchBackendNotDurable, t as SearchFieldRejected, e as SearchIndexNotFound, N as algoliaBackend, C as allowedEngineParams, Se as applyChange, we as asBackendError, W as auditMemoryBackend, H as backendKindOf, xe as backfillIndex, ve as dataStoreDriftLedger, V as dataStoreStatsStore, J as driftSourceQuery, ye as driftTables, y as isSafeFieldName, ae as meilisearchBackend, O as memoryBackend, ge as memoryDriftLedger, R as memoryStatsStore, G as peerObservedWarning, Ce as resolveSyncOptions, S as sanitizeEngineParams, Ee as scopeSearchFilters, q as searchDriftTable, Oe as searchPlugin, I as searchStatsTable, L as searchTables, Q as syncRetrySchedule, ne as typesenseBackend };
+export { x as FIELD_NAME_PATTERN, J as SEARCH_DRIFT_TABLE, L as SEARCH_STATS_TABLE, Q as SYNC_DEFAULTS, E as SearchBackendError, ge as SearchBackendNotDurable, t as SearchFieldRejected, e as SearchIndexNotFound, I as algoliaBackend, T as allowedEngineParams, Z as applyChange, je as asBackendError, ye as auditMemoryBackend, q as backendKindOf, ke as backfillIndex, Ee as dataStoreDriftLedger, W as dataStoreStatsStore, Se as driftSourceQuery, De as driftTables, S as isSafeFieldName, G as makeSearchStatsBuffer, F as meilisearchBackend, A as memoryBackend, we as memoryDriftLedger, V as memoryStatsStore, be as peerObservedWarning, Ae as resolveSyncOptions, w as sanitizeEngineParams, Pe as scopeSearchFilters, xe as searchDriftTable, Ie as searchPlugin, z as searchStatsTable, B as searchTables, K as statsStoreFlush, Me as syncRetrySchedule, oe as typesenseBackend };