目录
1.vector的介绍
1.1介绍
1. vector 是表示可变大小数组的序列容器。2. 就像数组一样, vector 也采用的连续存储空间来存储元素。也就是意味着可以采用下标对 vector 的元素进行访问,和数组一样高效。但是又不像数组,它的大小是可以动态改变的,而且它的大小会被容器自动处理。3.与其它动态序列容器相比( deque, list and forward_list ), vector 在访问元素的时候更加高效,在末尾添加和删除元素相对高效。对于其它不在末尾的删除和插入操作,效率更低。比起list 和 forward_list统一的迭代器和引用更好
1.2构造函数
vector比较常用的构造
1.3 迭代器的使用
常用迭代器接口
begin()获取第一个数据位置的 iterator/const_iterator , end()获取最后一个数据的下一个位置的 iterator/const_iterator
1.4容量空间相关的接口
capacity的代码在vs和g++下分别运行会发现,vs下capacity是按1.5倍增长的,g++是按2倍增长的。 不要固化的认为,vector增容都是2倍,具体增长多少是根据具体的需求定义
的。 vs 是 PJ 版本 STL , g++ 是 SGI 版本 STL 。reserve 只负责开辟空间,如果确定知道需要用多少空间, reserve 可以缓解 vector 增容的代价缺陷问题。 resize在开空间的同时还会进行初始化,影响 size 。
1.5增删改查相关的接口
2.模拟实现
模拟实现大致效果![](https://img-blog.csdnimg.cn/direct/a58b55d2172e492b8f0df7077fabe0ed.png)
成员变量
namespace s{
template<class T>
class vector {
public:
//vector的迭代器底层实际上就是T类型的指针
typedef T* iterator;
typedef const T* const_iterator;
private:
//指向第一个数据的位置
iterator _start = nullptr;
//指向最后一个数据的位置的下一个位置
iterator _finish = nullptr;
//指向最后一个能被用来存放数据的位置(最大容量处)的下一个位置
iterator _endOfStorage = nullptr;
};
}
容量接口
namespace s{
template<class T>
class vector {
public:
//vector的迭代器底层实际上就是T类型的指针
typedef T* iterator;
typedef const T* const_iterator;
//capacity
//_finish-_start就是数据个数
size_t size() const {
return _finish - _start;
}
//_endOfStorage - _start就是容量
size_t capacity() const {
return _endOfStorage - _start;
}
//如果所开空间小于原来空间不做处理
//大于就开新空间然后将旧数据拷贝过去,然后更新成员变量
void reserve(size_t n) {
if (n > capacity()) {
size_t oldsize = size();
T* tmp = new T[n];
if (_start) {
for (int i = 0; i < oldsize; i++) {
//memcpy()
tmp[i] = _start[i];
}
delete[] _start;
_start = tmp;
_finish = _start + oldsize;
_endOfStorage = _start + n;
}
}
}
//n>容量->扩容 否则改变_finish指向的位置
void resize(size_t n,const T& value=T()) {
if (n > size()) {
if (n > capacity()) {
reserve(n);
}
while (size() != n) {
push_back(value);
}
}
else {
_finish = _start + n;
}
}
private:
//指向第一个数据的位置
iterator _start = nullptr;
//指向最后一个数据的位置的下一个位置
iterator _finish = nullptr;
//指向最后一个能被用来存放数据的位置(最大容量处)的下一个位置
iterator _endOfStorage = nullptr;
};
}
对于reserve扩容,这里涉及到了一个问题:如何拷贝?1.浅拷贝 2.深拷贝
先看看浅拷贝,如果T是int类型,使用memcpy确实没有问题,那如果是自定义类型呢?
如vector<string>,T是string,使用memcpy会将_start指向的空间上的值拷贝给新空间,也就产生了下图这样的情况:
当释放旧空间时_start就是个野指针 ,所以这里使用tmp[i] = _start[i]进行拷贝,T若是string,就会调用string的赋值拷贝(深拷贝)
增删改查接口
//modify
void push_back(const T& x) {
//if (_finish == _endOfStorage) {
// size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
// reserve(newcapacity);
//}
//*_finish = x;
//_finish++;
insert(end(), x);
}
void pop_back() {
assert(_finish != _start);
_finish--;
}
void swap(vector<T>& v) {
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endOfStorage,v._endOfStorage );
}
iterator insert(iterator pos, const T& x) {
assert(pos >= _start && pos <= _finish);
size_t olddistance = pos - _start;
if (_finish == _endOfStorage) {
size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
reserve(newcapacity);
}
pos = _start + olddistance;
iterator it = end();
while (it != pos) {
*it = *(it - 1);
it--;
}
*pos = x;
_finish++;
return pos;
}
iterator erase(iterator pos) {
assert(pos >= _start && pos < _finish);
iterator it = pos;
while (it != end() - 1) {
*it = *(it + 1);
it++;
}
_finish--;
return pos;
}
此处需要注意的是迭代器的失效问题在vs中迭代器在vector对象经过insert或者erase后就会失效需要更新,更新的方法为通过方法返回值更新
[] 重载接口
//access
T& operator[](size_t pos) {
assert(pos >= 0 && pos < size());
return _start[pos];
}
const T& operator[](size_t pos) const {
assert(pos >= 0 && pos < size());
return _start[pos];
}
构造函数
// construct and destroy
//强制生成默认构造的方法
vector() = default;
vector(int n, const T& value = T()) {
resize(n);
for (int i = 0; i < size(); i++) {
_start[i] = value;
}
}
//传入迭代器区间的方式
template<class InputIterator>
vector(InputIterator first, InputIterator last) {
while (first != last) {
push_back(*first);
first++;
}
}
//现代方法拷贝构造
vector(const vector<T>& v) {
vector<int> tmp(v.cbegin(), v.cend());
swap(tmp);
}
//现代方法赋值构造
vector<T>& operator= (vector<T> v) {
swap(v);
return *this;
}
源码(包含测试用例):
#pragma once
#include<assert.h>
namespace xxx
{
template<class T>
class vector {
public:
typedef T* iterator;
typedef const T* const_iterator;
iterator begin() {
return _start;
}
iterator end() {
return _finish;
}
const_iterator cbegin() const {
return _start;
}
const_iterator cend() const {
return _finish;
}
// construct and destroy
vector() = default;
vector(int n, const T& value = T()) {
resize(n);
for (int i = 0; i < size(); i++) {
_start[i] = value;
}
}
template<class InputIterator>
vector(InputIterator first, InputIterator last) {
while (first != last) {
push_back(*first);
first++;
}
}
vector(const vector<T>& v) {
vector<int> tmp(v.cbegin(), v.cend());
swap(tmp);
}
vector<T>& operator= (vector<T> v) {
swap(v);
return *this;
}
~vector() {
delete[] _start;
_start = _finish = _endOfStorage = nullptr;
}
//capacity
size_t size() const {
return _finish - _start;
}
size_t capacity() const {
return _endOfStorage - _start;
}
void reserve(size_t n) {
if (n > capacity()) {
size_t oldsize = size();
T* tmp = new T[n];
if (_start) {
for (int i = 0; i < oldsize; i++) {
tmp[i] = _start[i];
}
delete[] _start;
_start = tmp;
_finish = _start + oldsize;
_endOfStorage = _start + n;
}
}
}
void resize(size_t n,const T& value=T()) {
if (n > size()) {
if (n > capacity()) {
reserve(n);
}
while (size() != n) {
push_back(value);
}
}
else {
_finish = _start + n;
}
}
//access
T& operator[](size_t pos) {
assert(pos >= 0 && pos < size());
return _start[pos];
}
const T& operator[](size_t pos) const {
assert(pos >= 0 && pos < size());
return _start[pos];
}
//modify
void push_back(const T& x) {
//if (_finish == _endOfStorage) {
// size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
// reserve(newcapacity);
//}
//*_finish = x;
//_finish++;
insert(end(), x);
}
void pop_back() {
assert(_finish != _start);
_finish--;
}
void swap(vector<T>& v) {
std::swap(_start, v._start);
std::swap(_finish, v._finish);
std::swap(_endOfStorage,v._endOfStorage );
}
iterator insert(iterator pos, const T& x) {
assert(pos >= _start && pos <= _finish);
size_t olddistance = pos - _start;
if (_finish == _endOfStorage) {
size_t newcapacity = capacity() == 0 ? 4 : capacity() * 2;
reserve(newcapacity);
}
pos = _start + olddistance;
iterator it = end();
while (it != pos) {
*it = *(it - 1);
it--;
}
*pos = x;
_finish++;
return pos;
}
iterator erase(iterator pos) {
assert(pos >= _start && pos < _finish);
iterator it = pos;
while (it != end() - 1) {
*it = *(it + 1);
it++;
}
_finish--;
return pos;
}
private:
iterator _start = nullptr;
iterator _finish = nullptr;
iterator _endOfStorage = nullptr;
};
void test1() {
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
v.pop_back();
for (auto e : v) {
cout << e << " ";
}
cout << endl;
}
void test2() {
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
vector<int> s;
s.push_back(3);
s.push_back(3);
s.push_back(3);
s.push_back(3);
for (auto e : s) {
cout << e << " ";
}
cout << endl;
v.swap(s);
for (int i = 0; i < s.size(); i++) {
cout << s[i] << " ";
}
cout << endl;
}
void test3() {
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
v.resize(2);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
vector<int> s(5, 6);
for (auto e : s) {
cout << e << " ";
}
}
void test4() {
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
vector<int> s(v.begin(), v.end());
for (auto e : s) {
cout << e << " ";
}
cout << endl;
string ss("hello");
vector<int> x(ss.begin(), ss.end());
for (auto e : x) {
cout << e << " ";
}
cout << endl;
}
void test5() {
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
vector<int> s(v);
for (auto e : s) {
cout << e << " ";
}
cout << endl;
vector<int> x;
x = v;
for (auto e : x) {
cout << e << " ";
}
cout << endl;
}
void test6() {
vector<int> v;
v.push_back(1);
v.push_back(20);
v.push_back(2);
v.push_back(3);
v.push_back(3);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
v.resize(10,1);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
v.resize(4, 1);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
}
void test7() {
vector<int> v;
v.push_back(1);
v.push_back(20);
v.push_back(2);
v.push_back(3);
v.push_back(3);
v.insert(v.begin()+1, 6);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
}
void test8() {
vector<int> v;
v.push_back(1);
v.push_back(20);
v.push_back(2);
v.push_back(3);
v.push_back(3);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
v.erase(v.end()-1);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
v.erase(v.end() - 1);
v.erase(v.end() - 1);
v.erase(v.end() - 1);
v.erase(v.end() - 1);
for (auto e : v) {
cout << e << " ";
}
cout << endl;
/*v.erase(v.end() - 1);*/
}
void test8() {
vector<int> v;
v.push_back(1);
v.push_back(20);
v.push_back(2);
v.push_back(3);
bit::vector<int>::iterator it = v.begin();
it=v.insert(it, 1);
}
}