This function is included in the "boost/algorithm/string" library. This library contains some brilliant methods which help in accomplishing string manipulations that are lacking in STL library.
This function is used to replace all the instances of the specified pattern in the input string with a new pattern. It first performs a search for the instances of the specified pattern to be replaced and then it replaces it with the specifined format string.
input_string : an input string
seacrh_string : the pattern that has to be replaced in the input_string;
format_string : the pattern that replaces the search_string.
The index is 0-based index i.e., the first occurence is considered 0. For negative values of N, matches are counted from the end of the string i.e., the last occurence is -1 and so on.
replace_all() performs an inplace replacement. There is another variation present replace_all_copy() which instead of doing an inplace replacement, returns a copy of the modified string.
replace_all() performs a case-sensistive search. There is another variation present ireplace_all() which performs a case-insensitive search. Similarly ireplace_all_copy() returns a copy of modified string instead of doing an inplace replacement.
using namespace std;
using namespace boost::algorithm;
string str1 = "Hello and Welcome Hello and Welcome";
replace_all(str1,"Hello ","Hi ");
string str2 = "Apple Banana Mango Apple Banana Apple";
string str4 = "Hi Hi Hi Hi Hi Hi";
string str3 = replace_all_copy(str4,"Hi ","Guys ");
As we can observe from the output we are first performing an inplace replacement where we are replacing the all the occurences of "Hello " with "Hi" . Next we are performing replacement on the original string while performing the search case-insensitively. In str3, we are storing the string obtained after performing replacement while searching case-sensitively. Her in the last case we can observe that the last instance of "Hi" is not getting replaced as the search string we have provided is "Hi "(with a trailing whitespace).