<二>類模板

#include <iostream>
#include <cstring>
using namespace std;

template<typename T>
//template<typename T=int> 也可以這樣寫,寫個預設類型
//這是個模板名稱 ，模板名稱+類型參數列表=類名稱
class MyStack {

public:
        //在構造和析構函數名字後面可以不加<T>
	MyStack<T>(int _size = 10) :
		size(_size),
		top(-1),
		pHead(new T[size])
	{
	}

	//拷貝構造
	MyStack<T>(const MyStack<T> & src)
		: top(src.top),
		size(src.size)
	{
		pHead = new T[size];
		for (int i = 0; i<top; i++) {
			pHead[i] = src.pHead[i];
		}
	}

	MyStack<T> & operator=(const MyStack<T> & src) {
		if (this == &src) 
		{
			return *this; 
		}
		delete[] pHead;
		
		pHead = new T[size];
		for (int i = 0; i<src.top; i++) {
			pHead[i] = src.pHead[i];
			top++;
		}
		return *this;
	}

	//析構棧
	~MyStack() {
		delete[] pHead;
		pHead = nullptr;
	}

	//彈棧
	void pop() {
		if (Empty()) { return; }
		this->top--;
	}

	T getTop() const {
		if (Empty()) {
			 throw "Stack is Empty";			
		}
		else {
			return pHead[top-1];
		}
		
	}

	//壓棧
	void push(const T & _val) {
		if (Full()) {
			Expend();
		}
		if (Empty()) { top = 0; }
		pHead[top++] = _val;
	}

	//是否是空的
	bool Empty()const {
		return top<0;
	}
	//是否是滿的
	bool Full()const {
		return top == size-1;
	}

	void show() const {
		for (int i = 0; i < this->top; i++) {
			cout << pHead[i] << endl;
		}
	}
      
        void Test()const;

private:
	int size;//定義棧大小
	int top;//定義棧頂位置
	T   *pHead; //定義棧底指針

	//空間擴展
	void Expend() {
		int newSize = 2 * size;
		T *tepPHead = new T[newSize];
		for (int i = 0; i < top; i++) {
			tepPHead[i] = pHead[i];
		}
		this->size = newSize;
		delete[]this->pHead;
		this->pHead = tepPHead;

	}

};

template<typename T>
void MyStack<T>::Test()const {
	cout << "Test" << endl;
}


int main() {

        //類模板的選著性實例化
        //模板類 class MyStack<int>{};
	MyStack<int>  s1;

	s1.push(100);
	s1.push(50);
	s1.push(20);
	s1.push(200);

	s1.show();

	int topVal = s1.getTop();
	cout << topVal << endl;
	
	system("pause");
	return 1;
}