import org.simantics.db.Resource;
import org.simantics.db.exception.DatabaseException;
import org.simantics.interop.test.GraphChanges;
-import org.simantics.interop.update.model.UpdateNode.Status;
-public abstract class UpdateTree {
+public class UpdateTree {
private UpdateNode rootNode;
private Map<Resource,UpdateNode> nodes;
public UpdateTree(ReadGraph g, GraphChanges changes, UpdateOperations updateOps) throws DatabaseException {
this.changes = changes;
this.nodes = new HashMap<Resource, UpdateNode>();
- this.rootNode = createNode(Status.EXIST, changes.getResource1());
+ this.rootNode = createNode(g, UpdateStatus.EXIST, changes.getResource1());
nodes.put(changes.getResource1(), rootNode);
nodes.put(changes.getResource2(), rootNode);
this.updateOps = updateOps;
return rootNode;
}
- protected abstract UpdateNode createNode(Status staus, Resource r);
- protected abstract UpdateNode createNode(Status staus, UpdateOp op);
+ public GraphChanges getChanges() {
+ return changes;
+ }
+
+ protected UpdateNode createNode(ReadGraph g, UpdateStatus status, Resource r) throws DatabaseException {
+ return new UpdateNode(g,status, r);
+ }
+
+ protected UpdateNode createNode(ReadGraph g, UpdateStatus status, UpdateOp op) throws DatabaseException{
+ return new UpdateNode(g,status, op);
+ }
- private UpdateNode createNode(Resource r1, Resource r2) {
+ private UpdateNode createNode(ReadGraph g, Resource r1, Resource r2) throws DatabaseException {
UpdateNode node = null;
if (r1 != null && r2 != null) {
- node = createNode(Status.EXIST, r1);
+ node = createNode(g, UpdateStatus.EXIST, r1);
nodes.put(r1, node);
nodes.put(r2, node);
} else if (r1 != null) {
- node = createNode(Status.DELETED ,updateOps.getUpdateOp(r1));
+ node = createNode(g,UpdateStatus.DELETED ,updateOps.getUpdateOp(r1));
nodes.put(r1, node);
} else if (r2 != null) {
- node = createNode(Status.NEW, updateOps.getUpdateOp(r2));
+ node = createNode(g,UpdateStatus.NEW, updateOps.getUpdateOp(r2));
nodes.put(r2, node);
}
return node;
if (nodes.containsKey(r2))
return nodes.get(r2);
- UpdateNode node = createNode(r1, r2);
+ UpdateNode node = createNode(g, r1, r2);
connectParent(g,node);
return node;
-
}
- private boolean connectParent(ReadGraph g, UpdateNode node) throws DatabaseException {
+ public UpdateNode getNode(Resource r) {
+ return nodes.get(r);
+ }
+
+ protected boolean connectParent(ReadGraph g, UpdateNode node) throws DatabaseException {
UpdateNode parent = null;
while (true) {
Resource parentResource = node.getParentResource(g);
parent = nodes.get(parentResource);
if (parent == null) {
- if (changes.getComparable().containsLeft(parentResource)) {
- parent = createNode(parentResource, changes.getComparable().getRight(parentResource));
- } else if (changes.getComparable().containsRight(parentResource)) {
- parent = createNode(changes.getComparable().getLeft(parentResource) ,parentResource);
- } else {
+ parent = getOrCreate(g, parentResource);
+ if (parent == null)
return false;
- }
//parent.setStatus(Status.CONTAINS);
parent.addChild(node);
node = parent;
}
}
- protected abstract boolean handleCustom(ReadGraph g, UpdateOp op) throws DatabaseException;
+ protected UpdateNode getOrCreate(ReadGraph g, Resource parentResource) throws DatabaseException {
+ UpdateNode parent = nodes.get(parentResource);
+ if (parent == null) {
+ if (changes.getComparable().containsLeft(parentResource)) {
+ parent = createNode(g, parentResource, changes.getComparable().getRight(parentResource));
+ } else if (changes.getComparable().containsRight(parentResource)) {
+ parent = createNode(g, changes.getComparable().getLeft(parentResource) ,parentResource);
+ } else {
+ return null;
+ }
+ //parent.setStatus(Status.CONTAINS
+ }
+ return parent;
+ }
+
+
+
+ protected boolean handleCustom(ReadGraph g, UpdateOp op) throws DatabaseException {
+ return false;
+ }
private void populate(ReadGraph g) throws DatabaseException{