版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/weixin_42187898/article/details/84649589
如果在阅读过程中发现有错误,望评论指正,希望大家一起学习,一起进步。
学习C++编译环境:Linux
第六十课 数组类模板
1.预备知识
模板参数可以是数值型参数(非类型参数)
数值型模板参数的限制
变量不能作为模板参数
浮点数不能作为模板参数
类对象不能作为模板参数
。。。
本质:模板参数是在编译阶段被处理的单元,因此,在编译阶段必须准确无误的唯一确定。
2.有趣的面试题
用你觉得最高效的方法求1+2+3+…+N的值!
60-1 数值型模板参数
#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//模板技术
<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 + 3 + ... + 10 = " << Sum<10>::VALUE << endl;
cout << "1 + 2 + 3 + ... + 100 = " << Sum<100>::VALUE << endl;
return 0;
}
运行结果
1 + 2 + 3 + ... + 10 = 55
1 + 2 + 3 + ... + 100 = 5050
Array.h 数组模板类
#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
{
return m_array[index];
}
template
<typename T, int N>
Array<T, N>::~Array()
{
}
#endif
60-2.cpp
#include<iostream>
#include<string>
#include "Array.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;
}
return 0;
}
运行结果
0
1
4
9
16
HeapArray.h 堆数组模板类
34课的内容知识的改写:Array.h+HeapArray.h+60-3.cpp
60-3.cpp
#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<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;
}
HeapArray.h
#ifndef _HEAPARRAY_H_
#define _HEAPARRAY_H_
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();//Return to itself
~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
运行结果
0
1
4
9
16
a
b
c
d
e
f
g
h
i
j
小结
模板参数可以是数值型参数
数值型模板参数必须在编译期间唯一确定
数组类模板是基于数值型模板参数实现的
数组类模板是建议的线性表数据结构