C ++ in the queue
FIFO data structure implemented, is a template class
Headers #include <queue>
Queue < int > Q; // define a queue int type
Q.empty (); // return queue is empty
Q.size (); // Returns the current queue length
Q.front (); // return the current queue the first element
Q.back (); // returns the current last element of the queue
Q.push (); // inserted in a queue behind elements, such as inserting figures. 5: Q.push (. 5)
Q.pop () ; // from the current queue, the first element is removed
1 #include <iostream>
2 #include <queue>
3
4 using namespace std;
5 int main()
6 {
7 queue<int> Q;
8 cout<<"queue empty? "<<Q.empty()<<endl;
9
10 for(int i=0;i<5;i++)
11 {
12 Q.push(i); //进队列
13 }
14
15 cout<<"queue empty? "<<Q.empty()<<endl;
16 cout<<"queue size: "<<Q.size()<<endl;
17 cout<<endl;
18
19 for(int i=0;i<5;i++)
20 {
21 cout<<"queue front: "<<Q.front()<<endl;
22 Q.pop(); 24 }
23the queue//
25 return 0;
26 }
QT in QQueue
Its parent class is QList, is a template class
Header file: #include <QQueue>
QQueue<int> Q; //定义一个int型队列
Q.isEmpty(); //返回队列是否为空
Q.size(); //返回队列元素个数
Q.clear(); //清空队列
Q.enqueue(); //在队列尾部添加一个元素, 比如插入数字5: Q.enqueue(5)
Q.dequeue(); //删除当前队列第一个元素,并返回这个元素
Q.head(); //返回当前队列第一个元素
Q.last(); //返回当前队列尾部的元素
T & operator[]( int i ); //以数组形式访问队列元素
1 #include <QtGui>
2 #include <QQueue>
3 #include <QDebug>
4
5 int main(int argc,char * argv[])
6 {
7 QQueue<int> Q; //定义一个int型队列
8 qDebug()<<"queue empty: "<<Q.isEmpty(); //返回队列是否为空
9
10 for(int i=0;i<5;i++)
11 {
12 Q.enqueue(i); //入队
13 }
14
15 qDebug()<<"queue empty: "<<Q.isEmpty();
16 qDebug()<<"queue size: "<<Q.size();
17
18 for(int i=0;i<5;i++)
19 {
20 qDebug()<<"queue last: "<<Q.last(); //返回当前队列最后一个个元素
21 qDebug()<<"queue head: "<<Q.dequeue(); //出队列,并且返回当前队列第一个元素
22 }
23
24 qDebug()<<"queue empty: "<<Q.isEmpty();
25 qDebug()<<"queue size: "<<Q.size();
26
27 return 0;
28 }