diff options
| author | Sven Eisenhauer <sven@sven-eisenhauer.net> | 2023-11-10 15:11:48 +0100 |
|---|---|---|
| committer | Sven Eisenhauer <sven@sven-eisenhauer.net> | 2023-11-10 15:11:48 +0100 |
| commit | 33613a85afc4b1481367fbe92a17ee59c240250b (patch) | |
| tree | 670b842326116b376b505ec2263878912fca97e2 /Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP | |
| download | Studium-master.tar.gz Studium-master.tar.bz2 | |
Diffstat (limited to 'Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP')
| -rw-r--r-- | Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP | 69 |
1 files changed, 69 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP new file mode 100644 index 0000000..e893200 --- /dev/null +++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_34.CPP @@ -0,0 +1,69 @@ +// Fig. 21.34: fig21_34.cpp
+// Standard library algorithms inplace_merge,
+// reverse_copy and unique_copy.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <algorithm> // algorithm definitions
+#include <vector> // vector class-template definition
+#include <iterator> // back_inserter definition
+
+int main()
+{
+ const int SIZE = 10;
+ int a1[ SIZE ] = { 1, 3, 5, 7, 9, 1, 3, 5, 7, 9 };
+ std::vector< int > v1( a1, a1 + SIZE );
+
+ std::ostream_iterator< int > output( cout, " " );
+
+ cout << "Vector v1 contains: ";
+ std::copy( v1.begin(), v1.end(), output );
+
+ // merge first half of v1 with second half of v1 such that
+ // v1 contains sorted set of elements after merge
+ std::inplace_merge( v1.begin(), v1.begin() + 5, v1.end() );
+
+ cout << "\nAfter inplace_merge, v1 contains: ";
+ std::copy( v1.begin(), v1.end(), output );
+
+ std::vector< int > results1;
+
+ // copy only unique elemements of v1 into results1
+ std::unique_copy(
+ v1.begin(), v1.end(), std::back_inserter( results1 ) );
+
+ cout << "\nAfter unique_copy results1 contains: ";
+ std::copy( results1.begin(), results1.end(), output );
+
+ std::vector< int > results2;
+
+ cout << "\nAfter reverse_copy, results2 contains: ";
+
+ // copy elements of v1 into results2 in reverse order
+ std::reverse_copy(
+ v1.begin(), v1.end(), std::back_inserter( results2 ) );
+
+ std::copy( results2.begin(), results2.end(), output );
+
+ cout << 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. *
+ *************************************************************************/
\ No newline at end of file |