summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/6_ch17/fig17_10_11/fig17_11.cpp
blob: 057105946cacd5e5950305aa50bedb102f53843a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// Fig. 17.11: fig17_11.cpp

// Template Stack class test program.

#include <iostream>



using std::endl;



#include "stack.h"  // Stack class definition



int main()

{

   Stack< int > intStack;  // create Stack of ints



   cout << "processing an integer Stack" << endl;



   // push integers onto intStack

   for ( int i = 0; i < 4; i++ ) {

      intStack.push( i );

      intStack.printStack();



   } // end for



   // pop integers from intStack

   int popInteger;



   while ( !intStack.isStackEmpty() ) {

      intStack.pop( popInteger );

      cout << popInteger << " popped from stack" << endl;

      intStack.printStack();



   } // end while



   Stack< double > doubleStack;  // create Stack of doubles

   double value = 1.1;



   cout << "processing a double Stack" << endl;



   // push floating-point values onto doubleStack

   for ( int j = 0; j < 4; j++ ) {

      doubleStack.push( value );

      doubleStack.printStack();

      value += 1.1;



   } // end for



   // pop floating-point values from doubleStack

   double popDouble;



   while ( !doubleStack.isStackEmpty() ) {

      doubleStack.pop( popDouble );

      cout << popDouble << " popped from stack" << endl;

      doubleStack.printStack();



   } // end while



   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.                     *

 *************************************************************************/