1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
import {message} from 'antd';
import {dictionaryAdd, dictionaryDelete, dictionaryList, dictionaryUpdate} from '../../services/admin';
export default {
namespace: 'dictionaryList',
state: {
list: [],
},
effects: {
*add({ payload }, { call, put }) {
const { callback, body } = payload;
const response = yield call(dictionaryAdd, body);
if (callback) {
callback(response);
}
yield put({
type: 'tree',
payload: {},
});
},
*update({ payload }, { call, put }) {
const { callback, body } = payload;
const response = yield call(dictionaryUpdate, body);
if (callback) {
callback(response);
}
yield put({
type: 'tree',
payload: {},
});
},
*delete({ payload }, { call, put }) {
const response = yield call(dictionaryDelete, payload);
message.info('删除成功!');
// yield put({
// type: 'treeSuccess',
// payload: {
// list: response.data,
// },
// });
yield put({
type: 'tree',
payload: {},
});
},
*tree({ payload }, { call, put }) {
const { queryParams } = payload;
const response = yield call(dictionaryList, queryParams);
message.info('查询成功!');
// 将数据格式化成 tree 格式
// debugger;
let treeNodeMap = new Map(); // key: enumValue value: Node
for(let i = 0, len = response.data.length; i < len; i++){
let dataDict = response.data[i];
let treeNode = treeNodeMap.get(dataDict.enumValue);
if (!treeNode) {
treeNode = {
enumValue: dataDict.enumValue,
children: [dataDict]
};
treeNodeMap.set(dataDict.enumValue, treeNode);
treeNode.index = dataDict.enumValue; // 因为 Table 必须要有 rowKey ，所以这里需要处理下。主要是数据字典的结构特殊
} else {
treeNode.children.push(dataDict);
}
dataDict.index = dataDict.id; // 因为 Table 必须要有 rowKey ，所以这里需要处理下。主要是数据字典的结构特殊
}
// 因为不支持 Map.values() 返回的结果，所以这里进行转换。
let list = [];
treeNodeMap.forEach(function (value, key, map) {
list.push(value)
});
// console.log(list);
yield put({
type: 'treeSuccess',
payload: {
list: list,
},
});
},
},
reducers: {
treeSuccess(state, { payload }) {
return {
...state,
...payload,
};
},
},
};