最邻近搜索完成

Author: codingmiao

src/main/java/org/wowtools/neo4j/rtree/RtreeIntersectsSearcher.java

@@ -12,12 +12,12 @@
 import org.wowtools.neo4j.rtree.util.BooleanDataNodeVisitor;
 
 import java.util.ArrayDeque;
+import java.util.Iterator;
 import java.util.Map;
 import java.util.concurrent.locks.Lock;
 
 /**
  * 相交关系查询器
- * 查询器
  *
  * @author liuyu
  * @date 2021/12/24
@@ -35,7 +35,7 @@ private RtreeIntersectsSearcher(long metadataNodeId, Lock readLock) {
     }
 
     /**
-     * 获取索引
+     * 获取查询器
      *
      * @param tx   事务 此事务需要在外部手动关闭
      * @param name 索引名
@@ -64,7 +64,11 @@ public void intersects(RectNd bbox, Transaction tx, BooleanDataNodeVisitor visit
         readLock.lock();
         try {
             Node metadataNode = tx.getNodeById(metadataNodeId);
-            Node node = metadataNode.getRelationships(Relationships.RTREE_METADATA_TO_ROOT).iterator().next().getEndNode();
+            Iterator<Relationship> iterator = metadataNode.getRelationships(Relationships.RTREE_METADATA_TO_ROOT).iterator();
+            if (!iterator.hasNext()) {
+                return;
+            }
+            Node node = iterator.next().getEndNode();
             ArrayDeque<Node> stack = new ArrayDeque<>();
             stack.push(node);
             do {

src/main/java/org/wowtools/neo4j/rtree/RtreeNearestSearcher.java

@@ -0,0 +1,76 @@
+package org.wowtools.neo4j.rtree;
+
+import org.neo4j.graphdb.Node;
+import org.neo4j.graphdb.Relationship;
+import org.neo4j.graphdb.Transaction;
+import org.wowtools.neo4j.rtree.internal.RtreeLock;
+import org.wowtools.neo4j.rtree.internal.define.Labels;
+import org.wowtools.neo4j.rtree.internal.define.Relationships;
+import org.wowtools.neo4j.rtree.internal.nearest.DistanceResult;
+import org.wowtools.neo4j.rtree.util.NearestNeighbour;
+
+import java.util.Iterator;
+import java.util.List;
+import java.util.concurrent.locks.Lock;
+
+/**
+ * 最邻近搜索器
+ *
+ * @author liuyu
+ * @date 2021/12/27
+ */
+public class RtreeNearestSearcher {
+
+    private final long metadataNodeId;
+    private final Lock readLock;
+
+
+    private RtreeNearestSearcher(long metadataNodeId, Lock readLock) {
+        this.metadataNodeId = metadataNodeId;
+        this.readLock = readLock;
+    }
+
+
+    /**
+     * 获取查询器
+     *
+     * @param tx   事务 此事务需要在外部手动关闭
+     * @param name 索引名
+     * @return
+     */
+    public static RtreeNearestSearcher get(Transaction tx, String name) {
+        Node metadataNode = tx.findNode(Labels.METADATA, "name", name);
+        if (null == metadataNode) {
+            throw new RuntimeException("索引 " + name + " 不存在");
+        }
+        long metadataNodeId = metadataNode.getId();
+        Lock readLock = RtreeLock.getUseReadWriteLock(name).readLock();
+        RtreeNearestSearcher searcher = new RtreeNearestSearcher(metadataNodeId, readLock);
+        return searcher;
+    }
+
+
+    /**
+     * 最邻近查询。查询距离输入点pointNd的距离最近的点
+     *
+     * @param nearestNeighbour 最邻近查询函数
+     * @param tx               事务 此事务需要在外部手动关闭
+     * @return
+     */
+    public List<DistanceResult> nearest(NearestNeighbour nearestNeighbour, Transaction tx) {
+        readLock.lock();
+        try {
+            Node metadataNode = tx.getNodeById(metadataNodeId);
+            Iterator<Relationship> iterator = metadataNode.getRelationships(Relationships.RTREE_METADATA_TO_ROOT).iterator();
+            if (!iterator.hasNext()) {
+                return List.of();
+            }
+            Node root = iterator.next().getEndNode();
+            List<DistanceResult> res = nearestNeighbour.find(root);
+            return res;
+        } finally {
+            readLock.unlock();
+        }
+    }
+
+}

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/Constant.java

@@ -5,9 +5,9 @@
  * The ASF licenses this file to You under the Apache License, Version 2.0
  * (the "License"); you may not use this file except in compliance with
  * the License.  You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
+ * <p>
+ * http://www.apache.org/licenses/LICENSE-2.0
+ * <p>
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS,
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/RtreeNearestQuery.java

