1 package org.simantics.interop.test;
\r
3 import java.util.ArrayList;
\r
4 import java.util.Comparator;
\r
6 import org.simantics.db.ReadGraph;
\r
7 import org.simantics.db.Resource;
\r
8 import org.simantics.db.Statement;
\r
9 import org.simantics.db.exception.DatabaseException;
\r
10 import org.simantics.db.exception.DoesNotContainValueException;
\r
11 import org.simantics.db.exception.ManyObjectsForFunctionalRelationException;
\r
12 import org.simantics.db.exception.ServiceException;
\r
13 import org.simantics.db.exception.ValidationException;
\r
14 import org.simantics.layer0.Layer0;
\r
17 * Object comparator that uses type of objects to check if objects are comparable.
\r
19 * Difference value is amount of properties that have different values.
\r
21 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
\r
24 public class TypeComparator extends ResourceComparator {
\r
27 ArrayList<Resource> rs1 = new ArrayList<Resource>();
\r
28 ArrayList<Resource> rs2 = new ArrayList<Resource>();
\r
31 public int compare(ReadGraph g, Resource o1, Resource o2) throws DatabaseException{
\r
32 if (!compareType(g,o1, o2)) {
\r
33 return (Integer.MAX_VALUE);
\r
35 return propsDiffCount(g,o1, o2);
\r
38 protected boolean compareType(ReadGraph g,Resource r1, Resource r2) throws ServiceException, ManyObjectsForFunctionalRelationException {
\r
39 Layer0 l0 = Layer0.getInstance(g);
\r
40 rs1.addAll(g.getObjects(r1, l0.InstanceOf));
\r
41 rs2.addAll(g.getObjects(r2, l0.InstanceOf));
\r
42 if (rs1.size() != rs2.size()) {
\r
47 Comparator<Resource> rcomp = getComparator().getResourceComparator();
\r
48 getComparator().sortResource(rs1, rs2);
\r
50 for (int i = 0; i < rs1.size(); i++) {
\r
51 int c = rcomp.compare(rs1.get(i), rs2.get(i));
\r
65 protected int propsDiffCount(ReadGraph g, Resource r1, Resource r2) throws ServiceException, DoesNotContainValueException, ValidationException {
\r
66 Layer0 l0 = Layer0.getInstance(g);
\r
67 ArrayList<Statement> ss1 = new ArrayList<Statement>();
\r
68 ArrayList<Statement> ss2 = new ArrayList<Statement>();
\r
69 ss1.addAll(g.getStatements(r1, l0.HasProperty));
\r
70 ss2.addAll(g.getStatements(r2, l0.HasProperty));
\r
72 if (ss1.size() == 0 && ss2.size() == 0)
\r
75 Comparator<Statement> scomp = getComparator().getStatementComparator();
\r
77 getComparator().sortStatement(ss1, ss2);
\r
85 if (i1 >= ss1.size()) {
\r
86 if (i2 >= ss2.size())
\r
89 while (i2 < ss2.size()) {
\r
95 } else if (i2 >= ss2.size()) {
\r
96 while (i1 < ss1.size()) {
\r
102 Statement s1 = ss1.get(i1);
\r
103 Statement s2 = ss2.get(i2);
\r
104 int c = scomp.compare(s1, s2);
\r
107 boolean b1 = g.hasValue(s1.getObject());
\r
108 boolean b2 = g.hasValue(s2.getObject());
\r
111 Object v1 = g.getValue(s1.getObject());
\r
112 Object v2 = g.getValue(s2.getObject());
\r
113 boolean eq = GraphComparator.compareValue(v1, v2);
\r
118 //System.out.println("Prop count values " + v1 + " " + v2);
\r
120 count += propsDiffCount(g,s1.getObject(), s2.getObject());
\r
123 //System.out.println("Props count structural vs literal");
\r