summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_23.CPP
blob: 6614c19ebf488a3f45fb488fc8e77f2439702c38 (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
73
74
// Fig. 21.23: fig21_23.cpp

// Standard library adapter stack test program.

#include <iostream>



using std::cout;

using std::endl;



#include <stack>   // stack adapter definition

#include <vector>  // vector class-template definition

#include <list>    // list class-template definition



// popElements function-template prototype 

template< class T >

void popElements( T &stackRef );



int main()

{

   // stack with default underlying deque

   std::stack< int > intDequeStack;   



   // stack with underlying vector

   std::stack< int, std::vector< int > > intVectorStack;



   // stack with underlying list

   std::stack< int, std::list< int > > intListStack;



   // push the values 0-9 onto each stack 

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

      intDequeStack.push( i );

      intVectorStack.push( i );

      intListStack.push( i );



   } // end for



   // display and remove elements from each stack

   cout << "Popping from intDequeStack: ";

   popElements( intDequeStack );

   cout << "\nPopping from intVectorStack: ";

   popElements( intVectorStack );

   cout << "\nPopping from intListStack: ";

   popElements( intListStack );



   cout << endl;



   return 0;



} // end main



// pop elements from stack object to which stackRef refers

template< class T >

void popElements( T &stackRef )

{

   while ( !stackRef.empty() ) {

      cout << stackRef.top() << ' ';  // view top element

      stackRef.pop();                 // remove top element



   } // end while



} // end function popElements



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

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

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