org.simantics.interop/src/org/simantics/interop/test/GraphComparator.java

   1 /*******************************************************************************
   2  * Copyright (c) 2007, 2010 Association for Decentralized Information Management
   3  * in Industry THTH ry.
   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
   8  *
   9  * Contributors:
  10  *     Foster Wheeler Energia Oy - initial API and implementation
  11  *******************************************************************************/
  12 package org.simantics.interop.test;
  13
  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;
  22 import java.util.Map;
  23 import java.util.Map.Entry;
  24 import java.util.Set;
  25 import java.util.Stack;
  26
  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;
  40
  41 /**
  42  * Compares two subgraphs and reports differences.
  43  *
  44  * Assumes that subgraphs (defined using traverse relations) are not cyclic.
  45  *
  46  * Assumes that properties can be used to identify objects, if relation type is not enough.
  47  *
  48  *
  49  *
  50  * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
  51  *
  52  */
  53 public class GraphComparator {
  54
  55         private static final boolean DEBUG = false;
  56
  57         private Resource r1;
  58         private Resource r2;
  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
  64
  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<>();
  71
  72         private BijectionMap<Statement, Statement> comparableStatements = new BijectionMap<>();
  73         private BijectionMap<Resource, Resource> comparableResources = new BijectionMap<>();
  74
  75         private Set<Resource> processedResources = new HashSet<Resource>();
  76
  77         private ResourceComparator comparator;
  78
  79         private Comparator<Statement> scomp = new PredicateComparator();
  80         private Comparator<Resource> rcomp = new ResComparator();
  81
  82         private Set<Resource> nonMatchedLeft = new HashSet<Resource>();
  83         private Set<Resource> nonMatchedRight = new HashSet<Resource>();
  84
  85         // runtime attributes
  86
  87         private ReadGraph g;
  88         private Layer0 b;
  89
  90         public GraphComparator(Resource r1, Resource r2) {
  91                 this.r1 = r1;
  92                 this.r2 = r2;
  93                 comparator = new TypeComparator();
  94         }
  95
  96         public GraphComparator(Resource r1, Resource r2, ResourceComparator comparator) {
  97                 this.r1 = r1;
  98                 this.r2 = r2;
  99                 this.comparator = comparator;
 100         }
 101
 102         ArrayList<Statement> ss1 = new ArrayList<Statement>();
 103         ArrayList<Statement> ss2 = new ArrayList<Statement>();
 104
 105
 106         public Comparator<Resource> getResourceComparator() {
 107                 return rcomp;
 108         }
 109
 110         public Comparator<Statement> getStatementComparator() {
 111                 return scomp;
 112         }
 113
 114         public Resource getR1() {
 115                 return r1;
 116         }
 117
 118         public Resource getR2() {
 119                 return r2;
 120         }
 121
 122         public void addTraversed(Resource rel) {
 123                 traversed.add(rel);
 124         }
 125
 126         public void addTraversed(Collection<Resource> rels) {
 127                 traversed.addAll(rels);
 128         }
 129
 130         public void addNonTraversed(Resource rel) {
 131                 nonTraversed.add(rel);
 132         }
 133
 134         public void addNonTraversed(Collection<Resource> rels) {
 135                 nonTraversed.addAll(rels);
 136         }
 137
 138         public void addTested(Resource rel) {
 139                 tested.add(rel);
 140         }
 141
 142         public void addTested(Collection<Resource> rels) {
 143                 tested.addAll(rels);
 144         }
 145
 146         public void addNonTested(Resource rel) {
 147                 nonTested.add(rel);
 148         }
 149
 150         public void addNonTested(Collection<Resource> rels) {
 151                 nonTested.addAll(rels);
 152         }
 153
 154         public void addComparableResources(Resource r1, Resource r2) {
 155                 if (DEBUG)
 156                         System.out.println("Preset " + r1 + " = " + r2);
 157                 comparableResources.map(r1, r2);
 158         }
 159
 160         public void addComparableResources(BijectionMap<Resource, Resource> matching) {
 161                 if (DEBUG) {
 162                         for (Entry<Resource, Resource> entry : matching.getEntries())
 163                                 System.out.println("Preset " + entry.getKey() + " = " + entry.getValue());
 164                 }
 165                 comparableResources.addAll(matching);
 166         }
 167
 168         public void addStrong(Resource r) {
 169                 strong.add(r);
 170         }
 171
 172         public void addStrong(Collection<Resource> rels) {
 173                 strong.addAll(rels);
 174         }
 175
 176         public void addNonMatchedLeft(Resource r) {
 177                 nonMatchedLeft.add(r);
 178         }
 179
 180         public void addNonMatchedRight(Resource r) {
 181                 nonMatchedRight.add(r);
 182         }
 183
 184         public void test(ReadGraph g) throws DatabaseException {
 185                 this.g = g;
 186                 this.b = Layer0.getInstance(g);
 187                 comparator.setComparator(this);
 188                 comparator.initialize(g, r1, r2);
 189
 190                 Stack<Resource> objectsLeft = new Stack<Resource>();
 191                 Stack<Resource> objectsRight = new Stack<Resource>();
 192                 objectsLeft.push(r1);
 193                 objectsRight.push(r2);
 194
 195                 Set<Statement> unreliableLeft = new HashSet<Statement>();
 196                 Set<Statement> unreliableRight = new HashSet<Statement>();
 197
 198                 while (true) {
 199                         if (objectsLeft.isEmpty())
 200                                 break;
 201
 202
 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);
 211                         }
 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);
 216                         }
 217
 218                 }
 219                 for (Statement s : unreliableLeft) {
 220                         if (!comparableStatements.containsLeft(s))
 221                                 addDeletion(s);
 222                 }
 223                 for (Statement s : unreliableRight) {
 224                         if (!comparableStatements.containsRight(s))
 225                                 addAddition(s);
 226                 }
 227         }
 228
 229         public void test(Session session) throws DatabaseException {
 230                 test(session, r1, r2);
 231         }
 232
 233         public void test(Session session, Resource r1, Resource r2) throws DatabaseException {
 234
 235                 comparator.setComparator(this);
 236
 237                 session.syncRequest(new ReadRequest() {
 238
 239             @Override
 240             public void run(ReadGraph graph) throws DatabaseException {
 241                 comparator.initialize(graph, r1, r2);
 242             }
 243         });
 244
 245                 addComparable(r1, r2);
 246
 247                 final Stack<Resource> objectsLeft = new Stack<Resource>();
 248                 final Stack<Resource> objectsRight = new Stack<Resource>();
 249                 objectsLeft.push(r1);
 250                 objectsRight.push(r2);
 251
 252                 final Set<Statement> unreliableLeft = new HashSet<Statement>();
 253                 final Set<Statement> unreliableRight = new HashSet<Statement>();
 254
 255                 while (true) {
 256                         if (objectsLeft.isEmpty())
 257                                 break;
 258                         session.syncRequest(new ReadRequest() {
 259
 260                                 @Override
 261                                 public void run(ReadGraph graph) throws DatabaseException {
 262                                         g = graph;
 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);
 272                                         }
 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);
 277                                         }
 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);
 282                                         }
 283                                 }
 284                         });
 285
 286
 287
 288                 }
 289                 for (Statement s : unreliableLeft) {
 290                         if (!comparableStatements.containsLeft(s))
 291                                 addDeletion(s);
 292                 }
 293                 for (Statement s : unreliableRight) {
 294                         if (!comparableStatements.containsRight(s))
 295                                 addAddition(s);
 296                 }
 297
 298
 299         }
 300
 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>();
 304
 305                 while (!objectsLeft.isEmpty()) {
 306                         Resource r1 = objectsLeft.pop();
 307                         Resource r2 = objectsRight.pop();
 308
 309                         if (r1.equals(r2))
 310                                 continue;
 311                         if (processedResources.contains(r1))
 312                                 continue;
 313                         processedResources.add(r1);
 314
 315
 316                         if((comparableResources.containsLeft(r1)||comparableResources.containsRight(r2)) && !comparableResources.contains(r1, r2)) {
 317                                 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.");
 318                         }
 319                         addComparable(r1, r2);
 320
 321                         //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));
 322                         compareProps(r1, r2);
 323
 324                         for (Resource rel : tested) {
 325                                 ss1.addAll(g.getStatements(r1, rel));
 326                                 ss2.addAll(g.getStatements(r2, rel));
 327                                 ss1 = filterAsserted(r1, ss1);
 328                                 ss2 = filterAsserted(r2, ss2);
 329                                 ss1 = filterTraversed(ss1);
 330                                 ss2 = filterTraversed(ss2);
 331                                 ss1 = filterNonTested(ss1);
 332                                 ss2 = filterNonTested(ss2);
 333
 334
 335                                 compareStatements(ss1, ss2, null, null,null,null);
 336                                 ss1.clear();
 337                                 ss2.clear();
 338                         }
 339
 340                         for (Resource rel : traversed) {
 341                                 ss1.addAll(g.getStatements(r1, rel));
 342                                 ss2.addAll(g.getStatements(r2, rel));
 343                                 ss1 = filterAsserted(r1, ss1);
 344                                 ss2 = filterAsserted(r2, ss2);
 345                                 ss1 = filterNonTraversed(ss1);
 346                                 ss2 = filterNonTraversed(ss2);
 347                                 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
 348                                 ss1.clear();
 349                                 ss2.clear();
 350
 351                         }
 352                 }
 353         }
 354
 355         private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {
 356                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
 357                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
 358                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
 359                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
 360
 361                 for (Statement s : unreliableLeft) {
 362                         subjectLeft.add(s.getSubject(),s);
 363                         objectLeft.add(s.getObject(),s);
 364                 }
 365                 for (Statement s : unreliableRight) {
 366                         subjectRight.add(s.getSubject(),s);
 367                         objectRight.add(s.getObject(),s);
 368                 }
 369
 370                 for (Resource left : subjectLeft.getKeys()) {
 371                         Resource right = comparableResources.getRight(left);
 372                         if (right == null)
 373                                 continue;
 374                         for (Statement leftS : subjectLeft.getValues(left)) {
 375                                 Resource leftO = leftS.getObject();
 376                                 if (!unreliableLeft.contains(leftS))
 377                                         continue;
 378                                 Resource rightO = comparableResources.getRight(leftO);
 379                                 if (rightO == null)
 380                                         continue;
 381                                 for (Statement rightS : subjectRight.getValues(right)) {
 382                                         if (!rightS.getObject().equals(rightO))
 383                                                 continue;
 384                                         if (!unreliableRight.contains(rightS))
 385                                                 continue;
 386                                         if (leftS.getPredicate().equals(rightS.getPredicate()) ||
 387                                                 comparableResources.contains(leftS.getPredicate(), rightS.getPredicate())) {
 388                                                 unreliableLeft.remove(leftS);
 389                                                 unreliableRight.remove(rightS);
 390                                                 addComparable(leftS, rightS);
 391                                         }
 392                                 }
 393                         }
 394                 }
 395         }
 396
 397         private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
 398                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
 399                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
 400                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
 401                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
 402
 403                 for (Statement s : unreliableLeft) {
 404                         subjectLeft.add(s.getSubject(),s);
 405                         objectLeft.add(s.getObject(),s);
 406                 }
 407                 for (Statement s : unreliableRight) {
 408                         subjectRight.add(s.getSubject(),s);
 409                         objectRight.add(s.getObject(),s);
 410                 }
 411
 412                 for (Resource ol : objectLeft.getKeys()) {
 413                         // all statements to the left side object
 414                         List<Statement> left = objectLeft.getValues(ol);
 415                         // all subjects that have statements to the left side object (ol)
 416                         Set<Resource> sLeft = new HashSet<Resource>();
 417                         // all matching subjects on the right side
 418                         Set<Resource> sRight = new HashSet<Resource>();
 419                         for (Statement s : left) {
 420                                 sLeft.add(s.getSubject());
 421                                 sRight.add(comparableResources.getRight(s.getSubject()));
 422                         }
 423
 424                         // check if object left can be reliably identified by available statements
 425                         // if there are any objects on the left side with similar statements, object left cannot be mapped.
 426                         boolean hasSimilar = false;
 427                         MapList<Resource, Statement> comparableOLeft = new MapList<Resource, Statement>();
 428                         for (Resource sl : sLeft) {
 429                                 for (Statement s : subjectLeft.getValues(sl)) {
 430                                         if (!s.getObject().equals(ol)) {
 431                                                 comparableOLeft.add(s.getObject(),s);
 432                                         }
 433                                 }
 434                         }
 435
 436                         compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
 437
 438                         for (Resource similarOl : comparableOLeft.getKeys()) {
 439                                 List<Statement> similarLeft = comparableOLeft.getValues(similarOl);
 440                                 if (similarLeft.size() == left.size()) {
 441                                         boolean useL[] = new boolean[left.size()];
 442                                         boolean useSL[] = new boolean[left.size()];
 443                                         for (int i = 0; i < left.size(); i++) {
 444                                                 useL[i] = false;
 445                                                 useSL[i] = false;
 446                                         }
 447                                         for (int i = 0; i < left.size(); i++) {
 448                                                 for (int j = 0; j < left.size(); j++) {
 449                                                         if (useSL[j])
 450                                                                 continue;
 451                                                         // compare predicates
 452                                                         Resource pl = left.get(i).getPredicate();
 453                                                         Resource psl = similarLeft.get(j).getPredicate();
 454                                                         if (pl.equals(psl)) {
 455                                                                 // compare objects (unreliable result is interpreted as positive match)
 456
 457                                                                 int comp = comparator.compare(g, left.get(i).getObject(), similarLeft.get(j).getObject(), true);
 458                                                                 if (comp >= 0 && comp < Integer.MAX_VALUE) {
 459                                                                         useL[i] = true;
 460                                                                         useSL[j] = true;
 461                                                                         break;
 462                                                                 }
 463                                                         }
 464                                                 }
 465                                         }
 466                                         boolean diff = false;
 467                                         for (int i = 0; i < left.size(); i++) {
 468                                                 if (!useL[i] || !useSL[i]) {
 469                                                         diff = true;
 470                                                 }
 471                                         }
 472                                         if (!diff) {
 473                                                 hasSimilar = true;
 474                                                 break;
 475                                         }
 476                                 }
 477                         }
 478
 479                         if (hasSimilar)
 480                                 continue;
 481
 482
 483                         // all objects that subjects on the right side point to. Object left has its matching resource among these, if it has matching resource
 484                         MapList<Resource,Statement> possibleOR = new MapList<Resource, Statement>();
 485                         for (Resource sr : sRight) {
 486                                 for (Statement s : subjectRight.getValues(sr))
 487                                         possibleOR.add(s.getObject(),s);
 488                         }
 489
 490                         // filter possible right side objects to those that have same amount of statements as the left side object
 491                         for (Resource or : possibleOR.getKeys().toArray(new Resource[possibleOR.getKeys().size()])) {
 492                                 List<Statement> right = possibleOR.getValues(or);
 493                                 if (right.size() != left.size())
 494                                         possibleOR.remove(or);
 495
 496                         }
 497
 498                         // check for matching statements (comparable subjects, matching predicates)
 499                         MapList<Resource,Statement> matchingOR = new MapList<Resource, Statement>(); // list of objects that have matching statements
 500                         Map<Resource,Pair<int[], int[]>> matchingStatements = new HashMap<Resource, Pair<int[], int[]>>(); // matching statements
 501                         for (Resource or : possibleOR.getKeys()) {
 502                                 List<Statement> right = possibleOR.getValues(or);
 503                                 int iLeft[] = new int[left.size()];
 504                                 int iRight[] = new int[right.size()];
 505
 506                                 for (int i = 0; i < left.size(); i++) {
 507                                         iLeft[i] = -1;
 508                                         iRight[i] = -1;
 509                                 }
 510
 511                                 for (int l = 0; l < left.size(); l++) {
 512                                         Statement ls = left.get(l);
 513                                         for (int r = 0; r < right.size(); r++) {
 514                                                 if (iRight[r] >= 0)
 515                                                         continue;
 516                                                 Statement rs = right.get(r);
 517                                                 if (!comparableResources.contains(ls.getSubject(), rs.getSubject()))
 518                                                         continue;
 519                                                 if (rcomp.compare(ls.getPredicate(),rs.getPredicate()) == 0) {
 520                                                         // compare objects (unreliable result is not accepted)
 521                                                         int comp = comparator.compare(g, ls.getObject(), rs.getObject());
 522                                                         if (comp > 0 && comp < Integer.MAX_VALUE) {
 523                                                                 iLeft[l] = r;
 524                                                                 iRight[r] = l;
 525                                                                 break;
 526                                                         }
 527                                                         break;
 528                                                 }
 529                                         }
 530
 531                                 }
 532                                 boolean success = true;
 533                                 for (int i = 0; i < left.size(); i++) {
 534                                         if (iLeft[i] < 0) {
 535                                                 success = false;
 536                                                 break;
 537                                         }
 538                                         if (iRight[i] < 0) {
 539                                                 success = false;
 540                                                 break;
 541                                         }
 542
 543                                 }
 544                                 if (success) {
 545                                         for (Statement s : right)
 546                                                 matchingOR.add(or,s);
 547                                         matchingStatements.put(or, new Pair<int[], int[]>(iLeft, iRight));
 548                                 }
 549                         }
 550                         // if there is only one matching right side object, we have found a match
 551                         if (matchingOR.getKeySize() == 1) {
 552                                 Resource or = matchingOR.getKeys().iterator().next();
 553                                 List<Statement> right = matchingOR.getValues(or);
 554                                 Pair<int[], int[]> indices = matchingStatements.get(or);
 555
 556                                 objectsLeft.add(ol);
 557                                 objectsRight.add(or);
 558                                 addComparable(ol, or);
 559                                 for (int l = 0; l < left.size(); l++) {
 560                                         int r = indices.first[l];
 561                                         Statement sl = left.get(l);
 562                                         Statement sr = right.get(r);
 563                                         addComparable(sl, sr);
 564                                         unreliableLeft.remove(sl);
 565                                         unreliableRight.remove(sr);
 566                                 }
 567
 568                         } else {
 569
 570                         }
 571
 572                 }
 573
 574
 575         }
 576
 577         private void processUnreliable2(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
 578                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
 579                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
 580                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
 581                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
 582
 583                 for (Statement s : unreliableLeft) {
 584                         subjectLeft.add(s.getSubject(),s);
 585                         objectLeft.add(s.getObject(),s);
 586                 }
 587                 for (Statement s : unreliableRight) {
 588                         subjectRight.add(s.getSubject(),s);
 589                         objectRight.add(s.getObject(),s);
 590                 }
 591
 592                 for (Resource ol : objectLeft.getKeys()) {
 593                         // all statements to the left side object
 594                         List<Statement> left = objectLeft.getValues(ol);
 595                         // all subjects that have statements to the left side object (ol)
 596                         Set<Resource> sLeft = new HashSet<Resource>();
 597                         // all matching subjects on the right side
 598                         Set<Resource> sRight = new HashSet<Resource>();
 599                         for (Statement s : left) {
 600                                 sLeft.add(s.getSubject());
 601                                 sRight.add(comparableResources.getRight(s.getSubject()));
 602                         }
 603
 604                         if (sLeft.size() == 1 && sRight.size() == 1) {
 605                                 List<Statement> ss1 = new ArrayList<Statement>(subjectLeft.getValues(sLeft.iterator().next()));
 606                                 List<Statement> ss2 = new ArrayList<Statement>(subjectRight.getValues(sRight.iterator().next()));
 607
 608                                 int count = comparableStatements.size();
 609                                 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);
 610                                 if (comparableStatements.size() > count) {
 611                                         for (Entry<Statement, Statement> entry : comparableStatements.getEntries()) {
 612                                                 unreliableLeft.remove(entry.getKey());
 613                                                 unreliableRight.remove(entry.getValue());
 614                                         }
 615                                 }
 616                         }
 617                 }
 618         }
 619
 620         private void processUnreliableDeep(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws DatabaseException {
 621                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();
 622                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();
 623                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();
 624                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();
 625
 626                 for (Statement s : unreliableLeft) {
 627                         subjectLeft.add(s.getSubject(),s);
 628                         objectLeft.add(s.getObject(),s);
 629                 }
 630                 for (Statement s : unreliableRight) {
 631                         subjectRight.add(s.getSubject(),s);
 632                         objectRight.add(s.getObject(),s);
 633                 }
 634                 for (Resource ol : objectLeft.getKeys()) {
 635                         Set<Path> pathsLeft = new HashSet<Path>();
 636                         for (Resource rel : traversed) {
 637                                 pathsLeft.addAll(Path.create(g.getStatements(ol, rel)));
 638                         }
 639                         while (true) {
 640                                 expand(pathsLeft);
 641                                 if (pathsLeft.size() == 0)
 642                                         break;
 643                                 Collection<Path> endPaths = new ArrayList<Path>(1);
 644                                 for (Path p : pathsLeft) {
 645                                         if (comparableResources.containsLeft(p.getEnd())) {
 646                                                 endPaths.add(p);
 647                                         }
 648                                 }
 649                                 if (endPaths.size() > 0) {
 650                                         pathsLeft.clear();
 651                                         pathsLeft.addAll(endPaths);
 652                                         break;
 653                                 }
 654                         }
 655                         if (pathsLeft.size() > 0) {
 656                                 Resource sl = objectLeft.getValues(ol).get(0).getSubject();
 657                                 Resource sr = comparableResources.getRight(sl);
 658                                 Collection<Resource> possibleOR = new ArrayList<Resource>();
 659                                 for (Statement s : subjectRight.getValues(sr)) {
 660                                         possibleOR.add(s.getObject());
 661                                 }
 662                                 Map<Resource,Set<Path>> matchingPaths = new HashMap<Resource, Set<Path>>();
 663                                 for (Resource or : possibleOR) {
 664                                         Set<Path> possiblePathsRight = new HashSet<Path>();
 665                                         for (Path leftPath : pathsLeft) {
 666                                                 possiblePathsRight.addAll(findComparableRight(leftPath, or));
 667                                         }
 668                                         if (hasMatchingPaths(pathsLeft, possiblePathsRight)) {
 669                                                 matchingPaths.put(or, possiblePathsRight);
 670                                         }
 671                                 }
 672                                 if (matchingPaths.size() > 0) {
 673                                         if (matchingPaths.size() == 1) {
 674                                                 Resource or = matchingPaths.keySet().iterator().next();
 675
 676                                                 objectsLeft.add(ol);
 677                                                 objectsRight.add(or);
 678                                                 addComparable(ol, or);
 679                                                 Collection<Statement> statementsLeft = objectLeft.getValues(ol);
 680                                                 Collection<Statement> statementsRight = objectRight.getValues(or);
 681                                                 unreliableLeft.removeAll(statementsLeft);
 682                                                 unreliableRight.removeAll(statementsRight);
 683                                                 BijectionMap<Path,Path> map = getMatchingPaths(pathsLeft, matchingPaths.get(or));
 684                                                 for (Path left : map.getLeftSet()) {
 685                                                         Path right = map.getRight(left);
 686                                                         for (int i = 0; i < left.getLength(); i++) {
 687                                                                 addComparable(left.getStatements().get(i),right.getStatements().get(i));
 688                                                         }
 689                                                 }
 690                                         }
 691                                 }
 692                         }
 693
 694                 }
 695
 696         }
 697
 698         private boolean hasMatchingPaths(Set<Path> leftPaths, Set<Path> rightPaths) {
 699                 if (leftPaths.size() != rightPaths.size())
 700                         return false;
 701                 BijectionMap<Path,Path> map = getMatchingPaths(leftPaths, rightPaths);
 702                 return map.size() == leftPaths.size();
 703         }
 704
 705         private BijectionMap<Path,Path> getMatchingPaths(Set<Path> leftPaths, Set<Path> rightPaths) {
 706                 BijectionMap<Path,Path> map = new BijectionMap<Path, Path>();
 707                 for (Path leftPath : leftPaths) {
 708                         for (Path rightPath : rightPaths) {
 709                                 if (map.containsRight(rightPath))
 710                                         continue;
 711                                 if (leftPath.getLength() != rightPath.getLength())
 712                                         continue;
 713                                 if (comparableResources.contains(leftPath.getEnd(), rightPath.getEnd())) {
 714                                         boolean preds = true;
 715                                         for (int i = 0; i < leftPath.getLength(); i++) {
 716                                                 Statement sl = leftPath.getStatements().get(i);
 717                                                 Statement sr = rightPath.getStatements().get(i);
 718                                                 if (!sl.getPredicate().equals(sr.getPredicate()) && !comparableResources.contains(sl.getPredicate(), sr.getPredicate())) {
 719                                                         preds = false;
 720                                                         break;
 721                                                 }
 722                                         }
 723                                         if (preds) {
 724                                                 map.map(leftPath, rightPath);
 725                                                 break;
 726                                         }
 727                                 }
 728                         }
 729                 }
 730                 return map;
 731         }
 732
 733         private void expand(Set<Path> paths) throws DatabaseException {
 734                 Set<Path> stepPathsLeft = new HashSet<Path>();
 735                 if (paths.size() == 0)
 736                         return;
 737                 int length = paths.iterator().next().getLength() + 1;
 738                 for (Path p : paths) {
 739                         for (Resource rel : traversed) {
 740                                 stepPathsLeft.addAll(Path.expand(p,g.getStatements(p.getEnd(), rel)));
 741                         }
 742                 }
 743                 paths.clear();
 744                 for (Path p : stepPathsLeft) {
 745                         if (p.getLength() == length)
 746                                 paths.add(p);
 747                 }
 748         }
 749
 750         private Collection<Path> findComparableRight(Path leftPath, Resource beginRight) throws DatabaseException {
 751                 Set<Path> rightPaths = new HashSet<Path>();
 752                 rightPaths.addAll(Path.create(g.getStatements(beginRight, getRight(leftPath.getStatements().get(0).getPredicate()))));
 753                 for (int i = 1; i < leftPath.getLength(); i++) {
 754                         if (rightPaths.size() == 0)
 755                                 return rightPaths;
 756                         Set<Path> stepPaths = new HashSet<Path>();
 757                         for (Path p : rightPaths) {
 758                                 stepPaths.addAll(Path.expand(p, g.getStatements(p.getEnd(), getRight(leftPath.getStatements().get(i).getPredicate()))));
 759                         }
 760                         rightPaths.clear();
 761                         for (Path p : stepPaths)
 762                                 if (p.getLength() == i+1)
 763                                         rightPaths.add(p);
 764                 }
 765                 return rightPaths;
 766
 767         }
 768
 769         private Resource getRight(Resource r) {
 770                 if (comparableResources.containsLeft(r))
 771                         return comparableResources.getRight(r);
 772                 return r;
 773         }
 774
 775
 776
 777         public BijectionMap<Statement, Statement> getComparableStatements() {
 778                 return comparableStatements;
 779         }
 780
 781         public BijectionMap<Resource, Resource> getComparableResources() {
 782                 return comparableResources;
 783         }
 784
 785         public GraphChanges getChanges() {
 786                 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);
 787         }
 788
 789         private void addComparable(Statement left, Statement right) throws DatabaseException {
 790                 addComparable(left.getObject(), right.getObject());
 791                 comparableStatements.map(left, right);
 792                 //comparableResources.map(left.getObject(), right.getObject());
 793         }
 794
 795         private void addComparable(Resource left, Resource right) throws DatabaseException {
 796                 if(!comparableResources.contains(left, right)) {
 797                         if (comparableResources.containsLeft(left)||comparableResources.containsRight(right)) {
 798                                 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.");
 799                         } else {
 800                                 if (DEBUG) System.out.println(left + " = " + right);
 801                                 comparableResources.map(left, right);
 802                         }
 803                 }
 804
 805         }
 806
 807         public List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws DatabaseException {
 808                 List<Statement> out = new ArrayList<Statement>();
 809                 for (Statement s : in) {
 810                         if (!s.isAsserted(r))
 811                                 out.add(s);
 812
 813                 }
 814                 return out;
 815         }
 816
 817         public List<Statement> filterAssertedDuplicates(Resource r, List<Statement> in) throws DatabaseException {
 818                 List<Statement> out = new ArrayList<Statement>();
 819                 for (int i = 0; i < in.size(); i++) {
 820                         Statement s = in.get(i);
 821                         if (!s.isAsserted(r))
 822                                 out.add(s);
 823                         else {
 824                                 boolean has = false;
 825                                 if (i > 1 && in.get(i-1).getPredicate().equals(s.getPredicate()))
 826                                         has = true;
 827                                 else if (i < in.size()-1 && in.get(i+1).getPredicate().equals(s.getPredicate()))
 828                                         has = true;
 829                                 if (!has)
 830                                         out.add(s);
 831                         }
 832
 833                 }
 834                 for (Statement s : in) {
 835                         if (!s.isAsserted(r))
 836                                 out.add(s);
 837
 838                 }
 839                 return out;
 840         }
 841
 842
 843
 844         private String printStatement(ReadGraph graph, Statement s) throws DatabaseException {
 845                 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());
 846         }
 847
 848         private List<Statement> filterTraversed(List<Statement> in) throws DatabaseException {
 849                 return filter(traversed, in);
 850         }
 851
 852         private List<Statement> filterNonTested(List<Statement> in) throws DatabaseException {
 853                 return filter(nonTested, in);
 854         }
 855
 856         private List<Statement> filterNonTraversed(List<Statement> in) throws DatabaseException {
 857                 return filter(nonTraversed, in);
 858         }
 859
 860         private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws DatabaseException {
 861                 if (toFilter.size() == 0)
 862                         return in;
 863                 List<Statement> out = new ArrayList<Statement>();
 864                 for (Statement s : in) {
 865                         boolean usable = true;
 866                         for (Resource r : toFilter) {
 867                                 if (g.isSubrelationOf(s.getPredicate(),r)) {
 868                                         usable = false;
 869                                         break;
 870                                 }
 871                         }
 872                         if (usable) {
 873                                 out.add(s);
 874                         }
 875
 876                 }
 877                 return out;
 878         }
 879
 880
 881         private void addDeletion(Statement s) {
 882                 if (!changes1Set.contains(s)) {
 883                         changes1Set.add(s);
 884                         changes1.add(s);
 885                 }
 886         }
 887
 888         private void addAddition(Statement s) {
 889                 if (!changes2Set.contains(s)) {
 890                         changes2Set.add(s);
 891                         changes2.add(s);
 892                 }
 893         }
 894
 895         private void addModification(Resource sub1, Statement s1, Resource sub2, Statement s2) {
 896                 Modification mod = new Modification(sub1, sub2, s1, s2);
 897                 if (!modificationsSet.contains(mod)) {
 898                         modificationsSet.add(mod);
 899                         modifications.add(mod);
 900                 }
 901         }
 902
 903         public void sortStatement(List<Statement> list1, List<Statement> list2) {
 904                 sortStatement(list1, list2, scomp);
 905         }
 906
 907         public void sortStatement(List<Statement> list1, List<Statement> list2, Comparator<Statement> scomp) {
 908                 Collections.sort(list1,scomp);
 909                 Collections.sort(list2,scomp);
 910
 911                 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());
 912                 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());
 913                 sorted1.addAll(list1);
 914                 sorted2.addAll(list2);
 915
 916                 int ss1 = 0;
 917                 int ss2 = 0;
 918                 for (int i = 0; i < list1.size(); ) {
 919                         Statement s1 = list1.get(i);
 920                         int same1 = sameRel(list1, i);
 921                         for (int j = 0; j < list2.size(); j++) {
 922                                 Statement s2 = list2.get(j);
 923                                 if (scomp.compare(s1, s2) == 0) {
 924                                         int same2 = sameRel(list2, j);
 925                                         copy(sorted1,ss1,list1,i,same1);
 926                                         ss1 += same1;
 927                                         copy(sorted2,ss2,list2,j,same2);
 928                                         ss2 += same2;
 929                                         break;
 930                                 }
 931                         }
 932                         i+= same1;
 933                 }
 934                 if (ss1 < sorted1.size()) {
 935                         for (Statement s : list1) {
 936                                 if (!sorted1.contains(s)) {
 937                                         sorted1.set(ss1,s);
 938                                         ss1++;
 939                                 }
 940                         }
 941                 }
 942                 if (ss2 < sorted2.size()) {
 943                         for (Statement s : list2) {
 944                                 if (!sorted2.contains(s)) {
 945                                         sorted2.set(ss2,s);
 946                                         ss2++;
 947                                 }
 948                         }
 949                 }
 950
 951                 list1.clear();
 952                 list2.clear();
 953                 list1.addAll(sorted1);
 954                 list2.addAll(sorted2);
 955         }
 956
 957         public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {
 958                 for (int i = 0; i <  amount; i++) {
 959                         to.set(toIndex + i, from.get(fromIndex+ i));
 960                 }
 961         }
 962
 963         public void sortResource(List<Resource> list1, List<Resource> list2) {
 964                 Collections.sort(list1,rcomp);
 965                 int js = 0;
 966                 for (int i = 0; i < list1.size(); i++) {
 967                         Resource s1 = list1.get(i);
 968                         for (int j = js; j < list2.size(); j++) {
 969                                 Resource s2 = list2.get(j);
 970                                 if (rcomp.compare(s1, s2) == 0) {
 971                                         Resource t = list2.get(js);
 972                                         list2.set(js, s2);
 973                                         list2.set(j, t);
 974                                         break;
 975                                 }
 976                         }
 977                         js++;
 978                 }
 979         }
 980
 981         private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {
 982                 sortStatement(ss1, ss2);
 983
 984                 int i1 = 0;
 985                 int i2 = 0;
 986
 987                 while (true) {
 988                         if (i1 >= ss1.size()) {
 989                                 if (i2 >= ss2.size()) {
 990                                         break;
 991                                 } else {
 992                                         while (i2 < ss2.size()) {
 993                                                 if (DEBUG) System.out.println("Compare Statements addition " + printStatement(g,ss2.get(i2)));
 994
 995                                                 addAddition(ss2.get(i2));
 996                                                 i2++;
 997                                         }
 998                                         break;
 999                                 }
1000                         } else if (i2 >= ss2.size()) {
1001                                 while (i1 < ss1.size()) {
1002                                         if (DEBUG) System.out.println("Compare Statements deletion " + printStatement(g,ss1.get(i1)));
1003                                         addDeletion(ss1.get(i1));
1004                                         i1++;
1005                                 }
1006                                 break;
1007                         }
1008                         int same1 = sameRel(ss1, i1);
1009                         int same2 = sameRel(ss2, i2);
1010                         int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());
1011                         if (c == 0) {
1012                                 compareStatements(ss1, i1, same1, ss2, i2, same2,objectsLeft,objectsRight,unreliableLeft,unreliableRight);
1013                                 i1+=same1;
1014                                 i2+=same2;
1015                         } else if (c < 0) {
1016                                 for (int i = 0; i < same1; i++) {
1017                                         if (DEBUG) System.out.println("Compare Statements deletion " + printStatement(g,ss1.get(i+i1)));
1018                                         addDeletion(ss1.get(i+i1));
1019                                 }
1020                                 i1 += same1;
1021                         } else {
1022                                 for (int i = 0; i < same2; i++) {
1023                                         if (DEBUG) System.out.println("Compare Statements addition " + printStatement(g,ss2.get(i+i2)));
1024                                         addAddition(ss2.get(i+i2));
1025                                 }
1026
1027                                 i2 += same2;
1028                         }
1029                 }
1030         }
1031
1032
1033
1034         private int sameRel(List<Statement> statements, int off) {
1035                 if (statements.size() <= off)
1036                         return 0;
1037                 int same = 1;
1038                 long id = statements.get(off).getPredicate().getResourceId();
1039                 for (int i = off+1; i <statements.size(); i++) {
1040                         if (statements.get(i).getPredicate().getResourceId() == id)
1041                                 same++;
1042                         else
1043                                 break;
1044                 }
1045                 return same;
1046
1047         }
1048
1049         private int compareObject(Resource o1, Resource o2) throws DatabaseException {
1050                 if (o1.equals(o2))
1051                         return -1;
1052                 if (comparableResources.contains(o1, o2))
1053                         return (-1);
1054                 if (comparableResources.containsLeft(o1))
1055                         return Integer.MAX_VALUE;
1056                 if (comparableResources.containsRight(o2))
1057                         return Integer.MAX_VALUE;
1058                 if (nonMatchedLeft.contains(o1))
1059                         return Integer.MAX_VALUE;
1060                 if (nonMatchedRight.contains(o2))
1061                         return Integer.MAX_VALUE;
1062                 return comparator.compare(g, o1, o2);
1063         }
1064
1065         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 {
1066                 boolean[] used1 = new boolean[len1];
1067                 for (int i = 0; i < used1.length; i++) {
1068                         used1[i] = false;
1069                 }
1070
1071                 boolean[] used2 = new boolean[len2];
1072                 for (int i = 0; i < used2.length; i++) {
1073                         used2[i] = false;
1074                 }
1075
1076                 // left, right, difference
1077                 List<List<Integer>> differences = new ArrayList<List<Integer>>();
1078                 for (int i1 = off1; i1 < off1 + len1; i1++) {
1079                         Statement s1 = ss1.get(i1);
1080                         List<Integer> diff = new ArrayList<Integer>();
1081                         for (int i2 = off2; i2 < off2 + len2; i2++) {
1082                                 Statement s2 = ss2.get(i2);
1083                                 int d = compareObject(s1.getObject(), s2.getObject());
1084                                 if (d == 0) {
1085                                         for (Resource t : strong) {
1086                                                  if (s1.getPredicate().equals(t) || g.isSubrelationOf(s1.getPredicate(), t)) {
1087                                                          d = 1;
1088                                                          break;
1089                                                  }
1090                                         }
1091                                 }
1092                                 diff.add(d);
1093                         }
1094                         differences.add(diff);
1095                 }
1096                 // difference, left
1097                 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();
1098                 for (int i = 0; i < differences.size(); i++) {
1099                         List<Integer> list = differences.get(i);
1100                         for (int j = 0; j < list.size(); j++) {
1101                                 priorities.add(list.get(j), i);
1102                         }
1103                 }
1104
1105                 Integer[] pris = priorities.getKeys(new Integer[]{});
1106                 Arrays.sort(pris);
1107
1108                 for (Integer pri : pris) {
1109                         if (pri == Integer.MAX_VALUE) {
1110
1111                         } else if (pri == 0) {
1112
1113                         } else {
1114                                 List<Integer> i1s = priorities.getValues(pri);
1115                                 for (Integer i1 : i1s) {
1116                                         if (used1[i1])
1117                                                 continue;
1118                                         List<Integer> i2diff = differences.get(i1);
1119                                         for (int i2 = 0; i2 < i2diff.size(); i2++) {
1120                                                 if (i2diff.get(i2) == pri) {
1121                                                         if (used2[i2])
1122                                                                 continue;
1123                                                         used1[i1] = true;
1124                                                         used2[i2] = true;
1125                                                         Statement s1  = ss1.get(i1+off1);
1126                                                         Statement s2  = ss2.get(i2+off2);
1127
1128                                                         if (objectsLeft != null) {
1129                                                                 objectsLeft.add(s1.getObject());
1130                                                                 objectsRight.add(s2.getObject());
1131                                                         }
1132                                                         addComparable(s1, s2);
1133                                                         break;
1134                                                 }
1135                                         }
1136                                 }
1137                         }
1138                 }
1139
1140                 for (Integer pri : pris) {
1141                         if (pri != 0)
1142                                 continue;
1143                         Set<Statement> s1s = new HashSet<Statement>();
1144                         Set<Statement> s2s = new HashSet<Statement>();
1145                         Set<Integer> s1i = new HashSet<Integer>();
1146                         Set<Integer> s2i = new HashSet<Integer>();
1147                         List<Integer> i1s = priorities.getValues(pri);
1148                         for (Integer i1 : i1s) {
1149                                 if (used1[i1])
1150                                         continue;
1151                                 List<Integer> i2diff = differences.get(i1);
1152                                 for (int i2 = 0; i2 < i2diff.size(); i2++) {
1153                                         if (i2diff.get(i2) == pri) {
1154                                                 if (used2[i2])
1155                                                         continue;
1156                                                 Statement s1  = ss1.get(i1+off1);
1157                                                 Statement s2  = ss2.get(i2+off2);
1158                                                 s1s.add(s1);
1159                                                 s2s.add(s2);
1160                                                 s1i.add(i1);
1161                                                 s2i.add(i2);
1162                                         }
1163                                 }
1164                         }
1165                         if (unreliableLeft != null) {
1166                                 unreliableLeft.addAll(s1s);
1167                                 unreliableRight.addAll(s2s);
1168                         }
1169                         for (Integer i : s1i)
1170                                 used1[i] = true;
1171                         for (Integer i : s2i)
1172                                 used2[i] = true;
1173
1174                 }
1175                 for (int i1 = off1; i1 < off1 + len1; i1++) {
1176                         if (!used1[i1-off1]) {
1177                                 if (DEBUG) System.out.println("Compare Object deletion " + printStatement(g,ss1.get(i1)));
1178                                 addDeletion(ss1.get(i1));
1179                         }
1180                 }
1181                 for (int i2 = off2; i2 < off2 + len2; i2++) {
1182                         if (!used2[i2-off2]) {
1183                                 if (DEBUG) System.out.println("Compare Object addition " + printStatement(g,ss2.get(i2)));
1184                                 addAddition(ss2.get(i2));
1185                         }
1186                 }
1187         }
1188
1189
1190
1191         /**
1192          * compares properties, assumes functional relations
1193          * @param r1
1194          * @param r2
1195          * @throws ServiceException
1196          * @throws DoesNotContainValueException
1197          * @throws ValidationException
1198          */
1199         private void compareProps(Resource r1, Resource r2) throws DatabaseException {
1200                 if (DEBUG) System.out.println("compareProps " + r1 + " " + NameUtils.getSafeName(g, r1) + " " + r2 + " " + NameUtils.getSafeName(g, r2));
1201                 List<Statement> ss1 = new ArrayList<Statement>();
1202                 List<Statement> ss2 = new ArrayList<Statement>();
1203                 ss1.addAll(g.getStatements(r1, b.HasProperty));
1204                 ss2.addAll(g.getStatements(r2, b.HasProperty));
1205                 ss1 = filterNonTested(ss1);
1206                 ss2 = filterNonTested(ss2);
1207                 sortStatement(ss1, ss2);
1208                 // getStatements(r1, b.HasProperty) returns both instance and asserted statements for the same property relation.
1209                 ss1 = filterAssertedDuplicates(r1, ss1);
1210                 ss2 = filterAssertedDuplicates(r2, ss2);
1211
1212                 int i1 = 0;
1213                 int i2 = 0;
1214
1215                 while (true) {
1216                         if (i1 >= ss1.size()) {
1217                                 if (i2 >= ss2.size())
1218                                         break;
1219                                 else {
1220                                         while (i2 < ss2.size()) {
1221                                                 Statement s = ss2.get(i2);
1222                                                 if (DEBUG) System.out.println("Compare Prop diff2 " + printStatement(g,s));
1223                                                 if (!s.isAsserted(r2))
1224                                                         addAddition(s);
1225                                                 i2++;
1226                                         }
1227                                         break;
1228                                 }
1229                         } else if (i2 >= ss2.size()) {
1230                                 while (i1 < ss1.size()) {
1231                                         Statement s = ss1.get(i1);
1232                                         if (DEBUG) System.out.println("Compare Prop diff1 " + printStatement(g,s));
1233                                         if (!s.isAsserted(r1))
1234                                                 addDeletion(s);
1235                                         i1++;
1236                                 }
1237                                 break;
1238                         }
1239                         Statement s1 = ss1.get(i1);
1240                         Statement s2 = ss2.get(i2);
1241                         if (s1.isAsserted(r1) && s2.isAsserted(r2)) {
1242                                 i1++;
1243                                 i2++;
1244                                 continue;
1245                         }
1246                         int c = scomp.compare(s1, s2);
1247                         switch (c) {
1248                                 case 0:{
1249                                         boolean b1 = g.hasValue(s1.getObject());
1250                                         boolean b2 = g.hasValue(s2.getObject());
1251                                         if (b1 == b2) {
1252                                                 if (b1) {
1253 //                                                      Object v1 = g.getValue(s1.getObject());
1254 //                                                      Object v2 = g.getValue(s2.getObject());
1255 //                                                      boolean eq = compareValue(v1, v2);
1256                                                         boolean eq = compareValue(g,b,s1.getObject(), s2.getObject());
1257                                                         if (!eq) {
1258                                                                 addModification(r1,s1,r2,s2);
1259                                                                 if (!s1.isAsserted(r1) && !s2.isAsserted(r2))
1260                                                                         addComparable(s1, s2);
1261                                                         }
1262                                                 } else {
1263                                                         if (!s1.getObject().equals(s1.getSubject()) && !s2.getObject().equals(s2.getSubject()))
1264                                                                 compareProps(s1.getObject(), s2.getObject());
1265                                                 }
1266                                         } else {
1267                                                 addModification(r1,s1,r2,s2);
1268                                                 if (!s1.isAsserted(r1) && !s2.isAsserted(r2))
1269                                                         addComparable(s1, s2);
1270                                         }
1271                                         i1++;
1272                                         i2++;
1273                                         break;
1274                                 }
1275                                 case -1:{
1276                                         if (DEBUG) System.out.println("Compare Prop diff1s " + printStatement(g,s1));
1277                                         addDeletion(s1);
1278                                         i1++;
1279                                         break;
1280                                 }
1281
1282                                 case 1:{
1283                                         if (DEBUG) System.out.println("Compare Prop diff2s " + printStatement(g,s2));
1284                                         addAddition(s2);
1285                                         i2++;
1286                                         break;
1287                                 }
1288                         }
1289
1290                 }
1291
1292                 ss1.clear();
1293                 ss2.clear();
1294
1295         }
1296
1297         public static boolean compareValue(ReadGraph g, Layer0 b, Resource r1, Resource r2) throws DatabaseException {
1298                 Resource t1 = g.getSingleType(r1);
1299                 Resource t2 = g.getSingleType(r2);
1300                 if (!t1.equals(t2))
1301                         return false;
1302                 if (t1.equals(b.Integer)) {
1303                         int v1 = g.getValue(r1, Bindings.INTEGER);
1304                         int v2 = g.getValue(r2, Bindings.INTEGER);
1305                         return v1 == v2;
1306                 } else if (t1.equals(b.Float)) {
1307                         float v1 = g.getValue(r1, Bindings.FLOAT);
1308                         float v2 = g.getValue(r2, Bindings.FLOAT);
1309                         return v1 == v2;
1310                 } else if (t1.equals(b.Double)) {
1311                         double v1 = g.getValue(r1, Bindings.DOUBLE);
1312                         double v2 = g.getValue(r2, Bindings.DOUBLE);
1313                         return v1 == v2;
1314                 } else if (t1.equals(b.String)) {
1315                         String v1 = g.getValue(r1, Bindings.STRING);
1316                         String v2 = g.getValue(r2, Bindings.STRING);
1317                         return v1.equals(v2);
1318                 } else if (t1.equals(b.Boolean)) {
1319                         boolean v1 = g.getValue(r1, Bindings.BOOLEAN);
1320                         boolean v2 = g.getValue(r2, Bindings.BOOLEAN);
1321                         return v1 == v2;
1322                 } else if (t1.equals(b.Byte)) {
1323                         byte v1 = g.getValue(r1, Bindings.BYTE);
1324                         byte v2 = g.getValue(r2, Bindings.BYTE);
1325                         return v1 == v2;
1326                 } else if (t1.equals(b.Long)) {
1327                         long v1 = g.getValue(r1, Bindings.LONG);
1328                         long v2 = g.getValue(r2, Bindings.LONG);
1329                         return v1 == v2;
1330                 } else if (t1.equals(b.IntegerArray)) {
1331                         int[] v1 = g.getValue(r1, Bindings.INT_ARRAY);
1332                         int[] v2 = g.getValue(r2, Bindings.INT_ARRAY);
1333                         return Arrays.equals(v1,v2);
1334                 } else if (t1.equals(b.FloatArray)) {
1335                         float[] v1 = g.getValue(r1, Bindings.FLOAT_ARRAY);
1336                         float[] v2 = g.getValue(r2, Bindings.FLOAT_ARRAY);
1337                         return Arrays.equals(v1,v2);
1338                 } else if (t1.equals(b.DoubleArray)) {
1339                         double[] v1 = g.getValue(r1, Bindings.DOUBLE_ARRAY);
1340                         double[] v2 = g.getValue(r2, Bindings.DOUBLE_ARRAY);
1341                         return Arrays.equals(v1,v2);
1342                 } else if (t1.equals(b.StringArray)) {
1343                         String[] v1 = g.getValue(r1, Bindings.STRING_ARRAY);
1344                         String[] v2 = g.getValue(r2, Bindings.STRING_ARRAY);
1345                         return Arrays.equals(v1,v2);
1346                 } else if (t1.equals(b.BooleanArray)) {
1347                         boolean[] v1 = g.getValue(r1, Bindings.BOOLEAN_ARRAY);
1348                         boolean[] v2 = g.getValue(r2, Bindings.BOOLEAN_ARRAY);
1349                         return Arrays.equals(v1,v2);
1350                 } else if (t1.equals(b.ByteArray)) {
1351                         byte[] v1 = g.getValue(r1, Bindings.BYTE_ARRAY);
1352                         byte[] v2 = g.getValue(r2, Bindings.BYTE_ARRAY);
1353                         return Arrays.equals(v1,v2);
1354                 } else if (t1.equals(b.LongArray)) {
1355                         long[] v1 = g.getValue(r1, Bindings.LONG_ARRAY);
1356                         long[] v2 = g.getValue(r2, Bindings.LONG_ARRAY);
1357                         return Arrays.equals(v1,v2);
1358                 } else {
1359                         Object v1 = g.getValue(r1);
1360                         Object v2 = g.getValue(r2);
1361                         return compareValue(v1, v2);
1362                 }
1363
1364         }
1365
1366         public static boolean compareValue(Object v1, Object v2) {
1367                 if (v1 instanceof Object[] && v2 instanceof Object[])
1368                         return Arrays.deepEquals((Object[])v1, (Object[])v2);
1369                 else if (v1 instanceof int[] && v2 instanceof int[])
1370                         return Arrays.equals((int[])v1, (int[])v2);
1371                 else if (v1 instanceof float[] && v2 instanceof float[])
1372                         return Arrays.equals((float[])v1, (float[])v2);
1373                 else if (v1 instanceof double[] && v2 instanceof double[])
1374                         return Arrays.equals((double[])v1, (double[])v2);
1375                 else if (v1 instanceof long[] && v2 instanceof long[])
1376                         return  Arrays.equals((long[])v1, (long[])v2);
1377                 else if (v1 instanceof byte[] && v2 instanceof byte[])
1378                         return Arrays.equals((byte[])v1, (byte[])v2);
1379                 else if (v1 instanceof boolean[] && v2 instanceof boolean[])
1380                         return Arrays.equals((boolean[])v1, (boolean[])v2);
1381                 else
1382                         return v1.equals(v2);
1383         }
1384
1385
1386         public class PredicateComparator implements Comparator<Statement> {
1387                 @Override
1388                 public int compare(Statement o1, Statement o2) {
1389                         if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))
1390                                 return 0;
1391                         if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
1392                                 return -1;
1393                         if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
1394                                 return 1;
1395                         return 0;
1396                 }
1397         }
1398
1399         public class SubjectComparator implements Comparator<Statement> {
1400                 @Override
1401                 public int compare(Statement o1, Statement o2) {
1402                         if (comparableResources.contains(o1.getSubject(), o2.getSubject()))
1403                                 return 0;
1404                         if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
1405                                 return -1;
1406                         if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
1407                                 return 1;
1408                         return 0;
1409                 }
1410         }
1411
1412         public class ObjectComparator implements Comparator<Statement> {
1413                 @Override
1414                 public int compare(Statement o1, Statement o2) {
1415                         if (comparableResources.contains(o1.getObject(), o2.getObject()))
1416                                 return 0;
1417                         if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
1418                                 return -1;
1419                         if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
1420                                 return 1;
1421                         return 0;
1422                 }
1423         }
1424
1425         public static class FullStatementComparator implements Comparator<Statement> {
1426                 @Override
1427                 public int compare(Statement o1, Statement o2) {
1428                         if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())
1429                                 return -1;
1430                         if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())
1431                                 return 1;
1432                         if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())
1433                                 return -1;
1434                         if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())
1435                                 return 1;
1436                         if (o1.getObject().getResourceId() < o2.getObject().getResourceId())
1437                                 return -1;
1438                         if (o1.getObject().getResourceId() > o2.getObject().getResourceId())
1439                                 return 1;
1440                         return 0;
1441                 }
1442         }
1443
1444         public class ResComparator implements Comparator<Resource> {
1445                 @Override
1446                 public int compare(Resource o1, Resource o2) {
1447                         if (comparableResources.contains(o1, o2))
1448                                 return 0;
1449                         if (o1.getResourceId() < o2.getResourceId())
1450                                 return -1;
1451                         if (o1.getResourceId() > o2.getResourceId())
1452                                 return 1;
1453                         return 0;
1454                 }
1455         }
1456
1457 }