270 lines
7.1 KiB
C++
270 lines
7.1 KiB
C++
/*****************************************************************************
|
|
*
|
|
* This file is part of Mapnik (c++ mapping toolkit)
|
|
*
|
|
* Copyright (C) 2012 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
|
|
*
|
|
*****************************************************************************/
|
|
|
|
// mapnik
|
|
#include <mapnik/util/conversions.hpp>
|
|
#include <mapnik/value_types.hpp>
|
|
|
|
#include <cstring>
|
|
|
|
#include <boost/spirit/include/qi.hpp>
|
|
|
|
#if _MSC_VER
|
|
#define snprintf _snprintf
|
|
#endif
|
|
|
|
#define BOOST_SPIRIT_AUTO(domain_, name, expr) \
|
|
typedef boost::proto::result_of:: \
|
|
deep_copy<BOOST_TYPEOF(expr)>::type name##_expr_type; \
|
|
BOOST_SPIRIT_ASSERT_MATCH( \
|
|
boost::spirit::domain_::domain, name##_expr_type); \
|
|
BOOST_AUTO(name, boost::proto::deep_copy(expr)); \
|
|
|
|
// karma is used by default unless
|
|
// the boost version is too old
|
|
#define MAPNIK_KARMA_TO_STRING
|
|
|
|
#ifdef MAPNIK_KARMA_TO_STRING
|
|
#include <boost/version.hpp>
|
|
#if BOOST_VERSION < 104500
|
|
#undef MAPNIK_KARMA_TO_STRING
|
|
#else
|
|
#include <boost/spirit/include/karma.hpp>
|
|
#endif
|
|
#endif
|
|
|
|
namespace mapnik {
|
|
|
|
namespace util {
|
|
|
|
using namespace boost::spirit;
|
|
|
|
BOOST_SPIRIT_AUTO(qi, INTEGER, qi::int_)
|
|
#ifdef BIGINT
|
|
BOOST_SPIRIT_AUTO(qi, LONGLONG, qi::long_long)
|
|
#endif
|
|
BOOST_SPIRIT_AUTO(qi, FLOAT, qi::float_)
|
|
BOOST_SPIRIT_AUTO(qi, DOUBLE, qi::double_)
|
|
|
|
struct bool_symbols : qi::symbols<char,bool>
|
|
{
|
|
bool_symbols()
|
|
{
|
|
add("true",true)
|
|
("false",false)
|
|
("yes",true)
|
|
("no",false)
|
|
("on",true)
|
|
("off",false)
|
|
("1",true)
|
|
("0",false);
|
|
}
|
|
};
|
|
|
|
bool string2bool(const char * iter, const char * end, bool & result)
|
|
{
|
|
using boost::spirit::qi::no_case;
|
|
bool r = qi::phrase_parse(iter,end, no_case[bool_symbols()] ,ascii::space,result);
|
|
return r && (iter == end);
|
|
}
|
|
|
|
bool string2bool(std::string const& value, bool & result)
|
|
{
|
|
using boost::spirit::qi::no_case;
|
|
std::string::const_iterator str_beg = value.begin();
|
|
std::string::const_iterator str_end = value.end();
|
|
bool r = qi::phrase_parse(str_beg,str_end,no_case[bool_symbols()],ascii::space,result);
|
|
return r && (str_beg == str_end);
|
|
}
|
|
|
|
bool string2int(const char * iter, const char * end, int & result)
|
|
{
|
|
bool r = qi::phrase_parse(iter,end,INTEGER,ascii::space,result);
|
|
return r && (iter == end);
|
|
}
|
|
|
|
bool string2int(std::string const& value, int & result)
|
|
{
|
|
std::string::const_iterator str_beg = value.begin();
|
|
std::string::const_iterator str_end = value.end();
|
|
bool r = qi::phrase_parse(str_beg,str_end,INTEGER,ascii::space,result);
|
|
return r && (str_beg == str_end);
|
|
}
|
|
|
|
#ifdef BIGINT
|
|
bool string2int(const char * iter, const char * end, mapnik::value_integer & result)
|
|
{
|
|
bool r = qi::phrase_parse(iter,end,LONGLONG,ascii::space,result);
|
|
return r && (iter == end);
|
|
}
|
|
|
|
bool string2int(std::string const& value, mapnik::value_integer & result)
|
|
{
|
|
std::string::const_iterator str_beg = value.begin();
|
|
std::string::const_iterator str_end = value.end();
|
|
bool r = qi::phrase_parse(str_beg,str_end,LONGLONG,ascii::space,result);
|
|
return r && (str_beg == str_end);
|
|
}
|
|
#endif
|
|
|
|
bool string2double(std::string const& value, double & result)
|
|
{
|
|
std::string::const_iterator str_beg = value.begin();
|
|
std::string::const_iterator str_end = value.end();
|
|
bool r = qi::phrase_parse(str_beg,str_end,DOUBLE,ascii::space,result);
|
|
return r && (str_beg == str_end);
|
|
}
|
|
|
|
bool string2double(const char * iter, const char * end, double & result)
|
|
{
|
|
bool r = qi::phrase_parse(iter,end,DOUBLE,ascii::space,result);
|
|
return r && (iter == end);
|
|
}
|
|
|
|
bool string2float(std::string const& value, float & result)
|
|
{
|
|
std::string::const_iterator str_beg = value.begin();
|
|
std::string::const_iterator str_end = value.end();
|
|
bool r = qi::phrase_parse(str_beg,str_end,FLOAT,ascii::space,result);
|
|
return r && (str_beg == str_end);
|
|
}
|
|
|
|
bool string2float(const char * iter, const char * end, float & result)
|
|
{
|
|
bool r = qi::phrase_parse(iter,end,FLOAT,ascii::space,result);
|
|
return r && (iter == end);
|
|
}
|
|
|
|
// double conversion - here we use sprintf over karma to work
|
|
// around https://github.com/mapnik/mapnik/issues/1741
|
|
bool to_string(std::string & s, double val)
|
|
{
|
|
s.resize(s.capacity());
|
|
while (true)
|
|
{
|
|
size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%g", val));
|
|
if (n2 <= s.size())
|
|
{
|
|
s.resize(n2);
|
|
break;
|
|
}
|
|
s.resize(n2);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
#ifdef MAPNIK_KARMA_TO_STRING
|
|
|
|
bool to_string(std::string & str, int value)
|
|
{
|
|
namespace karma = boost::spirit::karma;
|
|
std::back_insert_iterator<std::string> sink(str);
|
|
return karma::generate(sink, value);
|
|
}
|
|
|
|
#ifdef BIGINT
|
|
bool to_string(std::string & str, mapnik::value_integer value)
|
|
{
|
|
namespace karma = boost::spirit::karma;
|
|
std::back_insert_iterator<std::string> sink(str);
|
|
return karma::generate(sink, value);
|
|
}
|
|
#endif
|
|
|
|
bool to_string(std::string & str, unsigned value)
|
|
{
|
|
namespace karma = boost::spirit::karma;
|
|
std::back_insert_iterator<std::string> sink(str);
|
|
return karma::generate(sink, value);
|
|
}
|
|
|
|
bool to_string(std::string & str, bool value)
|
|
{
|
|
namespace karma = boost::spirit::karma;
|
|
std::back_insert_iterator<std::string> sink(str);
|
|
return karma::generate(sink, value);
|
|
}
|
|
|
|
#else
|
|
|
|
bool to_string(std::string & s, int val)
|
|
{
|
|
s.resize(s.capacity());
|
|
while (true)
|
|
{
|
|
size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%d", val));
|
|
if (n2 <= s.size())
|
|
{
|
|
s.resize(n2);
|
|
break;
|
|
}
|
|
s.resize(n2);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
#ifdef BIGINT
|
|
bool to_string(std::string & s, mapnik::value_integer val)
|
|
{
|
|
s.resize(s.capacity());
|
|
while (true)
|
|
{
|
|
size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%lld", val));
|
|
if (n2 <= s.size())
|
|
{
|
|
s.resize(n2);
|
|
break;
|
|
}
|
|
s.resize(n2);
|
|
}
|
|
return true;
|
|
}
|
|
#endif
|
|
|
|
bool to_string(std::string & s, unsigned val)
|
|
{
|
|
s.resize(s.capacity());
|
|
while (true)
|
|
{
|
|
size_t n2 = static_cast<size_t>(snprintf(&s[0], s.size()+1, "%u", val));
|
|
if (n2 <= s.size())
|
|
{
|
|
s.resize(n2);
|
|
break;
|
|
}
|
|
s.resize(n2);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool to_string(std::string & s, bool val)
|
|
{
|
|
if (val) s = "true";
|
|
else s = "false";
|
|
return true;
|
|
}
|
|
|
|
#endif
|
|
|
|
} // end namespace util
|
|
|
|
}
|