1 files changed, 69 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/3_ch15/FIG15_07.CPP b/Bachelor/Prog2/Codebeispiele/3_ch15/FIG15_07.CPP
new file mode 100644
index 0000000..c09a04f
--- /dev/null
+++ b/Bachelor/Prog2/Codebeispiele/3_ch15/FIG15_07.CPP
@@ -0,0 +1,69 @@
+// Fig. 16.7: fig16_07.cpp
+// Demonstrating string member functions erase and replace.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <string>
+
+using std::string;
+
+int main()
+{
+   // compiler concatenates all parts into one string
+   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" );
+   
+   cout << "Original string:\n" << string1 << endl << endl;
+
+   // remove all characters from (and including) location 62 
+   // through the end of string1
+   string1.erase( 62 );
+
+   // output new string
+   cout << "Original string after erase:\n" << string1
+        << "\n\nAfter first replacement:\n";
+             
+   // replace all spaces with period
+   int position = string1.find( " " );
+
+   while ( position != string::npos ) {
+      string1.replace( position, 1, "." );
+      position = string1.find( " ", position + 1 );
+   } // end while
+    
+   cout << string1 << "\n\nAfter second replacement:\n";
+   
+   // replace all periods with two semicolons
+   // NOTE: this will overwrite characters
+   position = string1.find( "." );
+
+   while ( position != string::npos ) {
+      string1.replace( position, 2, "xxxxx;;yyy", 5, 2 );
+      position = string1.find( ".", position + 1 );
+   } // end while
+
+   cout << string1 << endl;
+   return 0;
+
+}  // end main
+
+/**************************************************************************
+ * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *
+ * Hall. 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.                     *
+ *************************************************************************/
+