@voltro/plugin-search 0.84.0 → 0.86.0

package/THIRD-PARTY-NOTICES.md

@@ -1,11 +1,11 @@
 # Third-Party Notices — @voltro/plugin-search
 
-This package depends on the open-source software listed below. Each is the
+This package uses the open-source software listed below. Each is the
 property of its respective copyright holders and is used under the terms of
 its license. This file is provided for attribution; it grants no rights in
 @voltro/plugin-search itself, which is proprietary (see LICENSE).
 
-Generated from the resolved runtime dependency closure (59 packages).
+Generated from the resolved runtime dependency closure (56 packages).
 
 ---
 
@@ -401,62 +401,6 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 ```
 
-## @effect/experimental@0.61.1
-
-License: MIT
-
-```
-MIT License
-
-Copyright (c) 2023-present The Contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-```
-
-## @effect/sql@0.52.1
-
-License: MIT
-
-```
-MIT License
-
-Copyright (c) 2023-present The Contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-```
-
 ## @tanstack/devtools-event-client@0.4.4
 
 License: MIT
@@ -919,7 +863,7 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 ```
 
-## follow-redirects@1.16.0
+## follow-redirects@1.16.1
 
 License: MIT
 
@@ -1198,34 +1142,6 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 ```
 
-## layerr@3.0.0
-
-License: MIT
-
-```
-MIT License
-
-Copyright (c) 2020 Perry Mitchell
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-```
-
 ## loglevel@1.9.2
 
 License: MIT
@@ -1838,14 +1754,14 @@ Apache License
    limitations under the License.
 ```
 
