test svg - refactor common code into separate *.hpp
This commit is contained in:
parent
74776631c5
commit
a707d5cd65
3 changed files with 47 additions and 32 deletions
|
@ -30,27 +30,10 @@
|
|||
#include <mapnik/svg/svg_converter.hpp>
|
||||
#include <mapnik/svg/svg_path_adapter.hpp>
|
||||
#include <mapnik/svg/svg_path_attributes.hpp>
|
||||
|
||||
#include <cmath>
|
||||
#include "util.hpp"
|
||||
#include <fstream>
|
||||
#include <iterator>
|
||||
|
||||
namespace detail {
|
||||
|
||||
template <int N = 6>
|
||||
struct vertex_equal
|
||||
{
|
||||
template <typename T>
|
||||
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") {
|
||||
|
||||
SECTION("SVG i/o")
|
||||
|
|
|
@ -27,22 +27,10 @@
|
|||
#include <mapnik/svg/svg_path_parser.hpp>
|
||||
#include <mapnik/svg/svg_converter.hpp>
|
||||
#include <mapnik/marker.hpp>
|
||||
#include "util.hpp"
|
||||
|
||||
namespace {
|
||||
|
||||
template <int N = 6>
|
||||
struct vertex_equal
|
||||
{
|
||||
template <typename T>
|
||||
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);
|
||||
}
|
||||
};
|
||||
|
||||
template <typename Expected>
|
||||
void test_path_parser(std::string const& str, Expected const& expected)
|
||||
{
|
||||
|
@ -62,7 +50,7 @@ void test_path_parser(std::string const& str, Expected const& expected)
|
|||
vec.emplace_back(x, y, cmd);
|
||||
//std::cerr << "std::make_tuple(" << x << ", " << y << ", " << cmd << ")," << std::endl;
|
||||
}
|
||||
REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin(), vertex_equal<3>()));
|
||||
REQUIRE(std::equal(expected.begin(),expected.end(), vec.begin(), detail::vertex_equal<3>()));
|
||||
}
|
||||
} // anonymous ns
|
||||
|
||||
|
|
44
test/unit/svg/util.hpp
Normal file
44
test/unit/svg/util.hpp
Normal file
|
@ -0,0 +1,44 @@
|
|||
/*****************************************************************************
|
||||
*
|
||||
* 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
|
||||
*
|
||||
*****************************************************************************/
|
||||
|
||||
#ifndef TEST_UNIT_SVG_UTIL_HPP
|
||||
#define TEST_UNIT_SVG_UTIL_HPP
|
||||
|
||||
#include <cmath>
|
||||
|
||||
namespace detail {
|
||||
|
||||
template <int N = 6>
|
||||
struct vertex_equal
|
||||
{
|
||||
template <typename T>
|
||||
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);
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
#endif // TEST_UNIT_SVG_UTIL_HPP
|
Loading…
Add table
Reference in a new issue