import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
/**
 * Finds the closest node or edges within the specified maximum radius.
 *
 * @param x          the x position of the query point
 * @param y          the y position of the query point
 * @param nodeAction the action that needs to be executed when a node is found
 * @param edgeAction the action that needs to be executed when an edge is found
 */
@SuppressWarnings("squid:S1166") // No need to log the exception itself, a message is enough.
public void find(final double x, final double y,
                 final Consumer<Integer> nodeAction, final BiConsumer<Integer, Integer> edgeAction) {
    try {
        final Entry<Integer[], Geometry> result = tree.nearest(point(x, y), MAX_NEARNESS_DISTANCE, 1)
                .toBlocking()
                .first();

        if (result.geometry() instanceof Rectangle) {
            nodeAction.accept(result.value()[0]);
        } else if (result.geometry() instanceof Line) {
            edgeAction.accept(result.value()[0], result.value()[1]);
        }
    } catch (final NoSuchElementException e) {
        // There is no need to log the exception itself.
        LOGGER.debug("No node or edge found at position (" + x + ", " + y + ").");
    }
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
private <Object, S extends Geometry> byte[] createFBSByteArray(RTree<Object, S> tree) {
    final ByteArrayOutputStream os = new ByteArrayOutputStream();
    Func1<Object, byte[]> serializer = new Func1<Object, byte[]>() {
        @Override
        public byte[] call(Object o) {
            return new byte[0];
        }
    };
    Func1<byte[], Object> deserializer = new Func1<byte[], Object>() {
        @Override
        public Object call(byte[] bytes) {
            return null;
        }
    };
    Serializer<Object, S> fbSerializer = SerializerFlatBuffers.create(serializer,
            deserializer);
    try {
        fbSerializer.write(tree, os);
        os.close();
        return os.toByteArray();
    } catch (IOException e) {
        throw new RuntimeException(e);
    }
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
private <Object, S extends Geometry> RTree<Object, S> createFBSTree(byte [] byteArray) {
    Func1<Object, byte[]> serializer = new Func1<Object, byte[]>() {
        @Override
        public byte[] call(Object o) {
            return new byte[0];
        }
    };
    Func1<byte[], Object> deserializer = new Func1<byte[], Object>() {
        @Override
        public Object call(byte[] bytes) {
            return null;
        }
    };
    Serializer<Object, S> fbSerializer = SerializerFlatBuffers.create(serializer,
            deserializer);
    try {
        ByteArrayInputStream is = new ByteArrayInputStream(byteArray);
        return fbSerializer.read(is, byteArray.length, InternalStructure.SINGLE_ARRAY);
    } catch (IOException e) {
        throw new RuntimeException(e);
    }
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
/**
 * Find.
 *
 * @param longitude the longitude
 * @param latitude the latitude
 * @return the city
 */
public City find(Double longitude, Double latitude){
	if(longitude == null || latitude == null){
		return null;
	}
	Observable<Entry<City, Geometry>> result =  this.rtree.nearest(Geometries.pointGeographic(longitude, latitude), 10000, 1);
	if(result==null){
		return null;
	}
	try{
		return result.toBlocking().single().value();
	}catch(NoSuchElementException e){
		return null;
	}
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
/**
 * @return all tiles that intersect the specified bounding box.
 */
public List<TileBounds> findTilesInBox(final double minX,
                                       final double minY,
                                       final double maxX,
                                       final double maxY) {

    final Rectangle rectangle = Geometries.rectangle(minX, minY, maxX, maxY);
    final Observable<Entry<TileBounds, Geometry>> searchResults = tree.search(rectangle);
    return convertResultsToList(searchResults);
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
public static <T, S extends Geometry> Observable<Entry<T, S>> nearest(RTree<T, S> rtree, final Rectangle r, final double maxDistance, int maxCount) {
    return rtree.search(r, maxDistance).lift(
            new SortedOutputQueue<Entry<T, S>>(maxCount, Comparators
                    .<T, S> ascendingDistance(r)));
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
/**
 * @return all tiles that intersect the specified circle.
 */
public List<TileBounds> findTilesInCircle(final Circle circle) {
    final Observable<Entry<TileBounds, Geometry>> searchResults = tree.search(circle);
    return convertResultsToList(searchResults);
}
 

import com.github.davidmoten.rtree.geometry.Geometry; //导入依赖的package包/类
private List<TileBounds> convertResultsToList(final Observable<Entry<TileBounds, Geometry>> searchResults) {

        final List<TileBounds> matchingTiles = new ArrayList<>();

        // TODO: make sure use of toBlocking() here is appropriate

        final List<Entry<TileBounds, Geometry>> collectedResultList = searchResults.toList().toBlocking().single();
        for (final Entry<TileBounds, Geometry> entry : collectedResultList) {
            matchingTiles.add(entry.value());
        }

        return matchingTiles;
    }