ly-utils-lib 1.0.11 → 2.4.0

package/dist/array.cjs

@@ -0,0 +1,237 @@
+'use strict';
+
+var esToolkit = require('es-toolkit');
+
+// src/modules/array/index.ts
+var unique = (arr, key) => {
+  if (key) {
+    return esToolkit.uniqBy(arr, (item) => item[key]);
+  }
+  return esToolkit.uniq(arr);
+};
+var min = (arr) => {
+  if (arr.length === 0) return void 0;
+  return Math.min(...arr);
+};
+var max = (arr) => {
+  if (arr.length === 0) return void 0;
+  return Math.max(...arr);
+};
+var isEmpty = (arr) => {
+  return arr.length === 0;
+};
+var split = (arr, size) => {
+  const result = [];
+  for (let i = 0; i < arr.length; i += size) {
+    result.push(arr.slice(i, i + size));
+  }
+  return result;
+};
+var 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;
+};
+var findIndex = (arr, predicate) => {
+  return arr.findIndex(predicate);
+};
+var find = (arr, predicate) => {
+  return arr.find(predicate);
+};
+var filter = (arr, predicate) => {
+  return arr.filter(predicate);
+};
+var map = (arr, mapper) => {
+  return arr.map(mapper);
+};
+var reduceSum = (arr, mapper) => {
+  if (mapper) {
+    return arr.reduce((acc, item) => acc + mapper(item), 0);
+  }
+  return arr.reduce((acc, item) => acc + item, 0);
+};
+var average = (arr, mapper) => {
+  if (arr.length === 0) return 0;
+  if (mapper) {
+    const sum2 = arr.reduce((acc, item) => acc + mapper(item), 0);
+    return sum2 / arr.length;
+  }
+  return arr.reduce((acc, item) => acc + item, 0) / arr.length;
+};
+var maxValue = (arr, mapper) => {
+  if (arr.length === 0) return void 0;
+  if (mapper) {
+    return Math.max(...arr.map(mapper));
+  }
+  return Math.max(...arr);
+};
+var minValue = (arr, mapper) => {
+  if (arr.length === 0) return void 0;
+  if (mapper) {
+    return Math.min(...arr.map(mapper));
+  }
+  return Math.min(...arr);
+};
+var includes = (arr, value) => {
+  return arr.includes(value);
+};
+var remove = (arr, value) => {
+  return arr.filter((item) => item !== value);
+};
+var removeAt = (arr, index) => {
+  return arr.filter((_, i) => i !== index);
+};
+var insert = (arr, index, value) => {
+  return [...arr.slice(0, index), value, ...arr.slice(index)];
+};
+var move = (arr, from, to) => {
+  const result = [...arr];
+  const [removed] = result.splice(from, 1);
+  result.splice(to, 0, removed);
+  return result;
+};
+var arrayToTree = (arr, options = {}) => {
+  const { idKey = "id", parentIdKey = "parentId", childrenKey = "children" } = options;
+  const map2 = /* @__PURE__ */ new Map();
+  const roots = [];
+  arr.forEach((item) => {
+    map2.set(item[idKey], { ...item, [childrenKey]: [] });
+  });
+  map2.forEach((item) => {
+    const parentId = item[parentIdKey];
+    if (parentId && map2.has(parentId)) {
+      const parent = map2.get(parentId);
+      if (parent) {
+        parent[childrenKey].push(item);
+      }
+    } else {
+      roots.push(item);
+    }
+  });
+  return roots;
+};
+var treeToArray = (tree, childrenKey = "children") => {
+  const result = [];
+  const traverse = (nodes) => {
+    nodes.forEach((node) => {
+      result.push(node);
+      if (node[childrenKey] && node[childrenKey].length > 0) {
+        traverse(node[childrenKey]);
+      }
+    });
+  };
+  traverse(tree);
+  return result;
+};
+var paginate = (arr, page, pageSize) => {
+  const start = (page - 1) * pageSize;
+  return arr.slice(start, start + pageSize);
+};
+var getPaginationInfo = (total, page, pageSize) => {
+  const totalPages = Math.ceil(total / pageSize);
+  const startIndex = (page - 1) * pageSize;
+  const endIndex = Math.min(startIndex + pageSize, total);
+  return {
+    total,
+    page,
+    pageSize,
+    totalPages,
+    startIndex,
+    endIndex,
+    hasNext: page < totalPages,
+    hasPrev: page > 1
+  };
+};
+
+Object.defineProperty(exports, "chunk", {
+  enumerable: true,
+  get: function () { return esToolkit.chunk; }
+});
+Object.defineProperty(exports, "compact", {
+  enumerable: true,
+  get: function () { return esToolkit.compact; }
+});
+Object.defineProperty(exports, "difference", {
+  enumerable: true,
+  get: function () { return esToolkit.difference; }
+});
+Object.defineProperty(exports, "flatten", {
+  enumerable: true,
+  get: function () { return esToolkit.flatten; }
+});
+Object.defineProperty(exports, "flattenDeep", {
+  enumerable: true,
+  get: function () { return esToolkit.flattenDeep; }
+});
+Object.defineProperty(exports, "groupBy", {
+  enumerable: true,
+  get: function () { return esToolkit.groupBy; }
+});
+Object.defineProperty(exports, "head", {
+  enumerable: true,
+  get: function () { return esToolkit.head; }
+});
+Object.defineProperty(exports, "intersection", {
+  enumerable: true,
+  get: function () { return esToolkit.intersection; }
+});
+Object.defineProperty(exports, "isEqual", {
+  enumerable: true,
+  get: function () { return esToolkit.isEqual; }
+});
+Object.defineProperty(exports, "last", {
+  enumerable: true,
+  get: function () { return esToolkit.last; }
+});
+Object.defineProperty(exports, "omit", {
+  enumerable: true,
+  get: function () { return esToolkit.omit; }
+});
+Object.defineProperty(exports, "sample", {
+  enumerable: true,
+  get: function () { return esToolkit.sample; }
+});
+Object.defineProperty(exports, "sortBy", {
+  enumerable: true,
+  get: function () { return esToolkit.sortBy; }
+});
+Object.defineProperty(exports, "sum", {
+  enumerable: true,
+  get: function () { return esToolkit.sum; }
+});
+Object.defineProperty(exports, "uniq", {
+  enumerable: true,
+  get: function () { return esToolkit.uniq; }
+});
+Object.defineProperty(exports, "uniqBy", {
+  enumerable: true,
+  get: function () { return esToolkit.uniqBy; }
+});
+exports.arrayToTree = arrayToTree;
+exports.average = average;
+exports.filter = filter;
+exports.find = find;
+exports.findIndex = findIndex;
+exports.getPaginationInfo = getPaginationInfo;
+exports.includes = includes;
+exports.insert = insert;
+exports.isEmpty = isEmpty;
+exports.map = map;
+exports.max = max;
+exports.maxValue = maxValue;
+exports.min = min;
+exports.minValue = minValue;
+exports.move = move;
+exports.paginate = paginate;
+exports.reduceSum = reduceSum;
+exports.remove = remove;
+exports.removeAt = removeAt;
+exports.shuffle = shuffle;
+exports.split = split;
+exports.treeToArray = treeToArray;
+exports.unique = unique;
+//# sourceMappingURL=array.cjs.map
+//# sourceMappingURL=array.cjs.map

