C++——template入门

#include <iostream>
using namespace std;

//template case

template<class T1,class T2>
class Point{
public:
	Point(T1 x, T2 y) :m_x(x), m_y(y){}
public:
	T1 getX() const;
	void setX(T1 x);
	T2 getY() const;
	void setY(T2 y);
private:
	T1 m_x;//x location
	T2 m_y;//y location
};

template<class T1,class T2>
T1 Point<T1, T2>::getX() const{
	return m_x;
}

template<class T1,class T2>
void Point<T1, T2>::setX(T1 x){
	m_x = x;
}

template<class T1,class T2>
T2 Point<T1, T2>::getY() const {
	return m_y;
}

template<class T1,class T2>
void Point<T1, T2>::setY(T2 y){
	m_y = y;
}

int main(){
	Point<int, int> pi(10, 20);
	cout << "x = " << pi.getX() << ", y = " << pi.getY() << endl;

	Point<int, char*> p2(10, "东经180度");
	cout << "x = " << p2.getX() << ", y = " << p2.getY() << endl;

	Point<char*, char*> *p3 = new Point<char*, char*>("东经180度","北纬210度");
	cout << "x = " << p3->getX() << ", y = " << p3->getY() << endl;
	return 0;
	
}

实现动态数组

#include <iostream>
using namespace std;
//template in order to flexible array
template <class T>
class CArray{
	int size;
	T *ptr;     //指向动态分配的数组
public:
	CArray(int s = 0);//代表元素个数
	CArray(CArray & a);//通过数组初始化
	~CArray();
	void push_back(const T & v);//数组尾部插入元素
	CArray & operator=(const CArray &a);//用于数组对象之间的赋值，“=”重载
	T length(){ return size; }//返回数组长度
	T & operator[](int i){
		//支持根据下标访问数组元素，“[]”重载
		return ptr[i];
	}
};

template<class T>
CArray<T>::CArray(int s) :size(s){
	if (s == 0)
		ptr = NULL;
	else
		ptr = new T[s];
}

template<class T>
CArray<T>::CArray(CArray & a){
	if (!a.ptr){
		ptr = NULL;
		size = 0;
		return;
	}
	ptr = new T[a.size];
	memcpy(ptr, a.ptr, sizeof(T)*a.size);//数组的复制
	size = a.size;
}

template <class T>
CArray<T>:: ~CArray(){
	if (ptr) delete[] ptr; //释放指针
}

template <class T>
CArray<T> & CArray<T>::operator= (const CArray & a)
{
	//赋值的作用是使“=”左边对象存放的数组大小、内容和右边一致
	if (this = &a)//对自己复制，例：a = a
		return *this;
	if (a.ptr == NULL){//如果a里面数组为空
		if (ptr){
			delete[] ptr;
		}
		ptr = NULL;
		size = 0;
		return *this;
	}
	if (size<a.size){//如果原空间足够大，则不必重新分配 
		if (ptr)
			delete[] ptr;
		ptr = new T[a.size];
	}
	mencpy(ptr,a.ptr,sizeof(T)*a.size);
	size = a.size;
	return *this;
}

template <class T>
void CArray<T>::push_back(const T &v)
{
	if (ptr){
		T * tmpPtr = new T[size + 1];
		memcpy(tmpPtr, ptr, sizeof(T)*size);
		delete[] ptr;
		ptr = tmpPtr;
	}
	else
		ptr = new T[1];
	ptr[size++] = v;
}

int main()
{
	CArray<int> a;
	for (int i = 0; i < 5;++i){
		a.push_back(i);
	}
	for (int i = 0; i < a.length();++i){
		cout << a[i] << " ";
	}
	return 0;
}