模板参数可以是数值型参数(非类型参数)
template<typename T,int N>
void func()
{
T a[N]; //使用模板参数定义局部数组
}
func<double,10>();
数值型模板参数的限制:变量不能作为模板参数,浮点数(计算机内部表示不精确)不能作为模板参数,类对象不能作为模板参数。
本质:模板参数是在编译阶段被处理的单元,因此,在编译阶段必须准确无误的唯一缺点。
最高效的方法求1+2+3+..+N的和?
#include <iostream>
#include <string>
using namespace std;
template
< typename T, int N >
void func()
{
T a[N] = {0};
for(int i=0; i<N; i++)
{
a[i] = i;
}
for(int i=0; i<N; i++)
{
cout << a[i] << endl;
}
}
template //x< int N >
class Sum
{
public:
static const int VALUE = Sum<N-1>::VALUE + N; //存储在全局数据区或者符号表,value存储在全局数据区
};
template
< > //完全特化
class Sum < 1 >
{
public:
static const int VALUE = 1; //符号表
};
//static 静态成员,具有类变量属性,使得整个类可以使用,存储在全局存储区,const表示进入符号表,运行之前就能确定他的值
int main()
{
//int a=10;
// func<int,a>(); //出错
cout << "1 + 2 + 3 + ... + 100 = " << Sum<100>::VALUE << endl;
//N=10,调用x,在调用sum<9>...sum<1>,值为1,编译器做相应计算,在编译期就能确定结果值,运行时直接打印值。
return 0;
}
#ifndef _ARRAY_H_#define _ARRAY_H_
template
< typename T, int N >
class Array
{
T m_array[N];
public:
int length();
bool set(int index, T value);
bool get(int index, T& value);
T& operator[] (int index);
T operator[] (int index) const;
virtual ~Array();
};
template< typename T, int N >
int Array<T, N>::length()
{
return N;
}
template< typename T, int N >
bool Array<T, N>::set(int index, T value)
{
bool ret = (0 <= index) && (index < N);
if( ret )
{
m_array[index] = value;
}
return ret;
}
template< typename T, int N >
bool Array<T, N>::get(int index, T& value)
{
bool ret = (0 <= index) && (index < N);
if( ret )
{
value = m_array[index];
}
return ret;
}
template< typename T, int N >
T& Array<T, N>::operator[] (int index)
{
return m_array[index];
}
template< typename T, int N >
T Array<T, N>::operator[] (int index) const //数组类对象是const对象,最后加const
{
return m_array[index];
}
template< typename T, int N >
Array<T, N>::~Array()
{
}
#endif
第34课intarray 扩展:
#ifndef _HEAPARRAY_H_ //heap 堆上分配空间#define _HEAPARRAY_H_
template
< typename T >class HeapArray
{
private:
int m_length;
T* m_pointer;
HeapArray(int len); //构造函数时private, 不能继承HeapArray(const HeapArray<T>& obj);
bool construct();
public:
static HeapArray<T>* NewInstance(int length);
int length();
bool get(int index, T& value);
bool set(int index ,T value);
T& operator [] (int index);
T operator [] (int index) const;
HeapArray<T>& self();
~HeapArray();
};
template< typename T >
HeapArray<T>::HeapArray(int len)
{
m_length = len;
}
template< typename T >
bool HeapArray<T>::construct()
{
m_pointer = new T[m_length];
return m_pointer != NULL;
}
template< typename T >
HeapArray<T>* HeapArray<T>::NewInstance(int length)
{
HeapArray<T>* ret = new HeapArray<T>(length);
if( !(ret && ret->construct()) )
{
delete ret;
ret = 0;
}
return ret;
}
template< typename T >
int HeapArray<T>::length()
{
return m_length;
}
template< typename T >
bool HeapArray<T>::get(int index, T& value)
{
bool ret = (0 <= index) && (index < length());
if( ret )
{
value = m_pointer[index];
}
return ret;
}
template< typename T >
bool HeapArray<T>::set(int index, T value)
{
bool ret = (0 <= index) && (index < length());
if( ret )
{
m_pointer[index] = value;
}
return ret;
}
template< typename T >
T& HeapArray<T>::operator [] (int index)
{
return m_pointer[index];
}
template< typename T >
T HeapArray<T>::operator [] (int index) const
{
return m_pointer[index];
}
template< typename T >
HeapArray<T>& HeapArray<T>::self()
{
return *this;
}
template< typename T >
HeapArray<T>::~HeapArray()
{
delete[]m_pointer;
}
#endif
#include <iostream>
#include <string>
#include "Array.h"
#include "HeapArray.h"
using namespace std;
int main(){
Array<double, 5> ad;
for(int i=0; i<ad.length(); i++)
{
ad[i] = i * i;
}
for(int i=0; i<ad.length(); i++){
cout << ad[i] << endl;
}
cout << endl;
//以下是heaparray 的测试HeapArray<char>* pai = HeapArray<char>::NewInstance(10);
if( pai != NULL )
{
HeapArray<char>& ai = pai->self();
for(int i=0; i<ai.length(); i++)
{
ai[i] = i + 'a';
}
for(int i=0; i<ai.length(); i++)
{
cout << ai[i] << endl;
}
}
delete pai;
return 0;
}
模板参数可以是数值型参数,数值型模板参数必须在编译期间唯一确定,数组类模板是基于数值型模板参数实现的,数组类模板是简易的线性表数据结构。