Browse Source

拿到数据后递归处理这个树形结构,只拿level为district street community的

feature
是小王呀\24601 1 year ago
parent
commit
46b1c89e39
  1. 58
      src/views/modules/resourceManagement/enterprise/addForm.vue

58
src/views/modules/resourceManagement/enterprise/addForm.vue

@ -414,32 +414,40 @@ export default {
this.formData.agencyId = val.length ? val[val.length - 1] : val[0]; this.formData.agencyId = val.length ? val[val.length - 1] : val[0];
}, },
getOrgTreeList() { getOrgTreeList() {
this.$http this.$http
                .post('/gov/org/customeragency/agencygridtree', {}) .post('/gov/org/customeragency/agencygridtree', {})
                .then(({ data: res }) => { .then(({ data: res }) => {
                    if (res.code !== 0) { if (res.code !== 0) {
                        return this.$message.error(res.msg) return this.$message.error(res.msg);
                    } else { } else {
                        console.log('获取组织树成功', res.data) console.log('获取组织树成功', res.data);
                        // this.orgOptions = []
                        // this.orgOptions.push(res.data)
                        const filteredData = {
                            ...res.data,
                            subAgencyList: res.data.subAgencyList.filter(item => ["district", "street", "community"].includes(item.level))
                        };
                        this.orgOptions = []
                        this.orgOptions.push(filteredData)
                        filteredData.subAgencyList.forEach(item => {
                            console.log(item.level);
                        });
                        console.log('获取组织树成功111', this.orgOptions)
                    }
                }) // level "district""street" "community"
                .catch(() => { this.orgOptions = this.filterOrgTree(res.data);
                    return this.$message.error('网络错误')
                }) console.log('获取组织树成功111', this.orgOptions);
        }, }
})
.catch(() => {
return this.$message.error('网络错误');
});
},
filterOrgTree(treeData) {
const filteredTree = { ...treeData }; //
//
if (filteredTree.subAgencyList && filteredTree.subAgencyList.length > 0) {
filteredTree.subAgencyList = filteredTree.subAgencyList.filter(node => {
return ["district", "street", "community"].includes(node.level); // level "district""street" "community"
}).map(node => {
// filterOrgTree
return this.filterOrgTree(node);
});
}
return filteredTree;
},
addInput() { addInput() {
if (this.inputList.some(item => item.hazardDesc.trim() === '')) { if (this.inputList.some(item => item.hazardDesc.trim() === '')) {
} else { } else {

Loading…
Cancel
Save