C++————vector的模拟实现

vector的优缺点

优点 :
1、支持下标的随机访问。 间接的就很好的支持排序、二分查找、堆算法等等。

缺点 :
1、头部和中部的插入删除效率低。0(N), 因为需要挪动数据。
2、插入数据空间不够需要增容。增容需要开新空间、拷贝数据、释放旧空间，会付出很大的代价。

list出厂就是为了解决vector缺陷

优点
1、list头部、中间插入不再需要挪动数据，效率高。0(1)
2、list插入数据是新增节点，不需要增容。

缺点
1、不支持随机访问。
所以实际使用中vector、list相辅相成的两个容器

---

一、vector模拟实现

vector.h

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <assert.h>
using namespace std;
namespace zh
{
	template<class T>
class vector
{
public:
	typedef T* iterator;
	typedef T* const_iterator;
	vector()
		:_start(nullptr), _finish(nullptr), _endofstorage(nullptr)
	{

	}
	/*vector(const vector<T>& v)
	{ 
		_start = new T[v.capacity];
		_finish = _start;
		_endofstorage = _start + v.capacity();

		for (size_t i = 0; i < v.size(); i++)
		{
			*_finish = v[i];
			++_finish;
		}
		
	}*/
	//v2(v1)
	vector( vector<T>& v)
	:_start(nullptr), _finish(nullptr), _endofstorage(nullptr)
	{
		
		reserve(v.capacity());
		for (const auto&e : v)
		{
			push_back(e);
		}

	}
	iterator begin()
	{
		return _start;
	}
	iterator end()
	{
		return _finish;
	}
	const_iterator begin() const
	{
		return _start;
	}
	const_iterator end() const
	{
		return _finish;
	}
	T& operator[](size_t i)
	{
		assert(i < size());
		return _start[i];
	}
	//v1 = v3
	/*vector<T>& operator = (const vector<T>&v)
	{
		if (this != &v)
		{
			delete[] _start;
			_start = new T[v.capacity()];
			memcpy(_start, v._start, sizeof(T) * v.size());
		}
		return *this;
	}*/
	//v1 = v3
	vector<T>& operator = ( vector<T>& v)
	{
		swap(v);
		return *this;
	}
	void swap(vector<T>& v)
	{
		::swap(_start, v._start);
		::swap(_finish, v._finish);
		::swap(_endofstorage, v._endofstorage);
	}
	~vector()
	{
		delete[] _start;
		_start = _finish = _endofstorage = nullptr;
	}
	const T& operator[](size_t i) const
	{
		assert(i < size());
		return _start[i];
	}
	void reserve(size_t n) 
	{
		if (n > capacity())
		{
			size_t sz = size();
			T* tmp = new T[n];
			if (_start)
			{
				//memcpy(tmp, _start, sizeof(T) * size());//按字节拷贝 浅拷贝
				for (size_t i = 0; i < sz; i++)
				{
					tmp[i] = _start[i]; //调用的是<T>的operator= 深拷贝
				}
				delete[] _start;
			}
			_start = tmp;
			_finish = tmp + sz;
			_endofstorage = tmp + n;
		}
	}
	void resize(size_t n, const T& val = T())
	{
		if (n < size())
		{
			_finish = _start + n;
		}
		else
		{
			if (n > capacity())
			{
				reserve(n);
			}
			while (_finish < _start + n)
			{
				*_finish = val;
				++_finish;
			}
		}
	}
	void pop_back()
	{
		/*assert(_start < _finish);
		--_finish;*/
		erase(_finish - 1);
	}
	void erase(iterator pos)
	{
		assert(pos < _finish);

		iterator it = pos;
		while (it <_finish)
		{
			*it = *(it + 1);
			++it;
		}
		--_finish;
	}
	void insert( iterator pos,const T&x)
	{
		assert(pos <= _finish);
		if (_finish == _endofstorage)
		{
			size_t sz = pos - _start;
			size_t newcapacity = capacity() == 0 ? 2 : capacity() * 2;
			reserve(newcapacity);
			//如果增容原来的pos就失效了，这里需要重新计算位置
			pos = _start + sz;
		}
		
		iterator end = _finish - 1;
		while (end >= pos)
		{
			*(end + 1) = *end;
			--end;
		}
		*pos = x; 
		++_finish;
	}
	void push_back(const T& x)
	{
		/*if (_finish == _endofstorage)
		{
			size_t newcapacity = capacity() == 0 ? 2 : capacity() * 2;
			reserve(newcapacity);
		}
		*_finish = x;
		++_finish;*/
		insert(_finish,x);
	}
	size_t size()
	{
		return _finish - _start;
	}
	size_t capacity()
	{
		return _endofstorage - _start;
	}
private:
	iterator _start;//第一个位置
	iterator _finish;//最后一个位置下一个
	iterator _endofstorage;//start+ capacity
};

void test_iterator()
{
	vector<int> v;
	v.push_back(1);
	v.push_back(2);
	v.push_back(3);
	v.push_back(4);
	v.push_back(5);
	v.push_back(6);
	v.push_back(7);
	v.push_back(8);

	vector<int>::iterator it = v.begin();

	while (it != v.end())
	{
		cout << *it << " ";
		++it;
	}
}
void print_vector(const vector<int>& v)
{
	vector<int>::const_iterator it = v.begin();

	while (it != v.end())
	{
		cout << *it << " ";
		++it;
	}
	cout << endl;
}
}