]> gerrit.simantics Code Review - simantics/platform.git/blobdiff - bundles/org.simantics.document.linking.ui/src/org/simantics/document/linking/report/templates/SourceParentDiagramComparator.java
Migrated source code from Simantics SVN
[simantics/platform.git] / bundles / org.simantics.document.linking.ui / src / org / simantics / document / linking / report / templates / SourceParentDiagramComparator.java
diff --git a/bundles/org.simantics.document.linking.ui/src/org/simantics/document/linking/report/templates/SourceParentDiagramComparator.java b/bundles/org.simantics.document.linking.ui/src/org/simantics/document/linking/report/templates/SourceParentDiagramComparator.java
new file mode 100644 (file)
index 0000000..59be0c8
--- /dev/null
@@ -0,0 +1,58 @@
+package org.simantics.document.linking.report.templates;\r
+\r
+import java.util.List;\r
+\r
+import org.simantics.db.ReadGraph;\r
+import org.simantics.db.Resource;\r
+import org.simantics.document.linking.ontology.DocumentLink;\r
+import org.simantics.modeling.ModelingResources;\r
+\r
+class SourceParentDiagramComparator extends ResourceNameComparator {\r
+       DocumentLink sl;\r
+       ModelingResources mod;\r
+       \r
+       public SourceParentDiagramComparator(ReadGraph graph, Resource model) {\r
+               super(graph,model);\r
+               sl = DocumentLink.getInstance(graph);\r
+               mod = ModelingResources.getInstance(graph);\r
+       }\r
+       \r
+       \r
+       @Override\r
+       public int compare(Resource o1, Resource o2) {\r
+               try {\r
+                       Resource r1 = graph.getSingleObject(o1, sl.hasSource_Inverse);\r
+                       Resource r2 = graph.getSingleObject(o2, sl.hasSource_Inverse);\r
+                       List<Resource> path1 = getPath(r1);\r
+                       List<Resource> path2 = getPath(r2);\r
+                       int diag1 = -1;\r
+                       int diag2 = -1;\r
+                       for (int i = path1.size() -1; i >= 0; i--) {\r
+                               if (graph.hasStatement(path1.get(i),mod.CompositeToDiagram)) {\r
+                                       diag1 = i;\r
+                                       break;\r
+                               }\r
+                       }\r
+                       for (int i = path2.size() -1; i >= 0; i--) {\r
+                               if (graph.hasStatement(path2.get(i),mod.CompositeToDiagram)) {\r
+                                       diag2 = i;\r
+                                       break;\r
+                               }\r
+                       }\r
+                       int count = Math.min(diag1, diag2);\r
+                       \r
+                       int i = 0;\r
+                       int comp = 0;\r
+                       for (; i <= count; i++) {\r
+                               comp = super.compare(path1.get(i), path2.get(i));\r
+                               if (comp != 0)\r
+                                       return comp;\r
+                       }\r
+                       return diag1 - diag2;\r
+                       \r
+               } catch (Exception e) {\r
+                       return 0;\r
+               }\r
+               \r
+       }\r
+}
\ No newline at end of file