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