@devisfuture/mega-collection 2.4.4 → 2.4.5

package/dist/{chunk-BTXXf5A-.mjs → chunk-BJZg_1dI.mjs}

@@ -178,6 +178,6 @@ var e = class {
 		this.itemIndexLookup = /* @__PURE__ */ new WeakMap();
 		for (let e = 0; e < this.originData.length; e++) this.itemIndexLookup.set(this.originData[e], e);
 	}
-}, t = "__merge__";
+}, t = "__merge__", n = "deferFilterMutationIndexUpdates", r = "deferSearchMutationIndexUpdates", i = "deferSortMutationCacheUpdates";
 //#endregion
-export { e as n, t };
+export { e as a, t as i, r as n, i as r, n as t };

package/dist/{chunk-l_-R9TTp.mjs → chunk-BURK5sks.mjs}

@@ -1,72 +1,65 @@
-import { n as e, t } from "./chunk-BTXXf5A-.mjs";
+import { a as e, i as t, n, r, t as i } from "./chunk-BJZg_1dI.mjs";
+import { t as a } from "./chunk-C5Zpu_ol.mjs";
 //#region src/merge/chain.ts
-function n(e) {
-	return {
-		value: e,
-		enumerable: !1,
-		configurable: !0,
-		writable: !0
-	};
-}
-var r = class {
+var o = class {
 	constructor(e) {
 		this.callbacks = e;
 	}
 	create(e) {
 		let t = e;
 		return Object.defineProperties(t, {
-			search: n((e, t) => t === void 0 ? this.callbacks.search(e) : this.callbacks.search(e, t)),
-			sort: n((t, n, r) => n === void 0 ? this.callbacks.sort(e, t, r) : this.callbacks.sort(t, n, r)),
-			filter: n((t, n) => n === void 0 ? this.callbacks.filter(e, t) : this.callbacks.filter(t, n)),
-			add: n((e) => this.callbacks.add(e)),
-			update: n((e) => this.callbacks.update(e)),
-			clearIndexes: n((t) => (this.callbacks.clearIndexes(t), this.create(e))),
-			clearData: n((t) => (this.callbacks.clearData(t), this.create(e))),
-			data: n((e) => this.callbacks.data(e)),
-			getOriginData: n(() => this.callbacks.getOriginData())
+			search: a((e, t) => t === void 0 ? this.callbacks.search(e) : this.callbacks.search(e, t)),
+			sort: a((t, n, r) => n === void 0 ? this.callbacks.sort(e, t, r) : this.callbacks.sort(t, n, r)),
+			filter: a((t, n) => n === void 0 ? this.callbacks.filter(e, t) : this.callbacks.filter(t, n)),
+			add: a((e) => this.callbacks.add(e)),
+			update: a((e) => this.callbacks.update(e)),
+			clearIndexes: a((t) => (this.callbacks.clearIndexes(t), this.create(e))),
+			clearData: a((t) => (this.callbacks.clearData(t), this.create(e))),
+			data: a((e) => this.callbacks.data(e)),
+			getOriginData: a(() => this.callbacks.getOriginData())
 		}), t;
 	}
 };
 //#endregion
 //#region src/merge/module-adapters.ts
-function i(e) {
+function s(e) {
 	return typeof e == "object" && !!e;
 }
-function a(e, t) {
-	return i(e) && typeof e[t] == "function";
+function c(e, t) {
+	return s(e) && typeof e[t] == "function";
 }
-function o(e) {
-	return a(e, "search") && a(e, "getOriginData");
+function l(e) {
+	return c(e, "search") && c(e, "getOriginData");
 }
-function s(e) {
-	return a(e, "sort") && a(e, "getOriginData");
+function u(e) {
+	return c(e, "sort") && c(e, "getOriginData");
 }
-function c(e) {
-	return a(e, "rawFilter") && a(e, "getOriginData");
+function d(e) {
+	return c(e, "rawFilter") && c(e, "getOriginData");
 }
-var l = (e) => {
+var f = (e) => {
 	let { prototype: t } = e;
-	return c(t) ? "filter" : s(t) ? "sort" : o(t) ? "search" : null;
-}, u = (e, t, n, r) => {
+	return d(t) ? "filter" : u(t) ? "sort" : l(t) ? "search" : null;
+}, p = (e, t, n, r) => {
 	let i = new e({
 		data: t,
 		state: n,
 		...r
 	});
-	return c(i) ? {
+	return d(i) ? {
 		moduleName: "filter",
 		executeFilter: (e, t) => t === void 0 ? i.rawFilter(e) : i.rawFilter(e, t),
 		clearIndexes: () => i.clearIndexes()
-	} : s(i) ? {
+	} : u(i) ? {
 		moduleName: "sort",
 		executeSort: (e, t, n) => t === void 0 ? i.sort(e) : i.sort(e, t, n),
 		clearIndexes: () => i.clearIndexes()
-	} : o(i) ? {
+	} : l(i) ? {
 		moduleName: "search",
 		executeSearch: (e, t) => t === void 0 ? i.search(e) : i.search(e, t),
 		clearIndexes: () => i.clearIndexes()
 	} : null;
-}, d = "deferSortMutationCacheUpdates", f = "deferSearchMutationIndexUpdates", p = "deferFilterMutationIndexUpdates", m = {
+}, m = {
 	search: "TextSearchEngine",
 	sort: "SortEngine",
 	filter: "FilterEngine"
@@ -85,18 +78,18 @@ var l = (e) => {
 		return new e("MergeEngines: \"filter.filterByPreviousResult\" is not supported. Configure \"filterByPreviousResult\" on the MergeEngines root options.");
 	}
 }, g = class {
-	constructor(n) {
+	constructor(a) {
 		this.previousSearchState = null, this.previousFilterState = null, this.previousSortState = null;
-		let { imports: i, data: a, filterByPreviousResult: o = !1, ...s } = n;
-		this.validateFilterByPreviousResultOptions(s.filter), this.state = new e(a, { filterByPreviousResult: o });
-		let c = new Set(i), m = null, h = null, g = null;
-		for (let e of c) {
-			let t = l(e);
+		let { imports: s, data: c, filterByPreviousResult: l = !1, ...u } = a;
+		this.validateFilterByPreviousResultOptions(u.filter), this.state = new e(c, { filterByPreviousResult: l });
+		let d = new Set(s), m = null, h = null, g = null;
+		for (let e of d) {
+			let t = f(e);
 			if (!t) continue;
-			let n = this.getModuleInitOptions(t, e.name, s), r = u(e, a, this.state, n);
+			let n = this.getModuleInitOptions(t, e.name, u), r = p(e, c, this.state, n);
 			r && (r.moduleName === "search" && !m && (m = r), r.moduleName === "sort" && !h && (h = r), r.moduleName === "filter" && !g && (g = r));
 		}
-		this.searchModule = m, this.sortModule = h, this.filterModule = g, this.sortModule && this.state.setScopedValue(t, d, !0), this.searchModule && this.state.setScopedValue(t, f, !0), this.filterModule && this.state.setScopedValue(t, p, !0), this.state.subscribe((e) => this.handleStateMutation(e)), this.chainBuilder = new r({
+		this.searchModule = m, this.sortModule = h, this.filterModule = g, this.sortModule && this.state.setScopedValue(t, r, !0), this.searchModule && this.state.setScopedValue(t, n, !0), this.filterModule && this.state.setScopedValue(t, i, !0), this.state.subscribe((e) => this.handleStateMutation(e)), this.chainBuilder = new o({
 			search: (e, t) => t === void 0 ? this.search(e) : this.search(e, t),
 			sort: (e, t, n) => this.sort(e, t, n),
 			filter: (e, t) => this.filter(e, t),
@@ -113,14 +106,14 @@ var l = (e) => {
 	}
 	getModuleInitOptions(e, t, n) {
 		let r = {};
-		for (let a of [e, t]) {
-			let e = n[a];
-			i(e) && Object.assign(r, e);
+		for (let i of [e, t]) {
+			let e = n[i];
+			s(e) && Object.assign(r, e);
 		}
 		return r;
 	}
 	validateFilterByPreviousResultOptions(e) {
-		if (i(e) && Object.prototype.hasOwnProperty.call(e, "filterByPreviousResult")) throw h.invalidFilterByPreviousResultOption();
+		if (s(e) && Object.prototype.hasOwnProperty.call(e, "filterByPreviousResult")) throw h.invalidFilterByPreviousResultOption();
 	}
 	isPreviousResultEnabled() {
 		return this.state.isFilterByPreviousResultEnabled();

package/dist/chunk-C5Zpu_ol.mjs

@@ -0,0 +1,18 @@
+//#region src/internal.ts
+function e(e) {
+	return {
+		value: e,
+		enumerable: !1,
+		configurable: !0,
+		writable: !0
+	};
+}
+function t(e) {
+	let t = e.indexOf(".");
+	return t === -1 ? null : {
+		collectionKey: e.substring(0, t),
+		nestedKey: e.substring(t + 1)
+	};
+}
+//#endregion
+export { t as n, e as t };

package/dist/filter/index.mjs

@@ -1,6 +1,7 @@
-import { n as e, t } from "../chunk-BTXXf5A-.mjs";
+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 n = class {
+var a = class {
 	constructor(e = {
 		indexes: /* @__PURE__ */ new Map(),
 		itemPositions: /* @__PURE__ */ new Map()
@@ -97,43 +98,7 @@ var n = class {
 		let s = /* @__PURE__ */ new WeakMap();
 		s.set(t, 0), i.set(n, s);
 	}
-}, r = () => ({
-	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
-	}
-});
-function i(e) {
-	return {
-		value: e,
-		enumerable: !1,
-		configurable: !0,
-		writable: !0
-	};
-}
-//#endregion
-//#region src/filter/chain.ts
-var a = class {
+}, o = class {
 	constructor(e) {
 		this.callbacks = e;
 	}
@@ -150,7 +115,7 @@ var a = class {
 			resetFilterState: i(() => this.callbacks.resetFilterState())
 		}), t;
 	}
-}, o = class e extends Error {
+}, s = class e extends Error {
 	constructor(e) {
 		super(e), this.name = "FilterEngineError";
 	}
@@ -166,10 +131,10 @@ var a = class {
 };
 //#endregion
 //#region src/filter/criterion.ts
-function s(e) {
+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 = u(r.exclude), o = a !== null, s = i ? d(r.values, a) : null;
+		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) {
@@ -191,19 +156,19 @@ function s(e) {
 		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++) f(n[e]);
+	for (let e = 0; e < n.length; e++) p(n[e]);
 	return n;
 }
-function c(e, t) {
+function l(e, t) {
 	return !(e.hasValues && !e.includedValues.has(t) || e.hasExclude && e.excludedValues.has(t));
 }
-function l(e) {
+function u(e) {
 	return e.hasValues && e.values.length === 0;
 }
-function u(e) {
+function d(e) {
 	return !Array.isArray(e) || e.length === 0 ? null : new Set(e);
 }
-function d(e, t) {
+function f(e, t) {
 	let n = /* @__PURE__ */ new Set();
 	for (let r = 0; r < e.length; r++) {
 		let i = e[r];
@@ -211,25 +176,25 @@ function d(e, t) {
 	}
 	return n;
 }
-function f(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 = p(e);
-}
 function p(e) {
-	let t = e.field;
-	return t += `|hv:${e.hasValues ? "1" : "0"}|v:`, e.hasValues && (t += m(e.values)), t += `|hx:${e.hasExclude ? "1" : "0"}|x:`, e.hasExclude && (t += m(e.exclude)), t;
+	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) {
-	return e.length === 0 ? "" : e.map((e) => h(e)).sort().join(",");
+	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/constants.ts
-var g = "deferFilterMutationIndexUpdates", _ = class {
+//#region src/filter/nested.ts
+var _ = class {
 	constructor(e = {
 		indexes: /* @__PURE__ */ new Map(),
 		itemPositions: /* @__PURE__ */ new Map()
@@ -281,19 +246,12 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 	resolveCriteria(e) {
 		if (e.length === 0) return [];
 		let t = e[0];
-		return "hasValues" in t && "hasExclude" in t && "includedValues" in t ? e : s(e);
+		return "hasValues" in t && "hasExclude" in t && "includedValues" in t ? e : c(e);
 	}
 	registerField(e) {
-		let t = this.createDescriptor(e);
+		let t = r(e);
 		t && (this.registeredFields.add(e), this.fieldDescriptors.set(e, t));
 	}
-	createDescriptor(e) {
-		let t = e.indexOf(".");
-		return t === -1 ? null : {
-			collectionKey: e.substring(0, t),
-			nestedKey: e.substring(t + 1)
-		};
-	}
 	buildIndex(e, t) {
 		let n = this.fieldDescriptors.get(t);
 		if (!n) return;
@@ -476,9 +434,34 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 		}
 		return r;
 	}
-}, v = class {
+}, 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 a({
+		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),
@@ -487,16 +470,16 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 			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 n(this.runtime.indexerStorage), this.nestedCollection = new _(this.runtime.nestedStorage), this.nestedCollection.registerFields(t.nestedFields), this.state.subscribe((e) => this.handleStateMutation(e)), this.rebuildMutableExcludeState();
-		let r = t.fields?.length, i = this.nestedCollection.hasRegisteredFields();
-		if (r) for (let e of t.fields) this.indexedFields.add(e);
-		this.dataset.length > 0 && (r || i) && this.rebuildConfiguredIndexes();
+		}), 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", r);
+		return this.state.getOrCreateScopedValue(this.namespace, "runtime", v);
 	}
 	get mutableExcludeState() {
 		return this.runtime.mutableExclude;
@@ -508,7 +491,7 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 		return this.runtime.sequentialCache;
 	}
 	shouldDeferMutationIndexUpdates() {
-		return this.state.getScopedValue(t, g) === !0;
+		return this.state.getScopedValue(t, n) === !0;
 	}
 	markDeferredMutationState() {
 		this.runtime.deferredMutationVersion = this.state.getMutationVersion(), this.indexer.clear(), this.nestedCollection.clearIndexes(), this.clearMutableExcludeState(), this.resetFilterState();
@@ -523,7 +506,7 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 	}
 	buildIndex(e, t) {
 		if (!Array.isArray(e)) {
-			if (!this.dataset.length) throw o.missingDatasetForBuildIndex();
+			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;
@@ -558,26 +541,26 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 	rawFilter(e, t) {
 		this.ensureRuntimeReady();
 		let n = t === void 0;
-		if (n && !this.dataset.length) throw o.missingDatasetForFilter();
-		let r = s(n ? e : t), i = n ? this.dataset : e;
+		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, c = r;
+		let a = i, o = r;
 		if (this.filterByPreviousResult) {
 			let e = this.resolveWithSequentialCache(i, n, r);
 			if (e.isFromCache) return e.result;
-			a = e.sourceData, c = e.executionCriteria;
+			a = e.sourceData, o = e.executionCriteria;
 		}
 		if (r.length === 0) return this.filterByPreviousResult && this.resetFilterState(), i;
-		for (let e = 0; e < c.length; e++) if (l(c[e])) return this.createEmptyResult(n, i, r);
-		let u = [], d = [];
-		for (let e = 0; e < c.length; e++) {
-			let t = c[e];
-			this.nestedCollection.hasField(t.field) ? u.push(t) : d.push(t);
+		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 (u.length > 0 && (a = this.nestedCollection.filter(a, u, this.dataset), a.length === 0)) return this.createEmptyResult(n, i, r);
+		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++) {
@@ -660,7 +643,7 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 		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 o.duplicateMutableExcludeField(this.mutableExcludeField);
+			if (this.mutableExcludeState.hasDuplicateValues) throw s.duplicateMutableExcludeField(this.mutableExcludeField);
 			return this.state.removeByFieldValues(this.mutableExcludeField, t.exclude), this.resetFilterState(), this.dataset;
 		}
 	}
@@ -711,7 +694,7 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 			let i = e[r], a = !0;
 			for (let e = 0; e < t.length; e++) {
 				let n = t[e];
-				if (!c(n, i[n.field])) {
+				if (!l(n, i[n.field])) {
 					a = !1;
 					break;
 				}
@@ -758,15 +741,15 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 			let t = i[e], n = this.estimateIndexSize(t);
 			n < s && (o = t, s = n);
 		}
-		let l = this.indexer.getByValues(o.field, o.values);
-		if (l.length === 0) return [];
+		let c = this.indexer.getByValues(o.field, o.values);
+		if (c.length === 0) return [];
 		let u = [];
-		for (let e = 0; e < l.length; e++) {
-			let t = l[e], n = !0;
+		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 && !c(r, t[r.field])) {
+					if (r !== o && !l(r, t[r.field])) {
 						n = !1;
 						break;
 					}
@@ -905,4 +888,4 @@ var g = "deferFilterMutationIndexUpdates", _ = class {
 	}
 };
 //#endregion
-export { v as FilterEngine };
+export { y as FilterEngine };

package/dist/index.mjs

@@ -1,2 +1,2 @@
-import { t as e } from "./chunk-l_-R9TTp.mjs";
+import { t as e } from "./chunk-BURK5sks.mjs";
 export { e as MergeEngines };

package/dist/merge/index.mjs

@@ -1,2 +1,2 @@
-import { t as e } from "../chunk-l_-R9TTp.mjs";
+import { t as e } from "../chunk-BURK5sks.mjs";
 export { e as MergeEngines };

package/dist/search/index.mjs

@@ -1,9 +1,7 @@
-import { n as e, t } from "../chunk-BTXXf5A-.mjs";
-//#region src/search/constants.ts
-var n = "deferSearchMutationIndexUpdates";
-//#endregion
+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 r(e) {
+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);
@@ -13,41 +11,41 @@ function r(e) {
 		}
 	}
 }
-function i(e, t) {
+function a(e, t) {
 	let n = [];
 	for (let r of t) {
 		let t = e.get(r);
 		if (!t) return null;
 		n.push(t);
 	}
-	return r(n), n;
+	return i(n), n;
 }
-function a(e, t) {
+function o(e, t) {
 	for (let n = 0; n < t.length; n++) if (!t[n].has(e)) return !1;
 	return !0;
 }
-function o(e, t, n, r) {
-	let o = i(e, t);
-	if (o === null) return null;
-	let s = o[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) && a(e, o) && !!n[e]?.includes(r)
+		matches: (e) => s.has(e) && o(e, i) && !!n[e]?.includes(r)
 	};
 }
-function s(e) {
+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 c(e, t) {
+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 l(e) {
-	let t = s(e);
+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++) {
@@ -56,37 +54,37 @@ function l(e) {
 	}
 	return n;
 }
-function u(e, t, 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++) c(e, t.substring(a, a + i)).add(n);
+		for (let a = 0; a <= r; a++) l(e, t.substring(a, a + i)).add(n);
 	}
 }
-function d(e, t, n, r, i = {}) {
-	let { restrictionLookup: a = null, take: s = Infinity } = i, c = o(e, t, n, r);
+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 >= s)) break;
+	for (let e of c.smallestPostingList) if (!(a !== null && !a[e]) && c.matches(e) && (l.push(e), l.length >= o)) break;
 	return l;
 }
-function f(e, t, n, r, i) {
-	let { candidateIndices: a, restrictionLookup: s = null, take: c = Infinity } = i;
+function p(e, t, n, r, i) {
+	let { candidateIndices: a, restrictionLookup: o = null, take: c = Infinity } = i;
 	if (a.length === 0) return [];
-	let l = o(e, t, n, r);
+	let l = s(e, t, n, r);
 	if (l === null) return [];
 	let u = [];
-	if (s === null || a.length <= l.smallestPostingList.size) {
+	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 (s[e] && l.matches(e) && (u.push(e), u.length >= c)) break;
+	for (let e of l.smallestPostingList) if (o[e] && l.matches(e) && (u.push(e), u.length >= c)) break;
 	return u;
 }
-function p(e, t, n) {
+function m(e, t, n) {
 	let r = Math.min(3, t.length);
 	for (let i = 2; i <= r; i++) {
 		let r = t.length - i;
@@ -98,7 +96,7 @@ function p(e, t, n) {
 }
 //#endregion
 //#region src/search/nested.ts
-var m = class {
+var h = class {
 	constructor(e = {
 		ngramIndexes: /* @__PURE__ */ new Map(),
 		normalizedFieldValues: /* @__PURE__ */ new Map()
@@ -153,10 +151,10 @@ var m = class {
 		let o = this.storage.ngramIndexes.get(e);
 		if (!o) return [];
 		let s = this.storage.normalizedFieldValues.get(e) ?? [];
-		return i == null ? d(o, n, s, t, {
+		return i == null ? f(o, n, s, t, {
 			restrictionLookup: r,
 			take: a
-		}) : f(o, n, s, t, {
+		}) : p(o, n, s, t, {
 			candidateIndices: i,
 			restrictionLookup: r,
 			take: a
@@ -218,16 +216,9 @@ var m = class {
 		return !1;
 	}
 	registerField(e) {
-		let t = this.createDescriptor(e);
+		let t = r(e);
 		t && (this.registeredFields.add(e), this.fieldDescriptors.set(e, t));
 	}
-	createDescriptor(e) {
-		let t = e.indexOf(".");
-		return t === -1 ? null : {
-			collectionKey: e.substring(0, t),
-			nestedKey: e.substring(t + 1)
-		};
-	}
 	getNormalizedValues(e) {
 		let t = this.storage.normalizedFieldValues.get(e);
 		if (t) return t;
@@ -248,7 +239,7 @@ var m = class {
 			}
 			if (s.length === 0) continue;
 			let c = s.join("\n");
-			o[t] = c, u(a, c, t);
+			o[t] = c, d(a, c, t);
 		}
 		this.storage.ngramIndexes.set(t, a), this.storage.normalizedFieldValues.set(t, o);
 	}
@@ -265,8 +256,8 @@ var m = class {
 				typeof t == "string" && c.push(t.toLowerCase());
 			}
 			if (c.length === 0) continue;
-			let d = c.join("\n");
-			a[l] = d, u(i, d, l);
+			let u = c.join("\n");
+			a[l] = u, d(i, u, l);
 		}
 	}
 	updateItemInField(e, t, n, r) {
@@ -274,18 +265,18 @@ var m = class {
 		if (!i) return;
 		let a = this.getNormalizedValues(e), o = this.getNormalizedItemValue(e, n), s = this.getNormalizedItemValue(e, t);
 		if (o !== s) {
-			if (o && p(i, o, r), !s) {
+			if (o && m(i, o, r), !s) {
 				delete a[r];
 				return;
 			}
-			a[r] = s, u(i, s, r);
+			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 && p(r, a, n), delete i[n];
+		a && m(r, a, n), delete i[n];
 	}
 	moveItemForField(e, t, n, r) {
 		let i = this.storage.ngramIndexes.get(e);
@@ -295,7 +286,7 @@ var m = class {
 			delete a[n];
 			return;
 		}
-		p(i, o, n), u(i, o, r), a[r] = o, delete a[n];
+		m(i, o, n), d(i, o, r), a[r] = o, delete a[n];
 	}
 	getNormalizedItemValue(e, t) {
 		let n = this.fieldDescriptors.get(e);
@@ -309,7 +300,7 @@ var m = class {
 		}
 		return o.length === 0 ? null : o.join("\n");
 	}
-}, h = () => ({
+}, g = () => ({
 	indexedFields: /* @__PURE__ */ new Set(),
 	flatIndexes: /* @__PURE__ */ new Map(),
 	nestedStorage: {
@@ -327,9 +318,9 @@ var m = class {
 		fallbackQueries: 0,
 		fallbackFields: /* @__PURE__ */ new Map()
 	}
-}), g = class {
+}), _ = 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 m(this.runtime.nestedStorage), this.nestedCollection.registerFields(t.nestedFields), this.state.subscribe((e) => this.handleStateMutation(e)), t.filterByPreviousResult && (this.runtime.filterByPreviousResult = !0);
+		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();
@@ -338,7 +329,7 @@ var m = class {
 		return this.state.getOriginData();
 	}
 	get runtime() {
-		return this.state.getOrCreateScopedValue(this.namespace, "runtime", h);
+		return this.state.getOrCreateScopedValue(this.namespace, "runtime", g);
 	}
 	get flatIndexes() {
 		return this.runtime.flatIndexes;
@@ -366,7 +357,7 @@ var m = class {
 			let a = e[n][t];
 			if (typeof a != "string") continue;
 			let o = a.toLowerCase();
-			i[n] = o, u(r, o, n);
+			i[n] = o, d(r, o, n);
 		}
 		this.flatIndexes.set(t, {
 			ngramMap: r,
@@ -491,7 +482,7 @@ var m = class {
 		return n && n.version !== t && this.dataset.length > 0 && (this.buildIndexFromData(this.dataset, e), n = this.flatIndexes.get(e)), n;
 	}
 	getQueryGrams(e) {
-		let t = l(e);
+		let t = u(e);
 		return t.size > 0 ? t : null;
 	}
 	searchAllFields(e, t) {
@@ -556,31 +547,31 @@ var m = class {
 		for (let n of this.flatIndexes.keys()) {
 			let r = this.getResolvedFlatIndex(n);
 			if (!r) continue;
-			let i = o(r.ngramMap, t, r.normalizedValues, e);
+			let i = s(r.ngramMap, t, r.normalizedValues, e);
 			i !== null && a.push(i.matches);
 		}
 		if (a.length === 0) return {
 			items: [],
 			indices: []
 		};
-		let s = [], c = 0;
+		let o = [], c = 0;
 		for (let e = 0; e < i.length; e++) {
 			let t = i[e];
 			if (r !== null && !r[t]) continue;
-			let o = !1;
+			let s = !1;
 			for (let e = 0; e < a.length; e++) if (a[e](t)) {
-				o = !0;
+				s = !0;
 				break;
 			}
-			if (o) {
+			if (s) {
 				if (c < n.offset) {
 					c += 1;
 					continue;
 				}
-				if (s.push(t), c += 1, this.hasReachedWindowLimit(n, s.length)) break;
+				if (o.push(t), c += 1, this.hasReachedWindowLimit(n, o.length)) break;
 			}
 		}
-		return this.materializeIndicesResult(s);
+		return this.materializeIndicesResult(o);
 	}
 	searchField(e, t, n) {
 		let r = this.normalizeQuery(t), i = this.normalizeSearchWindow(n), a = `field "${e}"`;
@@ -641,10 +632,10 @@ var m = class {
 		let o = this.getResolvedFlatIndex(e);
 		if (!o) return [];
 		let { ngramMap: s, normalizedValues: c } = o;
-		return i === null ? d(s, n, c, t, {
+		return i === null ? f(s, n, c, t, {
 			restrictionLookup: r,
 			take: a
-		}) : f(s, n, c, t, {
+		}) : p(s, n, c, t, {
 			candidateIndices: i,
 			restrictionLookup: r,
 			take: a
@@ -965,7 +956,7 @@ var m = class {
 			let o = t[r][e];
 			if (typeof o != "string") continue;
 			let s = o.toLowerCase(), c = n + r;
-			a[c] = s, u(i, s, c);
+			a[c] = s, d(i, s, c);
 		}
 		r.version = this.state.getMutationVersion();
 	}
@@ -985,19 +976,19 @@ var m = class {
 			return;
 		}
 		let { ngramMap: a, normalizedValues: o } = i, s = this.getNormalizedFieldValue(n, e);
-		s && p(a, s, t);
+		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, u(a, c, t), i.version = this.state.getMutationVersion();
+		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 && p(i, o, n), delete a[n], r.version = this.state.getMutationVersion();
+		o && m(i, o, n), delete a[n], r.version = this.state.getMutationVersion();
 	}
 	moveIndexedFieldValue(e, t, n, r) {
 		if (n === r) return;
@@ -1008,7 +999,7 @@ var m = class {
 			delete o[n], i.version = this.state.getMutationVersion();
 			return;
 		}
-		p(a, s, n), u(a, s, r), o[r] = s, delete o[n], i.version = this.state.getMutationVersion();
+		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];
@@ -1016,4 +1007,4 @@ var m = class {
 	}
 };
 //#endregion
-export { g as TextSearchEngine };
+export { _ as TextSearchEngine };

package/dist/sort/index.mjs

@@ -1,13 +1,13 @@
-import { n as e, t } from "../chunk-BTXXf5A-.mjs";
+import { a as e, i as t, r as n } from "../chunk-BJZg_1dI.mjs";
 //#region src/sort/errors.ts
-var n = class e extends Error {
+var r = class e extends Error {
 	constructor(e) {
 		super(e), this.name = "SortEngineError";
 	}
 	static missingDatasetForSort() {
 		return new e("SortEngine: no dataset in memory.");
 	}
-}, r = "deferSortMutationCacheUpdates";
+};
 //#endregion
 //#region src/sort/utils.ts
 function i(e, t) {
@@ -64,7 +64,7 @@ var o = () => ({
 		return this.runtime.indexedFields;
 	}
 	shouldDeferMutationCacheUpdates() {
-		return this.state.getScopedValue(t, r) === !0;
+		return this.state.getScopedValue(t, n) === !0;
 	}
 	invalidateCachedIndexes() {
 		for (let e of this.indexedFields) this.cache.delete(e);
@@ -159,10 +159,10 @@ var o = () => ({
 				return;
 		}
 	}
-	sort(e, t, r = !1) {
+	sort(e, t, n = !1) {
 		let i = t === void 0, a, o;
 		if (i) {
-			if (!this.dataset.length) throw n.missingDatasetForSort();
+			if (!this.dataset.length) throw r.missingDatasetForSort();
 			a = this.dataset, o = e;
 		} else a = e, o = t;
 		if (o.length === 0 || a.length === 0) return a;
@@ -172,9 +172,9 @@ var o = () => ({
 				let n = this.cache.get(e), r = this.state.getMutationVersion();
 				return (!n || n.version !== r) && (this.buildIndexForDataset(e), n = this.cache.get(e)), this.getCachedSortedItems(n, t);
 			}
-			return this.sortNumericFastPath(a, e, t, r);
+			return this.sortNumericFastPath(a, e, t, n);
 		}
-		return this.sortMultiField(a, o, r, i);
+		return this.sortMultiField(a, o, n, i);
 	}
 	sortNumericFastPath(e, t, n, r) {
 		if (e.length === 0 || typeof e[0][t] != "number") {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@devisfuture/mega-collection",
-  "version": "2.4.4",
+  "version": "2.4.5",
   "description": "High-performance search, filter & sort engine for 100K+ item collections in JavaScript/TypeScript",
   "exports": {
     ".": {