How to find and replace all occurrences of a substring in a string?

by

try the following

const std::string s = "*A";
const std::string t = "*A\n";

std::string::size_type n = 0;
while ( ( n = chartDataString.find( s, n ) ) != std::string::npos )
{
    chartDataString.replace( n, s.size(), t );
    n += t.size();
}

More Related Contents:

  1. What is the difference between palindrome permutation and permutation? [closed]
  2. How to replace all occurrences of a character in string?
  3. Fast String Hashing Algorithm with low collision rates with 32 bit integer [closed]
  4. Splitting a string by a character
  5. C++ string::find complexity
  6. Are there any better methods to do permutation of string?
  7. Similar String algorithm
  8. Mixing two arrays by alternating elements two by two
  9. banker’s algorithm in c++
  10. How to convert an instance of std::string to lower case
  11. Remove spaces from std::string in C++
  12. Sorting zipped (locked) containers in C++ using boost or the STL
  13. Convert string to variable name or variable type
  14. Check if a string contains a string in C++
  15. How do I check if a C++ string is an int?
  16. Find out if string ends with another string in C++
  17. Case insensitive std::string.find()
  18. Convert String containing several numbers into integers
  19. How to convert a char array to a string?
  20. write and read string to binary file C++
  21. How can std::make_heap be implemented while making at most 3N comparisons?
  22. Writing a simple equation parser
  23. What is the right approach when using STL container for median calculation?
  24. Howto create combinations of several vectors without hardcoding loops in C++?
  25. Press Enter to Continue
  26. Ways to do modulo multiplication with primitive types
  27. Removing ‘#include ‘ doesn’t break the code
  28. What’s time complexity of this algorithm for finding all combinations?
  29. how to get hash code of a string in c++
  30. Where are string literals stored, and can I modify them?

Leave a Comment