@qimen-lab/core 0.1.3 → 0.1.5

package/dist/utils/array/base/duplicates.esm.js

@@ -0,0 +1,36 @@
+/**
+ * 移除数组中的重复元素
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要去重的数组
+ * @returns {T[]} 返回去重后的新数组
+ */
+export function removeDuplicates(arr) {
+    const seen = new Set();
+    const result = [];
+    for (const item of arr) {
+        if (!seen.has(item)) {
+            seen.add(item);
+            result.push(item);
+        }
+    }
+    return result;
+}
+/**
+ * 根据指定字段去重
+ * @template T 数组元素类型
+ * @template K T的键名类型
+ * @param {T[]} arr 需要去重的数组
+ * @param {K | ((item: T) => any)} key 用于确定唯一性的键或函数
+ * @returns {T[]} 返回根据指定字段去重后的新数组
+ */
+export function uniqueBy(arr, key) {
+    const seen = new Map();
+    for (const item of arr) {
+        const keyValue = typeof key === 'function' ? key(item) : item[key];
+        if (!seen.has(keyValue)) {
+            seen.set(keyValue, item);
+        }
+    }
+    return Array.from(seen.values());
+}
+//# sourceMappingURL=duplicates.js.map

package/dist/utils/array/base/duplicates.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicates.js","sourceRoot":"","sources":["../../../../../src/utils/array/base/duplicates.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAI,GAAQ;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,MAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAuB,GAAQ,EAAE,GAA2B;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,OAAO,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEnE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AACrC,CAAC"}

package/dist/utils/array/base/index.esm.js

@@ -0,0 +1,3 @@
+export * from './duplicates';
+export * from './transform';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/base/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/base/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC"}

package/dist/utils/array/base/transform.esm.js

@@ -0,0 +1,40 @@
+/**
+ * 移除数组中指定的值
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要移除元素的原数组
+ * @param {T[]} valuesToRemove 需要从原数组中移除的值的数组
+ * @returns {T[]} 返回移除指定值后的新数组
+ */
+export function removeValues(arr, valuesToRemove) {
+    if (arr.length === 0) {
+        return [];
+    }
+    const valuesSet = new Set(valuesToRemove);
+    return arr.filter(item => !valuesSet.has(item));
+}
+/**
+ * 根据条件拆分数组
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要拆分的数组
+ * @param {(item: T, index: number) => boolean} condition 用于拆分数组的条件函数，返回true的元素将放入第一个数组，返回false的元素放入第二个数组
+ * @returns {[T[], T[]]} 返回一个包含两个数组的元组：第一个数组包含满足条件的元素，第二个数组包含不满足条件的元素
+ */
+export function splitArray(arr, condition) {
+    const matches = [];
+    const nonMatches = [];
+    for (let i = 0; i < arr.length; i++) {
+        try {
+            if (condition(arr[i], i)) {
+                matches.push(arr[i]);
+            }
+            else {
+                nonMatches.push(arr[i]);
+            }
+        }
+        catch (error) {
+            console.error(`Error in condition function at index ${i}:`, error);
+        }
+    }
+    return [matches, nonMatches];
+}
+//# sourceMappingURL=transform.js.map

package/dist/utils/array/base/transform.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transform.js","sourceRoot":"","sources":["../../../../../src/utils/array/base/transform.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAI,GAAQ,EAAE,cAAmB;IACzD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;IAC1C,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACtB,GAAQ,EACR,SAA8C;IAE9C,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,UAAU,GAAQ,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC;YACD,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACJ,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,wCAAwC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC;IACL,CAAC;IAED,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACjC,CAAC"}

package/dist/utils/array/collection/chunk.esm.js

@@ -0,0 +1,19 @@
+/**
+ * 将数组按指定大小分块
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要分块的原数组
+ * @param {number} size 每个块的大小，必须为正整数
+ * @returns {T[][]} 返回一个包含多个子数组的数组，每个子数组的长度为size（最后一个可能小于size）
+ */
+export function chunk(arr, size) {
+    // 如果size小于等于0，直接返回空数组
+    if (size <= 0) {
+        return [];
+    }
+    const chunks = [];
+    for (let i = 0; i < arr.length; i += size) {
+        chunks.push(arr.slice(i, i + size));
+    }
+    return chunks;
+}
+//# sourceMappingURL=chunk.js.map

