@devisfuture/mega-collection 2.4.6 → 2.4.8

package/dist/sort/index.d.ts

@@ -0,0 +1,55 @@
+import { S as State } from '../State-CYIe-3He.js';
+import { C as CollectionItem, U as UpdateDescriptor, d as SortDescriptor } from '../types-DONld7xY.js';
+export { e as SortDirection } from '../types-DONld7xY.js';
+
+interface SortEngineOptions<T extends CollectionItem = CollectionItem> {
+    data?: T[];
+    fields?: (keyof T & string)[];
+}
+
+declare class SortEngine<T extends CollectionItem> {
+    private readonly state;
+    private readonly namespace;
+    constructor(options?: SortEngineOptions<T> & {
+        state?: State<T>;
+    });
+    private get dataset();
+    private get runtime();
+    private get cache();
+    private get indexedFields();
+    private shouldDeferMutationCacheUpdates;
+    private invalidateCachedIndexes;
+    private rebuildConfiguredIndexes;
+    private buildIndexForDataset;
+    private buildIndexFromData;
+    clearIndexes(): this;
+    clearData(): this;
+    data(data: T[]): this;
+    add(items: T[]): this;
+    update(descriptor: UpdateDescriptor<T>): this;
+    private applyAddedItems;
+    getOriginData(): T[];
+    private handleStateMutation;
+    sort(descriptors: SortDescriptor<T>[]): T[];
+    sort(data: T[], descriptors: SortDescriptor<T>[], inPlace?: boolean): T[];
+    private sortNumericFastPath;
+    private sortMultiField;
+    private sortTieGroups;
+    private materializeItemsFromIndexes;
+    private getCachedSortedItems;
+    private shouldMaintainIncrementally;
+    private hasDuplicateValuesForIndexes;
+    private compareIndexesByField;
+    private applyUpdatedItem;
+    private updateCachedIndexForUpdatedItem;
+    private updateCachedIndexForAddedItems;
+    private applyRemovedItem;
+    private applyRemovedItemsBatch;
+    private updateCachedIndexForRemovedItem;
+    private updateUniqueCachedIndexForRemovedItem;
+    private updateUniqueCachedIndexForRemovedItems;
+    private buildComparator;
+}
+
+export { CollectionItem, SortDescriptor, SortEngine };
+export type { SortEngineOptions };

package/dist/sort/index.mjs

