三种迭代器配接器 back_inserter front_inserter inserter

admin1

[code]#include<iostream>
#include<vector>
#include<list>
#include<deque>
#include<set>
#include <iterator>      //添加这个头文件才能识别 back_inserter front_inserter inserter
#include<algorithm>
using namespace std;

int main()
{
list coll1;
for(int i = 0; i <= 9; ++i)
{
  coll1.push_back(i);

}

vector coll2;
copy(coll1.begin(), coll1.end(), back_inserter(coll2)); //back_inserter在容器的尾端安插元素， 元素排列次序和
               //安插顺序相同
deque coll3;
copy(coll1.begin(), coll1.end(), front_inserter(coll3)); //front_inserter在容器的前端安插元素， 元素排列次序和
                //安插顺序相反
set coll4;
copy(coll1.begin(), coll1.end(), inserter(coll4, coll4.begin()));  //inserter（container, pos）在 pos位置上安插元素，
                  ////安插顺序相同

cout << "Output Result:" << endl;
cout << "list :" << endl;
list::iterator pos1;
for(pos1 = coll1.begin(); pos1 != coll1.end(); ++pos1)
{
  cout << *pos1 << ' ';
}
cout << endl  << endl;

cout << "vector back_inserter :" << endl;
vector::iterator pos2;
for(pos2 = coll2.begin(); pos2 != coll2.end(); ++pos2)
{
  cout << *pos2 << ' ';
}
cout << endl;

cout << "deque front_inserter:" << endl;
deque::iterator pos3;

for(pos3 = coll3.begin(); pos3 != coll3.end(); ++pos3)
{
  cout << *pos3 << ' ';
}
cout << endl << endl;

cout << "set inserter:" << endl;
set::iterator pos4;
for(pos4 = coll4.begin(); pos4 != coll4.end(); ++pos4)
{
  cout << *pos4 << ' ';
}
cout << endl;


return 0;
}

[/code]