|
@@ -7,14 +7,14 @@ let tree_Data_Helper = {
|
|
|
buildTreeNodeDirectly: function(data) {
|
|
|
let topArr = [], rst = [], tmpNodes = {}, prefix = "id_";
|
|
|
let private_getTopNode = function (idArr) {
|
|
|
- let rst = null;
|
|
|
+ let tmpNodeRst = null;
|
|
|
for (let i = 0; i < idArr.length; i++) {
|
|
|
- if (tmpNodes[prefix + idArr[i]][ADHOC_PRE_ID] === EMPTY_ID_VAL) {
|
|
|
- rst = tmpNodes[prefix + idArr[i]];
|
|
|
+ if (parseInt(tmpNodes[prefix + idArr[i]][ADHOC_PRE_ID]) === EMPTY_ID_VAL) {
|
|
|
+ tmpNodeRst = tmpNodes[prefix + idArr[i]];
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
- return rst;
|
|
|
+ return tmpNodeRst;
|
|
|
};
|
|
|
let private_buildNodeData = function(parentItem, idArr) {
|
|
|
let iter = [], nextNode = private_getTopNode(idArr);
|
|
@@ -37,15 +37,17 @@ let tree_Data_Helper = {
|
|
|
data[i][ADHOC_PRE_ID] = EMPTY_ID_VAL;
|
|
|
data[i][SUB_ID] = [];
|
|
|
data[i][CHILDREN_NODE] = [];
|
|
|
- if (data[i][P_ID] === EMPTY_ID_VAL) {
|
|
|
+ if (parseInt(data[i][P_ID]) === EMPTY_ID_VAL) {
|
|
|
topArr.push(data[i][NODE_ID]);
|
|
|
}
|
|
|
}
|
|
|
for (let i = 0; i < data.length; i++) {
|
|
|
- if (data[i][NEXT_ID] !== EMPTY_ID_VAL) {
|
|
|
- tmpNodes[prefix + data[i][NEXT_ID]][ADHOC_PRE_ID] = data[i][NODE_ID];
|
|
|
+ if (parseInt(data[i][NEXT_ID]) !== EMPTY_ID_VAL) {
|
|
|
+ if (tmpNodes[prefix + data[i][NEXT_ID]] !== undefined){
|
|
|
+ tmpNodes[prefix + data[i][NEXT_ID]][ADHOC_PRE_ID] = data[i][NODE_ID];
|
|
|
+ }
|
|
|
}
|
|
|
- if (data[i][P_ID] !== EMPTY_ID_VAL) {
|
|
|
+ if (parseInt(data[i][P_ID]) !== EMPTY_ID_VAL) {
|
|
|
tmpNodes[prefix + data[i][P_ID]][SUB_ID].push(data[i][NODE_ID]);
|
|
|
}
|
|
|
}
|