【STL】inserter和front_inserter的用法

#include  
#include  
#include   
using namespace std;  
int iArray[5] = { 1, 2, 3, 4, 5 }; 

void Display(list& a, const char* s) 
{   
	cout << s << endl;   
	copy(a.begin(), a.end(),ostream_iterator(cout, " "));   
	cout << endl; 
}

int main() 
{   
	list iList;
	copy(iArray, iArray + 5, front_inserter(iList));   
	Display(iList, "Before find and copy"); 
	list::iterator p = find(iList.begin(), iList.end(), 3);
	copy(iArray, iArray + 2, inserter(iList, p));   
	Display(iList, "After find and copy");    
	return 0; 
	
}  

 

Before find and copy
5 4 3 2 1
After find and copy
5 4 1 2 3 2 1
请按任意键继续. . .

 

#include
#include
#include
using namespace std;

class myclass
{
public:
	friend ostream &operator << (ostream &, const myclass &);
     myclass(int a,int b):first(a),second(b)
	 {
	 }
     int first;
     int second;
     bool operator < (const myclass &m) const 
     {
          return first < m.first;
     }     
}; 

//reload
ostream &operator << (ostream &out,const myclass &mc)
{
	out << mc.first << " " < &v, const char* s)   
{     
    cout << endl << s << endl;     
    copy(v.begin(), v.end(),ostream_iterator(cout," "));     
    cout << endl;   
}  


int main()
{
    int i=0;
    vector vct;
    for(i=0;i<10;i++)
    {
            myclass my(10-i,i*3);
            vct.push_back(my);
    }
	Display(vct,"Initial");

    sort(vct.begin(),vct.end()); //按第1个值排序 

	Display(vct,"after sorted by the  first:");
    sort(vct.begin(),vct.end(),less_second);//按第2个值排序

	Display(vct,"after sorted by the  second: ");
    system("pause");           
    return 0;
}

 

Initial
10 0
 9 3
 8 6
 7 9
 6 12
 5 15
 4 18
 3 21
 2 24
 1 27

after sorted by the  first:
1 27
 2 24
 3 21
 4 18
 5 15
 6 12
 7 9
 8 6
 9 3
 10 0

after sorted by the  second:
10 0
 9 3
 8 6
 7 9
 6 12
 5 15
 4 18
 3 21
 2 24
 1 27

请按任意键继续. . .