Queue:
特点:1)队头取走元素,队尾插入元素,其他元素不能访问,因此无遍历行为
本质:使用deque封闭前端入口和底端出口
下面程序是关于queue的实现
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
#include<queue>
using namespace std;
template<class T,class Sequence=deque<T> >
class MaQueue
{
friend bool operator==_STL_NULL_TMPL_ARGS(const MaQueue& x,const MaQueue& y)
//friend bool operator==(const MaQueue& x,const MaQueue& y)
{
return x.c = y.c;
}
friend bool operator<_STL_NULL_TMPL_ARGS(const MaStack& x,const MaStack& y)
{
return x.c<y.c
}
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;
typedef typename Sequence::size_type size_type;
protected:
Sequence c;//底层容器
public:
bool empty() const {return c.empty();}
size_type size() const {return c.size();}
reference front() {return c.front();}
const_reference fornt() 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();}
};
int main(int argc,char *argv[])
{
cout<<"这是队列的实现"<<endl;
getchar();
return 0;
}