C++进阶剖析（ 二十六）之数组类模板

1.1 理论
1.1.1 模板参数可以是数值型参数（非类型参数）

template <typename T ,int N>
void func()
{
	T a[N];  //使用模板参数定义局部数组
}

func<double,10>();

1.1.2 数值型模板参数的限制

• 变量不能作为模板参数
• 浮点数不能作为模板参数
• 类对象不能作为模板参数
  • 本质： 模板参数是在编译阶段被处理的单元，因此，在编译阶段必须准确无误的唯一确定

1.1.3 示例

• 求 1 + 2 + 3 + 4 + … + N 的值

template 
<int N>
class Sum
{
public:
	static const int value = Sum<N-1>::value + N;
};
template <>
class Sum <1>
{
public:
	static const int value = 1;
};

int main()
{
	cout<<"1 + 2 + ...  + 100 = "<<Sum<100>::value<<endl;
	return 0;
}

1.2 数组模板类

1.2.1

template<typename T ,int N>
class Array
{
private:
	T m_array[N];
public:
	int length();
	bool getValue(int index,T& value);
	bool setValue(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>::getValue(int index,T& value)
{
	bool ret = (0<= index && index < N);
	if(ret)
	{
		value = m_array[index];
	}
	return ret;
}
template <typename T,int N>
bool Array<T,N>::setValue(int index,T value)
{
	bool ret = (0<= index && index < N);
	if(ret)
	{
		m_array[index] = value;
	}
	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
{
	return m_array[index];
}
template <typename T,int N>
 Array<T,N>::~Array()
{
	
}
int main()
{
	Array<double,5> ad;
	for(int i =0;i< 5;i++)
	{
		ad[i] = i* i ;
	}
	for(int i = 0;i<5;  i++)
	{
		cout<< ad[i]<<endl;
	}
	return 0;
}

1.2.2 优化数组类

template
< typename T >
class HeapArray
{
private:
    int m_length;
    T* m_pointer;
    
    HeapArray(int len);
    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;
}

参考一 : 狄泰软件课程
如有侵权：请联系邮箱 1986005934@qq.com