+/*
+ TODO: this O(n^2) in #occurences of find, due to repeated copying.
+ */
+string &
+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;
+}
+
+string &
+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;
+}
+
+char *
+string_copy (string s)
+{
+ ssize len = s.length ();
+ char *dest = new char[len + 1];
+ copy (s.begin (), s.end (), dest);
+ dest[len] = 0;
+
+ return dest;
+}
+
+int
+string_compare (string const &a, string const &b)
+{
+ return a.compare (b);
+}
+
+#include "std-vector.hh"
+
+vector<string>
+string_split (string str, char c)
+{
+ ssize i = str.find (c);
+
+ vector<string> 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<string> const &strs, string infix)
+{
+ string result;
+ for (vsize i = 0; i < strs.size (); i ++)
+ {
+ if (i)
+ result += infix;
+ result += strs[i];
+ }
+
+ return result;