NodeController.java 15 KB

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