C++ STL front_inserter back_inserter inserter 插入型迭代器的正确打开方式

最新推荐文章于 2022-04-06 16:03:37 发布

Ibelievesunshine

最新推荐文章于 2022-04-06 16:03:37 发布

阅读量391

点赞数

分类专栏： C/C++ STL 文章标签：插入型迭代器 Inserter front_inserter back_inserter

文章版权归作者所有，请不要随意转载抄袭，情节严重，追究法律责任！！

本文链接：https://blog.csdn.net/Ibelievesunshine/article/details/80295842

版权

C/C++ 同时被 2 个专栏收录

47 篇文章 2 订阅

订阅专栏

STL

36 篇文章 1 订阅

订阅专栏

#include <iostream>
#include <deque>
#include <algorithm>
#include <iterator>
using namespace std;

int main()
{
    int dim[]={1,2,3,4,5,6};
    deque<int> d1;
    copy(dim,dim+6,back_inserter(d1));  //初始化d1
    cout<<"d1:"<<endl;
    copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,","));  //输出d1
    cout<<endl;
    front_inserter(d1)=11;  //前端插入
    front_inserter(d1)=22;
    cout<<"after front_inserter:"<<endl;
    copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,","));  //输出d1
    cout<<endl;
    copy(d1.begin(),d1.end(),front_inserter(d1));  //d1中所有元素皆前向插入d1中
    cout<<"after many front_inserter:"<<endl;
    copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,","));  //输出d1
    cout<<endl;
    inserter(d1,d1.end()-3)=33;  //d1倒数第四位插入33
    inserter(d1,d1.begin())=44;  //d1开头插入44
    cout<<"after inserter:"<<endl;
    copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,","));  //输出d1
    cout<<endl;
    return 0;
}