一 . 成员变量
vs下,vector 采取三指针维护;
二 . 成员函数
1 . 构造 :vector(); 析构
vector()//构造
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
}
~vector()//析构
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
2 . 迭代器:iterator begin (), iterator end ()
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator begin()const
{
return _start;
}
const_iterator end()const
{
return _finish;
}
//对于一些 const 修饰的,需要这两个函数
//使用 范围for ,其底层就是迭代器
3 . size(); capacity();
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _endofstorage - _start;
}
4 . reserve, resize
reserve
void reserve(size_t n)
{
if (n > capacity())
{
size_t sz = size();
iterator tmp = new T[n];
if (_start != nullptr)
{
//memcpy(tmp, _start, sizeof(T) * size());
//delete[] _start;
for (size_t i = 0; i < sz; i++)
{
tmp[i] = _start[i];
}
delete[] _start;
}
_start = tmp;
_finish = _start + sz;
_endofstorage = _start + n;
}
}
resize
void resize(size_t n, const T& value = T())
{
if (n <= size())
{
_finish = _start + n;
}
else
{
reserve(n);
while (_finish < _start + n)
{
*_finish = value;
_finish++;
}
}
}
5 . push_back, pop_back
void push_back(const T& x)
{
//扩容
if (_finish == _endofstorage)
{
size_t cp = (capacity() == 0 ? 4 : 2 * capacity());
cout << "扩容:" << cp << endl;
reserve(cp);
}
//尾插
*_finish = x;
_finish++;
}
void pop_back()
{
//判断是否有数据可删
assert(_finish > _start);
//尾删
_finish--;
}
6 . operator[]操作符
T& operator[](size_t pos)
{
assert(pos < size());
return *(_start + pos);
}
const T& operator[](size_t pos)const
{
assert(pos < size());
return *(_start + pos);
}
7 . insert, erase
insert
iterator insert(iterator pos, const T& x)
{
assert(pos >= _start);
assert(pos <= _finish);
//扩容
if (_finish == _endofstorage)
{
size_t sub = pos - _start;
size_t cp = (capacity() == 0 ? 4 : 2 * capacity());
cout << "扩容:" << cp << endl;
reserve(cp);
pos = _start + sub;
}
//插入
iterator end = _finish;
while (end > pos)
{
*end = *(end - 1);
end--;
}
*pos = x;
_finish++;
return pos;
}
erase
iterator erase(iterator pos)
{
assert(_start < _finish);
assert(_start <= pos);
assert(pos < _finish);
iterator it = pos;
while (it < _finish)
{
*it = *(it + 1);
it++;
}
_finish--;
return pos;
}
8 . 第二种构造 vector(size_t n, const T& value = T())
vector(size_t n, const T& value = T())
:_start(nullptr)
,_finish(nullptr)
,_endofstorage(nullptr)
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(value);
}
}
9 . 拷贝构造 vector(const vector<T>& v)
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
for(auto e : v)
{
push_back(e);
}
}
10 . 第三种构造
template <class InputIterator>
vector ( InputIterator first, InputIterator last )
template<class InputIterator>
vector(InputIterator first, InputIterator last)
:_start(nullptr)
,_finish(nullptr)
,_endofstorage(nullptr)
{
while (first != last)
{
push_back(*first);
first++;
}
}
这样会引发问题:
当vector<int> v(10, 5),我们本来的意思是:初始化 10 个空间为 5,但事实上,这段代码会先匹配第三种构造。
解决:再写更匹配的代码
vector(int n, const T& value = T())
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(value);
}
}
11 . swap(vector<T>& v), operator=
//将两个对象的指针进行交换,就完成了两对象内容的交换
void swap(vector<T>& v)
{
//下面使用的swap函数并不是vector的函数
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
//参数这样写,是为了拷贝,用拷贝的对象进行交换
vector<T>& operator= (vector<T> v)
{
swap(v);
return *this;
}
三 . 完整的代码
namespace sun
{
template<class T>
class vector
{
public:
typedef T* iterator;
typedef const T* const_iterator;
vector()//构造
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
}
vector(size_t n, const T& value = T())
:_start(nullptr)
,_finish(nullptr)
,_endofstorage(nullptr)
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(value);
}
}
vector(int n, const T& value = T())
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
reserve(n);
for (size_t i = 0; i < n; i++)
{
push_back(value);
}
}
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)
{
reserve(v.capacity());
for(auto e : v)
{
push_back(e);
}
}
vector<T>& operator= (vector<T> v)
{
swap(v);
return *this;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator begin()const
{
return _start;
}
const_iterator end()const
{
return _finish;
}
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _endofstorage - _start;
}
void reserve(size_t n)
{
if (n > capacity())
{
size_t sz = size();
iterator tmp = new T[n];
if (_start != nullptr)
{
//memcpy(tmp, _start, sizeof(T) * size());
//delete[] _start;
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& value = T())
{
if (n <= size())
{
_finish = _start + n;
}
else
{
reserve(n);
while (_finish < _start + n)
{
*_finish = value;
_finish++;
}
}
}
void push_back(const T& x)
{
//扩容
if (_finish == _endofstorage)
{
size_t cp = (capacity() == 0 ? 4 : 2 * capacity());
cout << "扩容:" << cp << endl;
reserve(cp);
}
//尾插
*_finish = x;
_finish++;
}
void pop_back()
{
//判断是否有数据可删
assert(_finish > _start);
//尾删
_finish--;
}
T& operator[](size_t pos)
{
assert(pos < size());
return *(_start + pos);
}
const T& operator[](size_t pos)const
{
assert(pos < size());
return *(_start + pos);
}
iterator insert(iterator pos, const T& x)
{
assert(pos >= _start);
assert(pos <= _finish);
//扩容
if (_finish == _endofstorage)
{
size_t sub = pos - _start;
size_t cp = (capacity() == 0 ? 4 : 2 * capacity());
cout << "扩容:" << cp << endl;
reserve(cp);
pos = _start + sub;
}
//插入
iterator end = _finish;
while (end > pos)
{
*end = *(end - 1);
end--;
}
*pos = x;
_finish++;
return pos;
}
iterator erase(iterator pos)
{
assert(_start < _finish);
assert(_start <= pos);
assert(pos < _finish);
iterator it = pos;
while (it < _finish)
{
*it = *(it + 1);
it++;
}
_finish--;
return pos;
}
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
~vector()//析构
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _endofstorage = nullptr;
};
}