X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=flower%2Fstd-string.cc;h=53fd548bfa340f422fc6cce872f6ed590ceb967f;hb=7df6ed01116dac2a8ea1babfb3f7184859ebf6c7;hp=0fdc96f5f6d78b5fbf6c890f79be1bb886cb2d70;hpb=31568c504806f35aac420a394c9eab07abd9faa7;p=lilypond.git diff --git a/flower/std-string.cc b/flower/std-string.cc index 0fdc96f5f6..53fd548bfa 100644 --- a/flower/std-string.cc +++ b/flower/std-string.cc @@ -3,7 +3,7 @@ source file of the GNU LilyPond music typesetter - (c) 2006 Jan Nieuwenhuizen + (c) 2006--2009 Jan Nieuwenhuizen */ #include "std-string.hh" @@ -57,6 +57,12 @@ to_string (unsigned u) return String_convert::unsigned_string (u); } +string +to_string (I64 b, char const *format) +{ + return String_convert::i64_string (b, format); +} + string to_string (char const *format, ...) { @@ -67,21 +73,25 @@ to_string (char const *format, ...) return str; } +/* + TODO: this O(n^2) in #occurences of find, due to repeated copying. + */ string & -replace_all (string &str, string find, string replace) +replace_all (string *str, string const &find, string const &replace) { ssize len = find.length (); - for (ssize i = str.find (find); i != NPOS; i = str.find (find, i + len)) - str = str.replace (i, len, replace); - return str; + ssize replen = replace.length (); + for (ssize i = str->find (find); i != NPOS; i = str->find (find, i + replen)) + *str = str->replace (i, len, replace); + return *str; } string & -replace_all (string &str, char find, char replace) +replace_all (string *str, char find, char replace) { - for (ssize i = str.find (find); i != NPOS; i = str.find (find, i + 1)) - str[i] = replace; - return str; + for (ssize i = str->find (find); i != NPOS; i = str->find (find, i + 1)) + (*str)[i] = replace; + return *str; } char * @@ -89,8 +99,9 @@ string_copy (string s) { ssize len = s.length (); char *dest = new char[len + 1]; - //s.copy (dest, len + 1); - memcpy (dest, s.c_str (), len + 1); + copy (s.begin (), s.end (), dest); + dest[len] = 0; + return dest; } @@ -99,3 +110,38 @@ string_compare (string const &a, string const &b) { return a.compare (b); } + +#include "std-vector.hh" + +vector +string_split (string str, char c) +{ + ssize i = str.find (c); + + vector a; + while (i != NPOS) + { + string s = str.substr (0, i); + a.push_back (s); + i ++; + str = str.substr (i); + i = str.find (c); + } + if (str.length ()) + a.push_back (str); + return a; +} + +string +string_join (vector const &strs, string infix) +{ + string result; + for (vsize i = 0; i < strs.size (); i ++) + { + if (i) + result += infix; + result += strs[i]; + } + + return result; +}