/***************************************************************************** * * This file is part of Mapnik (c++ mapping toolkit) * * Copyright (C) 2015 Artem Pavlenko * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * *****************************************************************************/ #include "catch.hpp" #include #include #include #include #include //#include //#include //#include #include #include #include #include #include #include // for xmlInitParser(), xmlCleanupParser() #include #include #include namespace detail { template struct vertex_equal { template bool operator() (T const& lhs, T const& rhs) const { static const double eps = 1.0 / std::pow(10,N); return (std::fabs(std::get<0>(lhs) - std::get<0>(rhs)) < eps) && (std::fabs(std::get<1>(lhs) - std::get<1>(rhs)) < eps) && std::get<2>(lhs) == std::get<2>(rhs); } }; } TEST_CASE("SVG parser") { xmlInitParser(); SECTION("SVG i/o") { std::string svg_name("FAIL"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); } SECTION("SVG parser color ") { std::string svg_name("./test/data/svg/color_fail.svg"); std::ifstream in(svg_name.c_str()); std::string svg_str((std::istreambuf_iterator(in)), std::istreambuf_iterator()); using namespace mapnik::svg; mapnik::svg_storage_type path; vertex_stl_adapter stl_storage(path.source()); svg_path_adapter svg_path(stl_storage); svg_converter_type svg(svg_path, path.attributes()); svg_parser p(svg); if (!p.parse_from_string(svg_str)) { for (auto const& msg : p.error_messages()) { REQUIRE(msg == "Failed to parse color: \"fail\""); } } } SECTION("SVG ") { // std::string svg_name("./test/data/svg/rect.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(0, 0, 20, 15)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; while ((cmd = path.vertex(&x,&y)) != mapnik::SEG_END) { vec.emplace_back(x, y, cmd); //std::cerr << x << "," << y << " cmd=" << cmd << std::endl; } std::vector> expected = { std::make_tuple(0, 0, 1), std::make_tuple(20, 0, 2), std::make_tuple(20, 15, 2), std::make_tuple(0, 15, 2), std::make_tuple(0, 0, 79) }; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin())); } SECTION("SVG rounded ") { // std::string svg_name("./test/data/svg/rounded_rect.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(0, 0, 20, 15)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; while ((cmd = path.vertex(&x,&y)) != mapnik::SEG_END) { vec.emplace_back(x, y, cmd); } std::vector> expected = {std::make_tuple(0, 5,1), std::make_tuple(0.481856, 2.85842,2), std::make_tuple(1.83455, 1.12961,2), std::make_tuple(3.79736, 0.146789,2), std::make_tuple(5, 0,2), std::make_tuple(15, 0,2), std::make_tuple(17.1416, 0.481856,2), std::make_tuple(18.8704, 1.83455,2), std::make_tuple(19.8532, 3.79736,2), std::make_tuple(20, 5,2), std::make_tuple(20, 10,2), std::make_tuple(19.5181, 12.1416,2), std::make_tuple(18.1654, 13.8704,2), std::make_tuple(16.2026, 14.8532,2), std::make_tuple(15, 15,2), std::make_tuple(5, 15,2), std::make_tuple(2.85842, 14.5181,2), std::make_tuple(1.12961, 13.1654,2), std::make_tuple(0.146789, 11.2026,2), std::make_tuple(0, 10,2), std::make_tuple(0, 10,95)}; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin(),detail::vertex_equal<3>())); } SECTION("SVG ") { // std::string svg_name("./test/data/svg/line.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(1.0,1.0,1199.0,399.0)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; std::size_t num_vertices = path.total_vertices(); //std::cerr << "Num vertices = " << num_vertices << std::endl; //std::cerr << "{"; for (std::size_t i = 0; i < num_vertices; ++i) { cmd = path.vertex(&x,&y); vec.emplace_back(x, y, cmd); //if (vec.size() > 1) std::cerr << ","; //std::cerr << std::setprecision(6) << "std::make_tuple(" << x << ", " << y << ", " << cmd << ")"; } //std::cerr << "}" << std::endl; std::vector> expected = {std::make_tuple(1, 1, 1), std::make_tuple(1199, 1, 2), std::make_tuple(1199, 399, 2), std::make_tuple(1, 399, 2), std::make_tuple(1, 1, 79), std::make_tuple(0, 0, 0), std::make_tuple(100, 300, 1), std::make_tuple(300, 100, 2), std::make_tuple(0, 0, 0), std::make_tuple(300, 300, 1), std::make_tuple(500, 100, 2), std::make_tuple(0, 0, 0), std::make_tuple(500, 300, 1), std::make_tuple(700, 100, 2), std::make_tuple(0, 0, 0), std::make_tuple(700, 300, 1), std::make_tuple(900, 100, 2), std::make_tuple(0, 0, 0), std::make_tuple(900, 300, 1), std::make_tuple(1100, 100, 2)}; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin())); } SECTION("SVG ") { // std::string svg_name("./test/data/svg/polyline.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(1.0,1.0,1199.0,399.0)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; std::size_t num_vertices = path.total_vertices(); for (std::size_t i = 0; i < num_vertices; ++i) { cmd = path.vertex(&x,&y); vec.emplace_back(x, y, cmd); } std::vector> expected = {std::make_tuple(1, 1, 1), std::make_tuple(1199, 1, 2), std::make_tuple(1199, 399, 2), std::make_tuple(1, 399, 2), std::make_tuple(1, 1, 79), std::make_tuple(0, 0, 0), std::make_tuple(50, 375, 1), std::make_tuple(150, 375, 2), std::make_tuple(150, 325, 2), std::make_tuple(250, 325, 2), std::make_tuple(250, 375, 2), std::make_tuple(350, 375, 2), std::make_tuple(350, 250, 2), std::make_tuple(450, 250, 2), std::make_tuple(450, 375, 2), std::make_tuple(550, 375, 2), std::make_tuple(550, 175, 2), std::make_tuple(650, 175, 2), std::make_tuple(650, 375, 2), std::make_tuple(750, 375, 2), std::make_tuple(750, 100, 2), std::make_tuple(850, 100, 2), std::make_tuple(850, 375, 2), std::make_tuple(950, 375, 2), std::make_tuple(950, 25, 2), std::make_tuple(1050, 25, 2), std::make_tuple(1050, 375, 2), std::make_tuple(1150, 375, 2)}; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin())); } SECTION("SVG ") { // std::string svg_name("./test/data/svg/polygon.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(1.0,1.0,1199.0,399.0)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; std::size_t num_vertices = path.total_vertices(); for (std::size_t i = 0; i < num_vertices; ++i) { cmd = path.vertex(&x,&y); vec.emplace_back(x, y, cmd); } std::vector> expected = {std::make_tuple(1, 1, 1), std::make_tuple(1199, 1, 2), std::make_tuple(1199, 399, 2), std::make_tuple(1, 399, 2), std::make_tuple(1, 1, 79), std::make_tuple(0, 0, 0), std::make_tuple(350, 75, 1), std::make_tuple(379, 161, 2), std::make_tuple(469, 161, 2), std::make_tuple(397, 215, 2), std::make_tuple(423, 301, 2), std::make_tuple(350, 250, 2), std::make_tuple(277, 301, 2), std::make_tuple(303, 215, 2), std::make_tuple(231, 161, 2), std::make_tuple(321, 161, 2), std::make_tuple(350, 75, 79), std::make_tuple(0, 0, 0), std::make_tuple(850, 75, 1), std::make_tuple(958, 137.5, 2), std::make_tuple(958, 262.5, 2), std::make_tuple(850, 325, 2), std::make_tuple(742, 262.6, 2), std::make_tuple(742, 137.5, 2), std::make_tuple(850, 75, 79)}; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin())); } SECTION("SVG ") { // std::string svg_name("./test/data/svg/gradient.svg"); std::shared_ptr marker = mapnik::marker_cache::instance().find(svg_name, false); REQUIRE(marker); REQUIRE(marker->is()); mapnik::marker_svg const& svg = mapnik::util::get(*marker); auto bbox = svg.bounding_box(); REQUIRE(bbox == mapnik::box2d(1.0,1.0,799.0,599.0)); auto storage = svg.get_data(); REQUIRE(storage); mapnik::svg::vertex_stl_adapter stl_storage(storage->source()); mapnik::svg::svg_path_adapter path(stl_storage); double x,y; unsigned cmd; std::vector> vec; std::size_t num_vertices = path.total_vertices(); for (std::size_t i = 0; i < num_vertices; ++i) { cmd = path.vertex(&x,&y); vec.emplace_back(x, y, cmd); } std::vector> expected = {std::make_tuple(1, 1, 1), std::make_tuple(799, 1, 2), std::make_tuple(799, 599, 2), std::make_tuple(1, 599, 2), std::make_tuple(1, 1, 79), std::make_tuple(0, 0, 0), std::make_tuple(100, 100, 1), std::make_tuple(700, 100, 2), std::make_tuple(700, 300, 2), std::make_tuple(100, 300, 2), std::make_tuple(100, 100, 79), std::make_tuple(0, 0, 0), std::make_tuple(100, 320, 1), std::make_tuple(700, 320, 2), std::make_tuple(700, 520, 2), std::make_tuple(100, 520, 2), std::make_tuple(100, 320, 79)}; REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin())); } xmlCleanupParser(); }