Queue队列pop()函数运用实例

pop
语法:

1	void pop();

pop() 删除第一个元素

源代码

/**

* @brief Removes first element.

* This is a typical %queue operation. It shrinks the %queue by one.

* The time complexity of the operation depends on the underlying

* sequence.

* Note that no data is returned, and if the first element's

* data is needed, it should be retrieved before pop() is

* called.

void

pop()

{

__glibcxx_requires_nonempty();

c.pop_front();

}

测试代码

// 梁笔记

// https://zouzhongliang.com

#include <iostream>

#include <queue>

using namespace std;

int main()

{

queue<int> Qi;

Qi.push(1);

Qi.push(2);

Qi.push(3);

Qi.push(4);

Qi.push(5);

cout<<Qi.size()<<endl;

int size = Qi.size();

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

Qi.pop();

}

cout<<Qi.size()<<endl;

}

测试结果