template<class T>
class vector
{
public:
typedef T* iterator;
typedef const T* const_iterator;
const_iterator begin() const
{
return _start;
}
const_iterator end() const
{
return _last;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _last;
}
vector()
:_start(nullptr)
,_last(nullptr)
,_endofstorage(nullptr)
{}
template <class InputIterator>
vector(InputIterator first, InputIterator last)
: _start(nullptr)
, _last(nullptr)
, _endofstorage(nullptr)
{
while (first != last)
{
push_back(*first);
++first;
}
}
vector(const vector<T>& v)
:_start(nullptr)
, _last(nullptr)
, _endofstorage(nullptr)
{
reserve(v.capacity());
for (const auto& e : v)
{
push_back(e);
}
}
~vector()
{
delete[] _start;
_last = nullptr;
_start = nullptr;
_endofstorage = nullptr;
}
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_last, v._last);
std::swap(_endofstorage, v._endofstorage);
}
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
size_t size()
{
return _last - _start;
}
size_t capacity()
{
return _endofstorage - _start;
}
bool empty()
{
return _start == _last;
}
void reserve(size_t n)
{
if (n > capacity())
{
size_t sz = capacity();
T* tmp = new T[n];
memcpy(tmp, _start, sizeof(T) * sz);
_start = tmp;
_last = _start + sz;
_endofstorage = _start + n;
}
}
void resize(size_t n,const T& val=T())
{
if (n <= size())
{
_last = _start + n;
}
else
{
if (n > capacity())
{
reserve(n);
}
while(_last<_start+n)
{
*_last= val;
_last++;
}
}
}
T& operator[](size_t n)
{
assert(n < size());
return _start[n];
}
const T& operator[](size_t n) const
{
assert(n < size());
return _start[n];
}
void Push_back(const T& x)
{
insert(end(), x);
}
void Pop_back()
{
assert(!empty());
--_last;
}
iterator insert(iterator pos, const T& x)
{
assert(pos >= _start && pos <= _last);
if (_last == _endofstorage)
{
size_t len = pos - _start;
size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
reserve(newcapacity);
pos = _start + len;
}
iterator end = _last;
while (end >= pos)
{
*end = *(end - 1);
--end;
}
*pos = x;
++_last;
return pos;
}
iterator erase(iterator pos)
{
assert(pos >= _start && pos <= _last);
iterator end = pos + 1;
while (end < _last)
{
*(end - 1) = *end;
++end;
}
--_last;
return pos;
}
private:
iterator _start;
iterator _last;
iterator _endofstorage;
};