Queue: push, pop and size : queue « queue stack « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » queue stack » queue

21.2.9.Queue: push, pop and size

#include <iostream>

#include <queue> 

#include <list>

using namespace std;



int main()

{



  int thedata[] = {45, 34, 56, 27, 71, 50, 62};

  queue<int, list<int> > q;  

  cout << "The queue size is now " << q.size() << endl;



  cout << "Pushing 4 elements " << endl;

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

    q.push(thedata[i]);

  cout << "The queue size is now " << q.size() << endl;



  cout << "Popping 3 elements " << endl;

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

    cout << q.front() << endl;

    q.pop();

  }

  cout << "The queue size is now " << q.size() << endl;



  return 0;

}

The queue size is now 0
Pushing 4 elements
The queue size is now 4
Popping 3 elements
45
34
56
The queue size is now 1

21.2.queue
	21.2.1.	Instantiating an STL Queue
	21.2.2.	Working with a Queue of Integers
	21.2.3.	A queue for strings: push, empty, front, pop
	21.2.4.	queue with doubles
	21.2.5.	queue: push, pop, front and size
	21.2.6.	queue.front()
	21.2.7.	Queue buffer
	21.2.8.	Using a queue to store user-defined object
	21.2.9.	Queue: push, pop and size

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.