@qimen-lab/core 0.1.1

package/dist/utils/array/random/sample.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sample.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/random/sample.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,GAAE,MAAU,GAAG,CAAC,GAAG,CAAC,EAAE,CAuB9D"}

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

@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sample = sample;
+/**
+ * 从数组中随机采样一个或多个元素
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要采样的原数组
+ * @param {number} [count=1] 采样元素的数量，默认为1
+ * @returns {T | T[]} 如果count为1则返回单个元素，否则返回包含采样元素的数组
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sample.js","sourceRoot":"","sources":["../../../../../src/utils/array/random/sample.ts"],"names":[],"mappings":";;AAOA,wBAuBC;AA9BD;;;;;;GAMG;AACH,SAAgB,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.d.ts

@@ -0,0 +1,8 @@
+/**
+ * 使用 Fisher-Yates 洗牌算法随机打乱数组
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要被打乱的原数组
+ * @returns {T[]} 返回一个新的被打乱顺序的数组副本，不修改原数组
+ */
+export declare function shuffle<T>(arr: T[]): T[];
+//# sourceMappingURL=shuffle.d.ts.map

package/dist/utils/array/random/shuffle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/random/shuffle.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAYxC"}

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

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.shuffle = shuffle;
+/**
+ * 使用 Fisher-Yates 洗牌算法随机打乱数组
+ * @template T 数组元素类型
+ * @param {T[]} arr 需要被打乱的原数组
+ * @returns {T[]} 返回一个新的被打乱顺序的数组副本，不修改原数组
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.js","sourceRoot":"","sources":["../../../../../src/utils/array/random/shuffle.ts"],"names":[],"mappings":";;AAMA,0BAYC;AAlBD;;;;;GAKG;AACH,SAAgB,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.d.ts

@@ -0,0 +1,11 @@
+/**
+ * 根据指定字段和值在数组中查找匹配的项
+ * @template T 数组元素类型
+ * @template K T的键名类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {K} field 用于匹配的字段名
+ * @param {T[K]} value 要匹配的值
+ * @returns {T | undefined} 返回匹配的项，如果未找到则返回undefined
+ */
+export declare function findItem<T, K extends keyof T>(arr: T[], field: K, value: T[K]): T | undefined;
+//# sourceMappingURL=find.d.ts.map

package/dist/utils/array/search/find.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/search/find.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAoB7F"}

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

@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.findItem = findItem;
+/**
+ * 根据指定字段和值在数组中查找匹配的项
+ * @template T 数组元素类型
+ * @template K T的键名类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {K} field 用于匹配的字段名
+ * @param {T[K]} value 要匹配的值
+ * @returns {T | undefined} 返回匹配的项，如果未找到则返回undefined
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sourceRoot":"","sources":["../../../../../src/utils/array/search/find.ts"],"names":[],"mappings":";;AASA,4BAoBC;AA7BD;;;;;;;;GAQG;AACH,SAAgB,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.d.ts

@@ -0,0 +1,10 @@
+/**
+ * 检查数组是否包含指定的值，支持按字段匹配对象
+ * @template T 数组元素类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {T} value 要查找的值
+ * @param {keyof T} [field] 可选的字段名，当value是对象时，用于按该字段值进行匹配
+ * @returns {boolean} 如果数组包含指定值则返回true，否则返回false
+ */
+export declare function includes<T>(arr: T[], value: T, field?: keyof T): boolean;
+//# sourceMappingURL=includes.d.ts.map

package/dist/utils/array/search/includes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"includes.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/search/includes.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,OAAO,CAaxE"}

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

@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.includes = includes;
+/**
+ * 检查数组是否包含指定的值，支持按字段匹配对象
+ * @template T 数组元素类型
+ * @param {T[]} arr 要搜索的数组
+ * @param {T} value 要查找的值
+ * @param {keyof T} [field] 可选的字段名，当value是对象时，用于按该字段值进行匹配
+ * @returns {boolean} 如果数组包含指定值则返回true，否则返回false
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"includes.js","sourceRoot":"","sources":["../../../../../src/utils/array/search/includes.ts"],"names":[],"mappings":";;AAQA,4BAaC;AArBD;;;;;;;GAOG;AACH,SAAgB,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.d.ts

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

package/dist/utils/array/search/index.d.ts.map

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

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

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./find"), exports);
+__exportStar(require("./includes"), exports);
+//# sourceMappingURL=index.js.map

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

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

package/dist/utils/array/set/difference.d.ts

@@ -0,0 +1,55 @@
+/**
+ * 计算两个数组的差集，返回在第一个数组中但不在第二个数组中的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中的元素组成的数组
+ */
+export declare function difference<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 根据指定字段计算两个对象数组的差集，返回在第一个数组中但不在第二个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中对应字段值相同的元素组成的数组
+ */
+export declare function differenceBy<T, K extends keyof T>(arr1: T[], arr2: T[], field: K): T[];
+/**
+ * 根据提供的迭代函数计算两个数组的差集，返回在第一个数组中但不在第二个数组中经迭代后值相同的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @param {(item: T) => any} iteratee 用于生成比较值的迭代函数
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中经迭代后值相同的元素组成的数组
+ */
+export declare function differenceWith<T>(arr1: T[], arr2: T[], iteratee: (item: T) => any): T[];
+/**
+ * 计算两个数组的对称差集，返回在其中一个数组中但不在两个数组中的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中的元素组成的数组
+ */
+export declare function symmetricDifference<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 根据指定字段计算两个对象数组的对称差集，返回在其中一个数组中但不在两个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中对应字段值相同的元素组成的数组
+ */
+export declare function symmetricDifferenceBy<T, K extends keyof T>(arr1: T[], arr2: T[], field: K): T[];
+/**
+ * 根据提供的迭代函数计算两个数组的对称差集，返回在其中一个数组中但不在两个数组中经迭代后值相同的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @param {(item: T) => any} iteratee 用于生成比较值的迭代函数
+ * @returns {T[]} 返回在 arr1 或 arr2 中但不在两者中经迭代后值相同的元素组成的数组
+ */
+export declare function symmetricDifferenceWith<T>(arr1: T[], arr2: T[], iteratee: (item: T) => any): T[];
+//# sourceMappingURL=difference.d.ts.map

