minutool 1.0.9 → 1.0.10
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.d.ts +3 -1
- package/dist/minutool.js +12 -8
- package/dist/minutool.js.map +1 -1
- package/dist/minutool.umd.cjs +3 -3
- package/dist/minutool.umd.cjs.map +1 -1
- package/package.json +1 -1
package/dist/index.d.ts
CHANGED
|
@@ -40,11 +40,13 @@ export declare const arrayColumn: <T = any>(arr: T[], col_name: keyof T) => any[
|
|
|
40
40
|
/**
|
|
41
41
|
* 数组去重
|
|
42
42
|
* @param {T[]} arr - 源数组
|
|
43
|
+
* @param {function} [payload] - 可选的函数,用于生成唯一键值
|
|
43
44
|
* @returns {T[]} 去重后的数组
|
|
44
45
|
* @example
|
|
45
46
|
* arrayDistinct([1, 2, 2, 3, 3, 3]) // [1, 2, 3]
|
|
47
|
+
* arrayDistinct([{id: 1}, {id: 2}, {id: 1}], item => item.id) // [{id: 1}, {id: 2}]
|
|
46
48
|
*/
|
|
47
|
-
export declare const arrayDistinct: <T = any>(arr: T[]) => T[];
|
|
49
|
+
export declare const arrayDistinct: <T = any>(arr: T[], payload?: (item: T) => any) => T[];
|
|
48
50
|
|
|
49
51
|
/**
|
|
50
52
|
* 按指定键对数组进行分组
|
package/dist/minutool.js
CHANGED
|
@@ -8,11 +8,12 @@ const $t = (t, e) => {
|
|
|
8
8
|
if (t[n] === e)
|
|
9
9
|
return n;
|
|
10
10
|
return null;
|
|
11
|
-
}, qt = (t) => {
|
|
12
|
-
let
|
|
13
|
-
return t.filter((
|
|
14
|
-
|
|
15
|
-
|
|
11
|
+
}, qt = (t, e) => {
|
|
12
|
+
let n = /* @__PURE__ */ new Map();
|
|
13
|
+
return t.filter((i) => {
|
|
14
|
+
let r = e ? e(i) : i;
|
|
15
|
+
if (!n.has(r))
|
|
16
|
+
return n.set(r, !0), !0;
|
|
16
17
|
});
|
|
17
18
|
}, Yt = (t, e, n) => {
|
|
18
19
|
if (!t || !t.length)
|
|
@@ -27,9 +28,12 @@ const $t = (t, e) => {
|
|
|
27
28
|
for (let l in i)
|
|
28
29
|
r[l] = i[l][0];
|
|
29
30
|
return r;
|
|
30
|
-
}, jt = (t) => Object.keys(t).sort().reduce(
|
|
31
|
-
|
|
32
|
-
|
|
31
|
+
}, jt = (t) => Object.keys(t).sort().reduce(
|
|
32
|
+
function(e, n) {
|
|
33
|
+
return e[n] = t[n], e;
|
|
34
|
+
},
|
|
35
|
+
{}
|
|
36
|
+
), Gt = (t, e) => {
|
|
33
37
|
let n = t.length;
|
|
34
38
|
if (e < 1 || !n)
|
|
35
39
|
return [];
|