]> gerrit.simantics Code Review - simantics/district.git/blobdiff - org.simantics.district.network/src/org/simantics/district/network/DistrictNetworkUtil.java
More sensible caching for connection lines.
[simantics/district.git] / org.simantics.district.network / src / org / simantics / district / network / DistrictNetworkUtil.java
index 821085175a91886b25807fde8d30133b805b3ca3..24a77575d6d6ed6ac9ba88485bb12c8763efa3f3 100644 (file)
@@ -4,9 +4,13 @@ import java.util.Collection;
 import java.util.Iterator;
 
 import org.simantics.databoard.Bindings;
+import org.simantics.datatypes.literal.RGB;
+import org.simantics.datatypes.literal.RGB.Integer;
 import org.simantics.db.ReadGraph;
 import org.simantics.db.Resource;
 import org.simantics.db.WriteGraph;
+import org.simantics.db.common.procedure.adapter.TransientCacheListener;
+import org.simantics.db.common.request.ResourceRead;
 import org.simantics.db.common.utils.OrderedSetUtils;
 import org.simantics.db.exception.BindingException;
 import org.simantics.db.exception.DatabaseException;
@@ -39,7 +43,7 @@ public class DistrictNetworkUtil {
         Resource edge = graph.newResource();
         graph.claim(edge, L0.InstanceOf, DN.Edge);
         
-        graph.claim(edge, DN.HasMapping, mapping);
+        graph.claim(edge, DN.HasMapping, null, mapping);
         
         OrderedSetUtils.addFirst(graph, composite, edge);
         graph.claim(composite, L0.ConsistsOf, L0.PartOf, edge);
@@ -72,7 +76,7 @@ public class DistrictNetworkUtil {
         graph.claim(vertex, L0.InstanceOf, DN.Vertex);
         graph.claimLiteral(vertex, DIA.HasLocation, coords);
         
-        graph.claim(vertex, DN.HasMapping, mapping);
+        graph.claim(vertex, DN.HasMapping, null, mapping);
         
         OrderedSetUtils.add(graph, composite, vertex);
         graph.claim(composite, L0.ConsistsOf, L0.PartOf, vertex);
@@ -179,6 +183,10 @@ public class DistrictNetworkUtil {
         ModelingResources MOD = ModelingResources.getInstance(graph);
         return graph.getPossibleObject(mappedElement, MOD.ElementToComponent);
     }
+    
+    public static Resource getMappedComponentCached(ReadGraph graph, Resource vertex) throws DatabaseException {
+        return graph.syncRequest(new MappedComponentRequest(vertex), TransientCacheListener.instance());
+    }
 
     public static Resource getMappedDNElement(ReadGraph graph, Resource element) throws DatabaseException {
         if (element == null)
@@ -220,4 +228,36 @@ public class DistrictNetworkUtil {
         Boolean current = graph.getPossibleRelatedValue(diagram, DN.Diagram_drawMapEnabled, Bindings.BOOLEAN);
         return current != null ? current : true;
     }
+
+    public static void changeMapBackgroundColor(WriteGraph graph, Resource diagram, Integer integer) throws DatabaseException {
+        DistrictNetworkResource DN = DistrictNetworkResource.getInstance(graph);
+        graph.claimLiteral(diagram, DN.Diagram_backgroundColor, integer, Bindings.getBindingUnchecked(RGB.Integer.class));
+    }
+    
+    public static Boolean trackChangesEnabled(ReadGraph graph, Resource diagram) throws DatabaseException {
+        if (diagram != null && graph.hasStatement(diagram)) {
+            return Boolean.TRUE.equals(graph.getPossibleRelatedValue(diagram,
+                DistrictNetworkResource.getInstance(graph).Diagram_trackChangesEnabled));
+        } else {
+            return false;
+        }
+    }
+
+    public static RGB.Integer backgroundColor(ReadGraph graph, Resource diagram) throws DatabaseException {
+        return graph.getPossibleRelatedValue(diagram,
+                DistrictNetworkResource.getInstance(graph).Diagram_backgroundColor,
+                Bindings.getBindingUnchecked(RGB.Integer.class));
+    }
+
+    public static final class MappedComponentRequest extends ResourceRead<Resource> {
+        public MappedComponentRequest(Resource element) {
+            super(element);
+        }
+
+        @Override
+        public Resource perform(ReadGraph graph) throws DatabaseException {
+            return getMappedComponent(graph, resource);
+        }
+    }
+
 }