@allahjs/utils 1.10.0 → 1.11.0
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/.tsbuildinfo +1 -1
- package/dist/core/arrayUtils/index.cjs +327 -3
- package/dist/core/arrayUtils/index.cjs.map +1 -1
- package/dist/core/arrayUtils/index.d.ts +137 -3
- package/dist/core/constants/asyncTaskScheduleVo.d.ts +1 -1
- package/dist/core/constants/comm.cjs +8 -8
- package/dist/core/constants/comm.cjs.map +1 -1
- package/dist/core/constants/comm.d.ts +4 -4
- package/dist/core/constants/index.cjs +2 -2
- package/dist/core/constants/index.d.ts +1 -1
- package/dist/core/index.d.ts +26 -1
- package/dist/core/pageUtils/index.cjs +21 -1
- package/dist/core/pageUtils/index.cjs.map +1 -1
- package/dist/core/pageUtils/index.d.ts +1 -0
- package/dist/esm/core/arrayUtils/index.d.ts +137 -3
- package/dist/esm/core/arrayUtils/index.js +327 -3
- package/dist/esm/core/arrayUtils/index.js.map +1 -1
- package/dist/esm/core/constants/asyncTaskScheduleVo.d.ts +1 -1
- package/dist/esm/core/constants/comm.d.ts +4 -4
- package/dist/esm/core/constants/comm.js +9 -9
- package/dist/esm/core/constants/comm.js.map +1 -1
- package/dist/esm/core/constants/index.d.ts +1 -1
- package/dist/esm/core/constants/index.js +1 -1
- package/dist/esm/core/index.d.ts +26 -1
- package/dist/esm/core/pageUtils/index.d.ts +1 -0
- package/dist/esm/core/pageUtils/index.js +21 -2
- package/dist/esm/core/pageUtils/index.js.map +1 -1
- package/dist/esm/form/attributes.d.ts +32 -0
- package/dist/esm/form/formItem.d.ts +163 -0
- package/dist/esm/form/index.d.ts +4 -1
- package/dist/esm/form/rule.d.ts +37 -0
- package/dist/esm/form/types.d.ts +12 -213
- package/dist/esm/index.d.ts +6 -2
- package/dist/esm/request/index.d.ts +3 -3
- package/dist/esm/request/index.js.map +1 -1
- package/dist/esm/types/dbData/index.d.ts +83 -0
- package/dist/esm/types/index.d.ts +1 -0
- package/dist/form/attributes.d.ts +32 -0
- package/dist/form/formItem.d.ts +163 -0
- package/dist/form/index.d.ts +4 -1
- package/dist/form/rule.d.ts +37 -0
- package/dist/form/types.d.ts +12 -213
- package/dist/index.d.ts +6 -2
- package/dist/request/index.cjs.map +1 -1
- package/dist/request/index.d.ts +3 -3
- package/dist/types/dbData/index.d.ts +83 -0
- package/dist/types/index.d.ts +1 -0
- package/package.json +13 -5
|
@@ -2,9 +2,6 @@
|
|
|
2
2
|
|
|
3
3
|
Object.defineProperty(exports, '__esModule', { value: true });
|
|
4
4
|
|
|
5
|
-
/**
|
|
6
|
-
* 数组工具函数
|
|
7
|
-
*/
|
|
8
5
|
/**
|
|
9
6
|
* 数组工具对象
|
|
10
7
|
*/
|
|
@@ -102,6 +99,333 @@ const arrayUtils = {
|
|
|
102
99
|
return classList[0][key];
|
|
103
100
|
}
|
|
104
101
|
return null;
|
|
102
|
+
},
|
|
103
|
+
/**
|
|
104
|
+
* 根据指定的字段进行去重
|
|
105
|
+
* @param arr 数组
|
|
106
|
+
* @param key 去重字段
|
|
107
|
+
*/
|
|
108
|
+
uniqueBy: (arr, key) => {
|
|
109
|
+
const keys = [];
|
|
110
|
+
const newArr = [];
|
|
111
|
+
for (let i = 0; i < arr.length; i++) {
|
|
112
|
+
if (keys.includes(arr[i][key])) {
|
|
113
|
+
continue;
|
|
114
|
+
}
|
|
115
|
+
keys.push(arr[i][key]);
|
|
116
|
+
newArr.push(arr[i]);
|
|
117
|
+
}
|
|
118
|
+
return newArr;
|
|
119
|
+
},
|
|
120
|
+
/**
|
|
121
|
+
* 更新数组,若item已存在则将其从数组中删除,若不存在则将其添加到数组
|
|
122
|
+
* **/
|
|
123
|
+
updateArray: (array, item) => {
|
|
124
|
+
for (let i = 0, len = array.length; i < len; i++) {
|
|
125
|
+
const temp = array[i];
|
|
126
|
+
if (item === temp) {
|
|
127
|
+
array.splice(i, 1);
|
|
128
|
+
return;
|
|
129
|
+
}
|
|
130
|
+
}
|
|
131
|
+
array.push(item);
|
|
132
|
+
},
|
|
133
|
+
/**
|
|
134
|
+
* 将数组中指定元素移除
|
|
135
|
+
* @param array
|
|
136
|
+
* @param item 要移除的item
|
|
137
|
+
* @param id 要对比的属性,缺省则比较地址
|
|
138
|
+
* @returns {*}
|
|
139
|
+
*/
|
|
140
|
+
remove: (array, item, id) => {
|
|
141
|
+
if (!array)
|
|
142
|
+
return;
|
|
143
|
+
for (let i = 0, l = array.length; i < l; i++) {
|
|
144
|
+
const val = array[i];
|
|
145
|
+
if (item === val || (val && val[id] && val[id] === item[id])) {
|
|
146
|
+
array.splice(i, 1);
|
|
147
|
+
}
|
|
148
|
+
}
|
|
149
|
+
return array;
|
|
150
|
+
},
|
|
151
|
+
/**
|
|
152
|
+
* 判断两个数组的是否相等
|
|
153
|
+
* @return boolean true 数组长度相等且对应元素相等
|
|
154
|
+
* */
|
|
155
|
+
isEqual: (arr1, arr2) => {
|
|
156
|
+
if (!(arr1 && arr2))
|
|
157
|
+
return false;
|
|
158
|
+
if (arr1.length !== arr2.length)
|
|
159
|
+
return false;
|
|
160
|
+
// 对数组进行排序
|
|
161
|
+
arr1.sort();
|
|
162
|
+
arr2.sort();
|
|
163
|
+
//转成字符串进行比较
|
|
164
|
+
return arr1.toString() === arr2.toString();
|
|
165
|
+
},
|
|
166
|
+
/**
|
|
167
|
+
* clone 数组
|
|
168
|
+
* @return Array 新的数组
|
|
169
|
+
* */
|
|
170
|
+
clone: (from) => {
|
|
171
|
+
if (!from)
|
|
172
|
+
return [];
|
|
173
|
+
const newArray = [];
|
|
174
|
+
for (let i = 0, l = from.length; i < l; i++) {
|
|
175
|
+
newArray[i] = from[i];
|
|
176
|
+
}
|
|
177
|
+
return newArray;
|
|
178
|
+
},
|
|
179
|
+
/**
|
|
180
|
+
*获取两个数组的差集
|
|
181
|
+
* @param arr1
|
|
182
|
+
* @param arr2
|
|
183
|
+
*/
|
|
184
|
+
subSet: (arr1, arr2) => {
|
|
185
|
+
const set1 = new Set(arr1);
|
|
186
|
+
const set2 = new Set(arr2);
|
|
187
|
+
const subset = [];
|
|
188
|
+
for (const item of set1) {
|
|
189
|
+
if (!set2.has(item)) {
|
|
190
|
+
subset.push(item);
|
|
191
|
+
}
|
|
192
|
+
}
|
|
193
|
+
return subset;
|
|
194
|
+
},
|
|
195
|
+
/**
|
|
196
|
+
* 获取数组中符合要求的项目
|
|
197
|
+
* @param itemList 条目数组
|
|
198
|
+
* @param v 比较值
|
|
199
|
+
* @param k 比较的字段
|
|
200
|
+
*/
|
|
201
|
+
getItemByKey: (itemList, v, k = 'id') => {
|
|
202
|
+
let item = {};
|
|
203
|
+
for (let i = 0; i < itemList.length; i++) {
|
|
204
|
+
if (itemList[i][k] === v) {
|
|
205
|
+
item = itemList[i];
|
|
206
|
+
break;
|
|
207
|
+
}
|
|
208
|
+
}
|
|
209
|
+
return item;
|
|
210
|
+
},
|
|
211
|
+
/**
|
|
212
|
+
* 树形数据降维
|
|
213
|
+
*/
|
|
214
|
+
dimTreeReduction: (treeData, nodeKeys, nodes) => {
|
|
215
|
+
if (!Array.isArray(treeData))
|
|
216
|
+
return;
|
|
217
|
+
treeData.forEach(item => {
|
|
218
|
+
nodeKeys.push(item.key);
|
|
219
|
+
nodes.push(item);
|
|
220
|
+
if (Array.isArray(item.children)) {
|
|
221
|
+
arrayUtils.dimTreeReduction(item.children, nodeKeys, nodes);
|
|
222
|
+
}
|
|
223
|
+
});
|
|
224
|
+
},
|
|
225
|
+
/**
|
|
226
|
+
* 树形数据降维 - 返回一个完整的数组
|
|
227
|
+
*/
|
|
228
|
+
dimTreeReduction2: (treeData) => {
|
|
229
|
+
const nodeKeys = [];
|
|
230
|
+
const nodes = [];
|
|
231
|
+
arrayUtils.dimTreeReduction(treeData, nodeKeys, nodes);
|
|
232
|
+
return {
|
|
233
|
+
nodes,
|
|
234
|
+
nodeKeys
|
|
235
|
+
};
|
|
236
|
+
},
|
|
237
|
+
/**
|
|
238
|
+
* 移除父节点
|
|
239
|
+
*/
|
|
240
|
+
removePNode: (nodeList) => {
|
|
241
|
+
// 收集全部的父亲
|
|
242
|
+
const pList = nodeList.map(item => item.data.pCode);
|
|
243
|
+
// 如果我的父亲在里面,我就不需要存在了
|
|
244
|
+
const newNode = [];
|
|
245
|
+
nodeList.forEach(item => {
|
|
246
|
+
if (pList.indexOf(item.data.code) != -1) {
|
|
247
|
+
newNode.push(item);
|
|
248
|
+
}
|
|
249
|
+
});
|
|
250
|
+
return newNode;
|
|
251
|
+
},
|
|
252
|
+
/**
|
|
253
|
+
* 数组转枚举
|
|
254
|
+
*/
|
|
255
|
+
toEnum: (arr) => {
|
|
256
|
+
const enumObj = {};
|
|
257
|
+
arr.forEach(item => {
|
|
258
|
+
enumObj[item.value] = {
|
|
259
|
+
text: item.label,
|
|
260
|
+
disabled: item.disabled,
|
|
261
|
+
...item
|
|
262
|
+
};
|
|
263
|
+
});
|
|
264
|
+
return enumObj;
|
|
265
|
+
},
|
|
266
|
+
/**
|
|
267
|
+
* 把对象里面指定的属性转换成数组
|
|
268
|
+
* @param obj 原始数据
|
|
269
|
+
* @param keys 哪些字段要转换
|
|
270
|
+
*/
|
|
271
|
+
toArrayByKeys: (obj, keys) => {
|
|
272
|
+
for (let i = 0; i < keys.length; i++) {
|
|
273
|
+
const key = keys[i];
|
|
274
|
+
// 如果是字符串就进行处理
|
|
275
|
+
if (typeof obj[key] === 'string') {
|
|
276
|
+
obj[key] = obj[key].split(';').filter((item) => item);
|
|
277
|
+
}
|
|
278
|
+
else if (!obj[key]) {
|
|
279
|
+
// 如果这个数据不存在,就设置为空数组
|
|
280
|
+
obj[key] = [];
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
},
|
|
284
|
+
/**
|
|
285
|
+
* 把对象里面指定的属性转换成数字数组
|
|
286
|
+
* @param obj 原始数据
|
|
287
|
+
* @param keys 哪些字段要转换
|
|
288
|
+
*/
|
|
289
|
+
toNumArrayByKeys: (obj, keys) => {
|
|
290
|
+
for (let i = 0; i < keys.length; i++) {
|
|
291
|
+
const key = keys[i];
|
|
292
|
+
// 如果是字符串就进行处理
|
|
293
|
+
if (typeof obj[key] === 'string') {
|
|
294
|
+
const split = obj[key].split(';');
|
|
295
|
+
const newArr = [];
|
|
296
|
+
for (let j = 0; j < split.length; j++) {
|
|
297
|
+
if (split[j]) {
|
|
298
|
+
newArr.push(Number(split[j]));
|
|
299
|
+
}
|
|
300
|
+
}
|
|
301
|
+
obj[key] = newArr;
|
|
302
|
+
}
|
|
303
|
+
else if (!obj[key]) {
|
|
304
|
+
// 如果这个数据不存在,就设置为空数组
|
|
305
|
+
obj[key] = [];
|
|
306
|
+
}
|
|
307
|
+
}
|
|
308
|
+
},
|
|
309
|
+
/**
|
|
310
|
+
* 把对象里面指定的属性转换成字符串
|
|
311
|
+
* @param obj 原始数据
|
|
312
|
+
* @param keys 哪些字段要转换
|
|
313
|
+
* @param str 分隔符
|
|
314
|
+
* @param joinAll 是否前后都加
|
|
315
|
+
*/
|
|
316
|
+
toStringByKeys: (obj, keys, str = ';', joinAll = false) => {
|
|
317
|
+
for (let i = 0; i < keys.length; i++) {
|
|
318
|
+
const key = keys[i];
|
|
319
|
+
// 如果是字符串就进行处理
|
|
320
|
+
if (Array.isArray(obj[key])) {
|
|
321
|
+
obj[key] = obj[key].join(str);
|
|
322
|
+
}
|
|
323
|
+
//如果end为true,最后一个加分号
|
|
324
|
+
if (joinAll) {
|
|
325
|
+
obj[key] = str + obj[key] + str;
|
|
326
|
+
}
|
|
327
|
+
}
|
|
328
|
+
},
|
|
329
|
+
/**
|
|
330
|
+
* 把对象里面指定的属性转换成字符串 - 这个方法会在前后都补充对应的符号
|
|
331
|
+
* <p>
|
|
332
|
+
* ["a", "b"] => ";a;b;c;"
|
|
333
|
+
* @param obj 原始数据
|
|
334
|
+
* @param keys 哪些字段要转换
|
|
335
|
+
*/
|
|
336
|
+
joinAll: (obj, keys) => {
|
|
337
|
+
arrayUtils.toStringByKeys(obj, keys, ';', true);
|
|
338
|
+
},
|
|
339
|
+
/**
|
|
340
|
+
* 把对象里面指定的属性转换成字符串
|
|
341
|
+
* <p>
|
|
342
|
+
* ["a", "b"] => "a;b;c"
|
|
343
|
+
* @param obj 原始数据
|
|
344
|
+
* @param keys 哪些字段要转换
|
|
345
|
+
*/
|
|
346
|
+
join: (obj, keys) => {
|
|
347
|
+
arrayUtils.toStringByKeys(obj, keys);
|
|
348
|
+
},
|
|
349
|
+
/**
|
|
350
|
+
* 查找出两个数组中需要删除的,需要更新的,没有变化的
|
|
351
|
+
*/
|
|
352
|
+
findChangeData: (oldData, newData, key) => {
|
|
353
|
+
const deleteSet = new Set();
|
|
354
|
+
const insertSet = new Set();
|
|
355
|
+
const noChangeSet = new Set();
|
|
356
|
+
// 遍历旧的数据,如果新的数据中没有,就是需要删除的
|
|
357
|
+
oldData.forEach(item => {
|
|
358
|
+
if (newData.includes(item)) {
|
|
359
|
+
noChangeSet.add(item);
|
|
360
|
+
}
|
|
361
|
+
else {
|
|
362
|
+
deleteSet.add(item);
|
|
363
|
+
}
|
|
364
|
+
});
|
|
365
|
+
// 遍历新的数据,如果旧的数据中没有,就是需要新增的
|
|
366
|
+
newData.forEach(item => {
|
|
367
|
+
if (oldData.includes(item)) {
|
|
368
|
+
noChangeSet.add(item);
|
|
369
|
+
}
|
|
370
|
+
else {
|
|
371
|
+
insertSet.add(item);
|
|
372
|
+
}
|
|
373
|
+
});
|
|
374
|
+
return {
|
|
375
|
+
insertList: Array.from(insertSet),
|
|
376
|
+
deleteList: Array.from(deleteSet),
|
|
377
|
+
noChangeList: Array.from(noChangeSet)
|
|
378
|
+
};
|
|
379
|
+
},
|
|
380
|
+
/**
|
|
381
|
+
* 将字符串或者数组转成数组
|
|
382
|
+
* @param str 字符串或者数组
|
|
383
|
+
* @param splitStr 分隔符
|
|
384
|
+
*/
|
|
385
|
+
toArray: (str, splitStr = ';') => {
|
|
386
|
+
if (str === null || str === undefined) {
|
|
387
|
+
return null;
|
|
388
|
+
}
|
|
389
|
+
let strList;
|
|
390
|
+
if (Array.isArray(str)) {
|
|
391
|
+
strList = str;
|
|
392
|
+
}
|
|
393
|
+
else {
|
|
394
|
+
// 字符串的情况
|
|
395
|
+
if (str.startsWith(splitStr)) {
|
|
396
|
+
str = str.substring(1, str.length);
|
|
397
|
+
}
|
|
398
|
+
strList = str.split(splitStr);
|
|
399
|
+
}
|
|
400
|
+
return strList;
|
|
401
|
+
},
|
|
402
|
+
/**
|
|
403
|
+
* 判断对象里面的数组是否发生了变化
|
|
404
|
+
* <br />
|
|
405
|
+
* 一般来说,用在资源关联里面,比如判断下现在新的资源和旧的资源是否有变化,如果没有变化,就不需要重新请求接口
|
|
406
|
+
*/
|
|
407
|
+
isChangeArray: (oldObj, newObj) => {
|
|
408
|
+
const keys = Object.keys(oldObj);
|
|
409
|
+
for (let i = 0; i < keys.length; i++) {
|
|
410
|
+
const key = keys[i];
|
|
411
|
+
// 比较事项是否有变化
|
|
412
|
+
const b = arrayUtils.isEqual(oldObj[key], newObj[key]);
|
|
413
|
+
if (!b) {
|
|
414
|
+
return true;
|
|
415
|
+
}
|
|
416
|
+
}
|
|
417
|
+
return false;
|
|
418
|
+
},
|
|
419
|
+
/**
|
|
420
|
+
* 数组移动位置
|
|
421
|
+
* @param array 数组
|
|
422
|
+
* @param from 从哪个位置
|
|
423
|
+
* @param to 移动到哪个位置
|
|
424
|
+
*/
|
|
425
|
+
arrayMove(array, from, to) {
|
|
426
|
+
const newArray = array.slice();
|
|
427
|
+
newArray.splice(to < 0 ? newArray.length + to : to, 0, newArray.splice(from, 1)[0]);
|
|
428
|
+
return newArray;
|
|
105
429
|
}
|
|
106
430
|
};
|
|
107
431
|
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.cjs","sources":["../../../src/core/arrayUtils/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAAA;;AAEG;AAIH;;AAEG;AACH,MAAM,UAAU,GAAG;AACjB;;;;AAIG;AACH,IAAA,MAAM,CAAI,GAAQ,EAAA;QAChB,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AAED;;;;;AAKG;IACH,KAAK,CAAI,GAAQ,EAAE,IAAY,EAAA;QAC7B,MAAM,MAAM,GAAU,EAAE;AACxB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE;AACzC,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QACrC;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAED;;;;;AAKG;AACH,IAAA,OAAO,CAAI,GAAU,EAAE,KAAK,GAAG,CAAC,EAAA;QAC9B,OAAO,KAAK,GAAG;AACb,cAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE;AACxG,cAAE,GAAG,CAAC,KAAK,EAAE;IACjB,CAAC;AAED;;;;AAIG;AACH,IAAA,OAAO,CAAI,GAAQ,EAAA;AACjB,QAAA,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC;AACvB,QAAA,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1C,YAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7C,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACjD;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAED;;;;;AAKG;IACH,YAAY,CAAI,IAAS,EAAE,IAAS,EAAA;AAClC,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;AAED;;;;;AAKG;IACH,UAAU,CAAI,IAAS,EAAE,IAAS,EAAA;AAChC,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;AAED;;;;;AAKG;IACH,OAAO,CACL,GAAQ,EACR,KAAqB,EAAA;QAErB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,IAAI,KAAI;AACjC,YAAA,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC;AACvB,YAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;AAChB,gBAAA,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;YAClB;YACA,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AACtB,YAAA,OAAO,MAAM;QACf,CAAC,EAAE,EAAoB,CAAC;IAC1B,CAAC;AAGD;;;;;AAKG;AACH,IAAA,SAAS,CAAC,CAAS,EAAE,OAAoB,EAAE,GAAW,EAAA;AACpD,QAAA,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;AAC3C,QAAA,MAAM,SAAS,GAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;AAC9D,QAAA,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AACxB,YAAA,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1B;AACA,QAAA,OAAO,IAAI;IACb;;;;;"}
|
|
1
|
+
{"version":3,"file":"index.cjs","sources":["../../../src/core/arrayUtils/index.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AAuBA;;AAEG;AACH,MAAM,UAAU,GAAG;AACjB;;;;AAIG;AACH,IAAA,MAAM,CAAI,GAAQ,EAAA;QAChB,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AAED;;;;;AAKG;IACH,KAAK,CAAI,GAAQ,EAAE,IAAY,EAAA;QAC7B,MAAM,MAAM,GAAU,EAAE;AACxB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE;AACzC,YAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QACrC;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAED;;;;;AAKG;AACH,IAAA,OAAO,CAAI,GAAU,EAAE,KAAK,GAAG,CAAC,EAAA;QAC9B,OAAO,KAAK,GAAG;AACb,cAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE;AACxG,cAAE,GAAG,CAAC,KAAK,EAAE;IACjB,CAAC;AAED;;;;AAIG;AACH,IAAA,OAAO,CAAI,GAAQ,EAAA;AACjB,QAAA,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC;AACvB,QAAA,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1C,YAAA,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7C,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACjD;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAED;;;;;AAKG;IACH,YAAY,CAAI,IAAS,EAAE,IAAS,EAAA;AAClC,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;AAED;;;;;AAKG;IACH,UAAU,CAAI,IAAS,EAAE,IAAS,EAAA;AAChC,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;AAED;;;;;AAKG;IACH,OAAO,CACL,GAAQ,EACR,KAAqB,EAAA;QAErB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,IAAI,KAAI;AACjC,YAAA,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC;AACvB,YAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;AAChB,gBAAA,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;YAClB;YACA,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AACtB,YAAA,OAAO,MAAM;QACf,CAAC,EAAE,EAAoB,CAAC;IAC1B,CAAC;AAGD;;;;;AAKG;AACH,IAAA,SAAS,CAAC,CAAS,EAAE,OAAoB,EAAE,GAAW,EAAA;AACpD,QAAA,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI;AAC3C,QAAA,MAAM,SAAS,GAAQ,OAAO,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;AAC9D,QAAA,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AACxB,YAAA,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1B;AACA,QAAA,OAAO,IAAI;IACb,CAAC;AAED;;;;AAIG;AACH,IAAA,QAAQ,EAAE,CAAC,GAAU,EAAE,GAAW,KAAI;QACpC,MAAM,IAAI,GAAa,EAAE;QACzB,MAAM,MAAM,GAAU,EAAE;AACxB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnC,YAAA,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;gBAC9B;YACF;YACA,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAEC;;AAEI;AACN,IAAA,WAAW,EAAE,CAAU,KAAU,EAAE,IAAO,KAAI;AAC5C,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChD,YAAA,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AACrB,YAAA,IAAI,IAAI,KAAK,IAAI,EAAE;AACjB,gBAAA,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;gBAClB;YACF;QACF;AACA,QAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;AAED;;;;;;AAMG;IACH,MAAM,EAAE,CAAC,KAAY,EAAE,IAAS,EAAE,EAAO,KAAI;AAC3C,QAAA,IAAI,CAAC,KAAK;YAAE;AACZ,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC5C,YAAA,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;YACpB,IAAI,IAAI,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE;AAC5D,gBAAA,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB;QACF;AACA,QAAA,OAAO,KAAK;IACd,CAAC;AAED;;;AAGK;AACL,IAAA,OAAO,EAAE,CAAC,IAAY,EAAE,IAAY,KAAI;AACtC,QAAA,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC;AAAE,YAAA,OAAO,KAAK;AACjC,QAAA,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;AAAE,YAAA,OAAO,KAAK;;QAE7C,IAAI,CAAC,IAAI,EAAE;QACX,IAAI,CAAC,IAAI,EAAE;;QAEX,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE;IAC5C,CAAC;AAED;;;AAGK;AACL,IAAA,KAAK,EAAE,CAAC,IAAW,KAAI;AACrB,QAAA,IAAI,CAAC,IAAI;AAAE,YAAA,OAAO,EAAE;QACpB,MAAM,QAAQ,GAAG,EAAE;AACnB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3C,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACvB;AACA,QAAA,OAAO,QAAQ;IACjB,CAAC;AAED;;;;AAIG;AACH,IAAA,MAAM,EAAE,CAAC,IAAW,EAAE,IAAW,KAAI;AACnC,QAAA,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;AAC1B,QAAA,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;QAC1B,MAAM,MAAM,GAAG,EAAE;AACjB,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACnB,gBAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACnB;QACF;AACA,QAAA,OAAO,MAAM;IACf,CAAC;AAED;;;;;AAKG;IACH,YAAY,EAAE,CAAU,QAAa,EAAE,CAAM,EAAE,CAAA,GAAY,IAAI,KAAO;QACpE,IAAI,IAAI,GAAM,EAAO;AACrB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,IAAK,QAAQ,CAAC,CAAC,CAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;AACjC,gBAAA,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC;gBAClB;YACF;QACF;AACA,QAAA,OAAO,IAAI;IACb,CAAC;AAED;;AAEG;IACH,gBAAgB,EAAE,CAAC,QAAqB,EAAE,QAAkB,EAAE,KAAkB,KAAI;AAClF,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YAAE;AAC9B,QAAA,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAG;AACtB,YAAA,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACvB,YAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;YAChB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAChC,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;YAC7D;AACF,QAAA,CAAC,CAAC;IACJ,CAAC;AAED;;AAEG;AACH,IAAA,iBAAiB,EAAE,CACjB,QAAqB,KAInB;QACF,MAAM,QAAQ,GAAa,EAAE;QAC7B,MAAM,KAAK,GAAgB,EAAE;QAC7B,UAAU,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;QACtD,OAAO;YACL,KAAK;YACL;SACD;IACH,CAAC;AAED;;AAEG;AACH,IAAA,WAAW,EAAE,CAAC,QAAe,KAAI;;AAE/B,QAAA,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;;QAEnD,MAAM,OAAO,GAAU,EAAE;AACzB,QAAA,QAAQ,CAAC,OAAO,CAAC,IAAI,IAAG;AACtB,YAAA,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE;AACvC,gBAAA,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YACpB;AACF,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,OAAO;IAChB,CAAC;AAED;;AAEG;AACH,IAAA,MAAM,EAAE,CAAC,GAAuB,KAAc;QAC5C,MAAM,OAAO,GAAwB,EAAE;AACvC,QAAA,GAAG,CAAC,OAAO,CAAC,IAAI,IAAG;AACjB,YAAA,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;gBACpB,IAAI,EAAE,IAAI,CAAC,KAAK;gBAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ;AACvB,gBAAA,GAAG;aACJ;AACH,QAAA,CAAC,CAAC;AACF,QAAA,OAAO,OAAO;IAChB,CAAC;AAED;;;;AAIG;AACH,IAAA,aAAa,EAAE,CAAC,GAAwB,EAAE,IAAc,KAAI;AAC1D,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;;YAEnB,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,QAAQ,EAAE;gBAChC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAY,KAAK,IAAI,CAAC;YAC/D;AAAO,iBAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;;AAEpB,gBAAA,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;YACf;QACF;IACF,CAAC;AAED;;;;AAIG;AACH,IAAA,gBAAgB,EAAE,CAAC,GAAwB,EAAE,IAAc,KAAI;AAC7D,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;;YAEnB,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,QAAQ,EAAE;gBAChC,MAAM,KAAK,GAAa,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;gBAC3C,MAAM,MAAM,GAAa,EAAE;AAC3B,gBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,oBAAA,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE;wBACZ,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/B;gBACF;AACA,gBAAA,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM;YACnB;AAAO,iBAAA,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;;AAEpB,gBAAA,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;YACf;QACF;IACF,CAAC;AAED;;;;;;AAMG;AACH,IAAA,cAAc,EAAE,CACd,GAAwB,EACxB,IAAc,EACd,GAAA,GAAc,GAAG,EACjB,OAAO,GAAG,KAAK,KACb;AACF,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;;YAEnB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;AAC3B,gBAAA,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/B;;YAEA,IAAI,OAAO,EAAE;AACX,gBAAA,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG;YACjC;QACF;IACF,CAAC;AAED;;;;;;AAMG;AACH,IAAA,OAAO,EAAE,CAAC,GAAwB,EAAE,IAAc,KAAI;QACpD,UAAU,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC;IACjD,CAAC;AAED;;;;;;AAMG;AACH,IAAA,IAAI,EAAE,CAAC,GAAwB,EAAE,IAAc,KAAI;AACjD,QAAA,UAAU,CAAC,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC;IACtC,CAAC;AAED;;AAEG;IACH,cAAc,EAAE,CAAC,OAAiB,EAAE,OAAiB,EAAE,GAAW,KAAmB;AACnF,QAAA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU;AACnC,QAAA,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU;AACnC,QAAA,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU;;AAErC,QAAA,OAAO,CAAC,OAAO,CAAC,IAAI,IAAG;AACrB,YAAA,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;AAC1B,gBAAA,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YACvB;iBAAO;AACL,gBAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YACrB;AACF,QAAA,CAAC,CAAC;;AAEF,QAAA,OAAO,CAAC,OAAO,CAAC,IAAI,IAAG;AACrB,YAAA,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;AAC1B,gBAAA,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YACvB;iBAAO;AACL,gBAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YACrB;AACF,QAAA,CAAC,CAAC;QACF,OAAO;AACL,YAAA,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AACjC,YAAA,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AACjC,YAAA,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW;SACrC;IACH,CAAC;AACD;;;;AAIG;IACH,OAAO,EAAE,CAAC,GAAyC,EAAE,QAAQ,GAAG,GAAG,KAAI;QACrE,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,EAAE;AACrC,YAAA,OAAO,IAAI;QACb;AACA,QAAA,IAAI,OAAiB;AACrB,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;YACtB,OAAO,GAAG,GAAG;QACf;aAAO;;AAEL,YAAA,IAAI,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;gBAC5B,GAAG,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC;YACpC;AACA,YAAA,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC/B;AACA,QAAA,OAAO,OAAO;IAChB,CAAC;AAED;;;;AAIG;AACH,IAAA,aAAa,EAAE,CAAC,MAA6B,EAAE,MAA6B,KAAa;QACvF,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;AAChC,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,YAAA,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;;AAEnB,YAAA,MAAM,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YACtD,IAAI,CAAC,CAAC,EAAE;AACN,gBAAA,OAAO,IAAI;YACb;QACF;AACA,QAAA,OAAO,KAAK;IACd,CAAC;AAED;;;;;AAKG;AACH,IAAA,SAAS,CAAI,KAAU,EAAE,IAAY,EAAE,EAAU,EAAA;AAC/C,QAAA,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE;AAC9B,QAAA,QAAQ,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnF,QAAA,OAAO,QAAQ;IACjB;;;;;"}
|
|
@@ -1,9 +1,23 @@
|
|
|
1
|
-
import {
|
|
1
|
+
import { IEnumObj } from '../../form/types.js';
|
|
2
|
+
import { IOptions2, ITreeNode, IOptions } from '../../types/data/index.js';
|
|
2
3
|
|
|
3
4
|
/**
|
|
4
|
-
*
|
|
5
|
+
* 列表变化的数据
|
|
5
6
|
*/
|
|
6
|
-
|
|
7
|
+
interface IListChangeVo {
|
|
8
|
+
/**
|
|
9
|
+
* 需要新增的数据
|
|
10
|
+
*/
|
|
11
|
+
insertList: string[];
|
|
12
|
+
/**
|
|
13
|
+
* 需要删除的数据
|
|
14
|
+
*/
|
|
15
|
+
deleteList: string[];
|
|
16
|
+
/**
|
|
17
|
+
* 没有变的数据
|
|
18
|
+
*/
|
|
19
|
+
noChangeList: string[];
|
|
20
|
+
}
|
|
7
21
|
/**
|
|
8
22
|
* 数组工具对象
|
|
9
23
|
*/
|
|
@@ -62,6 +76,126 @@ declare const arrayUtils: {
|
|
|
62
76
|
* @param key 数据的下标
|
|
63
77
|
*/
|
|
64
78
|
getListId(s: string, optList: IOptions2[], key: string): any;
|
|
79
|
+
/**
|
|
80
|
+
* 根据指定的字段进行去重
|
|
81
|
+
* @param arr 数组
|
|
82
|
+
* @param key 去重字段
|
|
83
|
+
*/
|
|
84
|
+
uniqueBy: (arr: any[], key: string) => any[];
|
|
85
|
+
/**
|
|
86
|
+
* 更新数组,若item已存在则将其从数组中删除,若不存在则将其添加到数组
|
|
87
|
+
* **/
|
|
88
|
+
updateArray: <T = any>(array: T[], item: T) => void;
|
|
89
|
+
/**
|
|
90
|
+
* 将数组中指定元素移除
|
|
91
|
+
* @param array
|
|
92
|
+
* @param item 要移除的item
|
|
93
|
+
* @param id 要对比的属性,缺省则比较地址
|
|
94
|
+
* @returns {*}
|
|
95
|
+
*/
|
|
96
|
+
remove: (array: any[], item: any, id: any) => any[] | undefined;
|
|
97
|
+
/**
|
|
98
|
+
* 判断两个数组的是否相等
|
|
99
|
+
* @return boolean true 数组长度相等且对应元素相等
|
|
100
|
+
* */
|
|
101
|
+
isEqual: (arr1?: any[], arr2?: any[]) => boolean;
|
|
102
|
+
/**
|
|
103
|
+
* clone 数组
|
|
104
|
+
* @return Array 新的数组
|
|
105
|
+
* */
|
|
106
|
+
clone: (from: any[]) => any[];
|
|
107
|
+
/**
|
|
108
|
+
*获取两个数组的差集
|
|
109
|
+
* @param arr1
|
|
110
|
+
* @param arr2
|
|
111
|
+
*/
|
|
112
|
+
subSet: (arr1: any[], arr2: any[]) => any[];
|
|
113
|
+
/**
|
|
114
|
+
* 获取数组中符合要求的项目
|
|
115
|
+
* @param itemList 条目数组
|
|
116
|
+
* @param v 比较值
|
|
117
|
+
* @param k 比较的字段
|
|
118
|
+
*/
|
|
119
|
+
getItemByKey: <T = any>(itemList: T[], v: any, k?: string) => T;
|
|
120
|
+
/**
|
|
121
|
+
* 树形数据降维
|
|
122
|
+
*/
|
|
123
|
+
dimTreeReduction: (treeData: ITreeNode[], nodeKeys: string[], nodes: ITreeNode[]) => void;
|
|
124
|
+
/**
|
|
125
|
+
* 树形数据降维 - 返回一个完整的数组
|
|
126
|
+
*/
|
|
127
|
+
dimTreeReduction2: (treeData: ITreeNode[]) => {
|
|
128
|
+
nodes: ITreeNode[];
|
|
129
|
+
nodeKeys: string[];
|
|
130
|
+
};
|
|
131
|
+
/**
|
|
132
|
+
* 移除父节点
|
|
133
|
+
*/
|
|
134
|
+
removePNode: (nodeList: any[]) => any[];
|
|
135
|
+
/**
|
|
136
|
+
* 数组转枚举
|
|
137
|
+
*/
|
|
138
|
+
toEnum: (arr: IOptions<string>[]) => IEnumObj;
|
|
139
|
+
/**
|
|
140
|
+
* 把对象里面指定的属性转换成数组
|
|
141
|
+
* @param obj 原始数据
|
|
142
|
+
* @param keys 哪些字段要转换
|
|
143
|
+
*/
|
|
144
|
+
toArrayByKeys: (obj: Record<string, any>, keys: string[]) => void;
|
|
145
|
+
/**
|
|
146
|
+
* 把对象里面指定的属性转换成数字数组
|
|
147
|
+
* @param obj 原始数据
|
|
148
|
+
* @param keys 哪些字段要转换
|
|
149
|
+
*/
|
|
150
|
+
toNumArrayByKeys: (obj: Record<string, any>, keys: string[]) => void;
|
|
151
|
+
/**
|
|
152
|
+
* 把对象里面指定的属性转换成字符串
|
|
153
|
+
* @param obj 原始数据
|
|
154
|
+
* @param keys 哪些字段要转换
|
|
155
|
+
* @param str 分隔符
|
|
156
|
+
* @param joinAll 是否前后都加
|
|
157
|
+
*/
|
|
158
|
+
toStringByKeys: (obj: Record<string, any>, keys: string[], str?: string, joinAll?: boolean) => void;
|
|
159
|
+
/**
|
|
160
|
+
* 把对象里面指定的属性转换成字符串 - 这个方法会在前后都补充对应的符号
|
|
161
|
+
* <p>
|
|
162
|
+
* ["a", "b"] => ";a;b;c;"
|
|
163
|
+
* @param obj 原始数据
|
|
164
|
+
* @param keys 哪些字段要转换
|
|
165
|
+
*/
|
|
166
|
+
joinAll: (obj: Record<string, any>, keys: string[]) => void;
|
|
167
|
+
/**
|
|
168
|
+
* 把对象里面指定的属性转换成字符串
|
|
169
|
+
* <p>
|
|
170
|
+
* ["a", "b"] => "a;b;c"
|
|
171
|
+
* @param obj 原始数据
|
|
172
|
+
* @param keys 哪些字段要转换
|
|
173
|
+
*/
|
|
174
|
+
join: (obj: Record<string, any>, keys: string[]) => void;
|
|
175
|
+
/**
|
|
176
|
+
* 查找出两个数组中需要删除的,需要更新的,没有变化的
|
|
177
|
+
*/
|
|
178
|
+
findChangeData: (oldData: string[], newData: string[], key: string) => IListChangeVo;
|
|
179
|
+
/**
|
|
180
|
+
* 将字符串或者数组转成数组
|
|
181
|
+
* @param str 字符串或者数组
|
|
182
|
+
* @param splitStr 分隔符
|
|
183
|
+
*/
|
|
184
|
+
toArray: (str: string | string[] | undefined | null, splitStr?: string) => string[] | null;
|
|
185
|
+
/**
|
|
186
|
+
* 判断对象里面的数组是否发生了变化
|
|
187
|
+
* <br />
|
|
188
|
+
* 一般来说,用在资源关联里面,比如判断下现在新的资源和旧的资源是否有变化,如果没有变化,就不需要重新请求接口
|
|
189
|
+
*/
|
|
190
|
+
isChangeArray: (oldObj: Record<string, any[]>, newObj: Record<string, any[]>) => boolean;
|
|
191
|
+
/**
|
|
192
|
+
* 数组移动位置
|
|
193
|
+
* @param array 数组
|
|
194
|
+
* @param from 从哪个位置
|
|
195
|
+
* @param to 移动到哪个位置
|
|
196
|
+
*/
|
|
197
|
+
arrayMove<T>(array: T[], from: number, to: number): T[];
|
|
65
198
|
};
|
|
66
199
|
|
|
67
200
|
export { arrayUtils as default };
|
|
201
|
+
export type { IListChangeVo };
|
|
@@ -1,25 +1,25 @@
|
|
|
1
1
|
'use strict';
|
|
2
2
|
|
|
3
3
|
/**
|
|
4
|
-
* 权限枚举
|
|
4
|
+
* 权限枚举
|
|
5
5
|
*/
|
|
6
|
-
exports.
|
|
7
|
-
(function (
|
|
6
|
+
exports.EPermissionEnum = void 0;
|
|
7
|
+
(function (EPermissionEnum) {
|
|
8
8
|
/**
|
|
9
9
|
* 公有
|
|
10
10
|
*/
|
|
11
|
-
|
|
11
|
+
EPermissionEnum[EPermissionEnum["PUBLIC"] = 0] = "PUBLIC";
|
|
12
12
|
/**
|
|
13
13
|
* 私有
|
|
14
14
|
*/
|
|
15
|
-
|
|
15
|
+
EPermissionEnum[EPermissionEnum["PRIVATE"] = 1] = "PRIVATE";
|
|
16
16
|
/**
|
|
17
17
|
* 登录后可以查看
|
|
18
18
|
*/
|
|
19
|
-
|
|
19
|
+
EPermissionEnum[EPermissionEnum["LOGIN"] = 2] = "LOGIN";
|
|
20
20
|
/**
|
|
21
21
|
* 本部门可见/部门内可见
|
|
22
22
|
*/
|
|
23
|
-
|
|
24
|
-
})(exports.
|
|
23
|
+
EPermissionEnum[EPermissionEnum["DEPT"] = 3] = "DEPT";
|
|
24
|
+
})(exports.EPermissionEnum || (exports.EPermissionEnum = {}));
|
|
25
25
|
//# sourceMappingURL=comm.cjs.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"comm.cjs","sources":["../../../src/core/constants/comm.ts"],"sourcesContent":[null],"names":["
|
|
1
|
+
{"version":3,"file":"comm.cjs","sources":["../../../src/core/constants/comm.ts"],"sourcesContent":[null],"names":["EPermissionEnum"],"mappings":";;AAyCA;;AAEG;AACSA;AAAZ,CAAA,UAAY,eAAe,EAAA;AACzB;;AAEG;AACH,IAAA,eAAA,CAAA,eAAA,CAAA,QAAA,CAAA,GAAA,CAAA,CAAA,GAAA,QAAU;AACV;;AAEG;AACH,IAAA,eAAA,CAAA,eAAA,CAAA,SAAA,CAAA,GAAA,CAAA,CAAA,GAAA,SAAW;AACX;;AAEG;AACH,IAAA,eAAA,CAAA,eAAA,CAAA,OAAA,CAAA,GAAA,CAAA,CAAA,GAAA,OAAS;AACT;;AAEG;AACH,IAAA,eAAA,CAAA,eAAA,CAAA,MAAA,CAAA,GAAA,CAAA,CAAA,GAAA,MAAQ;AACV,CAAC,EAjBWA,uBAAe,KAAfA,uBAAe,GAAA,EAAA,CAAA,CAAA;;"}
|
|
@@ -37,9 +37,9 @@ declare type SingleValueType = (string | number)[];
|
|
|
37
37
|
declare type ValueType = SingleValueType | SingleValueType[];
|
|
38
38
|
type UploadFileStatus = 'error' | 'success' | 'done' | 'uploading' | 'removed' | 'waiting';
|
|
39
39
|
/**
|
|
40
|
-
* 权限枚举
|
|
40
|
+
* 权限枚举
|
|
41
41
|
*/
|
|
42
|
-
declare enum
|
|
42
|
+
declare enum EPermissionEnum {
|
|
43
43
|
/**
|
|
44
44
|
* 公有
|
|
45
45
|
*/
|
|
@@ -117,7 +117,7 @@ interface IFileObjVoBase extends UploadFile {
|
|
|
117
117
|
/**
|
|
118
118
|
* 文件的权限 - 0 公开,1 私有,2 登录后可以查看
|
|
119
119
|
*/
|
|
120
|
-
permission?:
|
|
120
|
+
permission?: EPermissionEnum;
|
|
121
121
|
/**
|
|
122
122
|
* 后缀
|
|
123
123
|
*/
|
|
@@ -305,5 +305,5 @@ type StringKeys<T> = {
|
|
|
305
305
|
[K in keyof T]: T[K] extends string | undefined ? K : never;
|
|
306
306
|
}[keyof T];
|
|
307
307
|
|
|
308
|
-
export {
|
|
308
|
+
export { EPermissionEnum };
|
|
309
309
|
export type { FileUpload2Fun, IAMapCountryTree, ICommonAssistItem, IFileObjVoBase, IRoute, IUploadRef, SingleValueType, StringKeys, UploadFile, UploadFileStatus, ValueType };
|
|
@@ -6,9 +6,9 @@ var systemEnum = require('./systemEnum.cjs');
|
|
|
6
6
|
|
|
7
7
|
|
|
8
8
|
|
|
9
|
-
Object.defineProperty(exports, "
|
|
9
|
+
Object.defineProperty(exports, "EPermissionEnum", {
|
|
10
10
|
enumerable: true,
|
|
11
|
-
get: function () { return comm.
|
|
11
|
+
get: function () { return comm.EPermissionEnum; }
|
|
12
12
|
});
|
|
13
13
|
exports.defaultTableData = defaultData.defaultTableData;
|
|
14
14
|
Object.defineProperty(exports, "AppRunModeEnum", {
|
|
@@ -1,4 +1,4 @@
|
|
|
1
1
|
export { IAsyncTaskScheduleVo } from './asyncTaskScheduleVo.js';
|
|
2
|
-
export { FileUpload2Fun, IAMapCountryTree, ICommonAssistItem, IFileObjVoBase, IRoute, IUploadRef, SingleValueType, StringKeys, UploadFile, UploadFileStatus, ValueType
|
|
2
|
+
export { EPermissionEnum, FileUpload2Fun, IAMapCountryTree, ICommonAssistItem, IFileObjVoBase, IRoute, IUploadRef, SingleValueType, StringKeys, UploadFile, UploadFileStatus, ValueType } from './comm.js';
|
|
3
3
|
export { defaultTableData } from './defaultData.js';
|
|
4
4
|
export { AppRunModeEnum, StorageKeyEnum } from './systemEnum.js';
|
package/dist/core/index.d.ts
CHANGED
|
@@ -1,5 +1,7 @@
|
|
|
1
1
|
import * as dayjs from 'dayjs';
|
|
2
|
-
import {
|
|
2
|
+
import { IListChangeVo } from './arrayUtils/index.js';
|
|
3
|
+
import { IEnumObj } from '../form/types.js';
|
|
4
|
+
import { IOptions2, ITreeNode, IOptions } from '../types/data/index.js';
|
|
3
5
|
import { AsyncQueue } from './asyncUtils/index.js';
|
|
4
6
|
import * as index from './constants/index.js';
|
|
5
7
|
|
|
@@ -16,6 +18,29 @@ declare const _default: {
|
|
|
16
18
|
difference<T>(arr1: T[], arr2: T[]): T[];
|
|
17
19
|
groupBy<T, K extends string | number | symbol>(arr: T[], keyFn: (item: T) => K): Record<K, T[]>;
|
|
18
20
|
getListId(s: string, optList: IOptions2[], key: string): any;
|
|
21
|
+
uniqueBy: (arr: any[], key: string) => any[];
|
|
22
|
+
updateArray: <T = any>(array: T[], item: T) => void;
|
|
23
|
+
remove: (array: any[], item: any, id: any) => any[] | undefined;
|
|
24
|
+
isEqual: (arr1?: any[], arr2?: any[]) => boolean;
|
|
25
|
+
clone: (from: any[]) => any[];
|
|
26
|
+
subSet: (arr1: any[], arr2: any[]) => any[];
|
|
27
|
+
getItemByKey: <T = any>(itemList: T[], v: any, k?: string) => T;
|
|
28
|
+
dimTreeReduction: (treeData: ITreeNode[], nodeKeys: string[], nodes: ITreeNode[]) => void;
|
|
29
|
+
dimTreeReduction2: (treeData: ITreeNode[]) => {
|
|
30
|
+
nodes: ITreeNode[];
|
|
31
|
+
nodeKeys: string[];
|
|
32
|
+
};
|
|
33
|
+
removePNode: (nodeList: any[]) => any[];
|
|
34
|
+
toEnum: (arr: IOptions<string>[]) => IEnumObj;
|
|
35
|
+
toArrayByKeys: (obj: Record<string, any>, keys: string[]) => void;
|
|
36
|
+
toNumArrayByKeys: (obj: Record<string, any>, keys: string[]) => void;
|
|
37
|
+
toStringByKeys: (obj: Record<string, any>, keys: string[], str?: string, joinAll?: boolean) => void;
|
|
38
|
+
joinAll: (obj: Record<string, any>, keys: string[]) => void;
|
|
39
|
+
join: (obj: Record<string, any>, keys: string[]) => void;
|
|
40
|
+
findChangeData: (oldData: string[], newData: string[], key: string) => IListChangeVo;
|
|
41
|
+
toArray: (str: string | string[] | undefined | null, splitStr?: string) => string[] | null;
|
|
42
|
+
isChangeArray: (oldObj: Record<string, any[]>, newObj: Record<string, any[]>) => boolean;
|
|
43
|
+
arrayMove<T>(array: T[], from: number, to: number): T[];
|
|
19
44
|
};
|
|
20
45
|
stringUtils: {
|
|
21
46
|
capitalize(str: string): string;
|