std::string question

[Kian Goh]

Hello,

I would like to replace all the occurrence of "(" and ")"
in C++ std::string to "\(" and "\)".

For example:
string s = "(abc)|(toto)|( lala)"
will be become "\(abc\)|\(toto \)|\(lala\)"
Question:
Just wonder if there is a straight forward function to do so??
Currently I am using a while loop to read through the string, then
basic_string::f ind and basic_string::r eplace the occurrence of "(" and ")".

Any better solution?

Thanks,
Kian

[John Harrison]

"Kian Goh" <ki**@hotmail.c om> wrote in message
news:g_******** ************@ro gers.com...

Hello,

I would like to replace all the occurrence of "(" and ")"
in C++ std::string to "\(" and "\)".

For example:
string s = "(abc)|(toto)|( lala)"
will be become "\(abc\)|\(toto \)|\(lala\)"
Question:
Just wonder if there is a straight forward function to do so??
No.


Currently I am using a while loop to read through the string, then
basic_string::f ind and basic_string::r eplace the occurrence of "(" and
")".

Any better solution?

Certainly there are bad ways and good ways to write this code but without
seeing the code you have written it is impossible to say whether there is a
better solution.

A good solution would work in three phases.

1) Go though the string seeing how many backslashes you are going to need to
insert
2) Increase the size of the string by the number of extra backslashes needed
3) Loop backwards though the string, copying characters and inserting
backslashes as necessary.

The point of this compexity is that it minimises reallocation of the string
and copying of characters.

A bad solution would work like this

1) Go forwards through the string and each time you find a "(" or ")" insert
a backslash.

john

[Jason Heyes]

"Kian Goh" <ki**@hotmail.c om> wrote in message
news:g_******** ************@ro gers.com...

Hello,

I would like to replace all the occurrence of "(" and ")"
in C++ std::string to "\(" and "\)".

For example:
string s = "(abc)|(toto)|( lala)"
will be become "\(abc\)|\(toto \)|\(lala\)"
Question:
Just wonder if there is a straight forward function to do so??
Currently I am using a while loop to read through the string, then
basic_string::f ind and basic_string::r eplace the occurrence of "(" and
")".

Any better solution?

Thanks,
Kian

Here is a solution:

string add_backslash_t o_brackets(char ch)
{
string s(1, ch);
if (ch == '(' || ch == ')')
s.insert(s.begi n(), '\\');
return s;
}

vector<string> v;
transform(s.beg in(), s.end(), back_inserter(v ), add_backslash_t o_brackets);
s = accumulate(v.be gin(), v.end(), string());

Hope you like it.

[Siemel Naran]

"Jason Heyes" <ja********@opt usnet.com.au> wrote in message
news:419b0f0b$0 $24380

"Kian Goh" <ki**@hotmail.c om> wrote in message

For example:
string s = "(abc)|(toto)|( lala)"
will be become "\(abc\)|\(toto \)|\(lala\)"

string add_backslash_t o_brackets(char ch)
{
string s(1, ch);
if (ch == '(' || ch == ')')
s.insert(s.begi n(), '\\');
return s;
}

vector<string> v;
transform(s.beg in(), s.end(), back_inserter(v ), add_backslash_t o_brackets); s = accumulate(v.be gin(), v.end(), string());

Good.

Along the same lines, the function back_inserter(v ) returns an iterator,
specifically a std::back_inser t_iterator<std: :vector<std::st ring>>, whose
operator= calls v.push_back(... ). You could write your own
back_insert_ite rator class too, thus avoiding the need to create strings and
a vector of strings.

class special_back_in sert_iterator : public
std::back_inser t_iterator<std: :string> {
typedef std::back_inser t_iterator<std: :string> inherited;
public:
special_back_in sert_iterator(s td::string& s) : inherited(s) { }
special_back_in sert_iterator& operator=(char c) {
if (ch == '(' || ch == ')') inherited::oper ator=('\\');
inherited::oper ator==(c);
return *this;
}
};

inline
special_back_in sert_iterator special_back_in serter(std::str ing&)
{
return ...;
}

string s2;
transform(s.beg in(), s.end(), special_back_in serter(s2));

[Jason Heyes]

"Siemel Naran" <Si*********@RE MOVE.att.net> wrote in message
news:nx******** ***********@bgt nsc05-news.ops.worldn et.att.net...

"Jason Heyes" <ja********@opt usnet.com.au> wrote in message
news:419b0f0b$0 $24380

"Kian Goh" <ki**@hotmail.c om> wrote in message

> For example:
> string s = "(abc)|(toto)|( lala)"
> will be become "\(abc\)|\(toto \)|\(lala\)"

string add_backslash_t o_brackets(char ch)
{
string s(1, ch);
if (ch == '(' || ch == ')')
s.insert(s.begi n(), '\\');
return s;
}

vector<string> v;
transform(s.beg in(), s.end(), back_inserter(v ),

add_backslash_t o_brackets);

s = accumulate(v.be gin(), v.end(), string());

Good.

Along the same lines, the function back_inserter(v ) returns an iterator,
specifically a std::back_inser t_iterator<std: :vector<std::st ring>>, whose
operator= calls v.push_back(... ). You could write your own
back_insert_ite rator class too, thus avoiding the need to create strings
and
a vector of strings.

class special_back_in sert_iterator : public
std::back_inser t_iterator<std: :string> {
typedef std::back_inser t_iterator<std: :string> inherited;
public:
special_back_in sert_iterator(s td::string& s) : inherited(s) { }
special_back_in sert_iterator& operator=(char c) {
if (ch == '(' || ch == ')') inherited::oper ator=('\\');
inherited::oper ator==(c);
return *this;
}
};

inline
special_back_in sert_iterator special_back_in serter(std::str ing&)
{
return ...;
}

string s2;
transform(s.beg in(), s.end(), special_back_in serter(s2));

Nice. It all happens in one line of STL. I wonder how these STL solutions
compare with non-STL ones in terms of code complexity. Alot better I
presume.

[David Harmon]

On Tue, 16 Nov 2004 21:59:27 -0500 in comp.lang.c++, "Kian Goh"
<ki**@hotmail.c om> wrote,

I would like to replace all the occurrence of "(" and ")"
in C++ std::string to "\(" and "\)".

#include <string>
#include <algorithm>
#include <numeric>
#include <iostream>

std::string changer(std::st ring was, char in)
{
if (in == '(')
return was+"\\(";
if (in == ')')
return was+"\\)";
return was+in;
};

int main()
{
std::string foo("(abc)|(tot o)|(lala)");
std::string bar = std::accumulate (foo.begin(), foo.end(),
std::string("") , changer);
std::cout << bar;
}

[Siemel Naran]

"Jason Heyes" <ja********@opt usnet.com.au> wrote in message
news:419b27d6$0 $27445

"Siemel Naran" <Si*********@RE MOVE.att.net> wrote in message

string s2;
transform(s.beg in(), s.end(), special_back_in serter(s2));

Nice. It all happens in one line of STL. I wonder how these STL solutions
compare with non-STL ones in terms of code complexity. Alot better I
presume.

Except for the meaningless name 'special_back_i nserter', the code above
looks simpler. However, it's not an inplace algorithm, therefore uses more
memory. John's suggestion is in in-place algorithm, though harder to
implement.