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