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

   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
   8  *\r
   9  * Contributors:\r
  10  *     Foster Wheeler Energia Oy - initial API and implementation\r
  11  *******************************************************************************/\r
  12 package org.simantics.interop.test;\r
  13 \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
  25 \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
  41 \r
  42 /**\r
  43  * Compares two subgraphs and reports differences.\r
  44  * \r
  45  * Assumes that subgraphs (defined using traverse relations) are not cyclic.\r
  46  * \r
  47  * Assumes that properties can be used to identify objects, if relation type is not enough.\r
  48  * \r
  49  * \r
  50  * \r
  51  * @author Marko Luukkainen <marko.luukkainen@vtt.fi>\r
  52  *\r
  53  */\r
  54 public class GraphComparator {\r
  55 \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
  63         \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
  70 \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
  74         \r
  75         private ResourceComparator comparator;\r
  76         \r
  77         private Comparator<Statement> scomp = new PredicateComparator();\r
  78         private Comparator<Resource> rcomp = new ResComparator();\r
  79         \r
  80         // runtime attributes\r
  81         \r
  82         private ReadGraph g;\r
  83         private Layer0 b;\r
  84         \r
  85         public GraphComparator(Resource r1, Resource r2) {\r
  86                 this.r1 = r1;\r
  87                 this.r2 = r2;\r
  88                 comparator = new TypeComparator();\r
  89         }\r
  90         \r
  91         public GraphComparator(Resource r1, Resource r2, ResourceComparator comparator) {\r
  92                 this.r1 = r1;\r
  93                 this.r2 = r2;\r
  94                 this.comparator = comparator;\r
  95         }\r
  96         \r
  97         ArrayList<Statement> ss1 = new ArrayList<Statement>();\r
  98         ArrayList<Statement> ss2 = new ArrayList<Statement>();\r
  99         \r
 100         \r
 101         public Comparator<Resource> getResourceComparator() {\r
 102                 return rcomp;\r
 103         }\r
 104         \r
 105         public Comparator<Statement> getStatementComparator() {\r
 106                 return scomp;\r
 107         }\r
 108         \r
 109         public Resource getR1() {\r
 110                 return r1;\r
 111         }\r
 112         \r
 113         public Resource getR2() {\r
 114                 return r2;\r
 115         }\r
 116         \r
 117         public void addTraversed(Resource rel) {\r
 118                 traversed.add(rel);\r
 119         }\r
 120         \r
 121         public void addTraversed(Collection<Resource> rels) {\r
 122                 traversed.addAll(rels);\r
 123         }\r
 124         \r
 125         public void addNonTraversed(Resource rel) {\r
 126                 nonTraversed.add(rel);\r
 127         }\r
 128         \r
 129         public void addNonTraversed(Collection<Resource> rels) {\r
 130                 nonTraversed.addAll(rels);\r
 131         }\r
 132         \r
 133         public void addTested(Resource rel) {\r
 134                 tested.add(rel);\r
 135         }\r
 136         \r
 137         public void addTested(Collection<Resource> rels) {\r
 138                 tested.addAll(rels);\r
 139         }\r
 140         \r
 141         public void addNonTested(Resource rel) {\r
 142                 nonTested.add(rel);\r
 143         }\r
 144         \r
 145         public void addNonTested(Collection<Resource> rels) {\r
 146                 nonTested.addAll(rels);\r
 147         }\r
 148         \r
 149         public void addComparableResources(Resource r1, Resource r2) {\r
 150                 comparableResources.map(r1, r2);\r
 151         }\r
 152         \r
 153         public void addComparableResources(BijectionMap<Resource, Resource> matching) {\r
 154                 comparableResources.addAll(matching);\r
 155         }\r
 156         \r
 157         public void addStrong(Resource r) {\r
 158                 strong.add(r);\r
 159         }\r
 160         \r
 161         public void addStrong(Collection<Resource> rels) {\r
 162                 strong.addAll(rels);\r
 163         }\r
 164         \r
 165         \r
 166         public void test(ReadGraph g) throws DatabaseException {\r
 167                 this.g = g;\r
 168                 this.b = Layer0.getInstance(g);\r
 169                 comparator.setComparator(this);\r
 170                 \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
 175                 \r
 176                 Set<Statement> unreliableLeft = new HashSet<Statement>();\r
 177                 Set<Statement> unreliableRight = new HashSet<Statement>();\r
 178                 \r
 179                 while (true) {\r
 180                         if (objectsLeft.isEmpty())\r
 181                                 break;\r
 182                         \r
 183                         \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
 194                         }\r
 195                         \r
 196                 }\r
 197                 for (Statement s : unreliableLeft) {\r
 198                         if (!comparableStatements.containsLeft(s))\r
 199                                 addDeletion(s);\r
 200                 }\r
 201                 for (Statement s : unreliableRight) {\r
 202                         if (!comparableStatements.containsRight(s))\r
 203                                 addAddition(s);\r
 204                 }\r
 205                 \r
 206                 \r
 207         }\r
 208         \r
 209         public void test(Session session) throws DatabaseException {\r
 210                 \r
 211                 comparator.setComparator(this);\r
 212                 \r
 213                 final Stack<Resource> objectsLeft = new Stack<Resource>();\r
 214                 final Stack<Resource> objectsRight = new Stack<Resource>();\r
 215                 objectsLeft.push(r1);\r
 216                 objectsRight.push(r2);\r
 217                 \r
 218                 final Set<Statement> unreliableLeft = new HashSet<Statement>();\r
 219                 final Set<Statement> unreliableRight = new HashSet<Statement>();\r
 220                 \r
 221                 while (true) {\r
 222                         if (objectsLeft.isEmpty())\r
 223                                 break;\r
 224                         session.syncRequest(new ReadRequest() {\r
 225                                 \r
 226                                 @Override\r
 227                                 public void run(ReadGraph graph) throws DatabaseException {\r
 228                                         g = graph;\r
 229                                         b = Layer0.getInstance(graph);\r
 230                                         // process compares objects that are identified and searches for more resources to process. \r
 231                                         process(objectsLeft, objectsRight, unreliableLeft, unreliableRight);\r
 232                                         // process unreliable handles cases where unidentified statements subject and object have been identified \r
 233                                         processUnreliable(unreliableLeft, unreliableRight);\r
 234                                         // process unreliable handles cases where unidentified resources have path of length one to identified resource\r
 235                                         processUnreliable(unreliableLeft, unreliableRight,objectsLeft,objectsRight);\r
 236                                         if (objectsLeft.isEmpty() && unreliableLeft.size() > 0 && unreliableRight.size() > 0) {\r
 237                                                 // comparison is ending, but we have still unprocessed unidentified resources left.\r
 238                                                 // These cases have longer path than one to identified objects.\r
 239                                                 processUnreliableDeep(unreliableLeft, unreliableRight, objectsLeft, objectsRight);\r
 240                                         }\r
 241                                 }\r
 242                         });\r
 243                         \r
 244                         \r
 245                         \r
 246                 }\r
 247                 for (Statement s : unreliableLeft) {\r
 248                         if (!comparableStatements.containsLeft(s))\r
 249                                 addDeletion(s);\r
 250                 }\r
 251                 for (Statement s : unreliableRight) {\r
 252                         if (!comparableStatements.containsRight(s))\r
 253                                 addAddition(s);\r
 254                 }\r
 255                 \r
 256                 \r
 257         }\r
 258         \r
 259         private void process(Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Set<Statement> unreliableLeft, Set<Statement> unreliableRight) throws DatabaseException {\r
 260                 List<Statement> ss1 = new ArrayList<Statement>();\r
 261                 List<Statement> ss2 = new ArrayList<Statement>();\r
 262                 \r
 263                 while (!objectsLeft.isEmpty()) {\r
 264                         Resource r1 = objectsLeft.pop();\r
 265                         Resource r2 = objectsRight.pop();\r
 266                         \r
 267                         if (r1.equals(r2))\r
 268                                 continue;\r
 269                         \r
 270                         if (processedResources.contains(r1))\r
 271                                 continue;\r
 272                         processedResources.add(r1);\r
 273                         \r
 274                 \r
 275                         if(!comparableResources.contains(r1, r2) && (comparableResources.containsLeft(r1)||comparableResources.containsRight(r2))) {\r
 276                                 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
 277                         }\r
 278                         \r
 279                         //System.out.println("test " + NameUtils.getSafeName(g, r1) + " " + NameUtils.getSafeName(g, r2));\r
 280                         compareProps(r1, r2);\r
 281                         \r
 282                         for (Resource rel : tested) {\r
 283                                 ss1.addAll(g.getStatements(r1, rel));\r
 284                                 ss2.addAll(g.getStatements(r2, rel));\r
 285                                 ss1 = filterAsserted(r1, ss1);\r
 286                                 ss2 = filterAsserted(r2, ss2);\r
 287                                 ss1 = filterTraversed(ss1);\r
 288                                 ss2 = filterTraversed(ss2);\r
 289                                 ss1 = filterNonTested(ss1);\r
 290                                 ss2 = filterNonTested(ss2);\r
 291                                 \r
 292                                 compareStatements(ss1, ss2, null, null,null,null);\r
 293                                 ss1.clear();\r
 294                                 ss2.clear();\r
 295                         }\r
 296                         \r
 297                         for (Resource rel : traversed) {\r
 298                                 ss1.addAll(g.getStatements(r1, rel));\r
 299                                 ss2.addAll(g.getStatements(r2, rel));\r
 300                                 ss1 = filterAsserted(r1, ss1);\r
 301                                 ss2 = filterAsserted(r2, ss2);\r
 302                                 compareStatements(ss1, ss2, objectsLeft, objectsRight,unreliableLeft,unreliableRight);\r
 303                                 ss1.clear();\r
 304                                 ss2.clear();\r
 305                                 \r
 306                         }\r
 307                 }\r
 308         }\r
 309         \r
 310         private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight) {\r
 311                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();\r
 312                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();\r
 313                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();\r
 314                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();\r
 315                 \r
 316                 for (Statement s : unreliableLeft) {\r
 317                         subjectLeft.add(s.getSubject(),s);\r
 318                         objectLeft.add(s.getObject(),s);\r
 319                 }\r
 320                 for (Statement s : unreliableRight) {\r
 321                         subjectRight.add(s.getSubject(),s);\r
 322                         objectRight.add(s.getObject(),s);\r
 323                 }\r
 324                 \r
 325                 for (Resource left : subjectLeft.getKeys()) {\r
 326                         if (!comparableResources.containsLeft(left))\r
 327                                 continue;\r
 328                         Resource right = comparableResources.getRight(left);\r
 329                         for (Statement leftS : subjectLeft.getValues(left)) {\r
 330                                 Resource leftO = leftS.getObject();\r
 331                                 if (!comparableResources.containsLeft(leftO)) \r
 332                                         continue;\r
 333                                 if (!unreliableLeft.contains(leftS))\r
 334                                         continue;\r
 335                                 Resource rightO = comparableResources.getRight(leftO);\r
 336                                 for (Statement rightS : subjectRight.getValues(right)) {\r
 337                                         if (!rightS.getObject().equals(rightO))\r
 338                                                 continue;\r
 339                                         if (!unreliableRight.contains(rightS))\r
 340                                                 continue;\r
 341                                         if (leftS.getPredicate().equals(rightS.getPredicate()) ||\r
 342                                                 comparableResources.contains(leftS.getPredicate(), rightS.getPredicate())) {\r
 343                                                 unreliableLeft.remove(leftS);\r
 344                                                 unreliableRight.remove(rightS);\r
 345                                                 comparableStatements.map(leftS, rightS);\r
 346                                         }\r
 347                                 }\r
 348                         }\r
 349                         \r
 350                 }\r
 351         }\r
 352         \r
 353         private void processUnreliable(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) {\r
 354                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();\r
 355                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();\r
 356                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();\r
 357                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();\r
 358                 \r
 359                 for (Statement s : unreliableLeft) {\r
 360                         subjectLeft.add(s.getSubject(),s);\r
 361                         objectLeft.add(s.getObject(),s);\r
 362                 }\r
 363                 for (Statement s : unreliableRight) {\r
 364                         subjectRight.add(s.getSubject(),s);\r
 365                         objectRight.add(s.getObject(),s);\r
 366                 }\r
 367                 \r
 368                 for (Resource ol : objectLeft.getKeys()) {\r
 369                         // all statements to the left side object\r
 370                         List<Statement> left = objectLeft.getValues(ol);\r
 371                         // all subjects that have statements to the left side object (ol)\r
 372                         Set<Resource> sLeft = new HashSet<Resource>();\r
 373                         // all matching subjects on the right side\r
 374                         Set<Resource> sRight = new HashSet<Resource>();\r
 375                         for (Statement s : left) {\r
 376                                 sLeft.add(s.getSubject());\r
 377                                 sRight.add(comparableResources.getRight(s.getSubject()));\r
 378                         }\r
 379                         \r
 380                         // check if object left can be reliably identified by available statements\r
 381                         // if there are any objects on the left side with similar statements, object left cannot be mapped.\r
 382                         boolean hasSimilar = false;\r
 383                         MapList<Resource, Statement> comparableOLeft = new MapList<Resource, Statement>();\r
 384                         for (Resource sl : sLeft) {\r
 385                                 for (Statement s : subjectLeft.getValues(sl)) {\r
 386                                         if (!s.getObject().equals(ol)) {\r
 387                                                 comparableOLeft.add(s.getObject(),s);\r
 388                                         }\r
 389                                 }\r
 390                         }\r
 391                         \r
 392                         for (Resource similarOl : comparableOLeft.getKeys()) {\r
 393                                 List<Statement> similarLeft = comparableOLeft.getValues(similarOl);\r
 394                                 if (similarLeft.size() == left.size()) {\r
 395                                         boolean useL[] = new boolean[left.size()];\r
 396                                         boolean useSL[] = new boolean[left.size()];\r
 397                                         for (int i = 0; i < left.size(); i++) {\r
 398                                                 useL[i] = false;\r
 399                                                 useSL[i] = false;\r
 400                                         }\r
 401                                         for (int i = 0; i < left.size(); i++) {\r
 402                                                 for (int j = 0; j < left.size(); j++) {\r
 403                                                         if (useSL[j])\r
 404                                                                 continue;\r
 405                                                         Resource pl = left.get(i).getPredicate();\r
 406                                                         Resource psl = similarLeft.get(j).getPredicate();\r
 407                                                         if (pl.equals(psl)) {\r
 408                                                                 useL[i] = true;\r
 409                                                                 useSL[j] = true;\r
 410                                                                 break;\r
 411                                                         }\r
 412                                                 }\r
 413                                         }\r
 414                                         boolean diff = false;\r
 415                                         for (int i = 0; i < left.size(); i++) {\r
 416                                                 if (!useL[i] || !useSL[i]) {\r
 417                                                         diff = true;\r
 418                                                 }\r
 419                                         }\r
 420                                         if (!diff) {\r
 421                                                 hasSimilar = true;\r
 422                                                 break;\r
 423                                         }\r
 424                                 }\r
 425                         }\r
 426                         \r
 427                         if (hasSimilar)\r
 428                                 continue;\r
 429                                 \r
 430                         \r
 431                         // all objects that subjects on the right side point to. Object left has its matching resource among these, if it has matching resource\r
 432                         MapList<Resource,Statement> possibleOR = new MapList<Resource, Statement>();\r
 433                         for (Resource sr : sRight) {\r
 434                                 for (Statement s : subjectRight.getValues(sr))\r
 435                                         possibleOR.add(s.getObject(),s);\r
 436                         }\r
 437                         \r
 438                         // filter possible right side objects to those that have same amount of statements as the left side object\r
 439                         for (Resource or : possibleOR.getKeys().toArray(new Resource[possibleOR.getKeys().size()])) {\r
 440                                 List<Statement> right = possibleOR.getValues(or);\r
 441                                 if (right.size() != left.size())\r
 442                                         possibleOR.remove(or);\r
 443                                         \r
 444                         }\r
 445                         \r
 446                         // check for matching statements (comparable subjects, matching predicates)\r
 447                         MapList<Resource,Statement> matchingOR = new MapList<Resource, Statement>(); // list of objects that have matching statements\r
 448                         Map<Resource,Pair<int[], int[]>> matchingStatements = new HashMap<Resource, Pair<int[], int[]>>(); // matching statements\r
 449                         for (Resource or : possibleOR.getKeys()) {\r
 450                                 List<Statement> right = possibleOR.getValues(or);\r
 451                                 int iLeft[] = new int[left.size()];\r
 452                                 int iRight[] = new int[right.size()];\r
 453                                 \r
 454                                 for (int i = 0; i < left.size(); i++) {\r
 455                                         iLeft[i] = -1;\r
 456                                         iRight[i] = -1;\r
 457                                 }\r
 458                                 \r
 459                                 for (int l = 0; l < left.size(); l++) {\r
 460                                         Statement ls = left.get(l);\r
 461                                         for (int r = 0; r < right.size(); r++) {\r
 462                                                 if (iRight[r] >= 0)\r
 463                                                         continue;\r
 464                                                 Statement rs = right.get(r);\r
 465                                                 if (!comparableResources.contains(ls.getSubject(), rs.getSubject()))\r
 466                                                         continue;\r
 467                                                 if (rcomp.compare(ls.getPredicate(),rs.getPredicate()) == 0) {\r
 468                                                         iLeft[l] = r;\r
 469                                                         iRight[r] = l;\r
 470                                                         break;\r
 471                                                 }\r
 472                                         }\r
 473                                         \r
 474                                 }\r
 475                                 boolean success = true;\r
 476                                 for (int i = 0; i < left.size(); i++) {\r
 477                                         if (iLeft[i] < 0) {\r
 478                                                 success = false;\r
 479                                                 break;\r
 480                                         }\r
 481                                         if (iRight[i] < 0) {\r
 482                                                 success = false;\r
 483                                                 break;\r
 484                                         }\r
 485                                                 \r
 486                                 }\r
 487                                 if (success) {\r
 488                                         for (Statement s : right) \r
 489                                                 matchingOR.add(or,s);\r
 490                                         matchingStatements.put(or, new Pair<int[], int[]>(iLeft, iRight));\r
 491                                 }\r
 492                         }\r
 493                         // if there is only one matching right side object, we have found a match \r
 494                         if (matchingOR.getKeySize() == 1) {\r
 495                                 Resource or = matchingOR.getKeys().iterator().next();\r
 496                                 List<Statement> right = matchingOR.getValues(or);\r
 497                                 Pair<int[], int[]> indices = matchingStatements.get(or);\r
 498                                 \r
 499                                 comparableResources.map(ol, or);\r
 500                                 objectsLeft.add(ol);\r
 501                                 objectsRight.add(or);\r
 502                                 for (int l = 0; l < left.size(); l++) {\r
 503                                         int r = indices.first[l];\r
 504                                         Statement sl = left.get(l);\r
 505                                         Statement sr = right.get(r);\r
 506                                         addComparable(sl, sr, true);\r
 507                                         unreliableLeft.remove(sl);\r
 508                                         unreliableRight.remove(sr);\r
 509                                 }\r
 510                                 \r
 511                         }\r
 512 \r
 513                 }\r
 514                 \r
 515                 \r
 516         }\r
 517         \r
 518         private void processUnreliableDeep(Set<Statement> unreliableLeft, Set<Statement> unreliableRight, Stack<Resource> objectsLeft, Stack<Resource> objectsRight) throws ManyObjectsForFunctionalRelationException, ServiceException {\r
 519                 MapList<Resource,Statement> subjectLeft = new MapList<Resource, Statement>();\r
 520                 MapList<Resource,Statement> subjectRight = new MapList<Resource, Statement>();\r
 521                 MapList<Resource,Statement> objectLeft = new MapList<Resource, Statement>();\r
 522                 MapList<Resource,Statement> objectRight = new MapList<Resource, Statement>();\r
 523                 \r
 524                 for (Statement s : unreliableLeft) {\r
 525                         subjectLeft.add(s.getSubject(),s);\r
 526                         objectLeft.add(s.getObject(),s);\r
 527                 }\r
 528                 for (Statement s : unreliableRight) {\r
 529                         subjectRight.add(s.getSubject(),s);\r
 530                         objectRight.add(s.getObject(),s);\r
 531                 }\r
 532                 for (Resource ol : objectLeft.getKeys()) {\r
 533                         Set<Path> pathsLeft = new HashSet<Path>();\r
 534                         for (Resource rel : traversed) {\r
 535                                 pathsLeft.addAll(Path.create(g.getStatements(ol, rel)));\r
 536                         }\r
 537                         while (true) {\r
 538                                 expand(pathsLeft);\r
 539                                 if (pathsLeft.size() == 0)\r
 540                                         break;\r
 541                                 Collection<Path> endPaths = new ArrayList<Path>(1);\r
 542                                 for (Path p : pathsLeft) {\r
 543                                         if (comparableResources.containsLeft(p.getEnd())) {\r
 544                                                 endPaths.add(p);\r
 545                                         }\r
 546                                 }\r
 547                                 if (endPaths.size() > 0) {\r
 548                                         pathsLeft.clear();\r
 549                                         pathsLeft.addAll(endPaths);\r
 550                                         break;\r
 551                                 }       \r
 552                         }\r
 553                         if (pathsLeft.size() > 0) {\r
 554                                 Resource sl = objectLeft.getValues(ol).get(0).getSubject();\r
 555                                 Resource sr = comparableResources.getRight(sl);\r
 556                                 Collection<Resource> possibleOR = new ArrayList<Resource>();\r
 557                                 for (Statement s : subjectRight.getValues(sr)) {\r
 558                                         possibleOR.add(s.getObject());\r
 559                                 }\r
 560                                 Map<Resource,Set<Path>> matchingPaths = new HashMap<Resource, Set<Path>>();\r
 561                                 for (Resource or : possibleOR) {\r
 562                                         Set<Path> possiblePathsRight = new HashSet<Path>();\r
 563                                         for (Path leftPath : pathsLeft) {\r
 564                                                 possiblePathsRight.addAll(findComparableRight(leftPath, or));\r
 565                                         }\r
 566                                         if (possiblePathsRight.size() == pathsLeft.size()) {\r
 567                                                 matchingPaths.put(or, possiblePathsRight);\r
 568                                         }\r
 569                                 }\r
 570                                 if (matchingPaths.size() > 0) {\r
 571                                         if (matchingPaths.size() == 1) {\r
 572                                                 Resource or = matchingPaths.keySet().iterator().next();\r
 573                                                 objectsLeft.add(ol);\r
 574                                                 objectsRight.add(or);\r
 575                                                 comparableResources.map(ol, or);\r
 576                                                 Collection<Statement> statementsLeft = objectLeft.getValues(ol);\r
 577                                                 Collection<Statement> statementsRight = objectRight.getValues(or);\r
 578                                                 unreliableLeft.removeAll(statementsLeft);\r
 579                                                 unreliableRight.removeAll(statementsRight);\r
 580                                                 System.out.println("Compare not implemented");\r
 581                                         } else {\r
 582                                                 System.out.println("Compare not implemented");\r
 583                                         }\r
 584                                 }\r
 585                         }\r
 586                         \r
 587                 }\r
 588                 \r
 589         }\r
 590         \r
 591         private void expand(Set<Path> paths) throws ManyObjectsForFunctionalRelationException, ServiceException {\r
 592                 Set<Path> stepPathsLeft = new HashSet<Path>();\r
 593                 if (paths.size() == 0)\r
 594                         return;\r
 595                 int length = paths.iterator().next().getLength() + 1;\r
 596                 for (Path p : paths) {\r
 597                         for (Resource rel : traversed) {\r
 598                                 stepPathsLeft.addAll(Path.expand(p,g.getStatements(p.getEnd(), rel)));\r
 599                         }\r
 600                 }\r
 601                 paths.clear();\r
 602                 for (Path p : stepPathsLeft) {\r
 603                         if (p.getLength() == length)\r
 604                                 paths.add(p);\r
 605                 }\r
 606         }\r
 607         \r
 608         private Collection<Path> findComparableRight(Path leftPath, Resource beginRight) throws ManyObjectsForFunctionalRelationException, ServiceException {\r
 609                 Set<Path> rightPaths = new HashSet<Path>();\r
 610                 rightPaths.addAll(Path.create(g.getStatements(beginRight, getRight(leftPath.getStatements().get(0).getPredicate()))));\r
 611                 for (int i = 1; i < leftPath.getLength(); i++) {\r
 612                         if (rightPaths.size() == 0)\r
 613                                 return rightPaths;\r
 614                         Set<Path> stepPaths = new HashSet<Path>();\r
 615                         for (Path p : rightPaths) {\r
 616                                 stepPaths.addAll(Path.expand(p, g.getStatements(p.getEnd(), getRight(leftPath.getStatements().get(i).getPredicate()))));\r
 617                         }\r
 618                         rightPaths.clear();\r
 619                         for (Path p : stepPaths)\r
 620                                 if (p.getLength() == i+1) \r
 621                                         rightPaths.add(p);\r
 622                 }\r
 623                 return rightPaths;\r
 624                 \r
 625         }\r
 626         \r
 627         private Resource getRight(Resource r) {\r
 628                 if (comparableResources.containsLeft(r))\r
 629                         return comparableResources.getRight(r);\r
 630                 return r;\r
 631         }\r
 632         \r
 633 \r
 634         \r
 635         public BijectionMap<Statement, Statement> getComparableStatements() {\r
 636                 return comparableStatements;\r
 637         }\r
 638         \r
 639         public GraphChanges getChanges() {\r
 640                 return new GraphChanges(r1,r2,changes1,changes2,modifications,comparableResources);\r
 641         }\r
 642         \r
 643         private void addComparable(Statement left, Statement right, boolean process) {\r
 644                 comparableStatements.map(left, right);\r
 645                 comparableResources.map(left.getObject(), right.getObject());\r
 646         }\r
 647         \r
 648         public List<Statement> filterAsserted(Resource r, Collection<Statement> in) throws ServiceException {\r
 649                 List<Statement> out = new ArrayList<Statement>();\r
 650                 for (Statement s : in) {\r
 651                         if (!s.isAsserted(r))\r
 652                                 out.add(s);\r
 653                         \r
 654                 }\r
 655                 return out;\r
 656         }\r
 657 \r
 658         private String printStatement(ReadGraph graph, Statement s) throws ValidationException, ServiceException {\r
 659                 return NameUtils.getSafeName(graph, s.getSubject()) + " " + NameUtils.getSafeName(graph, s.getPredicate()) + " " + NameUtils.getSafeName(graph, s.getObject());\r
 660         }\r
 661         \r
 662         private List<Statement> filterTraversed(List<Statement> in) throws ServiceException {\r
 663                 return filter(traversed, in);\r
 664         }\r
 665         \r
 666         private List<Statement> filterNonTested(List<Statement> in) throws ServiceException {\r
 667                 return filter(nonTested, in);\r
 668         }\r
 669         \r
 670         private List<Statement> filter(Collection<Resource> toFilter, List<Statement> in) throws ServiceException {\r
 671                 if (toFilter.size() == 0)\r
 672                         return in;\r
 673                 List<Statement> out = new ArrayList<Statement>();\r
 674                 for (Statement s : in) {\r
 675                         boolean usable = true;\r
 676                         for (Resource r : toFilter) {\r
 677                                 if (g.isSubrelationOf(s.getPredicate(),r)) {\r
 678                                         usable = false;\r
 679                                         break;\r
 680                                 }\r
 681                         }\r
 682                         if (usable) {\r
 683                                 out.add(s);\r
 684                         }\r
 685                         \r
 686                 }\r
 687                 return out;\r
 688         }\r
 689         \r
 690         \r
 691         private void addDeletion(Statement s) {\r
 692                 if (!changes1Set.contains(s)) {\r
 693                         changes1Set.add(s);\r
 694                         changes1.add(s);\r
 695                 }\r
 696         }\r
 697         \r
 698         private void addAddition(Statement s) {\r
 699                 if (!changes2Set.contains(s)) {\r
 700                         changes2Set.add(s);\r
 701                         changes2.add(s);\r
 702                 }\r
 703         }\r
 704         \r
 705         private void addModification(Statement s1, Statement s2) {\r
 706                 Pair<Statement, Statement> mod = new Pair<Statement, Statement>(s1,s2);\r
 707                 if (!modificationsSet.contains(mod)) {\r
 708                         modificationsSet.add(mod);\r
 709                         modifications.add(mod);\r
 710                 }\r
 711         }\r
 712         \r
 713         public void sortStatement(List<Statement> list1, List<Statement> list2) {\r
 714                 sortStatement(list1, list2, scomp);\r
 715         }\r
 716         \r
 717         public void sortStatement(List<Statement> list1, List<Statement> list2, Comparator<Statement> scomp) {\r
 718                 Collections.sort(list1,scomp);\r
 719                 Collections.sort(list2,scomp);\r
 720                 \r
 721                 List<Statement> sorted1 = new ArrayList<Statement>(list1.size());\r
 722                 List<Statement> sorted2 = new ArrayList<Statement>(list2.size());\r
 723                 sorted1.addAll(list1);\r
 724                 sorted2.addAll(list2);\r
 725                 \r
 726                 int ss1 = 0;\r
 727                 int ss2 = 0;\r
 728                 for (int i = 0; i < list1.size(); ) {\r
 729                         Statement s1 = list1.get(i);\r
 730                         int same1 = sameRel(list1, i);  \r
 731                         for (int j = 0; j < list2.size(); j++) {\r
 732                                 Statement s2 = list2.get(j);\r
 733                                 if (scomp.compare(s1, s2) == 0) {\r
 734                                         int same2 = sameRel(list2, j);\r
 735                                         copy(sorted1,ss1,list1,i,same1);\r
 736                                         ss1 += same1;\r
 737                                         copy(sorted2,ss2,list2,j,same2);\r
 738                                         ss2 += same2;\r
 739                                         break;\r
 740                                 }\r
 741                         }\r
 742                         i+= same1;\r
 743                 }\r
 744                 if (ss1 < sorted1.size()) {\r
 745                         for (Statement s : list1) {\r
 746                                 if (!sorted1.contains(s)) {\r
 747                                         sorted1.set(ss1,s);\r
 748                                         ss1++;\r
 749                                 }\r
 750                         }\r
 751                 }\r
 752                 if (ss2 < sorted2.size()) {\r
 753                         for (Statement s : list2) {\r
 754                                 if (!sorted2.contains(s)) {\r
 755                                         sorted2.set(ss2,s);\r
 756                                         ss2++;\r
 757                                 }\r
 758                         }\r
 759                 }\r
 760                 \r
 761                 list1.clear();\r
 762                 list2.clear();\r
 763                 list1.addAll(sorted1);\r
 764                 list2.addAll(sorted2);\r
 765         }\r
 766         \r
 767         public <T> void copy(List<T> to, int toIndex, List<T> from, int fromIndex, int amount) {\r
 768                 for (int i = 0; i <  amount; i++) {\r
 769                         to.set(toIndex + i, from.get(fromIndex+ i));\r
 770                 }\r
 771         }\r
 772         \r
 773         public void sortResource(List<Resource> list1, List<Resource> list2) {\r
 774                 Collections.sort(list1,rcomp);\r
 775                 int js = 0;\r
 776                 for (int i = 0; i < list1.size(); i++) {\r
 777                         Resource s1 = list1.get(i);\r
 778                         for (int j = js; j < list2.size(); j++) {\r
 779                                 Resource s2 = list2.get(j);\r
 780                                 if (rcomp.compare(s1, s2) == 0) {\r
 781                                         Resource t = list2.get(js);\r
 782                                         list2.set(js, s2);\r
 783                                         list2.set(j, t);\r
 784                                         break;\r
 785                                 }\r
 786                         }\r
 787                         js++;\r
 788                 }\r
 789         }\r
 790         \r
 791         private void compareStatements(List<Statement> ss1, List<Statement> ss2, Stack<Resource> objectsLeft, Stack<Resource> objectsRight, Collection<Statement> unreliableLeft, Collection<Statement> unreliableRight) throws DatabaseException {\r
 792                 sortStatement(ss1, ss2);\r
 793                 \r
 794                 int i1 = 0;\r
 795                 int i2 = 0;\r
 796                 \r
 797                 while (true) {\r
 798                         if (i1 >= ss1.size()) {\r
 799                                 if (i2 >= ss2.size()) {\r
 800                                         break;\r
 801                                 } else {\r
 802                                         while (i2 < ss2.size()) {\r
 803                                                 System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i2)));\r
 804                                                 \r
 805                                                 addAddition(ss2.get(i2));\r
 806                                                 i2++;\r
 807                                         }\r
 808                                         break;\r
 809                                 }\r
 810                         } else if (i2 >= ss2.size()) {\r
 811                                 while (i1 < ss1.size()) {\r
 812                                         System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i1)));\r
 813                                         addDeletion(ss1.get(i1));\r
 814                                         i1++;\r
 815                                 }\r
 816                                 break;\r
 817                         }\r
 818                         int same1 = sameRel(ss1, i1);\r
 819                         int same2 = sameRel(ss2, i2);\r
 820                         int c = rcomp.compare(ss1.get(i1).getPredicate(),ss2.get(i2).getPredicate());\r
 821                         if (c == 0) {\r
 822                                 compareStatements(ss1, i1, same1, ss2, i2, same2,objectsLeft,objectsRight,unreliableLeft,unreliableRight);\r
 823                                 i1+=same1;\r
 824                                 i2+=same2;\r
 825                         } else if (c < 0) {\r
 826                                 for (int i = 0; i < same1; i++) {\r
 827                                         System.out.println("Compare Statements diff1 " + printStatement(g,ss1.get(i+i1)));\r
 828                                         addDeletion(ss1.get(i+i1));\r
 829                                 }\r
 830                                 i1 += same1;\r
 831                         } else {\r
 832                                 for (int i = 0; i < same2; i++) {\r
 833                                         System.out.println("Compare Statements diff2 " + printStatement(g,ss2.get(i+i2)));\r
 834                                         addAddition(ss2.get(i+i2));\r
 835                                 }\r
 836                                 \r
 837                                 i2 += same2;\r
 838                         }\r
 839                 }\r
 840         }\r
 841         \r
 842 \r
 843         \r
 844         private int sameRel(List<Statement> statements, int off) {\r
 845                 if (statements.size() <= off)\r
 846                         return 0;\r
 847                 int same = 1;\r
 848                 long id = statements.get(off).getPredicate().getResourceId();\r
 849                 for (int i = off+1; i <statements.size(); i++) {\r
 850                         if (statements.get(i).getPredicate().getResourceId() == id)\r
 851                                 same++;\r
 852                         else \r
 853                                 break;\r
 854                 }\r
 855                 return same;\r
 856                 \r
 857         }\r
 858 \r
 859         private int compareObject(Resource o1, Resource o2) throws DatabaseException {\r
 860                 if (o1.equals(o2))\r
 861                         return -1;\r
 862                 if (comparableResources.contains(o1, o2))\r
 863                         return (-1);\r
 864                 if (comparableResources.containsLeft(o1))\r
 865                         return Integer.MAX_VALUE;\r
 866                 if (comparableResources.containsRight(o2))\r
 867                         return Integer.MAX_VALUE;\r
 868                 return comparator.compare(g, o1, o2);\r
 869         }\r
 870         \r
 871         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
 872                 boolean[] used1 = new boolean[len1];\r
 873                 for (int i = 0; i < used1.length; i++) {\r
 874                         used1[i] = false;\r
 875                 }\r
 876                 \r
 877                 boolean[] used2 = new boolean[len2];\r
 878                 for (int i = 0; i < used2.length; i++) {\r
 879                         used2[i] = false;\r
 880                 }\r
 881                 \r
 882                 // left, right, difference\r
 883                 List<List<Integer>> differences = new ArrayList<List<Integer>>();\r
 884                 for (int i1 = off1; i1 < off1 + len1; i1++) {\r
 885                         Statement s1 = ss1.get(i1);\r
 886                         List<Integer> diff = new ArrayList<Integer>();\r
 887                         for (int i2 = off2; i2 < off2 + len2; i2++) {\r
 888                                 Statement s2 = ss2.get(i2);\r
 889                                 int d = compareObject(s1.getObject(), s2.getObject());\r
 890                                 if (d == 0) {\r
 891                                         for (Resource t : strong) {\r
 892                                                  if (s1.getPredicate().equals(t) || g.isSubrelationOf(s1.getPredicate(), t)) {\r
 893                                                          d = 1;\r
 894                                                          break;\r
 895                                                  }\r
 896                                         }\r
 897                                 }\r
 898                                 diff.add(d);\r
 899                         }\r
 900                         differences.add(diff);\r
 901                 }\r
 902                 // difference, left\r
 903                 MapList<Integer, Integer> priorities = new MapList<Integer, Integer>();\r
 904                 for (int i = 0; i < differences.size(); i++) {\r
 905                         List<Integer> list = differences.get(i);\r
 906                         for (int j = 0; j < list.size(); j++) {\r
 907                                 priorities.add(list.get(j), i);\r
 908                         }\r
 909                 }\r
 910                 \r
 911                 Integer[] pris = priorities.getKeys(new Integer[]{});\r
 912                 Arrays.sort(pris);\r
 913                 \r
 914                 for (Integer pri : pris) {\r
 915                         if (pri == Integer.MAX_VALUE) {\r
 916 \r
 917                         } else if (pri == 0) {\r
 918                                 \r
 919                         } else {\r
 920                                 List<Integer> i1s = priorities.getValues(pri);\r
 921                                 for (Integer i1 : i1s) {\r
 922                                         if (used1[i1])\r
 923                                                 continue;\r
 924                                         List<Integer> i2diff = differences.get(i1);\r
 925                                         for (int i2 = 0; i2 < i2diff.size(); i2++) {\r
 926                                                 if (i2diff.get(i2) == pri) {\r
 927                                                         if (used2[i2])\r
 928                                                                 continue;\r
 929                                                         used1[i1] = true;\r
 930                                                         used2[i2] = true;\r
 931                                                         Statement s1  = ss1.get(i1+off1);\r
 932                                                         Statement s2  = ss2.get(i2+off2);\r
 933                                                         \r
 934                                                         if (objectsLeft != null) {\r
 935                                                                 objectsLeft.add(s1.getObject());\r
 936                                                                 objectsRight.add(s2.getObject());\r
 937                                                         } \r
 938                                                         addComparable(s1, s2, true);\r
 939                                                         break;\r
 940                                                 }\r
 941                                         }\r
 942                                 }\r
 943                         }\r
 944                 }\r
 945                 \r
 946                 for (Integer pri : pris) {\r
 947                         if (pri != 0)\r
 948                                 continue;\r
 949                         Set<Statement> s1s = new HashSet<Statement>();\r
 950                         Set<Statement> s2s = new HashSet<Statement>();\r
 951                         Set<Integer> s1i = new HashSet<Integer>();\r
 952                         Set<Integer> s2i = new HashSet<Integer>();\r
 953                         List<Integer> i1s = priorities.getValues(pri);\r
 954                         for (Integer i1 : i1s) {\r
 955                                 if (used1[i1])\r
 956                                         continue;\r
 957                                 List<Integer> i2diff = differences.get(i1);\r
 958                                 for (int i2 = 0; i2 < i2diff.size(); i2++) {\r
 959                                         if (i2diff.get(i2) == pri) {\r
 960                                                 if (used2[i2])\r
 961                                                         continue;\r
 962                                                 Statement s1  = ss1.get(i1+off1);\r
 963                                                 Statement s2  = ss2.get(i2+off2);\r
 964                                                 s1s.add(s1);\r
 965                                                 s2s.add(s2);\r
 966                                                 s1i.add(i1);\r
 967                                                 s2i.add(i2);\r
 968                                         }\r
 969                                 }\r
 970                         }\r
 971                         if (unreliableLeft != null) {\r
 972                                 unreliableLeft.addAll(s1s);\r
 973                                 unreliableRight.addAll(s2s);\r
 974                         }\r
 975                         for (Integer i : s1i)\r
 976                                 used1[i] = true;\r
 977                         for (Integer i : s2i)\r
 978                                 used2[i] = true;\r
 979 \r
 980                 }\r
 981                 for (int i1 = off1; i1 < off1 + len1; i1++) {\r
 982                         if (!used1[i1-off1]) {\r
 983                                 System.out.println("Compare Object diff1 " + printStatement(g,ss1.get(i1)));\r
 984                                 addDeletion(ss1.get(i1));\r
 985                         }\r
 986                 }\r
 987                 for (int i2 = off2; i2 < off2 + len2; i2++) {\r
 988                         if (!used2[i2-off2]) {\r
 989                                 System.out.println("Compare Object diff2 " + printStatement(g,ss2.get(i2)));\r
 990                                 addAddition(ss2.get(i2));\r
 991                         }\r
 992                 }\r
 993         }\r
 994         \r
 995         \r
 996         \r
 997         /**\r
 998          * compares properties, assumes functional relations\r
 999          * @param r1\r
1000          * @param r2\r
1001          * @throws ServiceException\r
1002          * @throws DoesNotContainValueException\r
1003          * @throws ValidationException \r
1004          */\r
1005         private void compareProps(Resource r1, Resource r2) throws ServiceException, DoesNotContainValueException, ValidationException {\r
1006                 System.out.println("compareProps " + r1 + " " + NameUtils.getSafeName(g, r1) + " " + r2 + " " + NameUtils.getSafeName(g, r2));\r
1007                 ArrayList<Statement> ss1 = new ArrayList<Statement>();\r
1008                 ArrayList<Statement> ss2 = new ArrayList<Statement>();\r
1009                 ss1.addAll(g.getStatements(r1, b.HasProperty));\r
1010                 ss2.addAll(g.getStatements(r2, b.HasProperty));\r
1011                 sortStatement(ss1, ss2);\r
1012                 \r
1013                 int i1 = 0; \r
1014                 int i2 = 0;\r
1015                 \r
1016                 while (true) {\r
1017                         if (i1 >= ss1.size()) {\r
1018                                 if (i2 >= ss2.size())\r
1019                                         break;\r
1020                                 else {\r
1021                                         while (i2 < ss2.size()) {\r
1022                                                 System.out.println("Compare Prop diff2 " + printStatement(g,ss2.get(i2)));\r
1023                                                 addAddition(ss2.get(i2));\r
1024                                                 i2++;\r
1025                                         }\r
1026                                         break;\r
1027                                 }\r
1028                         } else if (i2 >= ss2.size()) {\r
1029                                 while (i1 < ss1.size()) {\r
1030                                         System.out.println("Compare Prop diff1 " + printStatement(g,ss1.get(i1)));\r
1031                                         addDeletion(ss1.get(i1));\r
1032                                         i1++;\r
1033                                 }\r
1034                                 break;\r
1035                         }\r
1036                         Statement s1 = ss1.get(i1);\r
1037                         Statement s2 = ss2.get(i2);\r
1038                         if (s1.isAsserted(r1) && s2.isAsserted(r2)) {\r
1039                                 i1++;\r
1040                                 i2++;\r
1041                                 continue;\r
1042                         }\r
1043                         int c = scomp.compare(s1, s2);\r
1044                         switch (c) {\r
1045                                 case 0:{\r
1046                                         boolean b1 = g.hasValue(s1.getObject());\r
1047                                         boolean b2 = g.hasValue(s2.getObject());\r
1048                                         if (b1 == b2) {\r
1049                                                 if (b1) {\r
1050                                                         Object v1 = g.getValue(s1.getObject());\r
1051                                                         Object v2 = g.getValue(s2.getObject());\r
1052                                                         boolean eq = compareValue(v1, v2);\r
1053                                                         if (!eq) {\r
1054                                                                 addModification(s1, s2);\r
1055                                                                 addComparable(s1, s2, false);\r
1056                                                         }\r
1057                                                 } else {\r
1058                                                         if (!s1.getObject().equals(s1.getSubject()) && !s2.getObject().equals(s2.getSubject()))\r
1059                                                                 compareProps(s1.getObject(), s2.getObject());\r
1060                                                 }\r
1061                                         } else {\r
1062                                                 addModification(s1, s2);\r
1063                                                 addComparable(s1, s2, false);\r
1064                                         }\r
1065                                         i1++;\r
1066                                         i2++;\r
1067                                         break;\r
1068                                 }\r
1069                                 case -1:{\r
1070                                         System.out.println("Compare Prop diff1s " + printStatement(g,s1));\r
1071                                         addDeletion(s1);\r
1072                                         i1++;\r
1073                                         break;\r
1074                                 }\r
1075                                         \r
1076                                 case 1:{\r
1077                                         System.out.println("Compare Prop diff2s " + printStatement(g,s2));\r
1078                                         addAddition(s2);\r
1079                                         i2++;\r
1080                                         break;\r
1081                                 }\r
1082                         }\r
1083 \r
1084                 }\r
1085                 \r
1086                 ss1.clear();\r
1087                 ss2.clear();\r
1088                 \r
1089         }\r
1090         \r
1091         public static boolean compareValue(Object v1, Object v2) {\r
1092                 if (v1 instanceof Object[] && v2 instanceof Object[])\r
1093                         return Arrays.deepEquals((Object[])v1, (Object[])v2);\r
1094                 else if (v1 instanceof int[] && v2 instanceof int[]) \r
1095                         return Arrays.equals((int[])v1, (int[])v2);\r
1096                 else if (v1 instanceof float[] && v2 instanceof float[]) \r
1097                         return Arrays.equals((float[])v1, (float[])v2);\r
1098                 else if (v1 instanceof double[] && v2 instanceof double[]) \r
1099                         return Arrays.equals((double[])v1, (double[])v2);\r
1100                 else if (v1 instanceof long[] && v2 instanceof long[]) \r
1101                         return  Arrays.equals((long[])v1, (long[])v2);\r
1102                 else if (v1 instanceof byte[] && v2 instanceof byte[]) \r
1103                         return Arrays.equals((byte[])v1, (byte[])v2);\r
1104                 else if (v1 instanceof boolean[] && v2 instanceof boolean[]) \r
1105                         return Arrays.equals((boolean[])v1, (boolean[])v2);\r
1106                 else\r
1107                         return v1.equals(v2);\r
1108         }\r
1109 \r
1110         \r
1111         public class PredicateComparator implements Comparator<Statement> {\r
1112                 @Override\r
1113                 public int compare(Statement o1, Statement o2) {\r
1114                         if (comparableResources.contains(o1.getPredicate(), o2.getPredicate()))\r
1115                                 return 0;\r
1116                         if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())\r
1117                                 return -1;\r
1118                         if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())\r
1119                                 return 1;\r
1120                         return 0;\r
1121                 }\r
1122         }\r
1123         \r
1124         public class SubjectComparator implements Comparator<Statement> {\r
1125                 @Override\r
1126                 public int compare(Statement o1, Statement o2) {\r
1127                         if (comparableResources.contains(o1.getSubject(), o2.getSubject()))\r
1128                                 return 0;\r
1129                         if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())\r
1130                                 return -1;\r
1131                         if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())\r
1132                                 return 1;\r
1133                         return 0;\r
1134                 }\r
1135         }\r
1136         \r
1137         public class ObjectComparator implements Comparator<Statement> {\r
1138                 @Override\r
1139                 public int compare(Statement o1, Statement o2) {\r
1140                         if (comparableResources.contains(o1.getObject(), o2.getObject()))\r
1141                                 return 0;\r
1142                         if (o1.getObject().getResourceId() < o2.getObject().getResourceId())\r
1143                                 return -1;\r
1144                         if (o1.getObject().getResourceId() > o2.getObject().getResourceId())\r
1145                                 return 1;\r
1146                         return 0;\r
1147                 }\r
1148         }\r
1149         \r
1150         public static class FullStatementComparator implements Comparator<Statement> {\r
1151                 @Override\r
1152                 public int compare(Statement o1, Statement o2) {\r
1153                         if (o1.getSubject().getResourceId() < o2.getSubject().getResourceId())\r
1154                                 return -1;\r
1155                         if (o1.getSubject().getResourceId() > o2.getSubject().getResourceId())\r
1156                                 return 1;\r
1157                         if (o1.getPredicate().getResourceId() < o2.getPredicate().getResourceId())\r
1158                                 return -1;\r
1159                         if (o1.getPredicate().getResourceId() > o2.getPredicate().getResourceId())\r
1160                                 return 1;\r
1161                         if (o1.getObject().getResourceId() < o2.getObject().getResourceId())\r
1162                                 return -1;\r
1163                         if (o1.getObject().getResourceId() > o2.getObject().getResourceId())\r
1164                                 return 1;\r
1165                         return 0;\r
1166                 }\r
1167         }\r
1168         \r
1169         public class ResComparator implements Comparator<Resource> {\r
1170                 @Override\r
1171                 public int compare(Resource o1, Resource o2) {\r
1172                         if (comparableResources.contains(o1, o2))\r
1173                                 return 0;\r
1174                         if (o1.getResourceId() < o2.getResourceId())\r
1175                                 return -1;\r
1176                         if (o1.getResourceId() > o2.getResourceId())\r
1177                                 return 1;\r
1178                         return 0;\r
1179                 }\r
1180         }\r
1181 \r
1182 }\r