treeDataHelper.js 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  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", EMPTY_ID_VAL = -1;
  5. let tree_Data_Helper = {
  6. buildTreeNodeDirectly: function(data) {
  7. let topArr = [], rst = [], tmpNodes = {}, prefix = "id_";
  8. let private_getTopNode = function (idArr) {
  9. let tmpNodeRst = null;
  10. for (let i = 0; i < idArr.length; i++) {
  11. if (parseInt(tmpNodes[prefix + idArr[i]][ADHOC_PRE_ID]) === EMPTY_ID_VAL) {
  12. tmpNodeRst = tmpNodes[prefix + idArr[i]];
  13. break;
  14. }
  15. }
  16. return tmpNodeRst;
  17. };
  18. let private_buildNodeData = function(parentItem, idArr) {
  19. let iter = [], nextNode = private_getTopNode(idArr);
  20. while (nextNode !== null && nextNode !== undefined ) {
  21. if (parentItem) {
  22. parentItem[CHILDREN_NODE].push(nextNode);
  23. } else {
  24. rst.push(nextNode);
  25. }
  26. iter.push(nextNode);
  27. nextNode = tmpNodes[prefix + nextNode[NEXT_ID]];
  28. }
  29. for (let i = 0; i < iter.length; i++) {
  30. private_buildNodeData(iter[i], iter[i][SUB_ID]);
  31. }
  32. };
  33. for (let i = 0; i < data.length; i++) {
  34. tmpNodes[prefix + data[i][NODE_ID]] = data[i];
  35. data[i][ADHOC_PRE_ID] = EMPTY_ID_VAL;
  36. data[i][SUB_ID] = [];
  37. data[i][CHILDREN_NODE] = [];
  38. if (parseInt(data[i][P_ID]) === EMPTY_ID_VAL) {
  39. topArr.push(data[i][NODE_ID]);
  40. }
  41. }
  42. for (let i = 0; i < data.length; i++) {
  43. if (parseInt(data[i][NEXT_ID]) !== EMPTY_ID_VAL) {
  44. if (tmpNodes[prefix + data[i][NEXT_ID]] !== undefined){
  45. tmpNodes[prefix + data[i][NEXT_ID]][ADHOC_PRE_ID] = data[i][NODE_ID];
  46. }
  47. }
  48. if (parseInt(data[i][P_ID]) !== EMPTY_ID_VAL) {
  49. tmpNodes[prefix + data[i][P_ID]][SUB_ID].push(data[i][NODE_ID]);
  50. }
  51. }
  52. private_buildNodeData(null, topArr);
  53. //try to release and return
  54. tmpNodes = null;
  55. topArr.length = 0;
  56. return rst;
  57. },
  58. getFlatArray: function (srcArr, destArr) {
  59. let private_put = function (parentItem) {
  60. destArr.push(parentItem);
  61. if (parentItem.items) {
  62. for (let subItem of parentItem.items) {
  63. private_put(subItem);
  64. }
  65. }
  66. }
  67. for (let node of srcArr) {
  68. private_put(node);
  69. }
  70. for (let item of destArr) {
  71. delete item[CHILDREN_NODE];
  72. delete item[SUB_ID];
  73. delete item[ADHOC_PRE_ID];
  74. }
  75. }
  76. // reSettleRelatedID: function(treeData) {
  77. // if (treeData && treeData.length > 0) {
  78. // for (let i = 0; i < treeData[CHILDREN_NODE].length; i++) {
  79. // let nI = null;
  80. // if (i < treeData[CHILDREN_NODE].length - 1) {
  81. // nI = treeData[CHILDREN_NODE][i+1];
  82. // }
  83. // settleNodeRelatedID(null, nI, treeData[CHILDREN_NODE][i]);
  84. // }
  85. // }
  86. // },
  87. // settleNodeRelatedID : function(parentItem, nextItem, node) {
  88. // if (parentItem) {
  89. // node[P_ID] = parentItem[NODE_ID];
  90. // } else {
  91. // node[P_ID] = EMPTY_ID_VAL;
  92. // }
  93. // if (nextItem) {
  94. // node[NEXT_ID] = nextItem[NODE_ID];
  95. // } else {
  96. // node[NEXT_ID] = EMPTY_ID_VAL;
  97. // }
  98. // for (let i = 0; i < node[CHILDREN_NODE].length; i++) {
  99. // let nI = null;
  100. // if (i < node[CHILDREN_NODE].length - 1) {
  101. // nI = node[CHILDREN_NODE][i+1];
  102. // }
  103. // private_settleNodeRelatedID(node, nI, node[CHILDREN_NODE][i]);
  104. // }
  105. // }
  106. };