@devisfuture/mega-collection 2.4.6 → 2.4.8

package/dist/filter/index.mjs

@@ -1,891 +1 @@
-import { a as e, i as t, t as n } from "../chunk-BJZg_1dI.mjs";
-import { n as r, t as i } from "../chunk-C5Zpu_ol.mjs";
-//#region src/indexer.ts
-var a = class {
-	constructor(e = {
-		indexes: /* @__PURE__ */ new Map(),
-		itemPositions: /* @__PURE__ */ new Map()
-	}) {
-		this.storage = e;
-	}
-	addItems(e) {
-		if (!(e.length === 0 || this.storage.indexes.size === 0)) for (let t = 0; t < e.length; t++) this.addItem(e[t]);
-	}
-	buildIndex(e, t) {
-		let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
-		for (let i = 0, a = e.length; i < a; i++) {
-			let a = e[i], o = a[t];
-			if (o == null) continue;
-			let s = n.get(o);
-			if (s) s.push(a), r.get(o).set(a, s.length - 1);
-			else {
-				n.set(o, [a]);
-				let e = /* @__PURE__ */ new WeakMap();
-				e.set(a, 0), r.set(o, e);
-			}
-		}
-		this.storage.indexes.set(t, n), this.storage.itemPositions.set(t, r);
-	}
-	getByValue(e, t) {
-		let n = this.storage.indexes.get(e);
-		return n ? n.get(t) ?? [] : [];
-	}
-	getByValues(e, t) {
-		let n = this.storage.indexes.get(e);
-		if (!n) return [];
-		if (t.length === 1) return n.get(t[0]) ?? [];
-		if (t.length === 2) {
-			let e = n.get(t[0]), r = n.get(t[1]);
-			return e ? r ? e.concat(r) : e : r ?? [];
-		}
-		let r = [];
-		for (let e = 0; e < t.length; e++) {
-			let i = n.get(t[e]);
-			if (i !== void 0) for (let e = 0; e < i.length; e++) r.push(i[e]);
-		}
-		return r;
-	}
-	hasIndex(e) {
-		return this.storage.indexes.has(e);
-	}
-	addItem(e) {
-		for (let t of this.storage.indexes.keys()) this.addItemToField(t, e);
-	}
-	updateItem(e, t) {
-		for (let n of this.storage.indexes.keys()) this.updateItemInField(n, e, t);
-	}
-	removeItem(e) {
-		for (let t of this.storage.indexes.keys()) this.removeItemFromField(t, e);
-	}
-	clear() {
-		this.storage.indexes.clear(), this.storage.itemPositions.clear();
-	}
-	getIndexMap(e) {
-		return this.storage.indexes.get(e);
-	}
-	removeItemFromField(e, t) {
-		let n = t[e];
-		if (n == null) return;
-		let r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e), a = r?.get(n), o = i?.get(n), s = o?.get(t);
-		if (!r || !i || !a || !o || s === void 0) return;
-		let c = a.length - 1, l = a[c];
-		s !== c && (a[s] = l, o.set(l, s)), a.pop(), o.delete(t), a.length === 0 && (r.delete(n), i.delete(n));
-	}
-	updateItemInField(e, t, n) {
-		let r = t[e];
-		if (r === n[e]) {
-			if (r == null) return;
-			this.replaceItemReferenceInField(e, r, t, n);
-			return;
-		}
-		this.removeItemFromField(e, t), this.addItemToField(e, n);
-	}
-	replaceItemReferenceInField(e, t, n, r) {
-		let i = this.storage.indexes.get(e), a = this.storage.itemPositions.get(e), o = i?.get(t), s = a?.get(t), c = s?.get(n);
-		!o || !s || c === void 0 || (o[c] = r, s.delete(n), s.set(r, c));
-	}
-	addItemToField(e, t) {
-		let n = t[e];
-		if (n == null) return;
-		let r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
-		if (!r || !i) return;
-		let a = r.get(n), o = i.get(n);
-		if (a && o) {
-			a.push(t), o.set(t, a.length - 1);
-			return;
-		}
-		r.set(n, [t]);
-		let s = /* @__PURE__ */ new WeakMap();
-		s.set(t, 0), i.set(n, s);
-	}
-}, o = class {
-	constructor(e) {
-		this.callbacks = e;
-	}
-	create(e) {
-		let t = e;
-		return Object.defineProperties(t, {
-			filter: i((t, n) => n === void 0 ? this.callbacks.filter(e, t) : this.callbacks.filter(t, n)),
-			add: i((e) => this.callbacks.add(e)),
-			update: i((e) => this.callbacks.update(e)),
-			clearIndexes: i(() => this.callbacks.clearIndexes()),
-			data: i((e) => this.callbacks.data(e)),
-			getOriginData: i(() => this.callbacks.getOriginData()),
-			clearData: i(() => this.callbacks.clearData()),
-			resetFilterState: i(() => this.callbacks.resetFilterState())
-		}), t;
-	}
-}, s = class e extends Error {
-	constructor(e) {
-		super(e), this.name = "FilterEngineError";
-	}
-	static missingDatasetForBuildIndex() {
-		return new e("FilterEngine: no dataset in memory. Call data() or add() before buildIndex().");
-	}
-	static missingDatasetForFilter() {
-		return new e("FilterEngine: no dataset in memory. Call data() or add() before filter().");
-	}
-	static duplicateMutableExcludeField(t) {
-		return new e(`FilterEngine: cannot use mutable exclude on field \`${t}\` because it contains duplicate values.`);
-	}
-};
-//#endregion
-//#region src/filter/criterion.ts
-function c(e) {
-	let t = /* @__PURE__ */ new Map();
-	for (let n = 0; n < e.length; n++) {
-		let r = e[n], i = Array.isArray(r.values), a = d(r.exclude), o = a !== null, s = i ? f(r.values, a) : null;
-		if (!i && !o) continue;
-		let c = r.field, l = t.get(c);
-		if (!l) {
-			t.set(c, {
-				field: r.field,
-				values: [],
-				exclude: [],
-				hasValues: i,
-				hasExclude: o,
-				includedValues: s ? new Set(s) : null,
-				excludedValues: a ? new Set(a) : null,
-				cacheKeySegment: ""
-			});
-			continue;
-		}
-		if (i) if (!l.hasValues) l.hasValues = !0, l.includedValues = new Set(s);
-		else for (let e of l.includedValues) s.has(e) || l.includedValues.delete(e);
-		if (o) if (!l.hasExclude) l.hasExclude = !0, l.excludedValues = new Set(a);
-		else for (let e of a) l.excludedValues.add(e);
-	}
-	let n = [...t.values()].sort((e, t) => e.field.localeCompare(t.field));
-	for (let e = 0; e < n.length; e++) p(n[e]);
-	return n;
-}
-function l(e, t) {
-	return !(e.hasValues && !e.includedValues.has(t) || e.hasExclude && e.excludedValues.has(t));
-}
-function u(e) {
-	return e.hasValues && e.values.length === 0;
-}
-function d(e) {
-	return !Array.isArray(e) || e.length === 0 ? null : new Set(e);
-}
-function f(e, t) {
-	let n = /* @__PURE__ */ new Set();
-	for (let r = 0; r < e.length; r++) {
-		let i = e[r];
-		t?.has(i) || n.add(i);
-	}
-	return n;
-}
-function p(e) {
-	if (e.hasValues && e.hasExclude) for (let t of e.excludedValues) e.includedValues.delete(t);
-	e.values = e.includedValues ? [...e.includedValues] : [], e.exclude = e.excludedValues ? [...e.excludedValues] : [], e.cacheKeySegment = m(e);
-}
-function m(e) {
-	let t = e.field;
-	return t += `|hv:${e.hasValues ? "1" : "0"}|v:`, e.hasValues && (t += h(e.values)), t += `|hx:${e.hasExclude ? "1" : "0"}|x:`, e.hasExclude && (t += h(e.exclude)), t;
-}
-function h(e) {
-	return e.length === 0 ? "" : e.map((e) => g(e)).sort().join(",");
-}
-function g(e) {
-	if (e === null) return "null:null";
-	let t = typeof e;
-	return t === "object" ? `object:${JSON.stringify(e)}` : `${t}:${String(e)}`;
-}
-//#endregion
-//#region src/filter/nested.ts
-var _ = class {
-	constructor(e = {
-		indexes: /* @__PURE__ */ new Map(),
-		itemPositions: /* @__PURE__ */ new Map()
-	}) {
-		this.storage = e, this.registeredFields = /* @__PURE__ */ new Set(), this.fieldDescriptors = /* @__PURE__ */ new Map();
-	}
-	registerFields(e) {
-		if (e?.length) for (let t = 0; t < e.length; t++) this.registerField(e[t]);
-	}
-	hasRegisteredFields() {
-		return this.registeredFields.size > 0;
-	}
-	hasField(e) {
-		return this.registeredFields.has(e);
-	}
-	clearIndexes() {
-		this.storage.indexes.clear(), this.storage.itemPositions.clear();
-	}
-	buildIndexes(e) {
-		this.storage.indexes.clear(), this.storage.itemPositions.clear();
-		for (let t of this.registeredFields) this.buildIndex(e, t);
-	}
-	addItems(e) {
-		if (!(e.length === 0 || this.storage.indexes.size === 0)) for (let t = 0; t < e.length; t++) this.addItem(e[t]);
-	}
-	removeItem(e) {
-		for (let t of this.storage.indexes.keys()) this.removeItemFromIndex(t, e);
-	}
-	updateItem(e, t) {
-		for (let n of this.storage.indexes.keys()) this.updateItemInIndex(n, e, t);
-	}
-	filter(e, t, n) {
-		let r = this.resolveCriteria(t);
-		if (e.length === 0 || r.length === 0) return e;
-		let i = [], a = [];
-		for (let e = 0; e < r.length; e++) {
-			let t = r[e];
-			if (this.storage.indexes.has(t.field)) {
-				i.push(t);
-				continue;
-			}
-			a.push(t);
-		}
-		let o = e;
-		if (i.length > 0 && (o = this.filterByIndexes(i, e, n), o.length === 0)) return o;
-		for (let e = 0; e < a.length; e++) if (o = this.filterLinearly(o, a[e]), o.length === 0) return o;
-		return o;
-	}
-	resolveCriteria(e) {
-		if (e.length === 0) return [];
-		let t = e[0];
-		return "hasValues" in t && "hasExclude" in t && "includedValues" in t ? e : c(e);
-	}
-	registerField(e) {
-		let t = r(e);
-		t && (this.registeredFields.add(e), this.fieldDescriptors.set(e, t));
-	}
-	buildIndex(e, t) {
-		let n = this.fieldDescriptors.get(t);
-		if (!n) return;
-		let { collectionKey: r, nestedKey: i } = n, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
-		for (let t = 0, n = e.length; t < n; t++) {
-			let n = e[t], s = n[r];
-			if (Array.isArray(s)) for (let e = 0; e < s.length; e++) {
-				let t = s[e][i];
-				if (t == null) continue;
-				let r = a.get(t);
-				if (r) {
-					r[r.length - 1] !== n && (r.push(n), o.get(t).set(n, r.length - 1));
-					continue;
-				}
-				a.set(t, [n]);
-				let c = /* @__PURE__ */ new WeakMap();
-				c.set(n, 0), o.set(t, c);
-			}
-		}
-		this.storage.indexes.set(t, a), this.storage.itemPositions.set(t, o);
-	}
-	removeItemFromIndex(e, t) {
-		let n = this.fieldDescriptors.get(e), r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
-		if (!n || !r || !i) return;
-		let { collectionKey: a, nestedKey: o } = n, s = t[a];
-		if (!Array.isArray(s) || s.length === 0) return;
-		let c = /* @__PURE__ */ new Set();
-		for (let e = 0; e < s.length; e++) {
-			let t = s[e][o];
-			t != null && c.add(t);
-		}
-		for (let e of c) {
-			let n = r.get(e), a = i.get(e), o = a?.get(t);
-			if (!n || !a || o === void 0) continue;
-			let s = n.length - 1, c = n[s];
-			o !== s && (n[o] = c, a.set(c, o)), n.pop(), a.delete(t), n.length === 0 && (r.delete(e), i.delete(e));
-		}
-	}
-	addItem(e) {
-		for (let t of this.storage.indexes.keys()) this.addItemToIndex(t, e);
-	}
-	addItemToIndex(e, t) {
-		let n = this.fieldDescriptors.get(e), r = this.storage.indexes.get(e), i = this.storage.itemPositions.get(e);
-		if (!n || !r || !i) return;
-		let { collectionKey: a, nestedKey: o } = n, s = t[a];
-		if (!Array.isArray(s) || s.length === 0) return;
-		let c = /* @__PURE__ */ new Set();
-		for (let e = 0; e < s.length; e++) {
-			let t = s[e][o];
-			t != null && c.add(t);
-		}
-		for (let e of c) {
-			let n = r.get(e), a = i.get(e);
-			if (n && a) {
-				n.push(t), a.set(t, n.length - 1);
-				continue;
-			}
-			r.set(e, [t]);
-			let o = /* @__PURE__ */ new WeakMap();
-			o.set(t, 0), i.set(e, o);
-		}
-	}
-	updateItemInIndex(e, t, n) {
-		let r = this.fieldDescriptors.get(e), i = this.storage.indexes.get(e), a = this.storage.itemPositions.get(e);
-		if (!r || !i || !a) return;
-		let o = this.collectUniqueValues(n, r), s = this.collectUniqueValues(t, r);
-		if (this.areValueSetsEqual(o, s)) {
-			for (let e of o) {
-				let r = i.get(e), o = a.get(e), s = o?.get(n);
-				!r || !o || s === void 0 || (r[s] = t, o.delete(n), o.set(t, s));
-			}
-			return;
-		}
-		this.removeItemFromIndex(e, n), this.addItemToIndex(e, t);
-	}
-	collectUniqueValues(e, t) {
-		let { collectionKey: n, nestedKey: r } = t, i = e[n], a = /* @__PURE__ */ new Set();
-		if (!Array.isArray(i) || i.length === 0) return a;
-		for (let e = 0; e < i.length; e++) {
-			let t = i[e][r];
-			t != null && a.add(t);
-		}
-		return a;
-	}
-	areValueSetsEqual(e, t) {
-		if (e.size !== t.size) return !1;
-		for (let n of e) if (!t.has(n)) return !1;
-		return !0;
-	}
-	filterByIndexes(e, t, n) {
-		let r = e.filter((e) => e.hasValues), i = e.filter((e) => e.hasExclude), a = t === n ? null : new Set(t);
-		if (r.length === 0) return this.applyIndexedExclusions(t, i);
-		if (r.length === 1) {
-			let e = this.storage.indexes.get(r[0].field);
-			if (!e) return [];
-			let t = this.getItemsByValues(e, r[0].values);
-			if (t.length === 0) return [];
-			let n = [];
-			for (let e = 0; e < t.length; e++) {
-				let r = t[e];
-				a && !a.has(r) || n.push(r);
-			}
-			return this.applyIndexedExclusions(n, i);
-		}
-		let o = r.map((e) => ({
-			criterion: e,
-			size: this.estimateIndexSize(e)
-		})).sort((e, t) => e.size - t.size), s = a, c = [];
-		for (let e = 0; e < o.length; e++) {
-			let { criterion: t } = o[e], n = this.storage.indexes.get(t.field);
-			if (!n) return [];
-			let r = this.getItemsByValues(n, t.values);
-			if (r.length === 0) return [];
-			if (s === null) c = r;
-			else {
-				c = [];
-				for (let e = 0; e < r.length; e++) {
-					let t = r[e];
-					s.has(t) && c.push(t);
-				}
-			}
-			if (c.length === 0) return [];
-			s = new Set(c);
-		}
-		return this.applyIndexedExclusions(c, i);
-	}
-	getItemsByValues(e, t) {
-		if (t.length === 1) return e.get(t[0]) ?? [];
-		let n = /* @__PURE__ */ new Set(), r = [];
-		for (let i = 0; i < t.length; i++) {
-			let a = e.get(t[i]);
-			if (a) for (let e = 0; e < a.length; e++) {
-				let t = a[e];
-				n.has(t) || (n.add(t), r.push(t));
-			}
-		}
-		return r;
-	}
-	estimateIndexSize(e) {
-		let t = this.storage.indexes.get(e.field);
-		return t ? e.values.reduce((e, n) => {
-			let r = t.get(n);
-			return r ? e + r.length : e;
-		}, 0) : Infinity;
-	}
-	filterLinearly(e, t) {
-		let n = this.fieldDescriptors.get(t.field);
-		if (!n) return e;
-		let { collectionKey: r, nestedKey: i } = n, a = [];
-		for (let n = 0; n < e.length; n++) {
-			let o = e[n], s = o[r];
-			if (!Array.isArray(s)) continue;
-			let c = !t.hasValues, l = !1;
-			for (let e = 0; e < s.length; e++) {
-				let n = s[e][i];
-				if (t.hasExclude && t.excludedValues.has(n)) {
-					l = !0;
-					break;
-				}
-				t.hasValues && t.includedValues.has(n) && (c = !0);
-			}
-			!l && c && a.push(o);
-		}
-		return a;
-	}
-	applyIndexedExclusions(e, t) {
-		if (t.length === 0 || e.length === 0) return e;
-		let n = /* @__PURE__ */ new Set();
-		for (let e = 0; e < t.length; e++) {
-			let r = t[e], i = this.storage.indexes.get(r.field);
-			if (!i) continue;
-			let a = this.getItemsByValues(i, r.exclude);
-			for (let e = 0; e < a.length; e++) n.add(a[e]);
-		}
-		if (n.size === 0) return e;
-		let r = [];
-		for (let t = 0; t < e.length; t++) {
-			let i = e[t];
-			n.has(i) || r.push(i);
-		}
-		return r;
-	}
-}, v = () => ({
-	indexedFields: /* @__PURE__ */ new Set(),
-	indexerStorage: {
-		indexes: /* @__PURE__ */ new Map(),
-		itemPositions: /* @__PURE__ */ new Map()
-	},
-	nestedStorage: {
-		indexes: /* @__PURE__ */ new Map(),
-		itemPositions: /* @__PURE__ */ new Map()
-	},
-	deferredMutationVersion: null,
-	mutableExclude: {
-		datasetPositions: /* @__PURE__ */ new Map(),
-		valueCounts: /* @__PURE__ */ new Map(),
-		duplicateValueCount: 0,
-		hasDuplicateValues: !1
-	},
-	sequentialCache: {
-		previousResult: null,
-		previousCriteria: null,
-		previousCriteriaKey: null,
-		previousBaseData: null,
-		previousResultsByCriteria: /* @__PURE__ */ new Map(),
-		previousResultSet: null
-	}
-}), y = class {
-	constructor(t = {}) {
-		this.chainBuilder = new o({
-			filter: (e, t) => t === void 0 ? this.filter(e) : this.filter(e, t),
-			getOriginData: () => this.getOriginData(),
-			add: (e) => this.add(e),
-			update: (e) => this.update(e),
-			data: (e) => this.data(e),
-			clearIndexes: () => this.clearIndexes(),
-			clearData: () => this.clearData(),
-			resetFilterState: () => this.resetFilterState()
-		}), this.mutableExcludeField = t.mutableExcludeField ?? null, this.state = t.state ?? new e(t.data ?? [], { filterByPreviousResult: t.filterByPreviousResult ?? !1 }), t.state && t.filterByPreviousResult && this.state.setFilterByPreviousResult(!0), this.filterByPreviousResult = this.state.isFilterByPreviousResultEnabled(), this.namespace = this.state.createNamespace("filter"), this.indexer = new a(this.runtime.indexerStorage), this.nestedCollection = new _(this.runtime.nestedStorage), this.nestedCollection.registerFields(t.nestedFields), this.state.subscribe((e) => this.handleStateMutation(e)), this.rebuildMutableExcludeState();
-		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", v);
-	}
-	get mutableExcludeState() {
-		return this.runtime.mutableExclude;
-	}
-	get indexedFields() {
-		return this.runtime.indexedFields;
-	}
-	get sequentialCache() {
-		return this.runtime.sequentialCache;
-	}
-	shouldDeferMutationIndexUpdates() {
-		return this.state.getScopedValue(t, n) === !0;
-	}
-	markDeferredMutationState() {
-		this.runtime.deferredMutationVersion = this.state.getMutationVersion(), this.indexer.clear(), this.nestedCollection.clearIndexes(), this.clearMutableExcludeState(), this.resetFilterState();
-	}
-	ensureRuntimeReady() {
-		this.runtime.deferredMutationVersion !== null && (this.runtime.deferredMutationVersion = null, this.rebuildMutableExcludeState(), this.dataset.length > 0 && (this.indexedFields.size > 0 || this.nestedCollection.hasRegisteredFields()) && this.rebuildConfiguredIndexes());
-	}
-	rebuildConfiguredIndexes() {
-		this.indexer.clear(), this.nestedCollection.clearIndexes();
-		for (let e of this.indexedFields) this.buildIndex(this.dataset, e);
-		this.nestedCollection.hasRegisteredFields() && this.nestedCollection.buildIndexes(this.dataset);
-	}
-	buildIndex(e, t) {
-		if (!Array.isArray(e)) {
-			if (!this.dataset.length) throw s.missingDatasetForBuildIndex();
-			return this.indexer.buildIndex(this.dataset, e), this;
-		}
-		return this.resetFilterState(), this.rebuildMutableExcludeState(), this.indexer.buildIndex(e, t), this;
-	}
-	clearIndexes() {
-		return this.indexer.clear(), this.nestedCollection.clearIndexes(), this;
-	}
-	resetFilterState() {
-		return this.sequentialCache.previousResult = null, this.sequentialCache.previousCriteria = null, this.sequentialCache.previousCriteriaKey = null, this.sequentialCache.previousBaseData = null, this.sequentialCache.previousResultsByCriteria.clear(), this.sequentialCache.previousResultSet = null, this.state.clearPreviousResult(), this;
-	}
-	clearData() {
-		return this.state.clearData(), this;
-	}
-	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) {
-		return e.length === 0 ? this : (this.updateMutableExcludeStateForAddedItems(e, t), this.resetFilterState(), this.indexer.addItems(e), this.nestedCollection.addItems(e), this);
-	}
-	getOriginData() {
-		return this.state.getOriginData();
-	}
-	filter(e, t) {
-		return t === void 0 ? this.withChain(this.rawFilter(e)) : this.withChain(this.rawFilter(e, t));
-	}
-	rawFilter(e, t) {
-		this.ensureRuntimeReady();
-		let n = t === void 0;
-		if (n && !this.dataset.length) throw s.missingDatasetForFilter();
-		let r = c(n ? e : t), i = n ? this.dataset : e;
-		if (n) {
-			let e = this.applyMutableExclude(r);
-			if (e !== void 0) return e;
-		}
-		let a = i, o = r;
-		if (this.filterByPreviousResult) {
-			let e = this.resolveWithSequentialCache(i, n, r);
-			if (e.isFromCache) return e.result;
-			a = e.sourceData, o = e.executionCriteria;
-		}
-		if (r.length === 0) return this.filterByPreviousResult && this.resetFilterState(), i;
-		for (let e = 0; e < o.length; e++) if (u(o[e])) return this.createEmptyResult(n, i, r);
-		let l = [], d = [];
-		for (let e = 0; e < o.length; e++) {
-			let t = o[e];
-			this.nestedCollection.hasField(t.field) ? l.push(t) : d.push(t);
-		}
-		if (l.length > 0 && (a = this.nestedCollection.filter(a, l, this.dataset), a.length === 0)) return this.createEmptyResult(n, i, r);
-		if (d.length === 0) return this.storePreviousResult(a, n, i, r), a;
-		let f = [], p = [];
-		for (let e = 0; e < d.length; e++) {
-			let t = d[e];
-			this.indexer.hasIndex(t.field) ? f.push(t) : p.push(t);
-		}
-		let m;
-		if (f.length > 0 && p.length === 0) return m = this.filterViaIndex(f, a), this.storePreviousResult(m, n, i, r), m;
-		if (f.length > 0 && p.length > 0) {
-			let e = this.filterViaIndex(f, a);
-			return m = this.linearFilter(e, p), this.storePreviousResult(m, n, i, r), m;
-		}
-		return m = this.linearFilter(a, d), this.storePreviousResult(m, n, i, r), m;
-	}
-	resolveWithSequentialCache(e, t, n) {
-		let { previousResult: r, previousCriteria: i, previousCriteriaKey: a, previousBaseData: o, previousResultsByCriteria: s } = this.sequentialCache;
-		if (r === null || i === null || o !== e) return {
-			isFromCache: !1,
-			sourceData: e,
-			executionCriteria: n
-		};
-		let c = this.createCriteriaCacheKey(n), l = s.get(c);
-		if (c === a) return {
-			isFromCache: !0,
-			result: r
-		};
-		if (l !== void 0) return this.storePreviousResult(l.result, t, e, n, c, l.resultSet), {
-			isFromCache: !0,
-			result: l.result
-		};
-		let u = this.hasCriteriaBacktrack(i, n) || r.length === 0 && !this.canApplySequentiallyToEmptyResult(i, n);
-		return {
-			isFromCache: !1,
-			sourceData: u ? e : r,
-			executionCriteria: u ? n : this.createSequentialExecutionCriteria(i, n)
-		};
-	}
-	withChain(e) {
-		return this.chainBuilder.create(e);
-	}
-	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);
-				return;
-			case "update":
-				this.applyUpdatedItem(e.index, e.previousItem, e.nextItem);
-				return;
-			case "data":
-				this.runtime.deferredMutationVersion = null, this.rebuildMutableExcludeState(), this.resetFilterState(), this.rebuildConfiguredIndexes();
-				return;
-			case "clearData":
-				this.runtime.deferredMutationVersion = null, this.clearMutableExcludeState(), this.indexer.clear(), this.nestedCollection.clearIndexes(), this.resetFilterState();
-				return;
-			case "remove":
-				this.applyRemovedItem(e.field, e.value, e.removedItem, e.removedIndex, e.movedItem);
-				return;
-			case "removeMany":
-				this.applyRemovedItems(e.field, e.entries);
-				return;
-		}
-	}
-	rebuildMutableExcludeState() {
-		if (this.clearMutableExcludeState(), this.mutableExcludeField !== null) for (let e = 0; e < this.dataset.length; e++) {
-			let t = this.dataset[e][this.mutableExcludeField];
-			t != null && this.registerMutableExcludeValue(t, e);
-		}
-	}
-	updateMutableExcludeStateForAddedItems(e, t) {
-		if (this.mutableExcludeField !== null) for (let n = 0; n < e.length; n++) {
-			let r = e[n][this.mutableExcludeField];
-			r != null && this.registerMutableExcludeValue(r, t + n);
-		}
-	}
-	applyMutableExclude(e) {
-		if (this.mutableExcludeField === null || e.length !== 1) return;
-		let t = e[0];
-		if (!(t.field !== this.mutableExcludeField || t.hasValues || !t.hasExclude)) {
-			if (this.mutableExcludeState.hasDuplicateValues) throw s.duplicateMutableExcludeField(this.mutableExcludeField);
-			return this.state.removeByFieldValues(this.mutableExcludeField, t.exclude), this.resetFilterState(), this.dataset;
-		}
-	}
-	applyUpdatedItem(e, t, n) {
-		this.updateMutableExcludeStateForUpdatedItem(e, t, n), this.resetFilterState(), this.indexer.updateItem(t, n), this.nestedCollection.updateItem(n, t);
-	}
-	applyRemovedItem(e, t, n, r, i) {
-		if (e === this.mutableExcludeField && (this.unregisterMutableExcludeValue(t), this.mutableExcludeState.datasetPositions.delete(t), i !== null && this.mutableExcludeField !== null)) {
-			let e = i[this.mutableExcludeField];
-			e != null && this.mutableExcludeState.datasetPositions.set(e, r);
-		}
-		this.resetFilterState(), this.indexer.removeItem(n), this.nestedCollection.removeItem(n);
-	}
-	applyRemovedItems(e, t) {
-		for (let n = 0; n < t.length; n++) {
-			let r = t[n];
-			if (e === this.mutableExcludeField && (this.unregisterMutableExcludeValue(r.value), this.mutableExcludeState.datasetPositions.delete(r.value), r.movedItem !== null && this.mutableExcludeField !== null)) {
-				let e = r.movedItem[this.mutableExcludeField];
-				e != null && this.mutableExcludeState.datasetPositions.set(e, r.removedIndex);
-			}
-			this.indexer.removeItem(r.removedItem), this.nestedCollection.removeItem(r.removedItem);
-		}
-		this.resetFilterState();
-	}
-	updateMutableExcludeStateForUpdatedItem(e, t, n) {
-		if (this.mutableExcludeField === null) return;
-		let r = t[this.mutableExcludeField], i = n[this.mutableExcludeField];
-		if (r === i) {
-			i != null && this.mutableExcludeState.datasetPositions.set(i, e);
-			return;
-		}
-		r != null && (this.unregisterMutableExcludeValue(r), this.mutableExcludeState.datasetPositions.get(r) === e && this.mutableExcludeState.datasetPositions.delete(r)), i != null && this.registerMutableExcludeValue(i, e);
-	}
-	clearMutableExcludeState() {
-		this.mutableExcludeState.datasetPositions.clear(), this.mutableExcludeState.valueCounts.clear(), this.mutableExcludeState.duplicateValueCount = 0, this.mutableExcludeState.hasDuplicateValues = !1;
-	}
-	registerMutableExcludeValue(e, t) {
-		let n = (this.mutableExcludeState.valueCounts.get(e) ?? 0) + 1;
-		n === 2 && this.mutableExcludeState.duplicateValueCount++, this.mutableExcludeState.valueCounts.set(e, n), this.mutableExcludeState.datasetPositions.set(e, t), this.mutableExcludeState.hasDuplicateValues = this.mutableExcludeState.duplicateValueCount > 0;
-	}
-	unregisterMutableExcludeValue(e) {
-		let t = this.mutableExcludeState.valueCounts.get(e);
-		t !== void 0 && (t === 2 && this.mutableExcludeState.duplicateValueCount--, t <= 1 ? this.mutableExcludeState.valueCounts.delete(e) : this.mutableExcludeState.valueCounts.set(e, t - 1), this.mutableExcludeState.hasDuplicateValues = this.mutableExcludeState.duplicateValueCount > 0);
-	}
-	linearFilter(e, t) {
-		let n = [];
-		for (let r = 0; r < e.length; r++) {
-			let i = e[r], a = !0;
-			for (let e = 0; e < t.length; e++) {
-				let n = t[e];
-				if (!l(n, i[n.field])) {
-					a = !1;
-					break;
-				}
-			}
-			a && n.push(i);
-		}
-		return n;
-	}
-	filterViaIndex(e, t) {
-		let n = t !== this.dataset, r = null;
-		if (n) {
-			if (t === this.sequentialCache.previousResult && this.sequentialCache.previousResultSet !== null) r = this.sequentialCache.previousResultSet;
-			else if (r = new Set(t), t === this.sequentialCache.previousResult) {
-				this.sequentialCache.previousResultSet = r;
-				let e = this.sequentialCache.previousCriteriaKey;
-				if (e !== null) {
-					let t = this.sequentialCache.previousResultsByCriteria.get(e);
-					t && (t.resultSet = r);
-				}
-			}
-		}
-		let i = [], a = [];
-		for (let t = 0; t < e.length; t++) {
-			let n = e[t];
-			n.hasValues && i.push(n), n.hasExclude && a.push(n);
-		}
-		if (i.length === 0) return this.applyIndexedExclusions(t, a);
-		if (i.length === 1) {
-			let e = i[0], t = !1;
-			for (let n = 0; n < a.length; n++) if (a[n].field !== e.field) {
-				t = !0;
-				break;
-			}
-			if (r === null && !t) return e.values.length === 1 ? this.indexer.getByValue(e.field, e.values[0]).slice() : this.indexer.getByValues(e.field, e.values);
-			let n = this.indexer.getByValues(e.field, e.values), o = [];
-			for (let e = 0; e < n.length; e++) {
-				let t = n[e];
-				r && !r.has(t) || o.push(t);
-			}
-			return this.applyIndexedExclusions(o, a);
-		}
-		let o = i[0], s = this.estimateIndexSize(o);
-		for (let e = 1; e < i.length; e++) {
-			let t = i[e], n = this.estimateIndexSize(t);
-			n < s && (o = t, s = n);
-		}
-		let c = this.indexer.getByValues(o.field, o.values);
-		if (c.length === 0) return [];
-		let u = [];
-		for (let e = 0; e < c.length; e++) {
-			let t = c[e], n = !0;
-			if (!(r && !r.has(t))) {
-				for (let e = 0; e < i.length; e++) {
-					let r = i[e];
-					if (r !== o && !l(r, t[r.field])) {
-						n = !1;
-						break;
-					}
-				}
-				n && u.push(t);
-			}
-		}
-		return this.applyIndexedExclusions(u, a);
-	}
-	estimateIndexSize(e) {
-		let t = this.indexer.getIndexMap(e.field);
-		if (!t) return Infinity;
-		let n = 0;
-		for (let r = 0; r < e.values.length; r++) {
-			let i = t.get(e.values[r]);
-			i && (n += i.length);
-		}
-		return n;
-	}
-	applyIndexedExclusions(e, t) {
-		if (t.length === 0 || e.length === 0) return e;
-		let n = /* @__PURE__ */ new Set();
-		for (let e = 0; e < t.length; e++) {
-			let r = t[e], i = this.indexer.getIndexMap(r.field);
-			if (i) for (let e = 0; e < r.exclude.length; e++) {
-				let t = i.get(r.exclude[e]);
-				if (t) for (let e = 0; e < t.length; e++) n.add(t[e]);
-			}
-		}
-		if (n.size === 0) return e;
-		let r = [];
-		for (let t = 0; t < e.length; t++) {
-			let i = e[t];
-			n.has(i) || r.push(i);
-		}
-		return r;
-	}
-	createEmptyResult(e, t, n) {
-		let r = [];
-		return this.storePreviousResult(r, e, t, n), r;
-	}
-	storePreviousResult(e, t, n, r, i = this.createCriteriaCacheKey(r), a) {
-		if (!this.filterByPreviousResult) return;
-		let o = a === void 0 ? null : a;
-		this.sequentialCache.previousResult = e, this.sequentialCache.previousCriteria = r, this.sequentialCache.previousCriteriaKey = i, this.sequentialCache.previousBaseData = t ? this.dataset : n, this.sequentialCache.previousResultSet = o, this.state.setPreviousResult(e, t ? this.dataset : n), this.sequentialCache.previousResultsByCriteria.set(i, this.createSequentialCacheEntry(e, o));
-	}
-	createCriteriaCacheKey(e) {
-		let t = "";
-		for (let n = 0; n < e.length; n++) t += e[n].cacheKeySegment, t += ";";
-		return t;
-	}
-	createSequentialCacheEntry(e, t) {
-		return {
-			result: e,
-			resultSet: t
-		};
-	}
-	createSequentialExecutionCriteria(e, t) {
-		let n = /* @__PURE__ */ new Map();
-		for (let t = 0; t < e.length; t++) {
-			let r = e[t];
-			n.set(r.field, r);
-		}
-		return t.map((e) => {
-			let t = n.get(e.field);
-			if (!t || !t.hasValues || !e.hasValues || t.hasExclude || e.hasExclude || e.includedValues.size <= t.includedValues.size) return e;
-			for (let n of t.includedValues) if (!e.includedValues.has(n)) return e;
-			let r = [];
-			for (let n of e.includedValues) t.includedValues.has(n) || r.push(n);
-			return r.length === 0 ? e : {
-				...e,
-				values: r,
-				includedValues: new Set(r)
-			};
-		});
-	}
-	hasCriteriaBacktrack(e, t) {
-		let n = this.createCriteriaStateMap(e), r = this.createCriteriaStateMap(t);
-		for (let [e, t] of n) {
-			let n = r.get(e);
-			if (!n || this.isCriterionBacktracked(t, n)) return !0;
-		}
-		return !1;
-	}
-	canApplySequentiallyToEmptyResult(e, t) {
-		let n = this.createCriteriaStateMap(e), r = this.createCriteriaStateMap(t);
-		for (let [e, t] of r) {
-			let r = n.get(e);
-			if (r) {
-				if (r.hasValues !== t.hasValues && (r.hasValues || !t.hasValues)) return !1;
-				if (r.hasValues && t.hasValues) {
-					let e = r.includedValues, n = t.includedValues;
-					if (!this.areSetsEqual(e, n) && !this.isSubset(e, n)) return !1;
-				}
-				if (r.hasExclude !== t.hasExclude && (r.hasExclude || !t.hasExclude)) return !1;
-				if (r.hasExclude && t.hasExclude) {
-					let e = r.excludedValues, n = t.excludedValues;
-					if (!this.areSetsEqual(e, n) && !this.isSubset(e, n)) return !1;
-				}
-			}
-		}
-		return !0;
-	}
-	createCriteriaStateMap(e) {
-		let t = /* @__PURE__ */ new Map();
-		for (let n = 0; n < e.length; n++) {
-			let r = e[n];
-			t.set(r.field, r);
-		}
-		return t;
-	}
-	isCriterionBacktracked(e, t) {
-		if (e.hasValues && !t.hasValues) return !0;
-		if (e.hasValues && t.hasValues) {
-			let n = e.includedValues, r = t.includedValues;
-			if (!this.areSetsEqual(n, r)) return this.isSubset(r, n);
-		}
-		if (!e.hasValues && t.hasValues) return !1;
-		if (e.hasExclude && !t.hasExclude) return !0;
-		if (!e.hasExclude && t.hasExclude) return !1;
-		if (e.hasExclude && t.hasExclude) {
-			let n = e.excludedValues, r = t.excludedValues;
-			if (!this.areSetsEqual(n, r)) return this.isSubset(r, n);
-		}
-		return !1;
-	}
-	isSubset(e, t) {
-		for (let n of e) if (!t.has(n)) return !1;
-		return !0;
-	}
-	areSetsEqual(e, t) {
-		if (e === t) return !0;
-		if (!e || !t || e.size !== t.size) return !1;
-		for (let n of e) if (!t.has(n)) return !1;
-		return !0;
-	}
-};
-//#endregion
-export { y as FilterEngine };
+import{a as e,i as t,t as s}from"../chunks/constants-BXQI1M5E.mjs";import{n as i,t as l}from"../chunks/internal-COJC3Ik3.mjs";var a=class{constructor(e={indexes:/* @__PURE__ */new Map,itemPositions:/* @__PURE__ */new Map}){this.storage=e}addItems(e){if(0!==e.length&&0!==this.storage.indexes.size)for(let t=0;t<e.length;t++)this.addItem(e[t])}buildIndex(e,t){const s=/* @__PURE__ */new Map,i=/* @__PURE__ */new Map;for(let l=0,a=e.length;l<a;l++){const a=e[l],r=a[t];if(null==r)continue;const n=s.get(r);if(n)n.push(a),i.get(r).set(a,n.length-1);else{s.set(r,[a]);const e=/* @__PURE__ */new WeakMap;e.set(a,0),i.set(r,e)}}this.storage.indexes.set(t,s),this.storage.itemPositions.set(t,i)}getByValue(e,t){const s=this.storage.indexes.get(e);return s?s.get(t)??[]:[]}getByValues(e,t){const s=this.storage.indexes.get(e);if(!s)return[];if(1===t.length)return s.get(t[0])??[];if(2===t.length){const e=s.get(t[0]),i=s.get(t[1]);return e?i?e.concat(i):e:i??[]}const i=[];for(let l=0;l<t.length;l++){const e=s.get(t[l]);if(void 0!==e)for(let t=0;t<e.length;t++)i.push(e[t])}return i}hasIndex(e){return this.storage.indexes.has(e)}addItem(e){for(const t of this.storage.indexes.keys())this.addItemToField(t,e)}updateItem(e,t){for(const s of this.storage.indexes.keys())this.updateItemInField(s,e,t)}removeItem(e){for(const t of this.storage.indexes.keys())this.removeItemFromField(t,e)}clear(){this.storage.indexes.clear(),this.storage.itemPositions.clear()}getIndexMap(e){return this.storage.indexes.get(e)}removeItemFromField(e,t){const s=t[e];if(null==s)return;const i=this.storage.indexes.get(e),l=this.storage.itemPositions.get(e),a=i?.get(s),r=l?.get(s),n=r?.get(t);if(!(i&&l&&a&&r&&void 0!==n))return;const u=a.length-1,d=a[u];n!==u&&(a[n]=d,r.set(d,n)),a.pop(),r.delete(t),0===a.length&&(i.delete(s),l.delete(s))}updateItemInField(e,t,s){const i=t[e];if(i!==s[e])this.removeItemFromField(e,t),this.addItemToField(e,s);else{if(null==i)return;this.replaceItemReferenceInField(e,i,t,s)}}replaceItemReferenceInField(e,t,s,i){const l=this.storage.indexes.get(e),a=this.storage.itemPositions.get(e),r=l?.get(t),n=a?.get(t),u=n?.get(s);r&&n&&void 0!==u&&(r[u]=i,n.delete(s),n.set(i,u))}addItemToField(e,t){const s=t[e];if(null==s)return;const i=this.storage.indexes.get(e),l=this.storage.itemPositions.get(e);if(!i||!l)return;const a=i.get(s),r=l.get(s);if(a&&r)return a.push(t),void r.set(t,a.length-1);i.set(s,[t]);const n=/* @__PURE__ */new WeakMap;n.set(t,0),l.set(s,n)}},r=class{constructor(e){this.callbacks=e}create(e){const t=e;return Object.defineProperties(t,{filter:l((t,s)=>void 0===s?this.callbacks.filter(e,t):this.callbacks.filter(t,s)),add:l(e=>this.callbacks.add(e)),update:l(e=>this.callbacks.update(e)),clearIndexes:l(()=>this.callbacks.clearIndexes()),data:l(e=>this.callbacks.data(e)),getOriginData:l(()=>this.callbacks.getOriginData()),clearData:l(()=>this.callbacks.clearData()),resetFilterState:l(()=>this.callbacks.resetFilterState())}),t}},n=class e extends Error{constructor(e){super(e),this.name="FilterEngineError"}static missingDatasetForBuildIndex(){return new e("FilterEngine: no dataset in memory. Call data() or add() before buildIndex().")}static missingDatasetForFilter(){return new e("FilterEngine: no dataset in memory. Call data() or add() before filter().")}static duplicateMutableExcludeField(t){return new e(`FilterEngine: cannot use mutable exclude on field \`${t}\` because it contains duplicate values.`)}};function u(e){const t=/* @__PURE__ */new Map;for(let i=0;i<e.length;i++){const s=e[i],l=Array.isArray(s.values),a=h(s.exclude),r=null!==a,n=l?c(s.values,a):null;if(!l&&!r)continue;const u=s.field,d=t.get(u);if(d){if(l)if(d.hasValues)for(const e of d.includedValues)n.has(e)||d.includedValues.delete(e);else d.hasValues=!0,d.includedValues=new Set(n);if(r)if(d.hasExclude)for(const e of a)d.excludedValues.add(e);else d.hasExclude=!0,d.excludedValues=new Set(a)}else t.set(u,{field:s.field,values:[],exclude:[],hasValues:l,hasExclude:r,includedValues:n?new Set(n):null,excludedValues:a?new Set(a):null,cacheKeySegment:""})}const s=[...t.values()].sort((e,t)=>e.field.localeCompare(t.field));for(let i=0;i<s.length;i++)f(s[i]);return s}function d(e,t){return!(e.hasValues&&!e.includedValues.has(t)||e.hasExclude&&e.excludedValues.has(t))}function o(e){return e.hasValues&&0===e.values.length}function h(e){return Array.isArray(e)&&0!==e.length?new Set(e):null}function c(e,t){const s=/* @__PURE__ */new Set;for(let i=0;i<e.length;i++){const l=e[i];t?.has(l)||s.add(l)}return s}function f(e){if(e.hasValues&&e.hasExclude)for(const t of e.excludedValues)e.includedValues.delete(t);e.values=e.includedValues?[...e.includedValues]:[],e.exclude=e.excludedValues?[...e.excludedValues]:[],e.cacheKeySegment=function(e){let t=e.field;return t+=`|hv:${e.hasValues?"1":"0"}|v:`,e.hasValues&&(t+=g(e.values)),t+=`|hx:${e.hasExclude?"1":"0"}|x:`,e.hasExclude&&(t+=g(e.exclude)),t}(e)}function g(e){return 0===e.length?"":e.map(e=>function(e){if(null===e)return"null:null";const t=typeof e;return"object"===t?`object:${JSON.stringify(e)}`:`${t}:${String(e)}`}(e)).sort().join(",")}var x=class{constructor(e={indexes:/* @__PURE__ */new Map,itemPositions:/* @__PURE__ */new Map}){this.storage=e,this.registeredFields=/* @__PURE__ */new Set,this.fieldDescriptors=/* @__PURE__ */new Map}registerFields(e){if(e?.length)for(let t=0;t<e.length;t++)this.registerField(e[t])}hasRegisteredFields(){return this.registeredFields.size>0}hasField(e){return this.registeredFields.has(e)}clearIndexes(){this.storage.indexes.clear(),this.storage.itemPositions.clear()}buildIndexes(e){this.storage.indexes.clear(),this.storage.itemPositions.clear();for(const t of this.registeredFields)this.buildIndex(e,t)}addItems(e){if(0!==e.length&&0!==this.storage.indexes.size)for(let t=0;t<e.length;t++)this.addItem(e[t])}removeItem(e){for(const t of this.storage.indexes.keys())this.removeItemFromIndex(t,e)}updateItem(e,t){for(const s of this.storage.indexes.keys())this.updateItemInIndex(s,e,t)}filter(e,t,s){const i=this.resolveCriteria(t);if(0===e.length||0===i.length)return e;const l=[],a=[];for(let n=0;n<i.length;n++){const e=i[n];this.storage.indexes.has(e.field)?l.push(e):a.push(e)}let r=e;if(l.length>0&&(r=this.filterByIndexes(l,e,s),0===r.length))return r;for(let n=0;n<a.length;n++)if(r=this.filterLinearly(r,a[n]),0===r.length)return r;return r}resolveCriteria(e){if(0===e.length)return[];const t=e[0];return"hasValues"in t&&"hasExclude"in t&&"includedValues"in t?e:u(e)}registerField(e){const t=i(e);t&&(this.registeredFields.add(e),this.fieldDescriptors.set(e,t))}buildIndex(e,t){const s=this.fieldDescriptors.get(t);if(!s)return;const{collectionKey:i,nestedKey:l}=s,a=/* @__PURE__ */new Map,r=/* @__PURE__ */new Map;for(let n=0,u=e.length;n<u;n++){const t=e[n],s=t[i];if(Array.isArray(s))for(let e=0;e<s.length;e++){const i=s[e][l];if(null==i)continue;const n=a.get(i);if(n){n[n.length-1]!==t&&(n.push(t),r.get(i).set(t,n.length-1));continue}a.set(i,[t]);const u=/* @__PURE__ */new WeakMap;u.set(t,0),r.set(i,u)}}this.storage.indexes.set(t,a),this.storage.itemPositions.set(t,r)}removeItemFromIndex(e,t){const s=this.fieldDescriptors.get(e),i=this.storage.indexes.get(e),l=this.storage.itemPositions.get(e);if(!s||!i||!l)return;const{collectionKey:a,nestedKey:r}=s,n=t[a];if(!Array.isArray(n)||0===n.length)return;const u=/* @__PURE__ */new Set;for(let d=0;d<n.length;d++){const e=n[d][r];null!=e&&u.add(e)}for(const d of u){const e=i.get(d),s=l.get(d),a=s?.get(t);if(!e||!s||void 0===a)continue;const r=e.length-1,n=e[r];a!==r&&(e[a]=n,s.set(n,a)),e.pop(),s.delete(t),0===e.length&&(i.delete(d),l.delete(d))}}addItem(e){for(const t of this.storage.indexes.keys())this.addItemToIndex(t,e)}addItemToIndex(e,t){const s=this.fieldDescriptors.get(e),i=this.storage.indexes.get(e),l=this.storage.itemPositions.get(e);if(!s||!i||!l)return;const{collectionKey:a,nestedKey:r}=s,n=t[a];if(!Array.isArray(n)||0===n.length)return;const u=/* @__PURE__ */new Set;for(let d=0;d<n.length;d++){const e=n[d][r];null!=e&&u.add(e)}for(const d of u){const e=i.get(d),s=l.get(d);if(e&&s){e.push(t),s.set(t,e.length-1);continue}i.set(d,[t]);const a=/* @__PURE__ */new WeakMap;a.set(t,0),l.set(d,a)}}updateItemInIndex(e,t,s){const i=this.fieldDescriptors.get(e),l=this.storage.indexes.get(e),a=this.storage.itemPositions.get(e);if(!i||!l||!a)return;const r=this.collectUniqueValues(s,i),n=this.collectUniqueValues(t,i);if(this.areValueSetsEqual(r,n))for(const u of r){const e=l.get(u),i=a.get(u),r=i?.get(s);e&&i&&void 0!==r&&(e[r]=t,i.delete(s),i.set(t,r))}else this.removeItemFromIndex(e,s),this.addItemToIndex(e,t)}collectUniqueValues(e,t){const{collectionKey:s,nestedKey:i}=t,l=e[s],a=/* @__PURE__ */new Set;if(!Array.isArray(l)||0===l.length)return a;for(let r=0;r<l.length;r++){const e=l[r][i];null!=e&&a.add(e)}return a}areValueSetsEqual(e,t){if(e.size!==t.size)return!1;for(const s of e)if(!t.has(s))return!1;return!0}filterByIndexes(e,t,s){const i=e.filter(e=>e.hasValues),l=e.filter(e=>e.hasExclude),a=t===s?null:new Set(t);if(0===i.length)return this.applyIndexedExclusions(t,l);if(1===i.length){const e=this.storage.indexes.get(i[0].field);if(!e)return[];const t=this.getItemsByValues(e,i[0].values);if(0===t.length)return[];const s=[];for(let i=0;i<t.length;i++){const e=t[i];a&&!a.has(e)||s.push(e)}return this.applyIndexedExclusions(s,l)}const r=i.map(e=>({criterion:e,size:this.estimateIndexSize(e)})).sort((e,t)=>e.size-t.size);let n=a,u=[];for(let d=0;d<r.length;d++){const{criterion:e}=r[d],t=this.storage.indexes.get(e.field);if(!t)return[];const s=this.getItemsByValues(t,e.values);if(0===s.length)return[];if(null===n)u=s;else{u=[];for(let e=0;e<s.length;e++){const t=s[e];n.has(t)&&u.push(t)}}if(0===u.length)return[];n=new Set(u)}return this.applyIndexedExclusions(u,l)}getItemsByValues(e,t){if(1===t.length)return e.get(t[0])??[];const s=/* @__PURE__ */new Set,i=[];for(let l=0;l<t.length;l++){const a=e.get(t[l]);if(a)for(let e=0;e<a.length;e++){const t=a[e];s.has(t)||(s.add(t),i.push(t))}}return i}estimateIndexSize(e){const t=this.storage.indexes.get(e.field);return t?e.values.reduce((e,s)=>{const i=t.get(s);return i?e+i.length:e},0):1/0}filterLinearly(e,t){const s=this.fieldDescriptors.get(t.field);if(!s)return e;const{collectionKey:i,nestedKey:l}=s,a=[];for(let r=0;r<e.length;r++){const s=e[r],n=s[i];if(!Array.isArray(n))continue;let u=!t.hasValues,d=!1;for(let e=0;e<n.length;e++){const s=n[e][l];if(t.hasExclude&&t.excludedValues.has(s)){d=!0;break}t.hasValues&&t.includedValues.has(s)&&(u=!0)}!d&&u&&a.push(s)}return a}applyIndexedExclusions(e,t){if(0===t.length||0===e.length)return e;const s=/* @__PURE__ */new Set;for(let l=0;l<t.length;l++){const e=t[l],i=this.storage.indexes.get(e.field);if(!i)continue;const a=this.getItemsByValues(i,e.exclude);for(let t=0;t<a.length;t++)s.add(a[t])}if(0===s.size)return e;const i=[];for(let l=0;l<e.length;l++){const t=e[l];s.has(t)||i.push(t)}return i}},m=()=>({indexedFields:/* @__PURE__ */new Set,indexerStorage:{indexes:/* @__PURE__ */new Map,itemPositions:/* @__PURE__ */new Map},nestedStorage:{indexes:/* @__PURE__ */new Map,itemPositions:/* @__PURE__ */new Map},deferredMutationVersion:null,mutableExclude:{datasetPositions:/* @__PURE__ */new Map,valueCounts:/* @__PURE__ */new Map,duplicateValueCount:0,hasDuplicateValues:!1},sequentialCache:{previousResult:null,previousCriteria:null,previousCriteriaKey:null,previousBaseData:null,previousResultsByCriteria:/* @__PURE__ */new Map,previousResultSet:null}}),p=class{constructor(t={}){this.chainBuilder=new r({filter:(e,t)=>void 0===t?this.filter(e):this.filter(e,t),getOriginData:()=>this.getOriginData(),add:e=>this.add(e),update:e=>this.update(e),data:e=>this.data(e),clearIndexes:()=>this.clearIndexes(),clearData:()=>this.clearData(),resetFilterState:()=>this.resetFilterState()}),this.mutableExcludeField=t.mutableExcludeField??null,this.state=t.state??new e(t.data??[],{filterByPreviousResult:t.filterByPreviousResult??!1}),t.state&&t.filterByPreviousResult&&this.state.setFilterByPreviousResult(!0),this.filterByPreviousResult=this.state.isFilterByPreviousResultEnabled(),this.namespace=this.state.createNamespace("filter"),this.indexer=new a(this.runtime.indexerStorage),this.nestedCollection=new x(this.runtime.nestedStorage),this.nestedCollection.registerFields(t.nestedFields),this.state.subscribe(e=>this.handleStateMutation(e)),this.rebuildMutableExcludeState();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",m)}get mutableExcludeState(){return this.runtime.mutableExclude}get indexedFields(){return this.runtime.indexedFields}get sequentialCache(){return this.runtime.sequentialCache}shouldDeferMutationIndexUpdates(){return!0===this.state.getScopedValue(t,s)}markDeferredMutationState(){this.runtime.deferredMutationVersion=this.state.getMutationVersion(),this.indexer.clear(),this.nestedCollection.clearIndexes(),this.clearMutableExcludeState(),this.resetFilterState()}ensureRuntimeReady(){null!==this.runtime.deferredMutationVersion&&(this.runtime.deferredMutationVersion=null,this.rebuildMutableExcludeState(),this.dataset.length>0&&(this.indexedFields.size>0||this.nestedCollection.hasRegisteredFields())&&this.rebuildConfiguredIndexes())}rebuildConfiguredIndexes(){this.indexer.clear(),this.nestedCollection.clearIndexes();for(const e of this.indexedFields)this.buildIndex(this.dataset,e);this.nestedCollection.hasRegisteredFields()&&this.nestedCollection.buildIndexes(this.dataset)}buildIndex(e,t){if(!Array.isArray(e)){if(!this.dataset.length)throw n.missingDatasetForBuildIndex();return this.indexer.buildIndex(this.dataset,e),this}return this.resetFilterState(),this.rebuildMutableExcludeState(),this.indexer.buildIndex(e,t),this}clearIndexes(){return this.indexer.clear(),this.nestedCollection.clearIndexes(),this}resetFilterState(){return this.sequentialCache.previousResult=null,this.sequentialCache.previousCriteria=null,this.sequentialCache.previousCriteriaKey=null,this.sequentialCache.previousBaseData=null,this.sequentialCache.previousResultsByCriteria.clear(),this.sequentialCache.previousResultSet=null,this.state.clearPreviousResult(),this}clearData(){return this.state.clearData(),this}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){return 0===e.length||(this.updateMutableExcludeStateForAddedItems(e,t),this.resetFilterState(),this.indexer.addItems(e),this.nestedCollection.addItems(e)),this}getOriginData(){return this.state.getOriginData()}filter(e,t){return void 0===t?this.withChain(this.rawFilter(e)):this.withChain(this.rawFilter(e,t))}rawFilter(e,t){this.ensureRuntimeReady();const s=void 0===t;if(s&&!this.dataset.length)throw n.missingDatasetForFilter();const i=u(s?e:t),l=s?this.dataset:e;if(s){const e=this.applyMutableExclude(i);if(void 0!==e)return e}let a=l,r=i;if(this.filterByPreviousResult){const e=this.resolveWithSequentialCache(l,s,i);if(e.isFromCache)return e.result;a=e.sourceData,r=e.executionCriteria}if(0===i.length)return this.filterByPreviousResult&&this.resetFilterState(),l;for(let n=0;n<r.length;n++)if(o(r[n]))return this.createEmptyResult(s,l,i);const d=[],h=[];for(let n=0;n<r.length;n++){const e=r[n];this.nestedCollection.hasField(e.field)?d.push(e):h.push(e)}if(d.length>0&&(a=this.nestedCollection.filter(a,d,this.dataset),0===a.length))return this.createEmptyResult(s,l,i);if(0===h.length)return this.storePreviousResult(a,s,l,i),a;const c=[],f=[];for(let n=0;n<h.length;n++){const e=h[n];this.indexer.hasIndex(e.field)?c.push(e):f.push(e)}let g;if(c.length>0&&0===f.length)return g=this.filterViaIndex(c,a),this.storePreviousResult(g,s,l,i),g;if(c.length>0&&f.length>0){const e=this.filterViaIndex(c,a);return g=this.linearFilter(e,f),this.storePreviousResult(g,s,l,i),g}return g=this.linearFilter(a,h),this.storePreviousResult(g,s,l,i),g}resolveWithSequentialCache(e,t,s){const{previousResult:i,previousCriteria:l,previousCriteriaKey:a,previousBaseData:r,previousResultsByCriteria:n}=this.sequentialCache;if(null===i||null===l||r!==e)return{isFromCache:!1,sourceData:e,executionCriteria:s};const u=this.createCriteriaCacheKey(s),d=n.get(u);if(u===a)return{isFromCache:!0,result:i};if(void 0!==d)return this.storePreviousResult(d.result,t,e,s,u,d.resultSet),{isFromCache:!0,result:d.result};const o=this.hasCriteriaBacktrack(l,s)||0===i.length&&!this.canApplySequentiallyToEmptyResult(l,s);return{isFromCache:!1,sourceData:o?e:i,executionCriteria:o?s:this.createSequentialExecutionCriteria(l,s)}}withChain(e){return this.chainBuilder.create(e)}handleStateMutation(e){if(!this.shouldDeferMutationIndexUpdates()||"add"!==e.type&&"update"!==e.type)switch(e.type){case"add":return void this.applyAddedItems(e.items,e.startIndex);case"update":return void this.applyUpdatedItem(e.index,e.previousItem,e.nextItem);case"data":return this.runtime.deferredMutationVersion=null,this.rebuildMutableExcludeState(),this.resetFilterState(),void this.rebuildConfiguredIndexes();case"clearData":return this.runtime.deferredMutationVersion=null,this.clearMutableExcludeState(),this.indexer.clear(),this.nestedCollection.clearIndexes(),void this.resetFilterState();case"remove":return void this.applyRemovedItem(e.field,e.value,e.removedItem,e.removedIndex,e.movedItem);case"removeMany":return void this.applyRemovedItems(e.field,e.entries)}else this.markDeferredMutationState()}rebuildMutableExcludeState(){if(this.clearMutableExcludeState(),null!==this.mutableExcludeField)for(let e=0;e<this.dataset.length;e++){const t=this.dataset[e][this.mutableExcludeField];null!=t&&this.registerMutableExcludeValue(t,e)}}updateMutableExcludeStateForAddedItems(e,t){if(null!==this.mutableExcludeField)for(let s=0;s<e.length;s++){const i=e[s][this.mutableExcludeField];null!=i&&this.registerMutableExcludeValue(i,t+s)}}applyMutableExclude(e){if(null===this.mutableExcludeField||1!==e.length)return;const t=e[0];if(t.field===this.mutableExcludeField&&!t.hasValues&&t.hasExclude){if(this.mutableExcludeState.hasDuplicateValues)throw n.duplicateMutableExcludeField(this.mutableExcludeField);return this.state.removeByFieldValues(this.mutableExcludeField,t.exclude),this.resetFilterState(),this.dataset}}applyUpdatedItem(e,t,s){this.updateMutableExcludeStateForUpdatedItem(e,t,s),this.resetFilterState(),this.indexer.updateItem(t,s),this.nestedCollection.updateItem(s,t)}applyRemovedItem(e,t,s,i,l){if(e===this.mutableExcludeField&&(this.unregisterMutableExcludeValue(t),this.mutableExcludeState.datasetPositions.delete(t),null!==l&&null!==this.mutableExcludeField)){const e=l[this.mutableExcludeField];null!=e&&this.mutableExcludeState.datasetPositions.set(e,i)}this.resetFilterState(),this.indexer.removeItem(s),this.nestedCollection.removeItem(s)}applyRemovedItems(e,t){for(let s=0;s<t.length;s++){const i=t[s];if(e===this.mutableExcludeField&&(this.unregisterMutableExcludeValue(i.value),this.mutableExcludeState.datasetPositions.delete(i.value),null!==i.movedItem&&null!==this.mutableExcludeField)){const e=i.movedItem[this.mutableExcludeField];null!=e&&this.mutableExcludeState.datasetPositions.set(e,i.removedIndex)}this.indexer.removeItem(i.removedItem),this.nestedCollection.removeItem(i.removedItem)}this.resetFilterState()}updateMutableExcludeStateForUpdatedItem(e,t,s){if(null===this.mutableExcludeField)return;const i=t[this.mutableExcludeField],l=s[this.mutableExcludeField];i!==l?(null!=i&&(this.unregisterMutableExcludeValue(i),this.mutableExcludeState.datasetPositions.get(i)===e&&this.mutableExcludeState.datasetPositions.delete(i)),null!=l&&this.registerMutableExcludeValue(l,e)):null!=l&&this.mutableExcludeState.datasetPositions.set(l,e)}clearMutableExcludeState(){this.mutableExcludeState.datasetPositions.clear(),this.mutableExcludeState.valueCounts.clear(),this.mutableExcludeState.duplicateValueCount=0,this.mutableExcludeState.hasDuplicateValues=!1}registerMutableExcludeValue(e,t){const s=(this.mutableExcludeState.valueCounts.get(e)??0)+1;2===s&&this.mutableExcludeState.duplicateValueCount++,this.mutableExcludeState.valueCounts.set(e,s),this.mutableExcludeState.datasetPositions.set(e,t),this.mutableExcludeState.hasDuplicateValues=this.mutableExcludeState.duplicateValueCount>0}unregisterMutableExcludeValue(e){const t=this.mutableExcludeState.valueCounts.get(e);void 0!==t&&(2===t&&this.mutableExcludeState.duplicateValueCount--,t<=1?this.mutableExcludeState.valueCounts.delete(e):this.mutableExcludeState.valueCounts.set(e,t-1),this.mutableExcludeState.hasDuplicateValues=this.mutableExcludeState.duplicateValueCount>0)}linearFilter(e,t){const s=[];for(let i=0;i<e.length;i++){const l=e[i];let a=!0;for(let e=0;e<t.length;e++){const s=t[e];if(!d(s,l[s.field])){a=!1;break}}a&&s.push(l)}return s}filterViaIndex(e,t){let s=null;if(t!==this.dataset)if(t===this.sequentialCache.previousResult&&null!==this.sequentialCache.previousResultSet)s=this.sequentialCache.previousResultSet;else if(s=new Set(t),t===this.sequentialCache.previousResult){this.sequentialCache.previousResultSet=s;const e=this.sequentialCache.previousCriteriaKey;if(null!==e){const t=this.sequentialCache.previousResultsByCriteria.get(e);t&&(t.resultSet=s)}}const i=[],l=[];for(let d=0;d<e.length;d++){const t=e[d];t.hasValues&&i.push(t),t.hasExclude&&l.push(t)}if(0===i.length)return this.applyIndexedExclusions(t,l);if(1===i.length){const e=i[0];let t=!1;for(let s=0;s<l.length;s++)if(l[s].field!==e.field){t=!0;break}if(null===s&&!t)return 1===e.values.length?this.indexer.getByValue(e.field,e.values[0]).slice():this.indexer.getByValues(e.field,e.values);const a=this.indexer.getByValues(e.field,e.values),r=[];for(let i=0;i<a.length;i++){const e=a[i];s&&!s.has(e)||r.push(e)}return this.applyIndexedExclusions(r,l)}let a=i[0],r=this.estimateIndexSize(a);for(let d=1;d<i.length;d++){const e=i[d],t=this.estimateIndexSize(e);t<r&&(a=e,r=t)}const n=this.indexer.getByValues(a.field,a.values);if(0===n.length)return[];const u=[];for(let o=0;o<n.length;o++){const e=n[o];let t=!0;if(!s||s.has(e)){for(let s=0;s<i.length;s++){const l=i[s];if(l!==a&&!d(l,e[l.field])){t=!1;break}}t&&u.push(e)}}return this.applyIndexedExclusions(u,l)}estimateIndexSize(e){const t=this.indexer.getIndexMap(e.field);if(!t)return 1/0;let s=0;for(let i=0;i<e.values.length;i++){const l=t.get(e.values[i]);l&&(s+=l.length)}return s}applyIndexedExclusions(e,t){if(0===t.length||0===e.length)return e;const s=/* @__PURE__ */new Set;for(let l=0;l<t.length;l++){const e=t[l],i=this.indexer.getIndexMap(e.field);if(i)for(let t=0;t<e.exclude.length;t++){const l=i.get(e.exclude[t]);if(l)for(let e=0;e<l.length;e++)s.add(l[e])}}if(0===s.size)return e;const i=[];for(let l=0;l<e.length;l++){const t=e[l];s.has(t)||i.push(t)}return i}createEmptyResult(e,t,s){const i=[];return this.storePreviousResult(i,e,t,s),i}storePreviousResult(e,t,s,i,l=this.createCriteriaCacheKey(i),a){if(!this.filterByPreviousResult)return;const r=void 0===a?null:a;this.sequentialCache.previousResult=e,this.sequentialCache.previousCriteria=i,this.sequentialCache.previousCriteriaKey=l,this.sequentialCache.previousBaseData=t?this.dataset:s,this.sequentialCache.previousResultSet=r,this.state.setPreviousResult(e,t?this.dataset:s),this.sequentialCache.previousResultsByCriteria.set(l,this.createSequentialCacheEntry(e,r))}createCriteriaCacheKey(e){let t="";for(let s=0;s<e.length;s++)t+=e[s].cacheKeySegment,t+=";";return t}createSequentialCacheEntry(e,t){return{result:e,resultSet:t}}createSequentialExecutionCriteria(e,t){const s=/* @__PURE__ */new Map;for(let i=0;i<e.length;i++){const t=e[i];s.set(t.field,t)}return t.map(e=>{const t=s.get(e.field);if(!t||!t.hasValues||!e.hasValues||t.hasExclude||e.hasExclude)return e;if(e.includedValues.size<=t.includedValues.size)return e;for(const s of t.includedValues)if(!e.includedValues.has(s))return e;const i=[];for(const s of e.includedValues)t.includedValues.has(s)||i.push(s);return 0===i.length?e:{...e,values:i,includedValues:new Set(i)}})}hasCriteriaBacktrack(e,t){const s=this.createCriteriaStateMap(e),i=this.createCriteriaStateMap(t);for(const[l,a]of s){const e=i.get(l);if(!e)return!0;if(this.isCriterionBacktracked(a,e))return!0}return!1}canApplySequentiallyToEmptyResult(e,t){const s=this.createCriteriaStateMap(e),i=this.createCriteriaStateMap(t);for(const[l,a]of i){const e=s.get(l);if(e){if(e.hasValues!==a.hasValues&&(e.hasValues||!a.hasValues))return!1;if(e.hasValues&&a.hasValues){const t=e.includedValues,s=a.includedValues;if(!this.areSetsEqual(t,s)&&!this.isSubset(t,s))return!1}if(e.hasExclude!==a.hasExclude&&(e.hasExclude||!a.hasExclude))return!1;if(e.hasExclude&&a.hasExclude){const t=e.excludedValues,s=a.excludedValues;if(!this.areSetsEqual(t,s)&&!this.isSubset(t,s))return!1}}}return!0}createCriteriaStateMap(e){const t=/* @__PURE__ */new Map;for(let s=0;s<e.length;s++){const i=e[s];t.set(i.field,i)}return t}isCriterionBacktracked(e,t){if(e.hasValues&&!t.hasValues)return!0;if(e.hasValues&&t.hasValues){const s=e.includedValues,i=t.includedValues;if(!this.areSetsEqual(s,i))return this.isSubset(i,s)}if(!e.hasValues&&t.hasValues)return!1;if(e.hasExclude&&!t.hasExclude)return!0;if(!e.hasExclude&&t.hasExclude)return!1;if(e.hasExclude&&t.hasExclude){const s=e.excludedValues,i=t.excludedValues;if(!this.areSetsEqual(s,i))return this.isSubset(i,s)}return!1}isSubset(e,t){for(const s of e)if(!t.has(s))return!1;return!0}areSetsEqual(e,t){if(e===t)return!0;if(!e||!t||e.size!==t.size)return!1;for(const s of e)if(!t.has(s))return!1;return!0}};export{p as FilterEngine};