treeDataHelper.js 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /**
  2. * Created by Tony on 2017/1/23.
  3. */
  4. const NODE_ID = "ID", P_ID = "ParentID", NEXT_ID = "NextSiblingID", ADHOC_PRE_ID="Previous_ID", CHILDREN_NODE = "items", SUB_ID = "sub_ids",
  5. EMPTY_ID_VAL = -1, TREE_LEVEL = 'treeLevel', TOP_BILL_ID = "topBillID";
  6. let tree_Data_Helper = {
  7. buildTreeNodeDirectly: function(data, addLevel) {
  8. let topArr = [], rst = [], tmpNodes = {}, prefix = "id_";
  9. let private_getStartNode = function (idArr) {
  10. let tmpNodeRst = null;
  11. for (let i = 0; i < idArr.length; i++) {
  12. if (parseInt(tmpNodes[prefix + idArr[i]][ADHOC_PRE_ID]) === EMPTY_ID_VAL) {
  13. tmpNodeRst = tmpNodes[prefix + idArr[i]];
  14. break;
  15. }
  16. }
  17. return tmpNodeRst;
  18. };
  19. let private_buildNodeData = function(parentItem, idArr, treeLevel, tbID) {
  20. let iter = [], nextNode = private_getStartNode(idArr), pushedIds = [];
  21. while (nextNode !== null && nextNode !== undefined ) {
  22. if (parentItem) {
  23. parentItem[CHILDREN_NODE].push(nextNode);
  24. } else {
  25. rst.push(nextNode);
  26. }
  27. iter.push(nextNode);
  28. pushedIds.push(nextNode[NODE_ID]);
  29. nextNode[TOP_BILL_ID] = tbID;
  30. if (parentItem === null) {
  31. nextNode[TOP_BILL_ID] = nextNode[NODE_ID];
  32. if (nextNode.flags && nextNode.flags.length > 0) {
  33. for (let flag of nextNode.flags) {
  34. if (flag.fieldName === "fixed") {
  35. nextNode[TOP_BILL_ID] = flag.flag;
  36. break;
  37. }
  38. }
  39. }
  40. }
  41. if (addLevel) nextNode[TREE_LEVEL] = treeLevel;
  42. nextNode = tmpNodes[prefix + nextNode[NEXT_ID]];
  43. if (nextNode === null || nextNode === undefined) {
  44. //备注: 考虑到实际数据的健壮性,有些节点会掉链子,需要用 parentItem[SUB_ID] 比对已经加上的节点,如发现加上的节点数量不够,那就得在这里补充上去
  45. if (parentItem) {
  46. if (parentItem[SUB_ID].length > iter.length) {
  47. for (let subId of parentItem[SUB_ID]) {
  48. if (pushedIds.indexOf(subId) < 0) {
  49. let restNode = tmpNodes[prefix + subId];
  50. if (addLevel) restNode[TREE_LEVEL] = treeLevel;
  51. restNode[TOP_BILL_ID] = tbID;
  52. parentItem[CHILDREN_NODE].push(restNode);
  53. iter.push(restNode);
  54. }
  55. }
  56. }
  57. } else {
  58. if (idArr.length > iter.length) {
  59. for (let topId of idArr) {
  60. if (pushedIds.indexOf(topId) < 0) {
  61. let restNode = tmpNodes[prefix + topId];
  62. if (addLevel) restNode[TREE_LEVEL] = treeLevel;
  63. restNode[TOP_BILL_ID] = restNode[NODE_ID];
  64. if (restNode.flags && restNode.flags.length > 0) {
  65. for (let flag of restNode.flags) {
  66. if (flag.fieldName === "fixed") {
  67. restNode[TOP_BILL_ID] = flag.flag;
  68. break;
  69. }
  70. }
  71. }
  72. rst.push(restNode);
  73. iter.push(restNode);
  74. }
  75. }
  76. }
  77. }
  78. }
  79. }
  80. pushedIds = [];
  81. for (let i = 0; i < iter.length; i++) {
  82. let rtbID = tbID;
  83. if (parentItem === null) {
  84. rtbID = iter[i][TOP_BILL_ID];
  85. }
  86. private_buildNodeData(iter[i], iter[i][SUB_ID], (treeLevel + 1), rtbID);
  87. }
  88. };
  89. //1. 给每个节点设置key, 顺便找Top Node
  90. for (let i = 0; i < data.length; i++) {
  91. tmpNodes[prefix + data[i][NODE_ID]] = data[i];
  92. data[i][ADHOC_PRE_ID] = EMPTY_ID_VAL;
  93. data[i][SUB_ID] = [];
  94. data[i][CHILDREN_NODE] = [];
  95. if (parseInt(data[i][P_ID]) === EMPTY_ID_VAL) {
  96. topArr.push(data[i][NODE_ID]);
  97. }
  98. }
  99. //2. 通过key,设置好兄弟/父子关系
  100. for (let i = 0; i < data.length; i++) {
  101. if (parseInt(data[i][NEXT_ID]) !== EMPTY_ID_VAL) {
  102. if (tmpNodes[prefix + data[i][NEXT_ID]] !== undefined){
  103. if (tmpNodes[prefix + data[i][NEXT_ID]][P_ID] === data[i][P_ID]) {
  104. tmpNodes[prefix + data[i][NEXT_ID]][ADHOC_PRE_ID] = data[i][NODE_ID];
  105. } else {
  106. tmpNodes[prefix + data[i][NEXT_ID]][ADHOC_PRE_ID] = EMPTY_ID_VAL;
  107. data[i][NEXT_ID] = EMPTY_ID_VAL;
  108. }
  109. }
  110. }
  111. if (parseInt(data[i][P_ID]) !== EMPTY_ID_VAL) {
  112. tmpNodes[prefix + data[i][P_ID]][SUB_ID].push(data[i][NODE_ID]);
  113. }
  114. }
  115. //3. 开build
  116. private_buildNodeData(null, topArr, 0, -1);
  117. //try to release and return
  118. tmpNodes = null;
  119. topArr.length = 0;
  120. return rst;
  121. },
  122. getFlatArray: function (srcArr, destArr) {
  123. let private_put = function (parentItem) {
  124. destArr.push(parentItem);
  125. if (parentItem.items) {
  126. for (let subItem of parentItem.items) {
  127. private_put(subItem);
  128. }
  129. }
  130. }
  131. for (let node of srcArr) {
  132. private_put(node);
  133. }
  134. for (let item of destArr) {
  135. delete item[CHILDREN_NODE];
  136. delete item[SUB_ID];
  137. delete item[ADHOC_PRE_ID];
  138. }
  139. }
  140. // reSettleRelatedID: function(treeData) {
  141. // if (treeData && treeData.length > 0) {
  142. // for (let i = 0; i < treeData[CHILDREN_NODE].length; i++) {
  143. // let nI = null;
  144. // if (i < treeData[CHILDREN_NODE].length - 1) {
  145. // nI = treeData[CHILDREN_NODE][i+1];
  146. // }
  147. // settleNodeRelatedID(null, nI, treeData[CHILDREN_NODE][i]);
  148. // }
  149. // }
  150. // },
  151. // settleNodeRelatedID : function(parentItem, nextItem, node) {
  152. // if (parentItem) {
  153. // node[P_ID] = parentItem[NODE_ID];
  154. // } else {
  155. // node[P_ID] = EMPTY_ID_VAL;
  156. // }
  157. // if (nextItem) {
  158. // node[NEXT_ID] = nextItem[NODE_ID];
  159. // } else {
  160. // node[NEXT_ID] = EMPTY_ID_VAL;
  161. // }
  162. // for (let i = 0; i < node[CHILDREN_NODE].length; i++) {
  163. // let nI = null;
  164. // if (i < node[CHILDREN_NODE].length - 1) {
  165. // nI = node[CHILDREN_NODE][i+1];
  166. // }
  167. // private_settleNodeRelatedID(node, nI, node[CHILDREN_NODE][i]);
  168. // }
  169. // }
  170. };