1.vector的介绍
1)vector是可以表示可变大小数组的序列容器
2)vector采用的连续存储空间来存储元素,如同数组一样,因此也可以用下标对vector中的元素进行访问。
3)本质上,vector使用动态分配数组来存储它的元素,当新元素插入时,这个数组需要重新分配大小,为了增加存储空间,分配一个新的数组,然后将全部元素移到这个数组。
4)vector分配空间策略:vector会分配一些额外的空间以适应可能的增长,因为存储空间比实际需要的存储空间更大。
5)vector占用了更多的存储空间,为了获得管理存储空间的能力,并且以一种有效的方式动态增长
6)与其他动态序列容器相比,vector在访问元素的时候更加高效,在末尾添加和删除元素相对高效,对于其他不再末尾的删除和插入操作、效率更低
2.vector空间增长问题
size:获取数据个数
capacity:获取容量大小
empty:判断是否为空
resize:改变vector的size
reserve:改变vector放入capacity
capacity的代码在vs下按照1.5倍增长,g++是按2倍增长的
reserve只负责开辟空间,如果确定知道需要多少空间,reserve可以缓解vector增容的代价缺陷问题
resize在开空间的同时还会进行初始化,影响size
3.vector增删改查
push_back(重点) 尾插
pop_back(重点) 尾删
find: 查找
insert: 在position位置之前插入val
erase:删除position位置的数据
swap: 交换两个vector的数据空间
operator[]:(重点) 像数组一样访问
4.迭代器失效问题
删除pos位置的数据,导致迭代器失效
在pos位置插入数据,导致pos迭代器失效
insert会导致迭代器失效,是因为insert可能会导致增容,增容后pos还指向原来的空间,而原来的空间已经释放了
vector的模拟实现
namespace zhao
{
template<class T>
class vector
{
typedef T* iterator;
typedef const T* const_iterator;
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator cbegin() const
{
return _start;
}
const_iterator cend() const
{
return _finish;
}
vector()
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{}
vector(int n, const T& value = T())
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(n);
while (n--)
{
push_back(value);
}
}
template<class IputIterator>
vector(IputIterator first, IputIterator last)
{
reserve(last - first);
while (first != last)
{
push_back(*first);
++first;
}
}
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
iterator it begin();
const_iterator vit v.cbegin()
while (vit != v.cend())
{
*it++ = *it++;
}
_finish = _start + v.size();
_endofstorge = _start + v.capaciy();
}
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
~vector()
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
//capaciy
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _endofstorage - _start;
}
void reserve(size_t n)
{
if (n > capacity())
{
size_t oldsize = size();
T* tmp = new T[n];
if (_start)
{
for (size_t i = 0; i < oldsize; ++i)
temp[i] = _start[i];
}
_start = tmp;
_finish = _start + size;
_endofstorage = _start + n;
}
}
void resize(size_t n.const T& value = T())
{
//1.如果n小于当前的size,则数据个数缩小到n
if (n <= size())
{
_finish = _start + n;
return;
}
//2.空间不够则增容
if (n > capacity())
reserve(n);
//3.讲size扩大到n
iterator it _finish;
iterator _finish = _start + n;
while (it != _finish)
{
*it = value;
++it;
}
}
T& operator[](size_t pos)
{
return _start[pos];
const T& operator[](size_t pos) const
{
return _start[pos];
}
}
void push_back(const T& x)
{
insert(end(), x);
}
void pop_back()
{
erase(--end());
}
void swap(vector<T>& v)
{
swap(_start, v._start);
swap(_finish, v._finish);
swap(_endofstorage, v._endofstorage);
}
iterator insert(iterator pos, const T& x)
{
assert(pos <= _finish);
//空间不够先进行增容
if (_finish == _endofstorage)
{
size_t size = size();
size_t newCapacity = (0 == capacity()) ? 1 : capacity() * 2;
reserve(newCapacity);
//如果发生了增容,需要重置pos
pos = _start + size;
}
iterator end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
--end;
}
*pos = x;
++_finish;
return pos;
}
iterator (Iterator pos)
{
iterator begin = pos + 1;
while (begin != _finish)
{
*(begin - 1) = *begin;
++begin;
}
return pos;
}
private:
iterator _start;
iterator _finish;
iterator _endofstorage;
};
}
namespace zhao
{
template
class vector
{
typedef T* iterator;
typedef const T* const_iterator;
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator cbegin() const
{
return _start;
}
const_iterator cend() const
{
return _finish;
}
vector()
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{}
vector(int n, const T& value = T())
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(n);
while (n–)
{
push_back(value);
}
}
template<class IputIterator>
vector(IputIterator first, IputIterator last)
{
reserve(last - first);
while (first != last)
{
push_back(*first);
++first;
}
}
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
iterator it begin();
const_iterator vit v.cbegin()
while (vit != v.cend())
{
*it++ = *it++;
}
_finish = _start + v.size();
_endofstorge = _start + v.capaciy();
}
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
~vector()
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
//capaciy
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _endofstorage - _start;
}
void reserve(size_t n)
{
if (n > capacity())
{
size_t oldsize = size();
T* tmp = new T[n];
if (_start)
{
for (size_t i = 0; i < oldsize; ++i)
temp[i] = _start[i];
}
_start = tmp;
_finish = _start + size;
_endofstorage = _start + n;
}
}
void resize(size_t n.const T& value = T())
{
//1.如果n小于当前的size,则数据个数缩小到n
if (n <= size())
{
_finish = _start + n;
return;
}
//2.空间不够则增容
if (n > capacity())
reserve(n);
//3.讲size扩大到n
iterator it _finish;
iterator _finish = _start + n;
while (it != _finish)
{
*it = value;
++it;
}
}
T& operator[](size_t pos)
{
return _start[pos];
const T& operator[](size_t pos) const
{
return _start[pos];
}
}
void push_back(const T& x)
{
insert(end(), x);
}
void pop_back()
{
erase(--end());
}
void swap(vector<T>& v)
{
swap(_start, v._start);
swap(_finish, v._finish);
swap(_endofstorage, v._endofstorage);
}
iterator insert(iterator pos, const T& x)
{
assert(pos <= _finish);
//空间不够先进行增容
if (_finish == _endofstorage)
{
size_t size = size();
size_t newCapacity = (0 == capacity()) ? 1 : capacity() * 2;
reserve(newCapacity);
//如果发生了增容,需要重置pos
pos = _start + size;
}
iterator end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
--end;
}
*pos = x;
++_finish;
return pos;
}
iterator (Iterator pos)
{
iterator begin = pos + 1;
while (begin != _finish)
{
*(begin - 1) = *begin;
++begin;
}
return pos;
}
private:
iterator _start;
iterator _finish;
iterator _endofstorage;
};
}