vector模拟（C++）

简单模拟一下vector

vector模拟实现

结构

	template<class T>
	class vector
	{
	public:
		typedef T* iterator;
		typedef const T* const_iterator;
	private:
		iterator _start = nullptr;
		iterator _finish = nullptr;
		iterator _end_of_storage = nullptr;
	};

成员函数

迭代器

		iterator begin()
		{
			return _start;
		}
		iterator end()
		{
			return _finish;
		}
		const_iterator begin() const
		{
			return _start;
		}
		const_iterator end() const
		{
			return _finish;
		}

构造

		//提供四种构造函数：
        //无参的
        vector()
		{}
        //用n个value进行初始化的
		vector(int n, const T& value = T())
		{
			reserve(n);
			for (int i = 0; i < n; i++)
			{
				push_back(value);
			}
		}
		//用迭代器区间初始化
		template<class InputIterator>
		vector(InputIterator first, InputIterator last)
		{
			while (first != last)
			{
				push_back(*first);
				++first;
			}
		}
		//拷贝构造
		vector(const vector<T>& v)
		{
			reserve(v.capacity());
			for (auto e : v)
			{
				push_back(e);
			}
		}

析构

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

交换

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

赋值=

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

扩容

		void reserve(size_t n)
		{
			if (n > capacity())
			{
				size_t sz = size();//提前记录：旧的size()
				T* tmp = new T[n];
				if (_start)
				{
					for (size_t i = 0; i < size(); i++)
					{
						tmp[i] = _start[i];
					}
					delete[] _start;
				}
				_start = tmp;
				_finish = _start + sz;
				_end_of_storage = _start + n;
			}
		}

设置有效个数

		void resize(size_t n, const T& val = T())
		{
			//判断：n与size的大小关系
			if (n <= size())
			{
				_finish = _start + n;
			}
			else
			{
				//扩容
				reserve(n);
				while (_finish < _start + n)
				{
					*_finish = val;
					++_finish;
				}

			}
		}

插入

		void insert(iterator pos, const T& val)
		{
			assert(pos <= _finish);
			assert(pos >= _start);

			if (size() == capacity())
			{
				size_t len = pos - _start;//记录pos相对于起始位置的偏移量
				//异地扩容后，会导致迭代器失效：pos指向的空间释放掉了，变成了野指针。
				reserve(capacity() == 0 ? 4 : capacity() * 2);
				pos = _start + len;//重新找到pos
			}
			iterator end = _finish - 1;

			while (end >= pos)
			{
				*(end + 1) = *end;
				end--;
			}

			*pos = val;
			_finish++;
		}

删除

		iterator erase(iterator pos)
		{
			assert(pos >= _start);
			assert(pos < _finish);

			iterator it = pos + 1;
			while (it < _finish)
			{
				*(it - 1) = *it;
				++it;
			}
			--_finish ;

			return pos;
		}

尾插

        void push_back(const T& val)
		{

			//直接复用插入
			insert(end(), val);
		}

尾删

		void pop_back()
		{
			//直接复用删除
			erase(end()-1);
		}

容量

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

有效个数

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

重载[]

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