@signaldb/core 2.0.0-beta.13 → 2.0.0-beta.14

package/dist/index14.mjs

@@ -1,86 +1,45 @@
-import createIndexProvider from "./index9.mjs";
-import get from "./index10.mjs";
-import serializeValue from "./index12.mjs";
-import getMatchingKeys from "./index13.mjs";
-//#region src/createIndex.ts
+import isFieldExpression from "./index12.mjs";
+import serializeValue from "./index13.mjs";
+//#region src/utils/getMatchingKeys.ts
 /**
-* creates an index for a specific field
-* @param field name of the field
-* @returns an index provider to pass to the `indices` option of the collection constructor
+* Extracts the matching and excluded keys for a given field in a selector.
+* Supports serialized values and `$in`/`$nin` field expressions for optimization.
+* Returns `null` for include/exclude if the field cannot be optimized.
+* @template T - The type of the items in the selector.
+* @template I - The type of the unique identifier for the items.
+* @param field - The name of the field to extract matching keys for.
+* @param selector - The selector object containing query criteria.
+* @returns An object containing arrays of serialized included and excluded keys,
+*   or `null` if the field cannot be optimized.
 */
-function createIndex(field) {
-	const index = /* @__PURE__ */ new Map();
-	const ensureSet = (key) => {
-		let set = index.get(key);
-		if (!set) {
-			set = /* @__PURE__ */ new Set();
-			index.set(key, set);
-		}
-		return set;
+function getMatchingKeys(field, selector) {
+	const result = {
+		include: null,
+		exclude: null
 	};
-	return createIndexProvider({
-		query(selector) {
-			if (!Object.hasOwnProperty.call(selector, field)) return { matched: false };
-			const fieldSelector = selector[field];
-			const filteresForNull = fieldSelector == null || fieldSelector.$exists === false;
-			const keys = filteresForNull ? {
-				include: null,
-				exclude: [...index.keys()].filter((key) => key != null)
-			} : getMatchingKeys(field, selector);
-			if (keys.include == null && keys.exclude == null) return { matched: false };
-			let includedIds = [];
-			if (keys.include == null) for (const set of index.values()) for (const pos of set) includedIds.push(pos);
-			else for (const key of keys.include) {
-				const posSet = index.get(key);
-				if (posSet) for (const pos of posSet) includedIds.push(pos);
-			}
-			if (keys.exclude != null) {
-				const excludeIds = /* @__PURE__ */ new Set();
-				for (const key of keys.exclude) {
-					const posSet = index.get(key);
-					if (posSet) for (const pos of posSet) excludeIds.add(pos);
-				}
-				includedIds = includedIds.filter((pos) => !excludeIds.has(pos));
-			}
-			return {
-				matched: true,
-				ids: includedIds,
-				fields: [field],
-				keepSelector: filteresForNull
-			};
-		},
-		rebuild(items) {
-			index.clear();
-			items.forEach((item) => {
-				ensureSet(serializeValue(get(item, field))).add(item.id);
-			});
-		},
-		insert(items) {
-			for (const item of items) ensureSet(serializeValue(get(item, field))).add(item.id);
-		},
-		remove(items) {
-			for (const item of items) {
-				const value = serializeValue(get(item, field));
-				const set = index.get(value);
-				if (!set) continue;
-				set.delete(item.id);
-				if (set.size === 0) index.delete(value);
-			}
-		},
-		update(pairs) {
-			for (const { oldItem, newItem } of pairs) {
-				const oldValue = serializeValue(get(oldItem, field));
-				const newValue = serializeValue(get(newItem, field));
-				if (oldValue === newValue) continue;
-				const oldSet = index.get(oldValue);
-				if (oldSet) {
-					oldSet.delete(oldItem.id);
-					if (oldSet.size === 0) index.delete(oldValue);
-				}
-				ensureSet(newValue).add(newItem.id);
-			}
+	const fieldSelector = selector[field];
+	if (fieldSelector instanceof RegExp) return result;
+	if (fieldSelector == null) return result;
+	if (isFieldExpression(fieldSelector)) {
+		if (fieldSelector.$ne != null) {
+			result.exclude = [serializeValue(fieldSelector.$ne)];
+			return result;
+		}
+		if (Array.isArray(fieldSelector.$in) && fieldSelector.$in.length > 0) {
+			result.include = fieldSelector.$in.map(serializeValue);
+			return result;
+		}
+		if (Array.isArray(fieldSelector.$nin) && fieldSelector.$nin.length > 0) {
+			result.exclude = fieldSelector.$nin.map(serializeValue);
+			return result;
 		}
-	});
+		return {
+			include: null,
+			exclude: null
+		};
+	}
+	result.include = [serializeValue(fieldSelector)];
+	return result;
 }
 //#endregion
-export { createIndex as default };
+export { getMatchingKeys as default };

package/dist/index15.cjs.js

@@ -1,15 +1,86 @@
-//#region src/utils/intersection.ts
+const require_createIndexProvider = require("./index10.cjs.js");
+const require_get = require("./index11.cjs.js");
+const require_serializeValue = require("./index13.cjs.js");
+const require_getMatchingKeys = require("./index14.cjs.js");
+//#region src/createIndex.ts
 /**
-* Computes the intersection of multiple arrays, returning an array of unique elements
-* that are present in all the input arrays.
-* @template T - The type of elements in the arrays.
-* @param arrays - A variable number of arrays to compute the intersection of.
-* @returns An array containing the unique elements found in all the input arrays.
-*   - If no arrays are provided, returns an empty array.
+* creates an index for a specific field
+* @param field name of the field
+* @returns an index provider to pass to the `indices` option of the collection constructor
 */
-function intersection(...arrays) {
-	if (arrays.length === 0) return [];
-	return [...new Set(arrays.reduce((a, b) => a.filter((c) => b.includes(c))))];
+function createIndex(field) {
+	const index = /* @__PURE__ */ new Map();
+	const ensureSet = (key) => {
+		let set = index.get(key);
+		if (!set) {
+			set = /* @__PURE__ */ new Set();
+			index.set(key, set);
+		}
+		return set;
+	};
+	return require_createIndexProvider.default({
+		query(selector) {
+			if (!Object.hasOwnProperty.call(selector, field)) return { matched: false };
+			const fieldSelector = selector[field];
+			const filteresForNull = fieldSelector == null || fieldSelector.$exists === false;
+			const keys = filteresForNull ? {
+				include: null,
+				exclude: [...index.keys()].filter((key) => key != null)
+			} : require_getMatchingKeys.default(field, selector);
+			if (keys.include == null && keys.exclude == null) return { matched: false };
+			let includedIds = [];
+			if (keys.include == null) for (const set of index.values()) for (const pos of set) includedIds.push(pos);
+			else for (const key of keys.include) {
+				const posSet = index.get(key);
+				if (posSet) for (const pos of posSet) includedIds.push(pos);
+			}
+			if (keys.exclude != null) {
+				const excludeIds = /* @__PURE__ */ new Set();
+				for (const key of keys.exclude) {
+					const posSet = index.get(key);
+					if (posSet) for (const pos of posSet) excludeIds.add(pos);
+				}
+				includedIds = includedIds.filter((pos) => !excludeIds.has(pos));
+			}
+			return {
+				matched: true,
+				ids: includedIds,
+				fields: [field],
+				keepSelector: filteresForNull
+			};
+		},
+		rebuild(items) {
+			index.clear();
+			items.forEach((item) => {
+				ensureSet(require_serializeValue.default(require_get.default(item, field))).add(item.id);
+			});
+		},
+		insert(items) {
+			for (const item of items) ensureSet(require_serializeValue.default(require_get.default(item, field))).add(item.id);
+		},
+		remove(items) {
+			for (const item of items) {
+				const value = require_serializeValue.default(require_get.default(item, field));
+				const set = index.get(value);
+				if (!set) continue;
+				set.delete(item.id);
+				if (set.size === 0) index.delete(value);
+			}
+		},
+		update(pairs) {
+			for (const { oldItem, newItem } of pairs) {
+				const oldValue = require_serializeValue.default(require_get.default(oldItem, field));
+				const newValue = require_serializeValue.default(require_get.default(newItem, field));
+				if (oldValue === newValue) continue;
+				const oldSet = index.get(oldValue);
+				if (oldSet) {
+					oldSet.delete(oldItem.id);
+					if (oldSet.size === 0) index.delete(oldValue);
+				}
+				ensureSet(newValue).add(newItem.id);
+			}
+		}
+	});
 }
 //#endregion
-exports.default = intersection;
+exports.default = createIndex;

package/dist/index15.mjs

@@ -1,15 +1,86 @@
-//#region src/utils/intersection.ts
+import createIndexProvider from "./index10.mjs";
+import get from "./index11.mjs";
+import serializeValue from "./index13.mjs";
+import getMatchingKeys from "./index14.mjs";
+//#region src/createIndex.ts
 /**
-* Computes the intersection of multiple arrays, returning an array of unique elements
-* that are present in all the input arrays.
-* @template T - The type of elements in the arrays.
-* @param arrays - A variable number of arrays to compute the intersection of.
-* @returns An array containing the unique elements found in all the input arrays.
-*   - If no arrays are provided, returns an empty array.
+* creates an index for a specific field
+* @param field name of the field
+* @returns an index provider to pass to the `indices` option of the collection constructor
 */
-function intersection(...arrays) {
-	if (arrays.length === 0) return [];
-	return [...new Set(arrays.reduce((a, b) => a.filter((c) => b.includes(c))))];
+function createIndex(field) {
+	const index = /* @__PURE__ */ new Map();
+	const ensureSet = (key) => {
+		let set = index.get(key);
+		if (!set) {
+			set = /* @__PURE__ */ new Set();
+			index.set(key, set);
+		}
+		return set;
+	};
+	return createIndexProvider({
+		query(selector) {
+			if (!Object.hasOwnProperty.call(selector, field)) return { matched: false };
+			const fieldSelector = selector[field];
+			const filteresForNull = fieldSelector == null || fieldSelector.$exists === false;
+			const keys = filteresForNull ? {
+				include: null,
+				exclude: [...index.keys()].filter((key) => key != null)
+			} : getMatchingKeys(field, selector);
+			if (keys.include == null && keys.exclude == null) return { matched: false };
+			let includedIds = [];
+			if (keys.include == null) for (const set of index.values()) for (const pos of set) includedIds.push(pos);
+			else for (const key of keys.include) {
+				const posSet = index.get(key);
+				if (posSet) for (const pos of posSet) includedIds.push(pos);
+			}
+			if (keys.exclude != null) {
+				const excludeIds = /* @__PURE__ */ new Set();
+				for (const key of keys.exclude) {
+					const posSet = index.get(key);
+					if (posSet) for (const pos of posSet) excludeIds.add(pos);
+				}
+				includedIds = includedIds.filter((pos) => !excludeIds.has(pos));
+			}
+			return {
+				matched: true,
+				ids: includedIds,
+				fields: [field],
+				keepSelector: filteresForNull
+			};
+		},
+		rebuild(items) {
+			index.clear();
+			items.forEach((item) => {
+				ensureSet(serializeValue(get(item, field))).add(item.id);
+			});
+		},
+		insert(items) {
+			for (const item of items) ensureSet(serializeValue(get(item, field))).add(item.id);
+		},
+		remove(items) {
+			for (const item of items) {
+				const value = serializeValue(get(item, field));
+				const set = index.get(value);
+				if (!set) continue;
+				set.delete(item.id);
+				if (set.size === 0) index.delete(value);
+			}
+		},
+		update(pairs) {
+			for (const { oldItem, newItem } of pairs) {
+				const oldValue = serializeValue(get(oldItem, field));
+				const newValue = serializeValue(get(newItem, field));
+				if (oldValue === newValue) continue;
+				const oldSet = index.get(oldValue);
+				if (oldSet) {
+					oldSet.delete(oldItem.id);
+					if (oldSet.size === 0) index.delete(oldValue);
+				}
+				ensureSet(newValue).add(newItem.id);
+			}
+		}
+	});
 }
 //#endregion
-export { intersection as default };
+export { createIndex as default };

package/dist/index16.cjs.js

@@ -1,136 +1,15 @@
-const require_intersection = require("./index15.cjs.js");
-//#region src/getIndexInfo.ts
+//#region src/utils/intersection.ts
 /**
-* Retrieves merged index information for a given flat selector by querying multiple
-* index providers. Combines results from all index providers to determine matched ids
-* and an optimized selector.
-* @template T - The type of the items in the collection.
-* @template I - The type of the unique identifier for the items.
-* @param queryFunctions - An array of index providers to query.
-* @param selector - The flat selector used to filter items.
-* @returns An object containing:
-*   - `matched`: A boolean indicating if the selector matched any items.
-*   - `ids`: An array of matched item ids.
-*   - `optimizedSelector`: A flat selector optimized based on the index results.
+* Computes the intersection of multiple arrays, returning an array of unique elements
+* that are present in all the input arrays.
+* @template T - The type of elements in the arrays.
+* @param arrays - A variable number of arrays to compute the intersection of.
+* @returns An array containing the unique elements found in all the input arrays.
+*   - If no arrays are provided, returns an empty array.
 */
-function getMergedIndexInfo(queryFunctions, selector) {
-	return queryFunctions.reduce((memoOrPromise, queryFunction) => {
-		const resultOrPromise = queryFunction(selector);
-		const processResult = (memo, result) => {
-			if (!result.matched) return memo;
-			const optimizedSelector = result.keepSelector ? memo.optimizedSelector : Object.fromEntries(Object.entries(memo.optimizedSelector).filter(([key]) => !result.fields.includes(key)));
-			return {
-				matched: true,
-				ids: [...new Set(memo.matched ? require_intersection.default(memo.ids, result.ids) : result.ids)],
-				optimizedSelector
-			};
-		};
-		if (resultOrPromise instanceof Promise) return resultOrPromise.then(async (result) => {
-			return processResult(memoOrPromise instanceof Promise ? await memoOrPromise : memoOrPromise, result);
-		});
-		const memo = memoOrPromise;
-		if (memo instanceof Promise) throw new Error("Mixing async and sync index providers is not supported");
-		return processResult(memo, resultOrPromise);
-	}, {
-		matched: false,
-		ids: [],
-		optimizedSelector: { ...selector }
-	});
-}
-/**
-* Optimizes a logic gate ($and/$or) of selectors by querying multiple index providers.
-* @param queryFunctions - An array of index providers to query.
-* @param logicGate - An array of selectors representing the logic gate.
-* @param idsCallback - A callback function called with matched ids.
-* @returns An array of optimized selectors or a promise that resolves to such an array.
-*/
-function optimizeLogicGate(queryFunctions, logicGate, idsCallback) {
-	return logicGate.reduce((memoOrPromise, sel) => {
-		const getSelector = (indexInfo) => {
-			const { matched: selMatched, ids: selIds, optimizedSelector } = indexInfo;
-			if (selMatched) {
-				idsCallback(true, selIds);
-				if (Object.keys(optimizedSelector).length > 0) return optimizedSelector;
-			} else {
-				idsCallback(false, []);
-				return sel;
-			}
-		};
-		const indexInfoOrPromise = getIndexInfo(queryFunctions, sel);
-		if (indexInfoOrPromise instanceof Promise) return indexInfoOrPromise.then(async (indexInfo) => {
-			const memo = memoOrPromise instanceof Promise ? await memoOrPromise : memoOrPromise;
-			const optimizedSelector = getSelector(indexInfo);
-			if (optimizedSelector) memo.push(optimizedSelector);
-			return memo;
-		});
-		const memo = memoOrPromise;
-		if (memo instanceof Promise) throw new Error("Mixing async and sync index providers is not supported");
-		const optimizedSelector = getSelector(indexInfoOrPromise);
-		if (optimizedSelector) memo.push(optimizedSelector);
-		return memo;
-	}, []);
-}
-/**
-* Retrieves index information for a given complex selector by querying multiple
-* index providers. Handles nested `$and` and `$or` conditions in the selector and
-* optimizes the selector to minimize processing overhead.
-* @template T - The type of the items in the collection.
-* @template I - The type of the unique identifier for the items.
-* @param queryFunctions - An array of index providers to query.
-* @param selector - The complex selector used to filter items.
-* @returns An object containing:
-*   - `matched`: A boolean indicating if the selector matched any items.
-*   - `ids`: An array of matched item ids.
-*   - `optimizedSelector`: A selector optimized based on the index results, with unused
-*     conditions removed.
-*/
-function getIndexInfo(queryFunctions, selector) {
-	if (selector == null || Object.keys(selector).length <= 0) return {
-		matched: false,
-		ids: [],
-		optimizedSelector: selector
-	};
-	const { $and, $or, ...rest } = selector;
-	const flatInfoOrPromise = getMergedIndexInfo(queryFunctions, rest);
-	const processFlatInfo = (flatInfo) => {
-		let { matched, ids } = flatInfo;
-		const newSelector = flatInfo.optimizedSelector;
-		const $andNewOrPromise = Array.isArray($and) ? optimizeLogicGate(queryFunctions, $and, (match, selIds) => {
-			if (!match) return;
-			ids = matched ? require_intersection.default(ids, selIds) : selIds;
-			matched = true;
-		}) : void 0;
-		const process$and = ($andNew) => {
-			if ($andNew && $andNew.length > 0) newSelector.$and = $andNew;
-			let hasNonIndexField = false;
-			const matchedBefore = matched;
-			const idsBefore = ids;
-			const process$or = ($orNew) => {
-				if (hasNonIndexField || $orNew && $orNew.length > 0) {
-					newSelector.$or = $or;
-					matched = matchedBefore;
-					ids = idsBefore;
-				}
-				return {
-					matched,
-					ids: ids || [],
-					optimizedSelector: newSelector
-				};
-			};
-			const $orNewOrPromise = Array.isArray($or) ? optimizeLogicGate(queryFunctions, $or, (match, selIds) => {
-				if (match) {
-					ids = [...new Set([...ids, ...selIds])];
-					matched = true;
-				} else hasNonIndexField = true;
-			}) : void 0;
-			if ($orNewOrPromise instanceof Promise) return $orNewOrPromise.then(($orNew) => process$or($orNew));
-			return process$or($orNewOrPromise);
-		};
-		if ($andNewOrPromise instanceof Promise) return $andNewOrPromise.then(($andNew) => process$and($andNew));
-		return process$and($andNewOrPromise);
-	};
-	if (flatInfoOrPromise instanceof Promise) return flatInfoOrPromise.then(processFlatInfo);
-	return processFlatInfo(flatInfoOrPromise);
+function intersection(...arrays) {
+	if (arrays.length === 0) return [];
+	return [...new Set(arrays.reduce((a, b) => a.filter((c) => b.includes(c))))];
 }
 //#endregion
-exports.default = getIndexInfo;
+exports.default = intersection;

package/dist/index16.mjs

@@ -1,136 +1,15 @@
-import intersection from "./index15.mjs";
-//#region src/getIndexInfo.ts
+//#region src/utils/intersection.ts
 /**
-* Retrieves merged index information for a given flat selector by querying multiple
-* index providers. Combines results from all index providers to determine matched ids
-* and an optimized selector.
-* @template T - The type of the items in the collection.
-* @template I - The type of the unique identifier for the items.
-* @param queryFunctions - An array of index providers to query.
-* @param selector - The flat selector used to filter items.
-* @returns An object containing:
-*   - `matched`: A boolean indicating if the selector matched any items.
-*   - `ids`: An array of matched item ids.
-*   - `optimizedSelector`: A flat selector optimized based on the index results.
+* Computes the intersection of multiple arrays, returning an array of unique elements
+* that are present in all the input arrays.
+* @template T - The type of elements in the arrays.
+* @param arrays - A variable number of arrays to compute the intersection of.
+* @returns An array containing the unique elements found in all the input arrays.
+*   - If no arrays are provided, returns an empty array.
 */
-function getMergedIndexInfo(queryFunctions, selector) {
-	return queryFunctions.reduce((memoOrPromise, queryFunction) => {
-		const resultOrPromise = queryFunction(selector);
-		const processResult = (memo, result) => {
-			if (!result.matched) return memo;
-			const optimizedSelector = result.keepSelector ? memo.optimizedSelector : Object.fromEntries(Object.entries(memo.optimizedSelector).filter(([key]) => !result.fields.includes(key)));
-			return {
-				matched: true,
-				ids: [...new Set(memo.matched ? intersection(memo.ids, result.ids) : result.ids)],
-				optimizedSelector
-			};
-		};
-		if (resultOrPromise instanceof Promise) return resultOrPromise.then(async (result) => {
-			return processResult(memoOrPromise instanceof Promise ? await memoOrPromise : memoOrPromise, result);
-		});
-		const memo = memoOrPromise;
-		if (memo instanceof Promise) throw new Error("Mixing async and sync index providers is not supported");
-		return processResult(memo, resultOrPromise);
-	}, {
-		matched: false,
-		ids: [],
-		optimizedSelector: { ...selector }
-	});
-}
-/**
-* Optimizes a logic gate ($and/$or) of selectors by querying multiple index providers.
-* @param queryFunctions - An array of index providers to query.
-* @param logicGate - An array of selectors representing the logic gate.
-* @param idsCallback - A callback function called with matched ids.
-* @returns An array of optimized selectors or a promise that resolves to such an array.
-*/
-function optimizeLogicGate(queryFunctions, logicGate, idsCallback) {
-	return logicGate.reduce((memoOrPromise, sel) => {
-		const getSelector = (indexInfo) => {
-			const { matched: selMatched, ids: selIds, optimizedSelector } = indexInfo;
-			if (selMatched) {
-				idsCallback(true, selIds);
-				if (Object.keys(optimizedSelector).length > 0) return optimizedSelector;
-			} else {
-				idsCallback(false, []);
-				return sel;
-			}
-		};
-		const indexInfoOrPromise = getIndexInfo(queryFunctions, sel);
-		if (indexInfoOrPromise instanceof Promise) return indexInfoOrPromise.then(async (indexInfo) => {
-			const memo = memoOrPromise instanceof Promise ? await memoOrPromise : memoOrPromise;
-			const optimizedSelector = getSelector(indexInfo);
-			if (optimizedSelector) memo.push(optimizedSelector);
-			return memo;
-		});
-		const memo = memoOrPromise;
-		if (memo instanceof Promise) throw new Error("Mixing async and sync index providers is not supported");
-		const optimizedSelector = getSelector(indexInfoOrPromise);
-		if (optimizedSelector) memo.push(optimizedSelector);
-		return memo;
-	}, []);
-}
-/**
-* Retrieves index information for a given complex selector by querying multiple
-* index providers. Handles nested `$and` and `$or` conditions in the selector and
-* optimizes the selector to minimize processing overhead.
-* @template T - The type of the items in the collection.
-* @template I - The type of the unique identifier for the items.
-* @param queryFunctions - An array of index providers to query.
-* @param selector - The complex selector used to filter items.
-* @returns An object containing:
-*   - `matched`: A boolean indicating if the selector matched any items.
-*   - `ids`: An array of matched item ids.
-*   - `optimizedSelector`: A selector optimized based on the index results, with unused
-*     conditions removed.
-*/
-function getIndexInfo(queryFunctions, selector) {
-	if (selector == null || Object.keys(selector).length <= 0) return {
-		matched: false,
-		ids: [],
-		optimizedSelector: selector
-	};
-	const { $and, $or, ...rest } = selector;
-	const flatInfoOrPromise = getMergedIndexInfo(queryFunctions, rest);
-	const processFlatInfo = (flatInfo) => {
-		let { matched, ids } = flatInfo;
-		const newSelector = flatInfo.optimizedSelector;
-		const $andNewOrPromise = Array.isArray($and) ? optimizeLogicGate(queryFunctions, $and, (match, selIds) => {
-			if (!match) return;
-			ids = matched ? intersection(ids, selIds) : selIds;
-			matched = true;
-		}) : void 0;
-		const process$and = ($andNew) => {
-			if ($andNew && $andNew.length > 0) newSelector.$and = $andNew;
-			let hasNonIndexField = false;
-			const matchedBefore = matched;
-			const idsBefore = ids;
-			const process$or = ($orNew) => {
-				if (hasNonIndexField || $orNew && $orNew.length > 0) {
-					newSelector.$or = $or;
-					matched = matchedBefore;
-					ids = idsBefore;
-				}
-				return {
-					matched,
-					ids: ids || [],
-					optimizedSelector: newSelector
-				};
-			};
-			const $orNewOrPromise = Array.isArray($or) ? optimizeLogicGate(queryFunctions, $or, (match, selIds) => {
-				if (match) {
-					ids = [...new Set([...ids, ...selIds])];
-					matched = true;
-				} else hasNonIndexField = true;
-			}) : void 0;
-			if ($orNewOrPromise instanceof Promise) return $orNewOrPromise.then(($orNew) => process$or($orNew));
-			return process$or($orNewOrPromise);
-		};
-		if ($andNewOrPromise instanceof Promise) return $andNewOrPromise.then(($andNew) => process$and($andNew));
-		return process$and($andNewOrPromise);
-	};
-	if (flatInfoOrPromise instanceof Promise) return flatInfoOrPromise.then(processFlatInfo);
-	return processFlatInfo(flatInfoOrPromise);
+function intersection(...arrays) {
+	if (arrays.length === 0) return [];
+	return [...new Set(arrays.reduce((a, b) => a.filter((c) => b.includes(c))))];
 }
 //#endregion
-export { getIndexInfo as default };
+export { intersection as default };