@alibarbar/common 1.0.0

package/dist/array.d.ts

@@ -0,0 +1,139 @@
+/**
+ * 数组工具函数
+ */
+/**
+ * 数组去重
+ * @param arr - 输入数组
+ * @returns 去重后的数组
+ */
+declare function unique<T>(arr: T[]): T[];
+/**
+ * 数组分组
+ * @param arr - 输入数组
+ * @param keyFn - 分组键函数或属性名
+ * @returns 分组后的对象
+ */
+declare function groupBy<T, K extends string | number>(arr: T[], keyFn: ((item: T) => K) | string): Record<K, T[]>;
+/**
+ * 数组分块
+ * @param arr - 输入数组
+ * @param size - 每块大小
+ * @returns 分块后的二维数组
+ */
+declare function chunk<T>(arr: T[], size: number): T[][];
+/**
+ * 数组扁平化
+ * @param arr - 输入数组
+ * @param depth - 扁平化深度，默认为 1
+ * @returns 扁平化后的数组
+ */
+declare function flatten<T>(arr: (T | T[])[], depth?: number): T[];
+/**
+ * 数组随机打乱（Fisher-Yates算法）
+ * @param arr - 输入数组
+ * @returns 打乱后的新数组
+ */
+declare function shuffle<T>(arr: T[]): T[];
+/**
+ * 随机取样
+ * @param arr - 输入数组
+ * @param count - 取样数量，默认为 1。当 count=1 时返回单个元素，否则返回数组
+ * @returns 随机取样的数组或单个元素
+ */
+declare function sample<T>(arr: T[]): T;
+declare function sample<T>(arr: T[], count: number): T | T[];
+/**
+ * 数组差集（在arr1中但不在arr2中的元素）
+ * @param arr1 - 第一个数组
+ * @param arr2 - 第二个数组
+ * @returns 差集数组
+ */
+declare function difference<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 数组交集
+ * @param arr1 - 第一个数组
+ * @param arr2 - 第二个数组
+ * @returns 交集数组
+ */
+declare function intersection<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 数组并集
+ * @param arr1 - 第一个数组
+ * @param arr2 - 第二个数组
+ * @returns 并集数组
+ */
+declare function union<T>(arr1: T[], arr2: T[]): T[];
+/**
+ * 按属性排序
+ * @param arr - 输入数组
+ * @param keyFn - 获取排序键的函数或属性名
+ * @param order - 排序顺序，'asc' 或 'desc'，默认为 'asc'
+ * @returns 排序后的新数组
+ */
+declare function sortBy<T, K extends string | number>(arr: T[], keyFn: ((item: T) => K) | string, order?: 'asc' | 'desc'): T[];
+/**
+ * 按条件查找索引
+ * @param arr - 输入数组
+ * @param predicate - 条件函数
+ * @returns 找到的索引，未找到返回 -1
+ */
+declare function findIndexBy<T>(arr: T[], predicate: (item: T) => boolean): number;
+/**
+ * 数组分割（满足条件/不满足条件）
+ * @param arr - 输入数组
+ * @param predicate - 条件函数
+ * @returns 包含两个数组的元组：[满足条件的数组, 不满足条件的数组]
+ */
+declare function partition<T>(arr: T[], predicate: (item: T) => boolean): [T[], T[]];
+/**
+ * 数组压缩（将多个数组合并成元组数组）
+ * @param arrays - 要压缩的数组
+ * @returns 压缩后的元组数组
+ */
+declare function zip<T extends readonly unknown[]>(...arrays: T): Array<{
+    [K in keyof T]: T[K] extends readonly (infer U)[] ? U : never;
+}>;
+/**
+ * 数组解压（将元组数组拆分成多个数组）
+ * @param array - 要解压的数组
+ * @returns 解压后的数组元组
+ */
+declare function unzip<T extends readonly unknown[]>(array: Array<{
+    [K in keyof T]: T[number] extends readonly (infer U)[] ? U : never;
+}>): T;
+/**
+ * 移除假值（null, undefined, false, 0, ''）
+ * @param arr - 输入数组
+ * @returns 移除假值后的数组
+ */
+declare function compact<T>(arr: (T | null | undefined | false | 0 | '')[]): T[];
+/**
+ * 取前N个元素
+ * @param arr - 输入数组
+ * @param n - 要取的元素数量
+ * @returns 前N个元素的数组
+ */
+declare function take<T>(arr: T[], n: number): T[];
+/**
+ * 跳过前N个元素
+ * @param arr - 输入数组
+ * @param n - 要跳过的元素数量
+ * @returns 跳过后的数组
+ */
+declare function drop<T>(arr: T[], n: number): T[];
+/**
+ * 条件取元素（直到条件不满足）
+ * @param arr - 输入数组
+ * @param predicate - 条件函数
+ * @returns 满足条件的连续元素数组
+ */
+declare function takeWhile<T>(arr: T[], predicate: (item: T) => boolean): T[];
+/**
+ * 条件跳过元素（直到条件不满足）
+ * @param arr - 输入数组
+ * @param predicate - 条件函数
+ * @returns 跳过后的数组
+ */
+declare function dropWhile<T>(arr: T[], predicate: (item: T) => boolean): T[];
+
+export { chunk, compact, difference, drop, dropWhile, findIndexBy, flatten, groupBy, intersection, partition, sample, shuffle, sortBy, take, takeWhile, union, unique, unzip, zip };

package/dist/array.js

@@ -0,0 +1,84 @@
+'use strict';
+
+var chunkLCXGZISK_js = require('./chunk-LCXGZISK.js');
+
+
+
+Object.defineProperty(exports, "chunk", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.chunk; }
+});
+Object.defineProperty(exports, "compact", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.compact; }
+});
+Object.defineProperty(exports, "difference", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.difference; }
+});
+Object.defineProperty(exports, "drop", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.drop; }
+});
+Object.defineProperty(exports, "dropWhile", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.dropWhile; }
+});
+Object.defineProperty(exports, "findIndexBy", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.findIndexBy; }
+});
+Object.defineProperty(exports, "flatten", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.flatten; }
+});
+Object.defineProperty(exports, "groupBy", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.groupBy; }
+});
+Object.defineProperty(exports, "intersection", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.intersection; }
+});
+Object.defineProperty(exports, "partition", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.partition; }
+});
+Object.defineProperty(exports, "sample", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.sample; }
+});
+Object.defineProperty(exports, "shuffle", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.shuffle; }
+});
+Object.defineProperty(exports, "sortBy", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.sortBy; }
+});
+Object.defineProperty(exports, "take", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.take; }
+});
+Object.defineProperty(exports, "takeWhile", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.takeWhile; }
+});
+Object.defineProperty(exports, "union", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.union; }
+});
+Object.defineProperty(exports, "unique", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.unique; }
+});
+Object.defineProperty(exports, "unzip", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.unzip; }
+});
+Object.defineProperty(exports, "zip", {
+  enumerable: true,
+  get: function () { return chunkLCXGZISK_js.zip; }
+});
+//# sourceMappingURL=array.js.map
+//# sourceMappingURL=array.js.map

