mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-09 11:12:21 +00:00
geometry.index: nearest_query.cpp renamed to distance_query.cpp
[SVN r84214]
This commit is contained in:
@@ -1,6 +1,6 @@
|
||||
// Boost.Geometry Index
|
||||
//
|
||||
// R-tree k nearest neighbour query visitor implementation
|
||||
// R-tree distance (knn, path, etc. ) query visitor implementation
|
||||
//
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
@@ -8,8 +8,8 @@
|
||||
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt)
|
||||
|
||||
#ifndef BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_NEAREST_QUERY_HPP
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_NEAREST_QUERY_HPP
|
||||
#ifndef BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_DISTANCE_QUERY_HPP
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_DISTANCE_QUERY_HPP
|
||||
|
||||
namespace boost { namespace geometry { namespace index {
|
||||
|
||||
@@ -537,4 +537,4 @@ private:
|
||||
|
||||
}}} // namespace boost::geometry::index
|
||||
|
||||
#endif // BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_NEAREST_QUERY_HPP
|
||||
#endif // BOOST_GEOMETRY_INDEX_DETAIL_RTREE_VISITORS_DISTANCE_QUERY_HPP
|
||||
@@ -46,7 +46,7 @@
|
||||
#include <boost/geometry/index/detail/rtree/visitors/copy.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/destroy.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/spatial_query.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/nearest_query.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/distance_query.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/count.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/visitors/children_box.hpp>
|
||||
|
||||
@@ -720,7 +720,7 @@ public:
|
||||
If Value copy constructor or copy assignment throws.
|
||||
|
||||
\warning
|
||||
Only one \c nearest() perdicate may be passed to the query. Passing more of them results in compile-time assert.
|
||||
Only one \c nearest() perdicate may be passed to the query. Passing more of them results in compile-time error.
|
||||
|
||||
\param predicates Predicates.
|
||||
\param out_it The output iterator, e.g. generated by std::back_inserter().
|
||||
@@ -1446,7 +1446,7 @@ bgi::query(tree, bgi::nearest(pt, 5) && bgi::intersects(box), std::back_inserter
|
||||
If Value copy constructor or copy assignment throws.
|
||||
|
||||
\warning
|
||||
Only one \c nearest() perdicate may be passed to the query. Passing more of them results in compile-time assert.
|
||||
Only one \c nearest() perdicate may be passed to the query. Passing more of them results in compile-time error.
|
||||
|
||||
\ingroup rtree_functions
|
||||
|
||||
|
||||
Reference in New Issue
Block a user