c++/qt作业

实现Myvector

#include <iostream>

using namespace std;

template <typename T>
class myvector
{
public:
    T *first ;
    T *last ;
    T * end  ;

public:
    //二倍扩容
    void expand()
    {
        if(this->end == this->last)
        {
            int size = this->last - this->first;
            T *p = new T[2*size];
            memcpy(p,this->first,size);
            delete [] this->first;
            this->first = p;
            this->end = this->first+2*size;
            this->last = this->first+size;
        }
    }
    //无参构造
    myvector( )
    {
        first = new T[20] ;
        last = this->first;
        end = this->first+20;
    }
    //析构函数
    ~ myvector( )
    {
        delete []this->first;
    }
    //拷贝构造
    myvector(const myvector & other )
    {
        int size= (other.last - other.first) ;
        first = new T[size] ;
        last = this->first;
        end = this->first+size;

        other.last = other.first;
        for(int i = 0;i <size ;i++)
        {
            *(this->last) = *(other.last);
            this->last++;
            other.last++;
        }
    }
    //尾插
    void  push_back(const T val)
    {
        expand();
        *(this->last) = val;
        this->last++;
    }
    //尾删
    void popback()
    {
        this->last--;
    }
    //返回第一个元素的引用
    T &front()
    {
        return *(this->first);
    }
    //返回最后一个元素的引用
    T &back()
    {
        return *(this->last-1);
    }
    //求实际数据个数函数
    int size()
    {
        return this->last - this->first;
    }
    //清空函数
    void clear()
    {
        this->last = this->first;
    }
    //判空
    bool empty()
    {
        return first == last;
    }
    //判满
    bool full()
    {
        return end == last;
    }
    //按位置查找
    T at(int n)
    {
        int size= (this->last - this->first) ;
        if(n<0 || n >= size)
        {
            cout<<"越界"<<endl;
            return 0;
        }else
        {
            return *(this->first+n);
        }
    }
};

int main()
{
    myvector<int> v1;   //无参构造
    //尾插
    for(int i = 0;i<6;i++)
    {
        v1.push_back(i);
    }
    //按位置查找，遍历
    for(int i = 0;i<v1.size();i++)
    {
        cout<<v1.at(i)<<" ";
    }
    cout<<endl;
    //尾删
    v1.popback();
    //最后一个元素引用
    v1.back() = 6;
    //第一个元素引用
    v1.front() = 5;
    for(int i = 0;i<v1.size();i++)
    {
        cout<<v1.at(i)<<" ";
    }
    cout<<endl;
    //清空
    v1.clear();
    //判空
    cout<<"是否为空 = "<<v1.empty()<<endl;
    //判满
    cout<<"是否为满 = "<<v1.full()<<endl;

    v1.~myvector();
    return 0;
}