package/dist/array.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/modules/array/index.ts"],"names":["uniqBy","uniq","sum","map"],"mappings":";;;;;AAiDO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,GAAA,KAAuB;AACzD,EAAA,IAAI,GAAA,EAAK;AACP,IAAA,OAAOA,gBAAA,CAAO,GAAA,EAAK,CAAA,IAAA,KAAQ,IAAA,CAAK,GAAG,CAAQ,CAAA;AAAA,EAC7C;AACA,EAAA,OAAOC,eAAK,GAAG,CAAA;AACjB;AAMO,IAAM,GAAA,GAAM,CAAC,GAAA,KAAsC;AACxD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,GAAG,CAAA;AACxB;AAMO,IAAM,GAAA,GAAM,CAAC,GAAA,KAAsC;AACxD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,GAAG,CAAA;AACxB;AAMO,IAAM,OAAA,GAAU,CAAI,GAAA,KAAsB;AAC/C,EAAA,OAAO,IAAI,MAAA,KAAW,CAAA;AACxB;AAOO,IAAM,KAAA,GAAQ,CAAI,GAAA,EAAU,IAAA,KAAwB;AACzD,EAAA,MAAM,SAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,EAAQ,KAAK,IAAA,EAAM;AACzC,IAAA,MAAA,CAAO,KAAK,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,MAAA;AACT;AAMO,IAAM,OAAA,GAAU,CAAI,GAAA,KAAkB;AAC3C,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,GAAG,CAAA;AACtB,EAAA,KAAA,IAAS,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,IAAK,IAAI,CAAA,CAAE,CAAA;AAC3C,IAAA,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA,GAAI,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,MAAA;AACT;AAOO,IAAM,SAAA,GAAY,CAAI,GAAA,EAAU,SAAA,KAA2D;AAChG,EAAA,OAAO,GAAA,CAAI,UAAU,SAAS,CAAA;AAChC;AAOO,IAAM,IAAA,GAAO,CAClB,GAAA,EACA,SAAA,KACkB;AAClB,EAAA,OAAO,GAAA,CAAI,KAAK,SAAS,CAAA;AAC3B;AAOO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,SAAA,KAAwD;AAC1F,EAAA,OAAO,GAAA,CAAI,OAAO,SAAS,CAAA;AAC7B;AAOO,IAAM,GAAA,GAAM,CAAO,GAAA,EAAU,MAAA,KAA+C;AACjF,EAAA,OAAO,GAAA,CAAI,IAAI,MAAM,CAAA;AACvB;AAOO,IAAM,SAAA,GAAY,CAAI,GAAA,EAAU,MAAA,KAAyC;AAC9E,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,GAAA,CAAI,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,MAAA,CAAO,IAAI,CAAA,EAAG,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,OAAQ,IAAiB,MAAA,CAAO,CAAC,KAAK,IAAA,KAAS,GAAA,GAAM,MAAM,CAAC,CAAA;AAC9D;AAOO,IAAM,OAAA,GAAU,CAAI,GAAA,EAAU,MAAA,KAAyC;AAC5E,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,MAAMC,IAAAA,GAAM,GAAA,CAAI,MAAA,CAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,MAAA,CAAO,IAAI,CAAA,EAAG,CAAC,CAAA;AAC3D,IAAA,OAAOA,OAAM,GAAA,CAAI,MAAA;AAAA,EACnB;AACA,EAAA,OAAQ,GAAA,CAAiB,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,IAAA,EAAM,CAAC,CAAA,GAAI,GAAA,CAAI,MAAA;AACtE;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,MAAA,KAAqD;AACzF,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,KAAK,GAAA,CAAI,GAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAI,GAAgB,CAAA;AACtC;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,MAAA,KAAqD;AACzF,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,KAAK,GAAA,CAAI,GAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAI,GAAgB,CAAA;AACtC;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,KAAA,KAAsB;AAC1D,EAAA,OAAO,GAAA,CAAI,SAAS,KAAK,CAAA;AAC3B;AAOO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,KAAA,KAAkB;AACpD,EAAA,OAAO,GAAA,CAAI,MAAA,CAAO,CAAA,IAAA,KAAQ,IAAA,KAAS,KAAK,CAAA;AAC1C;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,KAAA,KAAuB;AAC3D,EAAA,OAAO,IAAI,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,MAAM,KAAK,CAAA;AACzC;AAQO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,KAAA,EAAe,KAAA,KAAkB;AACnE,EAAA,OAAO,CAAC,GAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,EAAG,KAAA,EAAO,GAAG,GAAA,CAAI,KAAA,CAAM,KAAK,CAAC,CAAA;AAC5D;AAQO,IAAM,IAAA,GAAO,CAAI,GAAA,EAAU,IAAA,EAAc,EAAA,KAAoB;AAClE,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,GAAG,CAAA;AACtB,EAAA,MAAM,CAAC,OAAO,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACvC,EAAA,MAAA,CAAO,MAAA,CAAO,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAC5B,EAAA,OAAO,MAAA;AACT;AAOO,IAAM,WAAA,GAAc,CACzB,GAAA,EACA,OAAA,GAII,EAAC,KACG;AACR,EAAA,MAAM,EAAE,KAAA,GAAQ,IAAA,EAAM,cAAc,UAAA,EAAY,WAAA,GAAc,YAAW,GAAI,OAAA;AAE7E,EAAA,MAAMC,IAAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,MAAM,QAAa,EAAC;AAGpB,EAAA,GAAA,CAAI,QAAQ,CAAA,IAAA,KAAQ;AAClB,IAAAA,IAAAA,CAAI,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA,EAAG,EAAE,GAAG,IAAA,EAAM,CAAC,WAAW,GAAG,IAAI,CAAA;AAAA,EACrD,CAAC,CAAA;AAGD,EAAAA,IAAAA,CAAI,QAAQ,CAAA,IAAA,KAAQ;AAClB,IAAA,MAAM,QAAA,GAAW,KAAK,WAAW,CAAA;AACjC,IAAA,IAAI,QAAA,IAAYA,IAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG;AACjC,MAAA,MAAM,MAAA,GAASA,IAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA;AAC/B,MAAA,IAAI,MAAA,EAAQ;AACT,QAAC,MAAA,CAAO,WAAW,CAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAAA,MACzC;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,KAAA;AACT;AAOO,IAAM,WAAA,GAAc,CACzB,IAAA,EACA,WAAA,GAAc,UAAA,KACN;AACR,EAAA,MAAM,SAAc,EAAC;AAErB,EAAA,MAAM,QAAA,GAAW,CAAC,KAAA,KAAe;AAC/B,IAAA,KAAA,CAAM,QAAQ,CAAA,IAAA,KAAQ;AACpB,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAChB,MAAA,IAAI,KAAK,WAAW,CAAA,IAAK,KAAK,WAAW,CAAA,CAAE,SAAS,CAAA,EAAG;AACrD,QAAA,QAAA,CAAS,IAAA,CAAK,WAAW,CAAC,CAAA;AAAA,MAC5B;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,QAAA,CAAS,IAAI,CAAA;AACb,EAAA,OAAO,MAAA;AACT;AAQO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,IAAA,EAAc,QAAA,KAA0B;AAC5E,EAAA,MAAM,KAAA,GAAA,CAAS,OAAO,CAAA,IAAK,QAAA;AAC3B,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO,KAAA,GAAQ,QAAQ,CAAA;AAC1C;AAQO,IAAM,iBAAA,GAAoB,CAAC,KAAA,EAAe,IAAA,EAAc,QAAA,KAAqB;AAClF,EAAA,MAAM,UAAA,GAAa,IAAA,CAAK,IAAA,CAAK,KAAA,GAAQ,QAAQ,CAAA;AAC7C,EAAA,MAAM,UAAA,GAAA,CAAc,OAAO,CAAA,IAAK,QAAA;AAChC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,UAAA,GAAa,UAAU,KAAK,CAAA;AAEtD,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,IAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,UAAA;AAAA,IACA,QAAA;AAAA,IACA,SAAS,IAAA,GAAO,UAAA;AAAA,IAChB,SAAS,IAAA,GAAO;AAAA,GAClB;AACF","file":"array.cjs","sourcesContent":["/**\n * 数组工具模块\n * 基于 es-toolkit 封装，提供常用的数组处理功能\n */\n\nimport {\n  chunk,\n  compact,\n  difference,\n  intersection,\n  uniq,\n  uniqBy,\n  groupBy,\n  sortBy,\n  sample,\n  sum,\n  flatten,\n  flattenDeep,\n  head,\n  last,\n  isEqual,\n  omit,\n} from 'es-toolkit'\n\n// 直接导出 es-toolkit 的常用方法\nexport {\n  chunk,\n  compact,\n  difference,\n  intersection,\n  uniq,\n  uniqBy,\n  groupBy,\n  sortBy,\n  sample,\n  sum,\n  flatten,\n  flattenDeep,\n  head,\n  last,\n  isEqual,\n  omit,\n}\n\n/**\n * 数组去重（支持对象数组的去重）\n * @param arr 数组\n * @param key 对象数组的去重键值\n */\nexport const unique = <T>(arr: T[], key?: keyof T): T[] => {\n  if (key) {\n    return uniqBy(arr, item => item[key] as any)\n  }\n  return uniq(arr)\n}\n\n/**\n * 获取数组最小值\n * @param arr 数组\n */\nexport const min = (arr: number[]): number | undefined => {\n  if (arr.length === 0) return undefined\n  return Math.min(...arr)\n}\n\n/**\n * 获取数组最大值\n * @param arr 数组\n */\nexport const max = (arr: number[]): number | undefined => {\n  if (arr.length === 0) return undefined\n  return Math.max(...arr)\n}\n\n/**\n * 判断数组是否为空\n * @param arr 数组\n */\nexport const isEmpty = <T>(arr: T[]): boolean => {\n  return arr.length === 0\n}\n\n/**\n * 数组分割\n * @param arr 数组\n * @param size 每组大小\n */\nexport const split = <T>(arr: T[], size: number): T[][] => {\n  const result: T[][] = []\n  for (let i = 0; i < arr.length; i += size) {\n    result.push(arr.slice(i, i + size))\n  }\n  return result\n}\n\n/**\n * 数组乱序\n * @param arr 数组\n */\nexport const shuffle = <T>(arr: T[]): T[] => {\n  const result = [...arr]\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1))\n    ;[result[i], result[j]] = [result[j], result[i]]\n  }\n  return result\n}\n\n/**\n * 查找元素的索引\n * @param arr 数组\n * @param predicate 查找条件\n */\nexport const findIndex = <T>(arr: T[], predicate: (item: T, index: number) => boolean): number => {\n  return arr.findIndex(predicate)\n}\n\n/**\n * 查找元素\n * @param arr 数组\n * @param predicate 查找条件\n */\nexport const find = <T>(\n  arr: T[],\n  predicate: (item: T, index: number) => boolean\n): T | undefined => {\n  return arr.find(predicate)\n}\n\n/**\n * 过滤数组\n * @param arr 数组\n * @param predicate 过滤条件\n */\nexport const filter = <T>(arr: T[], predicate: (item: T, index: number) => boolean): T[] => {\n  return arr.filter(predicate)\n}\n\n/**\n * 映射数组\n * @param arr 数组\n * @param mapper 映射函数\n */\nexport const map = <T, R>(arr: T[], mapper: (item: T, index: number) => R): R[] => {\n  return arr.map(mapper)\n}\n\n/**\n * 数组求和\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const reduceSum = <T>(arr: T[], mapper?: (item: T) => number): number => {\n  if (mapper) {\n    return arr.reduce((acc, item) => acc + mapper(item), 0)\n  }\n  return (arr as number[]).reduce((acc, item) => acc + item, 0)\n}\n\n/**\n * 数组求平均值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const average = <T>(arr: T[], mapper?: (item: T) => number): number => {\n  if (arr.length === 0) return 0\n  if (mapper) {\n    const sum = arr.reduce((acc, item) => acc + mapper(item), 0)\n    return sum / arr.length\n  }\n  return (arr as number[]).reduce((acc, item) => acc + item, 0) / arr.length\n}\n\n/**\n * 数组最大值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const maxValue = <T>(arr: T[], mapper?: (item: T) => number): number | undefined => {\n  if (arr.length === 0) return undefined\n  if (mapper) {\n    return Math.max(...arr.map(mapper))\n  }\n  return Math.max(...(arr as number[]))\n}\n\n/**\n * 数组最小值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const minValue = <T>(arr: T[], mapper?: (item: T) => number): number | undefined => {\n  if (arr.length === 0) return undefined\n  if (mapper) {\n    return Math.min(...arr.map(mapper))\n  }\n  return Math.min(...(arr as number[]))\n}\n\n/**\n * 判断数组是否包含某个元素\n * @param arr 数组\n * @param value 值\n */\nexport const includes = <T>(arr: T[], value: T): boolean => {\n  return arr.includes(value)\n}\n\n/**\n * 数组删除元素\n * @param arr 数组\n * @param value 值\n */\nexport const remove = <T>(arr: T[], value: T): T[] => {\n  return arr.filter(item => item !== value)\n}\n\n/**\n * 数组删除指定索引元素\n * @param arr 数组\n * @param index 索引\n */\nexport const removeAt = <T>(arr: T[], index: number): T[] => {\n  return arr.filter((_, i) => i !== index)\n}\n\n/**\n * 数组插入元素\n * @param arr 数组\n * @param index 索引\n * @param value 值\n */\nexport const insert = <T>(arr: T[], index: number, value: T): T[] => {\n  return [...arr.slice(0, index), value, ...arr.slice(index)]\n}\n\n/**\n * 数组移动元素\n * @param arr 数组\n * @param from 源索引\n * @param to 目标索引\n */\nexport const move = <T>(arr: T[], from: number, to: number): T[] => {\n  const result = [...arr]\n  const [removed] = result.splice(from, 1)\n  result.splice(to, 0, removed)\n  return result\n}\n\n/**\n * 数组转树形结构\n * @param arr 数组\n * @param options 配置\n */\nexport const arrayToTree = <T extends Record<string, any>>(\n  arr: T[],\n  options: {\n    idKey?: string\n    parentIdKey?: string\n    childrenKey?: string\n  } = {}\n): T[] => {\n  const { idKey = 'id', parentIdKey = 'parentId', childrenKey = 'children' } = options\n\n  const map = new Map<any, T>()\n  const roots: T[] = []\n\n  // 创建映射\n  arr.forEach(item => {\n    map.set(item[idKey], { ...item, [childrenKey]: [] })\n  })\n\n  // 构建树\n  map.forEach(item => {\n    const parentId = item[parentIdKey]\n    if (parentId && map.has(parentId)) {\n      const parent = map.get(parentId)\n      if (parent) {\n        ;(parent[childrenKey] as T[]).push(item)\n      }\n    } else {\n      roots.push(item)\n    }\n  })\n\n  return roots\n}\n\n/**\n * 树形结构转数组\n * @param tree 树\n * @param childrenKey 子节点键名\n */\nexport const treeToArray = <T extends Record<string, any>>(\n  tree: T[],\n  childrenKey = 'children'\n): T[] => {\n  const result: T[] = []\n\n  const traverse = (nodes: T[]) => {\n    nodes.forEach(node => {\n      result.push(node)\n      if (node[childrenKey] && node[childrenKey].length > 0) {\n        traverse(node[childrenKey])\n      }\n    })\n  }\n\n  traverse(tree)\n  return result\n}\n\n/**\n * 数组分页\n * @param arr 数组\n * @param page 页码（从1开始）\n * @param pageSize 每页数量\n */\nexport const paginate = <T>(arr: T[], page: number, pageSize: number): T[] => {\n  const start = (page - 1) * pageSize\n  return arr.slice(start, start + pageSize)\n}\n\n/**\n * 获取分页信息\n * @param total 总数\n * @param page 页码（从1开始）\n * @param pageSize 每页数量\n */\nexport const getPaginationInfo = (total: number, page: number, pageSize: number) => {\n  const totalPages = Math.ceil(total / pageSize)\n  const startIndex = (page - 1) * pageSize\n  const endIndex = Math.min(startIndex + pageSize, total)\n\n  return {\n    total,\n    page,\n    pageSize,\n    totalPages,\n    startIndex,\n    endIndex,\n    hasNext: page < totalPages,\n    hasPrev: page > 1,\n  }\n}\n"]}

