@voltro/plugin-search 0.85.0 → 0.86.0

package/dist/index.js

@@ -1,873 +1,29 @@
-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 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 (!S(r)) return {
-			field: r,
-			where: t,
-			reason: "not-an-identifier"
-		};
-		if (n && !n.has(r)) return {
-			field: r,
-			where: t,
-			reason: "not-queryable"
-		};
-	}
-}, C = {
-	typesense: [
-		"per_page",
-		"page",
-		"offset",
-		"limit",
-		"sort_by",
-		"num_typos",
-		"typo_tokens_threshold",
-		"drop_tokens_threshold",
-		"prefix",
-		"prioritize_exact_match",
-		"highlight_start_tag",
-		"highlight_end_tag",
-		"highlight_affix_num_tokens",
-		"snippet_threshold",
-		"max_facet_values"
-	],
-	meilisearch: [
-		"limit",
-		"offset",
-		"page",
-		"hitsPerPage",
-		"sort",
-		"matchingStrategy",
-		"showRankingScore",
-		"rankingScoreThreshold",
-		"distinct",
-		"attributesToHighlight",
-		"highlightPreTag",
-		"highlightPostTag",
-		"attributesToCrop",
-		"cropLength",
-		"cropMarker",
-		"showMatchesPosition"
-	],
-	algolia: [
-		"hitsPerPage",
-		"page",
-		"offset",
-		"length",
-		"typoTolerance",
-		"minWordSizefor1Typo",
-		"minWordSizefor2Typos",
-		"ignorePlurals",
-		"removeStopWords",
-		"queryType",
-		"distinct",
-		"attributesToHighlight",
-		"attributesToSnippet",
-		"snippetEllipsisText",
-		"highlightPreTag",
-		"highlightPostTag"
-	]
-}, w = {
-	typesense: [
-		"filter_by",
-		"q",
-		"preset",
-		"pinned_hits",
-		"hidden_hits",
-		"enable_overrides",
-		"override_tags",
-		"include_fields",
-		"exclude_fields",
-		"vector_query"
-	],
-	meilisearch: [
-		"filter",
-		"q",
-		"attributesToSearchOn",
-		"attributesToRetrieve",
-		"hybrid",
-		"vector",
-		"federation"
-	],
-	algolia: [
-		"filters",
-		"facetFilters",
-		"numericFilters",
-		"tagFilters",
-		"optionalFilters",
-		"query",
-		"restrictSearchableAttributes",
-		"attributesToRetrieve",
-		"enableRules",
-		"ruleContexts",
-		"similarQuery",
-		"aroundLatLng",
-		"insideBoundingBox"
-	]
-}, T = (e, t, n) => {
-	if (!t) return {
-		params: {},
-		appAllowed: {},
-		dropped: []
-	};
-	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
-	};
-}, 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;
-	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 (u > n) return !1;
-		let f = a;
-		a = o, o = f;
-	}
-	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;
-	}, n = (e, t) => {
-		let n = e[t.field];
-		switch (t.op) {
-			case "eq": return String(n) === String(t.value);
-			case "neq": return String(n) !== String(t.value);
-			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] = [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;
-			}
-		}
-	}, r = (e, t) => !t || t.every((t) => n(e, t)), i = (e) => Object.entries(e).filter(([e]) => e !== "id").map(([e, t]) => [e, String(t)]), a = (e, t, n) => {
-		if (t.length === 0) return !0;
-		for (let [, r] of i(e)) {
-			let e = r.toLowerCase();
-			if (e.includes(t)) return !0;
-			if (n !== void 0 && n !== 0) {
-				let r = n === "auto" ? A(t) : n;
-				for (let n of e.split(/\s+/)) if (k(n, t, r)) return !0;
-			}
-		}
-		return !1;
-	}, o = (e, t, n) => {
-		if (t.length === 0) return {};
-		let r = n.preTag ?? "<mark>", a = n.postTag ?? "</mark>", o = n.fields && n.fields.length > 0 ? new Set(n.fields) : null, s = {}, c = new RegExp(t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), "gi");
-		for (let [n, l] of i(e)) (!o || o.has(n)) && l.toLowerCase().includes(t) && (s[n] = l.replace(c, (e) => `${r}${e}${a}`));
-		return s;
-	};
-	return {
-		engineKind: "memory",
-		upsert: async (e, n) => {
-			let r = t(e);
-			for (let e of n) r.set(e.id, e);
-		},
-		remove: async (e, n) => {
-			let r = t(e);
-			for (let e of n) r.delete(e);
-		},
-		query: async (e, { q: n, limit: i, offset: s, filters: c, facets: l, highlight: u, fuzziness: d }) => {
-			let f = n.trim().toLowerCase(), p = [];
-			for (let n of t(e).values()) r(n, c) && a(n, f, d) && p.push(n);
-			let m = {};
-			if (l) for (let e of l) {
-				let t = {};
-				for (let n of p) {
-					let r = n[e];
-					if (r == null) continue;
-					let i = String(r);
-					t[i] = (t[i] ?? 0) + 1;
-				}
-				m[e] = t;
-			}
-			let h = s ?? 0;
-			return {
-				hits: (i === void 0 ? p.slice(h) : p.slice(h, h + i)).map((e) => u ? {
-					doc: e,
-					highlights: o(e, f, u)
-				} : { doc: e }),
-				facets: m
-			};
-		}
-	};
-}, M = (e) => {
-	if (typeof e == "number") return e;
-	if (typeof e == "boolean") return +!!e;
-	if (typeof e == "string") {
-		let t = Number(e);
-		if (!Number.isNaN(t) && e.trim() !== "") return t;
-		let n = Date.parse(e);
-		return Number.isNaN(n) ? void 0 : n;
-	}
-}, N = async (e, t, n) => {
-	try {
-		return await n();
-	} catch {
-		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
-		});
-	}
-}, 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
-	}), {
-		before: r,
-		after: i
-	};
-}, 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;
-}, 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)}`;
-		case "gt": return `${n}:>${t(e.value)}`;
-		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}:[${O(e.value).map(t).join(",")}]`;
-		case "nin": return `${n}:!=[${O(e.value).map(t).join(",")}]`;
-	}
-}, 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(ae).join(" && ") : void 0, o = async (e, t) => {
-		try {
-			return await t();
-		} catch (t) {
-			throw t instanceof D ? t : new D({
-				engine: "typesense",
-				op: e,
-				message: String(t?.message ?? t),
-				transient: !0
-			});
-		}
-	};
-	return {
-		upsert: (e, t) => o("upsert", async () => {
-			await (await i()).collections(e).documents().import(t, { action: "upsert" });
-		}),
-		remove: (e, t) => o("remove", async () => {
-			await (await i()).collections(e).documents().delete({ filter_by: `id:[${t.map((e) => JSON.stringify(e)).join(",")}]` });
-		}),
-		query: (e, { q: t, limit: r, offset: s, filters: c, facets: l, highlight: u, fuzziness: d, engineParams: f }) => o("query", async () => {
-			let o = await i(), p = n(f), m = {
-				...p.before,
-				q: t || "*",
-				query_by: "*",
-				per_page: r ?? 20,
-				...s ? { offset: s } : {},
-				...a(c) ? { filter_by: a(c) } : {},
-				...l && l.length > 0 ? { facet_by: l.join(",") } : {},
-				...u ? {
-					...u.fields && u.fields.length > 0 ? { highlight_fields: u.fields.join(",") } : { highlight_full_fields: "*" },
-					...u.preTag ? { highlight_start_tag: u.preTag } : {},
-					...u.postTag ? { highlight_end_tag: u.postTag } : {}
-				} : {},
-				...d !== void 0 && d !== "auto" ? { num_typos: Math.min(2, Math.max(0, d)) } : {},
-				...p.after
-			};
-			return se(await o.collections(e).documents().search(m));
-		})
-	};
-}, se = (e) => {
-	let t = (e.hits ?? []).map((e) => {
-		let t = {};
-		for (let n of e.highlights ?? []) {
-			let e = n.snippet ?? n.value;
-			e && (t[n.field] = e);
-		}
-		return Object.keys(t).length > 0 ? {
-			doc: e.document,
-			highlights: t
-		} : { doc: e.document };
-	}), n = {};
-	for (let t of e.facet_counts ?? []) n[t.field_name] = Object.fromEntries(t.counts.map((e) => [e.value, e.count]));
-	return {
-		hits: t,
-		facets: n
-	};
-}, 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)}`;
-		case "gt": return `${n} > ${t(e.value)}`;
-		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 [${O(e.value).map(t).join(", ")}]`;
-		case "nin": return `${n} NOT IN [${O(e.value).map(t).join(", ")}]`;
-	}
-}, 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(ce) : void 0, o = async (e, t) => {
-		try {
-			return await t();
-		} catch (t) {
-			throw t instanceof D ? t : new D({
-				engine: "meilisearch",
-				op: e,
-				message: String(t?.message ?? t),
-				transient: !0
-			});
-		}
-	}, s = async (e, t) => {
-		let n = await (await i()).tasks.waitForTask(t, {
-			timeout: 6e4,
-			interval: 50
-		});
-		if (n.status !== "succeeded") throw new D({
-			engine: "meilisearch",
-			op: e,
-			message: n.error?.message ?? `Meilisearch task ${t.taskUid} ${n.status}`,
-			transient: n.status === "canceled"
-		});
-	};
-	return {
-		upsert: (e, t) => o("upsert", async () => {
-			await s("upsert", await (await i()).index(e).addDocuments([...t]));
-		}),
-		remove: (e, t) => o("remove", async () => {
-			await s("remove", await (await i()).index(e).deleteDocuments([...t]));
-		}),
-		query: (e, { q: t, limit: r, offset: s, filters: c, facets: l, highlight: u, fuzziness: d, engineParams: f }) => o("query", async () => {
-			let o = n(f), p = {
-				...o.before,
-				limit: r ?? 20,
-				...s ? { offset: s } : {},
-				...a(c) ? { filter: a(c) } : {},
-				...l && l.length > 0 ? { facets: [...l] } : {},
-				...u ? {
-					attributesToHighlight: u.fields && u.fields.length > 0 ? [...u.fields] : ["*"],
-					...u.preTag ? { highlightPreTag: u.preTag } : {},
-					...u.postTag ? { highlightPostTag: u.postTag } : {}
-				} : {},
-				...d === 0 ? {
-					rankingScoreThreshold: void 0,
-					typoTolerance: { enabled: !1 }
-				} : {},
-				...o.after
-			};
-			return le(await (await i()).index(e).search(t, p), u);
-		})
-	};
-}, le = (e, t) => ({
-	hits: e.hits.map((e) => {
-		let { _formatted: n, ...r } = e;
-		if (t && n) {
-			let e = {};
-			for (let [t, r] of Object.entries(n)) t !== "id" && (e[t] = String(r));
-			return Object.keys(e).length > 0 ? {
-				doc: r,
-				highlights: e
-			} : { doc: r };
-		}
-		return { doc: r };
-	}),
-	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 D({
-		engine: "algolia",
-		op: "query",
-		message: `range filter on "${e}" needs a numeric value (got ${JSON.stringify(t)})`,
-		transient: !1
-	});
-	return n;
-}, fe = (e) => {
-	let t = [], n = [];
-	for (let r of e ?? []) {
-		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)}`);
-				break;
-			case "neq":
-				t.push(`${e}:-${i(r.value)}`);
-				break;
-			case "in":
-				t.push(O(r.value).map((t) => `${e}:${i(t)}`));
-				break;
-			case "nin":
-				for (let n of O(r.value)) t.push(`${e}:-${i(n)}`);
-				break;
-			case "gt":
-				n.push(`${e} > ${a(r.value)}`);
-				break;
-			case "gte":
-				n.push(`${e} >= ${a(r.value)}`);
-				break;
-			case "lt":
-				n.push(`${e} < ${a(r.value)}`);
-				break;
-			case "lte": n.push(`${e} <= ${a(r.value)}`);
-		}
-	}
-	return {
-		facetFilters: t,
-		numericFilters: n
-	};
-}, 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 D ? t : new D({
-				engine: "algolia",
-				op: e,
-				message: String(t?.message ?? t),
-				transient: !0
-			});
-		}
-	};
-	return {
-		upsert: (e, t) => a("upsert", async () => {
-			await (await i()).saveObjects({
-				indexName: e,
-				objects: t.map((e) => ({
-					...e,
-					objectID: e.id
-				}))
-			});
-		}),
-		remove: (e, t) => a("remove", async () => {
-			await (await i()).deleteObjects({
-				indexName: e,
-				objectIDs: [...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 } = fe(s), p = o ? {
-				offset: o,
-				length: r ?? 20
-			} : { hitsPerPage: r ?? 20 }, m = n(d), h = {
-				...m.before,
-				query: t,
-				...p,
-				...a.length > 0 ? { facetFilters: a } : {},
-				...f.length > 0 ? { numericFilters: f } : {},
-				...c && c.length > 0 ? { facets: [...c] } : {},
-				...l ? {
-					...l.fields && l.fields.length > 0 ? { attributesToHighlight: [...l.fields] } : {},
-					...l.preTag ? { highlightPreTag: l.preTag } : {},
-					...l.postTag ? { highlightPostTag: l.postTag } : {}
-				} : {},
-				...u === 0 ? { typoTolerance: !1 } : {},
-				...m.after
-			};
-			return pe(await (await i()).searchSingleIndex({
-				indexName: e,
-				searchParams: h
-			}), l);
-		})
-	};
-}, pe = (e, t) => ({
-	hits: e.hits.map((e) => {
-		let { _highlightResult: n, ...r } = e;
-		if (t && n) {
-			let e = {};
-			for (let [t, r] of Object.entries(n)) t !== "id" && r?.value && (e[t] = r.value);
-			return Object.keys(e).length > 0 ? {
-				doc: r,
-				highlights: e
-			} : { doc: r };
-		}
-		return { doc: r };
-	}),
-	facets: e.facets ?? {}
-}), R = "_voltro_search_stats", z = () => ({
-	synced: 0,
-	removed: 0,
-	dropped: 0,
-	lastReindexAt: null,
-	lastReindexCount: 0
-}), 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);
-			e.set(n, r === "synced" ? {
-				...i,
-				synced: i.synced + 1
-			} : r === "removed" ? {
-				...i,
-				removed: i.removed + 1
-			} : {
-				...i,
-				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, {
-				...a,
-				synced: a.synced + r,
-				lastReindexAt: i,
-				lastReindexCount: r
-			});
-		},
-		get: async (e) => t(e)
-	};
-}, U = (e) => ({
-	table: R,
-	predicate: e,
-	order: [],
-	take: void 0,
-	skip: void 0,
-	projection: void 0
-}), 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 D ? e : new D({
-				engine: "stats",
-				op: "upsert",
-				message: String(e?.message ?? e),
-				transient: !0
-			});
-		}
-	}, i = (i, a, o, s) => r(async () => {
-		for (let r = 0; r < W; r++) {
-			r > 0 && await new Promise((e) => setTimeout(e, r));
-			let c = await n(i);
-			if (c) {
-				let t = Number(c.synced ?? 0), n = Number(c.removed ?? 0), r = Number(c.dropped ?? 0), i = {
-					synced: t,
-					removed: n,
-					dropped: r,
-					lastReindexAt: c.lastReindexAt ? new Date(c.lastReindexAt).toISOString() : null,
-					lastReindexCount: Number(c.lastReindexCount ?? 0)
-				};
-				if (await e.updateMany("_voltro_search_stats", {
-					...o(i),
-					...a ? { scope: a } : {},
-					updatedAt: /* @__PURE__ */ new Date()
-				}, { where: p(h("id", String(c.id)), h("synced", t), h("removed", n), h("dropped", r)) }) === 1) return;
-			} else {
-				let n = me(), r = await e.insertIgnore(R, {
-					id: n,
-					indexName: i,
-					replicaId: t,
-					synced: 0,
-					removed: 0,
-					dropped: 0,
-					scope: a ?? "local",
-					lastReindexAt: null,
-					lastReindexCount: 0,
-					updatedAt: /* @__PURE__ */ new Date(),
-					...s
-				}, { conflictColumns: ["indexName", "replicaId"] });
-				if (String(r.id) === n) return;
-			}
-		}
-		throw new D({
-			engine: "stats",
-			op: "upsert",
-			message: `search stats: contention on (${i}, ${t}) exceeded ${W} 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),
-			lastReindexCount: t
-		}), {
-			synced: t,
-			lastReindexAt: new Date(n),
-			lastReindexCount: t
-		}),
-		get: (t) => r(async () => {
-			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);
-					t = r ? Math.max(t, n) : t + n;
-				}
-				return t;
-			}, a = null, o = 0;
-			for (let e of n) {
-				let t = e.lastReindexAt ? new Date(e.lastReindexAt).toISOString() : null;
-				t && (a === null || t > a) && (a = t, o = Number(e.lastReindexCount ?? 0));
-			}
-			return {
-				...z(),
-				synced: i("synced"),
-				removed: i("removed"),
-				dropped: i("dropped"),
-				lastReindexAt: a,
-				lastReindexCount: o
-			};
-		})
-	};
-}, K = (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
-	};
-}, 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";
-	}
-}, 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:",
-	"  • every replica holds a different index, so a result depends on which replica served you;",
-	"  • the index starts EMPTY after every restart/deploy, and nothing re-seeds it automatically.",
-	"",
-	"Configure a durable engine in app.config.ts:",
-	"  searchPlugin({ backend: { engine: 'typesense',    url: …, apiKey: … }, indexes })",
-	"  searchPlugin({ backend: { engine: 'meilisearch',  url: …, apiKey: … }, indexes })",
-	"  searchPlugin({ backend: { engine: 'algolia',      appId: …, apiKey: … }, indexes })",
-	"or pass your own `SearchBackend` implementation.",
-	"",
-	"If this deployment really is ONE process that re-seeds its index at startup",
-	"(a `*.startup.tsx` calling `backfillIndex`), say so explicitly:",
-	"  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"), 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(" "), be = (e) => e.backendKind !== "memory" || !e.production ? { level: "quiet" } : e.singleProcessDeclared ? {
-	level: "note",
-	message: ye
-} : {
-	level: "refuse",
-	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: h("id", t),
-	order: [],
-	take: 1,
-	skip: void 0,
-	projection: void 0
-}), 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),
-	docId: String(e.docId),
-	op: e.op === "remove" ? "remove" : "upsert",
-	attempts: Number(e.attempts ?? 0),
-	lastError: String(e.lastError ?? ""),
-	firstFailedAt: Y(e.firstFailedAt),
-	lastFailedAt: Y(e.lastFailedAt)
-}), Te = () => {
-	let e = /* @__PURE__ */ new Map(), t = (e, t) => `${e}\u0000${t}`;
-	return {
-		record: async (n) => {
-			let r = (/* @__PURE__ */ new Date()).toISOString(), i = e.get(t(n.indexName, n.rowId));
-			e.set(t(n.indexName, n.rowId), {
-				indexName: n.indexName,
-				sourceTable: n.sourceTable,
-				rowId: n.rowId,
-				docId: n.docId,
-				op: n.op,
-				attempts: (i?.attempts ?? 0) + 1,
-				lastError: n.error,
-				firstFailedAt: i?.firstFailedAt ?? r,
-				lastFailedAt: r
-			});
-		},
-		list: async (t) => [...e.values()].sort((e, t) => e.firstFailedAt.localeCompare(t.firstFailedAt)).slice(0, t),
-		summary: async (t) => {
-			let n = [...e.values()].filter((e) => e.indexName === t), r = null;
-			for (let e of n) (r === null || e.lastFailedAt > r) && (r = e.lastFailedAt);
-			return {
-				pending: n.length,
-				lastFailedAt: r
-			};
-		},
-		clear: async (n, r) => {
-			e.delete(t(n, r));
-		}
-	};
-}, Ee = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, X = (e, t) => ({
-	table: J,
-	predicate: e,
-	order: [{
-		column: "firstFailedAt",
-		direction: "asc"
-	}],
-	take: t,
-	skip: void 0,
-	projection: void 0
-}), De = (e) => ({
-	record: async (t) => {
-		let n = /* @__PURE__ */ new Date(), r = Ee(), i = await e.insertIgnore(J, {
-			id: r,
-			indexName: t.indexName,
-			sourceTable: t.sourceTable,
-			rowId: t.rowId,
-			docId: t.docId,
-			op: t.op,
-			attempts: 1,
-			lastError: t.error.slice(0, 1e3),
-			firstFailedAt: n,
-			lastFailedAt: n
-		}, { conflictColumns: ["indexName", "rowId"] });
-		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: h("id", String(i.id)) });
-	},
-	list: async (t) => (await e.query(X(void 0, t))).map(we),
-	summary: async (t) => {
-		let n = (await e.query({
-			...X(h("indexName", t), void 0),
-			order: [],
-			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(h("indexName", t), 1),
-			order: [{
-				column: "lastFailedAt",
-				direction: "desc"
-			}]
-		});
-		return {
-			pending: r,
-			lastFailedAt: i[0] ? Y(i[0].lastFailedAt) : null
-		};
-	},
-	clear: async (t, 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 j();
+import { SearchFieldRejected as e, SearchIndexNotFound as t } from "./errors.js";
+import { BASE_NAME as n, queryDescriptor as r, searchRpcClientImports as i } from "./rpc.js";
+import { FIELD_NAME_PATTERN as a, allowedEngineParams as o, firstRejectedField as s, isSafeFieldName as c, sanitizeEngineParams as l } from "./sanitize.js";
+import { SearchBackendError as u, algoliaBackend as d, meilisearchBackend as f, memoryBackend as p, typesenseBackend as m } from "./backend.js";
+import { SEARCH_STATS_TABLE as h, dataStoreStatsStore as g, memoryStatsStore as _, searchStatsTable as v, searchTables as y } from "./statsStore.js";
+import { makeSearchStatsBuffer as b, statsStoreFlush as x } from "./statsBuffer.js";
+import { SearchBackendNotDurable as S, auditMemoryBackend as C, backendKindOf as w, peerObservedWarning as T } from "./memoryGuard.js";
+import { SEARCH_DRIFT_TABLE as E, dataStoreDriftLedger as D, driftSourceQuery as O, driftTables as k, memoryDriftLedger as A, searchDriftTable as j } from "./drift.js";
+import { Cause as ee, Duration as M, Effect as N, Exit as P, Option as F, Schedule as I, Stream as L } from "effect";
+import { streamTable as te } from "@voltro/database";
+import { definePlugin as ne, pluginInstanceName as re } from "@voltro/protocol";
+//#region src/index.ts
+var ie = (e, t) => {
+	if (e === void 0 || e === "memory") return p();
 	if (typeof e.query == "function") return e;
 	let n = e;
-	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) => {
+	return n.engine === "typesense" ? m(n, t) : n.engine === "meilisearch" ? f(n, t) : n.engine === "algolia" ? d(n, t) : p();
+}, R = async (e, t, n) => {
 	let r = n.map((e) => t.map(e));
 	return r.length > 0 && await e.upsert(t.index, r), r.length;
-}, je = 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 = {
+	} else n.new && await e.upsert(t.index, [t.map(n.new)]);
+}, B = {
 	retries: 5,
 	retryBaseDelayMs: 200,
 	retryMaxDelayMs: 1e4,
@@ -876,21 +32,21 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 	reindexBatchSize: 1e3,
 	statsFlushIntervalMs: 5e3,
 	statsFlushMaxBuffered: 1e3
-}, 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({
+}, V = (e) => ({
+	retries: Math.max(0, e?.retries ?? B.retries),
+	retryBaseDelayMs: Math.max(1, e?.retryBaseDelayMs ?? B.retryBaseDelayMs),
+	retryMaxDelayMs: Math.max(1, e?.retryMaxDelayMs ?? B.retryMaxDelayMs),
+	resyncIntervalMs: Math.max(0, e?.resyncIntervalMs ?? B.resyncIntervalMs),
+	resyncBatchSize: Math.max(1, e?.resyncBatchSize ?? B.resyncBatchSize),
+	reindexBatchSize: Math.max(1, e?.reindexBatchSize ?? B.reindexBatchSize),
+	statsFlushIntervalMs: Math.max(0, e?.statsFlushIntervalMs ?? B.statsFlushIntervalMs),
+	statsFlushMaxBuffered: Math.max(1, e?.statsFlushMaxBuffered ?? B.statsFlushMaxBuffered)
+}), H = (e) => e instanceof u ? e : new u({
 	engine: "unknown",
 	op: "upsert",
 	message: String(e?.message ?? e),
 	transient: !1
-}), 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) => {
+}), U = (e) => I.max([I.min([I.exponential(M.millis(e.retryBaseDelayMs), 2), I.spaced(M.millis(e.retryMaxDelayMs))]), I.recurs(e.retries)]).pipe(I.while(({ input: e }) => e.transient)), ae = (e) => {
 	if (!e || e === "memory" || typeof e.query == "function") return;
 	let t = e;
 	try {
@@ -898,80 +54,77 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 	} catch {
 		return;
 	}
-}, Fe = (e, t, n) => {
+}, W = (e, t, n) => {
 	let r = n ?? [];
 	return e ? t == null ? null : [...r, {
 		field: e,
 		op: "eq",
 		value: t
 	}] : r;
-}, Ie = (e) => [
+}, oe = (e) => [
 	...(e.filters ?? []).map((e) => ["filter", e.field]),
 	...(e.facets ?? []).map((e) => ["facet", e]),
 	...(e.highlight?.fields ?? []).map((e) => ["highlight", e])
-], $ = i, Le = (i) => {
-	let o = ne({
-		base: $,
-		alias: i.alias,
-		instance: i.name
-	}), 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) => 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 = {
+], G = n, K = (n) => {
+	let a = re({
+		base: G,
+		alias: n.alias,
+		instance: n.name
+	}), o = () => void 0, c = () => void 0, l = V(n.sync), u = U(l), d = ie(n.backend, {
+		...n.allowedEngineParams ? { allowEngineParams: n.allowedEngineParams } : {},
+		onWarn: (e, t) => o(e, t)
+	}), f = /* @__PURE__ */ new Map();
+	for (let e of Object.values(n.indexes)) f.set(e.index, e);
+	let p = w(n.backend), m = n.singleProcessMemoryIndex === !0, h = !1, v, E = {
 		...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: 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({
+		execute: (n, r) => {
+			let { index: i, q: a, limit: o, offset: c, filters: l, facets: u, highlight: p, fuzziness: m, engineParams: h } = n, g = f.get(i);
+			if (!g) return N.fail(new t({ index: i }));
+			let _ = s(oe({
 				...l ? { filters: l } : {},
 				...u ? { facets: u } : {},
-				...d ? { highlight: d } : {}
-			}), m.queryableFields);
-			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({
+				...p ? { highlight: p } : {}
+			}), g.queryableFields);
+			if (_) return N.fail(new e(_));
+			let v = r.request.subject.tenantId ?? null, y = W(g.tenantField, v, l);
+			if (y === null) return N.succeed({
 				hits: [],
 				facets: {}
 			});
-			let y = {
+			let b = {
 				q: a,
 				...o === void 0 ? {} : { limit: o },
-				...s === void 0 ? {} : { offset: s },
-				...v.length > 0 ? { filters: v } : {},
+				...c === void 0 ? {} : { offset: c },
+				...y.length > 0 ? { filters: y } : {},
 				...u && u.length > 0 ? { facets: u } : {},
-				...d ? { highlight: d } : {},
-				...f === void 0 ? {} : { fuzziness: f },
-				...p ? { engineParams: p } : {}
+				...p ? { highlight: p } : {},
+				...m === void 0 ? {} : { fuzziness: m },
+				...h ? { engineParams: h } : {}
 			};
-			return c.promise(() => h.query(i, y));
+			return N.promise(() => d.query(i, b));
 		}
-	}, x = Pe(i.backend), S = [
+	}, j = ae(n.backend), M = [
 		"store:changes:read",
 		"store:write",
 		"inspect:read",
 		"inspect:write",
-		...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", {
+		...j ? [`network:outbound:${j}`] : []
+	], I = _(), B = A(), K, q, J, Y, X = (e, t, n) => Y === void 0 ? N.tryPromise(() => I.bump(e, t, n)).pipe(N.catch((n) => N.sync(() => o("search stats bump failed", {
 		index: e,
 		kind: t,
 		error: String(n)
-	})))) : c.sync(() => O.bump(e, t, n)), A = async (e) => {
-		let t = await w.list(e), n = 0, r = 0;
+	})))) : N.sync(() => Y.bump(e, t, n)), Z = async (e) => {
+		let t = await B.list(e), n = 0, r = 0;
 		for (let e of t) {
-			let t = g.get(e.indexName);
-			if (!t) {
-				await w.clear(e.indexName, e.rowId);
-				continue;
-			}
-			try {
-				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++;
+			let t = f.get(e.indexName);
+			if (!t) await B.clear(e.indexName, e.rowId);
+			else try {
+				if (!q) throw Error("data store not bound");
+				let r = (await q.query(O(e.sourceTable, e.rowId)))[0];
+				r ? await d.upsert(t.index, [t.map(r)]) : await d.remove(t.index, [e.docId]), await B.clear(e.indexName, e.rowId), n++;
 			} catch (t) {
-				r++, await w.record({
+				r++, await B.record({
 					...e,
 					error: String(t?.message ?? t)
 				}).catch(() => void 0);
@@ -982,31 +135,31 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 			repaired: n,
 			failed: r
 		};
-	}, j = (e) => ({
+	}, Q = (e) => ({
 		kind: "json",
 		data: e
-	}), M = (e, t) => ({
+	}), $ = (e, t) => ({
 		kind: "json",
 		status: e,
 		data: { error: t }
 	});
-	return te({
-		name: o,
-		baseName: $,
+	return ne({
+		name: a,
+		baseName: G,
 		description: "External search index sync (Typesense/Meilisearch/Algolia/memory) via the ChangeEvent tap + a tenant-scoped query route.",
-		permissions: S,
-		routes: [re],
-		rpcClientDescriptors: t,
+		permissions: M,
+		routes: [E],
+		rpcClientDescriptors: i,
 		inspectEndpoints: [
 			{
 				method: "GET",
 				path: "/indexes",
 				scope: "process",
 				description: "Configured indexes + durable, cross-replica sync stats + current index drift.",
-				handler: () => c.promise(async () => {
-					await O?.flushNow();
-					let e = await Promise.all(Object.entries(i.indexes).map(async ([e, t]) => {
-						let n = await C.get(t.index), r = await w.summary(t.index);
+				handler: () => N.promise(async () => {
+					await Y?.flushNow();
+					let e = await Promise.all(Object.entries(n.indexes).map(async ([e, t]) => {
+						let n = await I.get(t.index), r = await B.summary(t.index);
 						return {
 							table: e,
 							index: t.index,
@@ -1017,15 +170,15 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 							drifted: r.pending > 0
 						};
 					}));
-					return j({
+					return Q({
 						indexes: e,
-						backend: typeof i.backend == "string" ? i.backend : i.backend ? "custom/vendor" : "memory",
-						durable: _ !== "memory",
-						singleProcessMemoryIndex: v,
+						backend: typeof n.backend == "string" ? n.backend : n.backend ? "custom/vendor" : "memory",
+						durable: p !== "memory",
+						singleProcessMemoryIndex: m,
 						pendingDrift: e.reduce((e, t) => e + t.pendingDrift, 0),
 						sync: {
-							...p,
-							resyncArmed: T !== void 0
+							...l,
+							resyncArmed: K !== void 0
 						}
 					});
 				})
@@ -1035,34 +188,34 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 				path: "/drift",
 				scope: "process",
 				description: "The changes that did NOT reach the engine, oldest first (the repair queue).",
-				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 });
+				handler: (e) => N.promise(async () => {
+					let t = Number(new URL(e.url, "http://localhost").searchParams.get("limit") ?? 100), n = await B.list(Number.isFinite(t) && t > 0 ? Math.min(t, 1e3) : 100);
+					return Q({ entries: n });
 				})
 			},
 			{
 				method: "POST",
 				path: "/resync",
 				description: "Repair drifted rows now — re-reads each from the DB and re-applies it.",
-				handler: (e) => c.promise(async () => {
+				handler: (e) => N.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return M(400, "invalid JSON body");
+						return $(400, "invalid JSON body");
 					}
-					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");
+					if (typeof t != "object" || !t || Array.isArray(t)) return $(400, "expected a JSON object");
+					let n = "limit" in t ? t.limit : l.resyncBatchSize;
+					if (typeof n != "number" || !Number.isSafeInteger(n) || n < 1) return $(400, "limit must be a positive integer");
+					if (!q) return $(503, "data store not bound yet");
 					try {
-						let e = await A(Math.min(n, 1e3));
-						return j({
+						let e = await Z(Math.min(n, 1e3));
+						return Q({
 							ok: !0,
 							...e
 						});
 					} catch (e) {
-						return M(500, e.message);
+						return $(500, e.message);
 					}
 				})
 			},
@@ -1070,128 +223,128 @@ var x = /^[A-Za-z_][A-Za-z0-9_.]*$/, S = (e) => x.test(e), ie = (e, t) => {
 				method: "POST",
 				path: "/reindex",
 				description: "Re-seed an index from the table's current rows (streamed in bounded batches).",
-				handler: (e) => c.promise(async () => {
+				handler: (e) => N.promise(async () => {
 					let t;
 					try {
 						t = JSON.parse(e.body || "{}");
 					} catch {
-						return M(400, "invalid JSON body");
+						return $(400, "invalid JSON body");
 					}
-					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 M(400, "table must be a non-empty string");
-					let r = Object.hasOwn(i.indexes, n) ? i.indexes[n] : void 0;
-					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: p.reindexBatchSize
-					}).pipe(f.chunks, f.runForEach((e) => c.tryPromise(async () => {
-						o += await Ae(h, r, e);
+					if (typeof t != "object" || !t || Array.isArray(t)) return $(400, "expected a JSON object");
+					let r = "table" in t ? t.table : void 0;
+					if (typeof r != "string" || r.trim() === "") return $(400, "table must be a non-empty string");
+					let i = Object.hasOwn(n.indexes, r) ? n.indexes[r] : void 0;
+					if (!i) return $(404, `no index configured for table "${r}"`);
+					if (!J) return $(503, "data store not bound yet");
+					let a = 0, o = await N.runPromiseExit(te(J, {
+						table: r,
+						chunkSize: l.reindexBatchSize
+					}).pipe(L.chunks, L.runForEach((e) => N.tryPromise(async () => {
+						a += await R(d, i, e);
 					}))));
-					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));
+					if (P.isFailure(o)) {
+						let e = ee.findErrorOption(o.cause), t = F.isSome(e) ? e.value : o.cause, n = t.cause ?? t.error ?? t;
+						return $(500, String(n?.message ?? n));
 					}
 					try {
-						await C.recordReindex(r.index, o, (/* @__PURE__ */ new Date()).toISOString());
+						await I.recordReindex(i.index, a, (/* @__PURE__ */ new Date()).toISOString());
 					} catch (e) {
-						return M(500, e.message);
+						return $(500, e.message);
 					}
-					return j({
+					return Q({
 						ok: !0,
-						table: n,
-						index: r.index,
-						count: o
+						table: r,
+						index: i.index,
+						count: a
 					});
 				})
 			}
 		],
-		extendSchema: { tables: [...V(), ...Oe()] },
+		extendSchema: { tables: [...y(), ...k()] },
 		bindDataStore: (e, t) => {
-			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), {
+			q = e, J = e, I = g(e, ...t?.instanceId === void 0 ? [] : [t.instanceId]), B = D(e), p === "memory" && t?.membership !== void 0 && (v = t.membership.onChange((e) => {
+				e.kind === "left" || h || (t.instanceId === void 0 || e.instanceId !== t.instanceId) && (h = !0, o(T(e.instanceId, m), {
 					instanceId: t.instanceId ?? null,
 					peer: e.instanceId,
-					indexes: Object.keys(i.indexes)
+					indexes: Object.keys(n.indexes)
 				}));
-			})), !(p.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (T = t.scheduleCoordinated("search.resync", p.resyncIntervalMs, async () => {
+			})), !(l.resyncIntervalMs <= 0 || t?.scheduleCoordinated === void 0) && (K = t.scheduleCoordinated("search.resync", l.resyncIntervalMs, async () => {
 				try {
-					let e = await A(p.resyncBatchSize);
-					return (e.repaired > 0 || e.failed > 0) && d("search: drift repair pass", e), { idle: e.scanned === 0 };
+					let e = await Z(l.resyncBatchSize);
+					return (e.repaired > 0 || e.failed > 0) && c("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 o("search: drift repair pass failed", { error: String(e?.message ?? e) }), { idle: !1 };
 				}
 			}));
 		},
 		onChangeEvent: (e) => {
-			let t = i.indexes[e.table];
-			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;
+			let t = n.indexes[e.table];
+			if (!t) return N.void;
+			let r = e.changeScope, i = e.changeScope === "fleet" || e.origin !== "injected", a = e.op === "delete" ? e.old : e.new, s = typeof a?.id == "string" ? a.id : "", c = e.op === "delete" ? "remove" : "upsert", l = () => {
+				if (e.op === "delete" || !e.new) return s;
 				try {
-					return String(t.map(e.new).id ?? o);
+					return String(t.map(e.new).id ?? s);
 				} catch {
-					return o;
+					return s;
 				}
 			};
-			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) => {
+			return N.tryPromise({
+				try: () => z(d, t, e),
+				catch: H
+			}).pipe(N.retry(u)).pipe(N.matchEffect({
+				onSuccess: () => i ? X(t.index, e.op === "delete" ? "removed" : "synced", r) : N.void,
+				onFailure: (n) => {
 					let i = {
 						table: e.table,
 						index: t.index,
 						op: e.op,
-						rowId: o,
-						transient: r.transient,
-						error: r.message
+						rowId: s,
+						transient: n.transient,
+						error: n.message
 					};
-					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({
+					return s === "" ? N.sync(() => o("search: change not indexed and NOT recoverable (row has no id)", i)).pipe(N.andThen(N.fail(n))) : N.tryPromise(() => B.record({
 						indexName: t.index,
 						sourceTable: e.table,
-						rowId: o,
-						docId: u(),
-						op: l,
-						error: r.message
-					})).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", {
+						rowId: s,
+						docId: l(),
+						op: c,
+						error: n.message
+					})).pipe(N.matchEffect({
+						onSuccess: () => X(t.index, "dropped", r).pipe(N.andThen(N.sync(() => o("search: index drift recorded — will be repaired from the database", i)))),
+						onFailure: (e) => N.sync(() => o("search: change LOST — engine failed and the drift ledger could not record it", {
 							...i,
 							ledgerError: String(e)
-						})).pipe(c.andThen(c.fail(r)))
+						})).pipe(N.andThen(N.fail(n)))
 					}));
 				}
 			}));
 		},
-		onActivate: (e) => c.suspend(() => {
-			s = (t, n) => e.logger.warn(t, n), d = (t, n) => e.logger.info(t, n);
-			let t = be({
-				backendKind: _,
+		onActivate: (e) => N.suspend(() => {
+			o = (t, n) => e.logger.warn(t, n), c = (t, n) => e.logger.info(t, n);
+			let t = C({
+				backendKind: p,
 				production: (e.env?.NODE_ENV ?? process.env.NODE_ENV) === "production",
-				singleProcessDeclared: v
+				singleProcessDeclared: m
 			});
-			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(() => {
+			return t.level === "refuse" ? N.fail(new S(t.message)) : (t.level === "note" && e.logger.info(t.message, { indexes: Object.keys(n.indexes) }), l.statsFlushIntervalMs > 0 && Y === void 0 && (Y = b({
+				flush: x(() => I),
+				intervalMs: l.statsFlushIntervalMs,
+				maxBuffered: l.statsFlushMaxBuffered
+			})), N.sync(() => {
 				e.logger.info("search active", {
-					indexes: Object.keys(i.indexes),
-					backend: typeof i.backend == "string" ? i.backend : "custom/vendor",
-					durable: _ !== "memory",
-					sync: p
+					indexes: Object.keys(n.indexes),
+					backend: typeof n.backend == "string" ? n.backend : "custom/vendor",
+					durable: p !== "memory",
+					sync: l
 				});
 			}));
 		}),
-		onDeactivate: () => c.promise(async () => {
-			T?.stop(), T = void 0, b?.(), b = void 0, y = !1;
-			let e = O;
-			O = void 0, await e?.shutdown();
+		onDeactivate: () => N.promise(async () => {
+			K?.stop(), K = void 0, v?.(), v = void 0, h = !1;
+			let e = Y;
+			Y = void 0, await e?.shutdown();
 		})
 	});
 };
 //#endregion
-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 };
+export { a as FIELD_NAME_PATTERN, E as SEARCH_DRIFT_TABLE, h as SEARCH_STATS_TABLE, B as SYNC_DEFAULTS, u as SearchBackendError, S as SearchBackendNotDurable, e as SearchFieldRejected, t as SearchIndexNotFound, d as algoliaBackend, o as allowedEngineParams, z as applyChange, H as asBackendError, C as auditMemoryBackend, w as backendKindOf, R as backfillIndex, D as dataStoreDriftLedger, g as dataStoreStatsStore, O as driftSourceQuery, k as driftTables, c as isSafeFieldName, b as makeSearchStatsBuffer, f as meilisearchBackend, p as memoryBackend, A as memoryDriftLedger, _ as memoryStatsStore, T as peerObservedWarning, V as resolveSyncOptions, l as sanitizeEngineParams, W as scopeSearchFilters, j as searchDriftTable, K as searchPlugin, v as searchStatsTable, y as searchTables, x as statsStoreFlush, U as syncRetrySchedule, m as typesenseBackend };