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