@devisfuture/mega-collection 2.4.7 → 2.5.0

package/dist/State.mjs

@@ -1,183 +0,0 @@
-//#region src/State.ts
-var e = class {
-	constructor(e = [], t = {}) {
-		this.itemIndexLookup = /* @__PURE__ */ new WeakMap(), this.mutationVersion = 0, this.namespaceSequence = 0, this.previousResultState = null, this.indexMaps = /* @__PURE__ */ new Map(), this.scopedRegistry = /* @__PURE__ */ new Map(), this.listeners = /* @__PURE__ */ new Set(), this.originData = e, this.filterByPreviousResult = t.filterByPreviousResult ?? !1, 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, n) {
-		let r = this.getScopedValue(e, t);
-		if (r !== void 0) return r;
-		let i = this.getOrCreateScope(e), a = n();
-		return i.set(t, a), a;
-	}
-	setScopedValue(e, t, n) {
-		return this.getOrCreateScope(e).set(t, n), n;
-	}
-	deleteScopedValue(e, t) {
-		let n = this.scopedRegistry.get(e);
-		n && (n.delete(t), n.size === 0 && this.scopedRegistry.delete(e));
-	}
-	clearScope(e) {
-		this.scopedRegistry.delete(e);
-	}
-	data(e) {
-		this.originData = e, this.bumpMutationVersion(), this.rebuildItemIndexLookup();
-		for (let e of this.indexMaps.keys()) this.rebuildIndexMap(e);
-		this.emit({
-			type: "data",
-			data: e
-		});
-	}
-	add(e) {
-		if (e.length === 0) return;
-		let t = this.originData.length;
-		for (let n = 0; n < e.length; n++) this.originData.push(e[n]), this.itemIndexLookup.set(e[n], t + n);
-		this.bumpMutationVersion();
-		for (let [n, r] of this.indexMaps) for (let i = 0; i < e.length; i++) r.set(e[i][n], t + i);
-		this.emit({
-			type: "add",
-			items: e,
-			startIndex: t
-		});
-	}
-	update(e) {
-		let { field: t, data: n } = e, r = n[t];
-		if (r == null) return;
-		let i = this.getOrCreateIndexMap(t).get(r);
-		if (i === void 0) return;
-		let a = this.originData[i];
-		this.originData[i] = n, this.itemIndexLookup.delete(a), this.itemIndexLookup.set(n, i), this.bumpMutationVersion();
-		for (let [e, t] of this.indexMaps) {
-			let r = a[e], o = n[e];
-			r !== o && (t.get(r) === i && t.delete(r), t.set(o, i));
-		}
-		this.emit({
-			type: "update",
-			field: t,
-			index: i,
-			previousItem: a,
-			nextItem: n
-		});
-	}
-	clearData() {
-		let e = [];
-		this.originData = e, this.itemIndexLookup = /* @__PURE__ */ new WeakMap(), this.bumpMutationVersion();
-		for (let e of this.indexMaps.values()) e.clear();
-		this.emit({
-			type: "clearData",
-			data: e
-		});
-	}
-	removeByFieldValue(e, t) {
-		let n = this.getOrCreateIndexMap(e).get(t);
-		if (n === void 0) return;
-		let r = this.originData.length - 1, i = this.originData[n], a = n === r ? null : this.originData[r];
-		n !== r && a && (this.originData[n] = a, this.itemIndexLookup.set(a, n)), this.originData.pop(), this.itemIndexLookup.delete(i), this.bumpMutationVersion();
-		for (let [e, t] of this.indexMaps) {
-			let r = i[e];
-			t.get(r) === n && t.delete(r), a && t.set(a[e], n);
-		}
-		this.emit({
-			type: "remove",
-			field: e,
-			value: t,
-			removedItem: i,
-			removedIndex: n,
-			movedItem: a,
-			movedFromIndex: a ? r : null
-		});
-	}
-	removeByFieldValues(e, t) {
-		if (t.length === 0) return;
-		let n = this.getOrCreateIndexMap(e), r = [];
-		for (let e = 0; e < t.length; e++) {
-			let i = t[e], a = n.get(i);
-			if (a === void 0) continue;
-			let o = this.originData.length - 1, s = this.originData[a], c = a === o ? null : this.originData[o];
-			a !== o && c && (this.originData[a] = c, this.itemIndexLookup.set(c, a)), this.originData.pop(), this.itemIndexLookup.delete(s);
-			for (let [e, t] of this.indexMaps) {
-				let n = s[e];
-				t.get(n) === a && t.delete(n), c && t.set(c[e], a);
-			}
-			r.push({
-				value: i,
-				removedItem: s,
-				removedIndex: a,
-				movedItem: c,
-				movedFromIndex: c ? o : null
-			});
-		}
-		r.length !== 0 && (this.bumpMutationVersion(), this.emit({
-			type: "removeMany",
-			field: e,
-			entries: r
-		}));
-	}
-	emit(e) {
-		for (let t of this.listeners) t(e);
-	}
-	getOrCreateScope(e) {
-		let t = this.scopedRegistry.get(e);
-		if (t) return t;
-		let n = /* @__PURE__ */ new Map();
-		return this.scopedRegistry.set(e, n), n;
-	}
-	bumpMutationVersion() {
-		this.mutationVersion += 1, this.clearPreviousResult();
-	}
-	getOrCreateIndexMap(e) {
-		return this.indexMaps.get(e) || this.rebuildIndexMap(e);
-	}
-	rebuildIndexMap(e) {
-		let t = /* @__PURE__ */ new Map();
-		for (let n = 0; n < this.originData.length; n++) t.set(this.originData[n][e], n);
-		return this.indexMaps.set(e, t), t;
-	}
-	rebuildItemIndexLookup() {
-		this.itemIndexLookup = /* @__PURE__ */ new WeakMap();
-		for (let e = 0; e < this.originData.length; e++) this.itemIndexLookup.set(this.originData[e], e);
-	}
-};
-//#endregion
-export { e as State };