-## ulidx@2.4.1
+## ulid@3.0.2
 
 License: MIT
 
 ```
-MIT License
+The MIT License (MIT)
 
-Copyright (c) 2021 Perry Mitchell
+Copyright (c) 2017 Alizain Feerasta
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/dist/backend.js

@@ -0,0 +1,398 @@
+import { isSafeFieldName as e, sanitizeEngineParams as t } from "./sanitize.js";
+import { Data as n } from "effect";
+//#region src/backend.ts
+var r = class extends n.TaggedError("SearchBackendError") {}, i = (e) => Array.isArray(e) ? e : [e], a = (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;
+}, o = (e) => e.length <= 4 ? 1 : 2, s = () => {
+	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 i(t.value).some((e) => String(n) === String(e));
+			case "nin": return i(t.value).every((e) => String(n) !== String(e));
+			case "gt":
+			case "gte":
+			case "lt":
+			case "lte": {
+				let [e, r] = [c(n), c(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)), s = (e) => Object.entries(e).filter(([e]) => e !== "id").map(([e, t]) => [e, String(t)]), l = (e, t, n) => {
+		if (t.length === 0) return !0;
+		for (let [, r] of s(e)) {
+			let e = r.toLowerCase();
+			if (e.includes(t)) return !0;
+			if (n !== void 0 && n !== 0) {
+				let r = n === "auto" ? o(t) : n;
+				for (let n of e.split(/\s+/)) if (a(n, t, r)) return !0;
+			}
+		}
+		return !1;
+	}, u = (e, t, n) => {
+		if (t.length === 0) return {};
+		let r = n.preTag ?? "<mark>", i = n.postTag ?? "</mark>", a = n.fields && n.fields.length > 0 ? new Set(n.fields) : null, o = {}, c = new RegExp(t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), "gi");
+		for (let [n, l] of s(e)) (!a || a.has(n)) && l.toLowerCase().includes(t) && (o[n] = l.replace(c, (e) => `${r}${e}${i}`));
+		return o;
+	};
+	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: a, filters: o, facets: s, highlight: c, fuzziness: d }) => {
+			let f = n.trim().toLowerCase(), p = [];
+			for (let n of t(e).values()) r(n, o) && l(n, f, d) && p.push(n);
+			let m = {};
+			if (s) for (let e of s) {
+				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 = a ?? 0;
+			return {
+				hits: (i === void 0 ? p.slice(h) : p.slice(h, h + i)).map((e) => c ? {
+					doc: e,
+					highlights: u(e, f, c)
+				} : { doc: e }),
+				facets: m
+			};
+		}
+	};
+}, c = (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;
+	}
+}, l = async (e, t, n) => {
+	try {
+		return await n();
+	} catch {
+		throw new r({
+			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
+		});
+	}
+}, u = (e, n) => (r) => {
+	let { params: i, appAllowed: a, dropped: o } = t(e, r, n.allowEngineParams);
+	return o.length > 0 && n.onWarn?.("search dropped disallowed engineParams", {
+		engine: e,
+		keys: o
+	}), {
+		before: i,
+		after: a
+	};
+}, d = (t, n) => {
+	if (!e(n)) throw new r({
+		engine: t,
+		op: "query",
+		message: `filter field "${n}" is not a plain field path (^[A-Za-z_][A-Za-z0-9_.]*$)`,
+		transient: !1
+	});
+	return n;
+}, f = (e) => {
+	let t = (e) => JSON.stringify(e), n = d("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}:[${i(e.value).map(t).join(",")}]`;
+		case "nin": return `${n}:!=[${i(e.value).map(t).join(",")}]`;
+	}
+}, p = (e, t = {}) => {
+	let n = u("typesense", t), i, a = async () => (i ||= l("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
+		});
+	}), i), o = (e) => e && e.length > 0 ? e.map(f).join(" && ") : void 0, s = async (e, t) => {
+		try {
+			return await t();
+		} catch (t) {
+			throw t instanceof r ? t : new r({
+				engine: "typesense",
+				op: e,
+				message: String(t?.message ?? t),
+				transient: !0
+			});
+		}
+	};
+	return {
+		upsert: (e, t) => s("upsert", async () => {
+			await (await a()).collections(e).documents().import(t, { action: "upsert" });
+		}),
+		remove: (e, t) => s("remove", async () => {
+			await (await a()).collections(e).documents().delete({ filter_by: `id:[${t.map((e) => JSON.stringify(e)).join(",")}]` });
+		}),
+		query: (e, { q: t, limit: r, offset: i, filters: c, facets: l, highlight: u, fuzziness: d, engineParams: f }) => s("query", async () => {
+			let s = await a(), p = n(f), h = {
+				...p.before,
+				q: t || "*",
+				query_by: "*",
+				per_page: r ?? 20,
+				...i ? { offset: i } : {},
+				...o(c) ? { filter_by: o(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 m(await s.collections(e).documents().search(h));
+		})
+	};
+}, m = (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
+	};
+}, h = (e) => {
+	let t = (e) => JSON.stringify(e), n = d("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 [${i(e.value).map(t).join(", ")}]`;
+		case "nin": return `${n} NOT IN [${i(e.value).map(t).join(", ")}]`;
+	}
+}, g = (e, t = {}) => {
+	let n = u("meilisearch", t), i, a = async () => (i ||= l("meilisearch", "meilisearch", () => import("meilisearch")).then((t) => new t.Meilisearch({
+		host: e.host ?? e.url ?? "http://localhost:7700",
+		apiKey: e.apiKey
+	})), i), o = (e) => e && e.length > 0 ? e.map(h) : void 0, s = async (e, t) => {
+		try {
+			return await t();
+		} catch (t) {
+			throw t instanceof r ? t : new r({
+				engine: "meilisearch",
+				op: e,
+				message: String(t?.message ?? t),
+				transient: !0
+			});
+		}
+	}, c = async (e, t) => {
+		let n = await (await a()).tasks.waitForTask(t, {
+			timeout: 6e4,
+			interval: 50
+		});
+		if (n.status !== "succeeded") throw new r({
+			engine: "meilisearch",
+			op: e,
+			message: n.error?.message ?? `Meilisearch task ${t.taskUid} ${n.status}`,
+			transient: n.status === "canceled"
+		});
+	};
+	return {
+		upsert: (e, t) => s("upsert", async () => {
+			await c("upsert", await (await a()).index(e).addDocuments([...t]));
+		}),
+		remove: (e, t) => s("remove", async () => {
+			await c("remove", await (await a()).index(e).deleteDocuments([...t]));
+		}),
+		query: (e, { q: t, limit: r, offset: i, filters: c, facets: l, highlight: u, fuzziness: d, engineParams: f }) => s("query", async () => {
+			let s = n(f), p = {
+				...s.before,
+				limit: r ?? 20,
+				...i ? { offset: i } : {},
+				...o(c) ? { filter: o(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 }
+				} : {},
+				...s.after
+			};
+			return _(await (await a()).index(e).search(t, p), u);
+		})
+	};
+}, _ = (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 ?? {}
+}), v = (e) => String(e).replace(/^-/, "\\-"), y = (e, t) => {
+	let n = typeof t == "boolean" ? +!!t : Number(t);
+	if (!Number.isFinite(n)) throw new r({
+		engine: "algolia",
+		op: "query",
+		message: `range filter on "${e}" needs a numeric value (got ${JSON.stringify(t)})`,
+		transient: !1
+	});
+	return n;
+}, b = (e) => {
+	let t = [], n = [];
+	for (let r of e ?? []) {
+		let e = d("algolia", r.field), a = (e) => v(e), o = (t) => y(e, t);
+		switch (r.op) {
+			case "eq":
+				t.push(`${e}:${a(r.value)}`);
+				break;
+			case "neq":
+				t.push(`${e}:-${a(r.value)}`);
+				break;
+			case "in":
+				t.push(i(r.value).map((t) => `${e}:${a(t)}`));
+				break;
+			case "nin":
+				for (let n of i(r.value)) t.push(`${e}:-${a(n)}`);
+				break;
+			case "gt":
+				n.push(`${e} > ${o(r.value)}`);
+				break;
+			case "gte":
+				n.push(`${e} >= ${o(r.value)}`);
+				break;
+			case "lt":
+				n.push(`${e} < ${o(r.value)}`);
+				break;
+			case "lte": n.push(`${e} <= ${o(r.value)}`);
+		}
+	}
+	return {
+		facetFilters: t,
+		numericFilters: n
+	};
+}, x = (e, t = {}) => {
+	let n = u("algolia", t), i, a = async () => (i ||= l("algoliasearch", "algolia", () => import("algoliasearch")).then((t) => t.algoliasearch(e.appId ?? "", e.apiKey)), i), o = async (e, t) => {
+		try {
+			return await t();
+		} catch (t) {
+			throw t instanceof r ? t : new r({
+				engine: "algolia",
+				op: e,
+				message: String(t?.message ?? t),
+				transient: !0
+			});
+		}
+	};
+	return {
+		upsert: (e, t) => o("upsert", async () => {
+			await (await a()).saveObjects({
+				indexName: e,
+				objects: t.map((e) => ({
+					...e,
+					objectID: e.id
+				}))
+			});
+		}),
+		remove: (e, t) => o("remove", async () => {
+			await (await a()).deleteObjects({
+				indexName: e,
+				objectIDs: [...t]
+			});
+		}),
+		query: (e, { q: t, limit: r, offset: i, filters: s, facets: c, highlight: l, fuzziness: u, engineParams: d }) => o("query", async () => {
+			let { facetFilters: o, numericFilters: f } = b(s), p = i ? {
+				offset: i,
+				length: r ?? 20
+			} : { hitsPerPage: r ?? 20 }, m = n(d), h = {
+				...m.before,
+				query: t,
+				...p,
+				...o.length > 0 ? { facetFilters: o } : {},
+				...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 S(await (await a()).searchSingleIndex({
+				indexName: e,
+				searchParams: h
+			}), l);
+		})
+	};
+}, S = (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 ?? {}
+});
+//#endregion
+export { r as SearchBackendError, x as algoliaBackend, a as editDistanceWithin, g as meilisearchBackend, s as memoryBackend, p as typesenseBackend };

