嵌入式：C++ Day7-Toy模板网

这篇具有很好参考价值的文章主要介绍了嵌入式：C++ Day7。希望对大家有所帮助。如果存在错误或未考虑完全的地方，请大家不吝赐教，您也可以点击"举报违法"按钮提交疑问。

作业：一、手动封装vector容器

二、思维导图

一、手动封装vector容器

嵌入式：C++ Day7,c++,开发语言

源码：

#include <iostream>

using namespace std;

template < typename T >
class My_vector{
private:
    T *first;
    T *last;
    T *end;

public:
    My_vector<T>() : first(new T[2]), last(first), end(first + 2) {}     //无参构造
    My_vector<T>(int size) : first(new T[size]), last(first), end(first + size) {}  //有参构造

    //析构函数
    ~My_vector<T>(){
        delete []first;
    }

    //拷贝构造
    My_vector<T>(const My_vector &other){
        int len = other.last - other.first;
        int size = other.end - other.first;
        this->first = new T[size];
        memcpy(this->first, other.first, sizeof(T) * len);
        this->last = this->first + len;
        this->end = this->first + size;
    }

    //拷贝赋值
    My_vector &operator = (const My_vector &other){
        if(this == &other){
            return *this;
        }
        delete []this->first;
        this->first = other.first;
        this->last = other.last;
        this->end = other.end;
        return *this;
    }

    //返回指定坐标的值
    T &at(int index){
        int len = last - first;
        if(index < 0 || index > len){
            throw -1;
        }
        return first[index];
    }

    //判空
    bool empty(){
        return first == last;
    }

    //判满
    bool full(){
        return last == end;
    }

    //返回第一个元素
    T &front(){
        return *first;
    }

    //返回最后一个元素
    T &back(){
        return *(last - 1);
    }

    //返回容器元素个数
    int size(){
        return last -first;
    }

    //清空vector容器
    void clear(){
        last = first;
        cout << "清空容器成功！" << endl;
    }

    //二倍扩容
    void expand(){
        int size = end - first;
        T *temp = new T[2 * size];
        memcpy(temp, first, size * sizeof(T));
        delete []first;
        first = temp;
        last = first + size;
        end = first + 2 * size;
    }

    //尾插
    void push_back(T data){
        if(full()){
            expand();
        }
        *last = data;
        last++;
        cout << "插入成功！尾插元素为：" << data << endl;
    }

    //尾删
    void pop_back(){
        if(empty()){
            cout << "容器为空，无法删除！" << endl;
            return;
        }
        --last;
        cout << "删除成功！尾删元素为：" << *last << endl;
    }

    //遍历
    void output(){
        if(empty()){
            cout << "容器内无元素！" << endl;
            return;
        }
        int len = last - first;
        cout << "容器内元素为：" << endl;
        for(int i = 0; i < len; i++){
            cout << first[i] << "  ";
        }
        cout << endl;
    }
};
int main()
{
    int n;
    cout << "请输入容器的大小: ";
    cin >> n;
    My_vector<int> v1(n);     //实例化对象 有参构造

    //尾插元素
    v1.push_back(1);
    v1.push_back(2);
    v1.push_back(3);
    v1.push_back(4);
    v1.push_back(5);
    v1.push_back(6);
    v1.output();

    //尾删元素
    v1.pop_back();
    v1.pop_back();
    v1.output();

    cout << "第一个元素的值为：" << v1.front() << endl;
    cout << "最后一个元素的值为：" << v1.back() << endl;
    cout << "元素容器个数为:" << v1.size() << endl;
    v1.clear();   //清空容器
    v1.output();
    return 0;
}