vector
stl容器中的vector底层本质是可以动态增长的顺序表,所以vector在随机访问,尾插尾删方面效率最好,头插头删,中间插入删除的效率低
模拟实现代码
#include <assert.h>
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;
}
vector()
{}
~vector()
{
delete[] _start;
_start = _finish = _end_of_storage = nullptr;
}
vector(const vector<T>& v)
{
reserve(v.capacity());
for (const auto& e : v)
push_back(e);
}
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
vector(size_t n, const T& val = T())
{
resize(n, val);
}
vector(int n, const T& val = T())
{
resize(n, val);
}
template<class InputIterator>
vector(InputIterator begin, InputIterator end)
{
while (begin != end)
{
push_back(*begin);
begin++;
}
}
void swap(vector<T>& v)
{
::swap(_start, v._start);
::swap(_finish, v._finish);
::swap(_end_of_storage, v._end_of_storage);
}
void reserve(size_t n)
{
if (capacity() < n)
{
size_t sz = size();
T* tmp = new T[n];
if (_start)
{
for (int i = 0; i < sz; 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())
{
reserve(n);
if (n > size())
{
for (int i = size(); i < n; i++)
_start[i] = val;
}
_finish = _start + n;
}
void push_back(const T& val)
{
if (_finish == _end_of_storage)
{
reserve(capacity() == 0 ? 4 : 2 * capacity());
}
*_finish = val;
_finish++;
}
void pop_back()
{
assert(size() > 0);
_finish--;
}
iterator insert(iterator pos, const T& val)
{
assert(pos >= _start);
assert(pos <= _finish);
if (_finish == _end_of_storage)
{
size_t len = pos - _start;
reserve(capacity() == 0 ? 4 : 2 * capacity());
pos = _start + len;
}
iterator end = _finish;
while (end > pos)
{
*end = *(end - 1);
end--;
}
*pos = val;
_finish++;
return pos;
}
iterator erase(iterator pos)
{
assert(pos >= _start);
assert(pos < _finish);
// 1 2 3 4 5 _finish
iterator end = pos + 1;
while (end < _finish)
{
*(end - 1) = *end;
end++;
}
_finish--;
return pos;
}
T& operator[](size_t pos)
{
assert(pos < size());
return _start[pos];
}
const T& operator[](size_t pos) const
{
assert(pos < size());
return _start[pos];
}
T& front()
{
assert(size() > 0);
return *_start;
}
T& back()
{
assert(size() > 0);
return *--_finish;
}
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _end_of_storage - _start;
}
bool empty() const
{
return _start == _finish;
}
void clear()
{
_finish = _start;
}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _end_of_storage = nullptr;
};
迭代器失效
stl中的所有容器都支持用迭代器遍历,它提供了一种统一的方式,封装底层实现细节,vector的迭代器就是原生指针。
vector的迭代器失效其实就是因为扩容或缩容导致的野指针问题,为了解决这个问题,insert/erase等接口的返回值就是迭代器