| | |
| | | if (str.url != null && str.type == 2 && str.isShow == 1) { |
| | | return str; |
| | | } |
| | | |
| | | }) |
| | | var layer = std.filter((str) => { |
| | | if (str.isProject == 1 && str.type == 2) { |
| | | this.$store.state.isProjectLayer.push(str); |
| | | } |
| | | }) |
| | | |
| | | this.setAddLayers(value); |
| | | |
| | | var res = this.setTreeData(val); |
| | | this.$store.state.pigCode = null; |
| | | //存储选中图层 |
| | |
| | | // } |
| | | // }); |
| | | // } |
| | | |
| | | this.$store.state.oldTree = val; |
| | | this.$store.state.treeData = res; |
| | | |
| | | this.$store.state.checkedKeys = checkKey; |
| | |
| | | return cloneData.filter((father) => { |
| | | // 循环所有项 |
| | | let branchArr = cloneData.filter((child) => father.id == child.pid); // 对比ID,分别上下级菜单,并返回数据 |
| | | if (branchArr.length > 0) { |
| | | branchArr.sort(function (a, b) { |
| | | |
| | | return a.orderNum - b.orderNum |
| | | }) |
| | | } |
| | | branchArr.length > 0 ? (father.children = branchArr) : ""; // 给父级添加一个children属性,并赋值 |
| | | // 属于同一对象问题,例如:令 a=b、c=1 ,然后再令 b.c=c , 那么 a.c=b.c=c=1 ;同理,后续令 c.d=2 ,那么 a.c.d 也是=2; |
| | | // 由此循环多次后,就能形成相应的树形数据结构 |
| | |
| | | arr[vla.alias] = valste[vla.field] |
| | | } |
| | | } |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | arr['eventid'] = valste.eventid |
| | | |