安插型迭代器

 1 #include <algorithm>
 2 #include <iterator>
 3 #include <list>
 4 #include <vector>
 5 #include <deque>
 6 #include <set>
 7 #include <iostream>
 8 using namespace std;
 9 
10 int main()
11 {
12     list<int> coll1 = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
13     vector<int> coll2 = { 100 };
14 
15     copy(coll1.cbegin(), coll1.cend(),back_inserter(coll2)); //安插与容器最末端         
16     set<int> coll3 = { 100 };
17     copy(coll1.cbegin(), coll1.cend(), inserter(coll3, coll3.begin())); //安插与容器最前端
18     cout << "coll2:";
19     for (size_t i =0; i < coll2.size(); i++)
20     {
21         cout << coll2[i] << " ";
22     }
23     cout << endl<<"coll3:";
24     set<int>::iterator    iter = coll3.begin();
25     for (iter; iter!=coll3.end(); iter++)
26     {
27         cout << *iter << " ";
28     }
29 }