59 lines
2.3 KiB
C++
59 lines
2.3 KiB
C++
|
// fig08_07.cpp
|
||
|
|
// Demonstrating string member functions erase and replace.
|
||
|
|
#include <fmt/format.h>
|
||
|
|
#include <iostream>
|
||
|
|
#include <string>
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
// compiler concatenates all parts into one string
|
||
|
|
std::string string1{"The values in any left subtree"
|
||
|
|
"\nare less than the value in the"
|
||
|
|
"\nparent node and the values in"
|
||
|
|
"\nany right subtree are greater"
|
||
|
|
"\nthan the value in the parent node"};
|
||
|
|
|
||
|
|
std::cout << fmt::format("Original string:\n{}\n\n", string1);
|
||
|
|
|
||
|
|
string1.erase(62); // remove from index 62 through end of string1
|
||
|
|
std::cout << fmt::format("string1 after erase:\n{}\n\n", string1);
|
||
|
|
|
||
|
|
size_t position{string1.find(" ")}; // find first space
|
||
|
|
|
||
|
|
// replace all spaces with period
|
||
|
|
while (position != std::string::npos) {
|
||
|
|
string1.replace(position, 1, ".");
|
||
|
|
position = string1.find(" ", position + 1);
|
||
|
|
}
|
||
|
|
|
||
|
|
std::cout << fmt::format("After first replacement:\n{}\n\n", string1);
|
||
|
|
|
||
|
|
position = string1.find("."); // find first period
|
||
|
|
|
||
|
|
// replace all periods with two semicolons
|
||
|
|
// NOTE: this will overwrite characters
|
||
|
|
while (position != std::string::npos) {
|
||
|
|
string1.replace(position, 2, "xxxxx;;yyy", 5, 2);
|
||
|
|
position = string1.find(".", position + 2);
|
||
|
|
}
|
||
|
|
|
||
|
|
std::cout << fmt::format("After second replacement:\n{}\n", string1);
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/**************************************************************************
|
||
|
|
* (C) Copyright 1992-2022 by Deitel & Associates, Inc. and *
|
||
|
|
* Pearson Education, Inc. All Rights Reserved. *
|
||
|
|
* *
|
||
|
|
* DISCLAIMER: The authors and publisher of this book have used their *
|
||
|
|
* best efforts in preparing the book. These efforts include the *
|
||
|
|
* development, research, and testing of the theories and programs *
|
||
|
|
* to determine their effectiveness. The authors and publisher make *
|
||
|
|
* no warranty of any kind, expressed or implied, with regard to these *
|
||
|
|
* programs or to the documentation contained in these books. The authors *
|
||
|
|
* and publisher shall not be liable in any event for incidental or *
|
||
|
|
* consequential damages in connection with, or arising out of, the *
|
||
|
|
* furnishing, performance, or use of these programs. *
|
||
|
|
**************************************************************************/
|
||
|
|
|