mapnik/tests/cpp_tests/label_algo_test.cpp

84 lines
2.9 KiB
C++
Raw Normal View History

#include <boost/detail/lightweight_test.hpp>
#include <iostream>
#include <mapnik/geometry.hpp>
#include <mapnik/geom_util.hpp>
2013-05-25 02:21:55 +02:00
#include <vector>
2013-05-26 01:04:40 +02:00
#include <algorithm>
2013-05-25 02:21:55 +02:00
int main(int argc, char** argv)
{
2013-05-25 02:21:55 +02:00
std::vector<std::string> args;
for (int i=1;i<argc;++i)
{
args.push_back(argv[i]);
}
bool quiet = std::find(args.begin(), args.end(), "-q")!=args.end();
2014-10-21 04:55:11 +02:00
try
{
// reused these for simplicity
double x,y;
mapnik::geometry_type pt(mapnik::new_geometry::geometry_types::Point);
// single point
2014-10-21 04:55:11 +02:00
pt.move_to(10,10);
{
mapnik::vertex_adapter va(pt);
BOOST_TEST( mapnik::label::centroid(va, x, y) );
BOOST_TEST( x == 10 );
BOOST_TEST( y == 10 );
}
2014-10-21 04:55:11 +02:00
// two points
pt.move_to(20,20);
{
mapnik::vertex_adapter va(pt);
BOOST_TEST( mapnik::label::centroid(va, x, y) );
BOOST_TEST_EQ( x, 15 );
BOOST_TEST_EQ( y, 15 );
}
2014-10-21 04:55:11 +02:00
// line with two verticies
mapnik::geometry_type line(mapnik::new_geometry::geometry_types::LineString);
2014-10-21 04:55:11 +02:00
line.move_to(0,0);
line.line_to(50,50);
mapnik::vertex_adapter va(line);
BOOST_TEST( mapnik::label::centroid(va, x, y) );
2014-10-21 04:55:11 +02:00
BOOST_TEST( x == 25 );
BOOST_TEST( y == 25 );
2013-03-15 02:33:59 +01:00
2014-10-21 04:55:11 +02:00
// TODO - centroid and interior should be equal but they appear not to be (check largest)
// MULTIPOLYGON(((-52 40,-60 32,-68 40,-60 48,-52 40)),((-60 50,-80 30,-100 49.9999999999999,-80.0000000000001 70,-60 50)),((-52 60,-60 52,-68 60,-60 68,-52 60)))
2014-10-21 04:55:11 +02:00
// hit tests
{
mapnik::geometry_type pt_hit(mapnik::new_geometry::geometry_types::Point);
pt_hit.move_to(10,10);
mapnik::vertex_adapter va(pt_hit);
BOOST_TEST( mapnik::label::hit_test(va, 10, 10, 0.1) );
BOOST_TEST( !mapnik::label::hit_test(va, 9, 9, 0) );
BOOST_TEST( mapnik::label::hit_test(va, 9, 9, 1.5) );
}
{
mapnik::geometry_type line_hit(mapnik::new_geometry::geometry_types::LineString);
line_hit.move_to(0,0);
line_hit.line_to(50,50);
mapnik::vertex_adapter va(line_hit);
BOOST_TEST( mapnik::label::hit_test(va, 0, 0, 0.001) );
BOOST_TEST( !mapnik::label::hit_test(va, 1, 1, 0) );
BOOST_TEST( mapnik::label::hit_test(va, 1, 1, 1.001) );
}
2014-10-21 04:55:11 +02:00
}
catch (std::exception const & ex)
{
std::clog << ex.what() << "\n";
BOOST_TEST(false);
}
if (!::boost::detail::test_errors()) {
2013-05-25 02:21:55 +02:00
if (quiet) std::clog << "\x1b[1;32m.\x1b[0m";
else std::clog << "C++ label algorithms: \x1b[1;32m✓ \x1b[0m\n";
::boost::detail::report_errors_remind().called_report_errors_function = true;
} else {
return ::boost::report_errors();
}
}