package/dist/constants.d.ts

@@ -1,5 +0,0 @@
-export declare const MERGE_SHARED_SCOPE = "__merge__";
-export declare const DEFER_FILTER_MUTATION_INDEX_UPDATES_KEY = "deferFilterMutationIndexUpdates";
-export declare const DEFER_SEARCH_MUTATION_INDEX_UPDATES_KEY = "deferSearchMutationIndexUpdates";
-export declare const DEFER_SORT_MUTATION_CACHE_UPDATES_KEY = "deferSortMutationCacheUpdates";
-//# sourceMappingURL=constants.d.ts.map

package/dist/constants.mjs

@@ -1,4 +0,0 @@
-//#region src/constants.ts
-var e = "__merge__", t = "deferFilterMutationIndexUpdates", n = "deferSearchMutationIndexUpdates", r = "deferSortMutationCacheUpdates";
-//#endregion
-export { t as DEFER_FILTER_MUTATION_INDEX_UPDATES_KEY, n as DEFER_SEARCH_MUTATION_INDEX_UPDATES_KEY, r as DEFER_SORT_MUTATION_CACHE_UPDATES_KEY, e as MERGE_SHARED_SCOPE };

package/dist/filter/chain.d.ts

@@ -1,9 +0,0 @@
-import type { CollectionItem } from "../types";
-import type { FilterEngineChain, FilterEngineChainCallbacks } from "./types";
-export type { FilterEngineChain } from "./types";
-export declare class FilterEngineChainBuilder<T extends CollectionItem> {
-    private readonly callbacks;
-    constructor(callbacks: FilterEngineChainCallbacks<T>);
-    create(result: T[]): T[] & FilterEngineChain<T>;
-}
-//# sourceMappingURL=chain.d.ts.map

package/dist/filter/chain.mjs

@@ -1,22 +0,0 @@
-import { createChainMethodDescriptor as e } from "../internal.mjs";
-//#region src/filter/chain.ts
-var t = class {
-	constructor(e) {
-		this.callbacks = e;
-	}
-	create(t) {
-		let n = t;
-		return Object.defineProperties(n, {
-			filter: e((e, n) => n === void 0 ? this.callbacks.filter(t, e) : this.callbacks.filter(e, n)),
-			add: e((e) => this.callbacks.add(e)),
-			update: e((e) => this.callbacks.update(e)),
-			clearIndexes: e(() => this.callbacks.clearIndexes()),
-			data: e((e) => this.callbacks.data(e)),
-			getOriginData: e(() => this.callbacks.getOriginData()),
-			clearData: e(() => this.callbacks.clearData()),
-			resetFilterState: e(() => this.callbacks.resetFilterState())
-		}), n;
-	}
-};
-//#endregion
-export { t as FilterEngineChainBuilder };

