代码拉取完成,页面将自动刷新
#pragma once
#include<string.h>
#include<assert.h>
#include<iostream>
#include<string.h>
#include<string>
#include<list>
using namespace std;
namespace Qin
{
template<class T>
class vector
{
public:
typedef T* iterator;
typedef const T* const_iterator;
vector()
{}
vector(const vector<T>& v)
{
//swap(v);//不要加const
reserve(v.capacity());
for (auto& e : v)
push_back(e);
}
template<class inputiterator>//可以是任意类型的迭代器
// 类模板的成员函数,还可以继续是函数模版
vector(inputiterator first, inputiterator last)
{
while (first != last)
{
push_back(*first);
first++;
}
}
vector(int n, const T& val = T())
{
reserve(n);
while (n--)
push_back(val);
}
~vector()
{
if (_start)
{
delete[] _start;
_start = _finish = _end_of_shorage = nullptr;
}
}
void swap(vector<T>& v)
{
std::swap(_finish, v._finish);
std::swap(_start, v._start);
std::swap(_end_of_shorage, v._end_of_shorage);
}
void clear()
{
_start = _finish;
}
vector<T>& operator=(vector<T> v)
{
//if (this != &v)
//{
// clear();
// reserve(v.capacity());
// for (auto& e : v)
// push_back(e);
//}
swap(v);
return *this;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
const_iterator begin() const
{
return _start;
}
const_iterator end() const
{
return _finish;
}
void reserve(size_t n)
{
if (n > capacity())
{
T* tmp = new T[n];
//memcpy(tmp, _start, size() * sizeof(T));
//for (size_t i = 0; i < size(); i++)
//{
// tmp[i] = _start[i]// 如果victor里面是string,这个赋值调用的是string的赋值重载,它会自己开新空间
//}
size_t x = size();
while (x--)
tmp[x] = _start[x];
delete[] _start;
_finish = size() + tmp;// 一定要先改finish再是start,是size()里面的finish失效的问题
_start = tmp;
_end_of_shorage = tmp + n;
}
}
size_t size()const
{
return _finish - _start;
}
size_t capacity()const
{
return _end_of_shorage - _start;
}
void push_back(const T& x)
{
if (_finish == _end_of_shorage)
{
reserve(capacity() == 0 ? 4 : 2 * capacity());
}
(*_finish) = x;
++_finish;
}
T& operator[](size_t n)
{
assert(n < size());
return _start[n];
}
const T& operator[](size_t n) const
{
assert(n < size());
return _start[n];
}
bool empty()const
{
return _finish == _start;
}
void pop_back()
{
assert(!empty());
--_finish;
}
iterator insert(iterator pos,const T& x)
{
assert(pos >= _start);
assert(pos <= _finish);
if (_finish == _end_of_shorage)
{
int ret = pos - _start;
reserve(capacity() == 0 ? 4 : 2 * capacity());
pos = _start + ret;
}
iterator end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
end--;
}
*pos = x;
++_finish;
return pos;
}
void erase(iterator pos)
{
assert(pos >= _start);
assert(pos < _finish);
iterator it = pos + 1;
while (it != _finish)
{
*(it - 1) = *it;
++it;
}
--_finish;
}
void resize(size_t n,T val = T())
{
if (n < size())
{
_finish = _start + n;
}
else
{
reserve(n);
while (_finish != _start + n)
{
*_finish = val;
_finish++;
}
}
}
//iterator find(iterator start, iterator end,const T& x)
//{
// iterator ret = start;
// while (ret != end)
// {
// if (*ret == x)
// return ret;
// ret++;
// }
// return nullptr;
//}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _end_of_shorage = nullptr;
};
template<class container>
void print_container(const container& v)
{
for (auto t : v)
cout << t<< ' ';
cout << endl;
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。