package/dist/utils/array/collection/chunk.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../../../../src/utils/array/collection/chunk.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAI,GAAQ,EAAE,IAAY;IAC3C,sBAAsB;IACtB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/utils/array/collection/flatten.esm.js

@@ -0,0 +1,31 @@
+/**
+ * 将嵌套数组按指定深度扁平化
+ * @template T 扁平化后数组的元素类型
+ * @param {any[]} arr 需要扁平化的嵌套数组
+ * @param {number} [depth=1] 扁平化的深度，默认为1
+ * @returns {T[]} 扁平化后的新数组
+ */
+export function flatten(arr, depth = 1) {
+    const result = [];
+    /**
+     * 递归处理数组扁平化
+     * @param {any[]} array 当前处理的数组
+     * @param {number} currentDepth 当前剩余的扁平化深度
+     */
+    const flattenRecursive = (array, currentDepth) => {
+        for (const item of array) {
+            // 如果当前项是数组且还有扁平化深度，则继续递归处理
+            if (Array.isArray(item) && currentDepth > 0) {
+                flattenRecursive(item, currentDepth - 1);
+            }
+            else {
+                // 否则直接将当前项添加到结果数组中
+                result.push(item);
+            }
+        }
+    };
+    // 开始递归处理
+    flattenRecursive(arr, depth);
+    return result;
+}
+//# sourceMappingURL=flatten.js.map

package/dist/utils/array/collection/flatten.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flatten.js","sourceRoot":"","sources":["../../../../../src/utils/array/collection/flatten.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,GAAU,EAAE,QAAgB,CAAC;IACpD,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB;;;;OAIG;IACH,MAAM,gBAAgB,GAAG,CAAC,KAAY,EAAE,YAAoB,EAAE,EAAE;QAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,2BAA2B;YAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;gBAC1C,gBAAgB,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACJ,mBAAmB;gBACnB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACL,CAAC;IACL,CAAC,CAAC;IAEF,SAAS;IACT,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC7B,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/utils/array/collection/groupBy.esm.js

@@ -0,0 +1,34 @@
+/**
+ * 根据指定的键将数组元素分组到 Map 中
+ * @template T 数组元素类型
+ * @template K T的键名类型
+ * @param {T[]} arr 需要分组的数组
+ * @param {K} key 用于分组的键名
+ * @returns {Map<T[K], T[]>} 返回一个 Map，键为分组依据的值，值为该组的元素数组
+ */
+export function groupBy(arr, key) {
+    const groups = new Map();
+    for (const item of arr) {
+        const keyValue = item[key];
+        const group = groups.get(keyValue) || [];
+        group.push(item);
+        groups.set(keyValue, group);
+    }
+    return groups;
+}
+/**
+ * 统计数组中每种元素出现的次数
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要统计的数组
+ * @param {(item: T) => any} [classifier] 可选的分类函数，用于确定每个元素的分类键；如果未提供，则使用元素本身作为键
+ * @returns {Map<any, number>} 返回一个 Map，键为分类键，值为该键出现的次数
+ */
+export function countBy(arr, classifier) {
+    const counts = new Map();
+    for (const item of arr) {
+        const key = classifier ? classifier(item) : item;
+        counts.set(key, (counts.get(key) || 0) + 1);
+    }
+    return counts;
+}
+//# sourceMappingURL=groupBy.js.map

