顺序栈.docVIP

顺序栈 //顺序栈 #includecmath #includecassert #includememory #includevector using namespace std; templateclass T class SqList { private: T *p; //存储空间基址 unsigned int size; //当前实际长度 unsigned int maxsize; //当前最大长度 public: SqList(); SqList(const unsigned int number); SqList(const unsigned int number,const T element); SqList(const SqListT L); SqList(const vectorT L); T operator[](int number); void operator=(const SqListT L); bool operator==(const SqListT L) const; bool operator!=(const SqListT L) const; SqListT operator+(const SqListT L); SqListT operator+=(const SqListT L); void reserve(const unsigned int number); int length() const; int maxlength() const; void insert(const unsigned int pos,const T element); void remove(const unsigned int pos); void add(const T element); void del(); int find(const T element); int findall(const T element,int *parameter); ~SqList(); }; templateclass T SqListT::SqList() { p=NULL; size=0; maxsize=0; } templateclass T SqListT::SqList(const unsigned int length) { if(length0) { size=length; maxsize=(int)pow(2,ceill(log10(size)/log10(2))); p=new T[maxsize]; memset(p,0,sizeof(T)*maxsize); } else { SqList(); } } templateclass T SqListT::SqList(const unsigned int number,const T element) { if(length0) { size=length; maxsize=(int)pow(2,ceill(log10(size)/log10(2))); p=new T[maxsize]; for(int i=0;isize;i++) { p[i]=element; } } else { SqList(); } } templateclass T SqListT::SqList(const SqListT L) { size=L.size; maxsize=L.maxsize; p=new T[maxsize]; for(int i=0;isize;i++) { p[i]=L[i]; } } templateclass T SqListT::SqList(const vectorT L) { size=L.size(); maxsize=L.s.capacity(); p=new T[maxsize]; for(int i=0;isize;i++) { p[i]=L[i]; } } templateclass T T SqListT::operator[](int number) { assert(!(number0)(numbersize)); return p[number]; } templateclass T void SqListT::operator=(const SqListT L) { if(p!=NULL) { delete [] p; p=NULL; } size=L.size; maxsize=L.maxsize; p=new T[maxs