初学编程C++之用模板制作栈

代码示例：

#ifndef MYSTACK_H
#define MYSTACK_H
#include<iostream>
using namespace std;

template<typename T>
class MyStack
{
public:
	MyStack(int size);//分配内存初始化空间，设定栈容量，栈顶
	~MyStack();//回收栈空间内存
	bool stackEmpty();//判断栈是否为空，为空返回true，非空返回false
	bool stackFull();//判断栈是否为满，为满返回true,非满返回false
	void clearStack();//清空栈
	int stackLength();//已有元素个数
	bool push(T elem);//元素入栈，栈顶上升
	bool pop(T &elem);//元素出栈，栈顶下降
	void stackTraverse(bool isFromButtom);//遍历栈中的元素
private:
	
	T *m_pBuffer;//栈空间指针
	int m_iSize;//栈容量
	int m_iTop;//栈顶，栈中元素个数
};

template<typename T>
MyStack<T>::MyStack(int size)
{
	m_iSize=size;
	m_pBuffer=new T[size];
	m_iTop=0;
}
template<typename T>
MyStack<T>::~MyStack()
{
	delete[]m_pBuffer;
	m_pBuffer=0;
}
template<typename T>
bool MyStack<T>::stackEmpty()
{
	if(0==m_iTop)
	{
		return true;
	}
	return false;
}
template<typename T>
bool MyStack<T>::stackFull()
{
	if(m_iTop==m_iSize)//(m_iTop>=m_iSize)
	{
		return true;
	}
	return false;
}
template<typename T>
void MyStack<T>::clearStack()
{
	m_iTop=0;
}
template<typename T>
int MyStack<T>::stackLength()
{
	return m_iTop;
}
template<typename T>
bool MyStack<T>::push(T elem)
{
	if(stackFull())
	{
		return false;
	}
	m_pBuffer[m_iTop]=elem;
	m_iTop++;
	return true;
}
template<typename T>
bool MyStack<T>::pop(T &elem)
{
	if(stackEmpty())
	{
		return false;
	}
	m_iTop--;
	elem=m_pBuffer[m_iTop];
	return true;
}
template<typename T>
void MyStack<T>:: stackTraverse(bool isFromButtom)
{
	if(isFromButtom)
	{
		  for(int i=0;i<m_iTop;i++)//栈底到栈顶遍历
	  {
		cout<<m_pBuffer[i]<<endl;
		  
	  }
	}
	else
	{
		for(int i=m_iTop-1;i>=0;i--)//栈顶到栈底遍历
	  {
		cout<<m_pBuffer[i]<<endl;
	  }
	}
}

#endif


#ifndef COORDINATE_H
#define COORDINATE_H

#include<ostream>
using namespace std;

class Coordinate
{
	friend ostream &operator<<(ostream &out,Coordinate &coor);
public:
	Coordinate(int x=0,int y=0);
	void printCoordinate();
private:
	int m_iX;
	int m_iY;
};
#endif


#include"Coordinate.h"
#include<iostream>
using namespace std;
 
Coordinate::Coordinate(int x,int y)
{
	m_iX=x;
	m_iY=y;
}
void Coordinate::printCoordinate()
{
	cout<<"("<<m_iX<<","<< m_iY<<")"<<endl;

}
ostream &operator<<(ostream &out,Coordinate &coor)
 {
	 out<<"("<<coor.m_iX<<","<<coor.m_iY<<")"<<endl;
	 return out;
 }

//栈机制，栈底和栈顶为栈要素，后进先出
#include<iostream>
#include"stdlib.h"
#include"MyStack.h"
#include"Coordinate.h"
using namespace std;
/*
  栈
  要求：
     1、定义Coordinate坐标类
	 2、改造栈类，使其可以适用于坐标类
	 目的：灵活掌握栈机制，理解抽象数据类型在栈中的应用
	  */ 
int main()
{
	MyStack<Coordinate>*pStack=new MyStack<Coordinate>(5);
	pStack->push (Coordinate(1,2));//底
	pStack->push (Coordinate(3,4));
	pStack->push (Coordinate(5,6));
	pStack->push (Coordinate(7,8));
	pStack->push (Coordinate(9,0));//顶
	pStack->stackTraverse(true);
	/*cout<<endl;
	char elem=0;
	pStack->pop(elem);
	cout<<elem<<endl;
	cout<<pStack->stackLength()<<endl;
	pStack->stackTraverse(true);
	cout<<endl;
	cout<<endl;*/
	pStack->stackTraverse(false);
	/*char ele =0;
	pStack->pop(ele );
	cout<<ele <<endl;*/
	cout<<pStack->stackLength()<<endl;
	pStack->stackTraverse(true);
	cout<<endl;
	cout<<endl;
	pStack->clearStack();
	cout<<pStack->stackLength()<<endl;
	if(pStack->stackEmpty())
	{
		cout<<"empty"<<endl;
	}
	if(pStack->stackFull())
	{
		cout<<"full"<<endl;
	}
	delete pStack;
	pStack=NULL;
	system("pause");
	return 0;
}

打印结果：