顺序容器

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<array>
using namespace std;
int main(){
    stringstream ss;
    string v;
    char vable='c';
    //char* acc="abc";
    int i;
    list<int> ilist;
    
    for(auto ix=0;ix!=4;++ix){
        ilist.push_front(ix);
    }
    list<int>::const_iterator a=ilist.cbegin();
    list<int>::const_iterator b=ilist.cend();
    list<char*> word(1,"ab");
    list<string> str(1,"cd");
    str.assign(word.begin(),word.end());    //assign可相容类型的替换 swap 不可替换 
    for(auto iw=str.begin();iw!=str.end();++iw)cout<<*iw<<endl;
    list<int> c(a,b);
    array<int,10> a1={0,1,2,3,4,5,6};
    array<int,10> a2={0};
    swap(a1,a2);
    for(auto ia=a1.begin();ia!=a1.end();++ia){
        cout<<*ia<<endl;
    }
    for(i=0;i<5;i++){
        v.push_back(vable);
        v+=to_string(i);
            }
    cout<<v<<endl; 
    cout<<ss.str()<<endl;
    for(auto ix=c.begin();ix!=c.end();++ix)
    {
        cout<<*ix<<endl;
        
    }
        for(auto ix=ilist.rbegin();ix!=ilist.rend();++ix)
    {
         cout<<*ix<<endl;
        
    }
    return 0;
} 

后续添加说明.

posted @ 2017-03-08 15:36  all_is_we1l  阅读(114)  评论(0)    收藏  举报