@@ -1,416 +1 @@
-import { a as e, i as t, r as n } from "../chunk-BJZg_1dI.mjs";
-//#region src/sort/errors.ts
-var r = class e extends Error {
-	constructor(e) {
-		super(e), this.name = "SortEngineError";
-	}
-	static missingDatasetForSort() {
-		return new e("SortEngine: no dataset in memory.");
-	}
-};
-//#endregion
-//#region src/sort/utils.ts
-function i(e, t) {
-	for (let n = 0; n < t; n++) {
-		let t = e[n];
-		if (t !== t >>> 0) return !1;
-	}
-	return !0;
-}
-function a(e, t, n) {
-	let r = new Uint32Array(n), i = new Uint32Array(65536);
-	for (let r = 0; r < n; r++) i[t[e[r]] & 65535]++;
-	let a = 0;
-	for (let e = 0; e < 65536; e++) {
-		let t = i[e];
-		i[e] = a, a += t;
-	}
-	for (let a = 0; a < n; a++) {
-		let n = t[e[a]] & 65535;
-		r[i[n]++] = e[a];
-	}
-	i.fill(0);
-	for (let e = 0; e < n; e++) i[t[r[e]] >>> 16 & 65535]++;
-	a = 0;
-	for (let e = 0; e < 65536; e++) {
-		let t = i[e];
-		i[e] = a, a += t;
-	}
-	for (let a = 0; a < n; a++) {
-		let n = t[r[a]] >>> 16 & 65535;
-		e[i[n]++] = r[a];
-	}
-}
-var o = () => ({
-	indexedFields: /* @__PURE__ */ new Set(),
-	cache: /* @__PURE__ */ new Map()
-}), s = class {
-	constructor(t = {}) {
-		if (this.state = t.state ?? new e(t.data ?? []), this.namespace = this.state.createNamespace("sort"), this.state.subscribe((e) => this.handleStateMutation(e)), t.fields?.length) {
-			for (let e of t.fields) this.indexedFields.add(e);
-			this.dataset.length > 0 && this.rebuildConfiguredIndexes();
-		}
-	}
-	get dataset() {
-		return this.state.getOriginData();
-	}
-	get runtime() {
-		return this.state.getOrCreateScopedValue(this.namespace, "runtime", o);
-	}
-	get cache() {
-		return this.runtime.cache;
-	}
-	get indexedFields() {
-		return this.runtime.indexedFields;
-	}
-	shouldDeferMutationCacheUpdates() {
-		return this.state.getScopedValue(t, n) === !0;
-	}
-	invalidateCachedIndexes() {
-		for (let e of this.indexedFields) this.cache.delete(e);
-	}
-	rebuildConfiguredIndexes() {
-		this.cache.clear();
-		for (let e of this.indexedFields) this.buildIndexForDataset(e);
-	}
-	buildIndexForDataset(e) {
-		this.dataset.length && this.buildIndexFromData(this.dataset, e);
-	}
-	buildIndexFromData(e, t) {
-		let n = e.length, r = new Uint32Array(n);
-		for (let e = 0; e < n; e++) r[e] = e;
-		let o = 0;
-		for (; o < n && e[o][t] == null;) o++;
-		if (o < n && typeof e[o][t] == "number") {
-			let o = new Float64Array(n);
-			for (let r = 0; r < n; r++) o[r] = e[r][t];
-			i(o, n) ? a(r, o, n) : r.sort((e, t) => o[e] - o[t]);
-		} else {
-			let i = Array(n);
-			for (let r = 0; r < n; r++) i[r] = e[r][t];
-			r.sort((e, t) => {
-				let n = i[e], r = i[t];
-				return n < r ? -1 : n > r ? 1 : 0;
-			});
-		}
-		let s = new Uint32Array(n);
-		for (let e = 0; e < n; e++) s[r[e]] = e;
-		this.cache.set(t, {
-			indexes: r,
-			reverseIndex: s,
-			ascItems: null,
-			descItems: null,
-			hasDuplicateValues: this.hasDuplicateValuesForIndexes(e, r, t),
-			version: this.state.getMutationVersion()
-		});
-	}
-	clearIndexes() {
-		return this.cache.clear(), 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) {
-		if (t === 0) return this;
-		if (this.shouldDeferMutationCacheUpdates()) return this.invalidateCachedIndexes(), this;
-		for (let n of this.indexedFields) {
-			let r = this.cache.get(n);
-			if (r) {
-				if (!this.shouldMaintainIncrementally(r)) {
-					this.cache.delete(n);
-					continue;
-				}
-				this.updateCachedIndexForAddedItems(n, e, t);
-			}
-		}
-		return this;
-	}
-	getOriginData() {
-		return this.state.getOriginData();
-	}
-	handleStateMutation(e) {
-		switch (e.type) {
-			case "add":
-				this.applyAddedItems(e.startIndex, e.items.length);
-				return;
-			case "update":
-				this.applyUpdatedItem(e.index, e.previousItem, e.nextItem);
-				return;
-			case "data":
-				this.rebuildConfiguredIndexes();
-				return;
-			case "clearData":
-				this.cache.clear();
-				return;
-			case "remove":
-				this.applyRemovedItem(e.removedIndex, e.movedFromIndex);
-				return;
-			case "removeMany":
-				this.applyRemovedItemsBatch(e.entries);
-				return;
-		}
-	}
-	sort(e, t, n = !1) {
-		let i = t === void 0, a, o;
-		if (i) {
-			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;
-		if (o.length === 1) {
-			let { field: e, direction: t } = o[0];
-			if (i && this.indexedFields.has(e)) {
-				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, n);
-		}
-		return this.sortMultiField(a, o, n, i);
-	}
-	sortNumericFastPath(e, t, n, r) {
-		if (e.length === 0 || typeof e[0][t] != "number") {
-			let i = r ? e : e.slice();
-			return i.sort((e, r) => {
-				let i = e[t], a = r[t], o = i < a ? -1 : i > a ? 1 : 0;
-				return n === "asc" ? o : -o;
-			}), i;
-		}
-		let o = e.length, s = new Float64Array(o);
-		for (let n = 0; n < o; n++) s[n] = e[n][t];
-		let c = new Uint32Array(o);
-		for (let e = 0; e < o; e++) c[e] = e;
-		return i(s, o) ? a(c, s, o) : c.sort((e, t) => s[e] - s[t]), this.materializeItemsFromIndexes(e, c, n);
-	}
-	sortMultiField(e, t, n, r) {
-		let [i, ...a] = t;
-		if (r && this.indexedFields.has(i.field)) {
-			let e = this.cache.get(i.field), t = this.state.getMutationVersion();
-			(!e || e.version !== t) && (this.buildIndexForDataset(i.field), e = this.cache.get(i.field));
-			let n = e.hasDuplicateValues ? this.getCachedSortedItems(e, i.direction).slice() : this.getCachedSortedItems(e, i.direction);
-			return e.hasDuplicateValues ? this.sortTieGroups(n, i.field, a) : n;
-		}
-		let o = n ? e : e.slice(), s = this.buildComparator(t);
-		return o.sort(s), o;
-	}
-	sortTieGroups(e, t, n) {
-		if (n.length === 0) return e;
-		let r = this.buildComparator(n), i = e.length, a = 0;
-		for (; a < i;) {
-			let n = a + 1, o = e[a][t];
-			for (; n < i && e[n][t] === o;) n++;
-			if (n - a > 1) {
-				let t = e.slice(a, n);
-				t.sort(r);
-				for (let r = a; r < n; r++) e[r] = t[r - a];
-			}
-			a = n;
-		}
-		return e;
-	}
-	materializeItemsFromIndexes(e, t, n) {
-		let r = t.length, i = Array(r);
-		if (n === "asc") {
-			for (let n = 0; n < r; n++) i[n] = e[t[n]];
-			return i;
-		}
-		for (let n = 0; n < r; n++) i[n] = e[t[r - 1 - n]];
-		return i;
-	}
-	getCachedSortedItems(e, t) {
-		return t === "asc" ? (e.ascItems === null && (e.ascItems = this.materializeItemsFromIndexes(this.dataset, e.indexes, "asc")), e.ascItems) : (e.descItems === null && (e.descItems = this.getCachedSortedItems(e, "asc").slice().reverse()), e.descItems);
-	}
-	shouldMaintainIncrementally(e) {
-		return e.ascItems !== null || e.descItems !== null;
-	}
-	hasDuplicateValuesForIndexes(e, t, n) {
-		for (let r = 1; r < t.length; r++) if (e[t[r - 1]][n] === e[t[r]][n]) return !0;
-		return !1;
-	}
-	compareIndexesByField(e, t, n) {
-		let r = this.dataset[t][e], i = this.dataset[n][e];
-		if (typeof r == "number" && typeof i == "number") {
-			let e = r - i;
-			if (e !== 0) return e;
-		} else {
-			if (r < i) return -1;
-			if (r > i) return 1;
-		}
-		return t - n;
-	}
-	applyUpdatedItem(e, t, n) {
-		if (this.shouldDeferMutationCacheUpdates()) {
-			this.invalidateCachedIndexes();
-			return;
-		}
-		for (let r of this.indexedFields) {
-			if (t[r] === n[r]) continue;
-			let i = this.cache.get(r);
-			if (i) {
-				if (!this.shouldMaintainIncrementally(i)) {
-					this.cache.delete(r);
-					continue;
-				}
-				this.updateCachedIndexForUpdatedItem(r, e);
-			}
-		}
-	}
-	updateCachedIndexForUpdatedItem(e, t) {
-		let n = this.cache.get(e);
-		if (!n) return;
-		let { indexes: r, reverseIndex: i } = n, a = r.length, o = i[t];
-		if (o >= a || r[o] !== t) {
-			this.cache.delete(e);
-			return;
-		}
-		r.copyWithin(o, o + 1);
-		let s = a - 1, c = 0, l = s;
-		for (; c < l;) {
-			let n = c + l >> 1;
-			this.compareIndexesByField(e, r[n], t) <= 0 ? c = n + 1 : l = n;
-		}
-		let u = c;
-		r.copyWithin(u + 1, u, s), r[u] = t, n.ascItems !== null && (n.ascItems.copyWithin(o, o + 1), n.ascItems.copyWithin(u + 1, u, s), n.ascItems[u] = this.dataset[t]);
-		let d = Math.min(o, u), f = Math.max(o, u);
-		for (let e = d; e <= f; e++) i[r[e]] = e;
-		if (n.descItems = null, !n.hasDuplicateValues) {
-			let i = u > 0 ? r[u - 1] : -1, o = u + 1 < a ? r[u + 1] : -1;
-			n.hasDuplicateValues = i !== -1 && this.dataset[i][e] === this.dataset[t][e] || o !== -1 && this.dataset[o][e] === this.dataset[t][e];
-		}
-		n.version = this.state.getMutationVersion();
-	}
-	updateCachedIndexForAddedItems(e, t, n) {
-		let r = this.cache.get(e);
-		if (!r) return;
-		let i = Array(n);
-		for (let e = 0; e < n; e++) i[e] = t + e;
-		i.sort((t, n) => this.compareIndexesByField(e, t, n));
-		let a = new Uint32Array(r.indexes.length + n), o = -1, s = r.hasDuplicateValues, c = 0, l = 0, u = 0;
-		for (; c < r.indexes.length && l < i.length;) {
-			let t = this.compareIndexesByField(e, r.indexes[c], i[l]) <= 0 ? r.indexes[c++] : i[l++];
-			a[u] = t, !s && o !== -1 && this.dataset[o][e] === this.dataset[t][e] && (s = !0), o = t, u += 1;
-		}
-		for (; c < r.indexes.length;) {
-			let t = r.indexes[c++];
-			a[u] = t, !s && o !== -1 && this.dataset[o][e] === this.dataset[t][e] && (s = !0), o = t, u += 1;
-		}
-		for (; l < i.length;) {
-			let t = i[l++];
-			a[u] = t, !s && o !== -1 && this.dataset[o][e] === this.dataset[t][e] && (s = !0), o = t, u += 1;
-		}
-		let d = new Uint32Array(a.length);
-		for (let e = 0; e < a.length; e++) d[a[e]] = e;
-		r.indexes = a, r.reverseIndex = d, r.ascItems = r.ascItems ? this.materializeItemsFromIndexes(this.dataset, a, "asc") : null, r.descItems = null, r.hasDuplicateValues = s, r.version = this.state.getMutationVersion();
-	}
-	applyRemovedItem(e, t) {
-		if (this.shouldDeferMutationCacheUpdates()) {
-			this.invalidateCachedIndexes();
-			return;
-		}
-		for (let n of this.indexedFields) {
-			let r = this.cache.get(n);
-			if (r) {
-				if (!this.shouldMaintainIncrementally(r)) {
-					this.cache.delete(n);
-					continue;
-				}
-				this.updateCachedIndexForRemovedItem(n, e, t);
-			}
-		}
-	}
-	applyRemovedItemsBatch(e) {
-		if (this.shouldDeferMutationCacheUpdates()) {
-			this.invalidateCachedIndexes();
-			return;
-		}
-		for (let t of this.indexedFields) {
-			let n = this.cache.get(t);
-			if (n) {
-				if (!this.shouldMaintainIncrementally(n)) {
-					this.cache.delete(t);
-					continue;
-				}
-				if (!n.hasDuplicateValues) {
-					this.updateUniqueCachedIndexForRemovedItems(n, e), n.version = this.state.getMutationVersion();
-					continue;
-				}
-				this.cache.delete(t);
-			}
-		}
-	}
-	updateCachedIndexForRemovedItem(e, t, n) {
-		let r = this.cache.get(e);
-		if (!r) return;
-		if (!r.hasDuplicateValues) {
-			this.updateUniqueCachedIndexForRemovedItem(r, t, n), r.version = this.state.getMutationVersion();
-			return;
-		}
-		let i = [];
-		for (let e = 0; e < r.indexes.length; e++) {
-			let a = r.indexes[e];
-			a === t || a === n || i.push(a);
-		}
-		if (n !== null && n !== t) {
-			let n = 0, r = i.length;
-			for (; n < r;) {
-				let a = n + r >> 1;
-				this.compareIndexesByField(e, i[a], t) <= 0 ? n = a + 1 : r = a;
-			}
-			i.splice(n, 0, t);
-		}
-		let a = Uint32Array.from(i), o = new Uint32Array(this.dataset.length);
-		for (let e = 0; e < a.length; e++) {
-			let t = a[e];
-			o[t] = e;
-		}
-		r.indexes = a, r.reverseIndex = o, r.ascItems = r.ascItems ? this.materializeItemsFromIndexes(this.dataset, a, "asc") : null, r.descItems = null, r.hasDuplicateValues = r.hasDuplicateValues ? this.hasDuplicateValuesForIndexes(this.dataset, a, e) : !1, r.version = this.state.getMutationVersion();
-	}
-	updateUniqueCachedIndexForRemovedItem(e, t, n) {
-		let r = e.indexes.length - 1, i = new Uint32Array(r), a = new Uint32Array(this.dataset.length), o = e.ascItems === null ? null : Array(r), s = 0;
-		for (let r = 0; r < e.indexes.length; r++) {
-			let c = e.indexes[r];
-			if (c === t) continue;
-			let l = n !== null && c === n ? t : c;
-			i[s] = l, a[l] = s, o !== null && (o[s] = this.dataset[l]), s += 1;
-		}
-		e.indexes = i, e.reverseIndex = a, e.ascItems = o, e.descItems = null;
-	}
-	updateUniqueCachedIndexForRemovedItems(e, t) {
-		let n = e.indexes.length, r = new Uint32Array(n), i = new Int32Array(n);
-		for (let e = 0; e < n; e++) r[e] = e, i[e] = -1;
-		let a = n;
-		for (let e = 0; e < t.length; e++) {
-			let n = t[e];
-			n.movedFromIndex !== null && (r[n.removedIndex] = r[n.movedFromIndex]), --a;
-		}
-		let o = new Uint32Array(a), s = new Uint32Array(a), c = e.ascItems === null ? null : Array(a);
-		for (let e = 0; e < a; e++) i[r[e]] = e;
-		let l = 0;
-		for (let t = 0; t < e.indexes.length; t++) {
-			let n = i[e.indexes[t]];
-			n !== -1 && (o[l] = n, s[n] = l, c !== null && (c[l] = this.dataset[n]), l += 1);
-		}
-		e.indexes = o, e.reverseIndex = s, e.ascItems = c, e.descItems = null;
-	}
-	buildComparator(e) {
-		let t = e.map(({ field: e }) => e), n = e.map(({ direction: e }) => e === "asc" ? 1 : -1), r = t.length;
-		return (e, i) => {
-			for (let a = 0; a < r; a++) {
-				let r = t[a], o = e[r], s = i[r];
-				if (o < s) return -n[a];
-				if (o > s) return n[a];
-			}
-			return 0;
-		};
-	}
-};
-//#endregion
-export { s as SortEngine };
+import{a as e,i as t,r as s}from"../chunks/constants-BXQI1M5E.mjs";var n=class e extends Error{constructor(e){super(e),this.name="SortEngineError"}static missingDatasetForSort(){return new e("SortEngine: no dataset in memory.")}};function i(e,t){for(let s=0;s<t;s++){const t=e[s];if(t!==t>>>0)return!1}return!0}function a(e,t,s){const n=new Uint32Array(s),i=new Uint32Array(65536);for(let r=0;r<s;r++)i[65535&t[e[r]]]++;let a=0;for(let r=0;r<65536;r++){const e=i[r];i[r]=a,a+=e}for(let r=0;r<s;r++)n[i[65535&t[e[r]]]++]=e[r];i.fill(0);for(let r=0;r<s;r++)i[t[n[r]]>>>16&65535]++;a=0;for(let r=0;r<65536;r++){const e=i[r];i[r]=a,a+=e}for(let r=0;r<s;r++)e[i[t[n[r]]>>>16&65535]++]=n[r]}var r=()=>({indexedFields:/* @__PURE__ */new Set,cache:/* @__PURE__ */new Map}),d=class{constructor(t={}){if(this.state=t.state??new e(t.data??[]),this.namespace=this.state.createNamespace("sort"),this.state.subscribe(e=>this.handleStateMutation(e)),t.fields?.length){for(const e of t.fields)this.indexedFields.add(e);this.dataset.length>0&&this.rebuildConfiguredIndexes()}}get dataset(){return this.state.getOriginData()}get runtime(){return this.state.getOrCreateScopedValue(this.namespace,"runtime",r)}get cache(){return this.runtime.cache}get indexedFields(){return this.runtime.indexedFields}shouldDeferMutationCacheUpdates(){return!0===this.state.getScopedValue(t,s)}invalidateCachedIndexes(){for(const e of this.indexedFields)this.cache.delete(e)}rebuildConfiguredIndexes(){this.cache.clear();for(const e of this.indexedFields)this.buildIndexForDataset(e)}buildIndexForDataset(e){this.dataset.length&&this.buildIndexFromData(this.dataset,e)}buildIndexFromData(e,t){const s=e.length,n=new Uint32Array(s);for(let i=0;i<s;i++)n[i]=i;let r=0;for(;r<s&&null==e[r][t];)r++;if(r<s&&"number"==typeof e[r][t]){const r=new Float64Array(s);for(let n=0;n<s;n++)r[n]=e[n][t];i(r,s)?a(n,r,s):n.sort((e,t)=>r[e]-r[t])}else{const i=new Array(s);for(let n=0;n<s;n++)i[n]=e[n][t];n.sort((e,t)=>{const s=i[e],n=i[t];return s<n?-1:s>n?1:0})}const d=new Uint32Array(s);for(let i=0;i<s;i++)d[n[i]]=i;this.cache.set(t,{indexes:n,reverseIndex:d,ascItems:null,descItems:null,hasDuplicateValues:this.hasDuplicateValuesForIndexes(e,n,t),version:this.state.getMutationVersion()})}clearIndexes(){return this.cache.clear(),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){if(0===t)return this;if(this.shouldDeferMutationCacheUpdates())return this.invalidateCachedIndexes(),this;for(const s of this.indexedFields){const n=this.cache.get(s);n&&(this.shouldMaintainIncrementally(n)?this.updateCachedIndexForAddedItems(s,e,t):this.cache.delete(s))}return this}getOriginData(){return this.state.getOriginData()}handleStateMutation(e){switch(e.type){case"add":return void this.applyAddedItems(e.startIndex,e.items.length);case"update":return void this.applyUpdatedItem(e.index,e.previousItem,e.nextItem);case"data":return void this.rebuildConfiguredIndexes();case"clearData":return void this.cache.clear();case"remove":return void this.applyRemovedItem(e.removedIndex,e.movedFromIndex);case"removeMany":return void this.applyRemovedItemsBatch(e.entries)}}sort(e,t,s=!1){const i=void 0===t;let a,r;if(i){if(!this.dataset.length)throw n.missingDatasetForSort();a=this.dataset,r=e}else a=e,r=t;if(0===r.length||0===a.length)return a;if(1===r.length){const{field:e,direction:t}=r[0];if(i&&this.indexedFields.has(e)){let s=this.cache.get(e);const n=this.state.getMutationVersion();return s&&s.version===n||(this.buildIndexForDataset(e),s=this.cache.get(e)),this.getCachedSortedItems(s,t)}return this.sortNumericFastPath(a,e,t,s)}return this.sortMultiField(a,r,s,i)}sortNumericFastPath(e,t,s,n){if(0===e.length||"number"!=typeof e[0][t]){const i=n?e:e.slice();return i.sort((e,n)=>{const i=e[t],a=n[t],r=i<a?-1:i>a?1:0;return"asc"===s?r:-r}),i}const r=e.length,d=new Float64Array(r);for(let i=0;i<r;i++)d[i]=e[i][t];const o=new Uint32Array(r);for(let i=0;i<r;i++)o[i]=i;return i(d,r)?a(o,d,r):o.sort((e,t)=>d[e]-d[t]),this.materializeItemsFromIndexes(e,o,s)}sortMultiField(e,t,s,n){const[i,...a]=t;if(n&&this.indexedFields.has(i.field)){let e=this.cache.get(i.field);const t=this.state.getMutationVersion();e&&e.version===t||(this.buildIndexForDataset(i.field),e=this.cache.get(i.field));const s=e.hasDuplicateValues?this.getCachedSortedItems(e,i.direction).slice():this.getCachedSortedItems(e,i.direction);return e.hasDuplicateValues?this.sortTieGroups(s,i.field,a):s}const r=s?e:e.slice(),d=this.buildComparator(t);return r.sort(d),r}sortTieGroups(e,t,s){if(0===s.length)return e;const n=this.buildComparator(s),i=e.length;let a=0;for(;a<i;){let s=a+1;const r=e[a][t];for(;s<i&&e[s][t]===r;)s++;if(s-a>1){const t=e.slice(a,s);t.sort(n);for(let n=a;n<s;n++)e[n]=t[n-a]}a=s}return e}materializeItemsFromIndexes(e,t,s){const n=t.length,i=new Array(n);if("asc"===s){for(let s=0;s<n;s++)i[s]=e[t[s]];return i}for(let a=0;a<n;a++)i[a]=e[t[n-1-a]];return i}getCachedSortedItems(e,t){return"asc"===t?(null===e.ascItems&&(e.ascItems=this.materializeItemsFromIndexes(this.dataset,e.indexes,"asc")),e.ascItems):(null!==e.descItems||(e.descItems=this.getCachedSortedItems(e,"asc").slice().reverse()),e.descItems)}shouldMaintainIncrementally(e){return null!==e.ascItems||null!==e.descItems}hasDuplicateValuesForIndexes(e,t,s){for(let n=1;n<t.length;n++)if(e[t[n-1]][s]===e[t[n]][s])return!0;return!1}compareIndexesByField(e,t,s){const n=this.dataset[t][e],i=this.dataset[s][e];if("number"==typeof n&&"number"==typeof i){const e=n-i;if(0!==e)return e}else{if(n<i)return-1;if(n>i)return 1}return t-s}applyUpdatedItem(e,t,s){if(this.shouldDeferMutationCacheUpdates())this.invalidateCachedIndexes();else for(const n of this.indexedFields){if(t[n]===s[n])continue;const i=this.cache.get(n);i&&(this.shouldMaintainIncrementally(i)?this.updateCachedIndexForUpdatedItem(n,e):this.cache.delete(n))}}updateCachedIndexForUpdatedItem(e,t){const s=this.cache.get(e);if(!s)return;const{indexes:n,reverseIndex:i}=s,a=n.length,r=i[t];if(r>=a||n[r]!==t)return void this.cache.delete(e);n.copyWithin(r,r+1);const d=a-1;let o=0,l=d;for(;o<l;){const s=o+l>>1;this.compareIndexesByField(e,n[s],t)<=0?o=s+1:l=s}const h=o;n.copyWithin(h+1,h,d),n[h]=t,null!==s.ascItems&&(s.ascItems.copyWithin(r,r+1),s.ascItems.copyWithin(h+1,h,d),s.ascItems[h]=this.dataset[t]);const c=Math.min(r,h),u=Math.max(r,h);for(let m=c;m<=u;m++)i[n[m]]=m;if(s.descItems=null,!s.hasDuplicateValues){const i=h>0?n[h-1]:-1,r=h+1<a?n[h+1]:-1;s.hasDuplicateValues=-1!==i&&this.dataset[i][e]===this.dataset[t][e]||-1!==r&&this.dataset[r][e]===this.dataset[t][e]}s.version=this.state.getMutationVersion()}updateCachedIndexForAddedItems(e,t,s){const n=this.cache.get(e);if(!n)return;const i=new Array(s);for(let u=0;u<s;u++)i[u]=t+u;i.sort((t,s)=>this.compareIndexesByField(e,t,s));const a=new Uint32Array(n.indexes.length+s);let r=-1,d=n.hasDuplicateValues,o=0,l=0,h=0;for(;o<n.indexes.length&&l<i.length;){const t=this.compareIndexesByField(e,n.indexes[o],i[l])<=0?n.indexes[o++]:i[l++];a[h]=t,d||-1===r||this.dataset[r][e]!==this.dataset[t][e]||(d=!0),r=t,h+=1}for(;o<n.indexes.length;){const t=n.indexes[o++];a[h]=t,d||-1===r||this.dataset[r][e]!==this.dataset[t][e]||(d=!0),r=t,h+=1}for(;l<i.length;){const t=i[l++];a[h]=t,d||-1===r||this.dataset[r][e]!==this.dataset[t][e]||(d=!0),r=t,h+=1}const c=new Uint32Array(a.length);for(let u=0;u<a.length;u++)c[a[u]]=u;n.indexes=a,n.reverseIndex=c,n.ascItems=n.ascItems?this.materializeItemsFromIndexes(this.dataset,a,"asc"):null,n.descItems=null,n.hasDuplicateValues=d,n.version=this.state.getMutationVersion()}applyRemovedItem(e,t){if(this.shouldDeferMutationCacheUpdates())this.invalidateCachedIndexes();else for(const s of this.indexedFields){const n=this.cache.get(s);n&&(this.shouldMaintainIncrementally(n)?this.updateCachedIndexForRemovedItem(s,e,t):this.cache.delete(s))}}applyRemovedItemsBatch(e){if(this.shouldDeferMutationCacheUpdates())this.invalidateCachedIndexes();else for(const t of this.indexedFields){const s=this.cache.get(t);s&&(this.shouldMaintainIncrementally(s)?s.hasDuplicateValues?this.cache.delete(t):(this.updateUniqueCachedIndexForRemovedItems(s,e),s.version=this.state.getMutationVersion()):this.cache.delete(t))}}updateCachedIndexForRemovedItem(e,t,s){const n=this.cache.get(e);if(!n)return;if(!n.hasDuplicateValues)return this.updateUniqueCachedIndexForRemovedItem(n,t,s),void(n.version=this.state.getMutationVersion());const i=[];for(let d=0;d<n.indexes.length;d++){const e=n.indexes[d];e!==t&&e!==s&&i.push(e)}if(null!==s&&s!==t){let s=0,n=i.length;for(;s<n;){const a=s+n>>1;this.compareIndexesByField(e,i[a],t)<=0?s=a+1:n=a}i.splice(s,0,t)}const a=Uint32Array.from(i),r=new Uint32Array(this.dataset.length);for(let d=0;d<a.length;d++)r[a[d]]=d;n.indexes=a,n.reverseIndex=r,n.ascItems=n.ascItems?this.materializeItemsFromIndexes(this.dataset,a,"asc"):null,n.descItems=null,n.hasDuplicateValues=!!n.hasDuplicateValues&&this.hasDuplicateValuesForIndexes(this.dataset,a,e),n.version=this.state.getMutationVersion()}updateUniqueCachedIndexForRemovedItem(e,t,s){const n=e.indexes.length-1,i=new Uint32Array(n),a=new Uint32Array(this.dataset.length),r=null!==e.ascItems?new Array(n):null;let d=0;for(let o=0;o<e.indexes.length;o++){const n=e.indexes[o];if(n===t)continue;const l=null!==s&&n===s?t:n;i[d]=l,a[l]=d,null!==r&&(r[d]=this.dataset[l]),d+=1}e.indexes=i,e.reverseIndex=a,e.ascItems=r,e.descItems=null}updateUniqueCachedIndexForRemovedItems(e,t){const s=e.indexes.length,n=new Uint32Array(s),i=new Int32Array(s);for(let h=0;h<s;h++)n[h]=h,i[h]=-1;let a=s;for(let h=0;h<t.length;h++){const e=t[h];null!==e.movedFromIndex&&(n[e.removedIndex]=n[e.movedFromIndex]),a-=1}const r=new Uint32Array(a),d=new Uint32Array(a),o=null!==e.ascItems?new Array(a):null;for(let h=0;h<a;h++)i[n[h]]=h;let l=0;for(let h=0;h<e.indexes.length;h++){const t=i[e.indexes[h]];-1!==t&&(r[l]=t,d[t]=l,null!==o&&(o[l]=this.dataset[t]),l+=1)}e.indexes=r,e.reverseIndex=d,e.ascItems=o,e.descItems=null}buildComparator(e){const t=e.map(({field:e})=>e),s=e.map(({direction:e})=>"asc"===e?1:-1),n=t.length;return(e,i)=>{for(let a=0;a<n;a++){const n=t[a],r=e[n],d=i[n];if(r<d)return-s[a];if(r>d)return s[a]}return 0}}};export{d as SortEngine};

package/dist/types-DONld7xY.d.ts

@@ -0,0 +1,74 @@
+type CollectionItem = Record<string, any>;
+type IndexableKey<T> = {
+    [K in keyof T]: T[K] extends string | number ? K : never;
+}[keyof T];
+interface UpdateDescriptor<T extends CollectionItem> {
+    field: IndexableKey<T> & string;
+    data: T;
+}
+interface FilterCriterion<T extends CollectionItem> {
+    field: (keyof T & string) | (string & {});
+    values?: any[];
+    exclude?: any[];
+}
+type SortDirection = "asc" | "desc";
+interface SortDescriptor<T extends CollectionItem> {
+    field: keyof T & string;
+    direction: SortDirection;
+}
+type StateListener<T extends CollectionItem> = (mutation: StateMutation<T>) => void;
+interface StateRegistryFactory<TValue> {
+    (): TValue;
+}
+interface StateOptions {
+    filterByPreviousResult?: boolean;
+}
+interface StatePreviousResult<T extends CollectionItem> {
+    result: T[];
+    sourceData: T[];
+    version: number;
+}
+type StateAddMutation<T extends CollectionItem> = {
+    type: "add";
+    items: T[];
+    startIndex: number;
+};
+type StateUpdateMutation<T extends CollectionItem> = {
+    type: "update";
+    field: IndexableKey<T> & string;
+    index: number;
+    previousItem: T;
+    nextItem: T;
+};
+type StateDataMutation<T extends CollectionItem> = {
+    type: "data";
+    data: T[];
+};
+type StateClearMutation<T extends CollectionItem> = {
+    type: "clearData";
+    data: T[];
+};
+type StateRemoveMutation<T extends CollectionItem> = {
+    type: "remove";
+    field: IndexableKey<T> & string;
+    value: T[IndexableKey<T> & string];
+    removedItem: T;
+    removedIndex: number;
+    movedItem: T | null;
+    movedFromIndex: number | null;
+};
+type StateRemoveManyEntry<T extends CollectionItem> = {
+    value: T[IndexableKey<T> & string];
+    removedItem: T;
+    removedIndex: number;
+    movedItem: T | null;
+    movedFromIndex: number | null;
+};
+type StateRemoveManyMutation<T extends CollectionItem> = {
+    type: "removeMany";
+    field: IndexableKey<T> & string;
+    entries: StateRemoveManyEntry<T>[];
+};
+type StateMutation<T extends CollectionItem> = StateAddMutation<T> | StateUpdateMutation<T> | StateDataMutation<T> | StateClearMutation<T> | StateRemoveMutation<T> | StateRemoveManyMutation<T>;
+
+export type { CollectionItem as C, FilterCriterion as F, IndexableKey as I, StateOptions as S, UpdateDescriptor as U, StateListener as a, StatePreviousResult as b, StateRegistryFactory as c, SortDescriptor as d, SortDirection as e };

package/package.json

@@ -1,62 +1,39 @@
 {
   "name": "@devisfuture/mega-collection",
-  "version": "2.4.6",
+  "version": "2.4.8",
   "description": "High-performance search, filter & sort engine for 100K+ item collections in JavaScript/TypeScript",
+  "types": "./dist/index.d.ts",
   "exports": {
     ".": {
-      "types": "./dist/index.d.mts",
+      "types": "./dist/index.d.ts",
       "default": "./dist/index.mjs"
     },
     "./search": {
-      "types": "./dist/search/index.d.mts",
+      "types": "./dist/search/index.d.ts",
       "default": "./dist/search/index.mjs"
     },
     "./filter": {
-      "types": "./dist/filter/index.d.mts",
+      "types": "./dist/filter/index.d.ts",
       "default": "./dist/filter/index.mjs"
     },
     "./sort": {
-      "types": "./dist/sort/index.d.mts",
+      "types": "./dist/sort/index.d.ts",
       "default": "./dist/sort/index.mjs"
     },
     "./merge": {
-      "types": "./dist/merge/index.d.mts",
+      "types": "./dist/merge/index.d.ts",
       "default": "./dist/merge/index.mjs"
     },
     "./package.json": "./package.json"
   },
-  "typesVersions": {
-    "*": {
-      "search": [
-        "./dist/search/index.d.mts"
-      ],
-      "filter": [
-        "./dist/filter/index.d.mts"
-      ],
-      "sort": [
-        "./dist/sort/index.d.mts"
-      ],
-      "merge": [
-        "./dist/merge/index.d.mts"
-      ]
-    }
-  },
   "files": [
-    "dist/index.mjs",
-    "dist/index.d.mts",
-    "dist/chunk-*.mjs",
-    "dist/search/index.mjs",
-    "dist/search/index.d.mts",
-    "dist/filter/index.mjs",
-    "dist/filter/index.d.mts",
-    "dist/sort/index.mjs",
-    "dist/sort/index.d.mts",
-    "dist/merge/index.mjs",
-    "dist/merge/index.d.mts"
+    "dist/**/*.mjs",
+    "dist/**/*.d.ts",
+    "dist/index.d.ts"
   ],
   "sideEffects": false,
   "scripts": {
-    "build:types": "tsc --emitDeclarationOnly && node ./scripts/rename-dts-to-dmts.js",
+    "build:types": "rollup -c rollup.types.config.mjs",
     "build": "vite build && npm run build:types",
     "build:watch": "vite build --watch",
     "dev": "vite build --watch",
@@ -107,6 +84,9 @@
   "devDependencies": {
     "@types/node": "^25.5.0",
     "@vitest/coverage-v8": "^4.1.0",
+    "rollup": "^4.52.3",
+    "rollup-plugin-dts": "^6.2.3",
+    "terser": "^5.46.1",
     "typescript": "^5.3.0",
     "vite": "^8.0.0",
     "vitest": "^4.1.0"