1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
\r
3 * in Industry THTH ry.
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * Foster Wheeler Energia Oy - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.interop.test;
\r
14 import java.util.ArrayList;
\r
15 import java.util.Arrays;
\r
16 import java.util.Collection;
\r
17 import java.util.Collections;
\r
18 import java.util.Comparator;
\r
19 import java.util.HashSet;
\r
20 import java.util.List;
\r
21 import java.util.Set;
\r
22 import java.util.Stack;
\r
24 import org.simantics.db.ReadGraph;
\r
25 import org.simantics.db.Resource;
\r
26 import org.simantics.db.Statement;
\r
27 import org.simantics.db.common.utils.NameUtils;
\r
28 import org.simantics.db.exception.DatabaseException;
\r
29 import org.simantics.db.exception.DoesNotContainValueException;
\r
30 import org.simantics.db.exception.ServiceException;
\r
31 import org.simantics.db.exception.ValidationException;
\r
32 import org.simantics.layer0.Layer0;
\r
33 import org.simantics.utils.datastructures.BijectionMap;
\r
34 import org.simantics.utils.datastructures.MapList;
\r
35 import org.simantics.utils.datastructures.Pair;
\r
38 * Compares two subgraphs and reports differences.
\r
40 * Assumes that subgraphs (defined using traverse relations) are not cyclic.
\r
42 * Assumes that properties can be used to identify objects, if relation type is not enough.
\r
46 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
\r
49 public class GraphComparator {
\r
51 private Resource r1;
\r
52 private Resource r2;
\r
53 private List<Resource> traversed = new ArrayList<Resource>(); // list of relations that are traversed (and tested)
\r
54 private List<Resource> tested = new ArrayList<Resource>(); // list of relations that are tested, but not traversed
\r
55 private List<Resource> nonTraversed = new ArrayList<Resource>(); // list of relations that are not traversed
\r
56 private List<Resource> nonTested = new ArrayList<Resource>(); // list of relations that are not tested
\r
58 private List<Statement> changes1 = new ArrayList<Statement>();
\r
59 private List<Statement> changes2 = new ArrayList<Statement>();
\r
60 private List<Pair<Statement,Statement>> modifications = new ArrayList<Pair<Statement,Statement>>();
\r
61 private Set<Statement> changes1Set = new HashSet<Statement>();
\r
62 private Set<Statement> changes2Set = new HashSet<Statement>();
\r
63 private Set<Pair<Statement,Statement>> modificationsSet = new HashSet<Pair<Statement,Statement>>();
\r
65 private BijectionMap<Statement, Statement> comparableStatements = new BijectionMap<Statement, Statement>();
\r
66 private BijectionMap<Resource, Resource> comparableResources = new BijectionMap<Resource, Resource>();
\r
69 private ObjectComparator comparator;
\r
71 private Comparator<Statement> scomp = new PredicateComparator();
\r
72 private Comparator<Resource> rcomp = new ResourceComparator();
\r
74 // runtime attributes
\r
76 private ReadGraph g;
\r
79 public GraphComparator(Resource r1, Resource r2) {
\r
82 comparator = new TypeComparator();
\r
85 public GraphComparator(Resource r1, Resource r2, ObjectComparator comparator) {
\r
88 this.comparator = comparator;
\r
91 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
92 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
95 public Comparator<Resource> getResourceComparator() {
\r
99 public Comparator<Statement> getStatementComparator() {
\r
103 public Resource getR1() {
\r
107 public Resource getR2() {
\r
111 public void addTraversed(Resource rel) {
\r
112 traversed.add(rel);
\r
115 public void addTraversed(Collection<Resource> rels) {
\r
116 traversed.addAll(rels);
\r
119 public void addNonTraversed(Resource rel) {
\r
120 nonTraversed.add(rel);
\r
123 public void addNonTraversed(Collection<Resource> rels) {
\r
124 nonTraversed.addAll(rels);
\r
127 public void addTested(Resource rel) {
\r
131 public void addTested(Collection<Resource> rels) {
\r
132 tested.addAll(rels);
\r
135 public void addNonTested(Resource rel) {
\r
136 nonTested.add(rel);
\r
139 public void addNonTested(Collection<Resource> rels) {
\r
140 nonTested.addAll(rels);
\r
143 public void addComparableResources(Resource r1, Resource r2) {
\r
144 comparableResources.map(r1, r2);
\r
147 public void addComparableResources(BijectionMap<Resource, Resource> matching) {
\r
148 comparableResources.addAll(matching);
\r
151 public void clearRels() {
\r
154 nonTraversed.clear();
\r
158 public void test(ReadGraph g) throws DatabaseException {
\r
160 this.b = Layer0.getInstance(g);
\r
161 comparator.setComparator(this);
\r
163 Stack<Resource> stack1 = new Stack<Resource>();
\r
164 Stack<Resource> stack2 = new Stack<Resource>();
\r
169 List<Statement> ss1 = new ArrayList<Statement>();
\r
170 List<Statement> ss2 = new ArrayList<Statement>();
\r
172 while (!stack1.isEmpty()) {
\r
173 Resource r1 = stack1.pop();
\r
174 Resource r2 = stack2.pop();
\r
176 if (comparableResources.contains(r1, r2)) {
\r
177 //System.out.println("already tested " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
\r
180 comparableResources.map(r1, r2);
\r
182 //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
\r
183 compareProps(r1, r2);
\r
185 for (Resource rel : tested) {
\r
186 ss1.addAll(g.getStatements(r1, rel));
\r
187 ss2.addAll(g.getStatements(r2, rel));
\r
188 ss1 = filterAsserted(r1, ss1);
\r
189 ss2 = filterAsserted(r2, ss2);
\r
190 ss1 = filterTraversed(ss1);
\r
191 ss2 = filterTraversed(ss2);
\r
192 ss1 = filterNonTested(ss1);
\r
193 ss2 = filterNonTested(ss2);
\r
195 compareStatements(ss1, ss2, null, null);
\r
200 for (Resource rel : traversed) {
\r
201 ss1.addAll(g.getStatements(r1, rel));
\r
202 ss2.addAll(g.getStatements(r2, rel));
\r
203 ss1 = filterAsserted(r1, ss1);
\r
204 ss2 = filterAsserted(r2, ss2);
\r
205 compareStatements(ss1, ss2, stack1, stack2);
\r
214 public BijectionMap<Statement, Statement> getComparableStatements() {
\r
215 return comparableStatements;
\r
218 public GraphChanges getChanges() {
\r
219 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);
\r
222 private List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws ServiceException {
\r
223 List<Statement> out = new ArrayList<Statement>();
\r
224 for (Statement s : in) {
\r
225 if (!s.isAsserted(r))
\r
232 private String printStatement(ReadGraph graph, Statement s) throws ValidationException, ServiceException {
\r
233 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());
\r
236 private List<Statement> filterTraversed(List<Statement> in) throws ServiceException {
\r
237 return filter(traversed, in);
\r
240 private List<Statement> filterNonTested(List<Statement> in) throws ServiceException {
\r
241 return filter(nonTested, in);
\r
244 private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws ServiceException {
\r
245 if (toFilter.size() == 0)
\r
247 List<Statement> out = new ArrayList<Statement>();
\r
248 for (Statement s : in) {
\r
249 boolean usable = true;
\r
250 for (Resource r : toFilter) {
\r
251 if (g.isSubrelationOf(s.getPredicate(),r)) {
\r
265 private void addDeletion(Statement s) {
\r
266 if (!changes1Set.contains(s)) {
\r
267 changes1Set.add(s);
\r
272 private void addAddition(Statement s) {
\r
273 if (!changes2Set.contains(s)) {
\r
274 changes2Set.add(s);
\r
279 private void addModification(Statement s1, Statement s2) {
\r
280 Pair<Statement, Statement> mod = new Pair<Statement, Statement>(s1,s2);
\r
281 if (!modificationsSet.contains(mod)) {
\r
282 modificationsSet.add(mod);
\r
283 modifications.add(mod);
\r
287 public void sortStatement(List<Statement> list1, List<Statement> list2) {
\r
288 Collections.sort(list1,scomp);
\r
289 Collections.sort(list2,scomp);
\r
291 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());
\r
292 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());
\r
293 sorted1.addAll(list1);
\r
294 sorted2.addAll(list2);
\r
298 for (int i = 0; i < list1.size(); ) {
\r
299 Statement s1 = list1.get(i);
\r
300 int same1 = sameRel(list1, i);
\r
301 for (int j = 0; j < list2.size(); j++) {
\r
302 Statement s2 = list2.get(j);
\r
303 if (scomp.compare(s1, s2) == 0) {
\r
304 int same2 = sameRel(list2, j);
\r
305 copy(sorted1,ss1,list1,i,same1);
\r
307 copy(sorted2,ss2,list2,j,same2);
\r
314 if (ss1 < sorted1.size()) {
\r
315 for (Statement s : list1) {
\r
316 if (!sorted1.contains(s)) {
\r
317 sorted1.set(ss1,s);
\r
322 if (ss2 < sorted2.size()) {
\r
323 for (Statement s : list2) {
\r
324 if (!sorted2.contains(s)) {
\r
325 sorted2.set(ss2,s);
\r
333 list1.addAll(sorted1);
\r
334 list2.addAll(sorted2);
\r
337 public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {
\r
338 for (int i = 0; i < amount; i++) {
\r
339 to.set(toIndex + i, from.get(fromIndex+ i));
\r
343 public void sortResource(List<Resource> list1, List<Resource> list2) {
\r
344 Collections.sort(list1,rcomp);
\r
346 for (int i = 0; i < list1.size(); i++) {
\r
347 Resource s1 = list1.get(i);
\r
348 for (int j = js; j < list2.size(); j++) {
\r
349 Resource s2 = list2.get(j);
\r
350 if (rcomp.compare(s1, s2) == 0) {
\r
351 Resource t = list2.get(js);
\r
362 private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> stack1, Stack<Resource> stack2) throws DatabaseException {
\r
363 sortStatement(ss1, ss2);
\r
364 // Collections.sort(ss1, scomp);
\r
365 // Collections.sort(ss2, scomp);
\r
371 if (i1 >= ss1.size()) {
\r
372 if (i2 >= ss2.size()) {
\r
375 while (i2 < ss2.size()) {
\r
376 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i2)));
\r
378 addAddition(ss2.get(i2));
\r
383 } else if (i2 >= ss2.size()) {
\r
384 while (i1 < ss1.size()) {
\r
385 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i1)));
\r
386 addDeletion(ss1.get(i1));
\r
391 int same1 = sameRel(ss1, i1);
\r
392 int same2 = sameRel(ss2, i2);
\r
393 int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());
\r
395 compareStatements(ss1, i1, same1, ss2, i2, same2,stack1,stack2);
\r
398 } else if (c < 0) {
\r
399 for (int i = 0; i < same1; i++) {
\r
400 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i+i1)));
\r
401 addDeletion(ss1.get(i+i1));
\r
405 for (int i = 0; i < same2; i++) {
\r
406 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i+i2)));
\r
407 addAddition(ss2.get(i+i2));
\r
416 private int sameRel(List<Statement> statements, int off) {
\r
417 if (statements.size() <= off)
\r
420 long id = statements.get(off).getPredicate().getResourceId();
\r
421 for (int i = off+1; i <statements.size(); i++) {
\r
422 if (statements.get(i).getPredicate().getResourceId() == id)
\r
431 private int compareObject(Resource o1, Resource o2) throws DatabaseException {
\r
432 if (comparableResources.contains(o1, o2))
\r
434 return comparator.compare(g, o1, o2);
\r
437 private void compareStatements(List<Statement> ss1, int off1, int len1, List<Statement> ss2, int off2, int len2, Stack<Resource> stack1, Stack<Resource> stack2) throws DatabaseException {
\r
438 boolean[] used1 = new boolean[len1];
\r
439 for (int i = 0; i < used1.length; i++) {
\r
443 boolean[] used2 = new boolean[len2];
\r
444 for (int i = 0; i < used2.length; i++) {
\r
448 // left, right, difference
\r
449 List<List<Integer>> differences = new ArrayList<List<Integer>>();
\r
450 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
451 Statement s1 = ss1.get(i1);
\r
452 List<Integer> diff = new ArrayList<Integer>();
\r
453 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
454 Statement s2 = ss2.get(i2);
\r
455 diff.add(compareObject(s1.getObject(), s2.getObject()));
\r
457 differences.add(diff);
\r
459 // difference, left
\r
460 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();
\r
461 for (int i = 0; i < differences.size(); i++) {
\r
462 List<Integer> list = differences.get(i);
\r
463 for (int j = 0; j < list.size(); j++) {
\r
464 priorities.add(list.get(j), i);
\r
468 Integer[] pris = priorities.getKeys(new Integer[]{});
\r
471 for (Integer pri : pris) {
\r
472 if (pri == Integer.MAX_VALUE)
\r
474 List<Integer> i1s = priorities.getValues(pri);
\r
475 for (Integer i1 : i1s) {
\r
478 List<Integer> i2diff = differences.get(i1);
\r
479 for (int i2 = 0; i2 < i2diff.size(); i2++) {
\r
480 if (i2diff.get(i2) == pri) {
\r
485 Statement s1 = ss1.get(i1+off1);
\r
486 Statement s2 = ss2.get(i2+off2);
\r
488 if (stack1 != null) {
\r
490 stack1.add(s1.getObject());
\r
491 stack2.add(s2.getObject());
\r
494 // TODO : how should we report non traversed differences
\r
495 // using compareProps assumes that referenced objects are the same (references are not different)
\r
496 // using propsDiffCount assumes that objects are different, and cannot report changes in referred object.
\r
499 // int diff = propsDiffCount(ss1.get(i1+off1).getObject(), ss2.get(i2+off2).getObject());
\r
500 // if (diff != 0) {
\r
501 // //changes1.add(ss1.get(i1+off1));
\r
502 // //changes2.add(ss2.get(i2+off2));
\r
503 // modifies.add(new Pair<Statement, Statement>(ss1.get(i1+off1), ss2.get(i2+off2)));
\r
506 comparableStatements.map(s1, s2);
\r
507 //comparableResources.map(s1.getObject(), s2.getObject());
\r
513 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
514 if (!used1[i1-off1]) {
\r
515 System.out.println("Compare Object diff1 " + printStatement(g,ss1.get(i1)));
\r
516 addDeletion(ss1.get(i1));
\r
519 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
520 if (!used2[i2-off2]) {
\r
521 System.out.println("Compare Object diff2 " + printStatement(g,ss2.get(i2)));
\r
522 addAddition(ss2.get(i2));
\r
530 * compares properties, assumes functional relations
\r
533 * @throws ServiceException
\r
534 * @throws DoesNotContainValueException
\r
535 * @throws ValidationException
\r
537 private void compareProps(Resource r1, Resource r2) throws ServiceException, DoesNotContainValueException, ValidationException {
\r
538 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
539 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
540 ss1.addAll(g.getStatements(r1, b.HasProperty));
\r
541 ss2.addAll(g.getStatements(r2, b.HasProperty));
\r
542 sortStatement(ss1, ss2);
\r
543 // Collections.sort(ss1, scomp);
\r
544 // Collections.sort(ss2, scomp);
\r
550 if (i1 >= ss1.size()) {
\r
551 if (i2 >= ss2.size())
\r
554 while (i2 < ss2.size()) {
\r
555 System.out.println("Compare Prop diff2 " + printStatement(g,ss2.get(i2)));
\r
556 addAddition(ss2.get(i2));
\r
561 } else if (i2 >= ss2.size()) {
\r
562 while (i1 < ss1.size()) {
\r
563 System.out.println("Compare Prop diff1 " + printStatement(g,ss1.get(i1)));
\r
564 addDeletion(ss1.get(i1));
\r
569 Statement s1 = ss1.get(i1);
\r
570 Statement s2 = ss2.get(i2);
\r
571 int c = scomp.compare(s1, s2);
\r
574 boolean b1 = g.hasValue(s1.getObject());
\r
575 boolean b2 = g.hasValue(s2.getObject());
\r
578 Object v1 = g.getValue(s1.getObject());
\r
579 Object v2 = g.getValue(s2.getObject());
\r
580 boolean eq = compareValue(v1, v2);
\r
582 addModification(s1, s2);
\r
583 comparableStatements.map(s1, s2);
\r
584 comparableResources.map(s1.getObject(),s2.getObject());
\r
587 compareProps(s1.getObject(), s2.getObject());
\r
590 addModification(s1, s2);
\r
591 comparableStatements.map(s1, s2);
\r
592 comparableResources.map(s1.getObject(),s2.getObject());
\r
599 System.out.println("Compare Prop diff1s " + printStatement(g,s1));
\r
606 System.out.println("Compare Prop diff2s " + printStatement(g,s2));
\r
622 public static boolean compareValue(Object v1, Object v2) {
\r
623 if (v1 instanceof Object[] && v2 instanceof Object[])
\r
624 return Arrays.deepEquals((Object[])v1, (Object[])v2);
\r
625 else if (v1 instanceof int[] && v2 instanceof int[])
\r
626 return Arrays.equals((int[])v1, (int[])v2);
\r
627 else if (v1 instanceof float[] && v2 instanceof float[])
\r
628 return Arrays.equals((float[])v1, (float[])v2);
\r
629 else if (v1 instanceof double[] && v2 instanceof double[])
\r
630 return Arrays.equals((double[])v1, (double[])v2);
\r
631 else if (v1 instanceof long[] && v2 instanceof long[])
\r
632 return Arrays.equals((long[])v1, (long[])v2);
\r
633 else if (v1 instanceof byte[] && v2 instanceof byte[])
\r
634 return Arrays.equals((byte[])v1, (byte[])v2);
\r
635 else if (v1 instanceof boolean[] && v2 instanceof boolean[])
\r
636 return Arrays.equals((boolean[])v1, (boolean[])v2);
\r
638 return v1.equals(v2);
\r
643 public class PredicateComparator implements Comparator<Statement> {
\r
645 public int compare(Statement o1, Statement o2) {
\r
646 if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))
\r
648 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
650 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
656 public static class FullStatementComparator implements Comparator<Statement> {
\r
658 public int compare(Statement o1, Statement o2) {
\r
659 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
\r
661 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
\r
663 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
665 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
667 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
\r
669 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
\r
677 public class ResourceComparator implements Comparator<Resource> {
\r
679 public int compare(Resource o1, Resource o2) {
\r
680 if (comparableResources.contains(o1, o2))
\r
682 if (o1.getResourceId() < o2.getResourceId())
\r
684 if (o1.getResourceId() > o2.getResourceId())
\r