Stack:
特点:1)后进先出,单出口在栈顶,不允许有遍历行为,2)没有迭代器,只能访问栈顶元素
本质:将deque(也可使用list)封闭其头端开口的配接器(修改某物接口,形成另一种风貌性质的东西)
下面的程序是关于stack的实现
#include<iostream>
#include<string>
#include<vector>
#include<iterator>
#include<stack>
#include<deque>
using namespace std;
template<class T,class Sequence=deque<T> >
class MaStack
{
friend bool operator==_STL_NULL_TMPL_ARGS(const MaStack& x,const MaStack& y)
//friend bool operator==(const MaStack& x,const MaStack& 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;//底层容器(实际上是deque或list)
public:
bool empty() const {return c.empty();}
size_type size() const {return c.size();}
reference top() {return c.back();}
const_reference top() const {return c.back();}
void push(const value_type& x){c.push_back(x);}
void pop(){c.pop_back();}
};
int main(int argc,char *argv[])
{
cout<<"这是栈的实现"<<endl;
getchar();
return 0;
}