1 package org.simantics.interop.test;
3 import java.util.ArrayList;
4 import java.util.Comparator;
6 import org.simantics.db.ReadGraph;
7 import org.simantics.db.Resource;
8 import org.simantics.db.Statement;
9 import org.simantics.db.exception.DatabaseException;
10 import org.simantics.layer0.Layer0;
13 * Object comparator that uses type of objects to check if objects are comparable.
15 * Difference value is amount of properties that have different values. If objects have no properties, the result is 0 (unreliable).
18 * @author Marko Luukkainen <marko.luukkainen@vtt.fi>
21 public class TypeComparator extends ResourceComparator {
24 ArrayList<Resource> rs1 = new ArrayList<Resource>();
25 ArrayList<Resource> rs2 = new ArrayList<Resource>();
28 public int compare(ReadGraph g, Resource o1, Resource o2, boolean local) throws DatabaseException {
32 return compare(g, o1, o2);
36 public int compare(ReadGraph g, Resource o1, Resource o2) throws DatabaseException{
37 if (!compareType(g,o1, o2)) {
40 return propsDiffCount(g,o1, o2);
44 * Compares resources based on L0.InstaceOf relations.
45 * If there are no L0.InstanceOf relations, uses ResourceComparator for comparison.
51 * @throws DatabaseException
53 protected boolean compareType(ReadGraph g,Resource r1, Resource r2) throws DatabaseException {
54 Layer0 l0 = Layer0.getInstance(g);
55 rs1.addAll(g.getObjects(r1, l0.InstanceOf));
56 rs2.addAll(g.getObjects(r2, l0.InstanceOf));
57 if (rs1.size() != rs2.size()) {
62 if (rs1.size() == 0) {
63 rs1.addAll(g.getObjects(r1, l0.Inherits));
64 rs2.addAll(g.getObjects(r2, l0.Inherits));
66 if (rs1.size() == 0) {
67 rs1.addAll(g.getObjects(r1, l0.SubrelationOf));
68 rs2.addAll(g.getObjects(r2, l0.SubrelationOf));
70 Comparator<Resource> rcomp = getComparator().getResourceComparator();
71 if (rs1.size() == 0) {
72 return rcomp.compare(r1, r2) == 0;
75 getComparator().sortResource(rs1, rs2);
77 for (int i = 0; i < rs1.size(); i++) {
78 int c = rcomp.compare(rs1.get(i), rs2.get(i));
85 if (rs1.size() == 1) {
86 // Check for enumeration type. Without this enumeration instances could be mixed together.
87 if (g.hasStatement(rs1.get(0), l0.Enumeration, rs1.get(0))) {
103 protected int propsDiffCount(ReadGraph g, Resource r1, Resource r2) throws DatabaseException {
104 Layer0 l0 = Layer0.getInstance(g);
105 ArrayList<Statement> ss1 = new ArrayList<Statement>();
106 ArrayList<Statement> ss2 = new ArrayList<Statement>();
107 ss1.addAll(g.getStatements(r1, l0.HasProperty));
108 ss2.addAll(g.getStatements(r2, l0.HasProperty));
110 if (ss1.size() == 0 && ss2.size() == 0)
113 Comparator<Statement> scomp = getComparator().getStatementComparator();
115 getComparator().sortStatement(ss1, ss2);
123 if (i1 >= ss1.size()) {
124 if (i2 >= ss2.size())
127 while (i2 < ss2.size()) {
133 } else if (i2 >= ss2.size()) {
134 while (i1 < ss1.size()) {
140 Statement s1 = ss1.get(i1);
141 Statement s2 = ss2.get(i2);
142 if (s1.isAsserted(r1) && s2.isAsserted(r2)) {
147 int c = scomp.compare(s1, s2);
150 boolean b1 = g.hasValue(s1.getObject());
151 boolean b2 = g.hasValue(s2.getObject());
154 boolean eq = GraphComparator.compareValue(g, l0 , s1.getObject(), s2.getObject());
159 count += propsDiffCount(g,s1.getObject(), s2.getObject());
162 //System.out.println("Props count structural vs literal");