用类模拟栈的出栈和压栈

#include<iostream>
using namespace std;


template <typename Type>
class CStatck
{
private:
Type m_n_Pot;     //栈的数据个数
Type m_n_Count;  //总栈数
        Type *m_p_Tack;
public:
bool isFull();          // 判断是否为满
bool is_Empty();    //判断是否为空
bool pop();            //弹栈
void push(const Type &t);   //推栈
void show();
CStatck(int ncount = 8);
virtual ~CStatck();
};


template<typename Type>
bool CStatck<Type>::isFull()
{
return m_n_Pot +1 > m_n_Count;
}


template<typename Type>
bool CStatck<Type>::is_Empty()
{
return m_n_Pot < 0;
}


template<typename Type>
bool CStatck<Type>::pop()
{
if (is_Empty())
return false;
m_n_Pot--;
return true;
}

template<typename Type>
void CStatck<Type>::push(const Type &t)
{
if (isFull())
return;
m_n_Pot++;
m_p_Tack[m_n_Pot] = t;
}


template<typename Type>
void CStatck<Type>::show()
{
int i = m_n_Pot;
for (i; i >=0; i--)
{
cout << m_p_Tack[i] << endl;
}
}


template<typename Type>
CStatck<Type>::CStatck(int ncount)
{
m_n_Pot = -1;
m_n_Count = ncount;
m_p_Tack = new Type[m_n_Count];
}
template<typename Type>
CStatck<Type>::~CStatck()
{
delete[]m_p_Tack;
}


int main()
{
CStatck <int> ta;
ta.push(0);
ta.push(1);
ta.push(2);
//cout << ta.m_p_Tack[2] << endl;
//ta.pop();
ta.push(3);
ta.show();
ta.pop();
ta.pop();
ta.show();
system("pause");



}