模拟实现vector

模拟实现vector

#define _CRT_SECURE_NO_WARNINGS 1
#pragma once
namespace shichun

{

    template<class T>

    class vector

    {

    public:

        // Vector的迭代器是一个原生指针

        typedef T* iterator；

        typedef const T* const_iterator；

        iterator begin()
        {
            return _start;
        }

        iterator end()
        {
            return _finish;
        }

        const_iterator cbegin()；

        const_iterator cend() const；



        // construct and destroy

        vector()
            :_start(nullptr)
            ,_finish(nullptr)
            , _endOfStorage(nullptr)
        {}

        vector(int n, const T& value = T())；

        template<class InputIterator>
        vector(InputIterator first, InputIterator last)
            :_start(nullptr)
            , _finish(nullptr)
            , _endOfStorage(nullptr)
        {
            while (first != last)
            {
                push_back(*first);
                first++;
            }
        }

        void swap(vector<T>& v)
        {
            std::swap(_start, v._start);
            std::swap(_finish, v._finish);
            std::swap(_endOfStorage, v._endOfStorage);
        }

        vector(const vector<T>& v)
            :_start(nullptr)
            , _finish(nullptr)
            , _endOfStorage(nullptr)
        {
            vector<T>& tmp(v.begin(), v.end());
            swap(tmp);
        }

        vector<T>& operator= (vector<T> v)
        {
            swap(v);
            return *this;
        }

        ~vector()
        {
            if (_start)
            {
                delete[] _start;
                _start = nullptr;
                _finish = nullptr;
                _endOfStorage = nullptr;
            }

        }

        // capacity

        size_t size() const
        {
            return _finish - _start;
        }

        size_t capacity() const
        {
            return _endOfStorage - _start;
        }

        void reserve(size_t n)
        {
            if (n > capacity())
            {
                size_t sz = size();
                T* tmp = new T[n];
                if (_start)
                {
                    for (int i = 0; i < sz; i++)
                    {
                        tmp[i] = _start[i];
                    }
                    delete[] _start;
                }
                _start = tmp;
                _finish = _start + sz;
                _endOfStorage = _start + n;

            }
        }

        void resize(size_t n, const T& value = T())
        {
            if (n < size())
            {
                _finish = _start + n;
            }
            else
            {
                if (n > capacity())
                {
                    reserve(n);
                }
                while (_finish != start + n)
                {
                    *finish = value;
                    finish++;
                }
            }
        }



        ///access///

        T& operator[](size_t pos)
        {
            assert(pos < size());
            return _start[pos];
        }

        const T& operator[](size_t pos)const
        {
            assert(pos < size());
            return _start[pos];
        }



        ///modify/

        void push_back(const T& x)
        {
            if (_finish = _endOfStorage)
            {
                reserve(capacity == 0 ? 4 : capacity * 2);
            }
            *finish = x;
            finish++;
        }

        void pop_back()
        {
            assert(_finish > _start);
            finish--;
        }


        iterator insert(iterator pos, const T& x)
        {
            assert(pos >= _start);
            assert(pos <= _finish);
            if (_finish == _endOfStorage)
            {
                size_t len = pos - _start;
                reserve(capacity == 0 ? 4 : capacity * 2);
                pos = _start + len;
            }
            iterator cur = _finish-1;
            while (cur >= pos)
            {
                *(cur + 1) = *cur;
                cur--;
            }
            *pos = x;
            _finish++;
            return pos;
        }

        iterator erase(Iterator pos)
        {
            assert(pos >= _start);
            assert(pos < _finish);
            iterator cur = pos+1;
            while (cur < _finish)
            {
                *(cur - 1)= *cur;
                cur++;
            }
            --_finish;
            return pos;
        }

    private:

        iterator _start; // 指向数据块的开始

        iterator _finish; // 指向有效数据的尾

        iterator _endOfStorage; // 指向存储容量的尾

    };

}