问题记录：C++中Vector

参考链接:http://www.cplusplus.com/reference/vector/vector/

 Vector在阅读代码中总能看到，尤其是在路径点处理的过程中更是随处可见，其用法甚多遇到有意思的便记录下来便于后续查找。

下面代码主要实现在比较长的路径点序列中(waypoints)按给定参考位置(pre_index)截取附近相邻(search_size)的路径点，用来减少计算量。

#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;

int main() {
    int prev_index = 30;
    int search_size = 30;
    std::vector<int> waypoints;
    for(int i = 0; i < 100; ++i){
        waypoints.push_back(i);
    }

int start_index = 15;
    int end_index = 45;
    cout << *waypoints.begin() << endl;
    auto start_itr = waypoints.begin() + start_index;
    cout << *start_itr << endl;
    for(int i=0; i < 100; i++){
        cout << start_itr[i] <<"##";
    }
    cout << endl;
    auto end_itr = waypoints.begin() + end_index;
    cout << *end_itr << endl;
    for(int i=0; i <100; i++){
        cout << end_itr[i] <<"**";
    }
    cout << endl;
    std::vector<int>local_waypoints = std::vector<int>(start_itr, end_itr);
    cout << "--" << local_waypoints.size() << "--" << endl;
    for(int i=0; i <local_waypoints.size(); i++){
        cout << local_waypoints[i] << endl;
    }
	return 0;
}

结果

上述代码实现在30位置处截取左右各15个点。

1. 构造实例

2. 迭代器

实例

#include <iostream>
#include <vector>

int main ()
{
  std::vector<int> myvector;
  for (int i=1; i<=5; i++) myvector.push_back(i*2);

  std::cout << "myvector contains:";
  for (std::vector<int>::iterator it = myvector.begin() ; it != myvector.end(); it++)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}

3. 访问元素

4. 修改元素

insert

erase

std::vector::erase
iterator erase (const_iterator position);
iterator erase (const_iterator first, const_iterator last);

swap