fork download
  1. // Lab 13 - STL deque
  2. // Programmer: Elaine Torrez
  3. // Class: CMPR 121
  4.  
  5. #include <iostream>
  6. #include <deque>
  7. using namespace std;
  8.  
  9. void showNumbers(deque<int> numbers);
  10.  
  11. int main()
  12. {
  13. deque<int> numbers;
  14.  
  15. numbers.push_back(1);
  16. numbers.push_front(2);
  17. numbers.push_back(3);
  18. numbers.push_front(4);
  19. numbers.push_back(5);
  20. numbers.push_front(6);
  21.  
  22. showNumbers(numbers);
  23.  
  24. return 0;
  25. }
  26.  
  27. void showNumbers(deque<int> numbers)
  28. {
  29. deque<int>::iterator iter;
  30.  
  31. cout << "Here are the values in the deque:" << endl;
  32.  
  33. for (iter = numbers.begin(); iter != numbers.end(); iter++)
  34. {
  35. cout << *iter << endl;
  36. }
  37.  
  38. cout << "Number of values in the deque: " << numbers.size() << endl;
  39. cout << "Maximum values: " << numbers.max_size() << " bytes." << endl;
  40. cout << endl;
  41.  
  42. cout << "The value at index[2]: " << numbers[2] << endl;
  43. cout << "The value at the front: " << numbers.front() << endl;
  44. cout << "The value at the back: " << numbers.back() << endl;
  45. cout << endl;
  46.  
  47. cout << "Now removing the front value. . ." << endl;
  48. numbers.pop_front();
  49.  
  50. cout << "Here are the values after removing the front:" << endl;
  51.  
  52. for (iter = numbers.begin(); iter != numbers.end(); iter++)
  53. {
  54. cout << *iter << endl;
  55. }
  56.  
  57. cout << endl;
  58.  
  59. cout << "Now removing the back value. . ." << endl;
  60. numbers.pop_back();
  61.  
  62. cout << "Here are the values after removing the back:" << endl;
  63.  
  64. for (iter = numbers.begin(); iter != numbers.end(); iter++)
  65. {
  66. cout << *iter << endl;
  67. }
  68.  
  69. return;
  70. }
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
Here are the values in the deque:
6
4
2
1
3
5
Number of values in the deque: 6
Maximum values: 4611686018427387903 bytes.

The value at index[2]: 2
The value at the front: 6
The value at the back: 5

Now removing the front value. . .
Here are the values after removing the front:
4
2
1
3
5

Now removing the back value. . .
Here are the values after removing the back:
4
2
1
3