vector结构
template<class T>
class vector
{
public:
typedef T* iterator;//typedef 受访问限定符限制
typedef const T* const_iterator;
private:
iterator _start = nullptr;//给缺省值,初始化列表时等就不需要初始化了
iterator _finish = nullptr;
iterator _endofstorage = nullptr;
};
vector里的成员变量图解
vector的迭代器
迭代器分两种:const迭代器和非const迭代器
template<class T>
class vector
{
public:
typedef T* iterator;//typedef 受访问限定符限制
typedef const T* const_iterator;
const_iterator begin()const
{
return _start;
}
const_iterator end()const
{
return _finish;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
}
vector的四个默认成员函数
1.构造函数
<1> 这两种无参的都可以,但是给了成员变量缺省值,我们更偏向于第二个
vector()
:_start(nullptr)
,_finish(nullptr)
,_endofstorage(nullptr)
{}
vector()
{}
<2>用迭代器做模板可以用其他各种迭代器
eg: string str(“hello world”);
vector v4(str.begin(), str.end());
template<class InputIteraotr>//用迭代器做模板可以用其他各种迭代器
vector(InputIteraotr first, InputIteraotr last)
{
while (first != last)
{
push_back(*first);
++first;
}
}
<3>给n个val初始化,用const T& val = T() 是因为你并不知道给的val是什么,int?char?string?
所以直接给匿名对象
vector(size_t n, const T& val = T())
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(val);
}
}
vector(int n, const T& val = T())//下面注意里面激讲为什么要函数重载
{
reserve(n);
for (int i = 0; i < n; i++)
{
push_back(val);
}
}
注意:在vector v0(10, 0)时会默认调用<2>,因为相较于<3>的size_t 和 T变化匹配 ,<2>里面的参数反而显得更加匹配int int ,所以会默认去调用<2>, 但是<2>是给迭代器用的,会报错:非法的间接寻址,所以我们给<3>函数重载,让<3>更匹配
2.拷贝构造函数
容器容量设置 + 遍历尾插
//v2(v1)
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
for (auto& e : v)
{
push_back(e);
}
}
3.复制运算符重载
现代写法,这里要实现深拷贝, v2 = v1其实是v1去拷贝构造v,然后交换v2和v,便可对v2赋值
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
//v2 = v1
vector<T>& operator=(vector<int> tmp)
{
swap(tmp);
return *this;
}
4.析构函数
~vector()
{
delete[]_start;
_start = _finish = _endofstorage = nullptr;
}
其他
capacity 和 size
size_t capacity()const
{
return _endofstorage - _start;
}
size_t size()const
{
return _finish - _start;
}
reserve 和 resize
n>capacity说明reserve不能缩容,只能扩
注意:1.将原空间内容拷贝到新空间,一定要用赋值的深拷贝
2.为什么要提前记录size(),因为如果在下面使用_finish = _start + size()的话,对于
size()里面的_finish - _start,_finish是老空间,_start是新空间,会出大问题。
void reserve(size_t n)
{
if (n > capacity())//扩容才进去
{
size_t sz = size();//提前记录size
T* tmp = new T[n];
if (_start)
{
//memcpy(tmp, _start, sizeof(T) * sz);//浅拷贝
for (size_t i = 0; i < sz; i++)
{
tmp[i] = _start[i];//赋值深拷贝
}
delete[] _start;
}
_start = tmp;
_finish = _start + sz;
_endofstorage = _start + n;
}
}
1.resize可以删数据,需要n和size()比较。
2.小于的话就直接调整_finish的位置
3.大于的话交给reserve调整空间大小,遍历给赋值
void resize(size_t n,const T& val = T())//匿名对象具有常性)
{
if (n <= size())
{
_finish = _start + n;
}
else
{
reserve(n);//让reserve去检查
while (_finish < _start + n)
{
*_finish = val;
++_finish;
}
}
}
push_back
因为写了reserve函数来调整空间了,所以判断空间是否用完后直接尾插就好了
void push_back(const T& x)
{
if (_finish == _endofstorage)
{
//size_t sz = size();//提前存sz,避免后面因为size引发的指针问题
//size_t cp = capacity() == 0 ? 4 : capacity() * 2;
//T* tmp = new T[cp];
//if (_start)
//{
// memcpy(tmp, _start, sizeof(T) * sz);
// delete[] _start;
//}
///*_start = tmp; error
//_finish = _start + size();*/
///*_finish = tmp + size();
//_start = tmp;*/
//_start = tmp;
//_finish = _start + sz;
//
//_endofstorage = _start + cp;
reserve(capacity() == 0 ? 4 : capacity() * 2);
}
*_finish = x;
++_finish;
}
insert和erase
对于insert和erase导致的迭代器失效问题,在这一篇中你可以看到更详细的分析
有关vector迭代器失效问题
void insert(iterator pos, const T& x)
{
assert(pos >= _start);
assert(pos <= _finish);
if (_finish == _endofstorage)
{
size_t len = pos - _start;//迭代器失效第一种:扩容引起的,野指针
//解决办法:提前记录pos和_start的距离
reserve(capacity() == 0 ? 4 : capacity() * 2);
pos = _start + len;
}
iterator end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
--end;
}
*pos = x;
++_finish;
}
解决erase导致的迭代器失效,返回一个指向下一个位置的迭代器,然后及时更新
iterator erase(iterator pos)//返回被删除位置的下一个位置
{
assert(pos < _finish);
assert(pos >= _start);
iterator it = pos + 1;
while (it < _finish)
{
*(it - 1) = *it;
++it;
}
--_finish;
return pos;
}
//结论:insert和erase以后迭代器都失效了,不能再访问
运算符重载
重载一个读的一个写的
T& operator[](size_t pos)
{
assert(pos < size());
return _start[pos];
}
const T& operator[](size_t pos)const
{
assert(pos < size());
return _start[pos];
}
整体代码
#define _CRT_SECURE_NO_WARNINGS
#include<assert.h>
namespace nzq
{
template<class T>
class vector
{
public:
typedef T* iterator;//typedef 受访问限定符限制
typedef const T* const_iterator;
const_iterator begin()const
{
return _start;
}
const_iterator end()const
{
return _finish;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
/*vector()
:_start(nullptr)
,_finish(nullptr)
,_endofstorage(nullptr)
{}*/
vector()
{}
template<class InputIteraotr>//用迭代器做模板可以用其他各种迭代器
vector(InputIteraotr first, InputIteraotr last)
{
while (first != last)
{
push_back(*first);
++first;
}
}
vector(size_t n, const T& val = T())
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(val);
}
}
/*vector(int n, const T& val = T())
{
reserve(n);
for (int i = 0; i < n; i++)
{
push_back(val);
}
}*/
//v2(v1)
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
for (auto& e : v)
{
push_back(e);
}
}
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
//v2 = v1
vector<T>& operator=(vector<int> tmp)
{
swap(tmp);
return *this;
}
~vector()
{
delete[]_start;
_start = _finish = _endofstorage = nullptr;
}
void reserve(size_t n)
{
if (n > capacity())
{
size_t sz = size();
T* tmp = new T[n];
if (_start)
{
//memcpy(tmp, _start, sizeof(T) * sz);//浅拷贝
for (size_t 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& val = T())//匿名对象具有常性)
{
if (n <= size())
{
_finish = _start + n;
}
else
{
reserve(n);//让reserve去检查
while (_finish < _start + n)
{
*_finish = val;
++_finish;
}
}
}
size_t capacity()const
{
return _endofstorage - _start;
}
size_t size()const
{
return _finish - _start;
}
void push_back(const T& x)
{
if (_finish == _endofstorage)
{
//size_t sz = size();//提前存sz,避免后面因为size引发的指针问题
//size_t cp = capacity() == 0 ? 4 : capacity() * 2;
//T* tmp = new T[cp];
//if (_start)
//{
// memcpy(tmp, _start, sizeof(T) * sz);
// delete[] _start;
//}
///*_start = tmp; error
//_finish = _start + size();*/
///*_finish = tmp + size();
//_start = tmp;*/
//_start = tmp;
//_finish = _start + sz;
//
//_endofstorage = _start + cp;
reserve(capacity() == 0 ? 4 : capacity() * 2);
}
*_finish = x;
++_finish;
}
void 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 end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
--end;
}
*pos = x;
++_finish;
}
iterator erase(iterator pos)//返回被删除位置的下一个位置
{
assert(pos < _finish);
assert(pos >= _start);
iterator it = pos + 1;
while (it < _finish)
{
*(it - 1) = *it;
++it;
}
--_finish;
return pos;
}
//结论:insert和erase以后迭代器都失效了,不能再访问
T& operator[](size_t pos)
{
assert(pos < size());
return _start[pos];
}
const T& operator[](size_t pos)const
{
assert(pos < size());
return _start[pos];
}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _endofstorage = nullptr;
};
void test1()
{
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);
v.insert(v.begin(),1);
v.insert(v.begin(),0);
for (size_t i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
cout << endl;
vector<int> v1(v);
vector<int> v2(10, 0);
}
}