package/dist/utils/array/set/difference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/set/difference.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAWvD;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAWtF;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,GAAG,CAAC,EAAE,CAWvF;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAQhE;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAY/F;AAED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,GAAG,GAAG,CAAC,EAAE,CAYhG"}

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

@@ -0,0 +1,114 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.difference = difference;
+exports.differenceBy = differenceBy;
+exports.differenceWith = differenceWith;
+exports.symmetricDifference = symmetricDifference;
+exports.symmetricDifferenceBy = symmetricDifferenceBy;
+exports.symmetricDifferenceWith = symmetricDifferenceWith;
+/**
+ * 计算两个数组的差集，返回在第一个数组中但不在第二个数组中的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 中但不在 arr2 中的元素组成的数组
+ */
+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 中对应字段值相同的元素组成的数组
+ */
+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 中经迭代后值相同的元素组成的数组
+ */
+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 中但不在两者中的元素组成的数组
+ */
+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 中但不在两者中对应字段值相同的元素组成的数组
+ */
+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 中但不在两者中经迭代后值相同的元素组成的数组
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"difference.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/difference.ts"],"names":[],"mappings":";;AAOA,gCAWC;AAWD,oCAWC;AAUD,wCAWC;AASD,kDAQC;AAWD,sDAYC;AAUD,0DAYC;AA3HD;;;;;;GAMG;AACH,SAAgB,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,SAAgB,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,SAAgB,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,SAAgB,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,SAAgB,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,SAAgB,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.d.ts

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

package/dist/utils/array/set/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","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/index.js

@@ -0,0 +1,20 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./difference"), exports);
+__exportStar(require("./intersection"), exports);
+__exportStar(require("./union"), exports);
+//# sourceMappingURL=index.js.map

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

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

package/dist/utils/array/set/intersection.d.ts

@@ -0,0 +1,19 @@
+/**
+ * 计算两个数组的交集，返回在两个数组中都存在的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 和 arr2 中都存在的元素组成的数组
+ */
+export declare function intersection<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 根据指定字段计算两个对象数组的交集，返回在两个数组中对应字段值相同的元素
+ * @template T 对象类型
+ * @template K T的键名类型
+ * @param {T[]} arr1 第一个对象数组
+ * @param {T[]} arr2 第二个对象数组
+ * @param {K} field 用于比较的字段名
+ * @returns {T[]} 返回在 arr1 和 arr2 中对应字段值相同的元素组成的数组
+ */
+export declare function intersectionBy<T, K extends keyof T>(arr1: T[], arr2: T[], field: K): T[];
+//# sourceMappingURL=intersection.d.ts.map

package/dist/utils/array/set/intersection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/set/intersection.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAOzD;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAOxF"}

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

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.intersection = intersection;
+exports.intersectionBy = intersectionBy;
+/**
+ * 计算两个数组的交集，返回在两个数组中都存在的元素
+ * @template T 数组元素类型
+ * @param {T[]} arr1 第一个数组
+ * @param {T[]} arr2 第二个数组
+ * @returns {T[]} 返回在 arr1 和 arr2 中都存在的元素组成的数组
+ */
+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 中对应字段值相同的元素组成的数组
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersection.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/intersection.ts"],"names":[],"mappings":";;AAOA,oCAOC;AAWD,wCAOC;AAhCD;;;;;;GAMG;AACH,SAAgB,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,SAAgB,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.d.ts

@@ -0,0 +1,25 @@
+/**
+ * 合并多个数组，并根据指定字段去重
+ *
+ * @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 declare function mergeArray<T extends Record<K, any>, K extends keyof T>(arrays: T[][], field: K): T[];
+//# sourceMappingURL=union.d.ts.map

package/dist/utils/array/set/union.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.d.ts","sourceRoot":"","sources":["../../../../../src/utils/array/set/union.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,EAClE,MAAM,EAAE,CAAC,EAAE,EAAE,EACb,KAAK,EAAE,CAAC,GACT,CAAC,EAAE,CAYL"}

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

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mergeArray = mergeArray;
+/**
+ * 合并多个数组，并根据指定字段去重
+ *
+ * @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' }]
+ * ```
+ */
+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.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"union.js","sourceRoot":"","sources":["../../../../../src/utils/array/set/union.ts"],"names":[],"mappings":";;AAuBA,gCAeC;AAtCD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAgB,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.d.ts

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

package/dist/utils/array/sort/index.d.ts.map

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

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

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./sort"), exports);
+__exportStar(require("./tree"), exports);
+//# sourceMappingURL=index.js.map

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

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