boost_mirror/geometry
1
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2025-05-09 23:24:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

geometry.index example: type-erased iterator defined in rtree used in benchmark_experimental.

Browse Source 
[SVN r84100]
This commit is contained in:
Adam Wulkiewicz 2013-05-01 14:23:22 +00:00
parent 2fdd1c6ab6
commit 7ce801fd4a
1 changed files with 4 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
index/example/benchmark_experimental.cpp
View File

@ -24,22 +24,6 @@ namespace bgi = bg::index;
typedef bg::model::point<double, 2, bg::cs::cartesian> P;
typedef bg::model::box<P> B;
#ifdef BOOST_GEOMETRY_INDEX_DETAIL_ENABLE_TYPE_ERASED_ITERATORS
#include <boost/type_erasure/iterator.hpp>
typedef boost::type_erasure::any<
boost::type_erasure::iterator<
boost::single_pass_traversal_tag,
boost::type_erasure::_self,
B const&,
std::ptrdiff_t,
const B
>
> iterator;
#endif
int main()
{
typedef boost::chrono::thread_clock clock_t;
@ -140,8 +124,8 @@ int main()
float x = coords[i].first;
float y = coords[i].second;
result.clear();
iterator first = t.qbegin(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))));
iterator last = t.qend(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))));
RT::const_query_iterator first = t.qbegin(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))));
RT::const_query_iterator last = t.qend(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))));
std::copy(first, last, std::back_inserter(result));
temp += result.size();
}
@ -220,8 +204,8 @@ int main()
float x = coords[i].first;
float y = coords[i].second;
result.clear();
iterator first = t.qbegin(bgi::nearest(P(x, y), neighbours_count));
iterator last = t.qend(bgi::nearest(P(x, y), neighbours_count));
RT::const_query_iterator first = t.qbegin(bgi::nearest(P(x, y), neighbours_count));
RT::const_query_iterator last = t.qend(bgi::nearest(P(x, y), neighbours_count));
std::copy(first, last, std::back_inserter(result));
temp += result.size();
}