@devisfuture/mega-collection 2.4.3 → 2.4.5

package/dist/sort/index.d.mts

@@ -1,54 +1,4 @@
-import { S as State } from '../State-2vKzwNrQ.mjs';
-import { C as CollectionItem, U as UpdateDescriptor, d as SortDescriptor } from '../types-DONld7xY.mjs';
-export { e as SortDirection } from '../types-DONld7xY.mjs';
-
-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, type SortEngineOptions };
+export { SortEngine } from "./sorter";
+export type { SortEngineOptions } from "./types";
+export type { CollectionItem, SortDescriptor, SortDirection } from "../types";
+//# sourceMappingURL=index.d.ts.map

package/dist/sort/index.mjs

@@ -1 +1,416 @@
-import {a,b as b$1}from'../chunk-MB56OSRQ.mjs';var f=class p extends Error{constructor(e){super(e),this.name="SortEngineError";}static missingDatasetForSort(){return new p("SortEngine: no dataset in memory.")}};var b="deferSortMutationCacheUpdates";function x(p,e){for(let r=0;r<e;r++){let n=p[r];if(n!==n>>>0)return  false}return  true}function I(p,e,r){let n=new Uint32Array(r),t=new Uint32Array(65536);for(let s=0;s<r;s++)t[e[p[s]]&65535]++;let i=0;for(let s=0;s<65536;s++){let a=t[s];t[s]=i,i+=a;}for(let s=0;s<r;s++){let a=e[p[s]]&65535;n[t[a]++]=p[s];}t.fill(0);for(let s=0;s<r;s++)t[e[n[s]]>>>16&65535]++;i=0;for(let s=0;s<65536;s++){let a=t[s];t[s]=i,i+=a;}for(let s=0;s<r;s++){let a=e[n[s]]>>>16&65535;p[t[a]++]=n[s];}}var S=()=>({indexedFields:new Set,cache:new Map});var g=class{constructor(e={}){if(this.state=e.state??new a(e.data??[]),this.namespace=this.state.createNamespace("sort"),this.state.subscribe(r=>this.handleStateMutation(r)),e.fields?.length){for(let r of e.fields)this.indexedFields.add(r);this.dataset.length>0&&this.rebuildConfiguredIndexes();}}get dataset(){return this.state.getOriginData()}get runtime(){return this.state.getOrCreateScopedValue(this.namespace,"runtime",S)}get cache(){return this.runtime.cache}get indexedFields(){return this.runtime.indexedFields}shouldDeferMutationCacheUpdates(){return this.state.getScopedValue(b$1,b)===true}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,r){let n=e.length,t=new Uint32Array(n);for(let o=0;o<n;o++)t[o]=o;let i=0;for(;i<n&&e[i][r]==null;)i++;if(i<n&&typeof e[i][r]=="number"){let o=new Float64Array(n);for(let l=0;l<n;l++)o[l]=e[l][r];x(o,n)?I(t,o,n):t.sort((l,d)=>o[l]-o[d]);}else {let o=new Array(n);for(let l=0;l<n;l++)o[l]=e[l][r];t.sort((l,d)=>{let c=o[l],h=o[d];return c<h?-1:c>h?1:0});}let a=new Uint32Array(n);for(let o=0;o<n;o++)a[t[o]]=o;this.cache.set(r,{indexes:t,reverseIndex:a,ascItems:null,descItems:null,hasDuplicateValues:this.hasDuplicateValuesForIndexes(e,t,r),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,r){if(r===0)return this;if(this.shouldDeferMutationCacheUpdates())return this.invalidateCachedIndexes(),this;for(let n of this.indexedFields){let t=this.cache.get(n);if(t){if(!this.shouldMaintainIncrementally(t)){this.cache.delete(n);continue}this.updateCachedIndexForAddedItems(n,e,r);}}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,r,n=false){let t=r===void 0,i,s;if(t){if(!this.dataset.length)throw f.missingDatasetForSort();i=this.dataset,s=e;}else i=e,s=r;if(s.length===0||i.length===0)return i;if(s.length===1){let{field:a,direction:o}=s[0];if(t&&this.indexedFields.has(a)){let l=this.cache.get(a),d=this.state.getMutationVersion();return (!l||l.version!==d)&&(this.buildIndexForDataset(a),l=this.cache.get(a)),this.getCachedSortedItems(l,o)}return this.sortNumericFastPath(i,a,o,n)}return this.sortMultiField(i,s,n,t)}sortNumericFastPath(e,r,n,t){if(e.length===0||typeof e[0][r]!="number"){let o=t?e:e.slice();return o.sort((l,d)=>{let c=l[r],h=d[r],u=c<h?-1:c>h?1:0;return n==="asc"?u:-u}),o}let i=e.length,s=new Float64Array(i);for(let o=0;o<i;o++)s[o]=e[o][r];let a=new Uint32Array(i);for(let o=0;o<i;o++)a[o]=o;return x(s,i)?I(a,s,i):a.sort((o,l)=>s[o]-s[l]),this.materializeItemsFromIndexes(e,a,n)}sortMultiField(e,r,n,t){let[i,...s]=r;if(t&&this.indexedFields.has(i.field)){let l=this.cache.get(i.field),d=this.state.getMutationVersion();(!l||l.version!==d)&&(this.buildIndexForDataset(i.field),l=this.cache.get(i.field));let c=l.hasDuplicateValues?this.getCachedSortedItems(l,i.direction).slice():this.getCachedSortedItems(l,i.direction);return l.hasDuplicateValues?this.sortTieGroups(c,i.field,s):c}let a=n?e:e.slice(),o=this.buildComparator(r);return a.sort(o),a}sortTieGroups(e,r,n){if(n.length===0)return e;let t=this.buildComparator(n),i=e.length,s=0;for(;s<i;){let a=s+1,o=e[s][r];for(;a<i&&e[a][r]===o;)a++;if(a-s>1){let l=e.slice(s,a);l.sort(t);for(let d=s;d<a;d++)e[d]=l[d-s];}s=a;}return e}materializeItemsFromIndexes(e,r,n){let t=r.length,i=new Array(t);if(n==="asc"){for(let s=0;s<t;s++)i[s]=e[r[s]];return i}for(let s=0;s<t;s++)i[s]=e[r[t-1-s]];return i}getCachedSortedItems(e,r){if(r==="asc")return e.ascItems===null&&(e.ascItems=this.materializeItemsFromIndexes(this.dataset,e.indexes,"asc")),e.ascItems;if(e.descItems!==null)return e.descItems;let n=this.getCachedSortedItems(e,"asc");return e.descItems=n.slice().reverse(),e.descItems}shouldMaintainIncrementally(e){return e.ascItems!==null||e.descItems!==null}hasDuplicateValuesForIndexes(e,r,n){for(let t=1;t<r.length;t++)if(e[r[t-1]][n]===e[r[t]][n])return  true;return  false}compareIndexesByField(e,r,n){let t=this.dataset[r][e],i=this.dataset[n][e];if(typeof t=="number"&&typeof i=="number"){let s=t-i;if(s!==0)return s}else {if(t<i)return  -1;if(t>i)return 1}return r-n}applyUpdatedItem(e,r,n){if(this.shouldDeferMutationCacheUpdates()){this.invalidateCachedIndexes();return}for(let t of this.indexedFields){if(r[t]===n[t])continue;let i=this.cache.get(t);if(i){if(!this.shouldMaintainIncrementally(i)){this.cache.delete(t);continue}this.updateCachedIndexForUpdatedItem(t,e);}}}updateCachedIndexForUpdatedItem(e,r){let n=this.cache.get(e);if(!n)return;let{indexes:t,reverseIndex:i}=n,s=t.length,a=i[r];if(a>=s||t[a]!==r){this.cache.delete(e);return}t.copyWithin(a,a+1);let o=s-1,l=0,d=o;for(;l<d;){let m=l+d>>1;this.compareIndexesByField(e,t[m],r)<=0?l=m+1:d=m;}let c=l;t.copyWithin(c+1,c,o),t[c]=r,n.ascItems!==null&&(n.ascItems.copyWithin(a,a+1),n.ascItems.copyWithin(c+1,c,o),n.ascItems[c]=this.dataset[r]);let h=Math.min(a,c),u=Math.max(a,c);for(let m=h;m<=u;m++)i[t[m]]=m;if(n.descItems=null,!n.hasDuplicateValues){let m=c>0?t[c-1]:-1,v=c+1<s?t[c+1]:-1;n.hasDuplicateValues=m!==-1&&this.dataset[m][e]===this.dataset[r][e]||v!==-1&&this.dataset[v][e]===this.dataset[r][e];}n.version=this.state.getMutationVersion();}updateCachedIndexForAddedItems(e,r,n){let t=this.cache.get(e);if(!t)return;let i=new Array(n);for(let u=0;u<n;u++)i[u]=r+u;i.sort((u,m)=>this.compareIndexesByField(e,u,m));let s=new Uint32Array(t.indexes.length+n),a=-1,o=t.hasDuplicateValues,l=0,d=0,c=0;for(;l<t.indexes.length&&d<i.length;){let u=this.compareIndexesByField(e,t.indexes[l],i[d])<=0?t.indexes[l++]:i[d++];s[c]=u,!o&&a!==-1&&this.dataset[a][e]===this.dataset[u][e]&&(o=true),a=u,c+=1;}for(;l<t.indexes.length;){let u=t.indexes[l++];s[c]=u,!o&&a!==-1&&this.dataset[a][e]===this.dataset[u][e]&&(o=true),a=u,c+=1;}for(;d<i.length;){let u=i[d++];s[c]=u,!o&&a!==-1&&this.dataset[a][e]===this.dataset[u][e]&&(o=true),a=u,c+=1;}let h=new Uint32Array(s.length);for(let u=0;u<s.length;u++)h[s[u]]=u;t.indexes=s,t.reverseIndex=h,t.ascItems=t.ascItems?this.materializeItemsFromIndexes(this.dataset,s,"asc"):null,t.descItems=null,t.hasDuplicateValues=o,t.version=this.state.getMutationVersion();}applyRemovedItem(e,r){if(this.shouldDeferMutationCacheUpdates()){this.invalidateCachedIndexes();return}for(let n of this.indexedFields){let t=this.cache.get(n);if(t){if(!this.shouldMaintainIncrementally(t)){this.cache.delete(n);continue}this.updateCachedIndexForRemovedItem(n,e,r);}}}applyRemovedItemsBatch(e){if(this.shouldDeferMutationCacheUpdates()){this.invalidateCachedIndexes();return}for(let r of this.indexedFields){let n=this.cache.get(r);if(n){if(!this.shouldMaintainIncrementally(n)){this.cache.delete(r);continue}if(!n.hasDuplicateValues){this.updateUniqueCachedIndexForRemovedItems(n,e),n.version=this.state.getMutationVersion();continue}this.cache.delete(r);}}}updateCachedIndexForRemovedItem(e,r,n){let t=this.cache.get(e);if(!t)return;if(!t.hasDuplicateValues){this.updateUniqueCachedIndexForRemovedItem(t,r,n),t.version=this.state.getMutationVersion();return}let i=[];for(let o=0;o<t.indexes.length;o++){let l=t.indexes[o];l===r||l===n||i.push(l);}if(n!==null&&n!==r){let o=0,l=i.length;for(;o<l;){let d=o+l>>1;this.compareIndexesByField(e,i[d],r)<=0?o=d+1:l=d;}i.splice(o,0,r);}let s=Uint32Array.from(i),a=new Uint32Array(this.dataset.length);for(let o=0;o<s.length;o++){let l=s[o];a[l]=o;}t.indexes=s,t.reverseIndex=a,t.ascItems=t.ascItems?this.materializeItemsFromIndexes(this.dataset,s,"asc"):null,t.descItems=null,t.hasDuplicateValues=t.hasDuplicateValues?this.hasDuplicateValuesForIndexes(this.dataset,s,e):false,t.version=this.state.getMutationVersion();}updateUniqueCachedIndexForRemovedItem(e,r,n){let t=e.indexes.length-1,i=new Uint32Array(t),s=new Uint32Array(this.dataset.length),a=e.ascItems!==null?new Array(t):null,o=0;for(let l=0;l<e.indexes.length;l++){let d=e.indexes[l];if(d===r)continue;let c=n!==null&&d===n?r:d;i[o]=c,s[c]=o,a!==null&&(a[o]=this.dataset[c]),o+=1;}e.indexes=i,e.reverseIndex=s,e.ascItems=a,e.descItems=null;}updateUniqueCachedIndexForRemovedItems(e,r){let n=e.indexes.length,t=new Uint32Array(n),i=new Int32Array(n);for(let c=0;c<n;c++)t[c]=c,i[c]=-1;let s=n;for(let c=0;c<r.length;c++){let h=r[c];h.movedFromIndex!==null&&(t[h.removedIndex]=t[h.movedFromIndex]),s-=1;}let a=new Uint32Array(s),o=new Uint32Array(s),l=e.ascItems!==null?new Array(s):null;for(let c=0;c<s;c++)i[t[c]]=c;let d=0;for(let c=0;c<e.indexes.length;c++){let h=e.indexes[c],u=i[h];u!==-1&&(a[d]=u,o[u]=d,l!==null&&(l[d]=this.dataset[u]),d+=1);}e.indexes=a,e.reverseIndex=o,e.ascItems=l,e.descItems=null;}buildComparator(e){let r=e.map(({field:i})=>i),n=e.map(({direction:i})=>i==="asc"?1:-1),t=r.length;return (i,s)=>{for(let a=0;a<t;a++){let o=r[a],l=i[o],d=s[o];if(l<d)return -n[a];if(l>d)return n[a]}return 0}}};export{g as SortEngine};
+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 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@devisfuture/mega-collection",
-  "version": "2.4.3",
+  "version": "2.4.5",
   "description": "High-performance search, filter & sort engine for 100K+ item collections in JavaScript/TypeScript",
   "exports": {
     ".": {
@@ -42,13 +42,24 @@
     }
   },
   "files": [
-    "dist"
+    "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"
   ],
   "sideEffects": false,
   "scripts": {
-    "build": "tsup",
-    "build:watch": "tsup --watch",
-    "dev": "tsup --watch",
+    "build:types": "tsc --emitDeclarationOnly && node ./scripts/rename-dts-to-dmts.js",
+    "build": "vite build && npm run build:types",
+    "build:watch": "vite build --watch",
+    "dev": "vite build --watch",
     "test": "vitest run",
     "test:watch": "vitest",
     "sort-bench": "npx tsx ./benchmarks/sorter.bench.ts",
@@ -95,10 +106,10 @@
   },
   "devDependencies": {
     "@types/node": "^25.5.0",
-    "@vitest/coverage-v8": "^2.1.9",
-    "tsup": "^8.0.0",
+    "@vitest/coverage-v8": "^4.1.0",
     "typescript": "^5.3.0",
-    "vitest": "^2.1.8"
+    "vite": "^8.0.0",
+    "vitest": "^4.1.0"
   },
   "license": "MIT"
 }

