Commit 9ab22965 by lp784568205

新增数组去重方法

parent 0b46422a
......@@ -692,6 +692,7 @@ export default {
// this.dataAll.gen = [ ...res.data.rows,...this.dataAll.gen ]
// }
// })
},
async mounted() {
this.setGraphData();
......@@ -929,6 +930,19 @@ export default {
text: row.value,
});
});
for (let i = 0; i < linkarr.length; i++) {
let j = i++;
let a = linkarr[i].form;
let b = linkarr[i].to;
for (let j = i + 1; j < linkarr.length; j++) {
let c = linkarr[j].form;
let d = linkarr[j].to;
if ((a == c && b == d) || (a == d && b == c)) {
linkarr.splice(j, 1);
}
}
}
this.$refs.seeksRelationGraph.appendJsonData(
{
nodes: nodearr,
......@@ -1076,6 +1090,18 @@ export default {
text: row.value,
});
});
for (let i = 0; i < linkarr.length; i++) {
let j = i++;
let a = linkarr[i].form;
let b = linkarr[i].to;
for (let j = i + 1; j < linkarr.length; j++) {
let c = linkarr[j].form;
let d = linkarr[j].to;
if ((a == c && b == d) || (a == d && b == c)) {
linkarr.splice(j, 1);
}
}
}
this.$refs.seeksRelationGraph.appendJsonData(
{
nodes: nodearr,
......@@ -1284,6 +1310,18 @@ export default {
text: row.value,
});
});
for (let i = 0; i < linkarr.length; i++) {
let j = i++;
let a = linkarr[i].form;
let b = linkarr[i].to;
for (let j = i + 1; j < linkarr.length; j++) {
let c = linkarr[j].form;
let d = linkarr[j].to;
if ((a == c && b == d) || (a == d && b == c)) {
linkarr.splice(j, 1);
}
}
}
this.$refs.seeksRelationGraph.appendJsonData(
{
nodes: nodearr,
......@@ -1403,6 +1441,18 @@ export default {
text: row.value,
});
});
for (let i = 0; i < linkarr.length; i++) {
let j = i++;
let a = linkarr[i].form;
let b = linkarr[i].to;
for (let j = i + 1; j < linkarr.length; j++) {
let c = linkarr[j].form;
let d = linkarr[j].to;
if ((a == c && b == d) || (a == d && b == c)) {
linkarr.splice(j, 1);
}
}
}
this.$refs.seeksRelationGraph.appendJsonData(
{
nodes: nodearr,
......@@ -1913,6 +1963,18 @@ export default {
text: row.value,
});
});
for (let i = 0; i < linkarr.length; i++) {
let j = i++;
let a = linkarr[i].form;
let b = linkarr[i].to;
for (let j = i + 1; j < linkarr.length; j++) {
let c = linkarr[j].form;
let d = linkarr[j].to;
if ((a == c && b == d) || (a == d && b == c)) {
linkarr.splice(j, 1);
}
}
}
this.$refs.seeksRelationGraph.appendJsonData(
{
nodes: nodearr,
......@@ -2328,6 +2390,15 @@ export default {
return "";
}
},
//数组去重
unique(arr) {
// 根据唯一标识orderId来对数组进行过滤
const res = new Map(); //定义常量 res,值为一个Map对象实例
//返回arr数组过滤后的结果,结果为一个数组 过滤条件是,如果res中没有某个键,就设置这个键的值为1
return arr.filter(
(arr) => !res.has(arr.OrderId) && res.set(arr.OrderId, 1)
);
},
},
};
</script>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment