peerplays-fc/src/string.cpp
2014-03-11 11:29:29 -04:00

114 lines
4.4 KiB
C++

#include <fc/string.hpp>
#include <fc/utility.hpp>
#include <fc/fwd_impl.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/algorithm/string.hpp>
#include <string>
/**
* Implemented with std::string for now.
*/
namespace fc {
#ifdef USE_FC_STRING
string::string(const char* s, int l) :my(s,l){ }
string::string(){}
string::string( const fc::string& c ):my(*c.my) { }
string::string( string&& m ):my(fc::move(*m.my)) {}
string::string( const char* c ):my(c){}
string::string( const_iterator b, const_iterator e ):my(b,e){}
string::string( const std::string& s ):my(s) {}
string::string( std::string&& s ):my(fc::move(s)) {}
string::~string() { }
string::operator std::string&() { return *my; }
string::operator const std::string&()const { return *my; }
char* string::data() { return &my->front(); }
string::iterator string::begin() { return &(*this)[0]; }
string::iterator string::end() { return &(*this)[size()]; }
string::const_iterator string::begin()const { return my->c_str(); }
string::const_iterator string::end()const { return my->c_str() + my->size(); }
char& string::operator[](size_t idx) { return (*my)[idx]; }
const char& string::operator[](size_t idx)const { return (*my)[idx]; }
void string::reserve(size_t r) { my->reserve(r); }
size_t string::size()const { return my->size(); }
size_t string::find(char c, size_t p)const { return my->find(c,p); }
size_t string::find(const fc::string& str, size_t pos /* = 0 */) const { return my->find(str, pos); }
size_t string::find(const char* s, size_t pos /* = 0 */) const { return my->find(s,pos); }
size_t string::rfind(char c, size_t p)const { return my->rfind(c,p); }
size_t string::rfind(const char* c, size_t p)const { return my->rfind(c,p); }
size_t string::rfind(const fc::string& c, size_t p)const { return my->rfind(c,p); }
size_t string::find_first_of(const fc::string& str, size_t pos /* = 0 */) const { return my->find_first_of(str, pos); }
size_t string::find_first_of(const char* s, size_t pos /* = 0 */) const { return my->find_first_of(s, pos); }
fc::string& string::replace(size_t pos, size_t len, const string& str) { my->replace(pos, len, str); return *this; }
fc::string& string::replace(size_t pos, size_t len, const char* s) { my->replace(pos, len, s); return *this; }
void string::clear() { my->clear(); }
void string::resize( size_t s ) { my->resize(s); }
fc::string string::substr( size_t start, size_t len )const { return my->substr(start,len); }
const char* string::c_str()const { return my->c_str(); }
bool string::operator == ( const char* s )const { return *my == s; }
bool string::operator == ( const string& s )const { return *my == *s.my; }
bool string::operator != ( const string& s )const { return *my != *s.my; }
string& string::operator =( const string& c ) { *my = *c.my; return *this; }
string& string::operator =( string&& c ) { *my = fc::move( *c.my ); return *this; }
string& string::operator+=( const string& s ) { *my += *s.my; return *this; }
string& string::operator+=( char c ) { *my += c; return *this; }
bool operator < ( const string& a, const string& b ) { return *a.my < *b.my; }
string operator + ( const string& s, const string& c ) { return string(s) += c; }
string operator + ( const string& s, char c ) { return string(s) += c; }
#endif // USE_FC_STRING
int64_t to_int64( const fc::string& i )
{
return boost::lexical_cast<int64_t>(i.c_str());
}
uint64_t to_uint64( const fc::string& i )
{
return boost::lexical_cast<uint64_t>(i.c_str());
}
double to_double( const fc::string& i)
{
return boost::lexical_cast<double>(i.c_str());
}
fc::string to_string( double d)
{
return boost::lexical_cast<std::string>(d);
}
fc::string to_string( uint64_t d)
{
return boost::lexical_cast<std::string>(d);
}
fc::string to_string( int64_t d)
{
return boost::lexical_cast<std::string>(d);
}
fc::string to_string( uint16_t d)
{
return boost::lexical_cast<std::string>(d);
}
std::string trim( const std::string& s )
{
std::string cpy(s);
boost::algorithm::trim(cpy);
return cpy;
}
} // namespace fc