boost/geometry
2
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2026-02-13 00:22:10 +00:00
Code Issues Projects Releases Wiki Activity

rtree non-std allocators support implemented.

Browse Source 
interprocess test added.

[SVN r82864]
This commit is contained in:
Adam Wulkiewicz
2013-02-14 01:11:17 +00:00
parent ad50724a45
commit b7f592f1f4
9 changed files with 155 additions and 133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
test/rtree/rtree_interprocess.cpp
View File

@@ -16,7 +16,7 @@
#include <boost/interprocess/managed_shared_memory.hpp>
#include <boost/interprocess/allocators/allocator.hpp>
template <typename Value, typename Parameters>
template <typename Point, typename Parameters>
void test_rtree_interprocess(Parameters const& parameters = Parameters())
{
namespace bi = boost::interprocess;
@@ -27,58 +27,43 @@ void test_rtree_interprocess(Parameters const& parameters = Parameters())
} remover;
bi::managed_shared_memory segment(bi::create_only, "shmem", 65535);
typedef bi::allocator<Value, bi::managed_shared_memory::segment_manager> shmem_alloc;
typedef bi::allocator<Point, bi::managed_shared_memory::segment_manager> shmem_alloc;
typedef bgi::rtree<Value, Parameters, bgi::translator::def<Value>, shmem_alloc> Tree;
test_rtree_for_box<Point>(parameters, shmem_alloc(segment.get_segment_manager()));
Tree * tree = segment.construct<Tree>("Tree")(parameters, bgi::translator::def<Value>(), shmem_alloc(segment.get_segment_manager()));
typedef typename Tree::bounds_type B;
std::vector<Value> input;
B qbox;
generate_rtree(*tree, input, qbox);
//typedef bgi::rtree<Value, Parameters, bgi::translator::def<Value>, shmem_alloc> Tree;
test_intersects(*tree, input, qbox);
test_disjoint(*tree, input, qbox);
test_covered_by(*tree, input, qbox);
test_overlaps(*tree, input, qbox);
//test_touches(*tree, input, qbox);
test_within(*tree, input, qbox);
//Tree * tree = segment.construct<Tree>("Tree")(parameters, bgi::translator::def<Value>(), shmem_alloc(segment.get_segment_manager()));
//typedef typename Tree::bounds_type B;
//
//std::vector<Value> input;
//B qbox;
//
//generate_rtree(*tree, input, qbox);
typedef typename bgi::detail::traits::point_type<B>::type P;
P pt;
bg::centroid(qbox, pt);
//test_intersects(*tree, input, qbox);
//test_disjoint(*tree, input, qbox);
//test_covered_by(*tree, input, qbox);
//test_overlaps(*tree, input, qbox);
////test_touches(*tree, input, qbox);
//test_within(*tree, input, qbox);
test_nearest_query_k(*tree, input, pt, 10);
test_nearest_query_not_found(*tree, generate_outside_point<P>::apply());
//typedef typename bgi::detail::traits::point_type<B>::type P;
//P pt;
//bg::centroid(qbox, pt);
segment.destroy_ptr(tree);
//test_nearest_query_k(*tree, input, pt, 10);
//test_nearest_query_not_found(*tree, generate_outside_point<P>::apply());
//segment.destroy_ptr(tree);
}
int test_main(int, char* [])
{
typedef bg::model::point<double, 2, bg::cs::cartesian> P2d;
typedef bg::model::box<P2d> B2d;
typedef std::pair<B2d, int> PB2d;
//test_rtree_interprocess<P2d>(bgi::linear<32, 8>());
test_rtree_interprocess<P2d>(bgi::runtime::linear(32, 8));
/*test_rtree_interprocess<B2d>(bgi::quadratic<32, 8>());
test_rtree_interprocess<B2d>(bgi::runtime::quadratic(32, 8));
test_rtree_interprocess<PB2d>(bgi::rstar<32, 8>());
test_rtree_interprocess<PB2d>(bgi::runtime::rstar(32, 8));
typedef bg::model::point<float, 3, bg::cs::cartesian> P3f;
typedef bg::model::box<P3f> B3f;
typedef std::pair<B3f, int> PB3f;
test_rtree_interprocess<P3f>(bgi::linear<32, 8>());
test_rtree_interprocess<P3f>(bgi::runtime::linear(32, 8));
test_rtree_interprocess<B3f>(bgi::quadratic<32, 8>());
test_rtree_interprocess<B3f>(bgi::runtime::quadratic(32, 8));
test_rtree_interprocess<PB3f>(bgi::rstar<32, 8>());
test_rtree_interprocess<PB3f>(bgi::runtime::rstar(32, 8));*/
typedef bg::model::point<float, 2, bg::cs::cartesian> P2f;
test_rtree_interprocess<P2f>(bgi::linear<32, 8>());
test_rtree_interprocess<P2f>(bgi::runtime::linear(32, 8));
return 0;
}