@@ -23,7 +23,7 @@ public interface NodeFilter {
         /**
          * 过滤
          *
-         * @param node 节点
+         * @param node     节点
          * @param geometry geometry
          * @return 返回false则忽略此节点
          */

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/RtreeQuery.java

@@ -25,9 +25,9 @@
 import org.neo4j.graphdb.Transaction;
 import org.wowtools.neo4j.rtree.geometry2dold.spatial.RTreeIndex;
 import org.wowtools.neo4j.rtree.geometry2dold.util.BboxIntersectUtil;
-import org.wowtools.neo4j.rtree.geometry2dold.util.Singleton;
 import org.wowtools.neo4j.rtree.geometry2dold.util.GeometryBbox;
 import org.wowtools.neo4j.rtree.geometry2dold.util.RtreeTraverser;
+import org.wowtools.neo4j.rtree.geometry2dold.util.Singleton;
 
 /**
  * 利用rtree索引进行空间查询

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/bigshape/BigShapeManager.java

@@ -11,9 +11,9 @@
 import org.wowtools.neo4j.rtree.geometry2dold.bigshape.pojo.BigShape;
 import org.wowtools.neo4j.rtree.geometry2dold.bigshape.pojo.Grid;
 import org.wowtools.neo4j.rtree.geometry2dold.bigshape.util.GridCuter;
+import org.wowtools.neo4j.rtree.geometry2dold.spatial.Envelope;
 import org.wowtools.neo4j.rtree.geometry2dold.spatial.EnvelopeDecoder;
 import org.wowtools.neo4j.rtree.geometry2dold.spatial.RTreeIndex;
-import org.wowtools.neo4j.rtree.geometry2dold.spatial.Envelope;
 import org.wowtools.neo4j.rtree.geometry2dold.util.GeometryBbox;
 
 import java.util.HashMap;

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/bigshape/pojo/BigShape.java

@@ -12,8 +12,8 @@
 import org.wowtools.neo4j.rtree.geometry2dold.bigshape.BigShapeManager;
 import org.wowtools.neo4j.rtree.geometry2dold.spatial.RTreeIndex;
 import org.wowtools.neo4j.rtree.geometry2dold.util.BboxIntersectUtil;
-import org.wowtools.neo4j.rtree.geometry2dold.util.WkbReaderManager;
 import org.wowtools.neo4j.rtree.geometry2dold.util.GeometryBbox;
+import org.wowtools.neo4j.rtree.geometry2dold.util.WkbReaderManager;
 
 import java.util.ArrayDeque;
 import java.util.Deque;

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/bigshape/util/GridCuter.java

@@ -1,9 +1,12 @@
 package org.wowtools.neo4j.rtree.geometry2dold.bigshape.util;
 
-import org.locationtech.jts.geom.*;
+import org.locationtech.jts.geom.Coordinate;
+import org.locationtech.jts.geom.Geometry;
+import org.locationtech.jts.geom.Polygon;
+import org.locationtech.jts.geom.TopologyException;
 import org.wowtools.neo4j.rtree.geometry2dold.bigshape.pojo.Grid;
-import org.wowtools.neo4j.rtree.geometry2dold.util.Singleton;
 import org.wowtools.neo4j.rtree.geometry2dold.util.GeometryBbox;
+import org.wowtools.neo4j.rtree.geometry2dold.util.Singleton;
 
 import java.util.LinkedList;
 import java.util.List;

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/bigshape/util/SelfIntersectingDispose.java

@@ -9,6 +9,7 @@
 /**
  * 自相交多边形处理
  * https://stackoverflow.com/questions/31473553/is-there-a-way-to-convert-a-self-intersecting-polygon-to-a-multipolygon-in-jts
+ *
  * @author liuyu
  * @date 2020/11/24
  */
@@ -20,52 +21,52 @@ public class SelfIntersectingDispose {
      * @param geom
      * @return a geometry
      */
-    public static Geometry validate(Geometry geom){
-        if(geom instanceof Polygon){
-            if(geom.isValid()){
+    public static Geometry validate(Geometry geom) {
+        if (geom instanceof Polygon) {
+            if (geom.isValid()) {
                 geom.normalize(); // validate does not pick up rings in the wrong order - this will fix that
                 return geom; // If the polygon is valid just return it
             }
             Polygonizer polygonizer = new Polygonizer();
-            addPolygon((Polygon)geom, polygonizer);
+            addPolygon((Polygon) geom, polygonizer);
             return toPolygonGeometry(polygonizer.getPolygons(), geom.getFactory());
-        }else if(geom instanceof MultiPolygon){
-            if(geom.isValid()){
+        } else if (geom instanceof MultiPolygon) {
+            if (geom.isValid()) {
                 geom.normalize(); // validate does not pick up rings in the wrong order - this will fix that
                 return geom; // If the multipolygon is valid just return it
             }
             Polygonizer polygonizer = new Polygonizer();
-            for(int n = geom.getNumGeometries(); n-- > 0;){
-                addPolygon((Polygon)geom.getGeometryN(n), polygonizer);
+            for (int n = geom.getNumGeometries(); n-- > 0; ) {
+                addPolygon((Polygon) geom.getGeometryN(n), polygonizer);
             }
             return toPolygonGeometry(polygonizer.getPolygons(), geom.getFactory());
-        }else{
+        } else {
             return geom; // In my case, I only care about polygon / multipolygon geometries
         }
     }
 
     /**
      * Add all line strings from the polygon given to the polygonizer given
      *
-     * @param polygon polygon from which to extract line strings
+     * @param polygon     polygon from which to extract line strings
      * @param polygonizer polygonizer
      */
-    private static void addPolygon(Polygon polygon, Polygonizer polygonizer){
+    private static void addPolygon(Polygon polygon, Polygonizer polygonizer) {
         addLineString(polygon.getExteriorRing(), polygonizer);
-        for(int n = polygon.getNumInteriorRing(); n-- > 0;){
+        for (int n = polygon.getNumInteriorRing(); n-- > 0; ) {
             addLineString(polygon.getInteriorRingN(n), polygonizer);
         }
     }
 
     /**
      * Add the linestring given to the polygonizer
      *
-     * @param lineString line string
+     * @param lineString  line string
      * @param polygonizer polygonizer
      */
-    private static void addLineString(LineString lineString, Polygonizer polygonizer){
+    private static void addLineString(LineString lineString, Polygonizer polygonizer) {
 
-        if(lineString instanceof LinearRing){ // LinearRings are treated differently to line strings : we need a LineString NOT a LinearRing
+        if (lineString instanceof LinearRing) { // LinearRings are treated differently to line strings : we need a LineString NOT a LinearRing
             lineString = lineString.getFactory().createLineString(lineString.getCoordinateSequence());
         }
 
@@ -81,11 +82,11 @@ private static void addLineString(LineString lineString, Polygonizer polygonizer
      * Get a geometry from a collection of polygons.
      *
      * @param polygons collection
-     * @param factory factory to generate MultiPolygon if required
+     * @param factory  factory to generate MultiPolygon if required
      * @return null if there were no polygons, the polygon if there was only one, or a MultiPolygon containing all polygons otherwise
      */
-    private static Geometry toPolygonGeometry(Collection<Polygon> polygons, GeometryFactory factory){
-        switch(polygons.size()){
+    private static Geometry toPolygonGeometry(Collection<Polygon> polygons, GeometryFactory factory) {
+        switch (polygons.size()) {
             case 0:
                 return null; // No valid polygons!
             case 1:
@@ -94,7 +95,7 @@ private static Geometry toPolygonGeometry(Collection<Polygon> polygons, Geometry
                 //polygons may still overlap! Need to sym difference them
                 Iterator<Polygon> iter = polygons.iterator();
                 Geometry ret = iter.next();
-                while(iter.hasNext()){
+                while (iter.hasNext()) {
                     ret = ret.symDifference(iter.next());
                 }
                 return ret;

src/main/java/org/wowtools/neo4j/rtree/geometry2dold/spatial/EmptyMonitor.java

@@ -1,19 +1,19 @@
 /**
  * Copyright (c) 2002-2013 "Neo Technology," Network Engine for Objects in Lund
  * AB [http://neotechnology.com]
- *
+ * <p>
  * This file is part of Neo4j Spatial.
- *
+ * <p>
  * Neo4j is free software: you can redistribute it and/or modify it under the
  * terms of the GNU General Public License as published by the Free Software
  * Foundation, either version 3 of the License, or (at your option) any later
  * version.
- *
+ * <p>
  * This program is distributed in the hope that it will be useful, but WITHOUT
  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
  * details.
- *
+ * <p>
  * You should have received a copy of the GNU General Public License along with
  * this program. If not, see <http://www.gnu.org/licenses/>.
  */
@@ -26,32 +26,26 @@
 import java.util.List;
 import java.util.Map;
 
-public class EmptyMonitor implements TreeMonitor
-{
+public class EmptyMonitor implements TreeMonitor {
     @Override
-    public void setHeight(int height)
-    {
+    public void setHeight(int height) {
     }
 
-    public int getHeight()
-    {
+    public int getHeight() {
         return -1;
     }
 
     @Override
-    public void addNbrRebuilt(RTreeIndex rtree)
-    {
+    public void addNbrRebuilt(RTreeIndex rtree) {
     }
 
     @Override
-    public int getNbrRebuilt()
-    {
+    public int getNbrRebuilt() {
         return -1;
     }
 
     @Override
-    public void addSplit(Node indexNode)
-    {
+    public void addSplit(Node indexNode) {
 
     }
 
@@ -66,8 +60,7 @@ public void afterMergeTree(Node indexNode) {
     }
 
     @Override
-    public int getNbrSplit()
-    {
+    public int getNbrSplit() {
         return -1;
     }
 
@@ -82,8 +75,7 @@ public Map<String, Integer> getCaseCounts() {
     }
 
     @Override
-    public void reset()
-    {
+    public void reset() {
 
     }