1 package org.simantics.interop.update.model;
3 import java.util.HashMap;
6 import org.simantics.db.ReadGraph;
7 import org.simantics.db.Resource;
8 import org.simantics.db.exception.DatabaseException;
9 import org.simantics.interop.test.GraphChanges;
10 import org.simantics.interop.update.model.UpdateNode.Status;
13 public abstract class UpdateTree {
15 private UpdateNode rootNode;
16 private Map<Resource,UpdateNode> nodes;
17 private GraphChanges changes;
18 private UpdateOperations updateOps;
21 public UpdateTree(ReadGraph g, GraphChanges changes, UpdateOperations updateOps) throws DatabaseException {
22 this.changes = changes;
23 this.nodes = new HashMap<Resource, UpdateNode>();
24 this.rootNode = createNode(Status.EXIST, changes.getResource1());
25 nodes.put(changes.getResource1(), rootNode);
26 nodes.put(changes.getResource2(), rootNode);
27 this.updateOps = updateOps;
28 this.updateOps.populate(g);
32 public UpdateOperations getUpdateOps() {
36 public UpdateNode getRootNode() {
40 protected abstract UpdateNode createNode(Status staus, Resource r);
41 protected abstract UpdateNode createNode(Status staus, UpdateOp op);
43 private UpdateNode createNode(Resource r1, Resource r2) {
44 UpdateNode node = null;
45 if (r1 != null && r2 != null) {
46 node = createNode(Status.EXIST, r1);
49 } else if (r1 != null) {
50 node = createNode(Status.DELETED ,updateOps.getUpdateOp(r1));
52 } else if (r2 != null) {
53 node = createNode(Status.NEW, updateOps.getUpdateOp(r2));
59 public UpdateNode addNode(ReadGraph g, Resource r1, Resource r2) throws DatabaseException {
60 if (r1 != null && r2 != null) {
63 if (nodes.containsKey(r1))
65 if (nodes.containsKey(r2))
68 UpdateNode node = createNode(r1, r2);
69 connectParent(g,node);
74 private boolean connectParent(ReadGraph g, UpdateNode node) throws DatabaseException {
75 UpdateNode parent = null;
77 Resource parentResource = node.getParentResource(g);
78 parent = nodes.get(parentResource);
80 if (changes.getComparable().containsLeft(parentResource)) {
81 parent = createNode(parentResource, changes.getComparable().getRight(parentResource));
82 } else if (changes.getComparable().containsRight(parentResource)) {
83 parent = createNode(changes.getComparable().getLeft(parentResource) ,parentResource);
87 //parent.setStatus(Status.CONTAINS);
88 parent.addChild(node);
92 parent.addChild(node);
99 protected abstract boolean handleCustom(ReadGraph g, UpdateOp op) throws DatabaseException;
101 private void populate(ReadGraph g) throws DatabaseException{
103 for (UpdateOp op : updateOps.getOperations()) {
104 if (!handleCustom(g, op)) {
106 addNode(g, null,op.getResource());
108 addNode(g, op.getResource(), null);