tree.ts 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396
  1. import { expect } from 'chai';
  2. import cloneDeep from 'lodash/cloneDeep';
  3. import { Tree, TreeNode, TreeRaw } from '../src';
  4. function getIDList(nodes: TreeNode[]): string[] {
  5. return nodes.map(node => node.ID);
  6. }
  7. const rawData: TreeRaw[] = [
  8. { ID: '1', parentID: '-1', seq: 1 },
  9. { ID: '2', parentID: '-1', seq: 3 },
  10. { ID: '3', parentID: '-1', seq: 2 },
  11. { ID: '4', parentID: '-1', seq: 4 },
  12. { ID: '5', parentID: '-1', seq: 5 },
  13. { ID: '6', parentID: '1', seq: 2 },
  14. { ID: '7', parentID: '1', seq: 1 },
  15. { ID: '8', parentID: '7', seq: 1 },
  16. { ID: '9', parentID: '2', seq: 1 },
  17. ];
  18. const complicatedRawData: TreeRaw[] = [
  19. { ID: '1', parentID: '-1', seq: 1 },
  20. { ID: '2', parentID: '-1', seq: 4 },
  21. { ID: '3', parentID: '-1', seq: 3 },
  22. { ID: '4', parentID: '-1', seq: 5 },
  23. { ID: '5', parentID: '-1', seq: 6 },
  24. { ID: '6', parentID: '1', seq: 2 },
  25. { ID: '7', parentID: '1', seq: 1 },
  26. { ID: '8', parentID: '7', seq: 1 },
  27. { ID: '9', parentID: '2', seq: 1 },
  28. { ID: '10', parentID: '1', seq: 3 },
  29. { ID: '11', parentID: '1', seq: 4 },
  30. { ID: '12', parentID: '1', seq: 5 },
  31. { ID: '13', parentID: '1', seq: 6 },
  32. { ID: '14', parentID: '-1', seq: 2 },
  33. ];
  34. describe('Tree', () => {
  35. const tree = new Tree(cloneDeep(rawData));
  36. it('genData', () => {
  37. const IDList = tree.data.map(item => item.ID);
  38. expect(IDList).to.have.ordered.members([
  39. '1',
  40. '7',
  41. '8',
  42. '6',
  43. '3',
  44. '2',
  45. '9',
  46. '4',
  47. '5',
  48. ]);
  49. });
  50. it('find', () => {
  51. const node = tree.find('3');
  52. expect(node).to.have.property('ID', '3');
  53. });
  54. it('findParent', () => {
  55. const node = tree.findParent('6');
  56. expect(node).to.have.property('ID', '1');
  57. });
  58. it('findNext', () => {
  59. const node = tree.findNext('7');
  60. expect(node).to.have.property('ID', '6');
  61. });
  62. it('findPrev', () => {
  63. const node = tree.findPrev('6');
  64. expect(node).to.have.property('ID', '7');
  65. });
  66. });
  67. describe('Tree change', () => {
  68. it('insert', () => {
  69. const tree = new Tree(cloneDeep(rawData));
  70. const treeRaw: TreeRaw[] = [
  71. {
  72. ID: '10',
  73. parentID: '2',
  74. seq: 2,
  75. },
  76. {
  77. ID: '11',
  78. parentID: '7',
  79. seq: 2,
  80. },
  81. ];
  82. const updateData = tree.prepareInsert(treeRaw);
  83. tree.insert(treeRaw, updateData);
  84. const IDList = tree.data.map(item => item.ID);
  85. expect(IDList).to.have.ordered.members([
  86. '1',
  87. '7',
  88. '8',
  89. '11',
  90. '6',
  91. '3',
  92. '2',
  93. '9',
  94. '10',
  95. '4',
  96. '5',
  97. ]);
  98. });
  99. it('complicated-insert', () => {
  100. const tree = new Tree(cloneDeep(complicatedRawData));
  101. const treeRaw: TreeRaw[] = [
  102. {
  103. ID: '15',
  104. parentID: '7',
  105. seq: 1,
  106. },
  107. {
  108. ID: '16',
  109. parentID: '7',
  110. seq: 1,
  111. },
  112. {
  113. ID: '17',
  114. parentID: '7',
  115. seq: 2,
  116. },
  117. {
  118. ID: '18',
  119. parentID: '12',
  120. seq: 1,
  121. },
  122. {
  123. ID: '19',
  124. parentID: '18',
  125. seq: 1,
  126. },
  127. ];
  128. const updateData = tree.prepareInsert(treeRaw);
  129. tree.insert(treeRaw, updateData);
  130. const dataIDList = getIDList(tree.data);
  131. expect(dataIDList).to.have.ordered.members([
  132. '1',
  133. '7',
  134. '15',
  135. '16',
  136. '8',
  137. '17',
  138. '6',
  139. '10',
  140. '11',
  141. '12',
  142. '18',
  143. '19',
  144. '13',
  145. '14',
  146. '3',
  147. '2',
  148. '9',
  149. '4',
  150. '5',
  151. ]);
  152. expect(tree.parentMap).to.have.all.keys('-1', '1', '7', '12', '18', '2');
  153. const parentD1 = getIDList(tree.parentMap['-1']);
  154. expect(parentD1).to.have.ordered.members(['1', '14', '3', '2', '4', '5']);
  155. const parent1 = getIDList(tree.parentMap['1']);
  156. expect(parent1).to.have.ordered.members(['7', '6', '10', '11', '12', '13']);
  157. const parent7 = getIDList(tree.parentMap['7']);
  158. expect(parent7).to.have.ordered.members(['15', '16', '8', '17']);
  159. const parent12 = getIDList(tree.parentMap['12']);
  160. expect(parent12).to.have.ordered.members(['18']);
  161. const parent18 = getIDList(tree.parentMap['18']);
  162. expect(parent18).to.have.ordered.members(['19']);
  163. const parent2 = getIDList(tree.parentMap['2']);
  164. expect(parent2).to.have.ordered.members(['9']);
  165. });
  166. it('delete', () => {
  167. const tree = new Tree(cloneDeep(rawData));
  168. const deleteNodes: TreeNode[] = [tree.find('1') as TreeNode];
  169. const updateData = tree.prepareDelete(deleteNodes);
  170. tree.delete(deleteNodes, updateData);
  171. const IDList = tree.data.map(item => item.ID);
  172. expect(IDList).to.have.ordered.members(['3', '2', '9', '4', '5']);
  173. });
  174. it('upMove', () => {
  175. const tree = new Tree(cloneDeep(rawData));
  176. const nodes = [tree.find('2'), tree.find('4')];
  177. const updateData = tree.prepareUpMove(nodes as TreeNode[]);
  178. tree.move(nodes as TreeNode[], updateData);
  179. const IDList = getIDList(tree.data);
  180. expect(IDList).to.have.ordered.members([
  181. '1',
  182. '7',
  183. '8',
  184. '6',
  185. '2',
  186. '9',
  187. '4',
  188. '3',
  189. '5',
  190. ]);
  191. expect(nodes[0]).to.have.property('seq', 2);
  192. expect(nodes[1]).to.have.property('seq', 3);
  193. const node3 = tree.find('3');
  194. expect(node3).to.have.property('seq', 4);
  195. });
  196. it('downMove', () => {
  197. const tree = new Tree(cloneDeep(rawData));
  198. const nodes = [tree.find('3'), tree.find('2')];
  199. const updateData = tree.prepareDownMove(nodes as TreeNode[]);
  200. tree.move(nodes as TreeNode[], updateData);
  201. const IDList = getIDList(tree.data);
  202. expect(IDList).to.have.ordered.members([
  203. '1',
  204. '7',
  205. '8',
  206. '6',
  207. '4',
  208. '3',
  209. '2',
  210. '9',
  211. '5',
  212. ]);
  213. expect(nodes[0]).to.have.property('seq', 3);
  214. expect(nodes[1]).to.have.property('seq', 4);
  215. const node4 = tree.find('4');
  216. expect(node4).to.have.property('seq', 2);
  217. });
  218. it('single-upLevel', () => {
  219. const tree = new Tree(cloneDeep(complicatedRawData));
  220. const node10 = tree.find('10');
  221. if (node10) {
  222. const updateData = tree.prepareUpLevel([node10]);
  223. tree.upLevel([node10], updateData);
  224. const dataIDList = getIDList(tree.data);
  225. expect(dataIDList).to.have.ordered.members([
  226. '1',
  227. '7',
  228. '8',
  229. '6',
  230. '10',
  231. '11',
  232. '12',
  233. '13',
  234. '14',
  235. '3',
  236. '2',
  237. '9',
  238. '4',
  239. '5',
  240. ]);
  241. expect(tree.parentMap).to.have.all.keys('-1', '1', '7', '10', '2');
  242. const parentD1 = getIDList(tree.parentMap['-1']);
  243. expect(parentD1).to.have.ordered.members([
  244. '1',
  245. '10',
  246. '14',
  247. '3',
  248. '2',
  249. '4',
  250. '5',
  251. ]);
  252. const parent1 = getIDList(tree.parentMap['1']);
  253. expect(parent1).to.have.ordered.members(['7', '6']);
  254. const parent7 = getIDList(tree.parentMap['7']);
  255. expect(parent7).to.have.ordered.members(['8']);
  256. const parent10 = getIDList(tree.parentMap['10']);
  257. expect(parent10).to.have.ordered.members(['11', '12', '13']);
  258. const parent2 = getIDList(tree.parentMap['2']);
  259. expect(parent2).to.have.ordered.members(['9']);
  260. }
  261. });
  262. it('multi-upLevel', () => {
  263. const tree = new Tree(cloneDeep(complicatedRawData));
  264. const node10 = tree.find('10');
  265. const node11 = tree.find('11');
  266. if (node10 && node11) {
  267. const updateData = tree.prepareUpLevel([node10, node11]);
  268. tree.upLevel([node10, node11], updateData);
  269. const dataIDList = getIDList(tree.data);
  270. expect(dataIDList).to.have.ordered.members([
  271. '1',
  272. '7',
  273. '8',
  274. '6',
  275. '10',
  276. '11',
  277. '12',
  278. '13',
  279. '14',
  280. '3',
  281. '2',
  282. '9',
  283. '4',
  284. '5',
  285. ]);
  286. expect(tree.parentMap).to.have.all.keys('-1', '1', '7', '11', '2');
  287. const parentD1 = getIDList(tree.parentMap['-1']);
  288. expect(parentD1).to.have.ordered.members([
  289. '1',
  290. '10',
  291. '11',
  292. '14',
  293. '3',
  294. '2',
  295. '4',
  296. '5',
  297. ]);
  298. const parent1 = getIDList(tree.parentMap['1']);
  299. expect(parent1).to.have.ordered.members(['7', '6']);
  300. const parent7 = getIDList(tree.parentMap['7']);
  301. expect(parent7).to.have.ordered.members(['8']);
  302. const parent11 = getIDList(tree.parentMap['11']);
  303. expect(parent11).to.have.ordered.members(['12', '13']);
  304. const parent2 = getIDList(tree.parentMap['2']);
  305. expect(parent2).to.have.ordered.members(['9']);
  306. }
  307. });
  308. it('single-downLevel', () => {
  309. const tree = new Tree(cloneDeep(complicatedRawData));
  310. const node10 = tree.find('10');
  311. if (node10) {
  312. const updateData = tree.prepareDownLevel([node10]);
  313. tree.downLevel([node10], updateData);
  314. const dataIDList = getIDList(tree.data);
  315. expect(dataIDList).to.have.ordered.members([
  316. '1',
  317. '7',
  318. '8',
  319. '6',
  320. '10',
  321. '11',
  322. '12',
  323. '13',
  324. '14',
  325. '3',
  326. '2',
  327. '9',
  328. '4',
  329. '5',
  330. ]);
  331. expect(tree.parentMap).to.have.all.keys('-1', '1', '7', '6', '2');
  332. const parentD1 = getIDList(tree.parentMap['-1']);
  333. expect(parentD1).to.have.ordered.members(['1', '14', '3', '2', '4', '5']);
  334. const parent1 = getIDList(tree.parentMap['1']);
  335. expect(parent1).to.have.ordered.members(['7', '6', '11', '12', '13']);
  336. const parent7 = getIDList(tree.parentMap['7']);
  337. expect(parent7).to.have.ordered.members(['8']);
  338. const parent11 = getIDList(tree.parentMap['6']);
  339. expect(parent11).to.have.ordered.members(['10']);
  340. const parent2 = getIDList(tree.parentMap['2']);
  341. expect(parent2).to.have.ordered.members(['9']);
  342. }
  343. });
  344. it('multi-downLevel', () => {
  345. const tree = new Tree(cloneDeep(complicatedRawData));
  346. const node6 = tree.find('6');
  347. const node10 = tree.find('10');
  348. if (node6 && node10) {
  349. const updateData = tree.prepareDownLevel([node6, node10]);
  350. tree.downLevel([node6, node10], updateData);
  351. const dataIDList = getIDList(tree.data);
  352. expect(dataIDList).to.have.ordered.members([
  353. '1',
  354. '7',
  355. '8',
  356. '6',
  357. '10',
  358. '11',
  359. '12',
  360. '13',
  361. '14',
  362. '3',
  363. '2',
  364. '9',
  365. '4',
  366. '5',
  367. ]);
  368. expect(tree.parentMap).to.have.all.keys('-1', '1', '7', '2');
  369. const parentD1 = getIDList(tree.parentMap['-1']);
  370. expect(parentD1).to.have.ordered.members(['1', '14', '3', '2', '4', '5']);
  371. const parent1 = getIDList(tree.parentMap['1']);
  372. expect(parent1).to.have.ordered.members(['7', '11', '12', '13']);
  373. const parent7 = getIDList(tree.parentMap['7']);
  374. expect(parent7).to.have.ordered.members(['8', '6', '10']);
  375. const parent2 = getIDList(tree.parentMap['2']);
  376. expect(parent2).to.have.ordered.members(['9']);
  377. }
  378. });
  379. });