mapnik/src/simplify.cpp
Artem Pavlenko e61128056f clang-format -
+QualifierAlignment: Right
+Standard: c++20
2025-07-14 14:49:23 +01:00

40 lines
1.2 KiB
C++

// mapnik
#include <mapnik/simplify.hpp>
#include <mapnik/warning.hpp>
MAPNIK_DISABLE_WARNING_PUSH
#include <mapnik/warning_ignore.hpp>
#include <boost/assign/list_of.hpp>
#include <boost/bimap.hpp>
MAPNIK_DISABLE_WARNING_POP
namespace mapnik {
using simplify_algorithm_lookup_type = boost::bimap<simplify_algorithm_e, std::string>;
static simplify_algorithm_lookup_type const simplify_lookup =
boost::assign::list_of<simplify_algorithm_lookup_type::relation>(radial_distance, "radial-distance")(
douglas_peucker,
"douglas-peucker")(visvalingam_whyatt, "visvalingam-whyatt")(zhao_saalfeld, "zhao-saalfeld");
std::optional<simplify_algorithm_e> simplify_algorithm_from_string(std::string const& name)
{
simplify_algorithm_lookup_type::right_const_iterator right_iter = simplify_lookup.right.find(name);
if (right_iter != simplify_lookup.right.end())
{
return right_iter->second;
}
return std::nullopt;
}
std::optional<std::string> simplify_algorithm_to_string(simplify_algorithm_e value)
{
simplify_algorithm_lookup_type::left_const_iterator left_iter = simplify_lookup.left.find(value);
if (left_iter != simplify_lookup.left.end())
{
return left_iter->second;
}
return std::nullopt;
}
} // namespace mapnik