single element (1) | iterator insert (const_iterator position, const value_type& val); |
---|---|
fill (2) | iterator insert (const_iterator position, size_type n, const value_type& val); |
range (3) | template <class InputIterator> iterator insert (const_iterator position, InputIterator first, InputIterator last); |
move (4) | iterator insert (const_iterator position, value_type&& val); |
initializer list (5) | iterator insert (const_iterator position, initializer_list<value_type> il); |
该矢量是通过在指定的元素之前插入新元素扩展位置,vector 通常使用数组作为底层存储,当插入的元素超过了其容量时,引起vector 存储的重新分配,则通常是低效的。
插入值:在iterater position之前插入新元素。
返回值:返回一个迭代器,指向第一个新插入的元素。
例子:
// inserting into a vector
#include <iostream>
#include <vector>
int main ()
{
std::vector<int> myvector (3,100);
std::vector<int>::iterator it;
it = myvector.begin();
it = myvector.insert ( it , 200 );
myvector.insert (it,2,300);
// "it" no longer valid, get a new one:
it = myvector.begin();
std::vector<int> anothervector (2,400);
myvector.insert (it+2,anothervector.begin(),anothervector.end());
int myarray [] = { 501,502,503 };
myvector.insert (myvector.begin(), myarray, myarray+3);
std::cout << "myvector contains:";
for (it=myvector.begin(); it<myvector.end(); it++)
std::cout << ' ' << *it;
std::cout << '\n';
return 0;
}
Output:
myvector contains: 501 502 503 300 300 400 400 200 100 100 100 |