*/
public class GraphComparator {
- private static final boolean DEBUG = false;
+ private static final boolean DEBUG = true;
private Resource r1;
private Resource r2;
}
public void addComparableResources(Resource r1, Resource r2) {
+ if (DEBUG)
+ System.out.println("Preset " + r1 + " = " + r2);
comparableResources.map(r1, r2);
}
public void addComparableResources(BijectionMap<Resource, Resource> matching) {
+ if (DEBUG) {
+ for (Entry<Resource, Resource> entry : matching.getEntries())
+ System.out.println("Preset " + entry.getKey() + " = " + entry.getValue());
+ }
comparableResources.addAll(matching);
}
this.g = g;
this.b = Layer0.getInstance(g);
comparator.setComparator(this);
+ comparator.initialize(g, r1, r2);
Stack<Resource> objectsLeft = new Stack<Resource>();
Stack<Resource> objectsRight = new Stack<Resource>();
comparator.setComparator(this);
+ session.syncRequest(new ReadRequest() {
+
+ @Override
+ public void run(ReadGraph graph) throws DatabaseException {
+ comparator.initialize(graph, r1, r2);
+ }
+ });
+
addComparable(r1, r2);
final Stack<Resource> objectsLeft = new Stack<Resource>();
// These cases have longer path than one to identified objects.
processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
}
+ if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
+ // comparison is ending, but we have still unprocessed unidentified resources left.
+ // These cases have longer path than one to identified objects.
+ processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
+ }
}
});
}
for (Statement s : unreliableLeft) {
if (!comparableStatements.containsLeft(s))
- if (s.getObject().getResourceId() == 303248)
- System.out.println();
addDeletion(s);
}
for (Statement s : unreliableRight) {
if (r1.equals(r2))
continue;
-
+ if (r1.getResourceId() == 610446L)
+ System.out.println();
if (processedResources.contains(r1))
continue;
processedResources.add(r1);
throw new DatabaseException("Comparator error: Trying to map " + left + " to " + right + " while mappings " + left + " to " + comparableResources.getRight(left) + " and " + comparableResources.getLeft(right) + " to " + right + " exist.");
} else {
if (DEBUG) System.out.println(left + " = " + right);
- comparableResources.map(left, right);
+ if (left.getResourceId() == 610381L)
+ System.out.println();
+ comparableResources.map(left, right);
}
}
if (!changes1Set.contains(s)) {
changes1Set.add(s);
changes1.add(s);
+ if (s.getObject().getResourceId() == 532631L)
+ System.out.println();
}
}