C++之容器queue

头文件<queue>:

包含两个类 queue 和 priority_queue

queue:

标准的FIFO队列。

queue的实现使用适配器模式。内部包含有一个隐含的容器。

隐含的容器至少实现以下方法：

• • empty
  • size
  • front
  • back
  • push_back
  • pop_front

queue本身实现的方法：

(constructor)

Construct queue  (public member function )

empty

Test whether container is empty  (public member function )

size

Return size  (public member function )

front

Access next element  (public member function )

back

Access last element  (public member function )

push

Insert element  (public member function )

emplace 

Construct and insert element  (public member function )

pop

Remove next element  (public member function )

swap 

Swap contents  (public member function )

priority_queue:

优先级队列。是一个最大堆。

priority_queue的实现使用适配器模式。内部包含有一个隐含的容器。

隐含的容器至少实现以下方法：

• • empty
  • size
  • front
  • back
  • push_back
  • pop_front

priority_queue本身实现的方法：

(constructor)

Construct queue  (public member function )

empty

Test whether container is empty  (public member function )

size

Return size  (public member function )

front

Access next element  (public member function )

back

Access last element  (public member function )

push

Insert element  (public member function )

emplace 

Construct and insert element  (public member function )

pop

Remove next element  (public member function )

swap 

Swap contents  (public member function )

使用：

pop函数，将弹出最大元素，即使back函数返回的那个元素。