Subject: [Boost-commit] svn:boost r83331 - sandbox-branches/geometry/index/example
From: adam.wulkiewicz_at_[hidden]
Date: 2013-03-06 12:55:12
Author: awulkiew
Date: 2013-03-06 12:55:11 EST (Wed, 06 Mar 2013)
New Revision: 83331
URL: http://svn.boost.org/trac/boost/changeset/83331
Log:
rtree benchmarks slightly modified
Text files modified:
sandbox-branches/geometry/index/example/benchmark.cpp | 7 -------
sandbox-branches/geometry/index/example/benchmark2.cpp | 18 +++++-------------
2 files changed, 5 insertions(+), 20 deletions(-)
Modified: sandbox-branches/geometry/index/example/benchmark.cpp
==============================================================================
--- sandbox-branches/geometry/index/example/benchmark.cpp (original)
+++ sandbox-branches/geometry/index/example/benchmark.cpp 2013-03-06 12:55:11 EST (Wed, 06 Mar 2013)
@@ -45,24 +45,17 @@
std::cout << "randomized\n";
}
- //typedef bg::model::d2::point_xy<double> P;
typedef bg::model::point<double, 2, bg::cs::cartesian> P;
typedef bg::model::box<P> B;
typedef bgi::rtree<B, bgi::linear<32, 8> > RT;
- //typedef bgi::rtree<B, bgi::runtime::linear > RT;
//typedef bgi::rtree<B, bgi::quadratic<32, 8> > RT;
- //typedef bgi::rtree<B, bgi::runtime::quadratic > RT;
//typedef bgi::rtree<B, bgi::rstar<32, 8> > RT;
- //typedef bgi::rtree<B, bgi::runtime::rstar > RT;
std::cout << "sizeof rtree: " << sizeof(RT) << std::endl;
for (;;)
{
RT t;
- //RT t(bgi::runtime::linear(32, 8));
- //RT t(bgi::runtime::quadratic(32, 8));
- //RT t(bgi::runtime::rstar(32, 8));
// inserting test
{
Modified: sandbox-branches/geometry/index/example/benchmark2.cpp
==============================================================================
--- sandbox-branches/geometry/index/example/benchmark2.cpp (original)
+++ sandbox-branches/geometry/index/example/benchmark2.cpp 2013-03-06 12:55:11 EST (Wed, 06 Mar 2013)
@@ -23,32 +23,24 @@
typedef boost::chrono::thread_clock clock_t;
typedef boost::chrono::duration<float> dur_t;
- size_t values_count = 501;
+ size_t values_count = 1001;
size_t count_start = 10;
- size_t count_stop = 500;
+ size_t count_stop = 1000;
size_t count_step = 10;
size_t insrem_count = 3000000;
std::vector< std::pair<float, float> > coords;
- //typedef bg::model::d2::point_xy<double> P;
typedef bg::model::point<double, 1, bg::cs::cartesian> P;
- typedef bgi::rtree<P, bgi::linear<8, 3> > RT;
- //typedef bgi::rtree<P, bgi::runtime::linear > RT;
- //typedef bgi::rtree<P, bgi::quadratic<32, 8> > RT;
- //typedef bgi::rtree<P, bgi::runtime::quadratic > RT;
- //typedef bgi::rtree<P, bgi::rstar<32, 8> > RT;
- //typedef bgi::rtree<P, bgi::runtime::rstar > RT;
+ //typedef bgi::rtree<P, bgi::linear<8, 3> > RT;
+ typedef bgi::rtree<P, bgi::quadratic<8, 3> > RT;
+ //typedef bgi::rtree<P, bgi::rstar<8, 3> > RT;
RT t;
std::set<float> s;
size_t val_i = 0;
for ( size_t curr_count = count_start ; curr_count < count_stop ; curr_count += count_step )
{
- //RT t(bgi::runtime::linear(32, 8));
- //RT t(bgi::runtime::quadratic(32, 8));
- //RT t(bgi::runtime::rstar(32, 8));
-
// inserting test
{
for (; val_i < curr_count ; ++val_i )