@devisfuture/mega-collection 2.4.6 → 2.4.8

package/dist/search/index.mjs

@@ -1,1010 +1 @@
-import { a as e, i as t, n } from "../chunk-BJZg_1dI.mjs";
-import { n as r } from "../chunk-C5Zpu_ol.mjs";
-//#region src/search/ngram.ts
-function i(e) {
-	for (let t = 0; t < e.length - 1; t++) {
-		let n = t;
-		for (let r = t + 1; r < e.length; r++) e[r].size < e[n].size && (n = r);
-		if (n !== t) {
-			let r = e[t];
-			e[t] = e[n], e[n] = r;
-		}
-	}
-}
-function a(e, t) {
-	let n = [];
-	for (let r of t) {
-		let t = e.get(r);
-		if (!t) return null;
-		n.push(t);
-	}
-	return i(n), n;
-}
-function o(e, t) {
-	for (let n = 0; n < t.length; n++) if (!t[n].has(e)) return !1;
-	return !0;
-}
-function s(e, t, n, r) {
-	let i = a(e, t);
-	if (i === null) return null;
-	let s = i[0];
-	return {
-		smallestPostingList: s,
-		matches: (e) => s.has(e) && o(e, i) && !!n[e]?.includes(r)
-	};
-}
-function c(e) {
-	let t = Math.min(3, Math.max(2, e.length)), n = e.length - t + 1, r = Array(n);
-	for (let i = 0; i < n; i++) r[i] = e.substring(i, i + t);
-	return r;
-}
-function l(e, t) {
-	let n = e.get(t);
-	if (n) return n;
-	let r = /* @__PURE__ */ new Set();
-	return e.set(t, r), r;
-}
-function u(e) {
-	let t = c(e);
-	if (t.length <= 12) return new Set(t);
-	let n = /* @__PURE__ */ new Set(), r = t.length - 1;
-	for (let e = 0; e <= 11; e++) {
-		let i = Math.round(e * r / 11);
-		n.add(t[i]);
-	}
-	return n;
-}
-function d(e, t, n) {
-	let r = Math.min(3, t.length);
-	for (let i = 2; i <= r; i++) {
-		let r = t.length - i;
-		for (let a = 0; a <= r; a++) l(e, t.substring(a, a + i)).add(n);
-	}
-}
-function f(e, t, n, r, i = {}) {
-	let { restrictionLookup: a = null, take: o = Infinity } = i, c = s(e, t, n, r);
-	if (c === null) return [];
-	let l = [];
-	for (let e of c.smallestPostingList) if (!(a !== null && !a[e]) && c.matches(e) && (l.push(e), l.length >= o)) break;
-	return l;
-}
-function p(e, t, n, r, i) {
-	let { candidateIndices: a, restrictionLookup: o = null, take: c = Infinity } = i;
-	if (a.length === 0) return [];
-	let l = s(e, t, n, r);
-	if (l === null) return [];
-	let u = [];
-	if (o === null || a.length <= l.smallestPostingList.size) {
-		for (let e = 0; e < a.length; e++) {
-			let t = a[e];
-			if (l.matches(t) && (u.push(t), u.length >= c)) break;
-		}
-		return u;
-	}
-	for (let e of l.smallestPostingList) if (o[e] && l.matches(e) && (u.push(e), u.length >= c)) break;
-	return u;
-}
-function m(e, t, n) {
-	let r = Math.min(3, t.length);
-	for (let i = 2; i <= r; i++) {
-		let r = t.length - i;
-		for (let a = 0; a <= r; a++) {
-			let r = t.substring(a, a + i), o = e.get(r);
-			o && (o.delete(n), o.size === 0 && e.delete(r));
-		}
-	}
-}
-//#endregion
-//#region src/search/nested.ts
-var h = class {
-	constructor(e = {
-		ngramIndexes: /* @__PURE__ */ new Map(),
-		normalizedFieldValues: /* @__PURE__ */ new Map()
-	}) {
-		this.storage = e, this.registeredFields = /* @__PURE__ */ new Set(), this.fieldDescriptors = /* @__PURE__ */ new Map();
-	}
-	registerFields(e) {
-		if (e?.length) for (let t of e) this.registerField(t);
-	}
-	hasRegisteredFields() {
-		return this.registeredFields.size > 0;
-	}
-	hasField(e) {
-		return this.registeredFields.has(e);
-	}
-	hasIndexes() {
-		return this.storage.ngramIndexes.size > 0;
-	}
-	clearIndexes() {
-		this.storage.ngramIndexes.clear(), this.storage.normalizedFieldValues.clear();
-	}
-	buildIndexes(e) {
-		this.clearIndexes();
-		for (let t of this.registeredFields) this.buildIndex(e, t);
-	}
-	addItems(e, t) {
-		if (!(e.length === 0 || this.storage.ngramIndexes.size === 0)) for (let n of this.storage.ngramIndexes.keys()) this.addItemsToField(n, e, t);
-	}
-	updateItem(e, t, n) {
-		if (this.storage.ngramIndexes.size !== 0) for (let r of this.storage.ngramIndexes.keys()) this.updateItemInField(r, e, t, n);
-	}
-	removeItem(e, t) {
-		if (this.storage.ngramIndexes.size !== 0) for (let n of this.storage.ngramIndexes.keys()) this.removeItemFromField(n, e, t);
-	}
-	moveItem(e, t, n) {
-		if (!(this.storage.ngramIndexes.size === 0 || t === n)) for (let r of this.storage.ngramIndexes.keys()) this.moveItemForField(r, e, t, n);
-	}
-	searchAllIndexedFieldIndices(e, t, n, r) {
-		let i = /* @__PURE__ */ new Set(), a = [];
-		for (let o of this.storage.ngramIndexes.keys()) for (let s of this.searchIndexedFieldIndices(o, e, t, n, r)) i.has(s) || (i.add(s), a.push(s));
-		return a;
-	}
-	searchIndexedField(e, t, n, r, i, a, o = Infinity) {
-		let s = this.searchIndexedFieldIndices(t, n, r, i, a, o), c = [];
-		for (let t = 0; t < s.length; t++) {
-			let n = e[s[t]];
-			n && c.push(n);
-		}
-		return c;
-	}
-	searchIndexedFieldIndices(e, t, n, r, i, a = Infinity) {
-		let o = this.storage.ngramIndexes.get(e);
-		if (!o) return [];
-		let s = this.storage.normalizedFieldValues.get(e) ?? [];
-		return i == null ? f(o, n, s, t, {
-			restrictionLookup: r,
-			take: a
-		}) : p(o, n, s, t, {
-			candidateIndices: i,
-			restrictionLookup: r,
-			take: a
-		});
-	}
-	searchFieldLinear(e, t, n) {
-		let r = this.searchFieldLinearIndices(e, t, n), i = [];
-		for (let t = 0; t < r.length; t++) {
-			let n = e[r[t]];
-			n && i.push(n);
-		}
-		return i;
-	}
-	searchFieldLinearIndices(e, t, n, r) {
-		let i = this.fieldDescriptors.get(t);
-		if (!i) return [];
-		let { collectionKey: a, nestedKey: o } = i, s = [];
-		if (r) {
-			for (let t = 0; t < r.length; t++) {
-				let i = r[t], c = e[i][a];
-				if (!Array.isArray(c)) continue;
-				let l = !1;
-				for (let e = 0; e < c.length; e++) {
-					let t = c[e][o];
-					if (typeof t == "string" && t.toLowerCase().includes(n)) {
-						l = !0;
-						break;
-					}
-				}
-				l && s.push(i);
-			}
-			return s;
-		}
-		for (let t = 0; t < e.length; t++) {
-			let r = e[t][a];
-			if (!Array.isArray(r)) continue;
-			let i = !1;
-			for (let e = 0; e < r.length; e++) {
-				let t = r[e][o];
-				if (typeof t == "string" && t.toLowerCase().includes(n)) {
-					i = !0;
-					break;
-				}
-			}
-			i && s.push(t);
-		}
-		return s;
-	}
-	matchesAnyField(e, t) {
-		for (let n of this.registeredFields) {
-			let r = this.fieldDescriptors.get(n);
-			if (!r) continue;
-			let { collectionKey: i, nestedKey: a } = r, o = e[i];
-			if (Array.isArray(o)) for (let e = 0; e < o.length; e++) {
-				let n = o[e][a];
-				if (typeof n == "string" && n.toLowerCase().includes(t)) return !0;
-			}
-		}
-		return !1;
-	}
-	registerField(e) {
-		let t = r(e);
-		t && (this.registeredFields.add(e), this.fieldDescriptors.set(e, t));
-	}
-	getNormalizedValues(e) {
-		let t = this.storage.normalizedFieldValues.get(e);
-		if (t) return t;
-		let n = [];
-		return this.storage.normalizedFieldValues.set(e, n), n;
-	}
-	buildIndex(e, t) {
-		let n = this.fieldDescriptors.get(t);
-		if (!n) return;
-		let { collectionKey: r, nestedKey: i } = n, a = /* @__PURE__ */ new Map(), o = Array(e.length);
-		for (let t = 0, n = e.length; t < n; t++) {
-			let n = e[t][r];
-			if (!Array.isArray(n)) continue;
-			let s = [];
-			for (let e = 0; e < n.length; e++) {
-				let t = n[e][i];
-				typeof t == "string" && s.push(t.toLowerCase());
-			}
-			if (s.length === 0) continue;
-			let c = s.join("\n");
-			o[t] = c, d(a, c, t);
-		}
-		this.storage.ngramIndexes.set(t, a), this.storage.normalizedFieldValues.set(t, o);
-	}
-	addItemsToField(e, t, n) {
-		let r = this.fieldDescriptors.get(e), i = this.storage.ngramIndexes.get(e);
-		if (!r || !i) return;
-		let a = this.getNormalizedValues(e), { collectionKey: o, nestedKey: s } = r;
-		for (let e = 0; e < t.length; e++) {
-			let r = t[e][o];
-			if (!Array.isArray(r)) continue;
-			let c = [], l = n + e;
-			for (let e = 0; e < r.length; e++) {
-				let t = r[e][s];
-				typeof t == "string" && c.push(t.toLowerCase());
-			}
-			if (c.length === 0) continue;
-			let u = c.join("\n");
-			a[l] = u, d(i, u, l);
-		}
-	}
-	updateItemInField(e, t, n, r) {
-		let i = this.storage.ngramIndexes.get(e);
-		if (!i) return;
-		let a = this.getNormalizedValues(e), o = this.getNormalizedItemValue(e, n), s = this.getNormalizedItemValue(e, t);
-		if (o !== s) {
-			if (o && m(i, o, r), !s) {
-				delete a[r];
-				return;
-			}
-			a[r] = s, d(i, s, r);
-		}
-	}
-	removeItemFromField(e, t, n) {
-		let r = this.storage.ngramIndexes.get(e);
-		if (!r) return;
-		let i = this.getNormalizedValues(e), a = i[n] ?? this.getNormalizedItemValue(e, t);
-		a && m(r, a, n), delete i[n];
-	}
-	moveItemForField(e, t, n, r) {
-		let i = this.storage.ngramIndexes.get(e);
-		if (!i) return;
-		let a = this.getNormalizedValues(e), o = a[n] ?? this.getNormalizedItemValue(e, t);
-		if (!o) {
-			delete a[n];
-			return;
-		}
-		m(i, o, n), d(i, o, r), a[r] = o, delete a[n];
-	}
-	getNormalizedItemValue(e, t) {
-		let n = this.fieldDescriptors.get(e);
-		if (!n) return null;
-		let { collectionKey: r, nestedKey: i } = n, a = t[r];
-		if (!Array.isArray(a)) return null;
-		let o = [];
-		for (let e = 0; e < a.length; e++) {
-			let t = a[e][i];
-			typeof t == "string" && o.push(t.toLowerCase());
-		}
-		return o.length === 0 ? null : o.join("\n");
-	}
-}, g = () => ({
-	indexedFields: /* @__PURE__ */ new Set(),
-	flatIndexes: /* @__PURE__ */ new Map(),
-	nestedStorage: {
-		ngramIndexes: /* @__PURE__ */ new Map(),
-		normalizedFieldValues: /* @__PURE__ */ new Map()
-	},
-	deferredMutationVersion: null,
-	filterByPreviousResult: !1,
-	previousResultIndices: null,
-	previousResultLookup: null,
-	previousQuery: null,
-	stats: {
-		totalQueries: 0,
-		indexedQueries: 0,
-		fallbackQueries: 0,
-		fallbackFields: /* @__PURE__ */ new Map()
-	}
-}), _ = class {
-	constructor(t = {}) {
-		this.cachedIndexedFieldsList = null, this.cachedLinearSearchFieldsList = null, this.emittedWarningKeys = /* @__PURE__ */ new Set(), this.warnings = [], this.normalizedValuesCache = /* @__PURE__ */ new Map(), this.combinedNormalizedValuesCache = null, this.minQueryLength = t.minQueryLength ?? 1, this.silent = t.silent ?? !1, this.state = t.state ?? new e(t.data ?? []), this.namespace = this.state.createNamespace("search"), this.nestedCollection = new h(this.runtime.nestedStorage), this.nestedCollection.registerFields(t.nestedFields), this.state.subscribe((e) => this.handleStateMutation(e)), t.filterByPreviousResult && (this.runtime.filterByPreviousResult = !0);
-		let n = t.fields?.length, r = this.nestedCollection.hasRegisteredFields();
-		if (n) for (let e of t.fields) this.indexedFields.add(e);
-		this.dataset.length > 0 && (n || r) && this.rebuildConfiguredIndexes();
-	}
-	get dataset() {
-		return this.state.getOriginData();
-	}
-	get runtime() {
-		return this.state.getOrCreateScopedValue(this.namespace, "runtime", g);
-	}
-	get flatIndexes() {
-		return this.runtime.flatIndexes;
-	}
-	get indexedFields() {
-		return this.runtime.indexedFields;
-	}
-	shouldDeferMutationIndexUpdates() {
-		return this.state.getScopedValue(t, n) === !0;
-	}
-	markDeferredMutationState() {
-		this.runtime.deferredMutationVersion = this.state.getMutationVersion(), this.flatIndexes.clear(), this.nestedCollection.clearIndexes(), this.cachedIndexedFieldsList = null, this.cachedLinearSearchFieldsList = null, this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-	}
-	ensureConfiguredIndexesReady() {
-		this.runtime.deferredMutationVersion !== null && (this.runtime.deferredMutationVersion = null, this.dataset.length > 0 && (this.indexedFields.size > 0 || this.nestedCollection.hasRegisteredFields()) && this.rebuildConfiguredIndexes());
-	}
-	rebuildConfiguredIndexes() {
-		this.flatIndexes.clear(), this.nestedCollection.clearIndexes(), this.cachedIndexedFieldsList = null, this.cachedLinearSearchFieldsList = null, this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null;
-		for (let e of this.indexedFields) this.buildIndexFromData(this.dataset, e);
-		this.nestedCollection.hasRegisteredFields() && this.nestedCollection.buildIndexes(this.dataset);
-	}
-	buildIndexFromData(e, t) {
-		let n = this.state.getMutationVersion(), r = /* @__PURE__ */ new Map(), i = Array(e.length);
-		for (let n = 0, a = e.length; n < a; n++) {
-			let a = e[n][t];
-			if (typeof a != "string") continue;
-			let o = a.toLowerCase();
-			i[n] = o, d(r, o, n);
-		}
-		this.flatIndexes.set(t, {
-			ngramMap: r,
-			normalizedValues: i,
-			version: n
-		});
-	}
-	search(e, t, n) {
-		return typeof t == "string" ? this.searchField(e, t, n) : this.searchAll(e, t);
-	}
-	searchAll(e, t) {
-		return this.searchAllFields(e, t);
-	}
-	normalizeQuery(e) {
-		return e.trim().toLowerCase();
-	}
-	normalizeSearchWindow(e) {
-		let t = Math.max(0, Math.trunc(e?.offset ?? 0)), n = e?.limit, r = n === void 0 ? Infinity : Math.max(0, Math.trunc(n));
-		return {
-			offset: t,
-			limit: r,
-			take: Number.isFinite(r) ? t + r : Infinity,
-			hasWindow: t > 0 || Number.isFinite(r)
-		};
-	}
-	shouldTrackPreviousResult(e) {
-		return !e.hasWindow;
-	}
-	hasReachedWindowLimit(e, t) {
-		return Number.isFinite(e.limit) && t >= e.limit;
-	}
-	sliceItems(e, t) {
-		return t.hasWindow ? e.slice(t.offset, t.take) : e;
-	}
-	collectItemsFromIndices(e, t) {
-		let n = t.hasWindow && e.length > 0 ? e.slice(t.offset, t.take) : e, r = [];
-		for (let e = 0; e < n.length; e++) {
-			let t = this.dataset[n[e]];
-			t && r.push(t);
-		}
-		return {
-			items: r,
-			indices: n
-		};
-	}
-	createLookup(e) {
-		let t = new Uint8Array(this.dataset.length);
-		for (let n = 0; n < e.length; n++) t[e[n]] = 1;
-		return t;
-	}
-	getRestrictionLookup(e) {
-		let t = this.runtime.previousResultLookup;
-		if (t !== null && this.runtime.previousResultIndices === e && t.length === this.dataset.length) return t;
-		let n = this.createLookup(e);
-		return this.runtime.previousResultLookup = n, n;
-	}
-	getSearchSource(e) {
-		let { runtime: t } = this;
-		return t.filterByPreviousResult ? t.previousQuery !== null && t.previousResultIndices !== null && e.includes(t.previousQuery) ? {
-			indices: t.previousResultIndices,
-			lookup: this.getRestrictionLookup(t.previousResultIndices)
-		} : (t.previousResultIndices = null, t.previousResultLookup = null, t.previousQuery = null, {
-			indices: null,
-			lookup: null
-		}) : {
-			indices: null,
-			lookup: null
-		};
-	}
-	saveSearchResult(e, t) {
-		let { runtime: n } = this;
-		n.filterByPreviousResult && (n.previousResultIndices = e, n.previousResultLookup = null, n.previousQuery = t);
-	}
-	persistSearchResult(e, t, n) {
-		n && this.saveSearchResult(e.indices, t);
-	}
-	resetSearchState() {
-		return this.clearPreviousSearchState(), this;
-	}
-	getWarnings() {
-		return [...this.warnings];
-	}
-	getStats() {
-		let { totalQueries: e, indexedQueries: t, fallbackQueries: n, fallbackFields: r } = this.runtime.stats;
-		return {
-			totalQueries: e,
-			indexedQueries: t,
-			fallbackQueries: n,
-			fallbackRate: e === 0 ? 0 : n / e,
-			fallbackFields: Object.fromEntries(r)
-		};
-	}
-	resetStats() {
-		let { stats: e } = this.runtime;
-		return e.totalQueries = 0, e.indexedQueries = 0, e.fallbackQueries = 0, e.fallbackFields.clear(), this;
-	}
-	clearPreviousSearchState() {
-		let { runtime: e } = this;
-		e.previousResultIndices = null, e.previousResultLookup = null, e.previousQuery = null;
-	}
-	recordIndexedQuery() {
-		let { stats: e } = this.runtime;
-		e.totalQueries += 1, e.indexedQueries += 1;
-	}
-	recordFallbackQuery(e) {
-		let { stats: t } = this.runtime;
-		t.totalQueries += 1, t.fallbackQueries += 1, t.fallbackFields.set(e, (t.fallbackFields.get(e) ?? 0) + 1);
-	}
-	shouldEmitFallbackWarning(e) {
-		return !this.silent && e.length >= 2;
-	}
-	warnAboutFallback(e, t, n) {
-		if (!this.shouldEmitFallbackWarning(t)) return;
-		let r = `${e}\u0000${t}\u0000${n}`;
-		if (this.emittedWarningKeys.has(r)) return;
-		this.emittedWarningKeys.add(r);
-		let i = `[TextSearchEngine] warn: query "${t}" on ${e} used linear fallback. ${n}. Add the field(s) to the index schema to enable indexed search.`;
-		this.warnings.push(i), typeof process < "u" && process.env.NODE_ENV !== "production" && process.env.NODE_ENV !== "test" && console.warn(i);
-	}
-	getResolvedFlatIndex(e) {
-		let t = this.state.getMutationVersion(), n = this.flatIndexes.get(e);
-		return n && n.version !== t && this.dataset.length > 0 && (this.buildIndexFromData(this.dataset, e), n = this.flatIndexes.get(e)), n;
-	}
-	getQueryGrams(e) {
-		let t = u(e);
-		return t.size > 0 ? t : null;
-	}
-	searchAllFields(e, t) {
-		let n = this.normalizeQuery(e), r = this.normalizeSearchWindow(t), i = "all fields";
-		if (r.limit === 0) return [];
-		if (!n || n.length < this.minQueryLength) return this.sliceItems(this.dataset, r);
-		n.length >= 2 && this.ensureConfiguredIndexesReady();
-		let a = this.shouldTrackPreviousResult(r), { indices: o, lookup: s } = this.getSearchSource(n), c, l = () => (c === void 0 && (c = n.length >= 2 ? this.getQueryGrams(n) : null), c);
-		if (o !== null) {
-			let e = l();
-			if (e !== null && (this.flatIndexes.size > 0 || this.nestedCollection.hasIndexes())) {
-				this.recordIndexedQuery();
-				let t = this.searchAllFieldsIndexed(n, e, r, s, o);
-				return this.persistSearchResult(t, n, a), t.items;
-			}
-			this.recordFallbackQuery(i);
-			let t = this.searchLinearAllFields(this.dataset, n, o, r);
-			return this.persistSearchResult(t, n, a), t.items;
-		}
-		if (!this.flatIndexes.size && !this.nestedCollection.hasIndexes()) {
-			this.warnAboutFallback(i, n, this.indexedFields.size > 0 ? "configured indexes are not currently built" : "no indexed fields are configured"), this.recordFallbackQuery(i);
-			let e = this.searchLinearAllFields(this.dataset, n, null, r);
-			return this.persistSearchResult(e, n, a), e.items;
-		}
-		let u = l();
-		if (u === null) {
-			this.recordFallbackQuery(i);
-			let e = this.searchLinearAllFields(this.dataset, n, null, r);
-			return this.persistSearchResult(e, n, a), e.items;
-		}
-		this.recordIndexedQuery();
-		let d = this.searchAllFieldsIndexed(n, u, r, null);
-		return this.persistSearchResult(d, n, a), d.items;
-	}
-	searchAllFieldsIndexed(e, t, n, r, i = null) {
-		if (i !== null && !this.nestedCollection.hasRegisteredFields() && this.flatIndexes.size > 0) return this.searchAllFieldsIndexedInCandidates(e, t, n, r, i);
-		let a = this.dataset, o = new Uint8Array(a.length), s = [], c = 0;
-		for (let a of this.flatIndexes.keys()) {
-			let l = this.searchFieldWithPreparedQueryIndices(a, e, t, r, i);
-			for (let e = 0; e < l.length; e++) {
-				let t = l[e];
-				if (!o[t]) {
-					if (o[t] = 1, c < n.offset) {
-						c += 1;
-						continue;
-					}
-					if (s.push(t), c += 1, this.hasReachedWindowLimit(n, s.length)) return this.materializeIndicesResult(s);
-				}
-			}
-		}
-		for (let a of this.nestedCollection.searchAllIndexedFieldIndices(e, t, r, i)) if (!o[a]) {
-			if (o[a] = 1, c < n.offset) {
-				c += 1;
-				continue;
-			}
-			if (s.push(a), c += 1, this.hasReachedWindowLimit(n, s.length)) return this.materializeIndicesResult(s);
-		}
-		return this.materializeIndicesResult(s);
-	}
-	searchAllFieldsIndexedInCandidates(e, t, n, r, i) {
-		let a = [];
-		for (let n of this.flatIndexes.keys()) {
-			let r = this.getResolvedFlatIndex(n);
-			if (!r) continue;
-			let i = s(r.ngramMap, t, r.normalizedValues, e);
-			i !== null && a.push(i.matches);
-		}
-		if (a.length === 0) return {
-			items: [],
-			indices: []
-		};
-		let o = [], c = 0;
-		for (let e = 0; e < i.length; e++) {
-			let t = i[e];
-			if (r !== null && !r[t]) continue;
-			let s = !1;
-			for (let e = 0; e < a.length; e++) if (a[e](t)) {
-				s = !0;
-				break;
-			}
-			if (s) {
-				if (c < n.offset) {
-					c += 1;
-					continue;
-				}
-				if (o.push(t), c += 1, this.hasReachedWindowLimit(n, o.length)) break;
-			}
-		}
-		return this.materializeIndicesResult(o);
-	}
-	searchField(e, t, n) {
-		let r = this.normalizeQuery(t), i = this.normalizeSearchWindow(n), a = `field "${e}"`;
-		if (i.limit === 0) return [];
-		if (!r || r.length < this.minQueryLength) return this.sliceItems(this.dataset, i);
-		r.length >= 2 && this.ensureConfiguredIndexesReady();
-		let o = this.shouldTrackPreviousResult(i), { indices: s, lookup: c } = this.getSearchSource(r), l = this.nestedCollection.hasField(e), u, d = () => (u === void 0 && (u = r.length >= 2 ? this.getQueryGrams(r) : null), u);
-		if (s !== null) {
-			let t = d();
-			if (l) {
-				if (t !== null && this.nestedCollection.hasIndexes()) {
-					this.recordIndexedQuery();
-					let n = this.nestedCollection.searchIndexedFieldIndices(e, r, t, c, s, i.take), a = this.collectItemsFromIndices(n, i);
-					return this.persistSearchResult(a, r, o), a.items;
-				}
-				this.recordFallbackQuery(a);
-				let n = this.searchLinearSingleField(this.dataset, e, r, s, i);
-				return this.persistSearchResult(n, r, o), n.items;
-			}
-			if (t !== null && this.flatIndexes.has(e)) {
-				this.recordIndexedQuery();
-				let n = this.searchFieldWithPreparedQuery(e, r, t, i, c, s);
-				return this.persistSearchResult(n, r, o), n.items;
-			}
-			this.recordFallbackQuery(a);
-			let n = this.searchLinearSingleField(this.dataset, e, r, s, i);
-			return this.persistSearchResult(n, r, o), n.items;
-		}
-		if (l) {
-			if (r.length >= 2 && this.nestedCollection.hasIndexes()) {
-				let t = this.getQueryGrams(r);
-				if (t === null) return [];
-				this.recordIndexedQuery();
-				let n = this.nestedCollection.searchIndexedFieldIndices(e, r, t, null, null, i.take), a = this.collectItemsFromIndices(n, i);
-				return this.persistSearchResult(a, r, o), a.items;
-			}
-			this.recordFallbackQuery(a);
-			let t = this.searchLinearSingleField(this.dataset, e, r, null, i);
-			return this.persistSearchResult(t, r, o), t.items;
-		}
-		this.flatIndexes.size || this.warnAboutFallback(a, r, this.indexedFields.size > 0 ? `field "${e}" is not backed by an active index` : "no indexed fields are configured");
-		let f = d();
-		if (this.flatIndexes.size > 0 && f !== null) {
-			if (!this.flatIndexes.has(e)) return [];
-			this.recordIndexedQuery();
-			let t = this.searchFieldWithPreparedQuery(e, r, f, i);
-			return this.persistSearchResult(t, r, o), t.items;
-		}
-		this.recordFallbackQuery(a);
-		let p = this.searchLinearSingleField(this.dataset, e, r, null, i);
-		return this.persistSearchResult(p, r, o), p.items;
-	}
-	searchFieldWithPreparedQuery(e, t, n, r, i = null, a = null) {
-		let o = this.searchFieldWithPreparedQueryIndices(e, t, n, i, a, r.take);
-		return this.collectItemsFromIndices(o, r);
-	}
-	searchFieldWithPreparedQueryIndices(e, t, n, r = null, i = null, a = Infinity) {
-		let o = this.getResolvedFlatIndex(e);
-		if (!o) return [];
-		let { ngramMap: s, normalizedValues: c } = o;
-		return i === null ? f(s, n, c, t, {
-			restrictionLookup: r,
-			take: a
-		}) : p(s, n, c, t, {
-			candidateIndices: i,
-			restrictionLookup: r,
-			take: a
-		});
-	}
-	getIndexedFieldsList() {
-		return this.cachedIndexedFieldsList === null && (this.cachedIndexedFieldsList = Array.from(this.indexedFields)), this.cachedIndexedFieldsList;
-	}
-	materializeIndicesResult(e) {
-		let t = [];
-		for (let n = 0; n < e.length; n++) {
-			let r = this.dataset[e[n]];
-			r && t.push(r);
-		}
-		return {
-			items: t,
-			indices: e
-		};
-	}
-	getLinearSearchFields(e) {
-		let t = this.getIndexedFieldsList();
-		return t.length > 0 ? t : (this.cachedLinearSearchFieldsList === null && (this.cachedLinearSearchFieldsList = e.length ? Object.keys(e[0]).filter((t) => typeof e[0][t] == "string") : []), this.cachedLinearSearchFieldsList);
-	}
-	buildNormalizedValuesOnly(e, t) {
-		let n = Array(e.length);
-		for (let r = 0, i = e.length; r < i; r++) {
-			let i = e[r][t];
-			typeof i == "string" && (n[r] = i.toLowerCase());
-		}
-		return this.normalizedValuesCache.set(t, n), n;
-	}
-	buildCombinedNormalizedValues(e, t) {
-		let n = Array(e.length);
-		for (let r = 0; r < e.length; r++) n[r] = this.buildCombinedNormalizedValue(e[r], t);
-		return this.combinedNormalizedValuesCache = {
-			fieldsKey: t.join("\0"),
-			values: n
-		}, n;
-	}
-	buildCombinedNormalizedValue(e, t) {
-		let n = "";
-		for (let r = 0; r < t.length; r++) {
-			let i = e[t[r]];
-			typeof i == "string" && (n && (n += "\n"), n += i.toLowerCase());
-		}
-		return n;
-	}
-	getCombinedNormalizedValues(e, t) {
-		if (e !== this.dataset) return null;
-		let n = t.join("\0");
-		return this.combinedNormalizedValuesCache?.fieldsKey === n ? this.combinedNormalizedValuesCache.values : this.buildCombinedNormalizedValues(e, t);
-	}
-	invalidateNormalizedValuesCacheEntry(e, t) {
-		for (let [n, r] of this.normalizedValuesCache) {
-			let i = t[n];
-			r[e] = typeof i == "string" ? i.toLowerCase() : "";
-		}
-		if (this.combinedNormalizedValuesCache !== null) {
-			let n = this.combinedNormalizedValuesCache.fieldsKey.split("\0");
-			this.combinedNormalizedValuesCache.values[e] = this.buildCombinedNormalizedValue(t, n);
-		}
-	}
-	searchLinearAllFields(e, t, n, r) {
-		if (!e.length) return {
-			items: [],
-			indices: []
-		};
-		let i = this.getLinearSearchFields(e), a = e === this.dataset, o = i.length, s = Array(o);
-		for (let t = 0; t < o; t++) {
-			let n = i[t], r = this.flatIndexes.get(n);
-			if (r) s[t] = r.normalizedValues;
-			else {
-				let r = this.normalizedValuesCache.get(n);
-				r ? s[t] = r : a ? s[t] = this.buildNormalizedValuesOnly(e, n) : s[t] = null;
-			}
-		}
-		let c = this.nestedCollection.hasRegisteredFields(), l = c ? null : this.getCombinedNormalizedValues(e, i), u = !c && s.every((e) => e !== null), d = [], f = 0;
-		if (n !== null) {
-			let e = this.dataset;
-			if (l !== null) {
-				for (let e = 0; e < n.length; e++) {
-					let i = n[e];
-					if (l[i]?.includes(t)) {
-						if (f < r.offset) {
-							f += 1;
-							continue;
-						}
-						if (d.push(i), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-					}
-				}
-				return this.materializeIndicesResult(d);
-			}
-			if (u) {
-				for (let e = 0; e < n.length; e++) {
-					let i = n[e], a = !1;
-					for (let e = 0; e < o; e++) {
-						let n = s[e][i];
-						if (n && n.includes(t)) {
-							a = !0;
-							break;
-						}
-					}
-					if (a) {
-						if (f < r.offset) {
-							f += 1;
-							continue;
-						}
-						if (d.push(i), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-					}
-				}
-				return this.materializeIndicesResult(d);
-			}
-			for (let a = 0; a < n.length; a++) {
-				let l = n[a], u = e[l], p = !1;
-				for (let e = 0; e < o; e++) {
-					let n = s[e];
-					if (n) {
-						let e = n[l];
-						if (e && e.includes(t)) {
-							p = !0;
-							break;
-						}
-					} else {
-						let n = u[i[e]];
-						if (typeof n == "string" && n.toLowerCase().includes(t)) {
-							p = !0;
-							break;
-						}
-					}
-				}
-				if (!p && c && (p = this.nestedCollection.matchesAnyField(u, t)), p) {
-					if (f < r.offset) {
-						f += 1;
-						continue;
-					}
-					if (d.push(l), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-				}
-			}
-			return this.materializeIndicesResult(d);
-		}
-		if (l !== null) {
-			for (let n = 0; n < e.length; n++) if (l[n]?.includes(t)) {
-				if (f < r.offset) {
-					f += 1;
-					continue;
-				}
-				if (d.push(n), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-			}
-			return this.materializeIndicesResult(d);
-		}
-		if (u) {
-			for (let n = 0; n < e.length; n++) {
-				let e = !1;
-				for (let r = 0; r < o; r++) {
-					let i = s[r][n];
-					if (i && i.includes(t)) {
-						e = !0;
-						break;
-					}
-				}
-				if (e) {
-					if (f < r.offset) {
-						f += 1;
-						continue;
-					}
-					if (d.push(n), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-				}
-			}
-			return this.materializeIndicesResult(d);
-		}
-		for (let n = 0; n < e.length; n++) {
-			let a = e[n], l = !1;
-			for (let e = 0; e < o; e++) {
-				let r = s[e];
-				if (r) {
-					let e = r[n];
-					if (e && e.includes(t)) {
-						l = !0;
-						break;
-					}
-				} else {
-					let n = a[i[e]];
-					if (typeof n == "string" && n.toLowerCase().includes(t)) {
-						l = !0;
-						break;
-					}
-				}
-			}
-			if (!l && c && (l = this.nestedCollection.matchesAnyField(a, t)), l) {
-				if (f < r.offset) {
-					f += 1;
-					continue;
-				}
-				if (d.push(n), f += 1, this.hasReachedWindowLimit(r, d.length)) break;
-			}
-		}
-		return this.materializeIndicesResult(d);
-	}
-	searchLinearSingleField(e, t, n, r, i) {
-		if (!e.length) return {
-			items: [],
-			indices: []
-		};
-		if (this.nestedCollection.hasField(t)) {
-			let a = this.nestedCollection.searchFieldLinearIndices(e, t, n, r ?? void 0);
-			return this.collectItemsFromIndices(a, i);
-		}
-		let a = [], o = this.flatIndexes.get(t), s = o ? o.normalizedValues : this.normalizedValuesCache.get(t) ?? (e === this.dataset ? this.buildNormalizedValuesOnly(e, t) : null), c = 0;
-		if (r !== null) {
-			let e = this.dataset;
-			if (s) {
-				for (let e = 0; e < r.length; e++) {
-					let t = r[e];
-					if (s[t]?.includes(n)) {
-						if (c < i.offset) {
-							c += 1;
-							continue;
-						}
-						if (a.push(t), c += 1, this.hasReachedWindowLimit(i, a.length)) break;
-					}
-				}
-				return this.materializeIndicesResult(a);
-			}
-			for (let o = 0; o < r.length; o++) {
-				let s = r[o], l = e[s];
-				if (typeof l[t] == "string" && l[t].toLowerCase().includes(n)) {
-					if (c < i.offset) {
-						c += 1;
-						continue;
-					}
-					if (a.push(s), c += 1, this.hasReachedWindowLimit(i, a.length)) break;
-				}
-			}
-			return this.materializeIndicesResult(a);
-		}
-		if (s) {
-			for (let t = 0; t < e.length; t++) if (s[t]?.includes(n)) {
-				if (c < i.offset) {
-					c += 1;
-					continue;
-				}
-				if (a.push(t), c += 1, this.hasReachedWindowLimit(i, a.length)) break;
-			}
-			return this.materializeIndicesResult(a);
-		}
-		for (let r = 0; r < e.length; r++) if (typeof e[r][t] == "string" && e[r][t].toLowerCase().includes(n)) {
-			if (c < i.offset) {
-				c += 1;
-				continue;
-			}
-			if (a.push(r), c += 1, this.hasReachedWindowLimit(i, a.length)) break;
-		}
-		return this.materializeIndicesResult(a);
-	}
-	clearIndexes() {
-		return this.flatIndexes.clear(), this.nestedCollection.clearIndexes(), this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null, this;
-	}
-	getOriginData() {
-		return this.state.getOriginData();
-	}
-	data(e) {
-		return this.state.data(e), this;
-	}
-	add(e) {
-		return this.state.add(e), this;
-	}
-	update(e) {
-		return this.state.update(e), this;
-	}
-	applyAddedItems(e, t) {
-		if (e.length === 0) return this;
-		for (let n of this.indexedFields) this.addItemsToField(n, e, t);
-		return this.nestedCollection.addItems(e, t), this;
-	}
-	clearData() {
-		return this.state.clearData(), this;
-	}
-	handleStateMutation(e) {
-		if (this.shouldDeferMutationIndexUpdates() && (e.type === "add" || e.type === "update")) {
-			this.markDeferredMutationState();
-			return;
-		}
-		switch (e.type) {
-			case "add":
-				this.applyAddedItems(e.items, e.startIndex);
-				for (let [t, n] of this.normalizedValuesCache) for (let r = 0; r < e.items.length; r++) {
-					let i = e.items[r][t];
-					n[e.startIndex + r] = typeof i == "string" ? i.toLowerCase() : "";
-				}
-				this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-				return;
-			case "update":
-				this.applyUpdatedItem(e.index, e.previousItem, e.nextItem), this.invalidateNormalizedValuesCacheEntry(e.index, e.nextItem), this.clearPreviousSearchState();
-				return;
-			case "data":
-				this.runtime.deferredMutationVersion = null, this.rebuildConfiguredIndexes(), this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-				return;
-			case "clearData":
-				this.runtime.deferredMutationVersion = null, this.flatIndexes.clear(), this.nestedCollection.clearIndexes(), this.cachedLinearSearchFieldsList = null, this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-				return;
-			case "remove":
-				this.applyRemovedItem(e.removedItem, e.removedIndex, e.movedItem, e.movedFromIndex), this.cachedLinearSearchFieldsList = null, this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-				return;
-			case "removeMany":
-				for (let t = 0; t < e.entries.length; t++) {
-					let n = e.entries[t];
-					this.applyRemovedItem(n.removedItem, n.removedIndex, n.movedItem, n.movedFromIndex);
-				}
-				this.cachedLinearSearchFieldsList = null, this.normalizedValuesCache.clear(), this.combinedNormalizedValuesCache = null, this.clearPreviousSearchState();
-				return;
-		}
-	}
-	addItemsToField(e, t, n) {
-		let r = this.flatIndexes.get(e);
-		if (!r) return;
-		let { ngramMap: i, normalizedValues: a } = r;
-		for (let r = 0; r < t.length; r++) {
-			let o = t[r][e];
-			if (typeof o != "string") continue;
-			let s = o.toLowerCase(), c = n + r;
-			a[c] = s, d(i, s, c);
-		}
-		r.version = this.state.getMutationVersion();
-	}
-	applyUpdatedItem(e, t, n) {
-		for (let r of this.indexedFields) this.updateIndexedField(r, e, t, n);
-		this.nestedCollection.updateItem(n, t, e);
-	}
-	applyRemovedItem(e, t, n, r) {
-		for (let i of this.indexedFields) this.removeIndexedFieldValue(i, e, t), n !== null && r !== null && this.moveIndexedFieldValue(i, n, r, t);
-		this.nestedCollection.removeItem(e, t), n !== null && r !== null && this.nestedCollection.moveItem(n, r, t);
-	}
-	updateIndexedField(e, t, n, r) {
-		let i = this.flatIndexes.get(e);
-		if (!i) return;
-		if (n[e] === r[e]) {
-			i.version = this.state.getMutationVersion();
-			return;
-		}
-		let { ngramMap: a, normalizedValues: o } = i, s = this.getNormalizedFieldValue(n, e);
-		s && m(a, s, t);
-		let c = this.getNormalizedFieldValue(r, e);
-		if (!c) {
-			delete o[t], i.version = this.state.getMutationVersion();
-			return;
-		}
-		o[t] = c, d(a, c, t), i.version = this.state.getMutationVersion();
-	}
-	removeIndexedFieldValue(e, t, n) {
-		let r = this.flatIndexes.get(e);
-		if (!r) return;
-		let { ngramMap: i, normalizedValues: a } = r, o = this.getNormalizedFieldValue(t, e);
-		o && m(i, o, n), delete a[n], r.version = this.state.getMutationVersion();
-	}
-	moveIndexedFieldValue(e, t, n, r) {
-		if (n === r) return;
-		let i = this.flatIndexes.get(e);
-		if (!i) return;
-		let { ngramMap: a, normalizedValues: o } = i, s = o[n] ?? this.getNormalizedFieldValue(t, e);
-		if (!s) {
-			delete o[n], i.version = this.state.getMutationVersion();
-			return;
-		}
-		m(a, s, n), d(a, s, r), o[r] = s, delete o[n], i.version = this.state.getMutationVersion();
-	}
-	getNormalizedFieldValue(e, t) {
-		let n = e[t];
-		return typeof n == "string" ? n.toLowerCase() : null;
-	}
-};
-//#endregion
-export { _ as TextSearchEngine };
+import{a as e,i as t,n as s}from"../chunks/constants-BXQI1M5E.mjs";import{n as i}from"../chunks/internal-COJC3Ik3.mjs";function n(e,t,s,i){const n=function(e,t){const s=[];for(const i of t){const t=e.get(i);if(!t)return null;s.push(t)}return function(e){for(let t=0;t<e.length-1;t++){let s=t;for(let i=t+1;i<e.length;i++)e[i].size<e[s].size&&(s=i);if(s!==t){const i=e[t];e[t]=e[s],e[s]=i}}}(s),s}(e,t);if(null===n)return null;const r=n[0];return{smallestPostingList:r,matches:e=>r.has(e)&&function(e,t){for(let s=0;s<t.length;s++)if(!t[s].has(e))return!1;return!0}(e,n)&&Boolean(s[e]?.includes(i))}}function r(e,t){const s=e.get(t);if(s)return s;const i=/* @__PURE__ */new Set;return e.set(t,i),i}function l(e,t,s){const i=Math.min(3,t.length);for(let n=2;n<=i;n++){const i=t.length-n;for(let l=0;l<=i;l++)r(e,t.substring(l,l+n)).add(s)}}function a(e,t,s,i,r={}){const{restrictionLookup:l=null,take:a=Number.POSITIVE_INFINITY}=r,o=n(e,t,s,i);if(null===o)return[];const d=[];for(const n of o.smallestPostingList)if((null===l||l[n])&&o.matches(n)&&(d.push(n),d.length>=a))break;return d}function o(e,t,s,i,r){const{candidateIndices:l,restrictionLookup:a=null,take:o=Number.POSITIVE_INFINITY}=r;if(0===l.length)return[];const d=n(e,t,s,i);if(null===d)return[];const h=[];if(null===a||l.length<=d.smallestPostingList.size){for(let e=0;e<l.length;e++){const t=l[e];if(d.matches(t)&&(h.push(t),h.length>=o))break}return h}for(const n of d.smallestPostingList)if(a[n]&&d.matches(n)&&(h.push(n),h.length>=o))break;return h}function d(e,t,s){const i=Math.min(3,t.length);for(let n=2;n<=i;n++){const i=t.length-n;for(let r=0;r<=i;r++){const i=t.substring(r,r+n),l=e.get(i);l&&(l.delete(s),0===l.size&&e.delete(i))}}}var h=class{constructor(e={ngramIndexes:/* @__PURE__ */new Map,normalizedFieldValues:/* @__PURE__ */new Map}){this.storage=e,this.registeredFields=/* @__PURE__ */new Set,this.fieldDescriptors=/* @__PURE__ */new Map}registerFields(e){if(e?.length)for(const t of e)this.registerField(t)}hasRegisteredFields(){return this.registeredFields.size>0}hasField(e){return this.registeredFields.has(e)}hasIndexes(){return this.storage.ngramIndexes.size>0}clearIndexes(){this.storage.ngramIndexes.clear(),this.storage.normalizedFieldValues.clear()}buildIndexes(e){this.clearIndexes();for(const t of this.registeredFields)this.buildIndex(e,t)}addItems(e,t){if(0!==e.length&&0!==this.storage.ngramIndexes.size)for(const s of this.storage.ngramIndexes.keys())this.addItemsToField(s,e,t)}updateItem(e,t,s){if(0!==this.storage.ngramIndexes.size)for(const i of this.storage.ngramIndexes.keys())this.updateItemInField(i,e,t,s)}removeItem(e,t){if(0!==this.storage.ngramIndexes.size)for(const s of this.storage.ngramIndexes.keys())this.removeItemFromField(s,e,t)}moveItem(e,t,s){if(0!==this.storage.ngramIndexes.size&&t!==s)for(const i of this.storage.ngramIndexes.keys())this.moveItemForField(i,e,t,s)}searchAllIndexedFieldIndices(e,t,s,i){const n=/* @__PURE__ */new Set,r=[];for(const l of this.storage.ngramIndexes.keys())for(const a of this.searchIndexedFieldIndices(l,e,t,s,i))n.has(a)||(n.add(a),r.push(a));return r}searchIndexedField(e,t,s,i,n,r,l=Number.POSITIVE_INFINITY){const a=this.searchIndexedFieldIndices(t,s,i,n,r,l),o=[];for(let d=0;d<a.length;d++){const t=e[a[d]];t&&o.push(t)}return o}searchIndexedFieldIndices(e,t,s,i,n,r=Number.POSITIVE_INFINITY){const l=this.storage.ngramIndexes.get(e);if(!l)return[];const d=this.storage.normalizedFieldValues.get(e)??[];return null!=n?o(l,s,d,t,{candidateIndices:n,restrictionLookup:i,take:r}):a(l,s,d,t,{restrictionLookup:i,take:r})}searchFieldLinear(e,t,s){const i=this.searchFieldLinearIndices(e,t,s),n=[];for(let r=0;r<i.length;r++){const t=e[i[r]];t&&n.push(t)}return n}searchFieldLinearIndices(e,t,s,i){const n=this.fieldDescriptors.get(t);if(!n)return[];const{collectionKey:r,nestedKey:l}=n,a=[];if(i){for(let t=0;t<i.length;t++){const n=i[t],o=e[n][r];if(!Array.isArray(o))continue;let d=!1;for(let e=0;e<o.length;e++){const t=o[e][l];if("string"==typeof t&&t.toLowerCase().includes(s)){d=!0;break}}d&&a.push(n)}return a}for(let o=0;o<e.length;o++){const t=e[o][r];if(!Array.isArray(t))continue;let i=!1;for(let e=0;e<t.length;e++){const n=t[e][l];if("string"==typeof n&&n.toLowerCase().includes(s)){i=!0;break}}i&&a.push(o)}return a}matchesAnyField(e,t){for(const s of this.registeredFields){const i=this.fieldDescriptors.get(s);if(!i)continue;const{collectionKey:n,nestedKey:r}=i,l=e[n];if(Array.isArray(l))for(let e=0;e<l.length;e++){const s=l[e][r];if("string"==typeof s&&s.toLowerCase().includes(t))return!0}}return!1}registerField(e){const t=i(e);t&&(this.registeredFields.add(e),this.fieldDescriptors.set(e,t))}getNormalizedValues(e){const t=this.storage.normalizedFieldValues.get(e);if(t)return t;const s=[];return this.storage.normalizedFieldValues.set(e,s),s}buildIndex(e,t){const s=this.fieldDescriptors.get(t);if(!s)return;const{collectionKey:i,nestedKey:n}=s,r=/* @__PURE__ */new Map,a=new Array(e.length);for(let o=0,d=e.length;o<d;o++){const t=e[o][i];if(!Array.isArray(t))continue;const s=[];for(let e=0;e<t.length;e++){const i=t[e][n];"string"==typeof i&&s.push(i.toLowerCase())}if(0===s.length)continue;const d=s.join("\n");a[o]=d,l(r,d,o)}this.storage.ngramIndexes.set(t,r),this.storage.normalizedFieldValues.set(t,a)}addItemsToField(e,t,s){const i=this.fieldDescriptors.get(e),n=this.storage.ngramIndexes.get(e);if(!i||!n)return;const r=this.getNormalizedValues(e),{collectionKey:a,nestedKey:o}=i;for(let d=0;d<t.length;d++){const e=t[d][a];if(!Array.isArray(e))continue;const i=[],h=s+d;for(let t=0;t<e.length;t++){const s=e[t][o];"string"==typeof s&&i.push(s.toLowerCase())}if(0===i.length)continue;const u=i.join("\n");r[h]=u,l(n,u,h)}}updateItemInField(e,t,s,i){const n=this.storage.ngramIndexes.get(e);if(!n)return;const r=this.getNormalizedValues(e),a=this.getNormalizedItemValue(e,s),o=this.getNormalizedItemValue(e,t);a!==o&&(a&&d(n,a,i),o?(r[i]=o,l(n,o,i)):delete r[i])}removeItemFromField(e,t,s){const i=this.storage.ngramIndexes.get(e);if(!i)return;const n=this.getNormalizedValues(e),r=n[s]??this.getNormalizedItemValue(e,t);r&&d(i,r,s),delete n[s]}moveItemForField(e,t,s,i){const n=this.storage.ngramIndexes.get(e);if(!n)return;const r=this.getNormalizedValues(e),a=r[s]??this.getNormalizedItemValue(e,t);a?(d(n,a,s),l(n,a,i),r[i]=a,delete r[s]):delete r[s]}getNormalizedItemValue(e,t){const s=this.fieldDescriptors.get(e);if(!s)return null;const{collectionKey:i,nestedKey:n}=s,r=t[i];if(!Array.isArray(r))return null;const l=[];for(let a=0;a<r.length;a++){const e=r[a][n];"string"==typeof e&&l.push(e.toLowerCase())}return 0===l.length?null:l.join("\n")}},u=()=>({indexedFields:/* @__PURE__ */new Set,flatIndexes:/* @__PURE__ */new Map,nestedStorage:{ngramIndexes:/* @__PURE__ */new Map,normalizedFieldValues:/* @__PURE__ */new Map},deferredMutationVersion:null,filterByPreviousResult:!1,previousResultIndices:null,previousResultLookup:null,previousQuery:null,stats:{totalQueries:0,indexedQueries:0,fallbackQueries:0,fallbackFields:/* @__PURE__ */new Map}}),c=class{constructor(t={}){this.cachedIndexedFieldsList=null,this.cachedLinearSearchFieldsList=null,this.emittedWarningKeys=/* @__PURE__ */new Set,this.warnings=[],this.normalizedValuesCache=/* @__PURE__ */new Map,this.combinedNormalizedValuesCache=null,this.minQueryLength=t.minQueryLength??1,this.silent=t.silent??!1,this.state=t.state??new e(t.data??[]),this.namespace=this.state.createNamespace("search"),this.nestedCollection=new h(this.runtime.nestedStorage),this.nestedCollection.registerFields(t.nestedFields),this.state.subscribe(e=>this.handleStateMutation(e)),t.filterByPreviousResult&&(this.runtime.filterByPreviousResult=!0);const s=t.fields?.length,i=this.nestedCollection.hasRegisteredFields();if(s)for(const e of t.fields)this.indexedFields.add(e);this.dataset.length>0&&(s||i)&&this.rebuildConfiguredIndexes()}get dataset(){return this.state.getOriginData()}get runtime(){return this.state.getOrCreateScopedValue(this.namespace,"runtime",u)}get flatIndexes(){return this.runtime.flatIndexes}get indexedFields(){return this.runtime.indexedFields}shouldDeferMutationIndexUpdates(){return!0===this.state.getScopedValue(t,s)}markDeferredMutationState(){this.runtime.deferredMutationVersion=this.state.getMutationVersion(),this.flatIndexes.clear(),this.nestedCollection.clearIndexes(),this.cachedIndexedFieldsList=null,this.cachedLinearSearchFieldsList=null,this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null,this.clearPreviousSearchState()}ensureConfiguredIndexesReady(){null!==this.runtime.deferredMutationVersion&&(this.runtime.deferredMutationVersion=null,this.dataset.length>0&&(this.indexedFields.size>0||this.nestedCollection.hasRegisteredFields())&&this.rebuildConfiguredIndexes())}rebuildConfiguredIndexes(){this.flatIndexes.clear(),this.nestedCollection.clearIndexes(),this.cachedIndexedFieldsList=null,this.cachedLinearSearchFieldsList=null,this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null;for(const e of this.indexedFields)this.buildIndexFromData(this.dataset,e);this.nestedCollection.hasRegisteredFields()&&this.nestedCollection.buildIndexes(this.dataset)}buildIndexFromData(e,t){const s=this.state.getMutationVersion(),i=/* @__PURE__ */new Map,n=new Array(e.length);for(let r=0,a=e.length;r<a;r++){const s=e[r][t];if("string"!=typeof s)continue;const a=s.toLowerCase();n[r]=a,l(i,a,r)}this.flatIndexes.set(t,{ngramMap:i,normalizedValues:n,version:s})}search(e,t,s){return"string"==typeof t?this.searchField(e,t,s):this.searchAll(e,t)}searchAll(e,t){return this.searchAllFields(e,t)}normalizeQuery(e){return e.trim().toLowerCase()}normalizeSearchWindow(e){const t=Math.max(0,Math.trunc(e?.offset??0)),s=e?.limit,i=void 0===s?Number.POSITIVE_INFINITY:Math.max(0,Math.trunc(s));return{offset:t,limit:i,take:Number.isFinite(i)?t+i:Number.POSITIVE_INFINITY,hasWindow:t>0||Number.isFinite(i)}}shouldTrackPreviousResult(e){return!e.hasWindow}hasReachedWindowLimit(e,t){return Number.isFinite(e.limit)&&t>=e.limit}sliceItems(e,t){return t.hasWindow?e.slice(t.offset,t.take):e}collectItemsFromIndices(e,t){const s=t.hasWindow&&e.length>0?e.slice(t.offset,t.take):e,i=[];for(let n=0;n<s.length;n++){const e=this.dataset[s[n]];e&&i.push(e)}return{items:i,indices:s}}createLookup(e){const t=new Uint8Array(this.dataset.length);for(let s=0;s<e.length;s++)t[e[s]]=1;return t}getRestrictionLookup(e){const t=this.runtime.previousResultLookup;if(null!==t&&this.runtime.previousResultIndices===e&&t.length===this.dataset.length)return t;const s=this.createLookup(e);return this.runtime.previousResultLookup=s,s}getSearchSource(e){const{runtime:t}=this;return t.filterByPreviousResult?null!==t.previousQuery&&null!==t.previousResultIndices&&e.includes(t.previousQuery)?{indices:t.previousResultIndices,lookup:this.getRestrictionLookup(t.previousResultIndices)}:(t.previousResultIndices=null,t.previousResultLookup=null,t.previousQuery=null,{indices:null,lookup:null}):{indices:null,lookup:null}}saveSearchResult(e,t){const{runtime:s}=this;s.filterByPreviousResult&&(s.previousResultIndices=e,s.previousResultLookup=null,s.previousQuery=t)}persistSearchResult(e,t,s){s&&this.saveSearchResult(e.indices,t)}resetSearchState(){return this.clearPreviousSearchState(),this}getWarnings(){return[...this.warnings]}getStats(){const{totalQueries:e,indexedQueries:t,fallbackQueries:s,fallbackFields:i}=this.runtime.stats;return{totalQueries:e,indexedQueries:t,fallbackQueries:s,fallbackRate:0===e?0:s/e,fallbackFields:Object.fromEntries(i)}}resetStats(){const{stats:e}=this.runtime;return e.totalQueries=0,e.indexedQueries=0,e.fallbackQueries=0,e.fallbackFields.clear(),this}clearPreviousSearchState(){const{runtime:e}=this;e.previousResultIndices=null,e.previousResultLookup=null,e.previousQuery=null}recordIndexedQuery(){const{stats:e}=this.runtime;e.totalQueries+=1,e.indexedQueries+=1}recordFallbackQuery(e){const{stats:t}=this.runtime;t.totalQueries+=1,t.fallbackQueries+=1,t.fallbackFields.set(e,(t.fallbackFields.get(e)??0)+1)}shouldEmitFallbackWarning(e){return!this.silent&&e.length>=2}warnAboutFallback(e,t,s){if(!this.shouldEmitFallbackWarning(t))return;const i=`${e}\0${t}\0${s}`;if(this.emittedWarningKeys.has(i))return;this.emittedWarningKeys.add(i);const n=`[TextSearchEngine] warn: query "${t}" on ${e} used linear fallback. ${s}. Add the field(s) to the index schema to enable indexed search.`;this.warnings.push(n),"undefined"!=typeof process&&"production"!==process.env.NODE_ENV&&"test"!==process.env.NODE_ENV&&console.warn(n)}getResolvedFlatIndex(e){const t=this.state.getMutationVersion();let s=this.flatIndexes.get(e);return s&&s.version!==t&&this.dataset.length>0&&(this.buildIndexFromData(this.dataset,e),s=this.flatIndexes.get(e)),s}getQueryGrams(e){const t=function(e){const t=function(e){const t=Math.min(3,Math.max(2,e.length)),s=e.length-t+1,i=new Array(s);for(let n=0;n<s;n++)i[n]=e.substring(n,n+t);return i}(e);if(t.length<=12)return new Set(t);const s=/* @__PURE__ */new Set,i=t.length-1;for(let n=0;n<=11;n++){const e=Math.round(n*i/11);s.add(t[e])}return s}(e);return t.size>0?t:null}searchAllFields(e,t){const s=this.normalizeQuery(e),i=this.normalizeSearchWindow(t),n="all fields";if(0===i.limit)return[];if(!s||s.length<this.minQueryLength)return this.sliceItems(this.dataset,i);s.length>=2&&this.ensureConfiguredIndexesReady();const r=this.shouldTrackPreviousResult(i),{indices:l,lookup:a}=this.getSearchSource(s);let o;const d=()=>(void 0!==o||(o=s.length>=2?this.getQueryGrams(s):null),o);if(null!==l){const e=d();if(null!==e&&(this.flatIndexes.size>0||this.nestedCollection.hasIndexes())){this.recordIndexedQuery();const t=this.searchAllFieldsIndexed(s,e,i,a,l);return this.persistSearchResult(t,s,r),t.items}this.recordFallbackQuery(n);const t=this.searchLinearAllFields(this.dataset,s,l,i);return this.persistSearchResult(t,s,r),t.items}if(!this.flatIndexes.size&&!this.nestedCollection.hasIndexes()){this.warnAboutFallback(n,s,this.indexedFields.size>0?"configured indexes are not currently built":"no indexed fields are configured"),this.recordFallbackQuery(n);const e=this.searchLinearAllFields(this.dataset,s,null,i);return this.persistSearchResult(e,s,r),e.items}const h=d();if(null===h){this.recordFallbackQuery(n);const e=this.searchLinearAllFields(this.dataset,s,null,i);return this.persistSearchResult(e,s,r),e.items}this.recordIndexedQuery();const u=this.searchAllFieldsIndexed(s,h,i,null);return this.persistSearchResult(u,s,r),u.items}searchAllFieldsIndexed(e,t,s,i,n=null){if(null!==n&&!this.nestedCollection.hasRegisteredFields()&&this.flatIndexes.size>0)return this.searchAllFieldsIndexedInCandidates(e,t,s,i,n);const r=this.dataset,l=new Uint8Array(r.length),a=[];let o=0;for(const d of this.flatIndexes.keys()){const r=this.searchFieldWithPreparedQueryIndices(d,e,t,i,n);for(let e=0;e<r.length;e++){const t=r[e];if(!l[t])if(l[t]=1,o<s.offset)o+=1;else if(a.push(t),o+=1,this.hasReachedWindowLimit(s,a.length))return this.materializeIndicesResult(a)}}for(const d of this.nestedCollection.searchAllIndexedFieldIndices(e,t,i,n))if(!l[d])if(l[d]=1,o<s.offset)o+=1;else if(a.push(d),o+=1,this.hasReachedWindowLimit(s,a.length))return this.materializeIndicesResult(a);return this.materializeIndicesResult(a)}searchAllFieldsIndexedInCandidates(e,t,s,i,r){const l=[];for(const d of this.flatIndexes.keys()){const s=this.getResolvedFlatIndex(d);if(!s)continue;const i=n(s.ngramMap,t,s.normalizedValues,e);null!==i&&l.push(i.matches)}if(0===l.length)return{items:[],indices:[]};const a=[];let o=0;for(let n=0;n<r.length;n++){const e=r[n];if(null!==i&&!i[e])continue;let t=!1;for(let s=0;s<l.length;s++)if(l[s](e)){t=!0;break}if(t)if(o<s.offset)o+=1;else if(a.push(e),o+=1,this.hasReachedWindowLimit(s,a.length))break}return this.materializeIndicesResult(a)}searchField(e,t,s){const i=this.normalizeQuery(t),n=this.normalizeSearchWindow(s),r=`field "${e}"`;if(0===n.limit)return[];if(!i||i.length<this.minQueryLength)return this.sliceItems(this.dataset,n);i.length>=2&&this.ensureConfiguredIndexesReady();const l=this.shouldTrackPreviousResult(n),{indices:a,lookup:o}=this.getSearchSource(i),d=this.nestedCollection.hasField(e);let h;const u=()=>(void 0!==h||(h=i.length>=2?this.getQueryGrams(i):null),h);if(null!==a){const t=u();if(d){if(null!==t&&this.nestedCollection.hasIndexes()){this.recordIndexedQuery();const s=this.nestedCollection.searchIndexedFieldIndices(e,i,t,o,a,n.take),r=this.collectItemsFromIndices(s,n);return this.persistSearchResult(r,i,l),r.items}this.recordFallbackQuery(r);const s=this.searchLinearSingleField(this.dataset,e,i,a,n);return this.persistSearchResult(s,i,l),s.items}if(null!==t&&this.flatIndexes.has(e)){this.recordIndexedQuery();const s=this.searchFieldWithPreparedQuery(e,i,t,n,o,a);return this.persistSearchResult(s,i,l),s.items}this.recordFallbackQuery(r);const s=this.searchLinearSingleField(this.dataset,e,i,a,n);return this.persistSearchResult(s,i,l),s.items}if(d){if(i.length>=2&&this.nestedCollection.hasIndexes()){const t=this.getQueryGrams(i);if(null===t)return[];this.recordIndexedQuery();const s=this.nestedCollection.searchIndexedFieldIndices(e,i,t,null,null,n.take),r=this.collectItemsFromIndices(s,n);return this.persistSearchResult(r,i,l),r.items}this.recordFallbackQuery(r);const t=this.searchLinearSingleField(this.dataset,e,i,null,n);return this.persistSearchResult(t,i,l),t.items}this.flatIndexes.size||this.warnAboutFallback(r,i,this.indexedFields.size>0?`field "${e}" is not backed by an active index`:"no indexed fields are configured");const c=u();if(this.flatIndexes.size>0&&null!==c){if(!this.flatIndexes.has(e))return[];this.recordIndexedQuery();const t=this.searchFieldWithPreparedQuery(e,i,c,n);return this.persistSearchResult(t,i,l),t.items}this.recordFallbackQuery(r);const f=this.searchLinearSingleField(this.dataset,e,i,null,n);return this.persistSearchResult(f,i,l),f.items}searchFieldWithPreparedQuery(e,t,s,i,n=null,r=null){const l=this.searchFieldWithPreparedQueryIndices(e,t,s,n,r,i.take);return this.collectItemsFromIndices(l,i)}searchFieldWithPreparedQueryIndices(e,t,s,i=null,n=null,r=Number.POSITIVE_INFINITY){const l=this.getResolvedFlatIndex(e);if(!l)return[];const{ngramMap:d,normalizedValues:h}=l;return null!==n?o(d,s,h,t,{candidateIndices:n,restrictionLookup:i,take:r}):a(d,s,h,t,{restrictionLookup:i,take:r})}getIndexedFieldsList(){return null===this.cachedIndexedFieldsList&&(this.cachedIndexedFieldsList=Array.from(this.indexedFields)),this.cachedIndexedFieldsList}materializeIndicesResult(e){const t=[];for(let s=0;s<e.length;s++){const i=this.dataset[e[s]];i&&t.push(i)}return{items:t,indices:e}}getLinearSearchFields(e){const t=this.getIndexedFieldsList();return t.length>0?t:(null!==this.cachedLinearSearchFieldsList||(this.cachedLinearSearchFieldsList=e.length?Object.keys(e[0]).filter(t=>"string"==typeof e[0][t]):[]),this.cachedLinearSearchFieldsList)}buildNormalizedValuesOnly(e,t){const s=new Array(e.length);for(let i=0,n=e.length;i<n;i++){const n=e[i][t];"string"==typeof n&&(s[i]=n.toLowerCase())}return this.normalizedValuesCache.set(t,s),s}buildCombinedNormalizedValues(e,t){const s=new Array(e.length);for(let i=0;i<e.length;i++)s[i]=this.buildCombinedNormalizedValue(e[i],t);return this.combinedNormalizedValuesCache={fieldsKey:t.join("\0"),values:s},s}buildCombinedNormalizedValue(e,t){let s="";for(let i=0;i<t.length;i++){const n=e[t[i]];"string"==typeof n&&(s&&(s+="\n"),s+=n.toLowerCase())}return s}getCombinedNormalizedValues(e,t){if(e!==this.dataset)return null;const s=t.join("\0");return this.combinedNormalizedValuesCache?.fieldsKey===s?this.combinedNormalizedValuesCache.values:this.buildCombinedNormalizedValues(e,t)}invalidateNormalizedValuesCacheEntry(e,t){for(const[s,i]of this.normalizedValuesCache){const n=t[s];i[e]="string"==typeof n?n.toLowerCase():""}if(null!==this.combinedNormalizedValuesCache){const s=this.combinedNormalizedValuesCache.fieldsKey.split("\0");this.combinedNormalizedValuesCache.values[e]=this.buildCombinedNormalizedValue(t,s)}}searchLinearAllFields(e,t,s,i){if(!e.length)return{items:[],indices:[]};const n=this.getLinearSearchFields(e),r=e===this.dataset,l=n.length,a=new Array(l);for(let f=0;f<l;f++){const t=n[f],s=this.flatIndexes.get(t);if(s)a[f]=s.normalizedValues;else{const s=this.normalizedValuesCache.get(t);a[f]=s||(r?this.buildNormalizedValuesOnly(e,t):null)}}const o=this.nestedCollection.hasRegisteredFields(),d=o?null:this.getCombinedNormalizedValues(e,n),h=!o&&a.every(e=>null!==e),u=[];let c=0;if(null!==s){const e=this.dataset;if(null!==d){for(let e=0;e<s.length;e++){const n=s[e];if(d[n]?.includes(t))if(c<i.offset)c+=1;else if(u.push(n),c+=1,this.hasReachedWindowLimit(i,u.length))break}return this.materializeIndicesResult(u)}if(h){for(let e=0;e<s.length;e++){const n=s[e];let r=!1;for(let e=0;e<l;e++){const s=a[e][n];if(s&&s.includes(t)){r=!0;break}}if(r)if(c<i.offset)c+=1;else if(u.push(n),c+=1,this.hasReachedWindowLimit(i,u.length))break}return this.materializeIndicesResult(u)}for(let r=0;r<s.length;r++){const d=s[r],h=e[d];let f=!1;for(let e=0;e<l;e++){const s=a[e];if(s){const e=s[d];if(e&&e.includes(t)){f=!0;break}}else{const s=h[n[e]];if("string"==typeof s&&s.toLowerCase().includes(t)){f=!0;break}}}if(!f&&o&&(f=this.nestedCollection.matchesAnyField(h,t)),f)if(c<i.offset)c+=1;else if(u.push(d),c+=1,this.hasReachedWindowLimit(i,u.length))break}return this.materializeIndicesResult(u)}if(null!==d){for(let s=0;s<e.length;s++)if(d[s]?.includes(t))if(c<i.offset)c+=1;else if(u.push(s),c+=1,this.hasReachedWindowLimit(i,u.length))break;return this.materializeIndicesResult(u)}if(h){for(let s=0;s<e.length;s++){let e=!1;for(let i=0;i<l;i++){const n=a[i][s];if(n&&n.includes(t)){e=!0;break}}if(e)if(c<i.offset)c+=1;else if(u.push(s),c+=1,this.hasReachedWindowLimit(i,u.length))break}return this.materializeIndicesResult(u)}for(let f=0;f<e.length;f++){const s=e[f];let r=!1;for(let e=0;e<l;e++){const i=a[e];if(i){const e=i[f];if(e&&e.includes(t)){r=!0;break}}else{const i=s[n[e]];if("string"==typeof i&&i.toLowerCase().includes(t)){r=!0;break}}}if(!r&&o&&(r=this.nestedCollection.matchesAnyField(s,t)),r)if(c<i.offset)c+=1;else if(u.push(f),c+=1,this.hasReachedWindowLimit(i,u.length))break}return this.materializeIndicesResult(u)}searchLinearSingleField(e,t,s,i,n){if(!e.length)return{items:[],indices:[]};if(this.nestedCollection.hasField(t)){const r=this.nestedCollection.searchFieldLinearIndices(e,t,s,i??void 0);return this.collectItemsFromIndices(r,n)}const r=[],l=this.flatIndexes.get(t),a=l?l.normalizedValues:this.normalizedValuesCache.get(t)??(e===this.dataset?this.buildNormalizedValuesOnly(e,t):null);let o=0;if(null!==i){const e=this.dataset;if(a){for(let e=0;e<i.length;e++){const t=i[e];if(a[t]?.includes(s))if(o<n.offset)o+=1;else if(r.push(t),o+=1,this.hasReachedWindowLimit(n,r.length))break}return this.materializeIndicesResult(r)}for(let l=0;l<i.length;l++){const a=i[l],d=e[a];if("string"==typeof d[t]&&d[t].toLowerCase().includes(s))if(o<n.offset)o+=1;else if(r.push(a),o+=1,this.hasReachedWindowLimit(n,r.length))break}return this.materializeIndicesResult(r)}if(a){for(let t=0;t<e.length;t++)if(a[t]?.includes(s))if(o<n.offset)o+=1;else if(r.push(t),o+=1,this.hasReachedWindowLimit(n,r.length))break;return this.materializeIndicesResult(r)}for(let d=0;d<e.length;d++)if("string"==typeof e[d][t]&&e[d][t].toLowerCase().includes(s))if(o<n.offset)o+=1;else if(r.push(d),o+=1,this.hasReachedWindowLimit(n,r.length))break;return this.materializeIndicesResult(r)}clearIndexes(){return this.flatIndexes.clear(),this.nestedCollection.clearIndexes(),this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null,this}getOriginData(){return this.state.getOriginData()}data(e){return this.state.data(e),this}add(e){return this.state.add(e),this}update(e){return this.state.update(e),this}applyAddedItems(e,t){if(0===e.length)return this;for(const s of this.indexedFields)this.addItemsToField(s,e,t);return this.nestedCollection.addItems(e,t),this}clearData(){return this.state.clearData(),this}handleStateMutation(e){if(!this.shouldDeferMutationIndexUpdates()||"add"!==e.type&&"update"!==e.type)switch(e.type){case"add":this.applyAddedItems(e.items,e.startIndex);for(const[t,s]of this.normalizedValuesCache)for(let i=0;i<e.items.length;i++){const n=e.items[i][t];s[e.startIndex+i]="string"==typeof n?n.toLowerCase():""}return this.combinedNormalizedValuesCache=null,void this.clearPreviousSearchState();case"update":return this.applyUpdatedItem(e.index,e.previousItem,e.nextItem),this.invalidateNormalizedValuesCacheEntry(e.index,e.nextItem),void this.clearPreviousSearchState();case"data":return this.runtime.deferredMutationVersion=null,this.rebuildConfiguredIndexes(),this.combinedNormalizedValuesCache=null,void this.clearPreviousSearchState();case"clearData":return this.runtime.deferredMutationVersion=null,this.flatIndexes.clear(),this.nestedCollection.clearIndexes(),this.cachedLinearSearchFieldsList=null,this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null,void this.clearPreviousSearchState();case"remove":return this.applyRemovedItem(e.removedItem,e.removedIndex,e.movedItem,e.movedFromIndex),this.cachedLinearSearchFieldsList=null,this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null,void this.clearPreviousSearchState();case"removeMany":for(let t=0;t<e.entries.length;t++){const s=e.entries[t];this.applyRemovedItem(s.removedItem,s.removedIndex,s.movedItem,s.movedFromIndex)}return this.cachedLinearSearchFieldsList=null,this.normalizedValuesCache.clear(),this.combinedNormalizedValuesCache=null,void this.clearPreviousSearchState()}else this.markDeferredMutationState()}addItemsToField(e,t,s){const i=this.flatIndexes.get(e);if(!i)return;const{ngramMap:n,normalizedValues:r}=i;for(let a=0;a<t.length;a++){const i=t[a][e];if("string"!=typeof i)continue;const o=i.toLowerCase(),d=s+a;r[d]=o,l(n,o,d)}i.version=this.state.getMutationVersion()}applyUpdatedItem(e,t,s){for(const i of this.indexedFields)this.updateIndexedField(i,e,t,s);this.nestedCollection.updateItem(s,t,e)}applyRemovedItem(e,t,s,i){for(const n of this.indexedFields)this.removeIndexedFieldValue(n,e,t),null!==s&&null!==i&&this.moveIndexedFieldValue(n,s,i,t);this.nestedCollection.removeItem(e,t),null!==s&&null!==i&&this.nestedCollection.moveItem(s,i,t)}updateIndexedField(e,t,s,i){const n=this.flatIndexes.get(e);if(!n)return;if(s[e]===i[e])return void(n.version=this.state.getMutationVersion());const{ngramMap:r,normalizedValues:a}=n,o=this.getNormalizedFieldValue(s,e);o&&d(r,o,t);const h=this.getNormalizedFieldValue(i,e);if(!h)return delete a[t],void(n.version=this.state.getMutationVersion());a[t]=h,l(r,h,t),n.version=this.state.getMutationVersion()}removeIndexedFieldValue(e,t,s){const i=this.flatIndexes.get(e);if(!i)return;const{ngramMap:n,normalizedValues:r}=i,l=this.getNormalizedFieldValue(t,e);l&&d(n,l,s),delete r[s],i.version=this.state.getMutationVersion()}moveIndexedFieldValue(e,t,s,i){if(s===i)return;const n=this.flatIndexes.get(e);if(!n)return;const{ngramMap:r,normalizedValues:a}=n,o=a[s]??this.getNormalizedFieldValue(t,e);if(!o)return delete a[s],void(n.version=this.state.getMutationVersion());d(r,o,s),l(r,o,i),a[i]=o,delete a[s],n.version=this.state.getMutationVersion()}getNormalizedFieldValue(e,t){const s=e[t];return"string"==typeof s?s.toLowerCase():null}};export{c as TextSearchEngine};