STL模拟实现——vector

vector实现

#pragma once
#include <utility> 
#include <assert.h>
namespace szg
{
	template<class T>
	class vector
	{
	public:
		typedef T* iterator;
		typedef const T* const_iterator;

		iterator begin()
		{
			return _start;
		}

		iterator end()
		{
			return _finish;
		}

		const_iterator begin()const
		{
			return _start;
		}

		const_iterator end()const
		{
			return _finish;
		}

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

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

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

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

		vector(int n, const T& value = T())
			:_start(nullptr)
			, _finish(nullptr)
			, _endofstorage(nullptr)
		{
			reserve(n);
			for (int i = 0; i < n; ++i)
			{
				_start[i] = value;
			}
			_finish = _start + n;
		}

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

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

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

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

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

		size_t capacity()const
		{
			return _endofstorage - _start;
		}
		void reserve(size_t n)
		{
			if (capacity() < n)
			{
				size_t oldSize = size();
				iterator temp = new T[n];
				for (int i = 0; i < oldSize; ++i)
				{
					temp[i] = _start[i];
				}
				if (_start)
				{
					delete[] _start;
				}
				std::swap(temp, _start);
				_finish = _start + oldSize;
				_endofstorage = _start + n;
			}
		}

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

		bool empty()const
		{
			return _start == _finish;
		}

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

		void pop_back()
		{
			assert(_start != _finish);
			--_finish;
		}

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

		iterator erase(const iterator& pos)
		{
			assert(pos >= _start);
			assert(pos < _finish);
			iterator t = pos + 1;
			while (t != end())
			{
				*(t - 1) = *t;
				++t;
			}
			--_finish;
			return pos;
		}

		void clear()
		{
			_finish = _start;
		 }

	private:
		iterator _start;
		iterator _finish;
		iterator _endofstorage;
		const static size_t npos = -1;

	};

	class Solution 
	{
	public:
		vector<vector<int>> generate(int numRows) {
			vector<vector<int>> ret;
			for (int i = 1; i <= numRows; ++i)
			{
				ret.push_back(vector<int>(i, 1));
				for (int k = 1; k < i - 1; ++k)
				{
					ret[i - 1][k] = ret[i - 2][k] + ret[i - 2][k - 1];
				}
			}
			return ret;
		}
	};
	void vector_test1()
	{
		szg::vector<int> v1;
		v1.push_back(1);
		v1.push_back(2);
		v1.push_back(3);
		v1.push_back(4);
		v1.push_back(5);
		vector<int> v2(v1.begin(),v1.end());
		vector<int> v3(v1);
		v1.pop_back();
		v1.pop_back();
		v1.pop_back();
		v1.pop_back();
		v1.pop_back();
		//v1.pop_back();
		
		vector<vector<int>> ret = Solution().generate(6);
		for (int i = 0; i < ret.size(); ++i)
		{
			for (int j = 0; j < ret[i].size(); ++j)
			{
				cout << ret[i][j] << "  ";
			}
			cout << endl;
		}
	}

	void vector_test2()
	{
		szg::vector<int> v1;
		v1.push_back(1);
		v1.push_back(2);
		v1.push_back(3);
		v1.push_back(4);
		v1.push_back(5);

		vector<int>::iterator p = v1.begin() + 3;
		p = v1.insert(p, 89);
		p = v1.insert(p, 88);
		p = v1.erase(p);
		p = v1.erase(p);
		p = v1.erase(p);
		for (auto& e : v1)
		{
			cout << e << " ";
		}
		cout << endl;
	}
}

vector的迭代器失效问题

由于异地扩容造成的迭代器失效

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

我们可以看到，在容量不足时，异地扩容后，原来的pos变为了野指针，造成迭代器失效。

 擦除之后迭代器失效

在Linux中不会报错，但是在VS中会报错。

int main()
{
	std::vector<int> v1;
	v1.push_back(1);
	v1.push_back(2);
	v1.push_back(3);
	v1.push_back(4);
	v1.push_back(5);
	std::vector<int>::iterator t = v1.begin();
	t = v1.erase(t);
	v1.erase(t);

	return 0;
}

 只要读取返回值就可以解决这个问题。

int main()
{
	std::vector<int> v1;
	v1.push_back(1);
	v1.push_back(2);
	v1.push_back(3);
	v1.push_back(4);
	v1.push_back(5);
	std::vector<int>::iterator t = v1.begin();
	t = v1.erase(t);
	v1.erase(t);

	return 0;
}