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.HashMap;
\r
20 import java.util.HashSet;
\r
21 import java.util.List;
\r
22 import java.util.Map;
\r
23 import java.util.Set;
\r
24 import java.util.Stack;
\r
26 import org.simantics.db.ReadGraph;
\r
27 import org.simantics.db.Resource;
\r
28 import org.simantics.db.Statement;
\r
29 import org.simantics.db.common.utils.NameUtils;
\r
30 import org.simantics.db.exception.DatabaseException;
\r
31 import org.simantics.db.exception.DoesNotContainValueException;
\r
32 import org.simantics.db.exception.ManyObjectsForFunctionalRelationException;
\r
33 import org.simantics.db.exception.ServiceException;
\r
34 import org.simantics.db.exception.ValidationException;
\r
35 import org.simantics.layer0.Layer0;
\r
36 import org.simantics.utils.datastructures.BijectionMap;
\r
37 import org.simantics.utils.datastructures.MapList;
\r
38 import org.simantics.utils.datastructures.Pair;
\r
41 * Compares two subgraphs and reports differences.
\r
43 * Assumes that subgraphs (defined using traverse relations) are not cyclic.
\r
45 * Assumes that properties can be used to identify objects, if relation type is not enough.
\r
49 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
\r
52 public class GraphComparator {
\r
54 private Resource r1;
\r
55 private Resource r2;
\r
56 private Set<Resource> strong = new HashSet<Resource>(); // List of relations that identify object, if subject is already identified.
\r
57 private List<Resource> traversed = new ArrayList<Resource>(); // list of relations that are traversed (and tested)
\r
58 private List<Resource> tested = new ArrayList<Resource>(); // list of relations that are tested, but not traversed
\r
59 private List<Resource> nonTraversed = new ArrayList<Resource>(); // list of relations that are not traversed
\r
60 private List<Resource> nonTested = new ArrayList<Resource>(); // list of relations that are not tested
\r
62 private List<Statement> changes1 = new ArrayList<Statement>();
\r
63 private List<Statement> changes2 = new ArrayList<Statement>();
\r
64 private List<Pair<Statement,Statement>> modifications = new ArrayList<Pair<Statement,Statement>>();
\r
65 private Set<Statement> changes1Set = new HashSet<Statement>();
\r
66 private Set<Statement> changes2Set = new HashSet<Statement>();
\r
67 private Set<Pair<Statement,Statement>> modificationsSet = new HashSet<Pair<Statement,Statement>>();
\r
69 private BijectionMap<Statement, Statement> comparableStatements = new BijectionMap<Statement, Statement>();
\r
70 private BijectionMap<Resource, Resource> comparableResources = new BijectionMap<Resource, Resource>();
\r
73 private ResourceComparator comparator;
\r
75 private Comparator<Statement> scomp = new PredicateComparator();
\r
76 private Comparator<Resource> rcomp = new ResComparator();
\r
78 // runtime attributes
\r
80 private ReadGraph g;
\r
83 public GraphComparator(Resource r1, Resource r2) {
\r
86 comparator = new TypeComparator();
\r
89 public GraphComparator(Resource r1, Resource r2, ResourceComparator comparator) {
\r
92 this.comparator = comparator;
\r
95 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
96 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
99 public Comparator<Resource> getResourceComparator() {
\r
103 public Comparator<Statement> getStatementComparator() {
\r
107 public Resource getR1() {
\r
111 public Resource getR2() {
\r
115 public void addTraversed(Resource rel) {
\r
116 traversed.add(rel);
\r
119 public void addTraversed(Collection<Resource> rels) {
\r
120 traversed.addAll(rels);
\r
123 public void addNonTraversed(Resource rel) {
\r
124 nonTraversed.add(rel);
\r
127 public void addNonTraversed(Collection<Resource> rels) {
\r
128 nonTraversed.addAll(rels);
\r
131 public void addTested(Resource rel) {
\r
135 public void addTested(Collection<Resource> rels) {
\r
136 tested.addAll(rels);
\r
139 public void addNonTested(Resource rel) {
\r
140 nonTested.add(rel);
\r
143 public void addNonTested(Collection<Resource> rels) {
\r
144 nonTested.addAll(rels);
\r
147 public void addComparableResources(Resource r1, Resource r2) {
\r
148 comparableResources.map(r1, r2);
\r
151 public void addComparableResources(BijectionMap<Resource, Resource> matching) {
\r
152 comparableResources.addAll(matching);
\r
155 public void addStrong(Resource r) {
\r
159 public void clearRels() {
\r
162 nonTraversed.clear();
\r
166 public void test(ReadGraph g) throws DatabaseException {
\r
168 this.b = Layer0.getInstance(g);
\r
169 comparator.setComparator(this);
\r
171 Stack<Resource> objectsLeft = new Stack<Resource>();
\r
172 Stack<Resource> objectsRight = new Stack<Resource>();
\r
173 objectsLeft.push(r1);
\r
174 objectsRight.push(r2);
\r
179 Set<Statement> unreliableLeft = new HashSet<Statement>();
\r
180 Set<Statement> unreliableRight = new HashSet<Statement>();
\r
183 if (objectsLeft.isEmpty())
\r
186 // process compares objects that are identified and searches for more resources to process.
\r
187 process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);
\r
188 // process unreliable handles cases where unidentified resources have path of length one to identified resource
\r
189 processUnreliable(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
\r
190 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
\r
191 // comparison is ending, but we have still unprocessed unidentified resources left.
\r
192 // These cases have longer path than one to identified objects.
\r
193 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
\r
197 for (Statement s : unreliableLeft) {
\r
198 if (!comparableStatements.containsLeft(s))
\r
201 for (Statement s : unreliableRight) {
\r
202 if (!comparableStatements.containsRight(s))
\r
209 private void process(Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {
\r
210 List<Statement> ss1 = new ArrayList<Statement>();
\r
211 List<Statement> ss2 = new ArrayList<Statement>();
\r
213 while (!objectsLeft.isEmpty()) {
\r
214 Resource r1 = objectsLeft.pop();
\r
215 Resource r2 = objectsRight.pop();
\r
217 if (comparableResources.contains(r1, r2)) {
\r
218 //System.out.println("already tested " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
\r
221 comparableResources.map(r1, r2);
\r
223 //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
\r
224 compareProps(r1, r2);
\r
226 for (Resource rel : tested) {
\r
227 ss1.addAll(g.getStatements(r1, rel));
\r
228 ss2.addAll(g.getStatements(r2, rel));
\r
229 ss1 = filterAsserted(r1, ss1);
\r
230 ss2 = filterAsserted(r2, ss2);
\r
231 ss1 = filterTraversed(ss1);
\r
232 ss2 = filterTraversed(ss2);
\r
233 ss1 = filterNonTested(ss1);
\r
234 ss2 = filterNonTested(ss2);
\r
236 compareStatements(ss1, ss2, null, null,null,null);
\r
241 for (Resource rel : traversed) {
\r
242 ss1.addAll(g.getStatements(r1, rel));
\r
243 ss2.addAll(g.getStatements(r2, rel));
\r
244 ss1 = filterAsserted(r1, ss1);
\r
245 ss2 = filterAsserted(r2, ss2);
\r
246 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
\r
253 private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) {
\r
254 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
\r
255 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
\r
256 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
\r
257 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
\r
259 for (Statement s : unreliableLeft) {
\r
260 subjectLeft.add(s.getSubject(),s);
\r
261 objectLeft.add(s.getObject(),s);
\r
263 for (Statement s : unreliableRight) {
\r
264 subjectRight.add(s.getSubject(),s);
\r
265 objectRight.add(s.getObject(),s);
\r
268 for (Resource ol : objectLeft.getKeys()) {
\r
270 // all statements to the left side object
\r
271 List<Statement> left = objectLeft.getValues(ol);
\r
272 // all subjects that have statements to the left side object (ol)
\r
273 Set<Resource> sLeft = new HashSet<Resource>();
\r
274 // all matching subjects on the right side
\r
275 Set<Resource> sRight = new HashSet<Resource>();
\r
276 for (Statement s : left) {
\r
277 sLeft.add(s.getSubject());
\r
278 sRight.add(comparableResources.getRight(s.getSubject()));
\r
280 // all objects that subjects on the right side point to. Object left has its matching resource among these, if it has matching resource
\r
281 MapList<Resource,Statement> possibleOR = new MapList<Resource, Statement>();
\r
282 for (Resource sr : sRight) {
\r
283 for (Statement s : subjectRight.getValues(sr))
\r
284 possibleOR.add(s.getObject(),s);
\r
287 // filter possible right side objects to those that have same amount of statements as the left side object
\r
288 for (Resource or : possibleOR.getKeys().toArray(new Resource[possibleOR.getKeys().size()])) {
\r
289 List<Statement> right = possibleOR.getValues(or);
\r
290 if (right.size() != left.size())
\r
291 possibleOR.remove(or);
\r
295 // check for matching statements (comparable subjects, matching predicates)
\r
296 MapList<Resource,Statement> matchingOR = new MapList<Resource, Statement>(); // list of objects that have matching statements
\r
297 Map<Resource,Pair<int[], int[]>> matchingStatements = new HashMap<Resource, Pair<int[], int[]>>(); // matching statements
\r
298 for (Resource or : possibleOR.getKeys()) {
\r
299 List<Statement> right = possibleOR.getValues(or);
\r
300 int iLeft[] = new int[left.size()];
\r
301 int iRight[] = new int[right.size()];
\r
303 for (int i = 0; i < left.size(); i++) {
\r
308 for (int l = 0; l < left.size(); l++) {
\r
309 Statement ls = left.get(l);
\r
310 for (int r = 0; r < right.size(); r++) {
\r
311 if (iRight[r] >= 0)
\r
313 Statement rs = right.get(r);
\r
314 if (!comparableResources.contains(ls.getSubject(), rs.getSubject()))
\r
316 if (rcomp.compare(ls.getPredicate(),rs.getPredicate()) == 0) {
\r
324 boolean success = true;
\r
325 for (int i = 0; i < left.size(); i++) {
\r
326 if (iLeft[i] < 0) {
\r
330 if (iRight[i] < 0) {
\r
337 for (Statement s : right)
\r
338 matchingOR.add(or,s);
\r
339 matchingStatements.put(or, new Pair<int[], int[]>(iLeft, iRight));
\r
342 // if there is only one matching right side object, we have found a match
\r
343 if (matchingOR.getKeySize() == 1) {
\r
344 Resource or = matchingOR.getKeys().iterator().next();
\r
345 List<Statement> right = matchingOR.getValues(or);
\r
346 Pair<int[], int[]> indices = matchingStatements.get(or);
\r
348 //comparableResources.map(ol, or);
\r
349 objectsLeft.add(ol);
\r
350 objectsRight.add(or);
\r
351 for (int l = 0; l < left.size(); l++) {
\r
352 int r = indices.first[l];
\r
353 comparableStatements.map(left.get(l), right.get(r));
\r
354 unreliableLeft.remove(left.get(l));
\r
355 unreliableRight.remove(right.get(r));
\r
365 private void processUnreliableDeep(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
366 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
\r
367 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
\r
368 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
\r
369 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
\r
371 for (Statement s : unreliableLeft) {
\r
372 subjectLeft.add(s.getSubject(),s);
\r
373 objectLeft.add(s.getObject(),s);
\r
375 for (Statement s : unreliableRight) {
\r
376 subjectRight.add(s.getSubject(),s);
\r
377 objectRight.add(s.getObject(),s);
\r
379 for (Resource ol : objectLeft.getKeys()) {
\r
380 Set<Path> pathsLeft = new HashSet<Path>();
\r
381 for (Resource rel : traversed) {
\r
382 pathsLeft.addAll(Path.create(g.getStatements(ol, rel)));
\r
386 if (pathsLeft.size() == 0)
\r
388 Collection<Path> endPaths = new ArrayList<Path>(1);
\r
389 for (Path p : pathsLeft) {
\r
390 if (comparableResources.containsLeft(p.getEnd())) {
\r
394 if (endPaths.size() > 0) {
\r
396 pathsLeft.addAll(endPaths);
\r
400 if (pathsLeft.size() > 0) {
\r
401 Resource sl = objectLeft.getValues(ol).get(0).getSubject();
\r
402 Resource sr = comparableResources.getRight(sl);
\r
403 Collection<Resource> possibleOR = new ArrayList<Resource>();
\r
404 for (Statement s : subjectRight.getValues(sr)) {
\r
405 possibleOR.add(s.getObject());
\r
407 Map<Resource,Set<Path>> matchingPaths = new HashMap<Resource, Set<Path>>();
\r
408 for (Resource or : possibleOR) {
\r
409 Set<Path> possiblePathsRight = new HashSet<Path>();
\r
410 for (Path leftPath : pathsLeft) {
\r
411 possiblePathsRight.addAll(findComparableRight(leftPath, or));
\r
413 if (possiblePathsRight.size() == pathsLeft.size()) {
\r
414 matchingPaths.put(or, possiblePathsRight);
\r
417 if (matchingPaths.size() > 0) {
\r
418 if (matchingPaths.size() == 1) {
\r
419 Resource or = matchingPaths.keySet().iterator().next();
\r
420 objectsLeft.add(ol);
\r
421 objectsRight.add(or);
\r
422 Collection<Statement> statementsLeft = objectLeft.getValues(ol);
\r
423 Collection<Statement> statementsRight = objectRight.getValues(or);
\r
424 unreliableLeft.removeAll(statementsLeft);
\r
425 unreliableRight.removeAll(statementsRight);
\r
426 System.out.println();
\r
428 System.out.println();
\r
437 private void expand(Set<Path> paths) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
438 Set<Path> stepPathsLeft = new HashSet<Path>();
\r
439 if (paths.size() == 0)
\r
441 int length = paths.iterator().next().getLength() + 1;
\r
442 for (Path p : paths) {
\r
443 for (Resource rel : traversed) {
\r
444 stepPathsLeft.addAll(Path.expand(p,g.getStatements(p.getEnd(), rel)));
\r
448 for (Path p : stepPathsLeft) {
\r
449 if (p.getLength() == length)
\r
454 private Collection<Path> findComparableRight(Path leftPath, Resource beginRight) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
455 Set<Path> rightPaths = new HashSet<Path>();
\r
456 rightPaths.addAll(Path.create(g.getStatements(beginRight, getRight(leftPath.getStatements().get(0).getPredicate()))));
\r
457 for (int i = 1; i < leftPath.getLength(); i++) {
\r
458 if (rightPaths.size() == 0)
\r
460 Set<Path> stepPaths = new HashSet<Path>();
\r
461 for (Path p : rightPaths) {
\r
462 stepPaths.addAll(Path.expand(p, g.getStatements(p.getEnd(), getRight(leftPath.getStatements().get(i).getPredicate()))));
\r
464 rightPaths.clear();
\r
465 for (Path p : stepPaths)
\r
466 if (p.getLength() == i+1)
\r
473 private Resource getRight(Resource r) {
\r
474 if (comparableResources.containsLeft(r))
\r
475 return comparableResources.getRight(r);
\r
481 public BijectionMap<Statement, Statement> getComparableStatements() {
\r
482 return comparableStatements;
\r
485 public GraphChanges getChanges() {
\r
486 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);
\r
489 private List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws ServiceException {
\r
490 List<Statement> out = new ArrayList<Statement>();
\r
491 for (Statement s : in) {
\r
492 if (!s.isAsserted(r))
\r
499 private String printStatement(ReadGraph graph, Statement s) throws ValidationException, ServiceException {
\r
500 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());
\r
503 private List<Statement> filterTraversed(List<Statement> in) throws ServiceException {
\r
504 return filter(traversed, in);
\r
507 private List<Statement> filterNonTested(List<Statement> in) throws ServiceException {
\r
508 return filter(nonTested, in);
\r
511 private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws ServiceException {
\r
512 if (toFilter.size() == 0)
\r
514 List<Statement> out = new ArrayList<Statement>();
\r
515 for (Statement s : in) {
\r
516 boolean usable = true;
\r
517 for (Resource r : toFilter) {
\r
518 if (g.isSubrelationOf(s.getPredicate(),r)) {
\r
532 private void addDeletion(Statement s) {
\r
533 if (!changes1Set.contains(s)) {
\r
534 changes1Set.add(s);
\r
539 private void addAddition(Statement s) {
\r
540 if (!changes2Set.contains(s)) {
\r
541 changes2Set.add(s);
\r
546 private void addModification(Statement s1, Statement s2) {
\r
547 Pair<Statement, Statement> mod = new Pair<Statement, Statement>(s1,s2);
\r
548 if (!modificationsSet.contains(mod)) {
\r
549 modificationsSet.add(mod);
\r
550 modifications.add(mod);
\r
554 public void sortStatement(List<Statement> list1, List<Statement> list2) {
\r
555 sortStatement(list1, list2, scomp);
\r
558 public void sortStatement(List<Statement> list1, List<Statement> list2, Comparator<Statement> scomp) {
\r
559 Collections.sort(list1,scomp);
\r
560 Collections.sort(list2,scomp);
\r
562 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());
\r
563 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());
\r
564 sorted1.addAll(list1);
\r
565 sorted2.addAll(list2);
\r
569 for (int i = 0; i < list1.size(); ) {
\r
570 Statement s1 = list1.get(i);
\r
571 int same1 = sameRel(list1, i);
\r
572 for (int j = 0; j < list2.size(); j++) {
\r
573 Statement s2 = list2.get(j);
\r
574 if (scomp.compare(s1, s2) == 0) {
\r
575 int same2 = sameRel(list2, j);
\r
576 copy(sorted1,ss1,list1,i,same1);
\r
578 copy(sorted2,ss2,list2,j,same2);
\r
585 if (ss1 < sorted1.size()) {
\r
586 for (Statement s : list1) {
\r
587 if (!sorted1.contains(s)) {
\r
588 sorted1.set(ss1,s);
\r
593 if (ss2 < sorted2.size()) {
\r
594 for (Statement s : list2) {
\r
595 if (!sorted2.contains(s)) {
\r
596 sorted2.set(ss2,s);
\r
604 list1.addAll(sorted1);
\r
605 list2.addAll(sorted2);
\r
608 public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {
\r
609 for (int i = 0; i < amount; i++) {
\r
610 to.set(toIndex + i, from.get(fromIndex+ i));
\r
614 public void sortResource(List<Resource> list1, List<Resource> list2) {
\r
615 Collections.sort(list1,rcomp);
\r
617 for (int i = 0; i < list1.size(); i++) {
\r
618 Resource s1 = list1.get(i);
\r
619 for (int j = js; j < list2.size(); j++) {
\r
620 Resource s2 = list2.get(j);
\r
621 if (rcomp.compare(s1, s2) == 0) {
\r
622 Resource t = list2.get(js);
\r
632 private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {
\r
633 sortStatement(ss1, ss2);
\r
639 if (i1 >= ss1.size()) {
\r
640 if (i2 >= ss2.size()) {
\r
643 while (i2 < ss2.size()) {
\r
644 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i2)));
\r
646 addAddition(ss2.get(i2));
\r
651 } else if (i2 >= ss2.size()) {
\r
652 while (i1 < ss1.size()) {
\r
653 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i1)));
\r
654 addDeletion(ss1.get(i1));
\r
659 int same1 = sameRel(ss1, i1);
\r
660 int same2 = sameRel(ss2, i2);
\r
661 int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());
\r
663 compareStatements(ss1, i1, same1, ss2, i2, same2,objectsLeft,objectsRight,unreliableLeft,unreliableRight);
\r
666 } else if (c < 0) {
\r
667 for (int i = 0; i < same1; i++) {
\r
668 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i+i1)));
\r
669 addDeletion(ss1.get(i+i1));
\r
673 for (int i = 0; i < same2; i++) {
\r
674 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i+i2)));
\r
675 addAddition(ss2.get(i+i2));
\r
685 private int sameRel(List<Statement> statements, int off) {
\r
686 if (statements.size() <= off)
\r
689 long id = statements.get(off).getPredicate().getResourceId();
\r
690 for (int i = off+1; i <statements.size(); i++) {
\r
691 if (statements.get(i).getPredicate().getResourceId() == id)
\r
700 private int compareObject(Resource o1, Resource o2) throws DatabaseException {
\r
701 if (comparableResources.contains(o1, o2))
\r
703 if (comparableResources.containsLeft(o1))
\r
704 return Integer.MAX_VALUE;
\r
705 if (comparableResources.containsRight(o2))
\r
706 return Integer.MAX_VALUE;
\r
707 return comparator.compare(g, o1, o2);
\r
710 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 {
\r
711 boolean[] used1 = new boolean[len1];
\r
712 for (int i = 0; i < used1.length; i++) {
\r
716 boolean[] used2 = new boolean[len2];
\r
717 for (int i = 0; i < used2.length; i++) {
\r
721 // left, right, difference
\r
722 List<List<Integer>> differences = new ArrayList<List<Integer>>();
\r
723 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
724 Statement s1 = ss1.get(i1);
\r
725 List<Integer> diff = new ArrayList<Integer>();
\r
726 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
727 Statement s2 = ss2.get(i2);
\r
728 int d = compareObject(s1.getObject(), s2.getObject());
\r
730 for (Resource t : strong) {
\r
731 if (s1.getPredicate().equals(t) || g.isSubrelationOf(s1.getPredicate(), t)) {
\r
739 differences.add(diff);
\r
741 // difference, left
\r
742 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();
\r
743 for (int i = 0; i < differences.size(); i++) {
\r
744 List<Integer> list = differences.get(i);
\r
745 for (int j = 0; j < list.size(); j++) {
\r
746 priorities.add(list.get(j), i);
\r
750 Integer[] pris = priorities.getKeys(new Integer[]{});
\r
753 for (Integer pri : pris) {
\r
754 if (pri == Integer.MAX_VALUE) {
\r
756 } else if (pri == 0) {
\r
759 List<Integer> i1s = priorities.getValues(pri);
\r
760 for (Integer i1 : i1s) {
\r
763 List<Integer> i2diff = differences.get(i1);
\r
764 for (int i2 = 0; i2 < i2diff.size(); i2++) {
\r
765 if (i2diff.get(i2) == pri) {
\r
770 Statement s1 = ss1.get(i1+off1);
\r
771 Statement s2 = ss2.get(i2+off2);
\r
773 if (objectsLeft != null) {
\r
774 objectsLeft.add(s1.getObject());
\r
775 objectsRight.add(s2.getObject());
\r
777 comparableStatements.map(s1, s2);
\r
778 //comparableResources.map(s1.getObject(), s2.getObject());
\r
786 for (Integer pri : pris) {
\r
789 Set<Statement> s1s = new HashSet<Statement>();
\r
790 Set<Statement> s2s = new HashSet<Statement>();
\r
791 Set<Integer> s1i = new HashSet<Integer>();
\r
792 Set<Integer> s2i = new HashSet<Integer>();
\r
793 List<Integer> i1s = priorities.getValues(pri);
\r
794 for (Integer i1 : i1s) {
\r
797 List<Integer> i2diff = differences.get(i1);
\r
798 for (int i2 = 0; i2 < i2diff.size(); i2++) {
\r
799 if (i2diff.get(i2) == pri) {
\r
802 Statement s1 = ss1.get(i1+off1);
\r
803 Statement s2 = ss2.get(i2+off2);
\r
811 if (unreliableLeft != null) {
\r
812 unreliableLeft.addAll(s1s);
\r
813 unreliableRight.addAll(s2s);
\r
815 for (Integer i : s1i)
\r
817 for (Integer i : s2i)
\r
821 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
822 if (!used1[i1-off1]) {
\r
823 System.out.println("Compare Object diff1 " + printStatement(g,ss1.get(i1)));
\r
824 addDeletion(ss1.get(i1));
\r
827 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
828 if (!used2[i2-off2]) {
\r
829 System.out.println("Compare Object diff2 " + printStatement(g,ss2.get(i2)));
\r
830 addAddition(ss2.get(i2));
\r
838 * compares properties, assumes functional relations
\r
841 * @throws ServiceException
\r
842 * @throws DoesNotContainValueException
\r
843 * @throws ValidationException
\r
845 private void compareProps(Resource r1, Resource r2) throws ServiceException, DoesNotContainValueException, ValidationException {
\r
846 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
847 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
848 ss1.addAll(g.getStatements(r1, b.HasProperty));
\r
849 ss2.addAll(g.getStatements(r2, b.HasProperty));
\r
850 sortStatement(ss1, ss2);
\r
856 if (i1 >= ss1.size()) {
\r
857 if (i2 >= ss2.size())
\r
860 while (i2 < ss2.size()) {
\r
861 System.out.println("Compare Prop diff2 " + printStatement(g,ss2.get(i2)));
\r
862 addAddition(ss2.get(i2));
\r
867 } else if (i2 >= ss2.size()) {
\r
868 while (i1 < ss1.size()) {
\r
869 System.out.println("Compare Prop diff1 " + printStatement(g,ss1.get(i1)));
\r
870 addDeletion(ss1.get(i1));
\r
875 Statement s1 = ss1.get(i1);
\r
876 Statement s2 = ss2.get(i2);
\r
877 int c = scomp.compare(s1, s2);
\r
880 boolean b1 = g.hasValue(s1.getObject());
\r
881 boolean b2 = g.hasValue(s2.getObject());
\r
884 Object v1 = g.getValue(s1.getObject());
\r
885 Object v2 = g.getValue(s2.getObject());
\r
886 boolean eq = compareValue(v1, v2);
\r
888 addModification(s1, s2);
\r
889 comparableStatements.map(s1, s2);
\r
890 comparableResources.map(s1.getObject(),s2.getObject());
\r
893 compareProps(s1.getObject(), s2.getObject());
\r
896 addModification(s1, s2);
\r
897 comparableStatements.map(s1, s2);
\r
898 comparableResources.map(s1.getObject(),s2.getObject());
\r
905 System.out.println("Compare Prop diff1s " + printStatement(g,s1));
\r
912 System.out.println("Compare Prop diff2s " + printStatement(g,s2));
\r
926 public static boolean compareValue(Object v1, Object v2) {
\r
927 if (v1 instanceof Object[] && v2 instanceof Object[])
\r
928 return Arrays.deepEquals((Object[])v1, (Object[])v2);
\r
929 else if (v1 instanceof int[] && v2 instanceof int[])
\r
930 return Arrays.equals((int[])v1, (int[])v2);
\r
931 else if (v1 instanceof float[] && v2 instanceof float[])
\r
932 return Arrays.equals((float[])v1, (float[])v2);
\r
933 else if (v1 instanceof double[] && v2 instanceof double[])
\r
934 return Arrays.equals((double[])v1, (double[])v2);
\r
935 else if (v1 instanceof long[] && v2 instanceof long[])
\r
936 return Arrays.equals((long[])v1, (long[])v2);
\r
937 else if (v1 instanceof byte[] && v2 instanceof byte[])
\r
938 return Arrays.equals((byte[])v1, (byte[])v2);
\r
939 else if (v1 instanceof boolean[] && v2 instanceof boolean[])
\r
940 return Arrays.equals((boolean[])v1, (boolean[])v2);
\r
942 return v1.equals(v2);
\r
946 public class PredicateComparator implements Comparator<Statement> {
\r
948 public int compare(Statement o1, Statement o2) {
\r
949 if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))
\r
951 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
953 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
959 public class SubjectComparator implements Comparator<Statement> {
\r
961 public int compare(Statement o1, Statement o2) {
\r
962 if (comparableResources.contains(o1.getSubject(), o2.getSubject()))
\r
964 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
\r
966 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
\r
972 public class ObjectComparator implements Comparator<Statement> {
\r
974 public int compare(Statement o1, Statement o2) {
\r
975 if (comparableResources.contains(o1.getObject(), o2.getObject()))
\r
977 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
\r
979 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
\r
985 public static class FullStatementComparator implements Comparator<Statement> {
\r
987 public int compare(Statement o1, Statement o2) {
\r
988 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
\r
990 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
\r
992 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
994 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
996 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
\r
998 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
\r
1004 public class ResComparator implements Comparator<Resource> {
\r
1006 public int compare(Resource o1, Resource o2) {
\r
1007 if (comparableResources.contains(o1, o2))
\r
1009 if (o1.getResourceId() < o2.getResourceId())
\r
1011 if (o1.getResourceId() > o2.getResourceId())
\r