1、queue概述
queue是一种先进先出(FIFO)的数据结构,queue允许新增元素、移除元素、从最底端加入元素、取最顶端元素,但除了最底端可以加入元素最顶端可以取出外不允许存取其他元素所以不允许有遍历行为。queue的底层实现机制是deque,deque是双向开口的数据结构只要封闭其头端的入口和底端的出口便可以轻而易举实现queue。queue是以deque为底部容器完成所有工作,所以queue是配接器(adapter)。queue不提供遍历功能,也不提供迭代器。
template <class T, class Sequence = deque<T> >
template <class T, class Sequence>
class queue {
friend bool operator== __STL_NULL_TMPL_ARGS (const queue& x, const queue& y);
friend bool operator< __STL_NULL_TMPL_ARGS (const queue& x, const queue& y);
public:
typedef typename Sequence::value_type value_type;
typedef typename Sequence::size_type size_type;
typedef typename Sequence::reference reference;
typedef typename Sequence::const_reference const_reference;
protected:
Sequence c;
public:
bool empty() const { return c.empty(); }
size_type size() const { return c.size(); }
reference front() { return c.front(); }
const_reference front() const { return c.front(); }
reference back() { return c.back(); }
const_reference back() const { return c.back(); }
void push(const value_type& x) { c.push_back(x); }
void pop() { c.pop_front(); }
};
template <class T, class Sequence>
bool operator==(const queue<T, Sequence>& x, const queue<T, Sequence>& y) {
return x.c == y.c;
}
template <class T, class Sequence>
bool operator<(const queue<T, Sequence>& x, const queue<T, Sequence>& y) {
return x.c < y.c;
}