C++ boost::algorithm::string::replace_last()














































C++ boost::algorithm::string::replace_last()



replace_last():

     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 the last instance of the specified pattern in the input string with a new pattern. It first performs a search for the last occurence of the specified pattern to be replaced and then it replaces it with a new one.

header file:

boost/algorithm/string.hpp

syntax:

     replace_last(input_string,search_string,format_string);

parameters:

    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.

replace_last() performs an inplace replacement. There is another variation present replace_last_copy() which instead of doing an inplace replacement, returns a copy of the modified string.

replace_last() performs a case-sensistive search. There is another variation present ireplace_last() which performs a case-insensitive search. Similarly ireplace_last_copy() returns a copy of modified string instead of doing an inplace replacement.


SAMPLE CODE:
#include<iostream> #include<boost/algorithm/string.hpp> using namespace std; using namespace boost::algorithm; int main() { string str1 = "Hello and Welcome Hello and Welcome"; cout<<str1<<endl; replace_last(str1,"Hello ","Hi ");//replacing "Hello" inplace with "Hi" cout<<str1<<endl<<endl; string str2 = "Apple Banana Mango Banana Apple"; cout<<str2<<endl; ireplace_last(str2,"apple","Orange");//replacing "Apple" inplace with "Orange" cout<<str2<<endl<<endl; string str3 = replace_last_copy(str1,"and ","Guys ");//removing "and" by returning a copy cout<<str3<<endl; }

OUTPUT:


EXPLANATION:
As we can observe from the output we are first performing an inplace replacement where we are replacing the last occurence 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.

More Articles of Md Safi Ur Rahman Khan:

Name Views Likes
C++ boost::algorithm::string::join() 577 0
C++ boost::algorithm::string::split() 607 0
C++ boost::algorithm::string::find_all() 647 0
C++ boost::algorithm::string::erase_tail() 249 0
C++ boost::algorithm::string::replace_tail() 212 0
C++ boost::algorithm::string::erase_head() 277 0
C++ boost::algorithm::string::replace_head() 210 0
C++ boost::algorithm::string::erase_all() 896 1
C++ boost::algorithm::replace_all() 2050 0
C++ boost::algorithm::string::erase_nth() 215 0
C++ boost::algorithm::string::replace_nth() 221 0
C++ boost::algorithm::string::replace_last() 247 0
C++ boost::algorithm::string::erase_last() 244 0
C++ boost::algorithm::string::erase_first() 215 1
C++ boost::algorithm::string::replace_first() 432 0
C++ boost::algorithm::string::find_token() 351 0
C++ boost::algorithm::string::find_tail() 200 1
C++ boost::algorithm::string::find_head() 213 0
C++ boost::algorithm::string::find_last() 301 1
C++ boost::algorithm::string::find_first() 749 1
C++ boost::algorithm::string::all() 225 1
C++ boost::algorithm::string::lexicographical_compare() 214 0
C++ boost::algorithm::string::equals() 378 0
C++ boost::algorithm::string::contains() 1826 0
C++ boost::algorithm::string::ends_with() 1283 0
C++ boost::algorithm::string::starts_with() 2059 0
C++ boost::algorithm::string::trim_if() 712 1
C++ boost::algorithm::string::trim() 3797 0
C++ boost::algorithm::string::trim_right_if() 522 1
C++ boost::algorithm::string::trim_left_if() 385 1
C++ boost::algorithm::string::trim_right() 282 3
C++ boost::algorithm::string::trim_left() 364 1
C++ boost::algorithm::string::to_lower() 737 1
C++ boost::algorithm::string::to_upper() 298 1
C++ Program to Implement Dequeue 1327 5
C++ Program to Implement Dequeue 241 3

Comments