483 lines
18 KiB
C++
483 lines
18 KiB
C++
// Boost.Geometry Index
|
|
// Additional tests
|
|
|
|
// Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
|
|
|
|
// Use, modification and distribution is subject to the Boost Software License,
|
|
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#define BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
|
|
#include <iostream>
|
|
|
|
#include <boost/chrono.hpp>
|
|
#include <boost/foreach.hpp>
|
|
#include <boost/random.hpp>
|
|
#include <boost/range/algorithm/copy.hpp>
|
|
|
|
#include <boost/geometry.hpp>
|
|
#include <boost/geometry/index/rtree.hpp>
|
|
#include <boost/geometry/geometries/linestring.hpp>
|
|
#include <boost/geometry/geometries/segment.hpp>
|
|
|
|
#include <boost/geometry/index/detail/rtree/utilities/are_levels_ok.hpp>
|
|
#include <boost/geometry/index/detail/rtree/utilities/are_boxes_ok.hpp>
|
|
|
|
namespace bg = boost::geometry;
|
|
namespace bgi = bg::index;
|
|
|
|
typedef bg::model::point<double, 2, bg::cs::cartesian> P;
|
|
typedef bg::model::box<P> B;
|
|
typedef bg::model::linestring<P> LS;
|
|
typedef bg::model::segment<P> S;
|
|
//typedef P V;
|
|
typedef B V;
|
|
//typedef S V;
|
|
//#define SEGMENT_INDEXABLE
|
|
|
|
template <typename V>
|
|
struct generate_value {};
|
|
|
|
template <>
|
|
struct generate_value<B>
|
|
{
|
|
static inline B apply(float x, float y) { return B(P(x - 0.5f, y - 0.5f), P(x + 0.5f, y + 0.5f)); }
|
|
};
|
|
|
|
template <>
|
|
struct generate_value<S>
|
|
{
|
|
static inline S apply(float x, float y) { return S(P(x - 0.5f, y - 0.5f), P(x + 0.5f, y + 0.5f)); }
|
|
};
|
|
|
|
template <>
|
|
struct generate_value<P>
|
|
{
|
|
static inline P apply(float x, float y) { return P(x, y); }
|
|
};
|
|
|
|
//#include <boost/geometry/extensions/nsphere/nsphere.hpp>
|
|
//typedef bg::model::nsphere<P, double> NS;
|
|
//typedef NS V;
|
|
//
|
|
//template <>
|
|
//struct generate_value<NS>
|
|
//{
|
|
// static inline NS apply(float x, float y) { return NS(P(x, y), 0.5); }
|
|
//};
|
|
|
|
template <typename I1, typename I2, typename O>
|
|
void mycopy(I1 first, I2 last, O o)
|
|
{
|
|
for ( ; first != last ; ++o, ++first )
|
|
*o = *first;
|
|
}
|
|
|
|
//#define BOOST_GEOMETRY_INDEX_BENCHMARK_DEBUG
|
|
|
|
int main()
|
|
{
|
|
typedef boost::chrono::thread_clock clock_t;
|
|
typedef boost::chrono::duration<float> dur_t;
|
|
|
|
#ifndef BOOST_GEOMETRY_INDEX_BENCHMARK_DEBUG
|
|
size_t values_count = 1000000;
|
|
size_t queries_count = 100000;
|
|
size_t nearest_queries_count = 20000;
|
|
unsigned neighbours_count = 10;
|
|
size_t path_queries_count = 2000;
|
|
size_t path_queries_count2 = 20000;
|
|
unsigned path_values_count = 10;
|
|
#else
|
|
size_t values_count = 1000;
|
|
size_t queries_count = 1;
|
|
size_t nearest_queries_count = 1;
|
|
unsigned neighbours_count = 10;
|
|
size_t path_queries_count = 1;
|
|
size_t path_queries_count2 = 1;
|
|
unsigned path_values_count = 10;
|
|
#endif
|
|
|
|
float max_val = static_cast<float>(values_count / 2);
|
|
std::vector< std::pair<float, float> > coords;
|
|
std::vector<V> values;
|
|
|
|
//randomize values
|
|
{
|
|
boost::mt19937 rng;
|
|
//rng.seed(static_cast<unsigned int>(std::time(0)));
|
|
boost::uniform_real<float> range(-max_val, max_val);
|
|
boost::variate_generator<boost::mt19937&, boost::uniform_real<float> > rnd(rng, range);
|
|
|
|
coords.reserve(values_count);
|
|
|
|
std::cout << "randomizing data\n";
|
|
for ( size_t i = 0 ; i < values_count ; ++i )
|
|
{
|
|
float x = rnd();
|
|
float y = rnd();
|
|
coords.push_back(std::make_pair(x, y));
|
|
values.push_back(generate_value<V>::apply(x, y));
|
|
}
|
|
std::cout << "randomized\n";
|
|
}
|
|
|
|
typedef bgi::rtree<V, bgi::linear<16, 4> > RT;
|
|
//typedef bgi::rtree<V, bgi::quadratic<16, 4> > RT;
|
|
//typedef bgi::rtree<V, bgi::rstar<16, 4> > RT;
|
|
|
|
std::cout << "sizeof rtree: " << sizeof(RT) << std::endl;
|
|
|
|
for (;;)
|
|
{
|
|
std::vector<V> result;
|
|
result.reserve(100);
|
|
B result_one;
|
|
|
|
// packing test
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
|
|
RT t(values.begin(), values.end());
|
|
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - pack " << values_count /*<< '\n'*/;
|
|
|
|
std::cout << (bgi::detail::rtree::utilities::are_levels_ok(t) ? " ok" : " NOK")
|
|
<< (bgi::detail::rtree::utilities::are_boxes_ok(t) ? " ok\n" : "NOK\n");
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(B) " << queries_count << " found " << temp << '\n';
|
|
}
|
|
}
|
|
|
|
RT t;
|
|
|
|
// inserting test
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
t.insert(values);
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - insert " << values_count /*<< '\n'*/;
|
|
|
|
std::cout << (bgi::detail::rtree::utilities::are_levels_ok(t) ? " ok" : " NOK")
|
|
<< (bgi::detail::rtree::utilities::are_boxes_ok(t) ? " ok\n" : "NOK\n");
|
|
}
|
|
|
|
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(B) " << queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
boost::copy(t | bgi::adaptors::queried(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))),
|
|
std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - range queried(B) " << queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
#ifdef BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
std::copy(
|
|
t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))),
|
|
t.qend_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))),
|
|
std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - qbegin(B) qend(B) " << queries_count << " found " << temp << '\n';
|
|
}
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
mycopy(
|
|
t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))),
|
|
t.qend_(),
|
|
std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - qbegin(B) qend() " << queries_count << " found " << temp << '\n';
|
|
}
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
boost::copy(
|
|
std::make_pair(
|
|
t.qbegin_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10)))),
|
|
t.qend_(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))))
|
|
), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - range qbegin(B) qend(B)" << queries_count << " found " << temp << '\n';
|
|
}
|
|
#endif // BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
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();
|
|
std::copy(first, last, std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - type-erased qbegin(B) qend() " << queries_count << " found " << temp << '\n';
|
|
}
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
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();
|
|
boost::copy(std::make_pair(first, last), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - range type-erased qbegin(B) qend() " << queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
#ifndef SEGMENT_INDEXABLE
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < queries_count / 2 ; ++i )
|
|
{
|
|
float x1 = coords[i].first;
|
|
float y1 = coords[i].second;
|
|
float x2 = coords[i+1].first;
|
|
float y2 = coords[i+1].second;
|
|
float x3 = coords[i+2].first;
|
|
float y3 = coords[i+2].second;
|
|
result.clear();
|
|
t.query(
|
|
bgi::intersects(B(P(x1 - 10, y1 - 10), P(x1 + 10, y1 + 10)))
|
|
&&
|
|
!bgi::within(B(P(x2 - 10, y2 - 10), P(x2 + 10, y2 + 10)))
|
|
&&
|
|
!bgi::covered_by(B(P(x3 - 10, y3 - 10), P(x3 + 10, y3 + 10)))
|
|
,
|
|
std::back_inserter(result)
|
|
);
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(i && !w && !c) " << queries_count << " found " << temp << '\n';
|
|
}
|
|
#endif
|
|
|
|
result.clear();
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < nearest_queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first + 100;
|
|
float y = coords[i].second + 100;
|
|
result.clear();
|
|
temp += t.query(bgi::nearest(P(x, y), neighbours_count), std::back_inserter(result));
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(nearest(P, " << neighbours_count << ")) " << nearest_queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
#ifdef BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < nearest_queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first + 100;
|
|
float y = coords[i].second + 100;
|
|
result.clear();
|
|
std::copy(
|
|
t.qbegin_(bgi::nearest(P(x, y), neighbours_count)),
|
|
t.qend_(bgi::nearest(P(x, y), neighbours_count)),
|
|
std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - qbegin(nearest(P, " << neighbours_count << ")) qend(n) " << nearest_queries_count << " found " << temp << '\n';
|
|
}
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < nearest_queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first + 100;
|
|
float y = coords[i].second + 100;
|
|
result.clear();
|
|
mycopy(
|
|
t.qbegin_(bgi::nearest(P(x, y), neighbours_count)),
|
|
t.qend_(),
|
|
std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - qbegin(nearest(P, " << neighbours_count << ")) qend() " << nearest_queries_count << " found " << temp << '\n';
|
|
}
|
|
#endif // BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < nearest_queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
result.clear();
|
|
RT::const_query_iterator first = t.qbegin(bgi::nearest(P(x, y), neighbours_count));
|
|
RT::const_query_iterator last = t.qend();
|
|
std::copy(first, last, std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - type-erased qbegin(nearest(P, " << neighbours_count << ")) qend() " << nearest_queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
#ifdef BOOST_GEOMETRY_INDEX_DETAIL_EXPERIMENTAL
|
|
#ifndef SEGMENT_INDEXABLE
|
|
|
|
{
|
|
LS ls;
|
|
ls.resize(6);
|
|
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < path_queries_count ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
for ( int i = 0 ; i < 3 ; ++i )
|
|
{
|
|
float foo = i*max_val/300;
|
|
ls[2*i] = P(x, y+foo);
|
|
ls[2*i+1] = P(x+max_val/100, y+foo);
|
|
}
|
|
result.clear();
|
|
t.query(bgi::path(ls, path_values_count), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(path(LS6, " << path_values_count << ")) " << path_queries_count << " found " << temp << '\n';
|
|
}
|
|
|
|
{
|
|
LS ls;
|
|
ls.resize(2);
|
|
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < path_queries_count2 ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
ls[0] = P(x, y);
|
|
ls[1] = P(x+max_val/100, y+max_val/100);
|
|
result.clear();
|
|
t.query(bgi::path(ls, path_values_count), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(path(LS2, " << path_values_count << ")) " << path_queries_count2 << " found " << temp << '\n';
|
|
}
|
|
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
size_t temp = 0;
|
|
for (size_t i = 0 ; i < path_queries_count2 ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
S seg(P(x, y), P(x+max_val/100, y+max_val/100));
|
|
result.clear();
|
|
t.query(bgi::path(seg, path_values_count), std::back_inserter(result));
|
|
temp += result.size();
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - query(path(S, " << path_values_count << ")) " << path_queries_count2 << " found " << temp << '\n';
|
|
}
|
|
#endif
|
|
#endif
|
|
{
|
|
clock_t::time_point start = clock_t::now();
|
|
for (size_t i = 0 ; i < values_count / 10 ; ++i )
|
|
{
|
|
float x = coords[i].first;
|
|
float y = coords[i].second;
|
|
|
|
t.remove(generate_value<V>::apply(x, y));
|
|
}
|
|
dur_t time = clock_t::now() - start;
|
|
std::cout << time << " - remove " << values_count / 10 << '\n';
|
|
|
|
std::cout << (bgi::detail::rtree::utilities::are_boxes_ok(t) ? " boxes ok\n" : "boxes NOT ok\n");
|
|
}
|
|
|
|
std::cout << "------------------------------------------------\n";
|
|
}
|
|
|
|
return 0;
|
|
}
|