package/dist/filter/constants.d.ts

@@ -1,2 +0,0 @@
-export { DEFER_FILTER_MUTATION_INDEX_UPDATES_KEY } from "../constants";
-//# sourceMappingURL=constants.d.ts.map

package/dist/filter/criterion.d.ts

@@ -1,6 +0,0 @@
-import type { CollectionItem, FilterCriterion } from "../types";
-import type { ResolvedFilterCriterion } from "./types";
-export declare function resolveCriteria<T extends CollectionItem>(criteria: FilterCriterion<T>[]): ResolvedFilterCriterion<T>[];
-export declare function matchesCriterionValue<T extends CollectionItem>(criterion: ResolvedFilterCriterion<T>, value: any): boolean;
-export declare function isCriterionUnsatisfiable<T extends CollectionItem>(criterion: ResolvedFilterCriterion<T>): boolean;
-//# sourceMappingURL=criterion.d.ts.map

package/dist/filter/criterion.mjs

@@ -1,64 +0,0 @@
-//#region src/filter/criterion.ts
-function e(e) {
-	let t = /* @__PURE__ */ new Map();
-	for (let n = 0; n < e.length; n++) {
-		let a = e[n], o = Array.isArray(a.values), s = r(a.exclude), c = s !== null, l = o ? i(a.values, s) : null;
-		if (!o && !c) continue;
-		let u = a.field, d = t.get(u);
-		if (!d) {
-			t.set(u, {
-				field: a.field,
-				values: [],
-				exclude: [],
-				hasValues: o,
-				hasExclude: c,
-				includedValues: l ? new Set(l) : null,
-				excludedValues: s ? new Set(s) : null,
-				cacheKeySegment: ""
-			});
-			continue;
-		}
-		if (o) if (!d.hasValues) d.hasValues = !0, d.includedValues = new Set(l);
-		else for (let e of d.includedValues) l.has(e) || d.includedValues.delete(e);
-		if (c) if (!d.hasExclude) d.hasExclude = !0, d.excludedValues = new Set(s);
-		else for (let e of s) d.excludedValues.add(e);
-	}
-	let n = [...t.values()].sort((e, t) => e.field.localeCompare(t.field));
-	for (let e = 0; e < n.length; e++) a(n[e]);
-	return n;
-}
-function t(e, t) {
-	return !(e.hasValues && !e.includedValues.has(t) || e.hasExclude && e.excludedValues.has(t));
-}
-function n(e) {
-	return e.hasValues && e.values.length === 0;
-}
-function r(e) {
-	return !Array.isArray(e) || e.length === 0 ? null : new Set(e);
-}
-function i(e, t) {
-	let n = /* @__PURE__ */ new Set();
-	for (let r = 0; r < e.length; r++) {
-		let i = e[r];
-		t?.has(i) || n.add(i);
-	}
-	return n;
-}
-function a(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 = o(e);
-}
-function o(e) {
-	let t = e.field;
-	return t += `|hv:${e.hasValues ? "1" : "0"}|v:`, e.hasValues && (t += s(e.values)), t += `|hx:${e.hasExclude ? "1" : "0"}|x:`, e.hasExclude && (t += s(e.exclude)), t;
-}
-function s(e) {
-	return e.length === 0 ? "" : e.map((e) => c(e)).sort().join(",");
-}
-function c(e) {
-	if (e === null) return "null:null";
-	let t = typeof e;
-	return t === "object" ? `object:${JSON.stringify(e)}` : `${t}:${String(e)}`;
-}
-//#endregion
-export { n as isCriterionUnsatisfiable, t as matchesCriterionValue, e as resolveCriteria };

package/dist/filter/errors.d.ts

@@ -1,7 +0,0 @@
-export declare class FilterEngineError extends Error {
-    constructor(message: string);
-    static missingDatasetForBuildIndex(): FilterEngineError;
-    static missingDatasetForFilter(): FilterEngineError;
-    static duplicateMutableExcludeField(field: string): FilterEngineError;
-}
-//# sourceMappingURL=errors.d.ts.map

