NodeController.java 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494
  1. package ui.controller;
  2. import java.util.ArrayList;
  3. import java.util.HashMap;
  4. import java.util.Iterator;
  5. import classes.AbstractCpsObject;
  6. import classes.CpsEdge;
  7. import classes.CpsUpperNode;
  8. import classes.Position;
  9. import javafx.collections.ListChangeListener;
  10. import ui.model.Model;
  11. import ui.view.UpperNodeCanvas;
  12. public class NodeController {
  13. private Model model;
  14. private CanvasController cvs;
  15. private MultiPurposeController mpC;
  16. public NodeController(Model model, CanvasController cvs, MultiPurposeController mpC) {
  17. // TODO Auto-generated constructor stub
  18. this.model = model;
  19. this.cvs = cvs;
  20. this.mpC = mpC;
  21. }
  22. /**
  23. * Add a CpsUpperNode into Canvas
  24. *
  25. * @param nodeName
  26. * @param upperNode
  27. */
  28. public void doUpperNode(String nodeName, CpsUpperNode upperNode, ArrayList<AbstractCpsObject> toGroup) {
  29. CpsUpperNode node = new CpsUpperNode(nodeName);
  30. node.setPosition(calculatePos(toGroup));
  31. makeAdjacent(node, upperNode, toGroup);
  32. makeNodeOfNodes(node, upperNode, toGroup);
  33. backupOldEdges(node, upperNode);
  34. if (upperNode == null)
  35. cvs.addNewObject(node);
  36. else
  37. addObjectInUpperNode(node, upperNode);
  38. }
  39. /**
  40. * Delete a CpsUpperNode from the Canvas
  41. *
  42. * @param node
  43. * @param upperNode
  44. */
  45. public void undoUpperNode(CpsUpperNode node, CpsUpperNode upperNode) {
  46. restoreOldEdges(node, upperNode);
  47. unmakeNodesOfNodes(node, upperNode);
  48. unmakeAdjacent(node, upperNode);
  49. if (upperNode == null)
  50. cvs.deleteObjectOnCanvas(node);
  51. else
  52. deleteObjectInUpperNode(node, upperNode);
  53. }
  54. /**
  55. * Put selected Nodes inside the Upper Node
  56. *
  57. * @param node
  58. * @param upperNode
  59. */
  60. private void makeNodeOfNodes(CpsUpperNode node, CpsUpperNode upperNode, ArrayList<AbstractCpsObject> toGroup) {
  61. ArrayList<AbstractCpsObject> nodes = node.getNodes();
  62. ArrayList<CpsEdge> toDelete = new ArrayList<>();
  63. // Put all selected Nodes into the Upper Node
  64. for (Iterator<AbstractCpsObject> it = toGroup.iterator(); it.hasNext();) {
  65. // füge Neue Objecte in Neuen Node hinzu
  66. AbstractCpsObject obj = it.next();
  67. // POSITION MUSS NEU GEMACHT WERDEN FÜR OBJECTS IN NODE OF NODE
  68. // obj.setPosition((obj.getPosition().x + node.getPosition().x) / 2,
  69. // (obj.getPosition().y + node.getPosition().y) / 2);
  70. addObjectInUpperNode(obj, node);
  71. }
  72. // Füge die Edges die Alle Objekte vorher verbunden hat in neuen Node
  73. for (Iterator<CpsEdge> it = (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges())
  74. .iterator(); it.hasNext();) {
  75. CpsEdge edge = it.next();
  76. // kopiere edge in UpperNode
  77. if (nodes.contains(edge.getA()) && nodes.contains(edge.getB())) {
  78. toDelete.add(edge);
  79. addEdge(edge, node);
  80. }
  81. }
  82. (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges()).removeAll(toDelete);
  83. // Lösche dann die Edges aus der nächst höheren schicht
  84. for (AbstractCpsObject abs : toGroup) {
  85. if (upperNode == null)
  86. removeForNodeOfNode(abs, null);
  87. else
  88. removeForNodeOfNode(abs, upperNode);
  89. }
  90. }
  91. /**
  92. * Transfer all relevant data from Node into the next higher layer of Node
  93. * (upperNode)
  94. *
  95. * @param node
  96. * @param upperNode
  97. */
  98. private void unmakeNodesOfNodes(CpsUpperNode node, CpsUpperNode upperNode) {
  99. // TODO Auto-generated method stub
  100. // add all nodes into upperNode
  101. for (CpsEdge edge : node.getConnections()) {
  102. if (edge.getA().equals(node))
  103. edge.getB().getConnections().remove(edge);
  104. if (edge.getB().equals(node))
  105. edge.getA().getConnections().remove(edge);
  106. }
  107. (upperNode == null ? model.getObjectsOnCanvas() : upperNode.getNodes()).addAll(node.getNodes());
  108. // change the indices accordingly the higher layer
  109. mpC.adjustIdx(mpC.getHighestIdx((upperNode == null ? model.getCvsObjIdx() : upperNode.getNodesIdx())),
  110. node.getNodesIdx());
  111. // add all indices of nodes into upperNode
  112. (upperNode == null ? model.getCvsObjIdx() : upperNode.getNodesIdx()).putAll(node.getNodesIdx());
  113. // add all Edges of node into upperNode
  114. (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges()).addAll(node.getNodeEdges());
  115. }
  116. /**
  117. * Look for adjacent Nodes connected with the new CpsUpperNode and make
  118. * Connections
  119. *
  120. * @param node
  121. * @param upperNode
  122. */
  123. private void makeAdjacent(CpsUpperNode node, CpsUpperNode upperNode, ArrayList<AbstractCpsObject> toGroup) {
  124. ArrayList<AbstractCpsObject> adj = new ArrayList<>();
  125. ArrayList<Float> maxCapacity = new ArrayList<>();
  126. ArrayList<CpsEdge> oldEdges = node.getOldEdges();
  127. ArrayList<CpsEdge> toDelete = new ArrayList<>();
  128. // für alle Edges auf dem Canvas
  129. for (Iterator<CpsEdge> it = (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges())
  130. .iterator(); it.hasNext();) {
  131. CpsEdge edge = it.next();
  132. // wenn ausgewählte Objekte in edge und andere auserhalb
  133. if (toGroup.contains(edge.getA())
  134. && !toGroup.contains(edge.getB())) {
  135. // und wenn in der adj noch nicht vorhanden und füg
  136. if (!adj.contains(edge.getB())) {
  137. adj.add(edge.getB());
  138. maxCapacity.add(edge.getCapacity());
  139. }
  140. // wenn vorhanden teste maxCapacity
  141. else if (maxCapacity.get(adj.indexOf(edge.getB())) < edge.getCapacity()) {
  142. maxCapacity.set(adj.indexOf(edge.getB()), edge.getCapacity());
  143. }
  144. // speichere alte edge
  145. oldEdges.add(edge);
  146. toDelete.add(edge);
  147. }
  148. // Analog
  149. else if (!toGroup.contains(edge.getA())
  150. && toGroup.contains(edge.getB())) {
  151. if (!adj.contains(edge.getA())) {
  152. adj.add(edge.getA());
  153. maxCapacity.add(edge.getCapacity());
  154. } else if (maxCapacity.get(adj.indexOf(edge.getA())) < edge.getCapacity()) {
  155. maxCapacity.set(adj.indexOf(edge.getA()), edge.getCapacity());
  156. }
  157. oldEdges.add(edge);
  158. toDelete.add(edge);
  159. }
  160. }
  161. (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges()).removeAll(toDelete);
  162. // für alle objekte in adjazenzliste mach
  163. for (AbstractCpsObject cps : adj) {
  164. CpsEdge newEdge = new CpsEdge(cps, node, maxCapacity.get(adj.indexOf(cps)));
  165. // !! Eventuell noch bei getConnections() hinzufügem
  166. // node.getConnections().add(newEdge);
  167. if (upperNode == null)
  168. cvs.addEdgeOnCanvas(newEdge);
  169. else
  170. upperNode.getNodeEdges().add(newEdge);
  171. }
  172. }
  173. /**
  174. * Restore the Old Connections from the adjacent Object
  175. *
  176. * @param node
  177. * @param upperNode
  178. */
  179. private void unmakeAdjacent(CpsUpperNode node, CpsUpperNode upperNode) {
  180. // TODO Auto-generated method stub
  181. ArrayList<CpsEdge> toDelete = new ArrayList<>();
  182. ArrayList<CpsEdge> lostEdges = new ArrayList<>();
  183. ArrayList<AbstractCpsObject> found = (upperNode == null ? model.getObjectsOnCanvas() : upperNode.getNodes());
  184. ArrayList<AbstractCpsObject> lostChildren = new ArrayList<>();
  185. // für jede Edge aus upperNode die Node enthält tu sie in toDelete
  186. for (Iterator<CpsEdge> it = (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges())
  187. .iterator(); it.hasNext();) {
  188. CpsEdge edge = it.next();
  189. if (edge.getA().equals(node) || edge.getB().equals(node))
  190. toDelete.add(edge);
  191. }
  192. // mark all object that arent in the restored oldEdges
  193. for (CpsEdge edge : node.getOldEdges()) {
  194. if (node.getNodes().contains(edge.getA()) && !found.contains(edge.getB()) && !lostEdges.contains(edge)) {
  195. lostChildren.add(edge.getA());
  196. lostEdges.add(edge);
  197. // edge.getB().getConnections().remove(edge);
  198. }
  199. else if (node.getNodes().contains(edge.getB()) && !found.contains(edge.getA())
  200. && !lostEdges.contains(edge)) {
  201. lostChildren.add(edge.getB());
  202. lostEdges.add(edge);
  203. // edge.getA().getConnections().remove(edge);
  204. }
  205. }
  206. node.getOldEdges().removeAll(lostEdges);
  207. // LOST = DIE IN NODE SIND, TOSEARCH = IHRE PARTNER DIE IN ANDEREN NODES
  208. // SIND
  209. for (CpsEdge edge : lostEdges) {
  210. AbstractCpsObject toSearch = null;
  211. AbstractCpsObject lost = null;
  212. if (lostChildren.contains(edge.getA())) {
  213. toSearch = edge.getB();
  214. lost = edge.getA();
  215. } else if (lostChildren.contains(edge.getB())) {
  216. toSearch = edge.getA();
  217. lost = edge.getB();
  218. }
  219. for (AbstractCpsObject cps : found) {
  220. if (!cps.equals(node) && !lostChildren.contains(cps))
  221. if (backtrackLostChild(cps, toSearch, lost)) {
  222. CpsEdge temp = new CpsEdge(cps, lost, edge.getCapacity());
  223. node.getOldEdges().add(temp);
  224. }
  225. }
  226. }
  227. // lösch alle Edges die in toDelete sind und wiederherstell alte Edges
  228. (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges()).removeAll(toDelete);
  229. (upperNode == null ? model.getEdgesOnCanvas() : upperNode.getNodeEdges()).addAll(node.getOldEdges());
  230. }
  231. /**
  232. * Backups Old Edges into next lower layer in Current UpperNode anymore
  233. *
  234. * @param node
  235. * @param upperNode
  236. */
  237. private void backupOldEdges(CpsUpperNode node, CpsUpperNode upperNode) {
  238. ArrayList<CpsEdge> backup = new ArrayList<>();
  239. ArrayList<AbstractCpsObject> adj = new ArrayList<>();
  240. ArrayList<Float> maxCapacity = new ArrayList<>();
  241. // wenn upperNode in UpperNode erzeugt wird
  242. if (upperNode != null) {
  243. // für alle oldEdges die die zu gruppierenden nodes enthält werden
  244. // in die neuen upperNOde verschoben
  245. for (CpsEdge edge : upperNode.getOldEdges()) {
  246. if (!upperNode.getNodes().contains(edge.getA()) && !upperNode.getNodes().contains(edge.getB()))
  247. backup.add(edge);
  248. }
  249. // hier wird verschoben
  250. node.getOldEdges().addAll(backup);
  251. // neue adjazent muss hergestellt werden in den alten oldEdges
  252. for (CpsEdge edge : upperNode.getOldEdges()) {
  253. if (node.getNodes().contains(edge.getA()))
  254. if (!adj.contains(edge.getB())) {
  255. adj.add(edge.getB());
  256. maxCapacity.add(edge.getCapacity());
  257. } else if (maxCapacity.get(adj.indexOf(edge.getB())) < edge.getCapacity()) {
  258. maxCapacity.set(adj.indexOf(edge.getB()), edge.getCapacity());
  259. }
  260. if (node.getNodes().contains(edge.getB()))
  261. if (!adj.contains(edge.getA())) {
  262. adj.add(edge.getA());
  263. maxCapacity.add(edge.getCapacity());
  264. } else if (maxCapacity.get(adj.indexOf(edge.getA())) < edge.getCapacity()) {
  265. maxCapacity.set(adj.indexOf(edge.getA()), edge.getCapacity());
  266. }
  267. }
  268. // alle übertragenen Edges werden gelöscht
  269. upperNode.getOldEdges().removeAll(backup);
  270. // neue edges werden erzeugt
  271. for (AbstractCpsObject cps : adj)
  272. upperNode.getOldEdges().add(new CpsEdge(cps, node, maxCapacity.get(adj.indexOf(cps))));
  273. }
  274. }
  275. /**
  276. * Restore Old Edges into next higher layer of UpperNode
  277. *
  278. * @param node
  279. * @param upperNode
  280. */
  281. private void restoreOldEdges(CpsUpperNode node, CpsUpperNode upperNode) {
  282. ArrayList<CpsEdge> toDelete = new ArrayList<>();
  283. if (upperNode != null) {
  284. for (CpsEdge edge : node.getOldEdges()) {
  285. // wenn upperNode weder A oder B von von den OldEdges enthält
  286. if (!upperNode.getNodes().contains(edge.getA()) && !upperNode.getNodes().contains(edge.getB()))
  287. // Übertrage die OldEdges eine Schicht höher
  288. toDelete.add(edge);
  289. }
  290. // übertrage sie hier
  291. upperNode.getOldEdges().addAll(toDelete);
  292. // lösch sie aus den zu löschenden node, da sonst durch unmake
  293. // Adjacent probleme auftauchen
  294. node.getOldEdges().removeAll(toDelete);
  295. toDelete.clear();
  296. // lösche alle OldEdges aus der höheren schicht die zu den zu
  297. // löschenden Node vorher führten
  298. for (CpsEdge edge : upperNode.getOldEdges()) {
  299. if (edge.getA().equals(node) || edge.getB().equals(node))
  300. toDelete.add(edge);
  301. }
  302. upperNode.getOldEdges().removeAll(toDelete);
  303. }
  304. }
  305. /**
  306. * Calculate new Position of the Upper Node
  307. *
  308. * @return
  309. */
  310. private Position calculatePos(ArrayList<AbstractCpsObject> toGroup) {
  311. Position pos = new Position(0, 0);
  312. // sum(x0 .. xn) / numOfPos, y analog
  313. for (AbstractCpsObject abs : toGroup) {
  314. pos.x += abs.getPosition().x;
  315. pos.y += abs.getPosition().y;
  316. }
  317. pos.x /= toGroup.size();
  318. pos.y /= toGroup.size();
  319. return pos;
  320. }
  321. private void removeForNodeOfNode(AbstractCpsObject obj, CpsUpperNode upperNode) {
  322. mpC.decIdx(obj.getID(), (upperNode == null ? model.getCvsObjIdx() : upperNode.getNodesIdx()));
  323. (upperNode == null ? model.getCvsObjIdx() : upperNode.getNodesIdx()).remove(obj.getID());
  324. (upperNode == null ? model.getObjectsOnCanvas() : upperNode.getNodes()).remove(obj);
  325. }
  326. /**
  327. * Search Lost Nodes by Backtracking
  328. *
  329. * @param lost
  330. * @param object
  331. * @return
  332. */
  333. private boolean backtrackLostChild(AbstractCpsObject object, AbstractCpsObject find, AbstractCpsObject lost) {
  334. if (!(object instanceof CpsUpperNode)) {
  335. for (CpsEdge edge : object.getConnections()) {
  336. if (edge.getA().equals(find) && edge.getB().equals(lost)
  337. || edge.getA().equals(lost) && edge.getB().equals(find))
  338. return true;
  339. }
  340. return false;
  341. } else {
  342. for (AbstractCpsObject cps : ((CpsUpperNode) object).getNodes()) {
  343. if (backtrackLostChild(cps, find, lost))
  344. return true;
  345. }
  346. return false;
  347. }
  348. }
  349. /**
  350. * Add a Object into a CpsUpperNode
  351. *
  352. * @param object
  353. * @param upperNode
  354. */
  355. public void addObjectInUpperNode(AbstractCpsObject object, CpsUpperNode upperNode) {
  356. object.setSav("UPPER" + upperNode.getID());
  357. upperNode.getNodesIdx().put(object.getID(), upperNode.getNodes().size());
  358. upperNode.getNodes().add(object);
  359. }
  360. /**
  361. * Delete a AbstactCpsObject from CPSUpperNode
  362. *
  363. * @param object
  364. * @param upperNode
  365. */
  366. public void deleteObjectInUpperNode(AbstractCpsObject object, CpsUpperNode upperNode) {
  367. CpsEdge e = null;
  368. for (AbstractCpsObject cps : upperNode.getNodes()) {
  369. for (CpsEdge p : cps.getConnections()) {
  370. if (p.getA() == object || p.getB() == object) {
  371. e = p;
  372. }
  373. }
  374. if (!model.getClipboradObjects().contains(cps) && !(cps instanceof CpsUpperNode)) {
  375. cps.getConnectedTo().remove(e);
  376. }
  377. upperNode.getNodeEdges().remove(e);
  378. }
  379. mpC.decIdx(object.getID(), upperNode.getNodesIdx());
  380. upperNode.getNodesIdx().remove(object.getID());
  381. upperNode.getNodes().remove(object);
  382. }
  383. /**
  384. * Add Edge in UpperNode
  385. *
  386. * @param edge
  387. * @param upperNode
  388. */
  389. public void addEdge(CpsEdge edge, CpsUpperNode upperNode) {
  390. upperNode.getNodeEdges().add(edge);
  391. }
  392. /**
  393. * Delete Edge in UpperNode
  394. *
  395. * @param edge
  396. * @param upperNode
  397. */
  398. public void deleteEdge(CpsEdge edge, CpsUpperNode upperNode) {
  399. edge.getA().getConnections().remove(edge);
  400. edge.getB().getConnections().remove(edge);
  401. upperNode.getNodeEdges().remove(edge);
  402. if (edge.getA() instanceof CpsUpperNode || edge.getB() instanceof CpsUpperNode)
  403. cvs.handleUpperNodes(edge);
  404. }
  405. /**
  406. * Adds a Edge into Connections of AbstactCpsObjects
  407. *
  408. * @param a
  409. * @param b
  410. */
  411. public void connectNodes(CpsEdge edge, CpsUpperNode upperNode) {
  412. // mache hier Connections in A und B rein
  413. // mache diese Edge auch in OldEdges rein des aktuellen CpsUpperNodes
  414. upperNode.getOldEdges().add(edge);
  415. }
  416. public void disconnectNodes(CpsEdge edge, CpsUpperNode upperNode) {
  417. edge.getA().getConnections().remove(edge);
  418. edge.getB().getConnections().remove(edge);
  419. if (upperNode != null)
  420. upperNode.getOldEdges().remove(edge);
  421. }
  422. }