+ public static List<ResourceVertex> nearbyResourceVertices(ReadGraph graph, Resource diagramResource, Resource vertex, Double padding) throws DatabaseException {
+ double halfPadding = padding / 2;
+
+ Quadtree existingVertices = graph.syncRequest(new ExistingVerticesRead(diagramResource, halfPadding), TransientCacheListener.instance());
+ double[] coords = graph.getRelatedValue(vertex, DiagramResource.getInstance(graph).HasLocation, Bindings.DOUBLE_ARRAY);
+ double x1 = coords[0] - halfPadding;
+ double y1= coords[1] - halfPadding;
+ double x2 = coords[0] + halfPadding;
+ double y2= coords[1] + halfPadding;
+ Envelope e = new Envelope(x1, x2, y1, y2);
+
+ List<?> result = existingVertices.query(e);
+ @SuppressWarnings("unchecked")
+ List<ResourceVertex> vertices = (List<ResourceVertex>) result;
+
+ Rectangle2D vertexRectangle = new Rectangle2D.Double(coords[0] - halfPadding, coords[1] - halfPadding, padding, padding);
+
+ // let's sort by distance
+ List<ResourceVertex> sortedVertices = vertices.stream().filter(rv -> {
+ if (rv.vertex.equals(vertex))
+ return false;
+
+ Rectangle2D nearbyRectangle = new Rectangle2D.Double(rv.coords[0] - halfPadding, rv.coords[1] - halfPadding, padding, padding);
+ return vertexRectangle.intersects(nearbyRectangle);
+ }).sorted((o1, o2) -> {
+ double disto1 = Math.sqrt((Math.pow(coords[0] - o1.coords[0], 2) + (Math.pow(coords[1] - o1.coords[1], 2))));
+ double disto2 = Math.sqrt((Math.pow(coords[0] - o2.coords[0], 2) + (Math.pow(coords[1] - o2.coords[1], 2))));
+
+ if (o1.vertex.getResourceId() == 2554883) {
+ System.err.println("here we are");
+ }
+
+ return Double.compare(disto1, disto2);
+ }).collect(Collectors.toList());
+ return sortedVertices;
+ }
+
+ public static List<Resource> nearbyVertices(ReadGraph graph, Resource vertex, double padding) throws DatabaseException {
+ Resource diagramResource = graph.getSingleObject(vertex, Layer0.getInstance(graph).PartOf);
+ return nearbyResourceVertices(graph, diagramResource, vertex, padding)
+ .stream()
+ .map(rv -> rv.vertex)
+ .collect(Collectors.toList());
+ }
+
+ public static Quadtree existingVertices(Resource diagramResource, Double padding) throws DatabaseException {
+ Quadtree vv = Simantics.getSession().syncRequest(new ExistingVerticesRead(diagramResource, padding));
+ return vv;
+ }
+
+ public static class ExistingVerticesRead extends BinaryRead<Resource, Double, Quadtree> {
+
+ public ExistingVerticesRead(Resource diagramResource, Double padding) {
+ super(diagramResource, padding);
+ }
+
+ @Override
+ public Quadtree perform(ReadGraph graph) throws DatabaseException {
+ Collection<Resource> vertices = graph.syncRequest(new ObjectsWithType(parameter, Layer0.getInstance(graph).ConsistsOf, DistrictNetworkResource.getInstance(graph).Vertex));
+ Quadtree vv = new Quadtree();
+ for (Resource vertex : vertices) {
+ double[] coords = graph.getRelatedValue2(vertex, DiagramResource.getInstance(graph).HasLocation, Bindings.DOUBLE_ARRAY);
+ double x1 = coords[0] - parameter2;
+ double y1= coords[1] - parameter2;
+ double x2 = coords[0] + parameter2;
+ double y2= coords[1] + parameter2;
+ Envelope e = new Envelope(x1, x2, y1, y2);
+ vv.insert(e, new ResourceVertex(vertex, coords, true));
+ }
+ return vv;
+ }
+ }