path_tree.js 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417
  1. /**
  2. * 构建pathTree
  3. * 可动态加载子节点,要求子节点获取接口按/xxx/get-children定义
  4. * @param {Object} setting - 设置
  5. * @returns {PathTree}
  6. */
  7. const createNewPathTree = function (setting) {
  8. const treeSetting = JSON.parse(JSON.stringify(setting));
  9. const itemsPre = 'id_';
  10. const PathTree = function () {
  11. // 无索引
  12. this.datas = [];
  13. // 以key为索引
  14. this.items = {};
  15. // 以排序为索引
  16. this.nodes = [];
  17. };
  18. const proto = PathTree.prototype;
  19. /**
  20. * 树结构根据显示排序
  21. */
  22. proto.sortTreeNode = function () {
  23. const self = this;
  24. const addSortNodes = function (nodes) {
  25. for (let i = 0; i < nodes.length; i++) {
  26. self.nodes.push(nodes[i]);
  27. addSortNodes(self.getChildren(nodes[i]));
  28. }
  29. };
  30. self.nodes = [];
  31. addSortNodes(this.getChildren(null));
  32. };
  33. /**
  34. * 加载数据(初始化), 并给数据添加部分树结构必须数据
  35. * @param datas
  36. */
  37. proto.loadDatas = function (datas) {
  38. // 清空旧数据
  39. this.items = {};
  40. this.nodes = [];
  41. // 加载全部数据
  42. for (const data of datas) {
  43. const keyName = itemsPre + data[treeSetting.id];
  44. this.items[keyName] = JSON.parse(JSON.stringify(data));
  45. this.datas.push(this.items[keyName]);
  46. }
  47. this.sortTreeNode();
  48. for (const node of this.nodes) {
  49. const children = this.getChildren(node);
  50. node.expanded = children.length > 0;
  51. node.visible = true;
  52. }
  53. };
  54. /**
  55. * 加载数据(动态),只加载不同部分
  56. * @param {Array} datas
  57. * @return {Array} 加载到树的数据
  58. * @privateA
  59. */
  60. proto._updateData = function (datas) {
  61. const loadedData = [];
  62. for (const data of datas) {
  63. let node = this.getItems(data[treeSetting.id]);
  64. if (node) {
  65. for (const prop in node) {
  66. if (data[prop] !== undefined) {
  67. node[prop] = data[prop];
  68. }
  69. }
  70. loadedData.push(node);
  71. }
  72. }
  73. for (const node of loadedData) {
  74. const children = this.getChildren(node);
  75. node.expanded = children.length > 0 && children[0].visible;
  76. }
  77. this.sortTreeNode();
  78. return loadedData;
  79. };
  80. /**
  81. * 加载数据(动态),只加载不同部分
  82. * @param {Array} datas
  83. * @return {Array} 加载到树的数据
  84. * @privateA
  85. */
  86. proto._loadData = function (datas) {
  87. const loadedData = [];
  88. for (const data of datas) {
  89. let node = this.getItems(data[treeSetting.id]);
  90. if (node) {
  91. for (const prop in node) {
  92. if (data[prop] !== undefined) {
  93. node[prop] = data[prop];
  94. }
  95. }
  96. loadedData.push(node);
  97. } else {
  98. const keyName = itemsPre + data[treeSetting.id];
  99. const node = JSON.parse(JSON.stringify(data));
  100. this.items[keyName] = node;
  101. this.datas.push(node);
  102. node.expanded = false;
  103. node.visible = true;
  104. loadedData.push(node);
  105. }
  106. }
  107. this.sortTreeNode();
  108. for (const node of loadedData) {
  109. const children = this.getChildren(node);
  110. if (!node.expanded && children.length > 0) {
  111. node.expanded = true;
  112. this._refreshChildrenVisible(node);
  113. }
  114. }
  115. return loadedData;
  116. };
  117. /**
  118. * 清理数据(动态)
  119. * @param datas
  120. * @private
  121. */
  122. proto._freeData = function (datas) {
  123. const removeArrayData = function (array, data) {
  124. const index = array.indexOf(data);
  125. array.splice(index, 1);
  126. };
  127. for (const data of datas) {
  128. const node = this.getItems(data[treeSetting.id]);
  129. if (node) {
  130. delete this.items[itemsPre + node[treeSetting.id]];
  131. removeArrayData(this.datas, node);
  132. removeArrayData(this.nodes, node);
  133. }
  134. }
  135. };
  136. /**
  137. * 加载需展开的数据
  138. * @param {Array} datas
  139. * @returns {Array}
  140. * @private
  141. */
  142. proto._loadExpandData = function (datas) {
  143. const loadedData = [], existData = [], expandData = [];
  144. for (const data of datas) {
  145. let node = this.getItems(data[treeSetting.id]);
  146. if (node) {
  147. existData.push(node);
  148. } else {
  149. const keyName = itemsPre + data[treeSetting.id];
  150. const node = JSON.parse(JSON.stringify(data));
  151. this.items[keyName] = node;
  152. this.datas.push(node);
  153. node.expanded = false;
  154. node.visible = true;
  155. loadedData.push(node);
  156. }
  157. }
  158. this.sortTreeNode();
  159. for (const node of loadedData) {
  160. const children = this.getChildren(node);
  161. if (!node.expanded && children.length > 0) {
  162. node.expaned = true;
  163. this._refreshChildrenVisible(node);
  164. }
  165. }
  166. for (const node of existData) {
  167. const children = this.getChildren(node);
  168. if (!node.expanded && children.length > 0) {
  169. node.expanded = children.length > 0;
  170. this._refreshChildrenVisible(node);
  171. expandData.push(node);
  172. }
  173. }
  174. return [loadedData, expandData];
  175. };
  176. /**
  177. * 根据id获取树结构节点数据
  178. * @param {Number} id
  179. * @returns {Object}
  180. */
  181. proto.getItems = function (id) {
  182. return this.items[itemsPre + id];
  183. };
  184. /**
  185. * 查找node的parent
  186. * @param {Object} node
  187. * @returns {Object}
  188. */
  189. proto.getParent = function (node) {
  190. return this.getItems(node[treeSetting.pid]);
  191. };
  192. /**
  193. * 查询node的已下载子节点
  194. * @param {Object} node
  195. * @returns {Array}
  196. */
  197. proto.getChildren = function (node) {
  198. const pid = node ? node[treeSetting.id] : treeSetting.rootId;
  199. const children = this.datas.filter(function (x) {
  200. return x[treeSetting.pid] === pid;
  201. });
  202. children.sort(function (a, b) {
  203. return a.order - b.order;
  204. });
  205. return children;
  206. };
  207. /**
  208. * 查询node的已下载的全部后代
  209. * @param {Object} node
  210. * @returns {Array}
  211. */
  212. proto.getPosterity = function (node) {
  213. const reg = new RegExp('^' + node.full_path + '.');
  214. return this.datas.filter(function (x) {
  215. return reg.test(x.full_path);
  216. })
  217. };
  218. /**
  219. * 查询node是否是父节点的最后一个子节点
  220. * @param {Object} node
  221. * @returns {boolean}
  222. */
  223. proto.isLastSibling = function (node) {
  224. const siblings = this.getChildren(this.getParent(node));
  225. return node.order === siblings[siblings.length - 1].order;
  226. };
  227. /**
  228. * 刷新子节点是否可见
  229. * @param {Object} node
  230. * @private
  231. */
  232. proto._refreshChildrenVisible = function (node) {
  233. const children = this.getChildren(node);
  234. for (const child of children) {
  235. child.visible = node.expanded && node.visible;
  236. this._refreshChildrenVisible(child);
  237. }
  238. }
  239. /**
  240. * 设置节点是否展开, 并控制子节点可见
  241. * @param {Object} node
  242. * @param {Boolean} expanded
  243. */
  244. proto.setExpanded = function (node, expanded) {
  245. node.expanded = expanded;
  246. this._refreshChildrenVisible(node);
  247. };
  248. /**
  249. * 提取节点key和索引数据
  250. * @param {Object} node - 节点
  251. * @returns {key}
  252. */
  253. proto.getNodeKeyData = function (node) {
  254. const data = {};
  255. for (const key of treeSetting.keys) {
  256. data[key] = node[key];
  257. }
  258. return data;
  259. }
  260. /**
  261. * 得到树结构构成id
  262. * @param node
  263. * @returns {*}
  264. */
  265. proto.getNodeKey = function (node) {
  266. return node[treeSetting.id];
  267. }
  268. /**
  269. * 以下方法需等待响应, 通过callback刷新界面
  270. */
  271. /**
  272. * 加载子节点
  273. * @param {Object} node
  274. * @param {function} callback
  275. */
  276. proto.loadChildren = function (node, callback) {
  277. const self = this;
  278. const url = treeSetting.preUrl ? treeSetting.preUrl + '/get-children' : 'get-children';
  279. console.log(url);
  280. postData(url, this.getNodeKeyData(node), function (data) {
  281. self._loadData(data);
  282. callback();
  283. });
  284. };
  285. /**
  286. * 树结构基本操作
  287. * @param {String} url - 请求地址
  288. * @param {Object} node - 操作节点
  289. * @param {String} type - 操作类型
  290. * @param {function} callback - 界面刷新
  291. */
  292. proto.baseOperation = function (url, node, type, callback) {
  293. const self = this;
  294. const data = {
  295. id: node[treeSetting.id],
  296. postType: type
  297. };
  298. postData(url, data, function (datas) {
  299. const result = {};
  300. if (datas.update) {
  301. result.update = self._updateData(datas.update);
  302. }
  303. if (datas.create) {
  304. result.create = self._loadData(datas.create);
  305. }
  306. if (datas.delete) {
  307. result.delete = self._freeData(datas.delete);
  308. }
  309. callback(result);
  310. });
  311. };
  312. /**
  313. * 节点数据编辑
  314. * @param {String} url - 请求地址
  315. * @param {Array|Object} updateData - 需更新的数据
  316. * @param {function} callback - 界面刷新
  317. */
  318. proto.update = function (url, updateData, callback) {
  319. const self = this;
  320. postData(url, updateData, function (datas) {
  321. const result = self._updateData(datas);
  322. callback(result);
  323. }, function () {
  324. if (updateData instanceof Array) {
  325. const result = [];
  326. for (const data of updateData) {
  327. result.push(self.getItems(data[treeSetting.id]));
  328. }
  329. callback(result)
  330. } else {
  331. callback([self.getItems(updateData[treeSetting.id])]);
  332. }
  333. });
  334. };
  335. /**
  336. * 复制粘贴整块(目前仅可粘贴为后项)
  337. * @param {String} url - 请求地址
  338. * @param {Object} node - 操作节点
  339. * @param {Array} block - 被复制整块的节点列表
  340. * @param {function} callback - 界面刷新
  341. */
  342. proto.pasteBlock = function (url, node, block, callback) {
  343. const self = this;
  344. const data = {
  345. id: node[treeSetting.id],
  346. block: block
  347. };
  348. postData(url, data, function (datas) {
  349. const result = {};
  350. if (datas.update) {
  351. result.update = self._updateData(datas.update);
  352. }
  353. if (datas.create) {
  354. result.create = self._loadData(datas.create);
  355. }
  356. if (datas.delete) {
  357. result.delete = self._freeData(datas.delete);
  358. }
  359. callback(result);
  360. });
  361. };
  362. /**
  363. * 提交数据
  364. * @param {String} url - 请求地址
  365. * @param {Object} node - 当前选中节点
  366. * @param {Object} data - 提交的数据
  367. * @param {function} callback - 界面刷新
  368. */
  369. proto.postData = function (url, node, data, callback) {
  370. const self = this;
  371. data.id = node[treeSetting.id];
  372. postData(url, data, function (datas) {
  373. const result = {};
  374. if (datas.update) {
  375. result.update = self._updateData(datas.update);
  376. }
  377. if (datas.create) {
  378. result.create = self._loadData(datas.create);
  379. }
  380. if (datas.delete) {
  381. result.delete = self._freeData(datas.delete);
  382. }
  383. if (datas.expand) {
  384. const [create, update] = self._loadExpandData(datas.expand);
  385. result.create = result.create.concat(create);
  386. result.expand = update;
  387. }
  388. callback(result);
  389. });
  390. };
  391. proto.batchInsert = function (url, node, data, callback) {
  392. const self = this;
  393. data.id = node[treeSetting.id];
  394. postData(url, data, function (datas) {
  395. const result = {};
  396. if (datas.update) {
  397. result.update = self._updateData(datas.update);
  398. }
  399. if (datas.create) {
  400. result.create = self._loadData(datas.create);
  401. }
  402. if (datas.delete) {
  403. result.delete = self._freeData(datas.delete);
  404. }
  405. callback(result);
  406. });
  407. }
  408. return new PathTree();
  409. }