vector的介绍
- vector是表示可变大小数组的序列容器。
- 就像数组一样,vector也采用的连续存储空间来存储元素。也就是意味着可以采用下标对vector的元素 进行访问,和数组一样高效。但是又不像数组,它的大小是可以动态改变的,而且它的大小会被容器自 动处理。
- 本质讲,vector使用动态分配数组来存储它的元素。当新元素插入时候,这个数组需要被重新分配大小 为了增加存储空间。其做法是,分配一个新的数组,然后将全部元素移到这个数组。就时间而言,这是 一个相对代价高的任务,因为每当一个新的元素加入到容器的时候,vector并不会每次都重新分配大 小。
- vector分配空间策略:vector会分配一些额外的空间以适应可能的增长,因为存储空间比实际需要的存 储空间更大。不同的库采用不同的策略权衡空间的使用和重新分配。但是无论如何,重新分配都应该是 对数增长的间隔大小,以至于在末尾插入一个元素的时候是在常数时间的复杂度完成的。
- 因此,vector占用了更多的存储空间,为了获得管理存储空间的能力,并且以一种有效的方式动态增 长。
- 与其它动态序列容器相比(deques, lists and forward_lists), vector在访问元素的时候更加高效,在 末尾添加和删除元素相对高效。对于其它不在末尾的删除和插入操作,效率更低。比起lists和 forward_lists统一的迭代器和引用更好
namespace bite
{
template<class T>
class vector
{
public:
typedef T* iterator;
public:
vector()
: _start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{}
vector(int n, const T& data)
: _start(new T[n])
{
for (size_t i = 0; i < n; ++i)
_start[i] = data;
_finish = _start + n;
_endofstorage = _finish;
}
template<class Iterator>
vector(Iterator fisrt, Iterator last)
{
size_t n = 0;
auto it = fisrt;
while (it != last)
{
++it;
++n;
}
_start = new T[n];
for (size_t i = 0; i < n; ++i)
_start[i] = *fisrt++;
_finish = _start + n;
_endofstorage = _start + n;
}
vector(const vector<T>& v);
vector<T>& operator=(const vector<T>& v);
~vector()
{
if (_start)
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
size_t size()const
{
return _finish - _start;
}
size_t capacity()const
{
return _endofstorage - _start;
}
bool empty()const
{
return _start == _finish;
}
void resize(size_t newsize, const T& data = T())
{
size_t oldsize = size();
if (newsize > oldsize)
{
size_t cap = capacity();
if (newsize > cap)
reserve(newsize);
for (; oldsize < newsize; ++oldsize)
_start[oldsize] = data;
}
_finish = _start + newsize;
}
void reserve(size_t newCapacity)
{
size_t oldCapcity = capacity();
if (newCapacity > oldCapcity)
{
T* temp = new T[newCapacity];
size_t n = size();
if (_start)
{
for (size_t i = 0; i < n; ++i)
{
temp[i] = _start[i];
}
delete[] _start;
}
_start = temp;
_finish = _start + n;
_endofstorage = _start + newCapacity;
}
}
T& operator[](size_t index)
{
assert(index < size());
return _start[index];
}
const T& operator[](size_t index)const
{
assert(index < size());
return _start[index];
}
T& front()
{
return *_start;
}
const T& front()const
{
return *_start;
}
T& back()
{
return *(_finish-1);
}
const T& back()const
{
return *(_finish-1);
}
void push_back(const T& data)
{
if (_finish == _endofstorage)
{
reserve(capacity() * 2 + 3);
}
*_finish++ = data;
}
void pop_back()
{
--_finish;
}
iterator insert(iterator pos, const T& data)
{
if (_finish == _endofstorage)
reserve(capacity() * 2);
auto it = _finish;
while (it > pos)
{
*it = *(it - 1);
--it;
}
*pos = data;
++_finish;
return pos;
}
iterator erase(iterator pos)
{
if (pos == end())
return pos;
auto it = pos + 1;
while (it != _finish)
{
*(it-1) = *it;
++it;
}
--_finish;
return pos;
}
void clear()
{
_finish = _start;
}
private:
T* _start;
T* _finish;
T* _endofstorage;
};
}
void TestVector()
{
bite::vector<int> v1;
bite::vector<int> v2(10, 5);
int array[] = { 1, 2, 3, 4, 5 };
bite::vector<int> v3(array, array+sizeof(array)/sizeof(array[0]));
cout << v2.size() << endl;
cout << v2.capacity() << endl;
cout << v3.front() << endl;
cout << v3.back() << endl;
for (size_t i = 0; i < v3.size(); ++i)
cout << v3[i] << " ";
cout << endl;
auto it = v3.begin();
while (it != v3.end())
{
cout << *it << " ";
++it;
}
cout << endl;
for (auto& e : v3)
e *= 2;
for (auto e : v3)
cout << e << " ";
cout << endl;
}
void TestVector2()
{
bite::vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
cout << v.size() << endl;
cout << v.capacity() << endl;
cout << v.back() << endl;
v.pop_back();
cout << v.back() << endl;
cout << v.size() << endl;
cout << v.front() << endl;
v.insert(v.begin(), 0);
cout << v.front() << endl;
cout << v.size() << endl;
}
#include <vector>
void TestVector3()
{
vector<int> vv;
bite::vector<int> v(10, 5);
cout << v.size() << endl;
cout << v.capacity() << endl;
v.resize(5);
cout << v.size() << endl;
cout << v.capacity() << endl;
v.resize(8);
cout << v.size() << endl;
cout << v.capacity() << endl;
v.resize(20, 5);
cout << v.size() << endl;
cout << v.capacity() << endl;
}
int main()
{
TestVector3();
return 0;
}