|
@@ -940,7 +940,8 @@ const addTreeNodeCheckChange = (nodes) => {
|
|
|
for (let i = 0; i < keys.length; i++) {
|
|
for (let i = 0; i < keys.length; i++) {
|
|
|
NodesArr.push({
|
|
NodesArr.push({
|
|
|
nodeName: keys[i].nodeName,
|
|
nodeName: keys[i].nodeName,
|
|
|
- primaryKeyId: keys[i].pkeyId
|
|
|
|
|
|
|
+ primaryKeyId: keys[i].pkeyId,
|
|
|
|
|
+ isPeer:keys[i].isPeer||2,
|
|
|
})
|
|
})
|
|
|
}
|
|
}
|
|
|
allSelectedList.value = NodesArr
|
|
allSelectedList.value = NodesArr
|
|
@@ -949,7 +950,8 @@ const addTreeNodeCheckChange = (nodes) => {
|
|
|
for (let i = 0; i < halfNodes.length; i++) {
|
|
for (let i = 0; i < halfNodes.length; i++) {
|
|
|
halfArr.push({
|
|
halfArr.push({
|
|
|
nodeName: halfNodes[i].nodeName,
|
|
nodeName: halfNodes[i].nodeName,
|
|
|
- primaryKeyId: halfNodes[i].pkeyId
|
|
|
|
|
|
|
+ primaryKeyId: halfNodes[i].pkeyId,
|
|
|
|
|
+ isPeer:halfNodes[i].isPeer||2,
|
|
|
})
|
|
})
|
|
|
}
|
|
}
|
|
|
halfSelectedList.value = halfArr
|
|
halfSelectedList.value = halfArr
|