package/dist/array.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"array.js"}

package/dist/array.mjs

@@ -0,0 +1,3 @@
+export { chunk, compact, difference, drop, dropWhile, findIndexBy, flatten, groupBy, intersection, partition, sample, shuffle, sortBy, take, takeWhile, union, unique, unzip, zip } from './chunk-2FFSQ573.mjs';
+//# sourceMappingURL=array.mjs.map
+//# sourceMappingURL=array.mjs.map

package/dist/array.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"names":[],"mappings":"","file":"array.mjs"}

package/dist/chunk-27UDDVLZ.js

@@ -0,0 +1,259 @@
+'use strict';
+
+// src/core/object.ts
+function deepClone(obj) {
+  if (obj === null || typeof obj !== "object") {
+    return obj;
+  }
+  if (obj instanceof Date) {
+    return new Date(obj.getTime());
+  }
+  if (obj instanceof RegExp) {
+    return new RegExp(obj.source, obj.flags);
+  }
+  if (Array.isArray(obj)) {
+    return obj.map((item) => deepClone(item));
+  }
+  if (obj instanceof Map) {
+    const clonedMap = /* @__PURE__ */ new Map();
+    obj.forEach((value, key) => {
+      clonedMap.set(deepClone(key), deepClone(value));
+    });
+    return clonedMap;
+  }
+  if (obj instanceof Set) {
+    const clonedSet = /* @__PURE__ */ new Set();
+    obj.forEach((value) => {
+      clonedSet.add(deepClone(value));
+    });
+    return clonedSet;
+  }
+  if (typeof obj === "object") {
+    const clonedObj = {};
+    for (const key in obj) {
+      if (Object.prototype.hasOwnProperty.call(obj, key)) {
+        clonedObj[key] = deepClone(obj[key]);
+      }
+    }
+    return clonedObj;
+  }
+  return obj;
+}
+function merge(target, ...sources) {
+  return Object.assign({}, target, ...sources);
+}
+function deepMerge(target, ...sources) {
+  if (!sources.length) return target;
+  const source = sources.shift();
+  if (!source) {
+    return deepMerge(target, ...sources);
+  }
+  if (isObject(target) && isObject(source)) {
+    for (const key in source) {
+      if (Object.prototype.hasOwnProperty.call(source, key)) {
+        const sourceValue = source[key];
+        const targetValue = target[key];
+        if (isObject(sourceValue) && isObject(targetValue)) {
+          target[key] = deepMerge(
+            targetValue,
+            sourceValue
+          );
+        } else if (sourceValue !== void 0) {
+          target[key] = sourceValue;
+        }
+      }
+    }
+  }
+  return deepMerge(target, ...sources);
+}
+function isObject(item) {
+  return item !== null && typeof item === "object" && !Array.isArray(item) && !(item instanceof Date) && !(item instanceof RegExp) && !(item instanceof Map) && !(item instanceof Set);
+}
+function get(obj, path, defaultValue) {
+  if (!obj || typeof obj !== "object") {
+    return defaultValue;
+  }
+  const keys2 = Array.isArray(path) ? path : path.split(".");
+  if (keys2.length === 0) {
+    return defaultValue;
+  }
+  let result = obj;
+  for (const key of keys2) {
+    if (result == null || typeof result !== "object" || Array.isArray(result)) {
+      return defaultValue;
+    }
+    const record = result;
+    if (!(key in record)) {
+      return defaultValue;
+    }
+    result = record[key];
+  }
+  return result !== void 0 ? result : defaultValue;
+}
+function set(obj, path, value) {
+  const keys2 = Array.isArray(path) ? path : path.split(".");
+  if (keys2.length === 0) return obj;
+  const result = deepClone(obj);
+  let current = result;
+  for (let i = 0; i < keys2.length - 1; i++) {
+    const key = keys2[i];
+    if (!(key in current) || typeof current[key] !== "object" || current[key] === null) {
+      current[key] = {};
+    }
+    current = current[key];
+  }
+  current[keys2[keys2.length - 1]] = value;
+  return result;
+}
+function pick(obj, keys2) {
+  const result = {};
+  keys2.forEach((key) => {
+    if (key in obj) {
+      result[key] = obj[key];
+    }
+  });
+  return result;
+}
+function omit(obj, keys2) {
+  const result = { ...obj };
+  keys2.forEach((key) => {
+    delete result[key];
+  });
+  return result;
+}
+function keys(obj, deep = false) {
+  if (!deep) return Object.keys(obj);
+  const result = [];
+  const traverse = (current, prefix = "") => {
+    Object.keys(current).forEach((key) => {
+      const fullKey = prefix ? `${prefix}.${key}` : key;
+      result.push(fullKey);
+      const value = current[key];
+      if (value !== null && typeof value === "object" && !Array.isArray(value) && !(value instanceof Date) && !(value instanceof RegExp)) {
+        traverse(value, fullKey);
+      }
+    });
+  };
+  traverse(obj);
+  return result;
+}
+function values(obj, deep = false) {
+  if (!deep) return Object.values(obj);
+  const result = [];
+  const traverse = (current) => {
+    Object.values(current).forEach((value) => {
+      if (value !== null && typeof value === "object" && !Array.isArray(value) && !(value instanceof Date) && !(value instanceof RegExp)) {
+        traverse(value);
+      } else {
+        result.push(value);
+      }
+    });
+  };
+  traverse(obj);
+  return result;
+}
+function mapKeys(obj, fn) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const newKey = fn(key, obj[key]);
+    result[newKey] = obj[key];
+  });
+  return result;
+}
+function mapValues(obj, fn) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    result[key] = fn(obj[key], key);
+  });
+  return result;
+}
+function invert(obj) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    result[String(obj[key])] = key;
+  });
+  return result;
+}
+function defaults(obj, ...defaults2) {
+  const result = { ...obj };
+  defaults2.reverse().forEach((defaultObj) => {
+    Object.keys(defaultObj).forEach((key) => {
+      const typedKey = key;
+      if (!(typedKey in result) || result[typedKey] === void 0) {
+        result[typedKey] = defaultObj[typedKey];
+      }
+    });
+  });
+  return result;
+}
+function isEmptyObject(obj) {
+  return Object.keys(obj).length === 0;
+}
+function isEqual(obj1, obj2) {
+  if (obj1 === obj2) return true;
+  if (obj1 === null || obj2 === null) return false;
+  if (typeof obj1 !== "object" || typeof obj2 !== "object") return false;
+  if (obj1 instanceof Date && obj2 instanceof Date) {
+    return obj1.getTime() === obj2.getTime();
+  }
+  if (Array.isArray(obj1) && Array.isArray(obj2)) {
+    if (obj1.length !== obj2.length) return false;
+    return obj1.every((item, index) => isEqual(item, obj2[index]));
+  }
+  if (Array.isArray(obj1) || Array.isArray(obj2)) return false;
+  const keys1 = Object.keys(obj1);
+  const keys2 = Object.keys(obj2);
+  if (keys1.length !== keys2.length) return false;
+  return keys1.every((key) => {
+    const val1 = obj1[key];
+    const val2 = obj2[key];
+    return isEqual(val1, val2);
+  });
+}
+function transform(obj, iteratee, accumulator = {}) {
+  Object.keys(obj).forEach((key) => {
+    iteratee(accumulator, obj[key], key);
+  });
+  return accumulator;
+}
+function pickBy(obj, predicate) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const typedKey = key;
+    if (predicate(obj[typedKey], key)) {
+      result[typedKey] = obj[typedKey];
+    }
+  });
+  return result;
+}
+function omitBy(obj, predicate) {
+  const result = {};
+  Object.keys(obj).forEach((key) => {
+    const typedKey = key;
+    if (!predicate(obj[typedKey], key)) {
+      result[typedKey] = obj[typedKey];
+    }
+  });
+  return result;
+}
+
+exports.deepClone = deepClone;
+exports.deepMerge = deepMerge;
+exports.defaults = defaults;
+exports.get = get;
+exports.invert = invert;
+exports.isEmptyObject = isEmptyObject;
+exports.isEqual = isEqual;
+exports.keys = keys;
+exports.mapKeys = mapKeys;
+exports.mapValues = mapValues;
+exports.merge = merge;
+exports.omit = omit;
+exports.omitBy = omitBy;
+exports.pick = pick;
+exports.pickBy = pickBy;
+exports.set = set;
+exports.transform = transform;
+exports.values = values;
+//# sourceMappingURL=chunk-27UDDVLZ.js.map
+//# sourceMappingURL=chunk-27UDDVLZ.js.map

package/dist/chunk-27UDDVLZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/object.ts"],"names":["keys","defaults"],"mappings":";;;AAUO,SAAS,UAAa,GAAA,EAAW;AAEtC,EAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,OAAO,GAAA,KAAQ,QAAA,EAAU;AAC3C,IAAA,OAAO,GAAA;AAAA,EACT;AAGA,EAAA,IAAI,eAAe,IAAA,EAAM;AACvB,IAAA,OAAO,IAAI,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,CAAA;AAAA,EAC/B;AAGA,EAAA,IAAI,eAAe,MAAA,EAAQ;AACzB,IAAA,OAAO,IAAI,MAAA,CAAO,GAAA,CAAI,MAAA,EAAQ,IAAI,KAAK,CAAA;AAAA,EACzC;AAGA,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,GAAG,CAAA,EAAG;AACtB,IAAA,OAAO,GAAA,CAAI,GAAA,CAAI,CAAA,IAAA,KAAQ,SAAA,CAAU,IAAI,CAAC,CAAA;AAAA,EACxC;AAGA,EAAA,IAAI,eAAe,GAAA,EAAK;AACtB,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,IAAA,GAAA,CAAI,OAAA,CAAQ,CAAC,KAAA,EAAO,GAAA,KAAQ;AAC1B,MAAA,SAAA,CAAU,IAAI,SAAA,CAAU,GAAG,CAAA,EAAG,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,IAChD,CAAC,CAAA;AACD,IAAA,OAAO,SAAA;AAAA,EACT;AAGA,EAAA,IAAI,eAAe,GAAA,EAAK;AACtB,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAI;AAC1B,IAAA,GAAA,CAAI,QAAQ,CAAA,KAAA,KAAS;AACnB,MAAA,SAAA,CAAU,GAAA,CAAI,SAAA,CAAU,KAAK,CAAC,CAAA;AAAA,IAChC,CAAC,CAAA;AACD,IAAA,OAAO,SAAA;AAAA,EACT;AAGA,EAAA,IAAI,OAAO,QAAQ,QAAA,EAAU;AAC3B,IAAA,MAAM,YAAY,EAAC;AACnB,IAAA,KAAA,MAAW,OAAO,GAAA,EAAK;AACrB,MAAA,IAAI,OAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,GAAA,EAAK,GAAG,CAAA,EAAG;AAClD,QAAA,SAAA,CAAU,GAAG,CAAA,GAAI,SAAA,CAAU,GAAA,CAAI,GAAG,CAAC,CAAA;AAAA,MACrC;AAAA,IACF;AACA,IAAA,OAAO,SAAA;AAAA,EACT;AAEA,EAAA,OAAO,GAAA;AACT;AAQO,SAAS,KAAA,CAAyC,WAAc,OAAA,EAA0B;AAC/F,EAAA,OAAO,OAAO,MAAA,CAAO,EAAC,EAAG,MAAA,EAAQ,GAAG,OAAO,CAAA;AAC7C;AAQO,SAAS,SAAA,CACd,WACG,OAAA,EACA;AACH,EAAA,IAAI,CAAC,OAAA,CAAQ,MAAA,EAAQ,OAAO,MAAA;AAC5B,EAAA,MAAM,MAAA,GAAS,QAAQ,KAAA,EAAM;AAE7B,EAAA,IAAI,CAAC,MAAA,EAAQ;AACX,IAAA,OAAO,SAAA,CAAU,MAAA,EAAQ,GAAG,OAAO,CAAA;AAAA,EACrC;AAEA,EAAA,IAAI,QAAA,CAAS,MAAM,CAAA,IAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACxC,IAAA,KAAA,MAAW,OAAO,MAAA,EAAQ;AACxB,MAAA,IAAI,OAAO,SAAA,CAAU,cAAA,CAAe,IAAA,CAAK,MAAA,EAAQ,GAAG,CAAA,EAAG;AACrD,QAAA,MAAM,WAAA,GAAc,OAAO,GAAG,CAAA;AAC9B,QAAA,MAAM,WAAA,GAAc,OAAO,GAAG,CAAA;AAE9B,QAAA,IAAI,QAAA,CAAS,WAAW,CAAA,IAAK,QAAA,CAAS,WAAW,CAAA,EAAG;AAElD,UAAA,MAAA,CAAO,GAAG,CAAA,GAAI,SAAA;AAAA,YACZ,WAAA;AAAA,YACA;AAAA,WACF;AAAA,QACF,CAAA,MAAA,IAAW,gBAAgB,MAAA,EAAW;AAEpC,UAAA,MAAA,CAAO,GAAG,CAAA,GAAI,WAAA;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,SAAA,CAAU,MAAA,EAAQ,GAAG,OAAO,CAAA;AACrC;AAKA,SAAS,SAAS,IAAA,EAAgD;AAChE,EAAA,OACE,IAAA,KAAS,QACT,OAAO,IAAA,KAAS,YAChB,CAAC,KAAA,CAAM,QAAQ,IAAI,CAAA,IACnB,EAAE,IAAA,YAAgB,IAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,MAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,GAAA,CAAA,IAClB,EAAE,IAAA,YAAgB,GAAA,CAAA;AAEtB;AASO,SAAS,GAAA,CACd,GAAA,EACA,IAAA,EACA,YAAA,EACe;AACf,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU;AACnC,IAAA,OAAO,YAAA;AAAA,EACT;AAEA,EAAA,MAAMA,KAAAA,GAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AACxD,EAAA,IAAIA,KAAAA,CAAK,WAAW,CAAA,EAAG;AACrB,IAAA,OAAO,YAAA;AAAA,EACT;AAEA,EAAA,IAAI,MAAA,GAAkB,GAAA;AAEtB,EAAA,KAAA,MAAW,OAAOA,KAAAA,EAAM;AACtB,IAAA,IAAI,MAAA,IAAU,QAAQ,OAAO,MAAA,KAAW,YAAY,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACzE,MAAA,OAAO,YAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,MAAA;AACf,IAAA,IAAI,EAAE,OAAO,MAAA,CAAA,EAAS;AACpB,MAAA,OAAO,YAAA;AAAA,IACT;AAEA,IAAA,MAAA,GAAS,OAAO,GAAG,CAAA;AAAA,EACrB;AAEA,EAAA,OAAO,MAAA,KAAW,SAAa,MAAA,GAAe,YAAA;AAChD;AASO,SAAS,GAAA,CACd,GAAA,EACA,IAAA,EACA,KAAA,EACG;AACH,EAAA,MAAMA,KAAAA,GAAO,MAAM,OAAA,CAAQ,IAAI,IAAI,IAAA,GAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AACxD,EAAA,IAAIA,KAAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,GAAA;AAE9B,EAAA,MAAM,MAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,EAAA,IAAI,OAAA,GAAmC,MAAA;AAEvC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAIA,KAAAA,CAAK,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AACxC,IAAA,MAAM,GAAA,GAAMA,MAAK,CAAC,CAAA;AAClB,IAAA,IAAI,EAAE,GAAA,IAAO,OAAA,CAAA,IAAY,OAAO,OAAA,CAAQ,GAAG,CAAA,KAAM,QAAA,IAAY,OAAA,CAAQ,GAAG,CAAA,KAAM,IAAA,EAAM;AAClF,MAAA,OAAA,CAAQ,GAAG,IAAI,EAAC;AAAA,IAClB;AACA,IAAA,OAAA,GAAU,QAAQ,GAAG,CAAA;AAAA,EACvB;AAEA,EAAA,OAAA,CAAQA,KAAAA,CAAKA,KAAAA,CAAK,MAAA,GAAS,CAAC,CAAC,CAAA,GAAI,KAAA;AACjC,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CACd,KACAA,KAAAA,EACY;AACZ,EAAA,MAAM,SAAS,EAAC;AAChB,EAAAA,KAAAA,CAAK,QAAQ,CAAA,GAAA,KAAO;AAClB,IAAA,IAAI,OAAO,GAAA,EAAK;AACd,MAAA,MAAA,CAAO,GAAG,CAAA,GAAI,GAAA,CAAI,GAAG,CAAA;AAAA,IACvB;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CACd,KACAA,KAAAA,EACY;AACZ,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,GAAA,EAAI;AACxB,EAAAA,KAAAA,CAAK,QAAQ,CAAA,GAAA,KAAO;AAClB,IAAA,OAAO,OAAO,GAAG,CAAA;AAAA,EACnB,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,IAAA,CAAwC,GAAA,EAAQ,IAAA,GAAO,KAAA,EAAiB;AACtF,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,MAAA,CAAO,KAAK,GAAG,CAAA;AACjC,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,MAAM,QAAA,GAAW,CAAC,OAAA,EAAkC,MAAA,GAAS,EAAA,KAAa;AACxE,IAAA,MAAA,CAAO,IAAA,CAAK,OAAO,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAClC,MAAA,MAAM,UAAU,MAAA,GAAS,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,GAAK,GAAA;AAC9C,MAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AACnB,MAAA,MAAM,KAAA,GAAQ,QAAQ,GAAG,CAAA;AACzB,MAAA,IACE,KAAA,KAAU,IAAA,IACV,OAAO,KAAA,KAAU,YACjB,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,KACpB,EAAE,KAAA,YAAiB,IAAA,CAAA,IACnB,EAAE,iBAAiB,MAAA,CAAA,EACnB;AACA,QAAA,QAAA,CAAS,OAAkC,OAAO,CAAA;AAAA,MACpD;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AACA,EAAA,QAAA,CAAS,GAAG,CAAA;AACZ,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,MAAA,CAA0C,GAAA,EAAQ,IAAA,GAAO,KAAA,EAAkB;AACzF,EAAA,IAAI,CAAC,IAAA,EAAM,OAAO,MAAA,CAAO,OAAO,GAAG,CAAA;AACnC,EAAA,MAAM,SAAoB,EAAC;AAC3B,EAAA,MAAM,QAAA,GAAW,CAAC,OAAA,KAA2C;AAC3D,IAAA,MAAA,CAAO,MAAA,CAAO,OAAO,CAAA,CAAE,OAAA,CAAQ,CAAA,KAAA,KAAS;AACtC,MAAA,IACE,KAAA,KAAU,IAAA,IACV,OAAO,KAAA,KAAU,YACjB,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,KACpB,EAAE,KAAA,YAAiB,IAAA,CAAA,IACnB,EAAE,iBAAiB,MAAA,CAAA,EACnB;AACA,QAAA,QAAA,CAAS,KAAgC,CAAA;AAAA,MAC3C,CAAA,MAAO;AACL,QAAA,MAAA,CAAO,KAAK,KAAK,CAAA;AAAA,MACnB;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AACA,EAAA,QAAA,CAAS,GAAG,CAAA;AACZ,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,OAAA,CACd,KACA,EAAA,EACyB;AACzB,EAAA,MAAM,SAAkC,EAAC;AACzC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,MAAA,GAAS,EAAA,CAAG,GAAA,EAAK,GAAA,CAAI,GAAG,CAAC,CAAA;AAC/B,IAAA,MAAA,CAAO,MAAM,CAAA,GAAI,GAAA,CAAI,GAAG,CAAA;AAAA,EAC1B,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,SAAA,CACd,KACA,EAAA,EACmB;AACnB,EAAA,MAAM,SAA4B,EAAC;AACnC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAA,CAAO,GAAG,CAAA,GAAI,EAAA,CAAG,GAAA,CAAI,GAAG,GAAG,GAAG,CAAA;AAAA,EAChC,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAOO,SAAS,OAAkD,GAAA,EAAgC;AAChG,EAAA,MAAM,SAAiC,EAAC;AACxC,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAA,CAAO,MAAA,CAAO,GAAA,CAAI,GAAG,CAAC,CAAC,CAAA,GAAI,GAAA;AAAA,EAC7B,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,QAAA,CACd,QACGC,SAAAA,EACA;AACH,EAAA,MAAM,MAAA,GAAS,EAAE,GAAG,GAAA,EAAI;AACxB,EAAAA,SAAAA,CAAS,OAAA,EAAQ,CAAE,OAAA,CAAQ,CAAA,UAAA,KAAc;AACvC,IAAA,MAAA,CAAO,IAAA,CAAK,UAAU,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AACrC,MAAA,MAAM,QAAA,GAAW,GAAA;AACjB,MAAA,IAAI,EAAE,QAAA,IAAY,MAAA,CAAA,IAAW,MAAA,CAAO,QAAQ,MAAM,MAAA,EAAW;AAC3D,QAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,UAAA,CAAW,QAAQ,CAAA;AAAA,MACxC;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAOO,SAAS,cAAc,GAAA,EAAuC;AACnE,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,MAAA,KAAW,CAAA;AACrC;AAQO,SAAS,OAAA,CAAW,MAAS,IAAA,EAAkB;AACpD,EAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAC1B,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,IAAA,EAAM,OAAO,KAAA;AAC3C,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,IAAA,KAAS,UAAU,OAAO,KAAA;AAEjE,EAAA,IAAI,IAAA,YAAgB,IAAA,IAAQ,IAAA,YAAgB,IAAA,EAAM;AAChD,IAAA,OAAO,IAAA,CAAK,OAAA,EAAQ,KAAM,IAAA,CAAK,OAAA,EAAQ;AAAA,EACzC;AAEA,EAAA,IAAI,MAAM,OAAA,CAAQ,IAAI,KAAK,KAAA,CAAM,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC9C,IAAA,IAAI,IAAA,CAAK,MAAA,KAAW,IAAA,CAAK,MAAA,EAAQ,OAAO,KAAA;AACxC,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAC,IAAA,EAAM,KAAA,KAAU,QAAQ,IAAA,EAAM,IAAA,CAAK,KAAK,CAAC,CAAC,CAAA;AAAA,EAC/D;AAEA,EAAA,IAAI,KAAA,CAAM,QAAQ,IAAI,CAAA,IAAK,MAAM,OAAA,CAAQ,IAAI,GAAG,OAAO,KAAA;AAEvD,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,IAA+B,CAAA;AACzD,EAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,IAAA,CAAK,IAA+B,CAAA;AAEzD,EAAA,IAAI,KAAA,CAAM,MAAA,KAAW,KAAA,CAAM,MAAA,EAAQ,OAAO,KAAA;AAE1C,EAAA,OAAO,KAAA,CAAM,MAAM,CAAA,GAAA,KAAO;AACxB,IAAA,MAAM,IAAA,GAAQ,KAAiC,GAAG,CAAA;AAClD,IAAA,MAAM,IAAA,GAAQ,KAAiC,GAAG,CAAA;AAClD,IAAA,OAAO,OAAA,CAAQ,MAAM,IAAI,CAAA;AAAA,EAC3B,CAAC,CAAA;AACH;AASO,SAAS,SAAA,CACd,GAAA,EACA,QAAA,EACA,WAAA,GAAiB,EAAC,EACf;AACH,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,QAAA,CAAS,WAAA,EAAa,GAAA,CAAI,GAAG,CAAA,EAAG,GAAG,CAAA;AAAA,EACrC,CAAC,CAAA;AACD,EAAA,OAAO,WAAA;AACT;AAQO,SAAS,MAAA,CACd,KACA,SAAA,EACY;AACZ,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,QAAA,GAAW,GAAA;AACjB,IAAA,IAAI,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAG,CAAA,EAAG;AACjC,MAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA;AAAA,IACjC;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT;AAQO,SAAS,MAAA,CACd,KACA,SAAA,EACY;AACZ,EAAA,MAAM,SAAqB,EAAC;AAC5B,EAAA,MAAA,CAAO,IAAA,CAAK,GAAG,CAAA,CAAE,OAAA,CAAQ,CAAA,GAAA,KAAO;AAC9B,IAAA,MAAM,QAAA,GAAW,GAAA;AACjB,IAAA,IAAI,CAAC,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAA,EAAG,GAAG,CAAA,EAAG;AAClC,MAAA,MAAA,CAAO,QAAQ,CAAA,GAAI,GAAA,CAAI,QAAQ,CAAA;AAAA,IACjC;AAAA,EACF,CAAC,CAAA;AACD,EAAA,OAAO,MAAA;AACT","file":"chunk-27UDDVLZ.js","sourcesContent":["/**\n * 对象工具函数\n */\n\n/**\n * 深拷贝对象\n * 支持 Date、Array、RegExp、Map、Set 等特殊类型\n * @param obj - 输入对象\n * @returns 深拷贝后的对象\n */\nexport function deepClone<T>(obj: T): T {\n  // 处理 null 和基本类型\n  if (obj === null || typeof obj !== 'object') {\n    return obj;\n  }\n\n  // 处理 Date\n  if (obj instanceof Date) {\n    return new Date(obj.getTime()) as unknown as T;\n  }\n\n  // 处理 RegExp\n  if (obj instanceof RegExp) {\n    return new RegExp(obj.source, obj.flags) as unknown as T;\n  }\n\n  // 处理 Array\n  if (Array.isArray(obj)) {\n    return obj.map(item => deepClone(item)) as unknown as T;\n  }\n\n  // 处理 Map\n  if (obj instanceof Map) {\n    const clonedMap = new Map();\n    obj.forEach((value, key) => {\n      clonedMap.set(deepClone(key), deepClone(value));\n    });\n    return clonedMap as unknown as T;\n  }\n\n  // 处理 Set\n  if (obj instanceof Set) {\n    const clonedSet = new Set();\n    obj.forEach(value => {\n      clonedSet.add(deepClone(value));\n    });\n    return clonedSet as unknown as T;\n  }\n\n  // 处理普通对象\n  if (typeof obj === 'object') {\n    const clonedObj = {} as T;\n    for (const key in obj) {\n      if (Object.prototype.hasOwnProperty.call(obj, key)) {\n        clonedObj[key] = deepClone(obj[key]);\n      }\n    }\n    return clonedObj;\n  }\n\n  return obj;\n}\n\n/**\n * 对象合并\n * @param target - 目标对象\n * @param sources - 源对象数组\n * @returns 合并后的对象\n */\nexport function merge<T extends Record<string, unknown>>(target: T, ...sources: Partial<T>[]): T {\n  return Object.assign({}, target, ...sources);\n}\n\n/**\n * 深合并对象\n * @param target - 目标对象\n * @param sources - 源对象数组\n * @returns 深合并后的对象\n */\nexport function deepMerge<T extends Record<string, unknown>>(\n  target: T,\n  ...sources: Partial<T>[]\n): T {\n  if (!sources.length) return target;\n  const source = sources.shift();\n\n  if (!source) {\n    return deepMerge(target, ...sources);\n  }\n\n  if (isObject(target) && isObject(source)) {\n    for (const key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        const sourceValue = source[key];\n        const targetValue = target[key];\n\n        if (isObject(sourceValue) && isObject(targetValue)) {\n          // 递归合并嵌套对象\n          target[key] = deepMerge(\n            targetValue as Record<string, unknown>,\n            sourceValue as Record<string, unknown>\n          ) as T[Extract<keyof T, string>];\n        } else if (sourceValue !== undefined) {\n          // 直接赋值（包括 null）\n          target[key] = sourceValue as T[Extract<keyof T, string>];\n        }\n      }\n    }\n  }\n\n  return deepMerge(target, ...sources);\n}\n\n/**\n * 判断是否为普通对象（非 null、非数组、非 Date 等）\n */\nfunction isObject(item: unknown): item is Record<string, unknown> {\n  return (\n    item !== null &&\n    typeof item === 'object' &&\n    !Array.isArray(item) &&\n    !(item instanceof Date) &&\n    !(item instanceof RegExp) &&\n    !(item instanceof Map) &&\n    !(item instanceof Set)\n  );\n}\n\n/**\n * 获取对象嵌套属性值\n * @param obj - 对象\n * @param path - 属性路径，如 'a.b.c' 或 ['a', 'b', 'c']\n * @param defaultValue - 默认值\n * @returns 属性值\n */\nexport function get<T = unknown>(\n  obj: Record<string, unknown>,\n  path: string | string[],\n  defaultValue?: T\n): T | undefined {\n  if (!obj || typeof obj !== 'object') {\n    return defaultValue;\n  }\n\n  const keys = Array.isArray(path) ? path : path.split('.');\n  if (keys.length === 0) {\n    return defaultValue;\n  }\n\n  let result: unknown = obj;\n\n  for (const key of keys) {\n    if (result == null || typeof result !== 'object' || Array.isArray(result)) {\n      return defaultValue;\n    }\n\n    // 使用类型断言访问属性\n    const record = result as Record<string, unknown>;\n    if (!(key in record)) {\n      return defaultValue;\n    }\n\n    result = record[key];\n  }\n\n  return result !== undefined ? (result as T) : defaultValue;\n}\n\n/**\n * 设置嵌套属性值\n * @param obj - 对象\n * @param path - 属性路径，如 'a.b.c' 或 ['a', 'b', 'c']\n * @param value - 要设置的值\n * @returns 设置后的新对象（不修改原对象）\n */\nexport function set<T extends Record<string, unknown>>(\n  obj: T,\n  path: string | string[],\n  value: unknown\n): T {\n  const keys = Array.isArray(path) ? path : path.split('.');\n  if (keys.length === 0) return obj;\n\n  const result = deepClone(obj);\n  let current: Record<string, unknown> = result;\n\n  for (let i = 0; i < keys.length - 1; i++) {\n    const key = keys[i];\n    if (!(key in current) || typeof current[key] !== 'object' || current[key] === null) {\n      current[key] = {};\n    }\n    current = current[key] as Record<string, unknown>;\n  }\n\n  current[keys[keys.length - 1]] = value;\n  return result;\n}\n\n/**\n * 选择指定属性\n * @param obj - 对象\n * @param keys - 要选择的属性键数组\n * @returns 包含指定属性的新对象\n */\nexport function pick<T extends Record<string, unknown>, K extends keyof T>(\n  obj: T,\n  keys: K[]\n): Pick<T, K> {\n  const result = {} as Pick<T, K>;\n  keys.forEach(key => {\n    if (key in obj) {\n      result[key] = obj[key];\n    }\n  });\n  return result;\n}\n\n/**\n * 排除指定属性\n * @param obj - 对象\n * @param keys - 要排除的属性键数组\n * @returns 排除指定属性后的新对象\n */\nexport function omit<T extends Record<string, unknown>, K extends keyof T>(\n  obj: T,\n  keys: K[]\n): Omit<T, K> {\n  const result = { ...obj };\n  keys.forEach(key => {\n    delete result[key];\n  });\n  return result;\n}\n\n/**\n * 获取所有键（支持深度）\n * @param obj - 对象\n * @param deep - 是否深度获取，默认为 false\n * @returns 键数组\n */\nexport function keys<T extends Record<string, unknown>>(obj: T, deep = false): string[] {\n  if (!deep) return Object.keys(obj);\n  const result: string[] = [];\n  const traverse = (current: Record<string, unknown>, prefix = ''): void => {\n    Object.keys(current).forEach(key => {\n      const fullKey = prefix ? `${prefix}.${key}` : key;\n      result.push(fullKey);\n      const value = current[key];\n      if (\n        value !== null &&\n        typeof value === 'object' &&\n        !Array.isArray(value) &&\n        !(value instanceof Date) &&\n        !(value instanceof RegExp)\n      ) {\n        traverse(value as Record<string, unknown>, fullKey);\n      }\n    });\n  };\n  traverse(obj);\n  return result;\n}\n\n/**\n * 获取所有值（支持深度）\n * @param obj - 对象\n * @param deep - 是否深度获取，默认为 false\n * @returns 值数组\n */\nexport function values<T extends Record<string, unknown>>(obj: T, deep = false): unknown[] {\n  if (!deep) return Object.values(obj);\n  const result: unknown[] = [];\n  const traverse = (current: Record<string, unknown>): void => {\n    Object.values(current).forEach(value => {\n      if (\n        value !== null &&\n        typeof value === 'object' &&\n        !Array.isArray(value) &&\n        !(value instanceof Date) &&\n        !(value instanceof RegExp)\n      ) {\n        traverse(value as Record<string, unknown>);\n      } else {\n        result.push(value);\n      }\n    });\n  };\n  traverse(obj);\n  return result;\n}\n\n/**\n * 键映射\n * @param obj - 对象\n * @param fn - 键转换函数\n * @returns 键映射后的新对象\n */\nexport function mapKeys<T extends Record<string, unknown>>(\n  obj: T,\n  fn: (key: string, value: unknown) => string\n): Record<string, unknown> {\n  const result: Record<string, unknown> = {};\n  Object.keys(obj).forEach(key => {\n    const newKey = fn(key, obj[key]);\n    result[newKey] = obj[key];\n  });\n  return result;\n}\n\n/**\n * 值映射\n * @param obj - 对象\n * @param fn - 值转换函数\n * @returns 值映射后的新对象\n */\nexport function mapValues<T extends Record<string, unknown>, R>(\n  obj: T,\n  fn: (value: unknown, key: string) => R\n): Record<string, R> {\n  const result: Record<string, R> = {};\n  Object.keys(obj).forEach(key => {\n    result[key] = fn(obj[key], key);\n  });\n  return result;\n}\n\n/**\n * 键值反转\n * @param obj - 对象\n * @returns 键值反转后的新对象\n */\nexport function invert<T extends Record<string, string | number>>(obj: T): Record<string, string> {\n  const result: Record<string, string> = {};\n  Object.keys(obj).forEach(key => {\n    result[String(obj[key])] = key;\n  });\n  return result;\n}\n\n/**\n * 设置默认值\n * @param obj - 对象\n * @param defaults - 默认值对象\n * @returns 合并默认值后的新对象\n */\nexport function defaults<T extends Record<string, unknown>>(\n  obj: Partial<T>,\n  ...defaults: Partial<T>[]\n): T {\n  const result = { ...obj } as T;\n  defaults.reverse().forEach(defaultObj => {\n    Object.keys(defaultObj).forEach(key => {\n      const typedKey = key as Extract<keyof T, string>;\n      if (!(typedKey in result) || result[typedKey] === undefined) {\n        result[typedKey] = defaultObj[typedKey] as T[Extract<keyof T, string>];\n      }\n    });\n  });\n  return result;\n}\n\n/**\n * 判断对象是否为空\n * @param obj - 对象\n * @returns 是否为空\n */\nexport function isEmptyObject(obj: Record<string, unknown>): boolean {\n  return Object.keys(obj).length === 0;\n}\n\n/**\n * 深度比较两个对象\n * @param obj1 - 第一个对象\n * @param obj2 - 第二个对象\n * @returns 是否相等\n */\nexport function isEqual<T>(obj1: T, obj2: T): boolean {\n  if (obj1 === obj2) return true;\n  if (obj1 === null || obj2 === null) return false;\n  if (typeof obj1 !== 'object' || typeof obj2 !== 'object') return false;\n\n  if (obj1 instanceof Date && obj2 instanceof Date) {\n    return obj1.getTime() === obj2.getTime();\n  }\n\n  if (Array.isArray(obj1) && Array.isArray(obj2)) {\n    if (obj1.length !== obj2.length) return false;\n    return obj1.every((item, index) => isEqual(item, obj2[index]));\n  }\n\n  if (Array.isArray(obj1) || Array.isArray(obj2)) return false;\n\n  const keys1 = Object.keys(obj1 as Record<string, unknown>);\n  const keys2 = Object.keys(obj2 as Record<string, unknown>);\n\n  if (keys1.length !== keys2.length) return false;\n\n  return keys1.every(key => {\n    const val1 = (obj1 as Record<string, unknown>)[key];\n    const val2 = (obj2 as Record<string, unknown>)[key];\n    return isEqual(val1, val2);\n  });\n}\n\n/**\n * 对象转换\n * @param obj - 对象\n * @param iteratee - 转换函数\n * @param accumulator - 累加器，默认为空对象\n * @returns 转换后的对象\n */\nexport function transform<T extends Record<string, unknown>, R extends Record<string, unknown>>(\n  obj: T,\n  iteratee: (result: R, value: unknown, key: string) => void,\n  accumulator: R = {} as R\n): R {\n  Object.keys(obj).forEach(key => {\n    iteratee(accumulator, obj[key], key);\n  });\n  return accumulator;\n}\n\n/**\n * 条件选择属性\n * @param obj - 对象\n * @param predicate - 条件函数\n * @returns 满足条件的属性组成的新对象\n */\nexport function pickBy<T extends Record<string, unknown>>(\n  obj: T,\n  predicate: (value: unknown, key: string) => boolean\n): Partial<T> {\n  const result: Partial<T> = {};\n  Object.keys(obj).forEach(key => {\n    const typedKey = key as keyof T;\n    if (predicate(obj[typedKey], key)) {\n      result[typedKey] = obj[typedKey];\n    }\n  });\n  return result;\n}\n\n/**\n * 条件排除属性\n * @param obj - 对象\n * @param predicate - 条件函数\n * @returns 不满足条件的属性组成的新对象\n */\nexport function omitBy<T extends Record<string, unknown>>(\n  obj: T,\n  predicate: (value: unknown, key: string) => boolean\n): Partial<T> {\n  const result: Partial<T> = {};\n  Object.keys(obj).forEach(key => {\n    const typedKey = key as keyof T;\n    if (!predicate(obj[typedKey], key)) {\n      result[typedKey] = obj[typedKey];\n    }\n  });\n  return result;\n}\n"]}

package/dist/chunk-2FFSQ573.mjs

@@ -0,0 +1,138 @@
+// src/core/array.ts
+function unique(arr) {
+  return Array.from(new Set(arr));
+}
+function groupBy(arr, keyFn) {
+  const getKey = typeof keyFn === "string" ? (item) => item[keyFn] : keyFn;
+  return arr.reduce(
+    (acc, item) => {
+      const key = getKey(item);
+      if (!acc[key]) {
+        acc[key] = [];
+      }
+      acc[key].push(item);
+      return acc;
+    },
+    {}
+  );
+}
+function chunk(arr, size) {
+  const chunks = [];
+  for (let i = 0; i < arr.length; i += size) {
+    chunks.push(arr.slice(i, i + size));
+  }
+  return chunks;
+}
+function flatten(arr, depth = 1) {
+  return depth > 0 ? arr.reduce(
+    (acc, val) => acc.concat(Array.isArray(val) ? flatten(val, depth - 1) : val),
+    []
+  ) : arr;
+}
+function shuffle(arr) {
+  const result = [...arr];
+  for (let i = result.length - 1; i > 0; i--) {
+    const j = Math.floor(Math.random() * (i + 1));
+    [result[i], result[j]] = [result[j], result[i]];
+  }
+  return result;
+}
+function sample(arr, count = 1) {
+  if (arr.length === 0) {
+    throw new Error("Cannot sample from empty array");
+  }
+  if (count === 1) {
+    const shuffled2 = shuffle(arr);
+    return shuffled2[0];
+  }
+  if (count >= arr.length) return [...arr];
+  const shuffled = shuffle(arr);
+  return shuffled.slice(0, count);
+}
+function difference(arr1, arr2) {
+  const set2 = new Set(arr2);
+  return arr1.filter((item) => !set2.has(item));
+}
+function intersection(arr1, arr2) {
+  const set2 = new Set(arr2);
+  return arr1.filter((item) => set2.has(item));
+}
+function union(arr1, arr2) {
+  return unique([...arr1, ...arr2]);
+}
+function sortBy(arr, keyFn, order = "asc") {
+  const getKey = typeof keyFn === "string" ? (item) => item[keyFn] : keyFn;
+  const result = [...arr];
+  result.sort((a, b) => {
+    const keyA = getKey(a);
+    const keyB = getKey(b);
+    if (keyA < keyB) return order === "asc" ? -1 : 1;
+    if (keyA > keyB) return order === "asc" ? 1 : -1;
+    return 0;
+  });
+  return result;
+}
+function findIndexBy(arr, predicate) {
+  return arr.findIndex(predicate);
+}
+function partition(arr, predicate) {
+  const truthy = [];
+  const falsy = [];
+  arr.forEach((item) => {
+    if (predicate(item)) {
+      truthy.push(item);
+    } else {
+      falsy.push(item);
+    }
+  });
+  return [truthy, falsy];
+}
+function zip(...arrays) {
+  const maxLength = Math.max(...arrays.map((arr) => arr.length));
+  const result = [];
+  for (let i = 0; i < maxLength; i++) {
+    result.push(
+      arrays.map((arr) => arr[i])
+    );
+  }
+  return result;
+}
+function unzip(array) {
+  if (array.length === 0) return [];
+  const length = array[0].length;
+  const result = Array.from({ length }, () => []);
+  array.forEach((item) => {
+    item.forEach((val, index) => {
+      result[index].push(val);
+    });
+  });
+  return result;
+}
+function compact(arr) {
+  return arr.filter((item) => Boolean(item));
+}
+function take(arr, n) {
+  return arr.slice(0, n);
+}
+function drop(arr, n) {
+  return arr.slice(n);
+}
+function takeWhile(arr, predicate) {
+  const result = [];
+  for (const item of arr) {
+    if (!predicate(item)) break;
+    result.push(item);
+  }
+  return result;
+}
+function dropWhile(arr, predicate) {
+  let index = 0;
+  while (index < arr.length && predicate(arr[index])) {
+    index++;
+  }
+  return arr.slice(index);
+}
+
+export { chunk, compact, difference, drop, dropWhile, findIndexBy, flatten, groupBy, intersection, partition, sample, shuffle, sortBy, take, takeWhile, union, unique, unzip, zip };
+//# sourceMappingURL=chunk-2FFSQ573.mjs.map
+//# sourceMappingURL=chunk-2FFSQ573.mjs.map