]> gerrit.simantics Code Review - simantics/interop.git/blob - org.simantics.interop/src/org/simantics/interop/test/TypeComparator.java
Better handling of unidentified resources (resources that have no name, or other...
[simantics/interop.git] / org.simantics.interop / src / org / simantics / interop / test / TypeComparator.java
1 package org.simantics.interop.test;\r
2 \r
3 import java.util.ArrayList;\r
4 import java.util.Comparator;\r
5 \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
15 \r
16 /**\r
17  * Object comparator that uses type of objects to check if objects are comparable. \r
18  * \r
19  * Difference value is amount of properties that have different values.\r
20  * \r
21  * @author Marko Luukkainen <marko.luukkainen@vtt.fi>\r
22  *\r
23  */\r
24 public class TypeComparator extends ResourceComparator {\r
25 \r
26         \r
27         ArrayList<Resource> rs1 = new ArrayList<Resource>();\r
28         ArrayList<Resource> rs2 = new ArrayList<Resource>();\r
29         \r
30         @Override\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
34                 }\r
35                 return propsDiffCount(g,o1, o2);\r
36         }\r
37         \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
43                         rs1.clear();\r
44                         rs2.clear();\r
45                         return false;\r
46                 }\r
47                 Comparator<Resource> rcomp = getComparator().getResourceComparator();\r
48                 getComparator().sortResource(rs1, rs2);\r
49 \r
50                 for (int i = 0; i < rs1.size(); i++) {\r
51                         int c = rcomp.compare(rs1.get(i), rs2.get(i));\r
52                         if (c != 0) {\r
53                                 rs1.clear();\r
54                                 rs2.clear();\r
55                                 return false;\r
56                         }\r
57                 }\r
58                 \r
59                 rs1.clear();\r
60                 rs2.clear();\r
61                 \r
62                 return true;\r
63         }\r
64         \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
71                 \r
72                 if (ss1.size() == 0 && ss2.size() == 0)\r
73                         return 0;\r
74                 \r
75                 Comparator<Statement> scomp = getComparator().getStatementComparator();\r
76                 \r
77                 getComparator().sortStatement(ss1, ss2);\r
78                 \r
79                 int count = 1;\r
80                 \r
81                 int i1 = 0; \r
82                 int i2 = 0;\r
83                 \r
84                 while (true) {\r
85                         if (i1 >= ss1.size()) {\r
86                                 if (i2 >= ss2.size())\r
87                                         break;\r
88                                 else {\r
89                                         while (i2 < ss2.size()) {\r
90                                                 count++;\r
91                                                 i2++;\r
92                                         }\r
93                                         break;\r
94                                 }\r
95                         } else if (i2 >= ss2.size()) {\r
96                                 while (i1 < ss1.size()) {\r
97                                         count++;\r
98                                         i1++;\r
99                                 }\r
100                                 break;\r
101                         }\r
102                         Statement s1 = ss1.get(i1);\r
103                         Statement s2 = ss2.get(i2);\r
104                         int c = scomp.compare(s1, s2);\r
105                         switch (c) {\r
106                                 case 0:{\r
107                                         boolean b1 = g.hasValue(s1.getObject());\r
108                                         boolean b2 = g.hasValue(s2.getObject());\r
109                                         if (b1 == b2) {\r
110                                                 if (b1) {\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
114                                                         \r
115                                                         if (!eq) {\r
116                                                                 count++;\r
117                                                         }\r
118                                                         //System.out.println("Prop count values " + v1 + " " + v2);\r
119                                                 } else {\r
120                                                         count += propsDiffCount(g,s1.getObject(), s2.getObject());\r
121                                                 }\r
122                                         } else {\r
123                                                 //System.out.println("Props count structural vs literal");\r
124                                                 count++;\r
125                                         }\r
126                                         i1++;\r
127                                         i2++;\r
128                                         break;\r
129                                 }\r
130                                 case -1:{\r
131                                         count++;\r
132                                         i1++;\r
133                                         break;\r
134                                 }\r
135                                         \r
136                                 case 1:{\r
137                                         count++;\r
138                                         i2++;\r
139                                         break;\r
140                                 }\r
141                         }\r
142 \r
143                 }\r
144                 \r
145                 ss1.clear();\r
146                 ss2.clear();\r
147                 return count;\r
148         }\r
149 \r
150 }\r