第十四周实践项目3————数组类模板

/*copyright(c)2016.烟台大学计算机学院
 * All rights reserved,
 * 文件名称：text.Cpp
 * 作者：吴敬超
 * 完成日期：2016年6月1日
 * 版本号：codeblock
 *
 * 问题描述: 数组成员模板
 * 输入描述:
 * 程序输出： 输出结果
 */
#include 
#include 
#include 
using namespace std;

template 
class Array
{
private:
    T* list;
    int size;
public:
    Array(int sz = 50);
    Array(const Array &a);
    ~Array();
    Array & operator = (const Array &rhs);
    T & operator [] (int i);
    const T & operator [] (int i) const;
    operator T * ();
    operator const T * () const;
    int getSize() const;
    void resize(int sz);
};

template  Array::Array(int sz)
{
    assert(sz >= 0);
    size = sz;
    list = new T [size];
}

template  Array::~Array()
{
    delete [] list;
}

//拷贝构造函数
template  Array::Array(const Array &a)
{
    size = a.size;

    list = new T[size];
    for (int i = 0; i < size; i++)
        list[i] = a.list[i];
}

template 
Array &Array::operator = (const Array& rhs)
{
    if (&rhs != this)
    {
        if (size != rhs.size)
        {
            delete [] list;
            size = rhs.size;
            list = new T[size];
        }

        for (int i = 0; i < size; i++)
            list[i] = rhs.list[i];
    }
    return *this;
}


template 
T &Array::operator[] (int n)
{
    assert(n >= 0 && n < size);
    return list[n];
}

template 
const T &Array::operator[] (int n) const
{
    assert(n >= 0 && n < size);
    return list[n];
}


template 
Array::operator T * ()
{
    return list;
}

template 
Array::operator const T * () const
{
    return list;
}

template 
int Array::getSize() const
{
    return size;
}


template 
void Array::resize(int sz)
{
    assert(sz >= 0);
    if (sz == size)
        return;
    T* newList = new T [sz];
    int n = (sz < size) ? sz : size;
        for (int i = 0; i < n; i++)
        newList[i] = list[i];
    delete[] list;
    list = newList;
    size = sz;
}
int main()
{
    Array a(10);
    int n, count = 0;
    cout << "Enter a value >= 2 as upper limit for prime numbers: ";
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        bool isPrime = true;
        for (int j = 0; j < count; j++)
            if (i % a[j] == 0)
            {
                isPrime = false;
                break;
            }
        if (isPrime)
        {
            if (count == a.getSize()) a.resize(count * 2);
            a[count++] = i;
        }
    }
    for (int i = 0; i < count; i++)
        cout << setw(8) << a[i];
    cout << endl;
    return 0;
}

运行结果：