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