|
|
|
|
@ -379,31 +379,31 @@ export class CollectionToolsReadComponent implements OnInit {
|
|
|
|
|
if (!element.parentId) { treeData.push(element) } |
|
|
|
|
}); |
|
|
|
|
|
|
|
|
|
function recursionFilterEmpty(originalList, result) { |
|
|
|
|
for(let i = 0, length = originalList.length; i < length; i++) { |
|
|
|
|
const item = originalList[i]; |
|
|
|
|
if (item.PropertyInfos) { |
|
|
|
|
// 最内层
|
|
|
|
|
result.push(item); |
|
|
|
|
} else if (item.children && item.children.length) { |
|
|
|
|
const newChildren = []; |
|
|
|
|
// 递归调用，底层的真实数据会全部 push 进 newChildren 中
|
|
|
|
|
recursionFilterEmpty(item.children, newChildren); |
|
|
|
|
if (newChildren.length) { |
|
|
|
|
// 替换原始数据
|
|
|
|
|
item.children = newChildren; |
|
|
|
|
// 子项有真实的数据，就保留这一项
|
|
|
|
|
result.push(item); |
|
|
|
|
} // 如果没有这一项就会被删除
|
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
function filterEmpty(listData) { |
|
|
|
|
const result = []; |
|
|
|
|
recursionFilterEmpty(listData, result); |
|
|
|
|
return result; |
|
|
|
|
} |
|
|
|
|
function recursionFilterEmpty(originalList, result) { |
|
|
|
|
for (let i = 0, length = originalList.length; i < length; i++) { |
|
|
|
|
const item = originalList[i]; |
|
|
|
|
if (item.PropertyInfos) { |
|
|
|
|
// 最内层
|
|
|
|
|
result.push(item); |
|
|
|
|
} else if (item.children && item.children.length) { |
|
|
|
|
const newChildren = []; |
|
|
|
|
// 递归调用，底层的真实数据会全部 push 进 newChildren 中
|
|
|
|
|
recursionFilterEmpty(item.children, newChildren); |
|
|
|
|
if (newChildren.length) { |
|
|
|
|
// 替换原始数据
|
|
|
|
|
item.children = newChildren; |
|
|
|
|
// 子项有真实的数据，就保留这一项
|
|
|
|
|
result.push(item); |
|
|
|
|
} // 如果没有这一项就会被删除
|
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
function filterEmpty(listData) { |
|
|
|
|
const result = []; |
|
|
|
|
recursionFilterEmpty(listData, result); |
|
|
|
|
return result; |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
this.dataSource.data = filterEmpty(treeData) |
|
|
|
|
|
|
|
|
|
@ -442,25 +442,25 @@ export class CollectionToolsReadComponent implements OnInit {
|
|
|
|
|
clickLookItem(node) { |
|
|
|
|
//子节点跟随父节点的islook变化
|
|
|
|
|
let iconVisibleArr: any = [] |
|
|
|
|
if(node.origin.children && node.origin.children.length != 0){ |
|
|
|
|
node.origin.isLook = !node.origin.isLook |
|
|
|
|
node.origin.children.forEach(item=>{ |
|
|
|
|
item.isLook = node.origin.isLook
|
|
|
|
|
if(item.children && item.children.length != 0){ |
|
|
|
|
item.children.forEach(i=>{ |
|
|
|
|
i.isLook = node.origin.isLook
|
|
|
|
|
if(i.children && i.children.length != 0){ |
|
|
|
|
if (node.origin.children && node.origin.children.length != 0) { |
|
|
|
|
node.origin.isLook = !node.origin.isLook |
|
|
|
|
node.origin.children.forEach(item => { |
|
|
|
|
item.isLook = node.origin.isLook |
|
|
|
|
if (item.children && item.children.length != 0) { |
|
|
|
|
item.children.forEach(i => { |
|
|
|
|
i.isLook = node.origin.isLook |
|
|
|
|
if (i.children && i.children.length != 0) { |
|
|
|
|
|
|
|
|
|
} else { |
|
|
|
|
iconVisibleArr.push(i.Id) |
|
|
|
|
} |
|
|
|
|
}) |
|
|
|
|
}else{ |
|
|
|
|
}) |
|
|
|
|
} else { |
|
|
|
|
iconVisibleArr.push(item.Id) |
|
|
|
|
} |
|
|
|
|
}) |
|
|
|
|
}else{ |
|
|
|
|
node.origin.isLook = !node.origin.isLook |
|
|
|
|
}) |
|
|
|
|
} else { |
|
|
|
|
node.origin.isLook = !node.origin.isLook |
|
|
|
|
iconVisibleArr.push(node.origin.Id) |
|
|
|
|
} |
|
|
|
|
console.log(iconVisibleArr) |
|
|
|
|
@ -490,10 +490,8 @@ export class CollectionToolsReadComponent implements OnInit {
|
|
|
|
|
}); |
|
|
|
|
|
|
|
|
|
function array_diff(a, b) { |
|
|
|
|
for(var i=0;i<b.length;i++) |
|
|
|
|
{ |
|
|
|
|
for(var j=0;j<a.length;j++) |
|
|
|
|
{ |
|
|
|
|
for (var i = 0; i < b.length; i++) { |
|
|
|
|
for (var j = 0; j < a.length; j++) { |
|
|
|
|
if (a[j].id == b[i].id) { |
|
|
|
|
a.splice(j, 1); |
|
|
|
|
j = j - 1; |
|
|
|
|
@ -626,30 +624,30 @@ export class CollectionToolsReadComponent implements OnInit {
|
|
|
|
|
treeData.push(element) |
|
|
|
|
} |
|
|
|
|
}); |
|
|
|
|
function recursionFilterEmpty(originalList, result) { |
|
|
|
|
for(let i = 0, length = originalList.length; i < length; i++) { |
|
|
|
|
const item = originalList[i]; |
|
|
|
|
if (item.PropertyInfos) { |
|
|
|
|
// 最内层
|
|
|
|
|
result.push(item); |
|
|
|
|
} else if (item.children && item.children.length) { |
|
|
|
|
const newChildren = []; |
|
|
|
|
// 递归调用，底层的真实数据会全部 push 进 newChildren 中
|
|
|
|
|
recursionFilterEmpty(item.children, newChildren); |
|
|
|
|
if (newChildren.length) { |
|
|
|
|
// 替换原始数据
|
|
|
|
|
item.children = newChildren; |
|
|
|
|
// 子项有真实的数据，就保留这一项
|
|
|
|
|
result.push(item); |
|
|
|
|
} // 如果没有这一项就会被删除
|
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
function filterEmpty(listData) { |
|
|
|
|
const result = []; |
|
|
|
|
recursionFilterEmpty(listData, result); |
|
|
|
|
return result; |
|
|
|
|
} |
|
|
|
|
function recursionFilterEmpty(originalList, result) { |
|
|
|
|
for (let i = 0, length = originalList.length; i < length; i++) { |
|
|
|
|
const item = originalList[i]; |
|
|
|
|
if (item.PropertyInfos) { |
|
|
|
|
// 最内层
|
|
|
|
|
result.push(item); |
|
|
|
|
} else if (item.children && item.children.length) { |
|
|
|
|
const newChildren = []; |
|
|
|
|
// 递归调用，底层的真实数据会全部 push 进 newChildren 中
|
|
|
|
|
recursionFilterEmpty(item.children, newChildren); |
|
|
|
|
if (newChildren.length) { |
|
|
|
|
// 替换原始数据
|
|
|
|
|
item.children = newChildren; |
|
|
|
|
// 子项有真实的数据，就保留这一项
|
|
|
|
|
result.push(item); |
|
|
|
|
} // 如果没有这一项就会被删除
|
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
function filterEmpty(listData) { |
|
|
|
|
const result = []; |
|
|
|
|
recursionFilterEmpty(listData, result); |
|
|
|
|
return result; |
|
|
|
|
} |
|
|
|
|
return filterEmpty(treeData) |
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
|
