org.simantics.district.network/src/org/simantics/district/network/DistrictNetworkUtil.java

   1 package org.simantics.district.network;
   2
   3 import java.util.Collection;
   4 import java.util.Iterator;
   5
   6 import org.simantics.databoard.Bindings;
   7 import org.simantics.db.ReadGraph;
   8 import org.simantics.db.Resource;
   9 import org.simantics.db.WriteGraph;
  10 import org.simantics.db.common.utils.OrderedSetUtils;
  11 import org.simantics.db.exception.DatabaseException;
  12 import org.simantics.diagram.stubs.DiagramResource;
  13 import org.simantics.district.network.ontology.DistrictNetworkResource;
  14 import org.simantics.layer0.Layer0;
  15
  16 public class DistrictNetworkUtil {
  17
  18     public static Resource createEdge(WriteGraph graph, Resource composite) throws DatabaseException {
  19         Layer0 L0 = Layer0.getInstance(graph);
  20         DistrictNetworkResource DN = DistrictNetworkResource.getInstance(graph);
  21
  22         Resource edge = graph.newResource();
  23         graph.claim(edge, L0.InstanceOf, DN.Edge);
  24
  25         Resource defaultEdgeMapping = graph.getPossibleObject(composite, DN.EdgeDefaultMapping);
  26         graph.claim(edge, DN.HasMapping, defaultEdgeMapping);
  27
  28         OrderedSetUtils.add(graph, composite, edge);
  29         graph.claim(composite, L0.ConsistsOf, L0.PartOf, edge);
  30         return edge;
  31     }
  32
  33     public static Resource createVertex(WriteGraph graph, Resource composite, double[] coords) throws DatabaseException {
  34         Layer0 L0 = Layer0.getInstance(graph);
  35         DistrictNetworkResource DN = DistrictNetworkResource.getInstance(graph);
  36         DiagramResource DIA = DiagramResource.getInstance(graph);
  37         Resource vertex = graph.newResource();
  38         graph.claim(vertex, L0.InstanceOf, DN.Vertex);
  39         graph.claimLiteral(vertex, DIA.HasLocation, coords);
  40
  41         Resource defaultVertexMapping = graph.getPossibleObject(composite, DN.VertexDefaultMapping);
  42         graph.claim(vertex, DN.HasMapping, defaultVertexMapping);
  43
  44         OrderedSetUtils.add(graph, composite, vertex);
  45         graph.claim(composite, L0.ConsistsOf, L0.PartOf, vertex);
  46
  47         return vertex;
  48     }
  49
  50     public static Resource joinVertices(WriteGraph graph, Collection<Resource> vertices) throws DatabaseException {
  51         if (vertices.isEmpty())
  52             throw new IllegalArgumentException("vertices-collection should not be empty for joining vertices!");
  53         DistrictNetworkResource DN = DistrictNetworkResource.getInstance(graph);
  54         Iterator<Resource> verticeIterator = vertices.iterator();
  55         Resource master = verticeIterator.next();
  56         while (verticeIterator.hasNext()) {
  57             Resource slave = verticeIterator.next();
  58             Resource composite = graph.getSingleObject(slave, Layer0.getInstance(graph).PartOf);
  59             Collection<Resource> startVertexEdges = graph.getObjects(slave, DN.HasStartVertex_Inverse);
  60             for (Resource startVertexEdge : startVertexEdges) {
  61                 graph.deny(startVertexEdge, DN.HasStartVertex);
  62                 graph.claim(startVertexEdge, DN.HasStartVertex, master);
  63             }
  64             Collection<Resource> endVertexEdges = graph.getObjects(slave, DN.HasEndVertex_Inverse);
  65             for (Resource endVertexEdge : endVertexEdges) {
  66                 graph.deny(endVertexEdge, DN.HasEndVertex);
  67                 graph.claim(endVertexEdge, DN.HasEndVertex, master);
  68             }
  69             OrderedSetUtils.remove(graph, composite, slave);
  70         }
  71         return master;
  72     }
  73
  74     public static double calculateDistance(ReadGraph graph, Resource startVertex, Resource endVertex) throws DatabaseException {
  75         Layer0 L0 = Layer0.getInstance(graph);
  76         Resource startComposite = graph.getSingleObject(startVertex, L0.PartOf);
  77         Resource endComposite = graph.getSingleObject(endVertex, L0.PartOf);
  78         if (!startComposite.equalsResource(endComposite)) {
  79             throw new DatabaseException("Can not calculate distance between vertices on different composites! " + startVertex + " -> " + endVertex);
  80         }
  81         Resource crs = graph.getSingleObject(startComposite, DistrictNetworkResource.getInstance(graph).HasSpatialRefSystem);
  82
  83         CRS crsClass = graph.adapt(crs, CRS.class);
  84
  85         double[] startCoords = graph.getRelatedValue2(startVertex, DiagramResource.getInstance(graph).HasLocation, Bindings.DOUBLE_ARRAY);
  86         double[] endCoords = graph.getRelatedValue2(endVertex, DiagramResource.getInstance(graph).HasLocation, Bindings.DOUBLE_ARRAY);
  87
  88         return crsClass.calculateDistance(startCoords, endCoords);
  89     }
  90 }