package/dist/filter/errors.mjs

@@ -1,17 +0,0 @@
-//#region src/filter/errors.ts
-var e = class e extends Error {
-	constructor(e) {
-		super(e), this.name = "FilterEngineError";
-	}
-	static missingDatasetForBuildIndex() {
-		return new e("FilterEngine: no dataset in memory. Call data() or add() before buildIndex().");
-	}
-	static missingDatasetForFilter() {
-		return new e("FilterEngine: no dataset in memory. Call data() or add() before filter().");
-	}
-	static duplicateMutableExcludeField(t) {
-		return new e(`FilterEngine: cannot use mutable exclude on field \`${t}\` because it contains duplicate values.`);
-	}
-};
-//#endregion
-export { e as FilterEngineError };

package/dist/filter/filter.d.ts

@@ -1,89 +0,0 @@
-/**
- * FilterEngine class for filtering collections by multiple criteria,
- * supporting indexed lookups and linear scans for large datasets.
- */
-import { State } from "../State";
-import { CollectionItem, FilterCriterion, type UpdateDescriptor } from "../types";
-import { FilterEngineChain } from "./chain";
-import type { FilterEngineOptions } from "./types";
-export declare class FilterEngine<T extends CollectionItem> {
-    private readonly indexer;
-    private readonly filterByPreviousResult;
-    private readonly mutableExcludeField;
-    private readonly state;
-    private readonly namespace;
-    private readonly nestedCollection;
-    private readonly chainBuilder;
-    /**
-     * Creates a new FilterEngine with optional data and fields to index.
-     */
-    constructor(options?: FilterEngineOptions<T> & {
-        state?: State<T>;
-    });
-    private get dataset();
-    private get runtime();
-    private get mutableExcludeState();
-    private get indexedFields();
-    private get sequentialCache();
-    private shouldDeferMutationIndexUpdates;
-    private markDeferredMutationState;
-    private ensureRuntimeReady;
-    private rebuildConfiguredIndexes;
-    /**
-     * Builds an index for the given field.
-     */
-    private buildIndex;
-    clearIndexes(): this;
-    resetFilterState(): this;
-    clearData(): this;
-    data(data: T[]): this;
-    add(items: T[]): this;
-    update(descriptor: UpdateDescriptor<T>): this;
-    private applyAddedItems;
-    getOriginData(): T[];
-    /**
-     * Filters the data based on the given criteria.
-     */
-    filter(criteria: FilterCriterion<T>[]): T[] & FilterEngineChain<T>;
-    filter(data: T[], criteria: FilterCriterion<T>[]): T[] & FilterEngineChain<T>;
-    rawFilter(criteria: FilterCriterion<T>[]): T[];
-    rawFilter(data: T[], criteria: FilterCriterion<T>[]): T[];
-    private resolveWithSequentialCache;
-    private withChain;
-    private handleStateMutation;
-    private rebuildMutableExcludeState;
-    private updateMutableExcludeStateForAddedItems;
-    private applyMutableExclude;
-    private applyUpdatedItem;
-    private applyRemovedItem;
-    private applyRemovedItems;
-    private updateMutableExcludeStateForUpdatedItem;
-    private clearMutableExcludeState;
-    private registerMutableExcludeValue;
-    private unregisterMutableExcludeValue;
-    /**
-     * Filters data linearly without index.
-     */
-    private linearFilter;
-    /**
-     * Filters data using the index.
-     */
-    private filterViaIndex;
-    /**
-     * Estimates the size of the index for a criterion.
-     */
-    private estimateIndexSize;
-    private applyIndexedExclusions;
-    private createEmptyResult;
-    private storePreviousResult;
-    private createCriteriaCacheKey;
-    private createSequentialCacheEntry;
-    private createSequentialExecutionCriteria;
-    private hasCriteriaBacktrack;
-    private canApplySequentiallyToEmptyResult;
-    private createCriteriaStateMap;
-    private isCriterionBacktracked;
-    private isSubset;
-    private areSetsEqual;
-}
-//# sourceMappingURL=filter.d.ts.map