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.Session;
\r
29 import org.simantics.db.Statement;
\r
30 import org.simantics.db.common.request.ReadRequest;
\r
31 import org.simantics.db.common.utils.NameUtils;
\r
32 import org.simantics.db.exception.DatabaseException;
\r
33 import org.simantics.db.exception.DoesNotContainValueException;
\r
34 import org.simantics.db.exception.ManyObjectsForFunctionalRelationException;
\r
35 import org.simantics.db.exception.ServiceException;
\r
36 import org.simantics.db.exception.ValidationException;
\r
37 import org.simantics.layer0.Layer0;
\r
38 import org.simantics.utils.datastructures.BijectionMap;
\r
39 import org.simantics.utils.datastructures.MapList;
\r
40 import org.simantics.utils.datastructures.Pair;
\r
43 * Compares two subgraphs and reports differences.
\r
45 * Assumes that subgraphs (defined using traverse relations) are not cyclic.
\r
47 * Assumes that properties can be used to identify objects, if relation type is not enough.
\r
51 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
\r
54 public class GraphComparator {
\r
56 private Resource r1;
\r
57 private Resource r2;
\r
58 private Set<Resource> strong = new HashSet<Resource>(); // List of relations that identify object, if subject is already identified.
\r
59 private List<Resource> traversed = new ArrayList<Resource>(); // list of relations that are traversed (and tested)
\r
60 private List<Resource> tested = new ArrayList<Resource>(); // list of relations that are tested, but not traversed
\r
61 private List<Resource> nonTraversed = new ArrayList<Resource>(); // list of relations that are not traversed
\r
62 private List<Resource> nonTested = new ArrayList<Resource>(); // list of relations that are not tested
\r
64 private List<Statement> changes1 = new ArrayList<Statement>();
\r
65 private List<Statement> changes2 = new ArrayList<Statement>();
\r
66 private List<Pair<Statement,Statement>> modifications = new ArrayList<Pair<Statement,Statement>>();
\r
67 private Set<Statement> changes1Set = new HashSet<Statement>();
\r
68 private Set<Statement> changes2Set = new HashSet<Statement>();
\r
69 private Set<Pair<Statement,Statement>> modificationsSet = new HashSet<Pair<Statement,Statement>>();
\r
71 private BijectionMap<Statement, Statement> comparableStatements = new BijectionMap<Statement, Statement>();
\r
72 private BijectionMap<Resource, Resource> comparableResources = new BijectionMap<Resource, Resource>();
\r
73 private Set<Resource> processedResources = new HashSet<Resource>();
\r
75 private ResourceComparator comparator;
\r
77 private Comparator<Statement> scomp = new PredicateComparator();
\r
78 private Comparator<Resource> rcomp = new ResComparator();
\r
80 // runtime attributes
\r
82 private ReadGraph g;
\r
85 public GraphComparator(Resource r1, Resource r2) {
\r
88 comparator = new TypeComparator();
\r
91 public GraphComparator(Resource r1, Resource r2, ResourceComparator comparator) {
\r
94 this.comparator = comparator;
\r
97 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
98 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
101 public Comparator<Resource> getResourceComparator() {
\r
105 public Comparator<Statement> getStatementComparator() {
\r
109 public Resource getR1() {
\r
113 public Resource getR2() {
\r
117 public void addTraversed(Resource rel) {
\r
118 traversed.add(rel);
\r
121 public void addTraversed(Collection<Resource> rels) {
\r
122 traversed.addAll(rels);
\r
125 public void addNonTraversed(Resource rel) {
\r
126 nonTraversed.add(rel);
\r
129 public void addNonTraversed(Collection<Resource> rels) {
\r
130 nonTraversed.addAll(rels);
\r
133 public void addTested(Resource rel) {
\r
137 public void addTested(Collection<Resource> rels) {
\r
138 tested.addAll(rels);
\r
141 public void addNonTested(Resource rel) {
\r
142 nonTested.add(rel);
\r
145 public void addNonTested(Collection<Resource> rels) {
\r
146 nonTested.addAll(rels);
\r
149 public void addComparableResources(Resource r1, Resource r2) {
\r
150 comparableResources.map(r1, r2);
\r
153 public void addComparableResources(BijectionMap<Resource, Resource> matching) {
\r
154 comparableResources.addAll(matching);
\r
157 public void addStrong(Resource r) {
\r
161 public void addStrong(Collection<Resource> rels) {
\r
162 strong.addAll(rels);
\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
176 Set<Statement> unreliableLeft = new HashSet<Statement>();
\r
177 Set<Statement> unreliableRight = new HashSet<Statement>();
\r
180 if (objectsLeft.isEmpty())
\r
184 // process compares objects that are identified and searches for more resources to process.
\r
185 process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);
\r
186 // process unreliable handles cases where unidentified statements subject and object have been identified
\r
187 processUnreliable(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 public void test(Session session) throws DatabaseException {
\r
211 comparator.setComparator(this);
\r
213 comparableResources.map(r1, r2);
\r
215 final Stack<Resource> objectsLeft = new Stack<Resource>();
\r
216 final Stack<Resource> objectsRight = new Stack<Resource>();
\r
217 objectsLeft.push(r1);
\r
218 objectsRight.push(r2);
\r
220 final Set<Statement> unreliableLeft = new HashSet<Statement>();
\r
221 final Set<Statement> unreliableRight = new HashSet<Statement>();
\r
224 if (objectsLeft.isEmpty())
\r
226 session.syncRequest(new ReadRequest() {
\r
229 public void run(ReadGraph graph) throws DatabaseException {
\r
231 b = Layer0.getInstance(graph);
\r
232 // process compares objects that are identified and searches for more resources to process.
\r
233 process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);
\r
234 // process unreliable handles cases where unidentified statements subject and object have been identified
\r
235 processUnreliable(unreliableLeft, unreliableRight);
\r
236 // process unreliable handles cases where unidentified resources have path of length one to identified resource
\r
237 processUnreliable(unreliableLeft, unreliableRight,objectsLeft,objectsRight);
\r
238 if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {
\r
239 // comparison is ending, but we have still unprocessed unidentified resources left.
\r
240 // These cases have longer path than one to identified objects.
\r
241 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);
\r
249 for (Statement s : unreliableLeft) {
\r
250 if (!comparableStatements.containsLeft(s))
\r
253 for (Statement s : unreliableRight) {
\r
254 if (!comparableStatements.containsRight(s))
\r
261 private void process(Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {
\r
262 List<Statement> ss1 = new ArrayList<Statement>();
\r
263 List<Statement> ss2 = new ArrayList<Statement>();
\r
265 while (!objectsLeft.isEmpty()) {
\r
266 Resource r1 = objectsLeft.pop();
\r
267 Resource r2 = objectsRight.pop();
\r
272 if (processedResources.contains(r1))
\r
274 processedResources.add(r1);
\r
277 if(!comparableResources.contains(r1, r2) && (comparableResources.containsLeft(r1)||comparableResources.containsRight(r2))) {
\r
278 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.");
\r
281 //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
\r
282 compareProps(r1, r2);
\r
284 for (Resource rel : tested) {
\r
285 ss1.addAll(g.getStatements(r1, rel));
\r
286 ss2.addAll(g.getStatements(r2, rel));
\r
287 ss1 = filterAsserted(r1, ss1);
\r
288 ss2 = filterAsserted(r2, ss2);
\r
289 ss1 = filterTraversed(ss1);
\r
290 ss2 = filterTraversed(ss2);
\r
291 ss1 = filterNonTested(ss1);
\r
292 ss2 = filterNonTested(ss2);
\r
294 compareStatements(ss1, ss2, null, null,null,null);
\r
299 for (Resource rel : traversed) {
\r
300 ss1.addAll(g.getStatements(r1, rel));
\r
301 ss2.addAll(g.getStatements(r2, rel));
\r
302 ss1 = filterAsserted(r1, ss1);
\r
303 ss2 = filterAsserted(r2, ss2);
\r
304 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
\r
312 private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight) {
\r
313 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
\r
314 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
\r
315 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
\r
316 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
\r
318 for (Statement s : unreliableLeft) {
\r
319 subjectLeft.add(s.getSubject(),s);
\r
320 objectLeft.add(s.getObject(),s);
\r
322 for (Statement s : unreliableRight) {
\r
323 subjectRight.add(s.getSubject(),s);
\r
324 objectRight.add(s.getObject(),s);
\r
327 for (Resource left : subjectLeft.getKeys()) {
\r
328 if (!comparableResources.containsLeft(left))
\r
330 Resource right = comparableResources.getRight(left);
\r
331 for (Statement leftS : subjectLeft.getValues(left)) {
\r
332 Resource leftO = leftS.getObject();
\r
333 if (!comparableResources.containsLeft(leftO))
\r
335 if (!unreliableLeft.contains(leftS))
\r
337 Resource rightO = comparableResources.getRight(leftO);
\r
338 for (Statement rightS : subjectRight.getValues(right)) {
\r
339 if (!rightS.getObject().equals(rightO))
\r
341 if (!unreliableRight.contains(rightS))
\r
343 if (leftS.getPredicate().equals(rightS.getPredicate()) ||
\r
344 comparableResources.contains(leftS.getPredicate(), rightS.getPredicate())) {
\r
345 unreliableLeft.remove(leftS);
\r
346 unreliableRight.remove(rightS);
\r
347 addComparable(leftS, rightS, false);
\r
355 private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) {
\r
356 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
\r
357 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
\r
358 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
\r
359 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
\r
361 for (Statement s : unreliableLeft) {
\r
362 subjectLeft.add(s.getSubject(),s);
\r
363 objectLeft.add(s.getObject(),s);
\r
365 for (Statement s : unreliableRight) {
\r
366 subjectRight.add(s.getSubject(),s);
\r
367 objectRight.add(s.getObject(),s);
\r
370 for (Resource ol : objectLeft.getKeys()) {
\r
371 // all statements to the left side object
\r
372 List<Statement> left = objectLeft.getValues(ol);
\r
373 // all subjects that have statements to the left side object (ol)
\r
374 Set<Resource> sLeft = new HashSet<Resource>();
\r
375 // all matching subjects on the right side
\r
376 Set<Resource> sRight = new HashSet<Resource>();
\r
377 for (Statement s : left) {
\r
378 sLeft.add(s.getSubject());
\r
379 sRight.add(comparableResources.getRight(s.getSubject()));
\r
382 // check if object left can be reliably identified by available statements
\r
383 // if there are any objects on the left side with similar statements, object left cannot be mapped.
\r
384 boolean hasSimilar = false;
\r
385 MapList<Resource, Statement> comparableOLeft = new MapList<Resource, Statement>();
\r
386 for (Resource sl : sLeft) {
\r
387 for (Statement s : subjectLeft.getValues(sl)) {
\r
388 if (!s.getObject().equals(ol)) {
\r
389 comparableOLeft.add(s.getObject(),s);
\r
394 for (Resource similarOl : comparableOLeft.getKeys()) {
\r
395 List<Statement> similarLeft = comparableOLeft.getValues(similarOl);
\r
396 if (similarLeft.size() == left.size()) {
\r
397 boolean useL[] = new boolean[left.size()];
\r
398 boolean useSL[] = new boolean[left.size()];
\r
399 for (int i = 0; i < left.size(); i++) {
\r
403 for (int i = 0; i < left.size(); i++) {
\r
404 for (int j = 0; j < left.size(); j++) {
\r
407 Resource pl = left.get(i).getPredicate();
\r
408 Resource psl = similarLeft.get(j).getPredicate();
\r
409 if (pl.equals(psl)) {
\r
416 boolean diff = false;
\r
417 for (int i = 0; i < left.size(); i++) {
\r
418 if (!useL[i] || !useSL[i]) {
\r
433 // all objects that subjects on the right side point to. Object left has its matching resource among these, if it has matching resource
\r
434 MapList<Resource,Statement> possibleOR = new MapList<Resource, Statement>();
\r
435 for (Resource sr : sRight) {
\r
436 for (Statement s : subjectRight.getValues(sr))
\r
437 possibleOR.add(s.getObject(),s);
\r
440 // filter possible right side objects to those that have same amount of statements as the left side object
\r
441 for (Resource or : possibleOR.getKeys().toArray(new Resource[possibleOR.getKeys().size()])) {
\r
442 List<Statement> right = possibleOR.getValues(or);
\r
443 if (right.size() != left.size())
\r
444 possibleOR.remove(or);
\r
448 // check for matching statements (comparable subjects, matching predicates)
\r
449 MapList<Resource,Statement> matchingOR = new MapList<Resource, Statement>(); // list of objects that have matching statements
\r
450 Map<Resource,Pair<int[], int[]>> matchingStatements = new HashMap<Resource, Pair<int[], int[]>>(); // matching statements
\r
451 for (Resource or : possibleOR.getKeys()) {
\r
452 List<Statement> right = possibleOR.getValues(or);
\r
453 int iLeft[] = new int[left.size()];
\r
454 int iRight[] = new int[right.size()];
\r
456 for (int i = 0; i < left.size(); i++) {
\r
461 for (int l = 0; l < left.size(); l++) {
\r
462 Statement ls = left.get(l);
\r
463 for (int r = 0; r < right.size(); r++) {
\r
464 if (iRight[r] >= 0)
\r
466 Statement rs = right.get(r);
\r
467 if (!comparableResources.contains(ls.getSubject(), rs.getSubject()))
\r
469 if (rcomp.compare(ls.getPredicate(),rs.getPredicate()) == 0) {
\r
477 boolean success = true;
\r
478 for (int i = 0; i < left.size(); i++) {
\r
479 if (iLeft[i] < 0) {
\r
483 if (iRight[i] < 0) {
\r
490 for (Statement s : right)
\r
491 matchingOR.add(or,s);
\r
492 matchingStatements.put(or, new Pair<int[], int[]>(iLeft, iRight));
\r
495 // if there is only one matching right side object, we have found a match
\r
496 if (matchingOR.getKeySize() == 1) {
\r
497 Resource or = matchingOR.getKeys().iterator().next();
\r
498 List<Statement> right = matchingOR.getValues(or);
\r
499 Pair<int[], int[]> indices = matchingStatements.get(or);
\r
501 comparableResources.map(ol, or);
\r
502 objectsLeft.add(ol);
\r
503 objectsRight.add(or);
\r
504 for (int l = 0; l < left.size(); l++) {
\r
505 int r = indices.first[l];
\r
506 Statement sl = left.get(l);
\r
507 Statement sr = right.get(r);
\r
508 addComparable(sl, sr, true);
\r
509 unreliableLeft.remove(sl);
\r
510 unreliableRight.remove(sr);
\r
520 private void processUnreliableDeep(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
521 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
\r
522 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
\r
523 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
\r
524 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
\r
526 for (Statement s : unreliableLeft) {
\r
527 subjectLeft.add(s.getSubject(),s);
\r
528 objectLeft.add(s.getObject(),s);
\r
530 for (Statement s : unreliableRight) {
\r
531 subjectRight.add(s.getSubject(),s);
\r
532 objectRight.add(s.getObject(),s);
\r
534 for (Resource ol : objectLeft.getKeys()) {
\r
535 Set<Path> pathsLeft = new HashSet<Path>();
\r
536 for (Resource rel : traversed) {
\r
537 pathsLeft.addAll(Path.create(g.getStatements(ol, rel)));
\r
541 if (pathsLeft.size() == 0)
\r
543 Collection<Path> endPaths = new ArrayList<Path>(1);
\r
544 for (Path p : pathsLeft) {
\r
545 if (comparableResources.containsLeft(p.getEnd())) {
\r
549 if (endPaths.size() > 0) {
\r
551 pathsLeft.addAll(endPaths);
\r
555 if (pathsLeft.size() > 0) {
\r
556 Resource sl = objectLeft.getValues(ol).get(0).getSubject();
\r
557 Resource sr = comparableResources.getRight(sl);
\r
558 Collection<Resource> possibleOR = new ArrayList<Resource>();
\r
559 for (Statement s : subjectRight.getValues(sr)) {
\r
560 possibleOR.add(s.getObject());
\r
562 Map<Resource,Set<Path>> matchingPaths = new HashMap<Resource, Set<Path>>();
\r
563 for (Resource or : possibleOR) {
\r
564 Set<Path> possiblePathsRight = new HashSet<Path>();
\r
565 for (Path leftPath : pathsLeft) {
\r
566 possiblePathsRight.addAll(findComparableRight(leftPath, or));
\r
568 if (possiblePathsRight.size() == pathsLeft.size()) {
\r
569 matchingPaths.put(or, possiblePathsRight);
\r
572 if (matchingPaths.size() > 0) {
\r
573 if (matchingPaths.size() == 1) {
\r
574 Resource or = matchingPaths.keySet().iterator().next();
\r
575 objectsLeft.add(ol);
\r
576 objectsRight.add(or);
\r
577 comparableResources.map(ol, or);
\r
578 Collection<Statement> statementsLeft = objectLeft.getValues(ol);
\r
579 Collection<Statement> statementsRight = objectRight.getValues(or);
\r
580 unreliableLeft.removeAll(statementsLeft);
\r
581 unreliableRight.removeAll(statementsRight);
\r
582 System.out.println("Compare not implemented");
\r
584 System.out.println("Compare not implemented");
\r
593 private void expand(Set<Path> paths) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
594 Set<Path> stepPathsLeft = new HashSet<Path>();
\r
595 if (paths.size() == 0)
\r
597 int length = paths.iterator().next().getLength() + 1;
\r
598 for (Path p : paths) {
\r
599 for (Resource rel : traversed) {
\r
600 stepPathsLeft.addAll(Path.expand(p,g.getStatements(p.getEnd(), rel)));
\r
604 for (Path p : stepPathsLeft) {
\r
605 if (p.getLength() == length)
\r
610 private Collection<Path> findComparableRight(Path leftPath, Resource beginRight) throws ManyObjectsForFunctionalRelationException, ServiceException {
\r
611 Set<Path> rightPaths = new HashSet<Path>();
\r
612 rightPaths.addAll(Path.create(g.getStatements(beginRight, getRight(leftPath.getStatements().get(0).getPredicate()))));
\r
613 for (int i = 1; i < leftPath.getLength(); i++) {
\r
614 if (rightPaths.size() == 0)
\r
616 Set<Path> stepPaths = new HashSet<Path>();
\r
617 for (Path p : rightPaths) {
\r
618 stepPaths.addAll(Path.expand(p, g.getStatements(p.getEnd(), getRight(leftPath.getStatements().get(i).getPredicate()))));
\r
620 rightPaths.clear();
\r
621 for (Path p : stepPaths)
\r
622 if (p.getLength() == i+1)
\r
629 private Resource getRight(Resource r) {
\r
630 if (comparableResources.containsLeft(r))
\r
631 return comparableResources.getRight(r);
\r
637 public BijectionMap<Statement, Statement> getComparableStatements() {
\r
638 return comparableStatements;
\r
641 public GraphChanges getChanges() {
\r
642 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);
\r
645 private void addComparable(Statement left, Statement right, boolean process) {
\r
646 comparableStatements.map(left, right);
\r
647 comparableResources.map(left.getObject(), right.getObject());
\r
650 public List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws ServiceException {
\r
651 List<Statement> out = new ArrayList<Statement>();
\r
652 for (Statement s : in) {
\r
653 if (!s.isAsserted(r))
\r
660 private String printStatement(ReadGraph graph, Statement s) throws ValidationException, ServiceException {
\r
661 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());
\r
664 private List<Statement> filterTraversed(List<Statement> in) throws ServiceException {
\r
665 return filter(traversed, in);
\r
668 private List<Statement> filterNonTested(List<Statement> in) throws ServiceException {
\r
669 return filter(nonTested, in);
\r
672 private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws ServiceException {
\r
673 if (toFilter.size() == 0)
\r
675 List<Statement> out = new ArrayList<Statement>();
\r
676 for (Statement s : in) {
\r
677 boolean usable = true;
\r
678 for (Resource r : toFilter) {
\r
679 if (g.isSubrelationOf(s.getPredicate(),r)) {
\r
693 private void addDeletion(Statement s) {
\r
694 if (!changes1Set.contains(s)) {
\r
695 changes1Set.add(s);
\r
700 private void addAddition(Statement s) {
\r
701 if (!changes2Set.contains(s)) {
\r
702 changes2Set.add(s);
\r
707 private void addModification(Statement s1, Statement s2) {
\r
708 Pair<Statement, Statement> mod = new Pair<Statement, Statement>(s1,s2);
\r
709 if (!modificationsSet.contains(mod)) {
\r
710 modificationsSet.add(mod);
\r
711 modifications.add(mod);
\r
715 public void sortStatement(List<Statement> list1, List<Statement> list2) {
\r
716 sortStatement(list1, list2, scomp);
\r
719 public void sortStatement(List<Statement> list1, List<Statement> list2, Comparator<Statement> scomp) {
\r
720 Collections.sort(list1,scomp);
\r
721 Collections.sort(list2,scomp);
\r
723 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());
\r
724 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());
\r
725 sorted1.addAll(list1);
\r
726 sorted2.addAll(list2);
\r
730 for (int i = 0; i < list1.size(); ) {
\r
731 Statement s1 = list1.get(i);
\r
732 int same1 = sameRel(list1, i);
\r
733 for (int j = 0; j < list2.size(); j++) {
\r
734 Statement s2 = list2.get(j);
\r
735 if (scomp.compare(s1, s2) == 0) {
\r
736 int same2 = sameRel(list2, j);
\r
737 copy(sorted1,ss1,list1,i,same1);
\r
739 copy(sorted2,ss2,list2,j,same2);
\r
746 if (ss1 < sorted1.size()) {
\r
747 for (Statement s : list1) {
\r
748 if (!sorted1.contains(s)) {
\r
749 sorted1.set(ss1,s);
\r
754 if (ss2 < sorted2.size()) {
\r
755 for (Statement s : list2) {
\r
756 if (!sorted2.contains(s)) {
\r
757 sorted2.set(ss2,s);
\r
765 list1.addAll(sorted1);
\r
766 list2.addAll(sorted2);
\r
769 public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {
\r
770 for (int i = 0; i < amount; i++) {
\r
771 to.set(toIndex + i, from.get(fromIndex+ i));
\r
775 public void sortResource(List<Resource> list1, List<Resource> list2) {
\r
776 Collections.sort(list1,rcomp);
\r
778 for (int i = 0; i < list1.size(); i++) {
\r
779 Resource s1 = list1.get(i);
\r
780 for (int j = js; j < list2.size(); j++) {
\r
781 Resource s2 = list2.get(j);
\r
782 if (rcomp.compare(s1, s2) == 0) {
\r
783 Resource t = list2.get(js);
\r
793 private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {
\r
794 sortStatement(ss1, ss2);
\r
800 if (i1 >= ss1.size()) {
\r
801 if (i2 >= ss2.size()) {
\r
804 while (i2 < ss2.size()) {
\r
805 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i2)));
\r
807 addAddition(ss2.get(i2));
\r
812 } else if (i2 >= ss2.size()) {
\r
813 while (i1 < ss1.size()) {
\r
814 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i1)));
\r
815 addDeletion(ss1.get(i1));
\r
820 int same1 = sameRel(ss1, i1);
\r
821 int same2 = sameRel(ss2, i2);
\r
822 int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());
\r
824 compareStatements(ss1, i1, same1, ss2, i2, same2,objectsLeft,objectsRight,unreliableLeft,unreliableRight);
\r
827 } else if (c < 0) {
\r
828 for (int i = 0; i < same1; i++) {
\r
829 System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i+i1)));
\r
830 addDeletion(ss1.get(i+i1));
\r
834 for (int i = 0; i < same2; i++) {
\r
835 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i+i2)));
\r
836 addAddition(ss2.get(i+i2));
\r
846 private int sameRel(List<Statement> statements, int off) {
\r
847 if (statements.size() <= off)
\r
850 long id = statements.get(off).getPredicate().getResourceId();
\r
851 for (int i = off+1; i <statements.size(); i++) {
\r
852 if (statements.get(i).getPredicate().getResourceId() == id)
\r
861 private int compareObject(Resource o1, Resource o2) throws DatabaseException {
\r
864 if (comparableResources.contains(o1, o2))
\r
866 if (comparableResources.containsLeft(o1))
\r
867 return Integer.MAX_VALUE;
\r
868 if (comparableResources.containsRight(o2))
\r
869 return Integer.MAX_VALUE;
\r
870 return comparator.compare(g, o1, o2);
\r
873 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
874 boolean[] used1 = new boolean[len1];
\r
875 for (int i = 0; i < used1.length; i++) {
\r
879 boolean[] used2 = new boolean[len2];
\r
880 for (int i = 0; i < used2.length; i++) {
\r
884 // left, right, difference
\r
885 List<List<Integer>> differences = new ArrayList<List<Integer>>();
\r
886 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
887 Statement s1 = ss1.get(i1);
\r
888 List<Integer> diff = new ArrayList<Integer>();
\r
889 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
890 Statement s2 = ss2.get(i2);
\r
891 int d = compareObject(s1.getObject(), s2.getObject());
\r
893 for (Resource t : strong) {
\r
894 if (s1.getPredicate().equals(t) || g.isSubrelationOf(s1.getPredicate(), t)) {
\r
902 differences.add(diff);
\r
904 // difference, left
\r
905 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();
\r
906 for (int i = 0; i < differences.size(); i++) {
\r
907 List<Integer> list = differences.get(i);
\r
908 for (int j = 0; j < list.size(); j++) {
\r
909 priorities.add(list.get(j), i);
\r
913 Integer[] pris = priorities.getKeys(new Integer[]{});
\r
916 for (Integer pri : pris) {
\r
917 if (pri == Integer.MAX_VALUE) {
\r
919 } else if (pri == 0) {
\r
922 List<Integer> i1s = priorities.getValues(pri);
\r
923 for (Integer i1 : i1s) {
\r
926 List<Integer> i2diff = differences.get(i1);
\r
927 for (int i2 = 0; i2 < i2diff.size(); i2++) {
\r
928 if (i2diff.get(i2) == pri) {
\r
933 Statement s1 = ss1.get(i1+off1);
\r
934 Statement s2 = ss2.get(i2+off2);
\r
936 if (objectsLeft != null) {
\r
937 objectsLeft.add(s1.getObject());
\r
938 objectsRight.add(s2.getObject());
\r
940 addComparable(s1, s2, true);
\r
948 for (Integer pri : pris) {
\r
951 Set<Statement> s1s = new HashSet<Statement>();
\r
952 Set<Statement> s2s = new HashSet<Statement>();
\r
953 Set<Integer> s1i = new HashSet<Integer>();
\r
954 Set<Integer> s2i = new HashSet<Integer>();
\r
955 List<Integer> i1s = priorities.getValues(pri);
\r
956 for (Integer i1 : i1s) {
\r
959 List<Integer> i2diff = differences.get(i1);
\r
960 for (int i2 = 0; i2 < i2diff.size(); i2++) {
\r
961 if (i2diff.get(i2) == pri) {
\r
964 Statement s1 = ss1.get(i1+off1);
\r
965 Statement s2 = ss2.get(i2+off2);
\r
973 if (unreliableLeft != null) {
\r
974 unreliableLeft.addAll(s1s);
\r
975 unreliableRight.addAll(s2s);
\r
977 for (Integer i : s1i)
\r
979 for (Integer i : s2i)
\r
983 for (int i1 = off1; i1 < off1 + len1; i1++) {
\r
984 if (!used1[i1-off1]) {
\r
985 System.out.println("Compare Object diff1 " + printStatement(g,ss1.get(i1)));
\r
986 addDeletion(ss1.get(i1));
\r
989 for (int i2 = off2; i2 < off2 + len2; i2++) {
\r
990 if (!used2[i2-off2]) {
\r
991 System.out.println("Compare Object diff2 " + printStatement(g,ss2.get(i2)));
\r
992 addAddition(ss2.get(i2));
\r
1000 * compares properties, assumes functional relations
\r
1003 * @throws ServiceException
\r
1004 * @throws DoesNotContainValueException
\r
1005 * @throws ValidationException
\r
1007 private void compareProps(Resource r1, Resource r2) throws ServiceException, DoesNotContainValueException, ValidationException {
\r
1008 System.out.println("compareProps " + r1 + " " + NameUtils.getSafeName(g, r1) + " " + r2 + " " + NameUtils.getSafeName(g, r2));
\r
1009 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
1010 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
1011 ss1.addAll(g.getStatements(r1, b.HasProperty));
\r
1012 ss2.addAll(g.getStatements(r2, b.HasProperty));
\r
1013 sortStatement(ss1, ss2);
\r
1019 if (i1 >= ss1.size()) {
\r
1020 if (i2 >= ss2.size())
\r
1023 while (i2 < ss2.size()) {
\r
1024 System.out.println("Compare Prop diff2 " + printStatement(g,ss2.get(i2)));
\r
1025 addAddition(ss2.get(i2));
\r
1030 } else if (i2 >= ss2.size()) {
\r
1031 while (i1 < ss1.size()) {
\r
1032 System.out.println("Compare Prop diff1 " + printStatement(g,ss1.get(i1)));
\r
1033 addDeletion(ss1.get(i1));
\r
1038 Statement s1 = ss1.get(i1);
\r
1039 Statement s2 = ss2.get(i2);
\r
1040 if (s1.isAsserted(r1) && s2.isAsserted(r2)) {
\r
1045 int c = scomp.compare(s1, s2);
\r
1048 boolean b1 = g.hasValue(s1.getObject());
\r
1049 boolean b2 = g.hasValue(s2.getObject());
\r
1052 Object v1 = g.getValue(s1.getObject());
\r
1053 Object v2 = g.getValue(s2.getObject());
\r
1054 boolean eq = compareValue(v1, v2);
\r
1056 addModification(s1, s2);
\r
1057 addComparable(s1, s2, false);
\r
1060 if (!s1.getObject().equals(s1.getSubject()) && !s2.getObject().equals(s2.getSubject()))
\r
1061 compareProps(s1.getObject(), s2.getObject());
\r
1064 addModification(s1, s2);
\r
1065 addComparable(s1, s2, false);
\r
1072 System.out.println("Compare Prop diff1s " + printStatement(g,s1));
\r
1079 System.out.println("Compare Prop diff2s " + printStatement(g,s2));
\r
1093 public static boolean compareValue(Object v1, Object v2) {
\r
1094 if (v1 instanceof Object[] && v2 instanceof Object[])
\r
1095 return Arrays.deepEquals((Object[])v1, (Object[])v2);
\r
1096 else if (v1 instanceof int[] && v2 instanceof int[])
\r
1097 return Arrays.equals((int[])v1, (int[])v2);
\r
1098 else if (v1 instanceof float[] && v2 instanceof float[])
\r
1099 return Arrays.equals((float[])v1, (float[])v2);
\r
1100 else if (v1 instanceof double[] && v2 instanceof double[])
\r
1101 return Arrays.equals((double[])v1, (double[])v2);
\r
1102 else if (v1 instanceof long[] && v2 instanceof long[])
\r
1103 return Arrays.equals((long[])v1, (long[])v2);
\r
1104 else if (v1 instanceof byte[] && v2 instanceof byte[])
\r
1105 return Arrays.equals((byte[])v1, (byte[])v2);
\r
1106 else if (v1 instanceof boolean[] && v2 instanceof boolean[])
\r
1107 return Arrays.equals((boolean[])v1, (boolean[])v2);
\r
1109 return v1.equals(v2);
\r
1113 public class PredicateComparator implements Comparator<Statement> {
\r
1115 public int compare(Statement o1, Statement o2) {
\r
1116 if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))
\r
1118 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
1120 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
1126 public class SubjectComparator implements Comparator<Statement> {
\r
1128 public int compare(Statement o1, Statement o2) {
\r
1129 if (comparableResources.contains(o1.getSubject(), o2.getSubject()))
\r
1131 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
\r
1133 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
\r
1139 public class ObjectComparator implements Comparator<Statement> {
\r
1141 public int compare(Statement o1, Statement o2) {
\r
1142 if (comparableResources.contains(o1.getObject(), o2.getObject()))
\r
1144 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
\r
1146 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
\r
1152 public static class FullStatementComparator implements Comparator<Statement> {
\r
1154 public int compare(Statement o1, Statement o2) {
\r
1155 if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
\r
1157 if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
\r
1159 if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
\r
1161 if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
\r
1163 if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
\r
1165 if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
\r
1171 public class ResComparator implements Comparator<Resource> {
\r
1173 public int compare(Resource o1, Resource o2) {
\r
1174 if (comparableResources.contains(o1, o2))
\r
1176 if (o1.getResourceId() < o2.getResourceId())
\r
1178 if (o1.getResourceId() > o2.getResourceId())
\r