11 #ifndef BOOST_GEOMETRY_INDEX_ADAPTORS_QUERY_HPP
12 #define BOOST_GEOMETRY_INDEX_ADAPTORS_QUERY_HPP
18 namespace boost {
namespace geometry {
namespace index {
24 template <
typename Index>
29 NOT_IMPLEMENTED_FOR_THIS_INDEX,
32 typedef int* iterator;
33 typedef const int* const_iterator;
35 template <
typename Predicates>
41 inline iterator
begin() {
return 0; }
42 inline iterator
end() {
return 0; }
43 inline const_iterator
begin()
const {
return 0; }
44 inline const_iterator
end()
const {
return 0; }
49 template<
typename Predicates>
52 inline explicit query(Predicates
const& pred)
56 Predicates
const& predicates;
59 template<
typename Index,
typename Predicates>
60 index::adaptors::detail::query_range<Index>
63 index::adaptors::detail::query<Predicates>
const& f)
65 return index::adaptors::detail::query_range<Index>(si, f.predicates);
77 template <
typename Predicates>
78 detail::query<Predicates>
81 return detail::query<Predicates>(pred);
88 #endif // BOOST_GEOMETRY_INDEX_ADAPTORS_QUERY_HPP
rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::const_iterator end(rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree)
Returns the iterator pointing at the end of the rtree values range.
Definition: rtree.hpp:2117
rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::const_iterator begin(rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree)
Returns the iterator pointing at the begin of the rtree values range.
Definition: rtree.hpp:2084
rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::size_type query(rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree, Predicates const &predicates, OutIter out_it)
Finds values meeting passed predicates e.g. nearest to some Point and/or intersecting some Box...
Definition: rtree.hpp:1982
detail::query< Predicates > queried(Predicates const &pred)
The query index adaptor generator.
Definition: query.hpp:79