Trees.js 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501
  1. /**
  2. * Copyright (c) 2006-2017, JGraph Ltd
  3. * Copyright (c) 2006-2017, Gaudenz Alder
  4. */
  5. EditorUi.prototype.addTrees = function()
  6. {
  7. var ui = this;
  8. var graph = ui.editor.graph;
  9. var model = graph.getModel();
  10. /**
  11. * Handle folding in trees (also in chromeless mode).
  12. */
  13. var graphFoldCells = graph.foldCells;
  14. graph.foldCells = function(collapse, recurse, cells, checkFoldable, evt)
  15. {
  16. recurse = (recurse != null) ? recurse : false;
  17. if (cells == null)
  18. {
  19. cells = this.getFoldableCells(this.getSelectionCells(), collapse);
  20. }
  21. this.stopEditing();
  22. this.model.beginUpdate();
  23. try
  24. {
  25. var newCells = cells.slice();
  26. var tmp = [];
  27. for (var i = 0; i < cells.length; i++)
  28. {
  29. var state = graph.view.getState(cells[i]);
  30. var style = (state != null) ? state.style : graph.getCellStyle(cells[i]);
  31. if (mxUtils.getValue(style, 'treeFolding', '0') == '1')
  32. {
  33. graph.traverse(cells[i], true, function(vertex, edge)
  34. {
  35. if (edge != null)
  36. {
  37. tmp.push(edge);
  38. }
  39. if (vertex != cells[i])
  40. {
  41. tmp.push(vertex);
  42. }
  43. // Stop traversal on collapsed vertices
  44. return vertex == cells[i] || !graph.model.isCollapsed(vertex);
  45. });
  46. graph.model.setCollapsed(cells[i], collapse);
  47. }
  48. }
  49. for (var i = 0; i < tmp.length; i++)
  50. {
  51. graph.model.setVisible(tmp[i], !collapse);
  52. }
  53. cells = newCells;
  54. cells = graphFoldCells.apply(this, arguments);
  55. }
  56. finally
  57. {
  58. this.model.endUpdate();
  59. }
  60. return cells;
  61. };
  62. if (this.editor.chromeless)
  63. {
  64. return;
  65. }
  66. var moveImage = (!mxClient.IS_SVG) ? IMAGE_PATH + '/move.png' : 'data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAADQAAAA0CAMAAADypuvZAAAAhFBMVEUAAAD///8KCgpNTU24uLgBAQEBAQEMDAxFRUWEhIQBAQEBAQEBAQEAAAAVFRXAwMBYWFgBAQEBAQEAAAAAAAAAAAAAAAAAAAABAQEBAQEAAAAAAAAAAAABAQEBAQEAAAAAAAASEhLAwMC+vr4BAQEBAQEAAAAAAAAAAAABAQEAAAD///+vipwtAAAAKnRSTlMA/Prw9f7A+fHq1uvFOfPv7+TOmkUyCwb3kT9UT+yPLAL49PTbkmloKvYw/P7BAAABe0lEQVRIx52W63LCIBBGwRhUkFxNYtTEa9Xi+79fR9KxrgtY9/xjMmcIH5ddhmmqSylk3nW5FOWlath7dCsNQLY6bOzWwjgQ64CzmhsPYuVR6jY2XuK2djnbwgQptthZKPMGtXh1NkvzluXmZR7geC0w17YziNHIILrrU26FwzkeHVbxl+GXwxnfbmOH1T72NHY6Tiv+3eXd3Ol4rPnOSmv0YWIda03QxyF3NNE+5XxwOE/3aCp7F9CKkiyacevMoixBq9JDdJjpIE2NcQbYnIyDaJAi4+DUsCqGGSRYSmAaccXOMOs0w1KWwuTPrIT7w6dwTcMA7lfJBHDugd2x6T0NgCWYfDkH3GKdpwGwJMuB4wFaOVOP3A63IIdHhookkX6PFAQpctLmko4R6cCSrgbtEjJtCNed8LAQnjDSY0l4ljWhAPT0UmO5/rOoqSulfH5eqL83lJaA1nxg6j7U5vS1r6ESgYbKj7d1C6N7Cf9L9joogHZUKW87+gMYYTZWVGas2QAAAABJRU5ErkJggg==';
  67. var spacing = 10;
  68. var level = 40;
  69. // Adds resources for actions
  70. mxResources.parse('selectChildren=Select Children');
  71. mxResources.parse('selectSiblings=Select Siblings');
  72. mxResources.parse('selectSubtree=Select Subtree');
  73. mxResources.parse('selectParent=Select Parent');
  74. function isTreeVertex(cell)
  75. {
  76. return model.isVertex(cell) && hasTreeParent(cell);
  77. };
  78. function hasTreeParent(cell)
  79. {
  80. var result = false;
  81. if (cell != null)
  82. {
  83. var parent = model.getParent(cell);
  84. var pstate = graph.view.getState(parent);
  85. var state = graph.view.getState(parent);
  86. var style = (pstate != null) ? pstate.style : graph.getCellStyle(parent);
  87. result = style['containerType'] == 'tree';
  88. }
  89. return result;
  90. };
  91. function hasLayoutParent(cell)
  92. {
  93. var result = false;
  94. if (cell != null)
  95. {
  96. var parent = model.getParent(cell);
  97. var pstate = graph.view.getState(parent);
  98. var state = graph.view.getState(parent);
  99. var style = (pstate != null) ? pstate.style : graph.getCellStyle(parent);
  100. result = style['childLayout'] != null;
  101. }
  102. return result;
  103. };
  104. var uiCreatePopupMenu = ui.menus.createPopupMenu;
  105. ui.menus.createPopupMenu = function(menu, cell, evt)
  106. {
  107. uiCreatePopupMenu.apply(this, arguments);
  108. if (isTreeVertex(graph.getSelectionCell()) && graph.getSelectionCount() == 1)
  109. {
  110. var cell = graph.getSelectionCell();
  111. var sib = graph.getOutgoingEdges(cell);
  112. menu.addSeparator();
  113. if (sib != null && sib.length > 0)
  114. {
  115. this.addMenuItems(menu, ['selectChildren', 'selectSubtree'], null, evt);
  116. }
  117. menu.addSeparator();
  118. if (graph.getIncomingEdges(cell).length > 0)
  119. {
  120. this.addMenuItems(menu, ['selectSiblings', 'selectParent'], null, evt);
  121. }
  122. }
  123. };
  124. // Adds actions
  125. ui.actions.addAction('selectChildren', function()
  126. {
  127. if (graph.isEnabled() && graph.getSelectionCount() == 1)
  128. {
  129. var cell = graph.getSelectionCell();
  130. var sib = graph.getOutgoingEdges(cell);
  131. if (sib != null)
  132. {
  133. var tmp = [];
  134. for (var i = 0; i < sib.length; i++)
  135. {
  136. tmp.push(graph.model.getTerminal(sib[i], false));
  137. }
  138. graph.setSelectionCells(tmp);
  139. }
  140. }
  141. }, null, null, 'Alt+Shift+X');
  142. // Adds actions
  143. ui.actions.addAction('selectSiblings', function()
  144. {
  145. if (graph.isEnabled() && graph.getSelectionCount() == 1)
  146. {
  147. var cell = graph.getSelectionCell();
  148. var edges = graph.getIncomingEdges(cell);
  149. if (edges != null && edges.length > 0)
  150. {
  151. var sib = graph.getOutgoingEdges(graph.model.getTerminal(edges[0], true));
  152. if (sib != null)
  153. {
  154. var tmp = [];
  155. for (var i = 0; i < sib.length; i++)
  156. {
  157. tmp.push(graph.model.getTerminal(sib[i], false));
  158. }
  159. graph.setSelectionCells(tmp);
  160. }
  161. }
  162. }
  163. }, null, null, 'Alt+Shift+S');
  164. // Adds actions
  165. ui.actions.addAction('selectParent', function()
  166. {
  167. if (graph.isEnabled() && graph.getSelectionCount() == 1)
  168. {
  169. var cell = graph.getSelectionCell();
  170. var edges = graph.getIncomingEdges(cell);
  171. if (edges != null && edges.length > 0)
  172. {
  173. graph.setSelectionCell(graph.model.getTerminal(edges[0], true));
  174. }
  175. }
  176. }, null, null, 'Alt+Shift+P');
  177. ui.actions.addAction('selectSubtree', function()
  178. {
  179. if (graph.isEnabled() && graph.getSelectionCount() == 1)
  180. {
  181. var cell = graph.getSelectionCell();
  182. // Makes space for new parent
  183. var subtree = [];
  184. graph.traverse(cell, true, function(vertex, edge)
  185. {
  186. if (edge != null)
  187. {
  188. subtree.push(edge);
  189. }
  190. subtree.push(vertex);
  191. return true;
  192. });
  193. graph.setSelectionCells(subtree);
  194. }
  195. }, null, null, 'Alt+Shift+T');
  196. /**
  197. * Overriddes
  198. */
  199. var graphRemoveCells = graph.removeCells;
  200. graph.removeCells = function(cells, includeEdges)
  201. {
  202. includeEdges = (includeEdges != null) ? includeEdges : true;
  203. if (cells == null)
  204. {
  205. cells = this.getDeletableCells(this.getSelectionCells());
  206. }
  207. // Adds all edges to the cells
  208. if (includeEdges)
  209. {
  210. // FIXME: Remove duplicate cells in result or do not add if
  211. // in cells or descendant of cells
  212. cells = this.getDeletableCells(this.addAllEdges(cells));
  213. }
  214. var tmp = [];
  215. for (var i = 0; i < cells.length; i++)
  216. {
  217. var target = cells[i];
  218. if (model.isEdge(target) && hasTreeParent(target))
  219. {
  220. tmp.push(target);
  221. target = model.getTerminal(target, false);
  222. }
  223. if (isTreeVertex(target))
  224. {
  225. graph.traverse(target, true, function(vertex, edge)
  226. {
  227. if (edge != null)
  228. {
  229. tmp.push(edge);
  230. }
  231. tmp.push(vertex);
  232. return true;
  233. });
  234. var edges = graph.getIncomingEdges(cells[i]);
  235. cells = cells.concat(edges);
  236. }
  237. else
  238. {
  239. tmp.push(cells[i]);
  240. }
  241. }
  242. cells = tmp;
  243. return graphRemoveCells.apply(this, arguments);
  244. };
  245. ui.hoverIcons.getStateAt = function(state, x, y)
  246. {
  247. return (isTreeVertex(state.cell)) ? null : this.graph.view.getState(this.graph.getCellAt(x, y));
  248. };
  249. var graphDuplicateCells = graph.duplicateCells;
  250. graph.duplicateCells = function(cells, append)
  251. {
  252. cells = (cells != null) ? cells : this.getSelectionCells();
  253. var temp = cells.slice(0);
  254. for (var i = 0; i < temp.length; i++)
  255. {
  256. var cell = temp[i];
  257. var state = graph.view.getState(cell);
  258. if (state != null && isTreeVertex(state.cell))
  259. {
  260. // Avoids disconnecting subtree by removing all incoming edges
  261. var edges = graph.getIncomingEdges(state.cell);
  262. for (var j = 0; j < edges.length; j++)
  263. {
  264. mxUtils.remove(edges[j], cells);
  265. }
  266. }
  267. }
  268. this.model.beginUpdate();
  269. try
  270. {
  271. var result = graphDuplicateCells.call(this, cells, append);
  272. if (result.length == cells.length)
  273. {
  274. for (var i = 0; i < cells.length; i++)
  275. {
  276. if (isTreeVertex(cells[i]))
  277. {
  278. var newEdges = graph.getIncomingEdges(result[i]);
  279. var edges = graph.getIncomingEdges(cells[i]);
  280. if (newEdges.length == 0 && edges.length > 0)
  281. {
  282. var clone = this.cloneCells([edges[0]])[0];
  283. this.addEdge(clone, graph.getDefaultParent(),
  284. this.model.getTerminal(edges[0], true), result[i]);
  285. }
  286. }
  287. }
  288. }
  289. }
  290. finally
  291. {
  292. this.model.endUpdate();
  293. }
  294. return result;
  295. };
  296. var graphMoveCells = graph.moveCells;
  297. graph.moveCells = function(cells, dx, dy, clone, target, evt, mapping)
  298. {
  299. var result = null;
  300. this.model.beginUpdate();
  301. try
  302. {
  303. var newSource = target;
  304. if (cells != null && isTreeVertex(target))
  305. {
  306. // Handles only drag from tree or from sidebar with dangling edges
  307. for (var i = 0; i < cells.length; i++)
  308. {
  309. if (isTreeVertex(cells[i]) || (graph.model.isEdge(cells[i]) &&
  310. graph.model.getTerminal(cells[i], true) == null))
  311. {
  312. target = graph.model.getParent(cells[i]);
  313. break;
  314. }
  315. }
  316. // Applies distance between previous and current parent for non-sidebar drags
  317. if (newSource != null && target != newSource && this.view.getState(cells[0]) != null)
  318. {
  319. var edges = graph.getIncomingEdges(cells[0]);
  320. if (edges.length > 0)
  321. {
  322. var state1 = graph.view.getState(graph.model.getTerminal(edges[0], true));
  323. if (state1 != null)
  324. {
  325. var state2 = graph.view.getState(newSource);
  326. if (state2 != null)
  327. {
  328. dx = (state2.getCenterX() - state1.getCenterX()) / graph.view.scale;
  329. dy = (state2.getCenterY() - state1.getCenterY()) / graph.view.scale;
  330. }
  331. }
  332. }
  333. }
  334. }
  335. result = graphMoveCells.apply(this, arguments);
  336. if (result != null && cells != null && result.length == cells.length)
  337. {
  338. for (var i = 0; i < result.length; i++)
  339. {
  340. // Connects all dangling edges from the sidebar
  341. // when dropped into drop target (not hover icon)
  342. if (this.model.isEdge(result[i]))
  343. {
  344. if (isTreeVertex(newSource) && mxUtils.indexOf(result,
  345. this.model.getTerminal(result[i], true)) < 0)
  346. {
  347. this.model.setTerminal(result[i], newSource, true);
  348. }
  349. }
  350. else if (isTreeVertex(cells[i]))
  351. {
  352. var edges = graph.getIncomingEdges(cells[i]);
  353. if (edges.length > 0)
  354. {
  355. if (!clone)
  356. {
  357. if (isTreeVertex(newSource) && mxUtils.indexOf(cells,
  358. this.model.getTerminal(edges[0], true)) < 0)
  359. {
  360. this.model.setTerminal(edges[0], newSource, true);
  361. }
  362. }
  363. else
  364. {
  365. var newEdges = graph.getIncomingEdges(result[i]);
  366. if (newEdges.length == 0)
  367. {
  368. var temp = newSource;
  369. if (temp == null || temp == graph.model.getParent(cells[i]))
  370. {
  371. temp = graph.model.getTerminal(edges[0], true);
  372. }
  373. var clone = this.cloneCells([edges[0]])[0];
  374. this.addEdge(clone, graph.getDefaultParent(), temp, result[i]);
  375. }
  376. }
  377. }
  378. }
  379. }
  380. }
  381. }
  382. finally
  383. {
  384. this.model.endUpdate();
  385. }
  386. return result;
  387. };
  388. // Connects all dangling edges from the sidebar (by
  389. // default only first dangling edge gets connected)
  390. var sidebarDropAndConnect = ui.sidebar.dropAndConnect;
  391. ui.sidebar.dropAndConnect = function(source, targets, direction, dropCellIndex)
  392. {
  393. var model = graph.model;
  394. var result = null;
  395. model.beginUpdate();
  396. try
  397. {
  398. result = sidebarDropAndConnect.apply(this, arguments);
  399. if (isTreeVertex(source))
  400. {
  401. for (var i = 0; i < result.length; i++)
  402. {
  403. if (model.isEdge(result[i]) && model.getTerminal(result[i], true) == null)
  404. {
  405. model.setTerminal(result[i], source, true);
  406. var geo = graph.getCellGeometry(result[i]);
  407. geo.points = null;
  408. if (geo.getTerminalPoint(true) != null)
  409. {
  410. geo.setTerminalPoint(null, true);
  411. }
  412. }
  413. }
  414. }
  415. }
  416. finally
  417. {
  418. model.endUpdate();
  419. }
  420. return result;
  421. };
  422. /**
  423. * Checks source point of incoming edge relative to target terminal.
  424. */
  425. function getTreeDirection(cell)
  426. {
  427. var state = graph.view.getState(cell);
  428. if (state != null)
  429. {
  430. var edges = graph.getIncomingEdges(state.cell);
  431. if (edges.length > 0)
  432. {
  433. var edgeState = graph.view.getState(edges[0]);
  434. if (edgeState != null)
  435. {
  436. var abs = edgeState.absolutePoints;
  437. if (abs != null && abs.length > 0)
  438. {
  439. var pt = abs[abs.length - 1];
  440. if (pt != null)
  441. {
  442. if (pt.y == state.y && Math.abs(pt.x - state.getCenterX()) < state.width / 2)
  443. {
  444. return mxConstants.DIRECTION_SOUTH;
  445. }
  446. else if (pt.y == state.y + state.height && Math.abs(pt.x - state.getCenterX()) < state.width / 2)
  447. {
  448. return mxConstants.DIRECTION_NORTH;
  449. }
  450. else if (pt.x > state.getCenterX())
  451. {
  452. return mxConstants.DIRECTION_WEST;
  453. }
  454. }
  455. }
  456. }
  457. }
  458. }
  459. return mxConstants.DIRECTION_EAST;
  460. };
  461. function addSibling(cell, after)
  462. {
  463. after = (after != null) ? after : true;
  464. graph.model.beginUpdate();
  465. try
  466. {
  467. var parent = graph.model.getParent(cell);
  468. var edges = graph.getIncomingEdges(cell);
  469. var clones = graph.cloneCells([edges[0], cell]);
  470. graph.model.setTerminal(clones[0], graph.model.getTerminal(edges[0], true), true);
  471. var dir = getTreeDirection(cell);
  472. var pgeo = parent.geometry;
  473. if (dir == mxConstants.DIRECTION_SOUTH || dir == mxConstants.DIRECTION_NORTH)
  474. {
  475. clones[1].geometry.x += (after) ? cell.geometry.width + spacing :
  476. -clones[1].geometry.width - spacing;
  477. }
  478. else
  479. {
  480. clones[1].geometry.y += (after) ? cell.geometry.height + spacing :
  481. -clones[1].geometry.height - spacing;
  482. }
  483. if (dir == mxConstants.DIRECTION_WEST)
  484. {
  485. clones[1].geometry.x = cell.geometry.x + cell.geometry.width - clones[1].geometry.width;
  486. }
  487. if (graph.view.currentRoot != parent)
  488. {
  489. clones[1].geometry.x -= pgeo.x;
  490. clones[1].geometry.y -= pgeo.y;
  491. }
  492. // Moves existing siblings
  493. var state = graph.view.getState(cell);
  494. var s = graph.view.scale;
  495. if (state != null)
  496. {
  497. var bbox = mxRectangle.fromRectangle(state);
  498. if (dir == mxConstants.DIRECTION_SOUTH ||
  499. dir == mxConstants.DIRECTION_NORTH)
  500. {
  501. bbox.x += ((after) ? cell.geometry.width + spacing :
  502. -clones[1].geometry.width - spacing) * s;
  503. }
  504. else
  505. {
  506. bbox.y += ((after) ? cell.geometry.height + spacing :
  507. -clones[1].geometry.height - spacing) * s;
  508. }
  509. var sib = graph.getOutgoingEdges(graph.model.getTerminal(edges[0], true));
  510. if (sib != null)
  511. {
  512. var hor = (dir == mxConstants.DIRECTION_SOUTH || dir == mxConstants.DIRECTION_NORTH);
  513. var dx = 0;
  514. var dy = 0;
  515. for (var i = 0; i < sib.length; i++)
  516. {
  517. var temp = graph.model.getTerminal(sib[i], false);
  518. if (dir == getTreeDirection(temp))
  519. {
  520. var sibling = graph.view.getState(temp);
  521. if (temp != cell && sibling != null)
  522. {
  523. if ((hor && after != sibling.getCenterX() < state.getCenterX()) ||
  524. (!hor && after != sibling.getCenterY() < state.getCenterY()))
  525. {
  526. if (mxUtils.intersects(bbox, sibling))
  527. {
  528. dx = spacing + Math.max(dx, (Math.min(bbox.x + bbox.width,
  529. sibling.x + sibling.width) - Math.max(bbox.x, sibling.x)) / s);
  530. dy = spacing + Math.max(dy, (Math.min(bbox.y + bbox.height,
  531. sibling.y + sibling.height) - Math.max(bbox.y, sibling.y)) / s);
  532. }
  533. }
  534. }
  535. }
  536. }
  537. if (hor)
  538. {
  539. dy = 0;
  540. }
  541. else
  542. {
  543. dx = 0;
  544. }
  545. for (var i = 0; i < sib.length; i++)
  546. {
  547. var temp = graph.model.getTerminal(sib[i], false);
  548. if (dir == getTreeDirection(temp))
  549. {
  550. var sibling = graph.view.getState(temp);
  551. if (temp != cell && sibling != null)
  552. {
  553. if ((hor && after != sibling.getCenterX() < state.getCenterX()) ||
  554. (!hor && after != sibling.getCenterY() < state.getCenterY()))
  555. {
  556. var subtree = [];
  557. graph.traverse(sibling.cell, true, function(vertex, edge)
  558. {
  559. if (edge != null)
  560. {
  561. subtree.push(edge);
  562. }
  563. subtree.push(vertex);
  564. return true;
  565. });
  566. graph.moveCells(subtree, ((after) ? 1 : -1) * dx, ((after) ? 1 : -1) * dy);
  567. }
  568. }
  569. }
  570. }
  571. }
  572. }
  573. return graph.addCells(clones, parent);
  574. }
  575. finally
  576. {
  577. graph.model.endUpdate();
  578. }
  579. };
  580. function addParent(cell)
  581. {
  582. graph.model.beginUpdate();
  583. try
  584. {
  585. var dir = getTreeDirection(cell);
  586. var edges = graph.getIncomingEdges(cell);
  587. var clones = graph.cloneCells([edges[0], cell]);
  588. graph.model.setTerminal(edges[0], clones[1], false);
  589. graph.model.setTerminal(clones[0], clones[1], true);
  590. graph.model.setTerminal(clones[0], cell, false);
  591. // Makes space for new parent
  592. var parent = graph.model.getParent(cell);
  593. var pgeo = parent.geometry;
  594. var subtree = [];
  595. if (graph.view.currentRoot != parent)
  596. {
  597. clones[1].geometry.x -= pgeo.x;
  598. clones[1].geometry.y -= pgeo.y;
  599. }
  600. graph.traverse(cell, true, function(vertex, edge)
  601. {
  602. if (edge != null)
  603. {
  604. subtree.push(edge);
  605. }
  606. subtree.push(vertex);
  607. return true;
  608. });
  609. var dx = cell.geometry.width + level;
  610. var dy = cell.geometry.height + level;
  611. if (dir == mxConstants.DIRECTION_SOUTH)
  612. {
  613. dx = 0;
  614. }
  615. else if (dir == mxConstants.DIRECTION_NORTH)
  616. {
  617. dx = 0;
  618. dy = -level;
  619. }
  620. else if (dir == mxConstants.DIRECTION_WEST)
  621. {
  622. dx = -level;
  623. dy = 0;
  624. }
  625. else if (dir == mxConstants.DIRECTION_EAST)
  626. {
  627. dy = 0;
  628. }
  629. graph.moveCells(subtree, dx, dy);
  630. return graph.addCells(clones, parent);
  631. }
  632. finally
  633. {
  634. graph.model.endUpdate();
  635. }
  636. };
  637. function addChild(cell)
  638. {
  639. graph.model.beginUpdate();
  640. try
  641. {
  642. var parent = graph.model.getParent(cell);
  643. var edges = graph.getIncomingEdges(cell);
  644. var clones = graph.cloneCells([edges[0], cell]);
  645. graph.model.setTerminal(clones[0], cell, true);
  646. // Finds free space
  647. var edges = graph.getOutgoingEdges(cell);
  648. var pgeo = parent.geometry;
  649. var targets = [];
  650. // Not offset if inside group
  651. if (graph.view.currentRoot == parent)
  652. {
  653. pgeo = new mxRectangle();
  654. }
  655. for (var i = 0; i < edges.length; i++)
  656. {
  657. var target = graph.model.getTerminal(edges[i], false);
  658. if (target != null)
  659. {
  660. targets.push(target);
  661. }
  662. }
  663. var bbox = graph.view.getBounds(targets);
  664. var dir = getTreeDirection(cell);
  665. var tr = graph.view.translate;
  666. var s = graph.view.scale;
  667. if (dir == mxConstants.DIRECTION_SOUTH)
  668. {
  669. clones[1].geometry.x = (bbox == null) ? cell.geometry.x + (cell.geometry.width -
  670. clones[1].geometry.width) / 2 : (bbox.x + bbox.width) / s - tr.x -
  671. pgeo.x + spacing;
  672. clones[1].geometry.y += cell.geometry.height - pgeo.y + level;
  673. }
  674. else if (dir == mxConstants.DIRECTION_NORTH)
  675. {
  676. clones[1].geometry.x = (bbox == null) ? cell.geometry.x + (cell.geometry.width -
  677. clones[1].geometry.width) / 2 : (bbox.x + bbox.width) / s - tr.x + -
  678. pgeo.x + spacing;
  679. clones[1].geometry.y -= clones[1].geometry.height - pgeo.y + level;
  680. }
  681. else if (dir == mxConstants.DIRECTION_WEST)
  682. {
  683. clones[1].geometry.x -= clones[1].geometry.width - pgeo.x + level;
  684. clones[1].geometry.y = (bbox == null) ? cell.geometry.y + (cell.geometry.height -
  685. clones[1].geometry.height) / 2 : (bbox.y + bbox.height) / s - tr.y + -
  686. pgeo.y + spacing;
  687. }
  688. else
  689. {
  690. clones[1].geometry.x += cell.geometry.width - pgeo.x + level;
  691. clones[1].geometry.y = (bbox == null) ? cell.geometry.y + (cell.geometry.height -
  692. clones[1].geometry.height) / 2 : (bbox.y + bbox.height) / s - tr.y + -
  693. pgeo.y + spacing;
  694. }
  695. return graph.addCells(clones, parent);
  696. }
  697. finally
  698. {
  699. graph.model.endUpdate();
  700. }
  701. };
  702. function getOrderedTargets(cell, horizontal, ref)
  703. {
  704. var sib = graph.getOutgoingEdges(cell);
  705. var state = graph.view.getState(ref);
  706. var targets = [];
  707. if (state != null && sib != null)
  708. {
  709. for (var i = 0; i < sib.length; i++)
  710. {
  711. var temp = graph.view.getState(graph.model.getTerminal(sib[i], false));
  712. if (temp != null && ((!horizontal && (Math.min(temp.x + temp.width,
  713. state.x + state.width) >= Math.max(temp.x, state.x))) ||
  714. (horizontal && (Math.min(temp.y + temp.height, state.y + state.height) >=
  715. Math.max(temp.y, state.y)))))
  716. {
  717. targets.push(temp);
  718. }
  719. }
  720. targets.sort(function(a, b)
  721. {
  722. return (horizontal) ? a.x + a.width - b.x - b.width : a.y + a.height - b.y - b.height;
  723. });
  724. }
  725. return targets;
  726. };
  727. function selectCell(cell, direction)
  728. {
  729. var dir = getTreeDirection(cell);
  730. var h1 = dir == mxConstants.DIRECTION_EAST || dir == mxConstants.DIRECTION_WEST;
  731. var h2 = direction == mxConstants.DIRECTION_EAST || direction == mxConstants.DIRECTION_WEST;
  732. if (h1 == h2 && dir != direction)
  733. {
  734. ui.actions.get('selectParent').funct();
  735. }
  736. else if (dir == direction)
  737. {
  738. var sib = graph.getOutgoingEdges(cell);
  739. if (sib != null && sib.length > 0)
  740. {
  741. graph.setSelectionCell(graph.model.getTerminal(sib[0], false));
  742. }
  743. }
  744. else
  745. {
  746. var edges = graph.getIncomingEdges(cell);
  747. if (edges != null && edges.length > 0)
  748. {
  749. var targets = getOrderedTargets(graph.model.getTerminal(edges[0], true), h2, cell);
  750. var state = graph.view.getState(cell);
  751. if (state != null)
  752. {
  753. var idx = mxUtils.indexOf(targets, state);
  754. if (idx >= 0)
  755. {
  756. idx += (direction == mxConstants.DIRECTION_NORTH || direction == mxConstants.DIRECTION_WEST) ? -1 : 1;
  757. if (idx >= 0 && idx <= targets.length - 1)
  758. {
  759. graph.setSelectionCell(targets[idx].cell);
  760. }
  761. }
  762. }
  763. }
  764. }
  765. };
  766. // Overrides keyboard shortcuts
  767. var altShiftActions = {88: ui.actions.get('selectChildren'), // Alt+Shift+X
  768. 84: ui.actions.get('selectSubtree'), // Alt+Shift+T
  769. 80: ui.actions.get('selectParent'), // Alt+Shift+P
  770. 83: ui.actions.get('selectSiblings')} // Alt+Shift+S
  771. var editorUiOnKeyDown = ui.onKeyDown;
  772. ui.onKeyDown = function(evt)
  773. {
  774. try
  775. {
  776. if (graph.isEnabled() && !graph.isEditing() &&
  777. isTreeVertex(graph.getSelectionCell()) &&
  778. graph.getSelectionCount() == 1)
  779. {
  780. var cells = null;
  781. if (graph.getIncomingEdges(graph.getSelectionCell()).length > 0)
  782. {
  783. if (evt.which == 9) // Tab adds child
  784. {
  785. cells = (mxEvent.isShiftDown(evt)) ?
  786. addParent(graph.getSelectionCell()) :
  787. addChild(graph.getSelectionCell());
  788. }
  789. else if (evt.which == 13) // Enter adds sibling
  790. {
  791. cells = addSibling(graph.getSelectionCell(), !mxEvent.isShiftDown(evt));
  792. }
  793. }
  794. if (cells != null && cells.length > 0)
  795. {
  796. if (cells.length == 1 && graph.model.isEdge(cells[0]))
  797. {
  798. graph.setSelectionCell(graph.model.getTerminal(cells[0], false));
  799. }
  800. else
  801. {
  802. graph.setSelectionCell(cells[cells.length - 1]);
  803. }
  804. if (ui.hoverIcons != null)
  805. {
  806. ui.hoverIcons.update(graph.view.getState(graph.getSelectionCell()));
  807. }
  808. graph.startEditingAtCell(graph.getSelectionCell());
  809. mxEvent.consume(evt);
  810. }
  811. else
  812. {
  813. if (mxEvent.isAltDown(evt) && mxEvent.isShiftDown(evt))
  814. {
  815. var action = altShiftActions[evt.keyCode];
  816. if (action != null)
  817. {
  818. action.funct(evt);
  819. mxEvent.consume(evt);
  820. }
  821. }
  822. else
  823. {
  824. if (evt.keyCode == 37) // left
  825. {
  826. selectCell(graph.getSelectionCell(), mxConstants.DIRECTION_WEST);
  827. mxEvent.consume(evt);
  828. }
  829. else if (evt.keyCode == 38) // up
  830. {
  831. selectCell(graph.getSelectionCell(), mxConstants.DIRECTION_NORTH);
  832. mxEvent.consume(evt);
  833. }
  834. else if (evt.keyCode == 39) // right
  835. {
  836. selectCell(graph.getSelectionCell(), mxConstants.DIRECTION_EAST);
  837. mxEvent.consume(evt);
  838. }
  839. else if (evt.keyCode == 40) // down
  840. {
  841. selectCell(graph.getSelectionCell(), mxConstants.DIRECTION_SOUTH);
  842. mxEvent.consume(evt);
  843. }
  844. }
  845. }
  846. }
  847. }
  848. catch (e)
  849. {
  850. console.log('error', e);
  851. }
  852. if (!mxEvent.isConsumed(evt))
  853. {
  854. editorUiOnKeyDown.apply(this, arguments);
  855. }
  856. };
  857. var graphConnectVertex = graph.connectVertex;
  858. graph.connectVertex = function(source, direction, length, evt, forceClone, ignoreCellAt)
  859. {
  860. var edges = graph.getIncomingEdges(source);
  861. if (isTreeVertex(source) && edges.length > 0)
  862. {
  863. var dir = getTreeDirection(source);
  864. var h1 = dir == mxConstants.DIRECTION_EAST || dir == mxConstants.DIRECTION_WEST;
  865. var h2 = direction == mxConstants.DIRECTION_EAST || direction == mxConstants.DIRECTION_WEST;
  866. if (dir == direction)
  867. {
  868. return addChild(source);
  869. }
  870. else if (h1 == h2)
  871. {
  872. return addParent(source);
  873. }
  874. else
  875. {
  876. return addSibling(source, direction != mxConstants.DIRECTION_NORTH &&
  877. direction != mxConstants.DIRECTION_WEST);
  878. }
  879. return [];
  880. }
  881. else
  882. {
  883. this.model.beginUpdate();
  884. try
  885. {
  886. var cells = graphConnectVertex.call(this, source, direction, length, evt, forceClone,
  887. ignoreCellAt || edges.length == 0);
  888. }
  889. finally
  890. {
  891. this.model.endUpdate();
  892. }
  893. return cells;
  894. }
  895. };
  896. // Keeps edges connected in trees
  897. var graphHandlerGetCells = graph.graphHandler.getCells;
  898. graph.graphHandler.getCells = function(initialCell)
  899. {
  900. var cells = graphHandlerGetCells.apply(this, arguments);
  901. var temp = cells.slice(0);
  902. // Removes all edges first
  903. for (var i = 0; i < temp.length; i++)
  904. {
  905. if (isTreeVertex(temp[i]))
  906. {
  907. // Avoids disconnecting subtree by removing all incoming edges
  908. var edges = graph.getIncomingEdges(temp[i]);
  909. for (var j = 0; j < edges.length; j++)
  910. {
  911. mxUtils.remove(edges[j], cells);
  912. }
  913. }
  914. }
  915. for (var i = 0; i < temp.length; i++)
  916. {
  917. var target = cells[i];
  918. // LATER: Move edge should move subtree
  919. // if (model.isEdge(target) && hasTreeParent(target))
  920. // {
  921. // target = model.getTerminal(target, false);
  922. // }
  923. if (isTreeVertex(target) && !hasLayoutParent(target))
  924. {
  925. // Gets the subtree from cell downwards
  926. graph.traverse(target, true, function(vertex, edge)
  927. {
  928. // LATER: Use dictionary to avoid duplicates
  929. if (edge != null && mxUtils.indexOf(cells, edge) < 0)
  930. {
  931. cells.push(edge);
  932. }
  933. if (mxUtils.indexOf(cells, vertex) < 0)
  934. {
  935. cells.push(vertex);
  936. }
  937. return true;
  938. });
  939. }
  940. }
  941. return cells;
  942. };
  943. // Defines a new class for all icons
  944. function mxIconSet(state)
  945. {
  946. this.images = [];
  947. var graph = state.view.graph;
  948. // Delete
  949. var img = mxUtils.createImage(moveImage);
  950. img.setAttribute('title', 'Move Cell without Subtree');
  951. img.style.position = 'absolute';
  952. img.style.cursor = 'pointer';
  953. img.style.width = '26px';
  954. img.style.height = '26px';
  955. img.style.left = (state.getCenterX() - 13) + 'px';
  956. img.style.top = (state.getCenterY() - 13) + 'px';
  957. mxEvent.addGestureListeners(img, mxUtils.bind(this, function(evt)
  958. {
  959. graph.stopEditing(false);
  960. ui.hoverIcons.reset();
  961. if (!graph.isCellSelected(state.cell))
  962. {
  963. graph.setSelectionCell(state.cell);
  964. }
  965. graph.graphHandler.start(state.cell, mxEvent.getClientX(evt), mxEvent.getClientY(evt));
  966. graph.graphHandler.cells = [state.cell];
  967. graph.graphHandler.bounds = graph.graphHandler.graph.getView().getBounds(graph.graphHandler.cells);
  968. graph.graphHandler.pBounds = graph.graphHandler.getPreviewBounds(graph.graphHandler.cells);
  969. graph.graphHandler.cellWasClicked = true;
  970. graph.isMouseDown = true;
  971. graph.isMouseTrigger = mxEvent.isMouseEvent(evt);
  972. mxEvent.consume(evt);
  973. // Disables dragging the image
  974. mxEvent.consume(evt);
  975. this.destroy();
  976. }));
  977. state.view.graph.container.appendChild(img);
  978. this.images.push(img);
  979. };
  980. mxIconSet.prototype.destroy = function()
  981. {
  982. if (this.images != null)
  983. {
  984. for (var i = 0; i < this.images.length; i++)
  985. {
  986. var img = this.images[i];
  987. img.parentNode.removeChild(img);
  988. }
  989. }
  990. this.images = null;
  991. };
  992. // Defines the tolerance before removing the icons
  993. var iconTolerance = 20;
  994. // Shows icons if the mouse is over a cell
  995. graph.addMouseListener(
  996. {
  997. currentState: null,
  998. currentIconSet: null,
  999. mouseDown: function(sender, me)
  1000. {
  1001. // Hides icons on mouse down
  1002. if (this.currentState != null)
  1003. {
  1004. this.dragLeave(me.getEvent(), this.currentState);
  1005. this.currentState = null;
  1006. }
  1007. },
  1008. mouseMove: function(sender, me)
  1009. {
  1010. if (this.currentState != null && (me.getState() == this.currentState ||
  1011. me.getState() == null))
  1012. {
  1013. var tol = iconTolerance;
  1014. var tmp = new mxRectangle(me.getGraphX() - tol,
  1015. me.getGraphY() - tol, 2 * tol, 2 * tol);
  1016. if (mxUtils.intersects(tmp, this.currentState))
  1017. {
  1018. return;
  1019. }
  1020. }
  1021. var tmp = me.getState();
  1022. // Ignores everything but vertices
  1023. if ((graph.isMouseDown && !mxEvent.isTouchEvent(me.getEvent())) ||
  1024. graph.isEditing() || (tmp != null && (!graph.getModel().isVertex(tmp.cell) ||
  1025. !isTreeVertex(me.getCell()) || hasLayoutParent(tmp.cell))))
  1026. {
  1027. tmp = null;
  1028. }
  1029. if (tmp != this.currentState)
  1030. {
  1031. if (this.currentState != null)
  1032. {
  1033. this.dragLeave(me.getEvent(), this.currentState);
  1034. }
  1035. this.currentState = tmp;
  1036. if (this.currentState != null)
  1037. {
  1038. this.dragEnter(me.getEvent(), this.currentState);
  1039. }
  1040. }
  1041. },
  1042. mouseUp: function(sender, me) { },
  1043. dragEnter: function(evt, state)
  1044. {
  1045. if (this.currentIconSet == null)
  1046. {
  1047. this.currentIconSet = new mxIconSet(state);
  1048. }
  1049. },
  1050. dragLeave: function(evt, state)
  1051. {
  1052. if (this.currentIconSet != null)
  1053. {
  1054. this.currentIconSet.destroy();
  1055. this.currentIconSet = null;
  1056. }
  1057. }
  1058. });
  1059. };
  1060. (function()
  1061. {
  1062. var sidebarCreateAdvancedShapes = Sidebar.prototype.createAdvancedShapes;
  1063. Sidebar.prototype.createAdvancedShapes = function()
  1064. {
  1065. var result = sidebarCreateAdvancedShapes.apply(this, arguments);
  1066. var graph = this.editorUi.editor.graph;
  1067. return result.concat([
  1068. this.addEntry('tree mindmap central idea branch topic', function()
  1069. {
  1070. var mindmap = new mxCell('Mindmap', new mxGeometry(0, 0, 420, 126),
  1071. 'swimlane;html=1;startSize=20;horizontal=1;containerType=tree;');
  1072. mindmap.vertex = true;
  1073. var cell = new mxCell('Central Idea', new mxGeometry(160, 60, 100, 40),
  1074. 'ellipse;whiteSpace=wrap;html=1;align=center;' +
  1075. 'container=1;recursiveResize=0;treeFolding=1;');
  1076. cell.vertex = true;
  1077. var cell2 = new mxCell('Topic', new mxGeometry(320, 40, 80, 20),
  1078. 'whiteSpace=wrap;html=1;rounded=1;arcSize=50;align=center;verticalAlign=middle;' +
  1079. 'container=1;recursiveResize=0;strokeWidth=1;autosize=1;spacing=4;treeFolding=1;');
  1080. cell2.vertex = true;
  1081. var edge = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1082. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1083. edge.geometry.relative = true;
  1084. edge.edge = true;
  1085. cell.insertEdge(edge, true);
  1086. cell2.insertEdge(edge, false);
  1087. var cell3 = new mxCell('Branch', new mxGeometry(320, 80, 72, 26),
  1088. 'whiteSpace=wrap;html=1;shape=partialRectangle;top=0;left=0;bottom=1;right=0;points=[[0,1],[1,1]];' +
  1089. 'strokeColor=#000000;fillColor=none;align=center;verticalAlign=bottom;routingCenterY=0.5;' +
  1090. 'snapToPoint=1;container=1;recursiveResize=0;autosize=1;treeFolding=1;');
  1091. cell3.vertex = true;
  1092. var edge2 = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1093. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1094. edge2.geometry.relative = true;
  1095. edge2.edge = true;
  1096. cell.insertEdge(edge2, true);
  1097. cell3.insertEdge(edge2, false);
  1098. var cell4 = new mxCell('Topic', new mxGeometry(20, 40, 80, 20),
  1099. 'whiteSpace=wrap;html=1;rounded=1;arcSize=50;align=center;verticalAlign=middle;' +
  1100. 'container=1;recursiveResize=0;strokeWidth=1;autosize=1;spacing=4;treeFolding=1;');
  1101. cell4.vertex = true;
  1102. var edge3 = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1103. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1104. edge3.geometry.relative = true;
  1105. edge3.edge = true;
  1106. cell.insertEdge(edge3, true);
  1107. cell4.insertEdge(edge3, false);
  1108. var cell5 = new mxCell('Branch', new mxGeometry(20, 80, 72, 26),
  1109. 'whiteSpace=wrap;html=1;shape=partialRectangle;top=0;left=0;bottom=1;right=0;points=[[0,1],[1,1]];' +
  1110. 'strokeColor=#000000;fillColor=none;align=center;verticalAlign=bottom;routingCenterY=0.5;' +
  1111. 'snapToPoint=1;container=1;recursiveResize=0;autosize=1;treeFolding=1;');
  1112. cell5.vertex = true;
  1113. var edge4 = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1114. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1115. edge4.geometry.relative = true;
  1116. edge4.edge = true;
  1117. cell.insertEdge(edge4, true);
  1118. cell5.insertEdge(edge4, false);
  1119. mindmap.insert(edge);
  1120. mindmap.insert(edge2);
  1121. mindmap.insert(edge3);
  1122. mindmap.insert(edge4);
  1123. mindmap.insert(cell);
  1124. mindmap.insert(cell2);
  1125. mindmap.insert(cell3);
  1126. mindmap.insert(cell4);
  1127. mindmap.insert(cell5);
  1128. return sb.createVertexTemplateFromCells([mindmap], mindmap.geometry.width,
  1129. mindmap.geometry.height, mindmap.value);
  1130. }),
  1131. this.addEntry('tree mindmap central idea', function()
  1132. {
  1133. var cell = new mxCell('Central Idea', new mxGeometry(0, 0, 100, 40),
  1134. 'ellipse;whiteSpace=wrap;html=1;align=center;' +
  1135. 'container=1;recursiveResize=0;treeFolding=1;');
  1136. cell.vertex = true;
  1137. return sb.createVertexTemplateFromCells([cell], cell.geometry.width,
  1138. cell.geometry.height, cell.value);
  1139. }),
  1140. this.addEntry('tree mindmap branch', function()
  1141. {
  1142. var cell = new mxCell('Branch', new mxGeometry(0, 0, 80, 20),
  1143. 'whiteSpace=wrap;html=1;shape=partialRectangle;top=0;left=0;bottom=1;right=0;points=[[0,1],[1,1]];' +
  1144. 'strokeColor=#000000;fillColor=none;align=center;verticalAlign=bottom;routingCenterY=0.5;' +
  1145. 'snapToPoint=1;container=1;recursiveResize=0;autosize=1;treeFolding=1;');
  1146. cell.vertex = true;
  1147. var edge = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1148. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1149. edge.geometry.setTerminalPoint(new mxPoint(-40, 40), true);
  1150. edge.geometry.relative = true;
  1151. edge.edge = true;
  1152. cell.insertEdge(edge, false);
  1153. return sb.createVertexTemplateFromCells([cell, edge], cell.geometry.width,
  1154. cell.geometry.height, cell.value);
  1155. }),
  1156. this.addEntry('tree mindmap sub topic', function()
  1157. {
  1158. var cell = new mxCell('Sub Topic', new mxGeometry(0, 0, 72, 26),
  1159. 'whiteSpace=wrap;html=1;rounded=1;arcSize=50;align=center;verticalAlign=middle;' +
  1160. 'container=1;recursiveResize=0;strokeWidth=1;autosize=1;spacing=4;treeFolding=1;');
  1161. cell.vertex = true;
  1162. var edge = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=entityRelationEdgeStyle;' +
  1163. 'startArrow=none;endArrow=none;segment=10;curved=1;');
  1164. edge.geometry.setTerminalPoint(new mxPoint(-40, 40), true);
  1165. edge.geometry.relative = true;
  1166. edge.edge = true;
  1167. cell.insertEdge(edge, false);
  1168. return sb.createVertexTemplateFromCells([cell, edge], cell.geometry.width,
  1169. cell.geometry.height, cell.value);
  1170. }),
  1171. this.addEntry('tree orgchart organization division', function()
  1172. {
  1173. var orgchart = new mxCell('Orgchart', new mxGeometry(0, 0, 280, 220),
  1174. 'swimlane;html=1;startSize=20;horizontal=1;containerType=tree;');
  1175. orgchart.vertex = true;
  1176. var cell = new mxCell('Organization', new mxGeometry(80, 40, 120, 60),
  1177. 'whiteSpace=wrap;html=1;align=center;treeFolding=1;' +
  1178. 'container=1;recursiveResize=0;');
  1179. graph.setAttributeForCell(cell, 'treeRoot', '1');
  1180. cell.vertex = true;
  1181. var cell2 = new mxCell('Division', new mxGeometry(20, 140, 100, 60),
  1182. 'whiteSpace=wrap;html=1;align=center;verticalAlign=middle;' +
  1183. 'container=1;recursiveResize=0;treeFolding=1;');
  1184. cell2.vertex = true;
  1185. var edge = new mxCell('', new mxGeometry(0, 0, 0, 0),
  1186. 'edgeStyle=elbowEdgeStyle;elbow=vertical;' +
  1187. 'startArrow=none;endArrow=none;rounded=0;');
  1188. edge.geometry.relative = true;
  1189. edge.edge = true;
  1190. cell.insertEdge(edge, true);
  1191. cell2.insertEdge(edge, false);
  1192. var cell3 = new mxCell('Division', new mxGeometry(160, 140, 100, 60),
  1193. 'whiteSpace=wrap;html=1;align=center;verticalAlign=middle;' +
  1194. 'container=1;recursiveResize=0;treeFolding=1;');
  1195. cell3.vertex = true;
  1196. var edge2 = new mxCell('', new mxGeometry(0, 0, 0, 0),
  1197. 'edgeStyle=elbowEdgeStyle;elbow=vertical;' +
  1198. 'startArrow=none;endArrow=none;rounded=0;');
  1199. edge2.geometry.relative = true;
  1200. edge2.edge = true;
  1201. cell.insertEdge(edge2, true);
  1202. cell3.insertEdge(edge2, false);
  1203. orgchart.insert(edge);
  1204. orgchart.insert(edge2);
  1205. orgchart.insert(cell);
  1206. orgchart.insert(cell2);
  1207. orgchart.insert(cell3);
  1208. return sb.createVertexTemplateFromCells([orgchart], orgchart.geometry.width,
  1209. orgchart.geometry.height, orgchart.value);
  1210. }),
  1211. this.addEntry('tree container', function()
  1212. {
  1213. var cell = new mxCell('Tree Container', new mxGeometry(0, 0, 220, 160),
  1214. 'swimlane;html=1;startSize=20;horizontal=1;containerType=tree;');
  1215. cell.vertex = true;
  1216. return sb.createVertexTemplateFromCells([cell], cell.geometry.width,
  1217. cell.geometry.height, cell.value);
  1218. }),
  1219. this.addEntry('tree root', function()
  1220. {
  1221. var cell = new mxCell('Organization', new mxGeometry(0, 0, 120, 60),
  1222. 'whiteSpace=wrap;html=1;align=center;treeFolding=1;' +
  1223. 'container=1;recursiveResize=0;');
  1224. graph.setAttributeForCell(cell, 'treeRoot', '1');
  1225. cell.vertex = true;
  1226. return sb.createVertexTemplateFromCells([cell], cell.geometry.width,
  1227. cell.geometry.height, cell.value);
  1228. }),
  1229. this.addEntry('tree sub sections', function()
  1230. {
  1231. var cell = new mxCell('Sub Section', new mxGeometry(0, 0, 100, 60),
  1232. 'whiteSpace=wrap;html=1;align=center;verticalAlign=middle;' +
  1233. 'container=1;recursiveResize=0;treeFolding=1;');
  1234. cell.vertex = true;
  1235. var edge = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=orthogonalEdgeStyle;' +
  1236. 'startArrow=none;endArrow=none;rounded=0;targetPortConstraint=eastwest;sourcePortConstraint=northsouth;');
  1237. edge.geometry.setTerminalPoint(new mxPoint(110, -40), true);
  1238. edge.geometry.relative = true;
  1239. edge.edge = true;
  1240. cell.insertEdge(edge, false);
  1241. var cell2 = new mxCell('Sub Section', new mxGeometry(120, 0, 100, 60),
  1242. 'whiteSpace=wrap;html=1;align=center;verticalAlign=middle;' +
  1243. 'container=1;recursiveResize=0;treeFolding=1;');
  1244. cell2.vertex = true;
  1245. var edge2 = new mxCell('', new mxGeometry(0, 0, 0, 0), 'edgeStyle=orthogonalEdgeStyle;' +
  1246. 'startArrow=none;endArrow=none;rounded=0;targetPortConstraint=eastwest;sourcePortConstraint=northsouth;');
  1247. edge2.geometry.setTerminalPoint(new mxPoint(110, -40), true);
  1248. edge2.geometry.relative = true;
  1249. edge2.edge = true;
  1250. cell2.insertEdge(edge2, false);
  1251. return sb.createVertexTemplateFromCells([edge, edge2, cell, cell2], 220, 60, 'Sub Sections');
  1252. })
  1253. ]);
  1254. };
  1255. var editorUiInit = EditorUi.prototype.init;
  1256. EditorUi.prototype.init = function()
  1257. {
  1258. editorUiInit.apply(this, arguments);
  1259. this.addTrees();
  1260. };
  1261. })();