ly-utils-lib 2.8.0 → 2.9.0

package/README.md

@@ -168,6 +168,8 @@ import {
   average,
   maxValue,
   minValue,
+  forEachAsync,
+  forEachRight,
 } from 'ly-utils-lib/array'
 
 // 数组去重
@@ -209,25 +211,47 @@ const sum = reduceSum(nums) // 15
 const avg = average(nums) // 3
 const max = maxValue(nums) // 5
 const min = minValue(nums) // 1
+
+// 异步遍历
+const users = [{ id: 1 }, { id: 2 }, { id: 3 }]
+await forEachAsync(users, async (user) => {
+  await updateUser(user.id)
+})
+
+// 异步遍历（带并发限制）
+await forEachAsync(
+  items,
+  async (item) => await processItem(item),
+  { concurrency: 2 }
+)
+
+// 从右到左遍历
+const result: number[] = []
+forEachRight([1, 2, 3], (value) => {
+  result.push(value)
+})
+console.log(result) // [3, 2, 1]
 ```
 
 **API 列表:**
 
-| 函数                             | 说明     | 示例                        |
-| -------------------------------- | -------- | --------------------------- |
-| `unique(arr, key?)`              | 数组去重 | `unique([1, 2, 2, 3])`      |
-| `shuffle(arr)`                   | 数组乱序 | `shuffle([1, 2, 3])`        |
-| `chunk(arr, size)`               | 数组分块 | `chunk([1, 2, 3, 4], 2)`    |
-| `groupBy(arr, fn)`               | 数组分组 | `groupBy(arr, x => x.type)` |
-| `arrayToTree(arr, options)`      | 数组转树 | `arrayToTree(data)`         |
-| `treeToArray(tree, childrenKey)` | 树转数组 | `treeToArray(tree)`         |
-| `paginate(arr, page, pageSize)`  | 分页     | `paginate(arr, 1, 10)`      |
-| `reduceSum(arr, mapper)`         | 求和     | `reduceSum([1, 2, 3])`      |
-| `average(arr, mapper)`           | 平均值   | `average([1, 2, 3])`        |
-| `maxValue(arr, mapper)`          | 最大值   | `maxValue([1, 2, 3])`       |
-| `minValue(arr, mapper)`          | 最小值   | `minValue([1, 2, 3])`       |
-| `move(arr, from, to)`            | 移动元素 | `move([1, 2, 3], 0, 2)`     |
-| `split(arr, size)`               | 分割数组 | `split([1, 2, 3, 4], 2)`    |
+| 函数                             | 说明               | 示例                              |
+| -------------------------------- | ------------------ | --------------------------------- |
+| `unique(arr, key?)`              | 数组去重           | `unique([1, 2, 2, 3])`           |
+| `shuffle(arr)`                   | 数组乱序           | `shuffle([1, 2, 3])`             |
+| `chunk(arr, size)`               | 数组分块           | `chunk([1, 2, 3, 4], 2)`         |
+| `groupBy(arr, fn)`               | 数组分组           | `groupBy(arr, x => x.type)`      |
+| `arrayToTree(arr, options)`      | 数组转树           | `arrayToTree(data)`              |
+| `treeToArray(tree, childrenKey)` | 树转数组           | `treeToArray(tree)`              |
+| `paginate(arr, page, pageSize)`  | 分页               | `paginate(arr, 1, 10)`           |
+| `reduceSum(arr, mapper)`         | 求和               | `reduceSum([1, 2, 3])`           |
+| `average(arr, mapper)`           | 平均值             | `average([1, 2, 3])`             |
+| `maxValue(arr, mapper)`          | 最大值             | `maxValue([1, 2, 3])`            |
+| `minValue(arr, mapper)`          | 最小值             | `minValue([1, 2, 3])`            |
+| `move(arr, from, to)`            | 移动元素           | `move([1, 2, 3], 0, 2)`          |
+| `split(arr, size)`               | 分割数组           | `split([1, 2, 3, 4], 2)`         |
+| `forEachAsync(arr, fn, options?)` | 异步遍历数组（支持并发控制） | `await forEachAsync(arr, async fn, { concurrency: 2 })` |
+| `forEachRight(arr, fn)`          | 从右到左遍历数组   | `forEachRight([1, 2, 3], fn)`    |
 
 ### 📝 String Module - 字符串处理
 

package/dist/array.cjs

@@ -166,6 +166,14 @@ Object.defineProperty(exports, "flattenDeep", {
   enumerable: true,
   get: function () { return esToolkit.flattenDeep; }
 });
+Object.defineProperty(exports, "forEachAsync", {
+  enumerable: true,
+  get: function () { return esToolkit.forEachAsync; }
+});
+Object.defineProperty(exports, "forEachRight", {
+  enumerable: true,
+  get: function () { return esToolkit.forEachRight; }
+});
 Object.defineProperty(exports, "groupBy", {
   enumerable: true,
   get: function () { return esToolkit.groupBy; }

package/dist/array.cjs.map

@@ -1 +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"]}
+{"version":3,"sources":["../src/modules/array/index.ts"],"names":["uniqBy","uniq","sum","map"],"mappings":";;;;;AAqDO,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  forEachAsync,\n  forEachRight,\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  forEachAsync,\n  forEachRight,\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

@@ -1,2 +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';
+export { chunk, compact, difference, flatten, flattenDeep, forEachAsync, forEachRight, 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-BexwNzGt.cjs';

package/dist/array.d.ts

@@ -1,2 +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';
+export { chunk, compact, difference, flatten, flattenDeep, forEachAsync, forEachRight, 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-BexwNzGt.js';

package/dist/array.js

@@ -1,5 +1,5 @@
 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';
+export { chunk, compact, difference, flatten, flattenDeep, forEachAsync, forEachRight, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
 
 // src/modules/array/index.ts
 var unique = (arr, key) => {

package/dist/array.js.map

@@ -1 +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"]}
+{"version":3,"sources":["../src/modules/array/index.ts"],"names":["sum","map"],"mappings":";;;;AAqDO,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  forEachAsync,\n  forEachRight,\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  forEachAsync,\n  forEachRight,\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/{index-BoqNpwNa.d.cts → index-BexwNzGt.d.cts}

@@ -1,4 +1,4 @@
-import { chunk, compact, difference, flatten, flattenDeep, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
+import { chunk, compact, difference, flatten, flattenDeep, forEachAsync, forEachRight, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
 
 /**
  * 数组工具模块
@@ -167,6 +167,8 @@ declare const index_find: typeof find;
 declare const index_findIndex: typeof findIndex;
 declare const index_flatten: typeof flatten;
 declare const index_flattenDeep: typeof flattenDeep;
+declare const index_forEachAsync: typeof forEachAsync;
+declare const index_forEachRight: typeof forEachRight;
 declare const index_getPaginationInfo: typeof getPaginationInfo;
 declare const index_groupBy: typeof groupBy;
 declare const index_head: typeof head;
@@ -197,7 +199,7 @@ declare const index_uniq: typeof uniq;
 declare const index_uniqBy: typeof uniqBy;
 declare const index_unique: typeof unique;
 declare namespace index {
-  export { index_arrayToTree as arrayToTree, index_average as average, index_chunk as chunk, index_compact as compact, index_difference as difference, index_filter as filter, index_find as find, index_findIndex as findIndex, index_flatten as flatten, index_flattenDeep as flattenDeep, index_getPaginationInfo as getPaginationInfo, index_groupBy as groupBy, index_head as head, index_includes as includes, index_insert as insert, index_intersection as intersection, index_isEmpty as isEmpty, index_isEqual as isEqual, index_last as last, index_map as map, index_max as max, index_maxValue as maxValue, index_min as min, index_minValue as minValue, index_move as move, index_omit as omit, index_paginate as paginate, index_reduceSum as reduceSum, index_remove as remove, index_removeAt as removeAt, index_sample as sample, index_shuffle as shuffle, index_sortBy as sortBy, index_split as split, index_sum as sum, index_treeToArray as treeToArray, index_uniq as uniq, index_uniqBy as uniqBy, index_unique as unique };
+  export { index_arrayToTree as arrayToTree, index_average as average, index_chunk as chunk, index_compact as compact, index_difference as difference, index_filter as filter, index_find as find, index_findIndex as findIndex, index_flatten as flatten, index_flattenDeep as flattenDeep, index_forEachAsync as forEachAsync, index_forEachRight as forEachRight, index_getPaginationInfo as getPaginationInfo, index_groupBy as groupBy, index_head as head, index_includes as includes, index_insert as insert, index_intersection as intersection, index_isEmpty as isEmpty, index_isEqual as isEqual, index_last as last, index_map as map, index_max as max, index_maxValue as maxValue, index_min as min, index_minValue as minValue, index_move as move, index_omit as omit, index_paginate as paginate, index_reduceSum as reduceSum, index_remove as remove, index_removeAt as removeAt, index_sample as sample, index_shuffle as shuffle, index_sortBy as sortBy, index_split as split, index_sum as sum, index_treeToArray as treeToArray, index_uniq as uniq, index_uniqBy as uniqBy, index_unique as unique };
 }
 
 export { arrayToTree as a, average as b, find as c, findIndex as d, includes as e, filter as f, getPaginationInfo as g, insert as h, index as i, isEmpty as j, max as k, maxValue as l, map as m, min as n, minValue as o, move as p, paginate as q, reduceSum as r, remove as s, removeAt as t, shuffle as u, split as v, treeToArray as w, unique as x };

package/dist/{index-BoqNpwNa.d.ts → index-BexwNzGt.d.ts}

@@ -1,4 +1,4 @@
-import { chunk, compact, difference, flatten, flattenDeep, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
+import { chunk, compact, difference, flatten, flattenDeep, forEachAsync, forEachRight, groupBy, head, intersection, isEqual, last, omit, sample, sortBy, sum, uniq, uniqBy } from 'es-toolkit';
 
 /**
  * 数组工具模块
@@ -167,6 +167,8 @@ declare const index_find: typeof find;
 declare const index_findIndex: typeof findIndex;
 declare const index_flatten: typeof flatten;
 declare const index_flattenDeep: typeof flattenDeep;
+declare const index_forEachAsync: typeof forEachAsync;
+declare const index_forEachRight: typeof forEachRight;
 declare const index_getPaginationInfo: typeof getPaginationInfo;
 declare const index_groupBy: typeof groupBy;
 declare const index_head: typeof head;
@@ -197,7 +199,7 @@ declare const index_uniq: typeof uniq;
 declare const index_uniqBy: typeof uniqBy;
 declare const index_unique: typeof unique;
 declare namespace index {
-  export { index_arrayToTree as arrayToTree, index_average as average, index_chunk as chunk, index_compact as compact, index_difference as difference, index_filter as filter, index_find as find, index_findIndex as findIndex, index_flatten as flatten, index_flattenDeep as flattenDeep, index_getPaginationInfo as getPaginationInfo, index_groupBy as groupBy, index_head as head, index_includes as includes, index_insert as insert, index_intersection as intersection, index_isEmpty as isEmpty, index_isEqual as isEqual, index_last as last, index_map as map, index_max as max, index_maxValue as maxValue, index_min as min, index_minValue as minValue, index_move as move, index_omit as omit, index_paginate as paginate, index_reduceSum as reduceSum, index_remove as remove, index_removeAt as removeAt, index_sample as sample, index_shuffle as shuffle, index_sortBy as sortBy, index_split as split, index_sum as sum, index_treeToArray as treeToArray, index_uniq as uniq, index_uniqBy as uniqBy, index_unique as unique };
+  export { index_arrayToTree as arrayToTree, index_average as average, index_chunk as chunk, index_compact as compact, index_difference as difference, index_filter as filter, index_find as find, index_findIndex as findIndex, index_flatten as flatten, index_flattenDeep as flattenDeep, index_forEachAsync as forEachAsync, index_forEachRight as forEachRight, index_getPaginationInfo as getPaginationInfo, index_groupBy as groupBy, index_head as head, index_includes as includes, index_insert as insert, index_intersection as intersection, index_isEmpty as isEmpty, index_isEqual as isEqual, index_last as last, index_map as map, index_max as max, index_maxValue as maxValue, index_min as min, index_minValue as minValue, index_move as move, index_omit as omit, index_paginate as paginate, index_reduceSum as reduceSum, index_remove as remove, index_removeAt as removeAt, index_sample as sample, index_shuffle as shuffle, index_sortBy as sortBy, index_split as split, index_sum as sum, index_treeToArray as treeToArray, index_uniq as uniq, index_uniqBy as uniqBy, index_unique as unique };
 }
 
 export { arrayToTree as a, average as b, find as c, findIndex as d, includes as e, filter as f, getPaginationInfo as g, insert as h, index as i, isEmpty as j, max as k, maxValue as l, map as m, min as n, minValue as o, move as p, paginate as q, reduceSum as r, remove as s, removeAt as t, shuffle as u, split as v, treeToArray as w, unique as x };

package/dist/index.cjs

@@ -627,6 +627,8 @@ __export(array_exports, {
   findIndex: () => findIndex,
   flatten: () => esToolkit.flatten,
   flattenDeep: () => esToolkit.flattenDeep,
+  forEachAsync: () => esToolkit.forEachAsync,
+  forEachRight: () => esToolkit.forEachRight,
   getPaginationInfo: () => getPaginationInfo,
   groupBy: () => esToolkit.groupBy,
   head: () => esToolkit.head,