1 /*******************************************************************************
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
10 * Foster Wheeler Energia Oy - initial API and implementation
11 *******************************************************************************/
12 package org.simantics.interop.test;
14 import java.util.ArrayList;
15 import java.util.Arrays;
16 import java.util.Collection;
17 import java.util.Collections;
18 import java.util.Comparator;
19 import java.util.HashMap;
20 import java.util.HashSet;
21 import java.util.List;
23 import java.util.Map.Entry;
25 import java.util.Stack;
27 import org.simantics.databoard.Bindings;
28 import org.simantics.db.ReadGraph;
29 import org.simantics.db.Resource;
30 import org.simantics.db.Session;
31 import org.simantics.db.Statement;
32 import org.simantics.db.common.request.ReadRequest;
33 import org.simantics.db.common.utils.NameUtils;
34 import org.simantics.db.exception.DatabaseException;
35 import org.simantics.interop.test.GraphChanges.Modification;
36 import org.simantics.layer0.Layer0;
37 import org.simantics.utils.datastructures.BijectionMap;
38 import org.simantics.utils.datastructures.MapList;
39 import org.simantics.utils.datastructures.Pair;
42 * Compares two subgraphs and reports differences.
44 * Assumes that subgraphs (defined using traverse relations) are not cyclic.
46 * Assumes that properties can be used to identify objects, if relation type is not enough.
50 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
53 public class GraphComparator {
55 private static final boolean DEBUG = true;
59 private Set<Resource> strong = new HashSet<>(); // List of relations that identify object, if subject is already identified.
60 private List<Resource> traversed = new ArrayList<>(); // list of relations that are traversed (and tested)
61 private List<Resource> tested = new ArrayList<>(); // list of relations that are tested, but not traversed
62 private List<Resource> nonTraversed = new ArrayList<>(); // list of relations that are not traversed
63 private List<Resource> nonTested = new ArrayList<>(); // list of relations that are not tested
65 private List<Statement> changes1 = new ArrayList<>();
66 private List<Statement> changes2 = new ArrayList<>();
67 private List<Modification> modifications = new ArrayList<>();
68 private Set<Statement> changes1Set = new HashSet<>();
69 private Set<Statement> changes2Set = new HashSet<>();
70 private Set<Modification> modificationsSet = new HashSet<>();
72 private BijectionMap<Statement, Statement> comparableStatements = new BijectionMap<>();
73 private BijectionMap<Resource, Resource> comparableResources = new BijectionMap<>();
75 private Set<Resource> processedResources = new HashSet<Resource>();
77 private ResourceComparator comparator;
79 private Comparator<Statement> scomp = new PredicateComparator();
80 private Comparator<Resource> rcomp = new ResComparator();
82 private Set<Resource> nonMatchedLeft = new HashSet<Resource>();
83 private Set<Resource> nonMatchedRight = new HashSet<Resource>();
90 public GraphComparator(Resource r1, Resource r2) {
93 comparator = new TypeComparator();
96 public GraphComparator(Resource r1, Resource r2, ResourceComparator comparator) {
99 this.comparator = comparator;
102 ArrayList<Statement> ss1 = new ArrayList<Statement>();
103 ArrayList<Statement> ss2 = new ArrayList<Statement>();
106 public Comparator<Resource> getResourceComparator() {
110 public Comparator<Statement> getStatementComparator() {
114 public Resource getR1() {
118 public Resource getR2() {
122 public void addTraversed(Resource rel) {
126 public void addTraversed(Collection<Resource> rels) {
127 traversed.addAll(rels);
130 public void addNonTraversed(Resource rel) {
131 nonTraversed.add(rel);
134 public void addNonTraversed(Collection<Resource> rels) {
135 nonTraversed.addAll(rels);
138 public void addTested(Resource rel) {
142 public void addTested(Collection<Resource> rels) {
146 public void addNonTested(Resource rel) {
150 public void addNonTested(Collection<Resource> rels) {
151 nonTested.addAll(rels);
154 public void addComparableResources(Resource r1, Resource r2) {
156 System.out.println("Preset " + r1 + " = " + r2);
157 comparableResources.map(r1, r2);
160 public void addComparableResources(BijectionMap<Resource, Resource> matching) {
162 for (Entry<Resource, Resource> entry : matching.getEntries())
163 System.out.println("Preset " + entry.getKey() + " = " + entry.getValue());
165 comparableResources.addAll(matching);
168 public void addStrong(Resource r) {
172 public void addStrong(Collection<Resource> rels) {
176 public void addNonMatchedLeft(Resource r) {
177 nonMatchedLeft.add(r);
180 public void addNonMatchedRight(Resource r) {
181 nonMatchedRight.add(r);
184 public void test(ReadGraph g) throws DatabaseException {
186 this.b = Layer0.getInstance(g);
187 comparator.setComparator(this);
188 comparator.initialize(g, r1, r2);
190 Stack<Resource> objectsLeft = new Stack<Resource>();
191 Stack<Resource> objectsRight = new Stack<Resource>();
192 objectsLeft.push(r1);
193 objectsRight.push(r2);
195 Set<Statement> unreliableLeft = new HashSet<Statement>();
196 Set<Statement> unreliableRight = new HashSet<Statement>();
199 if (objectsLeft.isEmpty())
203 // process compares objects that are identified and searches for more resources to process.
204 process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);
205 // process unreliable handles cases where unidentified statements subject and object have been identified
206 processUnreliable(unreliableLeft, unreliableRight);
207 // process unreliable handles cases where unidentified resources have path of length one to identified resource
208 processUnreliable(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
209 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
210 processUnreliable2(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
212 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
213 // comparison is ending, but we have still unprocessed unidentified resources left.
214 // These cases have longer path than one to identified objects.
215 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
219 for (Statement s : unreliableLeft) {
220 if (!comparableStatements.containsLeft(s))
223 for (Statement s : unreliableRight) {
224 if (!comparableStatements.containsRight(s))
229 public void test(Session session) throws DatabaseException {
230 test(session, r1, r2);
233 public void test(Session session, Resource r1, Resource r2) throws DatabaseException {
235 comparator.setComparator(this);
237 session.syncRequest(new ReadRequest() {
240 public void run(ReadGraph graph) throws DatabaseException {
241 comparator.initialize(graph, r1, r2);
245 addComparable(r1, r2);
247 final Stack<Resource> objectsLeft = new Stack<Resource>();
248 final Stack<Resource> objectsRight = new Stack<Resource>();
249 objectsLeft.push(r1);
250 objectsRight.push(r2);
252 final Set<Statement> unreliableLeft = new HashSet<Statement>();
253 final Set<Statement> unreliableRight = new HashSet<Statement>();
256 if (objectsLeft.isEmpty())
258 session.syncRequest(new ReadRequest() {
261 public void run(ReadGraph graph) throws DatabaseException {
263 b = Layer0.getInstance(graph);
264 // process compares objects that are identified and searches for more resources to process.
265 process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);
266 // process unreliable handles cases where unidentified statements subject and object have been identified
267 processUnreliable(unreliableLeft, unreliableRight);
268 // process unreliable handles cases where unidentified resources have path of length one to identified resource
269 processUnreliable(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
270 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
271 processUnreliable2(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
273 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
274 // comparison is ending, but we have still unprocessed unidentified resources left.
275 // These cases have longer path than one to identified objects.
276 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
278 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
279 // comparison is ending, but we have still unprocessed unidentified resources left.
280 // These cases have longer path than one to identified objects.
281 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
289 for (Statement s : unreliableLeft) {
290 if (!comparableStatements.containsLeft(s))
293 for (Statement s : unreliableRight) {
294 if (!comparableStatements.containsRight(s))
301 private void process(Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {
302 List<Statement> ss1 = new ArrayList<Statement>();
303 List<Statement> ss2 = new ArrayList<Statement>();
305 while (!objectsLeft.isEmpty()) {
306 Resource r1 = objectsLeft.pop();
307 Resource r2 = objectsRight.pop();
311 if (r1.getResourceId() == 610446L)
312 System.out.println();
313 if (processedResources.contains(r1))
315 processedResources.add(r1);
318 if((comparableResources.containsLeft(r1)||comparableResources.containsRight(r2)) && !comparableResources.contains(r1, r2)) {
319 throw new DatabaseException("Comparator error: Trying to map " + r1 + " to " + r2 + " while mappings " + r1 + " to " + comparableResources.getRight(r1) + " and " + comparableResources.getLeft(r2) + " to " + r2 + " exist.");
321 addComparable(r1, r2);
323 //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
324 compareProps(r1, r2);
326 for (Resource rel : tested) {
327 ss1.addAll(g.getStatements(r1, rel));
328 ss2.addAll(g.getStatements(r2, rel));
329 ss1 = filterAsserted(r1, ss1);
330 ss2 = filterAsserted(r2, ss2);
331 ss1 = filterTraversed(ss1);
332 ss2 = filterTraversed(ss2);
333 ss1 = filterNonTested(ss1);
334 ss2 = filterNonTested(ss2);
337 compareStatements(ss1, ss2, null, null,null,null);
342 for (Resource rel : traversed) {
343 ss1.addAll(g.getStatements(r1, rel));
344 ss2.addAll(g.getStatements(r2, rel));
345 ss1 = filterAsserted(r1, ss1);
346 ss2 = filterAsserted(r2, ss2);
347 ss1 = filterNonTraversed(ss1);
348 ss2 = filterNonTraversed(ss2);
349 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
357 private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {
358 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
359 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
360 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
361 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
363 for (Statement s : unreliableLeft) {
364 subjectLeft.add(s.getSubject(),s);
365 objectLeft.add(s.getObject(),s);
367 for (Statement s : unreliableRight) {
368 subjectRight.add(s.getSubject(),s);
369 objectRight.add(s.getObject(),s);
372 for (Resource left : subjectLeft.getKeys()) {
373 Resource right = comparableResources.getRight(left);
376 for (Statement leftS : subjectLeft.getValues(left)) {
377 Resource leftO = leftS.getObject();
378 if (!unreliableLeft.contains(leftS))
380 Resource rightO = comparableResources.getRight(leftO);
383 for (Statement rightS : subjectRight.getValues(right)) {
384 if (!rightS.getObject().equals(rightO))
386 if (!unreliableRight.contains(rightS))
388 if (leftS.getPredicate().equals(rightS.getPredicate()) ||
389 comparableResources.contains(leftS.getPredicate(), rightS.getPredicate())) {
390 unreliableLeft.remove(leftS);
391 unreliableRight.remove(rightS);
392 addComparable(leftS, rightS);
399 private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
400 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
401 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
402 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
403 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
405 for (Statement s : unreliableLeft) {
406 subjectLeft.add(s.getSubject(),s);
407 objectLeft.add(s.getObject(),s);
409 for (Statement s : unreliableRight) {
410 subjectRight.add(s.getSubject(),s);
411 objectRight.add(s.getObject(),s);
414 for (Resource ol : objectLeft.getKeys()) {
415 // all statements to the left side object
416 List<Statement> left = objectLeft.getValues(ol);
417 // all subjects that have statements to the left side object (ol)
418 Set<Resource> sLeft = new HashSet<Resource>();
419 // all matching subjects on the right side
420 Set<Resource> sRight = new HashSet<Resource>();
421 for (Statement s : left) {
422 sLeft.add(s.getSubject());
423 sRight.add(comparableResources.getRight(s.getSubject()));
426 // check if object left can be reliably identified by available statements
427 // if there are any objects on the left side with similar statements, object left cannot be mapped.
428 boolean hasSimilar = false;
429 MapList<Resource, Statement> comparableOLeft = new MapList<Resource, Statement>();
430 for (Resource sl : sLeft) {
431 for (Statement s : subjectLeft.getValues(sl)) {
432 if (!s.getObject().equals(ol)) {
433 comparableOLeft.add(s.getObject(),s);
438 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
440 for (Resource similarOl : comparableOLeft.getKeys()) {
441 List<Statement> similarLeft = comparableOLeft.getValues(similarOl);
442 if (similarLeft.size() == left.size()) {
443 boolean useL[] = new boolean[left.size()];
444 boolean useSL[] = new boolean[left.size()];
445 for (int i = 0; i < left.size(); i++) {
449 for (int i = 0; i < left.size(); i++) {
450 for (int j = 0; j < left.size(); j++) {
453 // compare predicates
454 Resource pl = left.get(i).getPredicate();
455 Resource psl = similarLeft.get(j).getPredicate();
456 if (pl.equals(psl)) {
457 // compare objects (unreliable result is interpreted as positive match)
459 int comp = comparator.compare(g, left.get(i).getObject(), similarLeft.get(j).getObject(), true);
460 if (comp >= 0 && comp < Integer.MAX_VALUE) {
468 boolean diff = false;
469 for (int i = 0; i < left.size(); i++) {
470 if (!useL[i] || !useSL[i]) {
485 // all objects that subjects on the right side point to. Object left has its matching resource among these, if it has matching resource
486 MapList<Resource,Statement> possibleOR = new MapList<Resource, Statement>();
487 for (Resource sr : sRight) {
488 for (Statement s : subjectRight.getValues(sr))
489 possibleOR.add(s.getObject(),s);
492 // filter possible right side objects to those that have same amount of statements as the left side object
493 for (Resource or : possibleOR.getKeys().toArray(new Resource[possibleOR.getKeys().size()])) {
494 List<Statement> right = possibleOR.getValues(or);
495 if (right.size() != left.size())
496 possibleOR.remove(or);
500 // check for matching statements (comparable subjects, matching predicates)
501 MapList<Resource,Statement> matchingOR = new MapList<Resource, Statement>(); // list of objects that have matching statements
502 Map<Resource,Pair<int[], int[]>> matchingStatements = new HashMap<Resource, Pair<int[], int[]>>(); // matching statements
503 for (Resource or : possibleOR.getKeys()) {
504 List<Statement> right = possibleOR.getValues(or);
505 int iLeft[] = new int[left.size()];
506 int iRight[] = new int[right.size()];
508 for (int i = 0; i < left.size(); i++) {
513 for (int l = 0; l < left.size(); l++) {
514 Statement ls = left.get(l);
515 for (int r = 0; r < right.size(); r++) {
518 Statement rs = right.get(r);
519 if (!comparableResources.contains(ls.getSubject(), rs.getSubject()))
521 if (rcomp.compare(ls.getPredicate(),rs.getPredicate()) == 0) {
522 // compare objects (unreliable result is not accepted)
523 int comp = comparator.compare(g, ls.getObject(), rs.getObject());
524 if (comp > 0 && comp < Integer.MAX_VALUE) {
534 boolean success = true;
535 for (int i = 0; i < left.size(); i++) {
547 for (Statement s : right)
548 matchingOR.add(or,s);
549 matchingStatements.put(or, new Pair<int[], int[]>(iLeft, iRight));
552 // if there is only one matching right side object, we have found a match
553 if (matchingOR.getKeySize() == 1) {
554 Resource or = matchingOR.getKeys().iterator().next();
555 List<Statement> right = matchingOR.getValues(or);
556 Pair<int[], int[]> indices = matchingStatements.get(or);
559 objectsRight.add(or);
560 addComparable(ol, or);
561 for (int l = 0; l < left.size(); l++) {
562 int r = indices.first[l];
563 Statement sl = left.get(l);
564 Statement sr = right.get(r);
565 addComparable(sl, sr);
566 unreliableLeft.remove(sl);
567 unreliableRight.remove(sr);
579 private void processUnreliable2(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
580 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
581 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
582 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
583 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
585 for (Statement s : unreliableLeft) {
586 subjectLeft.add(s.getSubject(),s);
587 objectLeft.add(s.getObject(),s);
589 for (Statement s : unreliableRight) {
590 subjectRight.add(s.getSubject(),s);
591 objectRight.add(s.getObject(),s);
594 for (Resource ol : objectLeft.getKeys()) {
595 // all statements to the left side object
596 List<Statement> left = objectLeft.getValues(ol);
597 // all subjects that have statements to the left side object (ol)
598 Set<Resource> sLeft = new HashSet<Resource>();
599 // all matching subjects on the right side
600 Set<Resource> sRight = new HashSet<Resource>();
601 for (Statement s : left) {
602 sLeft.add(s.getSubject());
603 sRight.add(comparableResources.getRight(s.getSubject()));
606 if (sLeft.size() == 1 && sRight.size() == 1) {
607 List<Statement> ss1 = new ArrayList<Statement>(subjectLeft.getValues(sLeft.iterator().next()));
608 List<Statement> ss2 = new ArrayList<Statement>(subjectRight.getValues(sRight.iterator().next()));
610 int count = comparableStatements.size();
611 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
612 if (comparableStatements.size() > count) {
613 for (Entry<Statement, Statement> entry : comparableStatements.getEntries()) {
614 unreliableLeft.remove(entry.getKey());
615 unreliableRight.remove(entry.getValue());
622 private void processUnreliableDeep(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
623 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
624 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
625 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
626 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
628 for (Statement s : unreliableLeft) {
629 subjectLeft.add(s.getSubject(),s);
630 objectLeft.add(s.getObject(),s);
632 for (Statement s : unreliableRight) {
633 subjectRight.add(s.getSubject(),s);
634 objectRight.add(s.getObject(),s);
636 for (Resource ol : objectLeft.getKeys()) {
637 Set<Path> pathsLeft = new HashSet<Path>();
638 for (Resource rel : traversed) {
639 pathsLeft.addAll(Path.create(g.getStatements(ol, rel)));
643 if (pathsLeft.size() == 0)
645 Collection<Path> endPaths = new ArrayList<Path>(1);
646 for (Path p : pathsLeft) {
647 if (comparableResources.containsLeft(p.getEnd())) {
651 if (endPaths.size() > 0) {
653 pathsLeft.addAll(endPaths);
657 if (pathsLeft.size() > 0) {
658 Resource sl = objectLeft.getValues(ol).get(0).getSubject();
659 Resource sr = comparableResources.getRight(sl);
660 Collection<Resource> possibleOR = new ArrayList<Resource>();
661 for (Statement s : subjectRight.getValues(sr)) {
662 possibleOR.add(s.getObject());
664 Map<Resource,Set<Path>> matchingPaths = new HashMap<Resource, Set<Path>>();
665 for (Resource or : possibleOR) {
666 Set<Path> possiblePathsRight = new HashSet<Path>();
667 for (Path leftPath : pathsLeft) {
668 possiblePathsRight.addAll(findComparableRight(leftPath, or));
670 if (hasMatchingPaths(pathsLeft, possiblePathsRight)) {
671 matchingPaths.put(or, possiblePathsRight);
674 if (matchingPaths.size() > 0) {
675 if (matchingPaths.size() == 1) {
676 Resource or = matchingPaths.keySet().iterator().next();
679 objectsRight.add(or);
680 addComparable(ol, or);
681 Collection<Statement> statementsLeft = objectLeft.getValues(ol);
682 Collection<Statement> statementsRight = objectRight.getValues(or);
683 unreliableLeft.removeAll(statementsLeft);
684 unreliableRight.removeAll(statementsRight);
685 BijectionMap<Path,Path> map = getMatchingPaths(pathsLeft, matchingPaths.get(or));
686 for (Path left : map.getLeftSet()) {
687 Path right = map.getRight(left);
688 for (int i = 0; i < left.getLength(); i++) {
689 addComparable(left.getStatements().get(i),right.getStatements().get(i));
700 private boolean hasMatchingPaths(Set<Path> leftPaths, Set<Path> rightPaths) {
701 if (leftPaths.size() != rightPaths.size())
703 BijectionMap<Path,Path> map = getMatchingPaths(leftPaths, rightPaths);
704 return map.size() == leftPaths.size();
707 private BijectionMap<Path,Path> getMatchingPaths(Set<Path> leftPaths, Set<Path> rightPaths) {
708 BijectionMap<Path,Path> map = new BijectionMap<Path, Path>();
709 for (Path leftPath : leftPaths) {
710 for (Path rightPath : rightPaths) {
711 if (map.containsRight(rightPath))
713 if (leftPath.getLength() != rightPath.getLength())
715 if (comparableResources.contains(leftPath.getEnd(), rightPath.getEnd())) {
716 map.map(leftPath, rightPath);
724 private void expand(Set<Path> paths) throws DatabaseException {
725 Set<Path> stepPathsLeft = new HashSet<Path>();
726 if (paths.size() == 0)
728 int length = paths.iterator().next().getLength() + 1;
729 for (Path p : paths) {
730 for (Resource rel : traversed) {
731 stepPathsLeft.addAll(Path.expand(p,g.getStatements(p.getEnd(), rel)));
735 for (Path p : stepPathsLeft) {
736 if (p.getLength() == length)
741 private Collection<Path> findComparableRight(Path leftPath, Resource beginRight) throws DatabaseException {
742 Set<Path> rightPaths = new HashSet<Path>();
743 rightPaths.addAll(Path.create(g.getStatements(beginRight, getRight(leftPath.getStatements().get(0).getPredicate()))));
744 for (int i = 1; i < leftPath.getLength(); i++) {
745 if (rightPaths.size() == 0)
747 Set<Path> stepPaths = new HashSet<Path>();
748 for (Path p : rightPaths) {
749 stepPaths.addAll(Path.expand(p, g.getStatements(p.getEnd(), getRight(leftPath.getStatements().get(i).getPredicate()))));
752 for (Path p : stepPaths)
753 if (p.getLength() == i+1)
760 private Resource getRight(Resource r) {
761 if (comparableResources.containsLeft(r))
762 return comparableResources.getRight(r);
768 public BijectionMap<Statement, Statement> getComparableStatements() {
769 return comparableStatements;
772 public BijectionMap<Resource, Resource> getComparableResources() {
773 return comparableResources;
776 public GraphChanges getChanges() {
777 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);
780 private void addComparable(Statement left, Statement right) throws DatabaseException {
781 addComparable(left.getObject(), right.getObject());
782 comparableStatements.map(left, right);
783 //comparableResources.map(left.getObject(), right.getObject());
786 private void addComparable(Resource left, Resource right) throws DatabaseException {
787 if(!comparableResources.contains(left, right)) {
788 if (comparableResources.containsLeft(left)||comparableResources.containsRight(right)) {
789 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.");
791 if (DEBUG) System.out.println(left + " = " + right);
792 if (left.getResourceId() == 610381L)
793 System.out.println();
794 comparableResources.map(left, right);
800 public List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws DatabaseException {
801 List<Statement> out = new ArrayList<Statement>();
802 for (Statement s : in) {
803 if (!s.isAsserted(r))
812 private String printStatement(ReadGraph graph, Statement s) throws DatabaseException {
813 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());
816 private List<Statement> filterTraversed(List<Statement> in) throws DatabaseException {
817 return filter(traversed, in);
820 private List<Statement> filterNonTested(List<Statement> in) throws DatabaseException {
821 return filter(nonTested, in);
824 private List<Statement> filterNonTraversed(List<Statement> in) throws DatabaseException {
825 return filter(nonTraversed, in);
828 private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws DatabaseException {
829 if (toFilter.size() == 0)
831 List<Statement> out = new ArrayList<Statement>();
832 for (Statement s : in) {
833 boolean usable = true;
834 for (Resource r : toFilter) {
835 if (g.isSubrelationOf(s.getPredicate(),r)) {
849 private void addDeletion(Statement s) {
850 if (!changes1Set.contains(s)) {
856 private void addAddition(Statement s) {
857 if (!changes2Set.contains(s)) {
863 private void addModification(Resource sub1, Statement s1, Resource sub2, Statement s2) {
864 Modification mod = new Modification(sub1, sub2, s1, s2);
865 if (!modificationsSet.contains(mod)) {
866 modificationsSet.add(mod);
867 modifications.add(mod);
871 public void sortStatement(List<Statement> list1, List<Statement> list2) {
872 sortStatement(list1, list2, scomp);
875 public void sortStatement(List<Statement> list1, List<Statement> list2, Comparator<Statement> scomp) {
876 Collections.sort(list1,scomp);
877 Collections.sort(list2,scomp);
879 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());
880 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());
881 sorted1.addAll(list1);
882 sorted2.addAll(list2);
886 for (int i = 0; i < list1.size(); ) {
887 Statement s1 = list1.get(i);
888 int same1 = sameRel(list1, i);
889 for (int j = 0; j < list2.size(); j++) {
890 Statement s2 = list2.get(j);
891 if (scomp.compare(s1, s2) == 0) {
892 int same2 = sameRel(list2, j);
893 copy(sorted1,ss1,list1,i,same1);
895 copy(sorted2,ss2,list2,j,same2);
902 if (ss1 < sorted1.size()) {
903 for (Statement s : list1) {
904 if (!sorted1.contains(s)) {
910 if (ss2 < sorted2.size()) {
911 for (Statement s : list2) {
912 if (!sorted2.contains(s)) {
921 list1.addAll(sorted1);
922 list2.addAll(sorted2);
925 public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {
926 for (int i = 0; i < amount; i++) {
927 to.set(toIndex + i, from.get(fromIndex+ i));
931 public void sortResource(List<Resource> list1, List<Resource> list2) {
932 Collections.sort(list1,rcomp);
934 for (int i = 0; i < list1.size(); i++) {
935 Resource s1 = list1.get(i);
936 for (int j = js; j < list2.size(); j++) {
937 Resource s2 = list2.get(j);
938 if (rcomp.compare(s1, s2) == 0) {
939 Resource t = list2.get(js);
949 private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {
950 sortStatement(ss1, ss2);
956 if (i1 >= ss1.size()) {
957 if (i2 >= ss2.size()) {
960 while (i2 < ss2.size()) {
961 if (DEBUG) System.out.println("Compare Statements addition " + printStatement(g,ss2.get(i2)));
963 addAddition(ss2.get(i2));
968 } else if (i2 >= ss2.size()) {
969 while (i1 < ss1.size()) {
970 if (DEBUG) System.out.println("Compare Statements deletion " + printStatement(g,ss1.get(i1)));
971 addDeletion(ss1.get(i1));
976 int same1 = sameRel(ss1, i1);
977 int same2 = sameRel(ss2, i2);
978 int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());
980 compareStatements(ss1, i1, same1, ss2, i2, same2,objectsLeft,objectsRight,unreliableLeft,unreliableRight);
984 for (int i = 0; i < same1; i++) {
985 if (DEBUG) System.out.println("Compare Statements deletion " + printStatement(g,ss1.get(i+i1)));
986 addDeletion(ss1.get(i+i1));
990 for (int i = 0; i < same2; i++) {
991 if (DEBUG) System.out.println("Compare Statements addition " + printStatement(g,ss2.get(i+i2)));
992 addAddition(ss2.get(i+i2));
1002 private int sameRel(List<Statement> statements, int off) {
1003 if (statements.size() <= off)
1006 long id = statements.get(off).getPredicate().getResourceId();
1007 for (int i = off+1; i <statements.size(); i++) {
1008 if (statements.get(i).getPredicate().getResourceId() == id)
1017 private int compareObject(Resource o1, Resource o2) throws DatabaseException {
1020 if (comparableResources.contains(o1, o2))
1022 if (comparableResources.containsLeft(o1))
1023 return Integer.MAX_VALUE;
1024 if (comparableResources.containsRight(o2))
1025 return Integer.MAX_VALUE;
1026 if (nonMatchedLeft.contains(o1))
1027 return Integer.MAX_VALUE;
1028 if (nonMatchedRight.contains(o2))
1029 return Integer.MAX_VALUE;
1030 return comparator.compare(g, o1, o2);
1033 private void compareStatements(List<Statement> ss1, int off1, int len1, List<Statement> ss2, int off2, int len2, Collection<Resource> objectsLeft, Collection<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {
1034 boolean[] used1 = new boolean[len1];
1035 for (int i = 0; i < used1.length; i++) {
1039 boolean[] used2 = new boolean[len2];
1040 for (int i = 0; i < used2.length; i++) {
1044 // left, right, difference
1045 List<List<Integer>> differences = new ArrayList<List<Integer>>();
1046 for (int i1 = off1; i1 < off1 + len1; i1++) {
1047 Statement s1 = ss1.get(i1);
1048 List<Integer> diff = new ArrayList<Integer>();
1049 for (int i2 = off2; i2 < off2 + len2; i2++) {
1050 Statement s2 = ss2.get(i2);
1051 int d = compareObject(s1.getObject(), s2.getObject());
1053 for (Resource t : strong) {
1054 if (s1.getPredicate().equals(t) || g.isSubrelationOf(s1.getPredicate(), t)) {
1062 differences.add(diff);
1065 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();
1066 for (int i = 0; i < differences.size(); i++) {
1067 List<Integer> list = differences.get(i);
1068 for (int j = 0; j < list.size(); j++) {
1069 priorities.add(list.get(j), i);
1073 Integer[] pris = priorities.getKeys(new Integer[]{});
1076 for (Integer pri : pris) {
1077 if (pri == Integer.MAX_VALUE) {
1079 } else if (pri == 0) {
1082 List<Integer> i1s = priorities.getValues(pri);
1083 for (Integer i1 : i1s) {
1086 List<Integer> i2diff = differences.get(i1);
1087 for (int i2 = 0; i2 < i2diff.size(); i2++) {
1088 if (i2diff.get(i2) == pri) {
1093 Statement s1 = ss1.get(i1+off1);
1094 Statement s2 = ss2.get(i2+off2);
1096 if (objectsLeft != null) {
1097 objectsLeft.add(s1.getObject());
1098 objectsRight.add(s2.getObject());
1100 addComparable(s1, s2);
1108 for (Integer pri : pris) {
1111 Set<Statement> s1s = new HashSet<Statement>();
1112 Set<Statement> s2s = new HashSet<Statement>();
1113 Set<Integer> s1i = new HashSet<Integer>();
1114 Set<Integer> s2i = new HashSet<Integer>();
1115 List<Integer> i1s = priorities.getValues(pri);
1116 for (Integer i1 : i1s) {
1119 List<Integer> i2diff = differences.get(i1);
1120 for (int i2 = 0; i2 < i2diff.size(); i2++) {
1121 if (i2diff.get(i2) == pri) {
1124 Statement s1 = ss1.get(i1+off1);
1125 Statement s2 = ss2.get(i2+off2);
1133 if (unreliableLeft != null) {
1134 unreliableLeft.addAll(s1s);
1135 unreliableRight.addAll(s2s);
1137 for (Integer i : s1i)
1139 for (Integer i : s2i)
1143 for (int i1 = off1; i1 < off1 + len1; i1++) {
1144 if (!used1[i1-off1]) {
1145 if (DEBUG) System.out.println("Compare Object deletion " + printStatement(g,ss1.get(i1)));
1146 addDeletion(ss1.get(i1));
1149 for (int i2 = off2; i2 < off2 + len2; i2++) {
1150 if (!used2[i2-off2]) {
1151 if (DEBUG) System.out.println("Compare Object addition " + printStatement(g,ss2.get(i2)));
1152 addAddition(ss2.get(i2));
1160 * compares properties, assumes functional relations
1163 * @throws ServiceException
1164 * @throws DoesNotContainValueException
1165 * @throws ValidationException
1167 private void compareProps(Resource r1, Resource r2) throws DatabaseException {
1168 if (DEBUG) System.out.println("compareProps " + r1 + " " + NameUtils.getSafeName(g, r1) + " " + r2 + " " + NameUtils.getSafeName(g, r2));
1169 List<Statement> ss1 = new ArrayList<Statement>();
1170 List<Statement> ss2 = new ArrayList<Statement>();
1171 ss1.addAll(g.getStatements(r1, b.HasProperty));
1172 ss2.addAll(g.getStatements(r2, b.HasProperty));
1173 ss1 = filterNonTested(ss1);
1174 ss2 = filterNonTested(ss2);
1175 sortStatement(ss1, ss2);
1181 if (i1 >= ss1.size()) {
1182 if (i2 >= ss2.size())
1185 while (i2 < ss2.size()) {
1186 Statement s = ss2.get(i2);
1187 if (DEBUG) System.out.println("Compare Prop diff2 " + printStatement(g,s));
1188 if (!s.isAsserted(r2))
1194 } else if (i2 >= ss2.size()) {
1195 while (i1 < ss1.size()) {
1196 Statement s = ss1.get(i1);
1197 if (DEBUG) System.out.println("Compare Prop diff1 " + printStatement(g,s));
1198 if (!s.isAsserted(r1))
1204 Statement s1 = ss1.get(i1);
1205 Statement s2 = ss2.get(i2);
1206 if (s1.isAsserted(r1) && s2.isAsserted(r2)) {
1211 int c = scomp.compare(s1, s2);
1214 boolean b1 = g.hasValue(s1.getObject());
1215 boolean b2 = g.hasValue(s2.getObject());
1218 // Object v1 = g.getValue(s1.getObject());
1219 // Object v2 = g.getValue(s2.getObject());
1220 // boolean eq = compareValue(v1, v2);
1221 boolean eq = compareValue(g,b,s1.getObject(), s2.getObject());
1223 addModification(r1,s1,r2,s2);
1224 if (!s1.isAsserted(r1) && !s2.isAsserted(r2))
1225 addComparable(s1, s2);
1228 if (!s1.getObject().equals(s1.getSubject()) && !s2.getObject().equals(s2.getSubject()))
1229 compareProps(s1.getObject(), s2.getObject());
1232 addModification(r1,s1,r2,s2);
1233 if (!s1.isAsserted(r1) && !s2.isAsserted(r2))
1234 addComparable(s1, s2);
1241 if (DEBUG) System.out.println("Compare Prop diff1s " + printStatement(g,s1));
1248 if (DEBUG) System.out.println("Compare Prop diff2s " + printStatement(g,s2));
1262 public static boolean compareValue(ReadGraph g, Layer0 b, Resource r1, Resource r2) throws DatabaseException {
1263 Resource t1 = g.getSingleType(r1);
1264 Resource t2 = g.getSingleType(r2);
1267 if (t1.equals(b.Integer)) {
1268 int v1 = g.getValue(r1, Bindings.INTEGER);
1269 int v2 = g.getValue(r2, Bindings.INTEGER);
1271 } else if (t1.equals(b.Float)) {
1272 float v1 = g.getValue(r1, Bindings.FLOAT);
1273 float v2 = g.getValue(r2, Bindings.FLOAT);
1275 } else if (t1.equals(b.Double)) {
1276 double v1 = g.getValue(r1, Bindings.DOUBLE);
1277 double v2 = g.getValue(r2, Bindings.DOUBLE);
1279 } else if (t1.equals(b.String)) {
1280 String v1 = g.getValue(r1, Bindings.STRING);
1281 String v2 = g.getValue(r2, Bindings.STRING);
1282 return v1.equals(v2);
1283 } else if (t1.equals(b.Boolean)) {
1284 boolean v1 = g.getValue(r1, Bindings.BOOLEAN);
1285 boolean v2 = g.getValue(r2, Bindings.BOOLEAN);
1287 } else if (t1.equals(b.Byte)) {
1288 byte v1 = g.getValue(r1, Bindings.BYTE);
1289 byte v2 = g.getValue(r2, Bindings.BYTE);
1291 } else if (t1.equals(b.Long)) {
1292 long v1 = g.getValue(r1, Bindings.LONG);
1293 long v2 = g.getValue(r2, Bindings.LONG);
1295 } else if (t1.equals(b.IntegerArray)) {
1296 int[] v1 = g.getValue(r1, Bindings.INT_ARRAY);
1297 int[] v2 = g.getValue(r2, Bindings.INT_ARRAY);
1298 return Arrays.equals(v1,v2);
1299 } else if (t1.equals(b.FloatArray)) {
1300 float[] v1 = g.getValue(r1, Bindings.FLOAT_ARRAY);
1301 float[] v2 = g.getValue(r2, Bindings.FLOAT_ARRAY);
1302 return Arrays.equals(v1,v2);
1303 } else if (t1.equals(b.DoubleArray)) {
1304 double[] v1 = g.getValue(r1, Bindings.DOUBLE_ARRAY);
1305 double[] v2 = g.getValue(r2, Bindings.DOUBLE_ARRAY);
1306 return Arrays.equals(v1,v2);
1307 } else if (t1.equals(b.StringArray)) {
1308 String[] v1 = g.getValue(r1, Bindings.STRING_ARRAY);
1309 String[] v2 = g.getValue(r2, Bindings.STRING_ARRAY);
1310 return Arrays.equals(v1,v2);
1311 } else if (t1.equals(b.BooleanArray)) {
1312 boolean[] v1 = g.getValue(r1, Bindings.BOOLEAN_ARRAY);
1313 boolean[] v2 = g.getValue(r2, Bindings.BOOLEAN_ARRAY);
1314 return Arrays.equals(v1,v2);
1315 } else if (t1.equals(b.ByteArray)) {
1316 byte[] v1 = g.getValue(r1, Bindings.BYTE_ARRAY);
1317 byte[] v2 = g.getValue(r2, Bindings.BYTE_ARRAY);
1318 return Arrays.equals(v1,v2);
1319 } else if (t1.equals(b.LongArray)) {
1320 long[] v1 = g.getValue(r1, Bindings.LONG_ARRAY);
1321 long[] v2 = g.getValue(r2, Bindings.LONG_ARRAY);
1322 return Arrays.equals(v1,v2);
1324 Object v1 = g.getValue(r1);
1325 Object v2 = g.getValue(r2);
1326 return compareValue(v1, v2);
1331 public static boolean compareValue(Object v1, Object v2) {
1332 if (v1 instanceof Object[] && v2 instanceof Object[])
1333 return Arrays.deepEquals((Object[])v1, (Object[])v2);
1334 else if (v1 instanceof int[] && v2 instanceof int[])
1335 return Arrays.equals((int[])v1, (int[])v2);
1336 else if (v1 instanceof float[] && v2 instanceof float[])
1337 return Arrays.equals((float[])v1, (float[])v2);
1338 else if (v1 instanceof double[] && v2 instanceof double[])
1339 return Arrays.equals((double[])v1, (double[])v2);
1340 else if (v1 instanceof long[] && v2 instanceof long[])
1341 return Arrays.equals((long[])v1, (long[])v2);
1342 else if (v1 instanceof byte[] && v2 instanceof byte[])
1343 return Arrays.equals((byte[])v1, (byte[])v2);
1344 else if (v1 instanceof boolean[] && v2 instanceof boolean[])
1345 return Arrays.equals((boolean[])v1, (boolean[])v2);
1347 return v1.equals(v2);
1351 public class PredicateComparator implements Comparator<Statement> {
1353 public int compare(Statement o1, Statement o2) {
1354 if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))
1356 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
1358 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
1364 public class SubjectComparator implements Comparator<Statement> {
1366 public int compare(Statement o1, Statement o2) {
1367 if (comparableResources.contains(o1.getSubject(), o2.getSubject()))
1369 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
1371 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
1377 public class ObjectComparator implements Comparator<Statement> {
1379 public int compare(Statement o1, Statement o2) {
1380 if (comparableResources.contains(o1.getObject(), o2.getObject()))
1382 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
1384 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
1390 public static class FullStatementComparator implements Comparator<Statement> {
1392 public int compare(Statement o1, Statement o2) {
1393 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
1395 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
1397 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
1399 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
1401 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
1403 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
1409 public class ResComparator implements Comparator<Resource> {
1411 public int compare(Resource o1, Resource o2) {
1412 if (comparableResources.contains(o1, o2))
1414 if (o1.getResourceId() < o2.getResourceId())
1416 if (o1.getResourceId() > o2.getResourceId())