package/dist/array.d.cts

@@ -0,0 +1,2 @@
+export { chunk, compact, difference, flatten, flattenDeep, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
+export { a as arrayToTree, b as average, f as filter, c as find, d as findIndex, g as getPaginationInfo, e as includes, h as insert, j as isEmpty, m as map, k as max, l as maxValue, n as min, o as minValue, p as move, q as paginate, r as reduceSum, s as remove, t as removeAt, u as shuffle, v as split, w as treeToArray, x as unique } from './index-BoqNpwNa.cjs';

package/dist/array.d.ts

@@ -0,0 +1,2 @@
+export { chunk, compact, difference, flatten, flattenDeep, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
+export { a as arrayToTree, b as average, f as filter, c as find, d as findIndex, g as getPaginationInfo, e as includes, h as insert, j as isEmpty, m as map, k as max, l as maxValue, n as min, o as minValue, p as move, q as paginate, r as reduceSum, s as remove, t as removeAt, u as shuffle, v as split, w as treeToArray, x as unique } from './index-BoqNpwNa.js';

package/dist/array.js

@@ -0,0 +1,150 @@
+import { uniqBy, uniq } from 'es-toolkit';
+export { chunk, compact, difference, flatten, flattenDeep, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
+
+// src/modules/array/index.ts
+var unique = (arr, key) => {
+  if (key) {
+    return uniqBy(arr, (item) => item[key]);
+  }
+  return uniq(arr);
+};
+var min = (arr) => {
+  if (arr.length === 0) return void 0;
+  return Math.min(...arr);
+};
+var max = (arr) => {
+  if (arr.length === 0) return void 0;
+  return Math.max(...arr);
+};
+var isEmpty = (arr) => {
+  return arr.length === 0;
+};
+var split = (arr, size) => {
+  const result = [];
+  for (let i = 0; i < arr.length; i += size) {
+    result.push(arr.slice(i, i + size));
+  }
+  return result;
+};
+var 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;
+};
+var findIndex = (arr, predicate) => {
+  return arr.findIndex(predicate);
+};
+var find = (arr, predicate) => {
+  return arr.find(predicate);
+};
+var filter = (arr, predicate) => {
+  return arr.filter(predicate);
+};
+var map = (arr, mapper) => {
+  return arr.map(mapper);
+};
+var reduceSum = (arr, mapper) => {
+  if (mapper) {
+    return arr.reduce((acc, item) => acc + mapper(item), 0);
+  }
+  return arr.reduce((acc, item) => acc + item, 0);
+};
+var average = (arr, mapper) => {
+  if (arr.length === 0) return 0;
+  if (mapper) {
+    const sum2 = arr.reduce((acc, item) => acc + mapper(item), 0);
+    return sum2 / arr.length;
+  }
+  return arr.reduce((acc, item) => acc + item, 0) / arr.length;
+};
+var maxValue = (arr, mapper) => {
+  if (arr.length === 0) return void 0;
+  if (mapper) {
+    return Math.max(...arr.map(mapper));
+  }
+  return Math.max(...arr);
+};
+var minValue = (arr, mapper) => {
+  if (arr.length === 0) return void 0;
+  if (mapper) {
+    return Math.min(...arr.map(mapper));
+  }
+  return Math.min(...arr);
+};
+var includes = (arr, value) => {
+  return arr.includes(value);
+};
+var remove = (arr, value) => {
+  return arr.filter((item) => item !== value);
+};
+var removeAt = (arr, index) => {
+  return arr.filter((_, i) => i !== index);
+};
+var insert = (arr, index, value) => {
+  return [...arr.slice(0, index), value, ...arr.slice(index)];
+};
+var move = (arr, from, to) => {
+  const result = [...arr];
+  const [removed] = result.splice(from, 1);
+  result.splice(to, 0, removed);
+  return result;
+};
+var arrayToTree = (arr, options = {}) => {
+  const { idKey = "id", parentIdKey = "parentId", childrenKey = "children" } = options;
+  const map2 = /* @__PURE__ */ new Map();
+  const roots = [];
+  arr.forEach((item) => {
+    map2.set(item[idKey], { ...item, [childrenKey]: [] });
+  });
+  map2.forEach((item) => {
+    const parentId = item[parentIdKey];
+    if (parentId && map2.has(parentId)) {
+      const parent = map2.get(parentId);
+      if (parent) {
+        parent[childrenKey].push(item);
+      }
+    } else {
+      roots.push(item);
+    }
+  });
+  return roots;
+};
+var treeToArray = (tree, childrenKey = "children") => {
+  const result = [];
+  const traverse = (nodes) => {
+    nodes.forEach((node) => {
+      result.push(node);
+      if (node[childrenKey] && node[childrenKey].length > 0) {
+        traverse(node[childrenKey]);
+      }
+    });
+  };
+  traverse(tree);
+  return result;
+};
+var paginate = (arr, page, pageSize) => {
+  const start = (page - 1) * pageSize;
+  return arr.slice(start, start + pageSize);
+};
+var getPaginationInfo = (total, page, pageSize) => {
+  const totalPages = Math.ceil(total / pageSize);
+  const startIndex = (page - 1) * pageSize;
+  const endIndex = Math.min(startIndex + pageSize, total);
+  return {
+    total,
+    page,
+    pageSize,
+    totalPages,
+    startIndex,
+    endIndex,
+    hasNext: page < totalPages,
+    hasPrev: page > 1
+  };
+};
+
+export { arrayToTree, average, filter, find, findIndex, getPaginationInfo, includes, insert, isEmpty, map, max, maxValue, min, minValue, move, paginate, reduceSum, remove, removeAt, shuffle, split, treeToArray, unique };
+//# sourceMappingURL=array.js.map
+//# sourceMappingURL=array.js.map

package/dist/array.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/modules/array/index.ts"],"names":["sum","map"],"mappings":";;;;AAiDO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,GAAA,KAAuB;AACzD,EAAA,IAAI,GAAA,EAAK;AACP,IAAA,OAAO,MAAA,CAAO,GAAA,EAAK,CAAA,IAAA,KAAQ,IAAA,CAAK,GAAG,CAAQ,CAAA;AAAA,EAC7C;AACA,EAAA,OAAO,KAAK,GAAG,CAAA;AACjB;AAMO,IAAM,GAAA,GAAM,CAAC,GAAA,KAAsC;AACxD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,GAAG,CAAA;AACxB;AAMO,IAAM,GAAA,GAAM,CAAC,GAAA,KAAsC;AACxD,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,GAAG,CAAA;AACxB;AAMO,IAAM,OAAA,GAAU,CAAI,GAAA,KAAsB;AAC/C,EAAA,OAAO,IAAI,MAAA,KAAW,CAAA;AACxB;AAOO,IAAM,KAAA,GAAQ,CAAI,GAAA,EAAU,IAAA,KAAwB;AACzD,EAAA,MAAM,SAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,EAAQ,KAAK,IAAA,EAAM;AACzC,IAAA,MAAA,CAAO,KAAK,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,IAAI,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,MAAA;AACT;AAMO,IAAM,OAAA,GAAU,CAAI,GAAA,KAAkB;AAC3C,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,GAAG,CAAA;AACtB,EAAA,KAAA,IAAS,IAAI,MAAA,CAAO,MAAA,GAAS,CAAA,EAAG,CAAA,GAAI,GAAG,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,IAAK,IAAI,CAAA,CAAE,CAAA;AAC3C,IAAA,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA,GAAI,CAAC,MAAA,CAAO,CAAC,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AAAA,EACjD;AACA,EAAA,OAAO,MAAA;AACT;AAOO,IAAM,SAAA,GAAY,CAAI,GAAA,EAAU,SAAA,KAA2D;AAChG,EAAA,OAAO,GAAA,CAAI,UAAU,SAAS,CAAA;AAChC;AAOO,IAAM,IAAA,GAAO,CAClB,GAAA,EACA,SAAA,KACkB;AAClB,EAAA,OAAO,GAAA,CAAI,KAAK,SAAS,CAAA;AAC3B;AAOO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,SAAA,KAAwD;AAC1F,EAAA,OAAO,GAAA,CAAI,OAAO,SAAS,CAAA;AAC7B;AAOO,IAAM,GAAA,GAAM,CAAO,GAAA,EAAU,MAAA,KAA+C;AACjF,EAAA,OAAO,GAAA,CAAI,IAAI,MAAM,CAAA;AACvB;AAOO,IAAM,SAAA,GAAY,CAAI,GAAA,EAAU,MAAA,KAAyC;AAC9E,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,GAAA,CAAI,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,MAAA,CAAO,IAAI,CAAA,EAAG,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,OAAQ,IAAiB,MAAA,CAAO,CAAC,KAAK,IAAA,KAAS,GAAA,GAAM,MAAM,CAAC,CAAA;AAC9D;AAOO,IAAM,OAAA,GAAU,CAAI,GAAA,EAAU,MAAA,KAAyC;AAC5E,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,MAAMA,IAAAA,GAAM,GAAA,CAAI,MAAA,CAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,MAAA,CAAO,IAAI,CAAA,EAAG,CAAC,CAAA;AAC3D,IAAA,OAAOA,OAAM,GAAA,CAAI,MAAA;AAAA,EACnB;AACA,EAAA,OAAQ,GAAA,CAAiB,OAAO,CAAC,GAAA,EAAK,SAAS,GAAA,GAAM,IAAA,EAAM,CAAC,CAAA,GAAI,GAAA,CAAI,MAAA;AACtE;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,MAAA,KAAqD;AACzF,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,KAAK,GAAA,CAAI,GAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAI,GAAgB,CAAA;AACtC;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,MAAA,KAAqD;AACzF,EAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,MAAA;AAC7B,EAAA,IAAI,MAAA,EAAQ;AACV,IAAA,OAAO,KAAK,GAAA,CAAI,GAAG,GAAA,CAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAI,GAAgB,CAAA;AACtC;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,KAAA,KAAsB;AAC1D,EAAA,OAAO,GAAA,CAAI,SAAS,KAAK,CAAA;AAC3B;AAOO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,KAAA,KAAkB;AACpD,EAAA,OAAO,GAAA,CAAI,MAAA,CAAO,CAAA,IAAA,KAAQ,IAAA,KAAS,KAAK,CAAA;AAC1C;AAOO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,KAAA,KAAuB;AAC3D,EAAA,OAAO,IAAI,MAAA,CAAO,CAAC,CAAA,EAAG,CAAA,KAAM,MAAM,KAAK,CAAA;AACzC;AAQO,IAAM,MAAA,GAAS,CAAI,GAAA,EAAU,KAAA,EAAe,KAAA,KAAkB;AACnE,EAAA,OAAO,CAAC,GAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,KAAK,CAAA,EAAG,KAAA,EAAO,GAAG,GAAA,CAAI,KAAA,CAAM,KAAK,CAAC,CAAA;AAC5D;AAQO,IAAM,IAAA,GAAO,CAAI,GAAA,EAAU,IAAA,EAAc,EAAA,KAAoB;AAClE,EAAA,MAAM,MAAA,GAAS,CAAC,GAAG,GAAG,CAAA;AACtB,EAAA,MAAM,CAAC,OAAO,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACvC,EAAA,MAAA,CAAO,MAAA,CAAO,EAAA,EAAI,CAAA,EAAG,OAAO,CAAA;AAC5B,EAAA,OAAO,MAAA;AACT;AAOO,IAAM,WAAA,GAAc,CACzB,GAAA,EACA,OAAA,GAII,EAAC,KACG;AACR,EAAA,MAAM,EAAE,KAAA,GAAQ,IAAA,EAAM,cAAc,UAAA,EAAY,WAAA,GAAc,YAAW,GAAI,OAAA;AAE7E,EAAA,MAAMC,IAAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,MAAM,QAAa,EAAC;AAGpB,EAAA,GAAA,CAAI,QAAQ,CAAA,IAAA,KAAQ;AAClB,IAAAA,IAAAA,CAAI,GAAA,CAAI,IAAA,CAAK,KAAK,CAAA,EAAG,EAAE,GAAG,IAAA,EAAM,CAAC,WAAW,GAAG,IAAI,CAAA;AAAA,EACrD,CAAC,CAAA;AAGD,EAAAA,IAAAA,CAAI,QAAQ,CAAA,IAAA,KAAQ;AAClB,IAAA,MAAM,QAAA,GAAW,KAAK,WAAW,CAAA;AACjC,IAAA,IAAI,QAAA,IAAYA,IAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA,EAAG;AACjC,MAAA,MAAM,MAAA,GAASA,IAAAA,CAAI,GAAA,CAAI,QAAQ,CAAA;AAC/B,MAAA,IAAI,MAAA,EAAQ;AACT,QAAC,MAAA,CAAO,WAAW,CAAA,CAAU,IAAA,CAAK,IAAI,CAAA;AAAA,MACzC;AAAA,IACF,CAAA,MAAO;AACL,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB;AAAA,EACF,CAAC,CAAA;AAED,EAAA,OAAO,KAAA;AACT;AAOO,IAAM,WAAA,GAAc,CACzB,IAAA,EACA,WAAA,GAAc,UAAA,KACN;AACR,EAAA,MAAM,SAAc,EAAC;AAErB,EAAA,MAAM,QAAA,GAAW,CAAC,KAAA,KAAe;AAC/B,IAAA,KAAA,CAAM,QAAQ,CAAA,IAAA,KAAQ;AACpB,MAAA,MAAA,CAAO,KAAK,IAAI,CAAA;AAChB,MAAA,IAAI,KAAK,WAAW,CAAA,IAAK,KAAK,WAAW,CAAA,CAAE,SAAS,CAAA,EAAG;AACrD,QAAA,QAAA,CAAS,IAAA,CAAK,WAAW,CAAC,CAAA;AAAA,MAC5B;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAA;AAEA,EAAA,QAAA,CAAS,IAAI,CAAA;AACb,EAAA,OAAO,MAAA;AACT;AAQO,IAAM,QAAA,GAAW,CAAI,GAAA,EAAU,IAAA,EAAc,QAAA,KAA0B;AAC5E,EAAA,MAAM,KAAA,GAAA,CAAS,OAAO,CAAA,IAAK,QAAA;AAC3B,EAAA,OAAO,GAAA,CAAI,KAAA,CAAM,KAAA,EAAO,KAAA,GAAQ,QAAQ,CAAA;AAC1C;AAQO,IAAM,iBAAA,GAAoB,CAAC,KAAA,EAAe,IAAA,EAAc,QAAA,KAAqB;AAClF,EAAA,MAAM,UAAA,GAAa,IAAA,CAAK,IAAA,CAAK,KAAA,GAAQ,QAAQ,CAAA;AAC7C,EAAA,MAAM,UAAA,GAAA,CAAc,OAAO,CAAA,IAAK,QAAA;AAChC,EAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,UAAA,GAAa,UAAU,KAAK,CAAA;AAEtD,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,IAAA;AAAA,IACA,QAAA;AAAA,IACA,UAAA;AAAA,IACA,UAAA;AAAA,IACA,QAAA;AAAA,IACA,SAAS,IAAA,GAAO,UAAA;AAAA,IAChB,SAAS,IAAA,GAAO;AAAA,GAClB;AACF","file":"array.js","sourcesContent":["/**\n * 数组工具模块\n * 基于 es-toolkit 封装，提供常用的数组处理功能\n */\n\nimport {\n  chunk,\n  compact,\n  difference,\n  intersection,\n  uniq,\n  uniqBy,\n  groupBy,\n  sortBy,\n  sample,\n  sum,\n  flatten,\n  flattenDeep,\n  head,\n  last,\n  isEqual,\n  omit,\n} from 'es-toolkit'\n\n// 直接导出 es-toolkit 的常用方法\nexport {\n  chunk,\n  compact,\n  difference,\n  intersection,\n  uniq,\n  uniqBy,\n  groupBy,\n  sortBy,\n  sample,\n  sum,\n  flatten,\n  flattenDeep,\n  head,\n  last,\n  isEqual,\n  omit,\n}\n\n/**\n * 数组去重（支持对象数组的去重）\n * @param arr 数组\n * @param key 对象数组的去重键值\n */\nexport const unique = <T>(arr: T[], key?: keyof T): T[] => {\n  if (key) {\n    return uniqBy(arr, item => item[key] as any)\n  }\n  return uniq(arr)\n}\n\n/**\n * 获取数组最小值\n * @param arr 数组\n */\nexport const min = (arr: number[]): number | undefined => {\n  if (arr.length === 0) return undefined\n  return Math.min(...arr)\n}\n\n/**\n * 获取数组最大值\n * @param arr 数组\n */\nexport const max = (arr: number[]): number | undefined => {\n  if (arr.length === 0) return undefined\n  return Math.max(...arr)\n}\n\n/**\n * 判断数组是否为空\n * @param arr 数组\n */\nexport const isEmpty = <T>(arr: T[]): boolean => {\n  return arr.length === 0\n}\n\n/**\n * 数组分割\n * @param arr 数组\n * @param size 每组大小\n */\nexport const split = <T>(arr: T[], size: number): T[][] => {\n  const result: T[][] = []\n  for (let i = 0; i < arr.length; i += size) {\n    result.push(arr.slice(i, i + size))\n  }\n  return result\n}\n\n/**\n * 数组乱序\n * @param arr 数组\n */\nexport const shuffle = <T>(arr: T[]): T[] => {\n  const result = [...arr]\n  for (let i = result.length - 1; i > 0; i--) {\n    const j = Math.floor(Math.random() * (i + 1))\n    ;[result[i], result[j]] = [result[j], result[i]]\n  }\n  return result\n}\n\n/**\n * 查找元素的索引\n * @param arr 数组\n * @param predicate 查找条件\n */\nexport const findIndex = <T>(arr: T[], predicate: (item: T, index: number) => boolean): number => {\n  return arr.findIndex(predicate)\n}\n\n/**\n * 查找元素\n * @param arr 数组\n * @param predicate 查找条件\n */\nexport const find = <T>(\n  arr: T[],\n  predicate: (item: T, index: number) => boolean\n): T | undefined => {\n  return arr.find(predicate)\n}\n\n/**\n * 过滤数组\n * @param arr 数组\n * @param predicate 过滤条件\n */\nexport const filter = <T>(arr: T[], predicate: (item: T, index: number) => boolean): T[] => {\n  return arr.filter(predicate)\n}\n\n/**\n * 映射数组\n * @param arr 数组\n * @param mapper 映射函数\n */\nexport const map = <T, R>(arr: T[], mapper: (item: T, index: number) => R): R[] => {\n  return arr.map(mapper)\n}\n\n/**\n * 数组求和\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const reduceSum = <T>(arr: T[], mapper?: (item: T) => number): number => {\n  if (mapper) {\n    return arr.reduce((acc, item) => acc + mapper(item), 0)\n  }\n  return (arr as number[]).reduce((acc, item) => acc + item, 0)\n}\n\n/**\n * 数组求平均值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const average = <T>(arr: T[], mapper?: (item: T) => number): number => {\n  if (arr.length === 0) return 0\n  if (mapper) {\n    const sum = arr.reduce((acc, item) => acc + mapper(item), 0)\n    return sum / arr.length\n  }\n  return (arr as number[]).reduce((acc, item) => acc + item, 0) / arr.length\n}\n\n/**\n * 数组最大值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const maxValue = <T>(arr: T[], mapper?: (item: T) => number): number | undefined => {\n  if (arr.length === 0) return undefined\n  if (mapper) {\n    return Math.max(...arr.map(mapper))\n  }\n  return Math.max(...(arr as number[]))\n}\n\n/**\n * 数组最小值\n * @param arr 数组\n * @param mapper 转换函数\n */\nexport const minValue = <T>(arr: T[], mapper?: (item: T) => number): number | undefined => {\n  if (arr.length === 0) return undefined\n  if (mapper) {\n    return Math.min(...arr.map(mapper))\n  }\n  return Math.min(...(arr as number[]))\n}\n\n/**\n * 判断数组是否包含某个元素\n * @param arr 数组\n * @param value 值\n */\nexport const includes = <T>(arr: T[], value: T): boolean => {\n  return arr.includes(value)\n}\n\n/**\n * 数组删除元素\n * @param arr 数组\n * @param value 值\n */\nexport const remove = <T>(arr: T[], value: T): T[] => {\n  return arr.filter(item => item !== value)\n}\n\n/**\n * 数组删除指定索引元素\n * @param arr 数组\n * @param index 索引\n */\nexport const removeAt = <T>(arr: T[], index: number): T[] => {\n  return arr.filter((_, i) => i !== index)\n}\n\n/**\n * 数组插入元素\n * @param arr 数组\n * @param index 索引\n * @param value 值\n */\nexport const insert = <T>(arr: T[], index: number, value: T): T[] => {\n  return [...arr.slice(0, index), value, ...arr.slice(index)]\n}\n\n/**\n * 数组移动元素\n * @param arr 数组\n * @param from 源索引\n * @param to 目标索引\n */\nexport const move = <T>(arr: T[], from: number, to: number): T[] => {\n  const result = [...arr]\n  const [removed] = result.splice(from, 1)\n  result.splice(to, 0, removed)\n  return result\n}\n\n/**\n * 数组转树形结构\n * @param arr 数组\n * @param options 配置\n */\nexport const arrayToTree = <T extends Record<string, any>>(\n  arr: T[],\n  options: {\n    idKey?: string\n    parentIdKey?: string\n    childrenKey?: string\n  } = {}\n): T[] => {\n  const { idKey = 'id', parentIdKey = 'parentId', childrenKey = 'children' } = options\n\n  const map = new Map<any, T>()\n  const roots: T[] = []\n\n  // 创建映射\n  arr.forEach(item => {\n    map.set(item[idKey], { ...item, [childrenKey]: [] })\n  })\n\n  // 构建树\n  map.forEach(item => {\n    const parentId = item[parentIdKey]\n    if (parentId && map.has(parentId)) {\n      const parent = map.get(parentId)\n      if (parent) {\n        ;(parent[childrenKey] as T[]).push(item)\n      }\n    } else {\n      roots.push(item)\n    }\n  })\n\n  return roots\n}\n\n/**\n * 树形结构转数组\n * @param tree 树\n * @param childrenKey 子节点键名\n */\nexport const treeToArray = <T extends Record<string, any>>(\n  tree: T[],\n  childrenKey = 'children'\n): T[] => {\n  const result: T[] = []\n\n  const traverse = (nodes: T[]) => {\n    nodes.forEach(node => {\n      result.push(node)\n      if (node[childrenKey] && node[childrenKey].length > 0) {\n        traverse(node[childrenKey])\n      }\n    })\n  }\n\n  traverse(tree)\n  return result\n}\n\n/**\n * 数组分页\n * @param arr 数组\n * @param page 页码（从1开始）\n * @param pageSize 每页数量\n */\nexport const paginate = <T>(arr: T[], page: number, pageSize: number): T[] => {\n  const start = (page - 1) * pageSize\n  return arr.slice(start, start + pageSize)\n}\n\n/**\n * 获取分页信息\n * @param total 总数\n * @param page 页码（从1开始）\n * @param pageSize 每页数量\n */\nexport const getPaginationInfo = (total: number, page: number, pageSize: number) => {\n  const totalPages = Math.ceil(total / pageSize)\n  const startIndex = (page - 1) * pageSize\n  const endIndex = Math.min(startIndex + pageSize, total)\n\n  return {\n    total,\n    page,\n    pageSize,\n    totalPages,\n    startIndex,\n    endIndex,\n    hasNext: page < totalPages,\n    hasPrev: page > 1,\n  }\n}\n"]}

package/dist/crypto.cjs

@@ -0,0 +1,193 @@
+'use strict';
+
+var CryptoJS = require('crypto-js');
+
+function _interopNamespace(e) {
+  if (e && e.__esModule) return e;
+  var n = Object.create(null);
+  if (e) {
+    Object.keys(e).forEach(function (k) {
+      if (k !== 'default') {
+        var d = Object.getOwnPropertyDescriptor(e, k);
+        Object.defineProperty(n, k, d.get ? d : {
+          enumerable: true,
+          get: function () { return e[k]; }
+        });
+      }
+    });
+  }
+  n.default = e;
+  return Object.freeze(n);
+}
+
+var CryptoJS__namespace = /*#__PURE__*/_interopNamespace(CryptoJS);
+
+// src/modules/crypto/index.ts
+var md5 = (message) => {
+  return CryptoJS__namespace.MD5(message).toString();
+};
+var sha1 = (message) => {
+  return CryptoJS__namespace.SHA1(message).toString();
+};
+var sha256 = (message) => {
+  return CryptoJS__namespace.SHA256(message).toString();
+};
+var sha512 = (message) => {
+  return CryptoJS__namespace.SHA512(message).toString();
+};
+var hmacMD5 = (message, key) => {
+  return CryptoJS__namespace.HmacMD5(message, key).toString();
+};
+var hmacSHA1 = (message, key) => {
+  return CryptoJS__namespace.HmacSHA1(message, key).toString();
+};
+var hmacSHA256 = (message, key) => {
+  return CryptoJS__namespace.HmacSHA256(message, key).toString();
+};
+var hmacSHA512 = (message, key) => {
+  return CryptoJS__namespace.HmacSHA512(message, key).toString();
+};
+var aesEncrypt = (message, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const encrypted = CryptoJS__namespace.AES.encrypt(message, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return encrypted.toString();
+};
+var aesDecrypt = (ciphertext, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const decrypted = CryptoJS__namespace.AES.decrypt(ciphertext, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return decrypted.toString(CryptoJS__namespace.enc.Utf8);
+};
+var desEncrypt = (message, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const encrypted = CryptoJS__namespace.DES.encrypt(message, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return encrypted.toString();
+};
+var desDecrypt = (ciphertext, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const decrypted = CryptoJS__namespace.DES.decrypt(ciphertext, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return decrypted.toString(CryptoJS__namespace.enc.Utf8);
+};
+var tripleDesEncrypt = (message, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const encrypted = CryptoJS__namespace.TripleDES.encrypt(message, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return encrypted.toString();
+};
+var tripleDesDecrypt = (ciphertext, key, iv, mode2 = CryptoJS__namespace.mode.CBC, padding = CryptoJS__namespace.pad.Pkcs7) => {
+  const keyWord = CryptoJS__namespace.enc.Utf8.parse(key);
+  const ivWord = iv ? CryptoJS__namespace.enc.Utf8.parse(iv) : void 0;
+  const decrypted = CryptoJS__namespace.TripleDES.decrypt(ciphertext, keyWord, {
+    iv: ivWord,
+    mode: mode2,
+    padding
+  });
+  return decrypted.toString(CryptoJS__namespace.enc.Utf8);
+};
+var rc4Encrypt = (message, key) => {
+  const encrypted = CryptoJS__namespace.RC4.encrypt(message, key);
+  return encrypted.toString();
+};
+var rc4Decrypt = (ciphertext, key) => {
+  const decrypted = CryptoJS__namespace.RC4.decrypt(ciphertext, key);
+  return decrypted.toString(CryptoJS__namespace.enc.Utf8);
+};
+var rabbitEncrypt = (message, key) => {
+  const encrypted = CryptoJS__namespace.Rabbit.encrypt(message, key);
+  return encrypted.toString();
+};
+var rabbitDecrypt = (ciphertext, key) => {
+  const decrypted = CryptoJS__namespace.Rabbit.decrypt(ciphertext, key);
+  return decrypted.toString(CryptoJS__namespace.enc.Utf8);
+};
+var base64Encode = (message) => {
+  return CryptoJS__namespace.enc.Base64.stringify(CryptoJS__namespace.enc.Utf8.parse(message));
+};
+var base64Decode = (encoded) => {
+  return CryptoJS__namespace.enc.Base64.parse(encoded).toString(CryptoJS__namespace.enc.Utf8);
+};
+var utf8Encode = (message) => {
+  return CryptoJS__namespace.enc.Utf8.stringify(CryptoJS__namespace.enc.Utf8.parse(message));
+};
+var utf8Decode = (encoded) => {
+  return CryptoJS__namespace.enc.Utf8.parse(encoded).toString(CryptoJS__namespace.enc.Utf8);
+};
+var hexEncode = (message) => {
+  return CryptoJS__namespace.enc.Hex.stringify(CryptoJS__namespace.enc.Utf8.parse(message));
+};
+var hexDecode = (encoded) => {
+  return CryptoJS__namespace.enc.Hex.parse(encoded).toString(CryptoJS__namespace.enc.Utf8);
+};
+var generateKey = (length = 32) => {
+  const key = CryptoJS__namespace.lib.WordArray.random(length);
+  return CryptoJS__namespace.enc.Base64.stringify(key);
+};
+var generateIV = (length = 16) => {
+  const iv = CryptoJS__namespace.lib.WordArray.random(length);
+  return CryptoJS__namespace.enc.Base64.stringify(iv);
+};
+var pbkdf2 = (password, salt, iterations = 1e3, keySize = 32) => {
+  const key = CryptoJS__namespace.PBKDF2(password, salt, {
+    keySize: keySize / 4,
+    iterations
+  });
+  return key.toString();
+};
+var uuid = () => {
+  return CryptoJS__namespace.lib.WordArray.random(16).toString();
+};
+
+exports.CryptoJS = CryptoJS__namespace;
+exports.aesDecrypt = aesDecrypt;
+exports.aesEncrypt = aesEncrypt;
+exports.base64Decode = base64Decode;
+exports.base64Encode = base64Encode;
+exports.desDecrypt = desDecrypt;
+exports.desEncrypt = desEncrypt;
+exports.generateIV = generateIV;
+exports.generateKey = generateKey;
+exports.hexDecode = hexDecode;
+exports.hexEncode = hexEncode;
+exports.hmacMD5 = hmacMD5;
+exports.hmacSHA1 = hmacSHA1;
+exports.hmacSHA256 = hmacSHA256;
+exports.hmacSHA512 = hmacSHA512;
+exports.md5 = md5;
+exports.pbkdf2 = pbkdf2;
+exports.rabbitDecrypt = rabbitDecrypt;
+exports.rabbitEncrypt = rabbitEncrypt;
+exports.rc4Decrypt = rc4Decrypt;
+exports.rc4Encrypt = rc4Encrypt;
+exports.sha1 = sha1;
+exports.sha256 = sha256;
+exports.sha512 = sha512;
+exports.tripleDesDecrypt = tripleDesDecrypt;
+exports.tripleDesEncrypt = tripleDesEncrypt;
+exports.utf8Decode = utf8Decode;
+exports.utf8Encode = utf8Encode;
+exports.uuid = uuid;
+//# sourceMappingURL=crypto.cjs.map
+//# sourceMappingURL=crypto.cjs.map