10 特殊容器 special containers
10.1 stacks LIFO
template <class T, class Container= deque<T> >
class stack;
push()、pop()、top()
10.2 Queues FIFO
template <class T, class Container = deque<T> >
class queue;
push(), pop(), back(), front()
10.3 Priority Queues
template <class T, class Container = vector<T>, class Compare = less<typename Container::value_type> >
class priority_queue;
push()、pop()、top()
相关:heap算法
10.4 Bitsets
template <size_t Bits>
class bitset;
原文:https://www.cnblogs.com/manongdashu/p/15222381.html