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

rtree benchmarks slightly modified

Browse Source 
[SVN r83331]
This commit is contained in:
Adam Wulkiewicz 2013-03-06 17:55:11 +00:00
parent 50a8d0bed0
commit 3595b85142
2 changed files with 5 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
example/benchmark.cpp
View File

@ -45,24 +45,17 @@ int main()
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
{

18
example/benchmark2.cpp
View File

@ -23,32 +23,24 @@ int main()
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 )