package/dist/utils/array/collection/groupBy.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"groupBy.js","sourceRoot":"","sources":["../../../../../src/utils/array/collection/groupBy.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CAAuB,GAAQ,EAAE,GAAM;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,GAAQ,EAAE,UAA6B;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IAEtC,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/utils/array/collection/index.esm.js

@@ -0,0 +1,4 @@
+export * from './chunk';
+export * from './flatten';
+export * from './groupBy';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/collection/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/collection/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC"}

package/dist/utils/array/index.esm.js

@@ -0,0 +1,7 @@
+export * from './base';
+export * from './collection';
+export * from './random';
+export * from './search';
+export * from './set';
+export * from './sort';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/utils/array/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,cAAc,CAAC;AAC7B,cAAc,UAAU,CAAC;AACzB,cAAc,UAAU,CAAC;AACzB,cAAc,OAAO,CAAC;AACtB,cAAc,QAAQ,CAAC"}

package/dist/utils/array/random/index.esm.js

@@ -0,0 +1,3 @@
+export * from './sample';
+export * from './shuffle';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/random/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/random/index.ts"],"names":[],"mappings":"AAAA,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC"}

package/dist/utils/array/random/sample.esm.js

@@ -0,0 +1,29 @@
+/**
+ * 从数组中随机采样一个或多个元素
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要采样的原数组
+ * @param {number} [count=1] 采样元素的数量，默认为1
+ * @returns {T | T[]} 如果count为1则返回单个元素，否则返回包含采样元素的数组
+ */
+export function sample(arr, count = 1) {
+    if (count <= 0) {
+        // 如果count小于等于0，返回空数组
+        return [];
+    }
+    if (count === 1) {
+        // 如果只采样一个元素，直接返回随机索引位置的元素
+        if (arr.length === 0) {
+            return undefined;
+        }
+        return arr[Math.floor(Math.random() * arr.length)];
+    }
+    // Fisher-Yates 洗牌算法取前 count 个
+    const shuffled = [...arr];
+    for (let i = shuffled.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
+    }
+    // 返回洗牌后数组的前 count 个元素，如果count大于数组长度，则返回整个数组
+    return shuffled.slice(0, Math.min(count, arr.length));
+}
+//# sourceMappingURL=sample.js.map

package/dist/utils/array/random/sample.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../../../../src/utils/array/random/sample.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAI,GAAQ,EAAE,QAAgB,CAAC;IACjD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACb,qBAAqB;QACrB,OAAO,EAAS,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QACd,0BAA0B;QAC1B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnB,OAAO,SAAc,CAAC;QAC1B,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,8BAA8B;IAC9B,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,4CAA4C;IAC5C,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AAC1D,CAAC"}

package/dist/utils/array/random/shuffle.esm.js

@@ -0,0 +1,19 @@
+/**
+ * 使用 Fisher-Yates 洗牌算法随机打乱数组
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要被打乱的原数组
+ * @returns {T[]} 返回一个新的被打乱顺序的数组副本，不修改原数组
+ */
+export function shuffle(arr) {
+    // 创建原数组的副本以避免修改原数组
+    const result = [...arr];
+    // Fisher-Yates 洗牌算法实现
+    for (let i = result.length - 1; i > 0; i--) {
+        // 生成 0 到 i 之间的随机索引
+        const j = Math.floor(Math.random() * (i + 1));
+        // 交换元素位置
+        [result[i], result[j]] = [result[j], result[i]];
+    }
+    return result;
+}
+//# sourceMappingURL=shuffle.js.map

package/dist/utils/array/random/shuffle.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.js","sourceRoot":"","sources":["../../../../../src/utils/array/random/shuffle.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,GAAQ;IAC/B,mBAAmB;IACnB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IACxB,sBAAsB;IACtB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,mBAAmB;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,SAAS;QACT,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/utils/array/search/find.esm.js

@@ -0,0 +1,26 @@
+/**
+ * 根据指定字段和值在数组中查找匹配的项
+ * @template T 数组元素类型
+ * @template K T的键名类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {K} field 用于匹配的字段名
+ * @param {T[K]} value 要匹配的值
+ * @returns {T | undefined} 返回匹配的项，如果未找到则返回undefined
+ */
+export function findItem(arr, field, value) {
+    if (arr.length === 0) {
+        return undefined;
+    }
+    return arr.find(item => {
+        const itemValue = item[field];
+        // 特殊处理 NaN
+        if (typeof value === 'number' &&
+            typeof itemValue === 'number' &&
+            isNaN(value) &&
+            isNaN(itemValue)) {
+            return true;
+        }
+        return itemValue === value;
+    });
+}
+//# sourceMappingURL=find.js.map

package/dist/utils/array/search/find.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sourceRoot":"","sources":["../../../../../src/utils/array/search/find.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAuB,GAAQ,EAAE,KAAQ,EAAE,KAAW;IAC1E,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAE9B,WAAW;QACX,IACI,OAAO,KAAK,KAAK,QAAQ;YACzB,OAAO,SAAS,KAAK,QAAQ;YAC7B,KAAK,CAAC,KAAK,CAAC;YACZ,KAAK,CAAC,SAAS,CAAC,EAClB,CAAC;YACC,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,SAAS,KAAK,KAAK,CAAC;IAC/B,CAAC,CAAC,CAAC;AACP,CAAC"}

package/dist/utils/array/search/includes.esm.js

@@ -0,0 +1,21 @@
+/**
+ * 检查数组是否包含指定的值，支持按字段匹配对象
+ * @template T 数组元素类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {T} value 要查找的值
+ * @param {keyof T} [field] 可选的字段名，当value是对象时，用于按该字段值进行匹配
+ * @returns {boolean} 如果数组包含指定值则返回true，否则返回false
+ */
+export function includes(arr, value, field) {
+    if (arr.length === 0) {
+        return false;
+    }
+    // 如果指定了字段且 value 是对象
+    if (field && typeof value === 'object' && value !== null) {
+        const fieldValue = value[field];
+        return arr.some(item => item[field] === fieldValue);
+    }
+    // 简单值比较
+    return arr.includes(value);
+}
+//# sourceMappingURL=includes.js.map

package/dist/utils/array/search/includes.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"includes.js","sourceRoot":"","sources":["../../../../../src/utils/array/search/includes.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAI,GAAQ,EAAE,KAAQ,EAAE,KAAe;IAC3D,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,qBAAqB;IACrB,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACvD,MAAM,UAAU,GAAI,KAAa,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,UAAU,CAAC,CAAC;IACxD,CAAC;IAED,QAAQ;IACR,OAAO,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC"}

package/dist/utils/array/search/index.esm.js

@@ -0,0 +1,3 @@
+export * from './find';
+export * from './includes';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/search/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/search/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC"}

package/dist/utils/array/set/difference.esm.js

@@ -0,0 +1,106 @@
+/**
+ * 计算两个数组的差集，返回在第一个数组中但不在第二个数组中的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中的元素组成的数组
+ */
+export function difference(arr1, arr2) {
+    if (arr1.length === 0) {
+        return [];
+    }
+    if (arr2.length === 0) {
+        return [...arr1];
+    }
+    const set2 = new Set(arr2);
+    return arr1.filter(item => !set2.has(item));
+}
+/**
+ * 根据指定字段计算两个对象数组的差集，返回在第一个数组中但不在第二个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中对应字段值相同的元素组成的数组
+ */
+export function differenceBy(arr1, arr2, field) {
+    if (arr1.length === 0) {
+        return [];
+    }
+    if (arr2.length === 0) {
+        return [...arr1];
+    }
+    const fieldValues = new Set(arr2.map(item => item[field]));
+    return arr1.filter(item => !fieldValues.has(item[field]));
+}
+/**
+ * 根据提供的迭代函数计算两个数组的差集，返回在第一个数组中但不在第二个数组中经迭代后值相同的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @param {(item: T) => any} iteratee 用于生成比较值的迭代函数
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中经迭代后值相同的元素组成的数组
+ */
+export function differenceWith(arr1, arr2, iteratee) {
+    if (arr1.length === 0) {
+        return [];
+    }
+    if (arr2.length === 0) {
+        return [...arr1];
+    }
+    const values = new Set(arr2.map(item => iteratee(item)));
+    return arr1.filter(item => !values.has(iteratee(item)));
+}
+/**
+ * 计算两个数组的对称差集，返回在其中一个数组中但不在两个数组中的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中的元素组成的数组
+ */
+export function symmetricDifference(arr1, arr2) {
+    const set1 = new Set(arr1);
+    const set2 = new Set(arr2);
+    const diff1 = arr1.filter(item => !set2.has(item));
+    const diff2 = arr2.filter(item => !set1.has(item));
+    return [...diff1, ...diff2];
+}
+/**
+ * 根据指定字段计算两个对象数组的对称差集，返回在其中一个数组中但不在两个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中对应字段值相同的元素组成的数组
+ */
+export function symmetricDifferenceBy(arr1, arr2, field) {
+    if (arr1.length === 0 && arr2.length === 0) {
+        return [];
+    }
+    const values1 = new Set(arr1.map(item => item[field]));
+    const values2 = new Set(arr2.map(item => item[field]));
+    const diff1 = arr1.filter(item => !values2.has(item[field]));
+    const diff2 = arr2.filter(item => !values1.has(item[field]));
+    return [...diff1, ...diff2];
+}
+/**
+ * 根据提供的迭代函数计算两个数组的对称差集，返回在其中一个数组中但不在两个数组中经迭代后值相同的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @param {(item: T) => any} iteratee 用于生成比较值的迭代函数
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中经迭代后值相同的元素组成的数组
+ */
+export function symmetricDifferenceWith(arr1, arr2, iteratee) {
+    if (arr1.length === 0 && arr2.length === 0) {
+        return [];
+    }
+    const values1 = new Set(arr1.map(item => iteratee(item)));
+    const values2 = new Set(arr2.map(item => iteratee(item)));
+    const diff1 = arr1.filter(item => !values2.has(iteratee(item)));
+    const diff2 = arr2.filter(item => !values1.has(iteratee(item)));
+    return [...diff1, ...diff2];
+}
+//# sourceMappingURL=difference.js.map

package/dist/utils/array/set/difference.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/difference.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAI,IAAS,EAAE,IAAS;IAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AAChD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAuB,IAAS,EAAE,IAAS,EAAE,KAAQ;IAC7E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3D,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAI,IAAS,EAAE,IAAS,EAAE,QAA0B;IAC9E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAI,IAAS,EAAE,IAAS;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAE3B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAEnD,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CAAuB,IAAS,EAAE,IAAS,EAAE,KAAQ;IACtF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE7D,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CAAI,IAAS,EAAE,IAAS,EAAE,QAA0B;IACvF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE1D,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEhE,OAAO,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;AAChC,CAAC"}

package/dist/utils/array/set/index.esm.js

@@ -0,0 +1,4 @@
+export * from './difference';
+export * from './intersection';
+export * from './union';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/set/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,SAAS,CAAC"}

package/dist/utils/array/set/intersection.esm.js

@@ -0,0 +1,31 @@
+/**
+ * 计算两个数组的交集，返回在两个数组中都存在的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 和 arr2 中都存在的元素组成的数组
+ */
+export function intersection(arr1, arr2) {
+    if (arr1.length === 0 || arr2.length === 0) {
+        return [];
+    }
+    const set2 = new Set(arr2);
+    return arr1.filter(item => set2.has(item));
+}
+/**
+ * 根据指定字段计算两个对象数组的交集，返回在两个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 和 arr2 中对应字段值相同的元素组成的数组
+ */
+export function intersectionBy(arr1, arr2, field) {
+    if (arr1.length === 0 || arr2.length === 0) {
+        return [];
+    }
+    const set2 = new Set(arr2.map(item => item[field]));
+    return arr1.filter(item => set2.has(item[field]));
+}
+//# sourceMappingURL=intersection.js.map

package/dist/utils/array/set/intersection.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/intersection.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAI,IAAS,EAAE,IAAS;IAChD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAuB,IAAS,EAAE,IAAS,EAAE,KAAQ;IAC/E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC"}

package/dist/utils/array/set/union.esm.js

@@ -0,0 +1,35 @@
+/**
+ * 合并多个数组，并根据指定字段去重
+ *
+ * @description
+ * 该函数接收一个二维数组和一个字段名，将所有数组中的对象根据指定字段的值进行去重合并。
+ * 如果多个对象具有相同的字段值，则后面的会覆盖前面的。
+ *
+ * @template T - 数组元素的类型，必须是包含字段K的对象
+ * @template K - 对象中的键名类型
+ *
+ * @param arrays - 包含多个对象数组的二维数组
+ * @param field - 用于去重比较的字段名
+ *
+ * @returns 合并后并去重的对象数组
+ *
+ * @example
+ * ```ts
+ * const users1 = [{ id: 1, name: 'Alice' }, { id: 2, name: 'Bob' }];
+ * const users2 = [{ id: 1, name: 'Alice2' }, { id: 3, name: 'Charlie' }];
+ * const result = mergeArray([users1, users2], 'id');
+ * // 结果: [{ id: 1, name: 'Alice2' }, { id: 2, name: 'Bob' }, { id: 3, name: 'Charlie' }]
+ * ```
+ */
+export function mergeArray(arrays, field) {
+    const resultMap = new Map();
+    for (const array of arrays) {
+        for (const item of array) {
+            if (field in item) {
+                resultMap.set(item[field], item);
+            }
+        }
+    }
+    return Array.from(resultMap.values());
+}
+//# sourceMappingURL=union.js.map

package/dist/utils/array/set/union.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/union.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,UAAU,CACtB,MAAa,EACb,KAAQ;IAER,MAAM,SAAS,GAAG,IAAI,GAAG,EAAW,CAAC;IAErC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;gBAChB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;YACrC,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;AAC1C,CAAC"}

package/dist/utils/array/sort/index.esm.js

@@ -0,0 +1,3 @@
+export * from './sort';
+export * from './tree';
+//# sourceMappingURL=index.js.map

package/dist/utils/array/sort/index.esm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/utils/array/sort/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC;AACvB,cAAc,QAAQ,CAAC"}