使用front_inserter 将使元素反序

front_inserter 创建的迭代器将调用push_front()操作向容器中添加元素，将造成元素以相反的顺序出现在目标序列中，因为默认的顺序是和push_back() 相同的

using namespace std;



int main(int argc, char* argv[])
{
   list<int> ivec1,ivec2,ivec3,ivec4,ivec5;

   for(list<int>::size_type i = 0;  i<10 ; ++i)
   {
       ivec1.push_back(i);
   }

   cout<<"original content:"<<endl;
   for(list<int>::iterator i = ivec1.begin() ; i != ivec1.end() ; ++i)
   {
       cout<<*i<<endl;
   }

   //only use replace_copy
   replace_copy(ivec1.begin(),ivec1.end(),ivec2.begin(),1,1);
   cout<<"only use replay_copy:"<<endl;
    for(list<int>::iterator i = ivec2.begin() ; i != ivec2.end() ; ++i)
   {
       cout<<*i<<endl;
   }


   //use replace_copy and inserter
   replace_copy(ivec1.begin(),ivec1.end(),inserter(ivec3,ivec3.begin()),2,2);
   cout<<"use replace_copy and inserter:"<<endl;
   for(list<int>::iterator i = ivec3.begin() ; i != ivec3.end() ; ++i)
   {
       cout<<*i<<endl;
   }

   //use replace_copy and back_inserter
   replace_copy(ivec1.begin(),ivec1.end(),back_inserter(ivec4),3,3);
   cout<<"use replace_copy and back_inserter"<<endl;
   for(list<int>::iterator i = ivec4.begin() ; i != ivec4.end() ; ++i)
   {
       cout<<*i<<endl;
   }

   //use replace_copy and front_inserter

   replace_copy(ivec1.begin(),ivec1.end(),front_inserter(ivec5),4,4);
   cout<<"use replace_copy and front_inserter"<<endl;
   for(list<int>::iterator i = ivec5.begin() ; i != ivec5.end() ; ++i)
   {
       cout<<*i<<endl;
   }

   return 0;
}

上面代码前面几个都输出0，1，2，3，4，5，6，7，8，9

最后一个使用front_inserter 的会输出9,8,7,6,5,4,3,2,1,0