package/dist/State-2vKzwNrQ.d.mts

@@ -1,44 +0,0 @@
-import { C as CollectionItem, S as StateOptions, a as StateListener, b as StatePreviousResult, c as StateRegistryFactory, U as UpdateDescriptor, I as IndexableKey } from './types-DONld7xY.mjs';
-
-declare class State<T extends CollectionItem> {
-    private originData;
-    private filterByPreviousResult;
-    private itemIndexLookup;
-    private mutationVersion;
-    private namespaceSequence;
-    private previousResultState;
-    private readonly indexMaps;
-    private readonly scopedRegistry;
-    private readonly listeners;
-    constructor(data?: T[], options?: StateOptions);
-    subscribe(listener: StateListener<T>): () => void;
-    getOriginData(): T[];
-    getItemIndex(item: T): number | undefined;
-    getMutationVersion(): number;
-    isFilterByPreviousResultEnabled(): boolean;
-    setFilterByPreviousResult(enabled: boolean): void;
-    getPreviousResult(): T[] | null;
-    getPreviousResultState(): StatePreviousResult<T> | null;
-    setPreviousResult(result: T[], sourceData: T[]): void;
-    clearPreviousResult(): void;
-    createNamespace(prefix?: string): string;
-    getScopedValue<TValue>(namespace: string, key: string): TValue | undefined;
-    getOrCreateScopedValue<TValue>(namespace: string, key: string, createValue: StateRegistryFactory<TValue>): TValue;
-    setScopedValue<TValue>(namespace: string, key: string, value: TValue): TValue;
-    deleteScopedValue(namespace: string, key: string): void;
-    clearScope(namespace: string): void;
-    data(data: T[]): void;
-    add(items: T[]): void;
-    update(descriptor: UpdateDescriptor<T>): void;
-    clearData(): void;
-    removeByFieldValue(field: IndexableKey<T> & string, value: any): void;
-    removeByFieldValues(field: IndexableKey<T> & string, values: any[]): void;
-    private emit;
-    private getOrCreateScope;
-    private bumpMutationVersion;
-    private getOrCreateIndexMap;
-    private rebuildIndexMap;
-    private rebuildItemIndexLookup;
-}
-
-export { State as S };

