STL之queue实现

template<class T,class Sequence=deque<T>>class queue{friend bool operator==(const queue&, const queue&);friend bool operator<(const queue&, const queue&);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(){ return c.empty(); }size_type size(){ return c.size(); }reference back(){ return c.back(); }const_reference back()const{ return c.back(); }reference front(){ return c.front(); }const_reference front()const{ return c.front(); }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;}