summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP
diff options
context:
space:
mode:
Diffstat (limited to 'Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP')
-rw-r--r--Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP57
1 files changed, 57 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP
new file mode 100644
index 0000000..c8edb5d
--- /dev/null
+++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_18.CPP
@@ -0,0 +1,57 @@
+// Fig. 21.18: fig21_18.cpp
+// Standard library class deque test program.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <deque> // deque class-template definition
+#include <algorithm> // copy algorithm
+
+int main()
+{
+ std::deque< double > values;
+ std::ostream_iterator< double > output( cout, " " );
+
+ // insert elements in values
+ values.push_front( 2.2 );
+ values.push_front( 3.5 );
+ values.push_back( 1.1 );
+
+ cout << "values contains: ";
+
+ // use subscript operator to obtain elements of values
+ for ( int i = 0; i < values.size(); ++i )
+ cout << values[ i ] << ' ';
+
+ values.pop_front(); // remove first element
+
+ cout << "\nAfter pop_front, values contains: ";
+ std::copy( values.begin(), values.end(), output );
+
+ // use subscript operator to modify element at location 1
+ values[ 1 ] = 5.4;
+
+ cout << "\nAfter values[ 1 ] = 5.4, values contains: ";
+ std::copy( values.begin(), values.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