X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=bundles%2Forg.simantics.document.linking.ui%2Fsrc%2Forg%2Fsimantics%2Fdocument%2Flinking%2Freport%2Ftemplates%2FSourceParentDiagramComparator.java;fp=bundles%2Forg.simantics.document.linking.ui%2Fsrc%2Forg%2Fsimantics%2Fdocument%2Flinking%2Freport%2Ftemplates%2FSourceParentDiagramComparator.java;h=59be0c82561dcdc6baf67da0e4f03914a902d00f;hb=969bd23cab98a79ca9101af33334000879fb60c5;hp=0000000000000000000000000000000000000000;hpb=866dba5cd5a3929bbeae85991796acb212338a08;p=simantics%2Fplatform.git

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
index 000000000..59be0c825
--- /dev/null
+++ b/bundles/org.simantics.document.linking.ui/src/org/simantics/document/linking/report/templates/SourceParentDiagramComparator.java
@@ -0,0 +1,58 @@
+package org.simantics.document.linking.report.templates;
+
+import java.util.List;
+
+import org.simantics.db.ReadGraph;
+import org.simantics.db.Resource;
+import org.simantics.document.linking.ontology.DocumentLink;
+import org.simantics.modeling.ModelingResources;
+
+class SourceParentDiagramComparator extends ResourceNameComparator {
+	DocumentLink sl;
+	ModelingResources mod;
+	
+	public SourceParentDiagramComparator(ReadGraph graph, Resource model) {
+		super(graph,model);
+		sl = DocumentLink.getInstance(graph);
+		mod = ModelingResources.getInstance(graph);
+	}
+	
+	
+	@Override
+	public int compare(Resource o1, Resource o2) {
+		try {
+			Resource r1 = graph.getSingleObject(o1, sl.hasSource_Inverse);
+			Resource r2 = graph.getSingleObject(o2, sl.hasSource_Inverse);
+			List<Resource> path1 = getPath(r1);
+			List<Resource> path2 = getPath(r2);
+			int diag1 = -1;
+			int diag2 = -1;
+			for (int i = path1.size() -1; i >= 0; i--) {
+				if (graph.hasStatement(path1.get(i),mod.CompositeToDiagram)) {
+					diag1 = i;
+					break;
+				}
+			}
+			for (int i = path2.size() -1; i >= 0; i--) {
+				if (graph.hasStatement(path2.get(i),mod.CompositeToDiagram)) {
+					diag2 = i;
+					break;
+				}
+			}
+			int count = Math.min(diag1, diag2);
+			
+			int i = 0;
+			int comp = 0;
+			for (; i <= count; i++) {
+				comp = super.compare(path1.get(i), path2.get(i));
+				if (comp != 0)
+					return comp;
+			}
+			return diag1 - diag2;
+			
+		} catch (Exception e) {
+			return 0;
+		}
+		
+	}
+}
\ No newline at end of file