package/dist/chunk-IZXO22NQ.mjs

@@ -1 +0,0 @@
-import {a,b}from'./chunk-MB56OSRQ.mjs';function p(o){return {value:o,enumerable:false,configurable:true,writable:true}}var f=class{constructor(e){this.callbacks=e;}create(e){let t=e;return Object.defineProperties(t,{search:p((i,r)=>r===void 0?this.callbacks.search(i):this.callbacks.search(i,r)),sort:p((i,r,n)=>r===void 0?this.callbacks.sort(e,i,n):this.callbacks.sort(i,r,n)),filter:p((i,r)=>r===void 0?this.callbacks.filter(e,i):this.callbacks.filter(i,r)),add:p(i=>this.callbacks.add(i)),update:p(i=>this.callbacks.update(i)),clearIndexes:p(i=>(this.callbacks.clearIndexes(i),this.create(e))),clearData:p(i=>(this.callbacks.clearData(i),this.create(e))),data:p(i=>this.callbacks.data(i)),getOriginData:p(()=>this.callbacks.getOriginData())}),t}};function T(o){return typeof o=="object"&&o!==null}function M(o,e){return T(o)&&typeof o[e]=="function"}function F(o){return M(o,"search")&&M(o,"getOriginData")}function m(o){return M(o,"sort")&&M(o,"getOriginData")}function D(o){return M(o,"rawFilter")&&M(o,"getOriginData")}var I=o=>{let{prototype:e}=o;return D(e)?"filter":m(e)?"sort":F(e)?"search":null},x=(o,e,t,i)=>{let r=new o({data:e,state:t,...i});return D(r)?{moduleName:"filter",executeFilter:(n,s)=>s===void 0?r.rawFilter(n):r.rawFilter(n,s),clearIndexes:()=>r.clearIndexes()}:m(r)?{moduleName:"sort",executeSort:(n,s,l)=>s===void 0?r.sort(n):r.sort(n,s,l),clearIndexes:()=>r.clearIndexes()}:F(r)?{moduleName:"search",executeSearch:(n,s)=>s===void 0?r.search(n):r.search(n,s),clearIndexes:()=>r.clearIndexes()}:null};var y="deferSortMutationCacheUpdates",P="deferSearchMutationIndexUpdates",R="deferFilterMutationIndexUpdates",w={search:"TextSearchEngine",sort:"SortEngine",filter:"FilterEngine"};var d=class o extends Error{constructor(e){super(e),this.name="MergeEnginesError";}static unavailableEngine(e){let t=w[e];return new o(`MergeEngines: ${t} is not available.`)}static unavailableGetOriginData(){return new o("MergeEngines: getOriginData is not available.")}static invalidFilterByPreviousResultOption(){return new o('MergeEngines: "filter.filterByPreviousResult" is not supported. Configure "filterByPreviousResult" on the MergeEngines root options.')}};var C=class{constructor(e){this.previousSearchState=null;this.previousFilterState=null;this.previousSortState=null;let{imports:t,data:i,filterByPreviousResult:r=false,...n}=e;this.validateFilterByPreviousResultOptions(n.filter),this.state=new a(i,{filterByPreviousResult:r});let s=new Set(t),l=null,u=null,c=null;for(let a of s){let h=I(a);if(!h)continue;let v=this.getModuleInitOptions(h,a.name,n),g=x(a,i,this.state,v);g&&(g.moduleName==="search"&&!l&&(l=g),g.moduleName==="sort"&&!u&&(u=g),g.moduleName==="filter"&&!c&&(c=g));}this.searchModule=l,this.sortModule=u,this.filterModule=c,this.sortModule&&this.state.setScopedValue(b,y,true),this.searchModule&&this.state.setScopedValue(b,P,true),this.filterModule&&this.state.setScopedValue(b,R,true),this.state.subscribe(a=>this.handleStateMutation(a)),this.chainBuilder=new f({search:(a,h)=>h===void 0?this.search(a):this.search(a,h),sort:(a,h,v)=>this.sort(a,h,v),filter:(a,h)=>this.filter(a,h),getOriginData:()=>this.getOriginData(),add:a=>this.add(a),update:a=>this.update(a),data:a=>this.data(a),clearIndexes:a=>this.clearIndexes(a),clearData:a=>this.clearData(a)});}getAdapter(e){return e==="search"?this.searchModule:e==="sort"?this.sortModule:this.filterModule}getModuleInitOptions(e,t,i){let r={};for(let n of [e,t]){let s=i[n];T(s)&&Object.assign(r,s);}return r}validateFilterByPreviousResultOptions(e){if(T(e)&&Object.prototype.hasOwnProperty.call(e,"filterByPreviousResult"))throw d.invalidFilterByPreviousResultOption()}isPreviousResultEnabled(){return this.state.isFilterByPreviousResultEnabled()}getPreviousResultInput(){return this.isPreviousResultEnabled()?this.state.getPreviousResult():null}trackPreviousResult(e,t){return this.isPreviousResultEnabled()&&this.state.setPreviousResult(e,t),e}clearOperationState(e){(!e||e==="search")&&(this.previousSearchState=null),(!e||e==="filter")&&(this.previousFilterState=null),(!e||e==="sort")&&(this.previousSortState=null);}createSearchCacheKey(e,t){return JSON.stringify([e,t??null])}createSortCacheKey(e,t){return JSON.stringify({descriptors:e,inPlace:t??false})}createFilterCacheKey(e){return JSON.stringify(e)}handleStateMutation(e){switch(e.type){case "add":this.queueSearchCacheMutation(e),this.queueFilterCacheMutation(e),this.queueSortCacheMutation(e);return;case "update":this.queueSearchCacheMutation(e),this.queueFilterCacheMutation(e),this.queueSortCacheMutation(e);return;case "remove":this.previousSearchState=null,this.previousFilterState=null,this.queueSortCacheMutation(e);return;case "removeMany":this.previousSearchState=null,this.previousFilterState=null,this.queueSortCacheMutation(e);return;case "data":case "clearData":this.previousSearchState=null,this.previousFilterState=null,this.previousSortState=null;return}}queueSearchCacheMutation(e){let t=this.previousSearchState;if(t!==null){if(!this.canPatchStoredDatasetSearch(t)){this.previousSearchState=null;return}this.previousSearchState={...t,version:this.state.getMutationVersion(),pendingMutations:t.pendingMutations.concat(e)};}}queueFilterCacheMutation(e){let t=this.previousFilterState;if(t!==null){if(!this.canPatchStoredDatasetFilter(t)){this.previousFilterState=null;return}this.previousFilterState={...t,version:this.state.getMutationVersion(),pendingMutations:t.pendingMutations.concat(e)};}}queueSortCacheMutation(e){let t=this.previousSortState;if(t!==null){if(!this.canPatchStoredDatasetSort(t)){this.previousSortState=null;return}this.previousSortState={...t,version:this.state.getMutationVersion(),pendingMutations:t.pendingMutations.concat(e)};}}resolvePendingSortCache(e){if(e.pendingMutations.length===0)return e;let t={...e,pendingMutations:[]};for(let i=0;i<e.pendingMutations.length;i++)if(t=this.applySortCacheMutation(t,e.pendingMutations[i]),t===null)return null;return t}resolvePendingSearchCache(e){if(e.pendingMutations.length===0)return e;let t={...e,pendingMutations:[]};for(let i=0;i<e.pendingMutations.length;i++)if(t=this.applySearchCacheMutation(t,e.pendingMutations[i]),t===null)return null;return t}resolvePendingFilterCache(e){if(e.pendingMutations.length===0)return e;let t={...e,pendingMutations:[]};for(let i=0;i<e.pendingMutations.length;i++)if(t=this.applyFilterCacheMutation(t,e.pendingMutations[i]),t===null)return null;return t}applySortCacheMutation(e,t){switch(t.type){case "add":return this.patchSortCacheForAddedItems(e,t.items);case "update":return this.patchSortCacheForUpdatedItem(e,t.previousItem,t.nextItem);case "remove":return this.patchSortCacheForRemovedItems(e,[t.removedItem]);case "removeMany":return this.patchSortCacheForRemovedItems(e,t.entries.map(i=>i.removedItem));case "data":case "clearData":return null}}applySearchCacheMutation(e,t){switch(t.type){case "add":return this.patchSearchCacheForAddedItems(e,t.items);case "update":return this.patchSearchCacheForUpdatedItem(e,t.previousItem,t.nextItem);case "remove":case "removeMany":case "data":case "clearData":return null}}applyFilterCacheMutation(e,t){switch(t.type){case "add":return this.patchFilterCacheForAddedItems(e,t.items);case "update":return this.patchFilterCacheForUpdatedItem(e,t.previousItem,t.nextItem);case "remove":case "removeMany":case "data":case "clearData":return null}}canPatchStoredDatasetSearch(e){return e.originData===this.state.getOriginData()&&e.field!==null}canPatchStoredDatasetFilter(e){if(e.sourceData!==this.state.getOriginData())return  false;for(let t=0;t<e.criteria.length;t++)if(!this.isPatchableFilterCriterion(e.criteria[t]))return  false;return  true}canPatchStoredDatasetSort(e){return e.sourceData===this.state.getOriginData()}compareItemsByDescriptors(e,t,i){for(let r=0;r<i.length;r++){let{field:n,direction:s}=i[r],l=e[n],u=t[n];if(l<u)return s==="asc"?-1:1;if(l>u)return s==="asc"?1:-1}return (this.state.getItemIndex(e)??-1)-(this.state.getItemIndex(t)??-1)}findSortInsertPosition(e,t,i){let r=0,n=e.length;for(;r<n;){let s=r+n>>1;this.compareItemsByDescriptors(e[s],t,i)<=0?r=s+1:n=s;}return r}findDatasetInsertPosition(e,t){let i=this.state.getItemIndex(t)??Number.MAX_SAFE_INTEGER;for(let r=0;r<e.length;r++)if((this.state.getItemIndex(e[r])??Number.MAX_SAFE_INTEGER)>i)return r;return e.length}doesItemMatchSearchCache(e,t){if(e.field===null||e.lowerQuery.length===0)return  false;let i=t[e.field];return typeof i=="string"&&i.toLowerCase().includes(e.lowerQuery)}patchSearchCacheForAddedItems(e,t){if(!this.canPatchStoredDatasetSearch(e))return null;let i=e.result.slice();for(let r=0;r<t.length;r++){let n=t[r];this.doesItemMatchSearchCache(e,n)&&i.push(n);}return {...e,result:i,pendingMutations:[],version:this.state.getMutationVersion()}}patchSearchCacheForUpdatedItem(e,t,i){if(!this.canPatchStoredDatasetSearch(e))return null;let r=e.result.slice(),n=r.indexOf(t),s=this.doesItemMatchSearchCache(e,i);if(n!==-1)s?r[n]=i:r.splice(n,1);else if(s){let l=this.findDatasetInsertPosition(r,i);r.splice(l,0,i);}return {...e,result:r,pendingMutations:[],version:this.state.getMutationVersion()}}isPatchableFilterCriterion(e){return !String(e.field).includes(".")}doesItemMatchFilterCache(e,t){for(let i=0;i<e.criteria.length;i++){let r=e.criteria[i];if(!this.isPatchableFilterCriterion(r))return  false;let n=t[r.field];if(r.values!==void 0&&r.values.length>0&&!r.values.includes(n)||r.exclude!==void 0&&r.exclude.length>0&&r.exclude.includes(n))return  false}return  true}patchFilterCacheForAddedItems(e,t){if(!this.canPatchStoredDatasetFilter(e))return null;let i=e.result.slice();for(let r=0;r<t.length;r++){let n=t[r];this.doesItemMatchFilterCache(e,n)&&i.push(n);}return {...e,result:i,pendingMutations:[],version:this.state.getMutationVersion()}}patchFilterCacheForUpdatedItem(e,t,i){if(!this.canPatchStoredDatasetFilter(e))return null;let r=e.result.slice(),n=r.indexOf(t),s=this.doesItemMatchFilterCache(e,i);if(n!==-1)s?r[n]=i:r.splice(n,1);else if(s){let l=this.findDatasetInsertPosition(r,i);r.splice(l,0,i);}return {...e,result:r,pendingMutations:[],version:this.state.getMutationVersion()}}patchSortCacheForAddedItems(e,t){if(!this.canPatchStoredDatasetSort(e))return null;let i=e.result.slice();for(let r=0;r<t.length;r++){let n=t[r],s=this.findSortInsertPosition(i,n,e.descriptors);i.splice(s,0,n);}return {...e,result:i,pendingMutations:[],version:this.state.getMutationVersion()}}patchSortCacheForUpdatedItem(e,t,i){if(!this.canPatchStoredDatasetSort(e))return null;let r=e.result.slice(),n=r.indexOf(t);if(n===-1)return e.result.indexOf(i)!==-1?{...e,pendingMutations:[],version:this.state.getMutationVersion()}:null;if(!e.descriptors.some(({field:u})=>t[u]!==i[u]))return r[n]=i,{...e,result:r,pendingMutations:[],version:this.state.getMutationVersion()};r.splice(n,1);let l=this.findSortInsertPosition(r,i,e.descriptors);return r.splice(l,0,i),{...e,result:r,pendingMutations:[],version:this.state.getMutationVersion()}}patchSortCacheForRemovedItems(e,t){if(!this.canPatchStoredDatasetSort(e))return null;let i=new Set(t);return {...e,result:Array.prototype.filter.call(e.result,r=>!i.has(r)),pendingMutations:[],version:this.state.getMutationVersion()}}search(e,t){if(!this.searchModule)throw d.unavailableEngine("search");let i=this.state.getOriginData(),r=this.state.getMutationVersion(),n=this.createSearchCacheKey(e,t),s=this.previousSearchState;if(s?.originData===i&&s.key===n&&s.version===r){let u=this.resolvePendingSearchCache(s);if(u!==null)return this.previousSearchState=u,this.withChain(this.trackPreviousResult(u.result,i));this.previousSearchState=null;}let l=t===void 0?this.searchModule.executeSearch(e):this.searchModule.executeSearch(e,t);return this.previousSearchState={key:n,originData:i,result:l,version:r,field:t===void 0?null:e,lowerQuery:(t??e).trim().toLowerCase(),pendingMutations:[]},this.withChain(this.trackPreviousResult(l,i))}sort(e,t,i){if(!this.sortModule)throw d.unavailableEngine("sort");let r,n;if(t===void 0?(n=e,r=this.getPreviousResultInput()??this.state.getOriginData()):(r=e,n=t),!i){let s=this.state.getMutationVersion(),l=this.createSortCacheKey(n,i),u=this.previousSortState;if(u?.sourceData===r&&u.key===l&&u.version===s){let a=this.resolvePendingSortCache(u);if(a!==null)return this.previousSortState=a,this.withChain(this.trackPreviousResult(a.result,r));this.previousSortState=null;}let c=t===void 0&&r===this.state.getOriginData()?this.sortModule.executeSort(n):this.sortModule.executeSort(r,n,i);return this.previousSortState={key:l,sourceData:r,result:c,version:s,descriptors:n,pendingMutations:[]},this.withChain(this.trackPreviousResult(c,r))}return this.withChain(this.trackPreviousResult(this.sortModule.executeSort(r,n,i),r))}filter(e,t){if(!this.filterModule)throw d.unavailableEngine("filter");if(t===void 0){let r=this.getPreviousResultInput(),n=r??this.state.getOriginData(),s=e,l=this.state.getMutationVersion(),u=this.createFilterCacheKey(s),c=this.previousFilterState;if(c?.sourceData===n&&c.key===u&&c.version===l){let h=this.resolvePendingFilterCache(c);if(h!==null)return this.previousFilterState=h,this.withChain(this.trackPreviousResult(h.result,n));this.previousFilterState=null;}let a=r===null?this.filterModule.executeFilter(s):this.filterModule.executeFilter(r,s);return this.previousFilterState={key:u,sourceData:n,result:a,version:l,criteria:s,pendingMutations:[]},this.withChain(this.trackPreviousResult(a,n))}let i=e;return this.withChain(this.trackPreviousResult(this.filterModule.executeFilter(i,t),i))}withChain(e){return this.chainBuilder.create(e)}getOriginData(){if(this.searchModule||this.sortModule||this.filterModule)return this.state.getOriginData();throw d.unavailableGetOriginData()}add(e){return e.length===0?this:(this.state.add(e),this)}update(e){return this.state.update(e),this}clearIndexes(e){let t=this.getAdapter(e);if(t)return t.clearIndexes(),this.clearOperationState(e),this;throw d.unavailableEngine(e)}data(e){return this.state.data(e),this}clearData(e){if(this.getAdapter(e))return this.state.clearData(),this;throw d.unavailableEngine(e)}};export{C as a};

