vector.h
#pragma once
namespace bit
{
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 _finish;
}
iterator begin()
{
return _start;
}
iterator end()
{
return _finish;
}
//构造函数
vector()
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{}
// 类模板的成员函数，还可以再定义模板参数
template <class InputIterator>
vector(InputIterator first, InputIterator last)
: _start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
while (first != last)
{
push_back(*first);
++first;
}
}
// v2(v1)
// 1、传统写法
/*vector(const vector<T>& v)
{
_start = new T[v.capacity()];
memcpy(_start, v._start, sizeof(T)*v.size());
_finish = _start + v.size();
_endofstorage = _start + v.capacity();
}*/
// 1.1传统写法
//v2(v1)--遍历v1初始化，把数据插入(插入会自己开空间)到v2中
//vector(const vector<T>& v)
// :_start(nullptr)
// , _finish(nullptr)
// , _endofstorage(nullptr)
//{
// reserve(v.capacity());
// for (const auto& e : v)//不用引用会引发深拷贝
// {
// push_back(e);
// }
//}
// 2、现代写法
vector(const vector<T>& v)
:_start(nullptr)
, _finish(nullptr)
, _endofstorage(nullptr)
{
vector<T> tmp(v.begin(), v.end());//需要模板参数才能使用
//this->swap(tmp);
swap(tmp);
}
// v1.swap(tmp);
void swap(vector<T>& v)
{
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endofstorage, v._endofstorage);
}
// v1 = v2
/*vector<T>& operator=(const vector<T>& v)
{
if (this != &v)
{
delete[] _start;//v1之前的东西释放掉
_start = _finish = _endofstorage = nullptr;
reserve(v.capacity());//开空间
for (const auto& e : v)
{
push_back(e);//拷贝v4到v1中
}
}
return *this;
}*/
// v1 = v4
//现代写法
vector<T>& operator=(vector<T> v)
{
swap(v);
return *this;
}
//析构
~vector()
{
delete[] _start;
_start = _finish = _endofstorage = nullptr;
}
size_t size() const
{
return _finish - _start;
}
size_t capacity() const
{
return _endofstorage - _start;
}
//重载[]
T& operator[](size_t i)
{
assert(i < size());
return _start[i];//即*(start+i)
}
const T& operator[](size_t i) const
{
assert(i < size());
return _start[i];
}
//只开空间
void reserve(size_t n)
{
if (n > capacity())
{
size_t sz = size();
T* tmp = new T[n];
if (_start)
{
// 如果T是int double等类型
//memcpy(tmp, _start, sizeof(T)*sz);
// 如果T是string -> test_vector9()
// 调用的就是string的operator=（深拷贝）
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& val = T())
{
//缩容
if (n <= size())
{
_finish = _start + n;
}
else
{
if (n > capacity())
{
reserve(n);
}
//填finish往后的数据
while (_finish < _start + n)
{
*_finish = val;
++_finish;
}
}
}
//尾插
void push_back(const T& x)
{
//if (_finish == _endofstorage)
//{
// size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
// reserve(newcapacity);
//}
//*_finish = x;//new出来的已经初始化过可以直接放数据
//++_finish;
insert(end(), x);
}
//尾删
void pop_back()
{
//assert(!empty());
//--_finish;
erase(--end());
}
iterator insert(iterator pos, const T& x)
{
//检查pos是否合法
assert(pos >= _start && pos <= _finish);
if (_finish == _endofstorage)
{
size_t len = pos - _start;
size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
reserve(newcapacity);
pos = _start + len;
}
iterator end = _finish - 1;
while (end >= pos)
{
*(end + 1) = *end;
--end;
}
*pos = x;
++_finish;
return pos;
}
iterator erase(iterator pos)
{
assert(pos >= _start && pos < _finish);
iterator it = pos + 1;
while (it != _finish)
{
*(it - 1) = *it;//当前位置挪到前一个位置来覆盖删除
++it;
}
--_finish;
return pos;
}
private:
iterator _start;
iterator _finish;
iterator _endofstorage;
};
//传值会深拷贝所以传引用
void print(const vector<int>& v)
{
//const对象需要const迭代器
vector<int>::const_iterator it = v.begin();
while (it != v.end())
{
cout << *it << " ";
++it;
}
cout << endl;
/*for (auto e : v)
{
cout << e << " ";
}
cout << endl;
//[]也需要const的版本
for (size_t i = 0; i < v.size(); ++i)
{
cout << v[i] << " ";
}
cout << endl;*/
}
//遍历
void test_vector1()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
vector<int>::iterator it = v.begin();
while (it != v.end())
{
cout << *it << " ";
++it;
}
cout << endl;
for (auto e : v)
{
cout << e << " ";
}
cout << endl;
for (size_t i = 0; i < v.size(); ++i)
{
cout << v[i] << " ";
}
cout << endl;
print(v);
}
void test_vector2()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
print(v);
v.resize(2);
print(v);
v.resize(4);
print(v);
v.resize(10, 5);//用5就不用T()里面的来初始化了
print(v);
}
void test_vector3()
{
//push_back一个string对象的原来写法
//有名对象
//string s("hello");
//v.push_back(s);
//匿名对象
//v.push_back(string("hello"));
//自动识别string
//v.push_back("hello");
//push_back一个string对象的新写法
vector<string> v;
v.push_back("hello");
v.push_back("hello");
v.push_back("hello");
v.push_back("hello");
for (auto e : v)
{
cout << e << " ";
}
cout << endl;
}
void test_vector4()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
pos = v.insert(pos, 20);//指向新插入元素的位置
}
cout << *pos << endl;
*pos = 100;
++pos;
for (auto e : v)
{
cout << e << " ";
}
cout << endl;
}
void test_vector5()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
//v.push_back(5);
//要求删除v中所有偶数
vector<int>::iterator it = v.begin();
while (it != v.end())
{
if (*it % 2 == 0)
{
v.erase(it);
}
++it;
}
}
void test_vector6()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
v.erase(pos);
}
cout << *pos << endl;
*pos = 100;
}
void test_vector7()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(2);
v.push_back(3);
v.push_back(4);
//v.push_back(5);
//要求删除v中所有偶数
vector<int>::iterator it = v.begin();
while (it != v.end())
{
if (*it % 2 == 0)
{
// erase 返回删除数据的下一个数据的位置
it = v.erase(it);
}
else
{
++it;
}
}
for (auto e : v)
{
cout << e << " ";
}
cout << endl;
}
//拷贝构造
void test_vector8()
{
vector<int> v1;
v1.push_back(1);
v1.push_back(2);
v1.push_back(2);
v1.push_back(3);
v1.push_back(4);
for (auto e : v1)
{
cout << e << " ";
}
cout << endl;
//拷贝构造
vector<int> v2(v1);
for (auto e : v2)
{
cout << e << " ";
}
cout << endl;
//赋值
v1 = v2;
for (auto e : v1)
{
cout << e << " ";
}
cout << endl;
}
void test_vector9()
{
vector<string> v1;
v1.reserve(4);
v1.push_back("11111");
v1.push_back("11111");
v1.push_back("11111");
v1.push_back("11111");
v1.push_back("11111"); // 增容
for (auto e : v1)
{
cout << e << " ";
}
cout << endl;
}
}
test.cpp
#include <iostream>
#include <assert.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#include "vector.h"
int main()
{
//bit::test_vector1();
//bit::test_vector1();
bit::test_vector3();
//空的尾删会报错
//std::vector<int> v;
//v.pop_back();
return 0;
}
- test_vector1()
-
test_vector2()
-
test_vector3()
-
test_vector4()
-
test_vector5()
-
test_vector6()
本来编译器是能强制出错，但我们自己实现的不会出错
-
test_vector7()
-
test_vector8()
-
test_vector9
reserve中使用memcpy调试tets_vector9会发现错误
reserve中使用深拷贝的时候的输出 -
reserve
insert
erase
深拷贝
迭代器失效
test.cpp
#include <iostream>
#include <assert.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
namespace std
{
void test_vector1()
{
std::vector<int> v;
v.reserve(4);
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
std::vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
v.insert(pos, 20);
}
// 在insert以后pos就失效了 -- insert时增容导致的
cout << *pos << endl;
*pos = 100;
}
void test_vector2()
{
std::vector<int> v;
v.reserve(6);
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
//在insert过程空间足够，没有增容，pos还是指向原来的位置，那么我们依旧认为pos失效了
//这里失效是指的pos的意义变了，pos不再指向的原来的值
std::vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
v.insert(pos, 20);
}
cout << *pos << endl;
*pos = 100;
++pos;
}
void test_vector3()
{
std::vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
std::vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
v.erase(pos);
}
cout << *pos << endl;
*pos = 100;
}
void test_vector4()
{
std::vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
//v.push_back(5);--在g++中没有这行会报错，但是在vs下都会报错
//因为最后一个为偶数会出问题，最后一个为奇数在g++下就能不报错，但实际已经都失效了
//要求删除v中所有偶数
std::vector<int>::iterator it = v.begin();
while (it != v.end())
{
if (*it % 2 == 0)
{
v.erase(it);
}
++it;
}
}
}
int main()
{
std::test_vector4();
return 0;
}
1、insert
在linux下没有检查出来
2、erase
失效的解决办法
- insert–指向新插入元素的位置
void test_vector5()
{
std::vector<int> v;
v.reserve(6);
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
std::vector<int>::iterator pos = find(v.begin(), v.end(), 2);
if (pos != v.end())
{
pos = v.insert(pos, 20);//用pos来接收
}
cout << *pos << endl;
*pos = 100;
++pos;
}
- erase–返回删除数据的下一个数据的位置
void test_vector6()
{
std::vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(2);
v.push_back(3);
v.push_back(4);
//v.push_back(5);
//要求删除v中所有偶数
std::vector<int>::iterator it = v.begin();
while (it != v.end())
{
if (*it % 2 == 0)
{
// erase 返回删除数据的下一个数据的位置
it = v.erase(it);
}
else
{
++it;
}
}
for (auto e : v)
{
cout << e << " ";
}
cout << endl;
}
897
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
