|
@@ -17,6 +17,7 @@ let tree_Data_Helper = {
|
|
|
}
|
|
}
|
|
|
return tmpNodeRst;
|
|
return tmpNodeRst;
|
|
|
};
|
|
};
|
|
|
|
|
+ let handledSiblings_Next = []; //保存已经处理过的兄弟节点,如果next数组有,表示有问题了,要赶紧退出来
|
|
|
let private_buildNodeData = function(parentItem, idArr, treeLevel, tbID) {
|
|
let private_buildNodeData = function(parentItem, idArr, treeLevel, tbID) {
|
|
|
let iter = [], nextNode = private_getStartNode(idArr), pushedIds = [];
|
|
let iter = [], nextNode = private_getStartNode(idArr), pushedIds = [];
|
|
|
while (nextNode !== null && nextNode !== undefined ) {
|
|
while (nextNode !== null && nextNode !== undefined ) {
|
|
@@ -76,6 +77,13 @@ let tree_Data_Helper = {
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
|
|
+ } else {
|
|
|
|
|
+ if (handledSiblings_Next.indexOf(nextNode[NODE_ID]) >= 0) {
|
|
|
|
|
+ // 有重复next引用情况,强硬退出!!!
|
|
|
|
|
+ break;
|
|
|
|
|
+ } else {
|
|
|
|
|
+ handledSiblings_Next.push(nextNode[NODE_ID]);
|
|
|
|
|
+ }
|
|
|
}
|
|
}
|
|
|
}
|
|
}
|
|
|
pushedIds = [];
|
|
pushedIds = [];
|