package/dist/chunk-MB56OSRQ.mjs

@@ -1 +0,0 @@
-var g=class{constructor(e=[],t={}){this.itemIndexLookup=new WeakMap;this.mutationVersion=0;this.namespaceSequence=0;this.previousResultState=null;this.indexMaps=new Map;this.scopedRegistry=new Map;this.listeners=new Set;this.originData=e,this.filterByPreviousResult=t.filterByPreviousResult??false,this.rebuildItemIndexLookup();}subscribe(e){return this.listeners.add(e),()=>{this.listeners.delete(e);}}getOriginData(){return this.originData}getItemIndex(e){return this.itemIndexLookup.get(e)}getMutationVersion(){return this.mutationVersion}isFilterByPreviousResultEnabled(){return this.filterByPreviousResult}setFilterByPreviousResult(e){this.filterByPreviousResult=e,e||this.clearPreviousResult();}getPreviousResult(){return this.getPreviousResultState()?.result??null}getPreviousResultState(){return this.previousResultState===null||this.previousResultState.version!==this.mutationVersion?null:this.previousResultState}setPreviousResult(e,t){this.previousResultState={result:e,sourceData:t,version:this.mutationVersion};}clearPreviousResult(){this.previousResultState=null;}createNamespace(e="scope"){return this.namespaceSequence+=1,`${e}:${this.namespaceSequence}`}getScopedValue(e,t){return this.scopedRegistry.get(e)?.get(t)}getOrCreateScopedValue(e,t,i){let n=this.getScopedValue(e,t);if(n!==void 0)return n;let o=this.getOrCreateScope(e),r=i();return o.set(t,r),r}setScopedValue(e,t,i){return this.getOrCreateScope(e).set(t,i),i}deleteScopedValue(e,t){let i=this.scopedRegistry.get(e);i&&(i.delete(t),i.size===0&&this.scopedRegistry.delete(e));}clearScope(e){this.scopedRegistry.delete(e);}data(e){this.originData=e,this.bumpMutationVersion(),this.rebuildItemIndexLookup();for(let t of this.indexMaps.keys())this.rebuildIndexMap(t);this.emit({type:"data",data:e});}add(e){if(e.length===0)return;let t=this.originData.length;for(let i=0;i<e.length;i++)this.originData.push(e[i]),this.itemIndexLookup.set(e[i],t+i);this.bumpMutationVersion();for(let[i,n]of this.indexMaps)for(let o=0;o<e.length;o++)n.set(e[o][i],t+o);this.emit({type:"add",items:e,startIndex:t});}update(e){let{field:t,data:i}=e,n=i[t];if(n==null)return;let r=this.getOrCreateIndexMap(t).get(n);if(r===void 0)return;let s=this.originData[r];this.originData[r]=i,this.itemIndexLookup.delete(s),this.itemIndexLookup.set(i,r),this.bumpMutationVersion();for(let[d,u]of this.indexMaps){let a=s[d],l=i[d];a!==l&&(u.get(a)===r&&u.delete(a),u.set(l,r));}this.emit({type:"update",field:t,index:r,previousItem:s,nextItem:i});}clearData(){let e=[];this.originData=e,this.itemIndexLookup=new WeakMap,this.bumpMutationVersion();for(let t of this.indexMaps.values())t.clear();this.emit({type:"clearData",data:e});}removeByFieldValue(e,t){let n=this.getOrCreateIndexMap(e).get(t);if(n===void 0)return;let o=this.originData.length-1,r=this.originData[n],s=n===o?null:this.originData[o];n!==o&&s&&(this.originData[n]=s,this.itemIndexLookup.set(s,n)),this.originData.pop(),this.itemIndexLookup.delete(r),this.bumpMutationVersion();for(let[d,u]of this.indexMaps){let a=r[d];u.get(a)===n&&u.delete(a),s&&u.set(s[d],n);}this.emit({type:"remove",field:e,value:t,removedItem:r,removedIndex:n,movedItem:s,movedFromIndex:s?o:null});}removeByFieldValues(e,t){if(t.length===0)return;let i=this.getOrCreateIndexMap(e),n=[];for(let o=0;o<t.length;o++){let r=t[o],s=i.get(r);if(s===void 0)continue;let d=this.originData.length-1,u=this.originData[s],a=s===d?null:this.originData[d];s!==d&&a&&(this.originData[s]=a,this.itemIndexLookup.set(a,s)),this.originData.pop(),this.itemIndexLookup.delete(u);for(let[l,p]of this.indexMaps){let h=u[l];p.get(h)===s&&p.delete(h),a&&p.set(a[l],s);}n.push({value:r,removedItem:u,removedIndex:s,movedItem:a,movedFromIndex:a?d:null});}n.length!==0&&(this.bumpMutationVersion(),this.emit({type:"removeMany",field:e,entries:n}));}emit(e){for(let t of this.listeners)t(e);}getOrCreateScope(e){let t=this.scopedRegistry.get(e);if(t)return t;let i=new Map;return this.scopedRegistry.set(e,i),i}bumpMutationVersion(){this.mutationVersion+=1,this.clearPreviousResult();}getOrCreateIndexMap(e){let t=this.indexMaps.get(e);return t||this.rebuildIndexMap(e)}rebuildIndexMap(e){let t=new Map;for(let i=0;i<this.originData.length;i++)t.set(this.originData[i][e],i);return this.indexMaps.set(e,t),t}rebuildItemIndexLookup(){this.itemIndexLookup=new WeakMap;for(let e=0;e<this.originData.length;e++)this.itemIndexLookup.set(this.originData[e],e);}};var m="__merge__";export{g as a,m as b};