package/dist/drift.js

@@ -0,0 +1,121 @@
+import { and as e, count as t, eq as n, id as r, integer as i, table as a, text as o, timestamp as s } from "@voltro/database";
+//#region src/drift.ts
+var c = "_voltro_search_drift", l = a(c, {
+	id: r({ prefix: "sdrft" }),
+	indexName: o().maxLength(191),
+	sourceTable: o().maxLength(191),
+	rowId: o().maxLength(191),
+	docId: o().maxLength(191),
+	op: o().maxLength(16),
+	attempts: i().default(0),
+	lastError: o().maxLength(1e3),
+	firstFailedAt: s(),
+	lastFailedAt: s()
+}).unique("bySearchDriftIndexRow", ["indexName", "rowId"]).index("bySearchDriftIndex", ["indexName"]), u = (e, t) => ({
+	table: e,
+	predicate: n("id", t),
+	order: [],
+	take: 1,
+	skip: void 0,
+	projection: void 0
+}), d = (e) => e ? new Date(e).toISOString() : (/* @__PURE__ */ new Date(0)).toISOString(), f = (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: d(e.firstFailedAt),
+	lastFailedAt: d(e.lastFailedAt)
+}), p = () => {
+	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));
+		}
+	};
+}, m = () => `sdrft_${Math.random().toString(36).slice(2)}${Date.now().toString(36)}`, h = (e, t) => ({
+	table: c,
+	predicate: e,
+	order: [{
+		column: "firstFailedAt",
+		direction: "asc"
+	}],
+	take: t,
+	skip: void 0,
+	projection: void 0
+}), g = (r) => ({
+	record: async (e) => {
+		let t = /* @__PURE__ */ new Date(), i = m(), a = await r.insertIgnore(c, {
+			id: i,
+			indexName: e.indexName,
+			sourceTable: e.sourceTable,
+			rowId: e.rowId,
+			docId: e.docId,
+			op: e.op,
+			attempts: 1,
+			lastError: e.error.slice(0, 1e3),
+			firstFailedAt: t,
+			lastFailedAt: t
+		}, { conflictColumns: ["indexName", "rowId"] });
+		String(a.id) !== i && await r.updateMany(c, {
+			attempts: Number(a.attempts ?? 0) + 1,
+			op: e.op,
+			docId: e.docId,
+			lastError: e.error.slice(0, 1e3),
+			lastFailedAt: t
+		}, { where: n("id", String(a.id)) });
+	},
+	list: async (e) => (await r.query(h(void 0, e))).map(f),
+	summary: async (e) => {
+		let i = (await r.query({
+			...h(n("indexName", e), void 0),
+			order: [],
+			aggregations: [t("n")]
+		}))[0], a = Number(i?.n ?? i?.count ?? 0);
+		if (a === 0) return {
+			pending: 0,
+			lastFailedAt: null
+		};
+		let o = await r.query({
+			...h(n("indexName", e), 1),
+			order: [{
+				column: "lastFailedAt",
+				direction: "desc"
+			}]
+		});
+		return {
+			pending: a,
+			lastFailedAt: o[0] ? d(o[0].lastFailedAt) : null
+		};
+	},
+	clear: async (t, i) => {
+		await r.deleteMany(c, { where: e(n("indexName", t), n("rowId", i)) });
+	}
+}), _ = () => [l];
+//#endregion
+export { c as SEARCH_DRIFT_TABLE, g as dataStoreDriftLedger, u as driftSourceQuery, _ as driftTables, p as memoryDriftLedger, l as searchDriftTable };

package/dist/errors.js

@@ -0,0 +1,13 @@
+import { Schema as e } from "effect";
+//#region src/errors.ts
+var t = class extends e.TaggedError()("SearchIndexNotFound", { index: e.String }) {}, n = class extends e.TaggedError()("SearchFieldRejected", {
+	field: e.String,
+	where: e.Literals([
+		"filter",
+		"facet",
+		"highlight"
+	]),
+	reason: e.Literals(["not-an-identifier", "not-queryable"])
+}) {};
+//#endregion
+export { n as SearchFieldRejected, t as SearchIndexNotFound };