02df2d788f
This commit also adds the support for equals(Segment, Segment). During the creation of the rtree all metrics are calculated for Segments viewed as bounding Boxes. During the querying Segments are passed into the BG algorithms. This commit also fixes a compilation error related to the calculation of the Box/Box intersection in the index::detail::intersection_content(). Add indexed_point_view<> which allows to see Boxes and Segments as one of the Points. Move normalized_view<> to views/detail. Add index::detail::bounded_view<> which allows to see simple Geometry e.g. a Segment as its bounding Geometry e.g. a Box. TODO/RECONSIDER: 1. This commit adds return_ref_or_bounds() which returns const& for Points and Boxes and bounding Box view for Segment. The resulting object is then passed into various algorithms like covered_by() or within(). Whenever possible the algorithms should be implemented for the input parameters and the call to return_ref_or_bounds() removed. 2. It's possible that for Segments metrics (like the amount of overlap in the leaf node) could be calculated differently than for Boxes and naiive conversion to bounding Boxes is not fully correct. 3. The way how bounded_view<> works may be not correct for non-cartesian CS. Now, for Segments it just picks MIN and MAX coordinates on the fly which may not be ok e.g. for Segments defined in the spherical CS because of the "winding" of the coordinates.
112 lines
4.5 KiB
C++
112 lines
4.5 KiB
C++
// Boost.Geometry Index
|
|
// Rtree tests generator
|
|
|
|
// Copyright (c) 2011-2014 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)
|
|
|
|
#include <fstream>
|
|
#include <vector>
|
|
#include <string>
|
|
#include <boost/foreach.hpp>
|
|
#include <boost/assert.hpp>
|
|
#include <boost/tuple/tuple.hpp>
|
|
|
|
int main()
|
|
{
|
|
typedef boost::tuple<std::string, std::string> CT;
|
|
std::vector<CT> coordinate_types;
|
|
coordinate_types.push_back(boost::make_tuple("double", "d"));
|
|
//coordinate_types.push_back(boost::make_tuple("int", "i"));
|
|
//coordinate_types.push_back(boost::make_tuple("float", "f"));
|
|
|
|
std::vector<std::string> dimensions;
|
|
dimensions.push_back("2");
|
|
dimensions.push_back("3");
|
|
|
|
typedef boost::tuple<std::string, std::string> P;
|
|
std::vector<P> parameters;
|
|
parameters.push_back(boost::make_tuple("bgi::linear<5, 2>()", "lin"));
|
|
parameters.push_back(boost::make_tuple("bgi::dynamic_linear(5, 2)", "dlin"));
|
|
parameters.push_back(boost::make_tuple("bgi::quadratic<5, 2>()", "qua"));
|
|
parameters.push_back(boost::make_tuple("bgi::dynamic_quadratic(5, 2)", "dqua"));
|
|
parameters.push_back(boost::make_tuple("bgi::rstar<5, 2>()", "rst"));
|
|
parameters.push_back(boost::make_tuple("bgi::dynamic_rstar(5, 2)","drst"));
|
|
|
|
std::vector<std::string> indexables;
|
|
indexables.push_back("p");
|
|
indexables.push_back("b");
|
|
indexables.push_back("s");
|
|
|
|
typedef std::pair<std::string, std::string> TS;
|
|
std::vector<TS> testsets;
|
|
testsets.push_back(std::make_pair("testset::modifiers", "mod"));
|
|
testsets.push_back(std::make_pair("testset::queries", "que"));
|
|
testsets.push_back(std::make_pair("testset::additional", "add"));
|
|
|
|
BOOST_FOREACH(P const& p, parameters)
|
|
{
|
|
BOOST_FOREACH(TS const& ts, testsets)
|
|
{
|
|
BOOST_FOREACH(std::string const& i, indexables)
|
|
{
|
|
BOOST_FOREACH(std::string const& d, dimensions)
|
|
{
|
|
// If the I is Segment, generate only for 2d
|
|
if ( i == "s" && d != "2" )
|
|
{
|
|
continue;
|
|
}
|
|
|
|
BOOST_FOREACH(CT const& c, coordinate_types)
|
|
{
|
|
std::string filename = std::string() +
|
|
"rtree_" + boost::get<1>(p) + '_' + ts.second + '_' + i + d + boost::get<1>(c) + ".cpp";
|
|
|
|
std::ofstream f(filename.c_str(), std::ios::trunc);
|
|
|
|
f <<
|
|
"// Boost.Geometry Index\n" <<
|
|
"// Unit Test\n" <<
|
|
"\n" <<
|
|
"// Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland.\n" <<
|
|
"\n" <<
|
|
"// Use, modification and distribution is subject to the Boost Software License,\n" <<
|
|
"// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n" <<
|
|
"// http://www.boost.org/LICENSE_1_0.txt)\n" <<
|
|
"\n";
|
|
|
|
f <<
|
|
"#include <rtree/test_rtree.hpp>\n" <<
|
|
"\n";
|
|
|
|
std::string indexable_type;
|
|
std::string point_type = std::string("bg::model::point<") + boost::get<0>(c) + ", " + d + ", bg::cs::cartesian>";
|
|
if ( i == "p" )
|
|
indexable_type = point_type;
|
|
else if ( i == "b" )
|
|
indexable_type = std::string("bg::model::box< ") + point_type + " >";
|
|
else if ( i == "s" )
|
|
indexable_type = std::string("bg::model::segment< ") + point_type + " >";
|
|
else
|
|
BOOST_ASSERT(false);
|
|
|
|
f <<
|
|
"int test_main(int, char* [])\n" <<
|
|
"{\n" <<
|
|
" typedef " << indexable_type << " Indexable;\n" <<
|
|
" " << ts.first << "<Indexable>(" << boost::get<0>(p) << ", std::allocator<int>());\n" <<
|
|
" return 0;\n" <<
|
|
"}\n";
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|